-
Notifications
You must be signed in to change notification settings - Fork 145
Count and Mean aggregates
#7201
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
Draft
blaginin
wants to merge
2
commits into
develop
Choose a base branch
from
db/count-and-mean
base: develop
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+732
−2
Draft
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or 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 hidden or 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,267 @@ | ||
| // SPDX-License-Identifier: Apache-2.0 | ||
| // SPDX-FileCopyrightText: Copyright the Vortex contributors | ||
|
|
||
| use vortex_error::VortexExpect; | ||
| use vortex_error::VortexResult; | ||
|
|
||
| use crate::ArrayRef; | ||
| use crate::Columnar; | ||
| use crate::ExecutionCtx; | ||
| use crate::aggregate_fn::Accumulator; | ||
| use crate::aggregate_fn::AggregateFnId; | ||
| use crate::aggregate_fn::AggregateFnVTable; | ||
| use crate::aggregate_fn::DynAccumulator; | ||
| use crate::aggregate_fn::EmptyOptions; | ||
| use crate::dtype::DType; | ||
| use crate::dtype::Nullability; | ||
| use crate::dtype::PType; | ||
| use crate::scalar::Scalar; | ||
|
|
||
| /// Return the count of non-null elements in an array. | ||
| /// | ||
| /// See [`Count`] for details. | ||
| pub fn count(array: &ArrayRef, ctx: &mut ExecutionCtx) -> VortexResult<u64> { | ||
| let mut acc = Accumulator::try_new(Count, EmptyOptions, array.dtype().clone())?; | ||
| acc.accumulate(array, ctx)?; | ||
| let result = acc.finish()?; | ||
|
|
||
| Ok(result | ||
| .as_primitive() | ||
| .typed_value::<u64>() | ||
| .vortex_expect("count result should not be null")) | ||
| } | ||
|
|
||
| /// Count the number of non-null elements in an array. | ||
| /// | ||
| /// Applies to all types. Returns a `u64` count. | ||
| /// The identity value is zero. | ||
| #[derive(Clone, Debug)] | ||
| pub struct Count; | ||
|
|
||
| impl AggregateFnVTable for Count { | ||
| type Options = EmptyOptions; | ||
| type Partial = u64; | ||
|
|
||
| fn id(&self) -> AggregateFnId { | ||
| AggregateFnId::new_ref("vortex.count") | ||
| } | ||
|
|
||
| fn serialize(&self, _options: &Self::Options) -> VortexResult<Option<Vec<u8>>> { | ||
| Ok(Some(vec![])) | ||
| } | ||
|
|
||
| fn deserialize( | ||
| &self, | ||
| _metadata: &[u8], | ||
| _session: &vortex_session::VortexSession, | ||
| ) -> VortexResult<Self::Options> { | ||
| Ok(EmptyOptions) | ||
| } | ||
|
|
||
| fn return_dtype(&self, _options: &Self::Options, _input_dtype: &DType) -> Option<DType> { | ||
| Some(DType::Primitive(PType::U64, Nullability::NonNullable)) | ||
| } | ||
|
|
||
| fn partial_dtype(&self, options: &Self::Options, input_dtype: &DType) -> Option<DType> { | ||
| self.return_dtype(options, input_dtype) | ||
| } | ||
|
|
||
| fn empty_partial( | ||
| &self, | ||
| _options: &Self::Options, | ||
| _input_dtype: &DType, | ||
| ) -> VortexResult<Self::Partial> { | ||
| Ok(0u64) | ||
| } | ||
|
|
||
| fn combine_partials(&self, partial: &mut Self::Partial, other: Scalar) -> VortexResult<()> { | ||
| let val = other | ||
| .as_primitive() | ||
| .typed_value::<u64>() | ||
| .vortex_expect("count partial should not be null"); | ||
| *partial += val; | ||
| Ok(()) | ||
| } | ||
|
|
||
| fn to_scalar(&self, partial: &Self::Partial) -> VortexResult<Scalar> { | ||
| Ok(Scalar::primitive(*partial, Nullability::NonNullable)) | ||
| } | ||
|
|
||
| fn reset(&self, partial: &mut Self::Partial) { | ||
| *partial = 0; | ||
| } | ||
|
|
||
| #[inline] | ||
| fn is_saturated(&self, _partial: &Self::Partial) -> bool { | ||
| false | ||
| } | ||
|
|
||
| fn accumulate( | ||
|
Contributor
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. We should be able to register a generic aggregate kernel to reduce count-non-null to be |
||
| &self, | ||
| partial: &mut Self::Partial, | ||
| batch: &Columnar, | ||
| _ctx: &mut ExecutionCtx, | ||
| ) -> VortexResult<()> { | ||
| match batch { | ||
| Columnar::Constant(c) => { | ||
| if !c.scalar().is_null() { | ||
| *partial += c.len() as u64; | ||
| } | ||
| } | ||
| Columnar::Canonical(c) => { | ||
| let valid = c.as_ref().valid_count()?; | ||
| *partial += valid as u64; | ||
| } | ||
| } | ||
| Ok(()) | ||
| } | ||
|
|
||
| fn finalize(&self, partials: ArrayRef) -> VortexResult<ArrayRef> { | ||
| Ok(partials) | ||
| } | ||
|
|
||
| fn finalize_scalar(&self, partial: &Self::Partial) -> VortexResult<Scalar> { | ||
| self.to_scalar(partial) | ||
| } | ||
| } | ||
|
|
||
| #[cfg(test)] | ||
| mod tests { | ||
| use vortex_buffer::buffer; | ||
| use vortex_error::VortexResult; | ||
|
|
||
| use crate::IntoArray; | ||
| use crate::LEGACY_SESSION; | ||
| use crate::VortexSessionExecute; | ||
| use crate::aggregate_fn::Accumulator; | ||
| use crate::aggregate_fn::AggregateFnVTable; | ||
| use crate::aggregate_fn::DynAccumulator; | ||
| use crate::aggregate_fn::EmptyOptions; | ||
| use crate::aggregate_fn::fns::count::Count; | ||
| use crate::aggregate_fn::fns::count::count; | ||
| use crate::arrays::ChunkedArray; | ||
| use crate::arrays::ConstantArray; | ||
| use crate::arrays::PrimitiveArray; | ||
| use crate::dtype::DType; | ||
| use crate::dtype::Nullability; | ||
| use crate::dtype::PType; | ||
| use crate::scalar::Scalar; | ||
| use crate::validity::Validity; | ||
|
|
||
| #[test] | ||
| fn count_all_valid() -> VortexResult<()> { | ||
| let array = | ||
| PrimitiveArray::new(buffer![1i32, 2, 3, 4, 5], Validity::NonNullable).into_array(); | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| assert_eq!(count(&array, &mut ctx)?, 5); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_with_nulls() -> VortexResult<()> { | ||
| let array = PrimitiveArray::from_option_iter([Some(1i32), None, Some(3), None, Some(5)]) | ||
| .into_array(); | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| assert_eq!(count(&array, &mut ctx)?, 3); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_all_null() -> VortexResult<()> { | ||
| let array = PrimitiveArray::from_option_iter::<i32, _>([None, None, None]).into_array(); | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| assert_eq!(count(&array, &mut ctx)?, 0); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_empty() -> VortexResult<()> { | ||
| let dtype = DType::Primitive(PType::I32, Nullability::NonNullable); | ||
| let mut acc = Accumulator::try_new(Count, EmptyOptions, dtype)?; | ||
| let result = acc.finish()?; | ||
| assert_eq!(result.as_primitive().typed_value::<u64>(), Some(0)); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_multi_batch() -> VortexResult<()> { | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| let dtype = DType::Primitive(PType::I32, Nullability::Nullable); | ||
| let mut acc = Accumulator::try_new(Count, EmptyOptions, dtype)?; | ||
|
|
||
| let batch1 = PrimitiveArray::from_option_iter([Some(1i32), None, Some(3)]).into_array(); | ||
| acc.accumulate(&batch1, &mut ctx)?; | ||
|
|
||
| let batch2 = PrimitiveArray::from_option_iter([None, Some(5i32)]).into_array(); | ||
| acc.accumulate(&batch2, &mut ctx)?; | ||
|
|
||
| let result = acc.finish()?; | ||
| assert_eq!(result.as_primitive().typed_value::<u64>(), Some(3)); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_finish_resets_state() -> VortexResult<()> { | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| let dtype = DType::Primitive(PType::I32, Nullability::Nullable); | ||
| let mut acc = Accumulator::try_new(Count, EmptyOptions, dtype)?; | ||
|
|
||
| let batch1 = PrimitiveArray::from_option_iter([Some(1i32), None]).into_array(); | ||
| acc.accumulate(&batch1, &mut ctx)?; | ||
| let result1 = acc.finish()?; | ||
| assert_eq!(result1.as_primitive().typed_value::<u64>(), Some(1)); | ||
|
|
||
| let batch2 = PrimitiveArray::from_option_iter([Some(2i32), Some(3), None]).into_array(); | ||
| acc.accumulate(&batch2, &mut ctx)?; | ||
| let result2 = acc.finish()?; | ||
| assert_eq!(result2.as_primitive().typed_value::<u64>(), Some(2)); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_state_merge() -> VortexResult<()> { | ||
| let dtype = DType::Primitive(PType::I32, Nullability::NonNullable); | ||
| let mut state = Count.empty_partial(&EmptyOptions, &dtype)?; | ||
|
|
||
| let scalar1 = Scalar::primitive(5u64, Nullability::NonNullable); | ||
| Count.combine_partials(&mut state, scalar1)?; | ||
|
|
||
| let scalar2 = Scalar::primitive(3u64, Nullability::NonNullable); | ||
| Count.combine_partials(&mut state, scalar2)?; | ||
|
|
||
| let result = Count.to_scalar(&state)?; | ||
| Count.reset(&mut state); | ||
| assert_eq!(result.as_primitive().typed_value::<u64>(), Some(8)); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_constant_non_null() -> VortexResult<()> { | ||
| let array = ConstantArray::new(42i32, 10); | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| assert_eq!(count(&array.into_array(), &mut ctx)?, 10); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_constant_null() -> VortexResult<()> { | ||
| let array = ConstantArray::new( | ||
| Scalar::null(DType::Primitive(PType::I32, Nullability::Nullable)), | ||
| 10, | ||
| ); | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| assert_eq!(count(&array.into_array(), &mut ctx)?, 0); | ||
| Ok(()) | ||
| } | ||
|
|
||
| #[test] | ||
| fn count_chunked() -> VortexResult<()> { | ||
| let chunk1 = PrimitiveArray::from_option_iter([Some(1i32), None, Some(3)]); | ||
| let chunk2 = PrimitiveArray::from_option_iter([None, Some(5i32), None]); | ||
| let dtype = chunk1.dtype().clone(); | ||
| let chunked = ChunkedArray::try_new(vec![chunk1.into_array(), chunk2.into_array()], dtype)?; | ||
| let mut ctx = LEGACY_SESSION.create_execution_ctx(); | ||
| assert_eq!(count(&chunked.into_array(), &mut ctx)?, 3); | ||
| Ok(()) | ||
| } | ||
| } | ||
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
If this is counting things in an array, should it return a usize?