aboutsummaryrefslogtreecommitdiffstats
path: root/src/plugins/tcime/3rdparty/tcime/phrasedictionary.cpp
blob: cdeaecdd57d99a81fa340510cfd17182550ba1ad (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
/*
 * Qt implementation of TCIME library
 * This file is part of the Qt Virtual Keyboard module.
 * Contact: http://www.qt.io/licensing/
 *
 * Copyright (C) 2015  The Qt Company
 * Copyright 2010 Google Inc.
 *
 * 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.
 */

#include "phrasedictionary.h"

using namespace tcime;

PhraseDictionary::PhraseDictionary() :
    WordDictionary()
{
}

QStringList PhraseDictionary::getWords(const QString &input) const
{
    if (input.length() != 1)
        return QStringList();

    // Phrases are stored in an array consisting of three character arrays.
    // char[0][] contains a char[] of words to look for phrases.
    // char[2][] contains a char[] of following words for char[0][].
    // char[1][] contains offsets of char[0][] words to map its following words.
    // For example, there are 5 phrases: Aa, Aa', Bb, Bb', Cc.
    // char[0][] { A, B, C }
    // char[1][] { 0, 2, 4 }
    // char[2][] { a, a', b, b', c}
    const Dictionary &dict = dictionary();
    if (dict.length() != 3)
        return QStringList();

    const DictionaryEntry &words = dict[0];

    DictionaryEntry::ConstIterator word = qBinaryFind(words, input.at(0));
    if (word == words.constEnd())
        return QStringList();

    int index = word - words.constBegin();
    const DictionaryEntry &offsets = dict[1];
    const DictionaryEntry &phrases = dict[2];
    int offset = (int)offsets[index].unicode();
    int count = (index < offsets.length() - 1) ?
        ((int)offsets[index + 1].unicode() - offset) : (phrases.length() - offset);

    QStringList result;
    for (int i = 0; i < count; ++i)
        result.append(phrases[offset + i]);

    return result;
}