// 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 "exprs/function/function_search.h"

#include <CLucene/config/repl_wchar.h>

#include <CLucene/search/Scorer.h>

#include <gen_cpp/Exprs_types.h>

#include <glog/logging.h>

#include <limits>

#include <memory>

#include <roaring/roaring.hh>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

#include "common/status.h"

#include "core/block/columns_with_type_and_name.h"

#include "core/column/column_const.h"

#include "core/data_type/data_type_string.h"

#include "exprs/function/simple_function_factory.h"

#include "exprs/vexpr_context.h"

#include "storage/index/index_file_reader.h"

#include "storage/index/index_query_context.h"

#include "storage/index/inverted/analyzer/analyzer.h"

#include "storage/index/inverted/inverted_index_iterator.h"

#include "storage/index/inverted/inverted_index_parser.h"

#include "storage/index/inverted/inverted_index_reader.h"

#include "storage/index/inverted/inverted_index_searcher.h"

#include "storage/index/inverted/query/query_helper.h"

#include "storage/index/inverted/query_v2/all_query/all_query.h"

#include "storage/index/inverted/query_v2/bit_set_query/bit_set_query.h"

#include "storage/index/inverted/query_v2/boolean_query/boolean_query_builder.h"

#include "storage/index/inverted/query_v2/boolean_query/operator.h"

#include "storage/index/inverted/query_v2/collect/doc_set_collector.h"

#include "storage/index/inverted/query_v2/collect/top_k_collector.h"

#include "storage/index/inverted/query_v2/phrase_query/multi_phrase_query.h"

#include "storage/index/inverted/query_v2/phrase_query/phrase_query.h"

#include "storage/index/inverted/query_v2/regexp_query/regexp_query.h"

#include "storage/index/inverted/query_v2/term_query/term_query.h"

#include "storage/index/inverted/query_v2/wildcard_query/wildcard_query.h"

#include "storage/index/inverted/util/string_helper.h"

#include "storage/segment/segment.h"

#include "storage/segment/variant/nested_group_path.h"

#include "storage/segment/variant/nested_group_provider.h"

#include "storage/segment/variant/variant_column_reader.h"

#include "storage/types.h"

#include "util/string_util.h"

#include "util/thrift_util.h"

namespace doris {

// Build canonical DSL signature for cache key.

// Serializes the entire TSearchParam via Thrift binary protocol so that

// every field (DSL, AST root, field bindings, default_operator,

// minimum_should_match, etc.) is included automatically.

static std::string build_dsl_signature(const TSearchParam& param) {

    ThriftSerializer ser(false, 1024);

    TSearchParam copy = param;

    std::string sig;

    auto st = ser.serialize(&copy, &sig);

    if (UNLIKELY(!st.ok())) {

        LOG(WARNING) << "build_dsl_signature: Thrift serialization failed: " << st.to_string()

                     << ", caching disabled for this query";

        return "";

    }

    return sig;

}

// Extract segment path prefix from the first available inverted index iterator.

// All fields in the same segment share the same path prefix.

static std::string extract_segment_prefix(

        const std::unordered_map<std::string, IndexIterator*>& iterators) {

    for (const auto& [field_name, iter] : iterators) {

        auto* inv_iter = dynamic_cast<InvertedIndexIterator*>(iter);

        if (!inv_iter) continue;

        // Try fulltext reader first, then string type

        for (auto type :

             {InvertedIndexReaderType::FULLTEXT, InvertedIndexReaderType::STRING_TYPE}) {

            IndexReaderType reader_type = type;

            auto reader = inv_iter->get_reader(reader_type);

            if (!reader) continue;

            auto inv_reader = std::dynamic_pointer_cast<InvertedIndexReader>(reader);

            if (!inv_reader) continue;

            auto file_reader = inv_reader->get_index_file_reader();

            if (!file_reader) continue;

            return file_reader->get_index_path_prefix();

        }

    }

    VLOG_DEBUG << "extract_segment_prefix: no suitable inverted index reader found across "

               << iterators.size() << " iterators, caching disabled for this query";

    return "";

}

namespace {

bool is_nested_group_search_supported() {

    auto provider = segment_v2::create_nested_group_read_provider();

    return provider != nullptr && provider->should_enable_nested_group_read_path();

}

class ResolverNullBitmapAdapter final : public query_v2::NullBitmapResolver {

public:

    explicit ResolverNullBitmapAdapter(const FieldReaderResolver& resolver) : _resolver(resolver) {}

    segment_v2::IndexIterator* iterator_for(const query_v2::Scorer& /*scorer*/,

                                            const std::string& logical_field) const override {

        if (logical_field.empty()) {

            return nullptr;

        }

        return _resolver.get_iterator(logical_field);

    }

private:

