84 lines
3.8 KiB
C++
84 lines
3.8 KiB
C++
/*
|
|
* Copyright (C) 2010 The Android Open Source Project
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*/
|
|
|
|
#ifndef LATINIME_UNIGRAM_DICTIONARY_H
|
|
#define LATINIME_UNIGRAM_DICTIONARY_H
|
|
|
|
#include "defines.h"
|
|
|
|
namespace latinime {
|
|
|
|
class UnigramDictionary {
|
|
public:
|
|
UnigramDictionary(const unsigned char *dict, int typedLetterMultipler, int fullWordMultiplier,
|
|
int maxWordLength, int maxWords, int maxAlternatives, const bool isLatestDictVersion);
|
|
int getSuggestions(int *codes, int codesSize, unsigned short *outWords, int *frequencies,
|
|
int *nextLetters, int nextLettersSize);
|
|
~UnigramDictionary();
|
|
|
|
private:
|
|
void initSuggestions(int *codes, int codesSize, unsigned short *outWords, int *frequencies);
|
|
int getSuggestionCandidates(int inputLength, int skipPos, int *nextLetters,
|
|
int nextLettersSize);
|
|
void getVersionNumber();
|
|
bool checkIfDictVersionIsLatest();
|
|
int getAddress(int *pos);
|
|
int getFreq(int *pos);
|
|
int wideStrLen(unsigned short *str);
|
|
bool sameAsTyped(unsigned short *word, int length);
|
|
bool addWord(unsigned short *word, int length, int frequency);
|
|
unsigned short toLowerCase(unsigned short c);
|
|
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, int *nextLetters, const int nextLettersSize);
|
|
void getWords(const int initialPos, const int inputLength, const int skipPos, int *nextLetters,
|
|
const int nextLettersSize);
|
|
void registerNextLetter(unsigned short c, int *nextLetters, int nextLettersSize);
|
|
void onTerminalWhenUserTypedLengthIsGreaterThanInputLength(unsigned short *word,
|
|
const int mInputLength, const int depth, const int snr, int *nextLetters,
|
|
const int nextLettersSize, const int skipPos, const int freq);
|
|
void onTerminalWhenUserTypedLengthIsSameAsInputLength(unsigned short *word, const int depth,
|
|
const int snr, const int skipPos, const int freq, const int addedWeight);
|
|
bool needsToSkipCurrentNode(const unsigned short c,
|
|
const int inputIndex, const int skipPos, const int depth);
|
|
int getMatchedProximityId(const int *currentChars, const unsigned short c, const int skipPos);
|
|
bool processCurrentNode(const int pos, const int depth,
|
|
const int maxDepth, const bool traverseAllNodes, const int snr, const int inputIndex,
|
|
const int diffs, const int skipPos, int *nextLetters, const int nextLettersSize,
|
|
int *newCount, int *newChildPosition, int *newDepth, bool *newTraverseAllNodes,
|
|
int *newSnr, int*newInputIndex, int *newDiffs, int *nextSiblingPosition);
|
|
const unsigned char *DICT;
|
|
const int MAX_WORDS;
|
|
const int MAX_WORD_LENGTH;
|
|
const int MAX_ALTERNATIVES;
|
|
const bool IS_LATEST_DICT_VERSION;
|
|
const int TYPED_LETTER_MULTIPLIER;
|
|
const int FULL_WORD_MULTIPLIER;
|
|
|
|
int *mFrequencies;
|
|
unsigned short *mOutputChars;
|
|
int *mInputCodes;
|
|
int mInputLength;
|
|
// MAX_WORD_LENGTH_INTERNAL must be bigger than MAX_WORD_LENGTH
|
|
unsigned short mWord[MAX_WORD_LENGTH_INTERNAL];
|
|
int mMaxEditDistance;
|
|
};
|
|
|
|
// ----------------------------------------------------------------------------
|
|
|
|
}; // namespace latinime
|
|
|
|
#endif // LATINIME_UNIGRAM_DICTIONARY_H
|