Struct RollingSet

pub struct RollingSet<T: Hash + Eq> { /* private fields */ }

Implementations

impl<T> RollingSet<T>

where T: Eq + Hash + Clone,

pub fn new(capacity: usize) -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn insert(&mut self, element: T)

pub fn pop(&mut self) -> Option<T>

pub fn is_empty(&self) -> bool

pub fn is_full(&self) -> bool

pub fn set_capacity(&mut self, new: usize) -> usize

pub fn capacity(&self) -> usize

pub fn remove(&mut self, element: &T) -> bool

pub fn contains(&self, element: &T) -> bool

pub fn len(&self) -> usize

pub fn clear(&mut self)

Trait Implementations

impl<T: Clone + Hash + Eq> Clone for RollingSet<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Hash + Eq> Debug for RollingSet<T>

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

Formats the value using the given formatter.

impl<T: PartialEq + Hash + Eq> PartialEq for RollingSet<T>

fn eq(&self, other: &RollingSet<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

const 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: Hash + Eq> StructuralPartialEq for RollingSet<T>