Struct SimplexKey 

pub struct SimplexKey(/* private fields */);

Key type for accessing simplices in the storage map.

This creates a unique, type-safe identifier for simplices stored in the triangulation’s simplex storage. Each SimplexKey corresponds to exactly one simplex and provides efficient, stable access even as simplices are added or removed during triangulation operations.

Examples

use delaunay::prelude::*;

let vertices = [
    vertex!([0.0, 0.0]),
    vertex!([1.0, 0.0]),
    vertex!([0.0, 1.0]),
];
let dt = DelaunayTriangulationBuilder::new(&vertices).build::<()>()?;
let Some(key) = dt.tds().simplex_keys().next() else {
    return Ok(());
};
let _ = key;

Trait Implementations

impl Clone for SimplexKey

fn clone(&self) -> SimplexKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SimplexKey

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

Formats the value using the given formatter.

impl Default for SimplexKey

fn default() -> SimplexKey

Returns the “default value” for a type.

impl<'de> Deserialize<'de> for SimplexKey

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl From<KeyData> for SimplexKey

fn from(k: KeyData) -> Self

Converts to this type from the input type.

impl Hash for SimplexKey

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Key for SimplexKey

fn data(&self) -> KeyData

Gets the KeyData stored in this key.

fn null() -> Self

Creates a new key that is always invalid and distinct from any non-null key. A null key can only be created through this method (or default initialization of keys made with new_key_type!, which calls this method).

fn is_null(&self) -> bool

Checks if a key is null. There is only a single null key, that is a.is_null() && b.is_null() implies a == b.

impl Ord for SimplexKey

fn cmp(&self, other: &SimplexKey) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for SimplexKey

fn eq(&self, other: &SimplexKey) -> 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 PartialOrd for SimplexKey

fn partial_cmp(&self, other: &SimplexKey) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for SimplexKey

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for SimplexKey

impl Eq for SimplexKey

impl StructuralPartialEq for SimplexKey