lemma-engine 0.10.2

A pure, declarative language for business rules.
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
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
//! Identity-preserving serde for shared `Arc` values inside a snapshot.
//!
//! Serde's `rc` support writes an `Arc`'s contents at every occurrence and rebuilds a
//! separate allocation per occurrence, so pointer identity and sharing are lost on restore.
//! Here each distinct allocation is written once under an id; later occurrences write
//! only the id. Process-wide primitive singletons are seeded before encoding so they
//! restore to the same allocation they had before.

use crate::parsing::ast::PrimitiveKind;
use crate::planning::semantics::{lemma_type_for_primitive, LemmaType};
use serde::de::Error as _;
use serde::{Deserialize, Deserializer, Serialize, Serializer};
use std::any::Any;
use std::cell::RefCell;
use std::collections::HashMap;
use std::sync::Arc;

type AnyArc = Arc<dyn Any + Send + Sync>;

const SINGLETON_KINDS: [PrimitiveKind; 12] = [
    PrimitiveKind::Boolean,
    PrimitiveKind::Number,
    PrimitiveKind::Text,
    PrimitiveKind::Date,
    PrimitiveKind::DateRange,
    PrimitiveKind::Time,
    PrimitiveKind::Ratio,
    PrimitiveKind::Measure,
    PrimitiveKind::MeasureRange,
    PrimitiveKind::NumberRange,
    PrimitiveKind::RatioRange,
    PrimitiveKind::TimeRange,
];

fn singleton_arc(kind: PrimitiveKind) -> &'static Arc<LemmaType> {
    lemma_type_for_primitive(kind)
}

struct EncodeTable {
    ids: HashMap<usize, u32>,
    next_id: u32,
}

struct DecodeTable {
    arcs: HashMap<u32, AnyArc>,
}

thread_local! {
    static ENCODE: RefCell<Option<EncodeTable>> = const { RefCell::new(None) };
    static DECODE: RefCell<Option<DecodeTable>> = const { RefCell::new(None) };
}

fn ptr_key<T>(arc: &Arc<T>) -> usize {
    Arc::as_ptr(arc) as usize
}

/// Active identity table for one snapshot encode. Dropping it ends the scope.
pub(crate) struct EncodeScope;

impl EncodeScope {
    pub(crate) fn enter() -> Self {
        ENCODE.with(|cell| {
            let mut slot = cell.borrow_mut();
            assert!(slot.is_none(), "BUG: nested snapshot encode scope");
            let mut table = EncodeTable {
                ids: HashMap::new(),
                next_id: 0,
            };
            for kind in SINGLETON_KINDS {
                let id = table.next_id;
                table.ids.insert(ptr_key(singleton_arc(kind)), id);
                table.next_id += 1;
            }
            *slot = Some(table);
        });
        Self
    }
}

impl Drop for EncodeScope {
    fn drop(&mut self) {
        ENCODE.with(|cell| {
            cell.borrow_mut().take();
        });
    }
}

/// Active identity table for one snapshot decode. Dropping it ends the scope.
pub(crate) struct DecodeScope;

impl DecodeScope {
    pub(crate) fn enter() -> Self {
        DECODE.with(|cell| {
            let mut slot = cell.borrow_mut();
            assert!(slot.is_none(), "BUG: nested snapshot decode scope");
            let mut table = DecodeTable {
                arcs: HashMap::new(),
            };
            for (id, kind) in SINGLETON_KINDS.into_iter().enumerate() {
                let id = u32::try_from(id).expect("BUG: singleton count fits in u32");
                let any: AnyArc = singleton_arc(kind).clone();
                table.arcs.insert(id, any);
            }
            *slot = Some(table);
        });
        Self
    }
}

impl Drop for DecodeScope {
    fn drop(&mut self) {
        DECODE.with(|cell| {
            cell.borrow_mut().take();
        });
    }
}

#[derive(Serialize)]
enum WireRef<'a, T: Serialize> {
    Full { id: u32, value: &'a T },
    Shared(u32),
}

#[derive(Deserialize)]
enum WireOwned<T> {
    Full { id: u32, value: T },
    Shared(u32),
}

fn serialize_arc<S, T>(arc: &Arc<T>, serializer: S) -> Result<S::Ok, S::Error>
where
    S: Serializer,
    T: Serialize + Send + Sync + 'static,
{
    let key = ptr_key(arc);
    let first_id = ENCODE.with(|cell| {
        let mut slot = cell.borrow_mut();
        let table = slot
            .as_mut()
            .expect("BUG: shared Arc serialized outside a snapshot encode");
        if let Some(&id) = table.ids.get(&key) {
            return Err(id);
        }
        let id = table.next_id;
        table.next_id += 1;
        table.ids.insert(key, id);
        Ok(id)
    });
    match first_id {
        Ok(id) => WireRef::Full {
            id,
            value: arc.as_ref(),
        }
        .serialize(serializer),
        Err(id) => WireRef::<T>::Shared(id).serialize(serializer),
    }
}

