lucisearch 0.8.1

Embeddable, in-process search engine — the SQLite/DuckDB of search
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
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
//! Script score query: custom scoring via compiled expressions.
//!
//! Parses a simple expression language at weight creation time and compiles
//! it to a Rust closure for zero-overhead per-doc evaluation.
//!
//! Supports: `_score`, numeric literals, `+`, `-`, `*`, `/`, parentheses,
//! `Math.log()`, `Math.sqrt()`, `Math.pow()`, `Math.max()`, `Math.min()`,
//! `Math.abs()`, and user-defined params.
//!
//! See [[elasticsearch-parity]] and [[investigation-20260320-01-monty-script-score-overhead]].

use std::collections::HashMap;

use crate::core::{DocId, Result, ScoreMode, Scorer, TwoPhaseIterator};

use crate::query::{BoundQuery, Query, ScorerSupplier};
use crate::search::searcher::Searcher;
use crate::segment::reader::SegmentReader;

// ---------------------------------------------------------------------------
// Expression AST and compiler
// ---------------------------------------------------------------------------

#[derive(Clone, Debug)]
enum Expr {
    Score,         // _score
    Literal(f64),  // 42.0
    Param(String), // user param
    BinOp(Box<Expr>, BinOp, Box<Expr>),
    UnaryMinus(Box<Expr>),
    Fn1(MathFn1, Box<Expr>),            // Math.sqrt(x)
    Fn2(MathFn2, Box<Expr>, Box<Expr>), // Math.pow(x, y)
}

#[derive(Clone, Debug)]
enum BinOp {
    Add,
    Sub,
    Mul,
    Div,
    Mod,
}

#[derive(Clone, Debug)]
enum MathFn1 {
    Log,
    Log10,
    Sqrt,
    Abs,
    Ln,
}

#[derive(Clone, Debug)]
enum MathFn2 {
    Pow,
    Max,
    Min,
}

impl Expr {
    /// Evaluate the expression with the given score and params.
    fn eval(&self, score: f64, params: &HashMap<String, f64>) -> f64 {
        match self {
            Expr::Score => score,
            Expr::Literal(v) => *v,
            Expr::Param(name) => params.get(name).copied().unwrap_or(0.0),
            Expr::BinOp(l, op, r) => {
                let lv = l.eval(score, params);
                let rv = r.eval(score, params);
                match op {
                    BinOp::Add => lv + rv,
                    BinOp::Sub => lv - rv,
                    BinOp::Mul => lv * rv,
                    BinOp::Div => {
                        if rv != 0.0 {
                            lv / rv
                        } else {
                            0.0
                        }
                    }
                    BinOp::Mod => {
                        if rv != 0.0 {
                            lv % rv
                        } else {
                            0.0
                        }
                    }
                }
            }
            Expr::UnaryMinus(e) => -e.eval(score, params),
            Expr::Fn1(f, arg) => {
                let v = arg.eval(score, params);
                match f {
                    MathFn1::Log => (1.0 + v).ln(),
                    MathFn1::Log10 => v.log10(),
                    MathFn1::Sqrt => v.sqrt(),
                    MathFn1::Abs => v.abs(),
                    MathFn1::Ln => v.ln(),
                }
            }
            Expr::Fn2(f, a, b) => {
                let av = a.eval(score, params);
                let bv = b.eval(score, params);
                match f {
                    MathFn2::Pow => av.powf(bv),
                    MathFn2::Max => av.max(bv),
                    MathFn2::Min => av.min(bv),
                }
            }
        }
    }
}

// ---------------------------------------------------------------------------
// Simple recursive descent parser
// ---------------------------------------------------------------------------

struct Parser<'a> {
    tokens: Vec<Token>,
    pos: usize,
    params: &'a HashMap<String, f64>,
}

#[derive(Clone, Debug)]
enum Token {
    Num(f64),
    Ident(String),
    Plus,
    Minus,
    Star,
    Slash,
    Percent,
    LParen,
    RParen,
    Comma,
    Dot,
}

