qdrant-edge 0.8.0

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

use std::ops::Deref;

pub struct SortedSlice<'a, T: PartialOrd>(&'a [T]);

impl<'a, T: PartialOrd> SortedSlice<'a, T> {
    pub fn new(slice: &'a [T]) -> Option<Self> {
        if slice.is_sorted() {
            Some(Self(slice))
        } else {
            None
        }
    }

    /// # Safety
    ///
    /// The caller must ensure that the slice is sorted.
    pub unsafe fn new_unchecked(slice: &'a [T]) -> Self {
        debug_assert!(slice.is_sorted());
        Self(slice)
    }
}

impl<T: PartialOrd> Deref for SortedSlice<'_, T> {
    type Target = [T];

    fn deref(&self) -> &Self::Target {
        self.0
    }
}

impl<'a, T: PartialOrd> IntoIterator for &'a SortedSlice<'a, T> {
    type Item = &'a T;
    type IntoIter = std::slice::Iter<'a, T>;

    fn into_iter(self) -> Self::IntoIter {
        self.0.iter()
    }
}