This is an automated email from the ASF dual-hosted git repository.

lihaopeng pushed a commit to branch master
in repository https://gitbox.apache.org/repos/asf/doris.git


The following commit(s) were added to refs/heads/master by this push:
     new e1831148f2f [feature](function)support bit_test function (#42099)
e1831148f2f is described below

commit e1831148f2f33dac88c791be48a439369f003b36
Author: zhangstar333 <[email protected]>
AuthorDate: Tue Oct 22 16:55:19 2024 +0800

    [feature](function)support bit_test function (#42099)
    
    support bit_test function
    doc: https://github.com/apache/doris-website/pull/1214
---
 be/src/vec/functions/function_bit_test.cpp         | 156 +++++++++++++++++
 be/src/vec/functions/simple_function_factory.h     |   2 +
 .../doris/catalog/BuiltinScalarFunctions.java      |   2 +
 .../expressions/functions/scalar/BitTest.java      |  75 ++++++++
 .../expressions/visitor/ScalarFunctionVisitor.java |   5 +
 gensrc/script/doris_builtins_functions.py          |   7 +-
 .../data/correctness_p0/test_bit_test_function.out | 191 +++++++++++++++++++++
 .../correctness_p0/test_bit_test_function.groovy   |  91 ++++++++++
 8 files changed, 528 insertions(+), 1 deletion(-)

diff --git a/be/src/vec/functions/function_bit_test.cpp 
b/be/src/vec/functions/function_bit_test.cpp
new file mode 100644
index 00000000000..8e010fd9446
--- /dev/null
+++ b/be/src/vec/functions/function_bit_test.cpp
@@ -0,0 +1,156 @@
+// 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 <bit>
+#include <bitset>
+
+#include "common/status.h"
+#include "vec/columns/column.h"
+#include "vec/columns/column_vector.h"
+#include "vec/common/assert_cast.h"
+#include "vec/core/types.h"
+#include "vec/data_types/data_type_number.h"
+#include "vec/functions/cast_type_to_either.h"
+#include "vec/functions/simple_function_factory.h"
+
+namespace doris::vectorized {
+
+class FunctionBitTest : public IFunction {
+public:
+    static constexpr auto name = "bit_test";
+
+    static FunctionPtr create() { return std::make_shared<FunctionBitTest>(); }
+
+    String get_name() const override { return name; }
+
+    size_t get_number_of_arguments() const override { return 0; }
+
+    bool is_variadic() const override { return true; }
+
+    DataTypePtr get_return_type_impl(const DataTypes& arguments) const 
override {
+        return std::make_shared<DataTypeInt8>();
+    }
+
+    Status execute_impl(FunctionContext* context, Block& block, const 
ColumnNumbers& arguments,
+                        size_t result, size_t input_rows_count) const override 
{
+        bool valid =
+                cast_type(block.get_by_position(arguments[0]).type.get(), 
[&](const auto& type) {
+                    using DataType = std::decay_t<decltype(type)>;
+                    using T = typename DataType::FieldType;
+                    if (auto col = check_and_get_column<ColumnVector<T>>(
+                                           
block.get_by_position(arguments[0]).column.get()) ||
+                                   
is_column_const(*block.get_by_position(arguments[0]).column)) {
+                        execute_inner<T>(block, arguments, result, 
input_rows_count);
+                        return true;
+                    }
+                    return false;
+                });
+        if (!valid) {
+            return Status::RuntimeError(
+                    "{}'s argument does not match the expected data type, 
type: {}, column: {}",
+                    get_name(), 
block.get_by_position(arguments[0]).type->get_name(),
+                    
block.get_by_position(arguments[0]).column->dump_structure());
+        }
+        return Status::OK();
+    }
+
+    template <typename F>
+    static bool cast_type(const IDataType* type, F&& f) {
+        return cast_type_to_either<DataTypeInt8, DataTypeInt16, DataTypeInt32, 
DataTypeInt64,
+                                   DataTypeInt128>(type, std::forward<F>(f));
+    }
+
+    template <typename T>
+    void execute_inner(Block& block, const ColumnNumbers& arguments, size_t 
result,
+                       size_t input_rows_count) const {
+        size_t argument_size = arguments.size();
+        std::vector<ColumnPtr> argument_columns(argument_size);
+        auto result_data_column = ColumnInt8::create(input_rows_count, 1);
+        auto& res_data = result_data_column->get_data();
+
+        // maybe most user is bit_test(column, const), so only handle this case
+        if (argument_size == 2) {
+            std::vector<uint8_t> is_consts(argument_size);
+            std::tie(argument_columns[0], is_consts[0]) =
+                    
unpack_if_const(block.get_by_position(arguments[0]).column);
+            std::tie(argument_columns[1], is_consts[1]) =
+                    
unpack_if_const(block.get_by_position(arguments[1]).column);
+            execute_for_two_argument<T>(argument_columns, is_consts, res_data, 
input_rows_count);
+        } else {
+            for (size_t i = 0; i < argument_size; ++i) {
+                argument_columns[i] = block.get_by_position(arguments[i])
+                                              
.column->convert_to_full_column_if_const();
+            }
+            execute_for_others_arg<T>(argument_columns, res_data, 
argument_size, input_rows_count);
+        }
+
+        block.replace_by_position(result, std::move(result_data_column));
+    }
+
+    template <typename T>
+    void execute_for_two_argument(std::vector<ColumnPtr>& argument_columns,
+                                  std::vector<uint8_t>& is_consts, 
ColumnInt8::Container& res_data,
+                                  size_t input_rows_count) const {
+        const auto& first_column_data =
+                assert_cast<const 
ColumnVector<T>&>(*argument_columns[0].get()).get_data();
+        const auto& second_column_data =
+                assert_cast<const 
ColumnVector<T>&>(*argument_columns[1].get()).get_data();
+        for (int i = 0; i < input_rows_count; ++i) {
+            auto first_value = first_column_data[index_check_const(i, 
is_consts[0])];
+            auto second_value = second_column_data[index_check_const(i, 
is_consts[1])];
+            // the pos is invalid, set result = 0
+            if (second_value < 0 || second_value >= sizeof(T) * 8) {
+                res_data[i] = 0;
+                continue;
+            }
+            res_data[i] = ((first_value >> second_value) & 1);
+        }
+    }
+
+    template <typename T>
+    void execute_for_others_arg(std::vector<ColumnPtr>& argument_columns,
+                                ColumnInt8::Container& res_data, size_t 
argument_size,
+                                size_t input_rows_count) const {
+        const auto& first_column_data =
+                assert_cast<const 
ColumnVector<T>&>(*argument_columns[0].get()).get_data();
+        for (int i = 0; i < input_rows_count; ++i) {
+            auto first_value = first_column_data[i];
+            for (int col = 1; col < argument_size; ++col) {
+                const auto& arg_column_data =
+                        assert_cast<const 
ColumnVector<T>&>(*argument_columns[col].get())
+                                .get_data();
+                // the pos is invalid, set result = 0
+                if (arg_column_data[i] < 0 || arg_column_data[i] >= sizeof(T) 
* 8) {
+                    res_data[i] = 0;
+                    break;
+                }
+                // if one of pos & result is 0, could set res = 0, and return 
directly.
+                if (!((first_value >> arg_column_data[i]) & 1)) {
+                    res_data[i] = 0;
+                    break;
+                }
+            }
+        }
+    }
+};
+
+void register_function_bit_test(SimpleFunctionFactory& factory) {
+    factory.register_function<FunctionBitTest>();
+    factory.register_alias("bit_test", "bit_test_all");
+}
+
+} // namespace doris::vectorized
diff --git a/be/src/vec/functions/simple_function_factory.h 
b/be/src/vec/functions/simple_function_factory.h
index e8e54bf84a8..b434fcf2ae3 100644
--- a/be/src/vec/functions/simple_function_factory.h
+++ b/be/src/vec/functions/simple_function_factory.h
@@ -108,6 +108,7 @@ void register_function_ip(SimpleFunctionFactory& factory);
 void register_function_multi_match(SimpleFunctionFactory& factory);
 void register_function_split_by_regexp(SimpleFunctionFactory& factory);
 void register_function_assert_true(SimpleFunctionFactory& factory);
+void register_function_bit_test(SimpleFunctionFactory& factory);
 
 class SimpleFunctionFactory {
     using Creator = std::function<FunctionBuilderPtr()>;
@@ -290,6 +291,7 @@ public:
             register_function_multi_match(instance);
             register_function_split_by_regexp(instance);
             register_function_assert_true(instance);
+            register_function_bit_test(instance);
         });
         return instance;
     }
