struct SuffixTree::RepeatedSubstringIterator

Declaration

struct SuffixTree::RepeatedSubstringIterator { /* full declaration omitted */ };

Description

Iterator for finding all repeated substrings in the suffix tree.

Declared at: llvm/include/llvm/Support/SuffixTree.h:238

Member Variables

private llvm::SuffixTreeNode* N = nullptr

The current node we're visiting.

private llvm::SuffixTree::RepeatedSubstring RS

The repeated substring associated with this node.

private std::vector<SuffixTreeNode*> ToVisit

The nodes left to visit.

private const unsigned int MinLength = 2

The minimum length of a repeated substring to find. Since we're outlining, we want at least two instructions in the range. FIXME: This may not be true for targets like X86 which support many instruction lengths.

Method Overview

• public RepeatedSubstringIterator(llvm::SuffixTreeNode * N)
• private void advance()

Methods

¶RepeatedSubstringIterator(llvm::SuffixTreeNode* N)

Declared at: llvm/include/llvm/Support/SuffixTree.h:332

Parameters

llvm::SuffixTreeNode* N

¶void advance()

Description

Move the iterator to the next repeated substring.

Declared at: llvm/include/llvm/Support/SuffixTree.h:256