ClickHouse/dbms/src/Functions/bitWrapperFunc.cpp

45 lines
1.4 KiB
C++
Raw Normal View History

2019-08-01 19:18:36 +00:00
#include <Functions/FunctionFactory.h>
#include <Functions/FunctionUnaryArithmetic.h>
#include <DataTypes/NumberTraits.h>
namespace DB
{
2019-08-04 13:03:38 +00:00
/// Working with UInt8: last bit = can be true, previous = can be false (Like dbms/src/Storages/MergeTree/BoolMask.h).
/// This function wraps bool atomic functions
/// and transforms their boolean return value to the BoolMask ("can be false" and "can be true" bits).
2019-08-01 19:18:36 +00:00
template <typename A>
2019-08-02 19:21:55 +00:00
struct BitWrapperFuncImpl
2019-08-01 19:18:36 +00:00
{
using ResultType = UInt8;
static inline ResultType NO_SANITIZE_UNDEFINED apply(A a)
{
2019-08-02 19:21:55 +00:00
return a == static_cast<UInt8>(0) ? static_cast<ResultType>(0b10) : static_cast<ResultType >(0b1);
2019-08-01 19:18:36 +00:00
}
#if USE_EMBEDDED_COMPILER
static constexpr bool compilable = false;
#endif
};
2019-08-02 19:21:55 +00:00
struct NameBitWrapperFunc { static constexpr auto name = "__bitWrapperFunc"; };
using FunctionBitWrapperFunc = FunctionUnaryArithmetic<BitWrapperFuncImpl, NameBitWrapperFunc, true>;
2019-08-01 19:18:36 +00:00
2019-08-02 19:21:55 +00:00
template <> struct FunctionUnaryArithmeticMonotonicity<NameBitWrapperFunc>
2019-08-01 19:18:36 +00:00
{
static bool has() { return false; }
static IFunction::Monotonicity get(const Field &, const Field &)
{
return {};
}
};
2019-08-02 19:21:55 +00:00
void registerFunctionBitWrapperFunc(FunctionFactory & factory)
2019-08-01 19:18:36 +00:00
{
2019-08-02 19:21:55 +00:00
factory.registerFunction<FunctionBitWrapperFunc>();
2019-08-01 19:18:36 +00:00
}
}