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

use crate::command::Command;
use crate::domain::commit::Commit;
use crate::domain::hash::Hash;
use crate::domain::user::UserID;
use crate::error::VctrlError;
use crate::revwalk::RevWalk;
use crate::storage::traits::{ObjectStore, RefStore};
use chrono::{DateTime, Utc};
use std::collections::HashMap;

#[derive(Debug, Clone)]
pub struct GraphCommit {
    pub hash: Hash,
    pub message: String,
    pub author: UserID,
    pub timestamp: DateTime<Utc>,
    pub parent_indices: Vec<usize>,
}

pub struct LogGraph {
    pub head: Hash,
}

impl Command for LogGraph {
    type Output = Vec<GraphCommit>;

    fn execute(
        &self,
        store: &mut dyn ObjectStore,
        _refs: &mut dyn RefStore,
    ) -> Result<Vec<GraphCommit>, VctrlError> {
        let walk = RevWalk::new(store, &[self.head])?;
        let commit_pairs: Vec<(Hash, Commit)> = walk.collect::<Result<Vec<_>, _>>()?;

        let hash_to_idx: HashMap<Hash, usize> = commit_pairs
            .iter()
            .enumerate()
            .map(|(i, (hash, _))| (*hash, i))
            .collect();

        let graph_commits = commit_pairs
            .into_iter()
            .map(|(hash, c)| {
                let parent_indices = c
                    .parents
                    .iter()
                    .filter_map(|p| hash_to_idx.get(p).copied())
                    .collect();
                GraphCommit {
                    hash,
                    message: c.message,
                    author: c.author,
                    timestamp: c.timestamp,
                    parent_indices,
                }
            })
            .collect();

        Ok(graph_commits)
    }
}