graphrecords-query 0.5.0

High-performance graph-based data records
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

use crate::{ExpandedIndexOwned, ExpandedIndexReference, IndexDomain, Position};
use graphrecords_core::graphrecord::{EdgeIndex, GraphRecordAttribute, GraphRecordValue};

pub trait EnsureSortable: PartialOrd + Sized {
    fn find_incomparable<'a>(values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)>
    where
        Self: 'a;
}

pub fn incomparable_with_first<'a, V: PartialOrd + 'a>(
    mut values: impl Iterator<Item = &'a V>,
) -> Option<(usize, usize)> {
    let first = values.next()?;

    values
        .position(|value| value.partial_cmp(first).is_none())
        .map(|position| (0, position + 1))
}

pub fn incomparable_pair<'a, V: PartialOrd + 'a>(
    values: impl Iterator<Item = &'a V>,
) -> Option<(usize, usize)> {
    let values: Vec<_> = values.collect();

    for first_position in 0..values.len() {
        for second_position in (first_position + 1)..values.len() {
            if values[first_position]
                .partial_cmp(values[second_position])
                .is_none()
            {
                return Some((first_position, second_position));
            }
        }
    }

    None
}

impl<T: EnsureSortable> EnsureSortable for &T {
    fn find_incomparable<'a>(values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)>
    where
        Self: 'a,
    {
        T::find_incomparable(values.copied())
    }
}

impl EnsureSortable for GraphRecordValue {
    fn find_incomparable<'a>(values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)> {
        incomparable_with_first(values)
    }
}

impl EnsureSortable for GraphRecordAttribute {
    fn find_incomparable<'a>(values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)> {
        incomparable_with_first(values)
    }
}

impl EnsureSortable for bool {
    fn find_incomparable<'a>(_values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)> {
        None
    }
}

impl EnsureSortable for Position {
    fn find_incomparable<'a>(_values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)> {
        None
    }
}

impl EnsureSortable for EdgeIndex {
    fn find_incomparable<'a>(_values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)> {
        None
    }
}

impl<P, C> EnsureSortable for ExpandedIndexOwned<P, C>
where
    P: IndexDomain,
    C: IndexDomain,
    P::Owned: EnsureSortable,
    C::Owned: EnsureSortable,
{
    fn find_incomparable<'a>(values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)>
    where
        Self: 'a,
    {
        incomparable_pair(values)
    }
}

impl<'index, P, C> EnsureSortable for ExpandedIndexReference<'index, P, C>
where
    P: IndexDomain,
    C: IndexDomain,
    P::Index<'index>: EnsureSortable,
    C::Index<'index>: EnsureSortable,
{
    fn find_incomparable<'a>(values: impl Iterator<Item = &'a Self>) -> Option<(usize, usize)>
    where
        Self: 'a,
    {
        incomparable_pair(values)
    }
}