95 lines
3.4 KiB
C++
95 lines
3.4 KiB
C++
/*
|
|
* 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_POOL_H
|
|
#define LATINIME_WORDS_PRIORITY_QUEUE_POOL_H
|
|
|
|
#include <cassert>
|
|
#include "words_priority_queue.h"
|
|
|
|
namespace latinime {
|
|
|
|
class WordsPriorityQueuePool {
|
|
public:
|
|
WordsPriorityQueuePool(int mainQueueMaxWords, int subQueueMaxWords, int maxWordLength) {
|
|
// Note: using placement new() requires the caller to call the destructor explicitly.
|
|
mMasterQueue = new(mMasterQueueBuf) WordsPriorityQueue(mainQueueMaxWords, maxWordLength);
|
|
for (int i = 0, subQueueBufOffset = 0;
|
|
i < MULTIPLE_WORDS_SUGGESTION_MAX_WORDS * SUB_QUEUE_MAX_COUNT;
|
|
++i, subQueueBufOffset += sizeof(WordsPriorityQueue)) {
|
|
mSubQueues[i] = new(mSubQueueBuf + subQueueBufOffset)
|
|
WordsPriorityQueue(subQueueMaxWords, maxWordLength);
|
|
}
|
|
}
|
|
|
|
virtual ~WordsPriorityQueuePool() {
|
|
// Note: these explicit calls to the destructor match the calls to placement new() above.
|
|
if (mMasterQueue) mMasterQueue->~WordsPriorityQueue();
|
|
for (int i = 0; i < MULTIPLE_WORDS_SUGGESTION_MAX_WORDS * SUB_QUEUE_MAX_COUNT; ++i) {
|
|
if (mSubQueues[i]) mSubQueues[i]->~WordsPriorityQueue();
|
|
}
|
|
}
|
|
|
|
WordsPriorityQueue *getMasterQueue() {
|
|
return mMasterQueue;
|
|
}
|
|
|
|
WordsPriorityQueue *getSubQueue(const int wordIndex, const int inputWordLength) {
|
|
if (wordIndex >= MULTIPLE_WORDS_SUGGESTION_MAX_WORDS) {
|
|
return 0;
|
|
}
|
|
if (inputWordLength < 0 || inputWordLength >= SUB_QUEUE_MAX_COUNT) {
|
|
if (DEBUG_WORDS_PRIORITY_QUEUE) {
|
|
assert(false);
|
|
}
|
|
return 0;
|
|
}
|
|
return mSubQueues[wordIndex * SUB_QUEUE_MAX_COUNT + inputWordLength];
|
|
}
|
|
|
|
inline void clearAll() {
|
|
mMasterQueue->clear();
|
|
for (int i = 0; i < MULTIPLE_WORDS_SUGGESTION_MAX_WORDS; ++i) {
|
|
clearSubQueue(i);
|
|
}
|
|
}
|
|
|
|
inline void clearSubQueue(const int wordIndex) {
|
|
for (int i = 0; i < SUB_QUEUE_MAX_COUNT; ++i) {
|
|
WordsPriorityQueue *queue = getSubQueue(wordIndex, i);
|
|
if (queue) {
|
|
queue->clear();
|
|
}
|
|
}
|
|
}
|
|
|
|
void dumpSubQueue1TopSuggestions() {
|
|
AKLOGI("DUMP SUBQUEUE1 TOP SUGGESTIONS");
|
|
for (int i = 0; i < SUB_QUEUE_MAX_COUNT; ++i) {
|
|
getSubQueue(0, i)->dumpTopWord();
|
|
}
|
|
}
|
|
|
|
private:
|
|
DISALLOW_IMPLICIT_CONSTRUCTORS(WordsPriorityQueuePool);
|
|
WordsPriorityQueue *mMasterQueue;
|
|
WordsPriorityQueue *mSubQueues[SUB_QUEUE_MAX_COUNT * MULTIPLE_WORDS_SUGGESTION_MAX_WORDS];
|
|
char mMasterQueueBuf[sizeof(WordsPriorityQueue)];
|
|
char mSubQueueBuf[MULTIPLE_WORDS_SUGGESTION_MAX_WORDS
|
|
* SUB_QUEUE_MAX_COUNT * sizeof(WordsPriorityQueue)];
|
|
};
|
|
} // namespace latinime
|
|
#endif // LATINIME_WORDS_PRIORITY_QUEUE_POOL_H
|