Realm C++ SDK Version v2.2.0

rbool.hpp

1
2//
3// Copyright 2022 Realm Inc.
4//
5// Licensed under the Apache License, Version 2.0 (the "License");
6// you may not use this file except in compliance with the License.
7// You may obtain a copy of the License at
8//
9// http://www.apache.org/licenses/LICENSE-2.0
10//
11// Unless required by applicable law or agreed to in writing, software
12// distributed under the License is distributed on an "AS IS" BASIS,
13// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14// See the License for the specific language governing permissions and
15// limitations under the License.
16//
18
19#ifndef CPPREALM_RBOOL_HPP
20#define CPPREALM_RBOOL_HPP
21
22#include <cpprealm/internal/bridge/query.hpp>
23#include <cpprealm/internal/bridge/realm.hpp>
24#include <cpprealm/internal/bridge/table.hpp>
25#include <cpprealm/internal/bridge/utils.hpp>
26#include <cpprealm/types.hpp>
27
28namespace realm {
29 template<typename>
30 struct box_base;
31}
32
33namespace realm {
34 // MARK: rbool
35
36 class rbool {
37 public:
39 internal::bridge::col_key origin_col_key;
40 std::string m_key;
41 };
42
43 rbool& add_link_chain(const internal::bridge::col_key& col_key) {
44 if (m_link_chain) {
45 m_link_chain->link(col_key);
46 } else {
47 m_link_chain = m_table.get_link(col_key);
48 }
49 return *this;
50 }
51
52#define define_query(type, comparison) \
53 rbool& comparison(const internal::bridge::col_key& col_key, const std::optional<type>& rhs) { \
54 if (auto lc = m_link_chain) { \
55 q = lc->column<type>(col_key).comparison(rhs); \
56 m_link_chain = std::nullopt; \
57 } else if (m_dictionary_ctx) { \
58 q = q.dictionary_link_subexpr(m_dictionary_ctx->origin_col_key, col_key, m_dictionary_ctx->m_key).comparison(rhs); \
59 m_dictionary_ctx = std::nullopt; \
60 } else { \
61 if (rhs) { \
62 q = internal::bridge::query(q.get_table()).comparison(col_key, *rhs); \
63 } else { \
64 q = internal::bridge::query(q.get_table()).comparison(col_key, std::nullopt); \
65 } \
66 } \
67 return *this; \
68 } \
69 rbool& comparison(const internal::bridge::col_key& col_key, const type& rhs) { \
70 if (auto lc = m_link_chain) { \
71 q = lc->column<type>(col_key).comparison(std::optional<type>(rhs)); \
72 m_link_chain = std::nullopt; \
73 } else if (m_dictionary_ctx) { \
74 q = q.dictionary_link_subexpr(m_dictionary_ctx->origin_col_key, col_key, m_dictionary_ctx->m_key).comparison(std::optional<type>(rhs)); \
75 m_dictionary_ctx = std::nullopt; \
76 } else { \
77 q = internal::bridge::query(q.get_table()).comparison(col_key, rhs); \
78 } \
79 return *this; \
80 }
81
82#define define_numeric_query(type, comparison) \
83 rbool& comparison(const internal::bridge::col_key& col_key, const type& rhs) { \
84 if (auto lc = m_link_chain) { \
85 q = lc->column<type>(col_key).comparison(::realm::serialize(std::optional<type>(rhs))); \
86 m_link_chain = std::nullopt; \
87 } else if (m_dictionary_ctx) { \
88 q = q.dictionary_link_subexpr(m_dictionary_ctx->origin_col_key, col_key, m_dictionary_ctx->m_key).comparison(std::optional<type>(rhs)); \
89 m_dictionary_ctx = std::nullopt; \
90 } else { \
91 q = internal::bridge::query(q.get_table()).comparison(col_key, rhs); \
92 } \
93 return *this; \
94 }
95
96 define_query(std::string, equal)
97 define_query(std::string, not_equal)
98
99 rbool& contains(const internal::bridge::col_key& col_key, const std::string& rhs, bool case_sensitive = true) {
100 if (auto lc = m_link_chain) {
101 q = lc->column<std::string>(col_key).contains(::realm::serialize(std::optional<std::string>(rhs)), case_sensitive);
102 m_link_chain = std::nullopt;
103 } else {
104 q = internal::bridge::query(q.get_table()).contains(col_key, rhs, case_sensitive);
105 }
106 return *this;
107 }
108
109 define_query(int64_t, equal)
110 define_query(int64_t, not_equal)
111 define_numeric_query(int64_t, greater)
112 define_numeric_query(int64_t, less)
113 define_numeric_query(int64_t, greater_equal)
114 define_numeric_query(int64_t, less_equal)
115
116 define_query(bool, equal)
117 define_query(bool, not_equal)
118
119 define_query(double, equal)
120 define_query(double, not_equal)
121 define_numeric_query(double, greater)
122 define_numeric_query(double, less)
123 define_numeric_query(double, greater_equal)
124 define_numeric_query(double, less_equal)
125
126 define_query(std::vector<uint8_t>, equal)
127 define_query(std::vector<uint8_t>, not_equal)
128
129 define_query(std::chrono::time_point<std::chrono::system_clock>, equal)
130 define_query(std::chrono::time_point<std::chrono::system_clock>, not_equal)
131 define_numeric_query(std::chrono::time_point<std::chrono::system_clock>, greater)
132 define_numeric_query(std::chrono::time_point<std::chrono::system_clock>, less)
133 define_numeric_query(std::chrono::time_point<std::chrono::system_clock>, greater_equal)
134 define_numeric_query(std::chrono::time_point<std::chrono::system_clock>, less_equal)
135
136 define_query(uuid, equal)
137 define_query(uuid, not_equal)
138
139 define_query(object_id, equal)
140 define_query(object_id, not_equal)
141
142 define_query(decimal128, equal)
143 define_query(decimal128, not_equal)
144 define_numeric_query(decimal128, greater)
145 define_numeric_query(decimal128, less)
146 define_numeric_query(decimal128, greater_equal)
147 define_numeric_query(decimal128, less_equal)
148
149 rbool& mixed_equal(const internal::bridge::col_key& col_key, const internal::bridge::mixed& rhs) {
150 if (auto lc = m_link_chain) {
151 q = lc->column<std::string>(col_key).mixed_equal(rhs);
152 m_link_chain = std::nullopt;
153 } else {
154 q.equal(col_key, rhs);
155 }
156 return *this;
157 }
158
159 rbool& mixed_not_equal(const internal::bridge::col_key& col_key, const internal::bridge::mixed& rhs) {
160 if (auto lc = m_link_chain) {
161 q = lc->column_mixed(col_key).mixed_not_equal(rhs);
162 m_link_chain = std::nullopt;
163 } else {
164 q.not_equal(col_key, rhs);
165 }
166 return *this;
167 }
168
169 rbool& link_equal(const internal::bridge::col_key& col_key, const std::optional<internal::bridge::obj>& rhs) {
170 if (auto lc = m_link_chain) {
171 q = lc->column<internal::bridge::obj>(col_key).equal(rhs);
172 m_link_chain = std::nullopt;
173 } else {
174 if (rhs) {
175 q.links_to(col_key, *rhs);
176 } else {
177 q.links_to(col_key, internal::bridge::obj());
178 }
179 }
180 return *this;
181 }
182
183 rbool& link_not_equal(const internal::bridge::col_key& col_key, const std::optional<internal::bridge::obj>& rhs) {
184 if (auto lc = m_link_chain) {
185 q = lc->column<internal::bridge::obj>(col_key).not_equal(rhs);
186 m_link_chain = std::nullopt;
187 } else {
188 if (rhs) {
189 q.not_links_to(col_key, *rhs);
190 } else {
191 q.not_links_to(col_key, internal::bridge::obj());
192 }
193 }
194 return *this;
195 }
196
197 // Dictionary
198
199 rbool& dictionary_has_value_for_key_equals(internal::bridge::col_key column_key, const std::string& key, const internal::bridge::mixed& value) {
200 q = internal::bridge::query(q.get_table()).dictionary_has_value_for_key_equals(column_key, key, value);
201 return *this;
202 }
203
204 rbool& dictionary_has_value_for_key_not_equals(internal::bridge::col_key column_key, const std::string& key, const internal::bridge::mixed& value) {
205 q = internal::bridge::query(q.get_table()).dictionary_has_value_for_key_not_equals(column_key, key, value);
206 return *this;
207 }
208
209 rbool& dictionary_has_value_for_key_greater_than(internal::bridge::col_key column_key, const std::string& key, const internal::bridge::mixed& value) {
210 q = internal::bridge::query(q.get_table()).dictionary_has_value_for_key_greater_than(column_key, key, value);
211 return *this;
212 }
213
214 rbool& dictionary_has_value_for_key_less_than(internal::bridge::col_key column_key, const std::string& key, const internal::bridge::mixed& value) {
215 q = internal::bridge::query(q.get_table()).dictionary_has_value_for_key_less_than(column_key, key, value);
216 return *this;
217 }
218
219 rbool& dictionary_has_value_for_key_greater_than_equals(internal::bridge::col_key column_key, const std::string& key, const internal::bridge::mixed& value) {
220 q = internal::bridge::query(q.get_table()).dictionary_has_value_for_key_greater_than_equals(column_key, key, value);
221 return *this;
222 }
223
224 rbool& dictionary_has_value_for_key_less_than_equals(internal::bridge::col_key column_key, const std::string& key, const internal::bridge::mixed& value) {
225 q = internal::bridge::query(q.get_table()).dictionary_has_value_for_key_less_than_equals(column_key, key, value);
226 return *this;
227 }
228
229 rbool& dictionary_contains_string_for_key(internal::bridge::col_key column_key, const std::string& key, const std::string& value) {
230 q = internal::bridge::query(q.get_table()).dictionary_contains_string_for_key(column_key, key, value);
231 return *this;
232 }
233
234 rbool& add_dictionary_link_chain(dictionary_context&& ctx) {
235 m_dictionary_ctx = ctx;
236 return *this;
237 }
238
239 rbool& dictionary_has_key(internal::bridge::col_key column_key, const std::string& key) {
240 q = internal::bridge::query(q.get_table()).dictionary_contains_key(column_key, key);
241 return *this;
242 }
243
244 ~rbool() {
245 if (is_for_queries)
246 q.~query();
247 }
248 operator bool() const {
249 return b;
250 }
251 rbool operator!() const {
252 if (is_for_queries) {
253 q.negate();
254 return *this;
255 }
256 return !b;
257 }
258 union {
259 bool b;
260 mutable internal::bridge::query q;
261 };
262
263 rbool(internal::bridge::query &&q) : q(q), is_for_queries(true) {
264 m_table = q.get_table();
265 }
266 rbool(bool b) : b(b) {}
267 rbool(const rbool &r) {
268 if (r.is_for_queries) {
269 new (&q) internal::bridge::query(r.q);
270 is_for_queries = true;
271 } else
272 b = r.b;
273 }
274
275 private:
276 bool is_for_queries = false;
277 bool is_dictionary_link = false;
278 std::optional<internal::bridge::link_chain> m_link_chain;
279 internal::bridge::table m_table;
280 std::optional<dictionary_context> m_dictionary_ctx;
281
282 template<typename T>
283 friend struct results;
284 friend rbool operator&&(const rbool &lhs, const rbool &rhs);
285 friend rbool operator||(const rbool &lhs, const rbool &rhs);
286 };
287
288 inline rbool operator &&(const rbool& lhs, const rbool& rhs) {
289 if (lhs.is_for_queries) {
290 lhs.q.and_query(rhs.q);
291 return lhs;
292 }
293 return lhs.b && rhs.b;
294 }
295 inline rbool operator ||(const rbool& lhs, const rbool& rhs) {
296 if (lhs.is_for_queries) {
297 lhs.q = lhs.q || rhs.q;
298 return lhs;
299 }
300 return lhs.b && rhs.b;
301 }
302
304 template<typename T>
305 inline rbool truepredicate(const T& o) {
306 // An empty query returns all results and one way to indicate this
307 // is to serialise TRUEPREDICATE which is functionally equivalent
308 rbool* rb = internal::get_rbool(o);
309 if (rb == nullptr)
310 throw std::runtime_error("Managed object is not used in a query context");
311 auto table = rb->q.get_table();
312 return rbool(table);
313 }
314
316 template<typename T>
317 inline rbool falsepredicate(const T& o) {
318 rbool* rb = internal::get_rbool(o);
319 if (rb == nullptr)
320 throw std::runtime_error("Managed object is not used in a query context");
321 auto table = rb->q.get_table();
322 auto q = internal::bridge::query(table).and_query(internal::bridge::query(table).falsepredicate());
323 return rbool(std::move(q));
324 }
325}
326
327#endif //CPPREALM_RBOOL_HPP
Definition: rbool.hpp:36
Definition: col_key.hpp:28
Definition: rbool.hpp:38