390 StringTrieBuilder::Node::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
392         offset=edgeNumber;  in markRightEdgesFirst()
394     return edgeNumber;  in markRightEdgesFirst()
439 StringTrieBuilder::IntermediateValueNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
441         offset=edgeNumber=next->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
443     return edgeNumber;  in markRightEdgesFirst()
465 StringTrieBuilder::LinearMatchNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
467         offset=edgeNumber=next->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
469     return edgeNumber;  in markRightEdgesFirst()
490 StringTrieBuilder::ListBranchNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
492         firstEdgeNumber=edgeNumber;  in markRightEdgesFirst()
498                 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step);  in markRightEdgesFirst()
503         offset=edgeNumber;  in markRightEdgesFirst()
505     return edgeNumber;  in markRightEdgesFirst()
564 StringTrieBuilder::SplitBranchNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
566         firstEdgeNumber=edgeNumber;  in markRightEdgesFirst()
567         edgeNumber=greaterOrEqual->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
568         offset=edgeNumber=lessThan->markRightEdgesFirst(edgeNumber-1);  in markRightEdgesFirst()
570     return edgeNumber;  in markRightEdgesFirst()
598 StringTrieBuilder::BranchHeadNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
600         offset=edgeNumber=next->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
602     return edgeNumber;  in markRightEdgesFirst()