forked from UWQuickstep/quickstep
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSortConfiguration.cpp
83 lines (67 loc) · 2.87 KB
/
SortConfiguration.cpp
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
/**
* 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 "utility/SortConfiguration.hpp"
#include <cstddef>
#include <utility>
#include <vector>
#include "expressions/ExpressionFactories.hpp"
#include "expressions/Expressions.pb.h"
#include "expressions/scalar/Scalar.hpp"
#include "utility/PtrVector.hpp"
#include "utility/SortConfiguration.pb.h"
#include "glog/logging.h"
using std::move;
using std::vector;
namespace quickstep {
SortConfiguration* SortConfiguration::ReconstructFromProto(const serialization::SortConfiguration &proto,
const CatalogDatabaseLite &database) {
DCHECK(ProtoIsValid(proto, database));
PtrVector<Scalar> order_by;
vector<bool> ordering;
vector<bool> null_ordering;
for (int i = 0; i < proto.order_by_list_size(); ++i) {
const serialization::SortConfiguration::OrderBy &order_by_proto = proto.order_by_list(i);
order_by.push_back(ScalarFactory::ReconstructFromProto(order_by_proto.expression(), database));
ordering.push_back(order_by_proto.is_ascending());
null_ordering.push_back(order_by_proto.null_first());
}
return new SortConfiguration(order_by, move(ordering), move(null_ordering));
}
bool SortConfiguration::ProtoIsValid(const serialization::SortConfiguration &proto,
const CatalogDatabaseLite &database) {
for (int i = 0; i < proto.order_by_list_size(); ++i) {
const serialization::SortConfiguration::OrderBy &order_by_proto = proto.order_by_list(i);
if (!order_by_proto.IsInitialized() ||
!ScalarFactory::ProtoIsValid(order_by_proto.expression(), database)) {
return false;
}
}
return true;
}
serialization::SortConfiguration SortConfiguration::getProto() const {
serialization::SortConfiguration proto;
for (std::size_t i = 0; i < order_by_.size(); ++i) {
auto *order_by_attr_proto = proto.add_order_by_list();
order_by_attr_proto->mutable_expression()->CopyFrom(order_by_[i].getProto());
order_by_attr_proto->set_is_ascending(ordering_[i]);
order_by_attr_proto->set_null_first(null_ordering_[i]);
}
return proto;
}
} // namespace quickstep