[−][src]Struct queriable_storage::SortedIndex
Index of a DataStore.
Implementations
impl<T> SortedIndex<T> where
T: Ord,
[src]
T: Ord,
pub fn new<F, U>(data_store: &QueriableDataStore<U>, index_provider: F) -> Self where
F: Fn(&U) -> T,
[src]
F: Fn(&U) -> T,
pub fn filter_range<R>(&self, range: R) -> DataFilter where
R: RangeBounds<T>,
[src]
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
[src]
&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
[src]
Get a new DataFilter for all items that are equivalent to the given value.
pub fn filter_gt(&self, lower_limit: T) -> DataFilter
[src]
Get a new DataFilter for all items that are greater than the given value.
pub fn filter_gte(&self, lower_limit: T) -> DataFilter
[src]
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
[src]
Get a new DataFilter for all items that are less than the given value.
pub fn filter_lte(&self, upper_limit: T) -> DataFilter
[src]
Get a new DataFilter for all items that are less than ore equal to the given value.
Trait Implementations
impl<T: Clone> Clone for SortedIndex<T>
[src]
fn clone(&self) -> SortedIndex<T>
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl<T: Eq> Eq for SortedIndex<T>
[src]
impl<T: PartialEq> PartialEq<SortedIndex<T>> for SortedIndex<T>
[src]
fn eq(&self, other: &SortedIndex<T>) -> bool
[src]
fn ne(&self, other: &SortedIndex<T>) -> bool
[src]
impl<T> StructuralEq for SortedIndex<T>
[src]
impl<T> StructuralPartialEq for SortedIndex<T>
[src]
Auto Trait Implementations
impl<T> RefUnwindSafe for SortedIndex<T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<T> Send for SortedIndex<T> where
T: Send,
T: Send,
impl<T> Sync for SortedIndex<T> where
T: Sync,
T: Sync,
impl<T> Unpin for SortedIndex<T> where
T: Unpin,
T: Unpin,
impl<T> UnwindSafe for SortedIndex<T> where
T: RefUnwindSafe + UnwindSafe,
T: RefUnwindSafe + UnwindSafe,
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,