fn deserialize_arc<'de, D, T>(deserializer: D) -> Result<Arc<T>, D::Error>
where
    D: Deserializer<'de>,
    T: Deserialize<'de> + Send + Sync + 'static,
{
    match WireOwned::<T>::deserialize(deserializer)? {
        WireOwned::Full { id, value } => {
            let arc = Arc::new(value);
            DECODE.with(|cell| {
                let mut slot = cell.borrow_mut();
                let table = slot
                    .as_mut()
                    .expect("BUG: shared Arc deserialized outside a snapshot decode");
                let any: AnyArc = arc.clone();
                if table.arcs.insert(id, any).is_some() {
                    return Err(D::Error::custom(format!(
                        "engine snapshot defines shared id {id} twice"
                    )));
                }
                Ok(arc)
            })
        }
        WireOwned::Shared(id) => DECODE.with(|cell| {
            let slot = cell.borrow();
            let table = slot
                .as_ref()
                .expect("BUG: shared Arc deserialized outside a snapshot decode");
            let any = table.arcs.get(&id).ok_or_else(|| {
                D::Error::custom(format!("engine snapshot references unknown shared id {id}"))
            })?;
            Arc::clone(any).downcast::<T>().map_err(|_| {
                D::Error::custom(format!(
                    "engine snapshot shared id {id} does not hold the expected type"
                ))
            })
        }),
    }
}

/// Borrowed shared `Arc` for serialization inside a snapshot.
pub(crate) struct SharedRef<'a, T>(pub(crate) &'a Arc<T>);

impl<T> Serialize for SharedRef<'_, T>
where
    T: Serialize + Send + Sync + 'static,
{
    fn serialize<S: Serializer>(&self, serializer: S) -> Result<S::Ok, S::Error> {
        serialize_arc(self.0, serializer)
    }
}

/// Owned shared `Arc` produced by deserialization inside a snapshot.
pub(crate) struct SharedOwned<T>(pub(crate) Arc<T>);

impl<'de, T> Deserialize<'de> for SharedOwned<T>
where
    T: Deserialize<'de> + Send + Sync + 'static,
{
    fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error> {
        deserialize_arc::<D, T>(deserializer).map(SharedOwned)
    }
}

/// Serde adapter for an `Arc<T>` field.
pub(crate) mod arc {
    use super::{deserialize_arc, serialize_arc};
    use serde::{Deserializer, Serializer};
    use std::sync::Arc;

    pub(crate) fn serialize<S, T>(value: &Arc<T>, serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
        T: serde::Serialize + Send + Sync + 'static,
    {
        serialize_arc(value, serializer)
    }

    pub(crate) fn deserialize<'de, D, T>(deserializer: D) -> Result<Arc<T>, D::Error>
    where
        D: Deserializer<'de>,
        T: serde::Deserialize<'de> + Send + Sync + 'static,
    {
        deserialize_arc(deserializer)
    }
}

/// Serde adapter for a `Vec<Arc<T>>` field.
pub(crate) mod arc_vec {
    use super::{SharedOwned, SharedRef};
    use serde::{Deserialize, Deserializer, Serialize, Serializer};
    use std::sync::Arc;

    pub(crate) fn serialize<S, T>(values: &[Arc<T>], serializer: S) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
        T: Serialize + Send + Sync + 'static,
    {
        serializer.collect_seq(values.iter().map(SharedRef))
    }

    pub(crate) fn deserialize<'de, D, T>(deserializer: D) -> Result<Vec<Arc<T>>, D::Error>
    where
        D: Deserializer<'de>,
        T: Deserialize<'de> + Send + Sync + 'static,
    {
        let values = Vec::<SharedOwned<T>>::deserialize(deserializer)?;
        Ok(values.into_iter().map(|value| value.0).collect())
    }
}

/// Serde adapter for a `Vec<(K, Arc<T>)>` field.
pub(crate) mod arc_pair_vec {
    use super::{SharedOwned, SharedRef};
    use serde::{Deserialize, Deserializer, Serialize, Serializer};
    use std::sync::Arc;

    pub(crate) fn serialize<S, K, T>(
        pairs: &[(K, Arc<T>)],
        serializer: S,
    ) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
        K: Serialize,
        T: Serialize + Send + Sync + 'static,
    {
        serializer.collect_seq(pairs.iter().map(|(key, value)| (key, SharedRef(value))))
    }

