Searched refs:IsInTree (Results 1 – 5 of 5) sorted by relevance
30 if (it != value_to_node_.end() && IsInTree(it->second)) return false; in Insert()49 if (!IsInTree(it->second)) return false; in Remove()57 assert(!IsInTree(orphan)); in Remove()85 if (!IsInTree(target)) { in RankFromValue()118 return IsInTree(it->second); in HasValue()136 if (!IsInTree(target)) { in Promote()222 assert(!IsInTree(handle)); in CreateNode()233 assert(!IsInTree(node)); in InsertNode()
216 bool IsInTree(uint32_t node) const { in IsInTree() function
132 bool IsInTree = true; member498 Root->IsInTree = true; in SuffixTree()898 if (!Leaf->IsInTree) in findCandidates()905 if (Parent.OccurrenceCount < 2 || Parent.isRoot() || !Parent.IsInTree) in findCandidates()925 if (M && M->IsInTree && M->isLeaf()) { in findCandidates()927 M->IsInTree = false; in findCandidates()1012 Parent.IsInTree = false; in findCandidates()