|
Zip and Skip Tries
|
Stores the Longest Common Prefix (LCP) values associated with the path from the root down to a node's parent. More...
#include <ZipTrie.hpp>
Public Attributes | |
| LCP_T | predecessor = {} |
| LCP accumulated along the path corresponding to the inorder predecessor branch. | |
| LCP_T | successor = {} |
| LCP accumulated along the path corresponding to the inorder successor branch. | |
Stores the Longest Common Prefix (LCP) values associated with the path from the root down to a node's parent.
These represent the LCPs calculated so far along the paths corresponding to the inorder predecessor and successor branches relative to the current search/insertion path. They are crucial for the k_compare optimization, allowing potential determination of comparison results without examining the actual keys.
Definition at line 338 of file ZipTrie.hpp.
| LCP_T ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::AncestorLCPs::predecessor = {} |
LCP accumulated along the path corresponding to the inorder predecessor branch.
Definition at line 341 of file ZipTrie.hpp.
| LCP_T ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::AncestorLCPs::successor = {} |
LCP accumulated along the path corresponding to the inorder successor branch.
Definition at line 343 of file ZipTrie.hpp.