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
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
145
146
147
148
149
150
151
152

use crate::sealed::Sealed;
use std::marker::PhantomData;

pub type BoxedIterator<'a, T> = Box<dyn Iterator<Item = T> + 'a>;

pub trait Arity: 'static {
    type Container<'a, X: 'a>: 'a;
    type AfterDrop: Arity;
    type AfterOrderedExpansion: Arity;
    type AfterUnorderedExpansion: Arity;

    fn map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Y + 'a,
    ) -> Self::Container<'a, Y>;

    fn filter_map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Option<Y> + 'a,
    ) -> <Self::AfterDrop as Arity>::Container<'a, Y>;

    fn flat_map_ordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterOrderedExpansion as Arity>::Container<'a, Y>;

    fn flat_map_unordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterUnorderedExpansion as Arity>::Container<'a, Y>;
}

pub trait OrderState: Sealed + 'static {}

pub struct Ordered;
pub struct Unordered;

impl Sealed for Ordered {}
impl Sealed for Unordered {}

impl OrderState for Ordered {}

impl OrderState for Unordered {}

pub struct Multiple<O: OrderState>(PhantomData<O>);
pub struct Single;
pub struct Definite;

impl<O: OrderState> Arity for Multiple<O> {
    type AfterDrop = Self;
    type AfterOrderedExpansion = Self;
    type AfterUnorderedExpansion = Multiple<Unordered>;
    type Container<'a, X: 'a> = BoxedIterator<'a, X>;

    fn map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Y + 'a,
    ) -> Self::Container<'a, Y> {
        Box::new(container.map(function))
    }

    fn filter_map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Option<Y> + 'a,
    ) -> <Self::AfterDrop as Arity>::Container<'a, Y> {
        Box::new(container.filter_map(function))
    }

    fn flat_map_ordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterOrderedExpansion as Arity>::Container<'a, Y> {
        Box::new(container.flat_map(function))
    }

    fn flat_map_unordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterUnorderedExpansion as Arity>::Container<'a, Y> {
        Box::new(container.flat_map(function))
    }
}

impl Arity for Single {
    type AfterDrop = Self;
    type AfterOrderedExpansion = Multiple<Ordered>;
    type AfterUnorderedExpansion = Multiple<Unordered>;
    type Container<'a, X: 'a> = Option<X>;

    fn map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Y + 'a,
    ) -> Self::Container<'a, Y> {
        container.map(function)
    }

    fn filter_map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Option<Y> + 'a,
    ) -> <Self::AfterDrop as Arity>::Container<'a, Y> {
        container.and_then(function)
    }

    fn flat_map_ordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterOrderedExpansion as Arity>::Container<'a, Y> {
        Box::new(container.into_iter().flat_map(function))
    }

    fn flat_map_unordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterUnorderedExpansion as Arity>::Container<'a, Y> {
        Box::new(container.into_iter().flat_map(function))
    }
}

impl Arity for Definite {
    type AfterDrop = Single;
    type AfterOrderedExpansion = Multiple<Ordered>;
    type AfterUnorderedExpansion = Multiple<Unordered>;
    type Container<'a, X: 'a> = X;

    fn map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Y + 'a,
    ) -> Self::Container<'a, Y> {
        function(container)
    }

    fn filter_map_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Option<Y> + 'a,
    ) -> <Self::AfterDrop as Arity>::Container<'a, Y> {
        function(container)
    }

    fn flat_map_ordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterOrderedExpansion as Arity>::Container<'a, Y> {
        Box::new(function(container).into_iter())
    }

    fn flat_map_unordered_elements<'a, X: 'a, Y: 'a>(
        container: Self::Container<'a, X>,
        function: impl Fn(X) -> Vec<Y> + 'a,
    ) -> <Self::AfterUnorderedExpansion as Arity>::Container<'a, Y> {
        Box::new(function(container).into_iter())
    }
}