Blame view

Pods/Realm/include/core/realm/query.hpp 16.4 KB
75d24c15   yangbin   123
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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
  /*************************************************************************
   *
   * Copyright 2016 Realm Inc.
   *
   * Licensed 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.
   *
   **************************************************************************/
  
  #ifndef REALM_QUERY_HPP
  #define REALM_QUERY_HPP
  
  #include <cstdint>
  #include <cstdio>
  #include <climits>
  #include <algorithm>
  #include <string>
  #include <vector>
  
  #define REALM_MULTITHREAD_QUERY 0
  
  #if REALM_MULTITHREAD_QUERY
  // FIXME: Use our C++ thread abstraction API since it provides a much
  // higher level of encapsulation and safety.
  #include <pthread.h>
  #endif
  
  #include <realm/aggregate_ops.hpp>
  #include <realm/obj_list.hpp>
  #include <realm/table_ref.hpp>
  #include <realm/binary_data.hpp>
  #include <realm/timestamp.hpp>
  #include <realm/handover_defs.hpp>
  #include <realm/util/serializer.hpp>
  #include <realm/column_type_traits.hpp>
  
  namespace realm {
  
  
  // Pre-declarations
  class ParentNode;
  class Table;
  class TableView;
  class TableView;
  class Array;
  class Expression;
  class Group;
  class Transaction;
  
  namespace metrics {
  class QueryInfo;
  }
  
  struct QueryGroup {
      enum class State {
          Default,
          OrCondition,
          OrConditionChildren,
      };
  
      QueryGroup() = default;
  
      QueryGroup(const QueryGroup&);
      QueryGroup& operator=(const QueryGroup&);
  
      QueryGroup(QueryGroup&&) = default;
      QueryGroup& operator=(QueryGroup&&) = default;
  
      std::unique_ptr<ParentNode> m_root_node;
  
      bool m_pending_not = false;
      State m_state = State::Default;
  };
  
  class Query final {
  public:
      Query(ConstTableRef table, TableView* tv = nullptr);
      Query(ConstTableRef table, std::unique_ptr<TableView>);
      Query(ConstTableRef table, const ObjList& list);
      Query(ConstTableRef table, LinkCollectionPtr&& list_ptr);
      Query();
      Query(std::unique_ptr<Expression>);
      ~Query() noexcept;
  
      Query(const Query& copy);
      Query& operator=(const Query& source);
  
      Query(Query&&);
      Query& operator=(Query&&);
  
      // Find links that point to a specific target row
      Query& links_to(ColKey column_key, ObjKey target_key);
      // Find links that point to a specific object (for Mixed columns)
      Query& links_to(ColKey column_key, ObjLink target_link);
      // Find links that point to specific target objects
      Query& links_to(ColKey column_key, const std::vector<ObjKey>& target_obj);
  
      // Conditions: null
      Query& equal(ColKey column_key, null);
      Query& not_equal(ColKey column_key, null);
  
      // Conditions: int64_t
      Query& equal(ColKey column_key, int64_t value);
      Query& not_equal(ColKey column_key, int64_t value);
      Query& greater(ColKey column_key, int64_t value);
      Query& greater_equal(ColKey column_key, int64_t value);
      Query& less(ColKey column_key, int64_t value);
      Query& less_equal(ColKey column_key, int64_t value);
      Query& between(ColKey column_key, int64_t from, int64_t to);
  
      // Conditions: int (we need those because conversion from '1234' is ambiguous with float/double)
      Query& equal(ColKey column_key, int value);
      Query& not_equal(ColKey column_key, int value);
      Query& greater(ColKey column_key, int value);
      Query& greater_equal(ColKey column_key, int value);
      Query& less(ColKey column_key, int value);
      Query& less_equal(ColKey column_key, int value);
      Query& between(ColKey column_key, int from, int to);
  
      // Conditions: float
      Query& equal(ColKey column_key, float value);
      Query& not_equal(ColKey column_key, float value);
      Query& greater(ColKey column_key, float value);
      Query& greater_equal(ColKey column_key, float value);
      Query& less(ColKey column_key, float value);
      Query& less_equal(ColKey column_key, float value);
      Query& between(ColKey column_key, float from, float to);
  
      // Conditions: double
      Query& equal(ColKey column_key, double value);
      Query& not_equal(ColKey column_key, double value);
      Query& greater(ColKey column_key, double value);
      Query& greater_equal(ColKey column_key, double value);
      Query& less(ColKey column_key, double value);
      Query& less_equal(ColKey column_key, double value);
      Query& between(ColKey column_key, double from, double to);
  
      // Conditions: timestamp
      Query& equal(ColKey column_key, Timestamp value);
      Query& not_equal(ColKey column_key, Timestamp value);
      Query& greater(ColKey column_key, Timestamp value);
      Query& greater_equal(ColKey column_key, Timestamp value);
      Query& less_equal(ColKey column_key, Timestamp value);
      Query& less(ColKey column_key, Timestamp value);
  
      // Conditions: ObjectId
      Query& equal(ColKey column_key, ObjectId value);
      Query& not_equal(ColKey column_key, ObjectId value);
      Query& greater(ColKey column_key, ObjectId value);
      Query& greater_equal(ColKey column_key, ObjectId value);
      Query& less_equal(ColKey column_key, ObjectId value);
      Query& less(ColKey column_key, ObjectId value);
  
      // Conditions: UUID
      Query& equal(ColKey column_key, UUID value);
      Query& not_equal(ColKey column_key, UUID value);
      Query& greater(ColKey column_key, UUID value);
      Query& greater_equal(ColKey column_key, UUID value);
      Query& less_equal(ColKey column_key, UUID value);
      Query& less(ColKey column_key, UUID value);
  
      // Conditions: Decimal128
      Query& equal(ColKey column_key, Decimal128 value);
      Query& not_equal(ColKey column_key, Decimal128 value);
      Query& greater(ColKey column_key, Decimal128 value);
      Query& greater_equal(ColKey column_key, Decimal128 value);
      Query& less_equal(ColKey column_key, Decimal128 value);
      Query& less(ColKey column_key, Decimal128 value);
      Query& between(ColKey column_key, Decimal128 from, Decimal128 to);
  
      // Conditions: Mixed
      Query& equal(ColKey column_key, Mixed value, bool case_sensitive = true);
      Query& not_equal(ColKey column_key, Mixed value, bool case_sensitive = true);
      Query& greater(ColKey column_key, Mixed value);
      Query& greater_equal(ColKey column_key, Mixed value);
      Query& less(ColKey column_key, Mixed value);
      Query& less_equal(ColKey column_key, Mixed value);
      Query& begins_with(ColKey column_key, Mixed value, bool case_sensitive = true);
      Query& ends_with(ColKey column_key, Mixed value, bool case_sensitive = true);
      Query& contains(ColKey column_key, Mixed value, bool case_sensitive = true);
      Query& like(ColKey column_key, Mixed value, bool case_sensitive = true);
  
      // Conditions: size
      Query& size_equal(ColKey column_key, int64_t value);
      Query& size_not_equal(ColKey column_key, int64_t value);
      Query& size_greater(ColKey column_key, int64_t value);
      Query& size_greater_equal(ColKey column_key, int64_t value);
      Query& size_less_equal(ColKey column_key, int64_t value);
      Query& size_less(ColKey column_key, int64_t value);
      Query& size_between(ColKey column_key, int64_t from, int64_t to);
  
      // Conditions: bool
      Query& equal(ColKey column_key, bool value);
      Query& not_equal(ColKey column_key, bool value);
  
      // Conditions: strings
      Query& equal(ColKey column_key, StringData value, bool case_sensitive = true);
      Query& not_equal(ColKey column_key, StringData value, bool case_sensitive = true);
      Query& begins_with(ColKey column_key, StringData value, bool case_sensitive = true);
      Query& ends_with(ColKey column_key, StringData value, bool case_sensitive = true);
      Query& contains(ColKey column_key, StringData value, bool case_sensitive = true);
      Query& like(ColKey column_key, StringData value, bool case_sensitive = true);
  
      // These are shortcuts for equal(StringData(c_str)) and
      // not_equal(StringData(c_str)), and are needed to avoid unwanted
      // implicit conversion of char* to bool.
      Query& equal(ColKey column_key, const char* c_str, bool case_sensitive = true);
      Query& not_equal(ColKey column_key, const char* c_str, bool case_sensitive = true);
  
      // Conditions: binary data
      Query& equal(ColKey column_key, BinaryData value, bool case_sensitive = true);
      Query& not_equal(ColKey column_key, BinaryData value, bool case_sensitive = true);
      Query& begins_with(ColKey column_key, BinaryData value, bool case_sensitive = true);
      Query& ends_with(ColKey column_key, BinaryData value, bool case_sensitive = true);
      Query& contains(ColKey column_key, BinaryData value, bool case_sensitive = true);
      Query& like(ColKey column_key, BinaryData b, bool case_sensitive = true);
  
      // Conditions: untyped column vs column comparison
      // if the column types are not comparable, an exception is thrown
      Query& equal(ColKey column_key1, ColKey column_key2);
      Query& less(ColKey column_key1, ColKey column_key2);
      Query& less_equal(ColKey column_key1, ColKey column_key2);
      Query& greater(ColKey column_key1, ColKey column_key2);
      Query& greater_equal(ColKey column_key1, ColKey column_key2);
      Query& not_equal(ColKey column_key1, ColKey column_key2);
  
      // Negation
      Query& Not();
  
      // Grouping
      Query& group();
      Query& end_group();
      Query& Or();
  
      Query& and_query(const Query& q);
      Query& and_query(Query&& q);
      Query operator||(const Query& q);
      Query operator&&(const Query& q);
      Query operator!();
  
  
      // Searching
      ObjKey find();
      TableView find_all(size_t start = 0, size_t end = size_t(-1), size_t limit = size_t(-1));
  
      // Aggregates
      size_t count() const;
      TableView find_all(const DescriptorOrdering& descriptor);
      size_t count(const DescriptorOrdering& descriptor);
      int64_t sum_int(ColKey column_key) const;
      double average_int(ColKey column_key, size_t* resultcount = nullptr) const;
      int64_t maximum_int(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      int64_t minimum_int(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      double sum_float(ColKey column_key) const;
      double average_float(ColKey column_key, size_t* resultcount = nullptr) const;
      float maximum_float(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      float minimum_float(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      double sum_double(ColKey column_key) const;
      double average_double(ColKey column_key, size_t* resultcount = nullptr) const;
      double maximum_double(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      double minimum_double(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      Timestamp maximum_timestamp(ColKey column_key, ObjKey* return_ndx = nullptr);
      Timestamp minimum_timestamp(ColKey column_key, ObjKey* return_ndx = nullptr);
      Decimal128 sum_decimal128(ColKey column_key) const;
      Decimal128 maximum_decimal128(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      Decimal128 minimum_decimal128(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      Decimal128 average_decimal128(ColKey column_key, size_t* resultcount = nullptr) const;
      Decimal128 sum_mixed(ColKey column_key) const;
      Mixed maximum_mixed(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      Mixed minimum_mixed(ColKey column_key, ObjKey* return_ndx = nullptr) const;
      Decimal128 average_mixed(ColKey column_key, size_t* resultcount = nullptr) const;
  
      // Deletion
      size_t remove();
  
  #if REALM_MULTITHREAD_QUERY
      // Multi-threading
      TableView find_all_multi(size_t start = 0, size_t end = size_t(-1));
      TableView find_all_multi(size_t start = 0, size_t end = size_t(-1)) const;
      int set_threads(unsigned int threadcount);
  #endif
  
      const ConstTableRef& get_table() const noexcept
      {
          return m_table;
      }
  
      ConstTableRef& get_table()
      {
          return m_table;
      }
  
      void get_outside_versions(TableVersions&) const;
  
      // True if matching rows are guaranteed to be returned in table order.
      bool produces_results_in_table_order() const
      {
          return !m_view;
      }
  
      // Get the ObjKey of the object which owns the restricting view, or null
      // if that is not applicable
      ObjKey view_owner_obj_key() const noexcept
      {
          return m_view ? m_view->get_owning_obj().get_key() : ObjKey{};
      }
  
      // Calls sync_if_needed on the restricting view, if present.
      // Returns the current version of the table(s) this query depends on,
      // or empty vector if the query is not associated with a table.
      TableVersions sync_view_if_needed() const;
  
      std::string validate();
  
      std::string get_description(const std::string& class_prefix = "") const;
      std::string get_description(util::serializer::SerialisationState& state) const;
  
      Query& set_ordering(std::unique_ptr<DescriptorOrdering> ordering);
      std::shared_ptr<DescriptorOrdering> get_ordering();
  
      bool eval_object(const Obj& obj) const;
  
  private:
      void create();
  
      void init() const;
      size_t find_internal(size_t start = 0, size_t end = size_t(-1)) const;
      void handle_pending_not();
      void set_table(TableRef tr);
  
  public:
      std::unique_ptr<Query> clone_for_handover(Transaction* tr, PayloadPolicy policy) const
      {
          return std::make_unique<Query>(this, tr, policy);
      }
  
      Query(const Query* source, Transaction* tr, PayloadPolicy policy);
      Query(const Query& source, Transaction* tr, PayloadPolicy policy)
          : Query(&source, tr, policy)
      {
      }
  
  private:
      void add_expression_node(std::unique_ptr<Expression>);
  
      template <typename TConditionFunction, class T>
      Query& add_condition(ColKey column_key, T value);
  
      template <typename TConditionFunction>
      Query& add_size_condition(ColKey column_key, int64_t value);
  
      template <typename T,
                typename R = typename aggregate_operations::Average<typename util::RemoveOptional<T>::type>::ResultType>
      R average(ColKey column_key, size_t* resultcount = nullptr) const;
  
      template <typename T>
      void aggregate(QueryStateBase& st, ColKey column_key, size_t* resultcount = nullptr,
                     ObjKey* return_ndx = nullptr) const;
  
      size_t find_best_node(ParentNode* pn) const;
      void aggregate_internal(ParentNode* pn, QueryStateBase* st, size_t start, size_t end,
                              ArrayPayload* source_column) const;
  
      void find_all(TableView& tv, size_t start = 0, size_t end = size_t(-1), size_t limit = size_t(-1)) const;
      size_t do_count(size_t limit = size_t(-1)) const;
      void delete_nodes() noexcept;
  
      bool has_conditions() const
      {
          return m_groups.size() > 0 && m_groups[0].m_root_node;
      }
      ParentNode* root_node() const
      {
          REALM_ASSERT(m_groups.size());
          return m_groups[0].m_root_node.get();
      }
  
      void add_node(std::unique_ptr<ParentNode>);
  
      friend class Table;
      friend class TableView;
      friend class SubQueryCount;
      friend class PrimitiveListCount;
      friend class metrics::QueryInfo;
  
      std::string error_code;
  
      std::vector<QueryGroup> m_groups;
      mutable std::vector<TableKey> m_table_keys;
  
      TableRef m_table;
  
      // points to the base class of the restricting view. If the restricting
      // view is a link view, m_source_collection is non-zero. If it is a table view,
      // m_source_table_view is non-zero.
      ObjList* m_view = nullptr;
  
      // At most one of these can be non-zero, and if so the non-zero one indicates the restricting view.
      //
      // m_source_collection is a pointer to a collection which must also be a ObjList*
      // this includes: LnkLst, LnkSet, and DictionaryLinkValues. It cannot be a list of primitives because
      // it is used to populate a query through a collection of objects and there are asserts for this.
      LinkCollectionPtr m_source_collection;         // collections are owned by the query.
      TableView* m_source_table_view = nullptr;      // table views are not refcounted, and not owned by the query.
      std::unique_ptr<TableView> m_owned_source_table_view; // <--- except when indicated here
      std::shared_ptr<DescriptorOrdering> m_ordering;
  };
  
  // Implementation:
  
  inline Query& Query::equal(ColKey column_key, const char* c_str, bool case_sensitive)
  {
      return equal(column_key, StringData(c_str), case_sensitive);
  }
  
  inline Query& Query::not_equal(ColKey column_key, const char* c_str, bool case_sensitive)
  {
      return not_equal(column_key, StringData(c_str), case_sensitive);
  }
  
  } // namespace realm
  
  #endif // REALM_QUERY_HPP