| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/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() argument
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 …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/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() argument
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 …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/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() argument
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 …]
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/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 …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/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() argument
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 …]
|
| /dports/devel/llvm11/llvm-11.0.1.src/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() argument
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 …]
|
| /dports/lang/rust/rustc-1.58.1-src/src/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 …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/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 …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/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 …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/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() function
112 SuffixTreeNode() {} in SuffixTreeNode() argument
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 …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/Support/ |
| H A D | SuffixTree.h | 40 struct SuffixTreeNode {
83 SuffixTreeNode *Link = nullptr;
109 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link)
112 SuffixTreeNode() {}
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 …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/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 …]
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/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 …]
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/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 …]
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/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 …]
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/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 …]
|
| /dports/devel/llvm11/llvm-11.0.1.src/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 …]
|
| /dports/lang/rust/rustc-1.58.1-src/src/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 …]
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/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 …]
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/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 …]
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/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 …]
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/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 …]
|
| /dports/devel/llvm70/llvm-7.0.1.src/lib/CodeGen/ |
| H A D | MachineOutliner.cpp | 122 struct SuffixTreeNode { struct
168 SuffixTreeNode *Link = nullptr; argument
171 SuffixTreeNode *Parent = nullptr; argument
203 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link, in SuffixTreeNode() function
204 SuffixTreeNode *Parent) in SuffixTreeNode()
207 SuffixTreeNode() {} in SuffixTreeNode() function
250 SuffixTreeNode *Root = nullptr;
268 SuffixTreeNode *Node;
288 SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx, in insertLeaf()
308 SuffixTreeNode *insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx, in insertInternalNode()
[all …]
|
| /dports/devel/llvm10/llvm-10.0.1.src/lib/CodeGen/ |
| H A D | MachineOutliner.cpp | 119 struct SuffixTreeNode { struct
162 SuffixTreeNode *Link = nullptr; argument
188 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link) in SuffixTreeNode() function
191 SuffixTreeNode() {} in SuffixTreeNode() argument
238 SuffixTreeNode *Root = nullptr;
256 SuffixTreeNode *Node = nullptr;
276 SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx, in insertLeaf()
296 SuffixTreeNode *insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx, in insertInternalNode()
304 SuffixTreeNode *N = in insertInternalNode()
432 SuffixTreeNode *SplitNode = in extend()
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| H A D | MachineOutliner.cpp | 119 struct SuffixTreeNode { struct
162 SuffixTreeNode *Link = nullptr; argument
188 SuffixTreeNode(unsigned StartIdx, unsigned *EndIdx, SuffixTreeNode *Link) in SuffixTreeNode() function
191 SuffixTreeNode() {} in SuffixTreeNode() function
238 SuffixTreeNode *Root = nullptr;
256 SuffixTreeNode *Node = nullptr;
276 SuffixTreeNode *insertLeaf(SuffixTreeNode &Parent, unsigned StartIdx, in insertLeaf()
296 SuffixTreeNode *insertInternalNode(SuffixTreeNode *Parent, unsigned StartIdx, in insertInternalNode()
304 SuffixTreeNode *N = in insertInternalNode()
432 SuffixTreeNode *SplitNode = in extend()
[all …]
|