392 StringTrieBuilder::Node::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
394         offset=edgeNumber;  in markRightEdgesFirst()
396     return edgeNumber;  in markRightEdgesFirst()
441 StringTrieBuilder::IntermediateValueNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
443         offset=edgeNumber=next->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
445     return edgeNumber;  in markRightEdgesFirst()
467 StringTrieBuilder::LinearMatchNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
469         offset=edgeNumber=next->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
471     return edgeNumber;  in markRightEdgesFirst()
492 StringTrieBuilder::ListBranchNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
494         firstEdgeNumber=edgeNumber;  in markRightEdgesFirst()
500                 edgeNumber=edge->markRightEdgesFirst(edgeNumber-step);  in markRightEdgesFirst()
505         offset=edgeNumber;  in markRightEdgesFirst()
507     return edgeNumber;  in markRightEdgesFirst()
566 StringTrieBuilder::SplitBranchNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
568         firstEdgeNumber=edgeNumber;  in markRightEdgesFirst()
569         edgeNumber=greaterOrEqual->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
570         offset=edgeNumber=lessThan->markRightEdgesFirst(edgeNumber-1);  in markRightEdgesFirst()
572     return edgeNumber;  in markRightEdgesFirst()
600 StringTrieBuilder::BranchHeadNode::markRightEdgesFirst(int32_t edgeNumber) {  in markRightEdgesFirst()  argument
602         offset=edgeNumber=next->markRightEdgesFirst(edgeNumber);  in markRightEdgesFirst()
604     return edgeNumber;  in markRightEdgesFirst()