Struct ReverseSpan

pub struct ReverseSpan<S>(pub S);

A splitablespan in reverse. This is useful for making lists in descending order.

Tuple Fields

0: S

Trait Implementations

impl<S> Clone for ReverseSpan<S>

where S: Clone,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S> Debug for ReverseSpan<S>

where S: Debug,

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

Formats the value using the given formatter.

impl<S> Default for ReverseSpan<S>

where S: Default,

fn default() -> ReverseSpan<S>

Returns the “default value” for a type.

impl<S> HasLength for ReverseSpan<S>

where S: HasLength,

fn len(&self) -> usize

The number of child items in the entry. This is indexed with the size used in truncate.

fn is_empty(&self) -> bool

impl<S> Hash for ReverseSpan<S>

where S: Hash,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<S> MergableSpan for ReverseSpan<S>

where S: MergableSpan,

fn can_append(&self, other: &ReverseSpan<S>) -> bool

See if the other item can be appended to self. can_append will always be called immediately before append.

fn append(&mut self, other: ReverseSpan<S>)

Merge the passed item into self. Essentially, self = self + other.

fn prepend(&mut self, other: ReverseSpan<S>)

Append an item at the start of this item. self = other + self.

impl<S> PartialEq for ReverseSpan<S>

where S: PartialEq,

fn eq(&self, other: &ReverseSpan<S>) -> 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> SplitableSpanCtx for ReverseSpan<S>

where S: SplitableSpanCtx<Ctx = ()>,

type Ctx = ()

fn truncate_ctx( &mut self, at: usize, _ctx: &<ReverseSpan<S> as SplitableSpanCtx>::Ctx, ) -> ReverseSpan<S>

Split the entry, returning the part of the entry which was jettisoned. After truncating at pos, self.len() == pos and the returned value contains the rest of the items.

fn truncate_keeping_right_ctx( &mut self, at: usize, _ctx: &<ReverseSpan<S> as SplitableSpanCtx>::Ctx, ) -> ReverseSpan<S>

The inverse of truncate. This method mutably truncates an item, keeping all content from at..item.len() and returning the item range from 0..at.

fn split_ctx(self, at: usize, ctx: &Self::Ctx) -> (Self, Self)

impl<S> Copy for ReverseSpan<S>

where S: Copy,

impl<S> Eq for ReverseSpan<S>

where S: Eq,

impl<S> StructuralPartialEq for ReverseSpan<S>