ecitygml-core 0.0.1-alpha.13

Core primitives and operations for processing CityGML data.
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
120

use crate::model::core::{
    AbstractSpace, AsAbstractFeature, AsAbstractFeatureMut, AsAbstractSpace, AsAbstractSpaceMut,
    AsAbstractThematicSurfaceMut, CityObjectKind, CityObjectRef,
};
use crate::model::transportation::granularity_value::GranularityValue;
use crate::model::transportation::{TrafficArea, TrafficDirectionValue};
use crate::operations::{Visitable, Visitor};
use egml::model::basic::Code;
use egml::model::geometry::Envelope;
use nalgebra::Isometry3;

#[derive(Debug, Clone, PartialEq)]
pub struct TrafficSpace {
    pub(crate) abstract_space: AbstractSpace,
    pub traffic_area: Vec<TrafficArea>, // this should be located in boundaries the space struct
    pub(crate) function: Vec<Code>,
    pub(crate) usage: Vec<Code>,
    pub(crate) granularity: GranularityValue,
    pub(crate) traffic_direction: Option<TrafficDirectionValue>,
}

impl TrafficSpace {
    pub fn new(abstract_space: AbstractSpace, granularity: GranularityValue) -> Self {
        Self {
            abstract_space,
            traffic_area: Vec::new(),
            function: Vec::new(),
            usage: Vec::new(),
            granularity,
            traffic_direction: None,
        }
    }

    pub fn iter_city_object<'a>(&'a self) -> impl Iterator<Item = CityObjectRef<'a>> + 'a {
        std::iter::once(CityObjectRef::TrafficSpace(self))
            .chain(self.traffic_area.iter().flat_map(|x| x.iter_city_object()))
    }

    pub fn refresh_bounded_by_recursive(&mut self) {
        self.traffic_area
            .iter_mut()
            .for_each(|x| x.refresh_bounded_by());

        let own_envelope = self.compute_envelope();
        let envelopes: Vec<&Envelope> = own_envelope
            .as_ref()
            .into_iter()
            .chain(self.traffic_area.iter().filter_map(|x| x.bounded_by()))
            .collect();

        self.set_bounded_by(Envelope::from_envelopes(&envelopes));
    }

    pub fn apply_transform_recursive(&mut self, m: &Isometry3<f64>) {
        self.abstract_space.apply_transform(m);

        self.traffic_area
            .iter_mut()
            .for_each(|x| x.apply_transform(m));
    }

    pub fn function(&self) -> &Vec<Code> {
        &self.function
    }

    pub fn set_function(&mut self, function: Vec<Code>) {
        self.function = function;
    }

    pub fn usage(&self) -> &Vec<Code> {
        &self.usage
    }

    pub fn set_usage(&mut self, usage: Vec<Code>) {
        self.usage = usage;
    }

    pub fn granularity(&self) -> &GranularityValue {
        &self.granularity
    }

    pub fn set_granularity(&mut self, granularity: GranularityValue) {
        self.granularity = granularity;
    }

    pub fn traffic_direction(&self) -> &Option<TrafficDirectionValue> {
        &self.traffic_direction
    }

    pub fn set_traffic_direction(&mut self, traffic_direction: Option<TrafficDirectionValue>) {
        self.traffic_direction = traffic_direction;
    }
}

impl AsAbstractSpace for TrafficSpace {
    fn abstract_space(&self) -> &AbstractSpace {
        &self.abstract_space
    }
}

impl AsAbstractSpaceMut for TrafficSpace {
    fn abstract_space_mut(&mut self) -> &mut AbstractSpace {
        &mut self.abstract_space
    }
}

crate::impl_abstract_space_traits!(TrafficSpace);

impl From<TrafficSpace> for CityObjectKind {
    fn from(item: TrafficSpace) -> Self {
        CityObjectKind::TrafficSpace(item)
    }
}

impl Visitable for TrafficSpace {
    fn accept<V: Visitor>(&self, visitor: &mut V) {
        visitor.visit_traffic_space(self);
        self.traffic_area.iter().for_each(|x| x.accept(visitor));
    }
}