boostvoronoi 0.12.1

Boost voronoi ported to 100% 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

// SPDX-License-Identifier:BSL-1.0

// Boost.Polygon library detail/voronoi_structures.hpp header file

//          Copyright Andrii Sydorchuk 2010-2012.
// Distributed under the Boost Software License, Version 1.0.
//    (See accompanying file LICENSE_1_0.txt or copy at
//          http://www.boost.org/LICENSE_1_0.txt)

// See http://www.boost.org for updates, documentation, and revision history of C++ code.

// Ported from C++ boost 1.76.0 to Rust in 2020/2021,2025 by Eadf (github.com/eadf)

use crate::InputType;
use crate::beach_line::{BeachLine, BeachLineNodeData, BeachLineNodeKey, BeachlineCursor};
use cpp_map::prelude::*;
use std::cell::RefCell;
use std::cmp::Ordering;
use std::fmt;
use std::hash::{Hash, Hasher};
use std::rc::Rc;

impl fmt::Debug for BeachLineNodeData {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "BeachLineNodeData{{circle_event:")?;
        match self.circle_event_ {
            Some(idx) => write!(f, "{idx},")?,
            None => write!(f, "-,")?,
        };
        write!(f, "edge_:{:?}", self.edge_)?;
        write!(f, "}}")
    }
}

impl<I: InputType> Default for BeachLine<I> {
    fn default() -> Self {
        Self {
            beach_line_: Rc::from(RefCell::from(SkipList::default())),
        }
    }
}

impl<I: InputType> fmt::Debug for BeachLine<I> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        writeln!(f,)?;
        for (index, node) in self.beach_line_.borrow().iter().enumerate() {
            writeln!(f, "{index}: {node:?}")?;
        }
        writeln!(f,)
    }
}

impl<I: InputType> fmt::Debug for BeachLineNodeKey<I> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(f, "L:{:?},R:{:?}", &self.left_site(), &self.right_site())
    }
}

impl<I: InputType> Ord for BeachLineNodeKey<I> {
    // todo: move the content of node_comparison_predicate to here
    #[inline(always)]
    fn cmp(&self, other: &Self) -> Ordering {
        if crate::predicate::node_comparison_predicate::node_comparison::<I>(self, other) {
            Ordering::Less
        } else if crate::predicate::node_comparison_predicate::node_comparison::<I>(other, self) {
            Ordering::Greater
        } else {
            Ordering::Equal
        }
    }
}

impl<I: InputType> PartialOrd for BeachLineNodeKey<I> {
    #[inline(always)]
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(other))
    }
}

impl<I: InputType> PartialEq for BeachLineNodeKey<I> {
    // todo: node1.cmp(node2)==Ordering.Equal is not the same as node1 == node2, should it be?
    #[inline(always)]
    fn eq(&self, other: &Self) -> bool {
        self.left_site_ == other.left_site_ && self.right_site_ == other.right_site_
    }
}

impl<I: InputType> IsLessThan for BeachLineNodeKey<I> {
    // todo: move the content of node_comparison_predicate to here
    #[inline(always)]
    fn is_less_than(&self, other: &Self) -> bool {
        crate::predicate::node_comparison_predicate::node_comparison::<I>(self, other)
    }
}

impl<I: InputType> Eq for BeachLineNodeKey<I> {}

impl<I: InputType> Hash for BeachLineNodeKey<I> {
    #[inline(always)]
    fn hash<H: Hasher>(&self, state: &mut H) {
        self.left_site_.hash(state);
        self.right_site_.hash(state);
    }
}

impl<I: InputType> fmt::Debug for BeachlineCursor<I> {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        writeln!(f, "PIterator({:?})", self.current)
    }
}