    const FieldReaderResolver& _resolver;

};

void populate_binding_context(const FieldReaderResolver& resolver,

                              query_v2::QueryExecutionContext* exec_ctx) {

    DCHECK(exec_ctx != nullptr);

    exec_ctx->readers = resolver.readers();

    exec_ctx->reader_bindings = resolver.reader_bindings();

    exec_ctx->field_reader_bindings = resolver.field_readers();

    for (const auto& [binding_key, binding] : resolver.binding_cache()) {

        if (binding_key.empty()) {

            continue;

        }

        query_v2::FieldBindingContext binding_ctx;

        binding_ctx.logical_field_name = binding.logical_field_name;

        binding_ctx.stored_field_name = binding.stored_field_name;

        binding_ctx.stored_field_wstr = binding.stored_field_wstr;

        exec_ctx->binding_fields.emplace(binding_key, std::move(binding_ctx));

    }

}

query_v2::QueryExecutionContext build_query_execution_context(

        uint32_t segment_num_rows, const FieldReaderResolver& resolver,

        query_v2::NullBitmapResolver* null_resolver) {

    query_v2::QueryExecutionContext exec_ctx;

    exec_ctx.segment_num_rows = segment_num_rows;

    populate_binding_context(resolver, &exec_ctx);

    exec_ctx.null_resolver = null_resolver;

    return exec_ctx;

}

} // namespace

Status FieldReaderResolver::resolve(const std::string& field_name,

                                    InvertedIndexQueryType query_type,

                                    FieldReaderBinding* binding) {

    DCHECK(binding != nullptr);

    // Check if this is a variant subcolumn

    bool is_variant_sub = is_variant_subcolumn(field_name);

    auto data_it = _data_type_with_names.find(field_name);

    if (data_it == _data_type_with_names.end()) {

        // For variant subcolumns, not finding the index is normal (the subcolumn may not exist in this segment)

        // Return OK but with null binding to signal "no match"

        if (is_variant_sub) {

            VLOG_DEBUG << "Variant subcolumn '" << field_name

                       << "' not found in this segment, treating as no match";

            *binding = FieldReaderBinding();

            return Status::OK();

        }

        // For normal fields, this is an error

        return Status::Error<ErrorCode::INVERTED_INDEX_FILE_NOT_FOUND>(

                "field '{}' not found in inverted index metadata", field_name);

    }

    const auto& stored_field_name = data_it->second.first;

    const auto binding_key = binding_key_for(stored_field_name, query_type);

    auto cache_it = _cache.find(binding_key);

    if (cache_it != _cache.end()) {

        *binding = cache_it->second;

        return Status::OK();

    }

    auto iterator_it = _iterators.find(field_name);

    if (iterator_it == _iterators.end() || iterator_it->second == nullptr) {

        // For variant subcolumns, not finding the iterator is normal

        if (is_variant_sub) {

            VLOG_DEBUG << "Variant subcolumn '" << field_name

                       << "' iterator not found in this segment, treating as no match";

            *binding = FieldReaderBinding();

            return Status::OK();

        }

        return Status::Error<ErrorCode::INVERTED_INDEX_FILE_NOT_FOUND>(

                "iterator not found for field '{}'", field_name);

    }

    auto* inverted_iterator = dynamic_cast<InvertedIndexIterator*>(iterator_it->second);

    if (inverted_iterator == nullptr) {

        return Status::Error<ErrorCode::INVERTED_INDEX_FILE_NOT_FOUND>(

                "iterator for field '{}' is not InvertedIndexIterator", field_name);

    }

    // For variant subcolumns, FE resolves the field pattern to a specific index and sends

    // its index_properties via TSearchFieldBinding. When FE picks an analyzer-based index,

    // upgrade EQUAL_QUERY/WILDCARD_QUERY to MATCH_ANY_QUERY so select_best_reader picks the

    // FULLTEXT reader instead of STRING_TYPE. Without this upgrade:

    // - TERM (EQUAL_QUERY) clauses would open the wrong (untokenized) index directory

    // - WILDCARD clauses would enumerate terms from the wrong index, returning empty results

    //

    // For regular (non-variant) columns with multiple indexes, the caller (build_leaf_query)

    // is responsible for passing the appropriate query_type: MATCH_ANY_QUERY for tokenized

    // queries (TERM) and EQUAL_QUERY for exact-match queries (EXACT). This ensures

    // select_best_reader picks FULLTEXT vs STRING_TYPE correctly without needing an explicit

    // analyzer key, since the query_type alone drives the reader type preference.

    InvertedIndexQueryType effective_query_type = query_type;

    auto fb_it = _field_binding_map.find(field_name);

    std::string analyzer_key;

    if (is_variant_sub && fb_it != _field_binding_map.end() &&

        fb_it->second->__isset.index_properties && !fb_it->second->index_properties.empty()) {

        analyzer_key = normalize_analyzer_key(

                build_analyzer_key_from_properties(fb_it->second->index_properties));

        if (inverted_index::InvertedIndexAnalyzer::should_analyzer(

                    fb_it->second->index_properties) &&

            (effective_query_type == InvertedIndexQueryType::EQUAL_QUERY ||

             effective_query_type == InvertedIndexQueryType::WILDCARD_QUERY)) {

            effective_query_type = InvertedIndexQueryType::MATCH_ANY_QUERY;

        }

    }

    Result<InvertedIndexReaderPtr> reader_result;

    const auto& column_type = data_it->second.second;

    if (column_type) {

        reader_result = inverted_iterator->select_best_reader(column_type, effective_query_type,

                                                              analyzer_key);

    } else {

        reader_result = inverted_iterator->select_best_reader(analyzer_key);

    }

    if (!reader_result.has_value()) {

        return reader_result.error();

    }

    auto inverted_reader = reader_result.value();

    if (inverted_reader == nullptr) {

        return Status::Error<ErrorCode::INVERTED_INDEX_FILE_NOT_FOUND>(

                "selected reader is null for field '{}'", field_name);

    }

    auto index_file_reader = inverted_reader->get_index_file_reader();

    if (index_file_reader == nullptr) {

        return Status::Error<ErrorCode::INVERTED_INDEX_FILE_NOT_FOUND>(

                "index file reader is null for field '{}'", field_name);

    }

    // Use InvertedIndexSearcherCache to avoid re-opening index files repeatedly

    auto index_file_key =

            index_file_reader->get_index_file_cache_key(&inverted_reader->get_index_meta());

    InvertedIndexSearcherCache::CacheKey searcher_cache_key(index_file_key);

    InvertedIndexCacheHandle searcher_cache_handle;

    bool cache_hit = InvertedIndexSearcherCache::instance()->lookup(searcher_cache_key,

                                                                    &searcher_cache_handle);

    std::shared_ptr<lucene::index::IndexReader> reader_holder;

    if (cache_hit) {

        auto searcher_variant = searcher_cache_handle.get_index_searcher();

        auto* searcher_ptr = std::get_if<FulltextIndexSearcherPtr>(&searcher_variant);

        if (searcher_ptr != nullptr && *searcher_ptr != nullptr) {

            reader_holder = std::shared_ptr<lucene::index::IndexReader>(

                    (*searcher_ptr)->getReader(),

                    [](lucene::index::IndexReader*) { /* lifetime managed by searcher cache */ });

        }

    }

    if (!reader_holder) {

        // Cache miss: open directory, build IndexSearcher, insert into cache

        RETURN_IF_ERROR(

                index_file_reader->init(config::inverted_index_read_buffer_size, _context->io_ctx));

        auto directory = DORIS_TRY(

                index_file_reader->open(&inverted_reader->get_index_meta(), _context->io_ctx));

        auto index_searcher_builder = DORIS_TRY(

                IndexSearcherBuilder::create_index_searcher_builder(inverted_reader->type()));

        auto searcher_result =

                DORIS_TRY(index_searcher_builder->get_index_searcher(directory.get()));

        auto reader_size = index_searcher_builder->get_reader_size();

        auto* cache_value = new InvertedIndexSearcherCache::CacheValue(std::move(searcher_result),

                                                                       reader_size, UnixMillis());

        InvertedIndexSearcherCache::instance()->insert(searcher_cache_key, cache_value,

                                                       &searcher_cache_handle);

        auto new_variant = searcher_cache_handle.get_index_searcher();

        auto* new_ptr = std::get_if<FulltextIndexSearcherPtr>(&new_variant);

        if (new_ptr != nullptr && *new_ptr != nullptr) {

            reader_holder = std::shared_ptr<lucene::index::IndexReader>(

                    (*new_ptr)->getReader(),

                    [](lucene::index::IndexReader*) { /* lifetime managed by searcher cache */ });

        }

        if (!reader_holder) {

            return Status::Error<ErrorCode::INVERTED_INDEX_CLUCENE_ERROR>(

                    "failed to build IndexSearcher for field '{}'", field_name);

        }

    }

    _searcher_cache_handles.push_back(std::move(searcher_cache_handle));

    FieldReaderBinding resolved;

    resolved.logical_field_name = field_name;

    resolved.stored_field_name = stored_field_name;

    resolved.stored_field_wstr = StringHelper::to_wstring(resolved.stored_field_name);

    resolved.column_type = column_type;

    resolved.query_type = effective_query_type;

    resolved.inverted_reader = inverted_reader;

    resolved.lucene_reader = reader_holder;

    // Prefer FE-provided index_properties (needed for variant subcolumn field_pattern matching)

    // Reuse fb_it from earlier lookup above.

    if (fb_it != _field_binding_map.end() && fb_it->second->__isset.index_properties &&

        !fb_it->second->index_properties.empty()) {

        resolved.index_properties = fb_it->second->index_properties;

    } else {

        resolved.index_properties = inverted_reader->get_index_properties();

    }

    resolved.binding_key = binding_key;

    resolved.analyzer_key =

            normalize_analyzer_key(build_analyzer_key_from_properties(resolved.index_properties));

    _binding_readers[binding_key] = reader_holder;

    _field_readers[resolved.stored_field_wstr] = reader_holder;

    _readers.emplace_back(reader_holder);

    _cache.emplace(binding_key, resolved);

    *binding = resolved;

    return Status::OK();

}

Status FunctionSearch::execute_impl(FunctionContext* /*context*/, Block& /*block*/,

                                    const ColumnNumbers& /*arguments*/, uint32_t /*result*/,

                                    size_t /*input_rows_count*/) const {

    return Status::RuntimeError("only inverted index queries are supported");

}

// Enhanced implementation: Handle new parameter structure (DSL + SlotReferences)

Status FunctionSearch::evaluate_inverted_index(

        const ColumnsWithTypeAndName& arguments,

        const std::vector<IndexFieldNameAndTypePair>& data_type_with_names,

        std::vector<IndexIterator*> iterators, uint32_t num_rows,

        const InvertedIndexAnalyzerCtx* /*analyzer_ctx*/,

        InvertedIndexResultBitmap& bitmap_result) const {

    return Status::OK();

}

Status FunctionSearch::evaluate_inverted_index_with_search_param(

        const TSearchParam& search_param,

        const std::unordered_map<std::string, IndexFieldNameAndTypePair>& data_type_with_names,

        std::unordered_map<std::string, IndexIterator*> iterators, uint32_t num_rows,

        InvertedIndexResultBitmap& bitmap_result, bool enable_cache) const {

    static const std::unordered_map<std::string, int> empty_field_to_column_id;

    return evaluate_inverted_index_with_search_param(

            search_param, data_type_with_names, std::move(iterators), num_rows, bitmap_result,

            enable_cache, nullptr, empty_field_to_column_id);

}

Status FunctionSearch::evaluate_inverted_index_with_search_param(

        const TSearchParam& search_param,

        const std::unordered_map<std::string, IndexFieldNameAndTypePair>& data_type_with_names,

        std::unordered_map<std::string, IndexIterator*> iterators, uint32_t num_rows,

        InvertedIndexResultBitmap& bitmap_result, bool enable_cache,

        const IndexExecContext* index_exec_ctx,

        const std::unordered_map<std::string, int>& field_name_to_column_id,

        const std::shared_ptr<IndexQueryContext>& index_query_context) const {

    const bool is_nested_query = search_param.root.clause_type == "NESTED";

    if (is_nested_query && !is_nested_group_search_supported()) {

        return Status::NotSupported(

                "NESTED query requires NestedGroup support, which is unavailable in this build");

    }

    if (!is_nested_query && (iterators.empty() || data_type_with_names.empty())) {

        LOG(INFO) << "No indexed columns or iterators available, returning empty result, dsl:"

                  << search_param.original_dsl;

        bitmap_result = InvertedIndexResultBitmap(std::make_shared<roaring::Roaring>(),

                                                  std::make_shared<roaring::Roaring>());

        return Status::OK();

    }

    // DSL result cache: reuse InvertedIndexQueryCache with SEARCH_DSL_QUERY type

    auto* dsl_cache = enable_cache ? InvertedIndexQueryCache::instance() : nullptr;

    std::string seg_prefix;

    std::string dsl_sig;

    InvertedIndexQueryCache::CacheKey dsl_cache_key;

    bool cache_usable = false;

    if (dsl_cache) {

        seg_prefix = extract_segment_prefix(iterators);

        dsl_sig = build_dsl_signature(search_param);

        if (!seg_prefix.empty() && !dsl_sig.empty()) {

            dsl_cache_key = InvertedIndexQueryCache::CacheKey {

                    seg_prefix, "__search_dsl__", InvertedIndexQueryType::SEARCH_DSL_QUERY,

                    dsl_sig};

            cache_usable = true;

            InvertedIndexQueryCacheHandle dsl_cache_handle;

            if (dsl_cache->lookup(dsl_cache_key, &dsl_cache_handle)) {

                auto cached_bitmap = dsl_cache_handle.get_bitmap();

                if (cached_bitmap) {

                    // Also retrieve cached null bitmap for three-valued SQL logic

                    // (needed by compound operators NOT, OR, AND in VCompoundPred)

                    auto null_cache_key = InvertedIndexQueryCache::CacheKey {

                            seg_prefix, "__search_dsl__", InvertedIndexQueryType::SEARCH_DSL_QUERY,

                            dsl_sig + "__null"};

                    InvertedIndexQueryCacheHandle null_cache_handle;

                    std::shared_ptr<roaring::Roaring> null_bitmap;

                    if (dsl_cache->lookup(null_cache_key, &null_cache_handle)) {

                        null_bitmap = null_cache_handle.get_bitmap();

                    }

                    if (!null_bitmap) {

                        null_bitmap = std::make_shared<roaring::Roaring>();

                    }

                    bitmap_result =

                            InvertedIndexResultBitmap(cached_bitmap, std::move(null_bitmap));

                    return Status::OK();

                }

            }

        }

    }

    std::shared_ptr<IndexQueryContext> context;

    if (index_query_context) {

        context = index_query_context;

    } else {

        context = std::make_shared<IndexQueryContext>();

        context->collection_statistics = std::make_shared<CollectionStatistics>();

        context->collection_similarity = std::make_shared<CollectionSimilarity>();

    }

    // NESTED() queries evaluate predicates on the flattened "element space" of a nested group.

    // For VARIANT nested groups, the indexed lucene field (stored_field_name) uses:

    //   parent_unique_id + "." + <variant-relative nested path>

    // where the nested path is rooted at either:

    //   - "__D0_root__" for top-level array<object> (NESTED(data, ...))

    //   - "<nested_path_after_variant_root>" for object fields (NESTED(data.items, ...))

    //

    // FE field bindings are expressed using logical column paths (e.g. "data.items.msg"), so for

    // NESTED() we normalize stored_field_name suffix to be consistent with the nested group root.

    std::unordered_map<std::string, IndexFieldNameAndTypePair> patched_data_type_with_names;

    const auto* effective_data_type_with_names = &data_type_with_names;

    if (is_nested_query && search_param.root.__isset.nested_path) {

        const std::string& nested_path = search_param.root.nested_path;

        const auto dot_pos = nested_path.find('.');

        const std::string root_field =

                (dot_pos == std::string::npos) ? nested_path : nested_path.substr(0, dot_pos);

        const std::string root_prefix = root_field + ".";

        const std::string array_path = (dot_pos == std::string::npos)

                                               ? std::string(segment_v2::kRootNestedGroupPath)

                                               : nested_path.substr(dot_pos + 1);

        bool copied = false;

        for (const auto& fb : search_param.field_bindings) {

            if (!fb.__isset.is_variant_subcolumn || !fb.is_variant_subcolumn) {

                continue;

            }

            if (fb.field_name.empty()) {

                continue;

            }

            const auto it_orig = data_type_with_names.find(fb.field_name);

            if (it_orig == data_type_with_names.end()) {

                continue;

            }

            const std::string& old_stored = it_orig->second.first;

            const auto first_dot = old_stored.find('.');

            if (first_dot == std::string::npos) {

                continue;

            }

            std::string sub_path;

            if (fb.__isset.subcolumn_path && !fb.subcolumn_path.empty()) {

                sub_path = fb.subcolumn_path;

            } else if (fb.field_name.starts_with(nested_path + ".")) {

                sub_path = fb.field_name.substr(nested_path.size() + 1);

            } else if (fb.field_name.starts_with(root_prefix)) {

                sub_path = fb.field_name.substr(root_prefix.size());

            } else {

                sub_path = fb.field_name;

            }

            if (sub_path.empty()) {

                continue;

            }

            const std::string array_prefix = array_path + ".";

            const std::string suffix_path =

                    sub_path.starts_with(array_prefix) ? sub_path : (array_prefix + sub_path);

            const std::string parent_uid = old_stored.substr(0, first_dot);

            const std::string expected_stored = parent_uid + "." + suffix_path;

            if (old_stored == expected_stored) {

                continue;

            }

            if (!copied) {

                patched_data_type_with_names = data_type_with_names;

                effective_data_type_with_names = &patched_data_type_with_names;

                copied = true;

            }

            auto it = patched_data_type_with_names.find(fb.field_name);

            if (it == patched_data_type_with_names.end()) {

                continue;

            }

            it->second.first = expected_stored;

        }

    }

    // Pass field_bindings to resolver for variant subcolumn detection

    FieldReaderResolver resolver(*effective_data_type_with_names, iterators, context,

                                 search_param.field_bindings);

    if (is_nested_query) {

        std::shared_ptr<roaring::Roaring> row_bitmap;

        RETURN_IF_ERROR(evaluate_nested_query(search_param, search_param.root, context, resolver,

                                              num_rows, index_exec_ctx, field_name_to_column_id,

                                              row_bitmap));

        bitmap_result = InvertedIndexResultBitmap(std::move(row_bitmap),

                                                  std::make_shared<roaring::Roaring>());

        bitmap_result.mask_out_null();

        return Status::OK();

    }

    // Extract default_operator from TSearchParam (default: "or")

    std::string default_operator = "or";

    if (search_param.__isset.default_operator && !search_param.default_operator.empty()) {

        default_operator = search_param.default_operator;

    }

    // Extract minimum_should_match from TSearchParam (-1 means not set)

    int32_t minimum_should_match = -1;

    if (search_param.__isset.minimum_should_match) {

        minimum_should_match = search_param.minimum_should_match;

    }

    query_v2::QueryPtr root_query;

    std::string root_binding_key;

    RETURN_IF_ERROR(build_query_recursive(search_param.root, context, resolver, &root_query,

                                          &root_binding_key, default_operator,

                                          minimum_should_match));

    if (root_query == nullptr) {

        LOG(INFO) << "search: Query tree resolved to empty query, dsl:"

                  << search_param.original_dsl;

        bitmap_result = InvertedIndexResultBitmap(std::make_shared<roaring::Roaring>(),

                                                  std::make_shared<roaring::Roaring>());

        return Status::OK();

    }

    ResolverNullBitmapAdapter null_resolver(resolver);

    query_v2::QueryExecutionContext exec_ctx =

            build_query_execution_context(num_rows, resolver, &null_resolver);

    bool enable_scoring = false;

    bool is_asc = false;

    size_t top_k = 0;

    if (index_query_context) {

        enable_scoring = index_query_context->collection_similarity != nullptr;

        is_asc = index_query_context->is_asc;

        top_k = index_query_context->query_limit;

    }

    auto weight = root_query->weight(enable_scoring);

    if (!weight) {

        LOG(WARNING) << "search: Failed to build query weight";

        bitmap_result = InvertedIndexResultBitmap(std::make_shared<roaring::Roaring>(),

                                                  std::make_shared<roaring::Roaring>());

        return Status::OK();

    }

    std::shared_ptr<roaring::Roaring> roaring = std::make_shared<roaring::Roaring>();

    if (enable_scoring && !is_asc && top_k > 0) {

        bool use_wand = index_query_context->runtime_state != nullptr &&

                        index_query_context->runtime_state->query_options()

                                .enable_inverted_index_wand_query;

        query_v2::collect_multi_segment_top_k(weight, exec_ctx, root_binding_key, top_k, roaring,

                                              index_query_context->collection_similarity, use_wand);

    } else {

        query_v2::collect_multi_segment_doc_set(

                weight, exec_ctx, root_binding_key, roaring,

                index_query_context ? index_query_context->collection_similarity : nullptr,

                enable_scoring);

    }

    VLOG_DEBUG << "search: Query completed, matched " << roaring->cardinality() << " documents";

    // Extract NULL bitmap from three-valued logic scorer

    // The scorer correctly computes which documents evaluate to NULL based on query logic

    // For example: TRUE OR NULL = TRUE (not NULL), FALSE OR NULL = NULL

    std::shared_ptr<roaring::Roaring> null_bitmap = std::make_shared<roaring::Roaring>();

    if (exec_ctx.null_resolver) {

        auto scorer = weight->scorer(exec_ctx, root_binding_key);

        if (scorer && scorer->has_null_bitmap(exec_ctx.null_resolver)) {

            const auto* bitmap = scorer->get_null_bitmap(exec_ctx.null_resolver);

            if (bitmap != nullptr) {

                *null_bitmap = *bitmap;

                VLOG_TRACE << "search: Extracted NULL bitmap with " << null_bitmap->cardinality()

                           << " NULL documents";

            }

        }

    }

    VLOG_TRACE << "search: Before mask - true_bitmap=" << roaring->cardinality()

               << ", null_bitmap=" << null_bitmap->cardinality();

    // Create result and mask out NULLs (SQL WHERE clause semantics: only TRUE rows)

    bitmap_result = InvertedIndexResultBitmap(std::move(roaring), std::move(null_bitmap));

    bitmap_result.mask_out_null();

    VLOG_TRACE << "search: After mask - result_bitmap="

               << bitmap_result.get_data_bitmap()->cardinality();

    // Insert post-mask_out_null result into DSL cache for future reuse

    // Cache both data bitmap and null bitmap so compound operators (NOT, OR, AND)

    // can apply correct three-valued SQL logic on cache hit

    if (dsl_cache && cache_usable) {

        InvertedIndexQueryCacheHandle insert_handle;

        dsl_cache->insert(dsl_cache_key, bitmap_result.get_data_bitmap(), &insert_handle);

        if (bitmap_result.get_null_bitmap()) {

            auto null_cache_key = InvertedIndexQueryCache::CacheKey {

                    seg_prefix, "__search_dsl__", InvertedIndexQueryType::SEARCH_DSL_QUERY,

                    dsl_sig + "__null"};

            InvertedIndexQueryCacheHandle null_insert_handle;

            dsl_cache->insert(null_cache_key, bitmap_result.get_null_bitmap(), &null_insert_handle);

        }

    }

    return Status::OK();

}

Status FunctionSearch::evaluate_nested_query(

        const TSearchParam& search_param, const TSearchClause& nested_clause,

        const std::shared_ptr<IndexQueryContext>& context, FieldReaderResolver& resolver,

        uint32_t num_rows, const IndexExecContext* index_exec_ctx,

        const std::unordered_map<std::string, int>& field_name_to_column_id,

        std::shared_ptr<roaring::Roaring>& result_bitmap) const {

    (void)field_name_to_column_id;

    if (!(nested_clause.__isset.nested_path)) {

        return Status::InvalidArgument("NESTED clause missing nested_path");

    }

    if (!(nested_clause.__isset.children) || nested_clause.children.empty()) {

        return Status::InvalidArgument("NESTED clause missing inner query");

    }

    if (result_bitmap == nullptr) {

        result_bitmap = std::make_shared<roaring::Roaring>();

    } else {

        *result_bitmap = roaring::Roaring();

    }

    // 1. Get the nested group chain directly

    std::string root_field = nested_clause.nested_path;

    auto dot_pos = nested_clause.nested_path.find('.');

    if (dot_pos != std::string::npos) {

        root_field = nested_clause.nested_path.substr(0, dot_pos);

    }

    if (index_exec_ctx == nullptr || index_exec_ctx->segment() == nullptr) {

        return Status::InvalidArgument("NESTED query requires IndexExecContext with valid segment");

    }

    auto* segment = index_exec_ctx->segment();

    const int32_t ordinal = segment->tablet_schema()->field_index(root_field);

    if (ordinal < 0) {

        return Status::InvalidArgument("Column '{}' not found in tablet schema for nested query",

                                       root_field);

    }

    const ColumnId column_id = static_cast<ColumnId>(ordinal);

    std::shared_ptr<segment_v2::ColumnReader> column_reader;

    RETURN_IF_ERROR(segment->get_column_reader(segment->tablet_schema()->column(column_id),

                                               &column_reader,

                                               index_exec_ctx->column_iter_opts().stats));

    auto* variant_reader = dynamic_cast<segment_v2::VariantColumnReader*>(column_reader.get());

    if (variant_reader == nullptr) {

        return Status::InvalidArgument("Column '{}' is not VARIANT for nested query", root_field);

    }

    std::string array_path;

    if (dot_pos == std::string::npos) {

        array_path = std::string(segment_v2::kRootNestedGroupPath);

    } else {

        array_path = nested_clause.nested_path.substr(dot_pos + 1);

    }

    auto [found, group_chain, _] = variant_reader->collect_nested_group_chain(array_path);

    if (!found || group_chain.empty()) {

        return Status::OK();

    }

    // Use the read provider for element counting and bitmap mapping.

    auto read_provider = segment_v2::create_nested_group_read_provider();

    if (!read_provider || !read_provider->should_enable_nested_group_read_path()) {

        return Status::NotSupported(

                "NestedGroup search is an enterprise capability, not available in this build");

    }

    auto& leaf_group = group_chain.back();

    uint64_t total_elements = 0;

    RETURN_IF_ERROR(read_provider->get_total_elements(index_exec_ctx->column_iter_opts(),

                                                      leaf_group, &total_elements));

    if (total_elements == 0) {

        return Status::OK();

    }

    // 3. Evaluate inner query

    std::string default_operator = "or";

    if (search_param.__isset.default_operator && !search_param.default_operator.empty()) {

        default_operator = search_param.default_operator;

    }

    int32_t minimum_should_match = -1;

    if (search_param.__isset.minimum_should_match) {

        minimum_should_match = search_param.minimum_should_match;

    }

    query_v2::QueryPtr inner_query;

    std::string inner_binding_key;

    RETURN_IF_ERROR(build_query_recursive(nested_clause.children[0], context, resolver,

                                          &inner_query, &inner_binding_key, default_operator,

                                          minimum_should_match));

    if (inner_query == nullptr) {

        return Status::OK();

    }

    if (total_elements > std::numeric_limits<uint32_t>::max()) {

        return Status::InvalidArgument("nested element_count exceeds uint32_t max");

    }

    ResolverNullBitmapAdapter null_resolver(resolver);

    query_v2::QueryExecutionContext exec_ctx = build_query_execution_context(

            static_cast<uint32_t>(total_elements), resolver, &null_resolver);

    auto weight = inner_query->weight(false);

    if (!weight) {

        return Status::OK();

    }

    auto scorer = weight->scorer(exec_ctx, inner_binding_key);

    if (!scorer) {

        return Status::OK();

    }

    roaring::Roaring element_bitmap;

    uint32_t doc = scorer->doc();

    while (doc != query_v2::TERMINATED) {

        element_bitmap.add(doc);

        doc = scorer->advance();

    }

    if (scorer->has_null_bitmap(exec_ctx.null_resolver)) {

        const auto* bitmap = scorer->get_null_bitmap(exec_ctx.null_resolver);

        if (bitmap != nullptr && !bitmap->isEmpty()) {

            element_bitmap -= *bitmap;

        }

    }

    // 4. Map element-level hits back to row-level hits through NestedGroup chain.

    if (result_bitmap == nullptr) {

        result_bitmap = std::make_shared<roaring::Roaring>();

    }

    roaring::Roaring parent_bitmap;

    RETURN_IF_ERROR(read_provider->map_elements_to_parent_ords(

            group_chain, index_exec_ctx->column_iter_opts(), element_bitmap, &parent_bitmap));

    *result_bitmap = std::move(parent_bitmap);

    return Status::OK();

}

// Aligned with FE QsClauseType enum - uses enum.name() as clause_type

FunctionSearch::ClauseTypeCategory FunctionSearch::get_clause_type_category(

        const std::string& clause_type) const {

    if (clause_type == "AND" || clause_type == "OR" || clause_type == "NOT" ||

        clause_type == "OCCUR_BOOLEAN" || clause_type == "NESTED") {

        return ClauseTypeCategory::COMPOUND;

    } else if (clause_type == "TERM" || clause_type == "PREFIX" || clause_type == "WILDCARD" ||

               clause_type == "REGEXP" || clause_type == "RANGE" || clause_type == "LIST" ||

               clause_type == "EXACT") {

        // Non-tokenized queries: exact matching, pattern matching, range, list operations

        return ClauseTypeCategory::NON_TOKENIZED;

    } else if (clause_type == "PHRASE" || clause_type == "MATCH" || clause_type == "ANY" ||

               clause_type == "ALL") {

        // Tokenized queries: phrase search, full-text search, multi-value matching

        // Note: ANY and ALL require tokenization of their input values

        return ClauseTypeCategory::TOKENIZED;

    } else {

        // Default to NON_TOKENIZED for unknown types

        LOG(WARNING) << "Unknown clause type '" << clause_type

                     << "', defaulting to NON_TOKENIZED category";

        return ClauseTypeCategory::NON_TOKENIZED;

    }

}

// Analyze query type for a specific field in the search clause

InvertedIndexQueryType FunctionSearch::analyze_field_query_type(const std::string& field_name,

                                                                const TSearchClause& clause) const {

    const std::string& clause_type = clause.clause_type;

    ClauseTypeCategory category = get_clause_type_category(clause_type);

    // Handle leaf queries - use direct mapping

    if (category != ClauseTypeCategory::COMPOUND) {

        // Check if this clause targets the specific field

        if (clause.field_name == field_name) {

            // Use direct mapping from clause_type to InvertedIndexQueryType

            return clause_type_to_query_type(clause_type);

        }

    }

    // Handle boolean queries - recursively analyze children

    if (!clause.children.empty()) {

        for (const auto& child_clause : clause.children) {

            // Recursively analyze each child

            InvertedIndexQueryType child_type = analyze_field_query_type(field_name, child_clause);

            // If this child targets the field (not default EQUAL_QUERY), return its query type

            if (child_type != InvertedIndexQueryType::UNKNOWN_QUERY) {

                return child_type;

            }

        }

    }

    // If no children target this field, return UNKNOWN_QUERY as default

    return InvertedIndexQueryType::UNKNOWN_QUERY;

}

// Map clause_type string to InvertedIndexQueryType

InvertedIndexQueryType FunctionSearch::clause_type_to_query_type(

        const std::string& clause_type) const {

    // Use static map for better performance and maintainability

    static const std::unordered_map<std::string, InvertedIndexQueryType> clause_type_map = {

            // Boolean operations

            {"AND", InvertedIndexQueryType::BOOLEAN_QUERY},

            {"OR", InvertedIndexQueryType::BOOLEAN_QUERY},

            {"NOT", InvertedIndexQueryType::BOOLEAN_QUERY},

            {"OCCUR_BOOLEAN", InvertedIndexQueryType::BOOLEAN_QUERY},

            {"NESTED", InvertedIndexQueryType::BOOLEAN_QUERY},

            // Non-tokenized queries (exact matching, pattern matching)

            {"TERM", InvertedIndexQueryType::EQUAL_QUERY},

            {"PREFIX", InvertedIndexQueryType::MATCH_PHRASE_PREFIX_QUERY},

            {"WILDCARD", InvertedIndexQueryType::WILDCARD_QUERY},

            {"REGEXP", InvertedIndexQueryType::MATCH_REGEXP_QUERY},

            {"RANGE", InvertedIndexQueryType::RANGE_QUERY},

            {"LIST", InvertedIndexQueryType::LIST_QUERY},

            // Tokenized queries (full-text search, phrase search)

            {"PHRASE", InvertedIndexQueryType::MATCH_PHRASE_QUERY},

            {"MATCH", InvertedIndexQueryType::MATCH_ANY_QUERY},

            {"ANY", InvertedIndexQueryType::MATCH_ANY_QUERY},

            {"ALL", InvertedIndexQueryType::MATCH_ALL_QUERY},

            // Exact match without tokenization

            {"EXACT", InvertedIndexQueryType::EQUAL_QUERY},

    };

    auto it = clause_type_map.find(clause_type);

    if (it != clause_type_map.end()) {

        return it->second;

    }

    // Unknown clause type

    LOG(WARNING) << "Unknown clause type '" << clause_type << "', defaulting to EQUAL_QUERY";

    return InvertedIndexQueryType::EQUAL_QUERY;

}

// Map Thrift TSearchOccur to query_v2::Occur

static query_v2::Occur map_thrift_occur(TSearchOccur::type thrift_occur) {

    switch (thrift_occur) {

    case TSearchOccur::MUST:

        return query_v2::Occur::MUST;

    case TSearchOccur::SHOULD:

        return query_v2::Occur::SHOULD;

    case TSearchOccur::MUST_NOT:

        return query_v2::Occur::MUST_NOT;

    default:

        return query_v2::Occur::MUST;

    }

}

Status FunctionSearch::build_query_recursive(const TSearchClause& clause,

                                             const std::shared_ptr<IndexQueryContext>& context,

                                             FieldReaderResolver& resolver,

                                             inverted_index::query_v2::QueryPtr* out,

                                             std::string* binding_key,

                                             const std::string& default_operator,

                                             int32_t minimum_should_match) const {

    DCHECK(out != nullptr);

    *out = nullptr;

    if (binding_key) {

        binding_key->clear();

    }

    const std::string& clause_type = clause.clause_type;

    // Handle MATCH_ALL_DOCS - matches all documents in the segment

    if (clause_type == "MATCH_ALL_DOCS") {

        *out = std::make_shared<query_v2::AllQuery>();

        return Status::OK();

    }

    // Handle OCCUR_BOOLEAN - Lucene-style boolean query with MUST/SHOULD/MUST_NOT

    if (clause_type == "OCCUR_BOOLEAN") {

        auto builder = segment_v2::inverted_index::query_v2::create_occur_boolean_query_builder();

        // Set minimum_should_match if specified

        if (clause.__isset.minimum_should_match) {

            builder->set_minimum_number_should_match(clause.minimum_should_match);

        }

        if (clause.__isset.children) {

            for (const auto& child_clause : clause.children) {

                query_v2::QueryPtr child_query;

                std::string child_binding_key;

                RETURN_IF_ERROR(build_query_recursive(child_clause, context, resolver, &child_query,

                                                      &child_binding_key, default_operator,

                                                      minimum_should_match));

                // Determine occur type from child clause

                query_v2::Occur occur = query_v2::Occur::MUST; // default

                if (child_clause.__isset.occur) {

                    occur = map_thrift_occur(child_clause.occur);

                }

                builder->add(child_query, occur, std::move(child_binding_key));

            }

        }

        *out = builder->build();

        return Status::OK();

    }

    if (clause_type == "NESTED") {

        return Status::InvalidArgument("NESTED clause must be evaluated at top level");

    }

    // Handle standard boolean operators (AND/OR/NOT)

    if (clause_type == "AND" || clause_type == "OR" || clause_type == "NOT") {

        query_v2::OperatorType op = query_v2::OperatorType::OP_AND;

        if (clause_type == "OR") {

            op = query_v2::OperatorType::OP_OR;

        } else if (clause_type == "NOT") {

            op = query_v2::OperatorType::OP_NOT;

        }

        auto builder = create_operator_boolean_query_builder(op);

        if (clause.__isset.children) {

            for (const auto& child_clause : clause.children) {

                query_v2::QueryPtr child_query;

                std::string child_binding_key;

                RETURN_IF_ERROR(build_query_recursive(child_clause, context, resolver, &child_query,

                                                      &child_binding_key, default_operator,

                                                      minimum_should_match));

                // Add all children including empty BitSetQuery

                // BooleanQuery will handle the logic:

                // - AND with empty bitmap → result is empty

                // - OR with empty bitmap → empty bitmap is ignored by OR logic

                // - NOT with empty bitmap → NOT(empty) = all rows (handled by BooleanQuery)

                builder->add(child_query, std::move(child_binding_key));

            }

        }

        *out = builder->build();

        return Status::OK();

    }

    return build_leaf_query(clause, context, resolver, out, binding_key, default_operator,

                            minimum_should_match);

}

Status FunctionSearch::build_leaf_query(const TSearchClause& clause,

                                        const std::shared_ptr<IndexQueryContext>& context,

                                        FieldReaderResolver& resolver,

                                        inverted_index::query_v2::QueryPtr* out,

                                        std::string* binding_key,

                                        const std::string& default_operator,

                                        int32_t minimum_should_match) const {

    DCHECK(out != nullptr);

    *out = nullptr;

    if (binding_key) {

        binding_key->clear();

    }

    if (!clause.__isset.field_name || !clause.__isset.value) {

        return Status::InvalidArgument("search clause missing field_name or value");