-
Notifications
You must be signed in to change notification settings - Fork 1.2k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
add rank and dense rank and refactor window built in functions
- Loading branch information
Showing
6 changed files
with
318 additions
and
65 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,172 @@ | ||
| // 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. | ||
|
|
||
| //! Defines physical expressions that can evaluated at runtime during query execution | ||
|
|
||
| use crate::error::Result; | ||
| use crate::physical_plan::window_functions::PartitionEvaluator; | ||
| use crate::physical_plan::{window_functions::BuiltInWindowFunctionExpr, PhysicalExpr}; | ||
| use arrow::array::ArrayRef; | ||
| use arrow::array::UInt64Array; | ||
| use arrow::datatypes::{DataType, Field}; | ||
| use arrow::record_batch::RecordBatch; | ||
| use std::any::Any; | ||
| use std::iter; | ||
| use std::ops::Range; | ||
| use std::sync::Arc; | ||
|
|
||
| /// Rank calculates the rank in the window function with order by | ||
| #[derive(Debug)] | ||
| pub struct Rank { | ||
| name: String, | ||
| dense: bool, | ||
| } | ||
|
|
||
| /// Create a rank window function | ||
| pub fn rank(name: String) -> Rank { | ||
| Rank { name, dense: false } | ||
| } | ||
|
|
||
| /// Create a dense rank window function | ||
| pub fn dense_rank(name: String) -> Rank { | ||
| Rank { name, dense: true } | ||
| } | ||
|
|
||
| impl BuiltInWindowFunctionExpr for Rank { | ||
| /// Return a reference to Any that can be used for downcasting | ||
| fn as_any(&self) -> &dyn Any { | ||
| self | ||
| } | ||
|
|
||
| fn field(&self) -> Result<Field> { | ||
| let nullable = false; | ||
| let data_type = DataType::UInt64; | ||
| Ok(Field::new(self.name(), data_type, nullable)) | ||
| } | ||
|
|
||
| fn expressions(&self) -> Vec<Arc<dyn PhysicalExpr>> { | ||
| vec![] | ||
| } | ||
|
|
||
| fn name(&self) -> &str { | ||
| &self.name | ||
| } | ||
|
|
||
| fn create_evaluator( | ||
| &self, | ||
| _batch: &RecordBatch, | ||
| ) -> Result<Box<dyn PartitionEvaluator>> { | ||
| Ok(Box::new(RankEvaluator { dense: self.dense })) | ||
| } | ||
| } | ||
|
|
||
| pub(crate) struct RankEvaluator { | ||
| dense: bool, | ||
| } | ||
|
|
||
| impl PartitionEvaluator for RankEvaluator { | ||
| fn include_rank(&self) -> bool { | ||
| true | ||
| } | ||
|
|
||
| fn evaluate_partition(&self, _partition: Range<usize>) -> Result<ArrayRef> { | ||
| unreachable!("rank evaluation must be called with evaluate_partition_with_rank") | ||
| } | ||
|
|
||
| fn evaluate_partition_with_rank( | ||
| &self, | ||
| _partition: Range<usize>, | ||
| ranks_in_partition: &[Range<usize>], | ||
| ) -> Result<ArrayRef> { | ||
| let result = if self.dense { | ||
| UInt64Array::from_iter_values(ranks_in_partition.iter().zip(1u64..).flat_map( | ||
| |(range, rank)| { | ||
| let len = range.end - range.start; | ||
| iter::repeat(rank).take(len) | ||
| }, | ||
| )) | ||
| } else { | ||
| UInt64Array::from_iter_values( | ||
| ranks_in_partition | ||
| .iter() | ||
| .scan(1_u64, |acc, range| { | ||
| let len = range.end - range.start; | ||
| let result = iter::repeat(*acc).take(len); | ||
| *acc += len as u64; | ||
| Some(result) | ||
| }) | ||
| .flatten(), | ||
| ) | ||
| }; | ||
| Ok(Arc::new(result)) | ||
| } | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod tests { | ||
| use super::*; | ||
| use arrow::{array::*, datatypes::*}; | ||
|
|
||
| fn test_with_rank(expr: &Rank, expected: Vec<u64>) -> Result<()> { | ||
| test_i32_result( | ||
| expr, | ||
| vec![-2, -2, 1, 3, 3, 3, 7, 8], | ||
| vec![0..2, 2..3, 3..6, 6..7, 7..8], | ||
| expected, | ||
| ) | ||
| } | ||
|
|
||
| fn test_without_rank(expr: &Rank, expected: Vec<u64>) -> Result<()> { | ||
| test_i32_result(expr, vec![-2, -2, 1, 3, 3, 3, 7, 8], vec![0..8], expected) | ||
| } | ||
|
|
||
| fn test_i32_result( | ||
| expr: &Rank, | ||
| data: Vec<i32>, | ||
| ranks: Vec<Range<usize>>, | ||
| expected: Vec<u64>, | ||
| ) -> Result<()> { | ||
| let arr: ArrayRef = Arc::new(Int32Array::from(data)); | ||
| let values = vec![arr]; | ||
| let schema = Schema::new(vec![Field::new("arr", DataType::Int32, false)]); | ||
| let batch = RecordBatch::try_new(Arc::new(schema), values.clone())?; | ||
| let result = expr | ||
| .create_evaluator(&batch)? | ||
| .evaluate_with_rank(vec![0..8], ranks)?; | ||
| assert_eq!(1, result.len()); | ||
| let result = result[0].as_any().downcast_ref::<UInt64Array>().unwrap(); | ||
| let result = result.values(); | ||
| assert_eq!(expected, result); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_dense_rank() -> Result<()> { | ||
| let r = dense_rank("arr".into()); | ||
| test_without_rank(&r, vec![1; 8])?; | ||
| test_with_rank(&r, vec![1, 1, 2, 3, 3, 3, 4, 5])?; | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn test_rank() -> Result<()> { | ||
| let r = rank("arr".into()); | ||
| test_without_rank(&r, vec![1; 8])?; | ||
| test_with_rank(&r, vec![1, 1, 3, 4, 4, 4, 7, 8])?; | ||
| Ok(()) | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.