rust/tantivy
1
0
Fork 0
mirror of https://github.com/quickwit-oss/tantivy.git synced 2026-01-04 16:22:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix clippy

Browse Source
This commit is contained in:
Pascal Seitz
2021-07-01 18:06:09 +02:00
parent a1ac63ee1c
commit 9b3e508753
10 changed files with 20 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
fastfield_codecs/benches/bench.rs
View File

@@ -27,8 +27,7 @@ mod tests {
}
fn value_iter() -> impl Iterator<Item = u64> {
let data = (0..20_000).collect::<Vec<_>>();
data.into_iter()
0..20_000
}
fn bench_get<S: FastFieldCodecSerializer, R: FastFieldCodecReader>(
b: &mut Bencher,
@@ -38,7 +37,7 @@ mod tests {
S::serialize(
&mut bytes,
&data,
stats_from_vec(&data),
stats_from_vec(data),
data.iter().cloned(),
data.iter().cloned(),
)
@@ -56,7 +55,7 @@ mod tests {
S::serialize(
&mut bytes,
&data,
stats_from_vec(&data),
stats_from_vec(data),
data.iter().cloned(),
data.iter().cloned(),
)

6
fastfield_codecs/src/linearinterpol.rs
View File

@@ -243,7 +243,7 @@ mod tests {
crate::tests::create_and_validate::<
LinearInterpolFastFieldSerializer,
LinearInterpolFastFieldReader,
>(&data, name);
>(data, name);
}
#[test]
@@ -285,9 +285,7 @@ mod tests {
#[test]
fn linear_interpol_fast_field_rand() {
for _ in 0..5000 {
let mut data = (0..50 as usize)
.map(|_| rand::random::<u64>())
.collect::<Vec<_>>();
let mut data = (0..50).map(|_| rand::random::<u64>()).collect::<Vec<_>>();
create_and_validate(&data, "random");
data.reverse();

2
src/collector/multi_collector.rs
View File

@@ -276,7 +276,7 @@ mod tests {
let mut collectors = MultiCollector::new();
let topdocs_handler = collectors.add_collector(TopDocs::with_limit(2));
let count_handler = collectors.add_collector(Count);
let mut multifruits = searcher.search(&query, &mut collectors).unwrap();
let mut multifruits = searcher.search(&query, &collectors).unwrap();
assert_eq!(count_handler.extract(&mut multifruits), 5);
assert_eq!(topdocs_handler.extract(&mut multifruits).len(), 2);

4
src/directory/managed_directory.rs
View File

@@ -402,10 +402,8 @@ mod tests_mmap_specific {
// The file should still be in the list of managed file and
// eventually be deleted once mmap is released.
assert!(managed_directory.garbage_collect(|| living_files).is_ok());
assert!(!managed_directory.exists(test_path1).unwrap());
} else {
assert!(!managed_directory.exists(test_path1).unwrap());
}
assert!(!managed_directory.exists(test_path1).unwrap());
}
#[test]

11
src/postings/mod.rs
View File

@@ -54,7 +54,7 @@ pub mod tests {
use crate::DocId;
use crate::HasLen;
use crate::Score;
use std::{mem};
use std::mem;
#[test]
pub fn test_position_write() -> crate::Result<()> {
@@ -409,7 +409,7 @@ pub mod tests {
.unwrap();
for i in 0..num_docs / 2 - 1 {
assert!(segment_postings.seek(i * 2 + 1) > (i * 1) * 2);
assert!(segment_postings.seek(i * 2 + 1) > i * 2);
assert_eq!(segment_postings.doc(), (i + 1) * 2);
}
}
@@ -431,13 +431,10 @@ pub mod tests {
.read_postings(&term_2, IndexRecordOption::Basic)?
.unwrap();
assert_eq!(segment_postings.seek(i), i);
assert_eq!(segment_postings.doc(), i);
if i % 2 == 0 {
assert_eq!(segment_postings.seek(i), i);
assert_eq!(segment_postings.doc(), i);
assert!(segment_reader.is_deleted(i));
} else {
assert_eq!(segment_postings.seek(i), i);
assert_eq!(segment_postings.doc(), i);
}
}

7
src/postings/stacker/expull.rs
View File

@@ -280,11 +280,8 @@ mod tests {
if v.len() >= 10 {
break;
}
match len_to_capacity(i) {
CapacityResult::NeedAlloc(cap) => {
v.push((i, cap));
}
_ => {}
if let CapacityResult::NeedAlloc(cap) = len_to_capacity(i) {
v.push((i, cap));
}
}
assert_eq!(

4
src/query/more_like_this/query.rs
View File

@@ -260,7 +260,7 @@ mod tests {
.with_document(DocAddress::new(0, 0));
let top_docs = searcher.search(&query, &TopDocs::with_limit(5)).unwrap();
let mut doc_ids: Vec<_> = top_docs.iter().map(|item| item.1.doc_id).collect();
doc_ids.sort();
doc_ids.sort_unstable();
assert_eq!(doc_ids.len(), 3);
assert_eq!(doc_ids, vec![0, 1, 3]);
@@ -276,7 +276,7 @@ mod tests {
.with_document(DocAddress::new(0, 4));
let top_docs = searcher.search(&query, &TopDocs::with_limit(5)).unwrap();
let mut doc_ids: Vec<_> = top_docs.iter().map(|item| item.1.doc_id).collect();
doc_ids.sort();
doc_ids.sort_unstable();
assert_eq!(doc_ids.len(), 2);
assert_eq!(doc_ids, vec![3, 4]);

2
src/schema/field_entry.rs
View File

@@ -317,7 +317,7 @@ mod tests {
assert_eq!("title", field_value.name);
match field_value.field_type {
FieldType::Str(_) => assert!(true),
FieldType::Str(_) => {}
_ => panic!("expected FieldType::Str"),
}
}

7
src/snippet/mod.rs
View File

@@ -301,7 +301,6 @@ mod tests {
use crate::SnippetGenerator;
use maplit::btreemap;
use std::collections::BTreeMap;
use std::iter::Iterator;
const TEST_TEXT: &str = r#"Rust is a systems programming language sponsored by
Mozilla which describes it as a "safe, concurrent, practical language", supporting functional and
@@ -387,7 +386,7 @@ Survey in 2016, 2017, and 2018."#;
assert_eq!(fragments.len(), 1);
{
let first = fragments.iter().nth(0).unwrap();
let first = &fragments[0];
assert_eq!(first.score, 1.0);
assert_eq!(first.start_offset, 4);
assert_eq!(first.stop_offset, 7);
@@ -409,7 +408,7 @@ Survey in 2016, 2017, and 2018."#;
assert_eq!(fragments.len(), 2);
{
let first = fragments.iter().nth(0).unwrap();
let first = &fragments[0];
assert_eq!(first.score, 1.0);
assert_eq!(first.stop_offset, 11);
assert_eq!(first.start_offset, 8);
@@ -432,7 +431,7 @@ Survey in 2016, 2017, and 2018."#;
assert_eq!(fragments.len(), 2);
{
let first = fragments.iter().nth(0).unwrap();
let first = &fragments[0];
assert_eq!(first.score, 0.9);
assert_eq!(first.stop_offset, 7);
assert_eq!(first.start_offset, 0);

3
src/tokenizer/ngram_tokenizer.rs
View File

@@ -437,8 +437,7 @@ mod tests {
#[test]
fn test_stutterring_iterator() {
let rg: Vec<usize> = (0..10).collect();
let mut it = StutteringIterator::new(rg.into_iter(), 1, 2);
let mut it = StutteringIterator::new(0..10, 1, 2);
assert_eq!(it.next(), Some((0, 1)));
assert_eq!(it.next(), Some((0, 2)));
assert_eq!(it.next(), Some((1, 2)));