Struct SortedIndex 

pub struct SortedIndex { /* private fields */ }

A sorted index that provides O(log n) lookups using binary search

Implementations

impl SortedIndex

pub fn new() -> Self

Create a new empty sorted index

pub fn with_capacity(_capacity: usize) -> Self

Create a sorted index with pre-allocated capacity

pub fn insert(&mut self, key: EKey, location: ArchiveLocation)

Insert an entry into the index

pub fn lookup(&self, key: &EKey) -> Option<&ArchiveLocation>

Perform a binary search lookup - O(log n)

pub fn range( &self, start: &EKey, end: &EKey, ) -> impl Iterator<Item = (&EKey, &ArchiveLocation)>

Get a range of entries between two keys

pub fn lower_bound(&self, key: &EKey) -> Option<(&EKey, &ArchiveLocation)>

Find the first entry with key >= target

pub fn upper_bound(&self, key: &EKey) -> Option<(&EKey, &ArchiveLocation)>

Find the last entry with key <= target

pub fn entries(&self) -> impl Iterator<Item = (&EKey, &ArchiveLocation)>

Get all entries

pub fn len(&self) -> usize

Get the number of entries

pub fn is_empty(&self) -> bool

Check if the index is empty

pub fn clear(&mut self)

Clear all entries

pub fn sorted_keys(&mut self) -> &[EKey]

Get sorted keys (cached)

pub fn extend<I>(&mut self, iter: I)

where I: IntoIterator<Item = (EKey, ArchiveLocation)>,

Perform a bulk insert from an iterator

pub fn from_hashmap(map: HashMap<EKey, ArchiveLocation>) -> Self

Create from a HashMap for migration

pub fn into_btree_map(self) -> BTreeMap<EKey, ArchiveLocation>

Convert to BTreeMap for compatibility

Trait Implementations

impl Clone for SortedIndex

fn clone(&self) -> SortedIndex

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SortedIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for SortedIndex

fn default() -> Self

Returns the “default value” for a type.