Home
last modified time | relevance | path

Searched refs:SuffixTreeNode (Results 1 – 5 of 5) sorted by relevance

/src/contrib/llvm-project/llvm/include/llvm/Support/
H A DSuffixTreeNode.h33 struct SuffixTreeNode { struct
91 SuffixTreeNode(NodeKind Kind, unsigned StartIdx) in SuffixTreeNode() argument
93 virtual ~SuffixTreeNode() = default;
97 struct SuffixTreeInternalNode : SuffixTreeNode {
129 static bool classof(const SuffixTreeNode *N) { in classof()
150 DenseMap<unsigned, SuffixTreeNode *> Children;
154 : SuffixTreeNode(NodeKind::ST_Internal, StartIdx), EndIdx(EndIdx), in SuffixTreeInternalNode()
161 struct SuffixTreeLeafNode : SuffixTreeNode {
176 static bool classof(const SuffixTreeNode *N) { in classof()
189 : SuffixTreeNode(NodeKind::ST_Leaf, StartIdx), EndIdx(EndIdx) {} in SuffixTreeLeafNode()
H A DSuffixTree.h70 unsigned LeafEndIdx = SuffixTreeNode::EmptyIdx;
79 unsigned Idx = SuffixTreeNode::EmptyIdx;
96 SuffixTreeNode *insertLeaf(SuffixTreeInternalNode &Parent, unsigned StartIdx,
162 SuffixTreeNode *N = nullptr;
/src/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTreeNode.cpp19 unsigned SuffixTreeNode::getStartIdx() const { return StartIdx; } in getStartIdx()
20 void SuffixTreeNode::incrementStartIdx(unsigned Inc) { StartIdx += Inc; } in incrementStartIdx()
21 void SuffixTreeNode::setConcatLen(unsigned Len) { ConcatLen = Len; } in setConcatLen()
22 unsigned SuffixTreeNode::getConcatLen() const { return ConcatLen; } in getConcatLen()
42 unsigned SuffixTreeNode::getLeftLeafIdx() const { return LeftLeafIdx; } in getLeftLeafIdx()
43 unsigned SuffixTreeNode::getRightLeafIdx() const { return RightLeafIdx; } in getRightLeafIdx()
44 void SuffixTreeNode::setLeftLeafIdx(unsigned Idx) { LeftLeafIdx = Idx; } in setLeftLeafIdx()
45 void SuffixTreeNode::setRightLeafIdx(unsigned Idx) { RightLeafIdx = Idx; } in setRightLeafIdx()
H A DSuffixTree.cpp21 static size_t numElementsInSubstring(const SuffixTreeNode *N) { in numElementsInSubstring()
58 SuffixTreeNode *SuffixTree::insertLeaf(SuffixTreeInternalNode &Parent, in insertLeaf()
72 assert(!(!Parent && StartIdx != SuffixTreeNode::EmptyIdx) && in insertInternalNode()
82 return insertInternalNode(/*Parent = */ nullptr, SuffixTreeNode::EmptyIdx, in insertRoot()
83 SuffixTreeNode::EmptyIdx, /*Edge = */ 0); in insertRoot()
89 SmallVector<std::pair<SuffixTreeNode *, unsigned>> ToVisit; in setSuffixIndices()
92 SuffixTreeNode *CurrNode = Root; in setSuffixIndices()
117 SmallVector<SuffixTreeNode *> ToVisit; in setLeafNodes()
127 std::pair<SuffixTreeNode *, SuffixTreeNode *>> in setLeafNodes()
132 SuffixTreeNode *CurrNode = ToVisit.pop_back_val(); in setLeafNodes()
[all …]
/src/lib/clang/libllvm/
H A DMakefile1221 SRCS_MIN+= Support/SuffixTreeNode.cpp