laumann/pijul - Change XGH2A4BOZGNLDBVWOZNWODSJSTU4VCTNLP25T3LNXJUQBS2FDIUQC

Formatting/Cleanup

Created by pmeunier on October 19, 2021

XGH2A4BOZGNLDBVWOZNWODSJSTU4VCTNLP25T3LNXJUQBS2FDIUQC

Dependencies

In channels

main

Change contents

Insertion in "shell.nix" at line 7 [6.12]
[5.116]
[5.116]
```
    xxHash
```
Insertion in "libpijul/src/lib.rs" at line 77 [6.717381]
[7.83668]
[8.4030]
```
#[cfg(feature = "deterministic_hash")]
```

Insertion in "libpijul/src/lib.rs" at line 79 [6.717381]

[8.4100]

[9.2918]

#[cfg(not(feature = "deterministic_hash"))]
pub type Hasher = std::collections::hash_map::RandomState;

Deletion in "libpijul/src/lib.rs" at line 84 [6.717381]

∅:D[9.3044] → [7.83890:84088]

∅:D[8.4189] → [7.83890:84088]

B:BD[7.83890] → [7.83890:84088]

// pub type HashMap<K, V> = std::collections::HashMap<K, V, std::collections::hash_map::RandomState>;
// pub type HashSet<K> = std::collections::HashSet<K, std::collections::hash_map::RandomState>;

Deletion in "libpijul/src/find_alive.rs" at line 101 [6.763306]
B:BD[10.881] → [10.881:928]
```
                    stack.truncate(elt_index);
```
Replacement in "libpijul/src/changestore/mod.rs" at line 7 [6.817216]
B:BD[11.4262] → [3.1033:1082]
```
    change::{Change, ChangeHeader, ChangeError},
```
[11.4262]
[11.4298]
```
    change::{Change, ChangeError, ChangeHeader},
```

Replacement in "libpijul/src/changestore/memory.rs" at line 95 [6.820702]

