Struct columnar::common::Slice

pub struct Slice<S> { /* private fields */ }

A struct representing a slice of a range of values.

The lower and upper bounds should be meaningfully set on construction.

Implementations

impl<S> Slice<S>

pub fn slice<R: RangeBounds<usize>>(self, range: R) -> Self

pub fn new(lower: u64, upper: u64, slice: S) -> Self

pub fn len(&self) -> usize

Trait Implementations

impl<S: Clone> Clone for Slice<S>

fn clone(&self) -> Slice<S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for Slice<S>

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

Formats the value using the given formatter.

impl<'a, S> Index for &'a Slice<S>

where &'a S: Index,

type Ref = <&'a S as Index>::Ref

The type returned by the get method.

fn get(&self, index: usize) -> Self::Ref

fn last(&self) -> Option<Self::Ref>

where Self: Len,

fn iter(&self) -> IterOwn<&Self>

fn into_iter(self) -> IterOwn<Self>

where Self: Sized,

impl<S: Index> Index for Slice<S>

type Ref = <S as Index>::Ref

The type returned by the get method.

fn get(&self, index: usize) -> Self::Ref

fn last(&self) -> Option<Self::Ref>

where Self: Len,

fn iter(&self) -> IterOwn<&Self>

fn into_iter(self) -> IterOwn<Self>

where Self: Sized,

impl<S: IndexMut> IndexMut for Slice<S>

type IndexMut<'a> = <S as IndexMut>::IndexMut<'a> where S: 'a

Type mutably referencing an indexed element.

fn get_mut(&mut self, index: usize) -> Self::IndexMut<'_>

fn last_mut(&mut self) -> Option<Self::IndexMut<'_>>

where Self: Len,

A reference to the last element, should one exist.

impl<S> Len for Slice<S>

fn len(&self) -> usize

The number of contained elements.

fn is_empty(&self) -> bool

Whether this contains no elements.

impl<S: Index> PartialEq<[<S as Index>::Ref]> for Slice<S>

where S::Ref: PartialEq,

fn eq(&self, other: &[S::Ref]) -> 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<S: Index> PartialEq<Vec<<S as Index>::Ref>> for Slice<S>

where S::Ref: PartialEq,

fn eq(&self, other: &Vec<S::Ref>) -> 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<TC: Push<TC2::Ref> + Len, TC2: Index> Push<Slice<TC2>> for Vecs<TC>

fn push(&mut self, item: Slice<TC2>)

Pushes an item onto self.

fn extend(&mut self, iter: impl IntoIterator<Item = T>)

Pushes elements of an iterator onto self.

impl<S: Copy> Copy for Slice<S>