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
/*
* 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::index::BytesRef;
use crate::core::util::access::{ByteSource, SharedAccessVec};
use crate::core::util::error::lucene_error::Result;
use crate::core::util::{BytesRefComparator, ToInt};
use std::rc::Rc;
use std::sync::Arc;
pub trait Comparator<T> {
/// A static string that identifies the type of comparator.
const TYPE: &'static str;
/// Compares two values and returns the result as `Result<i32>`.
///
/// This method is fallible to support cases where comparison may fail,
/// such as dynamic comparator logic or I/O-dependent comparisons.
/// For most simple comparators (e.g., numerical or lexical), this
/// will always return `Ok(result)`.
fn compare(&self, a: &T, b: &T) -> Result<i32>;
}
impl<T, C> Comparator<T> for Arc<C>
where
C: Comparator<T>,
{
const TYPE: &'static str = C::TYPE;
fn compare(&self, a: &T, b: &T) -> Result<i32> {
(**self).compare(a, b)
}
}
impl<T, C> Comparator<T> for Rc<C>
where
C: Comparator<T>,
{
const TYPE: &'static str = C::TYPE;
fn compare(&self, a: &T, b: &T) -> Result<i32> {
(**self).compare(a, b)
}
}
pub struct NaturalOrder;
impl Default for NaturalOrder {
fn default() -> Self {
Self::new()
}
}
impl NaturalOrder {
pub fn new() -> NaturalOrder {
NaturalOrder {}
}
}
impl<T> Comparator<T> for NaturalOrder
where
T: Ord,
{
const TYPE: &'static str = COMPARATOR_TYPE;
fn compare(&self, a: &T, b: &T) -> Result<i32> {
Ok(a.cmp(b).to_int())
}
}
pub struct ReverseOrder {
comparator: NaturalOrder,
}
impl Default for ReverseOrder {
fn default() -> Self {
Self::new()
}
}
impl ReverseOrder {
pub fn new() -> ReverseOrder {
ReverseOrder {
comparator: NaturalOrder::new(),
}
}
}
impl<T> Comparator<T> for ReverseOrder
where
T: Ord,
{
const TYPE: &'static str = "ReverseOrder";
fn compare(&self, a: &T, b: &T) -> Result<i32> {
Ok(-self.comparator.compare(a, b)?)
}
}
/// # NOTE
/// The purpose of implementing BytesRefComparator is to
/// allow it to be passed as the same parameter alongside other types
/// that also implement BytesRefComparator, distinguishing its type by the TYPE
/// constant.
impl<AV: SharedAccessVec<u8> + ByteSource> BytesRefComparator<AV> for NaturalOrder {
fn byte_at(&self, bytes_ref: &BytesRef<AV>, i: usize) -> Result<i32> {
if bytes_ref.length <= i {
return Ok(-1);
}
Ok(
bytes_ref
.bytes
.access(|bytes| bytes[bytes_ref.offset + i] as i32),
)
}
fn compared_bytes_count(&self) -> usize {
i32::MAX as usize
}
}
pub const COMPARATOR_TYPE: &str = "Comparator";