cgar 0.2.0

CGAL-like computational geometry library in Rust
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
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119

// SPDX-License-Identifier: MIT
//
// Copyright (c) 2025 Alexandre Severino
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

use num_traits::ToPrimitive;

use crate::{
    numeric::{cgar_f64::CgarF64, cgar_rational::CgarRational, lazy_exact::LazyExact},
    operations::*,
};

use std::{
    hash::Hash,
    ops::{Add, AddAssign, Div, Mul, Neg, Sub, SubAssign},
};

use std::fmt::Debug;

pub trait FromRef<T> {
    fn from_ref(value: &T) -> Self;
}

pub trait RefInto<T> {
    fn ref_into(&self) -> T;
}

pub trait Scalar:
    Clone
    + Add<Output = Self>
    + Sub<Output = Self>
    + Mul<Output = Self>
    + Div<Output = Self>
    + for<'a> AddAssign<&'a Self>
    + for<'a> SubAssign<&'a Self>
    + Default
    + Debug
    + Abs
    + Zero
    + One
    + Neg<Output = Self>
    + Eq
    + PartialEq
    + ToPrimitive
    + Hash
    + PartialOrd
    + From<i32>
    + From<f64>
    + From<rug::Rational>
    + From<CgarF64>
    + From<CgarRational>
    + From<LazyExact>
    + Into<CgarF64>
    + FromRef<CgarF64>
    + FromRef<CgarRational>
    + FromRef<LazyExact>
    + RefInto<CgarF64>
    + RefInto<CgarRational>
    + RefInto<LazyExact>
{
    fn min(self, other: Self) -> Self {
        if self < other { self } else { other }
    }
    fn max(self, other: Self) -> Self {
        if self > other { self } else { other }
    }

    fn sign(&self) -> i8;

    fn from_num_den(num: i32, den: i32) -> Self;

    fn cmp_ref(a: &Self, b: &Self) -> core::cmp::Ordering;

    fn tolerance() -> Self;

    fn tolerance_squared() -> Self;

    // CGAL-style: separate thresholds for different purposes
    fn point_merge_threshold() -> Self;

    fn edge_degeneracy_threshold() -> Self;

    fn area_degeneracy_threshold() -> Self;

    fn query_tolerance() -> Self;

    fn query_tolerance_squared() -> Self;

    fn point_merge_threshold_squared() -> Self;

    fn approx_eq(&self, other: &Self) -> bool;

    fn as_f64_fast(&self) -> Option<f64>;

    /// Try to get a double interval [lo, hi] containing this value
    /// Returns None if the approximation is unreliable
    fn double_interval(&self) -> Option<(f64, f64)> {
        None // Default implementation for non-LazyExact types
    }

    fn ball_center_f64(&self) -> f64;
}