Struct shortcut::idx::BTreeIndex [−][src]
An implementation of RangeIndex using a BTreeMap.
Implementations
impl<K: Ord + Eq> BTreeIndex<K>[src]
pub fn new() -> BTreeIndex<K>[src]
Allocate a new BTreeIndex.
Trait Implementations
impl<K: Clone + Ord + Eq> Clone for BTreeIndex<K>[src]
fn clone(&self) -> BTreeIndex<K>[src]
pub fn clone_from(&mut self, source: &Self)1.0.0[src]
impl<T: Ord + Eq> EqualityIndex<T> for BTreeIndex<T>[src]
fn lookup<'a>(&'a self, key: &T) -> Box<dyn Iterator<Item = usize> + 'a>[src]
fn index(&mut self, key: T, row: usize)[src]
fn undex(&mut self, key: &T, row: usize)[src]
fn estimate(&self) -> usize[src]
impl<T: Ord + Eq + 'static + Send + Sync> From<BTreeIndex<T>> for Index<T>[src]
fn from(x: BTreeIndex<T>) -> Index<T>[src]
impl<T: Ord + Eq> RangeIndex<T> for BTreeIndex<T>[src]
Auto Trait Implementations
impl<K> RefUnwindSafe for BTreeIndex<K> where
K: RefUnwindSafe,
K: RefUnwindSafe,
impl<K> Send for BTreeIndex<K> where
K: Send,
K: Send,
impl<K> Sync for BTreeIndex<K> where
K: Sync,
K: Sync,
impl<K> Unpin for BTreeIndex<K>
impl<K> UnwindSafe for BTreeIndex<K> where
K: RefUnwindSafe,
K: RefUnwindSafe,
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,
pub 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.
pub fn to_owned(&self) -> T[src]
pub 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.
pub 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>,