rita 0.1.7

Randomized Incremental Triangulation Algorithms
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46

use crate::utils::types::VertexIdx;
use core::fmt;

/// A dcel / half-edge vertex node.
///
/// A `casual node` has an index into the input vertex list.
///
/// A `conceptual node` is at infinity. Geometric operations are handled accordingly.
#[derive(PartialEq, Eq, Copy, Clone, Debug)]
pub enum VertexNode {
    /// A node that has an index into the input vertex list.
    Casual(VertexIdx),
    /// A node that is at infinity. Geometric operations are handled accordingly.
    Conceptual,
    Deleted,
}

impl VertexNode {
    /// Get the index of the node.
    pub const fn idx(&self) -> Option<VertexIdx> {
        match self {
            VertexNode::Casual(idx) => Some(*idx),
            _ => None,
        }
    }

    /// Check if the node is conceptual.
    pub const fn is_conceptual(&self) -> bool {
        matches!(self, VertexNode::Conceptual)
    }

    /// Check if the node is deleted.
    pub const fn is_deleted(&self) -> bool {
        matches!(self, VertexNode::Deleted)
    }
}

impl fmt::Display for VertexNode {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        match self {
            VertexNode::Casual(v_idx) => write!(f, "Casual({v_idx})"),
            VertexNode::Conceptual => write!(f, "Conceptual"),
            VertexNode::Deleted => write!(f, "Deleted"),
        }
    }
}