freya_core/
layers.rs

1use std::ops::{
2    Deref,
3    DerefMut,
4};
5
6use rustc_hash::{
7    FxHashMap,
8    FxHashSet,
9};
10
11use crate::node_id::NodeId;
12
13#[derive(Clone, Copy, Debug, PartialEq)]
14pub enum Layer {
15    Relative(i16),
16    Overlay,
17}
18
19impl Default for Layer {
20    fn default() -> Self {
21        Layer::Relative(0)
22    }
23}
24
25impl From<i16> for Layer {
26    fn from(value: i16) -> Self {
27        Layer::Relative(value)
28    }
29}
30
31#[derive(Default, Clone, Debug, PartialEq)]
32pub struct Layers(FxHashMap<i16, FxHashSet<NodeId>>);
33
34impl Layers {
35    /// Insert the given [NodeId] in the given layer. Will create an entry for the layer if missing.
36    pub fn insert_node_in_layer(&mut self, node_id: NodeId, layer_n: i16) {
37        let layer = self.0.entry(layer_n).or_default();
38        layer.insert(node_id);
39    }
40
41    /// Remove the [NodeId] from the given layer. Will remove the entry of the layer if it becomes empty.
42    pub fn remove_node_from_layer(&mut self, node_id: &NodeId, layer_n: i16) {
43        let layer = self.0.get_mut(&layer_n);
44        if let Some(layer) = layer {
45            layer.remove(node_id);
46
47            if layer.is_empty() {
48                self.0.remove(&layer_n);
49            }
50        }
51    }
52}
53
54impl Deref for Layers {
55    type Target = FxHashMap<i16, FxHashSet<NodeId>>;
56
57    fn deref(&self) -> &Self::Target {
58        &self.0
59    }
60}
61
62impl DerefMut for Layers {
63    fn deref_mut(&mut self) -> &mut Self::Target {
64        &mut self.0
65    }
66}
freya_core/layers.rs

freya_core/
layers.rs
