Searched refs:SuffixTreeNode (Results 1 – 2 of 2) sorted by relevance
| /freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | SuffixTree.h | 40 struct SuffixTreeNode { struct
83 SuffixTreeNode *Link = nullptr; argument
109 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link) in SuffixTreeNode() argument
112 SuffixTreeNode() {} in SuffixTreeNode() function
159 SuffixTreeNode *Root = nullptr;
177 SuffixTreeNode *Node = nullptr;
197 SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx,
208 SuffixTreeNode *insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx,
241 SuffixTreeNode *N = nullptr;
247 std::vector<SuffixTreeNode *> ToVisit;
[all …]
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SuffixTree.cpp | 41 SuffixTreeNode *SuffixTree::insertLeaf(SuffixTreeNode &Parent, in insertLeaf()
46 SuffixTreeNode *N = new (NodeAllocator.Allocate()) in insertLeaf()
47 SuffixTreeNode(StartIdx, &LeafEndIdx, nullptr); in insertLeaf()
53 SuffixTreeNode *SuffixTree::insertInternalNode(SuffixTreeNode *Parent, in insertInternalNode()
62 SuffixTreeNode *N = in insertInternalNode()
63 new (NodeAllocator.Allocate()) SuffixTreeNode(StartIdx, E, Root); in insertInternalNode()
73 std::vector<std::pair<SuffixTreeNode *, unsigned>> ToVisit; in setSuffixIndices()
76 SuffixTreeNode *CurrNode = Root; in setSuffixIndices()
98 SuffixTreeNode *NeedsLink = nullptr; in extend()
127 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar]; in extend()
[all …]
|