aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorJean Chalard <jchalard@google.com>2011-06-30 20:14:38 +0900
committerJean Chalard <jchalard@google.com>2011-06-30 20:14:38 +0900
commitbb15e77511a84483ccb6c4491b73c7f016878539 (patch)
treee7220c9c646269c13d65add92fdc24fc2130b827
parente6715e32d5ab66ac16c274d18dda386790b71ef2 (diff)
downloadlatinime-bb15e77511a84483ccb6c4491b73c7f016878539.tar.gz
latinime-bb15e77511a84483ccb6c4491b73c7f016878539.tar.xz
latinime-bb15e77511a84483ccb6c4491b73c7f016878539.zip
Move a function to make next commit more readable
Change-Id: Ieaa935ff4d68ce88137dcc5c672a4149a4c9c64f
-rw-r--r--native/src/unigram_dictionary.h4
1 files changed, 2 insertions, 2 deletions
diff --git a/native/src/unigram_dictionary.h b/native/src/unigram_dictionary.h
index c3128bbf6..789c49596 100644
--- a/native/src/unigram_dictionary.h
+++ b/native/src/unigram_dictionary.h
@@ -90,6 +90,8 @@ private:
inline const int* getInputCharsAt(const int index) const {
return mInputCodes + (index * MAX_PROXIMITY_CHARS);
}
+ int getMostFrequentWordLike(const int startInputIndex, const int inputLength,
+ unsigned short *word);
void getWordsRec(const int childrenCount, const int pos, const int depth, const int maxDepth,
const bool traverseAllNodes, const int snr, const int inputIndex, const int diffs,
const int skipPos, const int excessivePos, const int transposedPos, int *nextLetters,
@@ -98,8 +100,6 @@ private:
void getWordsOld(const int initialPos, const int inputLength, const int skipPos,
const int excessivePos, const int transposedPos, int *nextLetters,
const int nextLettersSize);
- int getMostFrequentWordLike(const int startInputIndex, const int inputLength,
- unsigned short *word);
// Process a node by considering missing space
bool processCurrentNodeForExactMatch(const int firstChildPos,
const int startInputIndex, const int depth, unsigned short *word,