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

  /packages/inputmethods/LatinIME/native/jni/tests/suggest/core/dicnode/
dic_node_pool_test.cpp 17 #include "suggest/core/dicnode/dic_node_pool.h"
38 DicNode *const dicNode = dicNodePool.getInstance();
39 EXPECT_NE(nullptr, dicNode);
41 dicNodePool.placeBackInstance(dicNode);
42 EXPECT_EQ(dicNode, dicNodePool.getInstance());
  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/
dic_node_pool.h 25 #include "suggest/core/dicnode/dic_node.h"
44 for (auto &dicNode : mDicNodes) {
45 mPooledDicNodes.emplace_back(&dicNode);
49 // Get a DicNode instance from the pool. The instance has to be returned by returnInstance().
50 DicNode *getInstance() {
54 DicNode *const dicNode = mPooledDicNodes.back();
56 return dicNode;
61 void placeBackInstance(DicNode *dicNode) {
    [all...]
  /packages/inputmethods/LatinIME/native/jni/src/suggest/core/
suggest.cpp 21 #include "suggest/core/dicnode/dic_node.h"
22 #include "suggest/core/dicnode/dic_node_priority_queue.h"
23 #include "suggest/core/dicnode/dic_node_vector.h"
96 DicNode rootNode;
110 DicNode correctionDicNode;
122 DicNode dicNode;
123 traverseSession->getDicTraverseCache()->popActive(&dicNode);
124 if (dicNode.isTotalInputSizeExceedingLimit()) {
128 const int point0Index = dicNode.getInputIndex(0)
    [all...]

Completed in 220 milliseconds