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
use std::collections::BTreeSet;

use crate::{builder::SolidBuilder, stores::Stores};

use super::{Face, Shell};

/// A 3-dimensional shape
///
/// # Implementation Note
///
/// The shells that form the boundaries of the solid must not intersect. This is
/// not currently validated.
#[derive(Clone, Debug, Eq, PartialEq, Hash, Ord, PartialOrd)]
pub struct Solid {
    shells: BTreeSet<Shell>,
}

impl Solid {
    /// Build a `Solid` using [`SolidBuilder`]
    pub fn builder(stores: &Stores) -> SolidBuilder {
        SolidBuilder { stores }
    }

    /// Construct an empty instance of `Solid`
    pub fn new() -> Self {
        Self {
            shells: BTreeSet::new(),
        }
    }

    /// Add shells to the solid
    ///
    /// Consumes the solid and returns the updated instance.
    pub fn with_shells(
        mut self,
        shells: impl IntoIterator<Item = impl Into<Shell>>,
    ) -> Self {
        let shells = shells.into_iter().map(Into::into);
        self.shells.extend(shells);
        self
    }

    /// Access the solid's shells
    pub fn shells(&self) -> impl Iterator<Item = &Shell> {
        self.shells.iter()
    }

    /// Convert the solid into a list of shells
    pub fn into_shells(self) -> impl Iterator<Item = Shell> {
        self.shells.into_iter()
    }

    /// Find the given face in this solid
    pub fn find_face(&self, face: &Face) -> Option<Face> {
        for shell in self.shells() {
            if let Some(face) = shell.find_face(face) {
                return Some(face);
            }
        }

        None
    }
}

impl Default for Solid {
    fn default() -> Self {
        Self::new()
    }
}