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

freya_core/
layers.rs
