criterium 3.1.3

Lightweigt dynamic database queries for rusqlite.
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

// SPDX-FileCopyrightText: 2025 Slatian
//
// SPDX-License-Identifier: LGPL-3.0-only

//! Implements DirectMatch for the TagCriterium, doesn’t export any functions

use crate::direct_match::DirectMatchResult;
use crate::direct_match::DirectMatchResultKind;
use crate::tag::TagCriterium;
use crate::DirectMatch;

impl<T, D> DirectMatch<[D]> for TagCriterium<T>
where
	T: DirectMatch<D>,
{
	type Output = T::Output;

	fn criterium_match(&self, data: &[D]) -> Self::Output {
		match self {
			Self::Has(chain) => {
				// Implement a logical OR as a match with any of the elements is okay
				let mut output: Option<Self::Output> = None;
				let mut output_is_unknown = false;
				for d in data {
					let out = chain.criterium_match(d);
					match out.kind() {
						DirectMatchResultKind::True => return out,
						DirectMatchResultKind::False => {
							if output.is_none() {
								output = Some(out)
							}
						}
						DirectMatchResultKind::Unknown => {
							if !output_is_unknown {
								output = Some(out);
								output_is_unknown = true;
							}
						}
						DirectMatchResultKind::Error => return out,
					}
				}
				return output.unwrap_or(Self::Output::new(false));
			}
			Self::HasNot(chain) => {
				// Implement a logical NOR as a match on any element means this has failed
				let mut output: Option<Self::Output> = None;
				let mut output_is_unknown = false;
				for d in data {
					let out = chain.criterium_match(d).invert();
					match out.kind() {
						DirectMatchResultKind::True => return out.invert(),
						DirectMatchResultKind::False => {
							if output.is_none() {
								output = Some(out)
							}
						}
						DirectMatchResultKind::Unknown => {
							if !output_is_unknown {
								output = Some(out);
								output_is_unknown = true;
							}
						}
						DirectMatchResultKind::Error => return out,
					}
				}
				return output.unwrap_or(Self::Output::new(false));
			}
			Self::HasNOf { n, chain } => {
				let mut count: i64 = 0;
				let mut count_unknown: i64 = 0;
				let mut unknown_output: Option<Self::Output> = None;
				for d in data {
					let out = chain.criterium_match(d).invert();
					match out.kind() {
						DirectMatchResultKind::True => count += 1,
						DirectMatchResultKind::False => { /* noop */ }
						DirectMatchResultKind::Unknown => {
							if unknown_output.is_none() {
								unknown_output = Some(out)
							};
							count_unknown += 1;
						}
						DirectMatchResultKind::Error => return out,
					}
				}
				if let Some(unknown_output) = unknown_output {
					// Use a range map if unkown output is possible
					return n
						.criterium_match(&(count..=count + count_unknown))
						.map(Self::Output::new)
						.unwrap_or(unknown_output);
				} else {
					// Directly match if no unknowns were involved
					return Self::Output::new(n.criterium_match(&count));
				}
			}
		}
	}
}