fn tokenize(s: &str) -> Vec<Token> {
    let mut tokens = Vec::new();
    let bytes = s.as_bytes();
    let mut i = 0;
    while i < bytes.len() {
        match bytes[i] {
            b' ' | b'\t' | b'\n' => i += 1,
            b'+' => {
                tokens.push(Token::Plus);
                i += 1;
            }
            b'-' => {
                tokens.push(Token::Minus);
                i += 1;
            }
            b'*' => {
                tokens.push(Token::Star);
                i += 1;
            }
            b'/' => {
                tokens.push(Token::Slash);
                i += 1;
            }
            b'%' => {
                tokens.push(Token::Percent);
                i += 1;
            }
            b'(' => {
                tokens.push(Token::LParen);
                i += 1;
            }
            b')' => {
                tokens.push(Token::RParen);
                i += 1;
            }
            b',' => {
                tokens.push(Token::Comma);
                i += 1;
            }
            b'.' if i + 1 < bytes.len() && bytes[i + 1].is_ascii_alphabetic() => {
                tokens.push(Token::Dot);
                i += 1;
            }
            b'0'..=b'9' | b'.' => {
                let start = i;
                while i < bytes.len() && (bytes[i].is_ascii_digit() || bytes[i] == b'.') {
                    i += 1;
                }
                let num: f64 = std::str::from_utf8(&bytes[start..i])
                    .unwrap()
                    .parse()
                    .unwrap_or(0.0);
                tokens.push(Token::Num(num));
            }
            b'a'..=b'z' | b'A'..=b'Z' | b'_' => {
                let start = i;
                while i < bytes.len() && (bytes[i].is_ascii_alphanumeric() || bytes[i] == b'_') {
                    i += 1;
                }
                let ident = std::str::from_utf8(&bytes[start..i]).unwrap().to_string();
                tokens.push(Token::Ident(ident));
            }
            _ => i += 1, // skip unknown
        }
    }
    tokens
}

impl<'a> Parser<'a> {
    fn new(source: &str, params: &'a HashMap<String, f64>) -> Self {
        Self {
            tokens: tokenize(source),
            pos: 0,
            params,
        }
    }

    fn peek(&self) -> Option<&Token> {
        self.tokens.get(self.pos)
    }
    fn advance(&mut self) -> Option<Token> {
        let t = self.tokens.get(self.pos).cloned();
        self.pos += 1;
        t
    }

    fn parse_expr(&mut self) -> Expr {
        self.parse_additive()
    }

    fn parse_additive(&mut self) -> Expr {
        let mut left = self.parse_multiplicative();
        loop {
            match self.peek() {
                Some(Token::Plus) => {
                    self.advance();
                    left = Expr::BinOp(
                        Box::new(left),
                        BinOp::Add,
                        Box::new(self.parse_multiplicative()),
                    );
                }
                Some(Token::Minus) => {
                    self.advance();
                    left = Expr::BinOp(
                        Box::new(left),
                        BinOp::Sub,
                        Box::new(self.parse_multiplicative()),
                    );
                }
                _ => break,
            }
        }
        left
    }

    fn parse_multiplicative(&mut self) -> Expr {
        let mut left = self.parse_unary();
        loop {
            match self.peek() {
                Some(Token::Star) => {
                    self.advance();
                    left = Expr::BinOp(Box::new(left), BinOp::Mul, Box::new(self.parse_unary()));
                }
                Some(Token::Slash) => {
                    self.advance();
                    left = Expr::BinOp(Box::new(left), BinOp::Div, Box::new(self.parse_unary()));
                }
                Some(Token::Percent) => {
                    self.advance();
                    left = Expr::BinOp(Box::new(left), BinOp::Mod, Box::new(self.parse_unary()));
                }
                _ => break,
            }
        }
        left
    }

    fn parse_unary(&mut self) -> Expr {
        if matches!(self.peek(), Some(Token::Minus)) {
            self.advance();
            Expr::UnaryMinus(Box::new(self.parse_primary()))
        } else {
            self.parse_primary()
        }
    }