diff --git 
a/fe/fe-core/src/main/java/org/apache/doris/catalog/BuiltinScalarFunctions.java 
b/fe/fe-core/src/main/java/org/apache/doris/catalog/BuiltinScalarFunctions.java
index 0dd06c1f6fe..76b55f8595d 100644
--- 
a/fe/fe-core/src/main/java/org/apache/doris/catalog/BuiltinScalarFunctions.java
+++ 
b/fe/fe-core/src/main/java/org/apache/doris/catalog/BuiltinScalarFunctions.java
@@ -83,6 +83,7 @@ import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitCount;
 import org.apache.doris.nereids.trees.expressions.functions.scalar.BitLength;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitShiftLeft;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitShiftRight;
+import org.apache.doris.nereids.trees.expressions.functions.scalar.BitTest;
 import org.apache.doris.nereids.trees.expressions.functions.scalar.BitmapAnd;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitmapAndCount;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitmapAndNot;
@@ -578,6 +579,7 @@ public class BuiltinScalarFunctions implements 
FunctionHelper {
             scalar(BitmapXorCount.class, "bitmap_xor_count"),
             scalar(BitShiftLeft.class, "bit_shift_left"),
             scalar(BitShiftRight.class, "bit_shift_right"),
+            scalar(BitTest.class, "bit_test", "bit_test_all"),
             scalar(Cardinality.class, "array_size", "cardinality", "size"),
             scalar(Cbrt.class, "cbrt"),
             scalar(Ceil.class, "ceil", "ceiling"),
diff --git 
a/fe/fe-core/src/main/java/org/apache/doris/nereids/trees/expressions/functions/scalar/BitTest.java
 
b/fe/fe-core/src/main/java/org/apache/doris/nereids/trees/expressions/functions/scalar/BitTest.java
new file mode 100644
index 00000000000..5c32005c126
--- /dev/null
+++ 
b/fe/fe-core/src/main/java/org/apache/doris/nereids/trees/expressions/functions/scalar/BitTest.java
@@ -0,0 +1,75 @@
+// 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.
+
+package org.apache.doris.nereids.trees.expressions.functions.scalar;
+
+import org.apache.doris.catalog.FunctionSignature;
+import org.apache.doris.nereids.trees.expressions.Expression;
+import 
org.apache.doris.nereids.trees.expressions.functions.ExplicitlyCastableSignature;
+import org.apache.doris.nereids.trees.expressions.functions.PropagateNullable;
+import org.apache.doris.nereids.trees.expressions.shape.UnaryExpression;
+import org.apache.doris.nereids.trees.expressions.visitor.ExpressionVisitor;
+import org.apache.doris.nereids.types.BigIntType;
+import org.apache.doris.nereids.types.IntegerType;
+import org.apache.doris.nereids.types.LargeIntType;
+import org.apache.doris.nereids.types.SmallIntType;
+import org.apache.doris.nereids.types.TinyIntType;
+import org.apache.doris.nereids.util.ExpressionUtils;
+
+import com.google.common.base.Preconditions;
+import com.google.common.collect.ImmutableList;
+
+import java.util.List;
+
+/** BitTest function */
+
+public class BitTest extends ScalarFunction
+        implements UnaryExpression, ExplicitlyCastableSignature, 
PropagateNullable {
+    public static final List<FunctionSignature> SIGNATURES = ImmutableList.of(
+            
FunctionSignature.ret(TinyIntType.INSTANCE).varArgs(TinyIntType.INSTANCE, 
TinyIntType.INSTANCE),
+            
FunctionSignature.ret(TinyIntType.INSTANCE).varArgs(SmallIntType.INSTANCE, 
SmallIntType.INSTANCE),
+            
FunctionSignature.ret(TinyIntType.INSTANCE).varArgs(IntegerType.INSTANCE, 
IntegerType.INSTANCE),
+            
FunctionSignature.ret(TinyIntType.INSTANCE).varArgs(LargeIntType.INSTANCE, 
LargeIntType.INSTANCE),
+            
FunctionSignature.ret(TinyIntType.INSTANCE).varArgs(BigIntType.INSTANCE, 
BigIntType.INSTANCE));
+
+    /**
+     * constructor with 2 or more arguments.
+     */
+    public BitTest(Expression arg0, Expression arg1, Expression... varArgs) {
+        super("bit_test", ExpressionUtils.mergeArguments(arg0, arg1, varArgs));
+    }
+
+    /**
+     * withChildren.
+     */
+    @Override
+    public BitTest withChildren(List<Expression> children) {
+        Preconditions.checkArgument(children.size() >= 2);
+        return new BitTest(children.get(0), children.get(1),
+                children.subList(2, children.size()).toArray(new 
Expression[0]));
+    }
+
+    @Override
+    public List<FunctionSignature> getSignatures() {
+        return SIGNATURES;
+    }
+
+    @Override
+    public <R, C> R accept(ExpressionVisitor<R, C> visitor, C context) {
+        return visitor.visitBitTest(this, context);
+    }
+}
diff --git 
a/fe/fe-core/src/main/java/org/apache/doris/nereids/trees/expressions/visitor/ScalarFunctionVisitor.java
 
b/fe/fe-core/src/main/java/org/apache/doris/nereids/trees/expressions/visitor/ScalarFunctionVisitor.java
index c2d1ee370fb..7b03783d78e 100644
--- 
a/fe/fe-core/src/main/java/org/apache/doris/nereids/trees/expressions/visitor/ScalarFunctionVisitor.java
+++ 
b/fe/fe-core/src/main/java/org/apache/doris/nereids/trees/expressions/visitor/ScalarFunctionVisitor.java
@@ -90,6 +90,7 @@ import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitCount;
 import org.apache.doris.nereids.trees.expressions.functions.scalar.BitLength;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitShiftLeft;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitShiftRight;
+import org.apache.doris.nereids.trees.expressions.functions.scalar.BitTest;
 import org.apache.doris.nereids.trees.expressions.functions.scalar.BitmapAnd;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitmapAndCount;
 import 
org.apache.doris.nereids.trees.expressions.functions.scalar.BitmapAndNot;
@@ -869,6 +870,10 @@ public interface ScalarFunctionVisitor<R, C> {
         return visitScalarFunction(bitShiftRight, context);
     }
 
+    default R visitBitTest(BitTest bitTest, C context) {
+        return visitScalarFunction(bitTest, context);
+    }
+
     default R visitCardinality(Cardinality cardinality, C context) {
         return visitScalarFunction(cardinality, context);
     }
diff --git a/gensrc/script/doris_builtins_functions.py 
b/gensrc/script/doris_builtins_functions.py
index 214dc287a50..dc9940b3032 100644
--- a/gensrc/script/doris_builtins_functions.py
+++ b/gensrc/script/doris_builtins_functions.py
@@ -77,7 +77,12 @@ visible_functions = {
         [['bitnot'], 'LARGEINT', ['LARGEINT'], ''],
         
         [['bit_shift_left'],    'BIGINT',   ['BIGINT',  'TINYINT'],     ''],
-        [['bit_shift_right'],   'BIGINT',   ['BIGINT',  'TINYINT'],     '']
+        [['bit_shift_right'],   'BIGINT',   ['BIGINT',  'TINYINT'],     ''],
+        [['bit_test','bit_test_all'], 'TINYINT', ['TINYINT','TINYINT','...'], 
''],
+        [['bit_test','bit_test_all'], 'TINYINT', 
['SMALLINT','SMALLINT','...'], ''],
+        [['bit_test','bit_test_all'], 'TINYINT', ['INT','INT','...'], ''],
+        [['bit_test','bit_test_all'], 'TINYINT', ['BIGINT','BIGINT','...'], 
''],
+        [['bit_test','bit_test_all'], 'TINYINT', 
['LARGEINT','LARGEINT','...'], '']
     ],
 
     # map functions
diff --git a/regression-test/data/correctness_p0/test_bit_test_function.out 
b/regression-test/data/correctness_p0/test_bit_test_function.out
new file mode 100644
index 00000000000..365f4d95921
--- /dev/null
+++ b/regression-test/data/correctness_p0/test_bit_test_function.out
@@ -0,0 +1,191 @@
+-- This file is automatically generated. You should know what you did if you 
want to edit this
+-- !bit_test1 --
+0      0
+1      1
+2      0
+3      1
+4      0
+5      1
+6      0
+7      1
+8      0
+9      1
+
+-- !bit_test2 --
+0      0
+1      1
+2      0
+3      1
+4      0
+5      1
+6      0
+7      1
+8      0
+9      1
+
+-- !bit_test3 --
+0      0
+1      0
+2      1
+3      1
+4      0
+5      0
+6      1
+7      1
+8      0
+9      0
+
+-- !bit_test4 --
+0      0
+1      0
+2      0
+3      1
+4      0
+5      0
+6      0
+7      1
+8      0
+9      0
+
+-- !bit_test5 --
+1
+
+-- !bit_test6 --
+1
+
+-- !bit_test7 --
+1
+
+-- !bit_test8 --
+1
+
+-- !bit_test9 --
+1
+
+-- !bit_test10 --
+0
+
+-- !bit_test11 --
+0
+
+-- !bit_test12 --
+0
+
+-- !bit_test13 --
+0
+
+-- !bit_test14 --
+1
+
+-- !bit_test_TINYINT_MAX --
+1
+
+-- !bit_test_TINYINT_MIN --
+0
+
+-- !bit_test_SMALLINT_MAX --
+1
+
+-- !bit_test_SMALLINT_MIN --
+0
+
+-- !bit_test_INT_MAX --
+1
+
+-- !bit_test_INT_MIN --
+0
+
+-- !bit_test_INT64_MAX --
+1
+
+-- !bit_test_INT64_MIN --
+0
+
+-- !bit_test_INT128_MAX --
+1      1
+
+-- !bit_test_INT128_MIN --
+0      0
+
+-- !select1_const --
+\N
+
+-- !select2_const --
+\N
+
+-- !select3_const --
+\N
+
+-- !select4_const --
+\N
+
+-- !select1_null_null --
+1      1       1       0
+2      \N      1       \N
+3      \N      \N      \N
+4      \N      \N      \N
+5      \N      \N      \N
+
+-- !select2_null_not_null --
+1      1       1       0
+2      \N      1       \N
+3      \N      1       \N
+4      \N      1       \N
+5      \N      2147483647      \N
+
+-- !select3_not_null_not_null --
+1      1       1       0
+2      1       1       0
+3      1       1       0
+4      2147483647      1       1
+5      2147483647      2147483647      0
+
+-- !select4_not_null_null --
+1      1       1       0
+2      1       1       0
+3      1       \N      \N
+4      2147483647      \N      \N
+5      2147483647      \N      \N
+
+-- !select5_null_const --
+1      1       1       0
+2      \N      1       \N
+3      \N      1       \N
+4      \N      1       \N
+5      \N      1       \N
+
+-- !select6_not_null_const --
+1      1       1       0
+2      1       1       0
+3      1       1       0
+4      2147483647      1       1
+5      2147483647      1       1
+
+-- !select7_const_null --
+1      6       1       1
+2      6       1       1
+3      6       \N      \N
+4      6       \N      \N
+5      6       \N      \N
+
+-- !select7_const_not_null --
+1      6       1       1
+2      6       1       1
+3      6       1       1
+4      6       1       1
+5      6       2147483647      0
+
+-- !select7_null_null --
+1      1       1       0
+2      \N      1       \N
+3      \N      \N      \N
+4      \N      \N      \N
+5      \N      \N      \N
+
+-- !select7_not_null_not_null --
+1      1       1       0
+2      1       1       0
+3      1       1       0
+4      2147483647      1       1
+5      2147483647      2147483647      0
+
diff --git 
a/regression-test/suites/correctness_p0/test_bit_test_function.groovy 
b/regression-test/suites/correctness_p0/test_bit_test_function.groovy
new file mode 100644
index 00000000000..6d2ab6da3a2
--- /dev/null
+++ b/regression-test/suites/correctness_p0/test_bit_test_function.groovy
@@ -0,0 +1,91 @@
+// 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.
+
+suite("test_bit_test_function") {
+    qt_bit_test1 'select number,bit_test(number,0) from numbers("number"="10") 
order by 1;'
+    qt_bit_test2 'select number,bit_test_all(number,0) from 
numbers("number"="10") order by 1;'
+    qt_bit_test3 'select number,bit_test_all(number,1) from 
numbers("number"="10") order by 1;'
+    qt_bit_test4 'select number,bit_test(number,0,1) from 
numbers("number"="10") order by 1;'
+    qt_bit_test5 'select bit_test(cast (-1 as tinyint),0);'    
+    qt_bit_test6 'select bit_test(cast (-1 as smallint),1);'   
+    qt_bit_test7 'select bit_test(cast (-1 as int),2);'        
+    qt_bit_test8 'select bit_test(cast (-1 as bigint),3);'    
+    qt_bit_test9 'select bit_test(cast (-1 as largeint),4);'
+    qt_bit_test10 'select bit_test(10,-1);'
+    qt_bit_test11 'select bit_test(100,-2);'
+    qt_bit_test12 'select bit_test(100,1000);'
+    qt_bit_test13 'select bit_test(-43,1);'
+    qt_bit_test14 'select bit_test(-43,2);'
+    qt_bit_test_TINYINT_MAX 'select bit_test(cast (127 as tinyint),2);'        
          // TINYINT_MAX
+    qt_bit_test_TINYINT_MIN 'select bit_test(cast (-128 as tinyint),4);'       
          // TINYINT_MIN
+    qt_bit_test_SMALLINT_MAX 'select bit_test(cast (32767 as smallint),5);'    
          // SMALLINT_MAX
+    qt_bit_test_SMALLINT_MIN 'select bit_test(cast (-32768 as smallint),10);'  
          // SMALLINT_MIN
+    qt_bit_test_INT_MAX 'select bit_test(cast (2147483647 as int),12);'        
          // INT_MAX
+    qt_bit_test_INT_MIN 'select bit_test(cast (-2147483648 as int),11);'       
           // INT_MIN
+    qt_bit_test_INT64_MAX 'select bit_test(cast (9223372036854775807 as 
bigint),12);'    // INT64_MAX
+    qt_bit_test_INT64_MIN 'select bit_test(cast (-9223372036854775808 as 
bigint),12);'   // INT64_MIN
+    // INT128_MAX
+    qt_bit_test_INT128_MAX """
+        select bit_test(170141183460469231731687303715884105727,13),
+               bit_test(cast (170141183460469231731687303715884105727 as 
largeint),13);
+    """
+    // INT128_MIN
+    qt_bit_test_INT128_MIN """
+        select  bit_test(-170141183460469231731687303715884105728,11),
+                bit_test(cast (-170141183460469231731687303715884105728 as 
largeint),11);
+    """
+    // NULL
+    qt_select1_const "select bit_test(NULL,1);"
+    qt_select2_const "select bit_test(1,NULL);"
+    qt_select3_const "select bit_test(NULL,NULL);"
+    qt_select4_const "select bit_test(111,1,2,3,NULL);"
+
+   sql """DROP TABLE IF EXISTS test_bit_test"""
+   sql """ 
+             CREATE TABLE IF NOT EXISTS test_bit_test (
+               `k1` int(11) NULL COMMENT "",
+               `s1` int(20) NULL COMMENT "",
+               `s2` int(20) NOT NULL COMMENT "",
+               `p1` int(20) NULL COMMENT "",
+               `p2` int(20) NOT NULL COMMENT ""
+             ) ENGINE=OLAP
+             DUPLICATE KEY(`k1`)
+             DISTRIBUTED BY HASH(`k1`) BUCKETS 1
+             PROPERTIES (
+             "replication_allocation" = "tag.location.default: 1",
+             "storage_format" = "V2"
+             )
+    """
+    sql """ INSERT INTO test_bit_test VALUES(1, 1, 1, 1, 1); """
+    sql """ INSERT INTO test_bit_test VALUES(2, NULL, 1, 1, 1); """
+    sql """ INSERT INTO test_bit_test VALUES(3, NULL, 1, NULL, 1); """
+    sql """ INSERT INTO test_bit_test VALUES(4, NULL, 2147483647, NULL, 1); """
+    sql """ INSERT INTO test_bit_test VALUES(5, NULL, 2147483647, NULL, 
2147483647); """
+
+    
+    // null and not_null combine
+    qt_select1_null_null "select k1,s1,p1,bit_test(s1, p1) from test_bit_test 
order by k1;"
+    qt_select2_null_not_null "select k1,s1,p2,bit_test(s1, p2) from 
test_bit_test order by k1;"
+    qt_select3_not_null_not_null "select k1,s2,p2,bit_test(s2, p2) from 
test_bit_test order by k1;"
+    qt_select4_not_null_null "select k1,s2,p1,bit_test(s2, p1) from 
test_bit_test order by k1;"
+    qt_select5_null_const "select k1,s1,1,bit_test(s1, 1) from test_bit_test 
order by k1;"
+    qt_select6_not_null_const "select k1,s2,1,bit_test(s2, 1) from 
test_bit_test order by k1;"
+    qt_select7_const_null "select k1,6,p1,bit_test(6, p1) from test_bit_test 
order by k1;"
+    qt_select7_const_not_null "select k1,6,p2,bit_test(6, p2) from 
test_bit_test order by k1;"
+    qt_select7_null_null "select k1,s1,p1,bit_test(s1, p1,1,2,3) from 
test_bit_test order by k1;"
+    qt_select7_not_null_not_null "select k1,s2,p2,bit_test(s2, p2,1,2,3) from 
test_bit_test order by k1;"
+}


---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]

Reply via email to