kmp-domain 0.12.1

Domain model of the Kernel Memory Protocol: aggregates, value objects, repositories and projections, with no IO
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

use std::collections::BTreeMap;

use crate::model::KmpBundle;
use crate::value_objects::EntryLabels;

/// The labels every entry in a bundle stands in, keyed by entry ref: one
/// `contains_entry` edge is one coordinate, its `dimension` the key and its
/// `scope_id` the value. An entry with no edge has no labels and is absent
/// from the map; a selector reads that as the empty map.
pub fn labels_by_entry(bundle: &KmpBundle) -> BTreeMap<String, EntryLabels> {
    let mut coordinates = BTreeMap::<String, Vec<(String, String)>>::new();
    for relationship in bundle
        .relationships()
        .iter()
        .filter(|relationship| relationship.relationship_type() == "contains_entry")
    {
        let explanation = relationship.explanation();
        let (Some(dimension), Some(scope_id)) = (explanation.dimension(), explanation.scope_id())
        else {
            continue;
        };
        coordinates
            .entry(relationship.target_node_id().to_string())
            .or_default()
            .push((dimension.to_string(), scope_id.to_string()));
    }
    coordinates
        .into_iter()
        .map(|(ref_id, coordinates)| {
            let labels = EntryLabels::from_coordinates(
                coordinates
                    .iter()
                    .map(|(dimension, scope_id)| (dimension.as_str(), scope_id.as_str())),
            );
            (ref_id, labels)
        })
        .collect()
}