Struct FiniteSet 

pub struct FiniteSet<T: PartialEq> { /* private fields */ }

A finite set with decidable membership.

Backed by a Vec<T> with no duplicates (in insertion order).

Implementations

impl<T: PartialEq> FiniteSet<T>

pub fn new() -> Self

Create an empty finite set.

pub fn insert(&mut self, x: T) -> bool

Insert x if not already present. Returns true if inserted.

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

Returns true if x is in the set.

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

Remove x from the set. Returns true if it was present.

pub fn len(&self) -> usize

Number of elements.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.

pub fn iter(&self) -> impl Iterator<Item = &T>

Iterate over elements.

pub fn union(&self, other: &Self) -> Self

where T: Clone,

Compute the union with another set.

pub fn intersection(&self, other: &Self) -> Self

where T: Clone,

Compute the intersection with another set.

pub fn difference(&self, other: &Self) -> Self

where T: Clone,

Compute the set difference self \ other.

pub fn is_subset(&self, other: &Self) -> bool

Subset check: is self ⊆ other?

Trait Implementations

impl<T: Clone + PartialEq> Clone for FiniteSet<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + PartialEq> Debug for FiniteSet<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> Default for FiniteSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: PartialEq> FromIterator<T> for FiniteSet<T>

fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: PartialEq + PartialEq> PartialEq for FiniteSet<T>

fn eq(&self, other: &FiniteSet<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: Eq + PartialEq> Eq for FiniteSet<T>

impl<T: PartialEq> StructuralPartialEq for FiniteSet<T>