Struct RVec

pub struct RVec<T>(/* private fields */);

Reversed vector

Trait Implementations

impl<T, Extra: Copy> AstImpl<Extra> for RVec<T>

where Self: Prepend<Extra>, <Self as Prepend<Extra>>::Item: AstImpl<Extra>,

fn ast<'lifetime>( input: &'lifetime str, stack: &'lifetime [Tag], with: Extra, ) -> (&'lifetime [Tag], Self)

impl<T: Clone> Clone for RVec<T>

fn clone(&self) -> RVec<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for RVec<T>

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

Formats the value using the given formatter.

impl<T> Index<usize> for RVec<T>

type Output = T

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

impl<T> IntoIterator for RVec<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = Rev<IntoIter<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: PartialEq> PartialEq for RVec<T>

fn eq(&self, other: &RVec<T>) -> 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<T, Extra: Copy> Prepend<Extra> for RVec<T>

type Item = T

fn empty(_: Extra) -> Self

fn prepend(&mut self, value: Self::Item, _: Extra)

impl<T: Eq> Eq for RVec<T>

impl<T> StructuralPartialEq for RVec<T>