logify 0.1.0

A high-performance, portable boolean logic engine. Turns abstract logic into optimized data structures that can be serialized, cached, and evaluated against arbitrary user data (Bitmaps, Sets, JSON, etc).
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

use std::{hash::Hash, mem};

use crate::expr::{Expression, Node};

#[cfg(feature = "fast-binary")]
mod impl_fast_binary {
    use std::hash::Hash;

    use crate::expr::{Expression, ExpressionShadow};
    use bitcode::{Decode, Encode};

    impl<T: Encode> Expression<T> {
        pub fn to_bitcode_bytes(expr: &Expression<T>) -> Vec<u8> {
            bitcode::encode(expr)
        }
    }

    impl<T: Hash + PartialEq + for<'a> Decode<'a>> Expression<T> {
        pub fn from_bitcode_bytes(bytes: &[u8]) -> Result<Self, bitcode::Error> {
            let shadow: ExpressionShadow<T> = bitcode::decode(bytes)?;
            Ok(shadow.into())
        }
    }
}

impl<T> IntoIterator for Expression<T> {
    type Item = Self;
    type IntoIter = std::iter::Once<Self>;
    fn into_iter(self) -> Self::IntoIter {
        std::iter::once(self)
    }
}

impl<T: Hash + PartialEq> Extend<Expression<T>> for Expression<T> {
    fn extend<I: IntoIterator<Item = Expression<T>>>(&mut self, iter: I) {
        for mut source in iter {
            if source.nodes.len() == 1 {
                continue;
            }
            let (active, max_root) = source.get_active();
            self.absorb(&active, max_root, &source.roots, |idx| {
                mem::replace(&mut source.nodes[idx], Node::Empty)
            });
        }
    }
}

impl<T> IntoIterator for &Expression<T> {
    type Item = Self;
    type IntoIter = std::iter::Once<Self>;
    fn into_iter(self) -> Self::IntoIter {
        std::iter::once(self)
    }
}

impl<'a, T: Clone + Hash + PartialEq> Extend<&'a Expression<T>> for Expression<T> {
    fn extend<I: IntoIterator<Item = &'a Expression<T>>>(&mut self, iter: I) {
        for source in iter {
            if source.nodes.len() == 1 {
                continue;
            }
            let (active, max_root) = source.get_active();
            self.absorb(&active, max_root, &source.roots, |idx| {
                source.nodes[idx].clone()
            });
        }
    }
}