uqa-planner 0.4.7

Cost model, cardinality, DPccp join enumeration, optimizer rewrites
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

//
// Unified Query Algebra
//
// Copyright (c) 2023-2026 Cognica, Inc.
//

use super::*;
use crate::retrieval_planning::testing::Inputs;
use uqa_operators::{TextTopKPlan, TextTopKStrategy};

#[test]
fn only_eligible_root_text_terms_read_live_planning_counts() {
    let inputs = Inputs::new(Err("must not probe"));
    let leaf = OperatorTree::Term {
        query: "rust search".into(),
        field: Some("body".into()),
        scoring: Some(TextScoringMode::BM25),
        top_k: None,
    };
    let nested = OperatorTree::Union(vec![leaf.clone()]);
    let OperatorTree::Union(children) = plan_bound_text_top_k(&inputs, "docs", nested, 4).unwrap()
    else {
        panic!("a nested retrieval must retain its unbounded child")
    };
    assert!(matches!(
        &children[..],
        [OperatorTree::Term { top_k: None, .. }]
    ));

    let mut planned = leaf.clone();
    let OperatorTree::Term { top_k, .. } = &mut planned else {
        unreachable!()
    };
    *top_k = Some(TextTopKPlan {
        k: 3,
        strategy: TextTopKStrategy::Wand,
    });
    assert!(
        matches!(plan_bound_text_top_k(&inputs, "docs", planned, 4).unwrap(),
        OperatorTree::Term { top_k: Some(plan), .. }
        if plan.k == 3 && plan.strategy == TextTopKStrategy::Wand)
    );
    assert!(inputs.text_reads.borrow().is_empty());

    assert!(
        matches!(plan_bound_text_top_k(&inputs, "docs", leaf, 4).unwrap(),
        OperatorTree::Term { query, field: Some(field), top_k: Some(plan), .. }
        if query == "rust search" && field == "body" && plan.k == 4
            && plan.strategy == TextTopKStrategy::BlockMaxWand)
    );
    assert_eq!(
        *inputs.text_reads.borrow(),
        [("docs".into(), "body".into(), "rust search".into())]
    );
}