Struct GSet 

pub struct GSet<T: Ord>(/* private fields */);

A grow-only set (G-Set). Elements can be added but never removed.

Merge semantics: set union.

Implementations

impl<T: Ord> GSet<T>

pub fn new() -> Self

Create an empty set.

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

Insert an element. Returns true if the element was newly inserted.

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

Returns true if the set contains the given element.

pub fn len(&self) -> usize

Returns the number of elements.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator over the elements in sorted order.

Trait Implementations

impl<T: Clone + Ord> Clone for GSet<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Ord> Debug for GSet<T>

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

Formats the value using the given formatter.

impl<T: Ord> Default for GSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for GSet<T>

where T: Deserialize<'de> + Ord,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a, T: Ord> IntoIterator for &'a GSet<T>

type Item = &'a T

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T: Ord> IntoIterator for GSet<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = 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: Ord + Clone + PartialEq> Lattice for GSet<T>

fn merge(&self, other: &Self) -> Self

Compute the least upper bound of self and other.

impl<T: PartialEq + Ord> PartialEq for GSet<T>

fn eq(&self, other: &GSet<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> Serialize for GSet<T>

where T: Serialize + Ord,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq + Ord> Eq for GSet<T>

impl<T: Ord> StructuralPartialEq for GSet<T>