-
Notifications
You must be signed in to change notification settings - Fork 1.3k
/
Copy pathwindow_frame.rs
381 lines (354 loc) · 13.9 KB
/
window_frame.rs
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
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
// Licensed to the Apache Software Foundation (ASF) under one
// or more contributor license agreements. See the NOTICE file
// distributed with this work for additional information
// regarding copyright ownership. The ASF licenses this file
// to you under the Apache License, Version 2.0 (the
// "License"); you may not use this file except in compliance
// with the License. You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing,
// software distributed under the License is distributed on an
// "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
// KIND, either express or implied. See the License for the
// specific language governing permissions and limitations
// under the License.
//! Window frame module
//!
//! The frame-spec determines which output rows are read by an aggregate window function. The frame-spec consists of four parts:
//! - A frame type - either ROWS, RANGE or GROUPS,
//! - A starting frame boundary,
//! - An ending frame boundary,
//! - An EXCLUDE clause.
use datafusion_common::{DataFusionError, Result};
use sqlparser::ast;
use std::cmp::Ordering;
use std::convert::{From, TryFrom};
use std::fmt;
use std::hash::{Hash, Hasher};
/// The frame-spec determines which output rows are read by an aggregate window function.
///
/// The ending frame boundary can be omitted (if the BETWEEN and AND keywords that surround the
/// starting frame boundary are also omitted), in which case the ending frame boundary defaults to
/// CURRENT ROW.
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Hash)]
pub struct WindowFrame {
/// A frame type - either ROWS, RANGE or GROUPS
pub units: WindowFrameUnits,
/// A starting frame boundary
pub start_bound: WindowFrameBound,
/// An ending frame boundary
pub end_bound: WindowFrameBound,
}
impl fmt::Display for WindowFrame {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(
f,
"{} BETWEEN {} AND {}",
self.units, self.start_bound, self.end_bound
)?;
Ok(())
}
}
impl TryFrom<ast::WindowFrame> for WindowFrame {
type Error = DataFusionError;
fn try_from(value: ast::WindowFrame) -> Result<Self> {
let start_bound = value.start_bound.into();
let end_bound = value
.end_bound
.map(WindowFrameBound::from)
.unwrap_or(WindowFrameBound::CurrentRow);
if let WindowFrameBound::Following(None) = start_bound {
Err(DataFusionError::Execution(
"Invalid window frame: start bound cannot be unbounded following"
.to_owned(),
))
} else if let WindowFrameBound::Preceding(None) = end_bound {
Err(DataFusionError::Execution(
"Invalid window frame: end bound cannot be unbounded preceding"
.to_owned(),
))
} else if start_bound > end_bound {
Err(DataFusionError::Execution(format!(
"Invalid window frame: start bound ({}) cannot be larger than end bound ({})",
start_bound, end_bound
)))
} else {
let units = value.units.into();
if units == WindowFrameUnits::Range {
for bound in &[start_bound, end_bound] {
match bound {
WindowFrameBound::Preceding(Some(v))
| WindowFrameBound::Following(Some(v))
if *v > 0 =>
{
Err(DataFusionError::NotImplemented(format!(
"With WindowFrameUnits={}, the bound cannot be {} PRECEDING or FOLLOWING at the moment",
units, v
)))
}
_ => Ok(()),
}?;
}
}
Ok(Self {
units,
start_bound,
end_bound,
})
}
}
}
impl Default for WindowFrame {
fn default() -> Self {
WindowFrame {
units: WindowFrameUnits::Range,
start_bound: WindowFrameBound::Preceding(None),
end_bound: WindowFrameBound::CurrentRow,
}
}
}
/// There are five ways to describe starting and ending frame boundaries:
///
/// 1. UNBOUNDED PRECEDING
/// 2. <expr> PRECEDING
/// 3. CURRENT ROW
/// 4. <expr> FOLLOWING
/// 5. UNBOUNDED FOLLOWING
///
/// in this implementation we'll only allow <expr> to be u64 (i.e. no dynamic boundary)
#[derive(Debug, Clone, Copy, Eq)]
pub enum WindowFrameBound {
/// 1. UNBOUNDED PRECEDING
/// The frame boundary is the first row in the partition.
///
/// 2. <expr> PRECEDING
/// <expr> must be a non-negative constant numeric expression. The boundary is a row that
/// is <expr> "units" prior to the current row.
Preceding(Option<u64>),
/// 3. The current row.
///
/// For RANGE and GROUPS frame types, peers of the current row are also
/// included in the frame, unless specifically excluded by the EXCLUDE clause.
/// This is true regardless of whether CURRENT ROW is used as the starting or ending frame
/// boundary.
CurrentRow,
/// 4. This is the same as "<expr> PRECEDING" except that the boundary is <expr> units after the
/// current rather than before the current row.
///
/// 5. UNBOUNDED FOLLOWING
/// The frame boundary is the last row in the partition.
Following(Option<u64>),
}
impl From<ast::WindowFrameBound> for WindowFrameBound {
fn from(value: ast::WindowFrameBound) -> Self {
match value {
ast::WindowFrameBound::Preceding(v) => Self::Preceding(v),
ast::WindowFrameBound::Following(v) => Self::Following(v),
ast::WindowFrameBound::CurrentRow => Self::CurrentRow,
}
}
}
impl fmt::Display for WindowFrameBound {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self {
WindowFrameBound::CurrentRow => f.write_str("CURRENT ROW"),
WindowFrameBound::Preceding(None) => f.write_str("UNBOUNDED PRECEDING"),
WindowFrameBound::Following(None) => f.write_str("UNBOUNDED FOLLOWING"),
WindowFrameBound::Preceding(Some(n)) => write!(f, "{} PRECEDING", n),
WindowFrameBound::Following(Some(n)) => write!(f, "{} FOLLOWING", n),
}
}
}
impl PartialEq for WindowFrameBound {
fn eq(&self, other: &Self) -> bool {
self.cmp(other) == Ordering::Equal
}
}
impl PartialOrd for WindowFrameBound {
fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
Some(self.cmp(other))
}
}
impl Ord for WindowFrameBound {
fn cmp(&self, other: &Self) -> Ordering {
self.get_rank().cmp(&other.get_rank())
}
}
impl Hash for WindowFrameBound {
fn hash<H: Hasher>(&self, state: &mut H) {
self.get_rank().hash(state)
}
}
impl WindowFrameBound {
/// get the rank of this window frame bound.
///
/// the rank is a tuple of (u8, u64) because we'll firstly compare the kind and then the value
/// which requires special handling e.g. with preceding the larger the value the smaller the
/// rank and also for 0 preceding / following it is the same as current row
fn get_rank(&self) -> (u8, u64) {
match self {
WindowFrameBound::Preceding(None) => (0, 0),
WindowFrameBound::Following(None) => (4, 0),
WindowFrameBound::Preceding(Some(0))
| WindowFrameBound::CurrentRow
| WindowFrameBound::Following(Some(0)) => (2, 0),
WindowFrameBound::Preceding(Some(v)) => (1, u64::MAX - *v),
WindowFrameBound::Following(Some(v)) => (3, *v),
}
}
}
/// There are three frame types: ROWS, GROUPS, and RANGE. The frame type determines how the
/// starting and ending boundaries of the frame are measured.
#[derive(Debug, Clone, Copy, PartialEq, Eq, PartialOrd, Hash)]
pub enum WindowFrameUnits {
/// The ROWS frame type means that the starting and ending boundaries for the frame are
/// determined by counting individual rows relative to the current row.
Rows,
/// The RANGE frame type requires that the ORDER BY clause of the window have exactly one
/// term. Call that term "X". With the RANGE frame type, the elements of the frame are
/// determined by computing the value of expression X for all rows in the partition and framing
/// those rows for which the value of X is within a certain range of the value of X for the
/// current row.
Range,
/// The GROUPS frame type means that the starting and ending boundaries are determine
/// by counting "groups" relative to the current group. A "group" is a set of rows that all have
/// equivalent values for all all terms of the window ORDER BY clause.
Groups,
}
impl fmt::Display for WindowFrameUnits {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
f.write_str(match self {
WindowFrameUnits::Rows => "ROWS",
WindowFrameUnits::Range => "RANGE",
WindowFrameUnits::Groups => "GROUPS",
})
}
}
impl From<ast::WindowFrameUnits> for WindowFrameUnits {
fn from(value: ast::WindowFrameUnits) -> Self {
match value {
ast::WindowFrameUnits::Range => Self::Range,
ast::WindowFrameUnits::Groups => Self::Groups,
ast::WindowFrameUnits::Rows => Self::Rows,
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_window_frame_creation() -> Result<()> {
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Following(None),
end_bound: None,
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: start bound cannot be unbounded following"
.to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(None),
end_bound: Some(ast::WindowFrameBound::Preceding(None)),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: end bound cannot be unbounded preceding"
.to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(Some(1)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(2))),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"Execution error: Invalid window frame: start bound (1 PRECEDING) cannot be larger than end bound (2 PRECEDING)".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Range,
start_bound: ast::WindowFrameBound::Preceding(Some(2)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),
};
let result = WindowFrame::try_from(window_frame);
assert_eq!(
result.err().unwrap().to_string(),
"This feature is not implemented: With WindowFrameUnits=RANGE, the bound cannot be 2 PRECEDING or FOLLOWING at the moment".to_owned()
);
let window_frame = ast::WindowFrame {
units: ast::WindowFrameUnits::Rows,
start_bound: ast::WindowFrameBound::Preceding(Some(2)),
end_bound: Some(ast::WindowFrameBound::Preceding(Some(1))),
};
let result = WindowFrame::try_from(window_frame);
assert!(result.is_ok());
Ok(())
}
#[test]
fn test_eq() {
assert_eq!(
WindowFrameBound::Preceding(Some(0)),
WindowFrameBound::CurrentRow
);
assert_eq!(
WindowFrameBound::CurrentRow,
WindowFrameBound::Following(Some(0))
);
assert_eq!(
WindowFrameBound::Following(Some(2)),
WindowFrameBound::Following(Some(2))
);
assert_eq!(
WindowFrameBound::Following(None),
WindowFrameBound::Following(None)
);
assert_eq!(
WindowFrameBound::Preceding(Some(2)),
WindowFrameBound::Preceding(Some(2))
);
assert_eq!(
WindowFrameBound::Preceding(None),
WindowFrameBound::Preceding(None)
);
}
#[test]
fn test_ord() {
assert!(WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::CurrentRow);
// ! yes this is correct!
assert!(
WindowFrameBound::Preceding(Some(2)) < WindowFrameBound::Preceding(Some(1))
);
assert!(
WindowFrameBound::Preceding(Some(u64::MAX))
< WindowFrameBound::Preceding(Some(u64::MAX - 1))
);
assert!(
WindowFrameBound::Preceding(None)
< WindowFrameBound::Preceding(Some(1000000))
);
assert!(
WindowFrameBound::Preceding(None)
< WindowFrameBound::Preceding(Some(u64::MAX))
);
assert!(WindowFrameBound::Preceding(None) < WindowFrameBound::Following(Some(0)));
assert!(
WindowFrameBound::Preceding(Some(1)) < WindowFrameBound::Following(Some(1))
);
assert!(WindowFrameBound::CurrentRow < WindowFrameBound::Following(Some(1)));
assert!(
WindowFrameBound::Following(Some(1)) < WindowFrameBound::Following(Some(2))
);
assert!(WindowFrameBound::Following(Some(2)) < WindowFrameBound::Following(None));
assert!(
WindowFrameBound::Following(Some(u64::MAX))
< WindowFrameBound::Following(None)
);
}
}