Struct FoldableDeque 

pub struct FoldableDeque<M>
where
    M: Monoid,
{ /* private fields */ }

Implementations

impl<M> FoldableDeque<M>

where M: Monoid, <M as BinaryOp>::Set: Clone,

pub fn new() -> FoldableDeque<M>

where M: Default,

pub fn push_back(&mut self, elt: <M as BinaryOp>::Set)

pub fn push_front(&mut self, elt: <M as BinaryOp>::Set)

pub fn pop_back(&mut self) -> Option<<M as BinaryOp>::Set>

pub fn pop_front(&mut self) -> Option<<M as BinaryOp>::Set>

pub fn fold(&self, _: RangeFull) -> <M as BinaryOp>::Set

Trait Implementations

impl<M> Clone for FoldableDeque<M>

where M: Clone + Monoid, <M as BinaryOp>::Set: Clone,

fn clone(&self) -> FoldableDeque<M>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<M> Debug for FoldableDeque<M>

where M: Monoid, <M as BinaryOp>::Set: Debug,

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

Formats the value using the given formatter.

impl<M> PartialEq for FoldableDeque<M>

where M: PartialEq + Monoid, <M as BinaryOp>::Set: PartialEq,

fn eq(&self, other: &FoldableDeque<M>) -> 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<M> Eq for FoldableDeque<M>

where M: Eq + Monoid, <M as BinaryOp>::Set: Eq,

impl<M> StructuralPartialEq for FoldableDeque<M>

where M: Monoid,