19#ifndef CPPREALM_MANAGED_LIST_HPP
20#define CPPREALM_MANAGED_LIST_HPP
22#include <cpprealm/macros.hpp>
23#include <cpprealm/notifications.hpp>
24#include <cpprealm/observation.hpp>
25#include <cpprealm/types.hpp>
30 struct managed<std::vector<T>, std::enable_if_t<internal::type_info::is_primitive<T>::value>> :
managed_base {
31 using managed<std::vector<T>>::managed_base::operator=;
35 using iterator_category = std::input_iterator_tag;
37 bool operator!=(
const iterator& other)
const
39 return !(*
this == other);
42 bool operator==(
const iterator& other)
const
44 return (m_parent == other.m_parent) && (m_i == other.m_i);
47 T operator*()
const noexcept
49 return (*m_parent)[m_i];
52 iterator& operator++()
58 const iterator& operator++(
int i)
64 template<
typename,
typename>
67 iterator(
size_t i,
managed<std::vector<T>>* parent)
68 : m_i(i), m_parent(parent)
76 return iterator(0,
this);
81 return iterator(size(),
this);
83 [[nodiscard]] std::vector<T> detach()
const {
85 using U =
typename internal::type_info::type_info<T>::internal_type;
87 size_t count = list.size();
89 return std::vector<T>();
91 auto ret = std::vector<T>();
93 for(
size_t i = 0; i < count; i++) {
94 if constexpr (internal::type_info::MixedPersistableConcept<T>::value) {
95 ret.push_back(deserialize<T>(realm::internal::bridge::get<U>(list, i)));
96 }
else if constexpr (std::is_enum_v<T>) {
97 ret.push_back(deserialize<T>(realm::internal::bridge::get<U>(list, i)));
99 ret.push_back(deserialize(realm::internal::bridge::get<U>(list, i)));
106 [[nodiscard]] results<T> as_results()
const {
111 auto list = std::make_shared<realm::internal::bridge::list>(*m_realm, *m_obj, m_key);
113 std::make_shared<realm::collection_callback_wrapper>(
116 token.m_realm = *m_realm;
122 T operator[](
size_t idx)
const {
124 using U =
typename internal::type_info::type_info<T>::internal_type;
125 if constexpr (internal::type_info::MixedPersistableConcept<T>::value) {
126 return deserialize<T>(realm::internal::bridge::get<U>(list, idx));
127 }
else if constexpr (std::is_enum_v<T>) {
128 return static_cast<T
>(deserialize<T>(realm::internal::bridge::get<U>(list, idx)));
130 return deserialize(realm::internal::bridge::get<U>(list, idx));
135 internal::bridge::list(*m_realm, *m_obj, m_key).remove(size() - 1);
137 void erase(
size_t idx) {
138 internal::bridge::list(*m_realm, *m_obj, m_key).remove(idx);
141 internal::bridge::list(*m_realm, *m_obj, m_key).remove_all();
143 void push_back(
const T& value) {
144 auto list = internal::bridge::list(*m_realm, *m_obj, m_key);
145 list.add(serialize(value));
148 return internal::bridge::list(*m_realm, *m_obj, m_key).size();
150 size_t find(
const T& a) {
151 if constexpr (std::is_enum_v<T>) {
152 return internal::bridge::list(*m_realm, *m_obj, m_key).find(
static_cast<int64_t
>(a));
154 return internal::bridge::list(*m_realm, *m_obj, m_key).find(a);
157 void set(
size_t pos,
const T& a) {
158 internal::bridge::list(*m_realm, *m_obj, m_key).set(pos, a);
161 results<T> sort(
bool ascending) {
162 return results<T>(internal::bridge::list(*m_realm, *m_obj, m_key)
163 .sort(std::vector<internal::bridge::sort_descriptor>({{
"self", ascending}})));
168 managed(
const managed&) =
delete;
169 managed(managed &&) =
delete;
170 managed& operator=(
const managed&) =
delete;
171 managed& operator=(managed&&) =
delete;
172 template<
typename,
typename>
173 friend struct managed;
179 [[nodiscard]] std::vector<T*> detach()
const {
181 size_t count = list.size();
183 return std::vector<T*>();
184 auto ret = std::vector<T*>();
186 for(
size_t i = 0; i < count; i++) {
187 managed<T> m(realm::internal::bridge::get<internal::bridge::obj>(list, i), *m_realm);
189 auto assign = [&m, &v](
auto& pair) {
190 (*v).*(std::decay_t<
decltype(pair.first)>::ptr) = (m.*(pair.second)).detach();
193 std::apply([&v, &m, &assign](
auto && ...pair) {
210 using difference_type = std::ptrdiff_t;
212 using reference = T&;
213 using iterator_category = std::forward_iterator_tag;
215 bool operator!=(
const iterator& other)
const
217 return !(*
this == other);
220 bool operator==(
const iterator& other)
const
222 return (m_parent == other.m_parent) && (m_i == other.m_i);
228 managed<T> m(realm::internal::bridge::get<realm::internal::bridge::obj>(list, m_i), *m_parent->m_realm);
229 return {std::move(m)};
232 iterator& operator++()
238 const iterator& operator++(
int i)
244 template<
typename,
typename>
247 iterator(
size_t i,
managed<std::vector<T*>>* parent)
248 : m_i(i), m_parent(parent)
257 return iterator(0,
this);
262 return iterator(size(),
this);
266 internal::bridge::list(*m_realm, *m_obj, m_key).remove(size() - 1);
268 void erase(
size_t idx) {
269 internal::bridge::list(*m_realm, *m_obj, m_key).remove(idx);
272 internal::bridge::list(*m_realm, *m_obj, m_key).remove_all();
274 void push_back(T* value)
276 auto list = internal::bridge::list(*m_realm, *m_obj, m_key);
277 auto table = m_obj->get_target_table(m_key);
278 internal::bridge::obj m_obj;
279 if constexpr (managed<T>::schema.HasPrimaryKeyProperty) {
280 auto pk = (*value).*(managed<T>::schema.primary_key().ptr);
282 }
else if (managed<T>::schema.is_embedded()) {
283 m_obj = list.add_embedded();
285 m_obj = table.create_object();
287 std::apply([&m_obj, &value, realm = *m_realm](
auto && ...p) {
288 (accessor<
typename std::decay_t<
decltype(p)>::Result>::set(
289 m_obj, m_obj.get_table().get_column_key(p.name), realm,
290 (*value).*(std::decay_t<
decltype(p)>::ptr)), ...);
291 }, managed<T, void>::schema.ps);
292 if (!managed<T>::schema.is_embedded()) {
293 list.add(m_obj.get_key());
296 void push_back(
const managed<T>& value)
298 auto list = internal::bridge::list(*m_realm, *m_obj, m_key);
299 if (!managed<T>::schema.is_embedded()) {
300 list.add(value.m_obj.get_key());
302 throw std::logic_error(
"Cannot add existing embedded object to managed list.");
305 void push_back(
const managed<T*>& value)
307 if (!managed<T>::schema.is_embedded()) {
308 auto list = internal::bridge::list(*m_realm, *m_obj, m_key);
309 list.add(value.m_obj->get_key());
311 throw std::logic_error(
"Cannot add existing embedded object to managed list.");
317 return internal::bridge::list(*m_realm, *m_obj, m_key).size();
319 size_t find(
const managed<T>& a) {
320 return internal::bridge::list(*m_realm, *m_obj, m_key).find(a.m_obj.get_key());
322 size_t find(
const typename managed<T*>::ref_type& a)
const {
323 return internal::bridge::list(*m_realm, *m_obj, m_key).find(a->m_obj.get_key());
325 typename managed<T*>::ref_type operator[](
size_t idx)
const {
327 return typename managed<T*>::ref_type(managed<T>(realm::internal::bridge::get<realm::internal::bridge::obj>(list, idx), *m_realm));
331 auto list = std::make_shared<realm::internal::bridge::list>(*m_realm, *m_obj, m_key);
333 std::make_shared<realm::collection_callback_wrapper>(
336 token.m_realm = *m_realm;
341 results<T> where(
const std::string &query,
const std::vector<realm::mixed> &arguments) {
342 std::vector<internal::bridge::mixed> mixed_args;
343 for(
auto& a : arguments)
344 mixed_args.push_back(serialize(a));
345 return results<T>(internal::bridge::results(*m_realm, m_obj->get_target_table(m_key).query(query, std::move(mixed_args))));
348 results<T> where(std::function<rbool(managed<T> &)> &&fn) {
349 static_assert(
sizeof(managed<T>),
"Must declare schema for T");
350 auto schema = m_realm->schema().find(managed<T>::schema.name);
351 auto group = m_realm->read_group();
352 auto table_ref = group.get_table(schema.table_key());
353 rbool query = rbool(internal::bridge::query(table_ref));
354 auto query_object = managed<T>::prepare_for_query(*m_realm, &query);
355 auto full_query = fn(query_object).q;
356 return results<T>(internal::bridge::results(*m_realm, full_query));
359 results<T> sort(
const std::string &key_path,
bool ascending) {
360 auto schema = m_realm->schema().find(managed<T>::schema.name);
361 auto table_ref = m_obj->get_target_table(m_key);
362 return results<T>(internal::bridge::results(*m_realm, table_ref)).sort({{key_path, ascending}});
365 results<T> sort(
const std::vector<internal::bridge::sort_descriptor> &sort_descriptors) {
366 auto schema = m_realm->schema().find(managed<T>::schema.name);
367 auto table_ref = m_obj->get_target_table(m_key);
368 return results<T>(internal::bridge::results(*m_realm, table_ref)).sort(sort_descriptors);
373 managed(
const managed&) =
delete;
374 managed(managed &&) =
delete;
375 managed& operator=(
const managed&) =
delete;
376 managed& operator=(managed&&) =
delete;
377 template<
typename,
typename>
378 friend struct managed;
Definition: observation.hpp:176
Definition: macros.hpp:286
Definition: notifications.hpp:38
Definition: results.hpp:411