monument 0.14.5

A fast and flexible composition generator.
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

use std::collections::HashSet;

use crate::{
    graph::{Graph, LinkSide},
    parameters::Parameters,
    prove_length::RefinedRanges,
};

/// Removes dangling references from the [`Graph`]
pub(super) fn remove_dangling_refs(
    graph: &mut Graph,
    _params: &Parameters,
    _ranges: &RefinedRanges,
) {
    // Strip dangling starts and ends
    for starts_or_ends in [&mut graph.starts, &mut graph.ends] {
        starts_or_ends.retain(|(_link_id, chunk_id)| graph.chunks.contains_key(chunk_id));
    }
    // Strip links with dangling from/to refs
    graph.links.retain(|_link_id, link| {
        if let LinkSide::Chunk(from_id) = &link.from {
            if !graph.chunks.contains_key(from_id) {
                return false;
            }
        }
        if let LinkSide::Chunk(to_id) = &link.to {
            if !graph.chunks.contains_key(to_id) {
                return false;
            }
        }
        true // Both from/to are non-dangling
    });
    // Strip dangling chunk refs (i.e. predecessor, successor or falseness)
    let chunk_ids = graph.chunks.keys().cloned().collect::<HashSet<_>>();
    for chunk in graph.chunks.values_mut() {
        chunk.successors.retain(|l| graph.links.contains(*l));
        chunk.predecessors.retain(|l| graph.links.contains(*l));
        chunk.false_chunks.retain(|id| chunk_ids.contains(id));
    }
}