| // 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 "vec/functions/match.h" |
| |
| #include <hs/hs.h> |
| |
| #include "olap/rowset/segment_v2/inverted_index/analyzer/analyzer.h" |
| #include "runtime/query_context.h" |
| #include "runtime/runtime_state.h" |
| #include "util/debug_points.h" |
| |
| namespace doris::vectorized { |
| Status FunctionMatchBase::evaluate_inverted_index( |
| const ColumnsWithTypeAndName& arguments, |
| const std::vector<vectorized::IndexFieldNameAndTypePair>& data_type_with_names, |
| std::vector<segment_v2::IndexIterator*> iterators, uint32_t num_rows, |
| segment_v2::InvertedIndexResultBitmap& bitmap_result) const { |
| DCHECK(arguments.size() == 1); |
| DCHECK(data_type_with_names.size() == 1); |
| DCHECK(iterators.size() == 1); |
| auto* iter = iterators[0]; |
| auto data_type_with_name = data_type_with_names[0]; |
| if (iter == nullptr) { |
| return Status::OK(); |
| } |
| const std::string& function_name = get_name(); |
| |
| if (function_name == MATCH_PHRASE_FUNCTION || function_name == MATCH_PHRASE_PREFIX_FUNCTION || |
| function_name == MATCH_PHRASE_EDGE_FUNCTION) { |
| if (iter->get_reader()->is_fulltext_index() && !iter->get_reader()->is_support_phrase()) { |
| return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>( |
| "phrase queries require setting support_phrase = true"); |
| } |
| } |
| Field param_value; |
| arguments[0].column->get(0, param_value); |
| if (param_value.is_null()) { |
| // if query value is null, skip evaluate inverted index |
| return Status::OK(); |
| } |
| auto param_type = arguments[0].type->get_primitive_type(); |
| if (!is_string_type(param_type)) { |
| return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>( |
| "arguments for match must be string"); |
| } |
| std::unique_ptr<InvertedIndexQueryParamFactory> query_param = nullptr; |
| RETURN_IF_ERROR(InvertedIndexQueryParamFactory::create_query_value(param_type, ¶m_value, |
| query_param)); |
| |
| InvertedIndexParam param; |
| param.column_name = data_type_with_name.first; |
| param.query_value = query_param->get_value(); |
| param.query_type = get_query_type_from_fn_name(); |
| param.num_rows = num_rows; |
| param.roaring = std::make_shared<roaring::Roaring>(); |
| if (is_string_type(param_type)) { |
| RETURN_IF_ERROR(iter->read_from_index(¶m)); |
| } else { |
| return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>( |
| "invalid params type for FunctionMatchBase::evaluate_inverted_index {}", |
| param_type); |
| } |
| std::shared_ptr<roaring::Roaring> null_bitmap = std::make_shared<roaring::Roaring>(); |
| if (iter->has_null()) { |
| segment_v2::InvertedIndexQueryCacheHandle null_bitmap_cache_handle; |
| RETURN_IF_ERROR(iter->read_null_bitmap(&null_bitmap_cache_handle)); |
| null_bitmap = null_bitmap_cache_handle.get_bitmap(); |
| } |
| segment_v2::InvertedIndexResultBitmap result(param.roaring, null_bitmap); |
| bitmap_result = result; |
| bitmap_result.mask_out_null(); |
| |
| return Status::OK(); |
| } |
| Status FunctionMatchBase::execute_impl(FunctionContext* context, Block& block, |
| const ColumnNumbers& arguments, uint32_t result, |
| size_t input_rows_count) const { |
| ColumnPtr& column_ptr = block.get_by_position(arguments[1]).column; |
| DataTypePtr& type_ptr = block.get_by_position(arguments[1]).type; |
| auto match_query_str = type_ptr->to_string(*column_ptr, 0); |
| std::string column_name = block.get_by_position(arguments[0]).name; |
| VLOG_DEBUG << "begin to execute match directly, column_name=" << column_name |
| << ", match_query_str=" << match_query_str; |
| InvertedIndexCtx* inverted_index_ctx = reinterpret_cast<InvertedIndexCtx*>( |
| context->get_function_state(FunctionContext::THREAD_LOCAL)); |
| if (inverted_index_ctx == nullptr) { |
| inverted_index_ctx = reinterpret_cast<InvertedIndexCtx*>( |
| context->get_function_state(FunctionContext::FRAGMENT_LOCAL)); |
| } |
| |
| const ColumnPtr source_col = |
| block.get_by_position(arguments[0]).column->convert_to_full_column_if_const(); |
| const auto* values = check_and_get_column<ColumnString>(source_col.get()); |
| const ColumnArray* array_col = nullptr; |
| if (is_column<vectorized::ColumnArray>(source_col.get())) { |
| array_col = check_and_get_column<ColumnArray>(source_col.get()); |
| if (array_col && !array_col->get_data().is_column_string()) { |
| return Status::NotSupported(fmt::format( |
| "unsupported nested array of type {} for function {}", |
| is_column_nullable(array_col->get_data()) ? array_col->get_data().get_name() |
| : array_col->get_data().get_name(), |
| get_name())); |
| } |
| |
| if (is_column_nullable(array_col->get_data())) { |
| const auto& array_nested_null_column = |
| reinterpret_cast<const ColumnNullable&>(array_col->get_data()); |
| values = check_and_get_column<ColumnString>( |
| *(array_nested_null_column.get_nested_column_ptr())); |
| } else { |
| // array column element is always set Nullable for now. |
| values = check_and_get_column<ColumnString>(*(array_col->get_data_ptr())); |
| } |
| } else if (auto* nullable = check_and_get_column<ColumnNullable>(source_col.get())) { |
| values = check_and_get_column<ColumnString>(*nullable->get_nested_column_ptr()); |
| } |
| |
| if (!values) { |
| LOG(WARNING) << "Illegal column " << source_col->get_name(); |
| return Status::InternalError("Not supported input column types"); |
| } |
| // result column |
| auto res = ColumnUInt8::create(); |
| ColumnUInt8::Container& vec_res = res->get_data(); |
| // set default value to 0, and match functions only need to set 1/true |
| vec_res.resize_fill(input_rows_count); |
| RETURN_IF_ERROR(execute_match(context, column_name, match_query_str, input_rows_count, values, |
| inverted_index_ctx, |
| (array_col ? &(array_col->get_offsets()) : nullptr), vec_res)); |
| block.replace_by_position(result, std::move(res)); |
| |
| return Status::OK(); |
| } |
| |
| inline doris::segment_v2::InvertedIndexQueryType FunctionMatchBase::get_query_type_from_fn_name() |
| const { |
| std::string fn_name = get_name(); |
| if (fn_name == MATCH_ANY_FUNCTION) { |
| return doris::segment_v2::InvertedIndexQueryType::MATCH_ANY_QUERY; |
| } else if (fn_name == MATCH_ALL_FUNCTION) { |
| return doris::segment_v2::InvertedIndexQueryType::MATCH_ALL_QUERY; |
| } else if (fn_name == MATCH_PHRASE_FUNCTION) { |
| return doris::segment_v2::InvertedIndexQueryType::MATCH_PHRASE_QUERY; |
| } else if (fn_name == MATCH_PHRASE_PREFIX_FUNCTION) { |
| return doris::segment_v2::InvertedIndexQueryType::MATCH_PHRASE_PREFIX_QUERY; |
| } else if (fn_name == MATCH_PHRASE_REGEXP_FUNCTION) { |
| return doris::segment_v2::InvertedIndexQueryType::MATCH_REGEXP_QUERY; |
| } else if (fn_name == MATCH_PHRASE_EDGE_FUNCTION) { |
| return doris::segment_v2::InvertedIndexQueryType::MATCH_PHRASE_EDGE_QUERY; |
| } |
| return doris::segment_v2::InvertedIndexQueryType::UNKNOWN_QUERY; |
| } |
| |
| std::vector<std::string> FunctionMatchBase::analyse_query_str_token( |
| InvertedIndexCtx* inverted_index_ctx, const std::string& match_query_str, |
| const std::string& column_name) const { |
| VLOG_DEBUG << "begin to run " << get_name() << ", parser_type: " |
| << inverted_index_parser_type_to_string(inverted_index_ctx->parser_type); |
| std::vector<std::string> query_tokens; |
| if (inverted_index_ctx == nullptr) { |
| return query_tokens; |
| } |
| if (inverted_index_ctx->parser_type == InvertedIndexParserType::PARSER_NONE) { |
| query_tokens.emplace_back(match_query_str); |
| return query_tokens; |
| } |
| auto reader = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::create_reader( |
| inverted_index_ctx->char_filter_map); |
| reader->init(match_query_str.data(), match_query_str.size(), true); |
| query_tokens = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::get_analyse_result( |
| reader.get(), inverted_index_ctx->analyzer, column_name, get_query_type_from_fn_name()); |
| return query_tokens; |
| } |
| |
| inline std::vector<std::string> FunctionMatchBase::analyse_data_token( |
| const std::string& column_name, InvertedIndexCtx* inverted_index_ctx, |
| const ColumnString* string_col, int32_t current_block_row_idx, |
| const ColumnArray::Offsets64* array_offsets, int32_t& current_src_array_offset) const { |
| std::vector<std::string> data_tokens; |
| auto query_type = get_query_type_from_fn_name(); |
| if (array_offsets) { |
| for (auto next_src_array_offset = (*array_offsets)[current_block_row_idx]; |
| current_src_array_offset < next_src_array_offset; ++current_src_array_offset) { |
| const auto& str_ref = string_col->get_data_at(current_src_array_offset); |
| if (inverted_index_ctx->parser_type == InvertedIndexParserType::PARSER_NONE) { |
| data_tokens.emplace_back(str_ref.to_string()); |
| continue; |
| } |
| auto reader = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::create_reader( |
| inverted_index_ctx->char_filter_map); |
| reader->init(str_ref.data, str_ref.size, true); |
| |
| std::vector<std::string> element_tokens = |
| doris::segment_v2::inverted_index::InvertedIndexAnalyzer::get_analyse_result( |
| reader.get(), inverted_index_ctx->analyzer, column_name, query_type, |
| false); |
| data_tokens.insert(data_tokens.end(), element_tokens.begin(), element_tokens.end()); |
| } |
| } else { |
| const auto& str_ref = string_col->get_data_at(current_block_row_idx); |
| if (inverted_index_ctx->parser_type == InvertedIndexParserType::PARSER_NONE) { |
| data_tokens.emplace_back(str_ref.to_string()); |
| } else { |
| auto reader = doris::segment_v2::inverted_index::InvertedIndexAnalyzer::create_reader( |
| inverted_index_ctx->char_filter_map); |
| reader->init(str_ref.data, str_ref.size, true); |
| data_tokens = |
| doris::segment_v2::inverted_index::InvertedIndexAnalyzer::get_analyse_result( |
| reader.get(), inverted_index_ctx->analyzer, column_name, query_type, |
| false); |
| } |
| } |
| return data_tokens; |
| } |
| |
| Status FunctionMatchBase::check(FunctionContext* context, const std::string& function_name) const { |
| if (!context->state()->query_options().enable_match_without_inverted_index) { |
| return Status::Error<ErrorCode::INVERTED_INDEX_NOT_SUPPORTED>( |
| "{} not support execute_match", function_name); |
| } |
| |
| DBUG_EXECUTE_IF("match.invert_index_not_support_execute_match", { |
| return Status::Error<ErrorCode::INVERTED_INDEX_NOT_SUPPORTED>( |
| "debug point: {} not support execute_match", function_name); |
| }); |
| |
| return Status::OK(); |
| } |
| |
| Status FunctionMatchAny::execute_match(FunctionContext* context, const std::string& column_name, |
| const std::string& match_query_str, size_t input_rows_count, |
| const ColumnString* string_col, |
| InvertedIndexCtx* inverted_index_ctx, |
| const ColumnArray::Offsets64* array_offsets, |
| ColumnUInt8::Container& result) const { |
| RETURN_IF_ERROR(check(context, name)); |
| |
| std::vector<std::string> query_tokens = |
| analyse_query_str_token(inverted_index_ctx, match_query_str, column_name); |
| if (query_tokens.empty()) { |
| VLOG_DEBUG << fmt::format( |
| "token parser result is empty for query, " |
| "please check your query: '{}' and index parser: '{}'", |
| match_query_str, |
| inverted_index_parser_type_to_string(inverted_index_ctx->parser_type)); |
| return Status::OK(); |
| } |
| |
| auto current_src_array_offset = 0; |
| for (int i = 0; i < input_rows_count; i++) { |
| std::vector<std::string> data_tokens = |
| analyse_data_token(column_name, inverted_index_ctx, string_col, i, array_offsets, |
| current_src_array_offset); |
| |
| // TODO: more efficient impl |
| for (auto& token : query_tokens) { |
| auto it = std::find(data_tokens.begin(), data_tokens.end(), token); |
| if (it != data_tokens.end()) { |
| result[i] = true; |
| break; |
| } |
| } |
| } |
| |
| return Status::OK(); |
| } |
| |
| Status FunctionMatchAll::execute_match(FunctionContext* context, const std::string& column_name, |
| const std::string& match_query_str, size_t input_rows_count, |
| const ColumnString* string_col, |
| InvertedIndexCtx* inverted_index_ctx, |
| const ColumnArray::Offsets64* array_offsets, |
| ColumnUInt8::Container& result) const { |
| RETURN_IF_ERROR(check(context, name)); |
| |
| std::vector<std::string> query_tokens = |
| analyse_query_str_token(inverted_index_ctx, match_query_str, column_name); |
| if (query_tokens.empty()) { |
| VLOG_DEBUG << fmt::format( |
| "token parser result is empty for query, " |
| "please check your query: '{}' and index parser: '{}'", |
| match_query_str, |
| inverted_index_parser_type_to_string(inverted_index_ctx->parser_type)); |
| return Status::OK(); |
| } |
| |
| auto current_src_array_offset = 0; |
| for (int i = 0; i < input_rows_count; i++) { |
| std::vector<std::string> data_tokens = |
| analyse_data_token(column_name, inverted_index_ctx, string_col, i, array_offsets, |
| current_src_array_offset); |
| |
| // TODO: more efficient impl |
| auto find_count = 0; |
| for (auto& token : query_tokens) { |
| auto it = std::find(data_tokens.begin(), data_tokens.end(), token); |
| if (it != data_tokens.end()) { |
| ++find_count; |
| } else { |
| break; |
| } |
| } |
| |
| if (find_count == query_tokens.size()) { |
| result[i] = true; |
| } |
| } |
| |
| return Status::OK(); |
| } |
| |
| Status FunctionMatchPhrase::execute_match(FunctionContext* context, const std::string& column_name, |
| const std::string& match_query_str, |
| size_t input_rows_count, const ColumnString* string_col, |
| InvertedIndexCtx* inverted_index_ctx, |
| const ColumnArray::Offsets64* array_offsets, |
| ColumnUInt8::Container& result) const { |
| RETURN_IF_ERROR(check(context, name)); |
| |
| std::vector<std::string> query_tokens = |
| analyse_query_str_token(inverted_index_ctx, match_query_str, column_name); |
| if (query_tokens.empty()) { |
| VLOG_DEBUG << fmt::format( |
| "token parser result is empty for query, " |
| "please check your query: '{}' and index parser: '{}'", |
| match_query_str, |
| inverted_index_parser_type_to_string(inverted_index_ctx->parser_type)); |
| return Status::OK(); |
| } |
| |
| auto current_src_array_offset = 0; |
| for (int i = 0; i < input_rows_count; i++) { |
| std::vector<std::string> data_tokens = |
| analyse_data_token(column_name, inverted_index_ctx, string_col, i, array_offsets, |
| current_src_array_offset); |
| |
| // TODO: more efficient impl |
| bool matched = false; |
| auto data_it = data_tokens.begin(); |
| while (data_it != data_tokens.end()) { |
| // find position of first token |
| data_it = std::find(data_it, data_tokens.end(), query_tokens[0]); |
| if (data_it != data_tokens.end()) { |
| matched = true; |
| auto data_it_next = ++data_it; |
| auto query_it = query_tokens.begin() + 1; |
| // compare query_tokens after the first to data_tokens one by one |
| while (query_it != query_tokens.end()) { |
| if (data_it_next == data_tokens.end() || *data_it_next != *query_it) { |
| matched = false; |
| break; |
| } |
| query_it++; |
| data_it_next++; |
| } |
| |
| if (matched) { |
| break; |
| } |
| } |
| } |
| |
| // check matched |
| if (matched) { |
| result[i] = true; |
| } |
| } |
| |
| return Status::OK(); |
| } |
| |
| Status FunctionMatchPhrasePrefix::execute_match( |
| FunctionContext* context, const std::string& column_name, |
| const std::string& match_query_str, size_t input_rows_count, const ColumnString* string_col, |
| InvertedIndexCtx* inverted_index_ctx, const ColumnArray::Offsets64* array_offsets, |
| ColumnUInt8::Container& result) const { |
| RETURN_IF_ERROR(check(context, name)); |
| |
| std::vector<std::string> query_tokens = |
| analyse_query_str_token(inverted_index_ctx, match_query_str, column_name); |
| if (query_tokens.empty()) { |
| VLOG_DEBUG << fmt::format( |
| "token parser result is empty for query, " |
| "please check your query: '{}' and index parser: '{}'", |
| match_query_str, |
| inverted_index_parser_type_to_string(inverted_index_ctx->parser_type)); |
| return Status::OK(); |
| } |
| |
| int32_t current_src_array_offset = 0; |
| for (size_t i = 0; i < input_rows_count; i++) { |
| auto data_tokens = analyse_data_token(column_name, inverted_index_ctx, string_col, i, |
| array_offsets, current_src_array_offset); |
| |
| int32_t dis_count = data_tokens.size() - query_tokens.size(); |
| if (dis_count < 0) { |
| continue; |
| } |
| |
| for (size_t j = 0; j < dis_count + 1; j++) { |
| if (data_tokens[j] == query_tokens[0] || query_tokens.size() == 1) { |
| bool match = true; |
| for (size_t k = 0; k < query_tokens.size(); k++) { |
| const std::string& data_token = data_tokens[j + k]; |
| const std::string& query_token = query_tokens[k]; |
| if (k == query_tokens.size() - 1) { |
| if (data_token.compare(0, query_token.size(), query_token) != 0) { |
| match = false; |
| break; |
| } |
| } else { |
| if (data_token != query_token) { |
| match = false; |
| break; |
| } |
| } |
| } |
| if (match) { |
| result[i] = true; |
| break; |
| } |
| } |
| } |
| } |
| |
| return Status::OK(); |
| } |
| |
| Status FunctionMatchRegexp::execute_match(FunctionContext* context, const std::string& column_name, |
| const std::string& match_query_str, |
| size_t input_rows_count, const ColumnString* string_col, |
| InvertedIndexCtx* inverted_index_ctx, |
| const ColumnArray::Offsets64* array_offsets, |
| ColumnUInt8::Container& result) const { |
| RETURN_IF_ERROR(check(context, name)); |
| |
| VLOG_DEBUG << "begin to run FunctionMatchRegexp::execute_match, parser_type: " |
| << inverted_index_parser_type_to_string(inverted_index_ctx->parser_type); |
| |
| const std::string& pattern = match_query_str; |
| |
| hs_database_t* database = nullptr; |
| hs_compile_error_t* compile_err = nullptr; |
| hs_scratch_t* scratch = nullptr; |
| |
| if (hs_compile(pattern.data(), HS_FLAG_DOTALL | HS_FLAG_ALLOWEMPTY | HS_FLAG_UTF8, |
| HS_MODE_BLOCK, nullptr, &database, &compile_err) != HS_SUCCESS) { |
| std::string err_message = "hyperscan compilation failed: "; |
| err_message.append(compile_err->message); |
| LOG(ERROR) << err_message; |
| hs_free_compile_error(compile_err); |
| return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>(err_message); |
| } |
| |
| if (hs_alloc_scratch(database, &scratch) != HS_SUCCESS) { |
| LOG(ERROR) << "hyperscan could not allocate scratch space."; |
| hs_free_database(database); |
| return Status::Error<ErrorCode::INDEX_INVALID_PARAMETERS>( |
| "hyperscan could not allocate scratch space."); |
| } |
| |
| auto on_match = [](unsigned int id, unsigned long long from, unsigned long long to, |
| unsigned int flags, void* context) -> int { |
| *((bool*)context) = true; |
| return 0; |
| }; |
| |
| try { |
| auto current_src_array_offset = 0; |
| for (int i = 0; i < input_rows_count; i++) { |
| std::vector<std::string> data_tokens = |
| analyse_data_token(column_name, inverted_index_ctx, string_col, i, |
| array_offsets, current_src_array_offset); |
| |
| for (auto& input : data_tokens) { |
| bool is_match = false; |
| if (hs_scan(database, input.data(), input.size(), 0, scratch, on_match, |
| (void*)&is_match) != HS_SUCCESS) { |
| LOG(ERROR) << "hyperscan match failed: " << input; |
| break; |
| } |
| |
| if (is_match) { |
| result[i] = true; |
| break; |
| } |
| } |
| } |
| } |
| _CLFINALLY({ |
| hs_free_scratch(scratch); |
| hs_free_database(database); |
| }) |
| |
| return Status::OK(); |
| } |
| |
| Status FunctionMatchPhraseEdge::execute_match( |
| FunctionContext* context, const std::string& column_name, |
| const std::string& match_query_str, size_t input_rows_count, const ColumnString* string_col, |
| InvertedIndexCtx* inverted_index_ctx, const ColumnArray::Offsets64* array_offsets, |
| ColumnUInt8::Container& result) const { |
| RETURN_IF_ERROR(check(context, name)); |
| |
| std::vector<std::string> query_tokens = |
| analyse_query_str_token(inverted_index_ctx, match_query_str, column_name); |
| if (query_tokens.empty()) { |
| VLOG_DEBUG << fmt::format( |
| "token parser result is empty for query, " |
| "please check your query: '{}' and index parser: '{}'", |
| match_query_str, |
| inverted_index_parser_type_to_string(inverted_index_ctx->parser_type)); |
| return Status::OK(); |
| } |
| |
| int32_t current_src_array_offset = 0; |
| for (size_t i = 0; i < input_rows_count; i++) { |
| auto data_tokens = analyse_data_token(column_name, inverted_index_ctx, string_col, i, |
| array_offsets, current_src_array_offset); |
| |
| int32_t dis_count = data_tokens.size() - query_tokens.size(); |
| if (dis_count < 0) { |
| continue; |
| } |
| |
| for (size_t j = 0; j < dis_count + 1; j++) { |
| bool match = true; |
| if (query_tokens.size() == 1) { |
| if (data_tokens[j].find(query_tokens[0]) == std::string::npos) { |
| match = false; |
| } |
| } else { |
| for (size_t k = 0; k < query_tokens.size(); k++) { |
| const std::string& data_token = data_tokens[j + k]; |
| const std::string& query_token = query_tokens[k]; |
| if (k == 0) { |
| if (!data_token.ends_with(query_token)) { |
| match = false; |
| break; |
| } |
| } else if (k == query_tokens.size() - 1) { |
| if (!data_token.starts_with(query_token)) { |
| match = false; |
| break; |
| } |
| } else { |
| if (data_token != query_token) { |
| match = false; |
| break; |
| } |
| } |
| } |
| } |
| if (match) { |
| result[i] = true; |
| break; |
| } |
| } |
| } |
| |
| return Status::OK(); |
| } |
| |
| void register_function_match(SimpleFunctionFactory& factory) { |
| factory.register_function<FunctionMatchAny>(); |
| factory.register_function<FunctionMatchAll>(); |
| factory.register_function<FunctionMatchPhrase>(); |
| factory.register_function<FunctionMatchPhrasePrefix>(); |
| factory.register_function<FunctionMatchRegexp>(); |
| factory.register_function<FunctionMatchPhraseEdge>(); |
| } |
| |
| } // namespace doris::vectorized |