Struct BTreeIndexedVector

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

A simple implementation of IndexedVector using BTreeMap. It also supports range search.

Implementations

impl<K: Ord, V> BTreeIndexedVector<K, V>

pub fn new<F: Fn(&V) -> K + 'static, C: IntoIterator<Item = V>>( data: C, key_func: F, ) -> Self

Create a new BTreeIndexedVector from a vector of items. The key_func is used to extract the key from an item.

Examples found in repository

examples/user.rs (line 32)

fn main() {
    let users = vec![
        User {
            name: "Tom".to_owned(),
            age: 20,
        },
        User {
            name: "Jane".to_owned(),
            age: 20,
        },
        User {
            name: "Ivan".to_owned(),
            age: 30,
        },
    ];

    let hash_vec = HashIndexedVector::new(users.clone(), |user: &User| user.age);
    // Tom and Jane
    dbg!(hash_vec.search(&20).collect::<Vec<_>>());
    // Ivan
    dbg!(hash_vec.search(&30).collect::<Vec<_>>());

    let btree_vec = BTreeIndexedVector::new(users, |user: &User| user.age);
    // Tom, Jane and Ivan
    dbg!(btree_vec.search_range(10..40).collect::<Vec<_>>());
}

pub fn search_range<R: RangeBounds<K>>( &self, range: R, ) -> impl Iterator<Item = &V>

Search for items in the given range.

Examples found in repository

examples/user.rs (line 34)

fn main() {
    let users = vec![
        User {
            name: "Tom".to_owned(),
            age: 20,
        },
        User {
            name: "Jane".to_owned(),
            age: 20,
        },
        User {
            name: "Ivan".to_owned(),
            age: 30,
        },
    ];

    let hash_vec = HashIndexedVector::new(users.clone(), |user: &User| user.age);
    // Tom and Jane
    dbg!(hash_vec.search(&20).collect::<Vec<_>>());
    // Ivan
    dbg!(hash_vec.search(&30).collect::<Vec<_>>());

    let btree_vec = BTreeIndexedVector::new(users, |user: &User| user.age);
    // Tom, Jane and Ivan
    dbg!(btree_vec.search_range(10..40).collect::<Vec<_>>());
}

Trait Implementations

impl<K: Ord, V> IndexedVector<K, V> for BTreeIndexedVector<K, V>

fn search(&self, key: &K) -> Iter<'_, V>

Search for items with the given key.

fn insert(&mut self, item: V)

Insert an item into the vector.