Searched defs:m_nodeCapacity (Results 1 - 3 of 3) sorted by relevance

/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
H A Db2DynamicTree.h146 int32 m_nodeCapacity; member in class:b2DynamicTree
158 b2Assert(0 <= proxyId && proxyId < m_nodeCapacity);
164 b2Assert(0 <= proxyId && proxyId < m_nodeCapacity);
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/
H A DDynamicTree.java51 private int m_nodeCapacity; field in class:DynamicTree
62 m_nodeCapacity = 16;
66 for (int i = m_nodeCapacity - 1; i >= 0; i--) {
68 m_nodes[i].parent = (i == m_nodeCapacity - 1) ? null : m_nodes[i + 1];
98 assert (0 <= proxyId && proxyId < m_nodeCapacity);
109 assert (0 <= proxyId && proxyId < m_nodeCapacity);
151 assert (0 <= proxyId && proxyId < m_nodeCapacity);
157 assert (0 <= proxyId && proxyId < m_nodeCapacity);
313 assert (0 <= node.id && node.id < m_nodeCapacity);
333 assert (0 <= freeNode.id && freeNode.id < m_nodeCapacity);
[all...]
H A DDynamicTreeFlatNodes.java51 private int m_nodeCapacity; field in class:DynamicTreeFlatNodes
60 m_nodeCapacity = 16;
61 expandBuffers(0, m_nodeCapacity);
105 assert (0 <= proxyId && proxyId < m_nodeCapacity);
114 assert (0 <= proxyId && proxyId < m_nodeCapacity);
316 assert (0 <= node && node < m_nodeCapacity);
336 assert (0 <= freeNode && freeNode < m_nodeCapacity);
342 assert (m_nodeCount + freeCount == m_nodeCapacity);
356 for (int i = 0; i < m_nodeCapacity; ++i) {
382 for (int i = 0; i < m_nodeCapacity;
[all...]

Completed in 609 milliseconds