this repo has no description
chore: Clean up clippy lints.
Signed-off-by: Andrew Lilley Brinker <alilleybrinker@gmail.com>
authored by
Andrew Lilley Brinker
and committed by
Tangled
17210f89
81a2e666
+22
-19
+21
-18
src/query.rs
+21
-18
src/query.rs
···
1
-
use std::{hash::BuildHasher, collections::{BTreeMap, HashSet}, marker::PhantomData};
1
+
#![allow(dead_code)]
2
+
3
+
use crate::{label::Label, parse::Parser, tag::Tag, TagManager};
4
+
use std::{collections::BTreeMap, hash::BuildHasher, marker::PhantomData};
2
5
use string_interner::backend::Backend as InternerBackend;
3
6
use string_interner::Symbol;
4
-
use crate::{TagManager, label::Label, tag::Tag, parse::Parser};
5
7
6
-
7
-
struct QueryBuilder<
8
-
'm,
9
-
L,
10
-
S,
11
-
T,
12
-
P,
13
-
B,
14
-
H,
15
-
>
8
+
struct QueryBuilder<'m, L, S, T, P, B, H>
16
9
where
17
10
L: Label,
18
11
S: Symbol,
···
25
18
indices: QueryIndices<S>,
26
19
}
27
20
28
-
struct QueryIndices<S> where S: Symbol {
21
+
struct QueryIndices<S>
22
+
where
23
+
S: Symbol,
24
+
{
29
25
plain: PlainIndex<S>,
30
26
key_value: KeyValueIndex<S>,
31
27
multipart: MultipartIndex<S>,
32
28
}
33
29
34
-
struct PlainIndex<S>(Vec<S>) where S: Symbol;
30
+
struct PlainIndex<S>(Vec<S>)
31
+
where
32
+
S: Symbol;
35
33
36
-
struct KeyValueIndex<S>(BTreeMap<S, Vec<S>>) where S: Symbol;
34
+
struct KeyValueIndex<S>(BTreeMap<S, Vec<S>>)
35
+
where
36
+
S: Symbol;
37
37
38
-
struct MultipartIndex<S>(Vec<Trie<S>>) where S: Symbol;
38
+
struct MultipartIndex<S>(Vec<Trie<S>>)
39
+
where
40
+
S: Symbol;
39
41
40
-
struct Trie<S>(PhantomData<S>) where S: Symbol;
41
-
42
+
struct Trie<S>(PhantomData<S>)
43
+
where
44
+
S: Symbol;
42
45
43
46
/*
44
47
The basic design of the query system is: