HomeSort by relevance Sort by last modified time
    Searched defs:dicNode (Results 1 - 3 of 3) sorted by null

  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/
dic_nodes_cache.cpp 30 DicNode *DicNodesCache::setCommitPoint(int commitPoint) {
31 std::list<DicNode> dicNodesList;
33 DicNode dicNode;
34 mCachedDicNodesForContinuousSuggestion->copyPop(&dicNode);
35 dicNodesList.push_front(dicNode);
38 // Get the starting words of the top scoring dicNode (last dicNode popped from priority queue)
40 DicNode *topDicNode = &dicNodesList.front();
41 DicNode topDicNodeCopy
    [all...]
dic_node_priority_queue.h 78 AK_FORCE_INLINE DicNode *newDicNode(DicNode *dicNode) {
79 DicNode *newNode = searchEmptyDicNode();
81 DicNodeUtils::initByCopy(dicNode, newNode);
88 AK_FORCE_INLINE DicNode *copyPush(DicNode *dicNode) {
89 return copyPush(dicNode, mMaxSize);
92 AK_FORCE_INLINE void copyPop(DicNode *dest)
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/
suggest.cpp 23 #include "suggest/core/dicnode/dic_node.h"
24 #include "suggest/core/dicnode/dic_node_priority_queue.h"
25 #include "suggest/core/dicnode/dic_node_vector.h"
98 DicNode *topDicNode =
108 DicNode rootNode;
126 DicNode terminals[MAX_RESULTS]; // Avoiding non-POD variable length array
154 DicNode *terminalDicNode = &terminals[terminalIndex];
212 DicNode::managedDelete(terminalDicNode);
229 DicNode correctionDicNode;
241 DicNode dicNode
    [all...]

Completed in 34 milliseconds