qdrant-edge 0.7.2

A lightweight, in-process vector search engine designed for embedded devices, autonomous systems, and mobile agents.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144

use std::iter;

/// Variant works similar as Either, but for 4 variants.
pub enum EitherVariant<A, B, C, D> {
    A(A),
    B(B),
    C(C),
    D(D),
}

macro_rules! for_all {
    ($value:expr, $pattern:pat => $result:expr) => {
        match $value {
            $crate::common::either_variant::EitherVariant::A($pattern) => $result,
            $crate::common::either_variant::EitherVariant::B($pattern) => $result,
            $crate::common::either_variant::EitherVariant::C($pattern) => $result,
            $crate::common::either_variant::EitherVariant::D($pattern) => $result,
        }
    };
}

impl<A, B, C, D> Iterator for EitherVariant<A, B, C, D>
where
    A: Iterator,
    B: Iterator<Item = A::Item>,
    C: Iterator<Item = A::Item>,
    D: Iterator<Item = A::Item>,
{
    type Item = A::Item;

    fn next(&mut self) -> Option<Self::Item> {
        for_all!(*self, ref mut inner => inner.next())
    }

    fn size_hint(&self) -> (usize, Option<usize>) {
        for_all!(*self, ref inner => inner.size_hint())
    }

    fn count(self) -> usize {
        for_all!(self, inner => inner.count())
    }

    fn last(self) -> Option<Self::Item> {
        for_all!(self, inner => inner.last())
    }

    fn nth(&mut self, n: usize) -> Option<Self::Item> {
        for_all!(*self, ref mut inner => inner.nth(n))
    }

    fn for_each<F>(self, f: F)
    where
        F: FnMut(Self::Item),
    {
        for_all!(self, inner => inner.for_each(f))
    }

    fn collect<X>(self) -> X
    where
        X: iter::FromIterator<Self::Item>,
    {
        for_all!(self, inner => inner.collect())
    }

    fn partition<X, F>(self, f: F) -> (X, X)
    where
        X: Default + Extend<Self::Item>,
        F: FnMut(&Self::Item) -> bool,
    {
        for_all!(self, inner => inner.partition(f))
    }

    fn fold<Acc, G>(self, init: Acc, f: G) -> Acc
    where
        G: FnMut(Acc, Self::Item) -> Acc,
    {
        for_all!(self, inner => inner.fold(init, f))
    }

    fn all<F>(&mut self, f: F) -> bool
    where
        F: FnMut(Self::Item) -> bool,
    {
        for_all!(*self, ref mut inner => inner.all(f))
    }

    fn any<F>(&mut self, f: F) -> bool
    where
        F: FnMut(Self::Item) -> bool,
    {
        for_all!(*self, ref mut inner => inner.any(f))
    }

    fn find<P>(&mut self, predicate: P) -> Option<Self::Item>
    where
        P: FnMut(&Self::Item) -> bool,
    {
        for_all!(*self, ref mut inner => inner.find(predicate))
    }

    fn find_map<X, F>(&mut self, f: F) -> Option<X>
    where
        F: FnMut(Self::Item) -> Option<X>,
    {
        for_all!(*self, ref mut inner => inner.find_map(f))
    }

    fn position<P>(&mut self, predicate: P) -> Option<usize>
    where
        P: FnMut(Self::Item) -> bool,
    {
        for_all!(*self, ref mut inner => inner.position(predicate))
    }
}

impl<A, B, C, D> DoubleEndedIterator for EitherVariant<A, B, C, D>
where
    A: DoubleEndedIterator,
    B: DoubleEndedIterator<Item = A::Item>,
    C: DoubleEndedIterator<Item = A::Item>,
    D: DoubleEndedIterator<Item = A::Item>,
{
    fn next_back(&mut self) -> Option<Self::Item> {
        for_all!(*self, ref mut inner => inner.next_back())
    }

    fn nth_back(&mut self, n: usize) -> Option<Self::Item> {
        for_all!(*self, ref mut inner => inner.nth_back(n))
    }

    fn rfold<Acc, G>(self, init: Acc, f: G) -> Acc
    where
        G: FnMut(Acc, Self::Item) -> Acc,
    {
        for_all!(self, inner => inner.rfold(init, f))
    }

    fn rfind<P>(&mut self, predicate: P) -> Option<Self::Item>
    where
        P: FnMut(&Self::Item) -> bool,
    {
        for_all!(*self, ref mut inner => inner.rfind(predicate))
    }
}