Donate to e Foundation | Murena handsets with /e/OS | Own a part of Murena! Learn more

Commit bb15e775 authored by Jean Chalard's avatar Jean Chalard
Browse files

Move a function to make next commit more readable

Change-Id: Ieaa935ff4d68ce88137dcc5c672a4149a4c9c64f
parent e6715e32
Loading
Loading
Loading
Loading
+2 −2
Original line number Diff line number Diff line
@@ -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,