blob: 05692f7ef8e969eb19f7d4f05d3cba74b22d82cf [file] [log] [blame]
The Android Open Source Project923bf412009-03-13 15:11:42 -07001/*
2**
3** Copyright 2009, The Android Open Source Project
4**
5** Licensed under the Apache License, Version 2.0 (the "License");
6** you may not use this file except in compliance with the License.
7** You may obtain a copy of the License at
8**
9** http://www.apache.org/licenses/LICENSE-2.0
10**
11** Unless required by applicable law or agreed to in writing, software
12** distributed under the License is distributed on an "AS IS" BASIS,
13** WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14** See the License for the specific language governing permissions and
15** limitations under the License.
16*/
17
18#include <stdio.h>
The Android Open Source Project923bf412009-03-13 15:11:42 -070019
satoke808e432010-12-02 14:53:24 +090020#define LOG_TAG "LatinIME: dictionary.cpp"
21
The Android Open Source Project923bf412009-03-13 15:11:42 -070022#include "dictionary.h"
satokd4952c82010-12-01 19:09:29 +090023
The Android Open Source Project923bf412009-03-13 15:11:42 -070024namespace latinime {
25
satok30088252010-12-01 21:22:15 +090026Dictionary::Dictionary(void *dict, int typedLetterMultiplier, int fullWordMultiplier,
27 int maxWordLength, int maxWords, int maxAlternatives)
satoke808e432010-12-02 14:53:24 +090028 : DICT((unsigned char*) dict),
29 // Checks whether it has the latest dictionary or the old dictionary
30 IS_LATEST_DICT_VERSION((((unsigned char*) dict)[0] & 0xFF) >= DICTIONARY_VERSION_MIN)
The Android Open Source Project923bf412009-03-13 15:11:42 -070031{
satoke808e432010-12-02 14:53:24 +090032 LOGI("IN NATIVE SUGGEST Version: %d \n", (DICT[0] & 0xFF));
33 mUnigramDictionary = new UnigramDictionary(DICT, typedLetterMultiplier, fullWordMultiplier,
satok18c28f42010-12-02 18:11:54 +090034 maxWordLength, maxWords, maxAlternatives, IS_LATEST_DICT_VERSION);
35 mBigramDictionary = new BigramDictionary(DICT, maxWordLength, maxAlternatives,
36 IS_LATEST_DICT_VERSION, hasBigram(), this);
The Android Open Source Project923bf412009-03-13 15:11:42 -070037}
38
39Dictionary::~Dictionary()
40{
satok30088252010-12-01 21:22:15 +090041 delete mUnigramDictionary;
42 delete mBigramDictionary;
The Android Open Source Project923bf412009-03-13 15:11:42 -070043}
satoke808e432010-12-02 14:53:24 +090044
45bool Dictionary::hasBigram() {
46 return ((DICT[1] & 0xFF) == 1);
47}
48
49// TODO: use uint16_t instead of unsigned short
50bool Dictionary::isValidWord(unsigned short *word, int length)
51{
52 if (IS_LATEST_DICT_VERSION) {
53 return (isValidWordRec(DICTIONARY_HEADER_SIZE, word, 0, length) != NOT_VALID_WORD);
54 } else {
55 return (isValidWordRec(0, word, 0, length) != NOT_VALID_WORD);
56 }
57}
58
59int Dictionary::isValidWordRec(int pos, unsigned short *word, int offset, int length) {
60 // returns address of bigram data of that word
61 // return -99 if not found
62
63 int count = Dictionary::getCount(DICT, &pos);
64 unsigned short currentChar = (unsigned short) word[offset];
65 for (int j = 0; j < count; j++) {
66 unsigned short c = Dictionary::getChar(DICT, &pos);
67 int terminal = Dictionary::getTerminal(DICT, &pos);
68 int childPos = Dictionary::getAddress(DICT, &pos);
69 if (c == currentChar) {
70 if (offset == length - 1) {
71 if (terminal) {
72 return (pos+1);
73 }
74 } else {
75 if (childPos != 0) {
76 int t = isValidWordRec(childPos, word, offset + 1, length);
77 if (t > 0) {
78 return t;
79 }
80 }
81 }
82 }
83 if (terminal) {
84 Dictionary::getFreq(DICT, IS_LATEST_DICT_VERSION, &pos);
85 }
86 // There could be two instances of each alphabet - upper and lower case. So continue
87 // looking ...
88 }
89 return NOT_VALID_WORD;
90}
The Android Open Source Project923bf412009-03-13 15:11:42 -070091} // namespace latinime