HomeSort by relevance Sort by last modified time
    Searched full:nodeindex (Results 1 - 25 of 48) sorted by null

1 2

  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/
btGImpactQuantizedBvh.h 159 SIMD_FORCE_INLINE bool isLeafNode(int nodeindex) const
161 return m_node_array[nodeindex].isLeafNode();
164 SIMD_FORCE_INLINE int getNodeData(int nodeindex) const
166 return m_node_array[nodeindex].getDataIndex();
169 SIMD_FORCE_INLINE void getNodeBound(int nodeindex, btAABB & bound) const
172 m_node_array[nodeindex].m_quantizedAabbMin,
176 m_node_array[nodeindex].m_quantizedAabbMax,
180 SIMD_FORCE_INLINE void setNodeBound(int nodeindex, const btAABB & bound)
182 bt_quantize_clamp( m_node_array[nodeindex].m_quantizedAabbMin,
188 bt_quantize_clamp( m_node_array[nodeindex].m_quantizedAabbMax
    [all...]
btGImpactBvh.h 179 SIMD_FORCE_INLINE bool isLeafNode(int nodeindex) const
181 return m_node_array[nodeindex].isLeafNode();
184 SIMD_FORCE_INLINE int getNodeData(int nodeindex) const
186 return m_node_array[nodeindex].getDataIndex();
189 SIMD_FORCE_INLINE void getNodeBound(int nodeindex, btAABB & bound) const
191 bound = m_node_array[nodeindex].m_bound;
194 SIMD_FORCE_INLINE void setNodeBound(int nodeindex, const btAABB & bound)
196 m_node_array[nodeindex].m_bound = bound;
199 SIMD_FORCE_INLINE int getLeftNode(int nodeindex) const
201 return nodeindex+1
    [all...]
gim_box_set.h 169 SIMD_FORCE_INLINE bool isLeafNode(GUINT nodeindex) const
171 return m_node_array[nodeindex].is_leaf_node();
174 SIMD_FORCE_INLINE GUINT getNodeData(GUINT nodeindex) const
176 return m_node_array[nodeindex].m_data;
179 SIMD_FORCE_INLINE void getNodeBound(GUINT nodeindex, GIM_AABB & bound) const
181 bound = m_node_array[nodeindex].m_bound;
184 SIMD_FORCE_INLINE void setNodeBound(GUINT nodeindex, const GIM_AABB & bound)
186 m_node_array[nodeindex].m_bound = bound;
189 SIMD_FORCE_INLINE GUINT getLeftNodeIndex(GUINT nodeindex) const
191 return m_node_array[nodeindex].m_left
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/swig-src/collision/com/badlogic/gdx/physics/bullet/collision/
btBvhTree.java 77 public boolean isLeafNode(int nodeindex) {
78 return CollisionJNI.btBvhTree_isLeafNode(swigCPtr, this, nodeindex);
81 public int getNodeData(int nodeindex) {
82 return CollisionJNI.btBvhTree_getNodeData(swigCPtr, this, nodeindex);
85 public void getNodeBound(int nodeindex, btAABB bound) {
86 CollisionJNI.btBvhTree_getNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
89 public void setNodeBound(int nodeindex, btAABB bound) {
90 CollisionJNI.btBvhTree_setNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
93 public int getLeftNode(int nodeindex) {
94 return CollisionJNI.btBvhTree_getLeftNode(swigCPtr, this, nodeindex);
    [all...]
btGImpactBvh.java 114 public boolean isLeafNode(int nodeindex) {
115 return CollisionJNI.btGImpactBvh_isLeafNode(swigCPtr, this, nodeindex);
118 public int getNodeData(int nodeindex) {
119 return CollisionJNI.btGImpactBvh_getNodeData(swigCPtr, this, nodeindex);
122 public void getNodeBound(int nodeindex, btAABB bound) {
123 CollisionJNI.btGImpactBvh_getNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
126 public void setNodeBound(int nodeindex, btAABB bound) {
127 CollisionJNI.btGImpactBvh_setNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
130 public int getLeftNode(int nodeindex) {
131 return CollisionJNI.btGImpactBvh_getLeftNode(swigCPtr, this, nodeindex);
    [all...]
btGImpactQuantizedBvh.java 114 public boolean isLeafNode(int nodeindex) {
115 return CollisionJNI.btGImpactQuantizedBvh_isLeafNode(swigCPtr, this, nodeindex);
118 public int getNodeData(int nodeindex) {
119 return CollisionJNI.btGImpactQuantizedBvh_getNodeData(swigCPtr, this, nodeindex);
122 public void getNodeBound(int nodeindex, btAABB bound) {
123 CollisionJNI.btGImpactQuantizedBvh_getNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
126 public void setNodeBound(int nodeindex, btAABB bound) {
127 CollisionJNI.btGImpactQuantizedBvh_setNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
130 public int getLeftNode(int nodeindex) {
131 return CollisionJNI.btGImpactQuantizedBvh_getLeftNode(swigCPtr, this, nodeindex);
    [all...]
btQuantizedBvhTree.java 92 public boolean isLeafNode(int nodeindex) {
93 return CollisionJNI.btQuantizedBvhTree_isLeafNode(swigCPtr, this, nodeindex);
96 public int getNodeData(int nodeindex) {
97 return CollisionJNI.btQuantizedBvhTree_getNodeData(swigCPtr, this, nodeindex);
100 public void getNodeBound(int nodeindex, btAABB bound) {
101 CollisionJNI.btQuantizedBvhTree_getNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
104 public void setNodeBound(int nodeindex, btAABB bound) {
105 CollisionJNI.btQuantizedBvhTree_setNodeBound(swigCPtr, this, nodeindex, btAABB.getCPtr(bound), bound);
108 public int getLeftNode(int nodeindex) {
109 return CollisionJNI.btQuantizedBvhTree_getLeftNode(swigCPtr, this, nodeindex);
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/
btQuantizedBvh.cpp 920 for (int nodeIndex = 0; nodeIndex < nodeCount; nodeIndex++)
922 targetBvh->m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMin[0] = btSwapEndian(m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMin[0]);
923 targetBvh->m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMin[1] = btSwapEndian(m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMin[1]);
924 targetBvh->m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMin[2] = btSwapEndian(m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMin[2]);
926 targetBvh->m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMax[0] = btSwapEndian(m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMax[0])
    [all...]
btQuantizedBvh.h 216 void setInternalNodeAabbMin(int nodeIndex, const btVector3& aabbMin)
220 quantize(&m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMin[0] ,aabbMin,0);
223 m_contiguousNodes[nodeIndex].m_aabbMinOrg = aabbMin;
227 void setInternalNodeAabbMax(int nodeIndex,const btVector3& aabbMax)
231 quantize(&m_quantizedContiguousNodes[nodeIndex].m_quantizedAabbMax[0],aabbMax,1);
234 m_contiguousNodes[nodeIndex].m_aabbMaxOrg = aabbMax;
238 btVector3 getAabbMin(int nodeIndex) const
242 return unQuantize(&m_quantizedLeafNodes[nodeIndex].m_quantizedAabbMin[0]);
245 return m_leafNodes[nodeIndex].m_aabbMinOrg;
248 btVector3 getAabbMax(int nodeIndex) cons
    [all...]
  /prebuilts/go/darwin-x86/src/compress/bzip2/
huffman.go 37 nodeIndex := uint16(0) // node 0 is the root of the tree.
40 node := &t.nodes[nodeIndex]
51 nodeIndex = node.left
57 nodeIndex = node.right
177 func buildHuffmanNode(t *huffmanTree, codes []huffmanCode, level uint32) (nodeIndex uint16, err error) {
226 nodeIndex = uint16(t.nextNode)
  /prebuilts/go/linux-x86/src/compress/bzip2/
huffman.go 37 nodeIndex := uint16(0) // node 0 is the root of the tree.
40 node := &t.nodes[nodeIndex]
51 nodeIndex = node.left
57 nodeIndex = node.right
177 func buildHuffmanNode(t *huffmanTree, codes []huffmanCode, level uint32) (nodeIndex uint16, err error) {
226 nodeIndex = uint16(t.nextNode)
  /external/regex-re2/re2/
onepass.cc 199 // Basically (OneState*)(nodes + statesize*nodeindex)
202 int nodeindex) {
204 const_cast<uint8*>(nodes + statesize*nodeindex));
414 int nodeindex = nodebyid[id]; local
415 OneState* node = IndexToNode(nodes, statesize, nodeindex);
573 int nodeindex = nodebyid[id]; local
574 if (nodeindex == -1)
576 OneState* node = IndexToNode(nodes, statesize, nodeindex);
579 nodeindex, id, node->matchcond);
  /packages/inputmethods/LatinIME/tests/src/com/android/inputmethod/latin/makedict/
FusionDictionary.java 346 int nodeIndex = findIndexOfChar(mRootNodeArray, word[charIndex]);
347 while (CHARACTER_NOT_FOUND_INDEX != nodeIndex) {
348 currentPtNode = currentNodeArray.mData.get(nodeIndex);
356 nodeIndex = findIndexOfChar(currentNodeArray, word[charIndex]);
359 if (CHARACTER_NOT_FOUND_INDEX == nodeIndex) {
425 currentNodeArray.mData.set(nodeIndex, newParent);
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/
DOM2DTM.java 185 int nodeIndex = m_nodes.size();
188 if(m_dtmIdent.size() == (nodeIndex>>>DTMManager.IDENT_DTM_NODE_BITS))
198 mgrD.addDTM(this,id,nodeIndex);
211 // ensureSize(nodeIndex);
248 m_firstch.setElementAt(NOTPROCESSED,nodeIndex);
249 m_nextsib.setElementAt(NOTPROCESSED,nodeIndex);
250 m_prevsib.setElementAt(previousSibling,nodeIndex);
251 m_parent.setElementAt(parentIndex,nodeIndex);
259 m_firstch.setElementAt(nodeIndex,parentIndex);
296 m_exptype.setElementAt(expandedNameID,nodeIndex);
    [all...]
  /external/icu/icu4c/source/i18n/
tznames_impl.cpp 262 uint16_t nodeIndex = parent->fFirstChild;
263 while (nodeIndex > 0) {
264 CharacterNode *current = fNodes + nodeIndex;
271 prevIndex = nodeIndex;
272 nodeIndex = current->fNextSibling;
289 node->fNextSibling = nodeIndex;
302 uint16_t nodeIndex = parent->fFirstChild;
303 while (nodeIndex > 0) {
304 CharacterNode *current = fNodes + nodeIndex;
311 nodeIndex = current->fNextSibling
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/
SAX2DTM.java 872 int nodeIndex = m_size++;
875 if(m_dtmIdent.size() == (nodeIndex>>>DTMManager.IDENT_DTM_NODE_BITS))
877 addNewDTMID(nodeIndex);
891 m_nextsib.setElementAt(nodeIndex,previousSibling);
905 declareNamespaceInContext(parentIndex,nodeIndex);
911 m_firstch.setElementAt(nodeIndex,parentIndex);
916 return nodeIndex;
921 * @param nodeIndex The node identity at which the new DTM ID will begin
924 protected void addNewDTMID(int nodeIndex) {
933 mgrD.addDTM(this,id,nodeIndex);
    [all...]
SAX2DTM2.java     [all...]
  /prebuilts/go/darwin-x86/src/cmd/pprof/internal/report/
report.go 490 nodeIndex := make(map[*node]int)
493 nodeIndex[n] = i + 1
500 node := dotNode(rpt, maxFlat, nodeIndex[n], n)
502 if nodelets := dotNodelets(rpt, nodeIndex[n], n); nodelets != "" {
514 fmt.Fprintln(w, dotEdge(rpt, nodeIndex[e.src], nodeIndex[e.dest], e))
    [all...]
  /prebuilts/go/linux-x86/src/cmd/pprof/internal/report/
report.go 490 nodeIndex := make(map[*node]int)
493 nodeIndex[n] = i + 1
500 node := dotNode(rpt, maxFlat, nodeIndex[n], n)
502 if nodelets := dotNodelets(rpt, nodeIndex[n], n); nodelets != "" {
514 fmt.Fprintln(w, dotEdge(rpt, nodeIndex[e.src], nodeIndex[e.dest], e))
    [all...]
  /external/llvm/lib/Analysis/
CFLAliasAnalysis.cpp 523 bool inbounds(Node NodeIndex) const { return NodeIndex < NodeImpls.size(); }
    [all...]
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/
btSoftBody.h 782 void addAeroForceToNode(const btVector3& windVelocity,int nodeIndex);
btSoftBody.cpp 456 void btSoftBody::addAeroForceToNode(const btVector3& windVelocity,int nodeIndex)
458 btAssert(nodeIndex >= 0 && nodeIndex < m_nodes.size());
470 Node& n = m_nodes[nodeIndex];
    [all...]
  /external/chromium-trace/catapult/third_party/jquery/
jquery-2.1.4.js     [all...]
  /external/chromium-trace/catapult/third_party/html5lib-python/html5lib/
html5parser.py     [all...]
  /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/
btSoftBody.java     [all...]

Completed in 898 milliseconds

1 2