invr 0.2.3

Declarative data validation engine using invariants executed on Polars DataFrames.
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

use crate::infrastructure::polars::kind::PolarsKind;
use crate::invariant::Invariant;
use crate::scope::Scope;
use polars::prelude::*;

///
/// Builds the Polars expression counting rows where the string length
/// is strictly below the configured minimum.
///
/// Required parameters:
/// - `min`: minimum allowed string length (inclusive)
///
/// Scope:
/// - Requires `Scope::Column`
///
/// Behavior:
/// - Computes `len_chars()` on the target column
/// - Marks rows where length < min
/// - Returns the total count of rows below the minimum
///
/// The resulting metric represents the number of too-short values.
///
/// Note:
/// - The minimum bound is inclusive. Values with length == min are valid.
pub fn plan(inv: &Invariant<PolarsKind>) -> Option<Expr> {
    let Scope::Column { name } = inv.scope() else {
        return None;
    };
    let min: i64 = inv.require_param("min").ok()?.parse().ok()?;

    Some(col(name).str().len_chars().lt(lit(min)).sum())
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::domain::invariant::value_object::id::InvariantId;
    use std::collections::BTreeMap;

    fn make_invariant(min: i64) -> Invariant<PolarsKind> {
        let id = InvariantId::new("string_length_min_test").unwrap();
        let mut params = BTreeMap::new();
        params.insert("min".to_string(), min.to_string());

        Invariant::new(
            id,
            PolarsKind::StringLengthMin,
            Scope::Column {
                name: "a".to_string(),
            },
        )
        .with_params(params)
    }

    fn df(values: Vec<&str>) -> DataFrame {
        let height = values.len();
        let series = Series::new("a".into(), values);
        DataFrame::new(height, vec![series.into()]).unwrap()
    }

    #[test]
    fn test_plan_returns_expr() {
        let inv = make_invariant(3);
        assert!(plan(&inv).is_some());
    }

    #[test]
    fn test_no_violation_when_all_lengths_above_or_equal_min() {
        let df = df(vec!["abc", "abcd", "abcdef"]);
        let inv = make_invariant(3);

        let result = df.lazy().select([plan(&inv).unwrap()]).collect().unwrap();

        let count = result.columns()[0]
            .get(0)
            .unwrap()
            .try_extract::<i64>()
            .unwrap();

        assert_eq!(count, 0);
    }

    #[test]
    fn test_violation_when_length_below_min() {
        let df = df(vec!["a", "ab", "abcd"]); // 2 violations
        let inv = make_invariant(3);

        let result = df.lazy().select([plan(&inv).unwrap()]).collect().unwrap();

        let count = result.columns()[0]
            .get(0)
            .unwrap()
            .try_extract::<i64>()
            .unwrap();

        assert_eq!(count, 2);
    }

    #[test]
    fn test_wrong_scope_returns_none() {
        let id = InvariantId::new("wrong_scope").unwrap();
        let inv = Invariant::new(id, PolarsKind::StringLengthMin, Scope::Dataset);

        assert!(plan(&inv).is_none());
    }
}