libvctrl 0.5.1

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

mod common;
use common::blob_hash;

use libvctrl::{DiffKind, EntryKind, Tree, TreeDiff, TreeDiffer, TreeEntry};

#[test]
fn diff_added_removed_modified() {
    let h1 = blob_hash(b"one");
    let h2 = blob_hash(b"two");
    let h3 = blob_hash(b"three");

    let old = Tree::new(vec![
        TreeEntry::new("a".into(), EntryKind::Blob, h1).unwrap(),
        TreeEntry::new("b".into(), EntryKind::Blob, h2).unwrap(),
    ])
    .unwrap();

    let new = Tree::new(vec![
        TreeEntry::new("a".into(), EntryKind::Blob, h3).unwrap(),
        TreeEntry::new("c".into(), EntryKind::Blob, h1).unwrap(),
    ])
    .unwrap();

    let differ = TreeDiffer;
    let diffs = differ.diff(&old, &new).unwrap();
    assert_eq!(diffs.len(), 3);

    let added = diffs
        .iter()
        .find(|d| matches!(d.kind, DiffKind::Added { .. }))
        .unwrap();
    assert_eq!(added.name, "c");

    let removed = diffs
        .iter()
        .find(|d| matches!(d.kind, DiffKind::Removed))
        .unwrap();
    assert_eq!(removed.name, "b");

    let modified = diffs
        .iter()
        .find(|d| matches!(d.kind, DiffKind::Modified { .. }))
        .unwrap();
    assert_eq!(modified.name, "a");
    if let DiffKind::Modified { old_hash, new_hash } = modified.kind {
        assert_eq!(old_hash, h1);
        assert_eq!(new_hash, h3);
    } else {
        panic!("expected Modified");
    }
}

#[test]
fn diff_no_changes() {
    let h = blob_hash(b"same");
    let tree = Tree::new(vec![
        TreeEntry::new("f".into(), EntryKind::Blob, h).unwrap(),
    ])
    .unwrap();
    let differ = TreeDiffer;
    let diffs = differ.diff(&tree, &tree).unwrap();
    assert!(diffs.is_empty());
}