// 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 #include #include #include #include "common/exception.h" #include "common/status.h" #include "gutil/integral_types.h" #include "util/radix_sort.h" #include "vec/core/types.h" #include "vec/functions/function_unary_arithmetic.h" #include "vec/functions/simple_function_factory.h" namespace doris::vectorized { struct NameBitCount { static constexpr auto name = "bit_count"; }; template struct BitCountImpl { // No unsigned type in Java. So we need signed number as return type // Int8_MAX = 127 using ResultType = std::conditional_t= 128, Int16, Int8>; static inline ResultType apply(T a) { if constexpr (std::is_same_v || std::is_same_v || std::is_same_v || std::is_same_v || std::is_same_v) { return std::popcount(static_cast>(a)); } else { throw Exception(ErrorCode::INVALID_ARGUMENT, "bit_count only support using INTEGER as operator"); } } }; using FunctionBitCount = FunctionUnaryArithmetic; void register_function_bit_count(SimpleFunctionFactory& factory) { factory.register_function(); } } // namespace doris::vectorized