Trait Collection 

pub trait Collection {
    type Item;

    // Required methods
    fn contains(&self, point: &Self::Item) -> bool;
    fn is_empty(&self) -> bool;
}

A trait for collections that support basic set operations.

This trait defines fundamental operations applicable to various collection types, focusing on item containment and checking for emptiness.

Type Parameters

• Item: The type of elements contained within the collection.

Implementations

Implementations are provided for:

• HashSet<T, S>: Where T: Hash + Eq + Clone and S: BuildHasher + Default.
• BTreeSet<T>: Where T: Ord + Clone.
• Vec<T>: Where T: PartialEq.

Required Associated Types

type Item

The type of elements stored in the collection.

Required Methods

fn contains(&self, point: &Self::Item) -> bool

Checks if an item is present in the collection.

Arguments

• point: A reference to the item to check for containment.

Returns

true if the item is found in the collection, false otherwise.

fn is_empty(&self) -> bool

Determines if the collection is empty.

Returns

• true if the collection contains no items.
• false if the collection contains one or more items.

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl<T, S> Collection for HashSet<T, S>

where T: Hash + Eq + Clone, S: BuildHasher + Default,

fn contains(&self, point: &<HashSet<T, S> as Collection>::Item) -> bool

Checks if the HashSet contains the specified item. This is a direct wrapper around HashSet::contains.

fn is_empty(&self) -> bool

Checks if the HashSet is empty. This is a direct wrapper around HashSet::is_empty.

type Item = T

impl<T> Collection for BTreeSet<T>

where T: Ord + Clone,

fn contains(&self, point: &<BTreeSet<T> as Collection>::Item) -> bool

Checks if the BTreeSet contains the specified item. This is a direct wrapper around BTreeSet::contains.

fn is_empty(&self) -> bool

Checks if the BTreeSet is empty. This is a direct wrapper around BTreeSet::is_empty.

type Item = T

impl<T> Collection for Vec<T>

where T: PartialEq,

fn contains(&self, point: &<Vec<T> as Collection>::Item) -> bool

Checks if the Vec contains the specified item by iterating through its elements.

fn is_empty(&self) -> bool

Checks if the Vec is empty. This is a direct wrapper around Vec::is_empty.

type Item = T

Implementors

impl<T> Collection for Complex<T>

where T: ComplexElement,

Implementation of Collection for complexes.

Provides basic set-theoretic operations for checking element membership and complex emptiness. Note that containment is based on ID equality, so elements must have been added to the complex to be considered contained.

type Item = T

impl<T> Collection for Lattice<T>

where T: Hash + Eq + Clone,

type Item = T

impl<V> Collection for Graph<V, Directed>

where V: PartialOrd + Eq + Hash + Clone,

type Item = VertexOrEdge<V>

impl<V> Collection for Graph<V, Undirected>

where V: PartialOrd + Eq + Hash + Clone,

type Item = VertexOrEdge<V>

impl<const N: usize> Collection for Cloud<N>

type Item = Matrix<f64, Const<N>, Const<1>, ArrayStorage<f64, N, 1>>