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

  /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/
typing_traversal.h 101 const int16_t pointIndex = dicNode->getInputIndex(0);
102 return pointIndex <= inputSize && !dicNode->isTotalInputSizeExceedingLimit()
typing_weighting.h 72 const int pointIndex = dicNode->getInputIndex(0);
76 ->getPointToKeyLength(pointIndex, dicNode->getNodeCodePoint());
81 const bool isFirstChar = pointIndex == 0;
100 const int pointIndex = dicNode->getInputIndex(0);
102 traverseSession->getProximityInfoState(0)->getPrimaryCodePointAt(pointIndex));
  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/
suggest.cpp 458 const int16_t pointIndex = dicNode->getInputIndex(0);
461 traverseSession->getProximityInfoState(0), pointIndex + 1, true, &childDicNodes);
476 const int16_t pointIndex = dicNode->getInputIndex(0);
479 traverseSession->getProximityInfoState(0), pointIndex + 1, false, &childDicNodes1);
486 traverseSession->getProximityInfoState(0), pointIndex, false, &childDicNodes2);
  /external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/
BIHTree.java 362 int pointIndex = index * 9;
364 v1.x = pointData[pointIndex++];
365 v1.y = pointData[pointIndex++];
366 v1.z = pointData[pointIndex++];
368 v2.x = pointData[pointIndex++];
369 v2.y = pointData[pointIndex++];
370 v2.z = pointData[pointIndex++];
372 v3.x = pointData[pointIndex++];
373 v3.y = pointData[pointIndex++];
374 v3.z = pointData[pointIndex++]
    [all...]

Completed in 121 milliseconds