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.

Sign up for GitHub

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(rust): Add NontemporalArithmeticChunked #17708

Closed
wants to merge 1 commit into from
Closed

feat(rust): Add NontemporalArithmeticChunked #17708

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
1 change: 1 addition & 0 deletions crates/polars-compute/Cargo.toml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,3 +27,4 @@ version_check = { workspace = true }
nightly = []
simd = ["arrow/simd"]
dtype-array = []
nontemporal = []
166 changes: 121 additions & 45 deletions crates/polars-compute/src/arithmetic/float.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,115 +1,191 @@
use arrow::array::PrimitiveArray as PArr;

use super::PrimitiveArithmeticKernelImpl;
use crate::arity::{prim_binary_values, prim_unary_values};
use crate::arity::{prim_binary_values, prim_unary_values, StoreIntrinsic};

macro_rules! impl_float_arith_kernel {
($T:ty) => {
impl PrimitiveArithmeticKernelImpl for $T {
type TrueDivT = $T;

fn prim_wrapping_abs(lhs: PArr<$T>) -> PArr<$T> {
prim_unary_values(lhs, |x| x.abs())
fn prim_wrapping_abs<S: StoreIntrinsic>(lhs: PArr<$T>, s: S) -> PArr<$T> {
prim_unary_values(lhs, |x| x.abs(), s)
}

fn prim_wrapping_neg(lhs: PArr<$T>) -> PArr<$T> {
prim_unary_values(lhs, |x| -x)
fn prim_wrapping_neg<S: StoreIntrinsic>(lhs: PArr<$T>, s: S) -> PArr<$T> {
prim_unary_values(lhs, |x| -x, s)
}

fn prim_wrapping_add(lhs: PArr<$T>, rhs: PArr<$T>) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l + r)
fn prim_wrapping_add<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l + r, s)
}

fn prim_wrapping_sub(lhs: PArr<$T>, rhs: PArr<$T>) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l - r)
fn prim_wrapping_sub<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l - r, s)
}

fn prim_wrapping_mul(lhs: PArr<$T>, rhs: PArr<$T>) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l * r)
fn prim_wrapping_mul<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l * r, s)
}

fn prim_wrapping_floor_div(lhs: PArr<$T>, rhs: PArr<$T>) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| (l / r).floor())
fn prim_wrapping_floor_div<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| (l / r).floor(), s)
}

fn prim_wrapping_trunc_div(lhs: PArr<$T>, rhs: PArr<$T>) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| (l / r).trunc())
fn prim_wrapping_trunc_div<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| (l / r).trunc(), s)
}

fn prim_wrapping_mod(lhs: PArr<$T>, rhs: PArr<$T>) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l - r * (l / r).floor())
fn prim_wrapping_mod<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_binary_values(lhs, rhs, |l, r| l - r * (l / r).floor(), s)
}

fn prim_wrapping_add_scalar(lhs: PArr<$T>, rhs: $T) -> PArr<$T> {
fn prim_wrapping_add_scalar<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: $T,
s: S,
) -> PArr<$T> {
if rhs == 0.0 {
return lhs;
}
prim_unary_values(lhs, |x| x + rhs)
prim_unary_values(lhs, |x| x + rhs, s)
}

fn prim_wrapping_sub_scalar(lhs: PArr<$T>, rhs: $T) -> PArr<$T> {
fn prim_wrapping_sub_scalar<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: $T,
s: S,
) -> PArr<$T> {
if rhs == 0.0 {
return lhs;
}
Self::prim_wrapping_add_scalar(lhs, -rhs)
Self::prim_wrapping_add_scalar(lhs, -rhs, s)
}

