-
Notifications
You must be signed in to change notification settings - Fork 101
Expand file tree
/
Copy pathbinder.cc
More file actions
176 lines (141 loc) · 6.18 KB
/
binder.cc
File metadata and controls
176 lines (141 loc) · 6.18 KB
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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
/*
* 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 "iceberg/expression/binder.h"
#include "iceberg/result.h"
#include "iceberg/util/macros.h"
namespace iceberg {
Binder::Binder(const Schema& schema, bool case_sensitive)
: schema_(schema), case_sensitive_(case_sensitive) {}
Result<std::shared_ptr<Expression>> Binder::Bind(const Schema& schema,
const std::shared_ptr<Expression>& expr,
bool case_sensitive) {
Binder binder(schema, case_sensitive);
return Visit<std::shared_ptr<Expression>, Binder>(expr, binder);
}
Result<std::shared_ptr<Expression>> Binder::AlwaysTrue() { return True::Instance(); }
Result<std::shared_ptr<Expression>> Binder::AlwaysFalse() { return False::Instance(); }
Result<std::shared_ptr<Expression>> Binder::Not(
const std::shared_ptr<Expression>& child_result) {
return iceberg::Not::MakeFolded(child_result);
}
Result<std::shared_ptr<Expression>> Binder::And(
const std::shared_ptr<Expression>& left_result,
const std::shared_ptr<Expression>& right_result) {
return iceberg::And::MakeFolded(left_result, right_result);
}
Result<std::shared_ptr<Expression>> Binder::Or(
const std::shared_ptr<Expression>& left_result,
const std::shared_ptr<Expression>& right_result) {
return iceberg::Or::MakeFolded(left_result, right_result);
}
Result<std::shared_ptr<Expression>> Binder::Predicate(
const std::shared_ptr<UnboundPredicate>& pred) {
ICEBERG_PRECHECK(pred != nullptr, "Predicate cannot be null");
return pred->Bind(schema_, case_sensitive_);
}
Result<std::shared_ptr<Expression>> Binder::Predicate(
const std::shared_ptr<BoundPredicate>& pred) {
ICEBERG_PRECHECK(pred != nullptr, "Predicate cannot be null");
return InvalidExpression("Found already bound predicate: {}", pred->ToString());
}
Result<std::shared_ptr<Expression>> Binder::Aggregate(
const std::shared_ptr<BoundAggregate>& aggregate) {
ICEBERG_PRECHECK(aggregate != nullptr, "Aggregate cannot be null");
return InvalidExpression("Found already bound aggregate: {}", aggregate->ToString());
}
Result<std::shared_ptr<Expression>> Binder::Aggregate(
const std::shared_ptr<UnboundAggregate>& aggregate) {
ICEBERG_PRECHECK(aggregate != nullptr, "Aggregate cannot be null");
return aggregate->Bind(schema_, case_sensitive_);
}
Result<bool> IsBoundVisitor::IsBound(const std::shared_ptr<Expression>& expr) {
ICEBERG_PRECHECK(expr != nullptr, "Expression cannot be null");
IsBoundVisitor visitor;
return Visit<bool, IsBoundVisitor>(expr, visitor);
}
Result<bool> IsBoundVisitor::AlwaysTrue() {
return InvalidExpression("IsBoundVisitor does not support AlwaysTrue expression");
}
Result<bool> IsBoundVisitor::AlwaysFalse() {
return InvalidExpression("IsBoundVisitor does not support AlwaysFalse expression");
}
Result<bool> IsBoundVisitor::Not(bool child_result) { return child_result; }
Result<bool> IsBoundVisitor::And(bool left_result, bool right_result) {
return left_result && right_result;
}
Result<bool> IsBoundVisitor::Or(bool left_result, bool right_result) {
return left_result && right_result;
}
Result<bool> IsBoundVisitor::Predicate(
[[maybe_unused]] const std::shared_ptr<BoundPredicate>& pred) {
return true;
}
Result<bool> IsBoundVisitor::Predicate(
[[maybe_unused]] const std::shared_ptr<UnboundPredicate>& pred) {
return false;
}
Result<bool> IsBoundVisitor::Aggregate(
[[maybe_unused]] const std::shared_ptr<BoundAggregate>& aggregate) {
return true;
}
Result<bool> IsBoundVisitor::Aggregate(
[[maybe_unused]] const std::shared_ptr<UnboundAggregate>& aggregate) {
return false;
}
Result<std::unordered_set<int32_t>> ReferenceVisitor::GetReferencedFieldIds(
const std::shared_ptr<Expression>& expr) {
ICEBERG_PRECHECK(expr != nullptr, "Expression cannot be null");
ReferenceVisitor visitor;
return Visit<FieldIdsSetRef, ReferenceVisitor>(expr, visitor);
}
Result<FieldIdsSetRef> ReferenceVisitor::AlwaysTrue() { return referenced_field_ids_; }
Result<FieldIdsSetRef> ReferenceVisitor::AlwaysFalse() { return referenced_field_ids_; }
Result<FieldIdsSetRef> ReferenceVisitor::Not(
[[maybe_unused]] const FieldIdsSetRef& child_result) {
return referenced_field_ids_;
}
Result<FieldIdsSetRef> ReferenceVisitor::And(
[[maybe_unused]] const FieldIdsSetRef& left_result,
[[maybe_unused]] const FieldIdsSetRef& right_result) {
return referenced_field_ids_;
}
Result<FieldIdsSetRef> ReferenceVisitor::Or(
[[maybe_unused]] const FieldIdsSetRef& left_result,
[[maybe_unused]] const FieldIdsSetRef& right_result) {
return referenced_field_ids_;
}
Result<FieldIdsSetRef> ReferenceVisitor::Predicate(
const std::shared_ptr<BoundPredicate>& pred) {
referenced_field_ids_.insert(pred->reference()->field_id());
return referenced_field_ids_;
}
Result<FieldIdsSetRef> ReferenceVisitor::Predicate(
[[maybe_unused]] const std::shared_ptr<UnboundPredicate>& pred) {
return InvalidExpression("Cannot get referenced field IDs from unbound predicate");
}
Result<FieldIdsSetRef> ReferenceVisitor::Aggregate(
const std::shared_ptr<BoundAggregate>& aggregate) {
referenced_field_ids_.insert(aggregate->reference()->field_id());
return referenced_field_ids_;
}
Result<FieldIdsSetRef> ReferenceVisitor::Aggregate(
[[maybe_unused]] const std::shared_ptr<UnboundAggregate>& aggregate) {
return InvalidExpression("Cannot get referenced field IDs from unbound aggregate");
}
} // namespace iceberg