    fn parse_primary(&mut self) -> Expr {
        match self.advance() {
            Some(Token::Num(n)) => Expr::Literal(n),
            Some(Token::LParen) => {
                let e = self.parse_expr();
                self.advance(); // consume RParen
                e
            }
            Some(Token::Ident(name)) => {
                if name == "_score" {
                    Expr::Score
                } else if name == "Math" {
                    // Expect .func(args)
                    self.advance(); // consume Dot
                    if let Some(Token::Ident(func)) = self.advance() {
                        self.advance(); // consume LParen
                        let arg1 = self.parse_expr();
                        match func.as_str() {
                            "sqrt" | "abs" | "log" | "log10" | "ln" => {
                                self.advance(); // consume RParen
                                let f = match func.as_str() {
                                    "sqrt" => MathFn1::Sqrt,
                                    "abs" => MathFn1::Abs,
                                    "log" => MathFn1::Log,
                                    "log10" => MathFn1::Log10,
                                    "ln" => MathFn1::Ln,
                                    _ => unreachable!(),
                                };
                                Expr::Fn1(f, Box::new(arg1))
                            }
                            "pow" | "max" | "min" => {
                                self.advance(); // consume Comma
                                let arg2 = self.parse_expr();
                                self.advance(); // consume RParen
                                let f = match func.as_str() {
                                    "pow" => MathFn2::Pow,
                                    "max" => MathFn2::Max,
                                    "min" => MathFn2::Min,
                                    _ => unreachable!(),
                                };
                                Expr::Fn2(f, Box::new(arg1), Box::new(arg2))
                            }
                            _ => Expr::Literal(0.0),
                        }
                    } else {
                        Expr::Literal(0.0)
                    }
                } else if self.params.contains_key(&name) {
                    Expr::Param(name)
                } else {
                    Expr::Literal(0.0) // unknown identifier
                }
            }
            _ => Expr::Literal(0.0),
        }
    }
}

fn compile_script(source: &str, params: &HashMap<String, f64>) -> Expr {
    let mut parser = Parser::new(source, params);
    parser.parse_expr()
}

// ---------------------------------------------------------------------------
// Query implementation
// ---------------------------------------------------------------------------

pub struct ScriptScoreQuery {
    pub(crate) query: Box<dyn Query>,
    pub script: String,
    pub params: HashMap<String, f64>,
}

impl Query for ScriptScoreQuery {
    fn bind(&self, searcher: &Searcher, score_mode: ScoreMode) -> Result<Box<dyn BoundQuery>> {
        let inner = self.query.bind(searcher, score_mode)?;
        let expr = compile_script(&self.script, &self.params);
        Ok(Box::new(BoundScriptScoreQuery {
            inner,
            expr,
            params: self.params.clone(),
        }))
    }
}

struct BoundScriptScoreQuery {
    inner: Box<dyn BoundQuery>,
    expr: Expr,
    params: HashMap<String, f64>,
}

impl BoundQuery for BoundScriptScoreQuery {
    fn scorer_supplier(&self, reader: &SegmentReader) -> Result<Option<Box<dyn ScorerSupplier>>> {
        let inner = match self.inner.scorer_supplier(reader)? {
            Some(s) => s,
            None => return Ok(None),
        };
        Ok(Some(Box::new(ScriptScoreScorerSupplier {
            inner,
            expr: self.expr.clone(),
            params: self.params.clone(),
        })))
    }
}

struct ScriptScoreScorerSupplier {
    inner: Box<dyn ScorerSupplier>,
    expr: Expr,
    params: HashMap<String, f64>,
}

impl ScorerSupplier for ScriptScoreScorerSupplier {
    fn cost(&self) -> u64 {
        self.inner.cost()
    }
    fn scorer(self: Box<Self>) -> Result<Box<dyn Scorer>> {
        let inner = self.inner.scorer()?;
        Ok(Box::new(ScriptScoreScorer {
            inner,
            expr: self.expr,
            params: self.params,
        }))
    }
}

struct ScriptScoreScorer {
    inner: Box<dyn Scorer>,
    expr: Expr,
    params: HashMap<String, f64>,
}

impl Scorer for ScriptScoreScorer {
    fn doc_id(&self) -> DocId {
        self.inner.doc_id()
    }
    fn next(&mut self) -> DocId {
        self.inner.next()
    }
    fn advance(&mut self, target: DocId) -> DocId {
        self.inner.advance(target)
    }

