Owning container that stores elements in a complete binary search tree formatted in Eytzinger (breadth‐first) order.

Synopsis

Declared in <llvm/ADT/Eytzinger.h>

template<typename T>
class EytzingerTable;

Type Aliases

Name

Description

const_iterator

Const iterator over owned Eytzinger‐ordered elements.

iterator

Const iterator over owned Eytzinger‐ordered elements.

Member Functions

Name

Description

EytzingerTable [constructor]

Construct an empty owning Eytzinger table.

asSpan

Return a non‐owning view of this table's storage.

begin

begin overloads

contains

Return true if Target is present in this table.

data

Pointer to the first owned element, or null if empty.

empty

Return true if the table contains no elements.

end

end overloads

findIndex

Search for Target and return its Eytzinger index if present.

isSorted

Return true if storage is a valid strictly ascending Eytzinger BST.

operator[]

Access the element at Eytzinger index Idx.

size

Return the number of stored elements.

Static Member Functions

Name

Description

create

Build an Eytzinger table from Keys.

Created with MrDocs