2011-12-12 11:53:22 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2011 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_WORDS_PRIORITY_QUEUE_H
|
|
|
|
#define LATINIME_WORDS_PRIORITY_QUEUE_H
|
|
|
|
|
2012-02-03 12:24:53 +00:00
|
|
|
#include <cstring> // for memcpy()
|
2011-12-12 11:53:22 +00:00
|
|
|
#include <iostream>
|
|
|
|
#include <queue>
|
2012-07-31 08:56:40 +00:00
|
|
|
|
|
|
|
#include "correction.h"
|
2011-12-12 11:53:22 +00:00
|
|
|
#include "defines.h"
|
|
|
|
|
|
|
|
namespace latinime {
|
|
|
|
|
|
|
|
class WordsPriorityQueue {
|
2012-01-06 03:24:38 +00:00
|
|
|
public:
|
2011-12-12 11:53:22 +00:00
|
|
|
class SuggestedWord {
|
|
|
|
public:
|
|
|
|
int mScore;
|
|
|
|
unsigned short mWord[MAX_WORD_LENGTH_INTERNAL];
|
|
|
|
int mWordLength;
|
|
|
|
bool mUsed;
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
void setParams(int score, unsigned short *word, int wordLength) {
|
2011-12-12 11:53:22 +00:00
|
|
|
mScore = score;
|
|
|
|
mWordLength = wordLength;
|
|
|
|
memcpy(mWord, word, sizeof(unsigned short) * wordLength);
|
|
|
|
mUsed = true;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
WordsPriorityQueue(int maxWords, int maxWordLength) :
|
|
|
|
MAX_WORDS((unsigned int) maxWords), MAX_WORD_LENGTH(
|
|
|
|
(unsigned int) maxWordLength) {
|
|
|
|
mSuggestedWords = new SuggestedWord[maxWordLength];
|
|
|
|
for (int i = 0; i < maxWordLength; ++i) {
|
|
|
|
mSuggestedWords[i].mUsed = false;
|
|
|
|
}
|
2012-01-17 06:58:23 +00:00
|
|
|
mHighestSuggestedWord = 0;
|
2011-12-12 11:53:22 +00:00
|
|
|
}
|
2012-01-13 06:41:17 +00:00
|
|
|
|
2011-12-12 11:53:22 +00:00
|
|
|
~WordsPriorityQueue() {
|
|
|
|
delete[] mSuggestedWords;
|
|
|
|
}
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
void push(int score, unsigned short *word, int wordLength) {
|
|
|
|
SuggestedWord *sw = 0;
|
2011-12-12 11:53:22 +00:00
|
|
|
if (mSuggestions.size() >= MAX_WORDS) {
|
|
|
|
sw = mSuggestions.top();
|
|
|
|
const int minScore = sw->mScore;
|
|
|
|
if (minScore >= score) {
|
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
sw->mUsed = false;
|
|
|
|
mSuggestions.pop();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (sw == 0) {
|
|
|
|
sw = getFreeSuggestedWord(score, word, wordLength);
|
|
|
|
} else {
|
|
|
|
sw->setParams(score, word, wordLength);
|
|
|
|
}
|
|
|
|
if (sw == 0) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGE("SuggestedWord is accidentally null.");
|
2011-12-12 11:53:22 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (DEBUG_WORDS_PRIORITY_QUEUE) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGI("Push word. %d, %d", score, wordLength);
|
2011-12-12 11:53:22 +00:00
|
|
|
DUMP_WORD(word, wordLength);
|
|
|
|
}
|
|
|
|
mSuggestions.push(sw);
|
2012-01-17 06:58:23 +00:00
|
|
|
if (!mHighestSuggestedWord || mHighestSuggestedWord->mScore < sw->mScore) {
|
|
|
|
mHighestSuggestedWord = sw;
|
|
|
|
}
|
2011-12-12 11:53:22 +00:00
|
|
|
}
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *top() {
|
2011-12-15 07:49:12 +00:00
|
|
|
if (mSuggestions.empty()) return 0;
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *sw = mSuggestions.top();
|
2011-12-15 07:49:12 +00:00
|
|
|
return sw;
|
|
|
|
}
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
int outputSuggestions(const unsigned short *before, const int beforeLength,
|
2012-05-15 08:43:31 +00:00
|
|
|
int *frequencies, unsigned short *outputChars) {
|
2012-01-17 06:58:23 +00:00
|
|
|
mHighestSuggestedWord = 0;
|
2012-02-03 12:24:53 +00:00
|
|
|
const unsigned int size = min(
|
|
|
|
MAX_WORDS, static_cast<unsigned int>(mSuggestions.size()));
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *swBuffer[size];
|
2011-12-12 11:53:22 +00:00
|
|
|
int index = size - 1;
|
|
|
|
while (!mSuggestions.empty() && index >= 0) {
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *sw = mSuggestions.top();
|
2011-12-12 11:53:22 +00:00
|
|
|
if (DEBUG_WORDS_PRIORITY_QUEUE) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGI("dump word. %d", sw->mScore);
|
2011-12-12 11:53:22 +00:00
|
|
|
DUMP_WORD(sw->mWord, sw->mWordLength);
|
|
|
|
}
|
2012-05-15 08:43:31 +00:00
|
|
|
swBuffer[index] = sw;
|
|
|
|
mSuggestions.pop();
|
|
|
|
--index;
|
|
|
|
}
|
|
|
|
if (size >= 2) {
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *nsMaxSw = 0;
|
2012-05-15 08:43:31 +00:00
|
|
|
unsigned int maxIndex = 0;
|
2012-05-16 11:42:12 +00:00
|
|
|
float maxNs = 0;
|
2012-05-15 08:43:31 +00:00
|
|
|
for (unsigned int i = 0; i < size; ++i) {
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *tempSw = swBuffer[i];
|
2012-05-15 08:43:31 +00:00
|
|
|
if (!tempSw) {
|
|
|
|
continue;
|
|
|
|
}
|
2012-05-16 11:42:12 +00:00
|
|
|
const float tempNs = getNormalizedScore(tempSw, before, beforeLength, 0, 0, 0);
|
2012-05-15 08:43:31 +00:00
|
|
|
if (tempNs >= maxNs) {
|
|
|
|
maxNs = tempNs;
|
|
|
|
maxIndex = i;
|
|
|
|
nsMaxSw = tempSw;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (maxIndex > 0 && nsMaxSw) {
|
|
|
|
memmove(&swBuffer[1], &swBuffer[0], maxIndex * sizeof(SuggestedWord*));
|
|
|
|
swBuffer[0] = nsMaxSw;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (unsigned int i = 0; i < size; ++i) {
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *sw = swBuffer[i];
|
2012-05-15 08:43:31 +00:00
|
|
|
if (!sw) {
|
|
|
|
AKLOGE("SuggestedWord is null %d", i);
|
|
|
|
continue;
|
|
|
|
}
|
2011-12-12 11:53:22 +00:00
|
|
|
const unsigned int wordLength = sw->mWordLength;
|
2012-07-25 08:51:43 +00:00
|
|
|
char *targetAdr = (char*) outputChars + i * MAX_WORD_LENGTH * sizeof(short);
|
2012-05-15 08:43:31 +00:00
|
|
|
frequencies[i] = sw->mScore;
|
2011-12-12 11:53:22 +00:00
|
|
|
memcpy(targetAdr, sw->mWord, (wordLength) * sizeof(short));
|
|
|
|
if (wordLength < MAX_WORD_LENGTH) {
|
|
|
|
((unsigned short*) targetAdr)[wordLength] = 0;
|
|
|
|
}
|
|
|
|
sw->mUsed = false;
|
|
|
|
}
|
|
|
|
return size;
|
|
|
|
}
|
|
|
|
|
2012-01-17 06:59:15 +00:00
|
|
|
int size() const {
|
2011-12-15 13:29:05 +00:00
|
|
|
return mSuggestions.size();
|
|
|
|
}
|
|
|
|
|
2011-12-12 11:53:22 +00:00
|
|
|
void clear() {
|
2012-01-17 06:58:23 +00:00
|
|
|
mHighestSuggestedWord = 0;
|
2011-12-12 11:53:22 +00:00
|
|
|
while (!mSuggestions.empty()) {
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *sw = mSuggestions.top();
|
2011-12-12 11:53:22 +00:00
|
|
|
if (DEBUG_WORDS_PRIORITY_QUEUE) {
|
2012-01-13 09:01:22 +00:00
|
|
|
AKLOGI("Clear word. %d", sw->mScore);
|
2011-12-12 11:53:22 +00:00
|
|
|
DUMP_WORD(sw->mWord, sw->mWordLength);
|
|
|
|
}
|
|
|
|
sw->mUsed = false;
|
|
|
|
mSuggestions.pop();
|
|
|
|
}
|
|
|
|
}
|
2012-01-06 03:24:38 +00:00
|
|
|
|
2012-01-16 07:21:21 +00:00
|
|
|
void dumpTopWord() {
|
|
|
|
if (size() <= 0) {
|
|
|
|
return;
|
|
|
|
}
|
2012-01-23 07:52:37 +00:00
|
|
|
DUMP_WORD(mHighestSuggestedWord->mWord, mHighestSuggestedWord->mWordLength);
|
2012-01-16 07:21:21 +00:00
|
|
|
}
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
float getHighestNormalizedScore(const unsigned short *before, const int beforeLength,
|
|
|
|
unsigned short **outWord, int *outScore, int *outLength) {
|
2012-01-17 06:58:23 +00:00
|
|
|
if (!mHighestSuggestedWord) {
|
|
|
|
return 0.0;
|
|
|
|
}
|
2012-05-15 08:43:31 +00:00
|
|
|
return getNormalizedScore(
|
|
|
|
mHighestSuggestedWord, before, beforeLength, outWord, outScore, outLength);
|
2012-01-17 06:58:23 +00:00
|
|
|
}
|
|
|
|
|
2012-01-06 03:24:38 +00:00
|
|
|
private:
|
2012-06-14 18:25:50 +00:00
|
|
|
DISALLOW_IMPLICIT_CONSTRUCTORS(WordsPriorityQueue);
|
2011-12-15 07:49:12 +00:00
|
|
|
struct wordComparator {
|
|
|
|
bool operator ()(SuggestedWord * left, SuggestedWord * right) {
|
|
|
|
return left->mScore > right->mScore;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *getFreeSuggestedWord(int score, unsigned short *word,
|
2011-12-15 07:49:12 +00:00
|
|
|
int wordLength) {
|
|
|
|
for (unsigned int i = 0; i < MAX_WORD_LENGTH; ++i) {
|
|
|
|
if (!mSuggestedWords[i].mUsed) {
|
|
|
|
mSuggestedWords[i].setParams(score, word, wordLength);
|
|
|
|
return &mSuggestedWords[i];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2012-07-25 08:51:43 +00:00
|
|
|
static float getNormalizedScore(SuggestedWord *sw, const unsigned short *before,
|
|
|
|
const int beforeLength, unsigned short **outWord, int *outScore, int *outLength) {
|
2012-05-15 08:43:31 +00:00
|
|
|
const int score = sw->mScore;
|
2012-07-25 08:51:43 +00:00
|
|
|
unsigned short *word = sw->mWord;
|
2012-05-15 08:43:31 +00:00
|
|
|
const int wordLength = sw->mWordLength;
|
|
|
|
if (outScore) {
|
|
|
|
*outScore = score;
|
|
|
|
}
|
|
|
|
if (outWord) {
|
|
|
|
*outWord = word;
|
|
|
|
}
|
|
|
|
if (outLength) {
|
|
|
|
*outLength = wordLength;
|
|
|
|
}
|
|
|
|
return Correction::RankingAlgorithm::calcNormalizedScore(
|
|
|
|
before, beforeLength, word, wordLength, score);
|
|
|
|
}
|
|
|
|
|
2011-12-15 07:49:12 +00:00
|
|
|
typedef std::priority_queue<SuggestedWord*, std::vector<SuggestedWord*>,
|
|
|
|
wordComparator> Suggestions;
|
|
|
|
Suggestions mSuggestions;
|
|
|
|
const unsigned int MAX_WORDS;
|
|
|
|
const unsigned int MAX_WORD_LENGTH;
|
2012-07-25 08:51:43 +00:00
|
|
|
SuggestedWord *mSuggestedWords;
|
|
|
|
SuggestedWord *mHighestSuggestedWord;
|
2011-12-12 11:53:22 +00:00
|
|
|
};
|
2012-07-25 08:51:43 +00:00
|
|
|
} // namespace latinime
|
2011-12-12 11:53:22 +00:00
|
|
|
#endif // LATINIME_WORDS_PRIORITY_QUEUE_H
|