Struct SortedIndex

pub struct SortedIndex<T> { /* private fields */ }

Index of a DataStore.

Implementations

impl<T> SortedIndex<T>

where T: Ord,

pub fn new<F, U>(data_store: &QueriableDataStore<U>, index_provider: F) -> Self

where F: Fn(&U) -> T,

Creates a new Index from a DataStore for the index provided by the index_provider function.

pub fn filter_range<R>(&self, range: R) -> DataFilter

where R: RangeBounds<T>,

Get a new DataFilter for all items in the given range.

pub fn filter_between( &self, lower_inclusive: T, upper_inclusive: T, ) -> DataFilter

Get a new DataFilter for all items between the given values (including lower and upper value).

pub fn filter_eq(&self, value: T) -> DataFilter

Get a new DataFilter for all items that are equivalent to the given value.

pub fn filter_gt(&self, lower_limit: T) -> DataFilter

Get a new DataFilter for all items that are greater than the given value.

pub fn filter_gte(&self, lower_limit: T) -> DataFilter

Get a new DataFilter for all items that are greater than ore equal to the given value.

pub fn filter_lt(&self, upper_limit: T) -> DataFilter

Get a new DataFilter for all items that are less than the given value.

pub fn filter_lte(&self, upper_limit: T) -> DataFilter

Get a new DataFilter for all items that are less than ore equal to the given value.

pub fn first(&self) -> DataFilter

Get the first element in the index

pub fn first_n(&self, n: usize) -> DataFilter

Get the first n elements of the index (less if the amount of items is smaller then n)

pub fn last(&self) -> DataFilter

Get the last element in the index

pub fn last_n(&self, n: usize) -> DataFilter

Get the last n elements of the index (less if the amount of items is smaller then n)

Trait Implementations

impl<T: Clone> Clone for SortedIndex<T>

fn clone(&self) -> SortedIndex<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: PartialEq> PartialEq for SortedIndex<T>

fn eq(&self, other: &SortedIndex<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for SortedIndex<T>

impl<T> StructuralPartialEq for SortedIndex<T>