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

use std::collections::BTreeSet;

#[derive(Clone, Debug, PartialEq, Eq)]
pub struct Node {
    pub commit: std::rc::Rc<crate::legacy::git::Commit>,
    pub branches: Vec<crate::legacy::git::Branch>,
    pub action: crate::legacy::graph::Action,
    pub pushable: bool,
    pub children: BTreeSet<git2::Oid>,
}

impl Node {
    pub fn new(commit: std::rc::Rc<crate::legacy::git::Commit>) -> Self {
        let branches = Vec::new();
        let children = BTreeSet::new();
        Self {
            commit,
            branches,
            action: crate::legacy::graph::Action::Pick,
            pushable: false,
            children,
        }
    }

    pub fn with_branches(mut self, possible_branches: &mut crate::legacy::git::Branches) -> Self {
        self.branches = possible_branches.remove(self.commit.id).unwrap_or_default();
        self
    }

    pub fn update(&mut self, mut other: Self) {
        assert_eq!(self.commit.id, other.commit.id);

        let mut branches = Vec::new();
        std::mem::swap(&mut other.branches, &mut branches);
        self.branches.extend(branches);

        if other.action != crate::legacy::graph::Action::Pick {
            self.action = other.action;
        }

        if other.pushable {
            self.pushable = true;
        }

        self.children.extend(other.children);
    }
}