| /** |
| * 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. |
| **/ |
| |
| #include "expressions/aggregation/AggregationHandleMax.hpp" |
| |
| #include <memory> |
| #include <vector> |
| |
| #include "catalog/CatalogTypedefs.hpp" |
| #include "storage/HashTable.hpp" |
| #include "storage/HashTableFactory.hpp" |
| #include "types/Type.hpp" |
| #include "types/TypedValue.hpp" |
| #include "types/containers/ColumnVector.hpp" |
| #include "types/operations/comparisons/Comparison.hpp" |
| #include "types/operations/comparisons/ComparisonFactory.hpp" |
| #include "types/operations/comparisons/ComparisonID.hpp" |
| |
| #include "glog/logging.h" |
| |
| namespace quickstep { |
| |
| class StorageManager; |
| |
| AggregationHandleMax::AggregationHandleMax(const Type &type) |
| : type_(type), block_update_(false) { |
| fast_comparator_.reset( |
| ComparisonFactory::GetComparison(ComparisonID::kGreater) |
| .makeUncheckedComparatorForTypes(type, type.getNonNullableVersion())); |
| } |
| |
| AggregationStateHashTableBase* AggregationHandleMax::createGroupByHashTable( |
| const HashTableImplType hash_table_impl, |
| const std::vector<const Type *> &group_by_types, |
| const std::size_t estimated_num_groups, |
| StorageManager *storage_manager) const { |
| return AggregationStateHashTableFactory<AggregationStateMax>::CreateResizable( |
| hash_table_impl, group_by_types, estimated_num_groups, storage_manager); |
| } |
| |
| AggregationState* AggregationHandleMax::accumulateColumnVectors( |
| const std::vector<std::unique_ptr<ColumnVector>> &column_vectors) const { |
| DCHECK_EQ(1u, column_vectors.size()) |
| << "Got wrong number of ColumnVectors for MAX: " << column_vectors.size(); |
| |
| return new AggregationStateMax(fast_comparator_->accumulateColumnVector( |
| type_.getNullableVersion().makeNullValue(), *column_vectors.front())); |
| } |
| |
| #ifdef QUICKSTEP_ENABLE_VECTOR_COPY_ELISION_SELECTION |
| AggregationState* AggregationHandleMax::accumulateValueAccessor( |
| ValueAccessor *accessor, |
| const std::vector<attribute_id> &accessor_ids) const { |
| DCHECK_EQ(1u, accessor_ids.size()) |
| << "Got wrong number of attributes for MAX: " << accessor_ids.size(); |
| |
| return new AggregationStateMax(fast_comparator_->accumulateValueAccessor( |
| type_.getNullableVersion().makeNullValue(), |
| accessor, |
| accessor_ids.front())); |
| } |
| #endif // QUICKSTEP_ENABLE_VECTOR_COPY_ELISION_SELECTION |
| |
| void AggregationHandleMax::aggregateValueAccessorIntoHashTable( |
| ValueAccessor *accessor, |
| const std::vector<attribute_id> &argument_ids, |
| const std::vector<attribute_id> &group_by_key_ids, |
| AggregationStateHashTableBase *hash_table) const { |
| DCHECK_EQ(1u, argument_ids.size()) |
| << "Got wrong number of arguments for MAX: " << argument_ids.size(); |
| } |
| |
| void AggregationHandleMax::mergeStates(const AggregationState &source, |
| AggregationState *destination) const { |
| const AggregationStateMax &max_source = |
| static_cast<const AggregationStateMax &>(source); |
| AggregationStateMax *max_destination = |
| static_cast<AggregationStateMax *>(destination); |
| |
| if (!max_source.max_.isNull()) { |
| compareAndUpdate(max_destination, max_source.max_); |
| } |
| } |
| |
| void AggregationHandleMax::mergeStatesFast(const std::uint8_t *source, |
| std::uint8_t *destination) const { |
| const TypedValue *src_max_ptr = reinterpret_cast<const TypedValue *>(source); |
| TypedValue *dst_max_ptr = reinterpret_cast<TypedValue *>(destination); |
| if (!(src_max_ptr->isNull())) { |
| compareAndUpdateFast(dst_max_ptr, *src_max_ptr); |
| } |
| } |
| |
| ColumnVector* AggregationHandleMax::finalizeHashTable( |
| const AggregationStateHashTableBase &hash_table, |
| std::vector<std::vector<TypedValue>> *group_by_keys, |
| int index) const { |
| return finalizeHashTableHelperFast<AggregationHandleMax, |
| AggregationStateFastHashTable>( |
| type_.getNullableVersion(), hash_table, group_by_keys, index); |
| } |
| |
| AggregationState* |
| AggregationHandleMax::aggregateOnDistinctifyHashTableForSingle( |
| const AggregationStateHashTableBase &distinctify_hash_table) const { |
| return aggregateOnDistinctifyHashTableForSingleUnaryHelperFast< |
| AggregationHandleMax, |
| AggregationStateMax>(distinctify_hash_table); |
| } |
| |
| void AggregationHandleMax::aggregateOnDistinctifyHashTableForGroupBy( |
| const AggregationStateHashTableBase &distinctify_hash_table, |
| AggregationStateHashTableBase *aggregation_hash_table, |
| std::size_t index) const { |
| aggregateOnDistinctifyHashTableForGroupByUnaryHelperFast< |
| AggregationHandleMax, |
| AggregationStateFastHashTable>( |
| distinctify_hash_table, aggregation_hash_table, index); |
| } |
| |
| } // namespace quickstep |