Searched refs:SuffixTreeInternalNode (Results 1 – 4 of 4) sorted by relevance
56 SpecificBumpPtrAllocator<SuffixTreeInternalNode> InternalNodeAllocator;64 SuffixTreeInternalNode *Root = nullptr;73 SuffixTreeInternalNode *Node = nullptr;93 SuffixTreeNode *insertLeaf(SuffixTreeInternalNode &Parent, unsigned StartIdx,104 SuffixTreeInternalNode *insertInternalNode(SuffixTreeInternalNode *Parent,111 SuffixTreeInternalNode *insertRoot();149 SmallVector<SuffixTreeInternalNode *> InternalNodesToVisit;182 RepeatedSubstringIterator(SuffixTreeInternalNode *N) : N(N) { in RepeatedSubstringIterator()
74 struct SuffixTreeInternalNode : SuffixTreeNode { struct102 SuffixTreeInternalNode *Link = nullptr; argument117 void setLink(SuffixTreeInternalNode *L); argument120 SuffixTreeInternalNode *getLink() const;129 SuffixTreeInternalNode(unsigned StartIdx, unsigned EndIdx, in SuffixTreeInternalNode() argument130 SuffixTreeInternalNode *Link) in SuffixTreeInternalNode()134 virtual ~SuffixTreeInternalNode() = default;
24 bool SuffixTreeInternalNode::isRoot() const { in isRoot()27 unsigned SuffixTreeInternalNode::getEndIdx() const { return EndIdx; } in getEndIdx()28 void SuffixTreeInternalNode::setLink(SuffixTreeInternalNode *L) { in setLink()32 SuffixTreeInternalNode *SuffixTreeInternalNode::getLink() const { return Link; } in getLink()
23 if (auto *Internal = dyn_cast<SuffixTreeInternalNode>(N)) in numElementsInSubstring()51 SuffixTreeNode *SuffixTree::insertLeaf(SuffixTreeInternalNode &Parent, in insertLeaf()60 SuffixTreeInternalNode *61 SuffixTree::insertInternalNode(SuffixTreeInternalNode *Parent, in insertInternalNode()68 SuffixTreeInternalNode(StartIdx, EndIdx, Root); in insertInternalNode()74 SuffixTreeInternalNode *SuffixTree::insertRoot() { in insertRoot()109 SuffixTreeInternalNode *NeedsLink = nullptr; in extend()147 assert(isa<SuffixTreeInternalNode>(NextNode) && in extend()151 Active.Node = cast<SuffixTreeInternalNode>(NextNode); in extend()187 SuffixTreeInternalNode *SplitNode = insertInternalNode( in extend()[all …]