delaunay 0.8.3

D-dimensional Delaunay triangulations and convex hulls in Rust, with exact predicates, deterministic degeneracy handling, explicit topology validation, and bistellar flips for finite point sets.
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78

//! Recoverable construction and refinement transitions.
//!
//! A refinement consumes a value that already proves one invariant layer and
//! attempts to establish the next layer. Failure returns both the unchanged
//! lower-layer owner and the typed rejection reason so callers can inspect the
//! diagnostic, change repair policy, and retry without cloning canonical state.
//! Consuming builder terminals use the same carrier to retain an unfinished
//! workflow on failure; retaining a builder does not establish the completed
//! owner's invariant layers.

#![forbid(unsafe_code)]

/// A failed consuming transition together with its retained owner or builder.
///
/// `T` is the domain value accepted by the attempted transition and `E` is the
/// typed reason that construction or the stronger proof could not be completed.
/// The input is intentionally private so callers cannot accidentally separate it from the
/// failure without choosing one of the consuming accessors. It is boxed inside
/// the error so the common successful `Result` path remains compact; refinement
/// failure pays the allocation while recovery still moves the original owner.
///
/// # Examples
///
/// ```rust
/// use delaunay::refinement::RefinementError;
///
/// let failure = RefinementError::new(3_u8, "not strong enough");
/// assert_eq!(*failure.owner(), 3);
/// assert_eq!(failure.reason(), &"not strong enough");
/// assert_eq!(failure.into_parts(), (3, "not strong enough"));
/// ```
#[derive(Clone, Debug, thiserror::Error, PartialEq, Eq)]
#[error("proof refinement failed: {reason}")]
pub struct RefinementError<T, E> {
    owner: Box<T>,
    #[source]
    reason: E,
}

impl<T, E> RefinementError<T, E> {
    /// Creates a recoverable refinement failure at a checked transition boundary.
    pub fn new(owner: T, reason: E) -> Self {
        Self {
            owner: Box::new(owner),
            reason,
        }
    }

    /// Returns the retained input owner or builder.
    #[must_use]
    pub fn owner(&self) -> &T {
        &self.owner
    }

    /// Returns the typed reason the stronger proof could not be established.
    #[must_use]
    pub const fn reason(&self) -> &E {
        &self.reason
    }

    /// Recovers the input owner or builder and intentionally discards the diagnostic.
    #[must_use]
    pub fn into_owner(self) -> T {
        *self.owner
    }

    /// Recovers the diagnostic and intentionally drops the input owner or builder.
    #[must_use]
    pub fn into_reason(self) -> E {
        self.reason
    }

    /// Separates the input owner or builder from its typed rejection reason.
    #[must_use]
    pub fn into_parts(self) -> (T, E) {
        (*self.owner, self.reason)
    }
}