Home
last modified time | relevance | path

Searched refs:m_nodes (Results 1 – 16 of 16) sorted by relevance

/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
Db2DynamicTree.cpp31 m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode)); in b2DynamicTree()
32 memset(m_nodes, 0, m_nodeCapacity * sizeof(b2TreeNode)); in b2DynamicTree()
37 m_nodes[i].next = i + 1; in b2DynamicTree()
38 m_nodes[i].height = -1; in b2DynamicTree()
40 m_nodes[m_nodeCapacity-1].next = b2_nullNode; in b2DynamicTree()
41 m_nodes[m_nodeCapacity-1].height = -1; in b2DynamicTree()
52 b2Free(m_nodes); in ~b2DynamicTree()
64 b2TreeNode* oldNodes = m_nodes; in AllocateNode()
66 m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode)); in AllocateNode()
67 memcpy(m_nodes, oldNodes, m_nodeCount * sizeof(b2TreeNode)); in AllocateNode()
[all …]
Db2DynamicTree.h144 b2TreeNode* m_nodes; variable
159 return m_nodes[proxyId].userData; in GetUserData()
165 return m_nodes[proxyId].aabb; in GetFatAABB()
182 const b2TreeNode* node = m_nodes + nodeId; in Query()
240 const b2TreeNode* node = m_nodes + nodeId; in RayCast()
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/
Dgim_hash_table.h198 gim_array< _node_type > m_nodes; variable
213 _node_type * nodesptr = m_nodes.pointer(); in _find_cell()
232 _node_type * nodesptr = m_nodes.pointer(); in _find_avaliable_cell()
300 _node_type * nodesptr = m_nodes.pointer(); in _rehash()
301 for(GUINT i=0;i<(GUINT)m_nodes.size();i++) in _rehash()
361 if(index >= m_nodes.size()) return false; in _erase_by_index_hash_table()
362 if(m_nodes[index].m_key != GIM_INVALID_HASH) in _erase_by_index_hash_table()
365 GUINT cell_index = _find_cell(m_nodes[index].m_key); in _erase_by_index_hash_table()
414 m_hash_table[cell_index] = m_nodes.size(); in _insert_hash_table()
441 m_nodes[value_key] = _node_type(hashkey,value); in _insert_hash_table_replace()
[all …]
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/
DbtSoftBody.cpp39 m_nodes.resize(node_count); in btSoftBody()
42 Node& n=m_nodes[i]; in btSoftBody()
133 return(checkLink(&m_nodes[node0],&m_nodes[node1])); in checkLink()
155 const Node* n[]={ &m_nodes[node0], in checkFace()
156 &m_nodes[node1], in checkFace()
157 &m_nodes[node2]}; in checkFace()
203 n.m_nodes[0] = n0;n.m_rank+=n0?1:0; in appendNote()
204 n.m_nodes[1] = n1;n.m_rank+=n1?1:0; in appendNote()
205 n.m_nodes[2] = n2;n.m_rank+=n2?1:0; in appendNote()
206 n.m_nodes[3] = n3;n.m_rank+=n3?1:0; in appendNote()
[all …]
DbtSoftBodyHelpers.cpp183 vertices.resize(psb->m_clusters[i]->m_nodes.size()); in Draw()
186 vertices[j]=psb->m_clusters[i]->m_nodes[j]->m_x; in Draw()
240 for(int j=0;j<psb->m_clusters[i].m_nodes.size();++j) in Draw()
243 const btVector3 r=c.m_nodes[j]->m_x-c.m_com; in Draw()
245 idraw->drawLine(c.m_nodes[j]->m_x,c.m_nodes[j]->m_x+v,btVector3(1,0,0)); in Draw()
260 for(i=0;i<psb->m_nodes.size();++i) in Draw()
262 const btSoftBody::Node& n=psb->m_nodes[i]; in Draw()
282 for(i=0;i<psb->m_nodes.size();++i) in Draw()
284 const btSoftBody::Node& n=psb->m_nodes[i]; in Draw()
357 for(i=0;i<psb->m_nodes.size();++i) in Draw()
[all …]
DbtDefaultSoftBodySolver.cpp88 const btAlignedObjectArray<btSoftBody::Node> &clothVertices( softBody->m_nodes ); in copySoftBodyToVertexBuffer()
DbtSoftBodyData.h197 SoftBodyNodeData *m_nodes; member
DbtSoftBody.h302 Node* m_nodes[4]; // Nodes member
322 btAlignedObjectArray<Node*> m_nodes; member
656 tNodeArray m_nodes; // Nodes variable
DbtSoftBodyInternals.h128 btSoftBody::Node* const * n=&m_cluster->m_nodes[0]; in localGetSupportingVertex()
131 for(int i=1,ni=m_cluster->m_nodes.size();i<ni;++i) in localGetSupportingVertex()
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/
DDynamicTree.java49 private DynamicTreeNode[] m_nodes; field in DynamicTree
63 m_nodes = new DynamicTreeNode[16]; in DynamicTree()
67 m_nodes[i] = new DynamicTreeNode(i); in DynamicTree()
68 m_nodes[i].parent = (i == m_nodeCapacity - 1) ? null : m_nodes[i + 1]; in DynamicTree()
69 m_nodes[i].height = -1; in DynamicTree()
99 DynamicTreeNode node = m_nodes[proxyId]; in destroyProxy()
110 final DynamicTreeNode node = m_nodes[proxyId]; in moveProxy()
152 return m_nodes[proxyId].userData; in getUserData()
158 return m_nodes[proxyId].aabb; in getFatAABB()
331 DynamicTreeNode freeNode = m_freeList != NULL_NODE ? m_nodes[m_freeList] : null; in validate()
[all …]
/external/libgdx/extensions/gdx-bullet/jni/swig/softbody/
DbtSoftBody.i54 result->m_nodes.resize(numVertices); in btSoftBody()
60 if (result->m_nodes[j].m_x==point) { in btSoftBody()
66 btSoftBody::Node &node = result->m_nodes[nodeCount]; in btSoftBody()
84 result->m_nodes.resize(nodeCount); in btSoftBody()
113 return $self->m_nodes.size(); in getNodeCount()
117 return &($self->m_nodes[idx]); in getNode()
131 const float *src = $self->m_nodes[i].m_x.m_floats; in getVertices()
144 const float * const &point = $self->m_nodes[pidx].m_x.m_floats; in getVertices()
159 const float * const &point = $self->m_nodes[pidx].m_x.m_floats; in getVertices()
160 const float * const &normal = $self->m_nodes[pidx].m_n.m_floats; in getVertices()
[all …]
/external/testng/src/main/java/org/testng/internal/
DGraph.java22 private Map<T, Node<T>> m_nodes = Maps.newLinkedHashMap(); field in Graph
32 m_nodes.put(tm, new Node<>(tm)); in addNode()
45 return m_nodes.get(object); in findNode()
78 return m_nodes.values(); in getNodes()
82 return m_nodes.keySet(); in getNodeValues()
159 List<Node<T>> list = Lists.newArrayList(m_nodes.values()); in initializeIndependentNodes()
246 for (T node : m_nodes.keySet()) { in toString()
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
DDOM2DTM.java104 protected Vector m_nodes = new Vector(); field in DOM2DTM
185 int nodeIndex = m_nodes.size(); in addNode()
246 m_nodes.addElement(node); in addNode()
316 return m_nodes.size(); in getNumberOfNodes()
456 for(int i=0;i<m_nodes.size();++i) in nextNode()
609 return (Node) m_nodes.elementAt(identity); in getNode()
621 return (Node) m_nodes.elementAt(nodeIdentity); in lookupNode()
636 if (identity >= m_nodes.size()) in getNextNodeIdentity()
668 int len = m_nodes.size(); in getHandleFromNode()
675 if (m_nodes.elementAt(i) == node) in getHandleFromNode()
[all …]
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
DbtDbvt.cpp729 btAlignedObjectArray<Node> m_nodes; member
750 btAlignedObjectArray<Node> m_nodes; member
1193 policy.m_nodes.reserve(cfgLeaves); in benchmark()
1199 policy.m_nodes.resize(0); in benchmark()
1201 policy.m_nodes.quickSort(btDbvtBenchmark::P14::sortfnc); in benchmark()
1220 policy.m_nodes.reserve(cfgLeaves); in benchmark()
1226 policy.m_nodes.resize(0); in benchmark()
1229 policy.m_nodes.quickSort(btDbvtBenchmark::P15::sortfnc); in benchmark()
/external/libgdx/extensions/gdx-bullet/jni/src/extras/Serialize/BulletFileLoader/autogenerated/
Dbullet.h1329 SoftBodyNodeData *m_nodes; variable
/external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/
Dsoftbody_wrap.cpp1904 result->m_nodes.resize(numVertices); in new_btSoftBody__SWIG_2()
1910 if (result->m_nodes[j].m_x==point) { in new_btSoftBody__SWIG_2()
1916 btSoftBody::Node &node = result->m_nodes[nodeCount]; in new_btSoftBody__SWIG_2()
1934 result->m_nodes.resize(nodeCount); in new_btSoftBody__SWIG_2()
1962 return self->m_nodes.size(); in btSoftBody_getNodeCount()
1965 return &(self->m_nodes[idx]); in btSoftBody_getNode()
1972 const float *src = self->m_nodes[i].m_x.m_floats; in btSoftBody_getVertices__SWIG_0()
1984 const float * const &point = self->m_nodes[pidx].m_x.m_floats; in btSoftBody_getVertices__SWIG_1()
1998 const float * const &point = self->m_nodes[pidx].m_x.m_floats; in btSoftBody_getVertices__SWIG_2()
1999 const float * const &normal = self->m_nodes[pidx].m_n.m_floats; in btSoftBody_getVertices__SWIG_2()
[all …]