sift-query-core 0.1.0

Backend-independent query model and strict parameter parser for SiftQuery
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

//! Programmatic [`QueryBuilder`] coverage: every operator helper, every
//! rejection path, and the complexity budget.

use sift_query_core::{
    Condition, CursorCodec, CursorValue, FieldId, FieldRef, FilterExpr, Operator, PagingMode,
    ParamError, ParamNames, PredicateNode, Projection, QueryBuilder, QueryLimits, QueryPolicy,
    ScalarKind, ScalarValue, SortOrder, UserQuery,
};

#[path = "../support/mod.rs"]
mod support;

use support::{CursorEntity, RichEntity, TestEntity, UnstableEntity};

fn policy() -> QueryPolicy {
    QueryPolicy::default()
}

fn field<T>(id: u16) -> FieldRef<RichEntity, T, ScalarKind> {
    FieldRef::new(FieldId(id))
}

fn with_limits(adjust: impl FnOnce(&mut QueryLimits)) -> QueryPolicy {
    let mut limits = QueryLimits::default();
    adjust(&mut limits);
    QueryPolicy::new(ParamNames::default(), limits).unwrap()
}

fn conditions<E>(query: &UserQuery<E>) -> Vec<Condition> {
    query
        .predicate()
        .nodes()
        .iter()
        .filter_map(|node| match node {
            PredicateNode::Condition(condition) => Some(condition.clone()),
            PredicateNode::And(_) | PredicateNode::Or(_) => None,
        })
        .collect()
}

// ---------------------------------------------------------------------------
// Happy paths
// ---------------------------------------------------------------------------

mod complexity_budget;
mod field_validation;
mod happy_paths;
mod nested_filters;
mod paging;