nyancrimew
/
LatinIME
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Rename parameters for future change 

Change-Id: Id15a17340fb26f91c72687f30bef24b2d8b94940
main
Jean Chalard 2011-06-30 19:23:16 +09:00
parent 432789ac93
commit 0584f02ee1
2 changed files with 22 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
native/src/unigram_dictionary.cpp
View File

@ -897,9 +897,9 @@ bool UnigramDictionary::getSplitTwoWordsSuggestion(const int inputLength,
return true; return true;
} }
inline bool UnigramDictionary::processCurrentNode(const int pos, const int depth, inline bool UnigramDictionary::processCurrentNode(const int initialPos, const int initialDepth,
const int maxDepth, const bool traverseAllNodes, int matchWeight, int inputIndex, const int maxDepth, const bool initialTraverseAllNodes, int matchWeight, int inputIndex,
const int diffs, const int skipPos, const int excessivePos, const int transposedPos, const int initialDiffs, const int skipPos, const int excessivePos, const int transposedPos,
int *nextLetters, const int nextLettersSize, int *newCount, int *newChildPosition, int *nextLetters, const int nextLettersSize, int *newCount, int *newChildPosition,
bool *newTraverseAllNodes, int *newMatchRate, int *newInputIndex, int *newDiffs, bool *newTraverseAllNodes, int *newMatchRate, int *newInputIndex, int *newDiffs,
int *nextSiblingPosition, int *nextOutputIndex) { int *nextSiblingPosition, int *nextOutputIndex) {
@ -916,6 +916,11 @@ inline bool UnigramDictionary::processCurrentNode(const int pos, const int depth
int freq; int freq;
bool isSameAsUserTypedLength = false; bool isSameAsUserTypedLength = false;
const int pos = initialPos;
const int depth = initialDepth;
const int traverseAllNodes = initialTraverseAllNodes;
const int diffs = initialDiffs;
const uint8_t flags = 0; // No flags for now const uint8_t flags = 0; // No flags for now
if (excessivePos == depth && inputIndex < mInputLength - 1) ++inputIndex; if (excessivePos == depth && inputIndex < mInputLength - 1) ++inputIndex;
@ -1028,9 +1033,9 @@ bool UnigramDictionary::getSplitTwoWordsSuggestion(const int inputLength,
return true; return true;
} }
inline bool UnigramDictionary::processCurrentNode(const int pos, const int depth, inline bool UnigramDictionary::processCurrentNode(const int initialPos, const int initialDepth,
const int maxDepth, const bool traverseAllNodes, int matchWeight, int inputIndex, const int maxDepth, const bool initialTraverseAllNodes, int matchWeight, int inputIndex,
const int diffs, const int skipPos, const int excessivePos, const int transposedPos, const int initialDiffs, const int skipPos, const int excessivePos, const int transposedPos,
int *nextLetters, const int nextLettersSize, int *newCount, int *newChildPosition, int *nextLetters, const int nextLettersSize, int *newCount, int *newChildPosition,
bool *newTraverseAllNodes, int *newMatchRate, int *newInputIndex, int *newDiffs, bool *newTraverseAllNodes, int *newMatchRate, int *newInputIndex, int *newDiffs,
int *nextSiblingPosition, int *newOutputIndex) { int *nextSiblingPosition, int *newOutputIndex) {
@ -1047,6 +1052,11 @@ inline bool UnigramDictionary::processCurrentNode(const int pos, const int depth
int freq; int freq;
bool isSameAsUserTypedLength = false; bool isSameAsUserTypedLength = false;
int pos = initialPos;
int depth = initialDepth;
int traverseAllNodes = initialTraverseAllNodes;
int diffs = initialDiffs;
const uint8_t flags = 0; // No flags for now const uint8_t flags = 0; // No flags for now
if (excessivePos == depth && inputIndex < mInputLength - 1) ++inputIndex; if (excessivePos == depth && inputIndex < mInputLength - 1) ++inputIndex;

12
native/src/unigram_dictionary.h
View File

@ -80,12 +80,12 @@ private:
ProximityType getMatchedProximityId(const int *currentChars, const unsigned short c, ProximityType getMatchedProximityId(const int *currentChars, const unsigned short c,
const int skipPos, const int excessivePos, const int transposedPos); const int skipPos, const int excessivePos, const int transposedPos);
// Process a node by considering proximity, missing and excessive character // Process a node by considering proximity, missing and excessive character
bool processCurrentNode(const int pos, const int depth, bool processCurrentNode(const int initialPos, const int initialDepth,
const int maxDepth, const bool traverseAllNodes, const int snr, int inputIndex, const int maxDepth, const bool initialTraverseAllNodes, const int snr, int inputIndex,
const int diffs, const int skipPos, const int excessivePos, const int transposedPos, const int initialDiffs, const int skipPos, const int excessivePos,
int *nextLetters, const int nextLettersSize, int *newCount, int *newChildPosition, const int transposedPos, int *nextLetters, const int nextLettersSize, int *newCount,
bool *newTraverseAllNodes, int *newSnr, int*newInputIndex, int *newDiffs, int *newChildPosition, bool *newTraverseAllNodes, int *newSnr, int*newInputIndex,
int *nextSiblingPosition, int *nextOutputIndex); int *newDiffs, int *nextSiblingPosition, int *nextOutputIndex);
bool existsAdjacentProximityChars(const int inputIndex, const int inputLength) const; bool existsAdjacentProximityChars(const int inputIndex, const int inputLength) const;
inline const int* getInputCharsAt(const int index) const { inline const int* getInputCharsAt(const int index) const {
return mInputCodes + (index * MAX_PROXIMITY_CHARS); return mInputCodes + (index * MAX_PROXIMITY_CHARS);