ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::ComparisonResult Struct Reference

Holds the result of comparing a search/insert key x with a node v's key, considering the context of ancestor LCPs. More...

#include <ZipTrie.hpp>

Public Attributes
std::strong_ordering	comparison
	The relative ordering of x compared to v (std::strong_ordering::less, greater, or equal).
LCP_T	lcp
	The Longest Common Prefix (LCP) calculated between x and v during this specific comparison.

Detailed Description

template<typename CHAR_T, bool MEMORY_EFFICIENT, typename RANK_T = GeometricRank, unsigned CHAR_SIZE_BITS = sizeof(CHAR_T) * 8>
struct ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::ComparisonResult

Holds the result of comparing a search/insert key x with a node v's key, considering the context of ancestor LCPs.

See also

k_compare

k_compare_prefix_check

Definition at line 445 of file ZipTrie.hpp.

Member Data Documentation

comparison

template<typename CHAR_T , bool MEMORY_EFFICIENT, typename RANK_T = GeometricRank, unsigned CHAR_SIZE_BITS = sizeof(CHAR_T) * 8>

std::strong_ordering ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::ComparisonResult::comparison

The relative ordering of x compared to v (std::strong_ordering::less, greater, or equal).

Definition at line 448 of file ZipTrie.hpp.

lcp

template<typename CHAR_T , bool MEMORY_EFFICIENT, typename RANK_T = GeometricRank, unsigned CHAR_SIZE_BITS = sizeof(CHAR_T) * 8>

LCP_T ZipTrie< CHAR_T, MEMORY_EFFICIENT, RANK_T, CHAR_SIZE_BITS >::ComparisonResult::lcp

The Longest Common Prefix (LCP) calculated between x and v during this specific comparison.

This LCP might be calculated starting from an offset determined by k_compare_prefix_check. It is stored in the LCP_T format (potentially approximate).

Definition at line 454 of file ZipTrie.hpp.

---

The documentation for this struct was generated from the following file:

• src/ZipTrie.hpp