Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

feat: Implement ANSI support for UnaryMinus #471

Merged
merged 24 commits into from
Jun 3, 2024
Merged
Show file tree
Hide file tree
Changes from 11 commits
Commits
Show all changes
24 commits
Select commit Hold shift + click to select a range
21e4629
checking for invalid inputs for unary minus
vaibhawvipul May 25, 2024
6dac6b1
adding eval mode to expressions and proto message
vaibhawvipul May 26, 2024
546b5e8
extending evaluate function for negative expression
vaibhawvipul May 26, 2024
4d54a12
remove print statements
vaibhawvipul May 26, 2024
8395775
fix format errors
vaibhawvipul May 26, 2024
ffacb98
removing units
vaibhawvipul May 26, 2024
8635451
fix clippy errors
vaibhawvipul May 27, 2024
9675562
expect instead of unwrap, map_err instead of match and removing Float16
vaibhawvipul May 27, 2024
a55deab
adding test case for unary negative integer overflow
vaibhawvipul May 28, 2024
e3d1058
added a function to make the code more readable
vaibhawvipul May 28, 2024
dcd1686
adding comet sql ansi config
vaibhawvipul May 28, 2024
1b345fd
using withTempDir and checkSparkAnswerAndOperator
vaibhawvipul May 28, 2024
6c75611
adding macros to improve code readability
vaibhawvipul May 29, 2024
ed0574f
using withParquetTable
vaibhawvipul May 29, 2024
b4e2380
adding scalar tests
vaibhawvipul May 29, 2024
1327deb
adding more test cases and bug fix
vaibhawvipul May 30, 2024
c39dd58
using failonerror and removing eval_mode
vaibhawvipul May 30, 2024
10f64d6
bug fix
vaibhawvipul May 31, 2024
7a8fd38
removing checks for float64 and monthdaynano
vaibhawvipul May 31, 2024
178345a
removing checks of float and monthday nano
vaibhawvipul May 31, 2024
ec4c23f
adding checks while evalute bounds
vaibhawvipul May 31, 2024
24c48ac
IntervalDayTime splitting i64 and then checking
vaibhawvipul Jun 1, 2024
08840f2
Adding interval test
vaibhawvipul Jun 1, 2024
9973306
fix ci errors
vaibhawvipul Jun 3, 2024
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 3 additions & 0 deletions core/src/errors.rs
Original file line number Diff line number Diff line change
Expand Up @@ -88,6 +88,9 @@ pub enum CometError {
to_type: String,
},

#[error("[ARITHMETIC_OVERFLOW] {from_type} overflow. If necessary set \"spark.sql.ansi.enabled\" to \"true\" to bypass this error.")]
ArithmeticOverflow { from_type: String },

