-
Notifications
You must be signed in to change notification settings - Fork 3.7k
[Feature](function) support split_by_regexp function #38259
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
Merged
Merged
Changes from all commits
Commits
Show all changes
4 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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,378 @@ | ||
| // 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 <fmt/format.h> | ||
| #include <glog/logging.h> | ||
|
|
||
| #include "common/status.h" | ||
| #include "vec/columns/column_array.h" | ||
| #include "vec/columns/column_const.h" | ||
| #include "vec/core/types.h" | ||
| #include "vec/data_types/data_type_array.h" | ||
| #include "vec/data_types/data_type_number.h" | ||
| #include "vec/data_types/data_type_string.h" | ||
| #include "vec/functions/function.h" | ||
| #include "vec/functions/function_string.h" | ||
| #include "vec/functions/simple_function_factory.h" | ||
|
|
||
| namespace doris::vectorized { | ||
|
|
||
| struct Match { | ||
| std::string::size_type offset; | ||
| std::string::size_type length; | ||
| }; | ||
|
|
||
| class RegexpSplit { | ||
| public: | ||
| void init(re2::RE2* re2, int32_t max_splits); | ||
| void set(const char* pos, const char* end); | ||
| bool get(const char*& token_begin, const char*& token_end); | ||
|
|
||
| private: | ||
| const char* _pos; | ||
| const char* _end; | ||
|
|
||
| std::int32_t _max_splits = 0; | ||
| std::vector<Match> _matches; | ||
| int32_t _splits; | ||
| re2::RE2* _re2 = nullptr; | ||
| unsigned _number_of_subpatterns = 0; | ||
|
|
||
| unsigned match(const char* subject, size_t subject_size, std::vector<Match>& matches, | ||
| unsigned limit) const; | ||
| }; | ||
|
|
||
| unsigned RegexpSplit::match(const char* subject, size_t subject_size, std::vector<Match>& matches, | ||
| unsigned limit) const { | ||
| matches.clear(); | ||
|
|
||
| if (limit == 0) { | ||
| return 0; | ||
| } | ||
|
|
||
| limit = std::min(limit, _number_of_subpatterns + 1); | ||
| std::vector<re2::StringPiece> pieces(limit); | ||
|
|
||
| if (!_re2->Match({subject, subject_size}, 0, subject_size, re2::RE2::UNANCHORED, pieces.data(), | ||
| limit)) { | ||
| return 0; | ||
| } else { | ||
| matches.resize(limit); | ||
| for (size_t i = 0; i < limit; ++i) { | ||
| if (pieces[i].empty()) { | ||
| matches[i].offset = std::string::npos; | ||
| matches[i].length = 0; | ||
| } else { | ||
| matches[i].offset = pieces[i].data() - subject; | ||
| matches[i].length = pieces[i].length(); | ||
| } | ||
| } | ||
| return limit; | ||
| } | ||
| } | ||
|
|
||
| void RegexpSplit::init(re2::RE2* re2, int32_t max_splits) { | ||
| _max_splits = max_splits; | ||
| _re2 = re2; | ||
| if (_re2) { | ||
| _number_of_subpatterns = _re2->NumberOfCapturingGroups(); | ||
| } | ||
| } | ||
|
|
||
| // Called for each next string. | ||
| void RegexpSplit::set(const char* pos, const char* end) { | ||
| _pos = pos; | ||
| _end = end; | ||
| _splits = 0; | ||
| } | ||
|
|
||
| // Get the next token, if any, or return false. | ||
| bool RegexpSplit::get(const char*& token_begin, const char*& token_end) { | ||
| if (!_re2) { | ||
| if (_pos == _end) { | ||
| return false; | ||
| } | ||
|
|
||
| token_begin = _pos; | ||
| if (_max_splits != -1) { | ||
| if (_splits == _max_splits - 1) { | ||
| token_end = _end; | ||
| _pos = _end; | ||
| return true; | ||
| } | ||
| } | ||
|
|
||
| _pos += 1; | ||
| token_end = _pos; | ||
| ++_splits; | ||
| } else { | ||
| if (!_pos || _pos > _end) { | ||
| return false; | ||
| } | ||
|
|
||
| token_begin = _pos; | ||
| if (_max_splits != -1) { | ||
| if (_splits == _max_splits - 1) { | ||
| token_end = _end; | ||
| _pos = nullptr; | ||
| return true; | ||
| } | ||
| } | ||
|
|
||
| if (!match(_pos, _end - _pos, _matches, _number_of_subpatterns + 1) || | ||
| !_matches[0].length) { | ||
| token_end = _end; | ||
| _pos = _end + 1; | ||
| } else { | ||
| token_end = _pos + _matches[0].offset; | ||
| _pos = token_end + _matches[0].length; | ||
| ++_splits; | ||
| } | ||
| } | ||
|
|
||
| return true; | ||
| } | ||
|
|
||
| template <typename Impl> | ||
| class SplitByRegexp : public IFunction { | ||
| public: | ||
| static constexpr auto name = "split_by_regexp"; | ||
|
|
||
| static FunctionPtr create() { return std::make_shared<SplitByRegexp>(); } | ||
|
|
||
| String get_name() const override { return name; } | ||
|
|
||
| size_t get_number_of_arguments() const override { | ||
| return get_variadic_argument_types_impl().size(); | ||
| } | ||
|
|
||
| bool is_variadic() const override { return true; } | ||
|
|
||
| DataTypes get_variadic_argument_types_impl() const override { | ||
| return Impl::get_variadic_argument_types(); | ||
| } | ||
|
|
||
| DataTypePtr get_return_type_impl(const DataTypes& arguments) const override { | ||
| DCHECK(is_string(arguments[0])) | ||
| << "first argument for function: " << name << " should be string" | ||
| << " and arguments[0] is " << arguments[0]->get_name(); | ||
| DCHECK(is_string(arguments[1])) | ||
| << "second argument for function: " << name << " should be string" | ||
| << " and arguments[1] is " << arguments[1]->get_name(); | ||
| auto nullable_string_type = make_nullable(std::make_shared<DataTypeString>()); | ||
| return std::make_shared<DataTypeArray>(nullable_string_type); | ||
| } | ||
|
|
||
| Status execute_impl(FunctionContext* context, Block& block, const ColumnNumbers& arguments, | ||
| size_t result, size_t input_rows_count) const override { | ||
| return Impl::execute_impl(context, block, arguments, result, input_rows_count); | ||
| } | ||
| }; | ||
|
|
||
| struct ExecuteImpl { | ||
| using NullMapType = PaddedPODArray<UInt8>; | ||
| static Status execute_impl(FunctionContext* context, Block& block, | ||
| const ColumnNumbers& arguments, size_t result, | ||
| size_t input_rows_count) { | ||
| const auto& [first_column, left_const] = | ||
| unpack_if_const(block.get_by_position(arguments[0]).column); | ||
| const auto& [second_column, right_const] = | ||
| unpack_if_const(block.get_by_position(arguments[1]).column); | ||
| const auto& [three_column, three_is_const] = | ||
| unpack_if_const(block.get_by_position(arguments[2]).column); | ||
| auto limit_value = assert_cast<const ColumnInt32&>(*three_column).get_int(0); | ||
| const auto& src_column = assert_cast<const ColumnString&>(*first_column); | ||
| const auto& pattern_column = assert_cast<const ColumnString&>(*second_column); | ||
|
|
||
| auto nullable_string_type = make_nullable(std::make_shared<DataTypeString>()); | ||
| auto dest_column_ptr = ColumnArray::create(nullable_string_type->create_column(), | ||
| ColumnArray::ColumnOffsets::create()); | ||
| IColumn* dest_nested_column = &dest_column_ptr->get_data(); | ||
| auto& dest_offsets = dest_column_ptr->get_offsets(); | ||
| DCHECK(dest_nested_column != nullptr); | ||
|
|
||
| NullMapType* dest_nested_null_map = nullptr; | ||
| auto* dest_nullable_col = assert_cast<ColumnNullable*>(dest_nested_column); | ||
| auto& dest_column_string = | ||
| assert_cast<ColumnString&>(*(dest_nullable_col->get_nested_column_ptr())); | ||
| dest_nested_null_map = &dest_nullable_col->get_null_map_column().get_data(); | ||
| RE2::Options opts; | ||
| opts.set_never_nl(false); | ||
| opts.set_dot_nl(true); | ||
| // split_by_regexp(ColumnString, "xxx") | ||
| if (right_const) { | ||
| RETURN_IF_ERROR(_execute_constant_pattern( | ||
| src_column, pattern_column.get_data_at(0), dest_column_string, dest_offsets, | ||
| dest_nested_null_map, limit_value, input_rows_count, &opts)); | ||
| } else if (left_const) { | ||
| // split_by_regexp("xxx", ColumnString) | ||
| _execute_constant_src_string(src_column.get_data_at(0), pattern_column, | ||
| dest_column_string, dest_offsets, dest_nested_null_map, | ||
| limit_value, input_rows_count, &opts); | ||
| } else { | ||
| // split_by_regexp(ColumnString, ColumnString) | ||
| _execute_vector_vector(src_column, pattern_column, dest_column_string, dest_offsets, | ||
| dest_nested_null_map, limit_value, input_rows_count, &opts); | ||
| } | ||
|
|
||
| block.replace_by_position(result, std::move(dest_column_ptr)); | ||
| return Status::OK(); | ||
| } | ||
|
|
||
| private: | ||
| static Status _execute_constant_pattern(const ColumnString& src_column_string, | ||
| const StringRef& pattern_ref, | ||
| ColumnString& dest_column_string, | ||
| ColumnArray::Offsets64& dest_offsets, | ||
| NullMapType* dest_nested_null_map, Int64 limit_value, | ||
| size_t input_rows_count, RE2::Options* opts) { | ||
| const char* token_begin = nullptr; | ||
| const char* token_end = nullptr; | ||
| UInt64 index = 0; | ||
| std::unique_ptr<re2::RE2> re2_ptr = nullptr; | ||
| if (pattern_ref.size) { | ||
| re2_ptr = std::make_unique<re2::RE2>(pattern_ref.to_string_view(), *opts); | ||
| } | ||
| if (!re2_ptr->ok()) { | ||
| return Status::RuntimeError("Invalid pattern: {}", pattern_ref.debug_string()); | ||
| } | ||
| RegexpSplit RegexpSplit; | ||
| RegexpSplit.init(re2_ptr.get(), limit_value); | ||
| for (int row = 0; row < input_rows_count; ++row) { | ||
| auto str_data = src_column_string.get_data_at(row); | ||
| RegexpSplit.set(str_data.begin(), str_data.end()); | ||
| while (RegexpSplit.get(token_begin, token_end)) { | ||
| size_t token_size = token_end - token_begin; | ||
| dest_column_string.insert_data(token_begin, token_size); | ||
| dest_nested_null_map->push_back(false); | ||
| index += 1; | ||
| } | ||
| dest_offsets.push_back(index); | ||
| } | ||
| return Status::OK(); | ||
| } | ||
|
|
||
| static void _execute_constant_src_string(const StringRef& str_ref, | ||
| const ColumnString& pattern_column, | ||
| ColumnString& dest_column_string, | ||
| ColumnArray::Offsets64& dest_offsets, | ||
| NullMapType* dest_nested_null_map, Int64 limit_value, | ||
| size_t input_rows_count, RE2::Options* opts) { | ||
| const char* token_begin = nullptr; | ||
| const char* token_end = nullptr; | ||
| UInt64 index = 0; | ||
| RegexpSplit RegexpSplit; | ||
|
|
||
| for (int row = 0; row < input_rows_count; ++row) { | ||
| std::unique_ptr<re2::RE2> re2_ptr = nullptr; | ||
| auto pattern = pattern_column.get_data_at(row); | ||
| if (pattern.size) { | ||
| re2_ptr = std::make_unique<re2::RE2>(pattern.to_string_view(), *opts); | ||
| if (!re2_ptr->ok()) { | ||
| dest_column_string.insert_default(); | ||
| dest_nested_null_map->push_back(true); | ||
| index += 1; | ||
| dest_offsets.push_back(index); | ||
| continue; | ||
| } | ||
| } | ||
|
|
||
| RegexpSplit.init(re2_ptr.get(), limit_value); | ||
| RegexpSplit.set(str_ref.begin(), str_ref.end()); | ||
| while (RegexpSplit.get(token_begin, token_end)) { | ||
| size_t token_size = token_end - token_begin; | ||
| dest_column_string.insert_data(token_begin, token_size); | ||
| dest_nested_null_map->push_back(false); | ||
| index += 1; | ||
| } | ||
| dest_offsets.push_back(index); | ||
| } | ||
| } | ||
|
|
||
| static void _execute_vector_vector(const ColumnString& src_column_string, | ||
| const ColumnString& pattern_column, | ||
| ColumnString& dest_column_string, | ||
| ColumnArray::Offsets64& dest_offsets, | ||
| NullMapType* dest_nested_null_map, Int64 limit_value, | ||
| size_t input_rows_count, RE2::Options* opts) { | ||
| const char* token_begin = nullptr; | ||
| const char* token_end = nullptr; | ||
| UInt64 index = 0; | ||
| RegexpSplit RegexpSplit; | ||
|
|
||
| for (int row = 0; row < input_rows_count; ++row) { | ||
| std::unique_ptr<re2::RE2> re2_ptr = nullptr; | ||
| auto str_data = src_column_string.get_data_at(row); | ||
| auto pattern = pattern_column.get_data_at(row); | ||
| if (pattern.size) { | ||
| re2_ptr = std::make_unique<re2::RE2>(pattern.to_string_view(), *opts); | ||
| if (!re2_ptr->ok()) { | ||
| dest_column_string.insert_default(); | ||
| dest_nested_null_map->push_back(true); | ||
| index += 1; | ||
| dest_offsets.push_back(index); | ||
| continue; | ||
| } | ||
| } | ||
| RegexpSplit.init(re2_ptr.get(), limit_value); | ||
| RegexpSplit.set(str_data.begin(), str_data.end()); | ||
| while (RegexpSplit.get(token_begin, token_end)) { | ||
| size_t token_size = token_end - token_begin; | ||
| dest_column_string.insert_data(token_begin, token_size); | ||
| dest_nested_null_map->push_back(false); | ||
| index += 1; | ||
| } | ||
| dest_offsets.push_back(index); | ||
| } | ||
| } | ||
| }; | ||
|
|
||
| struct TwoArgumentImpl { | ||
| static DataTypes get_variadic_argument_types() { | ||
| return {std::make_shared<DataTypeString>(), std::make_shared<DataTypeString>()}; | ||
| } | ||
|
|
||
| static Status execute_impl(FunctionContext* context, Block& block, | ||
| const ColumnNumbers& arguments, size_t result, | ||
| size_t input_rows_count) { | ||
| DCHECK_EQ(arguments.size(), 2); | ||
| auto max_limit = ColumnConst::create(ColumnInt32::create(1, -1), input_rows_count); | ||
| block.insert({std::move(max_limit), std::make_shared<DataTypeInt32>(), "max_limit"}); | ||
| ColumnNumbers temp_arguments = {arguments[0], arguments[1], block.columns() - 1}; | ||
| return ExecuteImpl::execute_impl(context, block, temp_arguments, result, input_rows_count); | ||
| } | ||
| }; | ||
|
|
||
| struct ThreeArgumentImpl { | ||
| static DataTypes get_variadic_argument_types() { | ||
| return {std::make_shared<DataTypeString>(), std::make_shared<DataTypeString>(), | ||
| std::make_shared<DataTypeInt32>()}; | ||
| } | ||
| static Status execute_impl(FunctionContext* context, Block& block, | ||
| const ColumnNumbers& arguments, size_t result, | ||
| size_t input_rows_count) { | ||
| DCHECK_EQ(arguments.size(), 3); | ||
| return ExecuteImpl::execute_impl(context, block, arguments, result, input_rows_count); | ||
| } | ||
| }; | ||
|
|
||
| void register_function_split_by_regexp(SimpleFunctionFactory& factory) { | ||
| factory.register_function<SplitByRegexp<TwoArgumentImpl>>(); | ||
| factory.register_function<SplitByRegexp<ThreeArgumentImpl>>(); | ||
| } | ||
|
|
||
| } // namespace doris::vectorized | ||
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
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.
Uh oh!
There was an error while loading. Please reload this page.