fn prim_wrapping_sub_scalar_lhs(lhs: $T, rhs: PArr<$T>) -> PArr<$T> {
fn prim_wrapping_sub_scalar_lhs<S: StoreIntrinsic>(
lhs: $T,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
if lhs == 0.0 {
Self::prim_wrapping_neg(rhs)
Self::prim_wrapping_neg(rhs, s)
} else {
prim_unary_values(rhs, |x| lhs - x)
prim_unary_values(rhs, |x| lhs - x, s)
}
}

fn prim_wrapping_mul_scalar(lhs: PArr<$T>, rhs: $T) -> PArr<$T> {
fn prim_wrapping_mul_scalar<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: $T,
s: S,
) -> PArr<$T> {
// No optimization for multiplication by zero, would invalidate NaNs/infinities.
if rhs == 1.0 {
lhs
} else if rhs == -1.0 {
Self::prim_wrapping_neg(lhs)
Self::prim_wrapping_neg(lhs, s)
} else {
prim_unary_values(lhs, |x| x * rhs)
prim_unary_values(lhs, |x| x * rhs, s)
}
}

fn prim_wrapping_floor_div_scalar(lhs: PArr<$T>, rhs: $T) -> PArr<$T> {
fn prim_wrapping_floor_div_scalar<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: $T,
s: S,
) -> PArr<$T> {
let inv = 1.0 / rhs;
prim_unary_values(lhs, |x| (x * inv).floor())
prim_unary_values(lhs, |x| (x * inv).floor(), s)
}

fn prim_wrapping_floor_div_scalar_lhs(lhs: $T, rhs: PArr<$T>) -> PArr<$T> {
prim_unary_values(rhs, |x| (lhs / x).floor())
fn prim_wrapping_floor_div_scalar_lhs<S: StoreIntrinsic>(
lhs: $T,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_unary_values(rhs, |x| (lhs / x).floor(), s)
}

fn prim_wrapping_trunc_div_scalar(lhs: PArr<$T>, rhs: $T) -> PArr<$T> {
fn prim_wrapping_trunc_div_scalar<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: $T,
s: S,
) -> PArr<$T> {
let inv = 1.0 / rhs;
prim_unary_values(lhs, |x| (x * inv).trunc())
prim_unary_values(lhs, |x| (x * inv).trunc(), s)
}

fn prim_wrapping_trunc_div_scalar_lhs(lhs: $T, rhs: PArr<$T>) -> PArr<$T> {
prim_unary_values(rhs, |x| (lhs / x).trunc())
fn prim_wrapping_trunc_div_scalar_lhs<S: StoreIntrinsic>(
lhs: $T,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_unary_values(rhs, |x| (lhs / x).trunc(), s)
}

fn prim_wrapping_mod_scalar(lhs: PArr<$T>, rhs: $T) -> PArr<$T> {
fn prim_wrapping_mod_scalar<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: $T,
s: S,
) -> PArr<$T> {
let inv = 1.0 / rhs;
prim_unary_values(lhs, |x| x - rhs * (x * inv).floor())
prim_unary_values(lhs, |x| x - rhs * (x * inv).floor(), s)
}

fn prim_wrapping_mod_scalar_lhs(lhs: $T, rhs: PArr<$T>) -> PArr<$T> {
prim_unary_values(rhs, |x| lhs - x * (lhs / x).floor())
fn prim_wrapping_mod_scalar_lhs<S: StoreIntrinsic>(
lhs: $T,
rhs: PArr<$T>,
s: S,
) -> PArr<$T> {
prim_unary_values(rhs, |x| lhs - x * (lhs / x).floor(), s)
}

fn prim_true_div(lhs: PArr<$T>, rhs: PArr<$T>) -> PArr<Self::TrueDivT> {
prim_binary_values(lhs, rhs, |l, r| l / r)
fn prim_true_div<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: PArr<$T>,
s: S,
) -> PArr<Self::TrueDivT> {
prim_binary_values(lhs, rhs, |l, r| l / r, s)
}

fn prim_true_div_scalar(lhs: PArr<$T>, rhs: $T) -> PArr<Self::TrueDivT> {
Self::prim_wrapping_mul_scalar(lhs, 1.0 / rhs)
fn prim_true_div_scalar<S: StoreIntrinsic>(
lhs: PArr<$T>,
rhs: $T,
s: S,
) -> PArr<Self::TrueDivT> {
Self::prim_wrapping_mul_scalar(lhs, 1.0 / rhs, s)
}

fn prim_true_div_scalar_lhs(lhs: $T, rhs: PArr<$T>) -> PArr<Self::TrueDivT> {
prim_unary_values(rhs, |x| lhs / x)
fn prim_true_div_scalar_lhs<S: StoreIntrinsic>(
lhs: $T,
rhs: PArr<$T>,
s: S,
) -> PArr<Self::TrueDivT> {
prim_unary_values(rhs, |x| lhs / x, s)
}
}
};
Expand Down
Loading