datacraft-query 0.2.0

QBE model, criteria parsing and query evaluation of DataCraft
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
//! In-memory query engine (step 7.3, item H27; decision default 7).
//!
//! No SQL parser: criteria strings parse to typed predicates per column
//! kind, execution filters port rows (AND across columns, OR within a
//! column — SQL NULL never satisfies a predicate), projects the shown
//! columns in grid order and sorts by the sort columns (stable,
//! leftmost-first).

use crate::qbe::{QueryDef, SortOrder};
use datacraft_types::compare;

use crate::query_criteria::{Predicate, parse_predicate};
use datacraft_types::FieldValue;
use datacraft_types::TableDef;

/// Result of a query execution.
#[derive(Debug, Clone, PartialEq, Default)]
pub struct QueryResult {
    /// Projected column names in grid order.
    pub columns: Vec<String>,
    /// Result rows, positional to `columns`.
    pub rows: Vec<Vec<FieldValue>>,
}

/// Engine errors: whitelist violations and coercion failures.
#[derive(Debug, Clone, PartialEq, Eq)]
pub enum EngineError {
    /// A criteria column is not a field of the source table.
    UnknownField {
        /// The unknown name.
        field: String,
        /// The source table.
        table: String,
    },
    /// The query grid lists the same source field more than once
    /// among its shown columns — the by-name projection forbids
    /// ambiguity (step 42.3, item L22).
    DuplicateField {
        /// The duplicated name.
        field: String,
        /// The query definition.
        query: String,
    },
    /// A criteria literal does not fit the column's kind.
    BadLiteral {
        /// The column.
        field: String,
        /// The offending criteria text.
        criteria: String,
        /// Concrete reason.
        detail: String,
    },
}

impl std::fmt::Display for EngineError {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        match self {
            Self::UnknownField { field, table } => {
                write!(f, "field {field:?} is not a field of {table:?}")
            }
            Self::DuplicateField { field, query } => {
                write!(
                    f,
                    "field {field:?} appears more than once in query {query:?}"
                )
            }
            Self::BadLiteral {
                field,
                criteria,
                detail,
            } => write!(f, "criteria {criteria:?} on {field:?}: {detail}"),
        }
    }
}

impl std::error::Error for EngineError {}

/// Executes a query over the source table's rows.
pub fn run_query(
    def: &QueryDef,
    source: &TableDef,
    rows: &[Vec<FieldValue>],
) -> Result<QueryResult, EngineError> {
    let predicates = parse_predicates(def, source)?;
    let filtered: Vec<&Vec<FieldValue>> = rows
        .iter()
        .filter(|row| {
            predicates
                .iter()
                .all(|(index, ors)| ors.iter().any(|p| p.matches(&row[*index])))
        })
        .collect();

    // By-name projection (step 42.3, L22): shown names resolve through
    // the source whitelist and must be unique (case-insensitive), so a
    // subset or reordered grid can never mis-project silently.
    let shown_names: Vec<&str> = def
        .fields
        .iter()
        .filter(|f| f.shown)
        .map(|f| f.name.as_str())
        .collect();
    for (at, name) in shown_names.iter().enumerate() {
        if shown_names[..at]
            .iter()
            .any(|other| other.eq_ignore_ascii_case(name))
        {
            return Err(EngineError::DuplicateField {
                field: (*name).to_owned(),
                query: def.name.clone(),
            });
        }
    }
    let shown: Vec<(usize, String)> = shown_names
        .iter()
        .map(|name| resolve_column(source, name))
        .collect::<Result<Vec<_>, _>>()?;
    let columns: Vec<String> = shown.iter().map(|(_, name)| name.clone()).collect();

    // Sort on the FULL rows (hidden sort keys are legal), then project.
    let mut filtered = filtered;
    sort_rows(def, source, &mut filtered)?;

    let result_rows: Vec<Vec<FieldValue>> = filtered
        .iter()
        .map(|row| shown.iter().map(|(i, _)| row[*i].clone()).collect())
        .collect();

    Ok(QueryResult {
        columns,
        rows: result_rows,
    })
}

/// Resolves one grid column against the source schema whitelist by
/// name (case-insensitive — the same rule the criteria and sort paths
/// apply).
fn resolve_column(source: &TableDef, name: &str) -> Result<(usize, String), EngineError> {
    let index = source
        .fields
        .iter()
        .position(|c| c.name.eq_ignore_ascii_case(name))
        .ok_or(EngineError::UnknownField {
            field: name.to_owned(),
            table: source.name.clone(),
        })?;
    Ok((index, name.to_owned()))
}

