hglib-rs 0.1.1

Rust implementation of python-hglib
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

// This Source Code Form is subject to the terms of the Mozilla Public
// License, v. 2.0. If a copy of the MPL was not distributed with this file,
// You can obtain one at http://mozilla.org/MPL/2.0/.

use crate::client::{Client, HglibError, Runner};
use crate::{runcommand, MkArg};

pub struct Arg<'a> {
    pub rev: &'a str,
    pub clean: bool,
    pub check: bool,
    pub date: &'a str,
}

impl<'a> Default for Arg<'a> {
    fn default() -> Self {
        Self {
            rev: "",
            clean: false,
            check: false,
            date: "",
        }
    }
}

impl<'a> Arg<'a> {
    fn run(&self, client: &mut Client) -> Result<(Vec<u8>, i32), HglibError> {
        runcommand!(
            client,
            "update",
            &[""],
            "-r",
            self.rev,
            "-C",
            self.clean,
            "-c",
            self.check,
            "-d",
            self.date
        )
    }
}

#[derive(Debug, PartialEq)]
pub struct Update {
    pub updated: u32,
    pub merged: u32,
    pub removed: u32,
    pub unresolved: u32,
}

impl Client {
    pub fn update(&mut self, x: Arg) -> Result<Update, HglibError> {
        let data = match x.run(self) {
            Ok((data, _)) => data,
            Err(err) => {
                if err.code == 1 && err.out.is_some() {
                    err.out.unwrap()
                } else {
                    return Err(err);
                }
            }
        };

        let iter = &mut data.iter();
        let n = iter.find(|x| b'0' <= **x && **x <= b'9').unwrap();
        let n = u32::from(n - b'0');

        let updated = iter
            .take_while(|x| **x != b' ')
            .fold(n, |r, x| r * 10 + u32::from(*x - b'0'));
        iter.find(|x| **x == b',').unwrap();
        iter.next();

        let merged = iter
            .take_while(|x| **x != b' ')
            .fold(0, |r, x| r * 10 + u32::from(*x - b'0'));
        iter.find(|x| **x == b',').unwrap();
        iter.next();

        let removed = iter
            .take_while(|x| **x != b' ')
            .fold(0, |r, x| r * 10 + u32::from(*x - b'0'));
        iter.find(|x| **x == b',').unwrap();
        iter.next();

        let unresolved = iter
            .take_while(|x| **x != b' ')
            .fold(0, |r, x| r * 10 + u32::from(*x - b'0'));

        Ok(Update {
            updated,
            merged,
            removed,
            unresolved,
        })
    }
}