| /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
| b2DynamicTree.cpp | 31 m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));
32 memset(m_nodes, 0, m_nodeCapacity * sizeof(b2TreeNode));
37 m_nodes[i].next = i + 1;
38 m_nodes[i].height = -1;
40 m_nodes[m_nodeCapacity-1].next = b2_nullNode;
41 m_nodes[m_nodeCapacity-1].height = -1;
52 b2Free(m_nodes);
64 b2TreeNode* oldNodes = m_nodes;
66 m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));
67 memcpy(m_nodes, oldNodes, m_nodeCount * sizeof(b2TreeNode))
[all...] |
| b2DynamicTree.h | 144 b2TreeNode* m_nodes; member in class:b2DynamicTree
159 return m_nodes[proxyId].userData;
165 return m_nodes[proxyId].aabb;
182 const b2TreeNode* node = m_nodes + nodeId;
240 const b2TreeNode* node = m_nodes + nodeId;
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| gim_hash_table.h | 184 <li> if node_size = 0, then this container becomes a simple sorted array allocator. reserve_size is used for reserve memory in m_nodes.
197 //array< _node_type, SuperAllocator<_node_type> > m_nodes;
198 gim_array< _node_type > m_nodes; member in class:gim_hash_table
199 //SuperBufferedArray< _node_type > m_nodes;
202 ///Hash table data management. The hash table has the indices to the corresponding m_nodes array
213 _node_type * nodesptr = m_nodes.pointer();
232 _node_type * nodesptr = m_nodes.pointer();
300 _node_type * nodesptr = m_nodes.pointer();
301 for(GUINT i=0;i<(GUINT)m_nodes.size();i++)
361 if(index >= m_nodes.size()) return false
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| btSoftBody.cpp | 39 m_nodes.resize(node_count);
42 Node& n=m_nodes[i];
133 return(checkLink(&m_nodes[node0],&m_nodes[node1]));
155 const Node* n[]={ &m_nodes[node0],
156 &m_nodes[node1],
157 &m_nodes[node2]};
203 n.m_nodes[0] = n0;n.m_rank+=n0?1:0;
204 n.m_nodes[1] = n1;n.m_rank+=n1?1:0;
205 n.m_nodes[2] = n2;n.m_rank+=n2?1:0
[all...] |
| btSoftBodyHelpers.cpp | 183 vertices.resize(psb->m_clusters[i]->m_nodes.size());
186 vertices[j]=psb->m_clusters[i]->m_nodes[j]->m_x;
240 for(int j=0;j<psb->m_clusters[i].m_nodes.size();++j)
243 const btVector3 r=c.m_nodes[j]->m_x-c.m_com;
245 idraw->drawLine(c.m_nodes[j]->m_x,c.m_nodes[j]->m_x+v,btVector3(1,0,0));
260 for(i=0;i<psb->m_nodes.size();++i)
262 const btSoftBody::Node& n=psb->m_nodes[i];
282 for(i=0;i<psb->m_nodes.size();++i)
284 const btSoftBody::Node& n=psb->m_nodes[i]
[all...] |
| btDefaultSoftBodySolver.cpp | 88 const btAlignedObjectArray<btSoftBody::Node> &clothVertices( softBody->m_nodes );
|
| btSoftBodyData.h | 197 SoftBodyNodeData *m_nodes; member in struct:btSoftBodyFloatData
|
| btSoftBody.h | 302 Node* m_nodes[4]; // Nodes member in struct:btSoftBody::Note
322 btAlignedObjectArray<Node*> m_nodes; member in struct:btSoftBody::Cluster
656 tNodeArray m_nodes; // Nodes member in class:btSoftBody
|
| btSoftBodyInternals.h | 128 btSoftBody::Node* const * n=&m_cluster->m_nodes[0];
131 for(int i=1,ni=m_cluster->m_nodes.size();i<ni;++i)
|
| /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/ |
| DynamicTree.java | 49 private DynamicTreeNode[] m_nodes; field in class:DynamicTree
63 m_nodes = new DynamicTreeNode[16];
67 m_nodes[i] = new DynamicTreeNode(i);
68 m_nodes[i].parent = (i == m_nodeCapacity - 1) ? null : m_nodes[i + 1];
69 m_nodes[i].height = -1;
99 DynamicTreeNode node = m_nodes[proxyId];
110 final DynamicTreeNode node = m_nodes[proxyId];
152 return m_nodes[proxyId].userData;
158 return m_nodes[proxyId].aabb
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig/softbody/ |
| btSoftBody.i | 54 result->m_nodes.resize(numVertices);
60 if (result->m_nodes[j].m_x==point) {
66 btSoftBody::Node &node = result->m_nodes[nodeCount];
84 result->m_nodes.resize(nodeCount);
113 return $self->m_nodes.size();
117 return &($self->m_nodes[idx]);
131 const float *src = $self->m_nodes[i].m_x.m_floats;
144 const float * const &point = $self->m_nodes[pidx].m_x.m_floats;
159 const float * const &point = $self->m_nodes[pidx].m_x.m_floats;
160 const float * const &normal = $self->m_nodes[pidx].m_n.m_floats
[all...] |
| /external/testng/src/main/java/org/testng/internal/ |
| Graph.java | 22 private Map<T, Node<T>> m_nodes = Maps.newLinkedHashMap(); field in class:Graph
32 m_nodes.put(tm, new Node<>(tm));
45 return m_nodes.get(object);
78 return m_nodes.values();
82 return m_nodes.keySet();
159 List<Node<T>> list = Lists.newArrayList(m_nodes.values());
246 for (T node : m_nodes.keySet()) {
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTM.java | 104 protected Vector m_nodes = new Vector(); field in class:DOM2DTM
185 int nodeIndex = m_nodes.size();
246 m_nodes.addElement(node);
316 return m_nodes.size();
456 for(int i=0;i<m_nodes.size();++i)
609 return (Node) m_nodes.elementAt(identity);
621 return (Node) m_nodes.elementAt(nodeIdentity);
636 if (identity >= m_nodes.size())
668 int len = m_nodes.size();
675 if (m_nodes.elementAt(i) == node
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
| btDbvt.cpp | 729 btAlignedObjectArray<Node> m_nodes; member in struct:btDbvtBenchmark::P14
750 btAlignedObjectArray<Node> m_nodes; member in struct:btDbvtBenchmark::P15
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/extras/Serialize/BulletFileLoader/autogenerated/ |
| bullet.h | 1329 SoftBodyNodeData *m_nodes; member in class:Bullet::btSoftBodyFloatData
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/ |
| softbody_wrap.cpp | [all...] |
| /prebuilts/tools/common/m2/repository/org/testng/testng/6.9.10/ |
| testng-6.9.10.jar | |
| /prebuilts/tools/common/m2/repository/xalan/xalan/2.6.0/ |
| xalan-2.6.0.jar | |
