mushroomdb-rules 0.5.2

Rule evaluation engine for mushroomdb: declarative predicates and trigger logic
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

//! Predicate serde + evaluate robustness.
//!
//! Three generators, 256 cases each (768 total):
//!   (a) arbitrary `Predicate` trees (depth ≤ 3, all 7 variants) → bincode
//!       round-trip (finite numeric params)
//!   (b) the same tree strategy → `serde_json` round-trip (JSON-safe floats)
//!   (c) hostile predicates (full f64 params, incl. NaN/±inf) + prop maps
//!       with nested lists → `evaluate` never panics

use core_rules::{evaluate, NodeView, Predicate};
use core_storage::Value;
use proptest::prelude::*;
use std::collections::HashMap;

fn field_strategy() -> impl Strategy<Value = String> {
    proptest::collection::vec(prop::char::range('a', 'z'), 0..8)
        .prop_map(|cs| cs.into_iter().collect())
}

fn finite_f64() -> BoxedStrategy<f64> {
    any::<f64>()
        .prop_filter("finite", |x| x.is_finite())
        .boxed()
}

/// JSON numbers are decimal; tiny binary floats do not survive `to_string`.
/// Integers and dyadic rationals in a small range round-trip exactly.
fn json_safe_f64() -> BoxedStrategy<f64> {
    prop_oneof![
        (-64i32..=64).prop_map(|i| i as f64),
        (-64i32..=64).prop_map(|i| i as f64 / 4.0),
        Just(0.0_f64),
        Just(1.0_f64),
    ]
    .boxed()
}

fn leaf_predicate_with(num: BoxedStrategy<f64>) -> impl Strategy<Value = Predicate> {
    prop_oneof![
        field_strategy().prop_map(|field| Predicate::KeyMatch { field }),
        field_strategy().prop_map(|field| Predicate::FieldEqual { field }),
        (field_strategy(), num.clone()).prop_map(|(field, min)| Predicate::Overlap { field, min }),
        (field_strategy(), num.clone())
            .prop_map(|(field, tolerance)| Predicate::NumericWithin { field, tolerance }),
        (field_strategy(), num.clone()).prop_map(|(field, km)| Predicate::GeoRadius { field, km }),
        (field_strategy(), num).prop_map(|(field, min)| Predicate::VectorSimilar { field, min }),
        Just(Predicate::All(vec![])),
    ]
}

fn predicate_strategy() -> impl Strategy<Value = Predicate> {
    leaf_predicate_with(finite_f64()).prop_recursive(3, 16, 3, |inner| {
        proptest::collection::vec(inner, 1..4).prop_map(Predicate::All)
    })
}

fn json_predicate_strategy() -> impl Strategy<Value = Predicate> {
    leaf_predicate_with(json_safe_f64()).prop_recursive(3, 16, 3, |inner| {
        proptest::collection::vec(inner, 1..4).prop_map(Predicate::All)
    })
}

/// Full IEEE f64, including NaN, ±inf, and subnormals — for the no-panic
/// property only. Round-trip tests keep finite / JSON-safe params.
fn any_f64() -> BoxedStrategy<f64> {
    any::<f64>().boxed()
}

fn hostile_predicate_strategy() -> impl Strategy<Value = Predicate> {
    leaf_predicate_with(any_f64()).prop_recursive(3, 16, 3, |inner| {
        proptest::collection::vec(inner, 1..4).prop_map(Predicate::All)
    })
}

fn scalar_value() -> impl Strategy<Value = Value> {
    prop_oneof![
        any::<i64>().prop_map(Value::Int),
        any::<f64>().prop_map(Value::Float),
        field_strategy().prop_map(Value::Str),
        any::<bool>().prop_map(Value::Bool),
    ]
}

fn value_strategy() -> impl Strategy<Value = Value> {
    // Recursive list layer: depth ≥ 2 so GeoRadius / VectorSimilar see
    // nested-list props (List(List(...))), not only flat numeric lists.
    scalar_value().prop_recursive(2, 16, 4, |inner| {
        proptest::collection::vec(inner, 0..6).prop_map(Value::List)
    })
}

fn props_strategy() -> impl Strategy<Value = HashMap<String, Value>> {
    proptest::collection::hash_map(field_strategy(), value_strategy(), 0..6)
}

proptest! {
    #![proptest_config(ProptestConfig::with_cases(256))]
    #[test]
    fn predicate_bincode_roundtrip(p in predicate_strategy()) {
        let bytes = bincode::serialize(&p).expect("serialize");
        let back: Predicate = bincode::deserialize(&bytes).expect("deserialize");
        prop_assert_eq!(p, back);
    }
}

proptest! {
    #![proptest_config(ProptestConfig::with_cases(256))]
    #[test]
    fn predicate_json_roundtrip(p in json_predicate_strategy()) {
        let s = serde_json::to_string(&p).expect("to_json");
        let back: Predicate = serde_json::from_str(&s).expect("from_json");
        prop_assert_eq!(p, back);
    }
}

proptest! {
    #![proptest_config(ProptestConfig::with_cases(256))]
    #[test]
    fn evaluate_never_panics_on_arbitrary_props(
        p in hostile_predicate_strategy(),
        src_props in props_strategy(),
        dst_props in props_strategy(),
    ) {
        let sp = |f: &str| src_props.get(f).cloned();
        let dp = |f: &str| dst_props.get(f).cloned();
        let src = NodeView { key: "src", props: &sp };
        let dst = NodeView { key: "dst", props: &dp };
        let _ = evaluate(&p, &src, &dst);
    }
}