    fn score(&mut self) -> f32 {
        let base = self.inner.score() as f64;
        self.expr.eval(base, &self.params) as f32
    }

    fn two_phase(&mut self) -> Option<&mut dyn TwoPhaseIterator> {
        None
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::analysis::Token;
    use crate::core::{FieldId, SegmentId};
    use crate::mapping::{FieldType, Mapping};
    use crate::query::match_query::MatchQuery;
    use crate::segment::builder::SegmentBuilder;
    use crate::segment::reader::SegmentReader;

    fn make_tokens(terms: &[&str]) -> Vec<Token> {
        terms
            .iter()
            .enumerate()
            .map(|(i, t)| Token::new(*t, 0, t.len(), i as u32))
            .collect()
    }

    #[test]
    fn expr_eval_basic() {
        let params = HashMap::from([("factor".to_string(), 3.0)]);
        let expr = compile_script("_score * factor", &params);
        assert_eq!(expr.eval(2.0, &params), 6.0);
    }

    #[test]
    fn expr_eval_math_functions() {
        let params = HashMap::new();
        let expr = compile_script("Math.sqrt(_score)", &params);
        assert!((expr.eval(4.0, &params) - 2.0).abs() < 0.001);

        let expr2 = compile_script("Math.log(_score)", &params);
        assert!((expr2.eval(1.0, &params) - (2.0f64).ln()).abs() < 0.001); // log(1+1)

        let expr3 = compile_script("Math.max(_score, 10.0)", &params);
        assert_eq!(expr3.eval(5.0, &params), 10.0);
    }

    #[test]
    fn expr_eval_complex() {
        let params = HashMap::from([("boost".to_string(), 1.5)]);
        let expr = compile_script("(_score + 1.0) * boost", &params);
        assert_eq!(expr.eval(2.0, &params), 4.5);
    }

    #[test]
    fn expr_eval_constant() {
        let params = HashMap::new();
        let expr = compile_script("42.0", &params);
        assert_eq!(expr.eval(999.0, &params), 42.0);
    }

    #[test]
    fn script_score_query() {
        let schema = Mapping::builder().field("text", FieldType::Text).build();
        let mut builder = SegmentBuilder::new(SegmentId::new(1), &schema);
        builder.add_document(
            &[(FieldId::new(0), make_tokens(&["hello", "world"]))],
            b"{}",
        );
        let reader = SegmentReader::open(builder.build()).unwrap();
        let store = crate::search::segment_store::SegmentStore::new(
            vec![reader],
            crate::analysis::AnalyzerRegistry::new(),
            None,
            None,
        );
        let searcher = Searcher::new(&store);

        let query = ScriptScoreQuery {
            query: Box::new(MatchQuery {
                field: "text".into(),
                query_text: "hello".into(),
                analyzer: None,
            }),
            script: "_score * factor".to_string(),
            params: HashMap::from([("factor".to_string(), 3.0)]),
        };

        let results = searcher.search_query(&query, 10, 0).unwrap();
        assert_eq!(results.total_hits.value, 1);
        assert!(results.hits[0].score > 0.0);
    }

    #[test]
    fn script_score_constant_42() {
        let schema = Mapping::builder().field("text", FieldType::Text).build();
        let mut builder = SegmentBuilder::new(SegmentId::new(1), &schema);
        builder.add_document(&[(FieldId::new(0), make_tokens(&["hello"]))], b"{}");
        let reader = SegmentReader::open(builder.build()).unwrap();
        let store = crate::search::segment_store::SegmentStore::new(
            vec![reader],
            crate::analysis::AnalyzerRegistry::new(),
            None,
            None,
        );
        let searcher = Searcher::new(&store);

        let query = ScriptScoreQuery {
            query: Box::new(MatchQuery {
                field: "text".into(),
                query_text: "hello".into(),
                analyzer: None,
            }),
            script: "42.0".to_string(),
            params: HashMap::new(),
        };

        let results = searcher.search_query(&query, 10, 0).unwrap();
        assert_eq!(results.total_hits.value, 1);
        assert!((results.hits[0].score - 42.0).abs() < 0.01);
    }
}