libvctrl 0.2.0

A robust, content-addressed version control engine for arbitrary data, designed for embedding into applications.
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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160

mod common;
use common::{encoder, hasher, put_blob, put_tree, setup_refs, setup_store};

use libvctrl::{
    Command, ConflictResolver, EntryKind, MergeCommand, Object, ObjectStore, ThreeWayMerger, Tree,
    TreeEntry, VctrlError,
};

struct SimpleResolver;
impl ConflictResolver for SimpleResolver {
    fn resolve(&self, _base: &[u8], _ours: &[u8], _theirs: &[u8]) -> Option<Vec<u8>> {
        None
    }
}

struct KeepOursResolver;
impl ConflictResolver for KeepOursResolver {
    fn resolve(&self, _base: &[u8], ours: &[u8], _theirs: &[u8]) -> Option<Vec<u8>> {
        Some(ours.to_vec())
    }
}

#[test]
fn merge_no_conflict() {
    let mut store = setup_store();
    let mut refs = setup_refs();
    let a1 = put_blob(&mut store, b"1");
    let b2 = put_blob(&mut store, b"2");

    let base_tree = Tree::new(vec![
        TreeEntry::new("a".into(), EntryKind::Blob, a1),
        TreeEntry::new("b".into(), EntryKind::Blob, b2),
    ])
    .unwrap();
    let base_hash = put_tree(&mut store, &base_tree);

    let b3 = put_blob(&mut store, b"3");
    let ours_tree = Tree::new(vec![
        TreeEntry::new("a".into(), EntryKind::Blob, a1),
        TreeEntry::new("b".into(), EntryKind::Blob, b3),
    ])
    .unwrap();
    let ours_hash = put_tree(&mut store, &ours_tree);

    let c4 = put_blob(&mut store, b"4");
    let theirs_tree = Tree::new(vec![
        TreeEntry::new("a".into(), EntryKind::Blob, a1),
        TreeEntry::new("b".into(), EntryKind::Blob, b2),
        TreeEntry::new("c".into(), EntryKind::Blob, c4),
    ])
    .unwrap();
    let theirs_hash = put_tree(&mut store, &theirs_tree);

    let cmd = MergeCommand {
        base: base_hash,
        ours: ours_hash,
        theirs: theirs_hash,
        merger: Box::new(ThreeWayMerger),
        resolver: Box::new(SimpleResolver),
        encoder: Box::new(encoder()),
        hasher: Box::new(hasher()),
    };
    let merged_hash = cmd.execute(&mut store, &mut refs).unwrap();
    let obj = store.get(&merged_hash).unwrap().unwrap();
    let tree = match obj {
        Object::Tree(t) => t,
        _ => panic!("expected tree"),
    };

    let mut entries = tree.into_entries();
    entries.sort_by(|a, b| a.name.cmp(&b.name));
    assert_eq!(entries.len(), 3);
    assert_eq!(entries[0].hash, a1);
    assert_eq!(entries[1].hash, b3);
    assert_eq!(entries[2].hash, c4);
}

#[test]
fn merge_conflict_blob() {
    let mut store = setup_store();
    let mut refs = setup_refs();
    let base_blob = put_blob(&mut store, b"base");
    let ours_blob = put_blob(&mut store, b"ours");
    let theirs_blob = put_blob(&mut store, b"theirs");

    let base_tree =
        Tree::new(vec![TreeEntry::new("f".into(), EntryKind::Blob, base_blob)]).unwrap();
    let base_hash = put_tree(&mut store, &base_tree);
    let ours_tree =
        Tree::new(vec![TreeEntry::new("f".into(), EntryKind::Blob, ours_blob)]).unwrap();
    let ours_hash = put_tree(&mut store, &ours_tree);
    let theirs_tree = Tree::new(vec![TreeEntry::new(
        "f".into(),
        EntryKind::Blob,
        theirs_blob,
    )])
    .unwrap();
    let theirs_hash = put_tree(&mut store, &theirs_tree);

    let cmd = MergeCommand {
        base: base_hash,
        ours: ours_hash,
        theirs: theirs_hash,
        merger: Box::new(ThreeWayMerger),
        resolver: Box::new(SimpleResolver),
        encoder: Box::new(encoder()),
        hasher: Box::new(hasher()),
    };
    let err = cmd.execute(&mut store, &mut refs).unwrap_err();
    match err {
        VctrlError::MergeConflict { entry, .. } => assert_eq!(entry, "f"),
        _ => panic!("expected MergeConflict"),
    }
}

#[test]
fn merge_resolved() {
    let mut store = setup_store();
    let mut refs = setup_refs();
    let base_blob = put_blob(&mut store, b"base");
    let ours_blob = put_blob(&mut store, b"ours");
    let theirs_blob = put_blob(&mut store, b"theirs");

    let base_tree =
        Tree::new(vec![TreeEntry::new("f".into(), EntryKind::Blob, base_blob)]).unwrap();
    let base_hash = put_tree(&mut store, &base_tree);
    let ours_tree =
        Tree::new(vec![TreeEntry::new("f".into(), EntryKind::Blob, ours_blob)]).unwrap();
    let ours_hash = put_tree(&mut store, &ours_tree);
    let theirs_tree = Tree::new(vec![TreeEntry::new(
        "f".into(),
        EntryKind::Blob,
        theirs_blob,
    )])
    .unwrap();
    let theirs_hash = put_tree(&mut store, &theirs_tree);

    let cmd = MergeCommand {
        base: base_hash,
        ours: ours_hash,
        theirs: theirs_hash,
        merger: Box::new(ThreeWayMerger),
        resolver: Box::new(KeepOursResolver),
        encoder: Box::new(encoder()),
        hasher: Box::new(hasher()),
    };
    let merged_hash = cmd.execute(&mut store, &mut refs).unwrap();
    let obj = store.get(&merged_hash).unwrap().unwrap();
    let tree = match obj {
        Object::Tree(t) => t,
        _ => panic!("expected tree"),
    };
    let entries = tree.into_entries();
    assert_eq!(entries.len(), 1);
    let blob = match store.get(&entries[0].hash).unwrap().unwrap() {
        Object::Blob(b) => b,
        _ => panic!("expected blob"),
    };
    assert_eq!(blob.into_bytes(), b"ours");
}