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

use crate::{
    objects::{Cycle, HalfEdge},
    storage::Handle,
};

/// Update a [`Cycle`]
pub trait UpdateCycle {
    /// Add half-edges to the cycle
    fn add_half_edges(
        &self,
        half_edges: impl IntoIterator<Item = Handle<HalfEdge>>,
    ) -> Cycle;

    /// Replace the provided half-edge
    ///
    /// # Panics
    ///
    /// Panics, unless this operation replaces exactly one half-edge.
    fn replace_half_edge(
        &self,
        original: &Handle<HalfEdge>,
        replacement: Handle<HalfEdge>,
    ) -> Cycle;

    /// Replace the half-edge at the given index
    ///
    /// # Panics
    ///
    /// Panics, unless this operation replaces exactly one half-edge.
    fn update_nth_half_edge(
        &self,
        index: usize,
        f: impl FnMut(&Handle<HalfEdge>) -> Handle<HalfEdge>,
    ) -> Cycle;
}

impl UpdateCycle for Cycle {
    fn add_half_edges(
        &self,
        half_edges: impl IntoIterator<Item = Handle<HalfEdge>>,
    ) -> Cycle {
        let half_edges = self.half_edges().cloned().chain(half_edges);
        Cycle::new(half_edges)
    }

    fn replace_half_edge(
        &self,
        original: &Handle<HalfEdge>,
        replacement: Handle<HalfEdge>,
    ) -> Cycle {
        let mut num_replacements = 0;

        let half_edges = self.half_edges().map(|half_edge| {
            if half_edge.id() == original.id() {
                num_replacements += 1;
                replacement.clone()
            } else {
                half_edge.clone()
            }
        });

        let cycle = Cycle::new(half_edges);

        assert_eq!(
            num_replacements, 1,
            "Expected operation to replace exactly one half-edge"
        );

        cycle
    }

    fn update_nth_half_edge(
        &self,
        index: usize,
        mut f: impl FnMut(&Handle<HalfEdge>) -> Handle<HalfEdge>,
    ) -> Cycle {
        let mut num_replacements = 0;

        let half_edges = self.half_edges().enumerate().map(|(i, half_edge)| {
            if i == index {
                num_replacements += 1;
                f(half_edge)
            } else {
                half_edge.clone()
            }
        });

        let cycle = Cycle::new(half_edges);

        assert_eq!(
            num_replacements, 1,
            "Expected operation to replace exactly one half-edge"
        );

        cycle
    }
}