Trait RawDomain 

pub trait RawDomain {
    type Key;

    // Required method
    fn len(&self) -> usize;

    // Provided method
    fn is_empty(&self) -> bool { ... }
}

RawDomain is a trait that defines the behavior of a store that holds the vertices associated with a hyperedge or hyperfacet. It is used to abstract over different implementations of edge storage, such as arrays, vectors, or sets.

note: The trait is sealed to prevent external implementations, ensuring that only the crate can define how edges are stored. This is to maintain consistency and prevent misuse of the trait in different contexts.

Required Associated Types

type Key

Required Methods

fn len(&self) -> usize

returns the number of vertices associated with the edge.

Provided Methods

fn is_empty(&self) -> bool

returns true if there are no points.

Implementations on Foreign Types

impl<I> RawDomain for &[VertexId<I>]

where I: RawIndex,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<I> RawDomain for (VertexId<I>, VertexId<I>)

where I: RawIndex,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<I> RawDomain for BTreeSet<VertexId<I>>

where I: RawIndex,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<I> RawDomain for VecDeque<VertexId<I>>

where I: RawIndex,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<I> RawDomain for Vec<VertexId<I>>

where I: RawIndex,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<I> RawDomain for [VertexId<I>]

where I: RawIndex,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<I, S> RawDomain for HashSet<VertexId<I>, S>

where I: RawIndex, S: BuildHasher,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

impl<const N: usize, I> RawDomain for [VertexId<I>; N]

where I: RawIndex,

type Key = IndexBase<I>

fn len(&self) -> usize

fn is_empty(&self) -> bool

Implementors