HomeSort by relevance Sort by last modified time
    Searched defs:iD (Results 1 - 6 of 6) sorted by null

  /art/test/406-fields/src/
Main.java 34 assertEquals(0.0, fields.iD);
46 fields.iD = 5.3;
56 assertEquals(5.3, fields.iD);
63 double iD;
  /art/test/AllFields/
AllFields.java 32 double iD;
  /external/eigen/Eigen/src/LU/arch/
Inverse_SSE.h 75 __m128 iA, iB, iC, iD, // partial inverse of the sub-matrices
105 // iD = C*A#*B
106 iD = _mm_mul_ps(_mm_shuffle_ps(C,C,0xA0), _mm_movelh_ps(AB,AB));
107 iD = _mm_add_ps(iD,_mm_mul_ps(_mm_shuffle_ps(C,C,0xF5), _mm_movehl_ps(AB,AB)));
118 // iD = D*|A| - C*A#*B
119 iD = _mm_sub_ps(_mm_mul_ps(D,_mm_shuffle_ps(dA,dA,0)), iD);
152 iD = _mm_mul_ps(rd,iD);
    [all...]
  /external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/
b2DynamicTree.cpp 463 int32 iD = B->child1;
465 b2TreeNode* D = m_nodes + iD;
467 b2Assert(0 <= iD && iD < m_nodeCapacity);
496 B->child2 = iD;
508 A->child1 = iD;
  /external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/broadphase/
DynamicTreeFlatNodes.java 453 // nodes[iMin] = parent.id;
728 int iD = m_child1[B];
730 int D = iD;
732 assert (0 <= iD && iD < m_nodeCapacity);
754 m_child2[B] = iD;
764 m_child1[A] = iD;
DynamicTree.java 82 int proxyId = node.id;
175 boolean proceed = callback.treeCallback(node.id);
275 float value = callback.raycastCallback(subInput, node.id);
313 assert (0 <= node.id && node.id < m_nodeCapacity);
333 assert (0 <= freeNode.id && freeNode.id < m_nodeCapacity);
334 assert (freeNode == m_nodes[freeNode.id]);
454 nodes[iMin] = parent.id;
482 m_freeList = treeNode.parent != null ? treeNode.parent.id : NULL_NODE
    [all...]

Completed in 713 milliseconds