    pub(crate) fn deserialize<'de, D, K, T>(deserializer: D) -> Result<Vec<(K, Arc<T>)>, D::Error>
    where
        D: Deserializer<'de>,
        K: Deserialize<'de>,
        T: Deserialize<'de> + Send + Sync + 'static,
    {
        let pairs = Vec::<(K, SharedOwned<T>)>::deserialize(deserializer)?;
        Ok(pairs
            .into_iter()
            .map(|(key, value)| (key, value.0))
            .collect())
    }
}

/// Serde adapter for an `IndexMap<K, Arc<T>>` field.
pub(crate) mod arc_index_map {
    use super::{SharedOwned, SharedRef};
    use indexmap::IndexMap;
    use serde::{Deserialize, Deserializer, Serialize, Serializer};
    use std::hash::Hash;
    use std::sync::Arc;

    pub(crate) fn serialize<S, K, T>(
        map: &IndexMap<K, Arc<T>>,
        serializer: S,
    ) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
        K: Serialize,
        T: Serialize + Send + Sync + 'static,
    {
        serializer.collect_seq(map.iter().map(|(key, value)| (key, SharedRef(value))))
    }

    pub(crate) fn deserialize<'de, D, K, T>(
        deserializer: D,
    ) -> Result<IndexMap<K, Arc<T>>, D::Error>
    where
        D: Deserializer<'de>,
        K: Deserialize<'de> + Eq + Hash,
        T: Deserialize<'de> + Send + Sync + 'static,
    {
        let pairs = Vec::<(K, SharedOwned<T>)>::deserialize(deserializer)?;
        let mut map = IndexMap::with_capacity(pairs.len());
        for (key, value) in pairs {
            if map.insert(key, value.0).is_some() {
                return Err(serde::de::Error::custom(
                    "engine snapshot map repeats a key",
                ));
            }
        }
        Ok(map)
    }
}

/// Serde adapter for a `BTreeMap<K, Arc<T>>` field.
pub(crate) mod arc_map {
    use super::{SharedOwned, SharedRef};
    use serde::{Deserialize, Deserializer, Serialize, Serializer};
    use std::collections::BTreeMap;
    use std::sync::Arc;

    pub(crate) fn serialize<S, K, T>(
        map: &BTreeMap<K, Arc<T>>,
        serializer: S,
    ) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
        K: Serialize,
        T: Serialize + Send + Sync + 'static,
    {
        serializer.collect_seq(map.iter().map(|(key, value)| (key, SharedRef(value))))
    }

    pub(crate) fn deserialize<'de, D, K, T>(
        deserializer: D,
    ) -> Result<BTreeMap<K, Arc<T>>, D::Error>
    where
        D: Deserializer<'de>,
        K: Deserialize<'de> + Ord,
        T: Deserialize<'de> + Send + Sync + 'static,
    {
        let pairs = Vec::<(K, SharedOwned<T>)>::deserialize(deserializer)?;
        let mut map = BTreeMap::new();
        for (key, value) in pairs {
            if map.insert(key, value.0).is_some() {
                return Err(serde::de::Error::custom(
                    "engine snapshot map repeats a key",
                ));
            }
        }
        Ok(map)
    }
}

/// Serde adapter for an `IndexMap<Arc<R>, V>` field keyed by shared repositories.
pub(crate) mod arc_key_index_map {
    use super::{SharedOwned, SharedRef};
    use indexmap::IndexMap;
    use serde::{Deserialize, Deserializer, Serialize, Serializer};
    use std::hash::Hash;
    use std::sync::Arc;

    pub(crate) fn serialize<S, R, V>(
        map: &IndexMap<Arc<R>, V>,
        serializer: S,
    ) -> Result<S::Ok, S::Error>
    where
        S: Serializer,
        R: Serialize + Send + Sync + 'static,
        V: Serialize,
    {
        serializer.collect_seq(map.iter().map(|(key, value)| (SharedRef(key), value)))
    }

    pub(crate) fn deserialize<'de, D, R, V>(
        deserializer: D,
    ) -> Result<IndexMap<Arc<R>, V>, D::Error>
    where
        D: Deserializer<'de>,
        R: Deserialize<'de> + Hash + Eq + Send + Sync + 'static,
        V: Deserialize<'de>,
    {
        let pairs = Vec::<(SharedOwned<R>, V)>::deserialize(deserializer)?;
        let mut map = IndexMap::with_capacity(pairs.len());
        for (key, value) in pairs {
            if map.insert(key.0, value).is_some() {
                return Err(serde::de::Error::custom(
                    "engine snapshot repository key repeats",
                ));
            }
        }
        Ok(map)
    }
}