Home
last modified time | relevance | path

Searched refs:m_L (Results 76 – 100 of 196) sorted by relevance

12345678

/dports/graphics/blender/blender-2.91.0/extern/audaspace/src/fx/
H A DConvolverReader.cpp38 m_M = m_L = m_N / 2; in ConvolverReader()
48 m_vecInOut.push_back((sample_t*)std::malloc(m_L*sizeof(sample_t))); in ConvolverReader()
49 m_outBuffer = (sample_t*)std::malloc(m_L*m_inChannels*sizeof(sample_t)); in ConvolverReader()
50 m_outBufLen = m_eOutBufLen = m_outBufferPos = m_L*m_inChannels; in ConvolverReader()
137 m_lastLengthIn = m_L; in loadBuffer()
154 int len = m_lastLengthIn = m_L; in loadBuffer()
H A DConvolver.cpp26 …m_N(plan->getSize()), m_M(plan->getSize()/2), m_L(plan->getSize()/2), m_irBuffers(ir), m_irLength(… in Convolver()
61 if(length > m_L) in getNext()
84 std::memset(outBuffer, 0, m_L*sizeof(sample_t)); in getNext()
89 length = m_L; in getNext()
/dports/math/cantor/cantor-21.12.3/src/backends/lua/
H A Dluacompletionobject.cpp18 m_L = session->getState(); in LuaCompletionObject()
20 m_L = nullptr; in LuaCompletionObject()
46 setCompletions( luahelper_completion(m_L, name) ); in fetchCompletions()
H A Dluasession.cpp24 m_L(nullptr), in LuaSession()
61 m_L = luaL_newstate(); in login()
62 luaL_openlibs(m_L); in login()
281 return m_L; in getState()
/dports/games/ultimatestunts/ultimatestunts-srcdata-0771/trackedit/
H A Dtrackdocument.cpp70 if(x > track->m_L-1) x = track->m_L-1; in moveCursor()
205 for(int i=0; i < track.m_L*track.m_W*track.m_H; i++) in deleteTile()
242 for(int i=0; i < track.m_L*track.m_W*track.m_H; i++) in deleteUnusedTiles()
268 for(int i=0; i < track.m_L*track.m_W*track.m_H; i++) in deleteUnusedTiles()
/dports/math/gismo/gismo-21.12.0/extensions/gsStructuralAnalysis/
H A DgsALMLoadControl.hpp41 m_DeltaL = m_L = 0.0; in initMethods()
87 m_Lprev = m_L; in iterationFinish()
89 m_L += m_DeltaL; in iterationFinish()
126 gsInfo<<std::setw(17)<<std::left<<(m_L + m_DeltaL); in stepOutput()
H A DgsStaticDR.h76 m_L = 1.0; in gsStaticDR()
79 return m_ALresidualFun(x,m_L); in gsStaticDR()
151 using Base::m_L;
H A DgsALMCrisfield.hpp45 m_DeltaL = m_L = 0.0; in initMethods()
141 m_phi = math::pow(m_U.dot(m_U)/( math::pow(m_L,2) * m_forcing.dot(m_forcing) ),0.5); in predictor()
162 m_Lprev = m_L; in iterationFinish()
164 m_L += m_DeltaL; in iterationFinish()
282 T DeltaLcr = Lcr - m_L; in computeLambdasComplex()
484 gsInfo<<std::setw(17)<<std::left<<(m_L + m_DeltaL); in stepOutput()
H A DgsStaticNewton.h112 m_L = 1.0; in gsStaticNewton()
115 return m_ALresidualFun(x,m_L); in gsStaticNewton()
217 using Base::m_L;
H A DgsStaticBase.h89 void setLoad(const T L) { m_L = L;} in setLoad()
118 m_L = m_DeltaL = m_deltaL = 0.0; in reset()
205 T m_L, m_DeltaL, m_deltaL; variable
/dports/graphics/pcl-pointclouds/pcl-pcl-1.12.0/surface/src/3rdparty/opennurbs/
H A Dopennurbs_brep_isvalid.cpp212 const ON_BrepLoop& loop = m_L[li]; in IsValidFaceTopology()
878 const ON_BrepLoop& loop = m_L[trim.m_li]; in IsValidTrimTopology()
979 const int loop_count = m_L.Count(); in IsValidTopology()
1172 if ( m_L[li].m_loop_index == -1 ) in IsValidTopology()
1174 const ON_BrepLoop& loop = m_L[li]; in IsValidTopology()
1190 else if ( m_L[li].m_loop_index != li ) in IsValidTopology()
1286 const ON_BrepLoop& loop = m_L[li]; in IsValidTopology()
1488 const int loop_count = m_L.Count(); in IsValidGeometry()
1609 if ( m_L[li].m_loop_index == -1 ) in IsValidGeometry()
1787 const int loop_count = m_L.Count(); in IsValidTolerancesAndFlags()
[all …]
H A Dopennurbs_brep.cpp1209 sz += m_L.SizeOf(); in SizeOf()
1929 m_L.Append( b.m_L.Count(), b.m_L.Array() ); in Append()
2055 int li = m_L.Count(); in NewLoop()
2056 m_L.Reserve(li+1); in NewLoop()
2057 m_L.SetCount(li+1); in NewLoop()
8852 m_L.Destroy(); in CullUnusedLoops()
8900 m_L.Shrink(); in CullUnusedLoops()
9352 m_L.SetCapacity(src.m_L.Count()); in operator =()
9358 m_L.SetCount(src.m_L.Count()); in operator =()
9422 m_L[i] = src.m_L[i]; in operator =()
[all …]
H A Dopennurbs_brep_io.cpp730 loop_count = brep.m_L.Count(); in ReadFillInMissingBoxes()
838 rc = m_L.Read(file); in Read()
843 m_L[i].m_brep = this; in Read()
1038 m_L.Reserve(loop_count); in ReadOld200()
1311 m_L.Reserve(sz); in ReadOld100()
1313 m_L.AppendNew(); in ReadOld100()
1314 m_L[i].Read(file); in ReadOld100()
1422 m_L.Reserve(count); in ReadOld101()
1423 m_L.SetCount(count); in ReadOld101()
1426 m_L[i].Read(file); in ReadOld101()
[all …]
/dports/math/gismo/gismo-21.12.0/external/onurbs/
H A Dopennurbs_brep_isvalid.cpp212 const ON_BrepLoop& loop = m_L[li]; in IsValidFaceTopology()
878 const ON_BrepLoop& loop = m_L[trim.m_li]; in IsValidTrimTopology()
979 const int loop_count = m_L.Count(); in IsValidTopology()
1172 if ( m_L[li].m_loop_index == -1 ) in IsValidTopology()
1174 const ON_BrepLoop& loop = m_L[li]; in IsValidTopology()
1190 else if ( m_L[li].m_loop_index != li ) in IsValidTopology()
1286 const ON_BrepLoop& loop = m_L[li]; in IsValidTopology()
1488 const int loop_count = m_L.Count(); in IsValidGeometry()
1609 if ( m_L[li].m_loop_index == -1 ) in IsValidGeometry()
1787 const int loop_count = m_L.Count(); in IsValidTolerancesAndFlags()
[all …]
H A Dopennurbs_brep.cpp1209 sz += m_L.SizeOf(); in SizeOf()
1954 m_L.Append( b.m_L.Count(), b.m_L.Array() ); in Append()
2080 int li = m_L.Count(); in NewLoop()
2081 m_L.Reserve(li+1); in NewLoop()
2082 m_L.SetCount(li+1); in NewLoop()
8921 m_L.Destroy(); in CullUnusedLoops()
8969 m_L.Shrink(); in CullUnusedLoops()
9421 m_L.SetCapacity(src.m_L.Count()); in operator =()
9427 m_L.SetCount(src.m_L.Count()); in operator =()
9491 m_L[i] = src.m_L[i]; in operator =()
[all …]
H A Dopennurbs_brep_io.cpp741 loop_count = brep.m_L.Count(); in ReadFillInMissingBoxes()
849 rc = m_L.Read(file); in Read()
854 m_L[i].m_brep = this; in Read()
1049 m_L.Reserve(loop_count); in ReadOld200()
1322 m_L.Reserve(sz); in ReadOld100()
1324 m_L.AppendNew(); in ReadOld100()
1325 m_L[i].Read(file); in ReadOld100()
1433 m_L.Reserve(count); in ReadOld101()
1434 m_L.SetCount(count); in ReadOld101()
1437 m_L[i].Read(file); in ReadOld101()
[all …]
/dports/devel/sol2/sol2-4.0.0-alpha/include/sol/
H A Dstack_reference.hpp242 stateless_stack_reference_equals(lua_State* L_) noexcept : m_L(L_) { in stateless_stack_reference_equals()
246 return m_L; in lua_state()
262 lua_State* m_L; member
286 stateless_stack_reference_hash(lua_State* L_) noexcept : m_L(L_) { in stateless_stack_reference_hash()
290 return m_L; in lua_state()
299 lua_State* m_L; member
/dports/emulators/mess/mame-mame0226/src/devices/cpu/i8008/
H A Di8008.cpp65 save_item(NAME(m_L)); in device_start()
93 state_add(I8008_L, "L", m_L); in device_start()
127 m_A = m_B = m_C = m_D = m_E = m_H = m_L = 0; in device_reset()
618 case 6 : retVal = m_L; break; in get_reg()
619 default: retVal = m_program.read_byte((m_H << 8) + m_L); break; in get_reg()
633 case 6 : m_L = val; break; in set_reg()
634 default: m_program.write_byte((m_H << 8) + m_L, val); break; in set_reg()
/dports/emulators/mame/mame-mame0226/src/devices/cpu/i8008/
H A Di8008.cpp65 save_item(NAME(m_L)); in device_start()
93 state_add(I8008_L, "L", m_L); in device_start()
127 m_A = m_B = m_C = m_D = m_E = m_H = m_L = 0; in device_reset()
618 case 6 : retVal = m_L; break; in get_reg()
619 default: retVal = m_program.read_byte((m_H << 8) + m_L); break; in get_reg()
633 case 6 : m_L = val; break; in set_reg()
634 default: m_program.write_byte((m_H << 8) + m_L, val); break; in set_reg()
/dports/games/ultimatestunts/ultimatestunts-srcdata-0771/simulation/
H A Dtrack.cpp27 m_L = m_W = m_H = 0; in CTrack()
50 m_L = tfile.readl().toInt(); in load()
173 m_Track.resize(m_L * m_W * m_H); in load()
186 for(int x=0; x<m_L; x++) in load()
346 m_L = m_W = m_H = 0; in unload()
/dports/misc/dartsim/dart-6.11.1/dart/external/odelcpsolver/
H A Dlcp.cpp480 dReal *Lrow = m_L; in dLCP()
484 dFactorLDLT (m_L,m_d,nub,m_nskip); in dLCP()
486 dSolveLDLT (m_L,m_d,m_x,nub,m_nskip); in dLCP()
531 dReal *const Ltgt = m_L + nC*m_nskip, *ell = m_ell; in transfer_i_to_C()
549 checkFactorization (m_A,m_L,m_d,m_nC,m_C,m_nskip); in transfer_i_to_C()
575 dSolveL1 (m_L,m_Dell,m_nC,m_nskip); in transfer_i_from_N_to_C()
578 dReal *const Ltgt = m_L + nC*m_nskip; in transfer_i_from_N_to_C()
604 checkFactorization (m_A,m_L,m_d,m_nC,m_C,m_nskip); in transfer_i_from_N_to_C()
650 checkFactorization (m_A,m_L,m_d,m_nC,m_C,m_nskip); in transfer_i_from_C_to_N()
729 dSolveL1 (m_L,m_Dell,m_nC,m_nskip); in solve1()
[all …]
/dports/devel/ode/ode-0.13/ode/src/
H A Dlcp.cpp411 m_L(_L), m_d(_d), m_Dell(_Dell), m_ell(_ell), m_tmp(_tmp), in dLCP()
480 dReal *Lrow = m_L; in dLCP()
484 dFactorLDLT (m_L,m_d,nub,m_nskip); in dLCP()
486 dSolveLDLT (m_L,m_d,m_x,nub,m_nskip); in dLCP()
549 checkFactorization (m_A,m_L,m_d,m_nC,m_C,m_nskip); in transfer_i_to_C()
575 dSolveL1 (m_L,m_Dell,m_nC,m_nskip); in transfer_i_from_N_to_C()
578 dReal *const Ltgt = m_L + nC*m_nskip; in transfer_i_from_N_to_C()
604 checkFactorization (m_A,m_L,m_d,m_nC,m_C,m_nskip); in transfer_i_from_N_to_C()
650 checkFactorization (m_A,m_L,m_d,m_nC,m_C,m_nskip); in transfer_i_from_C_to_N()
729 dSolveL1 (m_L,m_Dell,m_nC,m_nskip); in solve1()
[all …]
/dports/emulators/mess/mame-mame0226/src/devices/cpu/lr35902/
H A Dlr35902.cpp77 , m_L(0) in lr35902_cpu_device()
155 save_item(NAME(m_L)); in device_start()
179 state_add( LR35902_L, "L", m_L ).callimport().callexport().formatstr("%02X"); in device_start()
220 m_L = 0x00; in device_reset()
/dports/emulators/mame/mame-mame0226/src/devices/cpu/lr35902/
H A Dlr35902.cpp77 , m_L(0) in lr35902_cpu_device()
155 save_item(NAME(m_L)); in device_start()
179 state_add( LR35902_L, "L", m_L ).callimport().callexport().formatstr("%02X"); in device_start()
220 m_L = 0x00; in device_reset()
/dports/graphics/dbow2/DBoW2-1.1-free-23-g3924753/include/DBoW2/
H A DTemplatedVocabulary.h179 inline int getDepthLevels() const { return m_L; } in getDepthLevels()
409 int m_L; variable
538 this->m_L = voc.m_L;
564 (int)((pow((double)m_k, (double)m_L + 1) - 1)/(m_k - 1)); in create()
595 m_L = L; in create()
608 m_L = L; in create()
794 if(current_level < m_L) in HKmeansStep()
922 m_words.reserve( (int)pow((double)m_k, (double)m_L) ); in createWords()
1224 const int nid_level = m_L - levelsup; in transform()
1392 f << "L" << m_L; in save()
[all …]

12345678