Non-owning view of a buffer formatted as a complete binary search tree in Eytzinger (breadth-first) order.
Declared in <llvm/ADT/Eytzinger.h>
template<typename T>
class EytzingerTableSpan;| Name | Description |
|---|---|
const_iterator | Const pointer iterator over the Eytzinger-ordered buffer. |
iterator | Const pointer iterator over the Eytzinger-ordered buffer. |
| Name | Description |
|---|---|
EytzingerTableSpan [constructor] | Constructors |
begin | Iterator to the first element, or null if empty. |
contains | Check if this Eytzinger table contains Target. |
data | Pointer to the underlying buffer, or null if empty. |
empty | Return true if the span has no elements. |
end | Iterator one past the last element. |
findIndex | Search this Eytzinger table for Target. Returns the 0-based array index if found. |
isSorted | Verify whether the buffer satisfies strictly ascending binary search tree order in Eytzinger layout. Runs iteratively in O(N) time and O(1) space. |
operator[] | Access the element at Eytzinger index Idx. |
size | Return the number of elements in the span. |