lbug 0.20.0

An in-process property graph database management system built for query speed and scalability
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

#include "planner/operator/logical_distinct.h"
#include "processor/operator/aggregate/hash_aggregate.h"
#include "processor/plan_mapper.h"

using namespace lbug::common;
using namespace lbug::planner;

namespace lbug {
namespace processor {

std::unique_ptr<PhysicalOperator> PlanMapper::mapDistinct(const LogicalOperator* logicalOperator) {
    auto distinct = logicalOperator->constPtrCast<LogicalDistinct>();
    auto child = distinct->getChild(0).get();
    auto outSchema = distinct->getSchema();
    auto inSchema = child->getSchema();
    auto prevOperator = mapOperator(child);
    uint64_t limitNum = UINT64_MAX;
    if (distinct->hasLimitNum()) {
        limitNum = distinct->getLimitNum();
        if (distinct->hasSkipNum()) {
            if (distinct->getSkipNum() >= UINT64_MAX - limitNum) {
                limitNum = UINT64_MAX;
            } else {
                limitNum += distinct->getSkipNum();
            }
        }
        if (limitNum == 0) {
            limitNum = UINT64_MAX;
        }
    }
    auto op = createDistinctHashAggregate(distinct->getKeys(), distinct->getPayloads(), inSchema,
        outSchema, std::move(prevOperator));
    auto hashAggregate = op->getChild(0)->getChild(0)->ptrCast<HashAggregate>();
    hashAggregate->getSharedState()->setLimitNumber(limitNum);
    auto printInfo = static_cast<const HashAggregatePrintInfo*>(hashAggregate->getPrintInfo());
    const_cast<HashAggregatePrintInfo*>(printInfo)->limitNum = limitNum;
    return op;
}

} // namespace processor
} // namespace lbug