Lines Matching refs:dicNode
35 const int prevWordNodePos, DicNode *newRootNode) {
44 const uint8_t *const dicRoot, DicNode *prevWordLastNode, DicNode *newRootNode) {
52 /* static */ void DicNodeUtils::initByCopy(DicNode *srcNode, DicNode *destNode) {
60 /* static */ void DicNodeUtils::createAndGetPassingChildNode(DicNode *dicNode,
64 const int codePoint = dicNode->getNodeTypedCodePoint();
68 childDicNodes->pushPassingChild(dicNode);
72 /* static */ int DicNodeUtils::createAndGetLeavingChildNode(DicNode *dicNode, int pos,
115 childDicNodes->pushLeavingChild(dicNode, nextPos, flags, childrenPos, attributesPos, siblingPos,
149 /* static */ void DicNodeUtils::createAndGetAllLeavingChildNodes(DicNode *dicNode,
153 const int terminalDepth = dicNode->getLeavingDepth();
154 const int childCount = dicNode->getChildrenCount();
155 int nextPos = dicNode->getChildrenPos();
158 nextPos = createAndGetLeavingChildNode(dicNode, nextPos, dicRoot, terminalDepth, pInfoState,
167 /* static */ void DicNodeUtils::getAllChildDicNodes(DicNode *dicNode, const uint8_t *const dicRoot,
169 getProximityChildDicNodes(dicNode, dicRoot, 0, 0, false, childDicNodes);
172 /* static */ void DicNodeUtils::getProximityChildDicNodes(DicNode *dicNode,
175 if (dicNode->isTotalInputSizeExceedingLimit()) {
178 if (!dicNode->isLeavingNode()) {
179 DicNodeUtils::createAndGetPassingChildNode(dicNode, pInfoState, pointIndex, exactOnly,
182 DicNodeUtils::createAndGetAllLeavingChildNodes(dicNode, dicRoot, pInfoState, pointIndex,
192 * Computes the combined bigram / unigram cost for the given dicNode.
195 const DicNode *const node, MultiBigramMap *multiBigramMap) {
207 const DicNode *const node, MultiBigramMap *multiBigramMap) {
