Home
last modified time | relevance | path

Searched refs:m_count (Results 126 – 150 of 4735) sorted by relevance

12345678910>>...190

/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/ndb/src/kernel/vm/
H A DDLCHashTable.hpp41 m_count(0) in DLCHashTable()
45 Uint32 count() const { return m_count; } in count()
51 m_count++; in add()
56 m_count--; in remove()
61 m_count--; in remove()
66 m_count--; in remove()
71 m_count = 0; in removeAll()
76 m_count--; in release()
81 m_count--; in release()
86 m_count--; in release()
[all …]
/dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/include/tcg/
H A Dface.h59 int m_e[N], m_count;
64 FaceN(int (&edges)[N]) : m_index(-1), m_count(0) { in FaceN()
65 std::copy(edges, edges + N, m_e), m_count = N; in FaceN()
73 assert(e < m_count); in edge()
77 assert(e < m_count); in edge()
80 int edgesCount() const { return m_count; } in edgesCount()
83 assert(m_count < N); in addEdge()
84 m_e[m_count++] = idx; in addEdge()
87 assert(e < m_count); in setEdge()
92 m_e[--m_count] = -1; in eraseEdge()
[all …]
/dports/devel/juce/JUCE-f37e9a1/modules/juce_box2d/box2d/Collision/Shapes/
H A Db2ChainShape.cpp28 m_count = 0; in ~b2ChainShape()
35 m_count = count + 1; in CreateLoop()
39 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
49 m_count = count; in CreateChain()
72 clone->CreateChain(m_vertices, m_count); in Clone()
83 return m_count - 1; in GetChildCount()
106 if (index < m_count - 2) in GetChildEdge()
128 b2Assert(childIndex < m_count); in RayCast()
134 if (i2 == m_count) in RayCast()
147 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/devel/love08/love-0.8.0/src/libraries/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp29 m_count = 0; in ~b2ChainShape()
36 m_count = count + 1; in CreateLoop()
40 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
50 m_count = count; in CreateChain()
73 clone->CreateChain(m_vertices, m_count); in Clone()
84 return m_count - 1; in GetChildCount()
107 if (index < m_count - 2) in GetChildEdge()
129 b2Assert(childIndex < m_count); in RayCast()
135 if (i2 == m_count) in RayCast()
148 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/box2d/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp29 m_count = 0; in ~b2ChainShape()
36 m_count = count + 1; in CreateLoop()
40 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
50 m_count = count; in CreateChain()
73 clone->CreateChain(m_vertices, m_count); in Clone()
84 return m_count - 1; in GetChildCount()
107 if (index < m_count - 2) in GetChildEdge()
129 b2Assert(childIndex < m_count); in RayCast()
135 if (i2 == m_count) in RayCast()
148 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/net/mpich/mpich-3.4.3/modules/ucx/test/gtest/ucs/
H A Dtest_arbiter.cc142 m_count++; in desched_group()
149 m_count++; in remove_elem()
298 m_count = 0; in UCS_TEST_F()
373 m_count = 0; in UCS_TEST_F()
383 m_count = 0; in UCS_TEST_F()
480 m_count = 0; in UCS_TEST_F()
539 m_count = 0; in UCS_TEST_F()
543 m_count = 0; in UCS_TEST_F()
547 m_count = 0; in UCS_TEST_F()
578 m_count = 0; in UCS_TEST_F()
[all …]
/dports/games/kolf/kolf-21.12.3/external/Box2D/Collision/
H A Db2Distance.cpp36 m_count = 1; in Set()
66 m_count = 2; in Set()
75 m_count = 2; in Set()
144 m_count = 1; in ReadCache()
307 m_count = 1; in Solve2()
317 m_count = 1; in Solve2()
326 m_count = 2; in Solve2()
381 m_count = 1; in Solve3()
391 m_count = 2; in Solve3()
401 m_count = 2; in Solve3()
[all …]
/dports/games/libretro-uae/libretro-uae-8333daa/sources/src/archivers/chd/
H A Dcoretmpl.h64 m_count(0), in m_array()
65 m_allocated(0) { if (initial != 0) expand_internal(initial); m_count = initial; } in m_array()
71 _ElementType &operator[](int index) { assert(index < m_count); return m_array[index]; }
72 const _ElementType &operator[](int index) const { assert(index < m_count); return m_array[index]; }
75 int count() const { return m_count; } in count()
78 …tType &element) { if (m_count == m_allocated) expand_internal((m_allocated == 0) ? 16 : (m_allocat… in append()
79 void reset() { delete[] m_array; m_array = NULL; m_count = m_allocated = 0; } in reset()
80 …l keepdata = false) { if (count > m_allocated) expand_internal(count, keepdata); m_count = count; }
90 for (int index = 0; index < m_count; index++)
98 int m_count; // number of objects accessed in the list variable
/dports/misc/box2d/box2d-2.4.1/src/collision/
H A Db2_chain_shape.cpp40 m_count = 0; in Clear()
60 m_count = count + 1; in CreateLoop()
64 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
78 m_count = count; in CreateChain()
97 return m_count - 1; in GetChildCount()
102 b2Assert(0 <= index && index < m_count - 1); in GetChildEdge()
119 if (index < m_count - 2) in GetChildEdge()
139 b2Assert(childIndex < m_count); in RayCast()
145 if (i2 == m_count) in RayCast()
158 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/devel/love/love-11.3/src/libraries/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp33 m_count = 0; in Clear()
48 m_count = count + 1; in CreateLoop()
52 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
68 m_count = count; in CreateChain()
95 clone->CreateChain(m_vertices, m_count); in Clone()
106 return m_count - 1; in GetChildCount()
129 if (index < m_count - 2) in GetChildEdge()
151 b2Assert(childIndex < m_count); in RayCast()
157 if (i2 == m_count) in RayCast()
170 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/devel/love10/love-0.10.2/src/libraries/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp33 m_count = 0; in Clear()
48 m_count = count + 1; in CreateLoop()
52 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
68 m_count = count; in CreateChain()
95 clone->CreateChain(m_vertices, m_count); in Clone()
106 return m_count - 1; in GetChildCount()
129 if (index < m_count - 2) in GetChildEdge()
151 b2Assert(childIndex < m_count); in RayCast()
157 if (i2 == m_count) in RayCast()
170 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Box2D/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp33 m_count = 0; in Clear()
53 m_count = count + 1; in CreateLoop()
57 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
73 m_count = count; in CreateChain()
100 clone->CreateChain(m_vertices, m_count); in Clone()
111 return m_count - 1; in GetChildCount()
134 if (index < m_count - 2) in GetChildEdge()
156 b2Assert(childIndex < m_count); in RayCast()
162 if (i2 == m_count) in RayCast()
175 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/graphics/py-box2d-py/box2d-py-2.3.8/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp29 m_count = 0; in ~b2ChainShape()
44 m_count = count + 1; in CreateLoop()
48 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
66 m_count = count; in CreateChain()
90 clone->CreateChain(m_vertices, m_count); in Clone()
101 return m_count - 1; in GetChildCount()
124 if (index < m_count - 2) in GetChildEdge()
146 b2Assert(childIndex < m_count); in RayCast()
152 if (i2 == m_count) in RayCast()
165 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/games/openclaw/OpenClaw-0.0-51-gbac7730/Box2D/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp33 m_count = 0; in Clear()
53 m_count = count + 1; in CreateLoop()
57 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
73 m_count = count; in CreateChain()
100 clone->CreateChain(m_vertices, m_count); in Clone()
111 return m_count - 1; in GetChildCount()
134 if (index < m_count - 2) in GetChildEdge()
156 b2Assert(childIndex < m_count); in RayCast()
162 if (i2 == m_count) in RayCast()
175 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/games/emptyepsilon/SeriousProton-EE-2021.06.23/src/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp33 m_count = 0; in Clear()
48 m_count = count + 1; in CreateLoop()
52 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
68 m_count = count; in CreateChain()
95 clone->CreateChain(m_vertices, m_count); in Clone()
106 return m_count - 1; in GetChildCount()
129 if (index < m_count - 2) in GetChildEdge()
151 b2Assert(childIndex < m_count); in RayCast()
157 if (i2 == m_count) in RayCast()
170 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/x11-toolkits/qml-box2d/qml-box2d-21e57f/Box2D/Collision/Shapes/
H A Db2ChainShape.cpp33 m_count = 0; in Clear()
48 m_count = count + 1; in CreateLoop()
52 m_prevVertex = m_vertices[m_count - 2]; in CreateLoop()
68 m_count = count; in CreateChain()
95 clone->CreateChain(m_vertices, m_count); in Clone()
106 return m_count - 1; in GetChildCount()
129 if (index < m_count - 2) in GetChildEdge()
151 b2Assert(childIndex < m_count); in RayCast()
157 if (i2 == m_count) in RayCast()
170 b2Assert(childIndex < m_count); in ComputeAABB()
[all …]
/dports/emulators/mess/mame-mame0226/src/devices/machine/
H A Dtms6100.cpp64 m_count = 0; in device_start()
79 save_item(NAME(m_count)); in device_start()
174 m_count = 0; in handle_command()
179 if (m_count == 0) in handle_command()
202 if (m_count & 1) in handle_command()
209 m_count = (m_count + 1) & (m_4bit_mode ? 1 : 7); in handle_command()
212 if (m_count == 0) in handle_command()
223 m_count = 0; in handle_command()
229 if (m_count < 4) in handle_command()
235 m_count = (m_count + 1) & 7; in handle_command()
[all …]
/dports/emulators/mame/mame-mame0226/src/devices/machine/
H A Dtms6100.cpp64 m_count = 0; in device_start()
79 save_item(NAME(m_count)); in device_start()
174 m_count = 0; in handle_command()
179 if (m_count == 0) in handle_command()
202 if (m_count & 1) in handle_command()
209 m_count = (m_count + 1) & (m_4bit_mode ? 1 : 7); in handle_command()
212 if (m_count == 0) in handle_command()
223 m_count = 0; in handle_command()
229 if (m_count < 4) in handle_command()
235 m_count = (m_count + 1) & 7; in handle_command()
[all …]
/dports/editors/encryptpad/EncryptPad-0.5.0.1/deps/stlplus/containers/
H A Dsimple_ptr.tpp22 m_count(0)
30 m_count(0)
40 m_count(0)
48 m_count(r.m_count)
51 if (!m_count) {
72 if (m_count) {
265 m_count = r.m_count;
275 return m_count && (m_count == r.m_count);
281 return m_count ? *m_count : 1;
308 m_count = 0;
[all …]
/dports/audio/supercollider/SuperCollider-3.11.0-Source/external_libraries/nova-tt/nova-tt/
H A Dsemaphore_pthreads.hpp54 m_count(i) in semaphore()
70 ++m_count; in post()
78 while (m_count==0) in wait()
80 --m_count; in wait()
95 if (m_count == 0) in try_wait()
98 --m_count; in try_wait()
117 while (m_count < 1) { in timed_wait()
124 m_count--; in timed_wait()
132 return m_count; in value()
136 unsigned int m_count; member in nova::nova_tt::semaphore
H A Dsemaphore_boost_fallback.hpp45 m_count(i) in semaphore()
52 ++m_count; in post()
60 while (m_count==0) in wait()
62 --m_count; in wait()
77 if (m_count == 0) in try_wait()
80 --m_count; in try_wait()
105 if (m_count == 0) in timed_wait()
108 --m_count; in timed_wait()
121 return m_count; in value()
125 unsigned int m_count; member in nova::nova_tt::semaphore
/dports/lang/mono/mono-5.10.1.57/mcs/class/RabbitMQ.Client/src/util/
H A DSemaphore.cs69 private int m_count; field in RabbitMQ.Util.Semaphore
81 m_count = initialCount; in Semaphore()
91 if (m_count > 0) { in Wait()
92 m_count--; in Wait()
106 if (m_count > 0) { in TryWait()
107 m_count--; in TryWait()
119 m_count++; in Release()
133 return m_count;
/dports/math/gismo/gismo-21.12.0/external/onurbs/
H A Dopennurbs_array.cpp183 m_count = 0; in Create()
235 m_count = 0; in Create()
701 while ( m_count > 0 && ON_max_uuid == m_a[m_count-1] ) in SortHelper()
703 m_count--; in SortHelper()
724 m_count = 0; in Empty()
732 m_count = 0; in Destroy()
807 m_count = 0; in Read()
943 m_count = 0; in Empty()
1064 m_count = 0; in Empty()
1376 m_count = 0; in Create()
[all …]
/dports/astro/opencpn/OpenCPN-5.2.4/libs/texcmp/squish/
H A Dcolourset.cpp34 : m_count( 0 ), in ColourSet()
76 m_points[m_count] = Vec3( x, y, z ); in ColourSet()
78 m_remap[i] = m_count; in ColourSet()
81 ++m_count; in ColourSet()
109 for( int i = 0; i < m_count; ++i ) in ColourSet()
116 : m_count( 0 ), in ColourSet()
130 m_weights[m_count] = 1; in ColourSet()
131 m_remap[i] = m_count; in ColourSet()
134 ++m_count; in ColourSet()
168 for( int i = 0; i < m_count; ++i ) { in GetPoints()
[all …]
/dports/devel/libassa/libassa-3.5.1/assa/
H A DHandlers.h117 SIGUSR1Handler() : m_count(0) { in SIGUSR1Handler()
127 m_count++; in handle_signal()
128 DL((TRACE, "signal count = %d\n", m_count)); in handle_signal()
136 sig_atomic_t received_count() const { return m_count; } in received_count()
140 void resetState() { m_count = 0; } in resetState()
144 sig_atomic_t m_count;
155 SIGUSR2Handler() : m_count(0) { in SIGUSR2Handler()
165 m_count++; in handle_signal()
166 DL((TRACE, "signal count = %d\n", m_count)); in handle_signal()
178 void resetState() { m_count = 0; } in resetState()
[all …]

12345678910>>...190