B:BD[6.823259] → [3.1296:1455]

    fn save_change<E: From<Self::Error> + From<ChangeError>, F: FnOnce(&mut Change, &Hash) -> Result<(), E>>(&self, p: &mut Change, f: F) -> Result<Hash, E> {

[6.823259]

[6.823330]

    fn save_change<
        E: From<Self::Error> + From<ChangeError>,
        F: FnOnce(&mut Change, &Hash) -> Result<(), E>,
    >(
        &self,
        p: &mut Change,
        f: F,
    ) -> Result<Hash, E> {

Replacement in "libpijul/src/changestore/filesystem.rs" at line 202 [6.824013]

B:BD[6.830156] → [3.1543:1703]

    fn save_change<E: From<Self::Error> + From<ChangeError>, F: FnOnce(&mut Change, &Hash) -> Result<(), E>>(&self, p: &mut Change, ff: F) -> Result<Hash, E> {

[6.830156]

[3.1703]

    fn save_change<
        E: From<Self::Error> + From<ChangeError>,
        F: FnOnce(&mut Change, &Hash) -> Result<(), E>,
    >(
        &self,
        p: &mut Change,
        ff: F,
    ) -> Result<Hash, E> {

Replacement in "libpijul/src/changestore/filesystem.rs" at line 212 [6.824013]

B:BD[3.1806] → [3.1806:1864]

            Err(e) => return Err(E::from(Error::from(e)))

[3.1806]

[3.1864]

            Err(e) => return Err(E::from(Error::from(e))),

Replacement in "libpijul/src/changestore/filesystem.rs" at line 220 [6.824013]
B:BD[3.1988] → [3.1988:2036]
```
            return Err(E::from(Error::from(e)))
```
[3.1988]
[3.2036]
```
            return Err(E::from(Error::from(e)));
```
Replacement in "libpijul/src/changestore/filesystem.rs" at line 224 [6.824013]
B:BD[3.2094] → [3.2094:2142]
```
            return Err(E::from(Error::from(e)))
```
[3.2094]
[3.2142]
```
            return Err(E::from(Error::from(e)));
```

Replacement in "libpijul/src/change.rs" at line 1219 [6.831311]

B:BD[2.2466] → [2.2466:2519]

            |l| Local { path: l.path, line: l.line }

[2.2466]

[2.2519]

            |l| Local {
                path: l.path,
                line: l.line,
            },

Replacement in "libpijul/src/change.rs" at line 1336 [6.831311]

B:BD[6.870081] → [3.2153:2300]

    pub fn serialize<W: Write, E: From<ChangeError>, F: FnOnce(&mut Self, &Hash) -> Result<(), E>>(&mut self, mut w: W, f: F) -> Result<Hash, E> {

[6.870081]

[6.870244]

    pub fn serialize<
        W: Write,
        E: From<ChangeError>,
        F: FnOnce(&mut Self, &Hash) -> Result<(), E>,
    >(
        &mut self,
        mut w: W,
        f: F,
    ) -> Result<Hash, E> {

Replacement in "libpijul/src/change.rs" at line 1378 [6.831311]

B:BD[6.871342] → [3.2410:2507]

        debug!("compressed {:?} bytes of contents in {:?}", self.contents.len(), now.elapsed());

[6.871342]

[12.6559]

        debug!(
            "compressed {:?} bytes of contents in {:?}",
            self.contents.len(),
            now.elapsed()
        );

Replacement in "libpijul/src/change/change_file.rs" at line 87 [13.90139]

B:BD[13.92372] → [4.59:116]

∅:D[4.116] → [14.75:195]

B:BD[14.75] → [14.75:195]

B:BD[14.195] → [4.117:134]

            Some(zstd_seekable::Seekable::init(Box::new(
                OffFile {
                    f: r,
                    start: offsets.contents_off,
                },
            ))?)

[13.92372]

[13.92523]

            Some(zstd_seekable::Seekable::init(Box::new(OffFile {
                f: r,
                start: offsets.contents_off,
            }))?)

Replacement in "libpijul/src/alive/tarjan.rs" at line 30 [6.982262]

B:BD[6.983388] → [6.983388:983491]

            for j in i..self[n_l].n_children {
                let &(_, n_child) = self.child(n_l, j);

[6.983388]

[6.983491]

            for j in i..self[n_l].n_children + self[n_l].extra.len() {
                let n_child = if j < self[n_l].n_children {
                    self.child(n_l, j).1
                } else {
                    self[n_l].extra[j - self[n_l].n_children].1
                };

Replacement in "libpijul/src/alive/mod.rs" at line 146 [6.995164]

B:BD[6.998115] → [6.998115:998356]

        for (_, child) in graph.children(p) {
            if graph[p].scc < target_scc && graph[p].scc != graph[*child].scc {
                assert!(graph[p].scc > graph[*child].scc);
                vertices.remove(&graph[*child].vertex);

[6.998115]

[6.998356]

        for &(_, child) in graph.children(p) {
            if graph[p].scc < target_scc && graph[p].scc != graph[child].scc {
                assert!(graph[p].scc > graph[child].scc);
                vertices.remove(&graph[child].vertex);

Replacement in "libpijul/src/alive/mod.rs" at line 151 [6.995164]

B:BD[6.998370] → [6.998370:998448]

            if graph[*child].scc >= min {
                stack.push(*child);

[6.998370]

[6.998448]

            if graph[child].scc >= min {
                stack.push(child);

Replacement in "libpijul/src/alive/mod.rs" at line 198 [6.995164]

B:BD[6.999894] → [6.999894:1000027]

        for (_, child) in graph.children(p) {
            if graph[*child].scc >= min {
                stack.push((*child, false));

[6.999894]

[6.1000027]

        for &(_, child) in graph.children(p) {
            if graph[child].scc >= min {
                stack.push((child, false));

Replacement in "libpijul/src/alive/mod.rs" at line 203 [6.995164]

B:BD[6.1000082] → [6.1000082:1000204]

                && graph[*child].scc != graph[p].scc
                && covered.contains(&(graph[*child].vertex, target))

[6.1000082]

[6.1000204]

                && graph[child].scc != graph[p].scc
                && covered.contains(&(graph[child].vertex, target))

Replacement in "libpijul/src/alive/mod.rs" at line 206 [6.995164]

B:BD[6.1000218] → [6.1000218:1000277]

                assert!(graph[*child].scc < graph[p].scc);

[6.1000218]

[6.1000277]

                assert!(graph[child].scc < graph[p].scc);

Insertion in "flake.nix" at line 86 [6.1023754]
[15.247162]
[16.125]
```
                        xxHash
```