| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/internal/ |
| H A D | dic_node_state_input.h | 49 void updateInputIndexG(const int pointerId, const int inputIndex, argument
51 mInputIndex[pointerId] = inputIndex;
74 // when "inputIndex" exceeds "inputSize", auto-completion needs to be done
|
| H A D | dic_node_state_output.h | 101 void setSecondWordFirstInputIndex(const int inputIndex) { argument
102 mSecondWordFirstInputIndex = inputIndex;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/layout/ |
| H A D | proximity_info_state.cpp | 170 const int inputIndex, const int codePoint) const {
173 const int index = inputIndex * mProximityInfo->getKeyCount() + keyId;
184 const int inputIndex, const int keyId) const {
186 &mSampledNormalizedSquaredLengthCache, mProximityInfo->getKeyCount(), inputIndex,
169 getPointToKeyLength( const int inputIndex, const int codePoint) const argument
183 getPointToKeyByIdLength( const int inputIndex, const int keyId) const argument
|
| H A D | proximity_info_state_utils.h | 84 const int inputIndex, const int keyId);
128 const int maxPointToKeyLength, const int inputIndex, const int nodeCodePoint, int x,
154 const int inputIndex);
157 const std::vector<int> *const sampledInputYs, const int keyIndex, const int inputIndex);
|
| H A D | proximity_info_state.h | 146 float getPointToKeyByIdLength(const int inputIndex, const int keyId) const;
148 float getPointToKeyLength(const int inputIndex, const int codePoint) const;
|
| H A D | proximity_info_state_utils.cpp | 159 const std::vector<int> *const sampledInputYs, const int keyIndex, const int inputIndex) {
162 const float inputX = static_cast<float>((*sampledInputXs)[inputIndex]);
163 const float inputY = static_cast<float>((*sampledInputYs)[inputIndex]);
170 const std::vector<int> *const sampledInputYs, const int keyIndex, const int inputIndex) {
177 if (NOT_A_COORDINATE == (*sampledInputXs)[inputIndex]) {
181 sampledInputXs, sampledInputYs, keyIndex, inputIndex);
402 const int maxPointToKeyLength, const int inputIndex, const int nodeCodePoint, int x, int y,
467 sampledInputIndice->push_back(inputIndex);
470 x, y, time, inputIndex, popped);
605 const int inputIndex, cons
157 calculateSquaredDistanceFromSweetSpotCenter( const ProximityInfo *const proximityInfo, const std::vector<int> *const sampledInputXs, const std::vector<int> *const sampledInputYs, const int keyIndex, const int inputIndex) argument
168 calculateNormalizedSquaredDistance( const ProximityInfo *const proximityInfo, const std::vector<int> *const sampledInputXs, const std::vector<int> *const sampledInputYs, const int keyIndex, const int inputIndex) argument
401 pushTouchPoint(const ProximityInfo *const proximityInfo, const int maxPointToKeyLength, const int inputIndex, const int nodeCodePoint, int x, int y, const int time, const bool isGeometric, const bool doSampling, const bool isLastPoint, const float sumAngle, NearKeysDistanceMap *const currentNearKeysDistances, const NearKeysDistanceMap *const prevNearKeysDistances, const NearKeysDistanceMap *const prevPrevNearKeysDistances, std::vector<int> *sampledInputXs, std::vector<int> *sampledInputYs, std::vector<int> *sampledInputTimes, std::vector<int> *sampledLengthCache, std::vector<int> *sampledInputIndice) argument
603 getPointToKeyByIdLength(const float maxPointToKeyLength, const std::vector<float> *const sampledNormalizedSquaredLengthCache, const int keyCount, const int inputIndex, const int keyId) argument
[all...] |
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| H A D | dic_nodes_cache.h | 79 bool isLookAheadCorrectionInputIndex(const int inputIndex) const {
80 return inputIndex == mInputIndex - 1;
135 AKLOGI("Restore %d nodes. inputIndex = %d.",
|
| H A D | dic_node.h | 272 const int inputIndex = mDicNodeState.mDicNodeStateOutput.getSecondWordFirstInputIndex(); local
273 if (inputIndex == NOT_AN_INDEX) {
276 return pInfoState->getInputIndexOfSampledPoint(inputIndex);
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/typing/ |
| H A D | typing_weighting.h | 184 const int inputIndex = dicNode->getInputIndex(0); local
186 ASSERT(inputIndex < inputSize);
188 return ScoringParams::TERMINAL_INSERTION_COST * (inputSize - inputIndex);
|