|
Zip and Skip Tries
|
Holds the results returned by a search operation (search method).
More...
#include <ZipTrie.hpp>
Public Attributes | |
| bool | contains |
| True if a node with the exact key was found in the trie, false otherwise. | |
| LCP_T | max_lcp |
| The Longest Common Prefix (LCP) calculated during the search. | |
| int | depth |
| The depth at which the key was found (number of edges from the root, root is depth 0). | |
Holds the results returned by a search operation (search method).
Definition at line 270 of file ZipTrie.hpp.
| bool ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::SearchResults::contains |
True if a node with the exact key was found in the trie, false otherwise.
Definition at line 273 of file ZipTrie.hpp.
| int ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::SearchResults::depth |
The depth at which the key was found (number of edges from the root, root is depth 0).
Set to -1 if the key was not found (contains is false).
Definition at line 284 of file ZipTrie.hpp.
| LCP_T ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::SearchResults::max_lcp |
The Longest Common Prefix (LCP) calculated during the search.
See ZipTrie::lcp() documentation for details on what this represents when contains is true or false.
Definition at line 279 of file ZipTrie.hpp.