loro-internal 1.11.1

Loro internal library. Do not use it directly as it's not stable.
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

use std::collections::HashSet;

use crate::{
    dag::{Dag, DagNode},
    id::ID,
    version::Frontiers,
};

fn get_all_points<T: DagNode, D: Dag<Node = T>>(graph: &D, points: &mut HashSet<ID>, current: &ID) {
    points.insert(*current);
    for to_id in graph.get(*current).unwrap().deps().iter() {
        get_all_points(graph, points, &to_id);
    }
}

pub fn get_end_list<T: DagNode, D: Dag<Node = T>>(graph: &D, start_list: &Frontiers) -> Frontiers {
    let mut end_set: HashSet<ID> = HashSet::new();
    for start_id in start_list.iter() {
        end_dfs(graph, &start_id, &mut end_set);
    }
    end_set.into_iter().collect()
}

fn end_dfs<T: DagNode, D: Dag<Node = T>>(graph: &D, current: &ID, end_set: &mut HashSet<ID>) {
    let binding = graph.get(*current).unwrap();
    let deps = binding.deps();
    if deps.is_empty() {
        end_set.insert(*current);
    }
    for to_id in deps.iter() {
        end_dfs(graph, &to_id, end_set);
    }
}

pub fn calc_critical_version_dfs<T: DagNode, D: Dag<Node = T>>(
    graph: &D,
    start_list: &Frontiers,
    end_list: &Frontiers,
) -> Vec<ID> {
    let mut result: Vec<ID> = vec![];
    let mut points: HashSet<ID> = HashSet::new();
    let start_list_set: HashSet<ID> = HashSet::from_iter(start_list.iter());
    let end_list_set: HashSet<ID> = HashSet::from_iter(end_list.iter());
    for start_id in start_list.iter() {
        get_all_points(graph, &mut points, &start_id);
    }
    for escape in points {
        let mut flag = false;
        for start_id in start_list.iter() {
            if dfs(graph, &start_id, &escape, &end_list_set) {
                flag = true;
                break;
            }
        }
        if flag {
            continue;
        }
        if !end_list_set.contains(&escape) && !start_list_set.contains(&escape) {
            result.push(escape);
        }
    }
    result
}

fn dfs<T: DagNode, D: Dag<Node = T>>(
    graph: &D,
    current: &ID,
    escape: &ID,
    end_list_set: &HashSet<ID>,
) -> bool {
    if current == escape {
        return false;
    }
    if end_list_set.contains(current) {
        return true;
    }
    for to_id in graph.get(*current).unwrap().deps().iter() {
        if dfs(graph, &to_id, escape, end_list_set) {
            return true;
        }
    }
    false
}