Home
last modified time | relevance | path

Searched refs:WordsPriorityQueue (Results 1 – 3 of 3) sorted by relevance

/packages/inputmethods/LatinIME/native/jni/src/
Dwords_priority_queue_pool.h30 mMasterQueue = new(mMasterQueueBuf) WordsPriorityQueue(mainQueueMaxWords, maxWordLength); in WordsPriorityQueuePool()
33 ++i, subQueueBufOffset += sizeof(WordsPriorityQueue)) { in WordsPriorityQueuePool()
35 WordsPriorityQueue(subQueueMaxWords, maxWordLength); in WordsPriorityQueuePool()
41 if (mMasterQueue) mMasterQueue->~WordsPriorityQueue(); in ~WordsPriorityQueuePool()
43 if (mSubQueues[i]) mSubQueues[i]->~WordsPriorityQueue(); in ~WordsPriorityQueuePool()
47 WordsPriorityQueue* getMasterQueue() { in getMasterQueue()
51 WordsPriorityQueue* getSubQueue(const int wordIndex, const int inputWordLength) { in getSubQueue()
73 WordsPriorityQueue* queue = getSubQueue(wordIndex, i); in clearSubQueue()
88 WordsPriorityQueue* mMasterQueue;
89 WordsPriorityQueue* mSubQueues[SUB_QUEUE_MAX_COUNT * MULTIPLE_WORDS_SUGGESTION_MAX_WORDS];
[all …]
Dwords_priority_queue.h27 class WordsPriorityQueue {
44 WordsPriorityQueue(int maxWords, int maxWordLength) : in WordsPriorityQueue() function
54 ~WordsPriorityQueue() { in ~WordsPriorityQueue()
Dunigram_dictionary.cpp65 unsigned short *word, int length, int frequency, WordsPriorityQueue *queue) { in addWord()
258 WordsPriorityQueue* masterQueue = queuePool->getMasterQueue(); in getWordSuggestions()
283 WordsPriorityQueue* queue = queuePool->getSubQueue(FIRST_WORD_INDEX, i); in getWordSuggestions()
285 WordsPriorityQueue::SuggestedWord* sw = queue->top(); in getWordSuggestions()
384 WordsPriorityQueue *masterQueue = queuePool->getMasterQueue(); in onTerminal()
414 WordsPriorityQueue *subQueue; in onTerminal()
505 WordsPriorityQueue* queue = queuePool->getSubQueue(currentWordIndex, inputWordLength); in getSubStringSuggestion()