Struct flatk::chunked::SortedChunks

pub struct SortedChunks<O = Vec<usize>> { /* fields omitted */ }

An annotated offset collection to be used as indices for Chunked collections that indicates if the indexed chunks are indeed sorted. Note that offsets themeselves are always sorted. This type annotates whether the data is sorted when this type is used for the offsets in Chunked types.

Methods

impl<O: AsRef<[usize]>> SortedChunks<O>

pub fn new(offsets: O) -> Self

Trait Implementations

impl<O: AsMut<[usize]>> AsMut<[usize]> for SortedChunks<O>

fn as_mut(&mut self) -> &mut [usize]

Performs the conversion.

impl<O: AsRef<[usize]>> AsRef<[usize]> for SortedChunks<O>

fn as_ref(&self) -> &[usize]

Performs the conversion.

impl Clear for SortedChunks

fn clear(&mut self)

Remove all elements from the current set without necessarily deallocating the space previously used.

impl<O: Clone> Clone for SortedChunks<O>

fn clone(&self) -> SortedChunks<O>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<O: Copy> Copy for SortedChunks<O>

impl<O: Debug> Debug for SortedChunks<O>

fn fmt(&self, f: &mut Formatter) -> Result

Formats the value using the given formatter.

impl Default for SortedChunks<Vec<usize>>

A default set of offsets must allocate.

fn default() -> Self

Returns the "default value" for a type.

impl<O: Dummy> Dummy for SortedChunks<O>

unsafe fn dummy() -> Self

impl<O: AsRef<[usize]>> From<O> for SortedChunks<O>

fn from(offsets: O) -> Self

Performs the conversion.

impl<O: FromIterator<usize> + AsRef<[usize]>> FromIterator<usize> for SortedChunks<O>

fn from_iter<T>(iter: T) -> Self where
    T: IntoIterator<Item = usize>, 

Creates a value from an iterator.

impl<'a, O: Get<'a, Range<usize>>> GetIndex<'a, SortedChunks<O>> for Range<usize>

type Output = SortedChunks<O::Output>

fn get(self, sorted_chunks: &SortedChunks<O>) -> Option<Self::Output>

impl<I: SliceIndex<[usize]>, O: AsRef<[usize]>> Index<I> for SortedChunks<O>

type Output = I::Output

The returned type after indexing.

fn index(&self, index: I) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<I: SliceIndex<[usize]>, O: AsRef<[usize]> + AsMut<[usize]>> IndexMut<I> for SortedChunks<O>

fn index_mut(&mut self, index: I) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<O: AsRef<[usize]>> IndexRange for SortedChunks<O>

fn index_range(&self, range: Range<usize>) -> Option<Range<usize>>

Return the [begin..end) bound of the chunk at the given index.

impl<O: IntoIterator> IntoIterator for SortedChunks<O>

type Item = O::Item

The type of the elements being iterated over.

type IntoIter = O::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<O: IntoOwned> IntoOwned for SortedChunks<O>

type Owned = SortedChunks<O::Owned>

fn into_owned(self) -> Self::Owned

fn clone_into(self, target: &mut Self::Owned)

impl<O: Isolate<Range<usize>>> IsolateIndex<SortedChunks<O>> for Range<usize>

type Output = SortedChunks<O::Output>

fn try_isolate(self, sorted_chunks: SortedChunks<O>) -> Option<Self::Output>

impl<O: PartialEq> PartialEq<SortedChunks<O>> for SortedChunks<O>

fn eq(&self, other: &SortedChunks<O>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &SortedChunks<O>) -> bool

This method tests for !=.

impl<O: Push<usize>> Push<usize> for SortedChunks<O>

fn push(&mut self, item: usize)

impl<O: RemovePrefix> RemovePrefix for SortedChunks<O>

fn remove_prefix(&mut self, n: usize)

Remove n elements from the beginning.

impl<O: Reserve> Reserve for SortedChunks<O>

fn reserve_with_storage(&mut self, n: usize, storage_n: usize)

fn reserve(&mut self, n: usize)

impl<O: Set> Set for SortedChunks<O>

type Elem = O::Elem

Owned element of the set.

type Atom = O::Atom

The most basic element contained by this collection. If this collection contains other collections, this type should be different than Elem.

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<'a> SplitOffsetsAt for SortedChunks<&'a [usize]>

fn split_offsets_at(
    self,
    mid: usize
) -> (SortedChunks<&'a [usize]>, SortedChunks<&'a [usize]>, usize)

impl<O> StructuralPartialEq for SortedChunks<O>

impl<O: Truncate> Truncate for SortedChunks<O>

fn truncate(&mut self, new_len: usize)

impl<'a, O: AsRef<[usize]>> View<'a> for SortedChunks<O>

type Type = SortedChunks<&'a [usize]>

fn view(&'a self) -> Self::Type

impl<'a, O: AsMut<[usize]>> ViewMut<'a> for SortedChunks<O>

type Type = SortedChunks<&'a mut [usize]>

fn view_mut(&'a mut self) -> Self::Type

impl<O: Viewed> Viewed for SortedChunks<O>