Longest |
The LongestCommonGeneralizedRepeatA type exposes the following members.
Fields| Name | Description | |
|---|---|---|
 | _ddlList | |
| _lastLcp | |
| _LCP |
Stores the length of the Longest Common Prefix of the lexicographically i-th suffix and its lexicographical predecessor (the lexicographically (i-1)-th suffix).
The element at index 0 is always 0.
(Inherited from LongestCommonSubstringBase) |
| _LCPS | Stores the length of the Longest Common Prefix _LCP, but here only if two adjacent suffixes belong to the same word.
In the other case, i.e. the suffix _suffixArray[i-1] belongs to another word than the suffix _suffixArray[i], then _LCPS[i] is zero. (Inherited from LongestCommonSubstringBase) |
| _lcsOfNumberOfWords |
Stores in element idx the length of the longest substring that is common to idx number of words (it follows that index 0 and 1 are unused here).
(Inherited from LongestCommonSubstringBase) |
| _maximumLcp |
Maximum of all values in the _LCP array.
(Inherited from LongestCommonSubstringBase) |
| _maximumNumberOfWordsWithCommonSubstring |
Contains the maximum number of words that have a common substring.
(Inherited from LongestCommonSubstringBase) |
| _numberOfWords | Number of words the text was separated into. (Inherited from LongestCommonSubstringBase) |
| _preResults | For a given number of words as the index, this array stores some preliminarily found suffix regions for some algorithms (e.g. generalized common repeat algorithm). |
| _singleResultOfNumberOfWords |
If _verboseResultsOfNumberOfWords is false, stores only the first report of a longest common string for the given number of words.
The content of one element is the beginning and the end index in the suffix array that indicate all suffixes that have this substring in common.
The length of this substring is stored in _lcsOfNumberOfWords at the same index.
If _verboseResultsOfNumberOfWords is true, this array is not used and is set to null.
(Inherited from LongestCommonSubstringBase) |
| _suffixArray | Maps the lexicographical order position i of a suffix to the starting position of the suffix in the text, which is the value of the i-th element of this array. (Inherited from LongestCommonSubstringBase) |
| _useVerboseResults |
Determines the amount of information to store during evaluation.
(Inherited from LongestCommonSubstringBase) |
| _verboseResultsOfNumberOfWords |
If _verboseResultsOfNumberOfWords is true, this array stores, for a given number of words that have one or more substrings in common, a list with all positions where such common substrings occur.
The content of one element of each list is the beginning and the end index in the suffix array that indicate all suffixes that have a substring in common. The length of this substring is stored in _lcsOfNumberOfWords
If _verboseResultsOfNumberOfWords is false, this array is not used and is set to null.
(Inherited from LongestCommonSubstringBase) |
| _wordIndices |
Maps the lexicographical order position i of a suffix to the index of the word, in which this suffix starts. This means, that for instance the value of the i-th
element contains the index of the word, in which the lexicographically i-th suffix that starts at position _suffixArray[i] begins.
The contents of this array is only meaningful, if you provided text that was separated into words, for instance for the longest common substring problem.
(Inherited from LongestCommonSubstringBase) |
| _wordStartPositions |
Start positions of the words in which the original text was separated in the concenated text array.
(Inherited from LongestCommonSubstringBase) |
See Also