cartel-sqlite 0.22.0

SQLite driver for the dope runtime
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
153
154
155
156
157
158
159

use crate::dsl::{agg, scope::never::Never, write};

pub mod join;

pub struct Filter<T>(Never<T>);
pub struct Rows<T>(Never<T>);
pub struct Cte<T>(Never<T>);
pub struct Select<T>(Never<T>);
pub struct Stream<T>(Never<T>);

impl<T> Filter<T> {
    pub fn rows(self) -> Rows<T> {
        self.0.infer(())
    }

    pub fn count(self) -> i64 {
        self.0.infer(())
    }

    pub fn sum<F, U, R>(self, map: F) -> Option<R>
    where
        F: FnOnce(T) -> U,
    {
        self.0.infer(map)
    }

    pub fn avg<F, U, R>(self, map: F) -> Option<R>
    where
        F: FnOnce(T) -> U,
    {
        self.0.infer(map)
    }

    pub fn min<F, U, R>(self, map: F) -> Option<R>
    where
        F: FnOnce(T) -> U,
    {
        self.0.infer(map)
    }

    pub fn max<F, U, R>(self, map: F) -> Option<R>
    where
        F: FnOnce(T) -> U,
    {
        self.0.infer(map)
    }

    pub fn group_by<F, K>(self, key: F) -> agg::Group<T, K>
    where
        F: FnOnce(T) -> K,
    {
        self.0.infer(key)
    }

    pub fn update<F>(self, change: F) -> write::Update<T>
    where
        F: FnOnce(&mut T),
    {
        self.0.infer(change)
    }

    pub fn delete(self) -> write::Delete<T> {
        self.0.infer(())
    }

    pub fn union(self, other: Self) -> Self {
        self.0.infer(other)
    }

    pub fn union_all(self, other: Self) -> Self {
        self.0.infer(other)
    }

    pub fn intersect(self, other: Self) -> Self {
        self.0.infer(other)
    }

    pub fn except(self, other: Self) -> Self {
        self.0.infer(other)
    }

    pub fn cte(self) -> Cte<T> {
        self.0.infer(())
    }
}

impl<T> Rows<T> {
    pub fn one(self) -> T {
        self.0.infer(())
    }

    pub fn first(self) -> Option<T> {
        self.0.infer(())
    }

    pub fn all(self) -> Vec<T> {
        self.0.infer(())
    }

    pub fn stream(self) -> Stream<T> {
        self.0.infer(())
    }

    pub fn order_by<F, U>(self, key: F) -> Self
    where
        F: FnOnce(T) -> U,
    {
        self.0.infer(key)
    }

    pub fn order_desc<F, U>(self, key: F) -> Self
    where
        F: FnOnce(T) -> U,
    {
        self.0.infer(key)
    }

    pub fn limit(self, count: i64) -> Self {
        self.0.infer(count)
    }

    pub fn offset(self, count: i64) -> Self {
        self.0.infer(count)
    }

    pub fn distinct(self) -> Self {
        self.0.infer(())
    }

    pub fn select<F, R>(self, map: F) -> Select<R>
    where
        F: FnOnce(T) -> R,
    {
        self.0.infer(map)
    }
}

impl<T> Cte<T> {
    pub fn filter<F>(self, pred: F) -> Filter<T>
    where
        F: FnOnce(T) -> bool,
    {
        self.0.infer(pred)
    }
}

impl<T> Select<T> {
    pub fn one(self) -> T {
        self.0.infer(())
    }

    pub fn first(self) -> Option<T> {
        self.0.infer(())
    }

    pub fn all(self) -> Vec<T> {
        self.0.infer(())
    }
}