summaryrefslogtreecommitdiffstats
path: root/searchcore/src/vespa/searchcore/proton/matching/match_loop_communicator.h
blob: e17efd66c787f68bb7fb9c6f42b851c5c1de677b (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
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.

#pragma once

#include "i_match_loop_communicator.h"
#include <vespa/searchlib/queryeval/idiversifier.h>
#include <vespa/vespalib/util/rendezvous.h>

namespace proton::matching {

class MatchLoopCommunicator : public IMatchLoopCommunicator
{
private:
    using IDiversifier = search::queryeval::IDiversifier;
    struct EstimateMatchFrequency : vespalib::Rendezvous<Matches, double> {
        EstimateMatchFrequency(size_t n) : vespalib::Rendezvous<Matches, double>(n) {}
        void mingle() override;
    };
    struct SelectBest : vespalib::Rendezvous<Hits, Hits> {
        size_t topN;
        std::vector<uint32_t> _indexes;
        std::unique_ptr<IDiversifier> _diversifier;
        SelectBest(size_t n, size_t topN_in, std::unique_ptr<IDiversifier>);
        ~SelectBest() override;
        void mingle() override;
        template<typename Q, typename F>
        void mingle(Q & queue, F && accept);
        bool cmp(uint32_t a, uint32_t b) {
            return (in(a)[_indexes[a]].second > in(b)[_indexes[b]].second);
        }
    };
    struct SelectCmp {
        SelectBest &sb;
        SelectCmp(SelectBest &sb_in) : sb(sb_in) {}
        bool operator()(uint32_t a, uint32_t b) const {
            return (sb.cmp(a, b));
        }
    };
    struct RangeCover : vespalib::Rendezvous<RangePair, RangePair> {
        RangeCover(size_t n) : vespalib::Rendezvous<RangePair, RangePair>(n) {}
        void mingle() override;
    };
    EstimateMatchFrequency        _estimate_match_frequency;
    SelectBest                    _selectBest;
    RangeCover                    _rangeCover;

public:
    MatchLoopCommunicator(size_t threads, size_t topN);
    MatchLoopCommunicator(size_t threads, size_t topN, std::unique_ptr<IDiversifier>);
    ~MatchLoopCommunicator();

    double estimate_match_frequency(const Matches &matches) override {
        return _estimate_match_frequency.rendezvous(matches);
    }
    Hits selectBest(Hits sortedHits) override {
        return _selectBest.rendezvous(sortedHits);
    }
    RangePair rangeCover(const RangePair &ranges) override {
        return _rangeCover.rendezvous(ranges);
    }
};

}