/// Parses all criteria into per-column predicate lists (grid order).
fn parse_predicates(
    def: &QueryDef,
    source: &TableDef,
) -> Result<Vec<(usize, Vec<Predicate>)>, EngineError> {
    def.fields
        .iter()
        .filter(|f| !f.criteria.is_empty())
        .map(|field| {
            let Some((index, column)) = source
                .fields
                .iter()
                .enumerate()
                .find(|(_, c)| c.name.eq_ignore_ascii_case(&field.name))
            else {
                return Err(EngineError::UnknownField {
                    field: field.name.clone(),
                    table: source.name.clone(),
                });
            };
            let ors = field
                .criteria
                .iter()
                .map(|text| parse_predicate(text, &field.name, column))
                .collect::<Result<Vec<_>, _>>()?;
            Ok((index, ors))
        })
        .collect()
}

/// Parses one criteria string: optional operator prefix, then a typed
/// rows (sort keys may be hidden columns).
fn sort_rows(
    def: &QueryDef,
    source: &TableDef,
    rows: &mut [&Vec<FieldValue>],
) -> Result<(), EngineError> {
    let keys: Vec<(usize, bool)> = def
        .fields
        .iter()
        .filter(|f| f.sort != SortOrder::None)
        .map(|f| {
            let index = source
                .fields
                .iter()
                .position(|c| c.name.eq_ignore_ascii_case(&f.name))
                .ok_or(EngineError::UnknownField {
                    field: f.name.clone(),
                    table: source.name.clone(),
                })?;
            Ok((index, f.sort == SortOrder::Descending))
        })
        .collect::<Result<Vec<_>, _>>()?;
    if keys.is_empty() {
        return Ok(());
    }
    rows.sort_by(|a, b| {
        for (index, descending) in &keys {
            let ordering = compare(&a[*index], &b[*index]).unwrap_or(std::cmp::Ordering::Equal);
            let ordering = if *descending {
                ordering.reverse()
            } else {
                ordering
            };
            if ordering != std::cmp::Ordering::Equal {
                return ordering;
            }
        }
        std::cmp::Ordering::Equal
    });
    Ok(())
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::qbe::QbeField;
    use datacraft_types::FieldValue;
    use datacraft_types::TableDef;
    use datacraft_types::{FieldDef, FieldKind, NumericKind};

    fn one_row(value: FieldValue) -> Vec<Vec<FieldValue>> {
        vec![vec![value]]
    }

    /// Hidden sort keys sort the full rows before projection.
    #[test]
    fn hidden_sort_keys_apply() {
        let source = TableDef::new(
            "T",
            vec![
                FieldDef::new("name", FieldKind::Text { max_len: 5 }),
                FieldDef::new("rank", FieldKind::Number(NumericKind::LongInteger)),
            ],
        );
        let data = vec![
            vec![FieldValue::Text("b".into()), FieldValue::Integer(1)],
            vec![FieldValue::Text("a".into()), FieldValue::Integer(2)],
        ];
        let def = QueryDef {
            name: "q".into(),
            table: "T".into(),
            fields: vec![QbeField {
                name: "name".into(),
                shown: true,
                sort: SortOrder::Descending,
                criteria: Vec::new(),
            }],
        };
        let mut def = def;
        // A second, hidden sort column (rank ascending) breaks the tie.
        def.fields.push(QbeField {
            name: "rank".into(),
            shown: false,
            sort: SortOrder::Ascending,
            criteria: Vec::new(),
        });
        let result = run_query(&def, &source, &data).expect("runs");
        assert_eq!(result.columns, ["name"]);
        assert_eq!(result.rows[0][0], FieldValue::Text("b".into()));
        assert_eq!(result.rows[1][0], FieldValue::Text("a".into()));
    }

    /// An unknown sort column is a whitelist error (direct engine calls).
    #[test]
    fn unknown_sort_columns_are_whitelist_errors() {
        let source = TableDef::new("T", vec![FieldDef::new("v", FieldKind::Currency)]);
        let def = QueryDef {
            name: "q".into(),
            table: "T".into(),
            fields: vec![QbeField {
                name: "ghost".into(),
                shown: true,
                sort: SortOrder::Ascending,
                criteria: Vec::new(),
            }],
        };
        let err =
            run_query(&def, &source, &one_row(FieldValue::Null)).expect_err("unknown sort key");
        assert!(matches!(err, EngineError::UnknownField { .. }), "{err}");
    }

    /// A subset or reordered grid projects exactly the named columns
    /// (step 42.3, item L22): positions resolve by name through the
    /// source whitelist, never from grid order.
    #[test]
    fn projection_resolves_by_name_for_subset_and_reordered_grids() {
        let source = TableDef::new(
            "T",
            vec![
                FieldDef::new("name", FieldKind::Text { max_len: 5 }),
                FieldDef::new("rank", FieldKind::Number(NumericKind::LongInteger)),
                FieldDef::new("total", FieldKind::Currency),
            ],
        );
        let data = vec![vec![
            FieldValue::Text("b".into()),
            FieldValue::Integer(2),
            FieldValue::Currency(900),
        ]];
        // Grid order rank, name — a reordered subset of the source.
        let def = QueryDef {
            name: "q".into(),
            table: "T".into(),
            fields: vec![
                QbeField {
                    name: "rank".into(),
                    shown: true,
                    sort: SortOrder::None,
                    criteria: Vec::new(),
                },
                QbeField {
                    name: "name".into(),
                    shown: true,
                    sort: SortOrder::None,
                    criteria: Vec::new(),
                },
            ],
        };
        let result = run_query(&def, &source, &data).expect("runs");
        assert_eq!(result.columns, ["rank", "name"]);
        assert_eq!(
            result.rows[0],
            vec![FieldValue::Integer(2), FieldValue::Text("b".into())]
        );
    }

    /// Duplicate shown names are a precise error — the by-name
    /// projection forbids ambiguity (step 42.3, item L22).
    #[test]
    fn duplicate_shown_names_fail_loudly() {
        let source = TableDef::new("T", vec![FieldDef::new("v", FieldKind::Currency)]);
        let def = QueryDef {
            name: "q".into(),
            table: "T".into(),
            fields: vec![
                QbeField {
                    name: "v".into(),
                    shown: true,
                    sort: SortOrder::None,
                    criteria: Vec::new(),
                },
                // Same column again, different spelling.
                QbeField {
                    name: "V".into(),
                    shown: true,
                    sort: SortOrder::None,
                    criteria: Vec::new(),
                },
            ],
        };
        let err =
            run_query(&def, &source, &one_row(FieldValue::Null)).expect_err("duplicate projection");
        assert!(matches!(err, EngineError::DuplicateField { .. }), "{err}");
    }

    /// An unknown shown name is a whitelist error even without
    /// criteria or sort — not a silently mis-projected column
    /// (step 42.3, item L22).
    #[test]
    fn unknown_shown_names_fail_loudly() {
        let source = TableDef::new("T", vec![FieldDef::new("v", FieldKind::Currency)]);
        let def = QueryDef {
            name: "q".into(),
            table: "T".into(),
            fields: vec![QbeField {
                name: "ghost".into(),
                shown: true,
                sort: SortOrder::None,
                criteria: Vec::new(),
            }],
        };
        let err = run_query(&def, &source, &one_row(FieldValue::Null)).expect_err("unknown column");
        assert!(matches!(err, EngineError::UnknownField { .. }), "{err}");
    }

    /// prefix parsing: each prefix selects its band.
    #[test]
    fn operator_prefixes_select_their_band() {
        let source = TableDef::new("T", vec![FieldDef::new("v", FieldKind::Currency)]);
        let data = one_row(FieldValue::Currency(10_000));
        for (criteria, expected) in [
            ("= 1", 1usize),
            ("<> 1", 0usize),
            ("< 2", 1usize),
            ("<= 1", 1usize),
            ("> 0", 1usize),
            (">= 2", 0usize),
            ("1", 1usize),
        ] {
            let def = QueryDef {
                name: "q".into(),
                table: "T".into(),
                fields: vec![QbeField {
                    name: "v".into(),
                    shown: true,
                    sort: SortOrder::None,
                    criteria: vec![criteria.to_owned()],
                }],
            };
            let result = run_query(&def, &source, &data).expect("runs");
            assert_eq!(result.rows.len(), expected, "criteria {criteria:?}");
        }
    }
}