#[error(transparent)]
Arrow {
#[from]
Expand Down
1 change: 1 addition & 0 deletions core/src/execution/datafusion/expressions/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -29,6 +29,7 @@ pub mod avg_decimal;
pub mod bloom_filter_might_contain;
pub mod correlation;
pub mod covariance;
pub mod negative;
pub mod stats;
pub mod stddev;
pub mod strings;
Expand Down
350 changes: 350 additions & 0 deletions core/src/execution/datafusion/expressions/negative.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,350 @@
// 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.

use crate::{errors::CometError, execution::datafusion::expressions::cast::EvalMode};
use arrow::compute::kernels::numeric::neg_wrapping;
use arrow_array::RecordBatch;
use arrow_schema::{DataType, Schema};
use datafusion::{
logical_expr::{interval_arithmetic::Interval, ColumnarValue},
physical_expr::PhysicalExpr,
};
use datafusion_common::{Result, ScalarValue};
use datafusion_physical_expr::{
aggregate::utils::down_cast_any_ref, sort_properties::SortProperties,
};
use std::{
any::Any,
hash::{Hash, Hasher},
sync::Arc,
};

pub fn create_negate_expr(
expr: Arc<dyn PhysicalExpr>,
eval_mode: EvalMode,
) -> Result<Arc<dyn PhysicalExpr>, CometError> {
Ok(Arc::new(NegativeExpr::new(expr, eval_mode)))
}

/// Negative expression
#[derive(Debug, Hash)]
pub struct NegativeExpr {
/// Input expression
arg: Arc<dyn PhysicalExpr>,
eval_mode: EvalMode,
}

fn arithmetic_overflow_error(from_type: &str) -> CometError {
CometError::ArithmeticOverflow {
from_type: from_type.to_string(),
}
}

impl NegativeExpr {
/// Create new not expression
pub fn new(arg: Arc<dyn PhysicalExpr>, eval_mode: EvalMode) -> Self {
Self { arg, eval_mode }
}

/// Get the input expression
pub fn arg(&self) -> &Arc<dyn PhysicalExpr> {
&self.arg
}
}

impl std::fmt::Display for NegativeExpr {
fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result {
write!(f, "(- {})", self.arg)
}
}

impl PhysicalExpr for NegativeExpr {
/// Return a reference to Any that can be used for downcasting
fn as_any(&self) -> &dyn Any {
self
}

fn data_type(&self, input_schema: &Schema) -> Result<DataType> {
self.arg.data_type(input_schema)
}

fn nullable(&self, input_schema: &Schema) -> Result<bool> {
self.arg.nullable(input_schema)
}

fn evaluate(&self, batch: &RecordBatch) -> Result<ColumnarValue> {
let arg = self.arg.evaluate(batch)?;
match arg {
ColumnarValue::Array(array) => {
vaibhawvipul marked this conversation as resolved.
Show resolved Hide resolved
if self.eval_mode == EvalMode::Ansi {
match array.data_type() {
DataType::Int8 => {
let int_array = array
.as_any()
.downcast_ref::<arrow::array::Int8Array>()
.expect("Int8Array");
for i in 0..int_array.len() {
if int_array.value(i) == i8::MIN || int_array.value(i) == i8::MAX {
return Err(arithmetic_overflow_error("integer").into());
}
}
vaibhawvipul marked this conversation as resolved.
Show resolved Hide resolved
}
DataType::Int16 => {
let int_array = array
.as_any()
.downcast_ref::<arrow::array::Int16Array>()
.unwrap();
for i in 0..int_array.len() {
if int_array.value(i) == i16::MIN || int_array.value(i) == i16::MAX
{
return Err(arithmetic_overflow_error("integer").into());
}
}
}
DataType::Int32 => {
let int_array = array
.as_any()
.downcast_ref::<arrow::array::Int32Array>()
.unwrap();
for i in 0..int_array.len() {
if int_array.value(i) == i32::MIN || int_array.value(i) == i32::MAX
{
return Err(arithmetic_overflow_error("integer").into());
}
}
}
DataType::Int64 => {
let int_array = array
.as_any()
.downcast_ref::<arrow::array::Int64Array>()
.unwrap();
for i in 0..int_array.len() {
if int_array.value(i) == i64::MIN || int_array.value(i) == i64::MAX
{
return Err(arithmetic_overflow_error("integer").into());
}
}
}
DataType::Float32 => {
let float_array = array
.as_any()
.downcast_ref::<arrow::array::Float32Array>()
.unwrap();
for i in 0..float_array.len() {
if float_array.value(i) <= f32::MIN
|| float_array.value(i) >= f32::MAX
{
return Err(arithmetic_overflow_error("float").into());
}
}
}
DataType::Float64 => {
let float_array = array
.as_any()
.downcast_ref::<arrow::array::Float64Array>()
.unwrap();
for i in 0..float_array.len() {
if float_array.value(i) <= f64::MIN
|| float_array.value(i) >= f64::MAX
{
return Err(arithmetic_overflow_error("float").into());
}
}
}
DataType::Interval(value) => {
// Downcast the array to the appropriate interval type
match value {
arrow::datatypes::IntervalUnit::YearMonth => {
let interval_array = array
.as_any()
.downcast_ref::<arrow::array::IntervalYearMonthArray>()
.unwrap();
for i in 0..interval_array.len() {
if interval_array.value(i) == i32::MIN
|| interval_array.value(i) == i32::MAX
{
return Err(
arithmetic_overflow_error("interval").into()
);
}
}
}
arrow::datatypes::IntervalUnit::DayTime => {
let interval_array = array
.as_any()
.downcast_ref::<arrow::array::IntervalDayTimeArray>()
.unwrap();
for i in 0..interval_array.len() {
if interval_array.value(i) == i64::MIN
|| interval_array.value(i) == i64::MAX
{
return Err(
arithmetic_overflow_error("interval").into()
);
}
}
}
arrow::datatypes::IntervalUnit::MonthDayNano => {
let interval_array = array
.as_any()
.downcast_ref::<arrow::array::IntervalMonthDayNanoArray>()
.unwrap();
for i in 0..interval_array.len() {
if interval_array.value(i) == i128::MIN
|| interval_array.value(i) == i128::MAX
{
return Err(
arithmetic_overflow_error("interval").into()
);
}
}
}
}
}
_ => {
unimplemented!(
"Overflow error: cannot negate value of type {:?}",
array.data_type()
);
}
}
}
let result = neg_wrapping(array.as_ref())?;
vaibhawvipul marked this conversation as resolved.
Show resolved Hide resolved
Ok(ColumnarValue::Array(result))
}
ColumnarValue::Scalar(scalar) => {
if self.eval_mode == EvalMode::Ansi {
match scalar {
ScalarValue::Int8(value) => {
if value <= Some(i8::MIN) || value >= Some(i8::MAX) {
return Err(arithmetic_overflow_error("integer").into());
}
}
ScalarValue::Int16(value) => {
if value <= Some(i16::MIN) || value >= Some(i16::MAX) {
return Err(arithmetic_overflow_error("integer").into());
}
}
ScalarValue::Int32(value) => {
if value <= Some(i32::MIN) || value >= Some(i32::MAX) {
return Err(arithmetic_overflow_error("integer").into());
}
}
ScalarValue::Int64(value) => {
if value <= Some(i64::MIN) || value >= Some(i64::MAX) {
return Err(arithmetic_overflow_error("integer").into());
}
}
ScalarValue::Float32(value) => {
if value <= Some(f32::MIN) || value >= Some(f32::MAX) {
return Err(arithmetic_overflow_error("float").into());
}
}
ScalarValue::Float64(value) => {
if value <= Some(f64::MIN) || value >= Some(f64::MAX) {
return Err(arithmetic_overflow_error("float").into());
}
}
ScalarValue::IntervalDayTime(value) => {
if value <= Some(i64::MIN) || value >= Some(i64::MAX) {
return Err(arithmetic_overflow_error("interval").into());
}
}
ScalarValue::IntervalYearMonth(value) => {
if value <= Some(i32::MIN) || value >= Some(i32::MAX) {
return Err(arithmetic_overflow_error("interval").into());
}
}
ScalarValue::IntervalMonthDayNano(value) => {
if value <= Some(i128::MIN) || value >= Some(i128::MAX) {
return Err(arithmetic_overflow_error("interval").into());
}
}
_ => {
unimplemented!(
"Overflow error: cannot negate value of type {:?}",
scalar
);
}
}
}
Ok(ColumnarValue::Scalar((scalar.arithmetic_negate())?))
vaibhawvipul marked this conversation as resolved.
Show resolved Hide resolved
}
}
}

fn children(&self) -> Vec<Arc<dyn PhysicalExpr>> {
vec![self.arg.clone()]
}

fn with_new_children(
self: Arc<Self>,
children: Vec<Arc<dyn PhysicalExpr>>,
) -> Result<Arc<dyn PhysicalExpr>> {
Ok(Arc::new(NegativeExpr::new(
children[0].clone(),
self.eval_mode,
)))
}

fn dyn_hash(&self, state: &mut dyn Hasher) {
let mut s = state;
self.hash(&mut s);
}

/// Given the child interval of a NegativeExpr, it calculates the NegativeExpr's interval.
/// It replaces the upper and lower bounds after multiplying them with -1.
/// Ex: `(a, b]` => `[-b, -a)`
fn evaluate_bounds(&self, children: &[&Interval]) -> Result<Interval> {
Interval::try_new(
children[0].upper().arithmetic_negate()?,
children[0].lower().arithmetic_negate()?,
vaibhawvipul marked this conversation as resolved.
Show resolved Hide resolved
)
}

/// Returns a new [`Interval`] of a NegativeExpr that has the existing `interval` given that
/// given the input interval is known to be `children`.
fn propagate_constraints(
&self,
interval: &Interval,
children: &[&Interval],
) -> Result<Option<Vec<Interval>>> {
let child_interval = children[0];
let negated_interval = Interval::try_new(
interval.upper().arithmetic_negate()?,
interval.lower().arithmetic_negate()?,
)?;

Ok(child_interval
.intersect(negated_interval)?
.map(|result| vec![result]))
}

/// The ordering of a [`NegativeExpr`] is simply the reverse of its child.
fn get_ordering(&self, children: &[SortProperties]) -> SortProperties {
-children[0]
}
}

impl PartialEq<dyn Any> for NegativeExpr {
fn eq(&self, other: &dyn Any) -> bool {
down_cast_any_ref(other)
.downcast_ref::<Self>()
.map(|x| self.arg.eq(&x.arg))
.unwrap_or(false)
}
}
Loading
Loading