Lines Matching refs:Children
63 Parent.Children[Edge] = N; in insertLeaf()
77 Parent->Children[Edge] = N; in insertInternalNode()
103 for (auto &ChildPair : InternalNode->Children) { in setSuffixIndices()
141 auto J = CurrInternalNode->Children.begin(); in setLeafNodes()
142 if (J != CurrInternalNode->Children.end()) { in setLeafNodes()
146 for (; J != CurrInternalNode->Children.end(); ++J) { in setLeafNodes()
196 if (Active.Node->Children.count(FirstChar) == 0) { in extend()
209 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar]; in extend()
269 SplitNode->Children[Str[NextNode->getStartIdx()]] = NextNode; in extend()
317 for (auto &ChildPair : Curr->Children) in advance()
338 for (auto &ChildPair : Curr->Children) in advance()