Struct VecIndexBackend 

pub struct VecIndexBackend<K, V> { /* private fields */ }

Default sorted-Vec + HashMap-backed index backend.

Maintains a sorted Vec of IndexRow ordered by (secondary, primary_str) plus a parallel HashMap for O(1) primary lookup.

Implementations

impl<K, V> VecIndexBackend<K, V>

pub fn new() -> Self

Trait Implementations

impl<K, V> Default for VecIndexBackend<K, V>

fn default() -> Self

Returns the “default value” for a type.

impl<K: Clone + Eq + Hash + Send + Sync + ToString, V: Clone + Send + Sync> IndexBackend<K, V> for VecIndexBackend<K, V>

fn size(&self) -> usize

fn has(&self, primary: &K) -> bool

fn get(&self, primary: &K) -> Option<V>

fn get_row(&self, primary: &K) -> Option<IndexRow<K, V>>

Get the full row (primary + secondary + value) by primary key.

fn upsert(&mut self, primary: K, secondary: String, value: V) -> bool

Returns true if inserted (new key), false if updated.

fn upsert_many(&mut self, rows: Vec<(K, String, V)>) -> usize

fn delete(&mut self, primary: &K) -> bool

fn delete_many(&mut self, primaries: &[K]) -> usize

fn clear(&mut self) -> usize

fn to_ordered(&self) -> Vec<IndexRow<K, V>>

fn to_primary_map(&self) -> Vec<(K, V)>