object-rainbow-history 0.0.0-a.25

Git-ish diff-by-diff change history
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

use object_rainbow::{Hash, InlineOutput, Traversible};
use object_rainbow_hamt::{HamtMap, HamtSet};

use crate::Apply;

impl<V: 'static + Send + Sync + Clone + Traversible + InlineOutput> Apply<(Option<V>, Hash)>
    for HamtMap<V>
{
    type Output = Option<V>;

    fn apply(
        &mut self,
        (value, hash): (Option<V>, Hash),
    ) -> impl Send + Future<Output = object_rainbow::Result<Self::Output>> {
        async move {
            if let Some(value) = value {
                self.insert(hash, value).await
            } else {
                self.remove(hash).await
            }
        }
    }
}

impl<V: 'static + Send + Sync + Clone + Traversible + InlineOutput> Apply<(V, Hash)>
    for HamtMap<V>
{
    type Output = Option<V>;

    fn apply(
        &mut self,
        (value, hash): (V, Hash),
    ) -> impl Send + Future<Output = object_rainbow::Result<Self::Output>> {
        self.insert(hash, value)
    }
}

impl Apply<(bool, Hash)> for HamtSet {
    type Output = bool;

    fn apply(
        &mut self,
        (remove, hash): (bool, Hash),
    ) -> impl Send + Future<Output = object_rainbow::Result<Self::Output>> {
        async move {
            Ok(if remove {
                !self.remove(hash).await?
            } else {
                self.insert(hash).await?
            })
        }
    }
}

impl Apply<Hash> for HamtSet {
    type Output = bool;

    fn apply(
        &mut self,
        hash: Hash,
    ) -> impl Send + Future<Output = object_rainbow::Result<Self::Output>> {
        self.insert(hash)
    }
}