[−][src]Struct contest_algorithms::order::SparseIndex
A simple data structure for coordinate compression
Implementations
impl SparseIndex[src]
pub fn new(coords: Vec<i64>) -> Self[src]
Builds an index, given the full set of coordinates to compress.
pub fn compress(&self, q: i64) -> Result<usize, usize>[src]
Returns Ok(i) if the coordinate q appears at index i Returns Err(i) if q appears between indices i-1 and i
Auto Trait Implementations
impl RefUnwindSafe for SparseIndex
impl Send for SparseIndex
impl Sync for SparseIndex
impl Unpin for SparseIndex
impl UnwindSafe for SparseIndex
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, 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>,