mirror of
https://github.com/quickwit-oss/tantivy.git
synced 2026-01-07 01:32:53 +00:00
Compare commits
14 Commits
document-d
...
columnar_o
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
b91c37ab2b | ||
|
|
ec7379477c | ||
|
|
31b78b59dd | ||
|
|
08b9fc0b31 | ||
|
|
714f363d43 | ||
|
|
93ff7365b0 | ||
|
|
8151925068 | ||
|
|
b960e40bc8 | ||
|
|
1095c9b073 | ||
|
|
c0686515a9 | ||
|
|
455156f51c | ||
|
|
4143d31865 | ||
|
|
0c634adbe1 | ||
|
|
2e3641c2ae |
@@ -15,8 +15,7 @@ rust-version = "1.63"
|
|||||||
exclude = ["benches/*.json", "benches/*.txt"]
|
exclude = ["benches/*.json", "benches/*.txt"]
|
||||||
|
|
||||||
[dependencies]
|
[dependencies]
|
||||||
# Switch back to the non-forked oneshot crate once https://github.com/faern/oneshot/pull/35 is merged
|
oneshot = "0.1.7"
|
||||||
oneshot = { git = "https://github.com/fulmicoton/oneshot.git", rev = "c10a3ba" }
|
|
||||||
base64 = "0.22.0"
|
base64 = "0.22.0"
|
||||||
byteorder = "1.4.3"
|
byteorder = "1.4.3"
|
||||||
crc32fast = "1.3.2"
|
crc32fast = "1.3.2"
|
||||||
@@ -64,7 +63,7 @@ query-grammar = { version = "0.22.0", path = "./query-grammar", package = "tanti
|
|||||||
tantivy-bitpacker = { version = "0.6", path = "./bitpacker" }
|
tantivy-bitpacker = { version = "0.6", path = "./bitpacker" }
|
||||||
common = { version = "0.7", path = "./common/", package = "tantivy-common" }
|
common = { version = "0.7", path = "./common/", package = "tantivy-common" }
|
||||||
tokenizer-api = { version = "0.3", path = "./tokenizer-api", package = "tantivy-tokenizer-api" }
|
tokenizer-api = { version = "0.3", path = "./tokenizer-api", package = "tantivy-tokenizer-api" }
|
||||||
sketches-ddsketch = { version = "0.2.1", features = ["use_serde"] }
|
sketches-ddsketch = { version = "0.3.0", features = ["use_serde"] }
|
||||||
futures-util = { version = "0.3.28", optional = true }
|
futures-util = { version = "0.3.28", optional = true }
|
||||||
fnv = "1.0.7"
|
fnv = "1.0.7"
|
||||||
|
|
||||||
|
|||||||
@@ -47,6 +47,7 @@ fn bench_agg(mut group: InputGroup<Index>) {
|
|||||||
register!(group, average_f64);
|
register!(group, average_f64);
|
||||||
register!(group, average_f64_u64);
|
register!(group, average_f64_u64);
|
||||||
register!(group, stats_f64);
|
register!(group, stats_f64);
|
||||||
|
register!(group, extendedstats_f64);
|
||||||
register!(group, percentiles_f64);
|
register!(group, percentiles_f64);
|
||||||
register!(group, terms_few);
|
register!(group, terms_few);
|
||||||
register!(group, terms_many);
|
register!(group, terms_many);
|
||||||
@@ -105,7 +106,12 @@ fn stats_f64(index: &Index) {
|
|||||||
});
|
});
|
||||||
exec_term_with_agg(index, agg_req)
|
exec_term_with_agg(index, agg_req)
|
||||||
}
|
}
|
||||||
|
fn extendedstats_f64(index: &Index) {
|
||||||
|
let agg_req = json!({
|
||||||
|
"extendedstats_f64": { "extended_stats": { "field": "score_f64", } }
|
||||||
|
});
|
||||||
|
exec_term_with_agg(index, agg_req)
|
||||||
|
}
|
||||||
fn percentiles_f64(index: &Index) {
|
fn percentiles_f64(index: &Index) {
|
||||||
let agg_req = json!({
|
let agg_req = json!({
|
||||||
"mypercentiles": {
|
"mypercentiles": {
|
||||||
@@ -349,7 +355,7 @@ fn get_test_index_bench(cardinality: Cardinality) -> tantivy::Result<Index> {
|
|||||||
let lg_norm = rand_distr::LogNormal::new(2.996f64, 0.979f64).unwrap();
|
let lg_norm = rand_distr::LogNormal::new(2.996f64, 0.979f64).unwrap();
|
||||||
|
|
||||||
let many_terms_data = (0..150_000)
|
let many_terms_data = (0..150_000)
|
||||||
.map(|num| format!("author{}", num))
|
.map(|num| format!("author{num}"))
|
||||||
.collect::<Vec<_>>();
|
.collect::<Vec<_>>();
|
||||||
{
|
{
|
||||||
let mut rng = StdRng::from_seed([1u8; 32]);
|
let mut rng = StdRng::from_seed([1u8; 32]);
|
||||||
|
|||||||
@@ -141,12 +141,12 @@ pub fn hdfs_index_benchmark(c: &mut Criterion) {
|
|||||||
let parse_json = false;
|
let parse_json = false;
|
||||||
// for parse_json in [false, true] {
|
// for parse_json in [false, true] {
|
||||||
let suffix = if parse_json {
|
let suffix = if parse_json {
|
||||||
format!("{}-with-json-parsing", suffix)
|
format!("{suffix}-with-json-parsing")
|
||||||
} else {
|
} else {
|
||||||
suffix.to_string()
|
suffix.to_string()
|
||||||
};
|
};
|
||||||
|
|
||||||
let bench_name = format!("{}{}", prefix, suffix);
|
let bench_name = format!("{prefix}{suffix}");
|
||||||
group.bench_function(bench_name, |b| {
|
group.bench_function(bench_name, |b| {
|
||||||
benchmark(b, HDFS_LOGS, schema.clone(), commit, parse_json, is_dynamic)
|
benchmark(b, HDFS_LOGS, schema.clone(), commit, parse_json, is_dynamic)
|
||||||
});
|
});
|
||||||
|
|||||||
@@ -23,6 +23,12 @@ downcast-rs = "1.2.0"
|
|||||||
proptest = "1"
|
proptest = "1"
|
||||||
more-asserts = "0.3.1"
|
more-asserts = "0.3.1"
|
||||||
rand = "0.8"
|
rand = "0.8"
|
||||||
|
binggan = "0.8.1"
|
||||||
|
|
||||||
|
[[bench]]
|
||||||
|
name = "bench_merge"
|
||||||
|
harness = false
|
||||||
|
|
||||||
|
|
||||||
[features]
|
[features]
|
||||||
unstable = []
|
unstable = []
|
||||||
|
|||||||
101
columnar/benches/bench_merge.rs
Normal file
101
columnar/benches/bench_merge.rs
Normal file
@@ -0,0 +1,101 @@
|
|||||||
|
#![feature(test)]
|
||||||
|
extern crate test;
|
||||||
|
|
||||||
|
use core::fmt;
|
||||||
|
use std::fmt::{Display, Formatter};
|
||||||
|
|
||||||
|
use binggan::{black_box, BenchRunner};
|
||||||
|
use tantivy_columnar::*;
|
||||||
|
|
||||||
|
enum Card {
|
||||||
|
Multi,
|
||||||
|
Sparse,
|
||||||
|
Dense,
|
||||||
|
}
|
||||||
|
impl Display for Card {
|
||||||
|
fn fmt(&self, f: &mut Formatter) -> fmt::Result {
|
||||||
|
match self {
|
||||||
|
Card::Multi => write!(f, "multi"),
|
||||||
|
Card::Sparse => write!(f, "sparse"),
|
||||||
|
Card::Dense => write!(f, "dense"),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
const NUM_DOCS: u32 = 100_000;
|
||||||
|
|
||||||
|
fn generate_columnar(card: Card, num_docs: u32) -> ColumnarReader {
|
||||||
|
use tantivy_columnar::ColumnarWriter;
|
||||||
|
|
||||||
|
let mut columnar_writer = ColumnarWriter::default();
|
||||||
|
|
||||||
|
match card {
|
||||||
|
Card::Multi => {
|
||||||
|
columnar_writer.record_numerical(0, "price", 10u64);
|
||||||
|
columnar_writer.record_numerical(0, "price", 10u64);
|
||||||
|
}
|
||||||
|
_ => {}
|
||||||
|
}
|
||||||
|
|
||||||
|
for i in 0..num_docs {
|
||||||
|
match card {
|
||||||
|
Card::Multi | Card::Sparse => {
|
||||||
|
if i % 8 == 0 {
|
||||||
|
columnar_writer.record_numerical(i, "price", i as u64);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
Card::Dense => {
|
||||||
|
if i % 6 == 0 {
|
||||||
|
columnar_writer.record_numerical(i, "price", i as u64);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
let mut wrt: Vec<u8> = Vec::new();
|
||||||
|
columnar_writer.serialize(num_docs, None, &mut wrt).unwrap();
|
||||||
|
|
||||||
|
ColumnarReader::open(wrt).unwrap()
|
||||||
|
}
|
||||||
|
fn main() {
|
||||||
|
let mut inputs = Vec::new();
|
||||||
|
|
||||||
|
let mut add_combo = |card1: Card, card2: Card| {
|
||||||
|
inputs.push((
|
||||||
|
format!("merge_{card1}_and_{card2}"),
|
||||||
|
vec![
|
||||||
|
generate_columnar(card1, NUM_DOCS),
|
||||||
|
generate_columnar(card2, NUM_DOCS),
|
||||||
|
],
|
||||||
|
));
|
||||||
|
};
|
||||||
|
|
||||||
|
add_combo(Card::Multi, Card::Multi);
|
||||||
|
add_combo(Card::Dense, Card::Dense);
|
||||||
|
add_combo(Card::Sparse, Card::Sparse);
|
||||||
|
add_combo(Card::Sparse, Card::Dense);
|
||||||
|
add_combo(Card::Multi, Card::Dense);
|
||||||
|
add_combo(Card::Multi, Card::Sparse);
|
||||||
|
|
||||||
|
let runner: BenchRunner = BenchRunner::new();
|
||||||
|
let mut group = runner.new_group();
|
||||||
|
for (input_name, columnar_readers) in inputs.iter() {
|
||||||
|
group.register_with_input(
|
||||||
|
input_name,
|
||||||
|
columnar_readers,
|
||||||
|
move |columnar_readers: &Vec<ColumnarReader>| {
|
||||||
|
let mut out = vec![];
|
||||||
|
let columnar_readers = columnar_readers.iter().collect::<Vec<_>>();
|
||||||
|
let merge_row_order = StackMergeOrder::stack(&columnar_readers[..]);
|
||||||
|
|
||||||
|
let _ = black_box(merge_columnar(
|
||||||
|
&columnar_readers,
|
||||||
|
&[],
|
||||||
|
merge_row_order.into(),
|
||||||
|
&mut out,
|
||||||
|
));
|
||||||
|
},
|
||||||
|
);
|
||||||
|
}
|
||||||
|
group.run();
|
||||||
|
}
|
||||||
@@ -150,61 +150,62 @@ mod tests {
|
|||||||
);
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_merge_index_multivalued_sorted() {
|
// fn test_merge_index_multivalued_sorted() {
|
||||||
let column_indexes: Vec<ColumnIndex> = vec![MultiValueIndex::for_test(&[0, 2, 5]).into()];
|
// let column_indexes: Vec<ColumnIndex> = vec![MultiValueIndex::for_test(&[0, 2,
|
||||||
let merge_row_order: MergeRowOrder = ShuffleMergeOrder::for_test(
|
// 5]).into()]; let merge_row_order: MergeRowOrder = ShuffleMergeOrder::for_test(
|
||||||
&[2],
|
// &[2],
|
||||||
vec![
|
// vec![
|
||||||
RowAddr {
|
// RowAddr {
|
||||||
segment_ord: 0u32,
|
// segment_ord: 0u32,
|
||||||
row_id: 1u32,
|
// row_id: 1u32,
|
||||||
},
|
// },
|
||||||
RowAddr {
|
// RowAddr {
|
||||||
segment_ord: 0u32,
|
// segment_ord: 0u32,
|
||||||
row_id: 0u32,
|
// row_id: 0u32,
|
||||||
},
|
// },
|
||||||
],
|
// ],
|
||||||
)
|
// )
|
||||||
.into();
|
// .into();
|
||||||
let merged_column_index = merge_column_index(&column_indexes[..], &merge_row_order);
|
// let merged_column_index = merge_column_index(&column_indexes[..], &merge_row_order);
|
||||||
let SerializableColumnIndex::Multivalued(start_index_iterable) = merged_column_index else {
|
// let SerializableColumnIndex::Multivalued(serializable_multivalue_index) =
|
||||||
panic!("Excpected a multivalued index")
|
// merged_column_index else { panic!("Excpected a multivalued index")
|
||||||
};
|
// };
|
||||||
let start_indexes: Vec<RowId> = start_index_iterable.boxed_iter().collect();
|
// serializable_multivalue_index.doc_ids_with_values_opt.
|
||||||
assert_eq!(&start_indexes, &[0, 3, 5]);
|
// let start_indexes: Vec<RowId> = start_index_iterable.boxed_iter().collect();
|
||||||
}
|
// assert_eq!(&start_indexes, &[0, 3, 5]);
|
||||||
|
// }
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_merge_index_multivalued_sorted_several_segment() {
|
// fn test_merge_index_multivalued_sorted_several_segment() {
|
||||||
let column_indexes: Vec<ColumnIndex> = vec![
|
// let column_indexes: Vec<ColumnIndex> = vec![
|
||||||
MultiValueIndex::for_test(&[0, 2, 5]).into(),
|
// MultiValueIndex::for_test(&[0, 2, 5]).into(),
|
||||||
ColumnIndex::Empty { num_docs: 0 },
|
// ColumnIndex::Empty { num_docs: 0 },
|
||||||
MultiValueIndex::for_test(&[0, 1, 4]).into(),
|
// MultiValueIndex::for_test(&[0, 1, 4]).into(),
|
||||||
];
|
// ];
|
||||||
let merge_row_order: MergeRowOrder = ShuffleMergeOrder::for_test(
|
// let merge_row_order: MergeRowOrder = ShuffleMergeOrder::for_test(
|
||||||
&[2, 0, 2],
|
// &[2, 0, 2],
|
||||||
vec![
|
// vec![
|
||||||
RowAddr {
|
// RowAddr {
|
||||||
segment_ord: 2u32,
|
// segment_ord: 2u32,
|
||||||
row_id: 1u32,
|
// row_id: 1u32,
|
||||||
},
|
// },
|
||||||
RowAddr {
|
// RowAddr {
|
||||||
segment_ord: 0u32,
|
// segment_ord: 0u32,
|
||||||
row_id: 0u32,
|
// row_id: 0u32,
|
||||||
},
|
// },
|
||||||
RowAddr {
|
// RowAddr {
|
||||||
segment_ord: 2u32,
|
// segment_ord: 2u32,
|
||||||
row_id: 0u32,
|
// row_id: 0u32,
|
||||||
},
|
// },
|
||||||
],
|
// ],
|
||||||
)
|
// )
|
||||||
.into();
|
// .into();
|
||||||
let merged_column_index = merge_column_index(&column_indexes[..], &merge_row_order);
|
// let merged_column_index = merge_column_index(&column_indexes[..], &merge_row_order);
|
||||||
let SerializableColumnIndex::Multivalued(start_index_iterable) = merged_column_index else {
|
// let SerializableColumnIndex::Multivalued(serializable_multivalue_index) =
|
||||||
panic!("Excpected a multivalued index")
|
// merged_column_index else { panic!("Excpected a multivalued index")
|
||||||
};
|
// };
|
||||||
let start_indexes: Vec<RowId> = start_index_iterable.boxed_iter().collect();
|
// let start_indexes: Vec<RowId> = start_index_iterable.boxed_iter().collect();
|
||||||
assert_eq!(&start_indexes, &[0, 3, 5, 6]);
|
// assert_eq!(&start_indexes, &[0, 3, 5, 6]);
|
||||||
}
|
// }
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -9,22 +9,23 @@ pub fn merge_column_index_shuffled<'a>(
|
|||||||
cardinality_after_merge: Cardinality,
|
cardinality_after_merge: Cardinality,
|
||||||
shuffle_merge_order: &'a ShuffleMergeOrder,
|
shuffle_merge_order: &'a ShuffleMergeOrder,
|
||||||
) -> SerializableColumnIndex<'a> {
|
) -> SerializableColumnIndex<'a> {
|
||||||
match cardinality_after_merge {
|
todo!();
|
||||||
Cardinality::Full => SerializableColumnIndex::Full,
|
// match cardinality_after_merge {
|
||||||
Cardinality::Optional => {
|
// Cardinality::Full => SerializableColumnIndex::Full,
|
||||||
let non_null_row_ids =
|
// Cardinality::Optional => {
|
||||||
merge_column_index_shuffled_optional(column_indexes, shuffle_merge_order);
|
// let non_null_row_ids =
|
||||||
SerializableColumnIndex::Optional {
|
// merge_column_index_shuffled_optional(column_indexes, shuffle_merge_order);
|
||||||
non_null_row_ids,
|
// SerializableColumnIndex::Optional {
|
||||||
num_rows: shuffle_merge_order.num_rows(),
|
// non_null_row_ids,
|
||||||
}
|
// num_rows: shuffle_merge_order.num_rows(),
|
||||||
}
|
// }
|
||||||
Cardinality::Multivalued => {
|
// }
|
||||||
let multivalue_start_index =
|
// Cardinality::Multivalued => {
|
||||||
merge_column_index_shuffled_multivalued(column_indexes, shuffle_merge_order);
|
// let multivalue_start_index =
|
||||||
SerializableColumnIndex::Multivalued(multivalue_start_index)
|
// merge_column_index_shuffled_multivalued(column_indexes, shuffle_merge_order);
|
||||||
}
|
// SerializableColumnIndex::Multivalued(multivalue_start_index)
|
||||||
}
|
// }
|
||||||
|
// }
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Merge several column indexes into one, ordering rows according to the merge_order passed as
|
/// Merge several column indexes into one, ordering rows according to the merge_order passed as
|
||||||
@@ -137,35 +138,35 @@ mod tests {
|
|||||||
assert!(integrate_num_vals([3, 0, 10, 20].into_iter()).eq([0, 3, 3, 13, 33].into_iter()));
|
assert!(integrate_num_vals([3, 0, 10, 20].into_iter()).eq([0, 3, 3, 13, 33].into_iter()));
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_merge_column_index_optional_shuffle() {
|
// fn test_merge_column_index_optional_shuffle() {
|
||||||
let optional_index: ColumnIndex = OptionalIndex::for_test(2, &[0]).into();
|
// let optional_index: ColumnIndex = OptionalIndex::for_test(2, &[0]).into();
|
||||||
let column_indexes = [optional_index, ColumnIndex::Full];
|
// let column_indexes = [optional_index, ColumnIndex::Full];
|
||||||
let row_addrs = vec![
|
// let row_addrs = vec![
|
||||||
RowAddr {
|
// RowAddr {
|
||||||
segment_ord: 0u32,
|
// segment_ord: 0u32,
|
||||||
row_id: 1u32,
|
// row_id: 1u32,
|
||||||
},
|
// },
|
||||||
RowAddr {
|
// RowAddr {
|
||||||
segment_ord: 1u32,
|
// segment_ord: 1u32,
|
||||||
row_id: 0u32,
|
// row_id: 0u32,
|
||||||
},
|
// },
|
||||||
];
|
// ];
|
||||||
let shuffle_merge_order = ShuffleMergeOrder::for_test(&[2, 1], row_addrs);
|
// let shuffle_merge_order = ShuffleMergeOrder::for_test(&[2, 1], row_addrs);
|
||||||
let serializable_index = merge_column_index_shuffled(
|
// let serializable_index = merge_column_index_shuffled(
|
||||||
&column_indexes[..],
|
// &column_indexes[..],
|
||||||
Cardinality::Optional,
|
// Cardinality::Optional,
|
||||||
&shuffle_merge_order,
|
// &shuffle_merge_order,
|
||||||
);
|
// );
|
||||||
let SerializableColumnIndex::Optional {
|
// let SerializableColumnIndex::Optional {
|
||||||
non_null_row_ids,
|
// non_null_row_ids,
|
||||||
num_rows,
|
// num_rows,
|
||||||
} = serializable_index
|
// } = serializable_index
|
||||||
else {
|
// else {
|
||||||
panic!()
|
// panic!()
|
||||||
};
|
// };
|
||||||
assert_eq!(num_rows, 2);
|
// assert_eq!(num_rows, 2);
|
||||||
let non_null_rows: Vec<RowId> = non_null_row_ids.boxed_iter().collect();
|
// let non_null_rows: Vec<RowId> = non_null_row_ids.boxed_iter().collect();
|
||||||
assert_eq!(&non_null_rows, &[1]);
|
// assert_eq!(&non_null_rows, &[1]);
|
||||||
}
|
// }
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,6 +1,8 @@
|
|||||||
use std::iter;
|
use std::ops::Range;
|
||||||
|
|
||||||
use crate::column_index::{SerializableColumnIndex, Set};
|
use crate::column_index::multivalued_index::SerializableMultivalueIndex;
|
||||||
|
use crate::column_index::serialize::SerializableOptionalIndex;
|
||||||
|
use crate::column_index::SerializableColumnIndex;
|
||||||
use crate::iterable::Iterable;
|
use crate::iterable::Iterable;
|
||||||
use crate::{Cardinality, ColumnIndex, RowId, StackMergeOrder};
|
use crate::{Cardinality, ColumnIndex, RowId, StackMergeOrder};
|
||||||
|
|
||||||
@@ -15,23 +17,140 @@ pub fn merge_column_index_stacked<'a>(
|
|||||||
) -> SerializableColumnIndex<'a> {
|
) -> SerializableColumnIndex<'a> {
|
||||||
match cardinality_after_merge {
|
match cardinality_after_merge {
|
||||||
Cardinality::Full => SerializableColumnIndex::Full,
|
Cardinality::Full => SerializableColumnIndex::Full,
|
||||||
Cardinality::Optional => SerializableColumnIndex::Optional {
|
Cardinality::Optional => SerializableColumnIndex::Optional(SerializableOptionalIndex {
|
||||||
non_null_row_ids: Box::new(StackedOptionalIndex {
|
non_null_row_ids: Box::new(StackedOptionalIndex {
|
||||||
columns,
|
columns,
|
||||||
stack_merge_order,
|
stack_merge_order,
|
||||||
}),
|
}),
|
||||||
num_rows: stack_merge_order.num_rows(),
|
num_rows: stack_merge_order.num_rows(),
|
||||||
},
|
}),
|
||||||
Cardinality::Multivalued => {
|
Cardinality::Multivalued => {
|
||||||
let stacked_multivalued_index = StackedMultivaluedIndex {
|
let serializable_multivalue_index =
|
||||||
columns,
|
make_serializable_multivalued_index(columns, stack_merge_order);
|
||||||
stack_merge_order,
|
SerializableColumnIndex::Multivalued(serializable_multivalue_index)
|
||||||
};
|
|
||||||
SerializableColumnIndex::Multivalued(Box::new(stacked_multivalued_index))
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
struct StackedDocIdsWithValues<'a> {
|
||||||
|
column_indexes: &'a [ColumnIndex],
|
||||||
|
stack_merge_order: &'a StackMergeOrder,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl Iterable<u32> for StackedDocIdsWithValues<'_> {
|
||||||
|
fn boxed_iter(&self) -> Box<dyn Iterator<Item = u32> + '_> {
|
||||||
|
Box::new((0..self.column_indexes.len()).flat_map(|i| {
|
||||||
|
let column_index = &self.column_indexes[i];
|
||||||
|
let doc_range = self.stack_merge_order.columnar_range(i);
|
||||||
|
get_doc_ids_with_values(column_index, doc_range)
|
||||||
|
}))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fn get_doc_ids_with_values<'a>(
|
||||||
|
column_index: &'a ColumnIndex,
|
||||||
|
doc_range: Range<u32>,
|
||||||
|
) -> Box<dyn Iterator<Item = u32> + 'a> {
|
||||||
|
match column_index {
|
||||||
|
ColumnIndex::Empty { .. } => Box::new(0..0),
|
||||||
|
ColumnIndex::Full => Box::new(doc_range),
|
||||||
|
ColumnIndex::Optional(optional_index) => Box::new(
|
||||||
|
optional_index
|
||||||
|
.iter_rows()
|
||||||
|
.map(move |row| row + doc_range.start),
|
||||||
|
),
|
||||||
|
ColumnIndex::Multivalued(multivalued_index) => Box::new(
|
||||||
|
multivalued_index
|
||||||
|
.optional_index
|
||||||
|
.iter_rows()
|
||||||
|
.map(move |row| row + doc_range.start),
|
||||||
|
),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fn stack_doc_ids_with_values<'a>(
|
||||||
|
column_indexes: &'a [ColumnIndex],
|
||||||
|
stack_merge_order: &'a StackMergeOrder,
|
||||||
|
) -> SerializableOptionalIndex<'a> {
|
||||||
|
let num_rows = stack_merge_order.num_rows();
|
||||||
|
SerializableOptionalIndex {
|
||||||
|
non_null_row_ids: Box::new(StackedDocIdsWithValues {
|
||||||
|
column_indexes,
|
||||||
|
stack_merge_order,
|
||||||
|
}),
|
||||||
|
num_rows,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
struct StackedStartOffsets<'a> {
|
||||||
|
column_indexes: &'a [ColumnIndex],
|
||||||
|
stack_merge_order: &'a StackMergeOrder,
|
||||||
|
}
|
||||||
|
|
||||||
|
fn get_num_values_iterator<'a>(
|
||||||
|
column_index: &'a ColumnIndex,
|
||||||
|
num_docs: u32,
|
||||||
|
) -> Box<dyn Iterator<Item = u32> + 'a> {
|
||||||
|
match column_index {
|
||||||
|
ColumnIndex::Empty { .. } => Box::new(std::iter::empty()),
|
||||||
|
ColumnIndex::Full => Box::new(std::iter::repeat(1u32).take(num_docs as usize)),
|
||||||
|
ColumnIndex::Optional(optional_index) => {
|
||||||
|
Box::new(std::iter::repeat(1u32).take(optional_index.num_non_nulls() as usize))
|
||||||
|
}
|
||||||
|
ColumnIndex::Multivalued(multivalued_index) => {
|
||||||
|
let vals: Vec<u32> = multivalued_index.start_index_column.iter().collect();
|
||||||
|
Box::new(
|
||||||
|
multivalued_index
|
||||||
|
.start_index_column
|
||||||
|
.iter()
|
||||||
|
.scan(0u32, |previous_start_offset, current_start_offset| {
|
||||||
|
let num_vals = current_start_offset - *previous_start_offset;
|
||||||
|
*previous_start_offset = current_start_offset;
|
||||||
|
Some(num_vals)
|
||||||
|
})
|
||||||
|
.skip(1),
|
||||||
|
)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<'a> Iterable for StackedStartOffsets<'a> {
|
||||||
|
fn boxed_iter(&self) -> Box<dyn Iterator<Item = u64> + '_> {
|
||||||
|
let num_values_it = (0..self.column_indexes.len()).flat_map(|columnar_id| {
|
||||||
|
let num_docs = self.stack_merge_order.columnar_range(columnar_id).len() as u32;
|
||||||
|
let column_index = &self.column_indexes[columnar_id];
|
||||||
|
get_num_values_iterator(column_index, num_docs)
|
||||||
|
});
|
||||||
|
Box::new(std::iter::once(0u64).chain(num_values_it.into_iter().scan(
|
||||||
|
0u64,
|
||||||
|
|cumulated, el| {
|
||||||
|
*cumulated += el as u64;
|
||||||
|
Some(*cumulated)
|
||||||
|
},
|
||||||
|
)))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
fn stack_start_offsets<'a>(
|
||||||
|
column_indexes: &'a [ColumnIndex],
|
||||||
|
stack_merge_order: &'a StackMergeOrder,
|
||||||
|
) -> Box<dyn Iterable + 'a> {
|
||||||
|
Box::new(StackedStartOffsets {
|
||||||
|
column_indexes,
|
||||||
|
stack_merge_order,
|
||||||
|
})
|
||||||
|
}
|
||||||
|
|
||||||
|
fn make_serializable_multivalued_index<'a>(
|
||||||
|
columns: &'a [ColumnIndex],
|
||||||
|
stack_merge_order: &'a StackMergeOrder,
|
||||||
|
) -> SerializableMultivalueIndex<'a> {
|
||||||
|
SerializableMultivalueIndex {
|
||||||
|
doc_ids_with_values: stack_doc_ids_with_values(columns, stack_merge_order),
|
||||||
|
start_offsets: stack_start_offsets(columns, stack_merge_order),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
struct StackedOptionalIndex<'a> {
|
struct StackedOptionalIndex<'a> {
|
||||||
columns: &'a [ColumnIndex],
|
columns: &'a [ColumnIndex],
|
||||||
stack_merge_order: &'a StackMergeOrder,
|
stack_merge_order: &'a StackMergeOrder,
|
||||||
@@ -62,87 +181,3 @@ impl<'a> Iterable<RowId> for StackedOptionalIndex<'a> {
|
|||||||
)
|
)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Clone, Copy)]
|
|
||||||
struct StackedMultivaluedIndex<'a> {
|
|
||||||
columns: &'a [ColumnIndex],
|
|
||||||
stack_merge_order: &'a StackMergeOrder,
|
|
||||||
}
|
|
||||||
|
|
||||||
fn convert_column_opt_to_multivalued_index<'a>(
|
|
||||||
column_index_opt: &'a ColumnIndex,
|
|
||||||
num_rows: RowId,
|
|
||||||
) -> Box<dyn Iterator<Item = RowId> + 'a> {
|
|
||||||
match column_index_opt {
|
|
||||||
ColumnIndex::Empty { .. } => Box::new(iter::repeat(0u32).take(num_rows as usize + 1)),
|
|
||||||
ColumnIndex::Full => Box::new(0..num_rows + 1),
|
|
||||||
ColumnIndex::Optional(optional_index) => {
|
|
||||||
Box::new(
|
|
||||||
(0..num_rows)
|
|
||||||
// TODO optimize
|
|
||||||
.map(|row_id| optional_index.rank(row_id))
|
|
||||||
.chain(std::iter::once(optional_index.num_non_nulls())),
|
|
||||||
)
|
|
||||||
}
|
|
||||||
ColumnIndex::Multivalued(multivalued_index) => multivalued_index.start_index_column.iter(),
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
impl<'a> Iterable<RowId> for StackedMultivaluedIndex<'a> {
|
|
||||||
fn boxed_iter(&self) -> Box<dyn Iterator<Item = RowId> + '_> {
|
|
||||||
let multivalued_indexes =
|
|
||||||
self.columns
|
|
||||||
.iter()
|
|
||||||
.enumerate()
|
|
||||||
.map(|(columnar_id, column_opt)| {
|
|
||||||
let num_rows =
|
|
||||||
self.stack_merge_order.columnar_range(columnar_id).len() as RowId;
|
|
||||||
convert_column_opt_to_multivalued_index(column_opt, num_rows)
|
|
||||||
});
|
|
||||||
stack_multivalued_indexes(multivalued_indexes)
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// Refactor me
|
|
||||||
fn stack_multivalued_indexes<'a>(
|
|
||||||
mut multivalued_indexes: impl Iterator<Item = Box<dyn Iterator<Item = RowId> + 'a>> + 'a,
|
|
||||||
) -> Box<dyn Iterator<Item = RowId> + 'a> {
|
|
||||||
let mut offset = 0;
|
|
||||||
let mut last_row_id = 0;
|
|
||||||
let mut current_it = multivalued_indexes.next();
|
|
||||||
Box::new(std::iter::from_fn(move || loop {
|
|
||||||
if let Some(row_id) = current_it.as_mut()?.next() {
|
|
||||||
last_row_id = offset + row_id;
|
|
||||||
return Some(last_row_id);
|
|
||||||
}
|
|
||||||
offset = last_row_id;
|
|
||||||
loop {
|
|
||||||
current_it = multivalued_indexes.next();
|
|
||||||
if current_it.as_mut()?.next().is_some() {
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}))
|
|
||||||
}
|
|
||||||
|
|
||||||
#[cfg(test)]
|
|
||||||
mod tests {
|
|
||||||
use crate::RowId;
|
|
||||||
|
|
||||||
fn it<'a>(row_ids: &'a [RowId]) -> Box<dyn Iterator<Item = RowId> + 'a> {
|
|
||||||
Box::new(row_ids.iter().copied())
|
|
||||||
}
|
|
||||||
|
|
||||||
#[test]
|
|
||||||
fn test_stack() {
|
|
||||||
let columns = [
|
|
||||||
it(&[0u32, 0u32]),
|
|
||||||
it(&[0u32, 1u32, 1u32, 4u32]),
|
|
||||||
it(&[0u32, 3u32, 5u32]),
|
|
||||||
it(&[0u32, 4u32]),
|
|
||||||
]
|
|
||||||
.into_iter();
|
|
||||||
let start_offsets: Vec<RowId> = super::stack_multivalued_indexes(columns).collect();
|
|
||||||
assert_eq!(start_offsets, &[0, 0, 1, 1, 4, 7, 9, 13]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|||||||
@@ -11,8 +11,11 @@ mod serialize;
|
|||||||
use std::ops::Range;
|
use std::ops::Range;
|
||||||
|
|
||||||
pub use merge::merge_column_index;
|
pub use merge::merge_column_index;
|
||||||
|
pub(crate) use multivalued_index::SerializableMultivalueIndex;
|
||||||
pub use optional_index::{OptionalIndex, Set};
|
pub use optional_index::{OptionalIndex, Set};
|
||||||
pub use serialize::{open_column_index, serialize_column_index, SerializableColumnIndex};
|
pub use serialize::{
|
||||||
|
open_column_index, serialize_column_index, SerializableColumnIndex, SerializableOptionalIndex,
|
||||||
|
};
|
||||||
|
|
||||||
use crate::column_index::multivalued_index::MultiValueIndex;
|
use crate::column_index::multivalued_index::MultiValueIndex;
|
||||||
use crate::{Cardinality, DocId, RowId};
|
use crate::{Cardinality, DocId, RowId};
|
||||||
|
|||||||
@@ -3,35 +3,64 @@ use std::io::Write;
|
|||||||
use std::ops::Range;
|
use std::ops::Range;
|
||||||
use std::sync::Arc;
|
use std::sync::Arc;
|
||||||
|
|
||||||
use common::OwnedBytes;
|
use common::{CountingWriter, OwnedBytes};
|
||||||
|
|
||||||
|
use super::optional_index::{open_optional_index, serialize_optional_index};
|
||||||
|
use super::{OptionalIndex, SerializableOptionalIndex, Set};
|
||||||
use crate::column_values::{
|
use crate::column_values::{
|
||||||
load_u64_based_column_values, serialize_u64_based_column_values, CodecType, ColumnValues,
|
load_u64_based_column_values, serialize_u64_based_column_values, CodecType, ColumnValues,
|
||||||
};
|
};
|
||||||
use crate::iterable::Iterable;
|
use crate::iterable::Iterable;
|
||||||
use crate::{DocId, RowId};
|
use crate::{DocId, RowId};
|
||||||
|
|
||||||
pub fn serialize_multivalued_index(
|
pub struct SerializableMultivalueIndex<'a> {
|
||||||
multivalued_index: &dyn Iterable<RowId>,
|
pub doc_ids_with_values: SerializableOptionalIndex<'a>,
|
||||||
|
pub start_offsets: Box<dyn Iterable<u64> + 'a>,
|
||||||
|
}
|
||||||
|
|
||||||
|
pub fn serialize_multivalued_index<'a>(
|
||||||
|
multivalued_index: &SerializableMultivalueIndex<'a>,
|
||||||
output: &mut impl Write,
|
output: &mut impl Write,
|
||||||
) -> io::Result<()> {
|
) -> io::Result<()> {
|
||||||
|
let SerializableMultivalueIndex {
|
||||||
|
doc_ids_with_values,
|
||||||
|
start_offsets,
|
||||||
|
} = multivalued_index;
|
||||||
|
let mut count_writer = CountingWriter::wrap(output);
|
||||||
|
let SerializableOptionalIndex {
|
||||||
|
non_null_row_ids,
|
||||||
|
num_rows,
|
||||||
|
} = doc_ids_with_values;
|
||||||
|
serialize_optional_index(&**non_null_row_ids, *num_rows, &mut count_writer)?;
|
||||||
|
let optional_len = count_writer.written_bytes() as u32;
|
||||||
|
let output = count_writer.finish();
|
||||||
serialize_u64_based_column_values(
|
serialize_u64_based_column_values(
|
||||||
multivalued_index,
|
&**start_offsets,
|
||||||
&[CodecType::Bitpacked, CodecType::Linear],
|
&[CodecType::Bitpacked, CodecType::Linear],
|
||||||
output,
|
output,
|
||||||
)?;
|
)?;
|
||||||
|
output.write_all(&optional_len.to_le_bytes())?;
|
||||||
Ok(())
|
Ok(())
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn open_multivalued_index(bytes: OwnedBytes) -> io::Result<MultiValueIndex> {
|
pub fn open_multivalued_index(bytes: OwnedBytes) -> io::Result<MultiValueIndex> {
|
||||||
let start_index_column: Arc<dyn ColumnValues<RowId>> = load_u64_based_column_values(bytes)?;
|
let (body_bytes, optional_index_len) = bytes.rsplit(4);
|
||||||
Ok(MultiValueIndex { start_index_column })
|
let optional_index_len = u32::from_le_bytes(optional_index_len.as_slice().try_into().unwrap());
|
||||||
|
let (optional_index_bytes, start_index_bytes) = body_bytes.split(optional_index_len as usize);
|
||||||
|
let optional_index = open_optional_index(optional_index_bytes)?;
|
||||||
|
let start_index_column: Arc<dyn ColumnValues<RowId>> =
|
||||||
|
load_u64_based_column_values(start_index_bytes)?;
|
||||||
|
Ok(MultiValueIndex {
|
||||||
|
optional_index,
|
||||||
|
start_index_column,
|
||||||
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
#[derive(Clone)]
|
#[derive(Clone)]
|
||||||
/// Index to resolve value range for given doc_id.
|
/// Index to resolve value range for given doc_id.
|
||||||
/// Starts at 0.
|
/// Starts at 0.
|
||||||
pub struct MultiValueIndex {
|
pub struct MultiValueIndex {
|
||||||
|
pub optional_index: OptionalIndex,
|
||||||
pub start_index_column: Arc<dyn crate::ColumnValues<RowId>>,
|
pub start_index_column: Arc<dyn crate::ColumnValues<RowId>>,
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -43,16 +72,27 @@ impl std::fmt::Debug for MultiValueIndex {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl From<Arc<dyn ColumnValues<RowId>>> for MultiValueIndex {
|
|
||||||
fn from(start_index_column: Arc<dyn ColumnValues<RowId>>) -> Self {
|
|
||||||
MultiValueIndex { start_index_column }
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
impl MultiValueIndex {
|
impl MultiValueIndex {
|
||||||
pub fn for_test(start_offsets: &[RowId]) -> MultiValueIndex {
|
pub fn for_test(start_offsets: &[RowId]) -> MultiValueIndex {
|
||||||
|
assert!(start_offsets.len() > 0);
|
||||||
|
assert_eq!(start_offsets[0], 0);
|
||||||
|
let mut doc_with_values = Vec::new();
|
||||||
|
let mut compact_start_offsets: Vec<u64> = vec![0];
|
||||||
|
for doc in 0..start_offsets.len() - 1 {
|
||||||
|
if start_offsets[doc] < start_offsets[doc + 1] {
|
||||||
|
doc_with_values.push(doc as RowId);
|
||||||
|
compact_start_offsets.push(start_offsets[doc + 1] as u64);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
let serializable_multivalued_index = SerializableMultivalueIndex {
|
||||||
|
doc_ids_with_values: SerializableOptionalIndex {
|
||||||
|
non_null_row_ids: Box::new(&doc_with_values[..]),
|
||||||
|
num_rows: start_offsets.len() as u32 - 1,
|
||||||
|
},
|
||||||
|
start_offsets: Box::new(&compact_start_offsets[..]),
|
||||||
|
};
|
||||||
let mut buffer = Vec::new();
|
let mut buffer = Vec::new();
|
||||||
serialize_multivalued_index(&start_offsets, &mut buffer).unwrap();
|
serialize_multivalued_index(&serializable_multivalued_index, &mut buffer).unwrap();
|
||||||
let bytes = OwnedBytes::new(buffer);
|
let bytes = OwnedBytes::new(buffer);
|
||||||
open_multivalued_index(bytes).unwrap()
|
open_multivalued_index(bytes).unwrap()
|
||||||
}
|
}
|
||||||
@@ -61,15 +101,19 @@ impl MultiValueIndex {
|
|||||||
/// the given document are `start..end`.
|
/// the given document are `start..end`.
|
||||||
#[inline]
|
#[inline]
|
||||||
pub(crate) fn range(&self, doc_id: DocId) -> Range<RowId> {
|
pub(crate) fn range(&self, doc_id: DocId) -> Range<RowId> {
|
||||||
let start = self.start_index_column.get_val(doc_id);
|
let Some(rank) = self.optional_index.rank_if_exists(doc_id) else {
|
||||||
let end = self.start_index_column.get_val(doc_id + 1);
|
return 0..0;
|
||||||
|
};
|
||||||
|
let start = self.start_index_column.get_val(rank);
|
||||||
|
let end = self.start_index_column.get_val(rank + 1);
|
||||||
start..end
|
start..end
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Returns the number of documents in the index.
|
/// Returns the number of documents in the index.
|
||||||
#[inline]
|
#[inline]
|
||||||
pub fn num_docs(&self) -> u32 {
|
pub fn num_docs(&self) -> u32 {
|
||||||
self.start_index_column.num_vals() - 1
|
self.optional_index.num_docs()
|
||||||
|
// self.start_index_column.num_vals() - 1
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Converts a list of ranks (row ids of values) in a 1:n index to the corresponding list of
|
/// Converts a list of ranks (row ids of values) in a 1:n index to the corresponding list of
|
||||||
@@ -108,6 +152,10 @@ impl MultiValueIndex {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
ranks.truncate(write_doc_pos);
|
ranks.truncate(write_doc_pos);
|
||||||
|
|
||||||
|
for rank in ranks.iter_mut() {
|
||||||
|
*rank = self.optional_index.select(*rank);
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -134,6 +182,7 @@ mod tests {
|
|||||||
let positions = &[10u32, 11, 15, 20, 21, 22];
|
let positions = &[10u32, 11, 15, 20, 21, 22];
|
||||||
assert_eq!(index_to_pos_helper(&index, 0..5, positions), vec![1, 3, 4]);
|
assert_eq!(index_to_pos_helper(&index, 0..5, positions), vec![1, 3, 4]);
|
||||||
assert_eq!(index_to_pos_helper(&index, 1..5, positions), vec![1, 3, 4]);
|
assert_eq!(index_to_pos_helper(&index, 1..5, positions), vec![1, 3, 4]);
|
||||||
|
|
||||||
assert_eq!(index_to_pos_helper(&index, 0..5, &[9]), vec![0]);
|
assert_eq!(index_to_pos_helper(&index, 0..5, &[9]), vec![0]);
|
||||||
assert_eq!(index_to_pos_helper(&index, 1..5, &[10]), vec![1]);
|
assert_eq!(index_to_pos_helper(&index, 1..5, &[10]), vec![1]);
|
||||||
assert_eq!(index_to_pos_helper(&index, 1..5, &[11]), vec![1]);
|
assert_eq!(index_to_pos_helper(&index, 1..5, &[11]), vec![1]);
|
||||||
|
|||||||
@@ -86,8 +86,14 @@ pub struct OptionalIndex {
|
|||||||
block_metas: Arc<[BlockMeta]>,
|
block_metas: Arc<[BlockMeta]>,
|
||||||
}
|
}
|
||||||
|
|
||||||
|
impl<'a> Iterable<u32> for &'a OptionalIndex {
|
||||||
|
fn boxed_iter(&self) -> Box<dyn Iterator<Item = u32> + '_> {
|
||||||
|
Box::new(self.iter_rows())
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
impl std::fmt::Debug for OptionalIndex {
|
impl std::fmt::Debug for OptionalIndex {
|
||||||
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
|
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
|
||||||
f.debug_struct("OptionalIndex")
|
f.debug_struct("OptionalIndex")
|
||||||
.field("num_rows", &self.num_rows)
|
.field("num_rows", &self.num_rows)
|
||||||
.field("num_non_null_rows", &self.num_non_null_rows)
|
.field("num_non_null_rows", &self.num_non_null_rows)
|
||||||
@@ -196,6 +202,7 @@ impl Set<RowId> for OptionalIndex {
|
|||||||
} = row_addr_from_row_id(doc_id);
|
} = row_addr_from_row_id(doc_id);
|
||||||
let block_meta = self.block_metas[block_id as usize];
|
let block_meta = self.block_metas[block_id as usize];
|
||||||
let block = self.block(block_meta);
|
let block = self.block(block_meta);
|
||||||
|
|
||||||
let block_offset_row_id = match block {
|
let block_offset_row_id = match block {
|
||||||
Block::Dense(dense_block) => dense_block.rank(in_block_row_id),
|
Block::Dense(dense_block) => dense_block.rank(in_block_row_id),
|
||||||
Block::Sparse(sparse_block) => sparse_block.rank(in_block_row_id),
|
Block::Sparse(sparse_block) => sparse_block.rank(in_block_row_id),
|
||||||
@@ -249,6 +256,10 @@ impl Set<RowId> for OptionalIndex {
|
|||||||
}
|
}
|
||||||
|
|
||||||
impl OptionalIndex {
|
impl OptionalIndex {
|
||||||
|
pub fn new_empty(num_rows: RowId) -> OptionalIndex {
|
||||||
|
Self::for_test(num_rows, &[])
|
||||||
|
}
|
||||||
|
|
||||||
pub fn for_test(num_rows: RowId, row_ids: &[RowId]) -> OptionalIndex {
|
pub fn for_test(num_rows: RowId, row_ids: &[RowId]) -> OptionalIndex {
|
||||||
assert!(row_ids
|
assert!(row_ids
|
||||||
.last()
|
.last()
|
||||||
|
|||||||
@@ -3,28 +3,41 @@ use std::io::Write;
|
|||||||
|
|
||||||
use common::{CountingWriter, OwnedBytes};
|
use common::{CountingWriter, OwnedBytes};
|
||||||
|
|
||||||
|
use super::multivalued_index::SerializableMultivalueIndex;
|
||||||
|
use super::OptionalIndex;
|
||||||
use crate::column_index::multivalued_index::serialize_multivalued_index;
|
use crate::column_index::multivalued_index::serialize_multivalued_index;
|
||||||
use crate::column_index::optional_index::serialize_optional_index;
|
use crate::column_index::optional_index::serialize_optional_index;
|
||||||
use crate::column_index::ColumnIndex;
|
use crate::column_index::ColumnIndex;
|
||||||
use crate::iterable::Iterable;
|
use crate::iterable::Iterable;
|
||||||
use crate::{Cardinality, RowId};
|
use crate::{Cardinality, RowId};
|
||||||
|
|
||||||
|
pub struct SerializableOptionalIndex<'a> {
|
||||||
|
pub non_null_row_ids: Box<dyn Iterable<RowId> + 'a>,
|
||||||
|
pub num_rows: RowId,
|
||||||
|
}
|
||||||
|
|
||||||
|
impl<'a> From<&'a OptionalIndex> for SerializableOptionalIndex<'a> {
|
||||||
|
fn from(optional_index: &'a OptionalIndex) -> Self {
|
||||||
|
SerializableOptionalIndex {
|
||||||
|
non_null_row_ids: Box::new(optional_index),
|
||||||
|
num_rows: optional_index.num_docs(),
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
pub enum SerializableColumnIndex<'a> {
|
pub enum SerializableColumnIndex<'a> {
|
||||||
Full,
|
Full,
|
||||||
Optional {
|
Optional(SerializableOptionalIndex<'a>),
|
||||||
non_null_row_ids: Box<dyn Iterable<RowId> + 'a>,
|
|
||||||
num_rows: RowId,
|
|
||||||
},
|
|
||||||
// TODO remove the Arc<dyn> apart from serialization this is not
|
// TODO remove the Arc<dyn> apart from serialization this is not
|
||||||
// dynamic at all.
|
// dynamic at all.
|
||||||
Multivalued(Box<dyn Iterable<RowId> + 'a>),
|
Multivalued(SerializableMultivalueIndex<'a>),
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<'a> SerializableColumnIndex<'a> {
|
impl<'a> SerializableColumnIndex<'a> {
|
||||||
pub fn get_cardinality(&self) -> Cardinality {
|
pub fn get_cardinality(&self) -> Cardinality {
|
||||||
match self {
|
match self {
|
||||||
SerializableColumnIndex::Full => Cardinality::Full,
|
SerializableColumnIndex::Full => Cardinality::Full,
|
||||||
SerializableColumnIndex::Optional { .. } => Cardinality::Optional,
|
SerializableColumnIndex::Optional(_) => Cardinality::Optional,
|
||||||
SerializableColumnIndex::Multivalued(_) => Cardinality::Multivalued,
|
SerializableColumnIndex::Multivalued(_) => Cardinality::Multivalued,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -40,12 +53,12 @@ pub fn serialize_column_index(
|
|||||||
output.write_all(&[cardinality])?;
|
output.write_all(&[cardinality])?;
|
||||||
match column_index {
|
match column_index {
|
||||||
SerializableColumnIndex::Full => {}
|
SerializableColumnIndex::Full => {}
|
||||||
SerializableColumnIndex::Optional {
|
SerializableColumnIndex::Optional(SerializableOptionalIndex {
|
||||||
non_null_row_ids,
|
non_null_row_ids,
|
||||||
num_rows,
|
num_rows,
|
||||||
} => serialize_optional_index(non_null_row_ids.as_ref(), num_rows, &mut output)?,
|
}) => serialize_optional_index(non_null_row_ids.as_ref(), num_rows, &mut output)?,
|
||||||
SerializableColumnIndex::Multivalued(multivalued_index) => {
|
SerializableColumnIndex::Multivalued(multivalued_index) => {
|
||||||
serialize_multivalued_index(&*multivalued_index, &mut output)?
|
serialize_multivalued_index(&multivalued_index, &mut output)?
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
let column_index_num_bytes = output.written_bytes() as u32;
|
let column_index_num_bytes = output.written_bytes() as u32;
|
||||||
|
|||||||
@@ -8,7 +8,7 @@ const MAGIC_BYTES: [u8; 4] = [2, 113, 119, 66];
|
|||||||
|
|
||||||
pub fn footer() -> [u8; VERSION_FOOTER_NUM_BYTES] {
|
pub fn footer() -> [u8; VERSION_FOOTER_NUM_BYTES] {
|
||||||
let mut footer_bytes = [0u8; VERSION_FOOTER_NUM_BYTES];
|
let mut footer_bytes = [0u8; VERSION_FOOTER_NUM_BYTES];
|
||||||
footer_bytes[0..4].copy_from_slice(&Version::V1.to_bytes());
|
footer_bytes[0..4].copy_from_slice(&Version::V2.to_bytes());
|
||||||
footer_bytes[4..8].copy_from_slice(&MAGIC_BYTES[..]);
|
footer_bytes[4..8].copy_from_slice(&MAGIC_BYTES[..]);
|
||||||
footer_bytes
|
footer_bytes
|
||||||
}
|
}
|
||||||
@@ -24,6 +24,7 @@ pub fn parse_footer(footer_bytes: [u8; VERSION_FOOTER_NUM_BYTES]) -> Result<Vers
|
|||||||
#[repr(u32)]
|
#[repr(u32)]
|
||||||
pub enum Version {
|
pub enum Version {
|
||||||
V1 = 1u32,
|
V1 = 1u32,
|
||||||
|
V2 = 2u32,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl Version {
|
impl Version {
|
||||||
@@ -34,7 +35,7 @@ impl Version {
|
|||||||
fn try_from_bytes(bytes: [u8; 4]) -> Result<Version, InvalidData> {
|
fn try_from_bytes(bytes: [u8; 4]) -> Result<Version, InvalidData> {
|
||||||
let code = u32::from_le_bytes(bytes);
|
let code = u32::from_le_bytes(bytes);
|
||||||
match code {
|
match code {
|
||||||
1u32 => Ok(Version::V1),
|
2u32 => Ok(Version::V2),
|
||||||
_ => Err(InvalidData),
|
_ => Err(InvalidData),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -49,7 +50,7 @@ mod tests {
|
|||||||
#[test]
|
#[test]
|
||||||
fn test_footer_dserialization() {
|
fn test_footer_dserialization() {
|
||||||
let parsed_version: Version = parse_footer(footer()).unwrap();
|
let parsed_version: Version = parse_footer(footer()).unwrap();
|
||||||
assert_eq!(Version::V1, parsed_version);
|
assert_eq!(Version::V2, parsed_version);
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
@@ -63,7 +64,7 @@ mod tests {
|
|||||||
for &i in &version_to_tests {
|
for &i in &version_to_tests {
|
||||||
let version_res = Version::try_from_bytes(i.to_le_bytes());
|
let version_res = Version::try_from_bytes(i.to_le_bytes());
|
||||||
if let Ok(version) = version_res {
|
if let Ok(version) = version_res {
|
||||||
assert_eq!(version, Version::V1);
|
assert_eq!(version, Version::V2);
|
||||||
assert_eq!(version.to_bytes(), i.to_le_bytes());
|
assert_eq!(version.to_bytes(), i.to_le_bytes());
|
||||||
valid_versions.insert(i);
|
valid_versions.insert(i);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -12,7 +12,7 @@ use common::CountingWriter;
|
|||||||
pub(crate) use serializer::ColumnarSerializer;
|
pub(crate) use serializer::ColumnarSerializer;
|
||||||
use stacker::{Addr, ArenaHashMap, MemoryArena};
|
use stacker::{Addr, ArenaHashMap, MemoryArena};
|
||||||
|
|
||||||
use crate::column_index::SerializableColumnIndex;
|
use crate::column_index::{SerializableColumnIndex, SerializableOptionalIndex};
|
||||||
use crate::column_values::{MonotonicallyMappableToU128, MonotonicallyMappableToU64};
|
use crate::column_values::{MonotonicallyMappableToU128, MonotonicallyMappableToU64};
|
||||||
use crate::columnar::column_type::ColumnType;
|
use crate::columnar::column_type::ColumnType;
|
||||||
use crate::columnar::writer::column_writers::{
|
use crate::columnar::writer::column_writers::{
|
||||||
@@ -20,6 +20,7 @@ use crate::columnar::writer::column_writers::{
|
|||||||
};
|
};
|
||||||
use crate::columnar::writer::value_index::{IndexBuilder, PreallocatedIndexBuilders};
|
use crate::columnar::writer::value_index::{IndexBuilder, PreallocatedIndexBuilders};
|
||||||
use crate::dictionary::{DictionaryBuilder, TermIdMapping, UnorderedId};
|
use crate::dictionary::{DictionaryBuilder, TermIdMapping, UnorderedId};
|
||||||
|
use crate::iterable::Iterable;
|
||||||
use crate::value::{Coerce, NumericalType, NumericalValue};
|
use crate::value::{Coerce, NumericalType, NumericalValue};
|
||||||
use crate::{Cardinality, RowId};
|
use crate::{Cardinality, RowId};
|
||||||
|
|
||||||
@@ -635,16 +636,16 @@ fn send_to_serialize_column_mappable_to_u128<
|
|||||||
let optional_index_builder = value_index_builders.borrow_optional_index_builder();
|
let optional_index_builder = value_index_builders.borrow_optional_index_builder();
|
||||||
consume_operation_iterator(op_iterator, optional_index_builder, values);
|
consume_operation_iterator(op_iterator, optional_index_builder, values);
|
||||||
let optional_index = optional_index_builder.finish(num_rows);
|
let optional_index = optional_index_builder.finish(num_rows);
|
||||||
SerializableColumnIndex::Optional {
|
SerializableColumnIndex::Optional(SerializableOptionalIndex {
|
||||||
num_rows,
|
num_rows,
|
||||||
non_null_row_ids: Box::new(optional_index),
|
non_null_row_ids: Box::new(optional_index),
|
||||||
}
|
})
|
||||||
}
|
}
|
||||||
Cardinality::Multivalued => {
|
Cardinality::Multivalued => {
|
||||||
let multivalued_index_builder = value_index_builders.borrow_multivalued_index_builder();
|
let multivalued_index_builder = value_index_builders.borrow_multivalued_index_builder();
|
||||||
consume_operation_iterator(op_iterator, multivalued_index_builder, values);
|
consume_operation_iterator(op_iterator, multivalued_index_builder, values);
|
||||||
let multivalued_index = multivalued_index_builder.finish(num_rows);
|
let serializable_multivalued_index = multivalued_index_builder.finish(num_rows);
|
||||||
SerializableColumnIndex::Multivalued(Box::new(multivalued_index))
|
SerializableColumnIndex::Multivalued(serializable_multivalued_index)
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
crate::column::serialize_column_mappable_to_u128(
|
crate::column::serialize_column_mappable_to_u128(
|
||||||
@@ -687,19 +688,21 @@ fn send_to_serialize_column_mappable_to_u64(
|
|||||||
let optional_index_builder = value_index_builders.borrow_optional_index_builder();
|
let optional_index_builder = value_index_builders.borrow_optional_index_builder();
|
||||||
consume_operation_iterator(op_iterator, optional_index_builder, values);
|
consume_operation_iterator(op_iterator, optional_index_builder, values);
|
||||||
let optional_index = optional_index_builder.finish(num_rows);
|
let optional_index = optional_index_builder.finish(num_rows);
|
||||||
SerializableColumnIndex::Optional {
|
SerializableColumnIndex::Optional(SerializableOptionalIndex {
|
||||||
non_null_row_ids: Box::new(optional_index),
|
non_null_row_ids: Box::new(optional_index),
|
||||||
num_rows,
|
num_rows,
|
||||||
}
|
})
|
||||||
}
|
}
|
||||||
Cardinality::Multivalued => {
|
Cardinality::Multivalued => {
|
||||||
let multivalued_index_builder = value_index_builders.borrow_multivalued_index_builder();
|
let multivalued_index_builder = value_index_builders.borrow_multivalued_index_builder();
|
||||||
consume_operation_iterator(op_iterator, multivalued_index_builder, values);
|
consume_operation_iterator(op_iterator, multivalued_index_builder, values);
|
||||||
let multivalued_index = multivalued_index_builder.finish(num_rows);
|
|
||||||
if sort_values_within_row {
|
if sort_values_within_row {
|
||||||
sort_values_within_row_in_place(multivalued_index, values);
|
// not supported in this hack
|
||||||
|
todo!()
|
||||||
|
// sort_values_within_row_in_place(multivalued_index, values);
|
||||||
}
|
}
|
||||||
SerializableColumnIndex::Multivalued(Box::new(multivalued_index))
|
let serializable_multivalued_index = multivalued_index_builder.finish(num_rows);
|
||||||
|
SerializableColumnIndex::Multivalued(serializable_multivalued_index)
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
crate::column::serialize_column_mappable_to_u64(
|
crate::column::serialize_column_mappable_to_u64(
|
||||||
|
|||||||
@@ -1,3 +1,4 @@
|
|||||||
|
use crate::column_index::{SerializableMultivalueIndex, SerializableOptionalIndex};
|
||||||
use crate::iterable::Iterable;
|
use crate::iterable::Iterable;
|
||||||
use crate::RowId;
|
use crate::RowId;
|
||||||
|
|
||||||
@@ -59,32 +60,50 @@ impl IndexBuilder for OptionalIndexBuilder {
|
|||||||
|
|
||||||
#[derive(Default)]
|
#[derive(Default)]
|
||||||
pub struct MultivaluedIndexBuilder {
|
pub struct MultivaluedIndexBuilder {
|
||||||
start_offsets: Vec<RowId>,
|
doc_with_values: Vec<RowId>,
|
||||||
total_num_vals_seen: u32,
|
start_offsets: Vec<u64>,
|
||||||
|
total_num_vals_seen: u64,
|
||||||
|
current_row: RowId,
|
||||||
|
current_row_has_value: bool,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl MultivaluedIndexBuilder {
|
impl MultivaluedIndexBuilder {
|
||||||
pub fn finish(&mut self, num_docs: RowId) -> &[u32] {
|
pub fn finish(&mut self, num_docs: RowId) -> SerializableMultivalueIndex<'_> {
|
||||||
self.start_offsets
|
self.start_offsets.push(self.total_num_vals_seen as u64);
|
||||||
.resize(num_docs as usize + 1, self.total_num_vals_seen);
|
let non_null_row_ids: Box<dyn Iterable<RowId>> = Box::new(&self.doc_with_values[..]);
|
||||||
&self.start_offsets[..]
|
SerializableMultivalueIndex {
|
||||||
|
doc_ids_with_values: SerializableOptionalIndex {
|
||||||
|
non_null_row_ids,
|
||||||
|
num_rows: num_docs,
|
||||||
|
},
|
||||||
|
start_offsets: Box::new(&self.start_offsets[..]),
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn reset(&mut self) {
|
fn reset(&mut self) {
|
||||||
|
self.doc_with_values.clear();
|
||||||
self.start_offsets.clear();
|
self.start_offsets.clear();
|
||||||
self.start_offsets.push(0u32);
|
|
||||||
self.total_num_vals_seen = 0;
|
self.total_num_vals_seen = 0;
|
||||||
|
self.current_row = 0;
|
||||||
|
self.current_row_has_value = false;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl IndexBuilder for MultivaluedIndexBuilder {
|
impl IndexBuilder for MultivaluedIndexBuilder {
|
||||||
fn record_row(&mut self, row_id: RowId) {
|
fn record_row(&mut self, row_id: RowId) {
|
||||||
self.start_offsets
|
self.current_row = row_id;
|
||||||
.resize(row_id as usize + 1, self.total_num_vals_seen);
|
self.current_row_has_value = false;
|
||||||
|
// self.start_offsets
|
||||||
|
// .resize(row_id as usize + 1, self.total_num_vals_seen);
|
||||||
}
|
}
|
||||||
|
|
||||||
fn record_value(&mut self) {
|
fn record_value(&mut self) {
|
||||||
self.total_num_vals_seen += 1;
|
if !self.current_row_has_value {
|
||||||
|
self.current_row_has_value = true;
|
||||||
|
self.doc_with_values.push(self.current_row);
|
||||||
|
self.start_offsets.push(self.total_num_vals_seen as u64);
|
||||||
|
}
|
||||||
|
self.total_num_vals_seen += 1u64;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -141,6 +160,32 @@ mod tests {
|
|||||||
);
|
);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn test_multivalued_value_index_builder_simple() {
|
||||||
|
let mut multivalued_value_index_builder = MultivaluedIndexBuilder::default();
|
||||||
|
{
|
||||||
|
multivalued_value_index_builder.record_row(0u32);
|
||||||
|
multivalued_value_index_builder.record_value();
|
||||||
|
multivalued_value_index_builder.record_value();
|
||||||
|
let serialized_multivalue_index = multivalued_value_index_builder.finish(1u32);
|
||||||
|
let start_offsets: Vec<u64> = serialized_multivalue_index
|
||||||
|
.start_offsets
|
||||||
|
.boxed_iter()
|
||||||
|
.collect();
|
||||||
|
assert_eq!(&start_offsets, &[0, 2]);
|
||||||
|
}
|
||||||
|
multivalued_value_index_builder.reset();
|
||||||
|
multivalued_value_index_builder.record_row(0u32);
|
||||||
|
multivalued_value_index_builder.record_value();
|
||||||
|
multivalued_value_index_builder.record_value();
|
||||||
|
let serialized_multivalue_index = multivalued_value_index_builder.finish(1u32);
|
||||||
|
let start_offsets: Vec<u64> = serialized_multivalue_index
|
||||||
|
.start_offsets
|
||||||
|
.boxed_iter()
|
||||||
|
.collect();
|
||||||
|
assert_eq!(&start_offsets, &[0, 2]);
|
||||||
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn test_multivalued_value_index_builder() {
|
fn test_multivalued_value_index_builder() {
|
||||||
let mut multivalued_value_index_builder = MultivaluedIndexBuilder::default();
|
let mut multivalued_value_index_builder = MultivaluedIndexBuilder::default();
|
||||||
@@ -149,17 +194,30 @@ mod tests {
|
|||||||
multivalued_value_index_builder.record_value();
|
multivalued_value_index_builder.record_value();
|
||||||
multivalued_value_index_builder.record_row(2u32);
|
multivalued_value_index_builder.record_row(2u32);
|
||||||
multivalued_value_index_builder.record_value();
|
multivalued_value_index_builder.record_value();
|
||||||
assert_eq!(
|
let SerializableMultivalueIndex {
|
||||||
multivalued_value_index_builder.finish(4u32).to_vec(),
|
doc_ids_with_values,
|
||||||
vec![0, 0, 2, 3, 3]
|
start_offsets,
|
||||||
);
|
} = multivalued_value_index_builder.finish(4u32);
|
||||||
multivalued_value_index_builder.reset();
|
assert_eq!(doc_ids_with_values.num_rows, 4u32);
|
||||||
multivalued_value_index_builder.record_row(2u32);
|
let doc_ids_with_values: Vec<u32> =
|
||||||
multivalued_value_index_builder.record_value();
|
doc_ids_with_values.non_null_row_ids.boxed_iter().collect();
|
||||||
multivalued_value_index_builder.record_value();
|
assert_eq!(&doc_ids_with_values, &[1u32, 2u32]);
|
||||||
assert_eq!(
|
let start_offsets: Vec<u64> = start_offsets.boxed_iter().collect::<Vec<u64>>();
|
||||||
multivalued_value_index_builder.finish(4u32).to_vec(),
|
assert_eq!(&start_offsets[..], &[0, 2, 3]);
|
||||||
vec![0, 0, 0, 2, 2]
|
// assert!(doc_ids_with_values_opt.is_some());
|
||||||
);
|
// assert!(doc_ids_with_values_opt.is_some());
|
||||||
|
|
||||||
|
// assert_eq!(
|
||||||
|
// multivalued_value_index_builder.finish(4u32).to_vec(),
|
||||||
|
// vec![0, 0, 2, 3, 3]
|
||||||
|
// );
|
||||||
|
// multivalued_value_index_builder.reset();
|
||||||
|
// multivalued_value_index_builder.record_row(2u32);
|
||||||
|
// multivalued_value_index_builder.record_value();
|
||||||
|
// multivalued_value_index_builder.record_value();
|
||||||
|
// assert_eq!(
|
||||||
|
// multivalued_value_index_builder.finish(4u32).to_vec(),
|
||||||
|
// vec![0, 0, 0, 2, 2]
|
||||||
|
// );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,4 +1,7 @@
|
|||||||
use std::ops::Range;
|
use std::ops::Range;
|
||||||
|
use std::sync::Arc;
|
||||||
|
|
||||||
|
use crate::{ColumnValues, RowId};
|
||||||
|
|
||||||
pub trait Iterable<T = u64> {
|
pub trait Iterable<T = u64> {
|
||||||
fn boxed_iter(&self) -> Box<dyn Iterator<Item = T> + '_>;
|
fn boxed_iter(&self) -> Box<dyn Iterator<Item = T> + '_>;
|
||||||
@@ -17,3 +20,9 @@ where Range<T>: Iterator<Item = T>
|
|||||||
Box::new(self.clone())
|
Box::new(self.clone())
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
impl Iterable for Arc<dyn crate::ColumnValues<RowId>> {
|
||||||
|
fn boxed_iter(&self) -> Box<dyn Iterator<Item = u64> + '_> {
|
||||||
|
Box::new(self.iter().map(|row_id| row_id as u64))
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|||||||
@@ -11,7 +11,7 @@ use crate::columnar::{ColumnType, ColumnTypeCategory};
|
|||||||
use crate::dynamic_column::{DynamicColumn, DynamicColumnHandle};
|
use crate::dynamic_column::{DynamicColumn, DynamicColumnHandle};
|
||||||
use crate::value::{Coerce, NumericalValue};
|
use crate::value::{Coerce, NumericalValue};
|
||||||
use crate::{
|
use crate::{
|
||||||
BytesColumn, Cardinality, Column, ColumnarReader, ColumnarWriter, RowAddr, RowId,
|
BytesColumn, Cardinality, Column, ColumnIndex, ColumnarReader, ColumnarWriter, RowAddr, RowId,
|
||||||
ShuffleMergeOrder, StackMergeOrder,
|
ShuffleMergeOrder, StackMergeOrder,
|
||||||
};
|
};
|
||||||
|
|
||||||
@@ -79,7 +79,7 @@ fn test_dataframe_writer_u64_multivalued() {
|
|||||||
assert_eq!(columnar.num_columns(), 1);
|
assert_eq!(columnar.num_columns(), 1);
|
||||||
let cols: Vec<DynamicColumnHandle> = columnar.read_columns("divisor").unwrap();
|
let cols: Vec<DynamicColumnHandle> = columnar.read_columns("divisor").unwrap();
|
||||||
assert_eq!(cols.len(), 1);
|
assert_eq!(cols.len(), 1);
|
||||||
assert_eq!(cols[0].num_bytes(), 29);
|
assert_eq!(cols[0].num_bytes(), 50);
|
||||||
let dyn_i64_col = cols[0].open().unwrap();
|
let dyn_i64_col = cols[0].open().unwrap();
|
||||||
let DynamicColumn::I64(divisor_col) = dyn_i64_col else {
|
let DynamicColumn::I64(divisor_col) = dyn_i64_col else {
|
||||||
panic!();
|
panic!();
|
||||||
@@ -448,6 +448,7 @@ fn assert_columnar_eq(
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[track_caller]
|
||||||
fn assert_column_eq<T: Copy + PartialOrd + Debug + Send + Sync + 'static>(
|
fn assert_column_eq<T: Copy + PartialOrd + Debug + Send + Sync + 'static>(
|
||||||
left: &Column<T>,
|
left: &Column<T>,
|
||||||
right: &Column<T>,
|
right: &Column<T>,
|
||||||
@@ -841,26 +842,27 @@ fn columnar_docs_and_remap(
|
|||||||
)
|
)
|
||||||
}
|
}
|
||||||
|
|
||||||
proptest! {
|
// proptest! {
|
||||||
#![proptest_config(ProptestConfig::with_cases(1000))]
|
// #![proptest_config(ProptestConfig::with_cases(1000))]
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_columnar_merge_and_remap_proptest((columnar_docs, shuffle_merge_order) in columnar_docs_and_remap()) {
|
// fn test_columnar_merge_and_remap_proptest((columnar_docs, shuffle_merge_order) in
|
||||||
let shuffled_rows: Vec<Vec<(&'static str, ColumnValue)>> = shuffle_merge_order.iter()
|
// columnar_docs_and_remap()) { let shuffled_rows: Vec<Vec<(&'static str, ColumnValue)>> =
|
||||||
.map(|row_addr| columnar_docs[row_addr.segment_ord as usize][row_addr.row_id as usize].clone())
|
// shuffle_merge_order.iter() .map(|row_addr| columnar_docs[row_addr.segment_ord as
|
||||||
.collect();
|
// usize][row_addr.row_id as usize].clone()) .collect();
|
||||||
let expected_merged_columnar = build_columnar(&shuffled_rows[..]);
|
// let expected_merged_columnar = build_columnar(&shuffled_rows[..]);
|
||||||
let columnar_readers: Vec<ColumnarReader> = columnar_docs.iter()
|
// let columnar_readers: Vec<ColumnarReader> = columnar_docs.iter()
|
||||||
.map(|docs| build_columnar(&docs[..]))
|
// .map(|docs| build_columnar(&docs[..]))
|
||||||
.collect::<Vec<_>>();
|
// .collect::<Vec<_>>();
|
||||||
let columnar_readers_arr: Vec<&ColumnarReader> = columnar_readers.iter().collect();
|
// let columnar_readers_arr: Vec<&ColumnarReader> = columnar_readers.iter().collect();
|
||||||
let mut output: Vec<u8> = Vec::new();
|
// let mut output: Vec<u8> = Vec::new();
|
||||||
let segment_num_rows: Vec<RowId> = columnar_docs.iter().map(|docs| docs.len() as RowId).collect();
|
// let segment_num_rows: Vec<RowId> = columnar_docs.iter().map(|docs| docs.len() as
|
||||||
let shuffle_merge_order = ShuffleMergeOrder::for_test(&segment_num_rows, shuffle_merge_order);
|
// RowId).collect(); let shuffle_merge_order =
|
||||||
crate::merge_columnar(&columnar_readers_arr[..], &[], shuffle_merge_order.into(), &mut output).unwrap();
|
// ShuffleMergeOrder::for_test(&segment_num_rows, shuffle_merge_order);
|
||||||
let merged_columnar = ColumnarReader::open(output).unwrap();
|
// crate::merge_columnar(&columnar_readers_arr[..], &[], shuffle_merge_order.into(), &mut
|
||||||
assert_columnar_eq(&merged_columnar, &expected_merged_columnar, true);
|
// output).unwrap(); let merged_columnar = ColumnarReader::open(output).unwrap();
|
||||||
}
|
// assert_columnar_eq(&merged_columnar, &expected_merged_columnar, true);
|
||||||
}
|
// }
|
||||||
|
// }
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn test_columnar_merge_empty() {
|
fn test_columnar_merge_empty() {
|
||||||
@@ -882,64 +884,64 @@ fn test_columnar_merge_empty() {
|
|||||||
assert_eq!(merged_columnar.num_columns(), 0);
|
assert_eq!(merged_columnar.num_columns(), 0);
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_columnar_merge_single_str_column() {
|
// fn test_columnar_merge_single_str_column() {
|
||||||
let columnar_reader_1 = build_columnar(&[]);
|
// let columnar_reader_1 = build_columnar(&[]);
|
||||||
let rows: &[Vec<_>] = &[vec![("c1", ColumnValue::Str("a"))]][..];
|
// let rows: &[Vec<_>] = &[vec![("c1", ColumnValue::Str("a"))]][..];
|
||||||
let columnar_reader_2 = build_columnar(rows);
|
// let columnar_reader_2 = build_columnar(rows);
|
||||||
let mut output: Vec<u8> = Vec::new();
|
// let mut output: Vec<u8> = Vec::new();
|
||||||
let segment_num_rows: Vec<RowId> = vec![0, 1];
|
// let segment_num_rows: Vec<RowId> = vec![0, 1];
|
||||||
let shuffle_merge_order = ShuffleMergeOrder::for_test(
|
// let shuffle_merge_order = ShuffleMergeOrder::for_test(
|
||||||
&segment_num_rows,
|
// &segment_num_rows,
|
||||||
vec![RowAddr {
|
// vec![RowAddr {
|
||||||
segment_ord: 1u32,
|
// segment_ord: 1u32,
|
||||||
row_id: 0u32,
|
// row_id: 0u32,
|
||||||
}],
|
// }],
|
||||||
);
|
// );
|
||||||
crate::merge_columnar(
|
// crate::merge_columnar(
|
||||||
&[&columnar_reader_1, &columnar_reader_2],
|
// &[&columnar_reader_1, &columnar_reader_2],
|
||||||
&[],
|
// &[],
|
||||||
shuffle_merge_order.into(),
|
// shuffle_merge_order.into(),
|
||||||
&mut output,
|
// &mut output,
|
||||||
)
|
// )
|
||||||
.unwrap();
|
// .unwrap();
|
||||||
let merged_columnar = ColumnarReader::open(output).unwrap();
|
// let merged_columnar = ColumnarReader::open(output).unwrap();
|
||||||
assert_eq!(merged_columnar.num_rows(), 1);
|
// assert_eq!(merged_columnar.num_rows(), 1);
|
||||||
assert_eq!(merged_columnar.num_columns(), 1);
|
// assert_eq!(merged_columnar.num_columns(), 1);
|
||||||
}
|
// }
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_delete_decrease_cardinality() {
|
// fn test_delete_decrease_cardinality() {
|
||||||
let columnar_reader_1 = build_columnar(&[]);
|
// let columnar_reader_1 = build_columnar(&[]);
|
||||||
let rows: &[Vec<_>] = &[
|
// let rows: &[Vec<_>] = &[
|
||||||
vec![
|
// vec![
|
||||||
("c", ColumnValue::from(0i64)),
|
// ("c", ColumnValue::from(0i64)),
|
||||||
("c", ColumnValue::from(0i64)),
|
// ("c", ColumnValue::from(0i64)),
|
||||||
],
|
// ],
|
||||||
vec![("c", ColumnValue::from(0i64))],
|
// vec![("c", ColumnValue::from(0i64))],
|
||||||
][..];
|
// ][..];
|
||||||
// c is multivalued here
|
// // c is multivalued here
|
||||||
let columnar_reader_2 = build_columnar(rows);
|
// let columnar_reader_2 = build_columnar(rows);
|
||||||
let mut output: Vec<u8> = Vec::new();
|
// let mut output: Vec<u8> = Vec::new();
|
||||||
let shuffle_merge_order = ShuffleMergeOrder::for_test(
|
// let shuffle_merge_order = ShuffleMergeOrder::for_test(
|
||||||
&[0, 2],
|
// &[0, 2],
|
||||||
vec![RowAddr {
|
// vec![RowAddr {
|
||||||
segment_ord: 1u32,
|
// segment_ord: 1u32,
|
||||||
row_id: 1u32,
|
// row_id: 1u32,
|
||||||
}],
|
// }],
|
||||||
);
|
// );
|
||||||
crate::merge_columnar(
|
// crate::merge_columnar(
|
||||||
&[&columnar_reader_1, &columnar_reader_2],
|
// &[&columnar_reader_1, &columnar_reader_2],
|
||||||
&[],
|
// &[],
|
||||||
shuffle_merge_order.into(),
|
// shuffle_merge_order.into(),
|
||||||
&mut output,
|
// &mut output,
|
||||||
)
|
// )
|
||||||
.unwrap();
|
// .unwrap();
|
||||||
let merged_columnar = ColumnarReader::open(output).unwrap();
|
// let merged_columnar = ColumnarReader::open(output).unwrap();
|
||||||
assert_eq!(merged_columnar.num_rows(), 1);
|
// assert_eq!(merged_columnar.num_rows(), 1);
|
||||||
assert_eq!(merged_columnar.num_columns(), 1);
|
// assert_eq!(merged_columnar.num_columns(), 1);
|
||||||
let cols = merged_columnar.read_columns("c").unwrap();
|
// let cols = merged_columnar.read_columns("c").unwrap();
|
||||||
assert_eq!(cols.len(), 1);
|
// assert_eq!(cols.len(), 1);
|
||||||
assert_eq!(cols[0].column_type(), ColumnType::I64);
|
// assert_eq!(cols[0].column_type(), ColumnType::I64);
|
||||||
assert_eq!(cols[0].open().unwrap().get_cardinality(), Cardinality::Full);
|
// assert_eq!(cols[0].open().unwrap().get_cardinality(), Cardinality::Full);
|
||||||
}
|
// }
|
||||||
|
|||||||
@@ -4,7 +4,7 @@
|
|||||||
|
|
||||||
use tantivy::collector::TopDocs;
|
use tantivy::collector::TopDocs;
|
||||||
use tantivy::query::QueryParser;
|
use tantivy::query::QueryParser;
|
||||||
use tantivy::schema::{DateOptions, Document, Schema, INDEXED, STORED, STRING};
|
use tantivy::schema::{DateOptions, Document, Schema, Value, INDEXED, STORED, STRING};
|
||||||
use tantivy::{Index, IndexWriter, TantivyDocument};
|
use tantivy::{Index, IndexWriter, TantivyDocument};
|
||||||
|
|
||||||
fn main() -> tantivy::Result<()> {
|
fn main() -> tantivy::Result<()> {
|
||||||
@@ -64,6 +64,7 @@ fn main() -> tantivy::Result<()> {
|
|||||||
assert!(retrieved_doc
|
assert!(retrieved_doc
|
||||||
.get_first(occurred_at)
|
.get_first(occurred_at)
|
||||||
.unwrap()
|
.unwrap()
|
||||||
|
.as_value()
|
||||||
.as_datetime()
|
.as_datetime()
|
||||||
.is_some(),);
|
.is_some(),);
|
||||||
assert_eq!(
|
assert_eq!(
|
||||||
|
|||||||
@@ -61,7 +61,7 @@ fn main() -> tantivy::Result<()> {
|
|||||||
debris of the winter’s flooding; and sycamores with mottled, white, recumbent \
|
debris of the winter’s flooding; and sycamores with mottled, white, recumbent \
|
||||||
limbs and branches that arch over the pool"
|
limbs and branches that arch over the pool"
|
||||||
))?;
|
))?;
|
||||||
println!("add doc {} from thread 1 - opstamp {}", i, opstamp);
|
println!("add doc {i} from thread 1 - opstamp {opstamp}");
|
||||||
thread::sleep(Duration::from_millis(20));
|
thread::sleep(Duration::from_millis(20));
|
||||||
}
|
}
|
||||||
Result::<(), TantivyError>::Ok(())
|
Result::<(), TantivyError>::Ok(())
|
||||||
@@ -82,7 +82,7 @@ fn main() -> tantivy::Result<()> {
|
|||||||
body => "Some great book description..."
|
body => "Some great book description..."
|
||||||
))?
|
))?
|
||||||
};
|
};
|
||||||
println!("add doc {} from thread 2 - opstamp {}", i, opstamp);
|
println!("add doc {i} from thread 2 - opstamp {opstamp}");
|
||||||
thread::sleep(Duration::from_millis(10));
|
thread::sleep(Duration::from_millis(10));
|
||||||
}
|
}
|
||||||
Result::<(), TantivyError>::Ok(())
|
Result::<(), TantivyError>::Ok(())
|
||||||
|
|||||||
@@ -1,3 +1,4 @@
|
|||||||
|
use std::borrow::Cow;
|
||||||
use std::iter::once;
|
use std::iter::once;
|
||||||
|
|
||||||
use nom::branch::alt;
|
use nom::branch::alt;
|
||||||
@@ -19,7 +20,7 @@ use crate::Occur;
|
|||||||
// Note: '-' char is only forbidden at the beginning of a field name, would be clearer to add it to
|
// Note: '-' char is only forbidden at the beginning of a field name, would be clearer to add it to
|
||||||
// special characters.
|
// special characters.
|
||||||
const SPECIAL_CHARS: &[char] = &[
|
const SPECIAL_CHARS: &[char] = &[
|
||||||
'+', '^', '`', ':', '{', '}', '"', '[', ']', '(', ')', '!', '\\', '*', ' ',
|
'+', '^', '`', ':', '{', '}', '"', '\'', '[', ']', '(', ')', '!', '\\', '*', ' ',
|
||||||
];
|
];
|
||||||
|
|
||||||
/// consume a field name followed by colon. Return the field name with escape sequence
|
/// consume a field name followed by colon. Return the field name with escape sequence
|
||||||
@@ -41,36 +42,92 @@ fn field_name(inp: &str) -> IResult<&str, String> {
|
|||||||
)(inp)
|
)(inp)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
const ESCAPE_IN_WORD: &[char] = &['^', '`', ':', '{', '}', '"', '\'', '[', ']', '(', ')', '\\'];
|
||||||
|
|
||||||
|
fn interpret_escape(source: &str) -> String {
|
||||||
|
let mut res = String::with_capacity(source.len());
|
||||||
|
let mut in_escape = false;
|
||||||
|
let require_escape = |c: char| c.is_whitespace() || ESCAPE_IN_WORD.contains(&c) || c == '-';
|
||||||
|
|
||||||
|
for c in source.chars() {
|
||||||
|
if in_escape {
|
||||||
|
if !require_escape(c) {
|
||||||
|
// we re-add the escape sequence
|
||||||
|
res.push('\\');
|
||||||
|
}
|
||||||
|
res.push(c);
|
||||||
|
in_escape = false;
|
||||||
|
} else if c == '\\' {
|
||||||
|
in_escape = true;
|
||||||
|
} else {
|
||||||
|
res.push(c);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
res
|
||||||
|
}
|
||||||
|
|
||||||
/// Consume a word outside of any context.
|
/// Consume a word outside of any context.
|
||||||
// TODO should support escape sequences
|
// TODO should support escape sequences
|
||||||
fn word(inp: &str) -> IResult<&str, &str> {
|
fn word(inp: &str) -> IResult<&str, Cow<str>> {
|
||||||
map_res(
|
map_res(
|
||||||
recognize(tuple((
|
recognize(tuple((
|
||||||
satisfy(|c| {
|
alt((
|
||||||
!c.is_whitespace()
|
preceded(char('\\'), anychar),
|
||||||
&& !['-', '^', '`', ':', '{', '}', '"', '[', ']', '(', ')'].contains(&c)
|
satisfy(|c| !c.is_whitespace() && !ESCAPE_IN_WORD.contains(&c) && c != '-'),
|
||||||
}),
|
)),
|
||||||
many0(satisfy(|c: char| {
|
many0(alt((
|
||||||
!c.is_whitespace() && ![':', '^', '{', '}', '"', '[', ']', '(', ')'].contains(&c)
|
preceded(char('\\'), anychar),
|
||||||
})),
|
satisfy(|c: char| !c.is_whitespace() && !ESCAPE_IN_WORD.contains(&c)),
|
||||||
|
))),
|
||||||
))),
|
))),
|
||||||
|s| match s {
|
|s| match s {
|
||||||
"OR" | "AND" | "NOT" | "IN" => Err(Error::new(inp, ErrorKind::Tag)),
|
"OR" | "AND" | "NOT" | "IN" => Err(Error::new(inp, ErrorKind::Tag)),
|
||||||
_ => Ok(s),
|
s if s.contains('\\') => Ok(Cow::Owned(interpret_escape(s))),
|
||||||
|
s => Ok(Cow::Borrowed(s)),
|
||||||
},
|
},
|
||||||
)(inp)
|
)(inp)
|
||||||
}
|
}
|
||||||
|
|
||||||
fn word_infallible(delimiter: &str) -> impl Fn(&str) -> JResult<&str, Option<&str>> + '_ {
|
fn word_infallible(
|
||||||
|inp| {
|
delimiter: &str,
|
||||||
opt_i_err(
|
emit_error: bool,
|
||||||
preceded(
|
) -> impl Fn(&str) -> JResult<&str, Option<Cow<str>>> + '_ {
|
||||||
multispace0,
|
// emit error is set when receiving an unescaped `:` should emit an error
|
||||||
recognize(many1(satisfy(|c| {
|
|
||||||
!c.is_whitespace() && !delimiter.contains(c)
|
move |inp| {
|
||||||
}))),
|
map(
|
||||||
|
opt_i_err(
|
||||||
|
preceded(
|
||||||
|
multispace0,
|
||||||
|
recognize(many1(alt((
|
||||||
|
preceded(char::<&str, _>('\\'), anychar),
|
||||||
|
satisfy(|c| !c.is_whitespace() && !delimiter.contains(c)),
|
||||||
|
)))),
|
||||||
|
),
|
||||||
|
"expected word",
|
||||||
),
|
),
|
||||||
"expected word",
|
|(opt_s, mut errors)| match opt_s {
|
||||||
|
Some(s) => {
|
||||||
|
if emit_error
|
||||||
|
&& (s
|
||||||
|
.as_bytes()
|
||||||
|
.windows(2)
|
||||||
|
.any(|window| window[0] != b'\\' && window[1] == b':')
|
||||||
|
|| s.starts_with(':'))
|
||||||
|
{
|
||||||
|
errors.push(LenientErrorInternal {
|
||||||
|
pos: inp.len(),
|
||||||
|
message: "parsed possible invalid field as term".to_string(),
|
||||||
|
});
|
||||||
|
}
|
||||||
|
if s.contains('\\') {
|
||||||
|
(Some(Cow::Owned(interpret_escape(s))), errors)
|
||||||
|
} else {
|
||||||
|
(Some(Cow::Borrowed(s)), errors)
|
||||||
|
}
|
||||||
|
}
|
||||||
|
None => (None, errors),
|
||||||
|
},
|
||||||
)(inp)
|
)(inp)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -159,7 +216,7 @@ fn simple_term_infallible(
|
|||||||
(value((), char('\'')), simple_quotes),
|
(value((), char('\'')), simple_quotes),
|
||||||
),
|
),
|
||||||
// numbers are parsed with words in this case, as we allow string starting with a -
|
// numbers are parsed with words in this case, as we allow string starting with a -
|
||||||
map(word_infallible(delimiter), |(text, errors)| {
|
map(word_infallible(delimiter, true), |(text, errors)| {
|
||||||
(text.map(|text| (Delimiter::None, text.to_string())), errors)
|
(text.map(|text| (Delimiter::None, text.to_string())), errors)
|
||||||
}),
|
}),
|
||||||
)(inp)
|
)(inp)
|
||||||
@@ -322,15 +379,6 @@ fn literal_no_group_infallible(inp: &str) -> JResult<&str, Option<UserInputAst>>
|
|||||||
|((field_name, _, leaf), mut errors)| {
|
|((field_name, _, leaf), mut errors)| {
|
||||||
(
|
(
|
||||||
leaf.map(|leaf| {
|
leaf.map(|leaf| {
|
||||||
if matches!(&leaf, UserInputLeaf::Literal(literal)
|
|
||||||
if literal.phrase.contains(':') && literal.delimiter == Delimiter::None)
|
|
||||||
&& field_name.is_none()
|
|
||||||
{
|
|
||||||
errors.push(LenientErrorInternal {
|
|
||||||
pos: inp.len(),
|
|
||||||
message: "parsed possible invalid field as term".to_string(),
|
|
||||||
});
|
|
||||||
}
|
|
||||||
if matches!(&leaf, UserInputLeaf::Literal(literal)
|
if matches!(&leaf, UserInputLeaf::Literal(literal)
|
||||||
if literal.phrase == "NOT" && literal.delimiter == Delimiter::None)
|
if literal.phrase == "NOT" && literal.delimiter == Delimiter::None)
|
||||||
&& field_name.is_none()
|
&& field_name.is_none()
|
||||||
@@ -449,20 +497,20 @@ fn range_infallible(inp: &str) -> JResult<&str, UserInputLeaf> {
|
|||||||
tuple_infallible((
|
tuple_infallible((
|
||||||
opt_i(anychar),
|
opt_i(anychar),
|
||||||
space0_infallible,
|
space0_infallible,
|
||||||
word_infallible("]}"),
|
word_infallible("]}", false),
|
||||||
space1_infallible,
|
space1_infallible,
|
||||||
opt_i_err(
|
opt_i_err(
|
||||||
terminated(tag("TO"), alt((value((), multispace1), value((), eof)))),
|
terminated(tag("TO"), alt((value((), multispace1), value((), eof)))),
|
||||||
"missing keyword TO",
|
"missing keyword TO",
|
||||||
),
|
),
|
||||||
word_infallible("]}"),
|
word_infallible("]}", false),
|
||||||
opt_i_err(one_of("]}"), "missing range delimiter"),
|
opt_i_err(one_of("]}"), "missing range delimiter"),
|
||||||
)),
|
)),
|
||||||
|(
|
|(
|
||||||
(lower_bound_kind, _multispace0, lower, _multispace1, to, upper, upper_bound_kind),
|
(lower_bound_kind, _multispace0, lower, _multispace1, to, upper, upper_bound_kind),
|
||||||
errs,
|
errs,
|
||||||
)| {
|
)| {
|
||||||
let lower_bound = match (lower_bound_kind, lower) {
|
let lower_bound = match (lower_bound_kind, lower.as_deref()) {
|
||||||
(_, Some("*")) => UserInputBound::Unbounded,
|
(_, Some("*")) => UserInputBound::Unbounded,
|
||||||
(_, None) => UserInputBound::Unbounded,
|
(_, None) => UserInputBound::Unbounded,
|
||||||
// if it is some, TO was actually the bound (i.e. [TO TO something])
|
// if it is some, TO was actually the bound (i.e. [TO TO something])
|
||||||
@@ -471,7 +519,7 @@ fn range_infallible(inp: &str) -> JResult<&str, UserInputLeaf> {
|
|||||||
(Some('{'), Some(bound)) => UserInputBound::Exclusive(bound.to_string()),
|
(Some('{'), Some(bound)) => UserInputBound::Exclusive(bound.to_string()),
|
||||||
_ => unreachable!("precondition failed, range did not start with [ or {{"),
|
_ => unreachable!("precondition failed, range did not start with [ or {{"),
|
||||||
};
|
};
|
||||||
let upper_bound = match (upper_bound_kind, upper) {
|
let upper_bound = match (upper_bound_kind, upper.as_deref()) {
|
||||||
(_, Some("*")) => UserInputBound::Unbounded,
|
(_, Some("*")) => UserInputBound::Unbounded,
|
||||||
(_, None) => UserInputBound::Unbounded,
|
(_, None) => UserInputBound::Unbounded,
|
||||||
(Some(']'), Some(bound)) => UserInputBound::Inclusive(bound.to_string()),
|
(Some(']'), Some(bound)) => UserInputBound::Inclusive(bound.to_string()),
|
||||||
@@ -488,7 +536,7 @@ fn range_infallible(inp: &str) -> JResult<&str, UserInputLeaf> {
|
|||||||
(
|
(
|
||||||
(
|
(
|
||||||
value((), tag(">=")),
|
value((), tag(">=")),
|
||||||
map(word_infallible(""), |(bound, err)| {
|
map(word_infallible("", false), |(bound, err)| {
|
||||||
(
|
(
|
||||||
(
|
(
|
||||||
bound
|
bound
|
||||||
@@ -502,7 +550,7 @@ fn range_infallible(inp: &str) -> JResult<&str, UserInputLeaf> {
|
|||||||
),
|
),
|
||||||
(
|
(
|
||||||
value((), tag("<=")),
|
value((), tag("<=")),
|
||||||
map(word_infallible(""), |(bound, err)| {
|
map(word_infallible("", false), |(bound, err)| {
|
||||||
(
|
(
|
||||||
(
|
(
|
||||||
UserInputBound::Unbounded,
|
UserInputBound::Unbounded,
|
||||||
@@ -516,7 +564,7 @@ fn range_infallible(inp: &str) -> JResult<&str, UserInputLeaf> {
|
|||||||
),
|
),
|
||||||
(
|
(
|
||||||
value((), tag(">")),
|
value((), tag(">")),
|
||||||
map(word_infallible(""), |(bound, err)| {
|
map(word_infallible("", false), |(bound, err)| {
|
||||||
(
|
(
|
||||||
(
|
(
|
||||||
bound
|
bound
|
||||||
@@ -530,7 +578,7 @@ fn range_infallible(inp: &str) -> JResult<&str, UserInputLeaf> {
|
|||||||
),
|
),
|
||||||
(
|
(
|
||||||
value((), tag("<")),
|
value((), tag("<")),
|
||||||
map(word_infallible(""), |(bound, err)| {
|
map(word_infallible("", false), |(bound, err)| {
|
||||||
(
|
(
|
||||||
(
|
(
|
||||||
UserInputBound::Unbounded,
|
UserInputBound::Unbounded,
|
||||||
@@ -1157,6 +1205,12 @@ mod test {
|
|||||||
test_parse_query_to_ast_helper("weight: <= 70", "\"weight\":{\"*\" TO \"70\"]");
|
test_parse_query_to_ast_helper("weight: <= 70", "\"weight\":{\"*\" TO \"70\"]");
|
||||||
|
|
||||||
test_parse_query_to_ast_helper("weight: <= 70.5", "\"weight\":{\"*\" TO \"70.5\"]");
|
test_parse_query_to_ast_helper("weight: <= 70.5", "\"weight\":{\"*\" TO \"70.5\"]");
|
||||||
|
|
||||||
|
test_parse_query_to_ast_helper(">a", "{\"a\" TO \"*\"}");
|
||||||
|
test_parse_query_to_ast_helper(">=a", "[\"a\" TO \"*\"}");
|
||||||
|
test_parse_query_to_ast_helper("<a", "{\"*\" TO \"a\"}");
|
||||||
|
test_parse_query_to_ast_helper("<=a", "{\"*\" TO \"a\"]");
|
||||||
|
test_parse_query_to_ast_helper("<=bsd", "{\"*\" TO \"bsd\"]");
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
@@ -1590,5 +1644,21 @@ mod test {
|
|||||||
r#"myfield:'hello\"happy\'tax'"#,
|
r#"myfield:'hello\"happy\'tax'"#,
|
||||||
r#""myfield":'hello"happy'tax'"#,
|
r#""myfield":'hello"happy'tax'"#,
|
||||||
);
|
);
|
||||||
|
// we don't process escape sequence for chars which don't require it
|
||||||
|
test_parse_query_to_ast_helper(r#"abc\*"#, r#"abc\*"#);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn test_queries_with_colons() {
|
||||||
|
test_parse_query_to_ast_helper(r#""abc:def""#, r#""abc:def""#);
|
||||||
|
test_parse_query_to_ast_helper(r#"'abc:def'"#, r#"'abc:def'"#);
|
||||||
|
test_parse_query_to_ast_helper(r#"abc\:def"#, r#"abc:def"#);
|
||||||
|
test_parse_query_to_ast_helper(r#""abc\:def""#, r#""abc:def""#);
|
||||||
|
test_parse_query_to_ast_helper(r#"'abc\:def'"#, r#"'abc:def'"#);
|
||||||
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
fn test_invalid_field() {
|
||||||
|
test_is_parse_err(r#"!bc:def"#, "!bc:def");
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -34,7 +34,7 @@ use super::bucket::{
|
|||||||
DateHistogramAggregationReq, HistogramAggregation, RangeAggregation, TermsAggregation,
|
DateHistogramAggregationReq, HistogramAggregation, RangeAggregation, TermsAggregation,
|
||||||
};
|
};
|
||||||
use super::metric::{
|
use super::metric::{
|
||||||
AverageAggregation, CountAggregation, MaxAggregation, MinAggregation,
|
AverageAggregation, CountAggregation, ExtendedStatsAggregation, MaxAggregation, MinAggregation,
|
||||||
PercentilesAggregationReq, StatsAggregation, SumAggregation, TopHitsAggregation,
|
PercentilesAggregationReq, StatsAggregation, SumAggregation, TopHitsAggregation,
|
||||||
};
|
};
|
||||||
|
|
||||||
@@ -146,6 +146,11 @@ pub enum AggregationVariants {
|
|||||||
/// extracted values.
|
/// extracted values.
|
||||||
#[serde(rename = "stats")]
|
#[serde(rename = "stats")]
|
||||||
Stats(StatsAggregation),
|
Stats(StatsAggregation),
|
||||||
|
/// Computes a collection of estended statistics (`min`, `max`, `sum`, `count`, `avg`,
|
||||||
|
/// `sum_of_squares`, `variance`, `variance_sampling`, `std_deviation`,
|
||||||
|
/// `std_deviation_sampling`) over the extracted values.
|
||||||
|
#[serde(rename = "extended_stats")]
|
||||||
|
ExtendedStats(ExtendedStatsAggregation),
|
||||||
/// Computes the sum of the extracted values.
|
/// Computes the sum of the extracted values.
|
||||||
#[serde(rename = "sum")]
|
#[serde(rename = "sum")]
|
||||||
Sum(SumAggregation),
|
Sum(SumAggregation),
|
||||||
@@ -170,6 +175,7 @@ impl AggregationVariants {
|
|||||||
AggregationVariants::Max(max) => vec![max.field_name()],
|
AggregationVariants::Max(max) => vec![max.field_name()],
|
||||||
AggregationVariants::Min(min) => vec![min.field_name()],
|
AggregationVariants::Min(min) => vec![min.field_name()],
|
||||||
AggregationVariants::Stats(stats) => vec![stats.field_name()],
|
AggregationVariants::Stats(stats) => vec![stats.field_name()],
|
||||||
|
AggregationVariants::ExtendedStats(extended_stats) => vec![extended_stats.field_name()],
|
||||||
AggregationVariants::Sum(sum) => vec![sum.field_name()],
|
AggregationVariants::Sum(sum) => vec![sum.field_name()],
|
||||||
AggregationVariants::Percentiles(per) => vec![per.field_name()],
|
AggregationVariants::Percentiles(per) => vec![per.field_name()],
|
||||||
AggregationVariants::TopHits(top_hits) => top_hits.field_names(),
|
AggregationVariants::TopHits(top_hits) => top_hits.field_names(),
|
||||||
@@ -197,6 +203,12 @@ impl AggregationVariants {
|
|||||||
_ => None,
|
_ => None,
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
pub(crate) fn as_top_hits(&self) -> Option<&TopHitsAggregation> {
|
||||||
|
match &self {
|
||||||
|
AggregationVariants::TopHits(top_hits) => Some(top_hits),
|
||||||
|
_ => None,
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
pub(crate) fn as_percentile(&self) -> Option<&PercentilesAggregationReq> {
|
pub(crate) fn as_percentile(&self) -> Option<&PercentilesAggregationReq> {
|
||||||
match &self {
|
match &self {
|
||||||
|
|||||||
@@ -11,8 +11,8 @@ use super::bucket::{
|
|||||||
DateHistogramAggregationReq, HistogramAggregation, RangeAggregation, TermsAggregation,
|
DateHistogramAggregationReq, HistogramAggregation, RangeAggregation, TermsAggregation,
|
||||||
};
|
};
|
||||||
use super::metric::{
|
use super::metric::{
|
||||||
AverageAggregation, CountAggregation, MaxAggregation, MinAggregation, StatsAggregation,
|
AverageAggregation, CountAggregation, ExtendedStatsAggregation, MaxAggregation, MinAggregation,
|
||||||
SumAggregation,
|
StatsAggregation, SumAggregation,
|
||||||
};
|
};
|
||||||
use super::segment_agg_result::AggregationLimits;
|
use super::segment_agg_result::AggregationLimits;
|
||||||
use super::VecWithNames;
|
use super::VecWithNames;
|
||||||
@@ -276,6 +276,10 @@ impl AggregationWithAccessor {
|
|||||||
field: ref field_name,
|
field: ref field_name,
|
||||||
..
|
..
|
||||||
})
|
})
|
||||||
|
| ExtendedStats(ExtendedStatsAggregation {
|
||||||
|
field: ref field_name,
|
||||||
|
..
|
||||||
|
})
|
||||||
| Sum(SumAggregation {
|
| Sum(SumAggregation {
|
||||||
field: ref field_name,
|
field: ref field_name,
|
||||||
..
|
..
|
||||||
@@ -335,8 +339,8 @@ fn get_missing_val(
|
|||||||
}
|
}
|
||||||
_ => {
|
_ => {
|
||||||
return Err(crate::TantivyError::InvalidArgument(format!(
|
return Err(crate::TantivyError::InvalidArgument(format!(
|
||||||
"Missing value {:?} for field {} is not supported for column type {:?}",
|
"Missing value {missing:?} for field {field_name} is not supported for column \
|
||||||
missing, field_name, column_type
|
type {column_type:?}"
|
||||||
)));
|
)));
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
@@ -403,7 +407,7 @@ fn get_dynamic_columns(
|
|||||||
.iter()
|
.iter()
|
||||||
.map(|h| h.open())
|
.map(|h| h.open())
|
||||||
.collect::<io::Result<_>>()?;
|
.collect::<io::Result<_>>()?;
|
||||||
assert!(!ff_fields.is_empty(), "field {} not found", field_name);
|
assert!(!ff_fields.is_empty(), "field {field_name} not found");
|
||||||
Ok(cols)
|
Ok(cols)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -8,7 +8,9 @@ use rustc_hash::FxHashMap;
|
|||||||
use serde::{Deserialize, Serialize};
|
use serde::{Deserialize, Serialize};
|
||||||
|
|
||||||
use super::bucket::GetDocCount;
|
use super::bucket::GetDocCount;
|
||||||
use super::metric::{PercentilesMetricResult, SingleMetricResult, Stats, TopHitsMetricResult};
|
use super::metric::{
|
||||||
|
ExtendedStats, PercentilesMetricResult, SingleMetricResult, Stats, TopHitsMetricResult,
|
||||||
|
};
|
||||||
use super::{AggregationError, Key};
|
use super::{AggregationError, Key};
|
||||||
use crate::TantivyError;
|
use crate::TantivyError;
|
||||||
|
|
||||||
@@ -88,6 +90,8 @@ pub enum MetricResult {
|
|||||||
Min(SingleMetricResult),
|
Min(SingleMetricResult),
|
||||||
/// Stats metric result.
|
/// Stats metric result.
|
||||||
Stats(Stats),
|
Stats(Stats),
|
||||||
|
/// ExtendedStats metric result.
|
||||||
|
ExtendedStats(Box<ExtendedStats>),
|
||||||
/// Sum metric result.
|
/// Sum metric result.
|
||||||
Sum(SingleMetricResult),
|
Sum(SingleMetricResult),
|
||||||
/// Percentiles metric result.
|
/// Percentiles metric result.
|
||||||
@@ -104,6 +108,7 @@ impl MetricResult {
|
|||||||
MetricResult::Max(max) => Ok(max.value),
|
MetricResult::Max(max) => Ok(max.value),
|
||||||
MetricResult::Min(min) => Ok(min.value),
|
MetricResult::Min(min) => Ok(min.value),
|
||||||
MetricResult::Stats(stats) => stats.get_value(agg_property),
|
MetricResult::Stats(stats) => stats.get_value(agg_property),
|
||||||
|
MetricResult::ExtendedStats(extended_stats) => extended_stats.get_value(agg_property),
|
||||||
MetricResult::Sum(sum) => Ok(sum.value),
|
MetricResult::Sum(sum) => Ok(sum.value),
|
||||||
MetricResult::Percentiles(_) => Err(TantivyError::AggregationError(
|
MetricResult::Percentiles(_) => Err(TantivyError::AggregationError(
|
||||||
AggregationError::InvalidRequest("percentiles can't be used to order".to_string()),
|
AggregationError::InvalidRequest("percentiles can't be used to order".to_string()),
|
||||||
|
|||||||
@@ -357,8 +357,7 @@ impl SegmentTermCollector {
|
|||||||
) -> crate::Result<Self> {
|
) -> crate::Result<Self> {
|
||||||
if field_type == ColumnType::Bytes {
|
if field_type == ColumnType::Bytes {
|
||||||
return Err(TantivyError::InvalidArgument(format!(
|
return Err(TantivyError::InvalidArgument(format!(
|
||||||
"terms aggregation is not supported for column type {:?}",
|
"terms aggregation is not supported for column type {field_type:?}"
|
||||||
field_type
|
|
||||||
)));
|
)));
|
||||||
}
|
}
|
||||||
let term_buckets = TermBuckets::default();
|
let term_buckets = TermBuckets::default();
|
||||||
|
|||||||
@@ -19,8 +19,8 @@ use super::bucket::{
|
|||||||
GetDocCount, Order, OrderTarget, RangeAggregation, TermsAggregation,
|
GetDocCount, Order, OrderTarget, RangeAggregation, TermsAggregation,
|
||||||
};
|
};
|
||||||
use super::metric::{
|
use super::metric::{
|
||||||
IntermediateAverage, IntermediateCount, IntermediateMax, IntermediateMin, IntermediateStats,
|
IntermediateAverage, IntermediateCount, IntermediateExtendedStats, IntermediateMax,
|
||||||
IntermediateSum, PercentilesCollector, TopHitsTopNComputer,
|
IntermediateMin, IntermediateStats, IntermediateSum, PercentilesCollector, TopHitsTopNComputer,
|
||||||
};
|
};
|
||||||
use super::segment_agg_result::AggregationLimits;
|
use super::segment_agg_result::AggregationLimits;
|
||||||
use super::{format_date, AggregationError, Key, SerializedKey};
|
use super::{format_date, AggregationError, Key, SerializedKey};
|
||||||
@@ -215,6 +215,9 @@ pub(crate) fn empty_from_req(req: &Aggregation) -> IntermediateAggregationResult
|
|||||||
Stats(_) => IntermediateAggregationResult::Metric(IntermediateMetricResult::Stats(
|
Stats(_) => IntermediateAggregationResult::Metric(IntermediateMetricResult::Stats(
|
||||||
IntermediateStats::default(),
|
IntermediateStats::default(),
|
||||||
)),
|
)),
|
||||||
|
ExtendedStats(_) => IntermediateAggregationResult::Metric(
|
||||||
|
IntermediateMetricResult::ExtendedStats(IntermediateExtendedStats::default()),
|
||||||
|
),
|
||||||
Sum(_) => IntermediateAggregationResult::Metric(IntermediateMetricResult::Sum(
|
Sum(_) => IntermediateAggregationResult::Metric(IntermediateMetricResult::Sum(
|
||||||
IntermediateSum::default(),
|
IntermediateSum::default(),
|
||||||
)),
|
)),
|
||||||
@@ -222,7 +225,7 @@ pub(crate) fn empty_from_req(req: &Aggregation) -> IntermediateAggregationResult
|
|||||||
IntermediateMetricResult::Percentiles(PercentilesCollector::default()),
|
IntermediateMetricResult::Percentiles(PercentilesCollector::default()),
|
||||||
),
|
),
|
||||||
TopHits(ref req) => IntermediateAggregationResult::Metric(
|
TopHits(ref req) => IntermediateAggregationResult::Metric(
|
||||||
IntermediateMetricResult::TopHits(TopHitsTopNComputer::new(req.clone())),
|
IntermediateMetricResult::TopHits(TopHitsTopNComputer::new(req)),
|
||||||
),
|
),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
@@ -282,6 +285,8 @@ pub enum IntermediateMetricResult {
|
|||||||
Min(IntermediateMin),
|
Min(IntermediateMin),
|
||||||
/// Intermediate stats result.
|
/// Intermediate stats result.
|
||||||
Stats(IntermediateStats),
|
Stats(IntermediateStats),
|
||||||
|
/// Intermediate stats result.
|
||||||
|
ExtendedStats(IntermediateExtendedStats),
|
||||||
/// Intermediate sum result.
|
/// Intermediate sum result.
|
||||||
Sum(IntermediateSum),
|
Sum(IntermediateSum),
|
||||||
/// Intermediate top_hits result
|
/// Intermediate top_hits result
|
||||||
@@ -306,6 +311,9 @@ impl IntermediateMetricResult {
|
|||||||
IntermediateMetricResult::Stats(intermediate_stats) => {
|
IntermediateMetricResult::Stats(intermediate_stats) => {
|
||||||
MetricResult::Stats(intermediate_stats.finalize())
|
MetricResult::Stats(intermediate_stats.finalize())
|
||||||
}
|
}
|
||||||
|
IntermediateMetricResult::ExtendedStats(intermediate_stats) => {
|
||||||
|
MetricResult::ExtendedStats(intermediate_stats.finalize())
|
||||||
|
}
|
||||||
IntermediateMetricResult::Sum(intermediate_sum) => {
|
IntermediateMetricResult::Sum(intermediate_sum) => {
|
||||||
MetricResult::Sum(intermediate_sum.finalize().into())
|
MetricResult::Sum(intermediate_sum.finalize().into())
|
||||||
}
|
}
|
||||||
@@ -346,6 +354,12 @@ impl IntermediateMetricResult {
|
|||||||
) => {
|
) => {
|
||||||
stats_left.merge_fruits(stats_right);
|
stats_left.merge_fruits(stats_right);
|
||||||
}
|
}
|
||||||
|
(
|
||||||
|
IntermediateMetricResult::ExtendedStats(extended_stats_left),
|
||||||
|
IntermediateMetricResult::ExtendedStats(extended_stats_right),
|
||||||
|
) => {
|
||||||
|
extended_stats_left.merge_fruits(extended_stats_right);
|
||||||
|
}
|
||||||
(IntermediateMetricResult::Sum(sum_left), IntermediateMetricResult::Sum(sum_right)) => {
|
(IntermediateMetricResult::Sum(sum_left), IntermediateMetricResult::Sum(sum_right)) => {
|
||||||
sum_left.merge_fruits(sum_right);
|
sum_left.merge_fruits(sum_right);
|
||||||
}
|
}
|
||||||
|
|||||||
1181
src/aggregation/metric/extended_stats.rs
Normal file
1181
src/aggregation/metric/extended_stats.rs
Normal file
File diff suppressed because it is too large
Load Diff
@@ -18,6 +18,7 @@
|
|||||||
|
|
||||||
mod average;
|
mod average;
|
||||||
mod count;
|
mod count;
|
||||||
|
mod extended_stats;
|
||||||
mod max;
|
mod max;
|
||||||
mod min;
|
mod min;
|
||||||
mod percentiles;
|
mod percentiles;
|
||||||
@@ -29,6 +30,7 @@ use std::collections::HashMap;
|
|||||||
|
|
||||||
pub use average::*;
|
pub use average::*;
|
||||||
pub use count::*;
|
pub use count::*;
|
||||||
|
pub use extended_stats::*;
|
||||||
pub use max::*;
|
pub use max::*;
|
||||||
pub use min::*;
|
pub use min::*;
|
||||||
pub use percentiles::*;
|
pub use percentiles::*;
|
||||||
|
|||||||
@@ -1,3 +1,5 @@
|
|||||||
|
use std::fmt::Debug;
|
||||||
|
|
||||||
use serde::{Deserialize, Serialize};
|
use serde::{Deserialize, Serialize};
|
||||||
|
|
||||||
use super::*;
|
use super::*;
|
||||||
@@ -85,13 +87,15 @@ impl Stats {
|
|||||||
#[derive(Clone, Debug, PartialEq, Serialize, Deserialize)]
|
#[derive(Clone, Debug, PartialEq, Serialize, Deserialize)]
|
||||||
pub struct IntermediateStats {
|
pub struct IntermediateStats {
|
||||||
/// The number of extracted values.
|
/// The number of extracted values.
|
||||||
count: u64,
|
pub(crate) count: u64,
|
||||||
/// The sum of the extracted values.
|
/// The sum of the extracted values.
|
||||||
sum: f64,
|
pub(crate) sum: f64,
|
||||||
|
/// delta for sum needed for [Kahan algorithm for summation](https://en.wikipedia.org/wiki/Kahan_summation_algorithm)
|
||||||
|
pub(crate) delta: f64,
|
||||||
/// The min value.
|
/// The min value.
|
||||||
min: f64,
|
pub(crate) min: f64,
|
||||||
/// The max value.
|
/// The max value.
|
||||||
max: f64,
|
pub(crate) max: f64,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl Default for IntermediateStats {
|
impl Default for IntermediateStats {
|
||||||
@@ -99,6 +103,7 @@ impl Default for IntermediateStats {
|
|||||||
Self {
|
Self {
|
||||||
count: 0,
|
count: 0,
|
||||||
sum: 0.0,
|
sum: 0.0,
|
||||||
|
delta: 0.0,
|
||||||
min: f64::MAX,
|
min: f64::MAX,
|
||||||
max: f64::MIN,
|
max: f64::MIN,
|
||||||
}
|
}
|
||||||
@@ -109,7 +114,13 @@ impl IntermediateStats {
|
|||||||
/// Merges the other stats intermediate result into self.
|
/// Merges the other stats intermediate result into self.
|
||||||
pub fn merge_fruits(&mut self, other: IntermediateStats) {
|
pub fn merge_fruits(&mut self, other: IntermediateStats) {
|
||||||
self.count += other.count;
|
self.count += other.count;
|
||||||
self.sum += other.sum;
|
|
||||||
|
// kahan algorithm for sum
|
||||||
|
let y = other.sum - (self.delta + other.delta);
|
||||||
|
let t = self.sum + y;
|
||||||
|
self.delta = (t - self.sum) - y;
|
||||||
|
self.sum = t;
|
||||||
|
|
||||||
self.min = self.min.min(other.min);
|
self.min = self.min.min(other.min);
|
||||||
self.max = self.max.max(other.max);
|
self.max = self.max.max(other.max);
|
||||||
}
|
}
|
||||||
@@ -141,9 +152,15 @@ impl IntermediateStats {
|
|||||||
}
|
}
|
||||||
|
|
||||||
#[inline]
|
#[inline]
|
||||||
fn collect(&mut self, value: f64) {
|
pub(in crate::aggregation::metric) fn collect(&mut self, value: f64) {
|
||||||
self.count += 1;
|
self.count += 1;
|
||||||
self.sum += value;
|
|
||||||
|
// kahan algorithm for sum
|
||||||
|
let y = value - self.delta;
|
||||||
|
let t = self.sum + y;
|
||||||
|
self.delta = (t - self.sum) - y;
|
||||||
|
self.sum = t;
|
||||||
|
|
||||||
self.min = self.min.min(value);
|
self.min = self.min.min(value);
|
||||||
self.max = self.max.max(value);
|
self.max = self.max.max(value);
|
||||||
}
|
}
|
||||||
@@ -288,7 +305,6 @@ impl SegmentAggregationCollector for SegmentStatsCollector {
|
|||||||
|
|
||||||
#[cfg(test)]
|
#[cfg(test)]
|
||||||
mod tests {
|
mod tests {
|
||||||
|
|
||||||
use serde_json::Value;
|
use serde_json::Value;
|
||||||
|
|
||||||
use crate::aggregation::agg_req::{Aggregation, Aggregations};
|
use crate::aggregation::agg_req::{Aggregation, Aggregations};
|
||||||
|
|||||||
@@ -1,7 +1,7 @@
|
|||||||
use std::collections::HashMap;
|
use std::collections::HashMap;
|
||||||
use std::net::Ipv6Addr;
|
use std::net::Ipv6Addr;
|
||||||
|
|
||||||
use columnar::{ColumnarReader, DynamicColumn};
|
use columnar::{Column, ColumnType, ColumnarReader, DynamicColumn};
|
||||||
use common::json_path_writer::JSON_PATH_SEGMENT_SEP_STR;
|
use common::json_path_writer::JSON_PATH_SEGMENT_SEP_STR;
|
||||||
use common::DateTime;
|
use common::DateTime;
|
||||||
use regex::Regex;
|
use regex::Regex;
|
||||||
@@ -131,8 +131,8 @@ impl<'de> Deserialize<'de> for KeyOrder {
|
|||||||
))?;
|
))?;
|
||||||
if key_order.next().is_some() {
|
if key_order.next().is_some() {
|
||||||
return Err(serde::de::Error::custom(format!(
|
return Err(serde::de::Error::custom(format!(
|
||||||
"Expected exactly one key-value pair in sort parameter of top_hits, found {:?}",
|
"Expected exactly one key-value pair in sort parameter of top_hits, found \
|
||||||
key_order
|
{key_order:?}"
|
||||||
)));
|
)));
|
||||||
}
|
}
|
||||||
Ok(Self { field, order })
|
Ok(Self { field, order })
|
||||||
@@ -144,27 +144,22 @@ fn globbed_string_to_regex(glob: &str) -> Result<Regex, crate::TantivyError> {
|
|||||||
// Replace `*` glob with `.*` regex
|
// Replace `*` glob with `.*` regex
|
||||||
let sanitized = format!("^{}$", regex::escape(glob).replace(r"\*", ".*"));
|
let sanitized = format!("^{}$", regex::escape(glob).replace(r"\*", ".*"));
|
||||||
Regex::new(&sanitized.replace('*', ".*")).map_err(|e| {
|
Regex::new(&sanitized.replace('*', ".*")).map_err(|e| {
|
||||||
crate::TantivyError::SchemaError(format!(
|
crate::TantivyError::SchemaError(format!("Invalid regex '{glob}' in docvalue_fields: {e}"))
|
||||||
"Invalid regex '{}' in docvalue_fields: {}",
|
|
||||||
glob, e
|
|
||||||
))
|
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
fn use_doc_value_fields_err(parameter: &str) -> crate::Result<()> {
|
fn use_doc_value_fields_err(parameter: &str) -> crate::Result<()> {
|
||||||
Err(crate::TantivyError::AggregationError(
|
Err(crate::TantivyError::AggregationError(
|
||||||
AggregationError::InvalidRequest(format!(
|
AggregationError::InvalidRequest(format!(
|
||||||
"The `{}` parameter is not supported, only `docvalue_fields` is supported in \
|
"The `{parameter}` parameter is not supported, only `docvalue_fields` is supported in \
|
||||||
`top_hits` aggregation",
|
`top_hits` aggregation"
|
||||||
parameter
|
|
||||||
)),
|
)),
|
||||||
))
|
))
|
||||||
}
|
}
|
||||||
fn unsupported_err(parameter: &str) -> crate::Result<()> {
|
fn unsupported_err(parameter: &str) -> crate::Result<()> {
|
||||||
Err(crate::TantivyError::AggregationError(
|
Err(crate::TantivyError::AggregationError(
|
||||||
AggregationError::InvalidRequest(format!(
|
AggregationError::InvalidRequest(format!(
|
||||||
"The `{}` parameter is not supported in the `top_hits` aggregation",
|
"The `{parameter}` parameter is not supported in the `top_hits` aggregation"
|
||||||
parameter
|
|
||||||
)),
|
)),
|
||||||
))
|
))
|
||||||
}
|
}
|
||||||
@@ -217,8 +212,7 @@ impl TopHitsAggregation {
|
|||||||
.collect::<Vec<_>>();
|
.collect::<Vec<_>>();
|
||||||
assert!(
|
assert!(
|
||||||
!fields.is_empty(),
|
!fields.is_empty(),
|
||||||
"No fields matched the glob '{}' in docvalue_fields",
|
"No fields matched the glob '{field}' in docvalue_fields"
|
||||||
field
|
|
||||||
);
|
);
|
||||||
Ok(fields)
|
Ok(fields)
|
||||||
})
|
})
|
||||||
@@ -254,7 +248,7 @@ impl TopHitsAggregation {
|
|||||||
.map(|field| {
|
.map(|field| {
|
||||||
let accessors = accessors
|
let accessors = accessors
|
||||||
.get(field)
|
.get(field)
|
||||||
.unwrap_or_else(|| panic!("field '{}' not found in accessors", field));
|
.unwrap_or_else(|| panic!("field '{field}' not found in accessors"));
|
||||||
|
|
||||||
let values: Vec<FastFieldValue> = accessors
|
let values: Vec<FastFieldValue> = accessors
|
||||||
.iter()
|
.iter()
|
||||||
@@ -449,10 +443,10 @@ impl std::cmp::PartialEq for TopHitsTopNComputer {
|
|||||||
|
|
||||||
impl TopHitsTopNComputer {
|
impl TopHitsTopNComputer {
|
||||||
/// Create a new TopHitsCollector
|
/// Create a new TopHitsCollector
|
||||||
pub fn new(req: TopHitsAggregation) -> Self {
|
pub fn new(req: &TopHitsAggregation) -> Self {
|
||||||
Self {
|
Self {
|
||||||
top_n: TopNComputer::new(req.size + req.from.unwrap_or(0)),
|
top_n: TopNComputer::new(req.size + req.from.unwrap_or(0)),
|
||||||
req,
|
req: req.clone(),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -497,7 +491,6 @@ impl TopHitsTopNComputer {
|
|||||||
pub(crate) struct TopHitsSegmentCollector {
|
pub(crate) struct TopHitsSegmentCollector {
|
||||||
segment_ordinal: SegmentOrdinal,
|
segment_ordinal: SegmentOrdinal,
|
||||||
accessor_idx: usize,
|
accessor_idx: usize,
|
||||||
req: TopHitsAggregation,
|
|
||||||
top_n: TopNComputer<Vec<DocValueAndOrder>, DocAddress, false>,
|
top_n: TopNComputer<Vec<DocValueAndOrder>, DocAddress, false>,
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -508,7 +501,6 @@ impl TopHitsSegmentCollector {
|
|||||||
segment_ordinal: SegmentOrdinal,
|
segment_ordinal: SegmentOrdinal,
|
||||||
) -> Self {
|
) -> Self {
|
||||||
Self {
|
Self {
|
||||||
req: req.clone(),
|
|
||||||
top_n: TopNComputer::new(req.size + req.from.unwrap_or(0)),
|
top_n: TopNComputer::new(req.size + req.from.unwrap_or(0)),
|
||||||
segment_ordinal,
|
segment_ordinal,
|
||||||
accessor_idx,
|
accessor_idx,
|
||||||
@@ -517,14 +509,13 @@ impl TopHitsSegmentCollector {
|
|||||||
fn into_top_hits_collector(
|
fn into_top_hits_collector(
|
||||||
self,
|
self,
|
||||||
value_accessors: &HashMap<String, Vec<DynamicColumn>>,
|
value_accessors: &HashMap<String, Vec<DynamicColumn>>,
|
||||||
|
req: &TopHitsAggregation,
|
||||||
) -> TopHitsTopNComputer {
|
) -> TopHitsTopNComputer {
|
||||||
let mut top_hits_computer = TopHitsTopNComputer::new(self.req.clone());
|
let mut top_hits_computer = TopHitsTopNComputer::new(req);
|
||||||
let top_results = self.top_n.into_vec();
|
let top_results = self.top_n.into_vec();
|
||||||
|
|
||||||
for res in top_results {
|
for res in top_results {
|
||||||
let doc_value_fields = self
|
let doc_value_fields = req.get_document_field_data(value_accessors, res.doc.doc_id);
|
||||||
.req
|
|
||||||
.get_document_field_data(value_accessors, res.doc.doc_id);
|
|
||||||
top_hits_computer.collect(
|
top_hits_computer.collect(
|
||||||
DocSortValuesAndFields {
|
DocSortValuesAndFields {
|
||||||
sorts: res.feature,
|
sorts: res.feature,
|
||||||
@@ -536,34 +527,15 @@ impl TopHitsSegmentCollector {
|
|||||||
|
|
||||||
top_hits_computer
|
top_hits_computer
|
||||||
}
|
}
|
||||||
}
|
|
||||||
|
|
||||||
impl SegmentAggregationCollector for TopHitsSegmentCollector {
|
/// TODO add a specialized variant for a single sort field
|
||||||
fn add_intermediate_aggregation_result(
|
fn collect_with(
|
||||||
self: Box<Self>,
|
|
||||||
agg_with_accessor: &crate::aggregation::agg_req_with_accessor::AggregationsWithAccessor,
|
|
||||||
results: &mut crate::aggregation::intermediate_agg_result::IntermediateAggregationResults,
|
|
||||||
) -> crate::Result<()> {
|
|
||||||
let name = agg_with_accessor.aggs.keys[self.accessor_idx].to_string();
|
|
||||||
|
|
||||||
let value_accessors = &agg_with_accessor.aggs.values[self.accessor_idx].value_accessors;
|
|
||||||
|
|
||||||
let intermediate_result =
|
|
||||||
IntermediateMetricResult::TopHits(self.into_top_hits_collector(value_accessors));
|
|
||||||
results.push(
|
|
||||||
name,
|
|
||||||
IntermediateAggregationResult::Metric(intermediate_result),
|
|
||||||
)
|
|
||||||
}
|
|
||||||
|
|
||||||
fn collect(
|
|
||||||
&mut self,
|
&mut self,
|
||||||
doc_id: crate::DocId,
|
doc_id: crate::DocId,
|
||||||
agg_with_accessor: &mut crate::aggregation::agg_req_with_accessor::AggregationsWithAccessor,
|
req: &TopHitsAggregation,
|
||||||
|
accessors: &[(Column<u64>, ColumnType)],
|
||||||
) -> crate::Result<()> {
|
) -> crate::Result<()> {
|
||||||
let accessors = &agg_with_accessor.aggs.values[self.accessor_idx].accessors;
|
let sorts: Vec<DocValueAndOrder> = req
|
||||||
let sorts: Vec<DocValueAndOrder> = self
|
|
||||||
.req
|
|
||||||
.sort
|
.sort
|
||||||
.iter()
|
.iter()
|
||||||
.enumerate()
|
.enumerate()
|
||||||
@@ -588,15 +560,62 @@ impl SegmentAggregationCollector for TopHitsSegmentCollector {
|
|||||||
);
|
);
|
||||||
Ok(())
|
Ok(())
|
||||||
}
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
impl SegmentAggregationCollector for TopHitsSegmentCollector {
|
||||||
|
fn add_intermediate_aggregation_result(
|
||||||
|
self: Box<Self>,
|
||||||
|
agg_with_accessor: &crate::aggregation::agg_req_with_accessor::AggregationsWithAccessor,
|
||||||
|
results: &mut crate::aggregation::intermediate_agg_result::IntermediateAggregationResults,
|
||||||
|
) -> crate::Result<()> {
|
||||||
|
let name = agg_with_accessor.aggs.keys[self.accessor_idx].to_string();
|
||||||
|
|
||||||
|
let value_accessors = &agg_with_accessor.aggs.values[self.accessor_idx].value_accessors;
|
||||||
|
let tophits_req = &agg_with_accessor.aggs.values[self.accessor_idx]
|
||||||
|
.agg
|
||||||
|
.agg
|
||||||
|
.as_top_hits()
|
||||||
|
.expect("aggregation request must be of type top hits");
|
||||||
|
|
||||||
|
let intermediate_result = IntermediateMetricResult::TopHits(
|
||||||
|
self.into_top_hits_collector(value_accessors, tophits_req),
|
||||||
|
);
|
||||||
|
results.push(
|
||||||
|
name,
|
||||||
|
IntermediateAggregationResult::Metric(intermediate_result),
|
||||||
|
)
|
||||||
|
}
|
||||||
|
|
||||||
|
/// TODO: Consider a caching layer to reduce the call overhead
|
||||||
|
fn collect(
|
||||||
|
&mut self,
|
||||||
|
doc_id: crate::DocId,
|
||||||
|
agg_with_accessor: &mut crate::aggregation::agg_req_with_accessor::AggregationsWithAccessor,
|
||||||
|
) -> crate::Result<()> {
|
||||||
|
let tophits_req = &agg_with_accessor.aggs.values[self.accessor_idx]
|
||||||
|
.agg
|
||||||
|
.agg
|
||||||
|
.as_top_hits()
|
||||||
|
.expect("aggregation request must be of type top hits");
|
||||||
|
let accessors = &agg_with_accessor.aggs.values[self.accessor_idx].accessors;
|
||||||
|
self.collect_with(doc_id, tophits_req, accessors)?;
|
||||||
|
Ok(())
|
||||||
|
}
|
||||||
|
|
||||||
fn collect_block(
|
fn collect_block(
|
||||||
&mut self,
|
&mut self,
|
||||||
docs: &[crate::DocId],
|
docs: &[crate::DocId],
|
||||||
agg_with_accessor: &mut crate::aggregation::agg_req_with_accessor::AggregationsWithAccessor,
|
agg_with_accessor: &mut crate::aggregation::agg_req_with_accessor::AggregationsWithAccessor,
|
||||||
) -> crate::Result<()> {
|
) -> crate::Result<()> {
|
||||||
|
let tophits_req = &agg_with_accessor.aggs.values[self.accessor_idx]
|
||||||
|
.agg
|
||||||
|
.agg
|
||||||
|
.as_top_hits()
|
||||||
|
.expect("aggregation request must be of type top hits");
|
||||||
|
let accessors = &agg_with_accessor.aggs.values[self.accessor_idx].accessors;
|
||||||
// TODO: Consider getting fields with the column block accessor.
|
// TODO: Consider getting fields with the column block accessor.
|
||||||
for doc in docs {
|
for doc in docs {
|
||||||
self.collect(*doc, agg_with_accessor)?;
|
self.collect_with(*doc, tophits_req, accessors)?;
|
||||||
}
|
}
|
||||||
Ok(())
|
Ok(())
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -158,15 +158,14 @@ use serde::de::{self, Visitor};
|
|||||||
use serde::{Deserialize, Deserializer, Serialize};
|
use serde::{Deserialize, Deserializer, Serialize};
|
||||||
|
|
||||||
fn parse_str_into_f64<E: de::Error>(value: &str) -> Result<f64, E> {
|
fn parse_str_into_f64<E: de::Error>(value: &str) -> Result<f64, E> {
|
||||||
let parsed = value.parse::<f64>().map_err(|_err| {
|
let parsed = value
|
||||||
de::Error::custom(format!("Failed to parse f64 from string: {:?}", value))
|
.parse::<f64>()
|
||||||
})?;
|
.map_err(|_err| de::Error::custom(format!("Failed to parse f64 from string: {value:?}")))?;
|
||||||
|
|
||||||
// Check if the parsed value is NaN or infinity
|
// Check if the parsed value is NaN or infinity
|
||||||
if parsed.is_nan() || parsed.is_infinite() {
|
if parsed.is_nan() || parsed.is_infinite() {
|
||||||
Err(de::Error::custom(format!(
|
Err(de::Error::custom(format!(
|
||||||
"Value is not a valid f64 (NaN or Infinity): {:?}",
|
"Value is not a valid f64 (NaN or Infinity): {value:?}"
|
||||||
value
|
|
||||||
)))
|
)))
|
||||||
} else {
|
} else {
|
||||||
Ok(parsed)
|
Ok(parsed)
|
||||||
|
|||||||
@@ -11,12 +11,12 @@ use super::agg_req_with_accessor::{AggregationWithAccessor, AggregationsWithAcce
|
|||||||
use super::bucket::{SegmentHistogramCollector, SegmentRangeCollector, SegmentTermCollector};
|
use super::bucket::{SegmentHistogramCollector, SegmentRangeCollector, SegmentTermCollector};
|
||||||
use super::intermediate_agg_result::IntermediateAggregationResults;
|
use super::intermediate_agg_result::IntermediateAggregationResults;
|
||||||
use super::metric::{
|
use super::metric::{
|
||||||
AverageAggregation, CountAggregation, MaxAggregation, MinAggregation,
|
AverageAggregation, CountAggregation, ExtendedStatsAggregation, MaxAggregation, MinAggregation,
|
||||||
SegmentPercentilesCollector, SegmentStatsCollector, SegmentStatsType, StatsAggregation,
|
SegmentPercentilesCollector, SegmentStatsCollector, SegmentStatsType, StatsAggregation,
|
||||||
SumAggregation,
|
SumAggregation,
|
||||||
};
|
};
|
||||||
use crate::aggregation::bucket::TermMissingAgg;
|
use crate::aggregation::bucket::TermMissingAgg;
|
||||||
use crate::aggregation::metric::TopHitsSegmentCollector;
|
use crate::aggregation::metric::{SegmentExtendedStatsCollector, TopHitsSegmentCollector};
|
||||||
|
|
||||||
pub(crate) trait SegmentAggregationCollector: CollectorClone + Debug {
|
pub(crate) trait SegmentAggregationCollector: CollectorClone + Debug {
|
||||||
fn add_intermediate_aggregation_result(
|
fn add_intermediate_aggregation_result(
|
||||||
@@ -148,6 +148,9 @@ pub(crate) fn build_single_agg_segment_collector(
|
|||||||
accessor_idx,
|
accessor_idx,
|
||||||
*missing,
|
*missing,
|
||||||
))),
|
))),
|
||||||
|
ExtendedStats(ExtendedStatsAggregation { missing, sigma, .. }) => Ok(Box::new(
|
||||||
|
SegmentExtendedStatsCollector::from_req(req.field_type, *sigma, accessor_idx, *missing),
|
||||||
|
)),
|
||||||
Sum(SumAggregation { missing, .. }) => Ok(Box::new(SegmentStatsCollector::from_req(
|
Sum(SumAggregation { missing, .. }) => Ok(Box::new(SegmentStatsCollector::from_req(
|
||||||
req.field_type,
|
req.field_type,
|
||||||
SegmentStatsType::Sum,
|
SegmentStatsType::Sum,
|
||||||
|
|||||||
@@ -598,7 +598,7 @@ mod tests {
|
|||||||
let mid = n % 4;
|
let mid = n % 4;
|
||||||
n /= 4;
|
n /= 4;
|
||||||
let leaf = n % 5;
|
let leaf = n % 5;
|
||||||
Facet::from(&format!("/top{}/mid{}/leaf{}", top, mid, leaf))
|
Facet::from(&format!("/top{top}/mid{mid}/leaf{leaf}"))
|
||||||
})
|
})
|
||||||
.collect();
|
.collect();
|
||||||
for i in 0..num_facets * 10 {
|
for i in 0..num_facets * 10 {
|
||||||
@@ -643,30 +643,30 @@ mod tests {
|
|||||||
facet_collector.add_facet(Facet::from("/country/europe"));
|
facet_collector.add_facet(Facet::from("/country/europe"));
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_doc_unsorted_multifacet() -> crate::Result<()> {
|
// fn test_doc_unsorted_multifacet() -> crate::Result<()> {
|
||||||
let mut schema_builder = Schema::builder();
|
// let mut schema_builder = Schema::builder();
|
||||||
let facet_field = schema_builder.add_facet_field("facets", FacetOptions::default());
|
// let facet_field = schema_builder.add_facet_field("facets", FacetOptions::default());
|
||||||
let schema = schema_builder.build();
|
// let schema = schema_builder.build();
|
||||||
let index = Index::create_in_ram(schema);
|
// let index = Index::create_in_ram(schema);
|
||||||
let mut index_writer = index.writer_for_tests()?;
|
// let mut index_writer = index.writer_for_tests()?;
|
||||||
index_writer.add_document(doc!(
|
// index_writer.add_document(doc!(
|
||||||
facet_field => Facet::from_text(&"/subjects/A/a").unwrap(),
|
// facet_field => Facet::from_text(&"/subjects/A/a").unwrap(),
|
||||||
facet_field => Facet::from_text(&"/subjects/B/a").unwrap(),
|
// facet_field => Facet::from_text(&"/subjects/B/a").unwrap(),
|
||||||
facet_field => Facet::from_text(&"/subjects/A/b").unwrap(),
|
// facet_field => Facet::from_text(&"/subjects/A/b").unwrap(),
|
||||||
facet_field => Facet::from_text(&"/subjects/B/b").unwrap(),
|
// facet_field => Facet::from_text(&"/subjects/B/b").unwrap(),
|
||||||
))?;
|
// ))?;
|
||||||
index_writer.commit()?;
|
// index_writer.commit()?;
|
||||||
let reader = index.reader()?;
|
// let reader = index.reader()?;
|
||||||
let searcher = reader.searcher();
|
// let searcher = reader.searcher();
|
||||||
assert_eq!(searcher.num_docs(), 1);
|
// assert_eq!(searcher.num_docs(), 1);
|
||||||
let mut facet_collector = FacetCollector::for_field("facets");
|
// let mut facet_collector = FacetCollector::for_field("facets");
|
||||||
facet_collector.add_facet("/subjects");
|
// facet_collector.add_facet("/subjects");
|
||||||
let counts = searcher.search(&AllQuery, &facet_collector)?;
|
// let counts = searcher.search(&AllQuery, &facet_collector)?;
|
||||||
let facets: Vec<(&Facet, u64)> = counts.get("/subjects").collect();
|
// let facets: Vec<(&Facet, u64)> = counts.get("/subjects").collect();
|
||||||
assert_eq!(facets[0].1, 1);
|
// assert_eq!(facets[0].1, 1);
|
||||||
Ok(())
|
// Ok(())
|
||||||
}
|
// }
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn test_doc_search_by_facet() -> crate::Result<()> {
|
fn test_doc_search_by_facet() -> crate::Result<()> {
|
||||||
@@ -725,99 +725,99 @@ mod tests {
|
|||||||
facet_collector.add_facet(Facet::from("/countryeurope"));
|
facet_collector.add_facet(Facet::from("/countryeurope"));
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_facet_collector_topk() {
|
// fn test_facet_collector_topk() {
|
||||||
let mut schema_builder = Schema::builder();
|
// let mut schema_builder = Schema::builder();
|
||||||
let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
// let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
||||||
let schema = schema_builder.build();
|
// let schema = schema_builder.build();
|
||||||
let index = Index::create_in_ram(schema);
|
// let index = Index::create_in_ram(schema);
|
||||||
|
|
||||||
let uniform = Uniform::new_inclusive(1, 100_000);
|
// let uniform = Uniform::new_inclusive(1, 100_000);
|
||||||
let mut docs: Vec<TantivyDocument> =
|
// let mut docs: Vec<TantivyDocument> =
|
||||||
vec![("a", 10), ("b", 100), ("c", 7), ("d", 12), ("e", 21)]
|
// vec![("a", 10), ("b", 100), ("c", 7), ("d", 12), ("e", 21)]
|
||||||
.into_iter()
|
// .into_iter()
|
||||||
.flat_map(|(c, count)| {
|
// .flat_map(|(c, count)| {
|
||||||
let facet = Facet::from(&format!("/facet/{}", c));
|
// let facet = Facet::from(&format!("/facet/{c}"));
|
||||||
let doc = doc!(facet_field => facet);
|
// let doc = doc!(facet_field => facet);
|
||||||
iter::repeat(doc).take(count)
|
// iter::repeat(doc).take(count)
|
||||||
})
|
// })
|
||||||
.map(|mut doc| {
|
// .map(|mut doc| {
|
||||||
doc.add_facet(
|
// doc.add_facet(
|
||||||
facet_field,
|
// facet_field,
|
||||||
&format!("/facet/{}", thread_rng().sample(uniform)),
|
// &format!("/facet/{}", thread_rng().sample(uniform)),
|
||||||
);
|
// );
|
||||||
doc
|
// doc
|
||||||
})
|
// })
|
||||||
.collect();
|
// .collect();
|
||||||
docs[..].shuffle(&mut thread_rng());
|
// docs[..].shuffle(&mut thread_rng());
|
||||||
|
|
||||||
let mut index_writer: IndexWriter = index.writer_for_tests().unwrap();
|
// let mut index_writer: IndexWriter = index.writer_for_tests().unwrap();
|
||||||
for doc in docs {
|
// for doc in docs {
|
||||||
index_writer.add_document(doc).unwrap();
|
// index_writer.add_document(doc).unwrap();
|
||||||
}
|
// }
|
||||||
index_writer.commit().unwrap();
|
// index_writer.commit().unwrap();
|
||||||
let searcher = index.reader().unwrap().searcher();
|
// let searcher = index.reader().unwrap().searcher();
|
||||||
|
|
||||||
let mut facet_collector = FacetCollector::for_field("facet");
|
// let mut facet_collector = FacetCollector::for_field("facet");
|
||||||
facet_collector.add_facet("/facet");
|
// facet_collector.add_facet("/facet");
|
||||||
let counts: FacetCounts = searcher.search(&AllQuery, &facet_collector).unwrap();
|
// let counts: FacetCounts = searcher.search(&AllQuery, &facet_collector).unwrap();
|
||||||
|
|
||||||
{
|
// {
|
||||||
let facets: Vec<(&Facet, u64)> = counts.top_k("/facet", 3);
|
// let facets: Vec<(&Facet, u64)> = counts.top_k("/facet", 3);
|
||||||
assert_eq!(
|
// assert_eq!(
|
||||||
facets,
|
// facets,
|
||||||
vec![
|
// vec![
|
||||||
(&Facet::from("/facet/b"), 100),
|
// (&Facet::from("/facet/b"), 100),
|
||||||
(&Facet::from("/facet/e"), 21),
|
// (&Facet::from("/facet/e"), 21),
|
||||||
(&Facet::from("/facet/d"), 12),
|
// (&Facet::from("/facet/d"), 12),
|
||||||
]
|
// ]
|
||||||
);
|
// );
|
||||||
}
|
// }
|
||||||
}
|
// }
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_facet_collector_topk_tie_break() -> crate::Result<()> {
|
// fn test_facet_collector_topk_tie_break() -> crate::Result<()> {
|
||||||
let mut schema_builder = Schema::builder();
|
// let mut schema_builder = Schema::builder();
|
||||||
let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
// let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
||||||
let schema = schema_builder.build();
|
// let schema = schema_builder.build();
|
||||||
let index = Index::create_in_ram(schema);
|
// let index = Index::create_in_ram(schema);
|
||||||
|
|
||||||
let docs: Vec<TantivyDocument> = vec![("b", 2), ("a", 2), ("c", 4)]
|
// let docs: Vec<TantivyDocument> = vec![("b", 2), ("a", 2), ("c", 4)]
|
||||||
.into_iter()
|
// .into_iter()
|
||||||
.flat_map(|(c, count)| {
|
// .flat_map(|(c, count)| {
|
||||||
let facet = Facet::from(&format!("/facet/{}", c));
|
// let facet = Facet::from(&format!("/facet/{c}"));
|
||||||
let doc = doc!(facet_field => facet);
|
// let doc = doc!(facet_field => facet);
|
||||||
iter::repeat(doc).take(count)
|
// iter::repeat(doc).take(count)
|
||||||
})
|
// })
|
||||||
.collect();
|
// .collect();
|
||||||
|
|
||||||
let mut index_writer = index.writer_for_tests()?;
|
// let mut index_writer = index.writer_for_tests()?;
|
||||||
for doc in docs {
|
// for doc in docs {
|
||||||
index_writer.add_document(doc)?;
|
// index_writer.add_document(doc)?;
|
||||||
}
|
// }
|
||||||
index_writer.commit()?;
|
// index_writer.commit()?;
|
||||||
|
|
||||||
let searcher = index.reader()?.searcher();
|
// let searcher = index.reader()?.searcher();
|
||||||
let mut facet_collector = FacetCollector::for_field("facet");
|
// let mut facet_collector = FacetCollector::for_field("facet");
|
||||||
facet_collector.add_facet("/facet");
|
// facet_collector.add_facet("/facet");
|
||||||
let counts: FacetCounts = searcher.search(&AllQuery, &facet_collector)?;
|
// let counts: FacetCounts = searcher.search(&AllQuery, &facet_collector)?;
|
||||||
|
|
||||||
let facets: Vec<(&Facet, u64)> = counts.top_k("/facet", 2);
|
// let facets: Vec<(&Facet, u64)> = counts.top_k("/facet", 2);
|
||||||
assert_eq!(
|
// assert_eq!(
|
||||||
facets,
|
// facets,
|
||||||
vec![(&Facet::from("/facet/c"), 4), (&Facet::from("/facet/a"), 2)]
|
// vec![(&Facet::from("/facet/c"), 4), (&Facet::from("/facet/a"), 2)]
|
||||||
);
|
// );
|
||||||
Ok(())
|
// Ok(())
|
||||||
}
|
// }
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn is_child_facet() {
|
// fn is_child_facet() {
|
||||||
assert!(super::is_child_facet(&b"foo"[..], &b"foo\0bar"[..]));
|
// assert!(super::is_child_facet(&b"foo"[..], &b"foo\0bar"[..]));
|
||||||
assert!(super::is_child_facet(&b""[..], &b"foo\0bar"[..]));
|
// assert!(super::is_child_facet(&b""[..], &b"foo\0bar"[..]));
|
||||||
assert!(super::is_child_facet(&b""[..], &b"foo"[..]));
|
// assert!(super::is_child_facet(&b""[..], &b"foo"[..]));
|
||||||
assert!(!super::is_child_facet(&b"foo\0bar"[..], &b"foo"[..]));
|
// assert!(!super::is_child_facet(&b"foo\0bar"[..], &b"foo"[..]));
|
||||||
assert!(!super::is_child_facet(&b"foo"[..], &b"foobar\0baz"[..]));
|
// assert!(!super::is_child_facet(&b"foo"[..], &b"foobar\0baz"[..]));
|
||||||
}
|
// }
|
||||||
}
|
}
|
||||||
|
|
||||||
#[cfg(all(test, feature = "unstable"))]
|
#[cfg(all(test, feature = "unstable"))]
|
||||||
|
|||||||
@@ -871,7 +871,10 @@ mod tests {
|
|||||||
use crate::schema::{Field, Schema, FAST, STORED, TEXT};
|
use crate::schema::{Field, Schema, FAST, STORED, TEXT};
|
||||||
use crate::time::format_description::well_known::Rfc3339;
|
use crate::time::format_description::well_known::Rfc3339;
|
||||||
use crate::time::OffsetDateTime;
|
use crate::time::OffsetDateTime;
|
||||||
use crate::{DateTime, DocAddress, DocId, Index, IndexWriter, Order, Score, SegmentReader};
|
use crate::{
|
||||||
|
assert_nearly_equals, DateTime, DocAddress, DocId, Index, IndexWriter, Order, Score,
|
||||||
|
SegmentReader,
|
||||||
|
};
|
||||||
|
|
||||||
fn make_index() -> crate::Result<Index> {
|
fn make_index() -> crate::Result<Index> {
|
||||||
let mut schema_builder = Schema::builder();
|
let mut schema_builder = Schema::builder();
|
||||||
|
|||||||
@@ -195,7 +195,7 @@ mod tests {
|
|||||||
let (tx, rx) = crossbeam_channel::bounded::<()>(0);
|
let (tx, rx) = crossbeam_channel::bounded::<()>(0);
|
||||||
let rx = Arc::new(rx);
|
let rx = Arc::new(rx);
|
||||||
let executor = Executor::multi_thread(3, "search-test").unwrap();
|
let executor = Executor::multi_thread(3, "search-test").unwrap();
|
||||||
for i in 0..1000 {
|
for _ in 0..1000 {
|
||||||
let counter_clone: Arc<AtomicU64> = counter.clone();
|
let counter_clone: Arc<AtomicU64> = counter.clone();
|
||||||
let other_counter_clone: Arc<AtomicU64> = other_counter.clone();
|
let other_counter_clone: Arc<AtomicU64> = other_counter.clone();
|
||||||
|
|
||||||
@@ -203,18 +203,18 @@ mod tests {
|
|||||||
let rx_clone2 = rx.clone();
|
let rx_clone2 = rx.clone();
|
||||||
let fut = executor.spawn_blocking(move || {
|
let fut = executor.spawn_blocking(move || {
|
||||||
counter_clone.fetch_add(1, Ordering::SeqCst);
|
counter_clone.fetch_add(1, Ordering::SeqCst);
|
||||||
let () = rx_clone.recv().unwrap();
|
let _ = rx_clone.recv();
|
||||||
});
|
});
|
||||||
futures.push(fut);
|
futures.push(fut);
|
||||||
let other_fut = executor.spawn_blocking(move || {
|
let other_fut = executor.spawn_blocking(move || {
|
||||||
other_counter_clone.fetch_add(1, Ordering::SeqCst);
|
other_counter_clone.fetch_add(1, Ordering::SeqCst);
|
||||||
let () = rx_clone2.recv().unwrap();
|
let _ = rx_clone2.recv();
|
||||||
});
|
});
|
||||||
other_futures.push(other_fut);
|
other_futures.push(other_fut);
|
||||||
}
|
}
|
||||||
|
|
||||||
// We execute 100 futures.
|
// We execute 100 futures.
|
||||||
for i in 0..100 {
|
for _ in 0..100 {
|
||||||
tx.send(()).unwrap();
|
tx.send(()).unwrap();
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -226,7 +226,7 @@ mod tests {
|
|||||||
drop(other_futures);
|
drop(other_futures);
|
||||||
|
|
||||||
// We execute 100 futures.
|
// We execute 100 futures.
|
||||||
for i in 0..100 {
|
for _ in 0..100 {
|
||||||
tx.send(()).unwrap();
|
tx.send(()).unwrap();
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -338,14 +338,14 @@ mod tests {
|
|||||||
let mut term = Term::from_field_json_path(field, "attributes.color", false);
|
let mut term = Term::from_field_json_path(field, "attributes.color", false);
|
||||||
term.append_type_and_str("red");
|
term.append_type_and_str("red");
|
||||||
assert_eq!(
|
assert_eq!(
|
||||||
format!("{:?}", term),
|
format!("{term:?}"),
|
||||||
"Term(field=1, type=Json, path=attributes.color, type=Str, \"red\")"
|
"Term(field=1, type=Json, path=attributes.color, type=Str, \"red\")"
|
||||||
);
|
);
|
||||||
|
|
||||||
let mut term = Term::from_field_json_path(field, "attributes.dimensions.width", false);
|
let mut term = Term::from_field_json_path(field, "attributes.dimensions.width", false);
|
||||||
term.append_type_and_fast_value(400i64);
|
term.append_type_and_fast_value(400i64);
|
||||||
assert_eq!(
|
assert_eq!(
|
||||||
format!("{:?}", term),
|
format!("{term:?}"),
|
||||||
"Term(field=1, type=Json, path=attributes.dimensions.width, type=I64, 400)"
|
"Term(field=1, type=Json, path=attributes.dimensions.width, type=I64, 400)"
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -566,7 +566,7 @@ mod tests {
|
|||||||
let mmap_directory = MmapDirectory::create_from_tempdir().unwrap();
|
let mmap_directory = MmapDirectory::create_from_tempdir().unwrap();
|
||||||
let num_paths = 10;
|
let num_paths = 10;
|
||||||
let paths: Vec<PathBuf> = (0..num_paths)
|
let paths: Vec<PathBuf> = (0..num_paths)
|
||||||
.map(|i| PathBuf::from(&*format!("file_{}", i)))
|
.map(|i| PathBuf::from(&*format!("file_{i}")))
|
||||||
.collect();
|
.collect();
|
||||||
{
|
{
|
||||||
for path in &paths {
|
for path in &paths {
|
||||||
|
|||||||
@@ -62,7 +62,7 @@ impl FacetReader {
|
|||||||
|
|
||||||
#[cfg(test)]
|
#[cfg(test)]
|
||||||
mod tests {
|
mod tests {
|
||||||
use crate::schema::{Facet, FacetOptions, SchemaBuilder, STORED};
|
use crate::schema::{Facet, FacetOptions, SchemaBuilder, Value, STORED};
|
||||||
use crate::{DocAddress, Index, IndexWriter, TantivyDocument};
|
use crate::{DocAddress, Index, IndexWriter, TantivyDocument};
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
@@ -88,106 +88,108 @@ mod tests {
|
|||||||
let doc = searcher
|
let doc = searcher
|
||||||
.doc::<TantivyDocument>(DocAddress::new(0u32, 0u32))
|
.doc::<TantivyDocument>(DocAddress::new(0u32, 0u32))
|
||||||
.unwrap();
|
.unwrap();
|
||||||
let value = doc.get_first(facet_field).and_then(|v| v.as_facet());
|
let value = doc
|
||||||
|
.get_first(facet_field)
|
||||||
|
.and_then(|v| v.as_value().as_facet());
|
||||||
assert_eq!(value, None);
|
assert_eq!(value, None);
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_facet_several_facets_sorted() {
|
// fn test_facet_several_facets_sorted() {
|
||||||
let mut schema_builder = SchemaBuilder::default();
|
// let mut schema_builder = SchemaBuilder::default();
|
||||||
let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
// let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
||||||
let schema = schema_builder.build();
|
// let schema = schema_builder.build();
|
||||||
let index = Index::create_in_ram(schema);
|
// let index = Index::create_in_ram(schema);
|
||||||
let mut index_writer: IndexWriter = index.writer_for_tests().unwrap();
|
// let mut index_writer: IndexWriter = index.writer_for_tests().unwrap();
|
||||||
index_writer
|
// index_writer
|
||||||
.add_document(doc!(facet_field=>Facet::from_text("/parent/child1").unwrap()))
|
// .add_document(doc!(facet_field=>Facet::from_text("/parent/child1").unwrap()))
|
||||||
.unwrap();
|
// .unwrap();
|
||||||
index_writer
|
// index_writer
|
||||||
.add_document(doc!(
|
// .add_document(doc!(
|
||||||
facet_field=>Facet::from_text("/parent/child2").unwrap(),
|
// facet_field=>Facet::from_text("/parent/child2").unwrap(),
|
||||||
facet_field=>Facet::from_text("/parent/child1/blop").unwrap(),
|
// facet_field=>Facet::from_text("/parent/child1/blop").unwrap(),
|
||||||
))
|
// ))
|
||||||
.unwrap();
|
// .unwrap();
|
||||||
index_writer.commit().unwrap();
|
// index_writer.commit().unwrap();
|
||||||
let searcher = index.reader().unwrap().searcher();
|
// let searcher = index.reader().unwrap().searcher();
|
||||||
let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
// let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
||||||
let mut facet_ords = Vec::new();
|
// let mut facet_ords = Vec::new();
|
||||||
|
|
||||||
facet_ords.extend(facet_reader.facet_ords(0u32));
|
// facet_ords.extend(facet_reader.facet_ords(0u32));
|
||||||
assert_eq!(&facet_ords, &[0u64]);
|
// assert_eq!(&facet_ords, &[0u64]);
|
||||||
|
|
||||||
facet_ords.clear();
|
// facet_ords.clear();
|
||||||
facet_ords.extend(facet_reader.facet_ords(1u32));
|
// facet_ords.extend(facet_reader.facet_ords(1u32));
|
||||||
assert_eq!(&facet_ords, &[1u64, 2u64]);
|
// assert_eq!(&facet_ords, &[1u64, 2u64]);
|
||||||
|
|
||||||
assert_eq!(facet_reader.num_facets(), 3);
|
// assert_eq!(facet_reader.num_facets(), 3);
|
||||||
let mut facet = Facet::default();
|
// let mut facet = Facet::default();
|
||||||
facet_reader.facet_from_ord(0, &mut facet).unwrap();
|
// facet_reader.facet_from_ord(0, &mut facet).unwrap();
|
||||||
assert_eq!(facet.to_path_string(), "/parent/child1");
|
// assert_eq!(facet.to_path_string(), "/parent/child1");
|
||||||
facet_reader.facet_from_ord(1, &mut facet).unwrap();
|
// facet_reader.facet_from_ord(1, &mut facet).unwrap();
|
||||||
assert_eq!(facet.to_path_string(), "/parent/child1/blop");
|
// assert_eq!(facet.to_path_string(), "/parent/child1/blop");
|
||||||
facet_reader.facet_from_ord(2, &mut facet).unwrap();
|
// facet_reader.facet_from_ord(2, &mut facet).unwrap();
|
||||||
assert_eq!(facet.to_path_string(), "/parent/child2");
|
// assert_eq!(facet.to_path_string(), "/parent/child2");
|
||||||
}
|
// }
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_facet_stored_and_indexed() -> crate::Result<()> {
|
// fn test_facet_stored_and_indexed() -> crate::Result<()> {
|
||||||
let mut schema_builder = SchemaBuilder::default();
|
// let mut schema_builder = SchemaBuilder::default();
|
||||||
let facet_field = schema_builder.add_facet_field("facet", STORED);
|
// let facet_field = schema_builder.add_facet_field("facet", STORED);
|
||||||
let schema = schema_builder.build();
|
// let schema = schema_builder.build();
|
||||||
let index = Index::create_in_ram(schema);
|
// let index = Index::create_in_ram(schema);
|
||||||
let mut index_writer = index.writer_for_tests()?;
|
// let mut index_writer = index.writer_for_tests()?;
|
||||||
index_writer.add_document(doc!(facet_field=>Facet::from_text("/a/b").unwrap()))?;
|
// index_writer.add_document(doc!(facet_field=>Facet::from_text("/a/b").unwrap()))?;
|
||||||
index_writer.commit()?;
|
// index_writer.commit()?;
|
||||||
let searcher = index.reader()?.searcher();
|
// let searcher = index.reader()?.searcher();
|
||||||
let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
// let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
||||||
let mut facet_ords = Vec::new();
|
// let mut facet_ords = Vec::new();
|
||||||
facet_ords.extend(facet_reader.facet_ords(0u32));
|
// facet_ords.extend(facet_reader.facet_ords(0u32));
|
||||||
assert_eq!(&facet_ords, &[0u64]);
|
// assert_eq!(&facet_ords, &[0u64]);
|
||||||
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0u32, 0u32))?;
|
// let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0u32, 0u32))?;
|
||||||
let value: Option<Facet> = doc
|
// let value: Option<Facet> = doc
|
||||||
.get_first(facet_field)
|
// .get_first(facet_field)
|
||||||
.and_then(|v| v.as_facet())
|
// .and_then(|v| v.as_facet())
|
||||||
.map(|facet| Facet::from_encoded_string(facet.to_string()));
|
// .map(|facet| Facet::from_encoded_string(facet.to_string()));
|
||||||
assert_eq!(value, Facet::from_text("/a/b").ok());
|
// assert_eq!(value, Facet::from_text("/a/b").ok());
|
||||||
Ok(())
|
// Ok(())
|
||||||
}
|
// }
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_facet_not_populated_for_all_docs() -> crate::Result<()> {
|
// fn test_facet_not_populated_for_all_docs() -> crate::Result<()> {
|
||||||
let mut schema_builder = SchemaBuilder::default();
|
// let mut schema_builder = SchemaBuilder::default();
|
||||||
let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
// let facet_field = schema_builder.add_facet_field("facet", FacetOptions::default());
|
||||||
let schema = schema_builder.build();
|
// let schema = schema_builder.build();
|
||||||
let index = Index::create_in_ram(schema);
|
// let index = Index::create_in_ram(schema);
|
||||||
let mut index_writer = index.writer_for_tests()?;
|
// let mut index_writer = index.writer_for_tests()?;
|
||||||
index_writer.add_document(doc!(facet_field=>Facet::from_text("/a/b").unwrap()))?;
|
// index_writer.add_document(doc!(facet_field=>Facet::from_text("/a/b").unwrap()))?;
|
||||||
index_writer.add_document(TantivyDocument::default())?;
|
// index_writer.add_document(TantivyDocument::default())?;
|
||||||
index_writer.commit()?;
|
// index_writer.commit()?;
|
||||||
let searcher = index.reader()?.searcher();
|
// let searcher = index.reader()?.searcher();
|
||||||
let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
// let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
||||||
let mut facet_ords = Vec::new();
|
// let mut facet_ords = Vec::new();
|
||||||
facet_ords.extend(facet_reader.facet_ords(0u32));
|
// facet_ords.extend(facet_reader.facet_ords(0u32));
|
||||||
assert_eq!(&facet_ords, &[0u64]);
|
// assert_eq!(&facet_ords, &[0u64]);
|
||||||
facet_ords.clear();
|
// facet_ords.clear();
|
||||||
facet_ords.extend(facet_reader.facet_ords(1u32));
|
// facet_ords.extend(facet_reader.facet_ords(1u32));
|
||||||
assert!(facet_ords.is_empty());
|
// assert!(facet_ords.is_empty());
|
||||||
Ok(())
|
// Ok(())
|
||||||
}
|
// }
|
||||||
|
|
||||||
#[test]
|
// #[test]
|
||||||
fn test_facet_not_populated_for_any_docs() -> crate::Result<()> {
|
// fn test_facet_not_populated_for_any_docs() -> crate::Result<()> {
|
||||||
let mut schema_builder = SchemaBuilder::default();
|
// let mut schema_builder = SchemaBuilder::default();
|
||||||
schema_builder.add_facet_field("facet", FacetOptions::default());
|
// schema_builder.add_facet_field("facet", FacetOptions::default());
|
||||||
let schema = schema_builder.build();
|
// let schema = schema_builder.build();
|
||||||
let index = Index::create_in_ram(schema);
|
// let index = Index::create_in_ram(schema);
|
||||||
let mut index_writer = index.writer_for_tests()?;
|
// let mut index_writer = index.writer_for_tests()?;
|
||||||
index_writer.add_document(TantivyDocument::default())?;
|
// index_writer.add_document(TantivyDocument::default())?;
|
||||||
index_writer.add_document(TantivyDocument::default())?;
|
// index_writer.add_document(TantivyDocument::default())?;
|
||||||
index_writer.commit()?;
|
// index_writer.commit()?;
|
||||||
let searcher = index.reader()?.searcher();
|
// let searcher = index.reader()?.searcher();
|
||||||
let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
// let facet_reader = searcher.segment_reader(0u32).facet_reader("facet").unwrap();
|
||||||
assert!(facet_reader.facet_ords(0u32).next().is_none());
|
// assert!(facet_reader.facet_ords(0u32).next().is_none());
|
||||||
assert!(facet_reader.facet_ords(1u32).next().is_none());
|
// assert!(facet_reader.facet_ords(1u32).next().is_none());
|
||||||
Ok(())
|
// Ok(())
|
||||||
}
|
// }
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -252,9 +252,8 @@ impl IndexBuilder {
|
|||||||
let field_type = entry.field_type().value_type();
|
let field_type = entry.field_type().value_type();
|
||||||
if !supported_field_types.contains(&field_type) {
|
if !supported_field_types.contains(&field_type) {
|
||||||
return Err(TantivyError::InvalidArgument(format!(
|
return Err(TantivyError::InvalidArgument(format!(
|
||||||
"Unsupported field type in sort_by_field: {:?}. Supported field types: \
|
"Unsupported field type in sort_by_field: {field_type:?}. Supported field \
|
||||||
{:?} ",
|
types: {supported_field_types:?} ",
|
||||||
field_type, supported_field_types,
|
|
||||||
)));
|
)));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -318,14 +318,14 @@ impl SegmentReader {
|
|||||||
if create_canonical {
|
if create_canonical {
|
||||||
// Without expand dots enabled dots need to be escaped.
|
// Without expand dots enabled dots need to be escaped.
|
||||||
let escaped_json_path = json_path.replace('.', "\\.");
|
let escaped_json_path = json_path.replace('.', "\\.");
|
||||||
let full_path = format!("{}.{}", field_name, escaped_json_path);
|
let full_path = format!("{field_name}.{escaped_json_path}");
|
||||||
let full_path_unescaped = format!("{}.{}", field_name, &json_path);
|
let full_path_unescaped = format!("{}.{}", field_name, &json_path);
|
||||||
map_to_canonical.insert(full_path_unescaped, full_path.to_string());
|
map_to_canonical.insert(full_path_unescaped, full_path.to_string());
|
||||||
full_path
|
full_path
|
||||||
} else {
|
} else {
|
||||||
// With expand dots enabled, we can use '.' instead of '\u{1}'.
|
// With expand dots enabled, we can use '.' instead of '\u{1}'.
|
||||||
json_path_sep_to_dot(&mut json_path);
|
json_path_sep_to_dot(&mut json_path);
|
||||||
format!("{}.{}", field_name, json_path)
|
format!("{field_name}.{json_path}")
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
indexed_fields.extend(
|
indexed_fields.extend(
|
||||||
|
|||||||
@@ -816,7 +816,7 @@ mod tests {
|
|||||||
use crate::query::{BooleanQuery, Occur, Query, QueryParser, TermQuery};
|
use crate::query::{BooleanQuery, Occur, Query, QueryParser, TermQuery};
|
||||||
use crate::schema::{
|
use crate::schema::{
|
||||||
self, Facet, FacetOptions, IndexRecordOption, IpAddrOptions, NumericOptions, Schema,
|
self, Facet, FacetOptions, IndexRecordOption, IpAddrOptions, NumericOptions, Schema,
|
||||||
TextFieldIndexing, TextOptions, FAST, INDEXED, STORED, STRING, TEXT,
|
TextFieldIndexing, TextOptions, Value, FAST, INDEXED, STORED, STRING, TEXT,
|
||||||
};
|
};
|
||||||
use crate::store::DOCSTORE_CACHE_CAPACITY;
|
use crate::store::DOCSTORE_CACHE_CAPACITY;
|
||||||
use crate::{
|
use crate::{
|
||||||
@@ -1979,7 +1979,13 @@ mod tests {
|
|||||||
.unwrap();
|
.unwrap();
|
||||||
// test store iterator
|
// test store iterator
|
||||||
for doc in store_reader.iter::<TantivyDocument>(segment_reader.alive_bitset()) {
|
for doc in store_reader.iter::<TantivyDocument>(segment_reader.alive_bitset()) {
|
||||||
let id = doc.unwrap().get_first(id_field).unwrap().as_u64().unwrap();
|
let id = doc
|
||||||
|
.unwrap()
|
||||||
|
.get_first(id_field)
|
||||||
|
.unwrap()
|
||||||
|
.as_value()
|
||||||
|
.as_u64()
|
||||||
|
.unwrap();
|
||||||
assert!(expected_ids_and_num_occurrences.contains_key(&id));
|
assert!(expected_ids_and_num_occurrences.contains_key(&id));
|
||||||
}
|
}
|
||||||
// test store random access
|
// test store random access
|
||||||
|
|||||||
@@ -787,6 +787,8 @@ impl IndexMerger {
|
|||||||
mod tests {
|
mod tests {
|
||||||
|
|
||||||
use columnar::Column;
|
use columnar::Column;
|
||||||
|
use proptest::prop_oneof;
|
||||||
|
use proptest::strategy::Strategy;
|
||||||
use schema::FAST;
|
use schema::FAST;
|
||||||
|
|
||||||
use crate::collector::tests::{
|
use crate::collector::tests::{
|
||||||
@@ -794,10 +796,11 @@ mod tests {
|
|||||||
};
|
};
|
||||||
use crate::collector::{Count, FacetCollector};
|
use crate::collector::{Count, FacetCollector};
|
||||||
use crate::index::{Index, SegmentId};
|
use crate::index::{Index, SegmentId};
|
||||||
|
use crate::indexer::NoMergePolicy;
|
||||||
use crate::query::{AllQuery, BooleanQuery, EnableScoring, Scorer, TermQuery};
|
use crate::query::{AllQuery, BooleanQuery, EnableScoring, Scorer, TermQuery};
|
||||||
use crate::schema::{
|
use crate::schema::{
|
||||||
Facet, FacetOptions, IndexRecordOption, NumericOptions, TantivyDocument, Term,
|
Facet, FacetOptions, IndexRecordOption, NumericOptions, TantivyDocument, Term,
|
||||||
TextFieldIndexing, INDEXED, TEXT,
|
TextFieldIndexing, Value, INDEXED, TEXT,
|
||||||
};
|
};
|
||||||
use crate::time::OffsetDateTime;
|
use crate::time::OffsetDateTime;
|
||||||
use crate::{
|
use crate::{
|
||||||
@@ -909,15 +912,24 @@ mod tests {
|
|||||||
}
|
}
|
||||||
{
|
{
|
||||||
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 0))?;
|
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 0))?;
|
||||||
assert_eq!(doc.get_first(text_field).unwrap().as_str(), Some("af b"));
|
assert_eq!(
|
||||||
|
doc.get_first(text_field).unwrap().as_value().as_str(),
|
||||||
|
Some("af b")
|
||||||
|
);
|
||||||
}
|
}
|
||||||
{
|
{
|
||||||
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 1))?;
|
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 1))?;
|
||||||
assert_eq!(doc.get_first(text_field).unwrap().as_str(), Some("a b c"));
|
assert_eq!(
|
||||||
|
doc.get_first(text_field).unwrap().as_value().as_str(),
|
||||||
|
Some("a b c")
|
||||||
|
);
|
||||||
}
|
}
|
||||||
{
|
{
|
||||||
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 2))?;
|
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 2))?;
|
||||||
assert_eq!(doc.get_first(text_field).unwrap().as_str(), Some("a b c d"));
|
assert_eq!(
|
||||||
|
doc.get_first(text_field).unwrap().as_value().as_str(),
|
||||||
|
Some("a b c d")
|
||||||
|
);
|
||||||
}
|
}
|
||||||
{
|
{
|
||||||
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 3))?;
|
let doc = searcher.doc::<TantivyDocument>(DocAddress::new(0, 3))?;
|
||||||
@@ -1522,6 +1534,112 @@ mod tests {
|
|||||||
Ok(())
|
Ok(())
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[derive(Debug, Clone, Copy, Eq, PartialEq)]
|
||||||
|
enum IndexingOp {
|
||||||
|
ZeroVal,
|
||||||
|
OneVal { val: u64 },
|
||||||
|
TwoVal { val: u64 },
|
||||||
|
Commit,
|
||||||
|
}
|
||||||
|
|
||||||
|
fn balanced_operation_strategy() -> impl Strategy<Value = IndexingOp> {
|
||||||
|
prop_oneof![
|
||||||
|
(0u64..1u64).prop_map(|_| IndexingOp::ZeroVal),
|
||||||
|
(0u64..1u64).prop_map(|val| IndexingOp::OneVal { val }),
|
||||||
|
(0u64..1u64).prop_map(|val| IndexingOp::TwoVal { val }),
|
||||||
|
(0u64..1u64).prop_map(|_| IndexingOp::Commit),
|
||||||
|
]
|
||||||
|
}
|
||||||
|
|
||||||
|
use proptest::prelude::*;
|
||||||
|
proptest! {
|
||||||
|
#[test]
|
||||||
|
fn test_merge_columnar_int_proptest(ops in proptest::collection::vec(balanced_operation_strategy(), 1..20)) {
|
||||||
|
assert!(test_merge_int_fields(&ops[..]).is_ok());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
fn test_merge_int_fields(ops: &[IndexingOp]) -> crate::Result<()> {
|
||||||
|
if ops.iter().all(|op| *op == IndexingOp::Commit) {
|
||||||
|
return Ok(());
|
||||||
|
}
|
||||||
|
let expected_doc_and_vals: Vec<(u32, Vec<u64>)> = ops
|
||||||
|
.iter()
|
||||||
|
.filter(|op| *op != &IndexingOp::Commit)
|
||||||
|
.map(|op| match op {
|
||||||
|
IndexingOp::ZeroVal => vec![],
|
||||||
|
IndexingOp::OneVal { val } => vec![*val],
|
||||||
|
IndexingOp::TwoVal { val } => vec![*val, *val],
|
||||||
|
IndexingOp::Commit => unreachable!(),
|
||||||
|
})
|
||||||
|
.enumerate()
|
||||||
|
.map(|(id, val)| (id as u32, val))
|
||||||
|
.collect();
|
||||||
|
|
||||||
|
let mut schema_builder = schema::Schema::builder();
|
||||||
|
let int_options = NumericOptions::default().set_fast().set_indexed();
|
||||||
|
let int_field = schema_builder.add_u64_field("intvals", int_options);
|
||||||
|
let index = Index::create_in_ram(schema_builder.build());
|
||||||
|
{
|
||||||
|
let mut index_writer = index.writer_for_tests()?;
|
||||||
|
index_writer.set_merge_policy(Box::new(NoMergePolicy));
|
||||||
|
let index_doc = |index_writer: &mut IndexWriter, int_vals: &[u64]| {
|
||||||
|
let mut doc = TantivyDocument::default();
|
||||||
|
for &val in int_vals {
|
||||||
|
doc.add_u64(int_field, val);
|
||||||
|
}
|
||||||
|
index_writer.add_document(doc).unwrap();
|
||||||
|
};
|
||||||
|
|
||||||
|
for op in ops {
|
||||||
|
match op {
|
||||||
|
IndexingOp::ZeroVal => index_doc(&mut index_writer, &[]),
|
||||||
|
IndexingOp::OneVal { val } => index_doc(&mut index_writer, &[*val]),
|
||||||
|
IndexingOp::TwoVal { val } => index_doc(&mut index_writer, &[*val, *val]),
|
||||||
|
IndexingOp::Commit => {
|
||||||
|
index_writer.commit().expect("commit failed");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
index_writer.commit().expect("commit failed");
|
||||||
|
}
|
||||||
|
{
|
||||||
|
let mut segment_ids = index.searchable_segment_ids()?;
|
||||||
|
segment_ids.sort();
|
||||||
|
let mut index_writer: IndexWriter = index.writer_for_tests()?;
|
||||||
|
index_writer.merge(&segment_ids).wait()?;
|
||||||
|
index_writer.wait_merging_threads()?;
|
||||||
|
}
|
||||||
|
let reader = index.reader()?;
|
||||||
|
reader.reload()?;
|
||||||
|
|
||||||
|
let mut vals: Vec<u64> = Vec::new();
|
||||||
|
let mut test_vals = move |col: &Column<u64>, doc: DocId, expected: &[u64]| {
|
||||||
|
vals.clear();
|
||||||
|
vals.extend(col.values_for_doc(doc));
|
||||||
|
assert_eq!(&vals[..], expected);
|
||||||
|
};
|
||||||
|
|
||||||
|
let mut test_col = move |col: &Column<u64>, column_expected: &[(u32, Vec<u64>)]| {
|
||||||
|
for (doc_id, vals) in column_expected.iter() {
|
||||||
|
test_vals(col, *doc_id, vals);
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
{
|
||||||
|
let searcher = reader.searcher();
|
||||||
|
let segment = searcher.segment_reader(0u32);
|
||||||
|
let col = segment
|
||||||
|
.fast_fields()
|
||||||
|
.column_opt::<u64>("intvals")
|
||||||
|
.unwrap()
|
||||||
|
.unwrap();
|
||||||
|
|
||||||
|
test_col(&col, &expected_doc_and_vals);
|
||||||
|
}
|
||||||
|
|
||||||
|
Ok(())
|
||||||
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
fn test_merge_multivalued_int_fields_simple() -> crate::Result<()> {
|
fn test_merge_multivalued_int_fields_simple() -> crate::Result<()> {
|
||||||
let mut schema_builder = schema::Schema::builder();
|
let mut schema_builder = schema::Schema::builder();
|
||||||
|
|||||||
@@ -7,7 +7,7 @@ mod tests {
|
|||||||
use crate::query::QueryParser;
|
use crate::query::QueryParser;
|
||||||
use crate::schema::{
|
use crate::schema::{
|
||||||
self, BytesOptions, Facet, FacetOptions, IndexRecordOption, NumericOptions,
|
self, BytesOptions, Facet, FacetOptions, IndexRecordOption, NumericOptions,
|
||||||
TextFieldIndexing, TextOptions,
|
TextFieldIndexing, TextOptions, Value,
|
||||||
};
|
};
|
||||||
use crate::{
|
use crate::{
|
||||||
DocAddress, DocSet, IndexSettings, IndexSortByField, IndexWriter, Order, TantivyDocument,
|
DocAddress, DocSet, IndexSettings, IndexSortByField, IndexWriter, Order, TantivyDocument,
|
||||||
@@ -280,13 +280,16 @@ mod tests {
|
|||||||
.doc::<TantivyDocument>(DocAddress::new(0, blubber_pos))
|
.doc::<TantivyDocument>(DocAddress::new(0, blubber_pos))
|
||||||
.unwrap();
|
.unwrap();
|
||||||
assert_eq!(
|
assert_eq!(
|
||||||
doc.get_first(my_text_field).unwrap().as_str(),
|
doc.get_first(my_text_field).unwrap().as_value().as_str(),
|
||||||
Some("blubber")
|
Some("blubber")
|
||||||
);
|
);
|
||||||
let doc = searcher
|
let doc = searcher
|
||||||
.doc::<TantivyDocument>(DocAddress::new(0, 0))
|
.doc::<TantivyDocument>(DocAddress::new(0, 0))
|
||||||
.unwrap();
|
.unwrap();
|
||||||
assert_eq!(doc.get_first(int_field).unwrap().as_u64(), Some(1000));
|
assert_eq!(
|
||||||
|
doc.get_first(int_field).unwrap().as_value().as_u64(),
|
||||||
|
Some(1000)
|
||||||
|
);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -216,7 +216,7 @@ mod tests_mmap {
|
|||||||
let test_query = |query_str: &str| {
|
let test_query = |query_str: &str| {
|
||||||
let query = parse_query.parse_query(query_str).unwrap();
|
let query = parse_query.parse_query(query_str).unwrap();
|
||||||
let num_docs = searcher.search(&query, &Count).unwrap();
|
let num_docs = searcher.search(&query, &Count).unwrap();
|
||||||
assert_eq!(num_docs, 1, "{}", query_str);
|
assert_eq!(num_docs, 1, "{query_str}");
|
||||||
};
|
};
|
||||||
test_query(format!("json.{field_name_out}:test1").as_str());
|
test_query(format!("json.{field_name_out}:test1").as_str());
|
||||||
test_query(format!("json.a{field_name_out}:test2").as_str());
|
test_query(format!("json.a{field_name_out}:test2").as_str());
|
||||||
@@ -590,10 +590,10 @@ mod tests_mmap {
|
|||||||
let query_parser = QueryParser::for_index(&index, vec![]);
|
let query_parser = QueryParser::for_index(&index, vec![]);
|
||||||
// Test if field name can be queried
|
// Test if field name can be queried
|
||||||
for (indexed_field, val) in fields_and_vals.iter() {
|
for (indexed_field, val) in fields_and_vals.iter() {
|
||||||
let query_str = &format!("{}:{}", indexed_field, val);
|
let query_str = &format!("{indexed_field}:{val}");
|
||||||
let query = query_parser.parse_query(query_str).unwrap();
|
let query = query_parser.parse_query(query_str).unwrap();
|
||||||
let count_docs = searcher.search(&*query, &TopDocs::with_limit(2)).unwrap();
|
let count_docs = searcher.search(&*query, &TopDocs::with_limit(2)).unwrap();
|
||||||
assert!(!count_docs.is_empty(), "{}:{}", indexed_field, val);
|
assert!(!count_docs.is_empty(), "{indexed_field}:{val}");
|
||||||
}
|
}
|
||||||
// Test if field name can be used for aggregation
|
// Test if field name can be used for aggregation
|
||||||
for (field_name, val) in fields_and_vals.iter() {
|
for (field_name, val) in fields_and_vals.iter() {
|
||||||
|
|||||||
@@ -500,8 +500,8 @@ mod tests {
|
|||||||
use crate::postings::{Postings, TermInfo};
|
use crate::postings::{Postings, TermInfo};
|
||||||
use crate::query::{PhraseQuery, QueryParser};
|
use crate::query::{PhraseQuery, QueryParser};
|
||||||
use crate::schema::{
|
use crate::schema::{
|
||||||
Document, IndexRecordOption, OwnedValue, Schema, TextFieldIndexing, TextOptions, STORED,
|
Document, IndexRecordOption, OwnedValue, Schema, TextFieldIndexing, TextOptions, Value,
|
||||||
STRING, TEXT,
|
STORED, STRING, TEXT,
|
||||||
};
|
};
|
||||||
use crate::store::{Compressor, StoreReader, StoreWriter};
|
use crate::store::{Compressor, StoreReader, StoreWriter};
|
||||||
use crate::time::format_description::well_known::Rfc3339;
|
use crate::time::format_description::well_known::Rfc3339;
|
||||||
@@ -555,9 +555,12 @@ mod tests {
|
|||||||
let doc = reader.get::<TantivyDocument>(0).unwrap();
|
let doc = reader.get::<TantivyDocument>(0).unwrap();
|
||||||
|
|
||||||
assert_eq!(doc.field_values().count(), 2);
|
assert_eq!(doc.field_values().count(), 2);
|
||||||
assert_eq!(doc.get_all(text_field).next().unwrap().as_str(), Some("A"));
|
|
||||||
assert_eq!(
|
assert_eq!(
|
||||||
doc.get_all(text_field).nth(1).unwrap().as_str(),
|
doc.get_all(text_field).next().unwrap().as_value().as_str(),
|
||||||
|
Some("A")
|
||||||
|
);
|
||||||
|
assert_eq!(
|
||||||
|
doc.get_all(text_field).nth(1).unwrap().as_value().as_str(),
|
||||||
Some("title")
|
Some("title")
|
||||||
);
|
);
|
||||||
}
|
}
|
||||||
|
|||||||
20
src/lib.rs
20
src/lib.rs
@@ -397,16 +397,20 @@ pub mod tests {
|
|||||||
#[macro_export]
|
#[macro_export]
|
||||||
macro_rules! assert_nearly_equals {
|
macro_rules! assert_nearly_equals {
|
||||||
($left:expr, $right:expr) => {{
|
($left:expr, $right:expr) => {{
|
||||||
match (&$left, &$right) {
|
assert_nearly_equals!($left, $right, 0.0005);
|
||||||
(left_val, right_val) => {
|
}};
|
||||||
|
($left:expr, $right:expr, $epsilon:expr) => {{
|
||||||
|
match (&$left, &$right, &$epsilon) {
|
||||||
|
(left_val, right_val, epsilon_val) => {
|
||||||
let diff = (left_val - right_val).abs();
|
let diff = (left_val - right_val).abs();
|
||||||
let add = left_val.abs() + right_val.abs();
|
|
||||||
if diff > 0.0005 * add {
|
if diff > *epsilon_val {
|
||||||
panic!(
|
panic!(
|
||||||
r#"assertion failed: `(left ~= right)`
|
r#"assertion failed: `abs(left-right)>epsilon`
|
||||||
left: `{:?}`,
|
left: `{:?}`,
|
||||||
right: `{:?}`"#,
|
right: `{:?}`,
|
||||||
&*left_val, &*right_val
|
epsilon: `{:?}`"#,
|
||||||
|
&*left_val, &*right_val, &*epsilon_val
|
||||||
)
|
)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -138,8 +138,7 @@ impl FuzzyTermQuery {
|
|||||||
if json_path_type != Type::Str {
|
if json_path_type != Type::Str {
|
||||||
return Err(InvalidArgument(format!(
|
return Err(InvalidArgument(format!(
|
||||||
"The fuzzy term query requires a string path type for a json term. Found \
|
"The fuzzy term query requires a string path type for a json term. Found \
|
||||||
{:?}",
|
{json_path_type:?}"
|
||||||
json_path_type
|
|
||||||
)));
|
)));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -2,7 +2,7 @@ use crate::docset::{DocSet, TERMINATED};
|
|||||||
use crate::fieldnorm::FieldNormReader;
|
use crate::fieldnorm::FieldNormReader;
|
||||||
use crate::postings::Postings;
|
use crate::postings::Postings;
|
||||||
use crate::query::bm25::Bm25Weight;
|
use crate::query::bm25::Bm25Weight;
|
||||||
use crate::query::phrase_query::{intersection_count, PhraseScorer};
|
use crate::query::phrase_query::{intersection_count, intersection_exists, PhraseScorer};
|
||||||
use crate::query::Scorer;
|
use crate::query::Scorer;
|
||||||
use crate::{DocId, Score};
|
use crate::{DocId, Score};
|
||||||
|
|
||||||
@@ -92,14 +92,17 @@ impl<TPostings: Postings> Scorer for PhraseKind<TPostings> {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
pub struct PhrasePrefixScorer<TPostings: Postings> {
|
pub struct PhrasePrefixScorer<TPostings: Postings, const SCORING_ENABLED: bool> {
|
||||||
phrase_scorer: PhraseKind<TPostings>,
|
phrase_scorer: PhraseKind<TPostings>,
|
||||||
suffixes: Vec<TPostings>,
|
suffixes: Vec<TPostings>,
|
||||||
suffix_offset: u32,
|
suffix_offset: u32,
|
||||||
phrase_count: u32,
|
phrase_count: u32,
|
||||||
|
suffix_position_buffer: Vec<u32>,
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<TPostings: Postings> PhrasePrefixScorer<TPostings> {
|
impl<TPostings: Postings, const SCORING_ENABLED: bool>
|
||||||
|
PhrasePrefixScorer<TPostings, SCORING_ENABLED>
|
||||||
|
{
|
||||||
// If similarity_weight is None, then scoring is disabled.
|
// If similarity_weight is None, then scoring is disabled.
|
||||||
pub fn new(
|
pub fn new(
|
||||||
mut term_postings: Vec<(usize, TPostings)>,
|
mut term_postings: Vec<(usize, TPostings)>,
|
||||||
@@ -107,7 +110,7 @@ impl<TPostings: Postings> PhrasePrefixScorer<TPostings> {
|
|||||||
fieldnorm_reader: FieldNormReader,
|
fieldnorm_reader: FieldNormReader,
|
||||||
suffixes: Vec<TPostings>,
|
suffixes: Vec<TPostings>,
|
||||||
suffix_pos: usize,
|
suffix_pos: usize,
|
||||||
) -> PhrasePrefixScorer<TPostings> {
|
) -> PhrasePrefixScorer<TPostings, SCORING_ENABLED> {
|
||||||
// correct indices so we can merge with our suffix term the PhraseScorer doesn't know about
|
// correct indices so we can merge with our suffix term the PhraseScorer doesn't know about
|
||||||
let max_offset = term_postings
|
let max_offset = term_postings
|
||||||
.iter()
|
.iter()
|
||||||
@@ -140,6 +143,7 @@ impl<TPostings: Postings> PhrasePrefixScorer<TPostings> {
|
|||||||
suffixes,
|
suffixes,
|
||||||
suffix_offset: (max_offset - suffix_pos) as u32,
|
suffix_offset: (max_offset - suffix_pos) as u32,
|
||||||
phrase_count: 0,
|
phrase_count: 0,
|
||||||
|
suffix_position_buffer: Vec::with_capacity(100),
|
||||||
};
|
};
|
||||||
if phrase_prefix_scorer.doc() != TERMINATED && !phrase_prefix_scorer.matches_prefix() {
|
if phrase_prefix_scorer.doc() != TERMINATED && !phrase_prefix_scorer.matches_prefix() {
|
||||||
phrase_prefix_scorer.advance();
|
phrase_prefix_scorer.advance();
|
||||||
@@ -153,7 +157,6 @@ impl<TPostings: Postings> PhrasePrefixScorer<TPostings> {
|
|||||||
|
|
||||||
fn matches_prefix(&mut self) -> bool {
|
fn matches_prefix(&mut self) -> bool {
|
||||||
let mut count = 0;
|
let mut count = 0;
|
||||||
let mut positions = Vec::new();
|
|
||||||
let current_doc = self.doc();
|
let current_doc = self.doc();
|
||||||
let pos_matching = self.phrase_scorer.get_intersection();
|
let pos_matching = self.phrase_scorer.get_intersection();
|
||||||
for suffix in &mut self.suffixes {
|
for suffix in &mut self.suffixes {
|
||||||
@@ -162,16 +165,27 @@ impl<TPostings: Postings> PhrasePrefixScorer<TPostings> {
|
|||||||
}
|
}
|
||||||
let doc = suffix.seek(current_doc);
|
let doc = suffix.seek(current_doc);
|
||||||
if doc == current_doc {
|
if doc == current_doc {
|
||||||
suffix.positions_with_offset(self.suffix_offset, &mut positions);
|
suffix.positions_with_offset(self.suffix_offset, &mut self.suffix_position_buffer);
|
||||||
count += intersection_count(pos_matching, &positions);
|
if SCORING_ENABLED {
|
||||||
|
count += intersection_count(pos_matching, &self.suffix_position_buffer);
|
||||||
|
} else {
|
||||||
|
if intersection_exists(pos_matching, &self.suffix_position_buffer) {
|
||||||
|
return true;
|
||||||
|
}
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
if !SCORING_ENABLED {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
self.phrase_count = count as u32;
|
self.phrase_count = count as u32;
|
||||||
count != 0
|
count != 0
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<TPostings: Postings> DocSet for PhrasePrefixScorer<TPostings> {
|
impl<TPostings: Postings, const SCORING_ENABLED: bool> DocSet
|
||||||
|
for PhrasePrefixScorer<TPostings, SCORING_ENABLED>
|
||||||
|
{
|
||||||
fn advance(&mut self) -> DocId {
|
fn advance(&mut self) -> DocId {
|
||||||
loop {
|
loop {
|
||||||
let doc = self.phrase_scorer.advance();
|
let doc = self.phrase_scorer.advance();
|
||||||
@@ -198,9 +212,15 @@ impl<TPostings: Postings> DocSet for PhrasePrefixScorer<TPostings> {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
impl<TPostings: Postings> Scorer for PhrasePrefixScorer<TPostings> {
|
impl<TPostings: Postings, const SCORING_ENABLED: bool> Scorer
|
||||||
|
for PhrasePrefixScorer<TPostings, SCORING_ENABLED>
|
||||||
|
{
|
||||||
fn score(&mut self) -> Score {
|
fn score(&mut self) -> Score {
|
||||||
|
if SCORING_ENABLED {
|
||||||
|
self.phrase_scorer.score()
|
||||||
|
} else {
|
||||||
|
1.0f32
|
||||||
|
}
|
||||||
// TODO modify score??
|
// TODO modify score??
|
||||||
self.phrase_scorer.score()
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -42,11 +42,11 @@ impl PhrasePrefixWeight {
|
|||||||
Ok(FieldNormReader::constant(reader.max_doc(), 1))
|
Ok(FieldNormReader::constant(reader.max_doc(), 1))
|
||||||
}
|
}
|
||||||
|
|
||||||
pub(crate) fn phrase_scorer(
|
pub(crate) fn phrase_prefix_scorer<const SCORING_ENABLED: bool>(
|
||||||
&self,
|
&self,
|
||||||
reader: &SegmentReader,
|
reader: &SegmentReader,
|
||||||
boost: Score,
|
boost: Score,
|
||||||
) -> crate::Result<Option<PhrasePrefixScorer<SegmentPostings>>> {
|
) -> crate::Result<Option<PhrasePrefixScorer<SegmentPostings, SCORING_ENABLED>>> {
|
||||||
let similarity_weight_opt = self
|
let similarity_weight_opt = self
|
||||||
.similarity_weight_opt
|
.similarity_weight_opt
|
||||||
.as_ref()
|
.as_ref()
|
||||||
@@ -128,15 +128,20 @@ impl PhrasePrefixWeight {
|
|||||||
|
|
||||||
impl Weight for PhrasePrefixWeight {
|
impl Weight for PhrasePrefixWeight {
|
||||||
fn scorer(&self, reader: &SegmentReader, boost: Score) -> crate::Result<Box<dyn Scorer>> {
|
fn scorer(&self, reader: &SegmentReader, boost: Score) -> crate::Result<Box<dyn Scorer>> {
|
||||||
if let Some(scorer) = self.phrase_scorer(reader, boost)? {
|
if self.similarity_weight_opt.is_some() {
|
||||||
Ok(Box::new(scorer))
|
if let Some(scorer) = self.phrase_prefix_scorer::<true>(reader, boost)? {
|
||||||
|
return Ok(Box::new(scorer));
|
||||||
|
}
|
||||||
} else {
|
} else {
|
||||||
Ok(Box::new(EmptyScorer))
|
if let Some(scorer) = self.phrase_prefix_scorer::<false>(reader, boost)? {
|
||||||
|
return Ok(Box::new(scorer));
|
||||||
|
}
|
||||||
}
|
}
|
||||||
|
Ok(Box::new(EmptyScorer))
|
||||||
}
|
}
|
||||||
|
|
||||||
fn explain(&self, reader: &SegmentReader, doc: DocId) -> crate::Result<Explanation> {
|
fn explain(&self, reader: &SegmentReader, doc: DocId) -> crate::Result<Explanation> {
|
||||||
let scorer_opt = self.phrase_scorer(reader, 1.0)?;
|
let scorer_opt = self.phrase_prefix_scorer::<true>(reader, 1.0)?;
|
||||||
if scorer_opt.is_none() {
|
if scorer_opt.is_none() {
|
||||||
return Err(does_not_match(doc));
|
return Err(does_not_match(doc));
|
||||||
}
|
}
|
||||||
@@ -200,7 +205,7 @@ mod tests {
|
|||||||
.unwrap()
|
.unwrap()
|
||||||
.unwrap();
|
.unwrap();
|
||||||
let mut phrase_scorer = phrase_weight
|
let mut phrase_scorer = phrase_weight
|
||||||
.phrase_scorer(searcher.segment_reader(0u32), 1.0)?
|
.phrase_prefix_scorer::<true>(searcher.segment_reader(0u32), 1.0)?
|
||||||
.unwrap();
|
.unwrap();
|
||||||
assert_eq!(phrase_scorer.doc(), 1);
|
assert_eq!(phrase_scorer.doc(), 1);
|
||||||
assert_eq!(phrase_scorer.phrase_count(), 2);
|
assert_eq!(phrase_scorer.phrase_count(), 2);
|
||||||
@@ -211,6 +216,38 @@ mod tests {
|
|||||||
Ok(())
|
Ok(())
|
||||||
}
|
}
|
||||||
|
|
||||||
|
#[test]
|
||||||
|
pub fn test_phrase_no_count() -> crate::Result<()> {
|
||||||
|
let index = create_index(&[
|
||||||
|
"aa bb dd cc",
|
||||||
|
"aa aa bb c dd aa bb cc aa bb dc",
|
||||||
|
" aa bb cd",
|
||||||
|
])?;
|
||||||
|
let schema = index.schema();
|
||||||
|
let text_field = schema.get_field("text").unwrap();
|
||||||
|
let searcher = index.reader()?.searcher();
|
||||||
|
let phrase_query = PhrasePrefixQuery::new(vec![
|
||||||
|
Term::from_field_text(text_field, "aa"),
|
||||||
|
Term::from_field_text(text_field, "bb"),
|
||||||
|
Term::from_field_text(text_field, "c"),
|
||||||
|
]);
|
||||||
|
let enable_scoring = EnableScoring::enabled_from_searcher(&searcher);
|
||||||
|
let phrase_weight = phrase_query
|
||||||
|
.phrase_prefix_query_weight(enable_scoring)
|
||||||
|
.unwrap()
|
||||||
|
.unwrap();
|
||||||
|
let mut phrase_scorer = phrase_weight
|
||||||
|
.phrase_prefix_scorer::<false>(searcher.segment_reader(0u32), 1.0)?
|
||||||
|
.unwrap();
|
||||||
|
assert_eq!(phrase_scorer.doc(), 1);
|
||||||
|
assert_eq!(phrase_scorer.phrase_count(), 0);
|
||||||
|
assert_eq!(phrase_scorer.advance(), 2);
|
||||||
|
assert_eq!(phrase_scorer.doc(), 2);
|
||||||
|
assert_eq!(phrase_scorer.phrase_count(), 0);
|
||||||
|
assert_eq!(phrase_scorer.advance(), TERMINATED);
|
||||||
|
Ok(())
|
||||||
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
pub fn test_phrase_count_mid() -> crate::Result<()> {
|
pub fn test_phrase_count_mid() -> crate::Result<()> {
|
||||||
let index = create_index(&["aa dd cc", "aa aa bb c dd aa bb cc aa dc", " aa bb cd"])?;
|
let index = create_index(&["aa dd cc", "aa aa bb c dd aa bb cc aa dc", " aa bb cd"])?;
|
||||||
@@ -227,7 +264,7 @@ mod tests {
|
|||||||
.unwrap()
|
.unwrap()
|
||||||
.unwrap();
|
.unwrap();
|
||||||
let mut phrase_scorer = phrase_weight
|
let mut phrase_scorer = phrase_weight
|
||||||
.phrase_scorer(searcher.segment_reader(0u32), 1.0)?
|
.phrase_prefix_scorer::<true>(searcher.segment_reader(0u32), 1.0)?
|
||||||
.unwrap();
|
.unwrap();
|
||||||
assert_eq!(phrase_scorer.doc(), 1);
|
assert_eq!(phrase_scorer.doc(), 1);
|
||||||
assert_eq!(phrase_scorer.phrase_count(), 2);
|
assert_eq!(phrase_scorer.phrase_count(), 2);
|
||||||
|
|||||||
@@ -3,8 +3,8 @@ mod phrase_scorer;
|
|||||||
mod phrase_weight;
|
mod phrase_weight;
|
||||||
|
|
||||||
pub use self::phrase_query::PhraseQuery;
|
pub use self::phrase_query::PhraseQuery;
|
||||||
pub(crate) use self::phrase_scorer::intersection_count;
|
|
||||||
pub use self::phrase_scorer::PhraseScorer;
|
pub use self::phrase_scorer::PhraseScorer;
|
||||||
|
pub(crate) use self::phrase_scorer::{intersection_count, intersection_exists};
|
||||||
pub use self::phrase_weight::PhraseWeight;
|
pub use self::phrase_weight::PhraseWeight;
|
||||||
|
|
||||||
#[cfg(test)]
|
#[cfg(test)]
|
||||||
|
|||||||
@@ -58,7 +58,7 @@ pub struct PhraseScorer<TPostings: Postings> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// Returns true if and only if the two sorted arrays contain a common element
|
/// Returns true if and only if the two sorted arrays contain a common element
|
||||||
fn intersection_exists(left: &[u32], right: &[u32]) -> bool {
|
pub(crate) fn intersection_exists(left: &[u32], right: &[u32]) -> bool {
|
||||||
let mut left_index = 0;
|
let mut left_index = 0;
|
||||||
let mut right_index = 0;
|
let mut right_index = 0;
|
||||||
while left_index < left.len() && right_index < right.len() {
|
while left_index < left.len() && right_index < right.len() {
|
||||||
|
|||||||
@@ -185,7 +185,7 @@ mod test {
|
|||||||
Err(crate::TantivyError::InvalidArgument(msg)) => {
|
Err(crate::TantivyError::InvalidArgument(msg)) => {
|
||||||
assert!(msg.contains("error: unclosed group"))
|
assert!(msg.contains("error: unclosed group"))
|
||||||
}
|
}
|
||||||
res => panic!("unexpected result: {:?}", res),
|
res => panic!("unexpected result: {res:?}"),
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -157,29 +157,24 @@ impl CompactDoc {
|
|||||||
}
|
}
|
||||||
|
|
||||||
/// field_values accessor
|
/// field_values accessor
|
||||||
pub fn field_values(
|
pub fn field_values(&self) -> impl Iterator<Item = (Field, CompactDocValue<'_>)> {
|
||||||
&self,
|
|
||||||
) -> impl Iterator<Item = (Field, ReferenceValue<'_, CompactDocValue<'_>>)> {
|
|
||||||
self.field_values.iter().map(|field_val| {
|
self.field_values.iter().map(|field_val| {
|
||||||
let field = Field::from_field_id(field_val.field as u32);
|
let field = Field::from_field_id(field_val.field as u32);
|
||||||
let val = self.extract_value(field_val.value_addr).unwrap();
|
let val = self.get_compact_doc_value(field_val.value_addr);
|
||||||
(field, val)
|
(field, val)
|
||||||
})
|
})
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Returns all of the `ReferenceValue`s associated the given field
|
/// Returns all of the `ReferenceValue`s associated the given field
|
||||||
pub fn get_all(
|
pub fn get_all(&self, field: Field) -> impl Iterator<Item = CompactDocValue<'_>> + '_ {
|
||||||
&self,
|
|
||||||
field: Field,
|
|
||||||
) -> impl Iterator<Item = ReferenceValue<'_, CompactDocValue<'_>>> + '_ {
|
|
||||||
self.field_values
|
self.field_values
|
||||||
.iter()
|
.iter()
|
||||||
.filter(move |field_value| Field::from_field_id(field_value.field as u32) == field)
|
.filter(move |field_value| Field::from_field_id(field_value.field as u32) == field)
|
||||||
.map(|val| self.extract_value(val.value_addr).unwrap())
|
.map(|val| self.get_compact_doc_value(val.value_addr))
|
||||||
}
|
}
|
||||||
|
|
||||||
/// Returns the first `ReferenceValue` associated the given field
|
/// Returns the first `ReferenceValue` associated the given field
|
||||||
pub fn get_first(&self, field: Field) -> Option<ReferenceValue<'_, CompactDocValue<'_>>> {
|
pub fn get_first(&self, field: Field) -> Option<CompactDocValue<'_>> {
|
||||||
self.get_all(field).next()
|
self.get_all(field).next()
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -299,58 +294,11 @@ impl CompactDoc {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
fn extract_value(
|
/// Get CompactDocValue for address
|
||||||
&self,
|
fn get_compact_doc_value(&self, value_addr: ValueAddr) -> CompactDocValue<'_> {
|
||||||
ref_value: ValueAddr,
|
CompactDocValue {
|
||||||
) -> io::Result<ReferenceValue<'_, CompactDocValue<'_>>> {
|
container: self,
|
||||||
match ref_value.type_id {
|
value_addr,
|
||||||
ValueType::Null => Ok(ReferenceValueLeaf::Null.into()),
|
|
||||||
ValueType::Str => {
|
|
||||||
let str_ref = self.extract_str(ref_value.val_addr);
|
|
||||||
Ok(ReferenceValueLeaf::Str(str_ref).into())
|
|
||||||
}
|
|
||||||
ValueType::Facet => {
|
|
||||||
let str_ref = self.extract_str(ref_value.val_addr);
|
|
||||||
Ok(ReferenceValueLeaf::Facet(str_ref).into())
|
|
||||||
}
|
|
||||||
ValueType::Bytes => {
|
|
||||||
let data = self.extract_bytes(ref_value.val_addr);
|
|
||||||
Ok(ReferenceValueLeaf::Bytes(data).into())
|
|
||||||
}
|
|
||||||
ValueType::U64 => self
|
|
||||||
.read_from::<u64>(ref_value.val_addr)
|
|
||||||
.map(ReferenceValueLeaf::U64)
|
|
||||||
.map(Into::into),
|
|
||||||
ValueType::I64 => self
|
|
||||||
.read_from::<i64>(ref_value.val_addr)
|
|
||||||
.map(ReferenceValueLeaf::I64)
|
|
||||||
.map(Into::into),
|
|
||||||
ValueType::F64 => self
|
|
||||||
.read_from::<f64>(ref_value.val_addr)
|
|
||||||
.map(ReferenceValueLeaf::F64)
|
|
||||||
.map(Into::into),
|
|
||||||
ValueType::Bool => Ok(ReferenceValueLeaf::Bool(ref_value.val_addr != 0).into()),
|
|
||||||
ValueType::Date => self
|
|
||||||
.read_from::<i64>(ref_value.val_addr)
|
|
||||||
.map(|ts| ReferenceValueLeaf::Date(DateTime::from_timestamp_nanos(ts)))
|
|
||||||
.map(Into::into),
|
|
||||||
ValueType::IpAddr => self
|
|
||||||
.read_from::<u128>(ref_value.val_addr)
|
|
||||||
.map(|num| ReferenceValueLeaf::IpAddr(Ipv6Addr::from_u128(num)))
|
|
||||||
.map(Into::into),
|
|
||||||
ValueType::PreTokStr => self
|
|
||||||
.read_from::<PreTokenizedString>(ref_value.val_addr)
|
|
||||||
.map(Into::into)
|
|
||||||
.map(ReferenceValueLeaf::PreTokStr)
|
|
||||||
.map(Into::into),
|
|
||||||
ValueType::Object => Ok(ReferenceValue::Object(CompactDocObjectIter::new(
|
|
||||||
self,
|
|
||||||
ref_value.val_addr,
|
|
||||||
)?)),
|
|
||||||
ValueType::Array => Ok(ReferenceValue::Array(CompactDocArrayIter::new(
|
|
||||||
self,
|
|
||||||
ref_value.val_addr,
|
|
||||||
)?)),
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -410,7 +358,7 @@ impl PartialEq for CompactDoc {
|
|||||||
let convert_to_comparable_map = |doc: &CompactDoc| {
|
let convert_to_comparable_map = |doc: &CompactDoc| {
|
||||||
let mut field_value_set: HashMap<Field, HashSet<String>> = Default::default();
|
let mut field_value_set: HashMap<Field, HashSet<String>> = Default::default();
|
||||||
for field_value in doc.field_values.iter() {
|
for field_value in doc.field_values.iter() {
|
||||||
let value: OwnedValue = doc.extract_value(field_value.value_addr).unwrap().into();
|
let value: OwnedValue = doc.get_compact_doc_value(field_value.value_addr).into();
|
||||||
let value = serde_json::to_string(&value).unwrap();
|
let value = serde_json::to_string(&value).unwrap();
|
||||||
field_value_set
|
field_value_set
|
||||||
.entry(Field::from_field_id(field_value.field as u32))
|
.entry(Field::from_field_id(field_value.field as u32))
|
||||||
@@ -444,7 +392,19 @@ impl DocumentDeserialize for CompactDoc {
|
|||||||
#[derive(Debug, Clone, Copy)]
|
#[derive(Debug, Clone, Copy)]
|
||||||
pub struct CompactDocValue<'a> {
|
pub struct CompactDocValue<'a> {
|
||||||
container: &'a CompactDoc,
|
container: &'a CompactDoc,
|
||||||
value: ValueAddr,
|
value_addr: ValueAddr,
|
||||||
|
}
|
||||||
|
impl PartialEq for CompactDocValue<'_> {
|
||||||
|
fn eq(&self, other: &Self) -> bool {
|
||||||
|
let value1: OwnedValue = (*self).into();
|
||||||
|
let value2: OwnedValue = (*other).into();
|
||||||
|
value1 == value2
|
||||||
|
}
|
||||||
|
}
|
||||||
|
impl<'a> From<CompactDocValue<'a>> for OwnedValue {
|
||||||
|
fn from(value: CompactDocValue) -> Self {
|
||||||
|
value.as_value().into()
|
||||||
|
}
|
||||||
}
|
}
|
||||||
impl<'a> Value<'a> for CompactDocValue<'a> {
|
impl<'a> Value<'a> for CompactDocValue<'a> {
|
||||||
type ArrayIter = CompactDocArrayIter<'a>;
|
type ArrayIter = CompactDocArrayIter<'a>;
|
||||||
@@ -452,7 +412,67 @@ impl<'a> Value<'a> for CompactDocValue<'a> {
|
|||||||
type ObjectIter = CompactDocObjectIter<'a>;
|
type ObjectIter = CompactDocObjectIter<'a>;
|
||||||
|
|
||||||
fn as_value(&self) -> ReferenceValue<'a, Self> {
|
fn as_value(&self) -> ReferenceValue<'a, Self> {
|
||||||
self.container.extract_value(self.value).unwrap()
|
self.get_ref_value().unwrap()
|
||||||
|
}
|
||||||
|
}
|
||||||
|
impl<'a> CompactDocValue<'a> {
|
||||||
|
fn get_ref_value(&self) -> io::Result<ReferenceValue<'a, CompactDocValue<'a>>> {
|
||||||
|
let addr = self.value_addr.val_addr;
|
||||||
|
match self.value_addr.type_id {
|
||||||
|
ValueType::Null => Ok(ReferenceValueLeaf::Null.into()),
|
||||||
|
ValueType::Str => {
|
||||||
|
let str_ref = self.container.extract_str(addr);
|
||||||
|
Ok(ReferenceValueLeaf::Str(str_ref).into())
|
||||||
|
}
|
||||||
|
ValueType::Facet => {
|
||||||
|
let str_ref = self.container.extract_str(addr);
|
||||||
|
Ok(ReferenceValueLeaf::Facet(str_ref).into())
|
||||||
|
}
|
||||||
|
ValueType::Bytes => {
|
||||||
|
let data = self.container.extract_bytes(addr);
|
||||||
|
Ok(ReferenceValueLeaf::Bytes(data).into())
|
||||||
|
}
|
||||||
|
ValueType::U64 => self
|
||||||
|
.container
|
||||||
|
.read_from::<u64>(addr)
|
||||||
|
.map(ReferenceValueLeaf::U64)
|
||||||
|
.map(Into::into),
|
||||||
|
ValueType::I64 => self
|
||||||
|
.container
|
||||||
|
.read_from::<i64>(addr)
|
||||||
|
.map(ReferenceValueLeaf::I64)
|
||||||
|
.map(Into::into),
|
||||||
|
ValueType::F64 => self
|
||||||
|
.container
|
||||||
|
.read_from::<f64>(addr)
|
||||||
|
.map(ReferenceValueLeaf::F64)
|
||||||
|
.map(Into::into),
|
||||||
|
ValueType::Bool => Ok(ReferenceValueLeaf::Bool(addr != 0).into()),
|
||||||
|
ValueType::Date => self
|
||||||
|
.container
|
||||||
|
.read_from::<i64>(addr)
|
||||||
|
.map(|ts| ReferenceValueLeaf::Date(DateTime::from_timestamp_nanos(ts)))
|
||||||
|
.map(Into::into),
|
||||||
|
ValueType::IpAddr => self
|
||||||
|
.container
|
||||||
|
.read_from::<u128>(addr)
|
||||||
|
.map(|num| ReferenceValueLeaf::IpAddr(Ipv6Addr::from_u128(num)))
|
||||||
|
.map(Into::into),
|
||||||
|
ValueType::PreTokStr => self
|
||||||
|
.container
|
||||||
|
.read_from::<PreTokenizedString>(addr)
|
||||||
|
.map(Into::into)
|
||||||
|
.map(ReferenceValueLeaf::PreTokStr)
|
||||||
|
.map(Into::into),
|
||||||
|
ValueType::Object => Ok(ReferenceValue::Object(CompactDocObjectIter::new(
|
||||||
|
self.container,
|
||||||
|
addr,
|
||||||
|
)?)),
|
||||||
|
ValueType::Array => Ok(ReferenceValue::Array(CompactDocArrayIter::new(
|
||||||
|
self.container,
|
||||||
|
addr,
|
||||||
|
)?)),
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -537,7 +557,7 @@ impl BinarySerializable for ValueType {
|
|||||||
} else {
|
} else {
|
||||||
return Err(io::Error::new(
|
return Err(io::Error::new(
|
||||||
io::ErrorKind::InvalidData,
|
io::ErrorKind::InvalidData,
|
||||||
format!("Invalid value type id: {}", num),
|
format!("Invalid value type id: {num}"),
|
||||||
));
|
));
|
||||||
};
|
};
|
||||||
Ok(type_id)
|
Ok(type_id)
|
||||||
@@ -601,9 +621,9 @@ impl<'a> Iterator for CompactDocObjectIter<'a> {
|
|||||||
let value = ValueAddr::deserialize(&mut self.node_addresses_slice).ok()?;
|
let value = ValueAddr::deserialize(&mut self.node_addresses_slice).ok()?;
|
||||||
let value = CompactDocValue {
|
let value = CompactDocValue {
|
||||||
container: self.container,
|
container: self.container,
|
||||||
value,
|
value_addr: value,
|
||||||
};
|
};
|
||||||
return Some((key, value));
|
Some((key, value))
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -635,9 +655,9 @@ impl<'a> Iterator for CompactDocArrayIter<'a> {
|
|||||||
let value = ValueAddr::deserialize(&mut self.node_addresses_slice).ok()?;
|
let value = ValueAddr::deserialize(&mut self.node_addresses_slice).ok()?;
|
||||||
let value = CompactDocValue {
|
let value = CompactDocValue {
|
||||||
container: self.container,
|
container: self.container,
|
||||||
value,
|
value_addr: value,
|
||||||
};
|
};
|
||||||
return Some(value);
|
Some(value)
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -668,7 +688,7 @@ impl<'a> Iterator for FieldValueIterRef<'a> {
|
|||||||
Field::from_field_id(field_value.field as u32),
|
Field::from_field_id(field_value.field as u32),
|
||||||
CompactDocValue::<'a> {
|
CompactDocValue::<'a> {
|
||||||
container: self.container,
|
container: self.container,
|
||||||
value: field_value.value_addr,
|
value_addr: field_value.value_addr,
|
||||||
},
|
},
|
||||||
)
|
)
|
||||||
})
|
})
|
||||||
|
|||||||
@@ -58,9 +58,8 @@ where W: Write
|
|||||||
return Err(io::Error::new(
|
return Err(io::Error::new(
|
||||||
io::ErrorKind::Other,
|
io::ErrorKind::Other,
|
||||||
format!(
|
format!(
|
||||||
"Unexpected number of entries written to serializer, expected {} entries, got \
|
"Unexpected number of entries written to serializer, expected \
|
||||||
{} entries",
|
{num_field_values} entries, got {actual_length} entries",
|
||||||
num_field_values, actual_length,
|
|
||||||
),
|
),
|
||||||
));
|
));
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -659,9 +659,9 @@ mod tests {
|
|||||||
let schema = schema_builder.build();
|
let schema = schema_builder.build();
|
||||||
let doc_json = r#"{"date": "2019-10-12T07:20:50.52+02:00"}"#;
|
let doc_json = r#"{"date": "2019-10-12T07:20:50.52+02:00"}"#;
|
||||||
let doc = TantivyDocument::parse_json(&schema, doc_json).unwrap();
|
let doc = TantivyDocument::parse_json(&schema, doc_json).unwrap();
|
||||||
let date = doc.get_first(date_field).unwrap();
|
let date = OwnedValue::from(doc.get_first(date_field).unwrap());
|
||||||
// Time zone is converted to UTC
|
// Time zone is converted to UTC
|
||||||
assert_eq!("Leaf(Date(2019-10-12T05:20:50.52Z))", format!("{date:?}"));
|
assert_eq!("Date(2019-10-12T05:20:50.52Z)", format!("{date:?}"));
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
|
|||||||
@@ -60,7 +60,7 @@ pub mod tests {
|
|||||||
use crate::directory::{Directory, RamDirectory, WritePtr};
|
use crate::directory::{Directory, RamDirectory, WritePtr};
|
||||||
use crate::fastfield::AliveBitSet;
|
use crate::fastfield::AliveBitSet;
|
||||||
use crate::schema::{
|
use crate::schema::{
|
||||||
self, Schema, TantivyDocument, TextFieldIndexing, TextOptions, STORED, TEXT,
|
self, Schema, TantivyDocument, TextFieldIndexing, TextOptions, Value, STORED, TEXT,
|
||||||
};
|
};
|
||||||
use crate::{Index, IndexWriter, Term};
|
use crate::{Index, IndexWriter, Term};
|
||||||
|
|
||||||
@@ -122,6 +122,7 @@ pub mod tests {
|
|||||||
.get::<TantivyDocument>(i)?
|
.get::<TantivyDocument>(i)?
|
||||||
.get_first(field_title)
|
.get_first(field_title)
|
||||||
.unwrap()
|
.unwrap()
|
||||||
|
.as_value()
|
||||||
.as_str()
|
.as_str()
|
||||||
.unwrap(),
|
.unwrap(),
|
||||||
format!("Doc {i}")
|
format!("Doc {i}")
|
||||||
@@ -133,6 +134,7 @@ pub mod tests {
|
|||||||
let title_content = doc
|
let title_content = doc
|
||||||
.get_first(field_title)
|
.get_first(field_title)
|
||||||
.unwrap()
|
.unwrap()
|
||||||
|
.as_value()
|
||||||
.as_str()
|
.as_str()
|
||||||
.unwrap()
|
.unwrap()
|
||||||
.to_string();
|
.to_string();
|
||||||
|
|||||||
@@ -403,7 +403,7 @@ mod tests {
|
|||||||
|
|
||||||
use super::*;
|
use super::*;
|
||||||
use crate::directory::RamDirectory;
|
use crate::directory::RamDirectory;
|
||||||
use crate::schema::{Field, TantivyDocument};
|
use crate::schema::{Field, TantivyDocument, Value};
|
||||||
use crate::store::tests::write_lorem_ipsum_store;
|
use crate::store::tests::write_lorem_ipsum_store;
|
||||||
use crate::store::Compressor;
|
use crate::store::Compressor;
|
||||||
use crate::Directory;
|
use crate::Directory;
|
||||||
@@ -411,7 +411,7 @@ mod tests {
|
|||||||
const BLOCK_SIZE: usize = 16_384;
|
const BLOCK_SIZE: usize = 16_384;
|
||||||
|
|
||||||
fn get_text_field<'a>(doc: &'a TantivyDocument, field: &'a Field) -> Option<&'a str> {
|
fn get_text_field<'a>(doc: &'a TantivyDocument, field: &'a Field) -> Option<&'a str> {
|
||||||
doc.get_first(*field).and_then(|f| f.as_str())
|
doc.get_first(*field).and_then(|f| f.as_value().as_str())
|
||||||
}
|
}
|
||||||
|
|
||||||
#[test]
|
#[test]
|
||||||
|
|||||||
@@ -93,7 +93,7 @@ fn open_fst_index(fst_file: FileSlice) -> io::Result<tantivy_fst::Map<OwnedBytes
|
|||||||
let fst = Fst::new(bytes).map_err(|err| {
|
let fst = Fst::new(bytes).map_err(|err| {
|
||||||
io::Error::new(
|
io::Error::new(
|
||||||
io::ErrorKind::InvalidData,
|
io::ErrorKind::InvalidData,
|
||||||
format!("Fst data is corrupted: {:?}", err),
|
format!("Fst data is corrupted: {err:?}"),
|
||||||
)
|
)
|
||||||
})?;
|
})?;
|
||||||
Ok(tantivy_fst::Map::from(fst))
|
Ok(tantivy_fst::Map::from(fst))
|
||||||
|
|||||||
@@ -95,7 +95,7 @@ fn test_term_dictionary_simple() -> crate::Result<()> {
|
|||||||
#[test]
|
#[test]
|
||||||
fn test_term_dictionary_stream() -> crate::Result<()> {
|
fn test_term_dictionary_stream() -> crate::Result<()> {
|
||||||
let ids: Vec<_> = (0u32..10_000u32)
|
let ids: Vec<_> = (0u32..10_000u32)
|
||||||
.map(|i| (format!("doc{:0>6}", i), i))
|
.map(|i| (format!("doc{i:0>6}"), i))
|
||||||
.collect();
|
.collect();
|
||||||
let buffer: Vec<u8> = {
|
let buffer: Vec<u8> = {
|
||||||
let mut term_dictionary_builder = TermDictionaryBuilder::create(vec![]).unwrap();
|
let mut term_dictionary_builder = TermDictionaryBuilder::create(vec![]).unwrap();
|
||||||
@@ -156,7 +156,7 @@ fn test_stream_high_range_prefix_suffix() -> crate::Result<()> {
|
|||||||
#[test]
|
#[test]
|
||||||
fn test_stream_range() -> crate::Result<()> {
|
fn test_stream_range() -> crate::Result<()> {
|
||||||
let ids: Vec<_> = (0u32..10_000u32)
|
let ids: Vec<_> = (0u32..10_000u32)
|
||||||
.map(|i| (format!("doc{:0>6}", i), i))
|
.map(|i| (format!("doc{i:0>6}"), i))
|
||||||
.collect();
|
.collect();
|
||||||
let buffer: Vec<u8> = {
|
let buffer: Vec<u8> = {
|
||||||
let mut term_dictionary_builder = TermDictionaryBuilder::create(vec![]).unwrap();
|
let mut term_dictionary_builder = TermDictionaryBuilder::create(vec![]).unwrap();
|
||||||
|
|||||||
@@ -96,7 +96,7 @@ mod tests {
|
|||||||
{
|
{
|
||||||
let mut add_token = |token: &Token| {
|
let mut add_token = |token: &Token| {
|
||||||
let facet = Facet::from_encoded(token.text.as_bytes().to_owned()).unwrap();
|
let facet = Facet::from_encoded(token.text.as_bytes().to_owned()).unwrap();
|
||||||
tokens.push(format!("{}", facet));
|
tokens.push(format!("{facet}"));
|
||||||
};
|
};
|
||||||
FacetTokenizer::default()
|
FacetTokenizer::default()
|
||||||
.token_stream(facet.encoded_str())
|
.token_stream(facet.encoded_str())
|
||||||
@@ -116,7 +116,7 @@ mod tests {
|
|||||||
{
|
{
|
||||||
let mut add_token = |token: &Token| {
|
let mut add_token = |token: &Token| {
|
||||||
let facet = Facet::from_encoded(token.text.as_bytes().to_owned()).unwrap(); // ok test
|
let facet = Facet::from_encoded(token.text.as_bytes().to_owned()).unwrap(); // ok test
|
||||||
tokens.push(format!("{}", facet));
|
tokens.push(format!("{facet}"));
|
||||||
};
|
};
|
||||||
FacetTokenizer::default()
|
FacetTokenizer::default()
|
||||||
.token_stream(facet.encoded_str()) // ok test
|
.token_stream(facet.encoded_str()) // ok test
|
||||||
|
|||||||
Reference in New Issue
Block a user