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
/*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed with
* this work for additional information regarding copyright ownership.
* The ASF licenses this file to You under the Apache License, Version 2.0
* (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
use crate::core::util::error::lucene_error::Result;
use crate::core::util::priority_queue::{Compare, PriorityQueue};
pub(crate) struct ScorerUtil;
impl ScorerUtil {
/// the idea here is the following: a boolean query c1,c2,...cn with minShouldMatch=m
/// could be rewritten to:
/// (c1 AND (c2..cn|msm=m-1)) OR (!c1 AND (c2..cn|msm=m))
/// if we assume that clauses come in ascending cost, then
/// the cost of the first part is the cost of c1 (because the cost of a conjunction is
/// the cost of the least costly clause)
/// the cost of the second part is the cost of finding m matches among the c2...cn
/// remaining clauses
/// since it is a disjunction overall, the total cost is the sum of the costs of these
/// two parts
/// If we recurse infinitely, we find out that the cost of a msm query is the sum of the
/// costs of the num_scorers - minShouldMatch + 1 least costly scorers
pub fn cost_with_min_should_match<I>(
costs: I,
num_scorers: usize,
min_should_match: usize,
) -> Result<i64>
where
I: IntoIterator<Item = i64>,
{
let k = num_scorers - min_should_match + 1;
if k == 1 {
return Ok(costs.into_iter().min().unwrap_or(0));
}
let costs = costs.into_iter();
// No selection is needed when every cost is guaranteed to fit. Retain
// the queue for unbounded iterators and preserve its capacity validation.
if min_should_match <= 1
&& k < i32::MAX as usize
&& costs.size_hint().1.is_some_and(|len| len <= k)
{
return Ok(costs.sum());
}
let mut pq = PriorityQueue::new(k, MaxCostCmp)?;
for c in costs {
let _ = pq.insert_with_overflow(c)?;
}
let mut sum = 0;
for v in pq.iter() {
sum += v;
}
Ok(sum)
}
}
struct MaxCostCmp;
impl Compare<i64> for MaxCostCmp {
fn less_than(&self, a: &i64, b: &i64) -> Result<bool> {
Ok(a > b)
}
}