colla 0.1.0

Operational Transformation library for nested documents with text and rich-text
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
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161

use std::collections::BTreeMap;
use std::hash::{Hash, Hasher};
use std::sync::Arc;

use crate::error::ValueError;
use crate::value::FiniteF64;

#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub enum AttrValue {
    Bool(bool),
    Int(i64),
    Float(FiniteF64),
    String(Arc<str>),
}

impl AttrValue {
    pub fn float(value: f64) -> Result<Self, ValueError> {
        Ok(Self::Float(FiniteF64::new(value)?))
    }
    pub fn string(value: impl Into<String>) -> Self {
        Self::String(Arc::from(value.into()))
    }
}

impl From<bool> for AttrValue {
    fn from(value: bool) -> Self {
        Self::Bool(value)
    }
}
impl From<i64> for AttrValue {
    fn from(value: i64) -> Self {
        Self::Int(value)
    }
}
impl From<String> for AttrValue {
    fn from(value: String) -> Self {
        Self::String(Arc::from(value))
    }
}
impl From<&str> for AttrValue {
    fn from(value: &str) -> Self {
        Self::String(Arc::from(value))
    }
}

#[derive(Debug, Clone, Default, PartialEq, Eq)]
pub struct Attrs(Arc<BTreeMap<String, AttrValue>>);

impl Hash for Attrs {
    fn hash<H: Hasher>(&self, state: &mut H) {
        for (key, value) in self.0.iter() {
            key.hash(state);
            value.hash(state);
        }
    }
}

impl Attrs {
    pub fn new() -> Self {
        Self::default()
    }
    pub fn from_entries<I, K>(entries: I) -> Result<Self, ValueError>
    where
        I: IntoIterator<Item = (K, AttrValue)>,
        K: Into<String>,
    {
        let mut map = BTreeMap::new();
        for (key, value) in entries {
            let key = key.into();
            if map.insert(key.clone(), value).is_some() {
                return Err(ValueError::DuplicateKey(key));
            }
        }
        Ok(Self(Arc::new(map)))
    }
    pub(crate) fn from_btree(map: BTreeMap<String, AttrValue>) -> Self {
        Self(Arc::new(map))
    }
    pub fn get(&self, key: &str) -> Option<&AttrValue> {
        self.0.get(key)
    }
    pub fn iter(&self) -> impl Iterator<Item = (&String, &AttrValue)> {
        self.0.iter()
    }
    pub fn is_empty(&self) -> bool {
        self.0.is_empty()
    }
    pub fn len(&self) -> usize {
        self.0.len()
    }
    pub(crate) fn to_btree(&self) -> BTreeMap<String, AttrValue> {
        self.0.as_ref().clone()
    }
    pub fn apply_patch(&self, patch: &AttrPatch) -> Self {
        let mut out = self.to_btree();
        for (key, change) in patch.iter() {
            match change {
                AttrChange::Set(value) => {
                    out.insert(key.clone(), value.clone());
                }
                AttrChange::Remove => {
                    out.remove(key);
                }
            }
        }
        Self::from_btree(out)
    }
}

#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub enum AttrChange {
    Set(AttrValue),
    Remove,
}

#[derive(Debug, Clone, Default, PartialEq, Eq)]
pub struct AttrPatch(Arc<BTreeMap<String, AttrChange>>);

impl Hash for AttrPatch {
    fn hash<H: Hasher>(&self, state: &mut H) {
        for (key, value) in self.0.iter() {
            key.hash(state);
            value.hash(state);
        }
    }
}

impl AttrPatch {
    pub fn new() -> Self {
        Self::default()
    }
    pub fn from_entries<I, K>(entries: I) -> Result<Self, ValueError>
    where
        I: IntoIterator<Item = (K, AttrChange)>,
        K: Into<String>,
    {
        let mut map = BTreeMap::new();
        for (key, value) in entries {
            let key = key.into();
            if map.insert(key.clone(), value).is_some() {
                return Err(ValueError::DuplicateKey(key));
            }
        }
        Ok(Self(Arc::new(map)))
    }
    pub(crate) fn from_btree(map: BTreeMap<String, AttrChange>) -> Self {
        Self(Arc::new(map))
    }
    pub fn iter(&self) -> impl Iterator<Item = (&String, &AttrChange)> {
        self.0.iter()
    }
    pub fn is_empty(&self) -> bool {
        self.0.is_empty()
    }
    pub fn len(&self) -> usize {
        self.0.len()
    }
    pub(crate) fn to_btree(&self) -> BTreeMap<String, AttrChange> {
        self.0.as_ref().clone()
    }
}