aboutsummaryrefslogtreecommitdiffstats
path: root/searchcore/src/vespa/searchcore/proton/matching/result_processor.h
blob: e11e09ef33827e6c54b1e32fc04019995e6b4661 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.

#pragma once

#include <vespa/searchlib/common/sortresults.h>
#include <vespa/vespalib/util/dual_merge_director.h>

namespace search {
    namespace engine {
        class SearchReply;
    }
    namespace grouping {
        class GroupingContext;
        class GroupingSession;
    }
    struct IDocumentMetaStore;
    class BitVector;
}

namespace proton::matching {

class SessionManager;
class PartialResult;

class ResultProcessor
{
    using GroupingContext = search::grouping::GroupingContext;
    using GroupingSession = search::grouping::GroupingSession;
    using IAttributeContext = search::attribute::IAttributeContext;
    using PartialResultUP = std::unique_ptr<PartialResult>;
public:
    /**
     * Sorter selection and owner of additional data needed for
     * multi-level sorting.
     **/
    struct Sort {
        using UP = std::unique_ptr<Sort>;
        FastS_IResultSorter *sorter;
        std::unique_ptr<search::common::ConverterFactory> _ucaFactory;
        FastS_SortSpec       sortSpec;
        Sort(const Sort &) = delete;
        Sort & operator = (const Sort &) = delete;
        Sort(uint32_t partitionId, const vespalib::Doom & doom, IAttributeContext &ac, const vespalib::string &ss);
        bool hasSortData() const {
            return (sorter == (const FastS_IResultSorter *) &sortSpec);
        }
    };

    /**
     * Adapter to use grouping contexts as merging sources.
     **/
    struct GroupingSource : vespalib::DualMergeDirector::Source {
        GroupingContext *ctx;
        GroupingSource(GroupingContext *g) : ctx(g) {}
        void merge(Source &s) override;
    };

    /**
     * Context per thread used for result processing.
     **/
    struct Context {
        using GroupingContextUP = std::unique_ptr<GroupingContext>;

        const search::BitVector & _validLids;
        Sort::UP          sort;
        PartialResultUP   result;
        GroupingContextUP grouping;
        GroupingSource    groupingSource;

        Context(const search::BitVector & validLids, Sort::UP s, PartialResultUP r, GroupingContextUP g);
        ~Context();
    };

    struct Result {
        using UP = std::unique_ptr<Result>;
        using SearchReply = search::engine::SearchReply;
        Result(std::unique_ptr<SearchReply> reply, size_t numFs4Hits);
        ~Result();
        std::unique_ptr<SearchReply> _reply;
        size_t _numFs4Hits;
    };

private:
    IAttributeContext                     &_attrContext;
    const search::IDocumentMetaStore      &_metaStore;
    SessionManager                        &_sessionMgr;
    GroupingContext                       &_groupingContext;
    std::unique_ptr<GroupingSession>       _groupingSession;
    const vespalib::string                &_sortSpec;
    size_t                                 _offset;
    size_t                                 _hits;
    bool                                   _wasMerged;

public:
    ResultProcessor(IAttributeContext &attrContext,
                    const search::IDocumentMetaStore & metaStore,
                    SessionManager & sessionMgr,
                    GroupingContext & groupingContext,
                    const vespalib::string & sessionId,
                    const vespalib::string & sortSpec,
                    size_t offset, size_t hits);
    ~ResultProcessor();

    void prepareThreadContextCreation(size_t num_threads);
    std::unique_ptr<Context> createThreadContext(const vespalib::Doom & hardDoom, size_t thread_id, uint32_t distributionKey);
    std::vector<std::pair<uint32_t,uint32_t>> extract_docid_ordering(const PartialResult &result) const;
    std::unique_ptr<Result> makeReply(PartialResultUP full_result);
};

}