diff --git a/adl__pointer_8hpp_source.html b/adl__pointer_8hpp_source.html index 5b444e472..5c9e28fff 100644 --- a/adl__pointer_8hpp_source.html +++ b/adl__pointer_8hpp_source.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -90,7 +90,7 @@ $(function() {
33 } // namespace entt
34 
35 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::dereference_meta_pointer_like
decltype(auto) dereference_meta_pointer_like(const Type &value)
ADL based lookup function for dereferencing meta pointer-like types.
Definition: adl_pointer.hpp:13
entt::adl_meta_pointer_like
Fake ADL based lookup function for meta pointer-like types.
Definition: adl_pointer.hpp:22
entt::adl_meta_pointer_like::dereference
static decltype(auto) dereference(const Type &value)
Uses the default ADL based lookup method to resolve the call.
Definition: adl_pointer.hpp:28
diff --git a/algorithm_8hpp_source.html b/algorithm_8hpp_source.html index 3fa8cf1f9..b86e9cde3 100644 --- a/algorithm_8hpp_source.html +++ b/algorithm_8hpp_source.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -154,7 +154,7 @@ $(function() {
135 } // namespace entt
136 
137 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::insertion_sort
Function object for performing insertion sort.
Definition: algorithm.hpp:42
entt::insertion_sort::operator()
void operator()(It first, It last, Compare compare=Compare{}) const
Sorts the elements in a range.
Definition: algorithm.hpp:55
entt::radix_sort
Function object for performing LSD radix sort.
Definition: algorithm.hpp:77
diff --git a/android-ndk-r17_8hpp_source.html b/android-ndk-r17_8hpp_source.html index 5b31b6c67..23bd3d4e7 100644 --- a/android-ndk-r17_8hpp_source.html +++ b/android-ndk-r17_8hpp_source.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
diff --git a/annotated.html b/annotated.html index 3e24cb324..db1fe5376 100644 --- a/annotated.html +++ b/annotated.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -69,8 +69,8 @@ $(function() {
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level 123]
- - + + @@ -83,170 +83,166 @@ $(function() { - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - + +
 ►NenttEnTT default namespace
 ►Nstd
diff --git a/any_8hpp_source.html b/any_8hpp_source.html index 75315ddc3..d9f0d2f9a 100644 --- a/any_8hpp_source.html +++ b/any_8hpp_source.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -111,58 +111,58 @@ $(function() {
44 
45  template<typename Type>
46  static const void *basic_vtable([[maybe_unused]] const operation op, [[maybe_unused]] const basic_any &value, [[maybe_unused]] const void *other) {
-
47  static_assert(!std::is_same_v<Type, void> && std::is_same_v<std::remove_reference_t<std::remove_const_t<Type>>, Type>, "Invalid type");
-
48  const Type *instance = nullptr;
+
47  static_assert(!std::is_same_v<Type, void> && std::is_same_v<std::remove_cv_t<std::remove_reference_t<Type>>, Type>, "Invalid type");
+
48  const Type *element = nullptr;
49 
50  if constexpr(in_situ<Type>) {
-
51  instance = (value.mode == policy::owner) ? ENTT_LAUNDER(reinterpret_cast<const Type *>(&value.storage)) : static_cast<const Type *>(value.instance);
+
51  element = value.owner() ? reinterpret_cast<const Type *>(&value.storage) : static_cast<const Type *>(value.instance);
52  } else {
-
53  instance = static_cast<const Type *>(value.instance);
+
53  element = static_cast<const Type *>(value.instance);
54  }
55 
56  switch(op) {
57  case operation::copy:
58  if constexpr(std::is_copy_constructible_v<Type>) {
-
59  static_cast<basic_any *>(const_cast<void *>(other))->initialize<Type>(*instance);
+
59  static_cast<basic_any *>(const_cast<void *>(other))->initialize<Type>(*element);
60  }
61  break;
62  case operation::move:
63  if constexpr(in_situ<Type>) {
-
64  if(value.mode == policy::owner) {
-
65  return new(&static_cast<basic_any *>(const_cast<void *>(other))->storage) Type{std::move(*const_cast<Type *>(instance))};
+
64  if(value.owner()) {
+
65  return new(&static_cast<basic_any *>(const_cast<void *>(other))->storage) Type{std::move(*const_cast<Type *>(element))};
66  }
67  }
68 
69  return (static_cast<basic_any *>(const_cast<void *>(other))->instance = std::exchange(const_cast<basic_any &>(value).instance, nullptr));
70  case operation::transfer:
71  if constexpr(std::is_move_assignable_v<Type>) {
-
72  *const_cast<Type *>(instance) = std::move(*static_cast<Type *>(const_cast<void *>(other)));
+
72  *const_cast<Type *>(element) = std::move(*static_cast<Type *>(const_cast<void *>(other)));
73  return other;
74  }
75  [[fallthrough]];
76  case operation::assign:
77  if constexpr(std::is_copy_assignable_v<Type>) {
-
78  *const_cast<Type *>(instance) = *static_cast<const Type *>(other);
+
78  *const_cast<Type *>(element) = *static_cast<const Type *>(other);
79  return other;
80  }
81  break;
82  case operation::destroy:
83  if constexpr(in_situ<Type>) {
-
84  instance->~Type();
+
84  element->~Type();
85  } else if constexpr(std::is_array_v<Type>) {
-
86  delete[] instance;
+
86  delete[] element;
87  } else {
-
88  delete instance;
+
88  delete element;
89  }
90  break;
91  case operation::compare:
92  if constexpr(!std::is_function_v<Type> && !std::is_array_v<Type> && is_equality_comparable_v<Type>) {
-
93  return *static_cast<const Type *>(instance) == *static_cast<const Type *>(other) ? other : nullptr;
+
93  return *static_cast<const Type *>(element) == *static_cast<const Type *>(other) ? other : nullptr;
94  } else {
-
95  return (instance == other) ? other : nullptr;
+
95  return (element == other) ? other : nullptr;
96  }
97  case operation::get:
-
98  return instance;
+
98  return element;
99  }
100 
101  return nullptr;
@@ -171,8 +171,8 @@ $(function() {
104  template<typename Type, typename... Args>
105  void initialize([[maybe_unused]] Args &&...args) {
106  if constexpr(!std::is_void_v<Type>) {
-
107  vtable = basic_vtable<std::remove_const_t<std::remove_reference_t<Type>>>;
-
108  info = &type_id<Type>();
+
107  info = &type_id<std::remove_cv_t<std::remove_reference_t<Type>>>();
+
108  vtable = basic_vtable<std::remove_cv_t<std::remove_reference_t<Type>>>;
109 
110  if constexpr(std::is_lvalue_reference_v<Type>) {
111  static_assert(sizeof...(Args) == 1u && (std::is_lvalue_reference_v<Args> && ...), "Invalid arguments");
@@ -194,7 +194,7 @@ $(function() {
127  }
128  }
129 
-
130  basic_any(const basic_any &other, const policy pol) ENTT_NOEXCEPT
+
130  basic_any(const basic_any &other, const policy pol) ENTT_NOEXCEPT
131  : instance{other.data()},
132  info{other.info},
133  vtable{other.vtable},
@@ -204,7 +204,7 @@ $(function() {
138  static constexpr auto length = Len;
140  static constexpr auto alignment = Align;
141 
-
143  basic_any() ENTT_NOEXCEPT
+
143  constexpr basic_any() ENTT_NOEXCEPT
144  : instance{},
145  info{&type_id<void>()},
146  vtable{},
@@ -240,7 +240,7 @@ $(function() {
195  }
196 
198  ~basic_any() {
-
199  if(vtable && mode == policy::owner) {
+
199  if(vtable && owner()) {
200  vtable(operation::destroy, *this, nullptr);
201  }
202  }
@@ -275,7 +275,7 @@ $(function() {
247  return *this;
248  }
249 
-
254  [[nodiscard]] const type_info &type() const ENTT_NOEXCEPT {
+
254  [[nodiscard]] const type_info &type() const ENTT_NOEXCEPT {
255  return *info;
256  }
257 
@@ -283,7 +283,7 @@ $(function() {
263  return vtable ? vtable(operation::get, *this, nullptr) : nullptr;
264  }
265 
-
271  [[nodiscard]] const void *data(const type_info &req) const ENTT_NOEXCEPT {
+
271  [[nodiscard]] const void *data(const type_info &req) const ENTT_NOEXCEPT {
272  return *info == req ? data() : nullptr;
273  }
274 
@@ -291,7 +291,7 @@ $(function() {
280  return (!vtable || mode == policy::cref) ? nullptr : const_cast<void *>(vtable(operation::get, *this, nullptr));
281  }
282 
-
288  [[nodiscard]] void *data(const type_info &req) ENTT_NOEXCEPT {
+
288  [[nodiscard]] void *data(const type_info &req) ENTT_NOEXCEPT {
289  return *info == req ? data() : nullptr;
290  }
291 
@@ -309,157 +309,157 @@ $(function() {
314  return false;
315  }
316 
-
322  bool assign(any &&other) {
-
323  if(vtable && mode != policy::cref && *info == *other.info) {
-
324  if(auto *val = other.data(); val) {
-
325  return (vtable(operation::transfer, *this, val) != nullptr);
-
326  } else {
-
327  return (vtable(operation::assign, *this, std::as_const(other).data()) != nullptr);
-
328  }
-
329  }
-
330 
-
331  return false;
-
332  }
-
333 
-
335  void reset() {
-
336  if(vtable && mode == policy::owner) {
-
337  vtable(operation::destroy, *this, nullptr);
-
338  }
-
339 
-
340  info = &type_id<void>();
-
341  vtable = nullptr;
-
342  mode = policy::owner;
-
343  }
-
344 
-
349  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
-
350  return vtable != nullptr;
-
351  }
-
352 
-
358  bool operator==(const basic_any &other) const ENTT_NOEXCEPT {
-
359  if(vtable && *info == *other.info) {
-
360  return (vtable(operation::compare, *this, other.data()) != nullptr);
-
361  }
-
362 
-
363  return (!vtable && !other.vtable);
-
364  }
-
365 
-
370  [[nodiscard]] basic_any as_ref() ENTT_NOEXCEPT {
-
371  return basic_any{*this, (mode == policy::cref ? policy::cref : policy::ref)};
-
372  }
-
373 
-
375  [[nodiscard]] basic_any as_ref() const ENTT_NOEXCEPT {
-
376  return basic_any{*this, policy::cref};
-
377  }
-
378 
-
383  [[nodiscard]] bool owner() const ENTT_NOEXCEPT {
-
384  return (mode == policy::owner);
-
385  }
-
386 
-
387 private:
-
388  union {
-
389  const void *instance;
-
390  storage_type storage;
-
391  };
-
392  const type_info *info;
-
393  vtable_type *vtable;
-
394  policy mode;
-
395 };
-
396 
-
405 template<std::size_t Len, std::size_t Align>
-
406 [[nodiscard]] inline bool operator!=(const basic_any<Len, Align> &lhs, const basic_any<Len, Align> &rhs) ENTT_NOEXCEPT {
-
407  return !(lhs == rhs);
-
408 }
-
409 
-
418 template<typename Type, std::size_t Len, std::size_t Align>
-
419 Type any_cast(const basic_any<Len, Align> &data) ENTT_NOEXCEPT {
-
420  const auto *const instance = any_cast<std::remove_reference_t<Type>>(&data);
-
421  ENTT_ASSERT(instance, "Invalid instance");
-
422  return static_cast<Type>(*instance);
-
423 }
-
424 
-
426 template<typename Type, std::size_t Len, std::size_t Align>
-
427 Type any_cast(basic_any<Len, Align> &data) ENTT_NOEXCEPT {
-
428  // forces const on non-reference types to make them work also with wrappers for const references
-
429  auto *const instance = any_cast<std::remove_reference_t<const Type>>(&data);
-
430  ENTT_ASSERT(instance, "Invalid instance");
-
431  return static_cast<Type>(*instance);
-
432 }
-
433 
-
435 template<typename Type, std::size_t Len, std::size_t Align>
-
436 Type any_cast(basic_any<Len, Align> &&data) ENTT_NOEXCEPT {
-
437  if constexpr(std::is_copy_constructible_v<std::remove_const_t<std::remove_reference_t<Type>>>) {
-
438  if(auto *const instance = any_cast<std::remove_reference_t<Type>>(&data); instance) {
-
439  return static_cast<Type>(std::move(*instance));
-
440  } else {
-
441  return any_cast<Type>(data);
-
442  }
-
443  } else {
-
444  auto *const instance = any_cast<std::remove_reference_t<Type>>(&data);
-
445  ENTT_ASSERT(instance, "Invalid instance");
-
446  return static_cast<Type>(std::move(*instance));
-
447  }
-
448 }
-
449 
-
451 template<typename Type, std::size_t Len, std::size_t Align>
-
452 const Type *any_cast(const basic_any<Len, Align> *data) ENTT_NOEXCEPT {
-
453  const auto &info = type_id<std::remove_const_t<std::remove_reference_t<Type>>>();
-
454  return static_cast<const Type *>(data->data(info));
-
455 }
-
456 
-
458 template<typename Type, std::size_t Len, std::size_t Align>
-
459 Type *any_cast(basic_any<Len, Align> *data) ENTT_NOEXCEPT {
-
460  const auto &info = type_id<std::remove_const_t<std::remove_reference_t<Type>>>();
-
461  // last attempt to make wrappers for const references return their values
-
462  return static_cast<Type *>(static_cast<constness_as_t<basic_any<Len, Align>, Type> *>(data)->data(info));
-
463 }
-
464 
-
474 template<typename Type, std::size_t Len = basic_any<>::length, std::size_t Align = basic_any<Len>::alignment, typename... Args>
-
475 basic_any<Len, Align> make_any(Args &&...args) {
-
476  return basic_any<Len, Align>{std::in_place_type<Type>, std::forward<Args>(args)...};
-
477 }
-
478 
-
487 template<std::size_t Len = basic_any<>::length, std::size_t Align = basic_any<Len>::alignment, typename Type>
-
488 basic_any<Len, Align> forward_as_any(Type &&value) {
-
489  return basic_any<Len, Align>{std::in_place_type<std::conditional_t<std::is_rvalue_reference_v<Type>, std::decay_t<Type>, Type>>, std::forward<Type>(value)};
-
490 }
-
491 
-
492 } // namespace entt
-
493 
-
494 #endif
+
318  bool assign(any &&other) {
+
319  if(vtable && mode != policy::cref && *info == *other.info) {
+
320  if(auto *val = other.data(); val) {
+
321  return (vtable(operation::transfer, *this, val) != nullptr);
+
322  } else {
+
323  return (vtable(operation::assign, *this, std::as_const(other).data()) != nullptr);
+
324  }
+
325  }
+
326 
+
327  return false;
+
328  }
+
329 
+
331  void reset() {
+
332  if(vtable && owner()) {
+
333  vtable(operation::destroy, *this, nullptr);
+
334  }
+
335 
+
336  info = &type_id<void>();
+
337  vtable = nullptr;
+
338  mode = policy::owner;
+
339  }
+
340 
+
345  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
+
346  return vtable != nullptr;
+
347  }
+
348 
+
354  bool operator==(const basic_any &other) const ENTT_NOEXCEPT {
+
355  if(vtable && *info == *other.info) {
+
356  return (vtable(operation::compare, *this, other.data()) != nullptr);
+
357  }
+
358 
+
359  return (!vtable && !other.vtable);
+
360  }
+
361 
+
366  [[nodiscard]] basic_any as_ref() ENTT_NOEXCEPT {
+
367  return basic_any{*this, (mode == policy::cref ? policy::cref : policy::ref)};
+
368  }
+
369 
+
371  [[nodiscard]] basic_any as_ref() const ENTT_NOEXCEPT {
+
372  return basic_any{*this, policy::cref};
+
373  }
+
374 
+
379  [[nodiscard]] bool owner() const ENTT_NOEXCEPT {
+
380  return (mode == policy::owner);
+
381  }
+
382 
+
383 private:
+
384  union {
+
385  const void *instance;
+
386  storage_type storage;
+
387  };
+
388  const type_info *info;
+
389  vtable_type *vtable;
+
390  policy mode;
+
391 };
+
392 
+
401 template<std::size_t Len, std::size_t Align>
+
402 [[nodiscard]] inline bool operator!=(const basic_any<Len, Align> &lhs, const basic_any<Len, Align> &rhs) ENTT_NOEXCEPT {
+
403  return !(lhs == rhs);
+
404 }
+
405 
+
414 template<typename Type, std::size_t Len, std::size_t Align>
+
415 Type any_cast(const basic_any<Len, Align> &data) ENTT_NOEXCEPT {
+
416  const auto *const instance = any_cast<std::remove_reference_t<Type>>(&data);
+
417  ENTT_ASSERT(instance, "Invalid instance");
+
418  return static_cast<Type>(*instance);
+
419 }
+
420 
+
422 template<typename Type, std::size_t Len, std::size_t Align>
+
423 Type any_cast(basic_any<Len, Align> &data) ENTT_NOEXCEPT {
+
424  // forces const on non-reference types to make them work also with wrappers for const references
+
425  auto *const instance = any_cast<std::remove_reference_t<const Type>>(&data);
+
426  ENTT_ASSERT(instance, "Invalid instance");
+
427  return static_cast<Type>(*instance);
+
428 }
+
429 
+
431 template<typename Type, std::size_t Len, std::size_t Align>
+
432 Type any_cast(basic_any<Len, Align> &&data) ENTT_NOEXCEPT {
+
433  if constexpr(std::is_copy_constructible_v<std::remove_cv_t<std::remove_reference_t<Type>>>) {
+
434  if(auto *const instance = any_cast<std::remove_reference_t<Type>>(&data); instance) {
+
435  return static_cast<Type>(std::move(*instance));
+
436  } else {
+
437  return any_cast<Type>(data);
+
438  }
+
439  } else {
+
440  auto *const instance = any_cast<std::remove_reference_t<Type>>(&data);
+
441  ENTT_ASSERT(instance, "Invalid instance");
+
442  return static_cast<Type>(std::move(*instance));
+
443  }
+
444 }
+
445 
+
447 template<typename Type, std::size_t Len, std::size_t Align>
+
448 const Type *any_cast(const basic_any<Len, Align> *data) ENTT_NOEXCEPT {
+
449  const auto &info = type_id<std::remove_cv_t<std::remove_reference_t<Type>>>();
+
450  return static_cast<const Type *>(data->data(info));
+
451 }
+
452 
+
454 template<typename Type, std::size_t Len, std::size_t Align>
+
455 Type *any_cast(basic_any<Len, Align> *data) ENTT_NOEXCEPT {
+
456  const auto &info = type_id<std::remove_cv_t<std::remove_reference_t<Type>>>();
+
457  // last attempt to make wrappers for const references return their values
+
458  return static_cast<Type *>(static_cast<constness_as_t<basic_any<Len, Align>, Type> *>(data)->data(info));
+
459 }
+
460 
+
470 template<typename Type, std::size_t Len = basic_any<>::length, std::size_t Align = basic_any<Len>::alignment, typename... Args>
+
471 basic_any<Len, Align> make_any(Args &&...args) {
+
472  return basic_any<Len, Align>{std::in_place_type<Type>, std::forward<Args>(args)...};
+
473 }
+
474 
+
483 template<std::size_t Len = basic_any<>::length, std::size_t Align = basic_any<Len>::alignment, typename Type>
+
484 basic_any<Len, Align> forward_as_any(Type &&value) {
+
485  return basic_any<Len, Align>{std::in_place_type<std::conditional_t<std::is_rvalue_reference_v<Type>, std::decay_t<Type>, Type>>, std::forward<Type>(value)};
+
486 }
+
487 
+
488 } // namespace entt
+
489 
+
490 #endif
entt::basic_any
A SBO friendly, type-safe container for single values of any type.
Definition: any.hpp:22
-
entt::basic_any::reset
void reset()
Destroys contained object.
Definition: any.hpp:335
+
entt::basic_any::reset
void reset()
Destroys contained object.
Definition: any.hpp:331
entt::basic_any::data
const void * data() const
Returns an opaque pointer to the contained instance.
Definition: any.hpp:262
entt::basic_any::operator=
basic_any & operator=(const basic_any &other)
Copy assignment operator.
Definition: any.hpp:209
entt::basic_any::data
void * data()
Returns an opaque pointer to the contained instance.
Definition: any.hpp:279
entt::basic_any::basic_any
basic_any(const basic_any &other)
Copy constructor.
Definition: any.hpp:176
entt::basic_any::basic_any
basic_any(std::in_place_type_t< Type >, Args &&...args)
Constructs a wrapper by directly initializing the new object.
Definition: any.hpp:156
-
entt::basic_any::as_ref
basic_any as_ref() const
Aliasing constructor.
Definition: any.hpp:375
+
entt::basic_any::as_ref
basic_any as_ref() const
Aliasing constructor.
Definition: any.hpp:371
entt::basic_any::operator=
std::enable_if_t<!std::is_same_v< std::decay_t< Type >, basic_any >, basic_any & > operator=(Type &&value)
Value assignment operator.
Definition: any.hpp:245
-
entt::basic_any::assign
bool assign(any &&other)
Move assigns a value to the contained object without replacing it.
Definition: any.hpp:322
+
entt::basic_any::assign
bool assign(any &&other)
Assigns a value to the contained object without replacing it.
Definition: any.hpp:318
entt::basic_any::data
const void * data(const type_info &req) const
Returns an opaque pointer to the contained instance.
Definition: any.hpp:271
entt::basic_any::length
static constexpr auto length
Size of the internal storage.
Definition: any.hpp:138
entt::basic_any::emplace
void emplace(Args &&...args)
Replaces the contained object by creating a new instance directly.
Definition: any.hpp:299
-
entt::basic_any::assign
bool assign(const any &other)
Copy assigns a value to the contained object without replacing it.
Definition: any.hpp:309
-
entt::basic_any::as_ref
basic_any as_ref()
Aliasing constructor.
Definition: any.hpp:370
+
entt::basic_any::assign
bool assign(const any &other)
Assigns a value to the contained object without replacing it.
Definition: any.hpp:309
+
entt::basic_any::as_ref
basic_any as_ref()
Aliasing constructor.
Definition: any.hpp:366
entt::basic_any::alignment
static constexpr auto alignment
Alignment requirement.
Definition: any.hpp:140
entt::basic_any::type
const type_info & type() const
Returns the object type if any, type_id<void>() otherwise.
Definition: any.hpp:254
-
entt::basic_any::basic_any
basic_any()
Default constructor.
Definition: any.hpp:143
+
entt::basic_any::basic_any
constexpr basic_any()
Default constructor.
Definition: any.hpp:143
entt::basic_any::~basic_any
~basic_any()
Frees the internal storage, whatever it means.
Definition: any.hpp:198
entt::basic_any::operator=
basic_any & operator=(basic_any &&other)
Move assignment operator.
Definition: any.hpp:224
entt::basic_any::basic_any
basic_any(basic_any &&other)
Move constructor.
Definition: any.hpp:187
entt::basic_any::data
void * data(const type_info &req)
Returns an opaque pointer to the contained instance.
Definition: any.hpp:288
-
entt::basic_any::operator==
bool operator==(const basic_any &other) const
Checks if two wrappers differ in their content.
Definition: any.hpp:358
-
entt::basic_any::owner
bool owner() const
Returns true if a wrapper owns its object, false otherwise.
Definition: any.hpp:383
+
entt::basic_any::operator==
bool operator==(const basic_any &other) const
Checks if two wrappers differ in their content.
Definition: any.hpp:354
+
entt::basic_any::owner
bool owner() const
Returns true if a wrapper owns its object, false otherwise.
Definition: any.hpp:379
entt::basic_any::basic_any
basic_any(Type &&value)
Constructs a wrapper from a given value.
Definition: any.hpp:167
-
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:237
-
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::any_cast
Type any_cast(const basic_any< Len, Align > &data)
Performs type-safe access to the contained object.
Definition: any.hpp:419
-
entt::make_any
basic_any< Len, Align > make_any(Args &&...args)
Constructs a wrapper from a given type, passing it all arguments.
Definition: any.hpp:475
-
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:645
-
entt::forward_as_any
basic_any< Len, Align > forward_as_any(Type &&value)
Forwards its argument and avoids copies for lvalue references.
Definition: any.hpp:488
+
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:234
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::any_cast
Type any_cast(const basic_any< Len, Align > &data)
Performs type-safe access to the contained object.
Definition: any.hpp:415
+
entt::make_any
basic_any< Len, Align > make_any(Args &&...args)
Constructs a wrapper from a given type, passing it all arguments.
Definition: any.hpp:471
+
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:618
+
entt::forward_as_any
basic_any< Len, Align > forward_as_any(Type &&value)
Forwards its argument and avoids copies for lvalue references.
Definition: any.hpp:484
entt::get
constexpr get_t< Type... > get
Variable template for lists of observed components.
Definition: utility.hpp:34
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
diff --git a/attribute_8h_source.html b/attribute_8h_source.html index 9ad77e07f..76c6044f5 100644 --- a/attribute_8h_source.html +++ b/attribute_8h_source.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
diff --git a/cache_8hpp_source.html b/cache_8hpp_source.html index 16d8e0dc0..7e9f6b6ce 100644 --- a/cache_8hpp_source.html +++ b/cache_8hpp_source.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -70,163 +70,333 @@ $(function() {
cache.hpp
-
1 #ifndef ENTT_RESOURCE_CACHE_HPP
-
2 #define ENTT_RESOURCE_CACHE_HPP
+
1 #ifndef ENTT_RESOURCE_RESOURCE_CACHE_HPP
+
2 #define ENTT_RESOURCE_RESOURCE_CACHE_HPP
3 
-
4 #include <type_traits>
-
5 #include <utility>
-
6 #include "../config/config.h"
-
7 #include "../container/dense_hash_map.hpp"
-
8 #include "../core/fwd.hpp"
-
9 #include "../core/utility.hpp"
-
10 #include "fwd.hpp"
-
11 #include "handle.hpp"
-
12 #include "loader.hpp"
-
13 
-
14 namespace entt {
-
15 
-
26 template<typename Resource>
-
27 class resource_cache {
-
28  static_assert(std::is_same_v<Resource, std::remove_const_t<std::remove_reference_t<Resource>>>, "Invalid resource type");
+
4 #include <cstddef>
+
5 #include <functional>
+
6 #include <iterator>
+
7 #include <memory>
+
8 #include <tuple>
+
9 #include <type_traits>
+
10 #include <utility>
+
11 #include "../config/config.h"
+
12 #include "../container/dense_map.hpp"
+
13 #include "../core/compressed_pair.hpp"
+
14 #include "../core/fwd.hpp"
+
15 #include "../core/iterator.hpp"
+
16 #include "../core/utility.hpp"
+
17 #include "fwd.hpp"
+
18 #include "loader.hpp"
+
19 #include "resource.hpp"
+
20 
+
21 namespace entt {
+
22 
+
28 namespace internal {
29 
-
30 public:
-
32  using size_type = std::size_t;
-
34  using resource_type = Resource;
-
35 
-
37  resource_cache() = default;
-
38 
-
40  resource_cache(resource_cache &&) = default;
+
30 template<typename Type, typename It>
+
31 class resource_cache_iterator final {
+
32  template<typename, typename>
+
33  friend class resource_cache_iterator;
+
34 
+
35 public:
+
36  using value_type = std::pair<id_type, resource<Type>>;
+
37  using pointer = input_iterator_pointer<value_type>;
+
38  using reference = value_type;
+
39  using difference_type = std::ptrdiff_t;
+
40  using iterator_category = std::input_iterator_tag;
41 
-
43  resource_cache &operator=(resource_cache &&) = default;
-
44 
-
49  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
-
50  return resources.size();
-
51  }
-
52 
-
57  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
-
58  return resources.empty();
-
59  }
-
60 
-
67  void clear() ENTT_NOEXCEPT {
-
68  resources.clear();
-
69  }
-
70 
-
93  template<typename Loader, typename... Args>
-
94  resource_handle<resource_type> load(const id_type id, Args &&...args) {
-
95  if(auto it = resources.find(id); it == resources.cend()) {
-
96  if(auto handle = temp<Loader>(std::forward<Args>(args)...); handle) {
-
97  return (resources[id] = std::move(handle));
-
98  }
-
99  } else {
-
100  return it->second;
-
101  }
-
102 
-
103  return {};
-
104  }
-
105 
-
129  template<typename Loader, typename... Args>
-
130  resource_handle<resource_type> reload(const id_type id, Args &&...args) {
-
131  return (discard(id), load<Loader>(id, std::forward<Args>(args)...));
-
132  }
-
133 
-
146  template<typename Loader, typename... Args>
-
147  [[nodiscard]] resource_handle<resource_type> temp(Args &&...args) const {
-
148  return Loader{}.get(std::forward<Args>(args)...);
-
149  }
-
150 
-
164  [[nodiscard]] resource_handle<const resource_type> handle(const id_type id) const {
-
165  if(auto it = resources.find(id); it != resources.cend()) {
-
166  return it->second;
-
167  }
-
168 
-
169  return {};
-
170  }
-
171 
-
173  [[nodiscard]] resource_handle<resource_type> handle(const id_type id) {
-
174  if(auto it = resources.find(id); it != resources.end()) {
-
175  return it->second;
-
176  }
-
177 
-
178  return {};
-
179  }
+
42  resource_cache_iterator() ENTT_NOEXCEPT = default;
+
43 
+
44  resource_cache_iterator(const It iter) ENTT_NOEXCEPT
+
45  : it{iter} {}
+
46 
+
47  template<typename Other, typename = std::enable_if_t<!std::is_same_v<It, Other> && std::is_constructible_v<It, Other>>>
+
48  resource_cache_iterator(const resource_cache_iterator<std::remove_const_t<Type>, Other> &other) ENTT_NOEXCEPT
+
49  : it{other.it} {}
+
50 
+
51  resource_cache_iterator &operator++() ENTT_NOEXCEPT {
+
52  return ++it, *this;
+
53  }
+
54 
+
55  resource_cache_iterator operator++(int) ENTT_NOEXCEPT {
+
56  resource_cache_iterator orig = *this;
+
57  return ++(*this), orig;
+
58  }
+
59 
+
60  resource_cache_iterator &operator--() ENTT_NOEXCEPT {
+
61  return --it, *this;
+
62  }
+
63 
+
64  resource_cache_iterator operator--(int) ENTT_NOEXCEPT {
+
65  resource_cache_iterator orig = *this;
+
66  return operator--(), orig;
+
67  }
+
68 
+
69  resource_cache_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
+
70  it += value;
+
71  return *this;
+
72  }
+
73 
+
74  resource_cache_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
+
75  resource_cache_iterator copy = *this;
+
76  return (copy += value);
+
77  }
+
78 
+
79  resource_cache_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
+
80  return (*this += -value);
+
81  }
+
82 
+
83  resource_cache_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
+
84  return (*this + -value);
+
85  }
+
86 
+
87  [[nodiscard]] reference operator[](const difference_type value) const ENTT_NOEXCEPT {
+
88  return {it[value].first, resource<Type>{it[value].second}};
+
89  }
+
90 
+
91  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
92  return (*this)[0];
+
93  }
+
94 
+
95  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
96  return operator*();
+
97  }
+
98 
+
99  template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
100  friend std::ptrdiff_t operator-(const resource_cache_iterator<TLhs, ILhs> &, const resource_cache_iterator<TRhs, IRhs> &) ENTT_NOEXCEPT;
+
101 
+
102  template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
103  friend bool operator==(const resource_cache_iterator<TLhs, ILhs> &, const resource_cache_iterator<TRhs, IRhs> &) ENTT_NOEXCEPT;
+
104 
+
105  template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
106  friend bool operator<(const resource_cache_iterator<TLhs, ILhs> &, const resource_cache_iterator<TRhs, IRhs> &) ENTT_NOEXCEPT;
+
107 
+
108 private:
+
109  It it;
+
110 };
+
111 
+
112 template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
113 [[nodiscard]] std::ptrdiff_t operator-(const resource_cache_iterator<TLhs, ILhs> &lhs, const resource_cache_iterator<TRhs, IRhs> &rhs) ENTT_NOEXCEPT {
+
114  return lhs.it - rhs.it;
+
115 }
+
116 
+
117 template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
118 [[nodiscard]] bool operator==(const resource_cache_iterator<TLhs, ILhs> &lhs, const resource_cache_iterator<TRhs, IRhs> &rhs) ENTT_NOEXCEPT {
+
119  return lhs.it == rhs.it;
+
120 }
+
121 
+
122 template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
123 [[nodiscard]] bool operator!=(const resource_cache_iterator<TLhs, ILhs> &lhs, const resource_cache_iterator<TRhs, IRhs> &rhs) ENTT_NOEXCEPT {
+
124  return !(lhs == rhs);
+
125 }
+
126 
+
127 template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
128 [[nodiscard]] bool operator<(const resource_cache_iterator<TLhs, ILhs> &lhs, const resource_cache_iterator<TRhs, IRhs> &rhs) ENTT_NOEXCEPT {
+
129  return lhs.it < rhs.it;
+
130 }
+
131 
+
132 template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
133 [[nodiscard]] bool operator>(const resource_cache_iterator<TLhs, ILhs> &lhs, const resource_cache_iterator<TRhs, IRhs> &rhs) ENTT_NOEXCEPT {
+
134  return rhs < lhs;
+
135 }
+
136 
+
137 template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
138 [[nodiscard]] bool operator<=(const resource_cache_iterator<TLhs, ILhs> &lhs, const resource_cache_iterator<TRhs, IRhs> &rhs) ENTT_NOEXCEPT {
+
139  return !(lhs > rhs);
+
140 }
+
141 
+
142 template<typename TLhs, typename ILhs, typename TRhs, typename IRhs>
+
143 [[nodiscard]] bool operator>=(const resource_cache_iterator<TLhs, ILhs> &lhs, const resource_cache_iterator<TRhs, IRhs> &rhs) ENTT_NOEXCEPT {
+
144  return !(lhs < rhs);
+
145 }
+
146 
+
147 } // namespace internal
+
148 
+
160 template<typename Type, typename Loader, typename Allocator>
+
161 class resource_cache {
+
162  using alloc_traits = typename std::allocator_traits<Allocator>;
+
163  static_assert(std::is_same_v<typename alloc_traits::value_type, Type>, "Invalid value type");
+
164  using container_allocator = typename alloc_traits::template rebind_alloc<std::pair<const id_type, typename Loader::result_type>>;
+
165  using container_type = dense_map<id_type, typename Loader::result_type, identity, std::equal_to<id_type>, container_allocator>;
+
166 
+
167 public:
+
169  using value_type = Type;
+
171  using size_type = std::size_t;
+
173  using loader_type = Loader;
+
175  using allocator_type = Allocator;
+
177  using iterator = internal::resource_cache_iterator<Type, typename container_type::iterator>;
+
179  using const_iterator = internal::resource_cache_iterator<const Type, typename container_type::const_iterator>;
180 
-
186  [[nodiscard]] bool contains(const id_type id) const {
-
187  return (resources.find(id) != resources.cend());
-
188  }
-
189 
-
198  void discard(const id_type id) {
-
199  if(auto it = resources.find(id); it != resources.end()) {
-
200  resources.erase(it);
-
201  }
-
202  }
-
203 
-
221  template<typename Func>
-
222  void each(Func func) const {
-
223  auto begin = resources.begin();
-
224  auto end = resources.end();
-
225 
-
226  while(begin != end) {
-
227  auto curr = begin++;
-
228 
-
229  if constexpr(std::is_invocable_v<Func, id_type>) {
-
230  func(curr->first);
-
231  } else if constexpr(std::is_invocable_v<Func, resource_handle<const resource_type>>) {
-
232  func(resource_handle<const resource_type>{curr->second});
-
233  } else {
-
234  func(curr->first, resource_handle<const resource_type>{curr->second});
-
235  }
-
236  }
-
237  }
-
238 
-
256  template<typename Func>
-
257  void each(Func func) {
-
258  auto begin = resources.begin();
-
259  auto end = resources.end();
-
260 
-
261  while(begin != end) {
-
262  auto curr = begin++;
+
182  resource_cache()
+
183  : resource_cache{loader_type{}} {}
+
184 
+
189  explicit resource_cache(const allocator_type &allocator)
+
190  : resource_cache{loader_type{}, allocator} {}
+
191 
+
197  explicit resource_cache(const loader_type &callable, const allocator_type &allocator = allocator_type{})
+
198  : pool{container_type{allocator}, callable} {}
+
199 
+
201  resource_cache(const resource_cache &) = default;
+
202 
+
208  resource_cache(const resource_cache &other, const allocator_type &allocator)
+
209  : pool{std::piecewise_construct, std::forward_as_tuple(other.pool.first(), allocator), std::forward_as_tuple(other.pool.second())} {}
+
210 
+
212  resource_cache(resource_cache &&) = default;
+
213 
+
219  resource_cache(resource_cache &&other, const allocator_type &allocator)
+
220  : pool{std::piecewise_construct, std::forward_as_tuple(std::move(other.pool.first()), allocator), std::forward_as_tuple(std::move(other.pool.second()))} {}
+
221 
+
226  resource_cache &operator=(const resource_cache &) = default;
+
227 
+
232  resource_cache &operator=(resource_cache &&) = default;
+
233 
+
238  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
+
239  return pool.first().get_allocator();
+
240  }
+
241 
+
250  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
+
251  return pool.first().begin();
+
252  }
+
253 
+
255  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
+
256  return cbegin();
+
257  }
+
258 
+
260  [[nodiscard]] iterator begin() ENTT_NOEXCEPT {
+
261  return pool.first().begin();
+
262  }
263 
-
264  if constexpr(std::is_invocable_v<Func, id_type>) {
-
265  func(curr->first);
-
266  } else if constexpr(std::is_invocable_v<Func, resource_handle<resource_type>>) {
-
267  func(curr->second);
-
268  } else {
-
269  func(curr->first, curr->second);
-
270  }
-
271  }
-
272  }
-
273 
-
274 private:
-
275  dense_hash_map<id_type, resource_handle<resource_type>, identity> resources;
-
276 };
+
274  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
+
275  return pool.first().end();
+
276  }
277 
-
278 } // namespace entt
-
279 
-
280 #endif
-
entt::dense_hash_map
Associative container for key-value pairs with unique keys.
Definition: dense_hash_map.hpp:240
-
entt::resource_cache
Simple cache for resources of a given type.
Definition: cache.hpp:27
-
entt::resource_cache::each
void each(Func func) const
Iterates all resources.
Definition: cache.hpp:222
-
entt::resource_cache::operator=
resource_cache & operator=(resource_cache &&)=default
Default move assignment operator.
-
entt::resource_cache::discard
void discard(const id_type id)
Discards the resource that corresponds to a given identifier.
Definition: cache.hpp:198
-
entt::resource_cache::clear
void clear()
Clears a cache and discards all its resources.
Definition: cache.hpp:67
-
entt::resource_cache::resource_type
Resource resource_type
Type of resources managed by a cache.
Definition: cache.hpp:34
-
entt::resource_cache::handle
resource_handle< const resource_type > handle(const id_type id) const
Creates a handle for a given resource identifier.
Definition: cache.hpp:164
-
entt::resource_cache::load
resource_handle< resource_type > load(const id_type id, Args &&...args)
Loads the resource that corresponds to a given identifier.
Definition: cache.hpp:94
-
entt::resource_cache::handle
resource_handle< resource_type > handle(const id_type id)
Creates a handle for a given resource identifier.
Definition: cache.hpp:173
-
entt::resource_cache::empty
bool empty() const
Returns true if a cache contains no resources, false otherwise.
Definition: cache.hpp:57
-
entt::resource_cache::contains
bool contains(const id_type id) const
Checks if a cache contains a given identifier.
Definition: cache.hpp:186
-
entt::resource_cache::size
size_type size() const
Number of resources managed by a cache.
Definition: cache.hpp:49
-
entt::resource_cache::resource_cache
resource_cache()=default
Default constructor.
-
entt::resource_cache::reload
resource_handle< resource_type > reload(const id_type id, Args &&...args)
Reloads a resource or loads it for the first time if not present.
Definition: cache.hpp:130
-
entt::resource_cache::each
void each(Func func)
Iterates all resources.
Definition: cache.hpp:257
-
entt::resource_cache::size_type
std::size_t size_type
Unsigned integer type.
Definition: cache.hpp:32
-
entt::resource_cache::resource_cache
resource_cache(resource_cache &&)=default
Default move constructor.
-
entt::resource_cache::temp
resource_handle< resource_type > temp(Args &&...args) const
Creates a temporary handle for a resource.
Definition: cache.hpp:147
-
entt::resource_handle
Shared resource handle.
Definition: handle.hpp:25
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:13
-
entt::basic_handle
Non-owning handle to an entity.
Definition: handle.hpp:23
-
entt::identity
Identity function object (waiting for C++20).
Definition: utility.hpp:10
+
279  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
+
280  return cend();
+
281  }
+
282 
+
284  [[nodiscard]] iterator end() ENTT_NOEXCEPT {
+
285  return pool.first().end();
+
286  }
+
287 
+
292  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
+
293  return pool.first().empty();
+
294  }
+
295 
+
300  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
+
301  return pool.first().size();
+
302  }
+
303 
+
305  void clear() ENTT_NOEXCEPT {
+
306  pool.first().clear();
+
307  }
+
308 
+
326  template<typename... Args>
+
327  std::pair<iterator, bool> load(const id_type id, Args &&...args) {
+
328  if(auto it = pool.first().find(id); it != pool.first().end()) {
+
329  return {it, false};
+
330  }
+
331 
+
332  return pool.first().emplace(id, pool.second()(std::forward<Args>(args)...));
+
333  }
+
334 
+
339  template<typename... Args>
+
340  std::pair<iterator, bool> force_load(const id_type id, Args &&...args) {
+
341  return {pool.first().insert_or_assign(id, pool.second()(std::forward<Args>(args)...)).first, true};
+
342  }
+
343 
+
354  [[nodiscard]] resource<const value_type> operator[](const id_type id) const {
+
355  if(auto it = pool.first().find(id); it != pool.first().cend()) {
+
356  return resource<const value_type>{it->second};
+
357  }
+
358 
+
359  return {};
+
360  }
+
361 
+
363  [[nodiscard]] resource<value_type> operator[](const id_type id) {
+
364  if(auto it = pool.first().find(id); it != pool.first().end()) {
+
365  return resource<value_type>{it->second};
+
366  }
+
367 
+
368  return {};
+
369  }
+
370 
+
376  [[nodiscard]] bool contains(const id_type id) const {
+
377  return pool.first().contains(id);
+
378  }
+
379 
+
385  iterator erase(const_iterator pos) {
+
386  const auto it = pool.first().begin();
+
387  return pool.first().erase(it + (pos - const_iterator{it}));
+
388  }
+
389 
+
396  iterator erase(const_iterator first, const_iterator last) {
+
397  const auto it = pool.first().begin();
+
398  return pool.first().erase(it + (first - const_iterator{it}), it + (last - const_iterator{it}));
+
399  }
+
400 
+
406  size_type erase(const id_type id) {
+
407  return pool.first().erase(id);
+
408  }
+
409 
+
414  [[nodiscard]] loader_type loader() const {
+
415  return pool.second();
+
416  }
+
417 
+
418 private:
+
419  compressed_pair<container_type, loader_type> pool;
+
420 };
+
421 
+
422 } // namespace entt
+
423 
+
424 #endif
+
entt::compressed_pair
A compressed pair.
Definition: compressed_pair.hpp:95
+
entt::dense_map
Associative container for key-value pairs with unique keys.
Definition: dense_map.hpp:265
+
entt::resource_cache
Basic cache for resources of any type.
Definition: cache.hpp:161
+
entt::resource_cache::erase
size_type erase(const id_type id)
Removes the given elements from a cache.
Definition: cache.hpp:406
+
entt::resource_cache::resource_cache
resource_cache()
Default constructor.
Definition: cache.hpp:182
+
entt::resource_cache::end
iterator end()
Returns an iterator to the end.
Definition: cache.hpp:284
+
entt::resource_cache::resource_cache
resource_cache(const resource_cache &other, const allocator_type &allocator)
Allocator-extended copy constructor.
Definition: cache.hpp:208
+
entt::resource_cache::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: cache.hpp:274
+
entt::resource_cache::loader
loader_type loader() const
Returns the loader used to create resources.
Definition: cache.hpp:414
+
entt::resource_cache::force_load
std::pair< iterator, bool > force_load(const id_type id, Args &&...args)
Force loads a resource, if its identifier does not exist.
Definition: cache.hpp:340
+
entt::resource_cache::clear
void clear()
Clears a cache.
Definition: cache.hpp:305
+
entt::resource_cache::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: cache.hpp:255
+
entt::resource_cache::erase
iterator erase(const_iterator pos)
Removes an element from a given position.
Definition: cache.hpp:385
+
entt::resource_cache::size
size_type size() const
Number of resources managed by a cache.
Definition: cache.hpp:300
+
entt::resource_cache::value_type
Type value_type
Resource type.
Definition: cache.hpp:169
+
entt::resource_cache::empty
bool empty() const
Returns true if a cache contains no resources, false otherwise.
Definition: cache.hpp:292
+
entt::resource_cache::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: cache.hpp:238
+
entt::resource_cache::loader_type
Loader loader_type
Loader type.
Definition: cache.hpp:173
+
entt::resource_cache::resource_cache
resource_cache(resource_cache &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: cache.hpp:219
+
entt::resource_cache::resource_cache
resource_cache(const allocator_type &allocator)
Constructs an empty cache with a given allocator.
Definition: cache.hpp:189
+
entt::resource_cache::resource_cache
resource_cache(const loader_type &callable, const allocator_type &allocator=allocator_type{})
Constructs an empty cache with a given allocator and loader.
Definition: cache.hpp:197
+
entt::resource_cache::const_iterator
internal::resource_cache_iterator< const Type, typename container_type::const_iterator > const_iterator
Constant input iterator type.
Definition: cache.hpp:179
+
entt::resource_cache::load
std::pair< iterator, bool > load(const id_type id, Args &&...args)
Loads a resource, if its identifier does not exist.
Definition: cache.hpp:327
+
entt::resource_cache::operator=
resource_cache & operator=(resource_cache &&)=default
Default move assignment operator.
+
entt::resource_cache::resource_cache
resource_cache(resource_cache &&)=default
Default move constructor.
+
entt::resource_cache::iterator
internal::resource_cache_iterator< Type, typename container_type::iterator > iterator
Input iterator type.
Definition: cache.hpp:177
+
entt::resource_cache::allocator_type
Allocator allocator_type
Allocator type.
Definition: cache.hpp:175
+
entt::resource_cache::resource_cache
resource_cache(const resource_cache &)=default
Default copy constructor.
+
entt::resource_cache::operator[]
resource< const value_type > operator[](const id_type id) const
Returns a handle for a given resource identifier.
Definition: cache.hpp:354
+
entt::resource_cache::operator=
resource_cache & operator=(const resource_cache &)=default
Default copy assignment operator.
+
entt::resource_cache::begin
iterator begin()
Returns an iterator to the beginning.
Definition: cache.hpp:260
+
entt::resource_cache::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: cache.hpp:250
+
entt::resource_cache::end
const_iterator end() const
Returns an iterator to the end.
Definition: cache.hpp:279
+
entt::resource_cache::operator[]
resource< value_type > operator[](const id_type id)
Returns a handle for a given resource identifier.
Definition: cache.hpp:363
+
entt::resource_cache::size_type
std::size_t size_type
Unsigned integer type.
Definition: cache.hpp:171
+
entt::resource_cache::erase
iterator erase(const_iterator first, const_iterator last)
Removes the given elements from a cache.
Definition: cache.hpp:396
+
entt::resource_cache::contains
bool contains(const id_type id) const
Checks if a cache contains a given identifier.
Definition: cache.hpp:376
+
entt::resource
Basic resource handle.
Definition: resource.hpp:23
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
+
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:14
+
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:273
+
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:299
+
entt::operator+
constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
Concatenates multiple type lists.
Definition: type_traits.hpp:157
+
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:260
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:286
diff --git a/classentt_1_1basic__any-members.html b/classentt_1_1basic__any-members.html index 34e18fb13..afc39f11e 100644 --- a/classentt_1_1basic__any-members.html +++ b/classentt_1_1basic__any-members.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -78,7 +78,7 @@ $(function() { as_ref() constentt::basic_any< Len, Align >inline assign(const any &other)entt::basic_any< Len, Align >inline assign(any &&other)entt::basic_any< Len, Align >inline - basic_any()entt::basic_any< Len, Align >inline + basic_any()entt::basic_any< Len, Align >inline basic_any(std::in_place_type_t< Type >, Args &&...args)entt::basic_any< Len, Align >inlineexplicit basic_any(Type &&value)entt::basic_any< Len, Align >inline basic_any(const basic_any &other)entt::basic_any< Len, Align >inline diff --git a/classentt_1_1basic__any.html b/classentt_1_1basic__any.html index 77a361cef..6dd8ff85c 100644 --- a/classentt_1_1basic__any.html +++ b/classentt_1_1basic__any.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -82,10 +82,10 @@ $(function() { - - - + + + @@ -114,19 +114,19 @@ Public Member Functions - + - + - + @@ -134,10 +134,10 @@ Public Member Functions - + - + @@ -393,7 +393,7 @@ template<std::size_t Len, std::size_t Align>

Aliasing constructor.

Returns
A wrapper that shares a reference to an unmanaged object.
-

Definition at line 370 of file any.hpp.

+

Definition at line 366 of file any.hpp.

@@ -425,7 +425,7 @@ template<std::size_t Len, std::size_t Align>

Aliasing constructor.

Returns
A wrapper that shares a reference to an unmanaged object.
-

Definition at line 375 of file any.hpp.

+

Definition at line 371 of file any.hpp.

@@ -455,7 +455,7 @@ template<std::size_t Len, std::size_t Align>

Public Member Functions

- basic_any ()
 Default constructor.
 
+constexpr basic_any ()
 Default constructor.
 
template<typename Type , typename... Args>
 basic_any (std::in_place_type_t< Type >, Args &&...args)
 Constructs a wrapper by directly initializing the new object. More...
std::enable_if_t<!std::is_same_v< std::decay_t< Type >, basic_any >, basic_any & > operator= (Type &&value)
 Value assignment operator. More...
 
const type_info & type () const
const type_info & type () const
 Returns the object type if any, type_id<void>() otherwise. More...
 
const void * data () const
 Returns an opaque pointer to the contained instance. More...
 
const void * data (const type_info &req) const
const void * data (const type_info &req) const
 Returns an opaque pointer to the contained instance. More...
 
void * data ()
 Returns an opaque pointer to the contained instance. More...
 
void * data (const type_info &req)
void * data (const type_info &req)
 Returns an opaque pointer to the contained instance. More...
 
template<typename Type , typename... Args>
 Replaces the contained object by creating a new instance directly. More...
 
bool assign (const any &other)
 Copy assigns a value to the contained object without replacing it. More...
 Assigns a value to the contained object without replacing it. More...
 
bool assign (any &&other)
 Move assigns a value to the contained object without replacing it. More...
 Assigns a value to the contained object without replacing it. More...
 
void reset ()
-

Move assigns a value to the contained object without replacing it.

+

Assigns a value to the contained object without replacing it.

Parameters
@@ -464,7 +464,7 @@ template<std::size_t Len, std::size_t Align>
Returns
True in case of success, false otherwise.
-

Definition at line 322 of file any.hpp.

+

Definition at line 318 of file any.hpp.

@@ -494,7 +494,7 @@ template<std::size_t Len, std::size_t Align>
otherThe value to assign to the contained object.
-

Copy assigns a value to the contained object without replacing it.

+

Assigns a value to the contained object without replacing it.

Parameters
@@ -585,7 +585,7 @@ template<std::size_t Len, std::size_t Align> - + @@ -624,7 +624,7 @@ template<std::size_t Len, std::size_t Align> - + @@ -724,7 +724,7 @@ template<std::size_t Len, std::size_t Align>

Returns false if a wrapper is empty, true otherwise.

Returns
False if the wrapper is empty, true otherwise.
-

Definition at line 349 of file any.hpp.

+

Definition at line 345 of file any.hpp.

@@ -888,7 +888,7 @@ template<std::size_t Len, std::size_t Align>
Returns
False if the two objects differ in their content, true otherwise.
-

Definition at line 358 of file any.hpp.

+

Definition at line 354 of file any.hpp.

@@ -920,7 +920,7 @@ template<std::size_t Len, std::size_t Align>

Returns true if a wrapper owns its object, false otherwise.

Returns
True if the wrapper owns its object, false otherwise.
-

Definition at line 383 of file any.hpp.

+

Definition at line 379 of file any.hpp.

@@ -936,7 +936,7 @@ template<std::size_t Len, std::size_t Align> diff --git a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html index 5799c2ea3..28082f017 100644 --- a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html +++ b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html @@ -22,7 +22,7 @@ @@ -73,7 +73,7 @@ $(function() { Friends | List of all members
-
entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > Class Template Referencefinal
+
entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > Class Template Reference
@@ -104,10 +104,10 @@ using 
- - - + + +
otherThe value to assign to the contained object.
void* entt::basic_any< Len, Align >::data (const type_info & const type_info &  req)
const void* entt::basic_any< Len, Align >::data (const type_info & const type_info &  req) const
- + diff --git a/classentt_1_1basic__continuous__loader-members.html b/classentt_1_1basic__continuous__loader-members.html index f6fcd7aad..3ff504dcb 100644 --- a/classentt_1_1basic__continuous__loader-members.html +++ b/classentt_1_1basic__continuous__loader-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__continuous__loader.html b/classentt_1_1basic__continuous__loader.html index 008d0512e..c2f665209 100644 --- a/classentt_1_1basic__continuous__loader.html +++ b/classentt_1_1basic__continuous__loader.html @@ -22,7 +22,7 @@ @@ -171,7 +171,7 @@ template<typename Entity > -

Definition at line 413 of file snapshot.hpp.

+

Definition at line 412 of file snapshot.hpp.

@@ -235,7 +235,7 @@ template<typename... Component, typename Archive , typename... Type, typename
Returns
A non-const reference to this loader.
-

Definition at line 474 of file snapshot.hpp.

+

Definition at line 473 of file snapshot.hpp.

@@ -274,7 +274,7 @@ template<typename Entity >
Returns
True if entity is managed by the loader, false otherwise.
-

Definition at line 535 of file snapshot.hpp.

+

Definition at line 534 of file snapshot.hpp.

@@ -322,7 +322,7 @@ template<typename Archive >
Returns
A non-const reference to this loader.
-

Definition at line 433 of file snapshot.hpp.

+

Definition at line 432 of file snapshot.hpp.

@@ -361,7 +361,7 @@ template<typename Entity >
Returns
The local identifier if any, the null entity otherwise.
-

Definition at line 544 of file snapshot.hpp.

+

Definition at line 543 of file snapshot.hpp.

@@ -426,7 +426,7 @@ template<typename Entity > This functions helps to identify and destroy those entities.

Returns
A non-const reference to this loader.
-

Definition at line 520 of file snapshot.hpp.

+

Definition at line 519 of file snapshot.hpp.

@@ -459,7 +459,7 @@ template<typename Entity >

Users should invoke this member function after restoring each snapshot, unless they know exactly what they are doing.

Returns
A non-const reference to this loader.
-

Definition at line 488 of file snapshot.hpp.

+

Definition at line 487 of file snapshot.hpp.

diff --git a/classentt_1_1basic__dispatcher-members.html b/classentt_1_1basic__dispatcher-members.html new file mode 100644 index 000000000..6fc051e7e --- /dev/null +++ b/classentt_1_1basic__dispatcher-members.html @@ -0,0 +1,106 @@ + + + + + + + +EnTT: Member List + + + + + + + + + +
+
+
const type_info& entt::basic_any< Len, Align >::type const type_info& entt::basic_any< Len, Align >::type ( ) const
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
+ + + + + +
+
EnTT +  3.10.0 +
+
+ + + + + + + + + +
+
+ + +
+ +
+ + + +
+
+
entt::basic_dispatcher< Allocator > Member List
+
+
+ +

This is the complete list of members for entt::basic_dispatcher< Allocator >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + +
allocator_type typedefentt::basic_dispatcher< Allocator >
basic_dispatcher()entt::basic_dispatcher< Allocator >inline
basic_dispatcher(const allocator_type &allocator)entt::basic_dispatcher< Allocator >inlineexplicit
basic_dispatcher(basic_dispatcher &&other)entt::basic_dispatcher< Allocator >inline
basic_dispatcher(basic_dispatcher &&other, const allocator_type &allocator)entt::basic_dispatcher< Allocator >inline
clear(const id_type id=type_hash< Event >::value())entt::basic_dispatcher< Allocator >inline
clear()entt::basic_dispatcher< Allocator >inline
disconnect(Type &value_or_instance)entt::basic_dispatcher< Allocator >inline
disconnect(Type *value_or_instance)entt::basic_dispatcher< Allocator >inline
enqueue(Args &&...args)entt::basic_dispatcher< Allocator >inline
enqueue(Event &&event)entt::basic_dispatcher< Allocator >inline
enqueue_hint(const id_type id, Args &&...args)entt::basic_dispatcher< Allocator >inline
enqueue_hint(const id_type id, Event &&event)entt::basic_dispatcher< Allocator >inline
get_allocator() constentt::basic_dispatcher< Allocator >inline
operator=(basic_dispatcher &&other)entt::basic_dispatcher< Allocator >inline
sink(const id_type id=type_hash< Event >::value())entt::basic_dispatcher< Allocator >inline
size(const id_type id=type_hash< Event >::value()) constentt::basic_dispatcher< Allocator >inline
size() constentt::basic_dispatcher< Allocator >inline
size_type typedefentt::basic_dispatcher< Allocator >
swap(basic_dispatcher &other)entt::basic_dispatcher< Allocator >inline
trigger(Event &&event={})entt::basic_dispatcher< Allocator >inline
trigger(const id_type id, Event &&event={})entt::basic_dispatcher< Allocator >inline
update(const id_type id=type_hash< Event >::value())entt::basic_dispatcher< Allocator >inline
update() constentt::basic_dispatcher< Allocator >inline
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/classentt_1_1basic__dispatcher.html b/classentt_1_1basic__dispatcher.html new file mode 100644 index 000000000..1fe6e691e --- /dev/null +++ b/classentt_1_1basic__dispatcher.html @@ -0,0 +1,1064 @@ + + + + + + + +EnTT: entt::basic_dispatcher< Allocator > Class Template Reference + + + + + + + + + +
+
+ + + + + + +
+
EnTT +  3.10.0 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+Public Types | +Public Member Functions | +List of all members
+
+
entt::basic_dispatcher< Allocator > Class Template Reference
+
+
+ +

Basic dispatcher implementation. + More...

+ +

#include <dispatcher.hpp>

+ + + + + + + + +

+Public Types

+using allocator_type = Allocator
 Allocator type.
 
+using size_type = std::size_t
 Unsigned integer type.
 
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

+Public Member Functions

+ basic_dispatcher ()
 Default constructor.
 
 basic_dispatcher (const allocator_type &allocator)
 Constructs a dispatcher with a given allocator. More...
 
 basic_dispatcher (basic_dispatcher &&other)
 Move constructor. More...
 
 basic_dispatcher (basic_dispatcher &&other, const allocator_type &allocator)
 Allocator-extended move constructor. More...
 
basic_dispatcher & operator= (basic_dispatcher &&other)
 Move assignment operator. More...
 
void swap (basic_dispatcher &other)
 Exchanges the contents with those of a given dispatcher. More...
 
constexpr allocator_type get_allocator () const
 Returns the associated allocator. More...
 
template<typename Event >
size_type size (const id_type id=type_hash< Event >::value()) const
 Returns the number of pending events for a given type. More...
 
size_type size () const
 Returns the total number of pending events. More...
 
template<typename Event >
auto sink (const id_type id=type_hash< Event >::value())
 Returns a sink object for the given event and queue. More...
 
template<typename Event >
void trigger (Event &&event={})
 Triggers an immediate event of a given type. More...
 
template<typename Event >
void trigger (const id_type id, Event &&event={})
 Triggers an immediate event on a queue of a given type. More...
 
template<typename Event , typename... Args>
void enqueue (Args &&...args)
 Enqueues an event of the given type. More...
 
template<typename Event >
void enqueue (Event &&event)
 Enqueues an event of the given type. More...
 
template<typename Event , typename... Args>
void enqueue_hint (const id_type id, Args &&...args)
 Enqueues an event of the given type. More...
 
template<typename Event >
void enqueue_hint (const id_type id, Event &&event)
 Enqueues an event of the given type. More...
 
template<typename Type >
void disconnect (Type &value_or_instance)
 Utility function to disconnect everything related to a given value or instance from a dispatcher. More...
 
template<typename Type >
void disconnect (Type *value_or_instance)
 Utility function to disconnect everything related to a given value or instance from a dispatcher. More...
 
template<typename Event >
void clear (const id_type id=type_hash< Event >::value())
 Discards all the events stored so far in a given queue. More...
 
+void clear ()
 Discards all the events queued so far.
 
template<typename Event >
void update (const id_type id=type_hash< Event >::value())
 Delivers all the pending events of a given queue. More...
 
+void update () const
 Delivers all the pending events.
 
+

Detailed Description

+

template<typename Allocator>
+class entt::basic_dispatcher< Allocator >

+ +

Basic dispatcher implementation.

+

A dispatcher can be used either to trigger an immediate event or to enqueue events to be published all together once per tick.
+ Listeners are provided in the form of member functions. For each event of type Event, listeners are such that they can be invoked with an argument of type Event &, no matter what the return type is.

+

The dispatcher creates instances of the sigh class internally. Refer to the documentation of the latter for more details.

+
Template Parameters
+ + +
AllocatorType of allocator used to manage memory and elements.
+
+
+ +

Definition at line 118 of file dispatcher.hpp.

+

Constructor & Destructor Documentation

+ +

◆ basic_dispatcher() [1/3]

+ +
+
+
+template<typename Allocator >
+ + + + + +
+ + + + + + + + +
entt::basic_dispatcher< Allocator >::basic_dispatcher (const allocator_type & allocator)
+ 		+inlineexplicit
+
+ +

Constructs a dispatcher with a given allocator.

+
Parameters
+ + +
allocatorThe allocator to use.
+
+
+ +

Definition at line 167 of file dispatcher.hpp.

+ +
+
+ +

◆ basic_dispatcher() [2/3]

+ +
+
+
+template<typename Allocator >
+ + + + + +
+ + + + + + + + +
entt::basic_dispatcher< Allocator >::basic_dispatcher (basic_dispatcher< Allocator > && other)
+ 		+inline
+
+ +

Move constructor.

+
Parameters
+ + +
otherThe instance to move from.
+
+
+ +

Definition at line 174 of file dispatcher.hpp.

+ +
+
+ +

◆ basic_dispatcher() [3/3]

+ +
+
+
+template<typename Allocator >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
entt::basic_dispatcher< Allocator >::basic_dispatcher (basic_dispatcher< Allocator > && other,
const allocator_type & allocator 
)
+ 		+inline
+
+ +

Allocator-extended move constructor.

+
Parameters
+ + + +
otherThe instance to move from.
allocatorThe allocator to use.
+
+
+ +

Definition at line 182 of file dispatcher.hpp.

+ +
+
+

Member Function Documentation

+ +

◆ clear()

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::clear (const id_type id = type_hash<Event>::value())
+ 		+inline
+
+ +

Discards all the events stored so far in a given queue.

+
Template Parameters
+ + +
EventType of event to discard.
+
+
+
Parameters
+ + +
idName used to map the event queue within the dispatcher.
+
+
+ +

Definition at line 356 of file dispatcher.hpp.

+ +
+
+ +

◆ disconnect() [1/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Type >
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::disconnect (Type & value_or_instance)
+ 		+inline
+
+ +

Utility function to disconnect everything related to a given value or instance from a dispatcher.

+
Template Parameters
+ + +
TypeType of class or type of payload.
+
+
+
Parameters
+ + +
value_or_instanceA valid object that fits the purpose.
+
+
+ +

Definition at line 333 of file dispatcher.hpp.

+ +
+
+ +

◆ disconnect() [2/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Type >
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::disconnect (Type * value_or_instance)
+ 		+inline
+
+ +

Utility function to disconnect everything related to a given value or instance from a dispatcher.

+
Template Parameters
+ + +
TypeType of class or type of payload.
+
+
+
Parameters
+ + +
value_or_instanceA valid object that fits the purpose.
+
+
+ +

Definition at line 344 of file dispatcher.hpp.

+ +
+
+ +

◆ enqueue() [1/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Event , typename... Args>
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::enqueue (Args &&... args)
+ 		+inline
+
+ +

Enqueues an event of the given type.

+
Template Parameters
+ + + +
EventType of event to enqueue.
ArgsTypes of arguments to use to construct the event.
+
+
+
Parameters
+ + +
argsArguments to use to construct the event.
+
+
+ +

Definition at line 289 of file dispatcher.hpp.

+ +
+
+ +

◆ enqueue() [2/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::enqueue (Event && event)
+ 		+inline
+
+ +

Enqueues an event of the given type.

+
Template Parameters
+ + +
EventType of event to enqueue.
+
+
+
Parameters
+ + +
eventAn instance of the given type of event.
+
+
+ +

Definition at line 299 of file dispatcher.hpp.

+ +
+
+ +

◆ enqueue_hint() [1/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Event , typename... Args>
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void entt::basic_dispatcher< Allocator >::enqueue_hint (const id_type id,
Args &&... args 
)
+ 		+inline
+
+ +

Enqueues an event of the given type.

+
Template Parameters
+ + + +
EventType of event to enqueue.
ArgsTypes of arguments to use to construct the event.
+
+
+
Parameters
+ + + +
idName used to map the event queue within the dispatcher.
argsArguments to use to construct the event.
+
+
+ +

Definition at line 311 of file dispatcher.hpp.

+ +
+
+ +

◆ enqueue_hint() [2/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void entt::basic_dispatcher< Allocator >::enqueue_hint (const id_type id,
Event && event 
)
+ 		+inline
+
+ +

Enqueues an event of the given type.

+
Template Parameters
+ + +
EventType of event to enqueue.
+
+
+
Parameters
+ + + +
idName used to map the event queue within the dispatcher.
eventAn instance of the given type of event.
+
+
+ +

Definition at line 322 of file dispatcher.hpp.

+ +
+
+ +

◆ get_allocator()

+ +
+
+
+template<typename Allocator >
+ + + + + +
+ + + + + + + +
constexpr allocator_type entt::basic_dispatcher< Allocator >::get_allocator () const
+ 		+inlineconstexpr
+
+ +

Returns the associated allocator.

+
Returns
The associated allocator.
+ +

Definition at line 208 of file dispatcher.hpp.

+ +
+
+ +

◆ operator=()

+ +
+
+
+template<typename Allocator >
+ + + + + +
+ + + + + + + + +
basic_dispatcher& entt::basic_dispatcher< Allocator >::operator= (basic_dispatcher< Allocator > && other)
+ 		+inline
+
+ +

Move assignment operator.

+
Parameters
+ + +
otherThe instance to move from.
+
+
+
Returns
This dispatcher.
+ +

Definition at line 190 of file dispatcher.hpp.

+ +
+
+ +

◆ sink()

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + +
auto entt::basic_dispatcher< Allocator >::sink (const id_type id = type_hash<Event>::value())
+ 		+inline
+
+ +

Returns a sink object for the given event and queue.

+

A sink is an opaque object used to connect listeners to events.

+

The function type for a listener is compatible with:

void(Event &);
+

The order of invocation of the listeners isn't guaranteed.

+
See also
sink
+
Template Parameters
+ + +
EventType of event of which to get the sink.
+
+
+
Parameters
+ + +
idName used to map the event queue within the dispatcher.
+
+
+
Returns
A temporary sink object.
+ +

Definition at line 257 of file dispatcher.hpp.

+ +
+
+ +

◆ size() [1/2]

+ +
+
+
+template<typename Allocator >
+ + + + + +
+ + + + + + + +
size_type entt::basic_dispatcher< Allocator >::size () const
+ 		+inline
+
+ +

Returns the total number of pending events.

+
Returns
The total number of pending events.
+ +

Definition at line 228 of file dispatcher.hpp.

+ +
+
+ +

◆ size() [2/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + +
size_type entt::basic_dispatcher< Allocator >::size (const id_type id = type_hash<Event>::value()) const
+ 		+inline
+
+ +

Returns the number of pending events for a given type.

+
Template Parameters
+ + +
EventType of event for which to return the count.
+
+
+
Parameters
+ + +
idName used to map the event queue within the dispatcher.
+
+
+
Returns
The number of pending events for the given type.
+ +

Definition at line 219 of file dispatcher.hpp.

+ +
+
+ +

◆ swap()

+ +
+
+
+template<typename Allocator >
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::swap (basic_dispatcher< Allocator > & other)
+ 		+inline
+
+ +

Exchanges the contents with those of a given dispatcher.

+
Parameters
+ + +
otherDispatcher to exchange the content with.
+
+
+ +

Definition at line 199 of file dispatcher.hpp.

+ +
+
+ +

◆ trigger() [1/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
void entt::basic_dispatcher< Allocator >::trigger (const id_type id,
Event && event = {} 
)
+ 		+inline
+
+ +

Triggers an immediate event on a queue of a given type.

+
Template Parameters
+ + +
EventType of event to trigger.
+
+
+
Parameters
+ + + +
eventAn instance of the given type of event.
idName used to map the event queue within the dispatcher.
+
+
+ +

Definition at line 278 of file dispatcher.hpp.

+ +
+
+ +

◆ trigger() [2/2]

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::trigger (Event && event = {})
+ 		+inline
+
+ +

Triggers an immediate event of a given type.

+
Template Parameters
+ + +
EventType of event to trigger.
+
+
+
Parameters
+ + +
eventAn instance of the given type of event.
+
+
+ +

Definition at line 267 of file dispatcher.hpp.

+ +
+
+ +

◆ update()

+ +
+
+
+template<typename Allocator >
+
+template<typename Event >
+ + + + + +
+ + + + + + + + +
void entt::basic_dispatcher< Allocator >::update (const id_type id = type_hash<Event>::value())
+ 		+inline
+
+ +

Delivers all the pending events of a given queue.

+
Template Parameters
+ + +
EventType of event to send.
+
+
+
Parameters
+ + +
idName used to map the event queue within the dispatcher.
+
+
+ +

Definition at line 373 of file dispatcher.hpp.

+ +
+
+
The documentation for this class was generated from the following file: +
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/classentt_1_1basic__group.html b/classentt_1_1basic__group.html index 0e43bba12..aef69940d 100644 --- a/classentt_1_1basic__group.html +++ b/classentt_1_1basic__group.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
reverse_iterator = typename base_type::reverse_iterator
 Reversed iterator type.
 
-using iterable = iterable_adaptor< extended_group_iterator< type_list_cat_t< std::conditional_t< ignore_as_empty_v< std::remove_const_t< Owned > >, type_list<>, type_list< decltype(std::declval< storage_type< Owned > >().end())> >... > >>
 Iterable group type.
 
+using iterable = iterable_adaptor< extended_group_iterator >
 Iterable group type.
 
@@ -167,7 +167,7 @@ Public Member Functions - + @@ -244,7 +244,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

Returns the last entity of the group, if any.

Returns
The last entity of the group if one exists, the null entity otherwise.
-

Definition at line 708 of file group.hpp.

+

Definition at line 712 of file group.hpp.

@@ -277,7 +277,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

The returned iterator points to the first entity of the group. If the group is empty, the returned iterator will be equal to end().

Returns
An iterator to the first entity of the group.
-

Definition at line 648 of file group.hpp.

+

Definition at line 652 of file group.hpp.

@@ -316,7 +316,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex
Returns
True if the group contains the given entity, false otherwise.
-

Definition at line 746 of file group.hpp.

+

Definition at line 750 of file group.hpp.

@@ -332,7 +332,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex @@ -81,17 +81,39 @@ $(function() { More...

#include <hashed_string.hpp>

+
+Inheritance diagram for entt::basic_hashed_string< Char >:
+
+
Inheritance graph
+ + + + +
[legend]
+
+Collaboration diagram for entt::basic_hashed_string< Char >:
+
+
Collaboration graph
+ + + + +
[legend]

Public Member Functions

void each (Func func) const
 Iterates entities and components and applies the given function object to them. More...
 
iterable each () const
iterable each () const
 Returns an iterable object to use to visit a group. More...
 
template<typename... Comp, typename Compare , typename Sort = std_sort, typename... Args>
- + @@ -350,7 +350,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex
Note
Empty types aren't explicitly instantiated and therefore they are never returned during iterations.
Returns
An iterable object to use to visit the group.
-

Definition at line 824 of file group.hpp.

+

Definition at line 828 of file group.hpp.

@@ -387,7 +387,7 @@ template<typename Func > The signature of the function must be equivalent to one of the following forms:

void(const entity_type, Type &...);
void(Type &...);
-
entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: group.hpp:588
+
entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: group.hpp:592
Note
Empty types aren't explicitly instantiated and therefore they are never returned during iterations.
Template Parameters
iterable entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each iterable entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each ( ) const
@@ -402,7 +402,7 @@ template<typename Func > -

Definition at line 801 of file group.hpp.

+

Definition at line 805 of file group.hpp.

@@ -434,7 +434,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

Checks whether a group is empty.

Returns
True if the group is empty, false otherwise.
-

Definition at line 636 of file group.hpp.

+

Definition at line 640 of file group.hpp.

@@ -467,7 +467,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

The returned iterator points to the entity following the last entity of the group. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the entity following the last entity of the group.
-

Definition at line 662 of file group.hpp.

+

Definition at line 666 of file group.hpp.

@@ -506,7 +506,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex
Returns
An iterator to the given entity if it's found, past the end iterator otherwise.
-

Definition at line 719 of file group.hpp.

+

Definition at line 723 of file group.hpp.

@@ -538,7 +538,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

Returns the first entity of the group, if any.

Returns
The first entity of the group if one exists, the null entity otherwise.
-

Definition at line 698 of file group.hpp.

+

Definition at line 702 of file group.hpp.

@@ -587,7 +587,7 @@ template<typename... Comp>
Returns
The components assigned to the entity.
-

Definition at line 766 of file group.hpp.

+

Definition at line 770 of file group.hpp.

@@ -619,7 +619,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

Checks if a group is properly initialized.

Returns
True if the group is properly initialized, false otherwise.
-

Definition at line 737 of file group.hpp.

+

Definition at line 741 of file group.hpp.

@@ -658,7 +658,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex
Returns
The identifier that occupies the given position.
-

Definition at line 729 of file group.hpp.

+

Definition at line 733 of file group.hpp.

@@ -691,7 +691,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

The returned iterator points to the first entity of the reversed group. If the group is empty, the returned iterator will be equal to rend().

Returns
An iterator to the first entity of the reversed group.
-

Definition at line 674 of file group.hpp.

+

Definition at line 678 of file group.hpp.

@@ -724,7 +724,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

The returned iterator points to the entity following the last entity of the reversed group. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the entity following the last entity of the reversed group.
-

Definition at line 689 of file group.hpp.

+

Definition at line 693 of file group.hpp.

@@ -756,7 +756,7 @@ template<typename Entity , typename... Owned, typename... Get, typename... Ex

Returns the number of entities that have the given components.

Returns
Number of entities that have the given components.
-

Definition at line 628 of file group.hpp.

+

Definition at line 632 of file group.hpp.

@@ -836,7 +836,7 @@ template<typename... Comp, typename Compare , typename Sort = std_sort, type -

Definition at line 870 of file group.hpp.

+

Definition at line 871 of file group.hpp.

@@ -876,7 +876,7 @@ template<typename Comp >
Returns
The storage for the given component type.
-

Definition at line 610 of file group.hpp.

+

Definition at line 614 of file group.hpp.

@@ -916,7 +916,7 @@ template<std::size_t Comp>
Returns
The storage for the given component type.
-

Definition at line 620 of file group.hpp.

+

Definition at line 624 of file group.hpp.

diff --git a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_d1b588b8defb2c18055ed873d9381c9c.html b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_d1b588b8defb2c18055ed873d9381c9c.html index a5a25f4fb..f2bc6aec6 100644 --- a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_d1b588b8defb2c18055ed873d9381c9c.html +++ b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_d1b588b8defb2c18055ed873d9381c9c.html @@ -22,7 +22,7 @@ @@ -87,7 +87,7 @@ $(function() { - + diff --git a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html index cd73bf8ff..91ab31fec 100644 --- a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html +++ b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html @@ -22,7 +22,7 @@ @@ -73,7 +73,7 @@ $(function() { Friends | List of all members
-
entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > Class Template Referencefinal
+
entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > Class Template Reference
diff --git a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01excluff5f4dda4c7dc5809638c5bd3d968ad9.html b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01excluff5f4dda4c7dc5809638c5bd3d968ad9.html index 1d008c8d1..94af99405 100644 --- a/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01excluff5f4dda4c7dc5809638c5bd3d968ad9.html +++ b/classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01excluff5f4dda4c7dc5809638c5bd3d968ad9.html @@ -22,7 +22,7 @@
diff --git a/classentt_1_1basic__hashed__string-members.html b/classentt_1_1basic__hashed__string-members.html index ab7b12e5e..b660cda10 100644 --- a/classentt_1_1basic__hashed__string-members.html +++ b/classentt_1_1basic__hashed__string-members.html @@ -22,7 +22,7 @@ @@ -74,17 +74,20 @@ $(function() {

This is the complete list of members for entt::basic_hashed_string< Char >, including all inherited members.

EnTT -  3.9.0 +  3.10.0
find(const entity_type entt) constentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >inline
front() constentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >inline
get(const entity_type entt) constentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >inline
iterable typedefentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >
iterable typedefentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >
iterator typedefentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >
operator bool() constentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >inlineexplicit
operator[](const size_type pos) constentt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >inline
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
- - - - - - - - - - - + + + + + + + + + + + + + +
basic_hashed_string()entt::basic_hashed_string< Char >inline
basic_hashed_string(const value_type(&curr)[N])entt::basic_hashed_string< Char >inline
basic_hashed_string(const_wrapper wrapper)entt::basic_hashed_string< Char >inlineexplicit
data() constentt::basic_hashed_string< Char >inline
hash_type typedefentt::basic_hashed_string< Char >
operator const value_type *() constentt::basic_hashed_string< Char >inline
operator hash_type() constentt::basic_hashed_string< Char >inline
value(const value_type *str, std::size_t size)entt::basic_hashed_string< Char >inlinestatic
value(const value_type(&str)[N])entt::basic_hashed_string< Char >inlinestatic
value(const_wrapper wrapper)entt::basic_hashed_string< Char >inlinestatic
value() constentt::basic_hashed_string< Char >inline
value_type typedefentt::basic_hashed_string< Char >
basic_hashed_string(const value_type *str, const size_type len)entt::basic_hashed_string< Char >inline
basic_hashed_string(const value_type(&str)[N])entt::basic_hashed_string< Char >inline
basic_hashed_string(const_wrapper wrapper)entt::basic_hashed_string< Char >inlineexplicit
data() constentt::basic_hashed_string< Char >inline
hash_type typedefentt::basic_hashed_string< Char >
operator const value_type *() constentt::basic_hashed_string< Char >inline
operator hash_type() constentt::basic_hashed_string< Char >inline
size() constentt::basic_hashed_string< Char >inline
size_type typedefentt::basic_hashed_string< Char >
value(const value_type *str, const size_type len)entt::basic_hashed_string< Char >inlinestatic
value(const value_type(&str)[N])entt::basic_hashed_string< Char >inlinestatic
value(const_wrapper wrapper)entt::basic_hashed_string< Char >inlinestatic
value() constentt::basic_hashed_string< Char >inline
value_type typedefentt::basic_hashed_string< Char >
diff --git a/classentt_1_1basic__hashed__string.html b/classentt_1_1basic__hashed__string.html index 89d26f0b0..f704aee6f 100644 --- a/classentt_1_1basic__hashed__string.html +++ b/classentt_1_1basic__hashed__string.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
- - - - - - + + + + + + + + +

Public Types

-using value_type = Char
 Character type.
 
-using hash_type = id_type
 Unsigned integer type.
 
+using value_type = typename base_type::value_type
 Character type.
 
+using size_type = typename base_type::size_type
 Unsigned integer type.
 
+using hash_type = typename base_type::hash_type
 Unsigned integer type.
 
@@ -99,17 +121,23 @@ Public Member Functions constexpr  - - - - + + + + + + + - + + + + - + @@ -121,23 +149,23 @@ constexpr  - - + +

Public Member Functions

basic_hashed_string ()
 Constructs an empty hashed string.
 
template<std::size_t N>
constexpr basic_hashed_string (const value_type(&curr)[N])
 Constructs a hashed string from an array of const characters. More...
 
constexpr basic_hashed_string (const value_type *str, const size_type len)
 Constructs a hashed string from a string view. More...
 
template<std::size_t N>
constexpr basic_hashed_string (const value_type(&str)[N])
 Constructs a hashed string from an array of const characters. More...
 
constexpr basic_hashed_string (const_wrapper wrapper)
 Explicit constructor on purpose to avoid constructing a hashed string directly from a const value_type *. More...
 
constexpr const value_type * data () const
constexpr size_type size () const
 Returns the size a hashed string. More...
 
constexpr const value_type * data () const
 Returns the human-readable representation of a hashed string. More...
 
constexpr hash_type value () const
constexpr hash_type value () const
 Returns the numeric representation of a hashed string. More...
 
constexpr operator const value_type * () const
- - - + + + - + - - - + + +

Static Public Member Functions

static constexpr hash_type value (const value_type *str, std::size_t size)
 Returns directly the numeric representation of a string view. More...
 
static constexpr hash_type value (const value_type *str, const size_type len)
 Returns directly the numeric representation of a string view. More...
 
template<std::size_t N>
static constexpr hash_type value (const value_type(&str)[N])
static constexpr hash_type value (const value_type(&str)[N])
 Returns directly the numeric representation of a string. More...
 
static hash_type value (const_wrapper wrapper)
 Returns directly the numeric representation of a string. More...
 
static constexpr hash_type value (const_wrapper wrapper)
 Returns directly the numeric representation of a string. More...
 

Detailed Description

template<typename Char>
class entt::basic_hashed_string< Char >

Zero overhead unique identifier.

-

A hashed string is a compile-time tool that allows users to use human-readable identifers in the codebase while using their numeric counterparts at runtime.
+

A hashed string is a compile-time tool that allows users to use human-readable identifiers in the codebase while using their numeric counterparts at runtime.
Because of that, a hashed string can also be used in constant expressions if required.

Warning
This class doesn't take ownership of user-supplied strings nor does it make a copy of them.
Template Parameters
@@ -147,10 +175,59 @@ class entt::basic_hashed_string< Char >
-

Definition at line 58 of file hashed_string.hpp.

+

Definition at line 69 of file hashed_string.hpp.

Constructor & Destructor Documentation

- -

◆ basic_hashed_string() [1/2]

+ +

◆ basic_hashed_string() [1/3]

+ +
+
+
+template<typename Char >
+ + + + + +
+ + + + + + + + + + + + + + + + + + +
constexpr entt::basic_hashed_string< Char >::basic_hashed_string (const value_type * str,
const size_type len 
)
+ 		+inlineconstexpr
+
+ +

Constructs a hashed string from a string view.

+
Parameters
+ + + +
strHuman-readable identifier.
lenLength of the string to hash.
+
+
+ +

Definition at line 148 of file hashed_string.hpp.

+ +
+
+ +

◆ basic_hashed_string() [2/3]

@@ -165,8 +242,8 @@ template<std::size_t N>
constexpr entt::basic_hashed_string< Char >::basic_hashed_string (const value_type(&) curr[N])const value_type(&) str[N])
@@ -178,9 +255,7 @@ template<std::size_t N>

Constructs a hashed string from an array of const characters.

-

Forcing template resolution avoids implicit conversions. An human-readable identifier can be anything but a plain, old bunch of characters.
- Example of use:

basic_hashed_string<char> hs{"my.png"};
-
Template Parameters
+
Template Parameters
NNumber of characters of the identifier.
@@ -188,17 +263,17 @@ template<std::size_t N>
Parameters
- +
currHuman-readable identifer.
strHuman-readable identifier.
-

Definition at line 145 of file hashed_string.hpp.

+

Definition at line 157 of file hashed_string.hpp.

-

◆ basic_hashed_string() [2/2]

+

◆ basic_hashed_string() [3/3]

@@ -232,7 +307,7 @@ template<typename Char >
-

Definition at line 158 of file hashed_string.hpp.

+

Definition at line 169 of file hashed_string.hpp.

@@ -249,7 +324,7 @@ template<typename Char > - + @@ -263,9 +338,9 @@ template<typename Char >

Returns the human-readable representation of a hashed string.

-
Returns
The string used to initialize the instance.
+
Returns
The string used to initialize the hashed string.
-

Definition at line 166 of file hashed_string.hpp.

+

Definition at line 184 of file hashed_string.hpp.

@@ -281,7 +356,7 @@ template<typename Char > @@ -1369,17 +1381,18 @@ template<typename Entity , typename Allocator >
constexpr const value_type* entt::basic_hashed_string< Char >::data constexpr const value_type* entt::basic_hashed_string< Char >::data ( ) const - + @@ -295,9 +370,9 @@ template<typename Char >

Returns the human-readable representation of a hashed string.

-
Returns
The string used to initialize the instance.
+
Returns
The string used to initialize the hashed string.
-

Definition at line 179 of file hashed_string.hpp.

+

Definition at line 197 of file hashed_string.hpp.

@@ -313,7 +388,7 @@ template<typename Char > diff --git a/classentt_1_1basic__observer.html b/classentt_1_1basic__observer.html index c5ba9f869..bdc401a0a 100644 --- a/classentt_1_1basic__observer.html +++ b/classentt_1_1basic__observer.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__organizer-members.html b/classentt_1_1basic__organizer-members.html index 5c5ef78b3..8dc3a857a 100644 --- a/classentt_1_1basic__organizer-members.html +++ b/classentt_1_1basic__organizer-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__organizer.html b/classentt_1_1basic__organizer.html index c84c987c2..666a8a8b3 100644 --- a/classentt_1_1basic__organizer.html +++ b/classentt_1_1basic__organizer.html @@ -22,7 +22,7 @@ @@ -138,7 +138,7 @@ class entt::basic_organizer< Entity > -

Definition at line 111 of file organizer.hpp.

+

Definition at line 108 of file organizer.hpp.

Member Function Documentation

◆ emplace() [1/3]

@@ -183,7 +183,7 @@ template<auto Candidate, typename... Req> -

Definition at line 361 of file organizer.hpp.

+

Definition at line 358 of file organizer.hpp.

@@ -247,7 +247,7 @@ template<typename... Req> -

Definition at line 425 of file organizer.hpp.

+

Definition at line 422 of file organizer.hpp.

@@ -306,7 +306,7 @@ template<auto Candidate, typename... Req, typename Type > -

Definition at line 393 of file organizer.hpp.

+

Definition at line 390 of file organizer.hpp.

@@ -338,7 +338,7 @@ template<typename Entity >

Generates a task graph for the current content.

Returns
The adjacency list of the task graph.
-

Definition at line 446 of file organizer.hpp.

+

Definition at line 443 of file organizer.hpp.

diff --git a/classentt_1_1basic__poly-members.html b/classentt_1_1basic__poly-members.html index 8526702ff..1d26ff661 100644 --- a/classentt_1_1basic__poly-members.html +++ b/classentt_1_1basic__poly-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__poly.html b/classentt_1_1basic__poly.html index b53a7004f..f36dfe1bc 100644 --- a/classentt_1_1basic__poly.html +++ b/classentt_1_1basic__poly.html @@ -22,7 +22,7 @@ @@ -124,7 +124,7 @@ Public Member Functions - + @@ -182,7 +182,7 @@ class entt::basic_poly< Concept, Len, Align > -

Definition at line 192 of file poly.hpp.

+

Definition at line 193 of file poly.hpp.

Constructor & Destructor Documentation

◆ basic_poly() [1/2]

@@ -237,7 +237,7 @@ template<typename Type , typename... Args> -

Definition at line 214 of file poly.hpp.

+

Definition at line 215 of file poly.hpp.

@@ -283,7 +283,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s -

Definition at line 224 of file poly.hpp.

+

Definition at line 225 of file poly.hpp.

@@ -316,7 +316,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Aliasing constructor.

Returns
A poly that shares a reference to an unmanaged object.
-

Definition at line 291 of file poly.hpp.

+

Definition at line 292 of file poly.hpp.

@@ -348,7 +348,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Aliasing constructor.

Returns
A poly that shares a reference to an unmanaged object.
-

Definition at line 299 of file poly.hpp.

+

Definition at line 300 of file poly.hpp.

@@ -380,7 +380,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Returns an opaque pointer to the contained instance.

Returns
An opaque pointer the contained instance, if any.
-

Definition at line 244 of file poly.hpp.

+

Definition at line 245 of file poly.hpp.

@@ -412,7 +412,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Returns an opaque pointer to the contained instance.

Returns
An opaque pointer the contained instance, if any.
-

Definition at line 239 of file poly.hpp.

+

Definition at line 240 of file poly.hpp.

@@ -459,7 +459,7 @@ template<typename Type , typename... Args> -

Definition at line 255 of file poly.hpp.

+

Definition at line 256 of file poly.hpp.

@@ -491,7 +491,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Returns false if a poly is empty, true otherwise.

Returns
False if the poly is empty, true otherwise.
-

Definition at line 270 of file poly.hpp.

+

Definition at line 271 of file poly.hpp.

@@ -523,7 +523,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Returns a pointer to the underlying concept.

Returns
A pointer to the underlying concept.
-

Definition at line 278 of file poly.hpp.

+

Definition at line 279 of file poly.hpp.

@@ -555,7 +555,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Returns a pointer to the underlying concept.

Returns
A pointer to the underlying concept.
-

Definition at line 283 of file poly.hpp.

+

Definition at line 284 of file poly.hpp.

@@ -571,7 +571,7 @@ template<typename Concept , std::size_t Len, std::size_t Align> @@ -99,13 +99,20 @@ using  + + +
constexpr entt::basic_hashed_string< Char >::operator const value_type * constexpr entt::basic_hashed_string< Char >::operator const value_type * ( ) const - + @@ -327,9 +402,41 @@ template<typename Char >

Returns the numeric representation of a hashed string.

-
Returns
The numeric representation of the instance.
+
Returns
The numeric representation of the hashed string.
-

Definition at line 187 of file hashed_string.hpp.

+

Definition at line 205 of file hashed_string.hpp.

+ +
+ + +

◆ size()

+ +
+
+
+template<typename Char >
+
constexpr entt::basic_hashed_string< Char >::operator hash_type constexpr entt::basic_hashed_string< Char >::operator hash_type ( ) const
+ + + + +
+ + + + + + + +
constexpr size_type entt::basic_hashed_string< Char >::size () const
+ 		+inlineconstexpr
+
+ +

Returns the size a hashed string.

+
Returns
The size of the hashed string.
+ +

Definition at line 176 of file hashed_string.hpp.

@@ -345,7 +452,7 @@ template<typename Char > 		- + @@ -359,14 +466,14 @@ template<typename Char >

Returns the numeric representation of a hashed string.

-
Returns
The numeric representation of the instance.
+
Returns
The numeric representation of the hashed string.
-

Definition at line 174 of file hashed_string.hpp.

+

Definition at line 192 of file hashed_string.hpp.

- -

◆ value() [2/4]

+ +

◆ value() [2/4]

@@ -377,16 +484,16 @@ template<typename Char >
+inlinestaticconstexpr
constexpr hash_type entt::basic_hashed_string< Char >::value constexpr hash_type entt::basic_hashed_string< Char >::value ( ) const - + - + - - + + @@ -404,14 +511,14 @@ template<typename Char >

Returns directly the numeric representation of a string view.

Parameters
static constexpr hash_type entt::basic_hashed_string< Char >::value static constexpr hash_type entt::basic_hashed_string< Char >::value (const value_type * const value_type *  str,
std::size_t size const size_type len 
- - + +
strHuman-readable identifer.
sizeLength of the string to hash.
strHuman-readable identifier.
lenLength of the string to hash.
Returns
The numeric representation of the string.
-

Definition at line 90 of file hashed_string.hpp.

+

Definition at line 115 of file hashed_string.hpp.

@@ -429,9 +536,9 @@ template<std::size_t N> 		- + - + @@ -444,10 +551,7 @@ template<std::size_t N>

Returns directly the numeric representation of a string.

-

Forcing template resolution avoids implicit conversions. An human-readable identifier can be anything but a plain, old bunch of characters.
- Example of use:

const auto value = basic_hashed_string<char>::value("my.png");
-
entt::basic_hashed_string::value
constexpr hash_type value() const
Returns the numeric representation of a hashed string.
Definition: hashed_string.hpp:174
-
Template Parameters
+
Template Parameters
static constexpr hash_type entt::basic_hashed_string< Char >::value static constexpr hash_type entt::basic_hashed_string< Char >::value (const value_type(&) const value_type(&)  str[N])
NNumber of characters of the identifier.
@@ -455,18 +559,18 @@ template<std::size_t N>
Parameters
- +
strHuman-readable identifer.
strHuman-readable identifier.
Returns
The numeric representation of the string.
-

Definition at line 112 of file hashed_string.hpp.

+

Definition at line 126 of file hashed_string.hpp.

- -

◆ value() [4/4]

+ +

◆ value() [4/4]

@@ -477,7 +581,7 @@ template<typename Char >
- + @@ -486,7 +590,7 @@ template<typename Char >
static hash_type entt::basic_hashed_string< Char >::value static constexpr hash_type entt::basic_hashed_string< Char >::value ( const_wrapper  wrapper)
-inlinestatic
@@ -500,7 +604,7 @@ template<typename Char >
Returns
The numeric representation of the string.
-

Definition at line 121 of file hashed_string.hpp.

+

Definition at line 135 of file hashed_string.hpp.

diff --git a/classentt_1_1basic__hashed__string__coll__graph.map b/classentt_1_1basic__hashed__string__coll__graph.map new file mode 100644 index 000000000..04637f91e --- /dev/null +++ b/classentt_1_1basic__hashed__string__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/classentt_1_1basic__hashed__string__coll__graph.md5 b/classentt_1_1basic__hashed__string__coll__graph.md5 new file mode 100644 index 000000000..d8266fa15 --- /dev/null +++ b/classentt_1_1basic__hashed__string__coll__graph.md5 @@ -0,0 +1 @@ +d0e9c7bb9b3bcf109c1b0d491d645b59 \ No newline at end of file diff --git a/classentt_1_1basic__hashed__string__coll__graph.png b/classentt_1_1basic__hashed__string__coll__graph.png new file mode 100644 index 000000000..2768ab90a Binary files /dev/null and b/classentt_1_1basic__hashed__string__coll__graph.png differ diff --git a/classentt_1_1basic__hashed__string__inherit__graph.map b/classentt_1_1basic__hashed__string__inherit__graph.map new file mode 100644 index 000000000..04637f91e --- /dev/null +++ b/classentt_1_1basic__hashed__string__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/classentt_1_1basic__hashed__string__inherit__graph.md5 b/classentt_1_1basic__hashed__string__inherit__graph.md5 new file mode 100644 index 000000000..d8266fa15 --- /dev/null +++ b/classentt_1_1basic__hashed__string__inherit__graph.md5 @@ -0,0 +1 @@ +d0e9c7bb9b3bcf109c1b0d491d645b59 \ No newline at end of file diff --git a/classentt_1_1basic__hashed__string__inherit__graph.png b/classentt_1_1basic__hashed__string__inherit__graph.png new file mode 100644 index 000000000..2768ab90a Binary files /dev/null and b/classentt_1_1basic__hashed__string__inherit__graph.png differ diff --git a/classentt_1_1basic__observer-members.html b/classentt_1_1basic__observer-members.html index bcec59dc9..e574110b7 100644 --- a/classentt_1_1basic__observer-members.html +++ b/classentt_1_1basic__observer-members.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
 basic_poly (Type &&value)
 Constructs a poly from a given value. More...
 
const type_info & type () const
const type_info & type () const
 Returns the object type if any, type_id<void>() otherwise. More...
 
const void * data () const
- + @@ -587,7 +587,7 @@ template<typename Concept , std::size_t Len, std::size_t Align>

Returns the object type if any, type_id<void>() otherwise.

Returns
The object type if any, type_id<void>() otherwise.
-

Definition at line 231 of file poly.hpp.

+

Definition at line 232 of file poly.hpp.

diff --git a/classentt_1_1basic__registry-members.html b/classentt_1_1basic__registry-members.html index ee853e4fe..d9904d521 100644 --- a/classentt_1_1basic__registry-members.html +++ b/classentt_1_1basic__registry-members.html @@ -22,7 +22,7 @@ @@ -78,18 +78,18 @@ $(function() { - - - - - + + + + + + + - - - - + + @@ -105,10 +105,10 @@ $(function() { - - - - + + + + @@ -116,36 +116,33 @@ $(function() { - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + - - - - + + + + - - - - - + + + +
const type_info& entt::basic_poly< Concept, Len, Align >::type const type_info& entt::basic_poly< Concept, Len, Align >::type ( ) const
EnTT -  3.9.0 +  3.10.0
any_of(const entity_type entity) constentt::basic_registry< Entity >inline
assign(It first, It last, const entity_type destroyed)entt::basic_registry< Entity >inline
base_type typedefentt::basic_registry< Entity >
basic_registry()=defaultentt::basic_registry< Entity >
basic_registry(basic_registry &&other)entt::basic_registry< Entity >inline
capacity() constentt::basic_registry< Entity >inline
clear()entt::basic_registry< Entity >inline
compact()entt::basic_registry< Entity >inline
basic_registry()entt::basic_registry< Entity >inline
basic_registry(const size_type count)entt::basic_registry< Entity >inline
basic_registry(basic_registry &&other)entt::basic_registry< Entity >inline
capacity() constentt::basic_registry< Entity >inline
clear()entt::basic_registry< Entity >inline
compact()entt::basic_registry< Entity >inline
context typedefentt::basic_registry< Entity >
create()entt::basic_registry< Entity >inline
create(const entity_type hint)entt::basic_registry< Entity >inline
create(It first, It last)entt::basic_registry< Entity >inline
ctx() constentt::basic_registry< Entity >inline
ctx()entt::basic_registry< Entity >inline
ctx(Func func) constentt::basic_registry< Entity >inline
ctx_or_set(Args &&...args)entt::basic_registry< Entity >inline
ctx()entt::basic_registry< Entity >inline
ctx() constentt::basic_registry< Entity >inline
current(const entity_type entity) constentt::basic_registry< Entity >inline
data() constentt::basic_registry< Entity >inline
destroy(const entity_type entity)entt::basic_registry< Entity >inline
get([[maybe_unused]] const entity_type entity) constentt::basic_registry< Entity >inline
get([[maybe_unused]] const entity_type entity)entt::basic_registry< Entity >inline
get_or_emplace(const entity_type entity, Args &&...args)entt::basic_registry< Entity >inline
group(get_t< Get... >, exclude_t< Exclude... >={})entt::basic_registry< Entity >inline
group(exclude_t< Exclude... >={})entt::basic_registry< Entity >inline
group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) constentt::basic_registry< Entity >inline
group_if_exists(exclude_t< Exclude... >={}) constentt::basic_registry< Entity >inline
group(get_t< Get... >, exclude_t< Exclude... >={})entt::basic_registry< Entity >inline
group(exclude_t< Exclude... >={})entt::basic_registry< Entity >inline
group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) constentt::basic_registry< Entity >inline
group_if_exists(exclude_t< Exclude... >={}) constentt::basic_registry< Entity >inline
insert(It first, It last, const Component &value={})entt::basic_registry< Entity >inline
insert(EIt first, EIt last, CIt from)entt::basic_registry< Entity >inline
on_construct()entt::basic_registry< Entity >inline
on_update()entt::basic_registry< Entity >inline
operator=(basic_registry &&other)entt::basic_registry< Entity >inline
orphan(const entity_type entity) constentt::basic_registry< Entity >inline
patch(const entity_type entity, Func &&...func)entt::basic_registry< Entity >inline
release(const entity_type entity)entt::basic_registry< Entity >inline
release(const entity_type entity, const version_type version)entt::basic_registry< Entity >inline
release(It first, It last)entt::basic_registry< Entity >inline
released() constentt::basic_registry< Entity >inline
remove(const entity_type entity)entt::basic_registry< Entity >inline
remove(It first, It last)entt::basic_registry< Entity >inline
replace(const entity_type entity, Args &&...args)entt::basic_registry< Entity >inline
reserve(const size_type cap)entt::basic_registry< Entity >inline
runtime_view(ItComp first, ItComp last, ItExcl from={}, ItExcl to={}) constentt::basic_registry< Entity >inline
set(Args &&...args)entt::basic_registry< Entity >inline
size() constentt::basic_registry< Entity >inline
size_type typedefentt::basic_registry< Entity >
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_registry< Entity >inline
sort()entt::basic_registry< Entity >inline
sortable() constentt::basic_registry< Entity >inline
sortable(const basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)entt::basic_registry< Entity >inline
owned() constentt::basic_registry< Entity >inline
patch(const entity_type entity, Func &&...func)entt::basic_registry< Entity >inline
release(const entity_type entity)entt::basic_registry< Entity >inline
release(const entity_type entity, const version_type version)entt::basic_registry< Entity >inline
release(It first, It last)entt::basic_registry< Entity >inline
released() constentt::basic_registry< Entity >inline
remove(const entity_type entity)entt::basic_registry< Entity >inline
remove(It first, It last)entt::basic_registry< Entity >inline
replace(const entity_type entity, Args &&...args)entt::basic_registry< Entity >inline
reserve(const size_type cap)entt::basic_registry< Entity >inline
size() constentt::basic_registry< Entity >inline
size_type typedefentt::basic_registry< Entity >
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_registry< Entity >inline
sort()entt::basic_registry< Entity >inline
sortable(const basic_group< entity_type, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)entt::basic_registry< Entity >inline
storage()entt::basic_registry< Entity >inline
storage() constentt::basic_registry< Entity >inline
storage(const id_type id=type_hash< Component >::value())entt::basic_registry< Entity >inline
storage(const id_type id=type_hash< Component >::value()) constentt::basic_registry< Entity >inline
try_ctx() constentt::basic_registry< Entity >inline
try_ctx()entt::basic_registry< Entity >inline
storage(const id_type id)entt::basic_registry< Entity >inline
storage(const id_type id) constentt::basic_registry< Entity >inline
storage(const id_type id=type_hash< std::remove_const_t< Component >>::value())entt::basic_registry< Entity >inline
storage(const id_type id=type_hash< std::remove_const_t< Component >>::value()) constentt::basic_registry< Entity >inline
try_get([[maybe_unused]] const entity_type entity) constentt::basic_registry< Entity >inline
try_get([[maybe_unused]] const entity_type entity)entt::basic_registry< Entity >inline
unset()entt::basic_registry< Entity >inline
valid(const entity_type entity) constentt::basic_registry< Entity >inline
version_type typedefentt::basic_registry< Entity >
view(exclude_t< Exclude... >={}) constentt::basic_registry< Entity >inline
view(exclude_t< Exclude... >={})entt::basic_registry< Entity >inline
valid(const entity_type entity) constentt::basic_registry< Entity >inline
version_type typedefentt::basic_registry< Entity >
view(exclude_t< Exclude... >={}) constentt::basic_registry< Entity >inline
view(exclude_t< Exclude... >={})entt::basic_registry< Entity >inline
diff --git a/classentt_1_1basic__registry.html b/classentt_1_1basic__registry.html index 404b53572..cabba9deb 100644 --- a/classentt_1_1basic__registry.html +++ b/classentt_1_1basic__registry.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
base_type = basic_common_type
 Common type among all storage types.
 
+using context = internal::registry_context
 Context type.
 
- - - + + + + + + @@ -118,14 +125,20 @@ Public Member Functions - - - - - - - - + + + + + + + + + + + + + + @@ -195,7 +208,7 @@ Public Member Functions - + @@ -282,42 +295,38 @@ Public Member Functions - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @@ -326,38 +335,12 @@ Public Member Functions - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + +

Public Member Functions

- basic_registry ()=default
 Default constructor.
 
+ basic_registry ()
 Default constructor.
 
 basic_registry (const size_type count)
 Allocates enough memory upon construction to store count pools. More...
 
 basic_registry (basic_registry &&other)
 Move constructor. More...
 
auto storage () const
 Returns an iterable object to use to visit a registry. More...
 
template<typename Component >
decltype(auto) storage (const id_type id=type_hash< Component >::value())
 Returns the storage for a given component type. More...
 
template<typename Component >
decltype(auto) storage (const id_type id=type_hash< Component >::value()) const
 Returns an iterable object to use to visit a registry. More...
 
auto storage (const id_type id)
 Finds the storage associated with a given name, if any. More...
 
auto storage (const id_type id) const
 Finds the storage associated with a given name, if any. More...
 
template<typename Component >
decltype(auto) storage (const id_type id=type_hash< std::remove_const_t< Component >>::value())
 Returns the storage for a given component type. More...
 
template<typename Component >
decltype(auto) storage (const id_type id=type_hash< std::remove_const_t< Component >>::value()) const
 Returns the storage for a given component type. More...
 
size_type size () const
 Returns the number of entities created so far. More...
 
void insert (It first, It last, const Component &value={})
 Assigns each entity in a range the given component. More...
 
template<typename Component , typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, Component>>>
template<typename Component , typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<typename std::iterator_traits<CIt>::value_type, Component>>>
void insert (EIt first, EIt last, CIt from)
 Assigns each entity in a range the given components. More...
 
auto on_destroy ()
 Returns a sink object for the given component. More...
 
template<typename Component , typename... Other, typename... Exclude>
basic_view< Entity, get_t< std::add_const_t< Component >, std::add_const_t< Other >... >, exclude_t< Exclude... > > view (exclude_t< Exclude... >={}) const
 Returns a view for the given components. More...
 
template<typename Component , typename... Other, typename... Exclude>
basic_view< Entity, get_t< Component, Other... >, exclude_t< Exclude... > > view (exclude_t< Exclude... >={})
 Returns a view for the given components. More...
 
template<typename ItComp , typename ItExcl = id_type *>
basic_runtime_view< Entity > runtime_view (ItComp first, ItComp last, ItExcl from={}, ItExcl to={}) const
 Returns a runtime view for the given components. More...
 
template<typename... Owned, typename... Get, typename... Exclude>
basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > group (get_t< Get... >, exclude_t< Exclude... >={})
 Returns a group for the given components. More...
 
template<typename... Owned, typename... Get, typename... Exclude>
basic_group< Entity, owned_t< std::add_const_t< Owned >... >, get_t< std::add_const_t< Get >... >, exclude_t< Exclude... > > group_if_exists (get_t< Get... >, exclude_t< Exclude... >={}) const
 Returns a group for the given components. More...
 
template<typename... Owned, typename... Exclude>
basic_group< Entity, owned_t< Owned... >, get_t<>, exclude_t< Exclude... > > group (exclude_t< Exclude... >={})
 Returns a group for the given components. More...
 
template<typename... Owned, typename... Exclude>
basic_group< Entity, owned_t< std::add_const_t< Owned >... >, get_t<>, exclude_t< Exclude... > > group_if_exists (exclude_t< Exclude... >={}) const
 Returns a group for the given components. More...
 
template<typename... Component>
bool sortable () const
 Checks whether the given components belong to any group. More...
 
template<typename... Owned, typename... Get, typename... Exclude>
bool sortable (const basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)
 Checks whether a group can be sorted. More...
 
template<typename Component , typename... Other, typename... Exclude>
basic_view< entity_type, get_t< std::add_const_t< Component >, std::add_const_t< Other >... >, exclude_t< Exclude... > > view (exclude_t< Exclude... >={}) const
 Returns a view for the given components. More...
 
template<typename Component , typename... Other, typename... Exclude>
basic_view< entity_type, get_t< Component, Other... >, exclude_t< Exclude... > > view (exclude_t< Exclude... >={})
 Returns a view for the given components. More...
 
template<typename... Owned, typename... Get, typename... Exclude>
basic_group< entity_type, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > group (get_t< Get... >, exclude_t< Exclude... >={})
 Returns a group for the given components. More...
 
template<typename... Owned, typename... Get, typename... Exclude>
basic_group< entity_type, owned_t< std::add_const_t< Owned >... >, get_t< std::add_const_t< Get >... >, exclude_t< Exclude... > > group_if_exists (get_t< Get... >, exclude_t< Exclude... >={}) const
 Returns a group for the given components. More...
 
template<typename... Owned, typename... Exclude>
basic_group< entity_type, owned_t< Owned... >, get_t<>, exclude_t< Exclude... > > group (exclude_t< Exclude... >={})
 Returns a group for the given components. More...
 
template<typename... Owned, typename... Exclude>
basic_group< entity_type, owned_t< std::add_const_t< Owned >... >, get_t<>, exclude_t< Exclude... > > group_if_exists (exclude_t< Exclude... >={}) const
 Returns a group for the given components. More...
 
template<typename... Component>
bool owned () const
 Checks whether the given components belong to any group. More...
 
template<typename... Owned, typename... Get, typename... Exclude>
bool sortable (const basic_group< entity_type, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)
 Checks whether a group can be sorted. More...
 
template<typename Component , typename Compare , typename Sort = std_sort, typename... Args>
void sort (Compare compare, Sort algo=Sort{}, Args &&...args)
 Sorts the elements of a given component. More...
void sort ()
 Sorts two pools of components in the same way. More...
 
template<typename Type , typename... Args>
Type & set (Args &&...args)
 Binds an object to the context of the registry. More...
 
template<typename Type >
void unset ()
 Unsets a context variable if it exists. More...
 
template<typename Type , typename... Args>
Type & ctx_or_set (Args &&...args)
 Binds an object to the context of the registry. More...
 
template<typename Type >
std::add_const_t< Type > * try_ctx () const
 Returns a pointer to an object in the context of the registry. More...
 
template<typename Type >
Type * try_ctx ()
 Returns a pointer to an object in the context of the registry. More...
 
template<typename Type >
std::add_const_t< Type > & ctx () const
 Returns a reference to an object in the context of the registry. More...
 
template<typename Type >
Type & ctx ()
 Returns a reference to an object in the context of the registry. More...
 
template<typename Func >
void ctx (Func func) const
 Visits a registry and returns the type info for its context variables. More...
 
context & ctx ()
 Returns the context object, that is, a general purpose container. More...
 
const context & ctx () const
 Returns the context object, that is, a general purpose container. More...
 

Detailed Description

template<typename Entity>
@@ -371,10 +354,48 @@ class entt::basic_registry< Entity >

-

Definition at line 173 of file registry.hpp.

+

Definition at line 221 of file registry.hpp.

Constructor & Destructor Documentation

+ +

◆ basic_registry() [1/2]

+ +
+
+
+template<typename Entity >
+ + + + + +
+ + + + + + + + +
entt::basic_registry< Entity >::basic_registry (const size_type count)
+ 		+inline
+
+ +

Allocates enough memory upon construction to store count pools.

+
Parameters
+ + +
countThe number of pools to allocate memory for.
+
+
+ +

Definition at line 347 of file registry.hpp.

+ +
+
-

◆ basic_registry()

+

◆ basic_registry() [2/2]

@@ -407,7 +428,7 @@ template<typename Entity >
-

Definition at line 290 of file registry.hpp.

+

Definition at line 360 of file registry.hpp.

@@ -440,7 +461,7 @@ template<typename Entity >

Returns the number of entities still in use.

Returns
Number of entities still in use.
-

Definition at line 376 of file registry.hpp.

+

Definition at line 470 of file registry.hpp.

@@ -488,7 +509,7 @@ template<typename... Component>
Returns
True if the entity has all the components, false otherwise.
-

Definition at line 893 of file registry.hpp.

+

Definition at line 987 of file registry.hpp.

@@ -536,7 +557,7 @@ template<typename... Component>
Returns
True if the entity has at least one of the given components, false otherwise.
-

Definition at line 910 of file registry.hpp.

+

Definition at line 1004 of file registry.hpp.

@@ -603,7 +624,7 @@ template<typename It > -

Definition at line 541 of file registry.hpp.

+

Definition at line 635 of file registry.hpp.

@@ -635,7 +656,7 @@ template<typename Entity >

Returns the number of entities that a registry has currently allocated space for.

Returns
Capacity of the registry.
-

Definition at line 399 of file registry.hpp.

+

Definition at line 493 of file registry.hpp.

@@ -674,7 +695,7 @@ template<typename... Component> -

Definition at line 1001 of file registry.hpp.

+

Definition at line 1095 of file registry.hpp.

@@ -713,7 +734,7 @@ template<typename... Component> -

Definition at line 872 of file registry.hpp.

+

Definition at line 966 of file registry.hpp.

@@ -745,7 +766,7 @@ template<typename Entity >

Creates a new entity or recycles a destroyed one.

Returns
A valid identifier.
-

Definition at line 464 of file registry.hpp.

+

Definition at line 558 of file registry.hpp.

@@ -785,7 +806,7 @@ template<typename Entity >
Returns
A valid identifier.
-

Definition at line 477 of file registry.hpp.

+

Definition at line 571 of file registry.hpp.

@@ -843,25 +864,23 @@ template<typename It > -

Definition at line 510 of file registry.hpp.

+

Definition at line 604 of file registry.hpp.

- -

◆ ctx() [1/3]

+ +

◆ ctx() [1/2]

template<typename Entity >
-
-template<typename Type >
- + @@ -462,7 +459,7 @@ template<typename Entity , typename Allocator >
- + @@ -874,35 +893,26 @@ template<typename Type >
Type& entt::basic_registry< Entity >::ctx context& entt::basic_registry< Entity >::ctx ( )
-

Returns a reference to an object in the context of the registry.

-
Warning
Attempting to get a context variable that doesn't exist results in undefined behavior.
-
Template Parameters
- - -
TypeType of object to get.
-
-
-
Returns
A valid reference to the object in the context of the registry.
+

Returns the context object, that is, a general purpose container.

+
Returns
The context object, that is, a general purpose container.
-

Definition at line 1508 of file registry.hpp.

+

Definition at line 1476 of file registry.hpp.

- -

◆ ctx() [2/3]

+ +

◆ ctx() [2/2]

template<typename Entity >
-
-template<typename Type >
diff --git a/classentt_1_1basic__snapshot.html b/classentt_1_1basic__snapshot.html index 5a9cba3e5..9ac2caa9c 100644 --- a/classentt_1_1basic__snapshot.html +++ b/classentt_1_1basic__snapshot.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__snapshot__loader-members.html b/classentt_1_1basic__snapshot__loader-members.html index 2539791fb..af876052a 100644 --- a/classentt_1_1basic__snapshot__loader-members.html +++ b/classentt_1_1basic__snapshot__loader-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__snapshot__loader.html b/classentt_1_1basic__snapshot__loader.html index eae5339c4..f2bef7cf3 100644 --- a/classentt_1_1basic__snapshot__loader.html +++ b/classentt_1_1basic__snapshot__loader.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__sparse__set-members.html b/classentt_1_1basic__sparse__set-members.html index 9b302e65e..051fecaf4 100644 --- a/classentt_1_1basic__sparse__set-members.html +++ b/classentt_1_1basic__sparse__set-members.html @@ -22,7 +22,7 @@ @@ -75,14 +75,16 @@ $(function() {
- + @@ -915,116 +925,10 @@ template<typename Type >
std::add_const_t<Type>& entt::basic_registry< Entity >::ctx const context& entt::basic_registry< Entity >::ctx ( ) const
-

Returns a reference to an object in the context of the registry.

-
Warning
Attempting to get a context variable that doesn't exist results in undefined behavior.
-
Template Parameters
- - -
TypeType of object to get.
-
-
-
Returns
A valid reference to the object in the context of the registry.
+

Returns the context object, that is, a general purpose container.

+
Returns
The context object, that is, a general purpose container.
-

Definition at line 1500 of file registry.hpp.

- -
- - -

◆ ctx() [3/3]

- -
-
-
-template<typename Entity >
-
-template<typename Func >
- - - - - -
- - - - - - - - -
void entt::basic_registry< Entity >::ctx (Func func) const
- 		-inline
-
- -

Visits a registry and returns the type info for its context variables.

-

The signature of the function should be equivalent to the following:

-
void(const type_info &);
-

Returned identifiers are those of the context variables currently set.

-
See also
type_info
-
Template Parameters
- - -
FuncType of the function object to invoke.
-
-
-
Parameters
- - -
funcA valid function object.
-
-
- -

Definition at line 1532 of file registry.hpp.

- -
-
- -

◆ ctx_or_set()

- -
-
-
-template<typename Entity >
-
-template<typename Type , typename... Args>
- - - - - -
- - - - - - - - -
Type& entt::basic_registry< Entity >::ctx_or_set (Args &&... args)
- 		-inline
-
- -

Binds an object to the context of the registry.

-

In case the context doesn't contain the given object, the parameters provided are used to construct it.

-
Template Parameters
- - - -
TypeType of object to set.
ArgsTypes of arguments to use to construct the object.
-
-
-
Parameters
- - -
argsParameters to use to initialize the object.
-
-
-
Returns
A reference to the object in the context of the registry.
- -

Definition at line 1461 of file registry.hpp.

+

Definition at line 1481 of file registry.hpp.

@@ -1063,7 +967,7 @@ template<typename Entity >
Returns
The version for the given identifier if valid, the tombstone version otherwise.
-

Definition at line 455 of file registry.hpp.

+

Definition at line 549 of file registry.hpp.

@@ -1097,7 +1001,7 @@ template<typename Entity >
Warning
This list contains both valid and destroyed entities and isn't suitable for direct use.
Returns
A pointer to the array of entities.
-

Definition at line 423 of file registry.hpp.

+

Definition at line 517 of file registry.hpp.

@@ -1138,7 +1042,7 @@ template<typename Entity >
Returns
The version of the recycled entity.
-

Definition at line 608 of file registry.hpp.

+

Definition at line 702 of file registry.hpp.

@@ -1190,7 +1094,7 @@ template<typename Entity >
Returns
The version actually assigned to the entity.
-

Definition at line 624 of file registry.hpp.

+

Definition at line 718 of file registry.hpp.

@@ -1248,7 +1152,7 @@ template<typename It > -

Definition at line 644 of file registry.hpp.

+

Definition at line 738 of file registry.hpp.

@@ -1297,7 +1201,7 @@ template<typename Func > -

Definition at line 1028 of file registry.hpp.

+

Definition at line 1122 of file registry.hpp.

@@ -1358,7 +1262,7 @@ template<typename Component , typename... Args>
Returns
A reference to the newly created component.
-

Definition at line 674 of file registry.hpp.

+

Definition at line 760 of file registry.hpp.

@@ -1418,7 +1322,7 @@ template<typename Component , typename... Args>
Returns
A reference to the newly created component.
-

Definition at line 727 of file registry.hpp.

+

Definition at line 813 of file registry.hpp.

@@ -1450,7 +1354,7 @@ template<typename Entity >

Checks whether the registry is empty (no entities still in use).

Returns
True if the registry is empty, false otherwise.
-

Definition at line 407 of file registry.hpp.

+

Definition at line 501 of file registry.hpp.

@@ -1498,7 +1402,7 @@ template<typename Component , typename... Other> -

Definition at line 841 of file registry.hpp.

+

Definition at line 931 of file registry.hpp.

@@ -1558,7 +1462,7 @@ template<typename Component , typename... Other, typename It > -

Definition at line 858 of file registry.hpp.

+

Definition at line 948 of file registry.hpp.

@@ -1606,7 +1510,7 @@ template<typename... Component>
Returns
References to the components owned by the entity.
-

Definition at line 934 of file registry.hpp.

+

Definition at line 1028 of file registry.hpp.

@@ -1654,7 +1558,7 @@ template<typename... Component>
Returns
References to the components owned by the entity.
-

Definition at line 927 of file registry.hpp.

+

Definition at line 1021 of file registry.hpp.

@@ -1715,12 +1619,12 @@ template<typename Component , typename... Args>
Returns
Reference to the component owned by the entity.
-

Definition at line 955 of file registry.hpp.

+

Definition at line 1049 of file registry.hpp.

- -

◆ group() [1/2]

+ +

◆ group() [1/2]

@@ -1733,7 +1637,7 @@ template<typename... Owned, typename... Exclude>
- + @@ -1763,12 +1667,12 @@ template<typename... Owned, typename... Exclude>
Returns
A newly created group.
-

Definition at line 1314 of file registry.hpp.

+

Definition at line 1364 of file registry.hpp.

- -

◆ group() [2/2]

+ +

◆ group() [2/2]

@@ -1781,7 +1685,7 @@ template<typename... Owned, typename... Get, typename... Exclude>
basic_group<Entity, owned_t<Owned...>, get_t<>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group basic_group<entity_type, owned_t<Owned...>, get_t<>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group ( exclude_t< Exclude... >  = {}) - + @@ -1821,12 +1725,12 @@ template<typename... Owned, typename... Get, typename... Exclude>
Returns
A newly created group.
-

Definition at line 1214 of file registry.hpp.

+

Definition at line 1264 of file registry.hpp.

- -

◆ group_if_exists() [1/2]

+ +

◆ group_if_exists() [1/2]

@@ -1839,7 +1743,7 @@ template<typename... Owned, typename... Exclude>
- +
basic_group<Entity, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group basic_group<entity_type, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group ( get_t< Get... >  , - + @@ -1869,12 +1773,12 @@ template<typename... Owned, typename... Exclude>
Returns
A newly created group.
-

Definition at line 1320 of file registry.hpp.

+

Definition at line 1370 of file registry.hpp.

- -

◆ group_if_exists() [2/2]

+ +

◆ group_if_exists() [2/2]

@@ -1887,7 +1791,7 @@ template<typename... Owned, typename... Get, typename... Exclude>
- +
basic_group<Entity, owned_t<std::add_const_t<Owned>...>, get_t<>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group_if_exists basic_group<entity_type, owned_t<std::add_const_t<Owned>...>, get_t<>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group_if_exists ( exclude_t< Exclude... >  = {}) - + @@ -1927,7 +1831,7 @@ template<typename... Owned, typename... Get, typename... Exclude>
Returns
A newly created group.
-

Definition at line 1296 of file registry.hpp.

+

Definition at line 1346 of file registry.hpp.

@@ -1939,7 +1843,7 @@ template<typename... Owned, typename... Get, typename... Exclude>
template<typename Entity >
-template<typename Component , typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, Component>>>
+template<typename Component , typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<typename std::iterator_traits<CIt>::value_type, Component>>>
basic_group<Entity, owned_t<std::add_const_t<Owned>...>, get_t<std::add_const_t<Get>...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group_if_exists basic_group<entity_type, owned_t<std::add_const_t<Owned>...>, get_t<std::add_const_t<Get>...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::group_if_exists ( get_t< Get... >  ,
- + @@ -3096,12 +2876,12 @@ template<typename... Owned, typename... Get, typename... Exclude>
Returns
True if the group can be sorted, false otherwise.
-

Definition at line 1343 of file registry.hpp.

+

Definition at line 1393 of file registry.hpp.

-

◆ storage() [1/4]

+

◆ storage() [1/6]

@@ -3129,12 +2909,12 @@ template<typename Entity >

The iterable object returns a pair that contains the name and a reference to the current storage.

Returns
An iterable object to use to visit the registry.
-

Definition at line 328 of file registry.hpp.

+

Definition at line 398 of file registry.hpp.

-

◆ storage() [2/4]

+

◆ storage() [2/6]

@@ -3162,12 +2942,90 @@ template<typename Entity >

The iterable object returns a pair that contains the name and a reference to the current storage.

Returns
An iterable object to use to visit the registry.
-

Definition at line 333 of file registry.hpp.

+

Definition at line 403 of file registry.hpp.

- -

◆ storage() [3/4]

+ +

◆ storage() [3/6]

+ +
+
+
+template<typename Entity >
+
@@ -1994,7 +1898,7 @@ template<typename Component , typename EIt , typename CIt , typename = std:: -

Definition at line 709 of file registry.hpp.

+

Definition at line 795 of file registry.hpp.

@@ -2060,7 +1964,7 @@ template<typename Component , typename It > -

Definition at line 691 of file registry.hpp.

+

Definition at line 777 of file registry.hpp.

@@ -2105,7 +2009,7 @@ template<typename Component >
Returns
A temporary sink object.
-

Definition at line 1071 of file registry.hpp.

+

Definition at line 1165 of file registry.hpp.

@@ -2150,7 +2054,7 @@ template<typename Component >
Returns
A temporary sink object.
-

Definition at line 1117 of file registry.hpp.

+

Definition at line 1211 of file registry.hpp.

@@ -2195,7 +2099,7 @@ template<typename Component >
Returns
A temporary sink object.
-

Definition at line 1094 of file registry.hpp.

+

Definition at line 1188 of file registry.hpp.

@@ -2234,7 +2138,7 @@ template<typename Entity >
Returns
This registry.
-

Definition at line 306 of file registry.hpp.

+

Definition at line 376 of file registry.hpp.

@@ -2273,7 +2177,47 @@ template<typename Entity >
Returns
True if the entity has no components assigned, false otherwise.
-

Definition at line 1047 of file registry.hpp.

+

Definition at line 1141 of file registry.hpp.

+ + + + +

◆ owned()

+ +
+
+
+template<typename Entity >
+
+template<typename... Component>
+ + + + + +
+ + + + + + + +
bool entt::basic_registry< Entity >::owned () const
+ 		+inline
+
+ +

Checks whether the given components belong to any group.

+
Template Parameters
+ + +
ComponentTypes of components in which one is interested.
+
+
+
Returns
True if the pools of the given components are free, false otherwise.
+ +

Definition at line 1381 of file registry.hpp.

@@ -2336,7 +2280,7 @@ template<typename Component , typename... Func>
Returns
A reference to the patched component.
-

Definition at line 761 of file registry.hpp.

+

Definition at line 847 of file registry.hpp.

@@ -2377,7 +2321,7 @@ template<typename Entity >
Returns
The version of the recycled entity.
-

Definition at line 558 of file registry.hpp.

+

Definition at line 652 of file registry.hpp.

@@ -2429,7 +2373,7 @@ template<typename Entity >
Returns
The version actually assigned to the entity.
-

Definition at line 574 of file registry.hpp.

+

Definition at line 668 of file registry.hpp.

@@ -2487,7 +2431,7 @@ template<typename It > -

Definition at line 589 of file registry.hpp.

+

Definition at line 683 of file registry.hpp.

@@ -2521,7 +2465,7 @@ template<typename Entity > The returned entity has an invalid identifier in all cases.

Returns
The head of the list of released entities.
-

Definition at line 435 of file registry.hpp.

+

Definition at line 529 of file registry.hpp.

@@ -2570,7 +2514,7 @@ template<typename Component , typename... Other>
Returns
The number of components actually removed.
-

Definition at line 799 of file registry.hpp.

+

Definition at line 885 of file registry.hpp.

@@ -2616,7 +2560,7 @@ template<typename Component , typename... Other, typename It >
See also
remove
Template Parameters
- +
ComponentTypes of components to remove.
ComponentType of component to remove.
OtherOther types of components to remove.
ItType of input iterator.
@@ -2631,7 +2575,7 @@ template<typename Component , typename... Other, typename It >
Returns
The number of components actually removed.
-

Definition at line 817 of file registry.hpp.

+

Definition at line 903 of file registry.hpp.

@@ -2692,7 +2636,7 @@ template<typename Component , typename... Args>
Returns
A reference to the component being replaced.
-

Definition at line 782 of file registry.hpp.

+

Definition at line 868 of file registry.hpp.

@@ -2730,131 +2674,7 @@ template<typename Entity > -

Definition at line 390 of file registry.hpp.

- - - - -

◆ runtime_view()

- -
-
-
-template<typename Entity >
-
-template<typename ItComp , typename ItExcl = id_type *>
- - - - - -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
basic_runtime_view<Entity> entt::basic_registry< Entity >::runtime_view (ItComp first,
ItComp last,
ItExcl from = {},
ItExcl to = {} 
) const
- 		-inline
-
- -

Returns a runtime view for the given components.

-
See also
view
-

Runtime views are to be used when users want to construct a view from some external inputs and don't know at compile-time what are the required components.

-
Template Parameters
- - - -
ItCompType of input iterator for the components to use to construct the view.
ItExclType of input iterator for the components to use to filter the view.
-
-
-
Parameters
- - - - - -
firstAn iterator to the first element of the range of components to use to construct the view.
lastAn iterator past the last element of the range of components to use to construct the view.
fromAn iterator to the first element of the range of components to use to filter the view.
toAn iterator past the last element of the range of components to use to filter the view.
-
-
-
Returns
A newly created runtime view.
- -

Definition at line 1169 of file registry.hpp.

- -
-
- -

◆ set()

- -
-
-
-template<typename Entity >
-
-template<typename Type , typename... Args>
- - - - - -
- - - - - - - - -
Type& entt::basic_registry< Entity >::set (Args &&... args)
- 		-inline
-
- -

Binds an object to the context of the registry.

-

If the value already exists it is overwritten, otherwise a new instance of the given type is created and initialized with the arguments provided.

-
Template Parameters
- - - -
TypeType of object to set.
ArgsTypes of arguments to use to construct the object.
-
-
-
Parameters
- - -
argsParameters to use to initialize the value.
-
-
-
Returns
A reference to the newly created object.
- -

Definition at line 1434 of file registry.hpp.

+

Definition at line 484 of file registry.hpp.

@@ -2886,7 +2706,7 @@ template<typename Entity >

Returns the number of entities created so far.

Returns
Number of entities created so far.
-

Definition at line 368 of file registry.hpp.

+

Definition at line 462 of file registry.hpp.

@@ -2933,7 +2753,7 @@ template<typename To , typename From > -

Definition at line 1417 of file registry.hpp.

+

Definition at line 1467 of file registry.hpp.

@@ -3013,52 +2833,12 @@ template<typename Component , typename Compare , typename Sort = std_sort, t -

Definition at line 1385 of file registry.hpp.

+

Definition at line 1435 of file registry.hpp.

- -

◆ sortable() [1/2]

- -
-
-
-template<typename Entity >
-
-template<typename... Component>
- - - - - -
- - - - - - - -
bool entt::basic_registry< Entity >::sortable () const
- 		-inline
-
- -

Checks whether the given components belong to any group.

-
Template Parameters
- - -
ComponentTypes of components in which one is interested.
-
-
-
Returns
True if the pools of the given components are sortable, false otherwise.
- -

Definition at line 1331 of file registry.hpp.

- -
-
- -

◆ sortable() [2/2]

+ +

◆ sortable()

@@ -3073,7 +2853,7 @@ template<typename... Owned, typename... Get, typename... Exclude>
bool entt::basic_registry< Entity >::sortable (const basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> & const basic_group< entity_type, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &  )
+ + + + +
+ + + + + + + + +
auto entt::basic_registry< Entity >::storage (const id_type id)
+ 		+inline
+
+ +

Finds the storage associated with a given name, if any.

+
Parameters
+ + +
idName used to map the storage within the registry.
+
+
+
Returns
An iterator to the given storage if it's found, past the end iterator otherwise.
+ +

Definition at line 413 of file registry.hpp.

+ +
+ + +

◆ storage() [4/6]

+ +
+
+
+template<typename Entity >
+ + + + + +
+ + + + + + + + +
auto entt::basic_registry< Entity >::storage (const id_type id) const
+ 		+inline
+
+ +

Finds the storage associated with a given name, if any.

+
Parameters
+ + +
idName used to map the storage within the registry.
+
+
+
Returns
An iterator to the given storage if it's found, past the end iterator otherwise.
+ +

Definition at line 423 of file registry.hpp.

+ +
+
+ +

◆ storage() [5/6]

@@ -3183,7 +3041,7 @@ template<typename Component >
decltype(auto) entt::basic_registry< Entity >::storage ( const id_type id = type_hash<Component>::value())id = type_hash<std::remove_const_t<Component>>::value())
@@ -3203,18 +3061,18 @@ template<typename Component >
Parameters
- +
idOptional name used to map the storage for a given component.
idOptional name used to map the storage within the registry.
Returns
The storage for the given component type.
-

Definition at line 344 of file registry.hpp.

+

Definition at line 434 of file registry.hpp.

- -

◆ storage() [4/4]

+ +

◆ storage() [6/6]

@@ -3230,7 +3088,7 @@ template<typename Component >
decltype(auto) entt::basic_registry< Entity >::storage ( const id_type id = type_hash<Component>::value())id = type_hash<std::remove_const_t<Component>>::value()) const
@@ -3241,7 +3099,7 @@ template<typename Component >
-

Returns an iterable object to use to visit a registry.

+

Returns the storage for a given component type.

Warning
If a storage for the given component doesn't exist yet, a temporary placeholder is returned instead.
Template Parameters
@@ -3251,93 +3109,13 @@ template<typename Component >
Parameters
- +
idOptional name used to map the storage for a given component.
idOptional name used to map the storage within the registry.
Returns
The storage for the given component type.
-

Definition at line 360 of file registry.hpp.

- -
- - -

◆ try_ctx() [1/2]

- -
-
-
-template<typename Entity >
-
-template<typename Type >
- - - - - -
- - - - - - - -
Type* entt::basic_registry< Entity >::try_ctx ()
- 		-inline
-
- -

Returns a pointer to an object in the context of the registry.

-
Template Parameters
- - -
TypeType of object to get.
-
-
-
Returns
A pointer to the object if it exists in the context of the registry, a null pointer otherwise.
- -

Definition at line 1480 of file registry.hpp.

- -
-
- -

◆ try_ctx() [2/2]

- -
-
-
-template<typename Entity >
-
-template<typename Type >
- - - - - -
- - - - - - - -
std::add_const_t<Type>* entt::basic_registry< Entity >::try_ctx () const
- 		-inline
-
- -

Returns a pointer to an object in the context of the registry.

-
Template Parameters
- - -
TypeType of object to get.
-
-
-
Returns
A pointer to the object if it exists in the context of the registry, a null pointer otherwise.
- -

Definition at line 1473 of file registry.hpp.

+

Definition at line 454 of file registry.hpp.

@@ -3386,7 +3164,7 @@ template<typename... Component>
Returns
Pointers to the components owned by the entity.
-

Definition at line 988 of file registry.hpp.

+

Definition at line 1082 of file registry.hpp.

@@ -3435,46 +3213,7 @@ template<typename... Component>
Returns
Pointers to the components owned by the entity.
-

Definition at line 975 of file registry.hpp.

- - - - -

◆ unset()

- -
-
-
-template<typename Entity >
-
-template<typename Type >
- - - - - -
- - - - - - - -
void entt::basic_registry< Entity >::unset ()
- 		-inline
-
- -

Unsets a context variable if it exists.

-
Template Parameters
- - -
TypeType of object to set.
-
-
- -

Definition at line 1445 of file registry.hpp.

+

Definition at line 1069 of file registry.hpp.

@@ -3513,12 +3252,12 @@ template<typename Entity >
Returns
True if the identifier is valid, false otherwise.
-

Definition at line 444 of file registry.hpp.

+

Definition at line 538 of file registry.hpp.

- -

◆ view() [1/2]

+ +

◆ view() [1/2]

@@ -3531,7 +3270,7 @@ template<typename Component , typename... Other, typename... Exclude> - + @@ -3558,12 +3297,12 @@ template<typename Component , typename... Other, typename... Exclude>
Returns
A newly created view.
-

Definition at line 1141 of file registry.hpp.

+

Definition at line 1235 of file registry.hpp.

- -

◆ view() [2/2]

+ +

◆ view() [2/2]

@@ -3576,7 +3315,7 @@ template<typename Component , typename... Other, typename... Exclude>
basic_view<Entity, get_t<Component, Other...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::view basic_view<entity_type, get_t<Component, Other...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::view ( exclude_t< Exclude... >  = {})
- + @@ -3603,7 +3342,7 @@ template<typename Component , typename... Other, typename... Exclude>
Returns
A newly created view.
-

Definition at line 1135 of file registry.hpp.

+

Definition at line 1229 of file registry.hpp.

diff --git a/classentt_1_1basic__runtime__view-members.html b/classentt_1_1basic__runtime__view-members.html deleted file mode 100644 index a3d913646..000000000 --- a/classentt_1_1basic__runtime__view-members.html +++ /dev/null @@ -1,92 +0,0 @@ - - - - - - - -EnTT: Member List - - - - - - - - - -
-
-
basic_view<Entity, get_t<std::add_const_t<Component>, std::add_const_t<Other>...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::view basic_view<entity_type, get_t<std::add_const_t<Component>, std::add_const_t<Other>...>, exclude_t<Exclude...> > entt::basic_registry< Entity >::view ( exclude_t< Exclude... >  = {})
- - - - - -
-
EnTT -  3.9.0 -
-
-
- - - - - - - - -
-
- - -
- -
- - -
-
-
-
entt::basic_runtime_view< Entity > Member List
-
-
- -

This is the complete list of members for entt::basic_runtime_view< Entity >, including all inherited members.

- - - - - - - - - - - -
basic_runtime_view()entt::basic_runtime_view< Entity >inline
basic_runtime_view(std::vector< const basic_common_type * > cpools, std::vector< const basic_common_type * > epools)entt::basic_runtime_view< Entity >inline
begin() constentt::basic_runtime_view< Entity >inline
contains(const entity_type entt) constentt::basic_runtime_view< Entity >inline
each(Func func) constentt::basic_runtime_view< Entity >inline
end() constentt::basic_runtime_view< Entity >inline
entity_type typedefentt::basic_runtime_view< Entity >
iterator typedefentt::basic_runtime_view< Entity >
size_hint() constentt::basic_runtime_view< Entity >inline
size_type typedefentt::basic_runtime_view< Entity >
- -
-Generated by doxygen 1.9.1 -
- - diff --git a/classentt_1_1basic__runtime__view.html b/classentt_1_1basic__runtime__view.html deleted file mode 100644 index 8928487dc..000000000 --- a/classentt_1_1basic__runtime__view.html +++ /dev/null @@ -1,397 +0,0 @@ - - - - - - - -EnTT: entt::basic_runtime_view< Entity > Class Template Reference - - - - - - - - - -
-
- - - - - - -
-
EnTT -  3.9.0 -
-
-
- - - - - - - - -
-
- - -
- -
- - -
-
-
-Public Types | -Public Member Functions | -List of all members
-
-
entt::basic_runtime_view< Entity > Class Template Reference
-
-
- -

Runtime view. - More...

- -

#include <runtime_view.hpp>

- - - - - - - - - - - -

-Public Types

-using entity_type = Entity
 Underlying entity identifier.
 
-using size_type = std::size_t
 Unsigned integer type.
 
-using iterator = internal::runtime_view_iterator< basic_common_type >
 Bidirectional iterator type.
 
- - - - - - - - - - - - - - - - - - - - - - - -

-Public Member Functions

- basic_runtime_view ()
 Default constructor to use to create empty, invalid views.
 
 basic_runtime_view (std::vector< const basic_common_type * > cpools, std::vector< const basic_common_type * > epools)
 Constructs a runtime view from a set of storage classes. More...
 
size_type size_hint () const
 Estimates the number of entities iterated by the view. More...
 
iterator begin () const
 Returns an iterator to the first entity that has the given components. More...
 
iterator end () const
 Returns an iterator that is past the last entity that has the given components. More...
 
bool contains (const entity_type entt) const
 Checks if a view contains an entity. More...
 
template<typename Func >
void each (Func func) const
 Iterates entities and applies the given function object to them. More...
 
-

Detailed Description

-

template<typename Entity>
-class entt::basic_runtime_view< Entity >

- -

Runtime view.

-

Runtime views iterate over those entities that have at least all the given components in their bags. During initialization, a runtime view looks at the number of entities available for each component and picks up a reference to the smallest set of candidate entities in order to get a performance boost when iterate.
- Order of elements during iterations are highly dependent on the order of the underlying data structures. See sparse_set and its specializations for more details.

-

Important

-

Iterators aren't invalidated if:

-
    -
  • New instances of the given components are created and assigned to entities.
    • -
  • The entity currently pointed is modified (as an example, if one of the given components is removed from the entity to which the iterator points).
    • -
  • The entity currently pointed is destroyed.
    • -
-

In all the other cases, modifying the pools of the given components in any way invalidates all the iterators and using them results in undefined behavior.

-
Note
Views share references to the underlying data structures of the registry that generated them. Therefore any change to the entities and to the components made by means of the registry are immediately reflected by the views, unless a pool was missing when the view was built (in this case, the view won't have a valid reference and won't be updated accordingly).
-
Warning
Lifetime of a view must not overcome that of the registry that generated it. In any other case, attempting to use a view results in undefined behavior.
-
Template Parameters
- - -
EntityA valid entity type (see entt_traits for more details).
-
-
- -

Definition at line 137 of file runtime_view.hpp.

-

Constructor & Destructor Documentation

- -

◆ basic_runtime_view()

- -
-
-
-template<typename Entity >
- - - - - -
- - - - - - - - - - - - - - - - - - -
entt::basic_runtime_view< Entity >::basic_runtime_view (std::vector< const basic_common_type * > cpools,
std::vector< const basic_common_type * > epools 
)
- 		-inline
-
- -

Constructs a runtime view from a set of storage classes.

-
Parameters
- - - -
cpoolsThe storage for the types to iterate.
epoolsThe storage for the types used to filter the view.
-
-
- -

Definition at line 162 of file runtime_view.hpp.

- -
-
-

Member Function Documentation

- -

◆ begin()

- -
-
-
-template<typename Entity >
- - - - - -
- - - - - - - -
iterator entt::basic_runtime_view< Entity >::begin () const
- 		-inline
-
- -

Returns an iterator to the first entity that has the given components.

-

The returned iterator points to the first entity that has the given components. If the view is empty, the returned iterator will be equal to end().

-
Returns
An iterator to the first entity that has the given components.
- -

Definition at line 191 of file runtime_view.hpp.

- -
-
- -

◆ contains()

- -
-
-
-template<typename Entity >
- - - - - -
- - - - - - - - -
bool entt::basic_runtime_view< Entity >::contains (const entity_type entt) const
- 		-inline
-
- -

Checks if a view contains an entity.

-
Parameters
- - -
enttA valid identifier.
-
-
-
Returns
True if the view contains the given entity, false otherwise.
- -

Definition at line 215 of file runtime_view.hpp.

- -
-
- -

◆ each()

- -
-
-
-template<typename Entity >
-
-template<typename Func >
- - - - - -
- - - - - - - - -
void entt::basic_runtime_view< Entity >::each (Func func) const
- 		-inline
-
- -

Iterates entities and applies the given function object to them.

-

The function object is invoked for each entity. It is provided only with the entity itself. To get the components, users can use the registry with which the view was built.
- The signature of the function should be equivalent to the following:

-
void(const entity_type);
-
entt::basic_runtime_view::entity_type
Entity entity_type
Underlying entity identifier.
Definition: runtime_view.hpp:146
-
Template Parameters
- - -
FuncType of the function object to invoke.
-
-
-
Parameters
- - -
funcA valid function object.
-
-
- -

Definition at line 236 of file runtime_view.hpp.

- -
-
- -

◆ end()

- -
-
-
-template<typename Entity >
- - - - - -
- - - - - - - -
iterator entt::basic_runtime_view< Entity >::end () const
- 		-inline
-
- -

Returns an iterator that is past the last entity that has the given components.

-

The returned iterator points to the entity following the last entity that has the given components. Attempting to dereference the returned iterator results in undefined behavior.

-
Returns
An iterator to the entity following the last entity that has the given components.
- -

Definition at line 206 of file runtime_view.hpp.

- -
-
- -

◆ size_hint()

- -
-
-
-template<typename Entity >
- - - - - -
- - - - - - - -
size_type entt::basic_runtime_view< Entity >::size_hint () const
- 		-inline
-
- -

Estimates the number of entities iterated by the view.

-
Returns
Estimated number of entities iterated by the view.
- -

Definition at line 177 of file runtime_view.hpp.

- -
-
-
The documentation for this class was generated from the following files: -
- -
-Generated by doxygen 1.9.1 -
- - diff --git a/classentt_1_1basic__snapshot-members.html b/classentt_1_1basic__snapshot-members.html index 17155907d..f9c4f0a9f 100644 --- a/classentt_1_1basic__snapshot-members.html +++ b/classentt_1_1basic__snapshot-members.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
- - - - - - - - + + + + + + + + + + @@ -95,7 +97,7 @@ $(function() { - + @@ -106,12 +108,10 @@ $(function() { - - - - - - + + + + @@ -126,14 +126,12 @@ $(function() { - - - - - - + + + + - + diff --git a/classentt_1_1basic__sparse__set.html b/classentt_1_1basic__sparse__set.html index 4b5badd27..fd0b6f41c 100644 --- a/classentt_1_1basic__sparse__set.html +++ b/classentt_1_1basic__sparse__set.html @@ -22,7 +22,7 @@ @@ -69,6 +69,7 @@ $(function() {
Public Types | Public Member Functions | +Protected Types | Protected Member Functions | List of all members
@@ -112,16 +113,16 @@ using 
- - - + + + +using  +using  - - + + @@ -166,9 +167,6 @@ virtual  - - - @@ -197,7 +195,7 @@ virtual void  - + @@ -215,7 +213,7 @@ virtual void  - + @@ -239,13 +237,16 @@ virtual void  - - - - - - - + + + + + + + + + + @@ -282,7 +283,7 @@ void  - +
allocator_type typedefentt::basic_sparse_set< Entity, Allocator >
at(const size_type pos) constentt::basic_sparse_set< Entity, Allocator >inline
basic_sparse_set()entt::basic_sparse_set< Entity, Allocator >inline
basic_sparse_set(const allocator_type &allocator)entt::basic_sparse_set< Entity, Allocator >inlineexplicit
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})entt::basic_sparse_set< Entity, Allocator >inlineexplicit
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})entt::basic_sparse_set< Entity, Allocator >inlineexplicit
basic_sparse_set(basic_sparse_set &&other)entt::basic_sparse_set< Entity, Allocator >inline
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)entt::basic_sparse_set< Entity, Allocator >inline
begin() constentt::basic_sparse_set< Entity, Allocator >inline
bind(any)entt::basic_sparse_set< Entity, Allocator >inlinevirtual
basic_iterator typedefentt::basic_sparse_set< Entity, Allocator >protected
basic_sparse_set()entt::basic_sparse_set< Entity, Allocator >inline
basic_sparse_set(const allocator_type &allocator)entt::basic_sparse_set< Entity, Allocator >inlineexplicit
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})entt::basic_sparse_set< Entity, Allocator >inlineexplicit
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})entt::basic_sparse_set< Entity, Allocator >inlineexplicit
basic_sparse_set(basic_sparse_set &&other)entt::basic_sparse_set< Entity, Allocator >inline
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)entt::basic_sparse_set< Entity, Allocator >inline
begin() constentt::basic_sparse_set< Entity, Allocator >inline
bind(any)entt::basic_sparse_set< Entity, Allocator >inlinevirtual
bump(const entity_type entt)entt::basic_sparse_set< Entity, Allocator >inline
capacity() constentt::basic_sparse_set< Entity, Allocator >inlinevirtual
cbegin() constentt::basic_sparse_set< Entity, Allocator >inline
cend() constentt::basic_sparse_set< Entity, Allocator >inline
crend() constentt::basic_sparse_set< Entity, Allocator >inline
current(const entity_type entt) constentt::basic_sparse_set< Entity, Allocator >inline
data() constentt::basic_sparse_set< Entity, Allocator >inline
emplace(const entity_type entt, const void *value=nullptr)entt::basic_sparse_set< Entity, Allocator >inline
emplace(const entity_type entt, const void *value=nullptr)entt::basic_sparse_set< Entity, Allocator >inline
empty() constentt::basic_sparse_set< Entity, Allocator >inline
end() constentt::basic_sparse_set< Entity, Allocator >inline
entity_type typedefentt::basic_sparse_set< Entity, Allocator >
get(const entity_type entt) constentt::basic_sparse_set< Entity, Allocator >inline
get(const entity_type entt)entt::basic_sparse_set< Entity, Allocator >inline
get_allocator() constentt::basic_sparse_set< Entity, Allocator >inline
get_at(const std::size_t) constentt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
in_place_pop(const Entity entt)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
index(const entity_type entt) constentt::basic_sparse_set< Entity, Allocator >inline
insert(It first, It last)entt::basic_sparse_set< Entity, Allocator >inline
iterator typedefentt::basic_sparse_set< Entity, Allocator >
move_and_pop(const std::size_t, const std::size_t)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
in_place_pop(basic_iterator first, basic_iterator last)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
index(const entity_type entt) constentt::basic_sparse_set< Entity, Allocator >inline
insert(It first, It last)entt::basic_sparse_set< Entity, Allocator >inline
iterator typedefentt::basic_sparse_set< Entity, Allocator >
operator=(basic_sparse_set &&other)entt::basic_sparse_set< Entity, Allocator >inline
operator[](const size_type pos) constentt::basic_sparse_set< Entity, Allocator >inline
pointer typedefentt::basic_sparse_set< Entity, Allocator >
shrink_to_fit()entt::basic_sparse_set< Entity, Allocator >inlinevirtual
size() constentt::basic_sparse_set< Entity, Allocator >inline
size_type typedefentt::basic_sparse_set< Entity, Allocator >
slot() constentt::basic_sparse_set< Entity, Allocator >inline
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, Allocator >inline
sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, Allocator >inline
swap(basic_sparse_set &other)entt::basic_sparse_set< Entity, Allocator >inline
swap_and_pop(const Entity entt)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
swap_at(const std::size_t, const std::size_t)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, Allocator >inline
sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, Allocator >inline
swap(basic_sparse_set &other)entt::basic_sparse_set< Entity, Allocator >inline
swap_and_pop(basic_iterator first, basic_iterator last)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
swap_elements(const entity_type lhs, const entity_type rhs)entt::basic_sparse_set< Entity, Allocator >inline
try_emplace(const Entity entt, const void *=nullptr)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
try_emplace(const Entity entt, const bool force_back, const void *=nullptr)entt::basic_sparse_set< Entity, Allocator >inlineprotectedvirtual
type() constentt::basic_sparse_set< Entity, Allocator >inline
version_type typedefentt::basic_sparse_set< Entity, Allocator >
~basic_sparse_set()entt::basic_sparse_set< Entity, Allocator >inlinevirtual
EnTT -  3.9.0 +  3.10.0
pointer = typename packed_container_type::const_pointer
 Pointer type to contained entities.
 
-using iterator = internal::sparse_set_iterator< packed_container_type >
 Random access iterator type.
 
+using iterator = basic_iterator
 Random access iterator type.
 
-using const_iterator = iterator
const_iterator = iterator
 Constant random access iterator type.
 
-using reverse_iterator = std::reverse_iterator< iterator >
reverse_iterator = std::reverse_iterator< iterator >
 Reverse iterator type.
 
@@ -141,8 +142,8 @@ Public Member Functions
 basic_sparse_set (deletion_policy pol, const allocator_type &allocator={})
 Constructs an empty container with the given policy and allocator. More...
 
 basic_sparse_set (const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
 Constructs an empty container with the given policy and allocator. More...
 basic_sparse_set (const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
 Constructs an empty container with the given value type, policy and allocator. More...
 
 basic_sparse_set (basic_sparse_set &&other)
 Move constructor. More...
deletion_policy policy () const
 Returns the deletion policy of a sparse set. More...
 
size_type slot () const
 Returns the next slot available for insertion. More...
 
virtual void reserve (const size_type cap)
 Increases the capacity of a sparse set. More...
 
const_iterator cbegin () const
 Returns an iterator to the beginning. More...
 
iterator end () const
iterator end () const
 Returns an iterator to the end. More...
 
const_iterator cend () const
const_reverse_iterator crend () const
 Returns a reverse iterator to the end. More...
 
iterator find (const entity_type entt) const
iterator find (const entity_type entt) const
 Finds an entity. More...
 
bool contains (const entity_type entt) const
void * get (const entity_type entt)
 Returns the element assigned to an entity, if any. More...
 
void emplace (const entity_type entt, const void *value=nullptr)
 Assigns an entity to a sparse set. More...
 
template<typename It >
void insert (It first, It last)
 Assigns one or more entities to a sparse set. More...
 
iterator emplace (const entity_type entt, const void *value=nullptr)
 Assigns an entity to a sparse set. More...
 
void bump (const entity_type entt)
 Bump the version number of an entity. More...
 
template<typename It >
iterator insert (It first, It last)
 Assigns one or more entities to a sparse set. More...
 
void erase (const entity_type entt)
 Erases an entity from a sparse set. More...
 
clear ()
 Clears a sparse set.
 
const type_info & type () const
const type_info & type () const
 Returned value type, if any. More...
 
@@ -290,28 +291,24 @@ virtual void  Forwards variables to mixins, if any.
 
+ + + + +

+Protected Types

+using basic_iterator = internal::sparse_set_iterator< packed_container_type >
 Random access iterator type.
 
- - - - - - - - - - - - - - - - - - + + + + + + + + +

Protected Member Functions

virtual const void * get_at (const std::size_t) const
 Returns the element assigned to an entity. More...
 
-virtual void swap_at (const std::size_t, const std::size_t)
 Swaps two entities in a sparse set.
 
-virtual void move_and_pop (const std::size_t, const std::size_t)
 Moves an entity in a sparse set.
 
virtual void swap_and_pop (const Entity entt)
 Erase an entity from a sparse set. More...
 
virtual void in_place_pop (const Entity entt)
 Erase an entity from a sparse set. More...
 
virtual void try_emplace (const Entity entt, const void *=nullptr)
 Assigns an entity to a sparse set. More...
 
virtual void swap_and_pop (basic_iterator first, basic_iterator last)
 Erases entities from a sparse set. More...
 
virtual void in_place_pop (basic_iterator first, basic_iterator last)
 Erases entities from a sparse set. More...
 
virtual basic_iterator try_emplace (const Entity entt, const bool force_back, const void *=nullptr)
 Assigns an entity to a sparse set. More...
 

Detailed Description

template<typename Entity, typename Allocator>
@@ -367,7 +364,7 @@ template<typename Entity , typename Allocator >

-

Definition at line 313 of file sparse_set.hpp.

+

Definition at line 314 of file sparse_set.hpp.

@@ -416,7 +413,7 @@ template<typename Entity , typename Allocator > -

Definition at line 321 of file sparse_set.hpp.

+

Definition at line 322 of file sparse_set.hpp.

@@ -434,7 +431,7 @@ template<typename Entity , typename Allocator >
entt::basic_sparse_set< Entity, Allocator >::basic_sparse_set (const type_info & const type_info &  value,
-

Constructs an empty container with the given policy and allocator.

+

Constructs an empty container with the given value type, policy and allocator.

Parameters
@@ -472,7 +469,7 @@ template<typename Entity , typename Allocator > -

Definition at line 330 of file sparse_set.hpp.

+

Definition at line 332 of file sparse_set.hpp.

@@ -510,7 +507,7 @@ template<typename Entity , typename Allocator > -

Definition at line 341 of file sparse_set.hpp.

+

Definition at line 343 of file sparse_set.hpp.

@@ -559,7 +556,7 @@ template<typename Entity , typename Allocator > -

Definition at line 353 of file sparse_set.hpp.

+

Definition at line 355 of file sparse_set.hpp.

@@ -599,7 +596,7 @@ template<typename Entity , typename Allocator >
Returns
The entity at specified location if any, a null entity otherwise.
-

Definition at line 621 of file sparse_set.hpp.

+

Definition at line 615 of file sparse_set.hpp.

@@ -632,7 +629,46 @@ template<typename Entity , typename Allocator >

The returned iterator points to the first entity of the internal packed array. If the sparse set is empty, the returned iterator will be equal to end().

Returns
An iterator to the first entity of the sparse set.
-

Definition at line 500 of file sparse_set.hpp.

+

Definition at line 494 of file sparse_set.hpp.

+ + + + +

◆ bump()

+ +
+
+
+template<typename Entity , typename Allocator >
+
valueReturned value type, if any.
+ + + + +
+ + + + + + + + +
void entt::basic_sparse_set< Entity, Allocator >::bump (const entity_type entt)
+ 		+inline
+
+ +

Bump the version number of an entity.

+
Warning
Attempting to bump the version of an entity that doesn't belong to the sparse set results in undefined behavior.
+
Parameters
+ + +
enttA valid identifier.
+
+
+ +

Definition at line 673 of file sparse_set.hpp.

@@ -666,7 +702,7 @@ template<typename Entity , typename Allocator >

Reimplemented in entt::basic_storage< Entity, Type, Allocator, typename >, and entt::basic_storage< entity_type, payload_type >.

-

Definition at line 438 of file sparse_set.hpp.

+

Definition at line 432 of file sparse_set.hpp.

@@ -699,7 +735,7 @@ template<typename Entity , typename Allocator >

The returned iterator points to the first entity of the internal packed array. If the sparse set is empty, the returned iterator will be equal to end().

Returns
An iterator to the first entity of the sparse set.
-

Definition at line 506 of file sparse_set.hpp.

+

Definition at line 500 of file sparse_set.hpp.

@@ -732,7 +768,7 @@ template<typename Entity , typename Allocator >

The returned iterator points to the element following the last entity in a sparse set. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last entity of a sparse set.
-

Definition at line 525 of file sparse_set.hpp.

+

Definition at line 519 of file sparse_set.hpp.

@@ -771,7 +807,7 @@ template<typename Entity , typename Allocator >
Returns
True if the sparse set contains the entity, false otherwise.
-

Definition at line 582 of file sparse_set.hpp.

+

Definition at line 576 of file sparse_set.hpp.

@@ -804,7 +840,7 @@ template<typename Entity , typename Allocator >

The returned iterator points to the first entity of the reversed internal packed array. If the sparse set is empty, the returned iterator will be equal to rend().

Returns
An iterator to the first entity of the reversed internal packed array.
-

Definition at line 544 of file sparse_set.hpp.

+

Definition at line 538 of file sparse_set.hpp.

@@ -837,7 +873,7 @@ template<typename Entity , typename Allocator >

The returned iterator points to the element following the last entity in the reversed sparse set. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last entity of the reversed sparse set.
-

Definition at line 563 of file sparse_set.hpp.

+

Definition at line 557 of file sparse_set.hpp.

@@ -876,7 +912,7 @@ template<typename Entity , typename Allocator >
Returns
The version for the given identifier if present, the tombstone version otherwise.
-

Definition at line 595 of file sparse_set.hpp.

+

Definition at line 589 of file sparse_set.hpp.

@@ -908,12 +944,12 @@ template<typename Entity , typename Allocator >

Direct access to the internal packed array.

Returns
A pointer to the internal packed array.
-

Definition at line 487 of file sparse_set.hpp.

+

Definition at line 481 of file sparse_set.hpp.

- -

◆ emplace()

+ +

◆ emplace()

@@ -924,7 +960,7 @@ template<typename Entity , typename Allocator >
- + @@ -957,8 +993,9 @@ template<typename Entity , typename Allocator >
void entt::basic_sparse_set< Entity, Allocator >::emplace iterator entt::basic_sparse_set< Entity, Allocator >::emplace ( const entity_type  entt,
+
Returns
Iterator pointing to the emplaced element in case of success, the end() iterator otherwise.
-

Definition at line 665 of file sparse_set.hpp.

+

Definition at line 660 of file sparse_set.hpp.

@@ -990,7 +1027,7 @@ template<typename Entity , typename Allocator >

Checks whether a sparse set is empty.

Returns
True if the sparse set is empty, false otherwise.
-

Definition at line 479 of file sparse_set.hpp.

+

Definition at line 473 of file sparse_set.hpp.

@@ -1006,7 +1043,7 @@ template<typename Entity , typename Allocator > 		- + @@ -1023,7 +1060,7 @@ template<typename Entity , typename Allocator >

The returned iterator points to the element following the last entity in a sparse set. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last entity of a sparse set.
-

Definition at line 520 of file sparse_set.hpp.

+

Definition at line 514 of file sparse_set.hpp.

@@ -1062,7 +1099,7 @@ template<typename Entity , typename Allocator > -

Definition at line 703 of file sparse_set.hpp.

+

Definition at line 710 of file sparse_set.hpp.

@@ -1120,7 +1157,7 @@ template<typename It > -

Definition at line 719 of file sparse_set.hpp.

+

Definition at line 725 of file sparse_set.hpp.

@@ -1153,7 +1190,7 @@ template<typename Entity , typename Allocator >

The extent of a sparse set is also the size of the internal sparse array. There is no guarantee that the internal packed array has the same size. Usually the size of the internal sparse array is equal or greater than the one of the internal packed array.

Returns
Extent of the sparse set.
-

Definition at line 457 of file sparse_set.hpp.

+

Definition at line 451 of file sparse_set.hpp.

@@ -1169,7 +1206,7 @@ template<typename Entity , typename Allocator > - - + + + + + + + + + + + +
iterator entt::basic_sparse_set< Entity, Allocator >::end iterator entt::basic_sparse_set< Entity, Allocator >::end ( ) const - + @@ -1192,7 +1229,7 @@ template<typename Entity , typename Allocator >
Returns
An iterator to the given entity if it's found, past the end iterator otherwise.
-

Definition at line 573 of file sparse_set.hpp.

+

Definition at line 567 of file sparse_set.hpp.

@@ -1232,7 +1269,7 @@ template<typename Entity , typename Allocator >
Returns
An opaque pointer to the element assigned to the entity, if any.
-

Definition at line 651 of file sparse_set.hpp.

+

Definition at line 644 of file sparse_set.hpp.

@@ -1272,7 +1309,7 @@ template<typename Entity , typename Allocator >
Returns
An opaque pointer to the element assigned to the entity, if any.
-

Definition at line 645 of file sparse_set.hpp.

+

Definition at line 639 of file sparse_set.hpp.

@@ -1304,47 +1341,12 @@ template<typename Entity , typename Allocator >

Returns the associated allocator.

Returns
The associated allocator.
-

Definition at line 401 of file sparse_set.hpp.

+

Definition at line 403 of file sparse_set.hpp.

- -

◆ get_at()

- -
-
-
-template<typename Entity , typename Allocator >
-
iterator entt::basic_sparse_set< Entity, Allocator >::find iterator entt::basic_sparse_set< Entity, Allocator >::find ( const entity_type  entt)
- - - - -
- - - - - - - - -
virtual const void* entt::basic_sparse_set< Entity, Allocator >::get_at (const std::size_t ) const
- 		-inlineprotectedvirtual
-
- -

Returns the element assigned to an entity.

-
Returns
An opaque pointer to the element assigned to the entity.
- -

Reimplemented in entt::basic_storage< Entity, Type, Allocator, typename >, and entt::basic_storage< entity_type, payload_type >.

- -

Definition at line 212 of file sparse_set.hpp.

- -
- - -

◆ in_place_pop()

+ +

◆ in_place_pop()

@@ -1357,9 +1359,19 @@ template<typename Entity , typename Allocator >
virtual void entt::basic_sparse_set< Entity, Allocator >::in_place_pop (const Entity entt)basic_iterator first,
basic_iterator last 
)
-

Erase an entity from a sparse set.

+

Erases entities from a sparse set.

Parameters
- + +
enttA valid identifier.
firstAn iterator to the first element of the range of entities.
lastAn iterator past the last element of the range of entities.
-

Reimplemented in entt::basic_storage< entity_type, payload_type >, and entt::basic_storage< Entity, Type, Allocator, typename >.

+

Reimplemented in entt::basic_storage< Entity, Type, Allocator, typename >, and entt::basic_storage< entity_type, payload_type >.

-

Definition at line 245 of file sparse_set.hpp.

+

Definition at line 258 of file sparse_set.hpp.

@@ -1419,12 +1432,12 @@ template<typename Entity , typename Allocator >
Returns
The position of the entity in the sparse set.
-

Definition at line 611 of file sparse_set.hpp.

+

Definition at line 605 of file sparse_set.hpp.

- -

◆ insert()

+ +

◆ insert()

@@ -1437,7 +1450,7 @@ template<typename It >
- + @@ -1476,8 +1489,9 @@ template<typename It >
void entt::basic_sparse_set< Entity, Allocator >::insert iterator entt::basic_sparse_set< Entity, Allocator >::insert ( It  first,
+
Returns
Iterator pointing to the first element inserted in case of success, the end() iterator otherwise.
-

Definition at line 682 of file sparse_set.hpp.

+

Definition at line 693 of file sparse_set.hpp.

@@ -1516,7 +1530,7 @@ template<typename Entity , typename Allocator >
Returns
This sparse set.
-

Definition at line 372 of file sparse_set.hpp.

+

Definition at line 374 of file sparse_set.hpp.

@@ -1555,7 +1569,7 @@ template<typename Entity , typename Allocator >
Returns
The entity at specified location.
-

Definition at line 630 of file sparse_set.hpp.

+

Definition at line 624 of file sparse_set.hpp.

@@ -1587,7 +1601,7 @@ template<typename Entity , typename Allocator >

Returns the deletion policy of a sparse set.

Returns
The deletion policy of the sparse set.
-

Definition at line 409 of file sparse_set.hpp.

+

Definition at line 411 of file sparse_set.hpp.

@@ -1620,7 +1634,7 @@ template<typename Entity , typename Allocator >

The returned iterator points to the first entity of the reversed internal packed array. If the sparse set is empty, the returned iterator will be equal to rend().

Returns
An iterator to the first entity of the reversed internal packed array.
-

Definition at line 539 of file sparse_set.hpp.

+

Definition at line 533 of file sparse_set.hpp.

@@ -1659,7 +1673,7 @@ template<typename Entity , typename Allocator >
Returns
True if the entity is actually removed, false otherwise.
-

Definition at line 730 of file sparse_set.hpp.

+

Definition at line 740 of file sparse_set.hpp.

@@ -1717,7 +1731,7 @@ template<typename It >
Returns
The number of entities actually removed.
-

Definition at line 742 of file sparse_set.hpp.

+

Definition at line 752 of file sparse_set.hpp.

@@ -1750,7 +1764,7 @@ template<typename Entity , typename Allocator >

The returned iterator points to the element following the last entity in the reversed sparse set. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last entity of the reversed sparse set.
-

Definition at line 558 of file sparse_set.hpp.

+

Definition at line 552 of file sparse_set.hpp.

@@ -1791,7 +1805,7 @@ template<typename Entity , typename Allocator >

Reimplemented in entt::basic_storage< entity_type, payload_type >.

-

Definition at line 429 of file sparse_set.hpp.

+

Definition at line 423 of file sparse_set.hpp.

@@ -1832,7 +1846,7 @@ template<typename Entity , typename Allocator > -

Definition at line 888 of file sparse_set.hpp.

+

Definition at line 903 of file sparse_set.hpp.

@@ -1865,39 +1879,7 @@ template<typename Entity , typename Allocator >

The number of elements is also the size of the internal packed array. There is no guarantee that the internal sparse array has the same size. Usually the size of the internal sparse array is equal or greater than the one of the internal packed array.

Returns
Number of elements.
-

Definition at line 471 of file sparse_set.hpp.

- - - - -

◆ slot()

- -
-
-
-template<typename Entity , typename Allocator >
- - - - - -
- - - - - - - -
size_type entt::basic_sparse_set< Entity, Allocator >::slot () const
- 		-inline
-
- -

Returns the next slot available for insertion.

-
Returns
The next slot available for insertion.
- -

Definition at line 417 of file sparse_set.hpp.

+

Definition at line 465 of file sparse_set.hpp.

@@ -1964,7 +1946,7 @@ template<typename Compare , typename Sort = std_sort, typename... Args> < -

Definition at line 868 of file sparse_set.hpp.

+

Definition at line 883 of file sparse_set.hpp.

@@ -2046,7 +2028,7 @@ template<typename Compare , typename Sort = std_sort, typename... Args> < -

Definition at line 833 of file sparse_set.hpp.

+

Definition at line 848 of file sparse_set.hpp.

@@ -2084,12 +2066,12 @@ template<typename Entity , typename Allocator > -

Definition at line 388 of file sparse_set.hpp.

+

Definition at line 390 of file sparse_set.hpp.

- -

◆ swap_and_pop()

+ +

◆ swap_and_pop()

@@ -2102,9 +2084,19 @@ template<typename Entity , typename Allocator >
virtual void entt::basic_sparse_set< Entity, Allocator >::swap_and_pop ( - const Entity  - entt) + basic_iterator  + first, + + + + basic_iterator  + last  + + + + ) + @@ -2114,17 +2106,18 @@ template<typename Entity , typename Allocator >
-

Erase an entity from a sparse set.

+

Erases entities from a sparse set.

Parameters
- + +
enttA valid identifier.
firstAn iterator to the first element of the range of entities.
lastAn iterator past the last element of the range of entities.
-

Reimplemented in entt::basic_storage< entity_type, payload_type >, and entt::basic_storage< Entity, Type, Allocator, typename >.

+

Reimplemented in entt::basic_storage< Entity, Type, Allocator, typename >, and entt::basic_storage< entity_type, payload_type >.

-

Definition at line 226 of file sparse_set.hpp.

+

Definition at line 241 of file sparse_set.hpp.

@@ -2175,12 +2168,12 @@ template<typename Entity , typename Allocator > -

Definition at line 786 of file sparse_set.hpp.

+

Definition at line 799 of file sparse_set.hpp.

- -

◆ try_emplace()

+ +

◆ try_emplace()

@@ -2191,11 +2184,17 @@ template<typename Entity , typename Allocator >
- + + + + + + + @@ -2219,11 +2218,13 @@ template<typename Entity , typename Allocator >
Parameters
virtual void entt::basic_sparse_set< Entity, Allocator >::try_emplace virtual basic_iterator entt::basic_sparse_set< Entity, Allocator >::try_emplace ( const Entity  entt,
const bool force_back,
+
enttA valid identifier.
force_backForce back insertion.
+
Returns
Iterator pointing to the emplaced element.
-

Definition at line 259 of file sparse_set.hpp.

+

Definition at line 271 of file sparse_set.hpp.

@@ -2239,7 +2240,7 @@ template<typename Entity , typename Allocator > - + @@ -2255,7 +2256,7 @@ template<typename Entity , typename Allocator >

Returned value type, if any.

Returns
Returned value type, if any.
-

Definition at line 918 of file sparse_set.hpp.

+

Definition at line 942 of file sparse_set.hpp.

diff --git a/classentt_1_1basic__storage-members.html b/classentt_1_1basic__storage-members.html index 0fde9584c..0d40cf0c8 100644 --- a/classentt_1_1basic__storage-members.html +++ b/classentt_1_1basic__storage-members.html @@ -22,7 +22,7 @@ @@ -76,19 +76,21 @@ $(function() { - - - - - - - - - - - - - + + + + + + + + + + + + + + + @@ -106,7 +108,7 @@ $(function() { - + @@ -120,15 +122,13 @@ $(function() { - - - - - - - - - + + + + + + + @@ -150,16 +150,14 @@ $(function() { - - - - - - - + + + + + - - + + diff --git a/classentt_1_1basic__storage.html b/classentt_1_1basic__storage.html index eeadc7607..5c086a47f 100644 --- a/classentt_1_1basic__storage.html +++ b/classentt_1_1basic__storage.html @@ -22,7 +22,7 @@ @@ -146,7 +146,7 @@ using  +using  - - - + + + +using  +using  - + @@ -316,8 +316,8 @@ void  - - + + @@ -341,9 +341,6 @@ virtual  - - - @@ -365,7 +362,7 @@ virtual  - + @@ -383,7 +380,7 @@ virtual  - + @@ -407,12 +404,15 @@ virtual  - - - - - - + + + + + + + + + @@ -445,7 +445,7 @@ void  - + - - + + + + + + + + + + + +
const type_info& entt::basic_sparse_set< Entity, Allocator >::type const type_info& entt::basic_sparse_set< Entity, Allocator >::type ( ) const
EnTT -  3.9.0 +  3.10.0
allocator_type typedefentt::basic_storage< Entity, Type, Allocator, typename >
at(const size_type pos) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
base_type typedefentt::basic_storage< Entity, Type, Allocator, typename >
basic_sparse_set()entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(basic_sparse_set &&other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_storage()entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_storage(const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, typename >inlineexplicit
basic_storage(basic_storage &&other)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_storage(basic_storage &&other, const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, typename >inline
begin() constentt::basic_storage< Entity, Type, Allocator, typename >inline
begin()entt::basic_storage< Entity, Type, Allocator, typename >inline
bind(any)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlinevirtual
basic_iterator typedefentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >protected
basic_sparse_set()entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(basic_sparse_set &&other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_storage()entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_storage(const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, typename >inlineexplicit
basic_storage(basic_storage &&other)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_storage(basic_storage &&other, const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, typename >inline
begin() constentt::basic_storage< Entity, Type, Allocator, typename >inline
begin()entt::basic_storage< Entity, Type, Allocator, typename >inline
bind(any)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlinevirtual
bump(const entity_type entt)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
capacity() const overrideentt::basic_storage< Entity, Type, Allocator, typename >inlinevirtual
cbegin() constentt::basic_storage< Entity, Type, Allocator, typename >inline
cend() constentt::basic_storage< Entity, Type, Allocator, typename >inline
each()entt::basic_storage< Entity, Type, Allocator, typename >inline
each() constentt::basic_storage< Entity, Type, Allocator, typename >inline
emplace(const entity_type entt, Args &&...args)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::emplace(const entity_type entt, const void *value=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::emplace(const entity_type entt, const void *value=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
empty() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
end() constentt::basic_storage< Entity, Type, Allocator, typename >inline
end()entt::basic_storage< Entity, Type, Allocator, typename >inline
get_allocator() constentt::basic_storage< Entity, Type, Allocator, typename >inline
get_as_tuple(const entity_type entt) constentt::basic_storage< Entity, Type, Allocator, typename >inline
get_as_tuple(const entity_type entt)entt::basic_storage< Entity, Type, Allocator, typename >inline
get_at(const std::size_t pos) const overrideentt::basic_storage< Entity, Type, Allocator, typename >inlineprotectedvirtual
in_place_pop(const Entity entt) overrideentt::basic_storage< Entity, Type, Allocator, typename >inlineprotectedvirtual
index(const entity_type entt) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
insert(It first, It last, const value_type &value={})entt::basic_storage< Entity, Type, Allocator, typename >inline
insert(EIt first, EIt last, CIt from)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::insert(It first, It last)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
iterable typedefentt::basic_storage< Entity, Type, Allocator, typename >
iterator typedefentt::basic_storage< Entity, Type, Allocator, typename >
move_and_pop(const std::size_t from, const std::size_t to) finalentt::basic_storage< Entity, Type, Allocator, typename >inlineprotectedvirtual
in_place_pop(typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) overrideentt::basic_storage< Entity, Type, Allocator, typename >inlineprotectedvirtual
index(const entity_type entt) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
insert(It first, It last, const value_type &value={})entt::basic_storage< Entity, Type, Allocator, typename >inline
insert(EIt first, EIt last, CIt from)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::insert(It first, It last)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
iterable typedefentt::basic_storage< Entity, Type, Allocator, typename >
iterator typedefentt::basic_storage< Entity, Type, Allocator, typename >
operator=(basic_storage &&other)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::operator=(basic_sparse_set &&other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
operator[](const size_type pos) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
shrink_to_fit() overrideentt::basic_storage< Entity, Type, Allocator, typename >inlinevirtual
size() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
size_type typedefentt::basic_storage< Entity, Type, Allocator, typename >
slot() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap(basic_storage &other)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::swap(basic_sparse_set &other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap_and_pop(const Entity entt) overrideentt::basic_storage< Entity, Type, Allocator, typename >inlineprotectedvirtual
swap_at(const std::size_t lhs, const std::size_t rhs) finalentt::basic_storage< Entity, Type, Allocator, typename >inlineprotectedvirtual
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap(basic_storage &other)entt::basic_storage< Entity, Type, Allocator, typename >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::swap(basic_sparse_set &other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap_and_pop(typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) overrideentt::basic_storage< Entity, Type, Allocator, typename >inlineprotectedvirtual
swap_elements(const entity_type lhs, const entity_type rhs)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
try_emplace([[maybe_unused]] const Entity entt, const void *value) overrideentt::basic_storage< Entity, Type, Allocator, typename >inlineprotected
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::try_emplace(const Entity entt, const void *=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
try_emplace([[maybe_unused]] const Entity entt, const bool force_back, const void *value) overrideentt::basic_storage< Entity, Type, Allocator, typename >inlineprotected
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::try_emplace(const Entity entt, const bool force_back, const void *=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
type() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
value_type typedefentt::basic_storage< Entity, Type, Allocator, typename >
version_type typedefentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
EnTT -  3.9.0 +  3.10.0
 Constant reverse iterator type.
 
-using iterable = iterable_adaptor< internal::extended_storage_iterator< typename base_type::iterator, iterator > >
iterable = iterable_adaptor< internal::extended_storage_iterator< typename base_type::iterator, iterator > >
 Extended iterable storage proxy.
 
@@ -174,16 +174,16 @@ using pointer = typename packed_container_type::const_pointer
 Pointer type to contained entities.
 
-using iterator = internal::sparse_set_iterator< packed_container_type >
 Random access iterator type.
 
+using iterator = basic_iterator
 Random access iterator type.
 
-using const_iterator = iterator
const_iterator = iterator
 Constant random access iterator type.
 
-using reverse_iterator = std::reverse_iterator< iterator >
reverse_iterator = std::reverse_iterator< iterator >
 Reverse iterator type.
 
@@ -295,7 +295,7 @@ void void insert (It first, It last, const value_type &value={})
 Assigns one or more entities to a storage and constructs their objects from a given instance. More...
 
template<typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, value_type>>>
template<typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<typename std::iterator_traits<CIt>::value_type, value_type>>>
void insert (EIt first, EIt last, CIt from)
 Assigns one or more entities to a storage and constructs their objects from a given range. More...
 
 basic_sparse_set (deletion_policy pol, const allocator_type &allocator={})
 Constructs an empty container with the given policy and allocator. More...
 
 basic_sparse_set (const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
 Constructs an empty container with the given policy and allocator. More...
 basic_sparse_set (const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
 Constructs an empty container with the given value type, policy and allocator. More...
 
 basic_sparse_set (basic_sparse_set &&other)
 Move constructor. More...
deletion_policy policy () const
 Returns the deletion policy of a sparse set. More...
 
size_type slot () const
 Returns the next slot available for insertion. More...
 
virtual void reserve (const size_type cap)
 Increases the capacity of a sparse set. More...
 
const_iterator cbegin () const
 Returns an iterator to the beginning. More...
 
iterator end () const
iterator end () const
 Returns an iterator to the end. More...
 
const_iterator cend () const
const_reverse_iterator crend () const
 Returns a reverse iterator to the end. More...
 
iterator find (const entity_type entt) const
iterator find (const entity_type entt) const
 Finds an entity. More...
 
bool contains (const entity_type entt) const
void * get (const entity_type entt)
 Returns the element assigned to an entity, if any. More...
 
void emplace (const entity_type entt, const void *value=nullptr)
 Assigns an entity to a sparse set. More...
 
void insert (It first, It last)
 Assigns one or more entities to a sparse set. More...
 
iterator emplace (const entity_type entt, const void *value=nullptr)
 Assigns an entity to a sparse set. More...
 
void bump (const entity_type entt)
 Bump the version number of an entity. More...
 
iterator insert (It first, It last)
 Assigns one or more entities to a sparse set. More...
 
void erase (const entity_type entt)
 Erases an entity from a sparse set. More...
 
clear ()
 Clears a sparse set.
 
const type_info & type () const
const type_info & type () const
 Returned value type, if any. More...
 
@@ -455,28 +455,27 @@ virtual void  - - - - - - - - - - - - - - - - - - + + + + + + + + + - - - + + + +

Protected Member Functions

const void * get_at (const std::size_t pos) const override
 Returns the element assigned to an entity. More...
 
void swap_at (const std::size_t lhs, const std::size_t rhs) final
 Swaps two elements in a storage. More...
 
void move_and_pop (const std::size_t from, const std::size_t to) final
 Moves an element within a storage. More...
 
void swap_and_pop (const Entity entt) override
 Erase an element from a storage. More...
 
void in_place_pop (const Entity entt) override
 Erases an element from a storage. More...
 
void try_emplace ([[maybe_unused]] const Entity entt, const void *value) override
 Assigns an entity to a storage. More...
 
void swap_and_pop (typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) override
 Erases elements from a storage. More...
 
void in_place_pop (typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) override
 Erases elements from a storage. More...
 
underlying_type::basic_iterator try_emplace ([[maybe_unused]] const Entity entt, const bool force_back, const void *value) override
 Assigns an entity to a storage. More...
 
- Protected Member Functions inherited from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
virtual void try_emplace (const Entity entt, const void *=nullptr)
 Assigns an entity to a sparse set. More...
 
virtual basic_iterator try_emplace (const Entity entt, const bool force_back, const void *=nullptr)
 Assigns an entity to a sparse set. More...
 
+ + + + +

+Additional Inherited Members

- Protected Types inherited from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
+using basic_iterator = internal::sparse_set_iterator< packed_container_type >
 Random access iterator type.
 

Detailed Description

template<typename Entity, typename Type, typename Allocator, typename>
@@ -494,7 +493,7 @@ class entt::basic_storage< Entity, Type, Allocator, typename >

-

Definition at line 237 of file storage.hpp.

+

Definition at line 234 of file storage.hpp.

Constructor & Destructor Documentation

◆ basic_storage() [1/3]

@@ -530,7 +529,7 @@ template<typename Entity , typename Type , typename Allocator , typename > -

Definition at line 440 of file storage.hpp.

+

Definition at line 415 of file storage.hpp.

@@ -568,7 +567,7 @@ template<typename Entity , typename Type , typename Allocator , typename > -

Definition at line 448 of file storage.hpp.

+

Definition at line 423 of file storage.hpp.

@@ -617,7 +616,7 @@ template<typename Entity , typename Type , typename Allocator , typename > -

Definition at line 457 of file storage.hpp.

+

Definition at line 432 of file storage.hpp.

@@ -651,7 +650,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the first instance of the internal array. If the storage is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 565 of file storage.hpp.

+

Definition at line 539 of file storage.hpp.

@@ -684,7 +683,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the first instance of the internal array. If the storage is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 560 of file storage.hpp.

+

Definition at line 534 of file storage.hpp.

@@ -718,7 +717,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

-

Definition at line 523 of file storage.hpp.

+

Definition at line 497 of file storage.hpp.

@@ -751,7 +750,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the first instance of the internal array. If the storage is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 554 of file storage.hpp.

+

Definition at line 528 of file storage.hpp.

@@ -784,7 +783,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 580 of file storage.hpp.

+

Definition at line 554 of file storage.hpp.

@@ -817,7 +816,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the first instance of the reversed internal array. If the storage is empty, the returned iterator will be equal to rend().

Returns
An iterator to the first instance of the reversed internal array.
-

Definition at line 603 of file storage.hpp.

+

Definition at line 577 of file storage.hpp.

@@ -850,7 +849,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the element following the last instance of the reversed internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the reversed internal array.
-

Definition at line 627 of file storage.hpp.

+

Definition at line 601 of file storage.hpp.

@@ -883,7 +882,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The iterable object returns a tuple that contains the current entity and a reference to its component.

Returns
An iterable object to use to visit the storage.
-

Definition at line 765 of file storage.hpp.

+

Definition at line 733 of file storage.hpp.

@@ -916,7 +915,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The iterable object returns a tuple that contains the current entity and a reference to its component.

Returns
An iterable object to use to visit the storage.
-

Definition at line 770 of file storage.hpp.

+

Definition at line 738 of file storage.hpp.

@@ -975,7 +974,7 @@ template<typename... Args>
Returns
A reference to the newly created object.
-

Definition at line 690 of file storage.hpp.

+

Definition at line 661 of file storage.hpp.

@@ -1008,7 +1007,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 590 of file storage.hpp.

+

Definition at line 564 of file storage.hpp.

@@ -1041,7 +1040,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 585 of file storage.hpp.

+

Definition at line 559 of file storage.hpp.

@@ -1081,7 +1080,7 @@ template<typename Entity , typename Type , typename Allocator , typename >
Returns
The object assigned to the entity.
-

Definition at line 656 of file storage.hpp.

+

Definition at line 630 of file storage.hpp.

@@ -1121,7 +1120,7 @@ template<typename Entity , typename Type , typename Allocator , typename >
Returns
The object assigned to the entity.
-

Definition at line 651 of file storage.hpp.

+

Definition at line 625 of file storage.hpp.

@@ -1153,7 +1152,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

Returns the associated allocator.

Returns
The associated allocator.
-

Definition at line 498 of file storage.hpp.

+

Definition at line 473 of file storage.hpp.

@@ -1184,7 +1183,6 @@ template<typename Entity , typename Type , typename Allocator , typename >

Returns the object assigned to an entity as a tuple.

-
See also
get
Parameters
@@ -1193,7 +1191,7 @@ template<typename Entity , typename Type , typename Allocator , typename >
Returns
The object assigned to the entity as a tuple.
-

Definition at line 673 of file storage.hpp.

+

Definition at line 644 of file storage.hpp.

@@ -1224,7 +1222,6 @@ template<typename Entity , typename Type , typename Allocator , typename >

Returns the object assigned to an entity as a tuple.

-
See also
get
Parameters
enttA valid identifier.
@@ -1233,53 +1230,12 @@ template<typename Entity , typename Type , typename Allocator , typename >
Returns
The object assigned to the entity as a tuple.
-

Definition at line 668 of file storage.hpp.

+

Definition at line 639 of file storage.hpp.

- -

◆ get_at()

- -
-
-
-template<typename Entity , typename Type , typename Allocator , typename >
-
enttA valid identifier.
- - - - -
- - - - - - - - -
const void* entt::basic_storage< Entity, Type, Allocator, typename >::get_at (const std::size_t pos) const
- 		-inlineoverrideprotectedvirtual
-
- -

Returns the element assigned to an entity.

-
Parameters
- - -
posA valid position of an element within a storage.
-
-
-
Returns
An opaque pointer to the element assigned to the entity.
- -

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

- -

Definition at line 333 of file storage.hpp.

- -
- - -

◆ in_place_pop()

+ +

◆ in_place_pop()

@@ -1292,9 +1248,19 @@ template<typename Entity , typename Type , typename Allocator , typename >
void entt::basic_storage< Entity, Type, Allocator, typename >::in_place_pop (const Entity entt)typename underlying_type::basic_iterator first,
typename underlying_type::basic_iterator last 
)
@@ -1304,17 +1270,18 @@ template<typename Entity , typename Type , typename Allocator , typename >
-

Erases an element from a storage.

+

Erases elements from a storage.

Parameters
- + +
enttA valid identifier.
firstAn iterator to the first element to erase.
lastAn iterator past the last element to erase.
-

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

+

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

-

Definition at line 380 of file storage.hpp.

+

Definition at line 349 of file storage.hpp.

@@ -1326,7 +1293,7 @@ template<typename Entity , typename Type , typename Allocator , typename >
template<typename Entity , typename Type , typename Allocator , typename >
-template<typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, value_type>>>
+template<typename EIt , typename CIt , typename = std::enable_if_t<std::is_same_v<typename std::iterator_traits<CIt>::value_type, value_type>>> - - - - -
@@ -1380,7 +1347,7 @@ template<typename EIt , typename CIt , typename = std::enable_if_t<std::i -

Definition at line 753 of file storage.hpp.

+

Definition at line 719 of file storage.hpp.

@@ -1445,58 +1412,7 @@ template<typename It > -

Definition at line 736 of file storage.hpp.

- - - - -

◆ move_and_pop()

- -
-
-
-template<typename Entity , typename Type , typename Allocator , typename >
- - - - - -
- - - - - - - - - - - - - - - - - - -
void entt::basic_storage< Entity, Type, Allocator, typename >::move_and_pop (const std::size_t from,
const std::size_t to 
)
- 		-inlinefinalprotectedvirtual
-
- -

Moves an element within a storage.

-
Parameters
- - - -
fromA valid position of an element within a storage.
toA valid position of an element within a storage.
-
-
- -

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

- -

Definition at line 351 of file storage.hpp.

+

Definition at line 700 of file storage.hpp.

@@ -1535,7 +1451,7 @@ template<typename Entity , typename Type , typename Allocator , typename >
Returns
This storage.
-

Definition at line 473 of file storage.hpp.

+

Definition at line 448 of file storage.hpp.

@@ -1593,7 +1509,7 @@ template<typename... Func>
Returns
A reference to the updated instance.
-

Definition at line 715 of file storage.hpp.

+

Definition at line 679 of file storage.hpp.

@@ -1625,7 +1541,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

Direct access to the array of objects.

Returns
A pointer to the array of objects.
-

Definition at line 542 of file storage.hpp.

+

Definition at line 516 of file storage.hpp.

@@ -1657,7 +1573,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

Direct access to the array of objects.

Returns
A pointer to the array of objects.
-

Definition at line 537 of file storage.hpp.

+

Definition at line 511 of file storage.hpp.

@@ -1690,7 +1606,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the first instance of the reversed internal array. If the storage is empty, the returned iterator will be equal to rend().

Returns
An iterator to the first instance of the reversed internal array.
-

Definition at line 613 of file storage.hpp.

+

Definition at line 587 of file storage.hpp.

@@ -1723,7 +1639,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the first instance of the reversed internal array. If the storage is empty, the returned iterator will be equal to rend().

Returns
An iterator to the first instance of the reversed internal array.
-

Definition at line 608 of file storage.hpp.

+

Definition at line 582 of file storage.hpp.

@@ -1756,7 +1672,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the element following the last instance of the reversed internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the reversed internal array.
-

Definition at line 637 of file storage.hpp.

+

Definition at line 611 of file storage.hpp.

@@ -1789,7 +1705,7 @@ template<typename Entity , typename Type , typename Allocator , typename >

The returned iterator points to the element following the last instance of the reversed internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the reversed internal array.
-

Definition at line 632 of file storage.hpp.

+

Definition at line 606 of file storage.hpp.

@@ -1828,7 +1744,7 @@ template<typename Entity , typename Type , typename Allocator , typename > -

Definition at line 510 of file storage.hpp.

+

Definition at line 485 of file storage.hpp.

@@ -1866,12 +1782,12 @@ template<typename Entity , typename Type , typename Allocator , typename > -

Definition at line 487 of file storage.hpp.

+

Definition at line 462 of file storage.hpp.

- -

◆ swap_and_pop()

+ +

◆ swap_and_pop()

@@ -1884,54 +1800,14 @@ template<typename Entity , typename Type , typename Allocator , typename >
void entt::basic_storage< Entity, Type, Allocator, typename >::swap_and_pop (const Entity entt)
- - -inlineoverrideprotectedvirtual - - -
- -

Erase an element from a storage.

-
Parameters
- - -
enttA valid identifier.
-
-
- -

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

- -

Definition at line 361 of file storage.hpp.

- -
- - -

◆ swap_at()

- -
-
-
-template<typename Entity , typename Type , typename Allocator , typename >
- - - +inlineoverrideprotectedvirtual
- - - - - - + + - - + + @@ -1941,28 +1817,28 @@ template<typename Entity , typename Type , typename Allocator , typename >
void entt::basic_storage< Entity, Type, Allocator, typename >::swap_at (const std::size_t lhs, typename underlying_type::basic_iterator first,
const std::size_t rhs typename underlying_type::basic_iterator last 
-inlinefinalprotectedvirtual
-

Swaps two elements in a storage.

+

Erases elements from a storage.

Parameters
- - + +
lhsA valid position of an element within a storage.
rhsA valid position of an element within a storage.
firstAn iterator to the first element to erase.
lastAn iterator past the last element to erase.
-

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

+

Reimplemented from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >.

-

Definition at line 342 of file storage.hpp.

+

Definition at line 334 of file storage.hpp.

- -

◆ try_emplace()

+ +

◆ try_emplace()

@@ -1973,11 +1849,17 @@ template<typename Entity , typename Type , typename Allocator , typename > - + + + + + + + @@ -2002,11 +1884,13 @@ template<typename Entity , typename Type , typename Allocator , typename >
void entt::basic_storage< Entity, Type, Allocator, typename >::try_emplace underlying_type::basic_iterator entt::basic_storage< Entity, Type, Allocator, typename >::try_emplace ( [[maybe_unused] ] const Entity  entt,
const bool force_back,
+
enttA valid identifier.
valueOptional opaque value.
force_backForce back insertion.
+
Returns
Iterator pointing to the emplaced element.
-

Definition at line 392 of file storage.hpp.

+

Definition at line 363 of file storage.hpp.

diff --git a/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html b/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html index 89a9b6bf3..9275c9df8 100644 --- a/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html +++ b/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -100,10 +100,10 @@ Collaboration diagram for entt::basic_storage< Entity, Type, Allocator, std:: - - - + + + @@ -121,7 +121,7 @@ using  +using  - - - + + + +using  +using  - - - - + + + + @@ -222,8 +222,8 @@ Public Member Functions - - + + @@ -247,9 +247,6 @@ virtual  - - - @@ -278,7 +275,7 @@ virtual void  - + @@ -296,7 +293,7 @@ virtual void  - + @@ -320,12 +317,15 @@ virtual void  - - - - - - + + + + + + + + + @@ -358,7 +358,7 @@ void  - + - - + + @@ -637,12 +631,11 @@ template<typename... Args>
Parameters

Public Types

-using base_type = basic_sparse_set< Entity, typename allocator_traits::template rebind_alloc< Entity > >
 Base type.
 
+using base_type = underlying_type
 Base type.
 
using allocator_type = Allocator
 Allocator type.
 Unsigned integer type.
 
-using iterable = iterable_adaptor< internal::extended_storage_iterator< typename base_type::iterator > >
iterable = iterable_adaptor< internal::extended_storage_iterator< typename base_type::iterator > >
 Extended iterable storage proxy.
 
@@ -149,16 +149,16 @@ using pointer = typename packed_container_type::const_pointer
 Pointer type to contained entities.
 
-using iterator = internal::sparse_set_iterator< packed_container_type >
 Random access iterator type.
 
+using iterator = basic_iterator
 Random access iterator type.
 
-using const_iterator = iterator
const_iterator = iterator
 Constant random access iterator type.
 
-using reverse_iterator = std::reverse_iterator< iterator >
reverse_iterator = std::reverse_iterator< iterator >
 Reverse iterator type.
 
@@ -193,10 +193,10 @@ Public Member Functions
std::tuple get_as_tuple ([[maybe_unused]] const entity_type entt) const
 Returns an empty tuple. More...
 
template<typename... Args>
void emplace (const entity_type entt, Args &&...args)
 Assigns an entity to a storage and constructs its object. More...
 
template<typename... Args>
void emplace (const entity_type entt, Args &&...)
 Assigns an entity to a storage and constructs its object. More...
 
template<typename... Func>
void patch ([[maybe_unused]] const entity_type entt, Func &&...func)
 Updates the instance assigned to a given entity in-place. More...
 basic_sparse_set (deletion_policy pol, const allocator_type &allocator={})
 Constructs an empty container with the given policy and allocator. More...
 
 basic_sparse_set (const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
 Constructs an empty container with the given policy and allocator. More...
 basic_sparse_set (const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
 Constructs an empty container with the given value type, policy and allocator. More...
 
 basic_sparse_set (basic_sparse_set &&other)
 Move constructor. More...
deletion_policy policy () const
 Returns the deletion policy of a sparse set. More...
 
size_type slot () const
 Returns the next slot available for insertion. More...
 
virtual void reserve (const size_type cap)
 Increases the capacity of a sparse set. More...
 
const_iterator cbegin () const
 Returns an iterator to the beginning. More...
 
iterator end () const
iterator end () const
 Returns an iterator to the end. More...
 
const_iterator cend () const
const_reverse_iterator crend () const
 Returns a reverse iterator to the end. More...
 
iterator find (const entity_type entt) const
iterator find (const entity_type entt) const
 Finds an entity. More...
 
bool contains (const entity_type entt) const
void * get (const entity_type entt)
 Returns the element assigned to an entity, if any. More...
 
void emplace (const entity_type entt, const void *value=nullptr)
 Assigns an entity to a sparse set. More...
 
void insert (It first, It last)
 Assigns one or more entities to a sparse set. More...
 
iterator emplace (const entity_type entt, const void *value=nullptr)
 Assigns an entity to a sparse set. More...
 
void bump (const entity_type entt)
 Bump the version number of an entity. More...
 
iterator insert (It first, It last)
 Assigns one or more entities to a sparse set. More...
 
void erase (const entity_type entt)
 Erases an entity from a sparse set. More...
 
clear ()
 Clears a sparse set.
 
const type_info & type () const
const type_info & type () const
 Returned value type, if any. More...
 
@@ -368,27 +368,21 @@ virtual void  + + + + - - - - - - - - - - - - - - - - - - + + + + + + + + +

Additional Inherited Members

- Protected Types inherited from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
+using basic_iterator = internal::sparse_set_iterator< packed_container_type >
 Random access iterator type.
 
- Protected Member Functions inherited from entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
virtual const void * get_at (const std::size_t) const
 Returns the element assigned to an entity. More...
 
-virtual void swap_at (const std::size_t, const std::size_t)
 Swaps two entities in a sparse set.
 
-virtual void move_and_pop (const std::size_t, const std::size_t)
 Moves an entity in a sparse set.
 
virtual void swap_and_pop (const Entity entt)
 Erase an entity from a sparse set. More...
 
virtual void in_place_pop (const Entity entt)
 Erase an entity from a sparse set. More...
 
virtual void try_emplace (const Entity entt, const void *=nullptr)
 Assigns an entity to a sparse set. More...
 
virtual void swap_and_pop (basic_iterator first, basic_iterator last)
 Erases entities from a sparse set. More...
 
virtual void in_place_pop (basic_iterator first, basic_iterator last)
 Erases entities from a sparse set. More...
 
virtual basic_iterator try_emplace (const Entity entt, const bool force_back, const void *=nullptr)
 Assigns an entity to a sparse set. More...
 

Detailed Description

template<typename Entity, typename Type, typename Allocator>
@@ -396,7 +390,7 @@ class entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< igno

Default constructor.

-

Definition at line 780 of file storage.hpp.

+

Definition at line 748 of file storage.hpp.

Constructor & Destructor Documentation

◆ basic_storage() [1/3]

@@ -432,7 +426,7 @@ template<typename Entity , typename Type , typename Allocator > -

Definition at line 809 of file storage.hpp.

+

Definition at line 779 of file storage.hpp.

@@ -517,7 +511,7 @@ template<typename Entity , typename Type , typename Allocator > -

Definition at line 823 of file storage.hpp.

+

Definition at line 793 of file storage.hpp.

@@ -551,7 +545,7 @@ template<typename Entity , typename Type , typename Allocator >

The iterable object returns a tuple that contains the current entity.

Returns
An iterable object to use to visit the storage.
-

Definition at line 925 of file storage.hpp.

+

Definition at line 887 of file storage.hpp.

@@ -584,12 +578,12 @@ template<typename Entity , typename Type , typename Allocator >

The iterable object returns a tuple that contains the current entity.

Returns
An iterable object to use to visit the storage.
-

Definition at line 930 of file storage.hpp.

+

Definition at line 892 of file storage.hpp.

- -

◆ emplace()

+ +

◆ emplace()

@@ -610,8 +604,8 @@ template<typename... Args>
Args &&... args Args && ... 
-
enttA valid identifier.
argsParameters to use to construct an object for the entity.
-

Definition at line 881 of file storage.hpp.

+

Definition at line 850 of file storage.hpp.

@@ -681,7 +674,7 @@ template<typename Entity , typename Type , typename Allocator > -

Definition at line 850 of file storage.hpp.

+

Definition at line 820 of file storage.hpp.

@@ -713,7 +706,7 @@ template<typename Entity , typename Type , typename Allocator >

Returns the associated allocator.

Returns
The associated allocator.
-

Definition at line 837 of file storage.hpp.

+

Definition at line 807 of file storage.hpp.

@@ -753,7 +746,7 @@ template<typename Entity , typename Type , typename Allocator >
Returns
Returns an empty tuple.
-

Definition at line 864 of file storage.hpp.

+

Definition at line 834 of file storage.hpp.

@@ -817,7 +810,7 @@ template<typename It , typename... Args> -

Definition at line 906 of file storage.hpp.

+

Definition at line 874 of file storage.hpp.

@@ -911,7 +904,7 @@ template<typename... Func> -

Definition at line 893 of file storage.hpp.

+

Definition at line 861 of file storage.hpp.

diff --git a/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igf1e7d03b873359848c7e7d1b4d57edeb.html b/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igf1e7d03b873359848c7e7d1b4d57edeb.html index 19a88f11f..b7bba40ce 100644 --- a/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igf1e7d03b873359848c7e7d1b4d57edeb.html +++ b/classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igf1e7d03b873359848c7e7d1b4d57edeb.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
@@ -75,19 +75,21 @@ $(function() { - - - - - - - - - - - - - + + + + + + + + + + + + + + + @@ -103,8 +105,8 @@ $(function() { - - + + @@ -117,14 +119,12 @@ $(function() { - - - - - - - - + + + + + + @@ -141,14 +141,12 @@ $(function() { - - - - - - + + + + - + diff --git a/classentt_1_1basic__view.html b/classentt_1_1basic__view.html index 93fb1e5a2..9f8c65fa3 100644 --- a/classentt_1_1basic__view.html +++ b/classentt_1_1basic__view.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_a72dbfb819daa0430862c5f997bbec99.html b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_a72dbfb819daa0430862c5f997bbec99.html index 76cf2f539..122da2358 100644 --- a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_a72dbfb819daa0430862c5f997bbec99.html +++ b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_a72dbfb819daa0430862c5f997bbec99.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html index 4d79ee101..abf79fa13 100644 --- a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html +++ b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html @@ -22,7 +22,7 @@ @@ -119,7 +119,7 @@ Public Member Functions - + @@ -208,7 +208,7 @@ class entt::basic_view< Entity, get_t< Component >, exclude_t<>, -

Definition at line 535 of file view.hpp.

+

Definition at line 532 of file view.hpp.

Constructor & Destructor Documentation

◆ basic_view()

@@ -244,7 +244,7 @@ template<typename Entity , typename Component > -

Definition at line 565 of file view.hpp.

+

Definition at line 562 of file view.hpp.

@@ -277,7 +277,7 @@ template<typename Entity , typename Component >

Returns the last entity of the view, if any.

Returns
The last entity of the view if one exists, the null entity otherwise.
-

Definition at line 681 of file view.hpp.

+

Definition at line 678 of file view.hpp.

@@ -310,7 +310,7 @@ template<typename Entity , typename Component >

The returned iterator points to the first entity of the view. If the view is empty, the returned iterator will be equal to end().

Returns
An iterator to the first entity of the view.
-

Definition at line 623 of file view.hpp.

+

Definition at line 620 of file view.hpp.

@@ -349,7 +349,7 @@ template<typename Entity , typename Component >
Returns
True if the view contains the given entity, false otherwise.
-

Definition at line 726 of file view.hpp.

+

Definition at line 723 of file view.hpp.

@@ -382,7 +382,7 @@ template<typename Entity , typename Component >

The iterable object returns a tuple that contains the current entity and a reference to its component if it's a non-empty one. The constness of the component is as requested.

Returns
An iterable object to use to visit the view.
-

Definition at line 812 of file view.hpp.

+

Definition at line 805 of file view.hpp.

@@ -419,7 +419,7 @@ template<typename Func > The signature of the function must be equivalent to one of the following forms:

void(const entity_type, Component &);
void(Component &);
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:543
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:540
Template Parameters
allocator_type typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
at(const size_type pos) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
base_type typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
basic_sparse_set()entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(basic_sparse_set &&other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_storage()entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
basic_storage(const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inlineexplicit
basic_storage(basic_storage &&other)=defaultentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
basic_storage(basic_storage &&other, const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
begin() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
bind(any)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlinevirtual
base_type typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
basic_iterator typedefentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >protected
basic_sparse_set()entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineexplicit
basic_sparse_set(basic_sparse_set &&other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
basic_storage()entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
basic_storage(const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inlineexplicit
basic_storage(basic_storage &&other)=defaultentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
basic_storage(basic_storage &&other, const allocator_type &allocator)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
begin() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
bind(any)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlinevirtual
bump(const entity_type entt)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
capacity() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlinevirtual
cbegin() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
cend() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
data() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
each()entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
each() constentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
emplace(const entity_type entt, Args &&...args)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::emplace(const entity_type entt, const void *value=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
emplace(const entity_type entt, Args &&...)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::emplace(const entity_type entt, const void *value=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
empty() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
end() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
entity_type typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::get(const entity_type entt)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
get_allocator() constentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
get_as_tuple([[maybe_unused]] const entity_type entt) constentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
get_at(const std::size_t) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
in_place_pop(const Entity entt)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
index(const entity_type entt) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
insert(It first, It last, Args &&...)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::insert(It first, It last)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
iterable typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
iterator typedefentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
move_and_pop(const std::size_t, const std::size_t)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
in_place_pop(basic_iterator first, basic_iterator last)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
index(const entity_type entt) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
insert(It first, It last, Args &&...)entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >inline
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::insert(It first, It last)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
iterable typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
iterator typedefentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
operator=(basic_storage &&other)=defaultentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >::operator=(basic_sparse_set &&other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
operator[](const size_type pos) constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
shrink_to_fit()entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlinevirtual
size() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
size_type typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
slot() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap(basic_sparse_set &other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap_and_pop(const Entity entt)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
swap_at(const std::size_t, const std::size_t)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
sort(Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap(basic_sparse_set &other)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
swap_and_pop(basic_iterator first, basic_iterator last)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
swap_elements(const entity_type lhs, const entity_type rhs)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
try_emplace(const Entity entt, const void *=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
try_emplace(const Entity entt, const bool force_back, const void *=nullptr)entt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inlineprotectedvirtual
type() constentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >inline
value_type typedefentt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
version_type typedefentt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
const base_type & handle () const
 Returns the leading storage of a view. More...
 
template<typename... Comp>
template<typename Comp = Component>
decltype(auto) storage () const
 Returns the storage for a given component type. More...
 
@@ -433,7 +433,7 @@ template<typename Func > -

Definition at line 779 of file view.hpp.

+

Definition at line 776 of file view.hpp.

@@ -465,7 +465,7 @@ template<typename Entity , typename Component >

Checks whether a view is empty.

Returns
True if the view is empty, false otherwise.
-

Definition at line 611 of file view.hpp.

+

Definition at line 608 of file view.hpp.

@@ -498,7 +498,7 @@ template<typename Entity , typename Component >

The returned iterator points to the entity following the last entity of the view. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the entity following the last entity of the view.
-

Definition at line 636 of file view.hpp.

+

Definition at line 633 of file view.hpp.

@@ -537,7 +537,7 @@ template<typename Entity , typename Component >
Returns
An iterator to the given entity if it's found, past the end iterator otherwise.
-

Definition at line 691 of file view.hpp.

+

Definition at line 688 of file view.hpp.

@@ -569,7 +569,7 @@ template<typename Entity , typename Component >

Returns the first entity of the view, if any.

Returns
The first entity of the view if one exists, the null entity otherwise.
-

Definition at line 672 of file view.hpp.

+

Definition at line 669 of file view.hpp.

@@ -617,7 +617,7 @@ template<typename... Comp>
Returns
The component assigned to the entity.
-

Definition at line 742 of file view.hpp.

+

Definition at line 739 of file view.hpp.

@@ -665,7 +665,7 @@ template<std::size_t Comp>
Returns
The component assigned to the entity.
-

Definition at line 755 of file view.hpp.

+

Definition at line 752 of file view.hpp.

@@ -697,7 +697,7 @@ template<typename Entity , typename Component >

Returns the leading storage of a view.

Returns
The leading storage of the view.
-

Definition at line 574 of file view.hpp.

+

Definition at line 571 of file view.hpp.

@@ -729,7 +729,7 @@ template<typename Entity , typename Component >

Checks if a view is properly initialized.

Returns
True if the view is properly initialized, false otherwise.
-

Definition at line 717 of file view.hpp.

+

Definition at line 714 of file view.hpp.

@@ -768,7 +768,7 @@ template<typename Entity , typename Component >
Returns
The component assigned to the given entity.
-

Definition at line 709 of file view.hpp.

+

Definition at line 706 of file view.hpp.

@@ -807,7 +807,7 @@ template<typename Entity , typename Component >
Returns
The identifier that occupies the given position.
-

Definition at line 700 of file view.hpp.

+

Definition at line 697 of file view.hpp.

@@ -855,7 +855,7 @@ template<typename... Get, typename... Excl>
Returns
A more specific view.
-

Definition at line 824 of file view.hpp.

+

Definition at line 817 of file view.hpp.

@@ -888,7 +888,7 @@ template<typename Entity , typename Component >

The returned iterator points to the first entity of the reversed view. If the view is empty, the returned iterator will be equal to rend().

Returns
An iterator to the first entity of the reversed view.
-

Definition at line 648 of file view.hpp.

+

Definition at line 645 of file view.hpp.

@@ -921,7 +921,7 @@ template<typename Entity , typename Component >

The returned iterator points to the entity following the last entity of the reversed view. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the entity following the last entity of the reversed view.
-

Definition at line 663 of file view.hpp.

+

Definition at line 660 of file view.hpp.

@@ -953,7 +953,7 @@ template<typename Entity , typename Component >

Returns the number of entities that have the given component.

Returns
Number of entities that have the given component.
-

Definition at line 603 of file view.hpp.

+

Definition at line 600 of file view.hpp.

@@ -965,7 +965,7 @@ template<typename Entity , typename Component >
template<typename Entity , typename Component >
-template<typename... Comp>
+template<typename Comp = Component>
FuncType of the function object to invoke.
diff --git a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html index d4bbdab0d..01823ba04 100644 --- a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html +++ b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -201,7 +201,7 @@ class entt::basic_view< Entity, get_t< Component... >, exclude_t< Ex -

Definition at line 189 of file view.hpp.

+

Definition at line 186 of file view.hpp.

Constructor & Destructor Documentation

◆ basic_view()

@@ -248,7 +248,7 @@ template<typename Entity , typename... Component, typename... Exclude> -

Definition at line 258 of file view.hpp.

+

Definition at line 255 of file view.hpp.

@@ -281,7 +281,7 @@ template<typename Entity , typename... Component, typename... Exclude> Returns the last entity of the view, if any.

Returns
The last entity of the view if one exists, the null entity otherwise.
-

Definition at line 363 of file view.hpp.

+

Definition at line 360 of file view.hpp.

@@ -314,7 +314,7 @@ template<typename Entity , typename... Component, typename... Exclude> The returned iterator points to the first entity of the view. If the view is empty, the returned iterator will be equal to end().

Returns
An iterator to the first entity of the view.
-

Definition at line 331 of file view.hpp.

+

Definition at line 328 of file view.hpp.

@@ -353,7 +353,7 @@ template<typename Entity , typename... Component, typename... Exclude>
Returns
True if the view contains the given entity, false otherwise.
-

Definition at line 401 of file view.hpp.

+

Definition at line 398 of file view.hpp.

@@ -386,7 +386,7 @@ template<typename Entity , typename... Component, typename... Exclude> The iterable object returns a tuple that contains the current entity and a set of references to its non-empty components. The constness of the components is as requested.

Returns
An iterable object to use to visit the view.
-

Definition at line 485 of file view.hpp.

+

Definition at line 482 of file view.hpp.

@@ -423,7 +423,7 @@ template<typename Func > The signature of the function must be equivalent to one of the following forms:

void(const entity_type, Type &...);
void(Type &...);
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:237
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:234
Template Parameters
@@ -993,7 +993,7 @@ template<typename... Comp>
Returns
The storage for the given component type.
-

Definition at line 584 of file view.hpp.

+

Definition at line 581 of file view.hpp.

@@ -1033,7 +1033,7 @@ template<std::size_t Comp>
Returns
The storage for the given component type.
-

Definition at line 595 of file view.hpp.

+

Definition at line 592 of file view.hpp.

diff --git a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4-members.html b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4-members.html index ece004723..88eed451b 100644 --- a/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4-members.html +++ b/classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
@@ -437,7 +437,7 @@ template<typename Func > -

Definition at line 472 of file view.hpp.

+

Definition at line 469 of file view.hpp.

@@ -470,7 +470,7 @@ template<typename Entity , typename... Component, typename... Exclude> The returned iterator points to the entity following the last entity of the view. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the entity following the last entity of the view.
-

Definition at line 344 of file view.hpp.

+

Definition at line 341 of file view.hpp.

@@ -509,7 +509,7 @@ template<typename Entity , typename... Component, typename... Exclude>
Returns
An iterator to the given entity if it's found, past the end iterator otherwise.
-

Definition at line 375 of file view.hpp.

+

Definition at line 372 of file view.hpp.

@@ -541,7 +541,7 @@ template<typename Entity , typename... Component, typename... Exclude> Returns the first entity of the view, if any.

Returns
The first entity of the view if one exists, the null entity otherwise.
-

Definition at line 353 of file view.hpp.

+

Definition at line 350 of file view.hpp.

@@ -589,7 +589,7 @@ template<typename... Comp>
Returns
The components assigned to the entity.
-

Definition at line 418 of file view.hpp.

+

Definition at line 415 of file view.hpp.

@@ -638,7 +638,7 @@ template<std::size_t First, std::size_t... Other>
Returns
The components assigned to the entity.
-

Definition at line 443 of file view.hpp.

+

Definition at line 440 of file view.hpp.

@@ -670,7 +670,7 @@ template<typename Entity , typename... Component, typename... Exclude> Returns the leading storage of a view.

Returns
The leading storage of the view.
-

Definition at line 291 of file view.hpp.

+

Definition at line 288 of file view.hpp.

@@ -702,7 +702,7 @@ template<typename Entity , typename... Component, typename... Exclude> Checks if a view is properly initialized.

Returns
True if the view is properly initialized, false otherwise.
-

Definition at line 392 of file view.hpp.

+

Definition at line 389 of file view.hpp.

@@ -741,7 +741,7 @@ template<typename Entity , typename... Component, typename... Exclude>
Returns
The components assigned to the given entity.
-

Definition at line 384 of file view.hpp.

+

Definition at line 381 of file view.hpp.

@@ -789,7 +789,7 @@ template<typename... Get, typename... Excl>
Returns
A more specific view.
-

Definition at line 497 of file view.hpp.

+

Definition at line 494 of file view.hpp.

@@ -821,7 +821,7 @@ template<typename Entity , typename... Component, typename... Exclude> Estimates the number of entities iterated by the view.

Returns
Estimated number of entities iterated by the view.
-

Definition at line 319 of file view.hpp.

+

Definition at line 316 of file view.hpp.

@@ -861,7 +861,7 @@ template<typename Comp >
Returns
The storage for the given component type.
-

Definition at line 301 of file view.hpp.

+

Definition at line 298 of file view.hpp.

@@ -901,7 +901,7 @@ template<std::size_t Comp>
Returns
The storage for the given component type.
-

Definition at line 311 of file view.hpp.

+

Definition at line 308 of file view.hpp.

@@ -941,7 +941,7 @@ template<typename Comp >
Returns
A new view driven by the given component in its iterations.
-

Definition at line 269 of file view.hpp.

+

Definition at line 266 of file view.hpp.

@@ -981,7 +981,7 @@ template<std::size_t Comp>
Returns
A new view driven by the given component in its iterations.
-

Definition at line 281 of file view.hpp.

+

Definition at line 278 of file view.hpp.

diff --git a/classentt_1_1compressed__pair-members.html b/classentt_1_1compressed__pair-members.html index d12f081fe..834fc7357 100644 --- a/classentt_1_1compressed__pair-members.html +++ b/classentt_1_1compressed__pair-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1compressed__pair.html b/classentt_1_1compressed__pair.html index 501e92d63..bd7120ecd 100644 --- a/classentt_1_1compressed__pair.html +++ b/classentt_1_1compressed__pair.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1connection-members.html b/classentt_1_1connection-members.html index db9a85495..40d43007e 100644 --- a/classentt_1_1connection-members.html +++ b/classentt_1_1connection-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1connection.html b/classentt_1_1connection.html index a7d16d35d..5532ea33e 100644 --- a/classentt_1_1connection.html +++ b/classentt_1_1connection.html @@ -22,7 +22,7 @@ @@ -106,7 +106,7 @@ template<typename >

Connection class.

Opaque object the aim of which is to allow users to release an already estabilished connection without having to keep a reference to the signal or the sink that generated it.

-

Definition at line 234 of file sigh.hpp.

+

Definition at line 231 of file sigh.hpp.

Member Function Documentation

◆ operator bool()

@@ -134,7 +134,7 @@ template<typename >

Checks whether a connection is properly initialized.

Returns
True if the connection is properly initialized, false otherwise.
-

Definition at line 250 of file sigh.hpp.

+

Definition at line 247 of file sigh.hpp.

diff --git a/classentt_1_1delegate.html b/classentt_1_1delegate.html index 579ea8211..e0b6c85c8 100644 --- a/classentt_1_1delegate.html +++ b/classentt_1_1delegate.html @@ -22,7 +22,7 @@ @@ -80,7 +80,7 @@ class entt::delegate< typename >

Basic delegate implementation.

Primary template isn't defined on purpose. All the specializations give a compile-time error unless the template parameter is a function type.

-

Definition at line 66 of file delegate.hpp.

+

Definition at line 67 of file delegate.hpp.

The documentation for this class was generated from the following file: diff --git a/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4-members.html b/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4-members.html index ddcb4d490..65995570b 100644 --- a/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4-members.html +++ b/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4-members.html @@ -22,7 +22,7 @@ @@ -77,12 +77,12 @@ $(function() { - - - - - - + + + + + + diff --git a/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html b/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html index eedc37bd7..471ffa22f 100644 --- a/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html +++ b/classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html @@ -22,7 +22,7 @@ @@ -130,9 +130,9 @@ Public Member Functions - - - + + + @@ -158,7 +158,7 @@ class entt::delegate< Ret(Args...)> -

Definition at line 81 of file delegate.hpp.

+

Definition at line 82 of file delegate.hpp.

Constructor & Destructor Documentation

◆ delegate() [1/3]

@@ -196,7 +196,7 @@ template<auto Candidate> -

Definition at line 127 of file delegate.hpp.

+

Definition at line 128 of file delegate.hpp.

@@ -253,7 +253,7 @@ template<auto Candidate, typename Type > -

Definition at line 139 of file delegate.hpp.

+

Definition at line 140 of file delegate.hpp.

@@ -302,7 +302,7 @@ template<typename Ret , typename... Args> -

Definition at line 149 of file delegate.hpp.

+

Definition at line 150 of file delegate.hpp.

@@ -342,7 +342,7 @@ template<auto Candidate> -

Definition at line 158 of file delegate.hpp.

+

Definition at line 159 of file delegate.hpp.

@@ -393,7 +393,7 @@ template<typename Ret , typename... Args> -

Definition at line 238 of file delegate.hpp.

+

Definition at line 239 of file delegate.hpp.

@@ -442,7 +442,7 @@ template<auto Candidate, typename Type > -

Definition at line 188 of file delegate.hpp.

+

Definition at line 189 of file delegate.hpp.

@@ -490,12 +490,12 @@ template<auto Candidate, typename Type > -

Definition at line 212 of file delegate.hpp.

+

Definition at line 213 of file delegate.hpp.

- -

◆ instance()

+ +

◆ data()

@@ -506,7 +506,7 @@ template<typename Ret , typename... Args>
@@ -62,276 +62,274 @@ $(function() {
Public Types | Public Member Functions | -List of all members
+List of all members
-
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > Class Template Referencefinal
+
entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > Class Template Reference

Associative container for key-value pairs with unique keys. - More...

+ More...

-

#include <dense_hash_map.hpp>

+

#include <dense_map.hpp>

FuncType of the function object to invoke.
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
EnTT -  3.9.0 +  3.10.0
connect(Type &value_or_instance)entt::delegate< Ret(Args...)>inline
connect(Type *value_or_instance)entt::delegate< Ret(Args...)>inline
connect(function_type *function, const void *payload=nullptr)entt::delegate< Ret(Args...)>inline
delegate()entt::delegate< Ret(Args...)>inline
delegate(connect_arg_t< Candidate >)entt::delegate< Ret(Args...)>inline
delegate(connect_arg_t< Candidate >, Type &&value_or_instance)entt::delegate< Ret(Args...)>inline
delegate(function_type *function, const void *payload=nullptr)entt::delegate< Ret(Args...)>inline
function_type typedefentt::delegate< Ret(Args...)>
instance() constentt::delegate< Ret(Args...)>inline
data() constentt::delegate< Ret(Args...)>inline
delegate()entt::delegate< Ret(Args...)>inline
delegate(connect_arg_t< Candidate >)entt::delegate< Ret(Args...)>inline
delegate(connect_arg_t< Candidate >, Type &&value_or_instance)entt::delegate< Ret(Args...)>inline
delegate(function_type *function, const void *payload=nullptr)entt::delegate< Ret(Args...)>inline
function_type typedefentt::delegate< Ret(Args...)>
operator bool() constentt::delegate< Ret(Args...)>inlineexplicit
operator()(Args... args) constentt::delegate< Ret(Args...)>inline
operator==(const delegate< Ret(Args...)> &other) constentt::delegate< Ret(Args...)>inline
EnTT -  3.9.0 +  3.10.0
void reset ()
 Resets a delegate. More...
 
const void * instance () const
 Returns the instance or the payload linked to a delegate, if any. More...
 
const void * data () const
 Returns the instance or the payload linked to a delegate, if any. More...
 
Ret operator() (Args... args) const
 Triggers a delegate. More...
 
- + @@ -522,7 +522,7 @@ template<typename Ret , typename... Args>

Returns the instance or the payload linked to a delegate, if any.

Returns
An opaque pointer to the underlying data.
-

Definition at line 257 of file delegate.hpp.

+

Definition at line 258 of file delegate.hpp.

@@ -554,7 +554,7 @@ template<typename Ret , typename... Args>

Checks whether a delegate actually stores a listener.

Returns
False if the delegate is empty, true otherwise.
-

Definition at line 282 of file delegate.hpp.

+

Definition at line 283 of file delegate.hpp.

@@ -595,7 +595,7 @@ template<typename Ret , typename... Args>
Returns
The value returned by the underlying function.
-

Definition at line 273 of file delegate.hpp.

+

Definition at line 274 of file delegate.hpp.

@@ -634,7 +634,7 @@ template<typename Ret , typename... Args>
Returns
False if the two contents differ, true otherwise.
-

Definition at line 292 of file delegate.hpp.

+

Definition at line 293 of file delegate.hpp.

@@ -666,7 +666,7 @@ template<typename Ret , typename... Args>

Resets a delegate.

After a reset, a delegate cannot be invoked anymore.

-

Definition at line 248 of file delegate.hpp.

+

Definition at line 249 of file delegate.hpp.

diff --git a/classentt_1_1dense__hash__map-members.html b/classentt_1_1dense__hash__map-members.html deleted file mode 100644 index c933dc6eb..000000000 --- a/classentt_1_1dense__hash__map-members.html +++ /dev/null @@ -1,155 +0,0 @@ - - - - - - - -EnTT: Member List - - - - - - - - - -
-
-
const void* entt::delegate< Ret(Args...)>::instance const void* entt::delegate< Ret(Args...)>::data ( ) const
- - - - - -
-
EnTT -  3.9.0 -
-
- - - - - - - - - -
-
- - -
- -
- - - -
-
-
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > Member List
-
-
- -

This is the complete list of members for entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >, including all inherited members.

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
allocator_type typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
at(const key_type &key)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
at(const key_type &key) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin()entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
bucket(const key_type &key) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
bucket_count() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
bucket_size(const size_type index) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
cbegin() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
cbegin(const size_type index) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
cend() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
cend([[maybe_unused]] const size_type index) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
clear()entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
const_iterator typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
const_local_iterator typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
contains(const key_type &key) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
contains(const Other &key) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_hash_map()entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_hash_map(const allocator_type &allocator)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_hash_map(const size_type bucket_count, const allocator_type &allocator)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_hash_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_hash_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_hash_map(const dense_hash_map &other)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_hash_map(const dense_hash_map &other, const allocator_type &allocator)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_hash_map(dense_hash_map &&other)=defaultentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
dense_hash_map(dense_hash_map &&other, const allocator_type &allocator)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
emplace(Args &&...args)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
empty() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
end() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
end()entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator pos)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator first, const_iterator last)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
erase(const key_type &key)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const key_type &key)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const key_type &key) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const Other &key)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const Other &key) constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
get_allocator() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
hash_function() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
hasher typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
insert(const value_type &value)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert(value_type &&value)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert(Arg &&value)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert(It first, It last)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert_or_assign(const key_type &key, Arg &&value)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert_or_assign(key_type &&key, Arg &&value)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
iterator typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
key_eq() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
key_equal typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
key_type typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
load_factor() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
local_iterator typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
mapped_type typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
max_bucket_count() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
max_load_factor() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
max_load_factor(const float value)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
operator=(const dense_hash_map &other)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
operator=(dense_hash_map &&other)=defaultentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
operator[](const key_type &key)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
operator[](key_type &&key)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
rehash(const size_type count)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
reserve(const size_type count)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
size() constentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
size_type typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
swap(dense_hash_map &other)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
try_emplace(const key_type &key, Args &&...args)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
try_emplace(key_type &&key, Args &&...args)entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >inline
value_type typedefentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
~dense_hash_map()=defaultentt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >
- -
-Generated by doxygen 1.9.1 -
- - diff --git a/classentt_1_1dense__hash__set-members.html b/classentt_1_1dense__hash__set-members.html deleted file mode 100644 index 947e78615..000000000 --- a/classentt_1_1dense__hash__set-members.html +++ /dev/null @@ -1,145 +0,0 @@ - - - - - - - -EnTT: Member List - - - - - - - - - -
-
- - - - - - -
-
EnTT -  3.9.0 -
-
-
- - - - - - - - -
-
- - -
- -
- - -
-
-
-
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > Member List
-
-
- -

This is the complete list of members for entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >, including all inherited members.

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
allocator_type typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
begin() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
begin()entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
bucket(const value_type &value) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
bucket_count() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
bucket_size(const size_type index) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
cbegin() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
cbegin(const size_type index) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
cend() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
cend([[maybe_unused]] const size_type index) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
clear()entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
const_iterator typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
const_local_iterator typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
contains(const value_type &value) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
contains(const Other &value) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
dense_hash_set()entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
dense_hash_set(const allocator_type &allocator)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_hash_set(const size_type bucket_count, const allocator_type &allocator)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
dense_hash_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
dense_hash_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_hash_set(const dense_hash_set &other)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
dense_hash_set(const dense_hash_set &other, const allocator_type &allocator)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
dense_hash_set(dense_hash_set &&other)=defaultentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
dense_hash_set(dense_hash_set &&other, const allocator_type &allocator)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
emplace(Args &&...args)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
empty() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
end() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
end()entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator pos)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator first, const_iterator last)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
erase(const value_type &value)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
find(const value_type &value)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
find(const value_type &value) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
find(const Other &value)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
find(const Other &value) constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
get_allocator() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
hash_function() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
hasher typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
insert(const value_type &value)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
insert(value_type &&value)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
insert(It first, It last)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
iterator typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
key_eq() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
key_equal typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
key_type typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
load_factor() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
local_iterator typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
max_bucket_count() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
max_load_factor() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
max_load_factor(const float value)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
operator=(const dense_hash_set &other)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
operator=(dense_hash_set &&other)=defaultentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
rehash(const size_type count)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
reserve(const size_type count)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
size() constentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
size_type typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
swap(dense_hash_set &other)entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >inline
value_type typedefentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
~dense_hash_set()=defaultentt::dense_hash_set< Type, Hash, KeyEqual, Allocator >
- -
-Generated by doxygen 1.9.1 -
- - diff --git a/classentt_1_1dense__map-members.html b/classentt_1_1dense__map-members.html new file mode 100644 index 000000000..63e070065 --- /dev/null +++ b/classentt_1_1dense__map-members.html @@ -0,0 +1,154 @@ + + + + + + + +EnTT: Member List + + + + + + + + + +
+
+ + + + + + +
+
EnTT +  3.10.0 +
+
+
+ + + + + + + + +
+
+ + +
+ +
+ + +
+
+
+
entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > Member List
+
+
+ +

This is the complete list of members for entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
allocator_type typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
at(const key_type &key)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
at(const key_type &key) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin()entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
bucket(const key_type &key) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
bucket_count() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
bucket_size(const size_type index) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
cbegin() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
cbegin(const size_type index) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
cend() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
cend([[maybe_unused]] const size_type index) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
clear()entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
const_iterator typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
const_local_iterator typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
contains(const key_type &key) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
contains(const Other &key) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_map()entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_map(const allocator_type &allocator)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_map(const size_type bucket_count, const allocator_type &allocator)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_map(const dense_map &)=defaultentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
dense_map(const dense_map &other, const allocator_type &allocator)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
dense_map(dense_map &&)=defaultentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
dense_map(dense_map &&other, const allocator_type &allocator)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
emplace([[maybe_unused]] Args &&...args)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
empty() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
end() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
end()entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator pos)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator first, const_iterator last)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
erase(const key_type &key)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const key_type &key)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const key_type &key) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const Other &key)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
find(const Other &key) constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
get_allocator() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
hash_function() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
hasher typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
insert(const value_type &value)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert(value_type &&value)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert(Arg &&value)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert(It first, It last)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert_or_assign(const key_type &key, Arg &&value)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
insert_or_assign(key_type &&key, Arg &&value)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
iterator typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
key_eq() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
key_equal typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
key_type typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
load_factor() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
local_iterator typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
mapped_type typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
max_bucket_count() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
max_load_factor() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
max_load_factor(const float value)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
operator=(const dense_map &)=defaultentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
operator=(dense_map &&)=defaultentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
operator[](const key_type &key)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
operator[](key_type &&key)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
rehash(const size_type count)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
reserve(const size_type count)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
size() constentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
size_type typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
swap(dense_map &other)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
try_emplace(const key_type &key, Args &&...args)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
try_emplace(key_type &&key, Args &&...args)entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >inline
value_type typedefentt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/classentt_1_1dense__hash__map.html b/classentt_1_1dense__map.html similarity index 51% rename from classentt_1_1dense__hash__map.html rename to classentt_1_1dense__map.html index 01c84540e..4302ab500 100644 --- a/classentt_1_1dense__hash__map.html +++ b/classentt_1_1dense__map.html @@ -5,7 +5,7 @@ -EnTT: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > Class Template Reference +EnTT: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > Class Template Reference @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

-using key_type = Key
 Key type of the container.
 
-using mapped_type = Type
 Mapped type of the container.
 
-using value_type = std::pair< const Key, Type >
 Key-value type of the container.
 
-using size_type = std::size_t
 Unsigned integer type.
 
-using hasher = Hash
 Type of function to use to hash the keys.
 
-using key_equal = KeyEqual
 Type of function to use to compare the keys for equality.
 
-using allocator_type = Allocator
 Allocator type.
 
-using iterator = internal::dense_hash_map_iterator< typename packed_container_type::pointer >
 Random access iterator type.
 
-using const_iterator = internal::dense_hash_map_iterator< typename packed_container_type::const_pointer >
 Constant random access iterator type.
 
-using local_iterator = internal::dense_hash_map_local_iterator< typename packed_container_type::pointer >
 Forward iterator type.
 
-using const_local_iterator = internal::dense_hash_map_local_iterator< typename packed_container_type::const_pointer >
 Constant forward iterator type.
 
+using key_type = Key
 Key type of the container.
 
+using mapped_type = Type
 Mapped type of the container.
 
+using value_type = std::pair< const Key, Type >
 Key-value type of the container.
 
+using size_type = std::size_t
 Unsigned integer type.
 
+using hasher = Hash
 Type of function to use to hash the keys.
 
+using key_equal = KeyEqual
 Type of function to use to compare the keys for equality.
 
+using allocator_type = Allocator
 Allocator type.
 
+using iterator = internal::dense_map_iterator< typename packed_container_type::iterator >
 Input iterator type.
 
+using const_iterator = internal::dense_map_iterator< typename packed_container_type::const_iterator >
 Constant input iterator type.
 
+using local_iterator = internal::dense_map_local_iterator< typename packed_container_type::iterator >
 Input iterator type.
 
+using const_local_iterator = internal::dense_map_local_iterator< typename packed_container_type::const_iterator >
 Constant input iterator type.
 
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

- dense_hash_map ()
 Default constructor.
 
 dense_hash_map (const allocator_type &allocator)
 Constructs an empty container with a given allocator. More...
 
 dense_hash_map (const size_type bucket_count, const allocator_type &allocator)
 Constructs an empty container with a given allocator and user supplied minimal number of buckets. More...
 
 dense_hash_map (const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
 Constructs an empty container with a given allocator, hash function and user supplied minimal number of buckets. More...
 
 dense_hash_map (const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())
 Constructs an empty container with a given allocator, hash function, compare function and user supplied minimal number of buckets. More...
 
 dense_hash_map (const dense_hash_map &other)
 Copy constructor. More...
 
 dense_hash_map (const dense_hash_map &other, const allocator_type &allocator)
 Allocator-extended copy constructor. More...
 
 dense_hash_map (dense_hash_map &&other)=default
 Default move constructor. More...
 
 dense_hash_map (dense_hash_map &&other, const allocator_type &allocator)
 Allocator-extended move constructor. More...
 
- ~dense_hash_map ()=default
 Default destructor.
 
dense_hash_map & operator= (const dense_hash_map &other)
 Copy assignment operator. More...
 
dense_hash_map & operator= (dense_hash_map &&other)=default
 Default move assignment operator. More...
 
constexpr allocator_type get_allocator () const
 Returns the associated allocator. More...
 
const_iterator cbegin () const
 Returns an iterator to the beginning. More...
 
const_iterator begin () const
 Returns an iterator to the beginning. More...
 
iterator begin ()
 Returns an iterator to the beginning. More...
 
const_iterator cend () const
 Returns an iterator to the end. More...
 
const_iterator end () const
 Returns an iterator to the end. More...
 
iterator end ()
 Returns an iterator to the end. More...
 
bool empty () const
 Checks whether a container is empty. More...
 
size_type size () const
 Returns the number of elements in a container. More...
 
-void clear ()
 Clears the container.
 
std::pair< iterator, bool > insert (const value_type &value)
 Inserts an element into the container, if the key does not exist. More...
 
std::pair< iterator, bool > insert (value_type &&value)
 Inserts an element into the container, if the key does not exist. More...
 
template<typename Arg >
std::enable_if_t< std::is_constructible_v< value_type, Arg && >, std::pair< iterator, bool > > insert (Arg &&value)
 Inserts an element into the container, if the key does not exist. More...
 
template<typename It >
void insert (It first, It last)
 Inserts elements into the container, if their keys do not exist. More...
 
template<typename Arg >
std::pair< iterator, bool > insert_or_assign (const key_type &key, Arg &&value)
 Inserts an element into the container or assigns to the current element if the key already exists. More...
 
template<typename Arg >
std::pair< iterator, bool > insert_or_assign (key_type &&key, Arg &&value)
 Inserts an element into the container or assigns to the current element if the key already exists. More...
 
template<typename... Args>
std::pair< iterator, bool > emplace (Args &&...args)
 Constructs an element in-place, if the key does not exist. More...
 
template<typename... Args>
std::pair< iterator, bool > try_emplace (const key_type &key, Args &&...args)
 Inserts in-place if the key does not exist, does nothing if the key exists. More...
 
template<typename... Args>
std::pair< iterator, bool > try_emplace (key_type &&key, Args &&...args)
 Inserts in-place if the key does not exist, does nothing if the key exists. More...
 
iterator erase (const_iterator pos)
 Removes an element from a given position. More...
 
iterator erase (const_iterator first, const_iterator last)
 Removes the given elements from a container. More...
 
size_type erase (const key_type &key)
 Removes the element associated with a given key. More...
 
void swap (dense_hash_map &other)
 Exchanges the contents with those of a given container. More...
 
Type & at (const key_type &key)
 Accesses a given element with bounds checking. More...
 
const Type & at (const key_type &key) const
 Accesses a given element with bounds checking. More...
 
Type & operator[] (const key_type &key)
 Accesses or inserts a given element. More...
 
Type & operator[] (key_type &&key)
 Accesses or inserts a given element. More...
 
iterator find (const key_type &key)
 Finds an element with a given key. More...
 
const_iterator find (const key_type &key) const
 Finds an element with a given key. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find (const Other &key)
 Finds an element with a key that compares equivalent to a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find (const Other &key) const
 Finds an element with a given key. More...
 
bool contains (const key_type &key) const
 Checks if the container contains an element with a given key. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains (const Other &key) const
 Checks if the container contains an element with a key that compares equivalent to a given value. More...
 
const_local_iterator cbegin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator begin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
local_iterator begin (const size_type index)
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator cend ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
const_local_iterator end ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
local_iterator end ([[maybe_unused]] const size_type index)
 Returns an iterator to the end of a given bucket. More...
 
size_type bucket_count () const
 Returns the number of buckets. More...
 
size_type max_bucket_count () const
 Returns the maximum number of buckets. More...
 
size_type bucket_size (const size_type index) const
 Returns the number of elements in a given bucket. More...
 
size_type bucket (const key_type &key) const
 Returns the bucket for a given key. More...
 
float load_factor () const
 Returns the average number of elements per bucket. More...
 
float max_load_factor () const
 Returns the maximum average number of elements per bucket. More...
 
void max_load_factor (const float value)
 Sets the desired maximum average number of elements per bucket. More...
 
void rehash (const size_type count)
 Reserves at least the specified number of buckets and regenerates the hash table. More...
 
void reserve (const size_type count)
 Reserves space for at least the specified number of elements and regenerates the hash table. More...
 
hasher hash_function () const
 Returns the function used to hash the keys. More...
 
key_equal key_eq () const
 Returns the function used to compare keys for equality. More...
 
+ dense_map ()
 Default constructor.
 
 dense_map (const allocator_type &allocator)
 Constructs an empty container with a given allocator. More...
 
 dense_map (const size_type bucket_count, const allocator_type &allocator)
 Constructs an empty container with a given allocator and user supplied minimal number of buckets. More...
 
 dense_map (const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
 Constructs an empty container with a given allocator, hash function and user supplied minimal number of buckets. More...
 
 dense_map (const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})
 Constructs an empty container with a given allocator, hash function, compare function and user supplied minimal number of buckets. More...
 
+ dense_map (const dense_map &)=default
 Default copy constructor.
 
 dense_map (const dense_map &other, const allocator_type &allocator)
 Allocator-extended copy constructor. More...
 
+ dense_map (dense_map &&)=default
 Default move constructor.
 
 dense_map (dense_map &&other, const allocator_type &allocator)
 Allocator-extended move constructor. More...
 
dense_map & operator= (const dense_map &)=default
 Default copy assignment operator. More...
 
dense_map & operator= (dense_map &&)=default
 Default move assignment operator. More...
 
constexpr allocator_type get_allocator () const
 Returns the associated allocator. More...
 
const_iterator cbegin () const
 Returns an iterator to the beginning. More...
 
const_iterator begin () const
 Returns an iterator to the beginning. More...
 
iterator begin ()
 Returns an iterator to the beginning. More...
 
const_iterator cend () const
 Returns an iterator to the end. More...
 
const_iterator end () const
 Returns an iterator to the end. More...
 
iterator end ()
 Returns an iterator to the end. More...
 
bool empty () const
 Checks whether a container is empty. More...
 
size_type size () const
 Returns the number of elements in a container. More...
 
+void clear ()
 Clears the container.
 
std::pair< iterator, bool > insert (const value_type &value)
 Inserts an element into the container, if the key does not exist. More...
 
std::pair< iterator, bool > insert (value_type &&value)
 Inserts an element into the container, if the key does not exist. More...
 
template<typename Arg >
std::enable_if_t< std::is_constructible_v< value_type, Arg && >, std::pair< iterator, bool > > insert (Arg &&value)
 Inserts an element into the container, if the key does not exist. More...
 
template<typename It >
void insert (It first, It last)
 Inserts elements into the container, if their keys do not exist. More...
 
template<typename Arg >
std::pair< iterator, bool > insert_or_assign (const key_type &key, Arg &&value)
 Inserts an element into the container or assigns to the current element if the key already exists. More...
 
template<typename Arg >
std::pair< iterator, bool > insert_or_assign (key_type &&key, Arg &&value)
 Inserts an element into the container or assigns to the current element if the key already exists. More...
 
template<typename... Args>
std::pair< iterator, bool > emplace ([[maybe_unused]] Args &&...args)
 Constructs an element in-place, if the key does not exist. More...
 
template<typename... Args>
std::pair< iterator, bool > try_emplace (const key_type &key, Args &&...args)
 Inserts in-place if the key does not exist, does nothing if the key exists. More...
 
template<typename... Args>
std::pair< iterator, bool > try_emplace (key_type &&key, Args &&...args)
 Inserts in-place if the key does not exist, does nothing if the key exists. More...
 
iterator erase (const_iterator pos)
 Removes an element from a given position. More...
 
iterator erase (const_iterator first, const_iterator last)
 Removes the given elements from a container. More...
 
size_type erase (const key_type &key)
 Removes the element associated with a given key. More...
 
void swap (dense_map &other)
 Exchanges the contents with those of a given container. More...
 
mapped_type & at (const key_type &key)
 Accesses a given element with bounds checking. More...
 
const mapped_type & at (const key_type &key) const
 Accesses a given element with bounds checking. More...
 
mapped_type & operator[] (const key_type &key)
 Accesses or inserts a given element. More...
 
mapped_type & operator[] (key_type &&key)
 Accesses or inserts a given element. More...
 
iterator find (const key_type &key)
 Finds an element with a given key. More...
 
const_iterator find (const key_type &key) const
 Finds an element with a given key. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find (const Other &key)
 Finds an element with a key that compares equivalent to a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find (const Other &key) const
 Finds an element with a given key. More...
 
bool contains (const key_type &key) const
 Checks if the container contains an element with a given key. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains (const Other &key) const
 Checks if the container contains an element with a key that compares equivalent to a given value. More...
 
const_local_iterator cbegin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator begin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
local_iterator begin (const size_type index)
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator cend ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
const_local_iterator end ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
local_iterator end ([[maybe_unused]] const size_type index)
 Returns an iterator to the end of a given bucket. More...
 
size_type bucket_count () const
 Returns the number of buckets. More...
 
size_type max_bucket_count () const
 Returns the maximum number of buckets. More...
 
size_type bucket_size (const size_type index) const
 Returns the number of elements in a given bucket. More...
 
size_type bucket (const key_type &key) const
 Returns the bucket for a given key. More...
 
float load_factor () const
 Returns the average number of elements per bucket. More...
 
float max_load_factor () const
 Returns the maximum average number of elements per bucket. More...
 
void max_load_factor (const float value)
 Sets the desired maximum average number of elements per bucket. More...
 
void rehash (const size_type count)
 Reserves at least the specified number of buckets and regenerates the hash table. More...
 
void reserve (const size_type count)
 Reserves space for at least the specified number of elements and regenerates the hash table. More...
 
hasher hash_function () const
 Returns the function used to hash the keys. More...
 
key_equal key_eq () const
 Returns the function used to compare keys for equality. More...
 

Detailed Description

template<typename Key, typename Type, typename Hash, typename KeyEqual, typename Allocator>
-class entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >

+class entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >

Associative container for key-value pairs with unique keys.

Internally, elements are organized into buckets. Which bucket an element is placed into depends entirely on the hash of its key. Keys with the same hash code appear in the same bucket.

@@ -346,10 +344,10 @@ class entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -

Definition at line 240 of file dense_hash_map.hpp.

+

Definition at line 265 of file dense_map.hpp.

Constructor & Destructor Documentation

- -

◆ dense_hash_map() [1/8]

+ +

◆ dense_map() [1/6]

@@ -360,9 +358,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t - + - + @@ -382,12 +380,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 350 of file dense_hash_map.hpp.

+

Definition at line 382 of file dense_map.hpp.

- -

◆ dense_hash_map() [2/8]

+ +

◆ dense_map() [2/6]

@@ -398,15 +396,15 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::dense_map (const allocator_type & const allocator_type &  allocator)
- + - + - + @@ -431,12 +429,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 359 of file dense_hash_map.hpp.

+

Definition at line 391 of file dense_map.hpp.

- -

◆ dense_hash_map() [3/8]

+ +

◆ dense_map() [3/6]

@@ -447,21 +445,21 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::dense_map (const size_type const size_type  bucket_count,
const allocator_type & const allocator_type &  allocator 
- + - + - + - + @@ -487,12 +485,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 369 of file dense_hash_map.hpp.

+

Definition at line 401 of file dense_map.hpp.

- -

◆ dense_hash_map() [4/8]

+ +

◆ dense_map() [4/6]

@@ -503,28 +501,28 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::dense_map (const size_type const size_type  bucket_count,
const hasher & const hasher &  hash,
const allocator_type & const allocator_type &  allocator 
- + - + - - + + - - + + - - + + @@ -550,12 +548,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 380 of file dense_hash_map.hpp.

+

Definition at line 412 of file dense_map.hpp.

- -

◆ dense_hash_map() [5/8]

+ +

◆ dense_map() [5/6]

@@ -566,53 +564,15 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
- - -
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::dense_map (const size_type const size_type  bucket_count,
const hasher & hash = hasher{}, const hasher & hash = hasher{},
const key_equal & equal = key_equal{}, const key_equal & equal = key_equal{},
const allocator_type & allocator = allocator_type() const allocator_type & allocator = allocator_type{} 
- + - - - - -
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::dense_map (const dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > & other)
- 		-inline
-
- -

Copy constructor.

-
Parameters
- - -
otherThe instance to copy from.
-
-
- -

Definition at line 391 of file dense_hash_map.hpp.

- -
- - -

◆ dense_hash_map() [6/8]

- -
-
-
-template<typename Key , typename Type , typename Hash , typename KeyEqual , typename Allocator >
- - -
- - - - - + - + @@ -637,12 +597,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 399 of file dense_hash_map.hpp.

+

Definition at line 427 of file dense_map.hpp.

- -

◆ dense_hash_map() [7/8]

+ +

◆ dense_map() [6/6]

@@ -653,51 +613,15 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
- - -
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map (const dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > & const dense_map< Key, Type, Hash, KeyEqual, Allocator > &  other,
const allocator_type & const allocator_type &  allocator 
- + - - - - -
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::dense_map (dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > && other)
- 		-default
-
- -

Default move constructor.

-
Parameters
- - -
otherThe instance to move from.
-
-
- -
- - -

◆ dense_hash_map() [8/8]

- -
-
-
-template<typename Key , typename Type , typename Hash , typename KeyEqual , typename Allocator >
- - -
- - - - - + - + @@ -722,13 +646,13 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 417 of file dense_hash_map.hpp.

+

Definition at line 440 of file dense_map.hpp.

Member Function Documentation

- -

◆ at() [1/2]

+ +

◆ at() [1/2]

@@ -739,9 +663,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::dense_hash_map (dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > && dense_map< Key, Type, Hash, KeyEqual, Allocator > &&  other,
const allocator_type & const allocator_type &  allocator 
- + - + @@ -762,12 +686,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
A reference to the mapped value of the requested element.
-

Definition at line 702 of file dense_hash_map.hpp.

+

Definition at line 713 of file dense_map.hpp.

- -

◆ at() [2/2]

+ +

◆ at() [2/2]

@@ -778,9 +702,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Type& entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::at mapped_type& entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::at (const key_type & const key_type &  key)
- + - + @@ -801,12 +725,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
A reference to the mapped value of the requested element.
-

Definition at line 709 of file dense_hash_map.hpp.

+

Definition at line 720 of file dense_map.hpp.

- -

◆ begin() [1/4]

+ +

◆ begin() [1/4]

@@ -817,7 +741,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const Type& entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::at const mapped_type& entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::at (const key_type & const key_type &  key) const
- + @@ -831,15 +755,15 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns an iterator to the beginning.

-

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

+

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 474 of file dense_hash_map.hpp.

+

Definition at line 483 of file dense_map.hpp.

- -

◆ begin() [2/4]

+ +

◆ begin() [2/4]

@@ -850,7 +774,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::begin iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::begin ( ) - + @@ -864,15 +788,15 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns an iterator to the beginning.

-

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

+

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 469 of file dense_hash_map.hpp.

+

Definition at line 478 of file dense_map.hpp.

- -

◆ begin() [3/4]

+ +

◆ begin() [3/4]

@@ -883,9 +807,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::begin const_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::begin ( ) const - + - + @@ -906,12 +830,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to the beginning of the given bucket.
-

Definition at line 814 of file dense_hash_map.hpp.

+

Definition at line 825 of file dense_map.hpp.

- -

◆ begin() [4/4]

+ +

◆ begin() [4/4]

@@ -922,9 +846,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
local_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::begin local_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::begin (const size_type const size_type  index)
- + - + @@ -945,12 +869,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to the beginning of the given bucket.
-

Definition at line 805 of file dense_hash_map.hpp.

+

Definition at line 816 of file dense_map.hpp.

- -

◆ bucket()

+ +

◆ bucket()

@@ -961,9 +885,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_local_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::begin const_local_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::begin (const size_type const size_type  index) const
- + - + @@ -984,12 +908,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
The bucket for the given key.
-

Definition at line 875 of file dense_hash_map.hpp.

+

Definition at line 886 of file dense_map.hpp.

- -

◆ bucket_count()

+ +

◆ bucket_count()

@@ -1000,7 +924,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
size_type entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::bucket size_type entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::bucket (const key_type & const key_type &  key) const
- + @@ -1016,12 +940,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the number of buckets.

Returns
The number of buckets.
-

Definition at line 849 of file dense_hash_map.hpp.

+

Definition at line 860 of file dense_map.hpp.

- -

◆ bucket_size()

+ +

◆ bucket_size()

@@ -1032,9 +956,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
size_type entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::bucket_count size_type entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::bucket_count ( ) const - + - + @@ -1055,12 +979,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
The number of elements in the given bucket.
-

Definition at line 866 of file dense_hash_map.hpp.

+

Definition at line 877 of file dense_map.hpp.

- -

◆ cbegin() [1/2]

+ +

◆ cbegin() [1/2]

@@ -1071,7 +995,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
size_type entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::bucket_size size_type entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::bucket_size (const size_type const size_type  index) const
- + @@ -1085,15 +1009,15 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns an iterator to the beginning.

-

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

+

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 464 of file dense_hash_map.hpp.

+

Definition at line 473 of file dense_map.hpp.

- -

◆ cbegin() [2/2]

+ +

◆ cbegin() [2/2]

@@ -1104,9 +1028,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::cbegin const_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::cbegin ( ) const - + - + @@ -1127,12 +1051,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to the beginning of the given bucket.
-

Definition at line 796 of file dense_hash_map.hpp.

+

Definition at line 807 of file dense_map.hpp.

- -

◆ cend() [1/2]

+ +

◆ cend() [1/2]

@@ -1143,7 +1067,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_local_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::cbegin const_local_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::cbegin (const size_type const size_type  index) const
- + @@ -1160,12 +1084,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 488 of file dense_hash_map.hpp.

+

Definition at line 497 of file dense_map.hpp.

- -

◆ cend() [2/2]

+ +

◆ cend() [2/2]

@@ -1176,9 +1100,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::cend const_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::cend ( ) const - + - + @@ -1199,12 +1123,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to the end of the given bucket.
-

Definition at line 823 of file dense_hash_map.hpp.

+

Definition at line 834 of file dense_map.hpp.

- -

◆ contains() [1/2]

+ +

◆ contains() [1/2]

@@ -1215,9 +1139,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_local_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::cend const_local_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::cend ([[maybe_unused] ] const size_type [[maybe_unused] ] const size_type  index) const
- + - + @@ -1238,12 +1162,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
True if there is such an element, false otherwise.
-

Definition at line 774 of file dense_hash_map.hpp.

+

Definition at line 785 of file dense_map.hpp.

- -

◆ contains() [2/2]

+ +

◆ contains() [2/2]

@@ -1256,7 +1180,7 @@ template<typename Other >
bool entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::contains bool entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::contains (const key_type & const key_type &  key) const
- + @@ -1285,12 +1209,12 @@ template<typename Other >
Returns
True if there is such an element, false otherwise.
-

Definition at line 787 of file dense_hash_map.hpp.

+

Definition at line 798 of file dense_map.hpp.

- -

◆ emplace()

+ +

◆ emplace()

@@ -1303,9 +1227,9 @@ template<typename... Args>
std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool> > entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::contains std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool> > entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::contains ( const Other &  key) - + - + @@ -1318,6 +1242,7 @@ template<typename... Args>

Constructs an element in-place, if the key does not exist.

+

The element is also constructed when the container already has the key, in which case the newly constructed object is destroyed immediately.

Template Parameters
std::pair<iterator, bool> entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::emplace std::pair<iterator, bool> entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::emplace (Args &&... [[maybe_unused] ] Args &&...  args)
@@ -1332,12 +1257,12 @@ template<typename... Args>
Returns
A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
-

Definition at line 606 of file dense_hash_map.hpp.

+

Definition at line 607 of file dense_map.hpp.

- -

◆ empty()

+ +

◆ empty()

@@ -1348,7 +1273,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
ArgsTypes of arguments to forward to the constructor of the element.
- + @@ -1364,12 +1289,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Checks whether a container is empty.

Returns
True if the container is empty, false otherwise.
-

Definition at line 506 of file dense_hash_map.hpp.

+

Definition at line 515 of file dense_map.hpp.

- -

◆ end() [1/4]

+ +

◆ end() [1/4]

@@ -1380,7 +1305,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
bool entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::empty bool entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::empty ( ) const - + @@ -1397,12 +1322,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 498 of file dense_hash_map.hpp.

+

Definition at line 507 of file dense_map.hpp.

- -

◆ end() [2/4]

+ +

◆ end() [2/4]

@@ -1413,7 +1338,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::end iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::end ( ) - + @@ -1430,12 +1355,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 493 of file dense_hash_map.hpp.

+

Definition at line 502 of file dense_map.hpp.

- -

◆ end() [3/4]

+ +

◆ end() [3/4]

@@ -1446,9 +1371,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::end const_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::end ( ) const - + - + @@ -1469,12 +1394,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to the end of the given bucket.
-

Definition at line 841 of file dense_hash_map.hpp.

+

Definition at line 852 of file dense_map.hpp.

- -

◆ end() [4/4]

+ +

◆ end() [4/4]

@@ -1485,9 +1410,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
local_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::end local_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::end ([[maybe_unused] ] const size_type [[maybe_unused] ] const size_type  index)
- + - + @@ -1508,12 +1433,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to the end of the given bucket.
-

Definition at line 832 of file dense_hash_map.hpp.

+

Definition at line 843 of file dense_map.hpp.

- -

◆ erase() [1/3]

+ +

◆ erase() [1/3]

@@ -1524,9 +1449,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
const_local_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::end const_local_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::end ([[maybe_unused] ] const size_type [[maybe_unused] ] const size_type  index) const
- + - + @@ -1547,12 +1472,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
Number of elements removed (either 0 or 1).
-

Definition at line 673 of file dense_hash_map.hpp.

+

Definition at line 684 of file dense_map.hpp.

- -

◆ erase() [2/3]

+ +

◆ erase() [2/3]

@@ -1563,15 +1488,15 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
size_type entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::erase size_type entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::erase (const key_type & const key_type &  key)
- + - + - + @@ -1597,12 +1522,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator following the last removed element.
-

Definition at line 658 of file dense_hash_map.hpp.

+

Definition at line 669 of file dense_map.hpp.

- -

◆ erase() [3/3]

+ +

◆ erase() [3/3]

@@ -1613,9 +1538,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::erase iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::erase (const_iterator const_iterator  first,
const_iterator const_iterator  last 
- + - + @@ -1636,12 +1561,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator following the removed element.
-

Definition at line 646 of file dense_hash_map.hpp.

+

Definition at line 657 of file dense_map.hpp.

- -

◆ find() [1/4]

+ +

◆ find() [1/4]

@@ -1652,9 +1577,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::erase iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::erase (const_iterator const_iterator  pos)
- + - + @@ -1675,12 +1600,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to an element with the given key. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 739 of file dense_hash_map.hpp.

+

Definition at line 750 of file dense_map.hpp.

- -

◆ find() [2/4]

+ +

◆ find() [2/4]

@@ -1691,9 +1616,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::find iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::find (const key_type & const key_type &  key)
- + - + @@ -1714,12 +1639,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
An iterator to an element with the given key. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 744 of file dense_hash_map.hpp.

+

Definition at line 755 of file dense_map.hpp.

- -

◆ find() [3/4]

+ +

◆ find() [3/4]

@@ -1732,7 +1657,7 @@ template<typename Other >
const_iterator entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::find const_iterator entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::find (const key_type & const key_type &  key) const
- + @@ -1761,12 +1686,12 @@ template<typename Other >
Returns
An iterator to an element with the given key. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 758 of file dense_hash_map.hpp.

+

Definition at line 769 of file dense_map.hpp.

- -

◆ find() [4/4]

+ +

◆ find() [4/4]

@@ -1779,7 +1704,7 @@ template<typename Other >
std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator> > entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::find std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator> > entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::find ( const Other &  key) - + @@ -1802,12 +1727,12 @@ template<typename Other >
Returns
An iterator to an element with the given key. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 765 of file dense_hash_map.hpp.

+

Definition at line 776 of file dense_map.hpp.

- -

◆ get_allocator()

+ +

◆ get_allocator()

@@ -1818,7 +1743,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator> > entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::find std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator> > entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::find ( const Other &  key) - + @@ -1834,12 +1759,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the associated allocator.

Returns
The associated allocator.
-

Definition at line 452 of file dense_hash_map.hpp.

+

Definition at line 461 of file dense_map.hpp.

- -

◆ hash_function()

+ +

◆ hash_function()

@@ -1850,7 +1775,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
constexpr allocator_type entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::get_allocator constexpr allocator_type entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::get_allocator ( ) const - + @@ -1866,12 +1791,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the function used to hash the keys.

Returns
The function used to hash the keys.
-

Definition at line 939 of file dense_hash_map.hpp.

+

Definition at line 950 of file dense_map.hpp.

- -

◆ insert() [1/4]

+ +

◆ insert() [1/4]

@@ -1884,7 +1809,7 @@ template<typename Arg >
hasher entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::hash_function hasher entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::hash_function ( ) const - + @@ -1913,12 +1838,12 @@ template<typename Arg > -

Definition at line 547 of file dense_hash_map.hpp.

+

Definition at line 556 of file dense_map.hpp.

- -

◆ insert() [2/4]

+ +

◆ insert() [2/4]

@@ -1929,9 +1854,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
std::enable_if_t<std::is_constructible_v<value_type, Arg &&>, std::pair<iterator, bool> > entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::insert std::enable_if_t<std::is_constructible_v<value_type, Arg &&>, std::pair<iterator, bool> > entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::insert ( Arg &&  value) - + - + @@ -1952,12 +1877,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
-

Definition at line 532 of file dense_hash_map.hpp.

+

Definition at line 541 of file dense_map.hpp.

- -

◆ insert() [3/4]

+ +

◆ insert() [3/4]

@@ -1970,7 +1895,7 @@ template<typename It >
std::pair<iterator, bool> entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::insert std::pair<iterator, bool> entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::insert (const value_type & const value_type &  value)
- + @@ -2009,12 +1934,12 @@ template<typename It > -

Definition at line 558 of file dense_hash_map.hpp.

+

Definition at line 567 of file dense_map.hpp.

- -

◆ insert() [4/4]

+ +

◆ insert() [4/4]

@@ -2025,9 +1950,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
void entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::insert void entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::insert ( It  first, - + - + @@ -2048,12 +1973,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
-

Definition at line 537 of file dense_hash_map.hpp.

+

Definition at line 546 of file dense_map.hpp.

- -

◆ insert_or_assign() [1/2]

+ +

◆ insert_or_assign() [1/2]

@@ -2066,9 +1991,9 @@ template<typename Arg >
std::pair<iterator, bool> entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::insert std::pair<iterator, bool> entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::insert (value_type && value_type &&  value)
- + - + @@ -2106,12 +2031,12 @@ template<typename Arg >
Returns
A pair consisting of an iterator to the element and a bool denoting whether the insertion took place.
-

Definition at line 574 of file dense_hash_map.hpp.

+

Definition at line 583 of file dense_map.hpp.

- -

◆ insert_or_assign() [2/2]

+ +

◆ insert_or_assign() [2/2]

@@ -2124,9 +2049,9 @@ template<typename Arg >
std::pair<iterator, bool> entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::insert_or_assign std::pair<iterator, bool> entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::insert_or_assign (const key_type & const key_type &  key,
- + - + @@ -2164,12 +2089,12 @@ template<typename Arg >
Returns
A pair consisting of an iterator to the element and a bool denoting whether the insertion took place.
-

Definition at line 586 of file dense_hash_map.hpp.

+

Definition at line 589 of file dense_map.hpp.

- -

◆ key_eq()

+ +

◆ key_eq()

@@ -2180,7 +2105,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
std::pair<iterator, bool> entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::insert_or_assign std::pair<iterator, bool> entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::insert_or_assign (key_type && key_type &&  key,
- + @@ -2196,12 +2121,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the function used to compare keys for equality.

Returns
The function used to compare keys for equality.
-

Definition at line 947 of file dense_hash_map.hpp.

+

Definition at line 958 of file dense_map.hpp.

- -

◆ load_factor()

+ +

◆ load_factor()

@@ -2212,7 +2137,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
key_equal entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::key_eq key_equal entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::key_eq ( ) const - + @@ -2228,12 +2153,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the average number of elements per bucket.

Returns
The average number of elements per bucket.
-

Definition at line 883 of file dense_hash_map.hpp.

+

Definition at line 894 of file dense_map.hpp.

- -

◆ max_bucket_count()

+ +

◆ max_bucket_count()

@@ -2244,7 +2169,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
float entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::load_factor float entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::load_factor ( ) const - + @@ -2260,12 +2185,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the maximum number of buckets.

Returns
The maximum number of buckets.
-

Definition at line 857 of file dense_hash_map.hpp.

+

Definition at line 868 of file dense_map.hpp.

- -

◆ max_load_factor() [1/2]

+ +

◆ max_load_factor() [1/2]

@@ -2276,7 +2201,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
size_type entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::max_bucket_count size_type entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::max_bucket_count ( ) const - + @@ -2292,12 +2217,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the maximum average number of elements per bucket.

Returns
The maximum average number of elements per bucket.
-

Definition at line 891 of file dense_hash_map.hpp.

+

Definition at line 902 of file dense_map.hpp.

- -

◆ max_load_factor() [2/2]

+ +

◆ max_load_factor() [2/2]

@@ -2308,7 +2233,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
float entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::max_load_factor float entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::max_load_factor ( ) const - + @@ -2330,12 +2255,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 899 of file dense_hash_map.hpp.

+

Definition at line 910 of file dense_map.hpp.

- -

◆ operator=() [1/2]

+ +

◆ operator=() [1/2]

@@ -2346,35 +2271,27 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
+default
void entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::max_load_factor void entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::max_load_factor ( const float  value) - + - - + +
dense_hash_map& entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::operator= dense_map& entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::operator= (const dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > & other)const dense_map< Key, Type, Hash, KeyEqual, Allocator > & )
-inline
-

Copy assignment operator.

-
Parameters
- - -
otherThe instance to copy from.
-
-
+

Default copy assignment operator.

Returns
This container.
-

Definition at line 431 of file dense_hash_map.hpp.

-
- -

◆ operator=() [2/2]

+ +

◆ operator=() [2/2]

@@ -2385,10 +2302,10 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
- + - - + +
dense_hash_map& entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::operator= dense_map& entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::operator= (dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > && other)dense_map< Key, Type, Hash, KeyEqual, Allocator > && )
@@ -2400,18 +2317,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Default move assignment operator.

-
Parameters
- - -
otherThe instance to move from.
-
-
Returns
This container.
- -

◆ operator[]() [1/2]

+ +

◆ operator[]() [1/2]

@@ -2422,9 +2333,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
- + - + @@ -2445,12 +2356,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
A reference to the mapped value of the requested element.
-

Definition at line 720 of file dense_hash_map.hpp.

+

Definition at line 731 of file dense_map.hpp.

- -

◆ operator[]() [2/2]

+ +

◆ operator[]() [2/2]

@@ -2461,9 +2372,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Type& entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::operator[] mapped_type& entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::operator[] (const key_type & const key_type &  key)
- + - + @@ -2484,12 +2395,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Returns
A reference to the mapped value of the requested element.
-

Definition at line 729 of file dense_hash_map.hpp.

+

Definition at line 740 of file dense_map.hpp.

- -

◆ rehash()

+ +

◆ rehash()

@@ -2500,9 +2411,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
Type& entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::operator[] mapped_type& entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::operator[] (key_type && key_type &&  key)
- + - + @@ -2522,12 +2433,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 910 of file dense_hash_map.hpp.

+

Definition at line 921 of file dense_map.hpp.

- -

◆ reserve()

+ +

◆ reserve()

@@ -2538,9 +2449,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
void entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::rehash void entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::rehash (const size_type const size_type  count)
- + - + @@ -2560,12 +2471,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 930 of file dense_hash_map.hpp.

+

Definition at line 941 of file dense_map.hpp.

- -

◆ size()

+ +

◆ size()

@@ -2576,7 +2487,7 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
void entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::reserve void entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::reserve (const size_type const size_type  count)
- + @@ -2592,12 +2503,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t

Returns the number of elements in a container.

Returns
Number of elements in a container.
-

Definition at line 514 of file dense_hash_map.hpp.

+

Definition at line 523 of file dense_map.hpp.

- -

◆ swap()

+ +

◆ swap()

@@ -2608,9 +2519,9 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t
size_type entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::size size_type entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::size ( ) const - + - + @@ -2630,12 +2541,12 @@ template<typename Key , typename Type , typename Hash , typename KeyEqual , t -

Definition at line 690 of file dense_hash_map.hpp.

+

Definition at line 701 of file dense_map.hpp.

- -

◆ try_emplace() [1/2]

+ +

◆ try_emplace() [1/2]

@@ -2648,9 +2559,9 @@ template<typename... Args>
void entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::swap void entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::swap (dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > & dense_map< Key, Type, Hash, KeyEqual, Allocator > &  other)
- + - + @@ -2688,12 +2599,12 @@ template<typename... Args>
Returns
A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
-

Definition at line 631 of file dense_hash_map.hpp.

+

Definition at line 642 of file dense_map.hpp.

- -

◆ try_emplace() [2/2]

+ +

◆ try_emplace() [2/2]

@@ -2706,9 +2617,9 @@ template<typename... Args>
@@ -62,240 +62,238 @@ $(function() {
Public Types | Public Member Functions | -List of all members
+List of all members
-
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > Class Template Referencefinal
+
entt::dense_set< Type, Hash, KeyEqual, Allocator > Class Template Reference

Associative container for unique objects of a given type. - More...

+ More...

-

#include <dense_hash_set.hpp>

+

#include <dense_set.hpp>

std::pair<iterator, bool> entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::try_emplace std::pair<iterator, bool> entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::try_emplace (const key_type & const key_type &  key,
- + - + @@ -2746,12 +2657,12 @@ template<typename... Args>
Returns
A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
-

Definition at line 637 of file dense_hash_map.hpp.

+

Definition at line 648 of file dense_map.hpp.

The documentation for this class was generated from the following file: diff --git a/classentt_1_1dense__set-members.html b/classentt_1_1dense__set-members.html new file mode 100644 index 000000000..d0fe86362 --- /dev/null +++ b/classentt_1_1dense__set-members.html @@ -0,0 +1,144 @@ + + + + + + + +EnTT: Member List + + + + + + + + + +
+
+
std::pair<iterator, bool> entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >::try_emplace std::pair<iterator, bool> entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >::try_emplace (key_type && key_type &&  key,
+ + + + + +
+
EnTT +  3.10.0 +
+
+ + + + + + + + + +
+
+ + +
+ +
+ + + +
+
+
entt::dense_set< Type, Hash, KeyEqual, Allocator > Member List
+
+
+ +

This is the complete list of members for entt::dense_set< Type, Hash, KeyEqual, Allocator >, including all inherited members.

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
allocator_type typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
begin() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
begin()entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
begin(const size_type index)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
bucket(const value_type &value) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
bucket_count() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
bucket_size(const size_type index) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
cbegin() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
cbegin(const size_type index) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
cend() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
cend([[maybe_unused]] const size_type index) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
clear()entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
const_iterator typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
const_local_iterator typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
contains(const value_type &value) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
contains(const Other &value) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
dense_set()entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
dense_set(const allocator_type &allocator)entt::dense_set< Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_set(const size_type bucket_count, const allocator_type &allocator)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
dense_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
dense_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})entt::dense_set< Type, Hash, KeyEqual, Allocator >inlineexplicit
dense_set(const dense_set &)=defaultentt::dense_set< Type, Hash, KeyEqual, Allocator >
dense_set(const dense_set &other, const allocator_type &allocator)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
dense_set(dense_set &&)=defaultentt::dense_set< Type, Hash, KeyEqual, Allocator >
dense_set(dense_set &&other, const allocator_type &allocator)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
emplace(Args &&...args)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
empty() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
end() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
end()entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
end([[maybe_unused]] const size_type index)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator pos)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
erase(const_iterator first, const_iterator last)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
erase(const value_type &value)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
find(const value_type &value)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
find(const value_type &value) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
find(const Other &value)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
find(const Other &value) constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
get_allocator() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
hash_function() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
hasher typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
insert(const value_type &value)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
insert(value_type &&value)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
insert(It first, It last)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
iterator typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
key_eq() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
key_equal typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
key_type typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
load_factor() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
local_iterator typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
max_bucket_count() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
max_load_factor() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
max_load_factor(const float value)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
operator=(const dense_set &)=defaultentt::dense_set< Type, Hash, KeyEqual, Allocator >
operator=(dense_set &&)=defaultentt::dense_set< Type, Hash, KeyEqual, Allocator >
rehash(const size_type count)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
reserve(const size_type count)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
size() constentt::dense_set< Type, Hash, KeyEqual, Allocator >inline
size_type typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
swap(dense_set &other)entt::dense_set< Type, Hash, KeyEqual, Allocator >inline
value_type typedefentt::dense_set< Type, Hash, KeyEqual, Allocator >
+ +
+Generated by doxygen 1.9.1 +
+ + diff --git a/classentt_1_1dense__hash__set.html b/classentt_1_1dense__set.html similarity index 51% rename from classentt_1_1dense__hash__set.html rename to classentt_1_1dense__set.html index 45eb55b53..44916667d 100644 --- a/classentt_1_1dense__hash__set.html +++ b/classentt_1_1dense__set.html @@ -5,7 +5,7 @@ -EnTT: entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > Class Template Reference +EnTT: entt::dense_set< Type, Hash, KeyEqual, Allocator > Class Template Reference @@ -22,7 +22,7 @@
EnTT -  3.9.0 +  3.10.0
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Types

-using key_type = Type
 Key type of the container.
 
-using value_type = Type
 Value type of the container.
 
-using size_type = std::size_t
 Unsigned integer type.
 
-using hasher = Hash
 Type of function to use to hash the elements.
 
-using key_equal = KeyEqual
 Type of function to use to compare the elements for equality.
 
-using allocator_type = Allocator
 Allocator type.
 
-using iterator = internal::dense_hash_set_iterator< typename packed_container_type::pointer >
 Random access iterator type.
 
-using const_iterator = internal::dense_hash_set_iterator< typename packed_container_type::const_pointer >
 Constant random access iterator type.
 
-using local_iterator = internal::dense_hash_set_local_iterator< typename packed_container_type::pointer >
 Forward iterator type.
 
-using const_local_iterator = internal::dense_hash_set_local_iterator< typename packed_container_type::const_pointer >
 Constant forward iterator type.
 
+using key_type = Type
 Key type of the container.
 
+using value_type = Type
 Value type of the container.
 
+using size_type = std::size_t
 Unsigned integer type.
 
+using hasher = Hash
 Type of function to use to hash the elements.
 
+using key_equal = KeyEqual
 Type of function to use to compare the elements for equality.
 
+using allocator_type = Allocator
 Allocator type.
 
+using iterator = internal::dense_set_iterator< typename packed_container_type::iterator >
 Random access iterator type.
 
+using const_iterator = internal::dense_set_iterator< typename packed_container_type::const_iterator >
 Constant random access iterator type.
 
+using local_iterator = internal::dense_set_local_iterator< typename packed_container_type::iterator >
 Forward iterator type.
 
+using const_local_iterator = internal::dense_set_local_iterator< typename packed_container_type::const_iterator >
 Constant forward iterator type.
 
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

Public Member Functions

- dense_hash_set ()
 Default constructor.
 
 dense_hash_set (const allocator_type &allocator)
 Constructs an empty container with a given allocator. More...
 
 dense_hash_set (const size_type bucket_count, const allocator_type &allocator)
 Constructs an empty container with a given allocator and user supplied minimal number of buckets. More...
 
 dense_hash_set (const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
 Constructs an empty container with a given allocator, hash function and user supplied minimal number of buckets. More...
 
 dense_hash_set (const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())
 Constructs an empty container with a given allocator, hash function, compare function and user supplied minimal number of buckets. More...
 
 dense_hash_set (const dense_hash_set &other)
 Copy constructor. More...
 
 dense_hash_set (const dense_hash_set &other, const allocator_type &allocator)
 Allocator-extended copy constructor. More...
 
 dense_hash_set (dense_hash_set &&other)=default
 Default move constructor. More...
 
 dense_hash_set (dense_hash_set &&other, const allocator_type &allocator)
 Allocator-extended move constructor. More...
 
- ~dense_hash_set ()=default
 Default destructor.
 
dense_hash_set & operator= (const dense_hash_set &other)
 Copy assignment operator. More...
 
dense_hash_set & operator= (dense_hash_set &&other)=default
 Default move assignment operator. More...
 
constexpr allocator_type get_allocator () const
 Returns the associated allocator. More...
 
const_iterator cbegin () const
 Returns an iterator to the beginning. More...
 
const_iterator begin () const
 Returns an iterator to the beginning. More...
 
iterator begin ()
 Returns an iterator to the beginning. More...
 
const_iterator cend () const
 Returns an iterator to the end. More...
 
const_iterator end () const
 Returns an iterator to the end. More...
 
iterator end ()
 Returns an iterator to the end. More...
 
bool empty () const
 Checks whether a container is empty. More...
 
size_type size () const
 Returns the number of elements in a container. More...
 
-void clear ()
 Clears the container.
 
std::pair< iterator, bool > insert (const value_type &value)
 Inserts an element into the container, if it does not exist. More...
 
std::pair< iterator, bool > insert (value_type &&value)
 Inserts an element into the container, if it does not exist. More...
 
template<typename It >
void insert (It first, It last)
 Inserts elements into the container, if they do not exist. More...
 
template<typename... Args>
std::pair< iterator, bool > emplace (Args &&...args)
 Constructs an element in-place, if it does not exist. More...
 
iterator erase (const_iterator pos)
 Removes an element from a given position. More...
 
iterator erase (const_iterator first, const_iterator last)
 Removes the given elements from a container. More...
 
size_type erase (const value_type &value)
 Removes the element associated with a given value. More...
 
void swap (dense_hash_set &other)
 Exchanges the contents with those of a given container. More...
 
iterator find (const value_type &value)
 Finds an element with a given value. More...
 
const_iterator find (const value_type &value) const
 Finds an element with a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find (const Other &value)
 Finds an element that compares equivalent to a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find (const Other &value) const
 Finds an element with a given value. More...
 
bool contains (const value_type &value) const
 Checks if the container contains an element with a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains (const Other &value) const
 Checks if the container contains an element that compares equivalent to a given value. More...
 
const_local_iterator cbegin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator begin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
local_iterator begin (const size_type index)
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator cend ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
const_local_iterator end ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
local_iterator end ([[maybe_unused]] const size_type index)
 Returns an iterator to the end of a given bucket. More...
 
size_type bucket_count () const
 Returns the number of buckets. More...
 
size_type max_bucket_count () const
 Returns the maximum number of buckets. More...
 
size_type bucket_size (const size_type index) const
 Returns the number of elements in a given bucket. More...
 
size_type bucket (const value_type &value) const
 Returns the bucket for a given element. More...
 
float load_factor () const
 Returns the average number of elements per bucket. More...
 
float max_load_factor () const
 Returns the maximum average number of elements per bucket. More...
 
void max_load_factor (const float value)
 Sets the desired maximum average number of elements per bucket. More...
 
void rehash (const size_type count)
 Reserves at least the specified number of buckets and regenerates the hash table. More...
 
void reserve (const size_type count)
 Reserves space for at least the specified number of elements and regenerates the hash table. More...
 
hasher hash_function () const
 Returns the function used to hash the elements. More...
 
key_equal key_eq () const
 Returns the function used to compare elements for equality. More...
 
+ dense_set ()
 Default constructor.
 
 dense_set (const allocator_type &allocator)
 Constructs an empty container with a given allocator. More...
 
 dense_set (const size_type bucket_count, const allocator_type &allocator)
 Constructs an empty container with a given allocator and user supplied minimal number of buckets. More...
 
 dense_set (const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
 Constructs an empty container with a given allocator, hash function and user supplied minimal number of buckets. More...
 
 dense_set (const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})
 Constructs an empty container with a given allocator, hash function, compare function and user supplied minimal number of buckets. More...
 
+ dense_set (const dense_set &)=default
 Default copy constructor.
 
 dense_set (const dense_set &other, const allocator_type &allocator)
 Allocator-extended copy constructor. More...
 
+ dense_set (dense_set &&)=default
 Default move constructor.
 
 dense_set (dense_set &&other, const allocator_type &allocator)
 Allocator-extended move constructor. More...
 
dense_set & operator= (const dense_set &)=default
 Default copy assignment operator. More...
 
dense_set & operator= (dense_set &&)=default
 Default move assignment operator. More...
 
constexpr allocator_type get_allocator () const
 Returns the associated allocator. More...
 
const_iterator cbegin () const
 Returns an iterator to the beginning. More...
 
const_iterator begin () const
 Returns an iterator to the beginning. More...
 
iterator begin ()
 Returns an iterator to the beginning. More...
 
const_iterator cend () const
 Returns an iterator to the end. More...
 
const_iterator end () const
 Returns an iterator to the end. More...
 
iterator end ()
 Returns an iterator to the end. More...
 
bool empty () const
 Checks whether a container is empty. More...
 
size_type size () const
 Returns the number of elements in a container. More...
 
+void clear ()
 Clears the container.
 
std::pair< iterator, bool > insert (const value_type &value)
 Inserts an element into the container, if it does not exist. More...
 
std::pair< iterator, bool > insert (value_type &&value)
 Inserts an element into the container, if it does not exist. More...
 
template<typename It >
void insert (It first, It last)
 Inserts elements into the container, if they do not exist. More...
 
template<typename... Args>
std::pair< iterator, bool > emplace (Args &&...args)
 Constructs an element in-place, if it does not exist. More...
 
iterator erase (const_iterator pos)
 Removes an element from a given position. More...
 
iterator erase (const_iterator first, const_iterator last)
 Removes the given elements from a container. More...
 
size_type erase (const value_type &value)
 Removes the element associated with a given value. More...
 
void swap (dense_set &other)
 Exchanges the contents with those of a given container. More...
 
iterator find (const value_type &value)
 Finds an element with a given value. More...
 
const_iterator find (const value_type &value) const
 Finds an element with a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find (const Other &value)
 Finds an element that compares equivalent to a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find (const Other &value) const
 Finds an element with a given value. More...
 
bool contains (const value_type &value) const
 Checks if the container contains an element with a given value. More...
 
template<typename Other >
std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains (const Other &value) const
 Checks if the container contains an element that compares equivalent to a given value. More...
 
const_local_iterator cbegin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator begin (const size_type index) const
 Returns an iterator to the beginning of a given bucket. More...
 
local_iterator begin (const size_type index)
 Returns an iterator to the beginning of a given bucket. More...
 
const_local_iterator cend ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
const_local_iterator end ([[maybe_unused]] const size_type index) const
 Returns an iterator to the end of a given bucket. More...
 
local_iterator end ([[maybe_unused]] const size_type index)
 Returns an iterator to the end of a given bucket. More...
 
size_type bucket_count () const
 Returns the number of buckets. More...
 
size_type max_bucket_count () const
 Returns the maximum number of buckets. More...
 
size_type bucket_size (const size_type index) const
 Returns the number of elements in a given bucket. More...
 
size_type bucket (const value_type &value) const
 Returns the bucket for a given element. More...
 
float load_factor () const
 Returns the average number of elements per bucket. More...
 
float max_load_factor () const
 Returns the maximum average number of elements per bucket. More...
 
void max_load_factor (const float value)
 Sets the desired maximum average number of elements per bucket. More...
 
void rehash (const size_type count)
 Reserves at least the specified number of buckets and regenerates the hash table. More...
 
void reserve (const size_type count)
 Reserves space for at least the specified number of elements and regenerates the hash table. More...
 
hasher hash_function () const
 Returns the function used to hash the elements. More...
 
key_equal key_eq () const
 Returns the function used to compare elements for equality. More...
 

Detailed Description

template<typename Type, typename Hash, typename KeyEqual, typename Allocator>
-class entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >

+class entt::dense_set< Type, Hash, KeyEqual, Allocator >

Associative container for unique objects of a given type.

Internally, elements are organized into buckets. Which bucket an element is placed into depends entirely on its hash. Elements with the same hash code appear in the same bucket.

@@ -309,10 +307,10 @@ class entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -

Definition at line 239 of file dense_hash_set.hpp.

+

Definition at line 229 of file dense_set.hpp.

Constructor & Destructor Documentation

- -

◆ dense_hash_set() [1/8]

+ +

◆ dense_set() [1/6]

@@ -323,9 +321,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
- + - + @@ -345,12 +343,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

Definition at line 355 of file dense_hash_set.hpp.

+

Definition at line 328 of file dense_set.hpp.

- -

◆ dense_hash_set() [2/8]

+ +

◆ dense_set() [2/6]

@@ -361,15 +359,15 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set entt::dense_set< Type, Hash, KeyEqual, Allocator >::dense_set (const allocator_type & const allocator_type &  allocator)
- + - + - + @@ -394,12 +392,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

Definition at line 364 of file dense_hash_set.hpp.

+

Definition at line 337 of file dense_set.hpp.

- -

◆ dense_hash_set() [3/8]

+ +

◆ dense_set() [3/6]

@@ -410,21 +408,21 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set entt::dense_set< Type, Hash, KeyEqual, Allocator >::dense_set (const size_type const size_type  bucket_count,
const allocator_type & const allocator_type &  allocator 
- + - + - + - + @@ -450,12 +448,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

Definition at line 374 of file dense_hash_set.hpp.

+

Definition at line 347 of file dense_set.hpp.

- -

◆ dense_hash_set() [4/8]

+ +

◆ dense_set() [4/6]

@@ -466,28 +464,28 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set entt::dense_set< Type, Hash, KeyEqual, Allocator >::dense_set (const size_type const size_type  bucket_count,
const hasher & const hasher &  hash,
const allocator_type & const allocator_type &  allocator 
- + - + - - + + - - + + - - + + @@ -513,12 +511,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

Definition at line 385 of file dense_hash_set.hpp.

+

Definition at line 358 of file dense_set.hpp.

- -

◆ dense_hash_set() [5/8]

+ +

◆ dense_set() [5/6]

@@ -529,53 +527,15 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
- - -
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set entt::dense_set< Type, Hash, KeyEqual, Allocator >::dense_set (const size_type const size_type  bucket_count,
const hasher & hash = hasher{}, const hasher & hash = hasher{},
const key_equal & equal = key_equal{}, const key_equal & equal = key_equal{},
const allocator_type & allocator = allocator_type() const allocator_type & allocator = allocator_type{} 
- + - - - - -
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set entt::dense_set< Type, Hash, KeyEqual, Allocator >::dense_set (const dense_hash_set< Type, Hash, KeyEqual, Allocator > & other)
- 		-inline
-
- -

Copy constructor.

-
Parameters
- - -
otherThe instance to copy from.
-
-
- -

Definition at line 396 of file dense_hash_set.hpp.

- -
- - -

◆ dense_hash_set() [6/8]

- -
-
-
-template<typename Type , typename Hash , typename KeyEqual , typename Allocator >
- - -
- - - - - + - + @@ -600,12 +560,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

Definition at line 404 of file dense_hash_set.hpp.

+

Definition at line 373 of file dense_set.hpp.

- -

◆ dense_hash_set() [7/8]

+ +

◆ dense_set() [6/6]

@@ -616,51 +576,15 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
- - -
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set (const dense_hash_set< Type, Hash, KeyEqual, Allocator > & const dense_set< Type, Hash, KeyEqual, Allocator > &  other,
const allocator_type & const allocator_type &  allocator 
- + - - - - -
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set entt::dense_set< Type, Hash, KeyEqual, Allocator >::dense_set (dense_hash_set< Type, Hash, KeyEqual, Allocator > && other)
- 		-default
-
- -

Default move constructor.

-
Parameters
- - -
otherThe instance to move from.
-
-
- -
- - -

◆ dense_hash_set() [8/8]

- -
-
-
-template<typename Type , typename Hash , typename KeyEqual , typename Allocator >
- - -
- - - - - + - + @@ -685,13 +609,13 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

Definition at line 422 of file dense_hash_set.hpp.

+

Definition at line 386 of file dense_set.hpp.

Member Function Documentation

- -

◆ begin() [1/4]

+ +

◆ begin() [1/4]

@@ -702,7 +626,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::dense_hash_set (dense_hash_set< Type, Hash, KeyEqual, Allocator > && dense_set< Type, Hash, KeyEqual, Allocator > &&  other,
const allocator_type & const allocator_type &  allocator 
- + @@ -716,15 +640,15 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

Returns an iterator to the beginning.

-

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

+

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 479 of file dense_hash_set.hpp.

+

Definition at line 429 of file dense_set.hpp.

- -

◆ begin() [2/4]

+ +

◆ begin() [2/4]

@@ -735,7 +659,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::begin iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::begin ( ) - + @@ -749,15 +673,15 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

Returns an iterator to the beginning.

-

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

+

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 474 of file dense_hash_set.hpp.

+

Definition at line 424 of file dense_set.hpp.

- -

◆ begin() [3/4]

+ +

◆ begin() [3/4]

@@ -768,9 +692,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
const_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::begin const_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::begin ( ) const - + - + @@ -791,12 +715,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to the beginning of the given bucket.
-

Definition at line 704 of file dense_hash_set.hpp.

+

Definition at line 678 of file dense_set.hpp.

- -

◆ begin() [4/4]

+ +

◆ begin() [4/4]

@@ -807,9 +731,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
local_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::begin local_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::begin (const size_type const size_type  index)
- + - + @@ -830,12 +754,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to the beginning of the given bucket.
-

Definition at line 695 of file dense_hash_set.hpp.

+

Definition at line 669 of file dense_set.hpp.

- -

◆ bucket()

+ +

◆ bucket()

@@ -846,9 +770,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
const_local_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::begin const_local_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::begin (const size_type const size_type  index) const
- + - + @@ -869,12 +793,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
The bucket for the given element.
-

Definition at line 765 of file dense_hash_set.hpp.

+

Definition at line 739 of file dense_set.hpp.

- -

◆ bucket_count()

+ +

◆ bucket_count()

@@ -885,7 +809,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
size_type entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::bucket size_type entt::dense_set< Type, Hash, KeyEqual, Allocator >::bucket (const value_type & const value_type &  value) const
- + @@ -901,12 +825,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

Returns the number of buckets.

Returns
The number of buckets.
-

Definition at line 739 of file dense_hash_set.hpp.

+

Definition at line 713 of file dense_set.hpp.

- -

◆ bucket_size()

+ +

◆ bucket_size()

@@ -917,9 +841,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
size_type entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::bucket_count size_type entt::dense_set< Type, Hash, KeyEqual, Allocator >::bucket_count ( ) const - + - + @@ -940,12 +864,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
The number of elements in the given bucket.
-

Definition at line 756 of file dense_hash_set.hpp.

+

Definition at line 730 of file dense_set.hpp.

- -

◆ cbegin() [1/2]

+ +

◆ cbegin() [1/2]

@@ -956,7 +880,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
size_type entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::bucket_size size_type entt::dense_set< Type, Hash, KeyEqual, Allocator >::bucket_size (const size_type const size_type  index) const
- + @@ -970,15 +894,15 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

Returns an iterator to the beginning.

-

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

+

The returned iterator points to the first instance of the internal array. If the array is empty, the returned iterator will be equal to end().

Returns
An iterator to the first instance of the internal array.
-

Definition at line 469 of file dense_hash_set.hpp.

+

Definition at line 419 of file dense_set.hpp.

- -

◆ cbegin() [2/2]

+ +

◆ cbegin() [2/2]

@@ -989,9 +913,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
const_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::cbegin const_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::cbegin ( ) const - + - + @@ -1012,12 +936,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to the beginning of the given bucket.
-

Definition at line 686 of file dense_hash_set.hpp.

+

Definition at line 660 of file dense_set.hpp.

- -

◆ cend() [1/2]

+ +

◆ cend() [1/2]

@@ -1028,7 +952,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
const_local_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::cbegin const_local_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::cbegin (const size_type const size_type  index) const
- + @@ -1045,12 +969,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 493 of file dense_hash_set.hpp.

+

Definition at line 443 of file dense_set.hpp.

- -

◆ cend() [2/2]

+ +

◆ cend() [2/2]

@@ -1061,9 +985,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
const_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::cend const_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::cend ( ) const - + - + @@ -1084,12 +1008,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to the end of the given bucket.
-

Definition at line 713 of file dense_hash_set.hpp.

+

Definition at line 687 of file dense_set.hpp.

- -

◆ contains() [1/2]

+ +

◆ contains() [1/2]

@@ -1102,7 +1026,7 @@ template<typename Other >
const_local_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::cend const_local_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::cend ([[maybe_unused] ] const size_type [[maybe_unused] ] const size_type  index) const
- + @@ -1131,12 +1055,12 @@ template<typename Other >
Returns
True if there is such an element, false otherwise.
-

Definition at line 677 of file dense_hash_set.hpp.

+

Definition at line 651 of file dense_set.hpp.

- -

◆ contains() [2/2]

+ +

◆ contains() [2/2]

@@ -1147,9 +1071,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -77,10 +77,10 @@ $(function() {
5 
6 namespace entt {
7 
-
9 template<template<typename...> typename>
+
9 template<template<typename...> class>
10 struct meta_class_template_tag {};
11 
-
17 template<template<typename...> typename Clazz, typename... Args>
+
17 template<template<typename...> class Clazz, typename... Args>
18 struct meta_template_traits<Clazz<Args...>> {
20  using class_type = meta_class_template_tag<Clazz>;
22  using args_type = type_list<Args...>;
@@ -89,7 +89,7 @@ $(function() {
25 } // namespace entt
26 
27 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::meta_class_template_tag
Utility class to disambiguate class templates.
Definition: template.hpp:10
entt::meta_template_traits
Traits class template to be specialized to enable support for meta template information.
Definition: type_traits.hpp:14
entt::type_list
A class to use to push around lists of types, nothing more.
Definition: type_traits.hpp:110
diff --git a/tuple_8hpp_source.html b/tuple_8hpp_source.html index f14be2c27..88a3ae8b9 100644 --- a/tuple_8hpp_source.html +++ b/tuple_8hpp_source.html @@ -22,7 +22,7 @@ @@ -92,7 +92,7 @@ $(function() {
27 } // namespace entt
28 
29 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::unwrap_tuple
constexpr decltype(auto) unwrap_tuple(Type &&value)
Utility function to unwrap tuples of a single element.
Definition: tuple.hpp:19
diff --git a/type__info_8hpp_source.html b/type__info_8hpp_source.html index 25541fc87..3381dfb22 100644 --- a/type__info_8hpp_source.html +++ b/type__info_8hpp_source.html @@ -22,7 +22,7 @@ @@ -172,26 +172,22 @@ $(function() {
137  }
138 };
139 
-
141 class type_info final {
-
142  template<typename Type>
-
143  friend const type_info &type_id() ENTT_NOEXCEPT;
-
144 
-
145  template<typename Type>
-
146  constexpr type_info(std::in_place_type_t<Type>) ENTT_NOEXCEPT
-
147  : seq{type_index<std::remove_reference_t<std::remove_const_t<Type>>>::value()},
-
148  identifier{type_hash<std::remove_reference_t<std::remove_const_t<Type>>>::value()},
-
149  alias{type_name<std::remove_reference_t<std::remove_const_t<Type>>>::value()} {}
-
150 
-
151 public:
-
156  [[nodiscard]] constexpr id_type index() const ENTT_NOEXCEPT {
+
141 struct type_info final {
+
146  template<typename Type>
+
147  constexpr type_info(std::in_place_type_t<Type>) ENTT_NOEXCEPT
+
148  : seq{type_index<std::remove_cv_t<std::remove_reference_t<Type>>>::value()},
+
149  identifier{type_hash<std::remove_cv_t<std::remove_reference_t<Type>>>::value()},
+
150  alias{type_name<std::remove_cv_t<std::remove_reference_t<Type>>>::value()} {}
+
151 
+
156  [[nodiscard]] constexpr id_type index() const ENTT_NOEXCEPT {
157  return seq;
158  }
159 
-
164  [[nodiscard]] constexpr id_type hash() const ENTT_NOEXCEPT {
+
164  [[nodiscard]] constexpr id_type hash() const ENTT_NOEXCEPT {
165  return identifier;
166  }
167 
-
172  [[nodiscard]] constexpr std::string_view name() const ENTT_NOEXCEPT {
+
172  [[nodiscard]] constexpr std::string_view name() const ENTT_NOEXCEPT {
173  return alias;
174  }
175 
@@ -201,62 +197,68 @@ $(function() {
179  std::string_view alias;
180 };
181 
-
188 [[nodiscard]] inline constexpr bool operator==(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
+
188 [[nodiscard]] inline constexpr bool operator==(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
189  return lhs.hash() == rhs.hash();
190 }
191 
-
198 [[nodiscard]] inline constexpr bool operator!=(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
+
198 [[nodiscard]] inline constexpr bool operator!=(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
199  return !(lhs == rhs);
200 }
201 
-
208 [[nodiscard]] constexpr bool operator<(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
+
208 [[nodiscard]] constexpr bool operator<(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
209  return lhs.index() < rhs.index();
210 }
211 
-
219 [[nodiscard]] constexpr bool operator<=(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
+
219 [[nodiscard]] constexpr bool operator<=(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
220  return !(rhs < lhs);
221 }
222 
-
230 [[nodiscard]] constexpr bool operator>(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
+
230 [[nodiscard]] constexpr bool operator>(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
231  return rhs < lhs;
232 }
233 
-
241 [[nodiscard]] constexpr bool operator>=(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
+
241 [[nodiscard]] constexpr bool operator>=(const type_info &lhs, const type_info &rhs) ENTT_NOEXCEPT {
242  return !(lhs < rhs);
243 }
244 
-
255 template<typename Type>
-
256 [[nodiscard]] const type_info &type_id() ENTT_NOEXCEPT {
-
257  if constexpr(std::is_same_v<Type, std::remove_cv_t<std::remove_reference_t<Type>>>) {
-
258  static type_info instance{std::in_place_type<std::remove_cv_t<std::remove_reference_t<Type>>>};
-
259  return instance;
-
260  } else {
-
261  return type_id<std::remove_cv_t<std::remove_reference_t<Type>>>();
-
262  }
-
263 }
-
264 
-
265 } // namespace entt
-
266 
-
267 #endif
-
entt::basic_hashed_string::value
constexpr hash_type value() const
Returns the numeric representation of a hashed string.
Definition: hashed_string.hpp:174
+
256 template<typename Type>
+
257 [[nodiscard]] const type_info &type_id() ENTT_NOEXCEPT {
+
258  if constexpr(std::is_same_v<Type, std::remove_cv_t<std::remove_reference_t<Type>>>) {
+
259  static type_info instance{std::in_place_type<Type>};
+
260  return instance;
+
261  } else {
+
262  return type_id<std::remove_cv_t<std::remove_reference_t<Type>>>();
+
263  }
+
264 }
+
265 
+
267 template<typename Type>
+
268 [[nodiscard]] const type_info &type_id(Type &&) ENTT_NOEXCEPT {
+
269  return type_id<std::remove_cv_t<std::remove_reference_t<Type>>>();
+
270 }
+
271 
+
272 } // namespace entt
+
273 
+
274 #endif
+
entt::basic_hashed_string::value
constexpr hash_type value() const
Returns the numeric representation of a hashed string.
Definition: hashed_string.hpp:192
entt::identifier
Types identifiers.
Definition: ident.hpp:41
-
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
-
entt::type_info::name
constexpr std::string_view name() const
Type name.
Definition: type_info.hpp:172
-
entt::type_info::hash
constexpr id_type hash() const
Type hash.
Definition: type_info.hpp:164
-
entt::type_info::index
constexpr id_type index() const
Type index.
Definition: type_info.hpp:156
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:217
-
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:13
-
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:256
-
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:254
-
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:280
-
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:241
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
-
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:267
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
+
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:14
+
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:257
+
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:273
+
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:299
+
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:260
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:286
entt::type_hash
Type hash.
Definition: type_info.hpp:100
entt::type_hash::value
static constexpr id_type value()
Returns the numeric representation of a given type.
Definition: type_info.hpp:109
entt::type_index
Type sequential identifier.
Definition: type_info.hpp:79
entt::type_index::value
static id_type value()
Returns the sequential identifier of a given type.
Definition: type_info.hpp:84
+
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
+
entt::type_info::name
constexpr std::string_view name() const
Type name.
Definition: type_info.hpp:172
+
entt::type_info::hash
constexpr id_type hash() const
Type hash.
Definition: type_info.hpp:164
+
entt::type_info::type_info
constexpr type_info(std::in_place_type_t< Type >)
Constructs a type info object for a given type.
Definition: type_info.hpp:147
+
entt::type_info::index
constexpr id_type index() const
Type index.
Definition: type_info.hpp:156
entt::type_name
Type name.
Definition: type_info.hpp:125
entt::type_name::value
static constexpr std::string_view value()
Returns the name of a given type.
Definition: type_info.hpp:130
diff --git a/version_8h_source.html b/version_8h_source.html index 18c27e8dd..8f72af19c 100644 --- a/version_8h_source.html +++ b/version_8h_source.html @@ -22,7 +22,7 @@ @@ -73,11 +73,17 @@ $(function() {
1 #ifndef ENTT_CONFIG_VERSION_H
2 #define ENTT_CONFIG_VERSION_H
3 
-
4 #define ENTT_VERSION_MAJOR 3
-
5 #define ENTT_VERSION_MINOR 9
-
6 #define ENTT_VERSION_PATCH 0
-
7 
-
8 #endif
+
4 #include "macro.h"
+
5 
+
6 #define ENTT_VERSION_MAJOR 3
+
7 #define ENTT_VERSION_MINOR 10
+
8 #define ENTT_VERSION_PATCH 0
+
9 
+
10 #define ENTT_VERSION \
+
11  ENTT_XSTR(ENTT_VERSION_MAJOR) \
+
12  "." ENTT_XSTR(ENTT_VERSION_MINOR) "." ENTT_XSTR(ENTT_VERSION_PATCH)
+
13 
+
14 #endif
diff --git a/view_8hpp_source.html b/view_8hpp_source.html index b843756be..7a09e5bde 100644 --- a/view_8hpp_source.html +++ b/view_8hpp_source.html @@ -22,7 +22,7 @@
@@ -95,528 +95,520 @@ $(function() {
28 
29 template<typename Type, std::size_t Component, std::size_t Exclude>
30 class view_iterator final {
-
31  [[nodiscard]] bool valid() const {
-
32  return ((Component != 0u) || (*it != tombstone))
-
33  && std::apply([entt = *it](const auto *...curr) { return (curr->contains(entt) && ...); }, pools)
-
34  && std::apply([entt = *it](const auto *...curr) { return (!curr->contains(entt) && ...); }, filter);
-
35  }
-
36 
-
37 public:
-
38  using iterator_type = typename Type::iterator;
-
39  using difference_type = typename std::iterator_traits<iterator_type>::difference_type;
-
40  using value_type = typename std::iterator_traits<iterator_type>::value_type;
-
41  using pointer = typename std::iterator_traits<iterator_type>::pointer;
-
42  using reference = typename std::iterator_traits<iterator_type>::reference;
-
43  using iterator_category = std::forward_iterator_tag;
-
44 
-
45  view_iterator() ENTT_NOEXCEPT
-
46  : it{},
-
47  last{},
-
48  pools{},
-
49  filter{} {}
-
50 
-
51  view_iterator(iterator_type curr, iterator_type to, std::array<const Type *, Component> all_of, std::array<const Type *, Exclude> none_of) ENTT_NOEXCEPT
-
52  : it{curr},
-
53  last{to},
-
54  pools{all_of},
-
55  filter{none_of} {
-
56  if(it != last && !valid()) {
-
57  ++(*this);
-
58  }
-
59  }
-
60 
-
61  view_iterator &operator++() ENTT_NOEXCEPT {
-
62  while(++it != last && !valid()) {}
-
63  return *this;
-
64  }
-
65 
-
66  view_iterator operator++(int) ENTT_NOEXCEPT {
-
67  view_iterator orig = *this;
-
68  return ++(*this), orig;
-
69  }
-
70 
-
71  [[nodiscard]] pointer operator->() const {
-
72  return &*it;
-
73  }
-
74 
-
75  [[nodiscard]] reference operator*() const {
-
76  return *operator->();
-
77  }
+
31  using iterator_type = typename Type::const_iterator;
+
32 
+
33  [[nodiscard]] bool valid() const ENTT_NOEXCEPT {
+
34  return ((Component != 0u) || (*it != tombstone))
+
35  && std::apply([entt = *it](const auto *...curr) { return (curr->contains(entt) && ...); }, pools)
+
36  && std::apply([entt = *it](const auto *...curr) { return (!curr->contains(entt) && ...); }, filter);
+
37  }
+
38 
+
39 public:
+
40  using value_type = typename iterator_type::value_type;
+
41  using pointer = typename iterator_type::pointer;
+
42  using reference = typename iterator_type::reference;
+
43  using difference_type = typename iterator_type::difference_type;
+
44  using iterator_category = std::forward_iterator_tag;
+
45 
+
46  view_iterator() ENTT_NOEXCEPT = default;
+
47 
+
48  view_iterator(iterator_type curr, iterator_type to, std::array<const Type *, Component> all_of, std::array<const Type *, Exclude> none_of) ENTT_NOEXCEPT
+
49  : it{curr},
+
50  last{to},
+
51  pools{all_of},
+
52  filter{none_of} {
+
53  if(it != last && !valid()) {
+
54  ++(*this);
+
55  }
+
56  }
+
57 
+
58  view_iterator &operator++() ENTT_NOEXCEPT {
+
59  while(++it != last && !valid()) {}
+
60  return *this;
+
61  }
+
62 
+
63  view_iterator operator++(int) ENTT_NOEXCEPT {
+
64  view_iterator orig = *this;
+
65  return ++(*this), orig;
+
66  }
+
67 
+
68  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
69  return &*it;
+
70  }
+
71 
+
72  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
73  return *operator->();
+
74  }
+
75 
+
76  template<typename LhsType, auto... LhsArgs, typename RhsType, auto... RhsArgs>
+
77  friend bool operator==(const view_iterator<LhsType, LhsArgs...> &, const view_iterator<RhsType, RhsArgs...> &) ENTT_NOEXCEPT;
78 
-
79  template<typename LhsType, auto... LhsArgs, typename RhsType, auto... RhsArgs>
-
80  friend bool operator==(const view_iterator<LhsType, LhsArgs...> &, const view_iterator<RhsType, RhsArgs...> &) ENTT_NOEXCEPT;
-
81 
-
82 private:
-
83  iterator_type it;
-
84  iterator_type last;
-
85  std::array<const Type *, Component> pools;
-
86  std::array<const Type *, Exclude> filter;
-
87 };
-
88 
-
89 template<typename LhsType, auto... LhsArgs, typename RhsType, auto... RhsArgs>
-
90 [[nodiscard]] bool operator==(const view_iterator<LhsType, LhsArgs...> &lhs, const view_iterator<RhsType, RhsArgs...> &rhs) ENTT_NOEXCEPT {
-
91  return lhs.it == rhs.it;
-
92 }
-
93 
-
94 template<typename LhsType, auto... LhsArgs, typename RhsType, auto... RhsArgs>
-
95 [[nodiscard]] bool operator!=(const view_iterator<LhsType, LhsArgs...> &lhs, const view_iterator<RhsType, RhsArgs...> &rhs) ENTT_NOEXCEPT {
-
96  return !(lhs == rhs);
-
97 }
-
98 
-
99 template<typename It, typename... Storage>
-
100 struct extended_view_iterator final {
-
101  using difference_type = std::ptrdiff_t;
-
102  using value_type = decltype(std::tuple_cat(std::make_tuple(*std::declval<It>()), std::declval<Storage>().get_as_tuple({})...));
-
103  using pointer = input_iterator_pointer<value_type>;
-
104  using reference = value_type;
-
105  using iterator_category = std::input_iterator_tag;
-
106 
-
107  extended_view_iterator() = default;
-
108 
-
109  extended_view_iterator(It from, std::tuple<Storage *...> storage) ENTT_NOEXCEPT
-
110  : it{from},
-
111  pools{storage} {}
-
112 
-
113  extended_view_iterator &operator++() ENTT_NOEXCEPT {
-
114  return ++it, *this;
-
115  }
-
116 
-
117  extended_view_iterator operator++(int) ENTT_NOEXCEPT {
-
118  extended_view_iterator orig = *this;
-
119  return ++(*this), orig;
-
120  }
-
121 
-
122  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
-
123  return std::apply([entt = *it](auto *...curr) { return std::tuple_cat(std::make_tuple(entt), curr->get_as_tuple(entt)...); }, pools);
-
124  }
-
125 
-
126  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
-
127  return operator*();
-
128  }
+
79 private:
+
80  iterator_type it;
+
81  iterator_type last;
+
82  std::array<const Type *, Component> pools;
+
83  std::array<const Type *, Exclude> filter;
+
84 };
+
85 
+
86 template<typename LhsType, auto... LhsArgs, typename RhsType, auto... RhsArgs>
+
87 [[nodiscard]] bool operator==(const view_iterator<LhsType, LhsArgs...> &lhs, const view_iterator<RhsType, RhsArgs...> &rhs) ENTT_NOEXCEPT {
+
88  return lhs.it == rhs.it;
+
89 }
+
90 
+
91 template<typename LhsType, auto... LhsArgs, typename RhsType, auto... RhsArgs>
+
92 [[nodiscard]] bool operator!=(const view_iterator<LhsType, LhsArgs...> &lhs, const view_iterator<RhsType, RhsArgs...> &rhs) ENTT_NOEXCEPT {
+
93  return !(lhs == rhs);
+
94 }
+
95 
+
96 template<typename It, typename... Storage>
+
97 struct extended_view_iterator final {
+
98  using difference_type = std::ptrdiff_t;
+
99  using value_type = decltype(std::tuple_cat(std::make_tuple(*std::declval<It>()), std::declval<Storage>().get_as_tuple({})...));
+
100  using pointer = input_iterator_pointer<value_type>;
+
101  using reference = value_type;
+
102  using iterator_category = std::input_iterator_tag;
+
103 
+
104  extended_view_iterator() = default;
+
105 
+
106  extended_view_iterator(It from, std::tuple<Storage *...> storage)
+
107  : it{from},
+
108  pools{storage} {}
+
109 
+
110  extended_view_iterator &operator++() ENTT_NOEXCEPT {
+
111  return ++it, *this;
+
112  }
+
113 
+
114  extended_view_iterator operator++(int) ENTT_NOEXCEPT {
+
115  extended_view_iterator orig = *this;
+
116  return ++(*this), orig;
+
117  }
+
118 
+
119  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
120  return std::apply([entt = *it](auto *...curr) { return std::tuple_cat(std::make_tuple(entt), curr->get_as_tuple(entt)...); }, pools);
+
121  }
+
122 
+
123  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
124  return operator*();
+
125  }
+
126 
+
127  template<typename... Lhs, typename... Rhs>
+
128  friend bool operator==(const extended_view_iterator<Lhs...> &, const extended_view_iterator<Rhs...> &) ENTT_NOEXCEPT;
129 
-
130  template<typename... Lhs, typename... Rhs>
-
131  friend bool operator==(const extended_view_iterator<Lhs...> &, const extended_view_iterator<Rhs...> &) ENTT_NOEXCEPT;
-
132 
-
133 private:
-
134  It it;
-
135  std::tuple<Storage *...> pools;
-
136 };
-
137 
-
138 template<typename... Lhs, typename... Rhs>
-
139 [[nodiscard]] bool operator==(const extended_view_iterator<Lhs...> &lhs, const extended_view_iterator<Rhs...> &rhs) ENTT_NOEXCEPT {
-
140  return lhs.it == rhs.it;
-
141 }
-
142 
-
143 template<typename... Lhs, typename... Rhs>
-
144 [[nodiscard]] bool operator!=(const extended_view_iterator<Lhs...> &lhs, const extended_view_iterator<Rhs...> &rhs) ENTT_NOEXCEPT {
-
145  return !(lhs == rhs);
-
146 }
-
147 
-
148 } // namespace internal
-
149 
-
161 template<typename, typename, typename, typename>
-
162 class basic_view;
-
163 
-
188 template<typename Entity, typename... Component, typename... Exclude>
-
189 class basic_view<Entity, get_t<Component...>, exclude_t<Exclude...>> {
-
190  template<typename, typename, typename, typename>
-
191  friend class basic_view;
+
130 private:
+
131  It it;
+
132  std::tuple<Storage *...> pools;
+
133 };
+
134 
+
135 template<typename... Lhs, typename... Rhs>
+
136 [[nodiscard]] bool operator==(const extended_view_iterator<Lhs...> &lhs, const extended_view_iterator<Rhs...> &rhs) ENTT_NOEXCEPT {
+
137  return lhs.it == rhs.it;
+
138 }
+
139 
+
140 template<typename... Lhs, typename... Rhs>
+
141 [[nodiscard]] bool operator!=(const extended_view_iterator<Lhs...> &lhs, const extended_view_iterator<Rhs...> &rhs) ENTT_NOEXCEPT {
+
142  return !(lhs == rhs);
+
143 }
+
144 
+
145 } // namespace internal
+
146 
+
158 template<typename, typename, typename, typename>
+
159 class basic_view;
+
160 
+
185 template<typename Entity, typename... Component, typename... Exclude>
+
186 class basic_view<Entity, get_t<Component...>, exclude_t<Exclude...>> {
+
187  template<typename, typename, typename, typename>
+
188  friend class basic_view;
+
189 
+
190  template<typename Comp>
+
191  using storage_type = constness_as_t<typename storage_traits<Entity, std::remove_const_t<Comp>>::storage_type, Comp>;
192 
-
193  template<typename Comp>
-
194  using storage_type = constness_as_t<typename storage_traits<Entity, std::remove_const_t<Comp>>::storage_type, Comp>;
-
195 
-
196  template<std::size_t... Index>
-
197  [[nodiscard]] auto pools_to_array(std::index_sequence<Index...>) const ENTT_NOEXCEPT {
-
198  std::size_t pos{};
-
199  std::array<const base_type *, sizeof...(Component) - 1u> other{};
-
200  (static_cast<void>(std::get<Index>(pools) == view ? void() : void(other[pos++] = std::get<Index>(pools))), ...);
-
201  return other;
-
202  }
-
203 
-
204  template<std::size_t Comp, std::size_t Other, typename... Args>
-
205  [[nodiscard]] auto dispatch_get(const std::tuple<Entity, Args...> &curr) const {
-
206  if constexpr(Comp == Other) {
-
207  return std::forward_as_tuple(std::get<Args>(curr)...);
-
208  } else {
-
209  return std::get<Other>(pools)->get_as_tuple(std::get<0>(curr));
-
210  }
-
211  }
-
212 
-
213  template<std::size_t Comp, typename Func, std::size_t... Index>
-
214  void each(Func func, std::index_sequence<Index...>) const {
-
215  for(const auto curr: std::get<Comp>(pools)->each()) {
-
216  const auto entt = std::get<0>(curr);
-
217 
-
218  if(((sizeof...(Component) != 1u) || (entt != tombstone))
-
219  && ((Comp == Index || std::get<Index>(pools)->contains(entt)) && ...)
-
220  && std::apply([entt](const auto *...cpool) { return (!cpool->contains(entt) && ...); }, filter)) {
-
221  if constexpr(is_applicable_v<Func, decltype(std::tuple_cat(std::tuple<entity_type>{}, std::declval<basic_view>().get({})))>) {
-
222  std::apply(func, std::tuple_cat(std::make_tuple(entt), dispatch_get<Comp, Index>(curr)...));
-
223  } else {
-
224  std::apply(func, std::tuple_cat(dispatch_get<Comp, Index>(curr)...));
-
225  }
-
226  }
-
227  }
-
228  }
-
229 
-
230  template<typename Func, std::size_t... Index>
-
231  void pick_and_each(Func func, std::index_sequence<Index...> seq) const {
-
232  ((std::get<Index>(pools) == view ? each<Index>(std::move(func), seq) : void()), ...);
-
233  }
-
234 
-
235 public:
-
237  using entity_type = Entity;
-
239  using size_type = std::size_t;
-
241  using base_type = std::common_type_t<typename storage_type<Component>::base_type...>;
-
243  using iterator = internal::view_iterator<base_type, sizeof...(Component) - 1u, sizeof...(Exclude)>;
-
245  using iterable = iterable_adaptor<internal::extended_view_iterator<iterator, storage_type<Component>...>>;
-
246 
-
248  basic_view() ENTT_NOEXCEPT
-
249  : pools{},
-
250  filter{},
-
251  view{} {}
-
252 
-
258  basic_view(storage_type<Component> &...component, const storage_type<Exclude> &...epool) ENTT_NOEXCEPT
-
259  : pools{&component...},
-
260  filter{&epool...},
-
261  view{(std::min)({&static_cast<const base_type &>(component)...}, [](auto *lhs, auto *rhs) { return lhs->size() < rhs->size(); })} {}
-
262 
-
268  template<typename Comp>
-
269  [[nodiscard]] basic_view use() const ENTT_NOEXCEPT {
-
270  basic_view other{*this};
-
271  other.view = std::get<storage_type<Comp> *>(pools);
-
272  return other;
-
273  }
-
274 
-
280  template<std::size_t Comp>
-
281  [[nodiscard]] basic_view use() const ENTT_NOEXCEPT {
-
282  basic_view other{*this};
-
283  other.view = std::get<Comp>(pools);
-
284  return other;
-
285  }
-
286 
-
291  const base_type &handle() const ENTT_NOEXCEPT {
-
292  return *view;
-
293  }
-
294 
-
300  template<typename Comp>
-
301  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
-
302  return *std::get<storage_type<Comp> *>(pools);
-
303  }
-
304 
-
310  template<std::size_t Comp>
-
311  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
-
312  return *std::get<Comp>(pools);
-
313  }
-
314 
-
319  [[nodiscard]] size_type size_hint() const ENTT_NOEXCEPT {
-
320  return view->size();
-
321  }
-
322 
-
331  [[nodiscard]] iterator begin() const {
-
332  return iterator{view->begin(), view->end(), pools_to_array(std::index_sequence_for<Component...>{}), filter};
-
333  }
-
334 
-
344  [[nodiscard]] iterator end() const {
-
345  return iterator{view->end(), view->end(), pools_to_array(std::index_sequence_for<Component...>{}), filter};
-
346  }
-
347 
-
353  [[nodiscard]] entity_type front() const {
-
354  const auto it = begin();
-
355  return it != end() ? *it : null;
-
356  }
-
357 
-
363  [[nodiscard]] entity_type back() const {
-
364  auto it = view->rbegin();
-
365  for(const auto last = view->rend(); it != last && !contains(*it); ++it) {}
-
366  return it == view->rend() ? null : *it;
-
367  }
-
368 
-
375  [[nodiscard]] iterator find(const entity_type entt) const {
-
376  return contains(entt) ? iterator{view->find(entt), view->end(), pools_to_array(std::index_sequence_for<Component...>{}), filter} : end();
-
377  }
-
378 
-
384  [[nodiscard]] decltype(auto) operator[](const entity_type entt) const {
-
385  return get<Component...>(entt);
-
386  }
-
387 
-
392  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
-
393  return view != nullptr;
-
394  }
-
395 
-
401  [[nodiscard]] bool contains(const entity_type entt) const {
-
402  return std::apply([entt](const auto *...curr) { return (curr->contains(entt) && ...); }, pools)
-
403  && std::apply([entt](const auto *...curr) { return (!curr->contains(entt) && ...); }, filter);
-
404  }
-
405 
-
417  template<typename... Comp>
-
418  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
-
419  ENTT_ASSERT(contains(entt), "View does not contain entity");
-
420 
-
421  if constexpr(sizeof...(Comp) == 0) {
-
422  return std::apply([entt](auto *...curr) { return std::tuple_cat(curr->get_as_tuple(entt)...); }, pools);
-
423  } else if constexpr(sizeof...(Comp) == 1) {
-
424  return (std::get<storage_type<Comp> *>(pools)->get(entt), ...);
-
425  } else {
-
426  return std::tuple_cat(std::get<storage_type<Comp> *>(pools)->get_as_tuple(entt)...);
-
427  }
-
428  }
-
429 
-
442  template<std::size_t First, std::size_t... Other>
-
443  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
-
444  ENTT_ASSERT(contains(entt), "View does not contain entity");
-
445 
-
446  if constexpr(sizeof...(Other) == 0) {
-
447  return std::get<First>(pools)->get(entt);
-
448  } else {
-
449  return std::tuple_cat(std::get<First>(pools)->get_as_tuple(entt), std::get<Other>(pools)->get_as_tuple(entt)...);
-
450  }
-
451  }
-
452 
-
471  template<typename Func>
-
472  void each(Func func) const {
-
473  pick_and_each(std::move(func), std::index_sequence_for<Component...>{});
-
474  }
-
475 
-
485  [[nodiscard]] iterable each() const ENTT_NOEXCEPT {
-
486  return {internal::extended_view_iterator{begin(), pools}, internal::extended_view_iterator{end(), pools}};
-
487  }
-
488 
-
496  template<typename... Get, typename... Excl>
-
497  [[nodiscard]] auto operator|(const basic_view<Entity, get_t<Get...>, exclude_t<Excl...>> &other) const ENTT_NOEXCEPT {
-
498  using view_type = basic_view<Entity, get_t<Component..., Get...>, exclude_t<Exclude..., Excl...>>;
-
499  return std::make_from_tuple<view_type>(std::tuple_cat(
-
500  std::apply([](auto *...curr) { return std::forward_as_tuple(*curr...); }, pools),
-
501  std::apply([](auto *...curr) { return std::forward_as_tuple(*curr...); }, other.pools),
-
502  std::apply([](const auto *...curr) { return std::forward_as_tuple(static_cast<const storage_type<Exclude> &>(*curr)...); }, filter),
-
503  std::apply([](const auto *...curr) { return std::forward_as_tuple(static_cast<const storage_type<Excl> &>(*curr)...); }, other.filter)));
-
504  }
-
505 
-
506 private:
-
507  std::tuple<storage_type<Component> *...> pools;
-
508  std::array<const base_type *, sizeof...(Exclude)> filter;
-
509  const base_type *view;
-
510 };
-
511 
-
534 template<typename Entity, typename Component>
-
535 class basic_view<Entity, get_t<Component>, exclude_t<>, std::void_t<std::enable_if_t<!component_traits<std::remove_const_t<Component>>::in_place_delete>>> {
-
536  template<typename, typename, typename, typename>
-
537  friend class basic_view;
-
538 
-
539  using storage_type = constness_as_t<typename storage_traits<Entity, std::remove_const_t<Component>>::storage_type, Component>;
-
540 
-
541 public:
-
543  using entity_type = Entity;
-
545  using size_type = std::size_t;
-
547  using base_type = typename storage_type::base_type;
-
549  using iterator = typename base_type::iterator;
-
551  using reverse_iterator = typename base_type::reverse_iterator;
-
553  using iterable = decltype(std::declval<storage_type>().each());
-
554 
-
556  basic_view() ENTT_NOEXCEPT
-
557  : pools{},
-
558  filter{},
-
559  view{} {}
-
560 
-
565  basic_view(storage_type &ref) ENTT_NOEXCEPT
-
566  : pools{&ref},
-
567  filter{},
-
568  view{&ref} {}
-
569 
-
574  const base_type &handle() const ENTT_NOEXCEPT {
-
575  return *view;
-
576  }
-
577 
-
583  template<typename... Comp>
-
584  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
-
585  static_assert((std::is_same_v<Comp, Component> && ...), "Invalid component type");
-
586  return *std::get<0>(pools);
-
587  }
-
588 
-
594  template<std::size_t Comp>
-
595  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
-
596  return *std::get<Comp>(pools);
-
597  }
-
598 
-
603  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
-
604  return view->size();
-
605  }
-
606 
-
611  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
-
612  return view->empty();
-
613  }
-
614 
-
623  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
-
624  return view->begin();
-
625  }
-
626 
-
636  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
-
637  return view->end();
-
638  }
-
639 
-
648  [[nodiscard]] reverse_iterator rbegin() const ENTT_NOEXCEPT {
-
649  return view->rbegin();
-
650  }
-
651 
-
663  [[nodiscard]] reverse_iterator rend() const ENTT_NOEXCEPT {
-
664  return view->rend();
-
665  }
-
666 
-
672  [[nodiscard]] entity_type front() const {
-
673  return empty() ? null : *begin();
-
674  }
-
675 
-
681  [[nodiscard]] entity_type back() const {
-
682  return empty() ? null : *rbegin();
-
683  }
-
684 
-
691  [[nodiscard]] iterator find(const entity_type entt) const {
-
692  return contains(entt) ? view->find(entt) : end();
-
693  }
-
694 
-
700  [[nodiscard]] entity_type operator[](const size_type pos) const {
-
701  return begin()[pos];
-
702  }
-
703 
-
709  [[nodiscard]] decltype(auto) operator[](const entity_type entt) const {
-
710  return get<Component>(entt);
-
711  }
-
712 
-
717  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
-
718  return view != nullptr;
-
719  }
-
720 
-
726  [[nodiscard]] bool contains(const entity_type entt) const {
-
727  return view->contains(entt);
-
728  }
-
729 
-
741  template<typename... Comp>
-
742  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
-
743  ENTT_ASSERT(contains(entt), "View does not contain entity");
-
744 
-
745  if constexpr(sizeof...(Comp) == 0) {
-
746  return std::get<0>(pools)->get_as_tuple(entt);
-
747  } else {
-
748  static_assert(std::is_same_v<Comp..., Component>, "Invalid component type");
-
749  return std::get<0>(pools)->get(entt);
-
750  }
-
751  }
-
752 
-
754  template<std::size_t Comp>
-
755  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
-
756  ENTT_ASSERT(contains(entt), "View does not contain entity");
-
757  return std::get<0>(pools)->get(entt);
-
758  }
-
759 
-
778  template<typename Func>
-
779  void each(Func func) const {
-
780  if constexpr(ignore_as_empty_v<std::remove_const_t<Component>>) {
-
781  if constexpr(std::is_invocable_v<Func>) {
-
782  for(size_type pos{}, last = size(); pos < last; ++pos) {
-
783  func();
-
784  }
-
785  } else {
-
786  for(auto entity: *view) {
-
787  func(entity);
-
788  }
-
789  }
-
790  } else {
-
791  if constexpr(is_applicable_v<Func, decltype(*each().begin())>) {
-
792  for(const auto pack: each()) {
-
793  std::apply(func, pack);
-
794  }
-
795  } else {
-
796  for(auto &&component: *std::get<0>(pools)) {
-
797  func(component);
-
798  }
-
799  }
-
800  }
-
801  }
-
802 
-
812  [[nodiscard]] iterable each() const ENTT_NOEXCEPT {
-
813  return std::get<0>(pools)->each();
-
814  }
-
815 
-
823  template<typename... Get, typename... Excl>
-
824  [[nodiscard]] auto operator|(const basic_view<Entity, get_t<Get...>, exclude_t<Excl...>> &other) const ENTT_NOEXCEPT {
-
825  using view_type = basic_view<Entity, get_t<Component, Get...>, exclude_t<Excl...>>;
-
826  return std::make_from_tuple<view_type>(std::tuple_cat(
-
827  std::forward_as_tuple(*std::get<0>(pools)),
-
828  std::apply([](auto *...curr) { return std::forward_as_tuple(*curr...); }, other.pools),
-
829  std::apply([](const auto *...curr) { return std::forward_as_tuple(static_cast<const typename view_type::template storage_type<Excl> &>(*curr)...); }, other.filter)));
-
830  }
-
831 
-
832 private:
-
833  std::tuple<storage_type *> pools;
-
834  std::array<const base_type *, 0u> filter;
-
835  const base_type *view;
-
836 };
-
837 
-
843 template<typename... Storage>
-
844 basic_view(Storage &...storage) -> basic_view<std::common_type_t<typename Storage::entity_type...>, get_t<constness_as_t<typename Storage::value_type, Storage>...>, exclude_t<>>;
-
845 
-
846 } // namespace entt
-
847 
-
848 #endif
-
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:237
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::end
iterator end() const
Returns an iterator that is past the last entity of the view.
Definition: view.hpp:636
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size_type
std::size_t size_type
Unsigned integer type.
Definition: view.hpp:545
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator|
auto operator|(const basic_view< Entity, get_t< Get... >, exclude_t< Excl... >> &other) const
Combines two views in a more specific one (friend function).
Definition: view.hpp:824
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each
void each(Func func) const
Iterates entities and components and applies the given function object to them.
Definition: view.hpp:779
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::back
entity_type back() const
Returns the last entity of the view, if any.
Definition: view.hpp:681
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rbegin
reverse_iterator rbegin() const
Returns an iterator to the first entity of the reversed view.
Definition: view.hpp:648
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::front
entity_type front() const
Returns the first entity of the view, if any.
Definition: view.hpp:672
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rend
reverse_iterator rend() const
Returns an iterator that is past the last entity of the reversed view.
Definition: view.hpp:663
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::find
iterator find(const entity_type entt) const
Finds an entity.
Definition: view.hpp:691
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view
basic_view(storage_type &ref)
Constructs a single-type view from a storage class.
Definition: view.hpp:565
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::begin
iterator begin() const
Returns an iterator to the first entity of the view.
Definition: view.hpp:623
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size
size_type size() const
Returns the number of entities that have the given component.
Definition: view.hpp:603
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterator
typename base_type::iterator iterator
Random access iterator type.
Definition: view.hpp:549
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view
basic_view()
Default constructor to use to create empty, invalid views.
Definition: view.hpp:556
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterable
decltype(std::declval< storage_type >().each()) iterable
Iterable view type.
Definition: view.hpp:553
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::empty
bool empty() const
Checks whether a view is empty.
Definition: view.hpp:611
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:543
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[]
entity_type operator[](const size_type pos) const
Returns the identifier that occupies the given position.
Definition: view.hpp:700
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::handle
const base_type & handle() const
Returns the leading storage of a view.
Definition: view.hpp:574
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::contains
bool contains(const entity_type entt) const
Checks if a view contains an entity.
Definition: view.hpp:726
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each
iterable each() const
Returns an iterable object to use to visit a view.
Definition: view.hpp:812
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::reverse_iterator
typename base_type::reverse_iterator reverse_iterator
Reversed iterator type.
Definition: view.hpp:551
-
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::base_type
typename storage_type::base_type base_type
Common type among all storage types.
Definition: view.hpp:547
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::handle
const base_type & handle() const
Returns the leading storage of a view.
Definition: view.hpp:291
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view
basic_view()
Default constructor to use to create empty, invalid views.
Definition: view.hpp:248
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::find
iterator find(const entity_type entt) const
Finds an entity.
Definition: view.hpp:375
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:237
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::back
entity_type back() const
Returns the last entity of the view, if any.
Definition: view.hpp:363
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::end
iterator end() const
Returns an iterator that is past the last entity of the view.
Definition: view.hpp:344
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::begin
iterator begin() const
Returns an iterator to the first entity of the view.
Definition: view.hpp:331
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator|
auto operator|(const basic_view< Entity, get_t< Get... >, exclude_t< Excl... >> &other) const
Combines two views in a more specific one (friend function).
Definition: view.hpp:497
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterator
internal::view_iterator< base_type, sizeof...(Component) - 1u, sizeof...(Exclude)> iterator
Bidirectional iterator type.
Definition: view.hpp:243
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_type
std::size_t size_type
Unsigned integer type.
Definition: view.hpp:239
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each
iterable each() const
Returns an iterable object to use to visit a view.
Definition: view.hpp:485
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use
basic_view use() const
Creates a new view driven by a given component in its iterations.
Definition: view.hpp:269
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::front
entity_type front() const
Returns the first entity of the view, if any.
Definition: view.hpp:353
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::base_type
std::common_type_t< typename storage_type< Component >::base_type... > base_type
Common type among all storage types.
Definition: view.hpp:241
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::contains
bool contains(const entity_type entt) const
Checks if a view contains an entity.
Definition: view.hpp:401
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each
void each(Func func) const
Iterates entities and components and applies the given function object to them.
Definition: view.hpp:472
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_hint
size_type size_hint() const
Estimates the number of entities iterated by the view.
Definition: view.hpp:319
-
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view
basic_view(storage_type< Component > &...component, const storage_type< Exclude > &...epool)
Constructs a multi-type view from a set of storage classes.
Definition: view.hpp:258
+
193  template<std::size_t... Index>
+
194  [[nodiscard]] auto pools_to_array(std::index_sequence<Index...>) const ENTT_NOEXCEPT {
+
195  std::size_t pos{};
+
196  std::array<const base_type *, sizeof...(Component) - 1u> other{};
+
197  (static_cast<void>(std::get<Index>(pools) == view ? void() : void(other[pos++] = std::get<Index>(pools))), ...);
+
198  return other;
+
199  }
+
200 
+
201  template<std::size_t Comp, std::size_t Other, typename... Args>
+
202  [[nodiscard]] auto dispatch_get(const std::tuple<Entity, Args...> &curr) const {
+
203  if constexpr(Comp == Other) {
+
204  return std::forward_as_tuple(std::get<Args>(curr)...);
+
205  } else {
+
206  return std::get<Other>(pools)->get_as_tuple(std::get<0>(curr));
+
207  }
+
208  }
+
209 
+
210  template<std::size_t Comp, typename Func, std::size_t... Index>
+
211  void each(Func func, std::index_sequence<Index...>) const {
+
212  for(const auto curr: std::get<Comp>(pools)->each()) {
+
213  const auto entt = std::get<0>(curr);
+
214 
+
215  if(((sizeof...(Component) != 1u) || (entt != tombstone))
+
216  && ((Comp == Index || std::get<Index>(pools)->contains(entt)) && ...)
+
217  && std::apply([entt](const auto *...cpool) { return (!cpool->contains(entt) && ...); }, filter)) {
+
218  if constexpr(is_applicable_v<Func, decltype(std::tuple_cat(std::tuple<entity_type>{}, std::declval<basic_view>().get({})))>) {
+
219  std::apply(func, std::tuple_cat(std::make_tuple(entt), dispatch_get<Comp, Index>(curr)...));
+
220  } else {
+
221  std::apply(func, std::tuple_cat(dispatch_get<Comp, Index>(curr)...));
+
222  }
+
223  }
+
224  }
+
225  }
+
226 
+
227  template<typename Func, std::size_t... Index>
+
228  void pick_and_each(Func func, std::index_sequence<Index...> seq) const {
+
229  ((std::get<Index>(pools) == view ? each<Index>(std::move(func), seq) : void()), ...);
+
230  }
+
231 
+
232 public:
+
234  using entity_type = Entity;
+
236  using size_type = std::size_t;
+
238  using base_type = std::common_type_t<typename storage_type<Component>::base_type...>;
+
240  using iterator = internal::view_iterator<base_type, sizeof...(Component) - 1u, sizeof...(Exclude)>;
+
242  using iterable = iterable_adaptor<internal::extended_view_iterator<iterator, storage_type<Component>...>>;
+
243 
+
245  basic_view() ENTT_NOEXCEPT
+
246  : pools{},
+
247  filter{},
+
248  view{} {}
+
249 
+
255  basic_view(storage_type<Component> &...component, const storage_type<Exclude> &...epool) ENTT_NOEXCEPT
+
256  : pools{&component...},
+
257  filter{&epool...},
+
258  view{(std::min)({&static_cast<const base_type &>(component)...}, [](auto *lhs, auto *rhs) { return lhs->size() < rhs->size(); })} {}
+
259 
+
265  template<typename Comp>
+
266  [[nodiscard]] basic_view use() const ENTT_NOEXCEPT {
+
267  basic_view other{*this};
+
268  other.view = std::get<storage_type<Comp> *>(pools);
+
269  return other;
+
270  }
+
271 
+
277  template<std::size_t Comp>
+
278  [[nodiscard]] basic_view use() const ENTT_NOEXCEPT {
+
279  basic_view other{*this};
+
280  other.view = std::get<Comp>(pools);
+
281  return other;
+
282  }
+
283 
+
288  const base_type &handle() const ENTT_NOEXCEPT {
+
289  return *view;
+
290  }
+
291 
+
297  template<typename Comp>
+
298  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
+
299  return *std::get<storage_type<Comp> *>(pools);
+
300  }
+
301 
+
307  template<std::size_t Comp>
+
308  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
+
309  return *std::get<Comp>(pools);
+
310  }
+
311 
+
316  [[nodiscard]] size_type size_hint() const ENTT_NOEXCEPT {
+
317  return view->size();
+
318  }
+
319 
+
328  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
+
329  return iterator{view->begin(), view->end(), pools_to_array(std::index_sequence_for<Component...>{}), filter};
+
330  }
+
331 
+
341  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
+
342  return iterator{view->end(), view->end(), pools_to_array(std::index_sequence_for<Component...>{}), filter};
+
343  }
+
344 
+
350  [[nodiscard]] entity_type front() const ENTT_NOEXCEPT {
+
351  const auto it = begin();
+
352  return it != end() ? *it : null;
+
353  }
+
354 
+
360  [[nodiscard]] entity_type back() const ENTT_NOEXCEPT {
+
361  auto it = view->rbegin();
+
362  for(const auto last = view->rend(); it != last && !contains(*it); ++it) {}
+
363  return it == view->rend() ? null : *it;
+
364  }
+
365 
+
372  [[nodiscard]] iterator find(const entity_type entt) const ENTT_NOEXCEPT {
+
373  return contains(entt) ? iterator{view->find(entt), view->end(), pools_to_array(std::index_sequence_for<Component...>{}), filter} : end();
+
374  }
+
375 
+
381  [[nodiscard]] decltype(auto) operator[](const entity_type entt) const {
+
382  return get<Component...>(entt);
+
383  }
+
384 
+
389  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
+
390  return view != nullptr;
+
391  }
+
392 
+
398  [[nodiscard]] bool contains(const entity_type entt) const ENTT_NOEXCEPT {
+
399  return std::apply([entt](const auto *...curr) { return (curr->contains(entt) && ...); }, pools)
+
400  && std::apply([entt](const auto *...curr) { return (!curr->contains(entt) && ...); }, filter);
+
401  }
+
402 
+
414  template<typename... Comp>
+
415  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
+
416  ENTT_ASSERT(contains(entt), "View does not contain entity");
+
417 
+
418  if constexpr(sizeof...(Comp) == 0) {
+
419  return std::apply([entt](auto *...curr) { return std::tuple_cat(curr->get_as_tuple(entt)...); }, pools);
+
420  } else if constexpr(sizeof...(Comp) == 1) {
+
421  return (std::get<storage_type<Comp> *>(pools)->get(entt), ...);
+
422  } else {
+
423  return std::tuple_cat(std::get<storage_type<Comp> *>(pools)->get_as_tuple(entt)...);
+
424  }
+
425  }
+
426 
+
439  template<std::size_t First, std::size_t... Other>
+
440  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
+
441  ENTT_ASSERT(contains(entt), "View does not contain entity");
+
442 
+
443  if constexpr(sizeof...(Other) == 0) {
+
444  return std::get<First>(pools)->get(entt);
+
445  } else {
+
446  return std::tuple_cat(std::get<First>(pools)->get_as_tuple(entt), std::get<Other>(pools)->get_as_tuple(entt)...);
+
447  }
+
448  }
+
449 
+
468  template<typename Func>
+
469  void each(Func func) const {
+
470  pick_and_each(std::move(func), std::index_sequence_for<Component...>{});
+
471  }
+
472 
+
482  [[nodiscard]] iterable each() const ENTT_NOEXCEPT {
+
483  return {internal::extended_view_iterator{begin(), pools}, internal::extended_view_iterator{end(), pools}};
+
484  }
+
485 
+
493  template<typename... Get, typename... Excl>
+
494  [[nodiscard]] auto operator|(const basic_view<Entity, get_t<Get...>, exclude_t<Excl...>> &other) const ENTT_NOEXCEPT {
+
495  using view_type = basic_view<Entity, get_t<Component..., Get...>, exclude_t<Exclude..., Excl...>>;
+
496  return std::make_from_tuple<view_type>(std::tuple_cat(
+
497  std::apply([](auto *...curr) { return std::forward_as_tuple(*curr...); }, pools),
+
498  std::apply([](auto *...curr) { return std::forward_as_tuple(*curr...); }, other.pools),
+
499  std::apply([](const auto *...curr) { return std::forward_as_tuple(static_cast<const storage_type<Exclude> &>(*curr)...); }, filter),
+
500  std::apply([](const auto *...curr) { return std::forward_as_tuple(static_cast<const storage_type<Excl> &>(*curr)...); }, other.filter)));
+
501  }
+
502 
+
503 private:
+
504  std::tuple<storage_type<Component> *...> pools;
+
505  std::array<const base_type *, sizeof...(Exclude)> filter;
+
506  const base_type *view;
+
507 };
+
508 
+
531 template<typename Entity, typename Component>
+
532 class basic_view<Entity, get_t<Component>, exclude_t<>, std::void_t<std::enable_if_t<!component_traits<std::remove_const_t<Component>>::in_place_delete>>> {
+
533  template<typename, typename, typename, typename>
+
534  friend class basic_view;
+
535 
+
536  using storage_type = constness_as_t<typename storage_traits<Entity, std::remove_const_t<Component>>::storage_type, Component>;
+
537 
+
538 public:
+
540  using entity_type = Entity;
+
542  using size_type = std::size_t;
+
544  using base_type = typename storage_type::base_type;
+
546  using iterator = typename base_type::iterator;
+
548  using reverse_iterator = typename base_type::reverse_iterator;
+
550  using iterable = decltype(std::declval<storage_type>().each());
+
551 
+
553  basic_view() ENTT_NOEXCEPT
+
554  : pools{},
+
555  filter{},
+
556  view{} {}
+
557 
+
562  basic_view(storage_type &ref) ENTT_NOEXCEPT
+
563  : pools{&ref},
+
564  filter{},
+
565  view{&ref} {}
+
566 
+
571  const base_type &handle() const ENTT_NOEXCEPT {
+
572  return *view;
+
573  }
+
574 
+
580  template<typename Comp = Component>
+
581  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
+
582  static_assert(std::is_same_v<Comp, Component>, "Invalid component type");
+
583  return *std::get<0>(pools);
+
584  }
+
585 
+
591  template<std::size_t Comp>
+
592  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
+
593  return *std::get<Comp>(pools);
+
594  }
+
595 
+
600  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
+
601  return view->size();
+
602  }
+
603 
+
608  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
+
609  return view->empty();
+
610  }
+
611 
+
620  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
+
621  return view->begin();
+
622  }
+
623 
+
633  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
+
634  return view->end();
+
635  }
+
636 
+
645  [[nodiscard]] reverse_iterator rbegin() const ENTT_NOEXCEPT {
+
646  return view->rbegin();
+
647  }
+
648 
+
660  [[nodiscard]] reverse_iterator rend() const ENTT_NOEXCEPT {
+
661  return view->rend();
+
662  }
+
663 
+
669  [[nodiscard]] entity_type front() const ENTT_NOEXCEPT {
+
670  return empty() ? null : *begin();
+
671  }
+
672 
+
678  [[nodiscard]] entity_type back() const ENTT_NOEXCEPT {
+
679  return empty() ? null : *rbegin();
+
680  }
+
681 
+
688  [[nodiscard]] iterator find(const entity_type entt) const ENTT_NOEXCEPT {
+
689  return contains(entt) ? view->find(entt) : end();
+
690  }
+
691 
+
697  [[nodiscard]] entity_type operator[](const size_type pos) const {
+
698  return begin()[pos];
+
699  }
+
700 
+
706  [[nodiscard]] decltype(auto) operator[](const entity_type entt) const {
+
707  return get<Component>(entt);
+
708  }
+
709 
+
714  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
+
715  return view != nullptr;
+
716  }
+
717 
+
723  [[nodiscard]] bool contains(const entity_type entt) const ENTT_NOEXCEPT {
+
724  return view->contains(entt);
+
725  }
+
726 
+
738  template<typename... Comp>
+
739  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
+
740  ENTT_ASSERT(contains(entt), "View does not contain entity");
+
741 
+
742  if constexpr(sizeof...(Comp) == 0) {
+
743  return std::get<0>(pools)->get_as_tuple(entt);
+
744  } else {
+
745  static_assert(std::is_same_v<Comp..., Component>, "Invalid component type");
+
746  return std::get<0>(pools)->get(entt);
+
747  }
+
748  }
+
749 
+
751  template<std::size_t Comp>
+
752  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
+
753  ENTT_ASSERT(contains(entt), "View does not contain entity");
+
754  return std::get<0>(pools)->get(entt);
+
755  }
+
756 
+
775  template<typename Func>
+
776  void each(Func func) const {
+
777  if constexpr(is_applicable_v<Func, decltype(*each().begin())>) {
+
778  for(const auto pack: each()) {
+
779  std::apply(func, pack);
+
780  }
+
781  } else if constexpr(std::is_invocable_v<Func, Component &>) {
+
782  for(auto &&component: *std::get<0>(pools)) {
+
783  func(component);
+
784  }
+
785  } else if constexpr(std::is_invocable_v<Func, Entity>) {
+
786  for(auto entity: *view) {
+
787  func(entity);
+
788  }
+
789  } else {
+
790  for(size_type pos{}, last = size(); pos < last; ++pos) {
+
791  func();
+
792  }
+
793  }
+
794  }
+
795 
+
805  [[nodiscard]] iterable each() const ENTT_NOEXCEPT {
+
806  return std::get<0>(pools)->each();
+
807  }
+
808 
+
816  template<typename... Get, typename... Excl>
+
817  [[nodiscard]] auto operator|(const basic_view<Entity, get_t<Get...>, exclude_t<Excl...>> &other) const ENTT_NOEXCEPT {
+
818  using view_type = basic_view<Entity, get_t<Component, Get...>, exclude_t<Excl...>>;
+
819  return std::make_from_tuple<view_type>(std::tuple_cat(
+
820  std::forward_as_tuple(*std::get<0>(pools)),
+
821  std::apply([](auto *...curr) { return std::forward_as_tuple(*curr...); }, other.pools),
+
822  std::apply([](const auto *...curr) { return std::forward_as_tuple(static_cast<const typename view_type::template storage_type<Excl> &>(*curr)...); }, other.filter)));
+
823  }
+
824 
+
825 private:
+
826  std::tuple<storage_type *> pools;
+
827  std::array<const base_type *, 0u> filter;
+
828  const base_type *view;
+
829 };
+
830 
+
836 template<typename... Storage>
+
837 basic_view(Storage &...storage) -> basic_view<std::common_type_t<typename Storage::entity_type...>, get_t<constness_as_t<typename Storage::value_type, Storage>...>, exclude_t<>>;
+
838 
+
839 } // namespace entt
+
840 
+
841 #endif
+
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:234
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::end
iterator end() const
Returns an iterator that is past the last entity of the view.
Definition: view.hpp:633
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size_type
std::size_t size_type
Unsigned integer type.
Definition: view.hpp:542
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator|
auto operator|(const basic_view< Entity, get_t< Get... >, exclude_t< Excl... >> &other) const
Combines two views in a more specific one (friend function).
Definition: view.hpp:817
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each
void each(Func func) const
Iterates entities and components and applies the given function object to them.
Definition: view.hpp:776
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::back
entity_type back() const
Returns the last entity of the view, if any.
Definition: view.hpp:678
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rbegin
reverse_iterator rbegin() const
Returns an iterator to the first entity of the reversed view.
Definition: view.hpp:645
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::front
entity_type front() const
Returns the first entity of the view, if any.
Definition: view.hpp:669
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rend
reverse_iterator rend() const
Returns an iterator that is past the last entity of the reversed view.
Definition: view.hpp:660
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::find
iterator find(const entity_type entt) const
Finds an entity.
Definition: view.hpp:688
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view
basic_view(storage_type &ref)
Constructs a single-type view from a storage class.
Definition: view.hpp:562
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::begin
iterator begin() const
Returns an iterator to the first entity of the view.
Definition: view.hpp:620
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size
size_type size() const
Returns the number of entities that have the given component.
Definition: view.hpp:600
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterator
typename base_type::iterator iterator
Random access iterator type.
Definition: view.hpp:546
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view
basic_view()
Default constructor to use to create empty, invalid views.
Definition: view.hpp:553
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterable
decltype(std::declval< storage_type >().each()) iterable
Iterable view type.
Definition: view.hpp:550
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::empty
bool empty() const
Checks whether a view is empty.
Definition: view.hpp:608
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:540
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[]
entity_type operator[](const size_type pos) const
Returns the identifier that occupies the given position.
Definition: view.hpp:697
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::handle
const base_type & handle() const
Returns the leading storage of a view.
Definition: view.hpp:571
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::contains
bool contains(const entity_type entt) const
Checks if a view contains an entity.
Definition: view.hpp:723
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each
iterable each() const
Returns an iterable object to use to visit a view.
Definition: view.hpp:805
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::reverse_iterator
typename base_type::reverse_iterator reverse_iterator
Reversed iterator type.
Definition: view.hpp:548
+
entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::base_type
typename storage_type::base_type base_type
Common type among all storage types.
Definition: view.hpp:544
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::handle
const base_type & handle() const
Returns the leading storage of a view.
Definition: view.hpp:288
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view
basic_view()
Default constructor to use to create empty, invalid views.
Definition: view.hpp:245
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::find
iterator find(const entity_type entt) const
Finds an entity.
Definition: view.hpp:372
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: view.hpp:234
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::back
entity_type back() const
Returns the last entity of the view, if any.
Definition: view.hpp:360
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::end
iterator end() const
Returns an iterator that is past the last entity of the view.
Definition: view.hpp:341
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::begin
iterator begin() const
Returns an iterator to the first entity of the view.
Definition: view.hpp:328
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator|
auto operator|(const basic_view< Entity, get_t< Get... >, exclude_t< Excl... >> &other) const
Combines two views in a more specific one (friend function).
Definition: view.hpp:494
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterator
internal::view_iterator< base_type, sizeof...(Component) - 1u, sizeof...(Exclude)> iterator
Bidirectional iterator type.
Definition: view.hpp:240
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_type
std::size_t size_type
Unsigned integer type.
Definition: view.hpp:236
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each
iterable each() const
Returns an iterable object to use to visit a view.
Definition: view.hpp:482
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use
basic_view use() const
Creates a new view driven by a given component in its iterations.
Definition: view.hpp:266
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::front
entity_type front() const
Returns the first entity of the view, if any.
Definition: view.hpp:350
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::base_type
std::common_type_t< typename storage_type< Component >::base_type... > base_type
Common type among all storage types.
Definition: view.hpp:238
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::contains
bool contains(const entity_type entt) const
Checks if a view contains an entity.
Definition: view.hpp:398
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each
void each(Func func) const
Iterates entities and components and applies the given function object to them.
Definition: view.hpp:469
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_hint
size_type size_hint() const
Estimates the number of entities iterated by the view.
Definition: view.hpp:316
+
entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view
basic_view(storage_type< Component > &...component, const storage_type< Exclude > &...epool)
Constructs a multi-type view from a set of storage classes.
Definition: view.hpp:255
entt::basic_view
View implementation.
Definition: fwd.hpp:20
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:217
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
entt::entity
entity
Default entity identifier.
Definition: fwd.hpp:47
entt::basic_view
basic_view(Storage &...storage) -> basic_view< std::common_type_t< typename Storage::entity_type... >, get_t< constness_as_t< typename Storage::value_type, Storage >... >, exclude_t<>>
Deduction guide.
entt::null
constexpr null_t null
Compile-time constant for null entities.
Definition: entity.hpp:326
entt::is_applicable_v
constexpr bool is_applicable_v
Helper variable template.
Definition: type_traits.hpp:404
entt::tombstone
constexpr tombstone_t tombstone
Compile-time constant for tombstone entities.
Definition: entity.hpp:335
-
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:645
+
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:618
entt::view
basic_view< entity, Get, Exclude > view
Alias declaration for the most common use case.
Definition: fwd.hpp:103
entt::get
constexpr get_t< Type... > get
Variable template for lists of observed components.
Definition: utility.hpp:34
-
entt::ignore_as_empty_v
constexpr bool ignore_as_empty_v
Helper variable template.
Definition: component.hpp:33
entt::storage
basic_storage< entity, Args... > storage
Alias declaration for the most common use case.
Definition: fwd.hpp:57
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
entt::exclude_t
Alias for exclusion lists.
Definition: utility.hpp:13
entt::get_t
Alias for lists of observed components.
Definition: utility.hpp:27
-
entt::iterable_adaptor
Utility class to create an iterable object from a pair of iterators.
Definition: iterator.hpp:62
+
entt::iterable_adaptor
Utility class to create an iterable object from a pair of iterators.
Definition: iterator.hpp:63
std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool> > entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::contains std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool> > entt::dense_set< Type, Hash, KeyEqual, Allocator >::contains ( const Other &  value) - + - + @@ -1170,12 +1094,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
True if there is such an element, false otherwise.
-

Definition at line 664 of file dense_hash_set.hpp.

+

Definition at line 638 of file dense_set.hpp.

- -

◆ emplace()

+ +

◆ emplace()

@@ -1188,7 +1112,7 @@ template<typename... Args>
@@ -70,12 +70,17 @@ $(function() {
std::tuple_size< entt::compressed_pair< First, Second > > Struct Template Reference
+ +

std::tuple_size specialization for compressed_pairs. + More...

+ +

#include <compressed_pair.hpp>

Inheritance diagram for std::tuple_size< entt::compressed_pair< First, Second > >:
Inheritance graph
- +
[legend]
@@ -84,7 +89,7 @@ Collaboration diagram for std::tuple_size< entt::compressed_pair< First, S
Collaboration graph
- +
[legend]
@@ -92,8 +97,16 @@ Collaboration diagram for std::tuple_size< entt::compressed_pair< First, S

template<typename First, typename Second>
struct std::tuple_size< entt::compressed_pair< First, Second > >

+

std::tuple_size specialization for compressed_pairs.

+
Template Parameters
+
bool entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::contains bool entt::dense_set< Type, Hash, KeyEqual, Allocator >::contains (const value_type & const value_type &  value) const
- + @@ -1203,6 +1127,7 @@ template<typename... Args>

Constructs an element in-place, if it does not exist.

+

The element is also constructed when the container already has the key, in which case the newly constructed object is destroyed immediately.

Template Parameters
std::pair<iterator, bool> entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::emplace std::pair<iterator, bool> entt::dense_set< Type, Hash, KeyEqual, Allocator >::emplace ( Args &&...  args)
@@ -1217,12 +1142,12 @@ template<typename... Args>
Returns
A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
-

Definition at line 569 of file dense_hash_set.hpp.

+

Definition at line 523 of file dense_set.hpp.

- -

◆ empty()

+ +

◆ empty()

@@ -1233,7 +1158,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
diff --git a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html index 8c5e85080..fb5bf07e9 100644 --- a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html +++ b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__name-members.html b/structentt_1_1type__name-members.html index aaebf81e3..00aac34b4 100644 --- a/structentt_1_1type__name-members.html +++ b/structentt_1_1type__name-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__name.html b/structentt_1_1type__name.html index 0b366cc29..a520c7798 100644 --- a/structentt_1_1type__name.html +++ b/structentt_1_1type__name.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list-members.html b/structentt_1_1value__list-members.html index 4616e5700..c4b45b5f1 100644 --- a/structentt_1_1value__list-members.html +++ b/structentt_1_1value__list-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list.html b/structentt_1_1value__list.html index 31ce9ebfb..03e9e2245 100644 --- a/structentt_1_1value__list.html +++ b/structentt_1_1value__list.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__cat.html b/structentt_1_1value__list__cat.html index 8788ea189..2c0ec3f70 100644 --- a/structentt_1_1value__list__cat.html +++ b/structentt_1_1value__list__cat.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html index 190a118f9..d6fe14b94 100644 --- a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html +++ b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8e855cf3b29535e1db146a56ae1f98de8.html b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8e855cf3b29535e1db146a56ae1f98de8.html index 31de463d7..8b244fc5c 100644 --- a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8e855cf3b29535e1db146a56ae1f98de8.html +++ b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8e855cf3b29535e1db146a56ae1f98de8.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4-members.html b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4-members.html index 2dd8af502..5812550f6 100644 --- a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4-members.html +++ b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html index a9cfaf487..3aa281ad1 100644 --- a/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html +++ b/structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__cat_3_4-members.html b/structentt_1_1value__list__cat_3_4-members.html index 4910c96a2..fa2227e41 100644 --- a/structentt_1_1value__list__cat_3_4-members.html +++ b/structentt_1_1value__list__cat_3_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__cat_3_4.html b/structentt_1_1value__list__cat_3_4.html index 168f07bfb..8084d7960 100644 --- a/structentt_1_1value__list__cat_3_4.html +++ b/structentt_1_1value__list__cat_3_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__element.html b/structentt_1_1value__list__element.html index 47aa5b1ff..59bc2fc7b 100644 --- a/structentt_1_1value__list__element.html +++ b/structentt_1_1value__list__element.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4-members.html b/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4-members.html index aacf4d764..ad156af5b 100644 --- a/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4-members.html +++ b/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html b/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html index 96f553703..ec2c85dac 100644 --- a/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html +++ b/structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html b/structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html index d6f13b27a..979d3caa7 100644 --- a/structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html +++ b/structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1y__combinator-members.html b/structentt_1_1y__combinator-members.html index 4a44c29b6..8ec110166 100644 --- a/structentt_1_1y__combinator-members.html +++ b/structentt_1_1y__combinator-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1y__combinator.html b/structentt_1_1y__combinator.html index 04ed0d2b8..9c34f4b1a 100644 --- a/structentt_1_1y__combinator.html +++ b/structentt_1_1y__combinator.html @@ -22,7 +22,7 @@ diff --git a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html index c91d4954e..705490e36 100644 --- a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html +++ b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -70,12 +70,17 @@ $(function() {
std::tuple_element< Index, entt::compressed_pair< First, Second > > Struct Template Reference
+ +

std::tuple_element specialization for compressed_pairs. + More...

+ +

#include <compressed_pair.hpp>

Inheritance diagram for std::tuple_element< Index, entt::compressed_pair< First, Second > >:
Inheritance graph
- +
[legend]
@@ -84,7 +89,7 @@ Collaboration diagram for std::tuple_element< Index, entt::compressed_pair<
Collaboration graph
- +
[legend]
@@ -92,8 +97,17 @@ Collaboration diagram for std::tuple_element< Index, entt::compressed_pair<

template<size_t Index, typename First, typename Second>
struct std::tuple_element< Index, entt::compressed_pair< First, Second > >

+

std::tuple_element specialization for compressed_pairs.

+
Template Parameters
+
ArgsTypes of arguments to forward to the constructor of the element.
- + @@ -1249,12 +1174,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

Checks whether a container is empty.

Returns
True if the container is empty, false otherwise.
-

Definition at line 511 of file dense_hash_set.hpp.

+

Definition at line 461 of file dense_set.hpp.

- -

◆ end() [1/4]

+ +

◆ end() [1/4]

@@ -1265,7 +1190,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -81,10 +81,10 @@ $(function() {
bool entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::empty bool entt::dense_set< Type, Hash, KeyEqual, Allocator >::empty ( ) const - + @@ -1282,12 +1207,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 503 of file dense_hash_set.hpp.

+

Definition at line 453 of file dense_set.hpp.

- -

◆ end() [2/4]

+ +

◆ end() [2/4]

@@ -1298,7 +1223,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
diff --git a/structentt_1_1type__list.html b/structentt_1_1type__list.html index 0f9483b4d..bc2950733 100644 --- a/structentt_1_1type__list.html +++ b/structentt_1_1type__list.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__cat.html b/structentt_1_1type__list__cat.html index c4488601a..70d06621b 100644 --- a/structentt_1_1type__list__cat.html +++ b/structentt_1_1type__list__cat.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html index 18608799e..01fc0d1c6 100644 --- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html +++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html index 9436ccfa5..22ca23327 100644 --- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html +++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8b5f6e6ed6191612d6e0fe24c4ff408dc.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html index 4bc52bcde..f5aeff5ea 100644 --- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html +++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html index bfd9c06db..e4237c7b0 100644 --- a/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html +++ b/structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__cat_3_4-members.html b/structentt_1_1type__list__cat_3_4-members.html index 86e19639c..472792b3f 100644 --- a/structentt_1_1type__list__cat_3_4-members.html +++ b/structentt_1_1type__list__cat_3_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__cat_3_4.html b/structentt_1_1type__list__cat_3_4.html index a59517491..391aac5a2 100644 --- a/structentt_1_1type__list__cat_3_4.html +++ b/structentt_1_1type__list__cat_3_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__contains.html b/structentt_1_1type__list__contains.html index 9bafd1678..c836f37cd 100644 --- a/structentt_1_1type__list__contains.html +++ b/structentt_1_1type__list__contains.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html b/structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html index 6f3de6c0b..c9094d087 100644 --- a/structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html +++ b/structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__diff.html b/structentt_1_1type__list__diff.html index f948a30a8..4b55f4ca6 100644 --- a/structentt_1_1type__list__diff.html +++ b/structentt_1_1type__list__diff.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4-members.html b/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4-members.html index 94cabe52a..4715f4008 100644 --- a/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4-members.html +++ b/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html b/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html index bca0b79bf..9d87974de 100644 --- a/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html +++ b/structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__element.html b/structentt_1_1type__list__element.html index 200eecbe1..f5255569b 100644 --- a/structentt_1_1type__list__element.html +++ b/structentt_1_1type__list__element.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html b/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html index 86633854d..a853b3026 100644 --- a/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html +++ b/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html b/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html index 87c6e2460..bbea49c84 100644 --- a/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html +++ b/structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html b/structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html index 2c6767257..710089bdf 100644 --- a/structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html +++ b/structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__unique.html b/structentt_1_1type__list__unique.html index e70c84fd8..e4e907654 100644 --- a/structentt_1_1type__list__unique.html +++ b/structentt_1_1type__list__unique.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html index 799e094ab..3829abf93 100644 --- a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html +++ b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@ @@ -73,7 +73,7 @@ $(function() {

This is the complete list of members for entt::type_list_unique< type_list< Type, Other... > >, including all inherited members.

iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::end iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::end ( ) - + @@ -1315,12 +1240,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

The returned iterator points to the element following the last instance of the internal array. Attempting to dereference the returned iterator results in undefined behavior.

Returns
An iterator to the element following the last instance of the internal array.
-

Definition at line 498 of file dense_hash_set.hpp.

+

Definition at line 448 of file dense_set.hpp.

- -

◆ end() [3/4]

+ +

◆ end() [3/4]

@@ -1331,9 +1256,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
-

Friends And Related Function Documentation

- -

◆ type_id

- -
-
-
-template<typename Type >
-
const_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::end const_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::end ( ) const - + - + @@ -1354,12 +1279,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to the end of the given bucket.
-

Definition at line 731 of file dense_hash_set.hpp.

+

Definition at line 705 of file dense_set.hpp.

- -

◆ end() [4/4]

+ +

◆ end() [4/4]

@@ -1370,9 +1295,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -71,7 +71,7 @@ $(function() { Public Member Functions | List of all members
-
entt::iterable_adaptor< It > Struct Template Referencefinal
+
entt::iterable_adaptor< It, Sentinel > Struct Template Referencefinal
@@ -82,76 +82,77 @@ $(function() {
local_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::end local_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::end ([[maybe_unused] ] const size_type [[maybe_unused] ] const size_type  index)
- + - + @@ -1393,12 +1318,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to the end of the given bucket.
-

Definition at line 722 of file dense_hash_set.hpp.

+

Definition at line 696 of file dense_set.hpp.

- -

◆ erase() [1/3]

+ +

◆ erase() [1/3]

@@ -1409,9 +1334,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
diff --git a/structentt_1_1is__meta__pointer__like_3_01Type_01_5_01_4.html b/structentt_1_1is__meta__pointer__like_3_01Type_01_5_01_4.html index 98584f257..e27568aab 100644 --- a/structentt_1_1is__meta__pointer__like_3_01Type_01_5_01_4.html +++ b/structentt_1_1is__meta__pointer__like_3_01Type_01_5_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__meta__pointer__like_3_01Type_07_5_08_0fN_0e_4.html b/structentt_1_1is__meta__pointer__like_3_01Type_07_5_08_0fN_0e_4.html index 3c0c71724..3f5638e38 100644 --- a/structentt_1_1is__meta__pointer__like_3_01Type_07_5_08_0fN_0e_4.html +++ b/structentt_1_1is__meta__pointer__like_3_01Type_07_5_08_0fN_0e_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__meta__pointer__like_3_01const_01Type_01_4.html b/structentt_1_1is__meta__pointer__like_3_01const_01Type_01_4.html index 0a145e78f..3e6dd1856 100644 --- a/structentt_1_1is__meta__pointer__like_3_01const_01Type_01_4.html +++ b/structentt_1_1is__meta__pointer__like_3_01const_01Type_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__meta__pointer__like_3_01std_1_1shared__ptr_3_01Type_01_4_01_4.html b/structentt_1_1is__meta__pointer__like_3_01std_1_1shared__ptr_3_01Type_01_4_01_4.html index fdcde5ebd..84149438a 100644 --- a/structentt_1_1is__meta__pointer__like_3_01std_1_1shared__ptr_3_01Type_01_4_01_4.html +++ b/structentt_1_1is__meta__pointer__like_3_01std_1_1shared__ptr_3_01Type_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__meta__pointer__like_3_01std_1_1unique__ptr_3_01Type_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1is__meta__pointer__like_3_01std_1_1unique__ptr_3_01Type_00_01Args_8_8_8_01_4_01_4.html index d93725063..74070ad2a 100644 --- a/structentt_1_1is__meta__pointer__like_3_01std_1_1unique__ptr_3_01Type_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1is__meta__pointer__like_3_01std_1_1unique__ptr_3_01Type_00_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__transparent.html b/structentt_1_1is__transparent.html index 8172efbf3..d18f71fe1 100644 --- a/structentt_1_1is__transparent.html +++ b/structentt_1_1is__transparent.html @@ -22,7 +22,7 @@ @@ -105,7 +105,7 @@ struct entt::is_transparent< Type, typename > -

Definition at line 538 of file type_traits.hpp.

+

Definition at line 511 of file type_traits.hpp.

The documentation for this struct was generated from the following file: diff --git a/structentt_1_1is__transparent_3_01Type_00_01std_1_1void__t_3_01typename_01Type_1_1is__transparent_01_4_01_4.html b/structentt_1_1is__transparent_3_01Type_00_01std_1_1void__t_3_01typename_01Type_1_1is__transparent_01_4_01_4.html index c3bc5e208..fb0bfa1cf 100644 --- a/structentt_1_1is__transparent_3_01Type_00_01std_1_1void__t_3_01typename_01Type_1_1is__transparent_01_4_01_4.html +++ b/structentt_1_1is__transparent_3_01Type_00_01std_1_1void__t_3_01typename_01Type_1_1is__transparent_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -105,7 +105,7 @@ struct entt::is_transparent< Type, std::void_t< typename Type::is_transpar -

Definition at line 542 of file type_traits.hpp.

+

Definition at line 515 of file type_traits.hpp.

The documentation for this struct was generated from the following file: diff --git a/structentt_1_1iterable__adaptor-members.html b/structentt_1_1iterable__adaptor-members.html index 81c3a053d..cb384119a 100644 --- a/structentt_1_1iterable__adaptor-members.html +++ b/structentt_1_1iterable__adaptor-members.html @@ -22,7 +22,7 @@ @@ -67,21 +67,21 @@ $(function() {
-
entt::iterable_adaptor< It > Member List
+
entt::iterable_adaptor< It, Sentinel > Member List
-

This is the complete list of members for entt::iterable_adaptor< It >, including all inherited members.

+

This is the complete list of members for entt::iterable_adaptor< It, Sentinel >, including all inherited members.

const_local_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::end const_local_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::end ([[maybe_unused] ] const size_type [[maybe_unused] ] const size_type  index) const
- + - + @@ -1432,12 +1357,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
Number of elements removed (either 0 or 1).
-

Definition at line 609 of file dense_hash_set.hpp.

+

Definition at line 574 of file dense_set.hpp.

- -

◆ erase() [2/3]

+ +

◆ erase() [2/3]

@@ -1448,15 +1373,15 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -82,10 +82,10 @@ $(function() {
size_type entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::erase size_type entt::dense_set< Type, Hash, KeyEqual, Allocator >::erase (const value_type & const value_type &  value)
- + - + - + @@ -1482,12 +1407,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator following the last removed element.
-

Definition at line 594 of file dense_hash_set.hpp.

+

Definition at line 559 of file dense_set.hpp.

- -

◆ erase() [3/3]

+ +

◆ erase() [3/3]

@@ -1498,9 +1423,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -81,7 +81,7 @@ struct entt::connect_arg_t< auto >

Used to wrap a function or a member of a specified type.

-

Definition at line 53 of file delegate.hpp.

+

Definition at line 54 of file delegate.hpp.

The documentation for this struct was generated from the following file: diff --git a/structentt_1_1constness__as-members.html b/structentt_1_1constness__as-members.html index f8b566b33..649f510b1 100644 --- a/structentt_1_1constness__as-members.html +++ b/structentt_1_1constness__as-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1constness__as.html b/structentt_1_1constness__as.html index 6d0a1affb..11ee0258e 100644 --- a/structentt_1_1constness__as.html +++ b/structentt_1_1constness__as.html @@ -22,7 +22,7 @@ @@ -99,7 +99,7 @@ struct entt::constness_as< To, From > -

Definition at line 627 of file type_traits.hpp.

+

Definition at line 600 of file type_traits.hpp.

The documentation for this struct was generated from the following file: diff --git a/structentt_1_1constness__as_3_01To_00_01const_01From_01_4-members.html b/structentt_1_1constness__as_3_01To_00_01const_01From_01_4-members.html index b3e3ceff5..eb488cb86 100644 --- a/structentt_1_1constness__as_3_01To_00_01const_01From_01_4-members.html +++ b/structentt_1_1constness__as_3_01To_00_01const_01From_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html b/structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html index 9c5f2e500..90e62b27c 100644 --- a/structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html +++ b/structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html @@ -22,7 +22,7 @@ @@ -99,7 +99,7 @@ struct entt::constness_as< To, const From > -

Definition at line 634 of file type_traits.hpp.

+

Definition at line 607 of file type_traits.hpp.

The documentation for this struct was generated from the following file: diff --git a/structentt_1_1emitter_1_1connection-members.html b/structentt_1_1emitter_1_1connection-members.html index 325383a18..52e29f67c 100644 --- a/structentt_1_1emitter_1_1connection-members.html +++ b/structentt_1_1emitter_1_1connection-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1emitter_1_1connection.html b/structentt_1_1emitter_1_1connection.html index de4493799..b947a5af3 100644 --- a/structentt_1_1emitter_1_1connection.html +++ b/structentt_1_1emitter_1_1connection.html @@ -22,7 +22,7 @@ @@ -130,7 +130,7 @@ struct entt::emitter< Derived >::connection< Event > -

Definition at line 154 of file emitter.hpp.

+

Definition at line 155 of file emitter.hpp.

Constructor & Destructor Documentation

◆ connection()

@@ -168,7 +168,7 @@ template<typename Event > -

Definition at line 165 of file emitter.hpp.

+

Definition at line 166 of file emitter.hpp.

diff --git a/structentt_1_1enum__as__bitmask.html b/structentt_1_1enum__as__bitmask.html index 30768b829..5dd27e418 100644 --- a/structentt_1_1enum__as__bitmask.html +++ b/structentt_1_1enum__as__bitmask.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html index 0254e9798..92f4b9eed 100644 --- a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html +++ b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html @@ -22,7 +22,7 @@ @@ -81,7 +81,7 @@ Inheritance diagram for entt::enum_as_bitmask< Type, std::void_t< decltype
Inheritance graph
- +
[legend]
@@ -90,7 +90,7 @@ Collaboration diagram for entt::enum_as_bitmask< Type, std::void_t< declty
Collaboration graph
- +
[legend]

Detailed Description

diff --git a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.map b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.map index db480c9d2..2a3d3fce5 100644 --- a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.map +++ b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.map @@ -1,4 +1,4 @@ - + diff --git a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.md5 b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.md5 index 6f15152a3..56490b8f8 100644 --- a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.md5 +++ b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.md5 @@ -1 +1 @@ -277fe00a73229fd1af8d3e0fc2a67982 \ No newline at end of file +2ff788d505581fd7ab864327228b039f \ No newline at end of file diff --git a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.png b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.png index 18968a33a..e05d01081 100644 Binary files a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.png and b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enumb45e5b59e9e78d3c72700aca5e6e82c2.png differ diff --git a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.map b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.map index db480c9d2..2a3d3fce5 100644 --- a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.map +++ b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.map @@ -1,4 +1,4 @@ - + diff --git a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.md5 b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.md5 index 6f15152a3..56490b8f8 100644 --- a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.md5 +++ b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.md5 @@ -1 +1 @@ -277fe00a73229fd1af8d3e0fc2a67982 \ No newline at end of file +2ff788d505581fd7ab864327228b039f \ No newline at end of file diff --git a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.png b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.png index 18968a33a..e05d01081 100644 Binary files a/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.png and b/structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enume78d06b8709f92cd1e7735875131f315.png differ diff --git a/structentt_1_1exclude__t-members.html b/structentt_1_1exclude__t-members.html index 2f1f57717..d10a4ad9b 100644 --- a/structentt_1_1exclude__t-members.html +++ b/structentt_1_1exclude__t-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1exclude__t.html b/structentt_1_1exclude__t.html index e31bee208..c2899f6b5 100644 --- a/structentt_1_1exclude__t.html +++ b/structentt_1_1exclude__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1get__t-members.html b/structentt_1_1get__t-members.html index d13930fc1..fc120763a 100644 --- a/structentt_1_1get__t-members.html +++ b/structentt_1_1get__t-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1get__t.html b/structentt_1_1get__t.html index 1e10bde4e..4afce78ac 100644 --- a/structentt_1_1get__t.html +++ b/structentt_1_1get__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1identity-members.html b/structentt_1_1identity-members.html index 3eebb173f..7e892053d 100644 --- a/structentt_1_1identity-members.html +++ b/structentt_1_1identity-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1identity.html b/structentt_1_1identity.html index fb3268a61..494ad2b06 100644 --- a/structentt_1_1identity.html +++ b/structentt_1_1identity.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1input__iterator__pointer-members.html b/structentt_1_1input__iterator__pointer-members.html index 5fac35b27..7de6c25a9 100644 --- a/structentt_1_1input__iterator__pointer-members.html +++ b/structentt_1_1input__iterator__pointer-members.html @@ -22,7 +22,7 @@ @@ -79,7 +79,7 @@ $(function() { - +
iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::erase iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::erase (const_iterator const_iterator  first,
const_iterator const_iterator  last 
- + - + @@ -1521,12 +1446,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator following the removed element.
-

Definition at line 582 of file dense_hash_set.hpp.

+

Definition at line 547 of file dense_set.hpp.

- -

◆ find() [1/4]

+ +

◆ find() [1/4]

@@ -1539,7 +1464,7 @@ template<typename Other >
@@ -67,6 +67,7 @@ $(function() {
+Static Public Attributes | List of all members
entt::component_traits< Type, typename > Struct Template Reference
@@ -77,40 +78,17 @@ $(function() { More...

#include <component.hpp>

-
-Inheritance diagram for entt::component_traits< Type, typename >:
-
-
Inheritance graph
- - - - -
[legend]
-
-Collaboration diagram for entt::component_traits< Type, typename >:
-
-
Collaboration graph
- - - - -
[legend]
iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::erase iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::erase (const_iterator const_iterator  pos)
- + @@ -1568,12 +1493,12 @@ template<typename Other >
Returns
An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 648 of file dense_hash_set.hpp.

+

Definition at line 622 of file dense_set.hpp.

- -

◆ find() [2/4]

+ +

◆ find() [2/4]

@@ -1586,7 +1511,7 @@ template<typename Other >
diff --git a/structentt_1_1basic__handle.html b/structentt_1_1basic__handle.html index 52460e54d..55d88bf5e 100644 --- a/structentt_1_1basic__handle.html +++ b/structentt_1_1basic__handle.html @@ -22,7 +22,7 @@ @@ -78,7 +78,7 @@ $(function() {

Non-owning handle to an entity. More...

-

#include <handle.hpp>

+

#include <handle.hpp>

std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator> > entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::find std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator> > entt::dense_set< Type, Hash, KeyEqual, Allocator >::find ( const Other &  value) - + @@ -1609,12 +1534,12 @@ template<typename Other >
Returns
An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 655 of file dense_hash_set.hpp.

+

Definition at line 629 of file dense_set.hpp.

- -

◆ find() [3/4]

+ +

◆ find() [3/4]

@@ -1625,9 +1550,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
diff --git a/structentt_1_1as__group-members.html b/structentt_1_1as__group-members.html index 30636850d..3043a7425 100644 --- a/structentt_1_1as__group-members.html +++ b/structentt_1_1as__group-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1as__group.html b/structentt_1_1as__group.html index 9c1998dc4..e180a75a5 100644 --- a/structentt_1_1as__group.html +++ b/structentt_1_1as__group.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1as__is__t.html b/structentt_1_1as__is__t.html index 0b88b2955..ff0181c54 100644 --- a/structentt_1_1as__is__t.html +++ b/structentt_1_1as__is__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1as__ref__t.html b/structentt_1_1as__ref__t.html index f6e22aaf4..76c653ba0 100644 --- a/structentt_1_1as__ref__t.html +++ b/structentt_1_1as__ref__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1as__view-members.html b/structentt_1_1as__view-members.html index 3e6fd7742..e27f1d941 100644 --- a/structentt_1_1as__view-members.html +++ b/structentt_1_1as__view-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1as__view.html b/structentt_1_1as__view.html index 1c515d513..37b454502 100644 --- a/structentt_1_1as__view.html +++ b/structentt_1_1as__view.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1as__void__t.html b/structentt_1_1as__void__t.html index f9144790f..50f74757b 100644 --- a/structentt_1_1as__void__t.html +++ b/structentt_1_1as__void__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__collector.html b/structentt_1_1basic__collector.html index 0c1929d74..f484cf314 100644 --- a/structentt_1_1basic__collector.html +++ b/structentt_1_1basic__collector.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html index d17759c63..3f15a1d70 100644 --- a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html +++ b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_2946084b83498520c73ff3a9eb022209.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html index 088cfd0a7..46662a2b6 100644 --- a/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html +++ b/structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__collector_3_4-members.html b/structentt_1_1basic__collector_3_4-members.html index 6ae3fb790..4470984d7 100644 --- a/structentt_1_1basic__collector_3_4-members.html +++ b/structentt_1_1basic__collector_3_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__collector_3_4.html b/structentt_1_1basic__collector_3_4.html index 677592358..f2311b922 100644 --- a/structentt_1_1basic__collector_3_4.html +++ b/structentt_1_1basic__collector_3_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__component__traits.html b/structentt_1_1basic__component__traits.html deleted file mode 100644 index 09dc1d3d0..000000000 --- a/structentt_1_1basic__component__traits.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - -EnTT: entt::basic_component_traits Struct Reference - - - - - - - - - -
-
-
std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator> > entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::find std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator> > entt::dense_set< Type, Hash, KeyEqual, Allocator >::find ( const Other &  value) - + - + @@ -1648,12 +1573,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 630 of file dense_hash_set.hpp.

+

Definition at line 604 of file dense_set.hpp.

- -

◆ find() [4/4]

+ +

◆ find() [4/4]

@@ -1664,9 +1589,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -80,27 +80,31 @@ $(function() {
8 template<typename>
9 class delegate;
10 
-
11 class dispatcher;
-
12 
-
13 template<typename>
-
14 class emitter;
-
15 
-
16 class connection;
-
17 
-
18 struct scoped_connection;
-
19 
-
20 template<typename>
-
21 class sink;
-
22 
-
23 template<typename Type, typename = std::allocator<delegate<Type>>>
-
24 class sigh;
-
25 
-
26 } // namespace entt
-
27 
-
28 #endif
-
entt::sigh
Unmanaged signal handler.
Definition: fwd.hpp:24
-
entt::sink
Sink class.
Definition: fwd.hpp:21
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
11 template<typename = std::allocator<char>>
+
12 class basic_dispatcher;
+
13 
+
14 template<typename>
+
15 class emitter;
+
16 
+
17 class connection;
+
18 
+
19 struct scoped_connection;
+
20 
+
21 template<typename>
+
22 class sink;
+
23 
+
24 template<typename Type, typename = std::allocator<Type *>>
+
25 class sigh;
+
26 
+
28 using dispatcher = basic_dispatcher<>;
+
29 
+
30 } // namespace entt
+
31 
+
32 #endif
+
entt::basic_dispatcher
Basic dispatcher implementation.
Definition: dispatcher.hpp:118
+
entt::sigh
Unmanaged signal handler.
Definition: fwd.hpp:25
+
entt::sink
Sink class.
Definition: fwd.hpp:22
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::delegate
delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>
Deduction guide.
diff --git a/snapshot_8hpp_source.html b/snapshot_8hpp_source.html index 3caef7adc..56acbe1c2 100644 --- a/snapshot_8hpp_source.html +++ b/snapshot_8hpp_source.html @@ -22,7 +22,7 @@ @@ -81,7 +81,7 @@ $(function() {
9 #include <utility>
10 #include <vector>
11 #include "../config/config.h"
-
12 #include "../container/dense_hash_map.hpp"
+
12 #include "../container/dense_map.hpp"
13 #include "../core/type_traits.hpp"
14 #include "component.hpp"
15 #include "entity.hpp"
@@ -127,12 +127,12 @@ $(function() {
70  basic_snapshot(const basic_registry<entity_type> &source) ENTT_NOEXCEPT
71  : reg{&source} {}
72 
-
74  basic_snapshot(basic_snapshot &&) = default;
+
74  basic_snapshot(basic_snapshot &&) ENTT_NOEXCEPT = default;
75 
-
77  basic_snapshot &operator=(basic_snapshot &&) = default;
+
77  basic_snapshot &operator=(basic_snapshot &&) ENTT_NOEXCEPT = default;
78 
-
89  template<typename Archive>
-
90  const basic_snapshot &entities(Archive &archive) const {
+
89  template<typename Archive>
+
90  const basic_snapshot &entities(Archive &archive) const {
91  const auto sz = reg->size();
92 
93  archive(typename entity_traits::entity_type(sz + 1u));
@@ -174,25 +174,25 @@ $(function() {
164  template<typename Type, typename Archive>
165  void assign(Archive &archive) const {
166  typename entity_traits::entity_type length{};
-
167  archive(length);
+
167  entity_type entt;
168 
-
169  entity_type entt{};
+
169  archive(length);
170 
-
171  if constexpr(ignore_as_empty_v<std::remove_const_t<Type>>) {
+
171  if constexpr(ignore_as_empty_v<Type>) {
172  while(length--) {
173  archive(entt);
174  const auto entity = reg->valid(entt) ? entt : reg->create(entt);
175  ENTT_ASSERT(entity == entt, "Entity not available for use");
-
176  reg->template emplace<Type>(entity);
+
176  reg->template emplace<Type>(entt);
177  }
178  } else {
-
179  Type instance{};
+
179  Type instance;
180 
181  while(length--) {
182  archive(entt, instance);
183  const auto entity = reg->valid(entt) ? entt : reg->create(entt);
184  ENTT_ASSERT(entity == entt, "Entity not available for use");
-
185  reg->template emplace<Type>(entity, std::move(instance));
+
185  reg->template emplace<Type>(entt, std::move(instance));
186  }
187  }
188  }
@@ -206,12 +206,12 @@ $(function() {
201  ENTT_ASSERT(reg->empty(), "Registry must be empty");
202  }
203 
-
205  basic_snapshot_loader(basic_snapshot_loader &&) = default;
+
205  basic_snapshot_loader(basic_snapshot_loader &&) ENTT_NOEXCEPT = default;
206 
-
208  basic_snapshot_loader &operator=(basic_snapshot_loader &&) = default;
+
208  basic_snapshot_loader &operator=(basic_snapshot_loader &&) ENTT_NOEXCEPT = default;
209 
-
220  template<typename Archive>
-
221  const basic_snapshot_loader &entities(Archive &archive) const {
+
220  template<typename Archive>
+
221  const basic_snapshot_loader &entities(Archive &archive) const {
222  typename entity_traits::entity_type length{};
223 
224  archive(length);
@@ -251,19 +251,19 @@ $(function() {
297  using entity_traits = entt_traits<Entity>;
298 
299  void destroy(Entity entt) {
-
300  if(const auto it = remloc.find(entt); it == remloc.cend()) {
+
300  if(const auto it = remloc.find(entt); it == remloc.cend()) {
301  const auto local = reg->create();
-
302  remloc.emplace(entt, std::make_pair(local, true));
+
302  remloc.emplace(entt, std::make_pair(local, true));
303  reg->destroy(local);
304  }
305  }
306 
307  void restore(Entity entt) {
-
308  const auto it = remloc.find(entt);
+
308  const auto it = remloc.find(entt);
309 
-
310  if(it == remloc.cend()) {
+
310  if(it == remloc.cend()) {
311  const auto local = reg->create();
-
312  remloc.emplace(entt, std::make_pair(local, true));
+
312  remloc.emplace(entt, std::make_pair(local, true));
313  } else {
314  if(!reg->valid(remloc[entt].first)) {
315  remloc[entt].first = reg->create();
@@ -275,207 +275,205 @@ $(function() {
321  }
322 
323  template<typename Container>
-
324  auto update(int, Container &container)
-
325  -> decltype(typename Container::mapped_type{}, void()) {
-
326  // map like container
-
327  Container other;
-
328 
-
329  for(auto &&pair: container) {
-
330  using first_type = std::remove_const_t<typename std::decay_t<decltype(pair)>::first_type>;
-
331  using second_type = typename std::decay_t<decltype(pair)>::second_type;
-
332 
-
333  if constexpr(std::is_same_v<first_type, entity_type> && std::is_same_v<second_type, entity_type>) {
-
334  other.emplace(map(pair.first), map(pair.second));
-
335  } else if constexpr(std::is_same_v<first_type, entity_type>) {
-
336  other.emplace(map(pair.first), std::move(pair.second));
-
337  } else {
-
338  static_assert(std::is_same_v<second_type, entity_type>, "Neither the key nor the value are of entity type");
-
339  other.emplace(std::move(pair.first), map(pair.second));
-
340  }
-
341  }
-
342 
-
343  std::swap(container, other);
+
324  auto update(int, Container &container) -> decltype(typename Container::mapped_type{}, void()) {
+
325  // map like container
+
326  Container other;
+
327 
+
328  for(auto &&pair: container) {
+
329  using first_type = std::remove_const_t<typename std::decay_t<decltype(pair)>::first_type>;
+
330  using second_type = typename std::decay_t<decltype(pair)>::second_type;
+
331 
+
332  if constexpr(std::is_same_v<first_type, entity_type> && std::is_same_v<second_type, entity_type>) {
+
333  other.emplace(map(pair.first), map(pair.second));
+
334  } else if constexpr(std::is_same_v<first_type, entity_type>) {
+
335  other.emplace(map(pair.first), std::move(pair.second));
+
336  } else {
+
337  static_assert(std::is_same_v<second_type, entity_type>, "Neither the key nor the value are of entity type");
+
338  other.emplace(std::move(pair.first), map(pair.second));
+
339  }
+
340  }
+
341 
+
342  using std::swap;
+
343  swap(container, other);
344  }
345 
346  template<typename Container>
-
347  auto update(char, Container &container)
-
348  -> decltype(typename Container::value_type{}, void()) {
-
349  // vector like container
-
350  static_assert(std::is_same_v<typename Container::value_type, entity_type>, "Invalid value type");
-
351 
-
352  for(auto &&entt: container) {
-
353  entt = map(entt);
-
354  }
-
355  }
-
356 
-
357  template<typename Other, typename Type, typename Member>
-
358  void update([[maybe_unused]] Other &instance, [[maybe_unused]] Member Type::*member) {
-
359  if constexpr(!std::is_same_v<Other, Type>) {
-
360  return;
-
361  } else if constexpr(std::is_same_v<Member, entity_type>) {
-
362  instance.*member = map(instance.*member);
-
363  } else {
-
364  // maybe a container? let's try...
-
365  update(0, instance.*member);
-
366  }
-
367  }
-
368 
-
369  template<typename Component>
-
370  void remove_if_exists() {
-
371  for(auto &&ref: remloc) {
-
372  const auto local = ref.second.first;
-
373 
-
374  if(reg->valid(local)) {
-
375  reg->template remove<Component>(local);
-
376  }
-
377  }
-
378  }
-
379 
-
380  template<typename Other, typename Archive, typename... Type, typename... Member>
-
381  void assign(Archive &archive, [[maybe_unused]] Member Type::*...member) {
-
382  typename entity_traits::entity_type length{};
-
383  archive(length);
-
384 
-
385  entity_type entt{};
-
386 
-
387  if constexpr(ignore_as_empty_v<std::remove_const_t<Other>>) {
-
388  while(length--) {
-
389  archive(entt);
-
390  restore(entt);
-
391  reg->template emplace_or_replace<Other>(map(entt));
-
392  }
-
393  } else {
-
394  Other instance{};
-
395 
-
396  while(length--) {
-
397  archive(entt, instance);
-
398  (update(instance, member), ...);
-
399  restore(entt);
-
400  reg->template emplace_or_replace<Other>(map(entt), std::move(instance));
-
401  }
-
402  }
-
403  }
-
404 
-
405 public:
-
407  using entity_type = Entity;
-
408 
-
413  basic_continuous_loader(basic_registry<entity_type> &source) ENTT_NOEXCEPT
-
414  : reg{&source} {}
-
415 
-
417  basic_continuous_loader(basic_continuous_loader &&) = default;
-
418 
-
420  basic_continuous_loader &operator=(basic_continuous_loader &&) = default;
-
421 
-
432  template<typename Archive>
-
433  basic_continuous_loader &entities(Archive &archive) {
-
434  typename entity_traits::entity_type length{};
-
435  entity_type entt{};
-
436 
-
437  archive(length);
-
438  // discards the head of the list of destroyed entities
-
439  archive(entt);
-
440 
-
441  for(std::size_t pos{}, last = length - 1u; pos < last; ++pos) {
-
442  archive(entt);
-
443 
-
444  if(const auto entity = entity_traits::to_entity(entt); entity == pos) {
-
445  restore(entt);
-
446  } else {
-
447  destroy(entt);
-
448  }
-
449  }
-
450 
-
451  return *this;
-
452  }
-
453 
-
473  template<typename... Component, typename Archive, typename... Type, typename... Member>
-
474  basic_continuous_loader &component(Archive &archive, Member Type::*...member) {
-
475  (remove_if_exists<Component>(), ...);
-
476  (assign<Component>(archive, member...), ...);
-
477  return *this;
-
478  }
-
479 
-
488  basic_continuous_loader &shrink() {
-
489  auto it = remloc.begin();
-
490 
-
491  while(it != remloc.cend()) {
-
492  const auto local = it->second.first;
-
493  bool &dirty = it->second.second;
-
494 
-
495  if(dirty) {
-
496  dirty = false;
-
497  ++it;
-
498  } else {
-
499  if(reg->valid(local)) {
-
500  reg->destroy(local);
-
501  }
-
502 
-
503  it = remloc.erase(it);
-
504  }
-
505  }
-
506 
-
507  return *this;
-
508  }
-
509 
-
520  basic_continuous_loader &orphans() {
-
521  reg->each([this](const auto entt) {
-
522  if(reg->orphan(entt)) {
-
523  reg->release(entt);
-
524  }
-
525  });
-
526 
-
527  return *this;
-
528  }
-
529 
-
535  [[nodiscard]] bool contains(entity_type entt) const ENTT_NOEXCEPT {
-
536  return (remloc.find(entt) != remloc.cend());
-
537  }
-
538 
-
544  [[nodiscard]] entity_type map(entity_type entt) const ENTT_NOEXCEPT {
-
545  const auto it = remloc.find(entt);
-
546  entity_type other = null;
-
547 
-
548  if(it != remloc.cend()) {
-
549  other = it->second.first;
-
550  }
-
551 
-
552  return other;
-
553  }
-
554 
-
555 private:
-
556  dense_hash_map<entity_type, std::pair<entity_type, bool>> remloc;
-
557  basic_registry<entity_type> *reg;
-
558 };
-
559 
-
560 } // namespace entt
-
561 
-
562 #endif
+
347  auto update(char, Container &container) -> decltype(typename Container::value_type{}, void()) {
+
348  // vector like container
+
349  static_assert(std::is_same_v<typename Container::value_type, entity_type>, "Invalid value type");
+
350 
+
351  for(auto &&entt: container) {
+
352  entt = map(entt);
+
353  }
+
354  }
+
355 
+
356  template<typename Other, typename Type, typename Member>
+
357  void update([[maybe_unused]] Other &instance, [[maybe_unused]] Member Type::*member) {
+
358  if constexpr(!std::is_same_v<Other, Type>) {
+
359  return;
+
360  } else if constexpr(std::is_same_v<Member, entity_type>) {
+
361  instance.*member = map(instance.*member);
+
362  } else {
+
363  // maybe a container? let's try...
+
364  update(0, instance.*member);
+
365  }
+
366  }
+
367 
+
368  template<typename Component>
+
369  void remove_if_exists() {
+
370  for(auto &&ref: remloc) {
+
371  const auto local = ref.second.first;
+
372 
+
373  if(reg->valid(local)) {
+
374  reg->template remove<Component>(local);
+
375  }
+
376  }
+
377  }
+
378 
+
379  template<typename Other, typename Archive, typename... Type, typename... Member>
+
380  void assign(Archive &archive, [[maybe_unused]] Member Type::*...member) {
+
381  typename entity_traits::entity_type length{};
+
382  entity_type entt;
+
383 
+
384  archive(length);
+
385 
+
386  if constexpr(ignore_as_empty_v<Other>) {
+
387  while(length--) {
+
388  archive(entt);
+
389  restore(entt);
+
390  reg->template emplace_or_replace<Other>(map(entt));
+
391  }
+
392  } else {
+
393  Other instance;
+
394 
+
395  while(length--) {
+
396  archive(entt, instance);
+
397  (update(instance, member), ...);
+
398  restore(entt);
+
399  reg->template emplace_or_replace<Other>(map(entt), std::move(instance));
+
400  }
+
401  }
+
402  }
+
403 
+
404 public:
+
406  using entity_type = Entity;
+
407 
+
412  basic_continuous_loader(basic_registry<entity_type> &source) ENTT_NOEXCEPT
+
413  : reg{&source} {}
+
414 
+
416  basic_continuous_loader(basic_continuous_loader &&) = default;
+
417 
+
419  basic_continuous_loader &operator=(basic_continuous_loader &&) = default;
+
420 
+
431  template<typename Archive>
+
432  basic_continuous_loader &entities(Archive &archive) {
+
433  typename entity_traits::entity_type length{};
+
434  entity_type entt{};
+
435 
+
436  archive(length);
+
437  // discards the head of the list of destroyed entities
+
438  archive(entt);
+
439 
+
440  for(std::size_t pos{}, last = length - 1u; pos < last; ++pos) {
+
441  archive(entt);
+
442 
+
443  if(const auto entity = entity_traits::to_entity(entt); entity == pos) {
+
444  restore(entt);
+
445  } else {
+
446  destroy(entt);
+
447  }
+
448  }
+
449 
+
450  return *this;
+
451  }
+
452 
+
472  template<typename... Component, typename Archive, typename... Type, typename... Member>
+
473  basic_continuous_loader &component(Archive &archive, Member Type::*...member) {
+
474  (remove_if_exists<Component>(), ...);
+
475  (assign<Component>(archive, member...), ...);
+
476  return *this;
+
477  }
+
478 
+
487  basic_continuous_loader &shrink() {
+
488  auto it = remloc.begin();
+
489 
+
490  while(it != remloc.cend()) {
+
491  const auto local = it->second.first;
+
492  bool &dirty = it->second.second;
+
493 
+
494  if(dirty) {
+
495  dirty = false;
+
496  ++it;
+
497  } else {
+
498  if(reg->valid(local)) {
+
499  reg->destroy(local);
+
500  }
+
501 
+
502  it = remloc.erase(it);
+
503  }
+
504  }
+
505 
+
506  return *this;
+
507  }
+
508 
+
519  basic_continuous_loader &orphans() {
+
520  reg->each([this](const auto entt) {
+
521  if(reg->orphan(entt)) {
+
522  reg->release(entt);
+
523  }
+
524  });
+
525 
+
526  return *this;
+
527  }
+
528 
+
534  [[nodiscard]] bool contains(entity_type entt) const ENTT_NOEXCEPT {
+
535  return (remloc.find(entt) != remloc.cend());
+
536  }
+
537 
+
543  [[nodiscard]] entity_type map(entity_type entt) const ENTT_NOEXCEPT {
+
544  const auto it = remloc.find(entt);
+
545  entity_type other = null;
+
546 
+
547  if(it != remloc.cend()) {
+
548  other = it->second.first;
+
549  }
+
550 
+
551  return other;
+
552  }
+
553 
+
554 private:
+
555  dense_map<entity_type, std::pair<entity_type, bool>> remloc;
+
556  basic_registry<entity_type> *reg;
+
557 };
+
558 
+
559 } // namespace entt
+
560 
+
561 #endif
entt::basic_continuous_loader
Utility class for continuous loading.
Definition: snapshot.hpp:296
-
entt::basic_continuous_loader::shrink
basic_continuous_loader & shrink()
Helps to purge entities that no longer have a conterpart.
Definition: snapshot.hpp:488
-
entt::basic_continuous_loader::component
basic_continuous_loader & component(Archive &archive, Member Type::*...member)
Restores components and assigns them to the right entities.
Definition: snapshot.hpp:474
-
entt::basic_continuous_loader::contains
bool contains(entity_type entt) const
Tests if a loader knows about a given entity.
Definition: snapshot.hpp:535
+
entt::basic_continuous_loader::shrink
basic_continuous_loader & shrink()
Helps to purge entities that no longer have a conterpart.
Definition: snapshot.hpp:487
+
entt::basic_continuous_loader::component
basic_continuous_loader & component(Archive &archive, Member Type::*...member)
Restores components and assigns them to the right entities.
Definition: snapshot.hpp:473
+
entt::basic_continuous_loader::contains
bool contains(entity_type entt) const
Tests if a loader knows about a given entity.
Definition: snapshot.hpp:534
entt::basic_continuous_loader::basic_continuous_loader
basic_continuous_loader(basic_continuous_loader &&)=default
Default move constructor.
-
entt::basic_continuous_loader::map
entity_type map(entity_type entt) const
Returns the identifier to which an entity refers.
Definition: snapshot.hpp:544
-
entt::basic_continuous_loader::entity_type
Entity entity_type
Underlying entity identifier.
Definition: snapshot.hpp:407
-
entt::basic_continuous_loader::orphans
basic_continuous_loader & orphans()
Destroys those entities that have no components.
Definition: snapshot.hpp:520
-
entt::basic_continuous_loader::entities
basic_continuous_loader & entities(Archive &archive)
Restores entities that were in use during serialization.
Definition: snapshot.hpp:433
-
entt::basic_continuous_loader::basic_continuous_loader
basic_continuous_loader(basic_registry< entity_type > &source)
Constructs an instance that is bound to a given registry.
Definition: snapshot.hpp:413
+
entt::basic_continuous_loader::map
entity_type map(entity_type entt) const
Returns the identifier to which an entity refers.
Definition: snapshot.hpp:543
+
entt::basic_continuous_loader::entity_type
Entity entity_type
Underlying entity identifier.
Definition: snapshot.hpp:406
+
entt::basic_continuous_loader::orphans
basic_continuous_loader & orphans()
Destroys those entities that have no components.
Definition: snapshot.hpp:519
+
entt::basic_continuous_loader::entities
basic_continuous_loader & entities(Archive &archive)
Restores entities that were in use during serialization.
Definition: snapshot.hpp:432
+
entt::basic_continuous_loader::basic_continuous_loader
basic_continuous_loader(basic_registry< entity_type > &source)
Constructs an instance that is bound to a given registry.
Definition: snapshot.hpp:412
entt::basic_continuous_loader::operator=
basic_continuous_loader & operator=(basic_continuous_loader &&)=default
Default move assignment operator.
entt::basic_registry< entity_type >
-
entt::basic_registry::orphan
bool orphan(const entity_type entity) const
Checks if an entity has components assigned.
Definition: registry.hpp:1047
-
entt::basic_registry::valid
bool valid(const entity_type entity) const
Checks if an identifier refers to a valid entity.
Definition: registry.hpp:444
-
entt::basic_registry::assign
void assign(It first, It last, const entity_type destroyed)
Assigns identifiers to an empty registry.
Definition: registry.hpp:541
-
entt::basic_registry::released
entity_type released() const
Returns the head of the list of released entities.
Definition: registry.hpp:435
-
entt::basic_registry::empty
bool empty() const
Checks whether the registry is empty (no entities still in use).
Definition: registry.hpp:407
-
entt::basic_registry::size
size_type size() const
Returns the number of entities created so far.
Definition: registry.hpp:368
-
entt::basic_registry::destroy
version_type destroy(const entity_type entity)
Destroys an entity and releases its identifier.
Definition: registry.hpp:608
-
entt::basic_registry::each
void each(Func func) const
Iterates all the entities that are still in use.
Definition: registry.hpp:1028
-
entt::basic_registry::create
entity_type create()
Creates a new entity or recycles a destroyed one.
Definition: registry.hpp:464
-
entt::basic_registry::data
const entity_type * data() const
Direct access to the list of entities of a registry.
Definition: registry.hpp:423
+
entt::basic_registry::orphan
bool orphan(const entity_type entity) const
Checks if an entity has components assigned.
Definition: registry.hpp:1141
+
entt::basic_registry::valid
bool valid(const entity_type entity) const
Checks if an identifier refers to a valid entity.
Definition: registry.hpp:538
+
entt::basic_registry::assign
void assign(It first, It last, const entity_type destroyed)
Assigns identifiers to an empty registry.
Definition: registry.hpp:635
+
entt::basic_registry::released
entity_type released() const
Returns the head of the list of released entities.
Definition: registry.hpp:529
+
entt::basic_registry::empty
bool empty() const
Checks whether the registry is empty (no entities still in use).
Definition: registry.hpp:501
+
entt::basic_registry::size
size_type size() const
Returns the number of entities created so far.
Definition: registry.hpp:462
+
entt::basic_registry::destroy
version_type destroy(const entity_type entity)
Destroys an entity and releases its identifier.
Definition: registry.hpp:702
+
entt::basic_registry::each
void each(Func func) const
Iterates all the entities that are still in use.
Definition: registry.hpp:1122
+
entt::basic_registry::create
entity_type create()
Creates a new entity or recycles a destroyed one.
Definition: registry.hpp:558
+
entt::basic_registry::data
const entity_type * data() const
Direct access to the list of entities of a registry.
Definition: registry.hpp:517
entt::basic_snapshot_loader
Utility class to restore a snapshot as a whole.
Definition: snapshot.hpp:161
entt::basic_snapshot_loader::entities
const basic_snapshot_loader & entities(Archive &archive) const
Restores entities that were in use during serialization.
Definition: snapshot.hpp:221
entt::basic_snapshot_loader::entity_type
Entity entity_type
Underlying entity identifier.
Definition: snapshot.hpp:192
-
entt::basic_snapshot_loader::operator=
basic_snapshot_loader & operator=(basic_snapshot_loader &&)=default
Default move assignment operator.
entt::basic_snapshot_loader::basic_snapshot_loader
basic_snapshot_loader(basic_registry< entity_type > &source)
Constructs an instance that is bound to a given registry.
Definition: snapshot.hpp:198
entt::basic_snapshot_loader::basic_snapshot_loader
basic_snapshot_loader(basic_snapshot_loader &&)=default
Default move constructor.
entt::basic_snapshot_loader::orphans
const basic_snapshot_loader & orphans() const
Destroys those entities that have no components.
Definition: snapshot.hpp:265
@@ -483,24 +481,23 @@ $(function() {
entt::basic_snapshot
Utility class to create snapshots from a registry.
Definition: snapshot.hpp:32
entt::basic_snapshot::component
const basic_snapshot & component(Archive &archive, It first, It last) const
Puts aside the given components for the entities in a range.
Definition: snapshot.hpp:141
entt::basic_snapshot::basic_snapshot
basic_snapshot(basic_snapshot &&)=default
Default move constructor.
-
entt::basic_snapshot::operator=
basic_snapshot & operator=(basic_snapshot &&)=default
Default move assignment operator.
entt::basic_snapshot::component
const basic_snapshot & component(Archive &archive) const
Puts aside the given components.
Definition: snapshot.hpp:115
entt::basic_snapshot::entities
const basic_snapshot & entities(Archive &archive) const
Puts aside all the entities from the underlying registry.
Definition: snapshot.hpp:90
entt::basic_snapshot::basic_snapshot
basic_snapshot(const basic_registry< entity_type > &source)
Constructs an instance that is bound to a given registry.
Definition: snapshot.hpp:70
entt::basic_snapshot::entity_type
Entity entity_type
Underlying entity identifier.
Definition: snapshot.hpp:64
entt::basic_view
View implementation.
Definition: fwd.hpp:20
-
entt::dense_hash_map
Associative container for key-value pairs with unique keys.
Definition: dense_hash_map.hpp:240
-
entt::dense_hash_map::find
iterator find(const key_type &key)
Finds an element with a given key.
Definition: dense_hash_map.hpp:739
-
entt::dense_hash_map::emplace
std::pair< iterator, bool > emplace(Args &&...args)
Constructs an element in-place, if the key does not exist.
Definition: dense_hash_map.hpp:606
-
entt::dense_hash_map::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: dense_hash_map.hpp:488
-
entt::dense_hash_map::erase
iterator erase(const_iterator pos)
Removes an element from a given position.
Definition: dense_hash_map.hpp:646
-
entt::dense_hash_map::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: dense_hash_map.hpp:469
+
entt::dense_map
Associative container for key-value pairs with unique keys.
Definition: dense_map.hpp:265
+
entt::dense_map::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: dense_map.hpp:497
+
entt::dense_map::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: dense_map.hpp:478
+
entt::dense_map::find
iterator find(const key_type &key)
Finds an element with a given key.
Definition: dense_map.hpp:750
+
entt::dense_map::erase
iterator erase(const_iterator pos)
Removes an element from a given position.
Definition: dense_map.hpp:657
+
entt::dense_map::emplace
std::pair< iterator, bool > emplace([[maybe_unused]] Args &&...args)
Constructs an element in-place, if the key does not exist.
Definition: dense_map.hpp:607
entt::entt_traits
Entity traits.
Definition: entity.hpp:62
entt::entt_traits::entity_type
typename base_type::entity_type entity_type
Underlying entity type.
Definition: entity.hpp:69
entt::entt_traits::to_entity
static constexpr entity_type to_entity(const value_type value)
Returns the entity part once converted to the underlying type.
Definition: entity.hpp:91
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::entity
entity
Default entity identifier.
Definition: fwd.hpp:47
-
entt::ignore_as_empty_v
constexpr bool ignore_as_empty_v
Helper variable template.
Definition: component.hpp:33
+
entt::swap
void swap(compressed_pair< First, Second > &lhs, compressed_pair< First, Second > &rhs)
Swaps two compressed pair objects.
Definition: compressed_pair.hpp:248
diff --git a/sparse__set_8hpp_source.html b/sparse__set_8hpp_source.html index 1fa443c50..3355701d8 100644 --- a/sparse__set_8hpp_source.html +++ b/sparse__set_8hpp_source.html @@ -22,7 +22,7 @@
@@ -99,64 +99,64 @@ $(function() {
32  using difference_type = typename Container::difference_type;
33  using iterator_category = std::random_access_iterator_tag;
34 
-
35  sparse_set_iterator() ENTT_NOEXCEPT = default;
-
36 
-
37  sparse_set_iterator(const Container &ref, const difference_type idx) ENTT_NOEXCEPT
-
38  : packed{std::addressof(ref)},
-
39  offset{idx} {}
-
40 
-
41  sparse_set_iterator &operator++() ENTT_NOEXCEPT {
-
42  return --offset, *this;
-
43  }
-
44 
-
45  sparse_set_iterator operator++(int) ENTT_NOEXCEPT {
-
46  sparse_set_iterator orig = *this;
-
47  return ++(*this), orig;
-
48  }
-
49 
-
50  sparse_set_iterator &operator--() ENTT_NOEXCEPT {
-
51  return ++offset, *this;
-
52  }
-
53 
-
54  sparse_set_iterator operator--(int) ENTT_NOEXCEPT {
-
55  sparse_set_iterator orig = *this;
-
56  return operator--(), orig;
-
57  }
-
58 
-
59  sparse_set_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
-
60  offset -= value;
-
61  return *this;
-
62  }
-
63 
-
64  sparse_set_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
-
65  sparse_set_iterator copy = *this;
-
66  return (copy += value);
-
67  }
-
68 
-
69  sparse_set_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
-
70  return (*this += -value);
-
71  }
-
72 
-
73  sparse_set_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
-
74  return (*this + -value);
-
75  }
-
76 
-
77  [[nodiscard]] reference operator[](const difference_type value) const {
-
78  const auto pos = offset - value - 1;
-
79  return packed->data()[pos];
-
80  }
-
81 
-
82  [[nodiscard]] pointer operator->() const {
-
83  const auto pos = offset - 1;
-
84  return packed->data() + pos;
+
35  sparse_set_iterator() ENTT_NOEXCEPT
+
36  : packed{},
+
37  offset{} {}
+
38 
+
39  sparse_set_iterator(const Container &ref, const difference_type idx) ENTT_NOEXCEPT
+
40  : packed{std::addressof(ref)},
+
41  offset{idx} {}
+
42 
+
43  sparse_set_iterator &operator++() ENTT_NOEXCEPT {
+
44  return --offset, *this;
+
45  }
+
46 
+
47  sparse_set_iterator operator++(int) ENTT_NOEXCEPT {
+
48  sparse_set_iterator orig = *this;
+
49  return ++(*this), orig;
+
50  }
+
51 
+
52  sparse_set_iterator &operator--() ENTT_NOEXCEPT {
+
53  return ++offset, *this;
+
54  }
+
55 
+
56  sparse_set_iterator operator--(int) ENTT_NOEXCEPT {
+
57  sparse_set_iterator orig = *this;
+
58  return operator--(), orig;
+
59  }
+
60 
+
61  sparse_set_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
+
62  offset -= value;
+
63  return *this;
+
64  }
+
65 
+
66  sparse_set_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
+
67  sparse_set_iterator copy = *this;
+
68  return (copy += value);
+
69  }
+
70 
+
71  sparse_set_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
+
72  return (*this += -value);
+
73  }
+
74 
+
75  sparse_set_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
+
76  return (*this + -value);
+
77  }
+
78 
+
79  [[nodiscard]] reference operator[](const difference_type value) const ENTT_NOEXCEPT {
+
80  return packed->data()[index() - value];
+
81  }
+
82 
+
83  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
84  return packed->data() + index();
85  }
86 
-
87  [[nodiscard]] reference operator*() const {
+
87  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
88  return *operator->();
89  }
90 
91  [[nodiscard]] difference_type index() const ENTT_NOEXCEPT {
-
92  return offset;
+
92  return offset - 1;
93  }
94 
95 private:
@@ -165,7 +165,7 @@ $(function() {
98 };
99 
100 template<typename Type, typename Other>
-
101 [[nodiscard]] auto operator-(const sparse_set_iterator<Type> &lhs, const sparse_set_iterator<Other> &rhs) ENTT_NOEXCEPT {
+
101 [[nodiscard]] std::ptrdiff_t operator-(const sparse_set_iterator<Type> &lhs, const sparse_set_iterator<Other> &rhs) ENTT_NOEXCEPT {
102  return rhs.index() - lhs.index();
103 }
104 
@@ -208,498 +208,511 @@ $(function() {
149 
173 template<typename Entity, typename Allocator>
174 class basic_sparse_set {
-
175  using allocator_traits = std::allocator_traits<Allocator>;
-
176  using alloc = typename allocator_traits::template rebind_alloc<Entity>;
-
177  using alloc_traits = typename std::allocator_traits<alloc>;
-
178 
+
175  using alloc_traits = std::allocator_traits<Allocator>;
+
176  static_assert(std::is_same_v<typename alloc_traits::value_type, Entity>, "Invalid value type");
+
177  using sparse_container_type = std::vector<typename alloc_traits::pointer, typename alloc_traits::template rebind_alloc<typename alloc_traits::pointer>>;
+
178  using packed_container_type = std::vector<Entity, Allocator>;
179  using entity_traits = entt_traits<Entity>;
-
180  using sparse_container_type = std::vector<typename alloc_traits::pointer, typename alloc_traits::template rebind_alloc<typename alloc_traits::pointer>>;
-
181  using packed_container_type = std::vector<Entity, alloc>;
-
182 
-
183  [[nodiscard]] auto sparse_ptr(const Entity entt) const {
-
184  const auto pos = static_cast<size_type>(entity_traits::to_entity(entt));
-
185  const auto page = pos / entity_traits::page_size;
-
186  return (page < sparse.size() && sparse[page]) ? (sparse[page] + fast_mod(pos, entity_traits::page_size)) : nullptr;
-
187  }
-
188 
-
189  [[nodiscard]] auto &sparse_ref(const Entity entt) const {
-
190  ENTT_ASSERT(sparse_ptr(entt), "Invalid element");
-
191  const auto pos = static_cast<size_type>(entity_traits::to_entity(entt));
-
192  return sparse[pos / entity_traits::page_size][fast_mod(pos, entity_traits::page_size)];
-
193  }
-
194 
-
195  void release_sparse_pages() {
-
196  auto page_allocator{packed.get_allocator()};
-
197 
-
198  for(auto &&page: sparse) {
-
199  if(page != nullptr) {
-
200  std::destroy(page, page + entity_traits::page_size);
-
201  alloc_traits::deallocate(page_allocator, page, entity_traits::page_size);
-
202  page = nullptr;
-
203  }
-
204  }
-
205  }
+
180 
+
181  [[nodiscard]] auto sparse_ptr(const Entity entt) const {
+
182  const auto pos = static_cast<size_type>(entity_traits::to_entity(entt));
+
183  const auto page = pos / entity_traits::page_size;
+
184  return (page < sparse.size() && sparse[page]) ? (sparse[page] + fast_mod(pos, entity_traits::page_size)) : nullptr;
+
185  }
+
186 
+
187  [[nodiscard]] auto &sparse_ref(const Entity entt) const {
+
188  ENTT_ASSERT(sparse_ptr(entt), "Invalid element");
+
189  const auto pos = static_cast<size_type>(entity_traits::to_entity(entt));
+
190  return sparse[pos / entity_traits::page_size][fast_mod(pos, entity_traits::page_size)];
+
191  }
+
192 
+
193  [[nodiscard]] auto &assure_at_least(const Entity entt) {
+
194  const auto pos = static_cast<size_type>(entity_traits::to_entity(entt));
+
195  const auto page = pos / entity_traits::page_size;
+
196 
+
197  if(!(page < sparse.size())) {
+
198  sparse.resize(page + 1u, nullptr);
+
199  }
+
200 
+
201  if(!sparse[page]) {
+
202  auto page_allocator{packed.get_allocator()};
+
203  sparse[page] = alloc_traits::allocate(page_allocator, entity_traits::page_size);
+
204  std::uninitialized_fill(sparse[page], sparse[page] + entity_traits::page_size, null);
+
205  }
206 
-
207 protected:
-
212  virtual const void *get_at(const std::size_t) const ENTT_NOEXCEPT {
-
213  return nullptr;
-
214  }
-
215 
-
217  virtual void swap_at(const std::size_t, const std::size_t) {}
-
218 
-
220  virtual void move_and_pop(const std::size_t, const std::size_t) {}
-
221 
-
226  virtual void swap_and_pop(const Entity entt) {
-
227  auto &ref = sparse_ref(entt);
-
228  const auto pos = static_cast<size_type>(entity_traits::to_entity(ref));
-
229  ENTT_ASSERT(packed[pos] == entt, "Invalid identifier");
-
230 
-
231  packed[pos] = packed.back();
-
232  auto &elem = sparse_ref(packed.back());
-
233  elem = entity_traits::combine(entity_traits::to_integral(ref), entity_traits::to_integral(elem));
-
234  // lazy self-assignment guard
-
235  ref = null;
-
236  // unnecessary but it helps to detect nasty bugs
-
237  ENTT_ASSERT((packed.back() = tombstone, true), "");
-
238  packed.pop_back();
-
239  }
-
240 
-
245  virtual void in_place_pop(const Entity entt) {
-
246  auto &ref = sparse_ref(entt);
-
247  const auto pos = static_cast<size_type>(entity_traits::to_entity(ref));
-
248  ENTT_ASSERT(packed[pos] == entt, "Invalid identifier");
-
249 
-
250  packed[pos] = std::exchange(free_list, entity_traits::combine(static_cast<typename entity_traits::entity_type>(pos), entity_traits::reserved));
-
251  // lazy self-assignment guard
-
252  ref = null;
-
253  }
-
254 
-
259  virtual void try_emplace(const Entity entt, const void * = nullptr) {
-
260  const auto pos = static_cast<size_type>(entity_traits::to_entity(entt));
-
261  const auto page = pos / entity_traits::page_size;
-
262 
-
263  if(!(page < sparse.size())) {
-
264  sparse.resize(page + 1u, nullptr);
-
265  }
-
266 
-
267  if(!sparse[page]) {
-
268  auto page_allocator{packed.get_allocator()};
-
269  sparse[page] = alloc_traits::allocate(page_allocator, entity_traits::page_size);
-
270  std::uninitialized_fill(sparse[page], sparse[page] + entity_traits::page_size, null);
-
271  }
-
272 
-
273  auto &elem = sparse[page][fast_mod(pos, entity_traits::page_size)];
-
274  ENTT_ASSERT(entity_traits::to_version(elem) == entity_traits::to_version(tombstone), "Slot not available");
-
275 
-
276  if(free_list == null) {
-
277  elem = entity_traits::combine(static_cast<typename entity_traits::entity_type>(packed.size()), entity_traits::to_integral(entt));
-
278  packed.push_back(entt);
-
279  } else {
+
207  auto &elem = sparse[page][fast_mod(pos, entity_traits::page_size)];
+
208  ENTT_ASSERT(entity_traits::to_version(elem) == entity_traits::to_version(tombstone), "Slot not available");
+
209  return elem;
+
210  }
+
211 
+
212  void release_sparse_pages() {
+
213  auto page_allocator{packed.get_allocator()};
+
214 
+
215  for(auto &&page: sparse) {
+
216  if(page != nullptr) {
+
217  std::destroy(page, page + entity_traits::page_size);
+
218  alloc_traits::deallocate(page_allocator, page, entity_traits::page_size);
+
219  page = nullptr;
+
220  }
+
221  }
+
222  }
+
223 
+
224 private:
+
225  virtual const void *get_at(const std::size_t) const {
+
226  return nullptr;
+
227  }
+
228 
+
229  virtual void swap_at(const std::size_t, const std::size_t) {}
+
230  virtual void move_element(const std::size_t, const std::size_t) {}
+
231 
+
232 protected:
+
234  using basic_iterator = internal::sparse_set_iterator<packed_container_type>;
+
235 
+
241  virtual void swap_and_pop(basic_iterator first, basic_iterator last) {
+
242  for(; first != last; ++first) {
+
243  sparse_ref(packed.back()) = entity_traits::combine(static_cast<typename entity_traits::entity_type>(first.index()), entity_traits::to_integral(packed.back()));
+
244  const auto entt = std::exchange(packed[first.index()], packed.back());
+
245  // unnecessary but it helps to detect nasty bugs
+
246  ENTT_ASSERT((packed.back() = tombstone, true), "");
+
247  // lazy self-assignment guard
+
248  sparse_ref(entt) = null;
+
249  packed.pop_back();
+
250  }
+
251  }
+
252 
+
258  virtual void in_place_pop(basic_iterator first, basic_iterator last) {
+
259  for(; first != last; ++first) {
+
260  sparse_ref(*first) = null;
+
261  packed[first.index()] = std::exchange(free_list, entity_traits::combine(static_cast<typename entity_traits::entity_type>(first.index()), entity_traits::reserved));
+
262  }
+
263  }
+
264 
+
271  virtual basic_iterator try_emplace(const Entity entt, const bool force_back, const void * = nullptr) {
+
272  ENTT_ASSERT(!contains(entt), "Set already contains entity");
+
273 
+
274  if(auto &elem = assure_at_least(entt); free_list == null || force_back) {
+
275  packed.push_back(entt);
+
276  elem = entity_traits::combine(static_cast<typename entity_traits::entity_type>(packed.size() - 1u), entity_traits::to_integral(entt));
+
277  return begin();
+
278  } else {
+
279  const auto pos = static_cast<size_type>(entity_traits::to_entity(free_list));
280  elem = entity_traits::combine(entity_traits::to_integral(free_list), entity_traits::to_integral(entt));
-
281  free_list = std::exchange(packed[static_cast<size_type>(entity_traits::to_entity(free_list))], entt);
-
282  }
-
283  }
-
284 
-
285 public:
-
287  using allocator_type = Allocator;
-
289  using entity_type = Entity;
-
291  using version_type = typename entity_traits::version_type;
-
293  using size_type = typename packed_container_type::size_type;
-
295  using pointer = typename packed_container_type::const_pointer;
-
297  using iterator = internal::sparse_set_iterator<packed_container_type>;
-
299  using const_iterator = iterator;
-
301  using reverse_iterator = std::reverse_iterator<iterator>;
-
303  using const_reverse_iterator = reverse_iterator;
-
304 
-
306  basic_sparse_set()
-
307  : basic_sparse_set{type_id<void>()} {}
-
308 
-
313  explicit basic_sparse_set(const allocator_type &allocator)
-
314  : basic_sparse_set{type_id<void>(), deletion_policy::swap_and_pop, allocator} {}
-
315 
-
321  explicit basic_sparse_set(deletion_policy pol, const allocator_type &allocator = {})
-
322  : basic_sparse_set{type_id<void>(), pol, allocator} {}
-
323 
-
330  explicit basic_sparse_set(const type_info &value, deletion_policy pol = deletion_policy::swap_and_pop, const allocator_type &allocator = {})
-
331  : sparse{allocator},
-
332  packed{allocator},
-
333  info{&value},
-
334  free_list{tombstone},
-
335  mode{pol} {}
-
336 
-
341  basic_sparse_set(basic_sparse_set &&other) ENTT_NOEXCEPT
-
342  : sparse{std::move(other.sparse)},
-
343  packed{std::move(other.packed)},
-
344  info{other.info},
-
345  free_list{std::exchange(other.free_list, tombstone)},
-
346  mode{other.mode} {}
-
347 
-
353  basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator) ENTT_NOEXCEPT
-
354  : sparse{std::move(other.sparse), allocator},
-
355  packed{std::move(other.packed), allocator},
-
356  info{other.info},
-
357  free_list{std::exchange(other.free_list, tombstone)},
-
358  mode{other.mode} {
-
359  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.get_allocator() == other.packed.get_allocator(), "Copying a sparse set is not allowed");
-
360  }
-
361 
-
363  virtual ~basic_sparse_set() {
-
364  release_sparse_pages();
-
365  }
-
366 
-
372  basic_sparse_set &operator=(basic_sparse_set &&other) ENTT_NOEXCEPT {
-
373  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.get_allocator() == other.packed.get_allocator(), "Copying a sparse set is not allowed");
-
374 
-
375  release_sparse_pages();
-
376  sparse = std::move(other.sparse);
-
377  packed = std::move(other.packed);
-
378  info = other.info;
-
379  free_list = std::exchange(other.free_list, tombstone);
-
380  mode = other.mode;
-
381  return *this;
-
382  }
-
383 
-
388  void swap(basic_sparse_set &other) {
-
389  using std::swap;
-
390  swap(sparse, other.sparse);
-
391  swap(packed, other.packed);
-
392  swap(info, other.info);
-
393  swap(free_list, other.free_list);
-
394  swap(mode, other.mode);
-
395  }
-
396 
-
401  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
-
402  return packed.get_allocator();
-
403  }
-
404 
-
409  [[nodiscard]] deletion_policy policy() const ENTT_NOEXCEPT {
-
410  return mode;
-
411  }
-
412 
-
417  [[nodiscard]] size_type slot() const ENTT_NOEXCEPT {
-
418  return free_list == null ? packed.size() : static_cast<size_type>(entity_traits::to_entity(free_list));
-
419  }
-
420 
-
429  virtual void reserve(const size_type cap) {
-
430  packed.reserve(cap);
-
431  }
-
432 
-
438  [[nodiscard]] virtual size_type capacity() const ENTT_NOEXCEPT {
-
439  return packed.capacity();
-
440  }
-
441 
-
443  virtual void shrink_to_fit() {
-
444  packed.shrink_to_fit();
-
445  }
-
446 
-
457  [[nodiscard]] size_type extent() const ENTT_NOEXCEPT {
-
458  return sparse.size() * entity_traits::page_size;
-
459  }
-
460 
-
471  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
-
472  return packed.size();
-
473  }
-
474 
-
479  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
-
480  return packed.empty();
-
481  }
-
482 
-
487  [[nodiscard]] pointer data() const ENTT_NOEXCEPT {
-
488  return packed.data();
-
489  }
-
490 
-
500  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
-
501  const auto pos = static_cast<typename iterator::difference_type>(packed.size());
-
502  return iterator{packed, pos};
-
503  }
-
504 
-
506  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
-
507  return begin();
-
508  }
-
509 
-
520  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
-
521  return iterator{packed, {}};
-
522  }
-
523 
-
525  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
-
526  return end();
-
527  }
-
528 
-
539  [[nodiscard]] const_reverse_iterator rbegin() const ENTT_NOEXCEPT {
-
540  return std::make_reverse_iterator(end());
-
541  }
-
542 
-
544  [[nodiscard]] const_reverse_iterator crbegin() const ENTT_NOEXCEPT {
-
545  return rbegin();
-
546  }
-
547 
-
558  [[nodiscard]] reverse_iterator rend() const ENTT_NOEXCEPT {
-
559  return std::make_reverse_iterator(begin());
-
560  }
-
561 
-
563  [[nodiscard]] const_reverse_iterator crend() const ENTT_NOEXCEPT {
-
564  return rend();
-
565  }
-
566 
-
573  [[nodiscard]] iterator find(const entity_type entt) const ENTT_NOEXCEPT {
-
574  return contains(entt) ? --(end() - index(entt)) : end();
-
575  }
-
576 
-
582  [[nodiscard]] bool contains(const entity_type entt) const ENTT_NOEXCEPT {
-
583  const auto elem = sparse_ptr(entt);
-
584  constexpr auto cap = entity_traits::to_entity(null);
-
585  // testing versions permits to avoid accessing the packed array
-
586  return elem && (((~cap & entity_traits::to_integral(entt)) ^ entity_traits::to_integral(*elem)) < cap);
-
587  }
-
588 
-
595  [[nodiscard]] version_type current(const entity_type entt) const {
-
596  const auto elem = sparse_ptr(entt);
-
597  constexpr auto fallback = entity_traits::to_version(tombstone);
-
598  return elem ? entity_traits::to_version(*elem) : fallback;
-
599  }
-
600 
-
611  [[nodiscard]] size_type index(const entity_type entt) const ENTT_NOEXCEPT {
-
612  ENTT_ASSERT(contains(entt), "Set does not contain entity");
-
613  return static_cast<size_type>(entity_traits::to_entity(sparse_ref(entt)));
-
614  }
-
615 
-
621  [[nodiscard]] entity_type at(const size_type pos) const ENTT_NOEXCEPT {
-
622  return pos < packed.size() ? packed[pos] : null;
-
623  }
-
624 
-
630  [[nodiscard]] entity_type operator[](const size_type pos) const ENTT_NOEXCEPT {
-
631  ENTT_ASSERT(pos < packed.size(), "Position is out of bounds");
-
632  return packed[pos];
-
633  }
-
634 
-
645  const void *get(const entity_type entt) const ENTT_NOEXCEPT {
-
646  ENTT_ASSERT(contains(entt), "Set does not contain entity");
-
647  return get_at(index(entt));
-
648  }
-
649 
-
651  void *get(const entity_type entt) ENTT_NOEXCEPT {
-
652  return const_cast<void *>(std::as_const(*this).get(entt));
-
653  }
-
654 
-
665  void emplace(const entity_type entt, const void *value = nullptr) {
-
666  try_emplace(entt, value);
-
667  ENTT_ASSERT(contains(entt), "Emplace did not take place");
-
668  }
-
669 
-
681  template<typename It>
-
682  void insert(It first, It last) {
-
683  for(; first != last && free_list != null; ++first) {
-
684  emplace(*first);
-
685  }
-
686 
-
687  reserve(packed.size() + std::distance(first, last));
-
688 
-
689  for(; first != last; ++first) {
-
690  emplace(*first);
-
691  }
-
692  }
-
693 
-
703  void erase(const entity_type entt) {
-
704  ENTT_ASSERT(contains(entt), "Set does not contain entity");
-
705  (mode == deletion_policy::in_place) ? in_place_pop(entt) : swap_and_pop(entt);
-
706  ENTT_ASSERT(!contains(entt), "Destruction did not take place");
-
707  }
-
708 
-
718  template<typename It>
-
719  void erase(It first, It last) {
-
720  for(; first != last; ++first) {
-
721  erase(*first);
-
722  }
-
723  }
-
724 
-
730  bool remove(const entity_type entt) {
-
731  return contains(entt) && (erase(entt), true);
-
732  }
-
733 
-
741  template<typename It>
-
742  size_type remove(It first, It last) {
-
743  size_type found{};
-
744 
-
745  for(; first != last; ++first) {
-
746  found += remove(*first);
-
747  }
-
748 
-
749  return found;
-
750  }
-
751 
-
753  void compact() {
-
754  size_type next = packed.size();
-
755  for(; next && packed[next - 1u] == tombstone; --next) {}
-
756 
-
757  for(auto *it = &free_list; *it != null && next; it = std::addressof(packed[entity_traits::to_entity(*it)])) {
-
758  if(const size_type pos = entity_traits::to_entity(*it); pos < next) {
-
759  --next;
-
760  move_and_pop(next, pos);
-
761  std::swap(packed[next], packed[pos]);
-
762  const auto entity = static_cast<typename entity_traits::entity_type>(pos);
-
763  sparse_ref(packed[pos]) = entity_traits::combine(entity, entity_traits::to_integral(packed[pos]));
-
764  *it = entity_traits::combine(static_cast<typename entity_traits::entity_type>(next), entity_traits::reserved);
-
765  for(; next && packed[next - 1u] == tombstone; --next) {}
-
766  }
-
767  }
-
768 
-
769  free_list = tombstone;
-
770  packed.resize(next);
-
771  }
-
772 
-
786  void swap_elements(const entity_type lhs, const entity_type rhs) {
-
787  ENTT_ASSERT(contains(lhs) && contains(rhs), "Set does not contain entities");
-
788 
-
789  auto &entt = sparse_ref(lhs);
-
790  auto &other = sparse_ref(rhs);
-
791 
-
792  const auto from = entity_traits::to_entity(entt);
-
793  const auto to = entity_traits::to_entity(other);
-
794 
-
795  // basic no-leak guarantee (with invalid state) if swapping throws
-
796  swap_at(static_cast<size_type>(from), static_cast<size_type>(to));
-
797  entt = entity_traits::combine(to, entity_traits::to_integral(packed[from]));
-
798  other = entity_traits::combine(from, entity_traits::to_integral(packed[to]));
-
799  std::swap(packed[from], packed[to]);
-
800  }
+
281  free_list = std::exchange(packed[pos], entt);
+
282  return --(end() - pos);
+
283  }
+
284  }
+
285 
+
286 public:
+
288  using allocator_type = Allocator;
+
290  using entity_type = Entity;
+
292  using version_type = typename entity_traits::version_type;
+
294  using size_type = typename packed_container_type::size_type;
+
296  using pointer = typename packed_container_type::const_pointer;
+
298  using iterator = basic_iterator;
+
300  using const_iterator = iterator;
+
302  using reverse_iterator = std::reverse_iterator<iterator>;
+
304  using const_reverse_iterator = reverse_iterator;
+
305 
+
307  basic_sparse_set()
+
308  : basic_sparse_set{type_id<void>()} {}
+
309 
+
314  explicit basic_sparse_set(const allocator_type &allocator)
+
315  : basic_sparse_set{type_id<void>(), deletion_policy::swap_and_pop, allocator} {}
+
316 
+
322  explicit basic_sparse_set(deletion_policy pol, const allocator_type &allocator = {})
+
323  : basic_sparse_set{type_id<void>(), pol, allocator} {}
+
324 
+
332  explicit basic_sparse_set(const type_info &value, deletion_policy pol = deletion_policy::swap_and_pop, const allocator_type &allocator = {})
+
333  : sparse{allocator},
+
334  packed{allocator},
+
335  info{&value},
+
336  free_list{tombstone},
+
337  mode{pol} {}
+
338 
+
343  basic_sparse_set(basic_sparse_set &&other) ENTT_NOEXCEPT
+
344  : sparse{std::move(other.sparse)},
+
345  packed{std::move(other.packed)},
+
346  info{other.info},
+
347  free_list{std::exchange(other.free_list, tombstone)},
+
348  mode{other.mode} {}
+
349 
+
355  basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator) ENTT_NOEXCEPT
+
356  : sparse{std::move(other.sparse), allocator},
+
357  packed{std::move(other.packed), allocator},
+
358  info{other.info},
+
359  free_list{std::exchange(other.free_list, tombstone)},
+
360  mode{other.mode} {
+
361  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.get_allocator() == other.packed.get_allocator(), "Copying a sparse set is not allowed");
+
362  }
+
363 
+
365  virtual ~basic_sparse_set() {
+
366  release_sparse_pages();
+
367  }
+
368 
+
374  basic_sparse_set &operator=(basic_sparse_set &&other) ENTT_NOEXCEPT {
+
375  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.get_allocator() == other.packed.get_allocator(), "Copying a sparse set is not allowed");
+
376 
+
377  release_sparse_pages();
+
378  sparse = std::move(other.sparse);
+
379  packed = std::move(other.packed);
+
380  info = other.info;
+
381  free_list = std::exchange(other.free_list, tombstone);
+
382  mode = other.mode;
+
383  return *this;
+
384  }
+
385 
+
390  void swap(basic_sparse_set &other) {
+
391  using std::swap;
+
392  swap(sparse, other.sparse);
+
393  swap(packed, other.packed);
+
394  swap(info, other.info);
+
395  swap(free_list, other.free_list);
+
396  swap(mode, other.mode);
+
397  }
+
398 
+
403  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
+
404  return packed.get_allocator();
+
405  }
+
406 
+
411  [[nodiscard]] deletion_policy policy() const ENTT_NOEXCEPT {
+
412  return mode;
+
413  }
+
414 
+
423  virtual void reserve(const size_type cap) {
+
424  packed.reserve(cap);
+
425  }
+
426 
+
432  [[nodiscard]] virtual size_type capacity() const ENTT_NOEXCEPT {
+
433  return packed.capacity();
+
434  }
+
435 
+
437  virtual void shrink_to_fit() {
+
438  packed.shrink_to_fit();
+
439  }
+
440 
+
451  [[nodiscard]] size_type extent() const ENTT_NOEXCEPT {
+
452  return sparse.size() * entity_traits::page_size;
+
453  }
+
454 
+
465  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
+
466  return packed.size();
+
467  }
+
468 
+
473  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
+
474  return packed.empty();
+
475  }
+
476 
+
481  [[nodiscard]] pointer data() const ENTT_NOEXCEPT {
+
482  return packed.data();
+
483  }
+
484 
+
494  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
+
495  const auto pos = static_cast<typename iterator::difference_type>(packed.size());
+
496  return iterator{packed, pos};
+
497  }
+
498 
+
500  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
+
501  return begin();
+
502  }
+
503 
+
514  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
+
515  return iterator{packed, {}};
+
516  }
+
517 
+
519  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
+
520  return end();
+
521  }
+
522 
+
533  [[nodiscard]] const_reverse_iterator rbegin() const ENTT_NOEXCEPT {
+
534  return std::make_reverse_iterator(end());
+
535  }
+
536 
+
538  [[nodiscard]] const_reverse_iterator crbegin() const ENTT_NOEXCEPT {
+
539  return rbegin();
+
540  }
+
541 
+
552  [[nodiscard]] reverse_iterator rend() const ENTT_NOEXCEPT {
+
553  return std::make_reverse_iterator(begin());
+
554  }
+
555 
+
557  [[nodiscard]] const_reverse_iterator crend() const ENTT_NOEXCEPT {
+
558  return rend();
+
559  }
+
560 
+
567  [[nodiscard]] iterator find(const entity_type entt) const ENTT_NOEXCEPT {
+
568  return contains(entt) ? --(end() - index(entt)) : end();
+
569  }
+
570 
+
576  [[nodiscard]] bool contains(const entity_type entt) const ENTT_NOEXCEPT {
+
577  const auto elem = sparse_ptr(entt);
+
578  constexpr auto cap = entity_traits::to_entity(null);
+
579  // testing versions permits to avoid accessing the packed array
+
580  return elem && (((~cap & entity_traits::to_integral(entt)) ^ entity_traits::to_integral(*elem)) < cap);
+
581  }
+
582 
+
589  [[nodiscard]] version_type current(const entity_type entt) const ENTT_NOEXCEPT {
+
590  const auto elem = sparse_ptr(entt);
+
591  constexpr auto fallback = entity_traits::to_version(tombstone);
+
592  return elem ? entity_traits::to_version(*elem) : fallback;
+
593  }
+
594 
+
605  [[nodiscard]] size_type index(const entity_type entt) const ENTT_NOEXCEPT {
+
606  ENTT_ASSERT(contains(entt), "Set does not contain entity");
+
607  return static_cast<size_type>(entity_traits::to_entity(sparse_ref(entt)));
+
608  }
+
609 
+
615  [[nodiscard]] entity_type at(const size_type pos) const ENTT_NOEXCEPT {
+
616  return pos < packed.size() ? packed[pos] : null;
+
617  }
+
618 
+
624  [[nodiscard]] entity_type operator[](const size_type pos) const ENTT_NOEXCEPT {
+
625  ENTT_ASSERT(pos < packed.size(), "Position is out of bounds");
+
626  return packed[pos];
+
627  }
+
628 
+
639  const void *get(const entity_type entt) const ENTT_NOEXCEPT {
+
640  return get_at(index(entt));
+
641  }
+
642 
+
644  void *get(const entity_type entt) ENTT_NOEXCEPT {
+
645  return const_cast<void *>(std::as_const(*this).get(entt));
+
646  }
+
647 
+
660  iterator emplace(const entity_type entt, const void *value = nullptr) {
+
661  return try_emplace(entt, false, value);
+
662  }
+
663 
+
673  void bump(const entity_type entt) {
+
674  auto &entity = sparse_ref(entt);
+
675  entity = entity_traits::combine(entity_traits::to_integral(entity), entity_traits::to_integral(entt));
+
676  packed[static_cast<size_type>(entity_traits::to_entity(entity))] = entt;
+
677  }
+
678 
+
692  template<typename It>
+
693  iterator insert(It first, It last) {
+
694  for(auto it = first; it != last; ++it) {
+
695  try_emplace(*it, true);
+
696  }
+
697 
+
698  return first == last ? end() : find(*first);
+
699  }
+
700 
+
710  void erase(const entity_type entt) {
+
711  const auto it = --(end() - index(entt));
+
712  (mode == deletion_policy::in_place) ? in_place_pop(it, it + 1u) : swap_and_pop(it, it + 1u);
+
713  }
+
714 
+
724  template<typename It>
+
725  void erase(It first, It last) {
+
726  if constexpr(std::is_same_v<It, basic_iterator>) {
+
727  (mode == deletion_policy::in_place) ? in_place_pop(first, last) : swap_and_pop(first, last);
+
728  } else {
+
729  for(; first != last; ++first) {
+
730  erase(*first);
+
731  }
+
732  }
+
733  }
+
734 
+
740  bool remove(const entity_type entt) {
+
741  return contains(entt) && (erase(entt), true);
+
742  }
+
743 
+
751  template<typename It>
+
752  size_type remove(It first, It last) {
+
753  size_type count{};
+
754 
+
755  for(; first != last; ++first) {
+
756  count += remove(*first);
+
757  }
+
758 
+
759  return count;
+
760  }
+
761 
+
763  void compact() {
+
764  size_type from = packed.size();
+
765  for(; from && packed[from - 1u] == tombstone; --from) {}
+
766 
+
767  for(auto *it = &free_list; *it != null && from; it = std::addressof(packed[entity_traits::to_entity(*it)])) {
+
768  if(const size_type to = entity_traits::to_entity(*it); to < from) {
+
769  --from;
+
770  move_element(from, to);
+
771 
+
772  using std::swap;
+
773  swap(packed[from], packed[to]);
+
774 
+
775  const auto entity = static_cast<typename entity_traits::entity_type>(to);
+
776  sparse_ref(packed[to]) = entity_traits::combine(entity, entity_traits::to_integral(packed[to]));
+
777  *it = entity_traits::combine(static_cast<typename entity_traits::entity_type>(from), entity_traits::reserved);
+
778  for(; from && packed[from - 1u] == tombstone; --from) {}
+
779  }
+
780  }
+
781 
+
782  free_list = tombstone;
+
783  packed.resize(from);
+
784  }
+
785 
+
799  void swap_elements(const entity_type lhs, const entity_type rhs) {
+
800  ENTT_ASSERT(contains(lhs) && contains(rhs), "Set does not contain entities");
801 
-
832  template<typename Compare, typename Sort = std_sort, typename... Args>
-
833  void sort_n(const size_type length, Compare compare, Sort algo = Sort{}, Args &&...args) {
-
834  ENTT_ASSERT(!(length > packed.size()), "Length exceeds the number of elements");
-
835  ENTT_ASSERT(free_list == null, "Partial sorting with tombstones is not supported");
-
836 
-
837  algo(packed.rend() - length, packed.rend(), std::move(compare), std::forward<Args>(args)...);
-
838 
-
839  for(size_type pos{}; pos < length; ++pos) {
-
840  auto curr = pos;
-
841  auto next = index(packed[curr]);
-
842 
-
843  while(curr != next) {
-
844  const auto idx = index(packed[next]);
-
845  const auto entt = packed[curr];
-
846 
-
847  swap_at(next, idx);
-
848  const auto entity = static_cast<typename entity_traits::entity_type>(curr);
-
849  sparse_ref(entt) = entity_traits::combine(entity, entity_traits::to_integral(packed[curr]));
-
850  curr = std::exchange(next, idx);
-
851  }
-
852  }
-
853  }
-
854 
-
867  template<typename Compare, typename Sort = std_sort, typename... Args>
-
868  void sort(Compare compare, Sort algo = Sort{}, Args &&...args) {
-
869  compact();
-
870  sort_n(packed.size(), std::move(compare), std::move(algo), std::forward<Args>(args)...);
-
871  }
-
872 
-
888  void respect(const basic_sparse_set &other) {
-
889  compact();
-
890 
-
891  const auto to = other.end();
-
892  auto from = other.begin();
-
893 
-
894  for(size_type pos = packed.size() - 1; pos && from != to; ++from) {
-
895  if(contains(*from)) {
-
896  if(*from != packed[pos]) {
-
897  // basic no-leak guarantee (with invalid state) if swapping throws
-
898  swap_elements(packed[pos], *from);
-
899  }
-
900 
-
901  --pos;
-
902  }
-
903  }
-
904  }
+
802  auto &entt = sparse_ref(lhs);
+
803  auto &other = sparse_ref(rhs);
+
804 
+
805  const auto from = entity_traits::to_entity(entt);
+
806  const auto to = entity_traits::to_entity(other);
+
807 
+
808  // basic no-leak guarantee (with invalid state) if swapping throws
+
809  swap_at(static_cast<size_type>(from), static_cast<size_type>(to));
+
810  entt = entity_traits::combine(to, entity_traits::to_integral(packed[from]));
+
811  other = entity_traits::combine(from, entity_traits::to_integral(packed[to]));
+
812 
+
813  using std::swap;
+
814  swap(packed[from], packed[to]);
+
815  }
+
816 
+
847  template<typename Compare, typename Sort = std_sort, typename... Args>
+
848  void sort_n(const size_type length, Compare compare, Sort algo = Sort{}, Args &&...args) {
+
849  ENTT_ASSERT(!(length > packed.size()), "Length exceeds the number of elements");
+
850  ENTT_ASSERT(free_list == null, "Partial sorting with tombstones is not supported");
+
851 
+
852  algo(packed.rend() - length, packed.rend(), std::move(compare), std::forward<Args>(args)...);
+
853 
+
854  for(size_type pos{}; pos < length; ++pos) {
+
855  auto curr = pos;
+
856  auto next = index(packed[curr]);
+
857 
+
858  while(curr != next) {
+
859  const auto idx = index(packed[next]);
+
860  const auto entt = packed[curr];
+
861 
+
862  swap_at(next, idx);
+
863  const auto entity = static_cast<typename entity_traits::entity_type>(curr);
+
864  sparse_ref(entt) = entity_traits::combine(entity, entity_traits::to_integral(packed[curr]));
+
865  curr = std::exchange(next, idx);
+
866  }
+
867  }
+
868  }
+
869 
+
882  template<typename Compare, typename Sort = std_sort, typename... Args>
+
883  void sort(Compare compare, Sort algo = Sort{}, Args &&...args) {
+
884  compact();
+
885  sort_n(packed.size(), std::move(compare), std::move(algo), std::forward<Args>(args)...);
+
886  }
+
887 
+
903  void respect(const basic_sparse_set &other) {
+
904  compact();
905 
-
907  void clear() {
-
908  for(auto &&entity: *this) {
-
909  // honor the modality and filter all tombstones
-
910  remove(entity);
-
911  }
-
912  }
-
913 
-
918  const type_info &type() const ENTT_NOEXCEPT {
-
919  return *info;
-
920  }
-
921 
-
923  virtual void bind(any) ENTT_NOEXCEPT {}
-
924 
-
925 private:
-
926  sparse_container_type sparse;
-
927  packed_container_type packed;
-
928  const type_info *info;
-
929  entity_type free_list;
-
930  deletion_policy mode;
-
931 };
-
932 
-
933 } // namespace entt
-
934 
-
935 #endif
+
906  const auto to = other.end();
+
907  auto from = other.begin();
+
908 
+
909  for(size_type pos = packed.size() - 1; pos && from != to; ++from) {
+
910  if(contains(*from)) {
+
911  if(*from != packed[pos]) {
+
912  // basic no-leak guarantee (with invalid state) if swapping throws
+
913  swap_elements(packed[pos], *from);
+
914  }
+
915 
+
916  --pos;
+
917  }
+
918  }
+
919  }
+
920 
+
922  void clear() {
+
923  if(const auto last = end(); free_list == null) {
+
924  in_place_pop(begin(), last);
+
925  } else {
+
926  for(auto &&entity: *this) {
+
927  // tombstone filter on itself
+
928  if(const auto it = find(entity); it != last) {
+
929  in_place_pop(it, it + 1u);
+
930  }
+
931  }
+
932  }
+
933 
+
934  free_list = tombstone;
+
935  packed.clear();
+
936  }
+
937 
+
942  const type_info &type() const ENTT_NOEXCEPT {
+
943  return *info;
+
944  }
+
945 
+
947  virtual void bind(any) ENTT_NOEXCEPT {}
+
948 
+
949 private:
+
950  sparse_container_type sparse;
+
951  packed_container_type packed;
+
952  const type_info *info;
+
953  entity_type free_list;
+
954  deletion_policy mode;
+
955 };
+
956 
+
957 } // namespace entt
+
958 
+
959 #endif
entt::basic_any<>
entt::basic_sparse_set
Basic sparse set implementation.
Definition: sparse_set.hpp:174
-
entt::basic_sparse_set::policy
deletion_policy policy() const
Returns the deletion policy of a sparse set.
Definition: sparse_set.hpp:409
-
entt::basic_sparse_set::erase
void erase(const entity_type entt)
Erases an entity from a sparse set.
Definition: sparse_set.hpp:703
-
entt::basic_sparse_set::swap
void swap(basic_sparse_set &other)
Exchanges the contents with those of a given sparse set.
Definition: sparse_set.hpp:388
-
entt::basic_sparse_set::crbegin
const_reverse_iterator crbegin() const
Returns a reverse iterator to the beginning.
Definition: sparse_set.hpp:544
-
entt::basic_sparse_set::insert
void insert(It first, It last)
Assigns one or more entities to a sparse set.
Definition: sparse_set.hpp:682
-
entt::basic_sparse_set::index
size_type index(const entity_type entt) const
Returns the position of an entity in a sparse set.
Definition: sparse_set.hpp:611
-
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(const allocator_type &allocator)
Constructs an empty container with a given allocator.
Definition: sparse_set.hpp:313
-
entt::basic_sparse_set::rend
reverse_iterator rend() const
Returns a reverse iterator to the end.
Definition: sparse_set.hpp:558
-
entt::basic_sparse_set::erase
void erase(It first, It last)
Erases entities from a set.
Definition: sparse_set.hpp:719
-
entt::basic_sparse_set::crend
const_reverse_iterator crend() const
Returns a reverse iterator to the end.
Definition: sparse_set.hpp:563
-
entt::basic_sparse_set::swap_elements
void swap_elements(const entity_type lhs, const entity_type rhs)
Swaps two entities in a sparse set.
Definition: sparse_set.hpp:786
-
entt::basic_sparse_set::end
iterator end() const
Returns an iterator to the end.
Definition: sparse_set.hpp:520
-
entt::basic_sparse_set::empty
bool empty() const
Checks whether a sparse set is empty.
Definition: sparse_set.hpp:479
-
entt::basic_sparse_set::const_iterator
iterator const_iterator
Constant random access iterator type.
Definition: sparse_set.hpp:299
-
entt::basic_sparse_set::slot
size_type slot() const
Returns the next slot available for insertion.
Definition: sparse_set.hpp:417
-
entt::basic_sparse_set::operator[]
entity_type operator[](const size_type pos) const
Returns the entity at specified location, without bounds checking.
Definition: sparse_set.hpp:630
-
entt::basic_sparse_set::bind
virtual void bind(any)
Forwards variables to mixins, if any.
Definition: sparse_set.hpp:923
-
entt::basic_sparse_set::swap_and_pop
virtual void swap_and_pop(const Entity entt)
Erase an entity from a sparse set.
Definition: sparse_set.hpp:226
-
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
Constructs an empty container with the given policy and allocator.
Definition: sparse_set.hpp:330
-
entt::basic_sparse_set::sort_n
void sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)
Sort the first count elements according to the given comparison function.
Definition: sparse_set.hpp:833
-
entt::basic_sparse_set::get_at
virtual const void * get_at(const std::size_t) const
Returns the element assigned to an entity.
Definition: sparse_set.hpp:212
-
entt::basic_sparse_set::const_reverse_iterator
reverse_iterator const_reverse_iterator
Constant reverse iterator type.
Definition: sparse_set.hpp:303
-
entt::basic_sparse_set::current
version_type current(const entity_type entt) const
Returns the contained version for an identifier.
Definition: sparse_set.hpp:595
-
entt::basic_sparse_set::emplace
void emplace(const entity_type entt, const void *value=nullptr)
Assigns an entity to a sparse set.
Definition: sparse_set.hpp:665
-
entt::basic_sparse_set::reserve
virtual void reserve(const size_type cap)
Increases the capacity of a sparse set.
Definition: sparse_set.hpp:429
-
entt::basic_sparse_set::get
const void * get(const entity_type entt) const
Returns the element assigned to an entity, if any.
Definition: sparse_set.hpp:645
-
entt::basic_sparse_set::clear
void clear()
Clears a sparse set.
Definition: sparse_set.hpp:907
-
entt::basic_sparse_set::size_type
typename packed_container_type::size_type size_type
Unsigned integer type.
Definition: sparse_set.hpp:293
-
entt::basic_sparse_set::size
size_type size() const
Returns the number of elements in a sparse set.
Definition: sparse_set.hpp:471
-
entt::basic_sparse_set::swap_at
virtual void swap_at(const std::size_t, const std::size_t)
Swaps two entities in a sparse set.
Definition: sparse_set.hpp:217
-
entt::basic_sparse_set::iterator
internal::sparse_set_iterator< packed_container_type > iterator
Random access iterator type.
Definition: sparse_set.hpp:297
-
entt::basic_sparse_set::shrink_to_fit
virtual void shrink_to_fit()
Requests the removal of unused capacity.
Definition: sparse_set.hpp:443
-
entt::basic_sparse_set::find
iterator find(const entity_type entt) const
Finds an entity.
Definition: sparse_set.hpp:573
-
entt::basic_sparse_set::pointer
typename packed_container_type::const_pointer pointer
Pointer type to contained entities.
Definition: sparse_set.hpp:295
-
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})
Constructs an empty container with the given policy and allocator.
Definition: sparse_set.hpp:321
-
entt::basic_sparse_set::version_type
typename entity_traits::version_type version_type
Underlying version type.
Definition: sparse_set.hpp:291
-
entt::basic_sparse_set::entity_type
Entity entity_type
Underlying entity identifier.
Definition: sparse_set.hpp:289
-
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: sparse_set.hpp:353
-
entt::basic_sparse_set::extent
size_type extent() const
Returns the extent of a sparse set.
Definition: sparse_set.hpp:457
-
entt::basic_sparse_set::at
entity_type at(const size_type pos) const
Returns the entity at specified location, with bounds checking.
Definition: sparse_set.hpp:621
-
entt::basic_sparse_set::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:500
-
entt::basic_sparse_set::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:506
-
entt::basic_sparse_set::remove
size_type remove(It first, It last)
Removes entities from a sparse set if they exist.
Definition: sparse_set.hpp:742
-
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(basic_sparse_set &&other)
Move constructor.
Definition: sparse_set.hpp:341
-
entt::basic_sparse_set::move_and_pop
virtual void move_and_pop(const std::size_t, const std::size_t)
Moves an entity in a sparse set.
Definition: sparse_set.hpp:220
-
entt::basic_sparse_set::in_place_pop
virtual void in_place_pop(const Entity entt)
Erase an entity from a sparse set.
Definition: sparse_set.hpp:245
-
entt::basic_sparse_set::type
const type_info & type() const
Returned value type, if any.
Definition: sparse_set.hpp:918
-
entt::basic_sparse_set::capacity
virtual size_type capacity() const
Returns the number of elements that a sparse set has currently allocated space for.
Definition: sparse_set.hpp:438
-
entt::basic_sparse_set::~basic_sparse_set
virtual ~basic_sparse_set()
Default destructor.
Definition: sparse_set.hpp:363
-
entt::basic_sparse_set::contains
bool contains(const entity_type entt) const
Checks if a sparse set contains an entity.
Definition: sparse_set.hpp:582
-
entt::basic_sparse_set::try_emplace
virtual void try_emplace(const Entity entt, const void *=nullptr)
Assigns an entity to a sparse set.
Definition: sparse_set.hpp:259
-
entt::basic_sparse_set::respect
void respect(const basic_sparse_set &other)
Sort entities according to their order in another sparse set.
Definition: sparse_set.hpp:888
-
entt::basic_sparse_set::data
pointer data() const
Direct access to the internal packed array.
Definition: sparse_set.hpp:487
-
entt::basic_sparse_set::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: sparse_set.hpp:401
-
entt::basic_sparse_set::sort
void sort(Compare compare, Sort algo=Sort{}, Args &&...args)
Sort all elements according to the given comparison function.
Definition: sparse_set.hpp:868
-
entt::basic_sparse_set::rbegin
const_reverse_iterator rbegin() const
Returns a reverse iterator to the beginning.
Definition: sparse_set.hpp:539
-
entt::basic_sparse_set::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: sparse_set.hpp:525
-
entt::basic_sparse_set::remove
bool remove(const entity_type entt)
Removes an entity from a sparse set if it exists.
Definition: sparse_set.hpp:730
-
entt::basic_sparse_set::get
void * get(const entity_type entt)
Returns the element assigned to an entity, if any.
Definition: sparse_set.hpp:651
-
entt::basic_sparse_set::compact
void compact()
Removes all tombstones from the packed array of a sparse set.
Definition: sparse_set.hpp:753
-
entt::basic_sparse_set::allocator_type
Allocator allocator_type
Allocator type.
Definition: sparse_set.hpp:287
-
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set()
Default constructor.
Definition: sparse_set.hpp:306
-
entt::basic_sparse_set::operator=
basic_sparse_set & operator=(basic_sparse_set &&other)
Move assignment operator.
Definition: sparse_set.hpp:372
-
entt::basic_sparse_set::reverse_iterator
std::reverse_iterator< iterator > reverse_iterator
Reverse iterator type.
Definition: sparse_set.hpp:301
+
entt::basic_sparse_set::policy
deletion_policy policy() const
Returns the deletion policy of a sparse set.
Definition: sparse_set.hpp:411
+
entt::basic_sparse_set::erase
void erase(const entity_type entt)
Erases an entity from a sparse set.
Definition: sparse_set.hpp:710
+
entt::basic_sparse_set::swap
void swap(basic_sparse_set &other)
Exchanges the contents with those of a given sparse set.
Definition: sparse_set.hpp:390
+
entt::basic_sparse_set::crbegin
const_reverse_iterator crbegin() const
Returns a reverse iterator to the beginning.
Definition: sparse_set.hpp:538
+
entt::basic_sparse_set::index
size_type index(const entity_type entt) const
Returns the position of an entity in a sparse set.
Definition: sparse_set.hpp:605
+
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(const allocator_type &allocator)
Constructs an empty container with a given allocator.
Definition: sparse_set.hpp:314
+
entt::basic_sparse_set::rend
reverse_iterator rend() const
Returns a reverse iterator to the end.
Definition: sparse_set.hpp:552
+
entt::basic_sparse_set::try_emplace
virtual basic_iterator try_emplace(const Entity entt, const bool force_back, const void *=nullptr)
Assigns an entity to a sparse set.
Definition: sparse_set.hpp:271
+
entt::basic_sparse_set::erase
void erase(It first, It last)
Erases entities from a set.
Definition: sparse_set.hpp:725
+
entt::basic_sparse_set::crend
const_reverse_iterator crend() const
Returns a reverse iterator to the end.
Definition: sparse_set.hpp:557
+
entt::basic_sparse_set::swap_elements
void swap_elements(const entity_type lhs, const entity_type rhs)
Swaps two entities in a sparse set.
Definition: sparse_set.hpp:799
+
entt::basic_sparse_set::end
iterator end() const
Returns an iterator to the end.
Definition: sparse_set.hpp:514
+
entt::basic_sparse_set::empty
bool empty() const
Checks whether a sparse set is empty.
Definition: sparse_set.hpp:473
+
entt::basic_sparse_set::const_iterator
iterator const_iterator
Constant random access iterator type.
Definition: sparse_set.hpp:300
+
entt::basic_sparse_set::operator[]
entity_type operator[](const size_type pos) const
Returns the entity at specified location, without bounds checking.
Definition: sparse_set.hpp:624
+
entt::basic_sparse_set::bind
virtual void bind(any)
Forwards variables to mixins, if any.
Definition: sparse_set.hpp:947
+
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})
Constructs an empty container with the given value type, policy and allocator.
Definition: sparse_set.hpp:332
+
entt::basic_sparse_set::sort_n
void sort_n(const size_type length, Compare compare, Sort algo=Sort{}, Args &&...args)
Sort the first count elements according to the given comparison function.
Definition: sparse_set.hpp:848
+
entt::basic_sparse_set::const_reverse_iterator
reverse_iterator const_reverse_iterator
Constant reverse iterator type.
Definition: sparse_set.hpp:304
+
entt::basic_sparse_set::current
version_type current(const entity_type entt) const
Returns the contained version for an identifier.
Definition: sparse_set.hpp:589
+
entt::basic_sparse_set::reserve
virtual void reserve(const size_type cap)
Increases the capacity of a sparse set.
Definition: sparse_set.hpp:423
+
entt::basic_sparse_set::emplace
iterator emplace(const entity_type entt, const void *value=nullptr)
Assigns an entity to a sparse set.
Definition: sparse_set.hpp:660
+
entt::basic_sparse_set::get
const void * get(const entity_type entt) const
Returns the element assigned to an entity, if any.
Definition: sparse_set.hpp:639
+
entt::basic_sparse_set::clear
void clear()
Clears a sparse set.
Definition: sparse_set.hpp:922
+
entt::basic_sparse_set::iterator
basic_iterator iterator
Random access iterator type.
Definition: sparse_set.hpp:298
+
entt::basic_sparse_set::size_type
typename packed_container_type::size_type size_type
Unsigned integer type.
Definition: sparse_set.hpp:294
+
entt::basic_sparse_set::size
size_type size() const
Returns the number of elements in a sparse set.
Definition: sparse_set.hpp:465
+
entt::basic_sparse_set::shrink_to_fit
virtual void shrink_to_fit()
Requests the removal of unused capacity.
Definition: sparse_set.hpp:437
+
entt::basic_sparse_set::swap_and_pop
virtual void swap_and_pop(basic_iterator first, basic_iterator last)
Erases entities from a sparse set.
Definition: sparse_set.hpp:241
+
entt::basic_sparse_set::find
iterator find(const entity_type entt) const
Finds an entity.
Definition: sparse_set.hpp:567
+
entt::basic_sparse_set::pointer
typename packed_container_type::const_pointer pointer
Pointer type to contained entities.
Definition: sparse_set.hpp:296
+
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})
Constructs an empty container with the given policy and allocator.
Definition: sparse_set.hpp:322
+
entt::basic_sparse_set::version_type
typename entity_traits::version_type version_type
Underlying version type.
Definition: sparse_set.hpp:292
+
entt::basic_sparse_set::entity_type
Entity entity_type
Underlying entity identifier.
Definition: sparse_set.hpp:290
+
entt::basic_sparse_set::insert
iterator insert(It first, It last)
Assigns one or more entities to a sparse set.
Definition: sparse_set.hpp:693
+
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: sparse_set.hpp:355
+
entt::basic_sparse_set::extent
size_type extent() const
Returns the extent of a sparse set.
Definition: sparse_set.hpp:451
+
entt::basic_sparse_set::at
entity_type at(const size_type pos) const
Returns the entity at specified location, with bounds checking.
Definition: sparse_set.hpp:615
+
entt::basic_sparse_set::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:494
+
entt::basic_sparse_set::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:500
+
entt::basic_sparse_set::remove
size_type remove(It first, It last)
Removes entities from a sparse set if they exist.
Definition: sparse_set.hpp:752
+
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set(basic_sparse_set &&other)
Move constructor.
Definition: sparse_set.hpp:343
+
entt::basic_sparse_set::type
const type_info & type() const
Returned value type, if any.
Definition: sparse_set.hpp:942
+
entt::basic_sparse_set::capacity
virtual size_type capacity() const
Returns the number of elements that a sparse set has currently allocated space for.
Definition: sparse_set.hpp:432
+
entt::basic_sparse_set::basic_iterator
internal::sparse_set_iterator< packed_container_type > basic_iterator
Random access iterator type.
Definition: sparse_set.hpp:234
+
entt::basic_sparse_set::~basic_sparse_set
virtual ~basic_sparse_set()
Default destructor.
Definition: sparse_set.hpp:365
+
entt::basic_sparse_set::contains
bool contains(const entity_type entt) const
Checks if a sparse set contains an entity.
Definition: sparse_set.hpp:576
+
entt::basic_sparse_set::respect
void respect(const basic_sparse_set &other)
Sort entities according to their order in another sparse set.
Definition: sparse_set.hpp:903
+
entt::basic_sparse_set::data
pointer data() const
Direct access to the internal packed array.
Definition: sparse_set.hpp:481
+
entt::basic_sparse_set::bump
void bump(const entity_type entt)
Bump the version number of an entity.
Definition: sparse_set.hpp:673
+
entt::basic_sparse_set::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: sparse_set.hpp:403
+
entt::basic_sparse_set::sort
void sort(Compare compare, Sort algo=Sort{}, Args &&...args)
Sort all elements according to the given comparison function.
Definition: sparse_set.hpp:883
+
entt::basic_sparse_set::rbegin
const_reverse_iterator rbegin() const
Returns a reverse iterator to the beginning.
Definition: sparse_set.hpp:533
+
entt::basic_sparse_set::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: sparse_set.hpp:519
+
entt::basic_sparse_set::remove
bool remove(const entity_type entt)
Removes an entity from a sparse set if it exists.
Definition: sparse_set.hpp:740
+
entt::basic_sparse_set::get
void * get(const entity_type entt)
Returns the element assigned to an entity, if any.
Definition: sparse_set.hpp:644
+
entt::basic_sparse_set::compact
void compact()
Removes all tombstones from the packed array of a sparse set.
Definition: sparse_set.hpp:763
+
entt::basic_sparse_set::allocator_type
Allocator allocator_type
Allocator type.
Definition: sparse_set.hpp:288
+
entt::basic_sparse_set::basic_sparse_set
basic_sparse_set()
Default constructor.
Definition: sparse_set.hpp:307
+
entt::basic_sparse_set::operator=
basic_sparse_set & operator=(basic_sparse_set &&other)
Move assignment operator.
Definition: sparse_set.hpp:374
+
entt::basic_sparse_set::reverse_iterator
std::reverse_iterator< iterator > reverse_iterator
Reverse iterator type.
Definition: sparse_set.hpp:302
+
entt::basic_sparse_set::in_place_pop
virtual void in_place_pop(basic_iterator first, basic_iterator last)
Erases entities from a sparse set.
Definition: sparse_set.hpp:258
entt::entt_traits
Entity traits.
Definition: entity.hpp:62
entt::entt_traits::page_size
static constexpr auto page_size
Page size, default is ENTT_SPARSE_PAGE.
Definition: entity.hpp:75
entt::entt_traits::entity_type
typename base_type::entity_type entity_type
Underlying entity type.
Definition: entity.hpp:69
@@ -709,23 +722,23 @@ $(function() {
entt::entt_traits::combine
static constexpr value_type combine(const entity_type lhs, const entity_type rhs)
Combines two identifiers in a single one.
Definition: entity.hpp:128
entt::entt_traits::version_type
typename base_type::version_type version_type
Underlying version type.
Definition: entity.hpp:71
entt::entt_traits::to_version
static constexpr version_type to_version(const value_type value)
Returns the version part once converted to the underlying type.
Definition: entity.hpp:100
-
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:217
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
entt::entity
entity
Default entity identifier.
Definition: fwd.hpp:47
-
entt::fast_mod
constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
Fast module utility function (powers of two only).
Definition: memory.hpp:101
-
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:256
-
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:254
-
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:280
+
entt::fast_mod
constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
Fast module utility function (powers of two only).
Definition: memory.hpp:102
+
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:257
+
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:273
+
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:299
entt::tombstone
constexpr tombstone_t tombstone
Compile-time constant for tombstone entities.
Definition: entity.hpp:335
entt::operator+
constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
Concatenates multiple type lists.
Definition: type_traits.hpp:157
-
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:241
+
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:260
entt::deletion_policy
deletion_policy
Sparse set deletion policy.
Definition: sparse_set.hpp:143
entt::deletion_policy::swap_and_pop
@ swap_and_pop
Swap-and-pop deletion policy.
entt::deletion_policy::in_place
@ in_place
In-place deletion policy.
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
-
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:267
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:286
entt::std_sort
Function object to wrap std::sort in a class type.
Definition: algorithm.hpp:21
+
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
diff --git a/storage_8hpp_source.html b/storage_8hpp_source.html index f1a90683b..fa44e689a 100644 --- a/storage_8hpp_source.html +++ b/storage_8hpp_source.html @@ -22,7 +22,7 @@
@@ -81,825 +81,710 @@ $(function() {
9 #include <utility>
10 #include <vector>
11 #include "../config/config.h"
-
12 #include "../core/algorithm.hpp"
-
13 #include "../core/any.hpp"
-
14 #include "../core/compressed_pair.hpp"
-
15 #include "../core/iterator.hpp"
-
16 #include "../core/memory.hpp"
-
17 #include "../core/type_info.hpp"
-
18 #include "../core/type_traits.hpp"
-
19 #include "../signal/sigh.hpp"
-
20 #include "component.hpp"
-
21 #include "entity.hpp"
-
22 #include "fwd.hpp"
-
23 #include "sparse_set.hpp"
-
24 
-
25 namespace entt {
-
26 
-
32 namespace internal {
-
33 
-
34 template<typename Container>
-
35 class storage_iterator final {
-
36  friend storage_iterator<const Container>;
-
37 
-
38  using container_type = std::remove_const_t<Container>;
-
39  using allocator_traits = std::allocator_traits<typename container_type::allocator_type>;
-
40  using comp_traits = component_traits<typename container_type::value_type>;
-
41 
-
42  using iterator_traits = std::iterator_traits<std::conditional_t<
-
43  std::is_const_v<Container>,
-
44  typename allocator_traits::template rebind_traits<typename std::pointer_traits<typename container_type::value_type>::element_type>::const_pointer,
-
45  typename allocator_traits::template rebind_traits<typename std::pointer_traits<typename container_type::value_type>::element_type>::pointer>>;
-
46 
-
47 public:
+
12 #include "../core/compressed_pair.hpp"
+
13 #include "../core/iterator.hpp"
+
14 #include "../core/memory.hpp"
+
15 #include "../core/type_info.hpp"
+
16 #include "component.hpp"
+
17 #include "entity.hpp"
+
18 #include "fwd.hpp"
+
19 #include "sigh_storage_mixin.hpp"
+
20 #include "sparse_set.hpp"
+
21 
+
22 namespace entt {
+
23 
+
29 namespace internal {
+
30 
+
31 template<typename Container>
+
32 class storage_iterator final {
+
33  friend storage_iterator<const Container>;
+
34 
+
35  using container_type = std::remove_const_t<Container>;
+
36  using alloc_traits = std::allocator_traits<typename container_type::allocator_type>;
+
37  using comp_traits = component_traits<typename container_type::value_type>;
+
38 
+
39  using iterator_traits = std::iterator_traits<std::conditional_t<
+
40  std::is_const_v<Container>,
+
41  typename alloc_traits::template rebind_traits<typename std::pointer_traits<typename container_type::value_type>::element_type>::const_pointer,
+
42  typename alloc_traits::template rebind_traits<typename std::pointer_traits<typename container_type::value_type>::element_type>::pointer>>;
+
43 
+
44 public:
+
45  using value_type = typename iterator_traits::value_type;
+
46  using pointer = typename iterator_traits::pointer;
+
47  using reference = typename iterator_traits::reference;
48  using difference_type = typename iterator_traits::difference_type;
-
49  using value_type = typename iterator_traits::value_type;
-
50  using pointer = typename iterator_traits::pointer;
-
51  using reference = typename iterator_traits::reference;
-
52  using iterator_category = std::random_access_iterator_tag;
-
53 
-
54  storage_iterator() ENTT_NOEXCEPT = default;
-
55 
-
56  storage_iterator(Container *ref, difference_type idx) ENTT_NOEXCEPT
-
57  : packed{ref},
-
58  offset{idx} {}
-
59 
-
60  template<bool Const = std::is_const_v<Container>, typename = std::enable_if_t<Const>>
-
61  storage_iterator(const storage_iterator<std::remove_const_t<Container>> &other) ENTT_NOEXCEPT
-
62  : packed{other.packed},
-
63  offset{other.offset} {}
-
64 
-
65  storage_iterator &operator++() ENTT_NOEXCEPT {
-
66  return --offset, *this;
-
67  }
-
68 
-
69  storage_iterator operator++(int) ENTT_NOEXCEPT {
-
70  storage_iterator orig = *this;
-
71  return ++(*this), orig;
-
72  }
-
73 
-
74  storage_iterator &operator--() ENTT_NOEXCEPT {
-
75  return ++offset, *this;
-
76  }
-
77 
-
78  storage_iterator operator--(int) ENTT_NOEXCEPT {
-
79  storage_iterator orig = *this;
-
80  return operator--(), orig;
-
81  }
-
82 
-
83  storage_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
-
84  offset -= value;
-
85  return *this;
-
86  }
-
87 
-
88  storage_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
-
89  storage_iterator copy = *this;
-
90  return (copy += value);
-
91  }
-
92 
-
93  storage_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
-
94  return (*this += -value);
-
95  }
-
96 
-
97  storage_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
-
98  return (*this + -value);
-
99  }
-
100 
-
101  [[nodiscard]] reference operator[](const difference_type value) const ENTT_NOEXCEPT {
-
102  const auto pos = offset - value - 1;
-
103  return (*packed)[pos / comp_traits::page_size][fast_mod(pos, comp_traits::page_size)];
-
104  }
-
105 
-
106  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
-
107  const auto pos = offset - 1;
-
108  return (*packed)[pos / comp_traits::page_size] + fast_mod(pos, comp_traits::page_size);
-
109  }
-
110 
-
111  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
-
112  return *operator->();
-
113  }
-
114 
-
115  [[nodiscard]] difference_type index() const ENTT_NOEXCEPT {
-
116  return offset;
-
117  }
-
118 
-
119 private:
-
120  Container *packed;
-
121  difference_type offset;
-
122 };
-
123 
-
124 template<typename CLhs, typename CRhs>
-
125 [[nodiscard]] auto operator-(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
-
126  return rhs.index() - lhs.index();
-
127 }
-
128 
-
129 template<typename CLhs, typename CRhs>
-
130 [[nodiscard]] bool operator==(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
-
131  return lhs.index() == rhs.index();
-
132 }
-
133 
-
134 template<typename CLhs, typename CRhs>
-
135 [[nodiscard]] bool operator!=(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
-
136  return !(lhs == rhs);
-
137 }
-
138 
-
139 template<typename CLhs, typename CRhs>
-
140 [[nodiscard]] bool operator<(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
-
141  return lhs.index() > rhs.index();
-
142 }
-
143 
-
144 template<typename CLhs, typename CRhs>
-
145 [[nodiscard]] bool operator>(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
-
146  return lhs.index() < rhs.index();
-
147 }
-
148 
-
149 template<typename CLhs, typename CRhs>
-
150 [[nodiscard]] bool operator<=(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
-
151  return !(lhs > rhs);
-
152 }
-
153 
-
154 template<typename CLhs, typename CRhs>
-
155 [[nodiscard]] bool operator>=(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
-
156  return !(lhs < rhs);
-
157 }
-
158 
-
159 template<typename It, typename... Other>
-
160 class extended_storage_iterator final {
-
161  template<typename Iter, typename... Args>
-
162  friend class extended_storage_iterator;
-
163 
-
164 public:
-
165  using difference_type = typename std::iterator_traits<It>::difference_type;
-
166  using value_type = decltype(std::tuple_cat(std::make_tuple(*std::declval<It>()), std::forward_as_tuple(*std::declval<Other>()...)));
-
167  using pointer = input_iterator_pointer<value_type>;
-
168  using reference = value_type;
-
169  using iterator_category = std::input_iterator_tag;
-
170 
-
171  extended_storage_iterator() = default;
+
49  using iterator_category = std::random_access_iterator_tag;
+
50 
+
51  storage_iterator() ENTT_NOEXCEPT = default;
+
52 
+
53  storage_iterator(Container *ref, difference_type idx) ENTT_NOEXCEPT
+
54  : packed{ref},
+
55  offset{idx} {}
+
56 
+
57  template<bool Const = std::is_const_v<Container>, typename = std::enable_if_t<Const>>
+
58  storage_iterator(const storage_iterator<std::remove_const_t<Container>> &other) ENTT_NOEXCEPT
+
59  : packed{other.packed},
+
60  offset{other.offset} {}
+
61 
+
62  storage_iterator &operator++() ENTT_NOEXCEPT {
+
63  return --offset, *this;
+
64  }
+
65 
+
66  storage_iterator operator++(int) ENTT_NOEXCEPT {
+
67  storage_iterator orig = *this;
+
68  return ++(*this), orig;
+
69  }
+
70 
+
71  storage_iterator &operator--() ENTT_NOEXCEPT {
+
72  return ++offset, *this;
+
73  }
+
74 
+
75  storage_iterator operator--(int) ENTT_NOEXCEPT {
+
76  storage_iterator orig = *this;
+
77  return operator--(), orig;
+
78  }
+
79 
+
80  storage_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
+
81  offset -= value;
+
82  return *this;
+
83  }
+
84 
+
85  storage_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
+
86  storage_iterator copy = *this;
+
87  return (copy += value);
+
88  }
+
89 
+
90  storage_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
+
91  return (*this += -value);
+
92  }
+
93 
+
94  storage_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
+
95  return (*this + -value);
+
96  }
+
97 
+
98  [[nodiscard]] reference operator[](const difference_type value) const ENTT_NOEXCEPT {
+
99  const auto pos = index() - value;
+
100  return (*packed)[pos / comp_traits::page_size][fast_mod(pos, comp_traits::page_size)];
+
101  }
+
102 
+
103  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
104  const auto pos = index();
+
105  return (*packed)[pos / comp_traits::page_size] + fast_mod(pos, comp_traits::page_size);
+
106  }
+
107 
+
108  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
109  return *operator->();
+
110  }
+
111 
+
112  [[nodiscard]] difference_type index() const ENTT_NOEXCEPT {
+
113  return offset - 1;
+
114  }
+
115 
+
116 private:
+
117  Container *packed;
+
118  difference_type offset;
+
119 };
+
120 
+
121 template<typename CLhs, typename CRhs>
+
122 [[nodiscard]] std::ptrdiff_t operator-(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
+
123  return rhs.index() - lhs.index();
+
124 }
+
125 
+
126 template<typename CLhs, typename CRhs>
+
127 [[nodiscard]] bool operator==(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
+
128  return lhs.index() == rhs.index();
+
129 }
+
130 
+
131 template<typename CLhs, typename CRhs>
+
132 [[nodiscard]] bool operator!=(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
+
133  return !(lhs == rhs);
+
134 }
+
135 
+
136 template<typename CLhs, typename CRhs>
+
137 [[nodiscard]] bool operator<(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
+
138  return lhs.index() > rhs.index();
+
139 }
+
140 
+
141 template<typename CLhs, typename CRhs>
+
142 [[nodiscard]] bool operator>(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
+
143  return lhs.index() < rhs.index();
+
144 }
+
145 
+
146 template<typename CLhs, typename CRhs>
+
147 [[nodiscard]] bool operator<=(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
+
148  return !(lhs > rhs);
+
149 }
+
150 
+
151 template<typename CLhs, typename CRhs>
+
152 [[nodiscard]] bool operator>=(const storage_iterator<CLhs> &lhs, const storage_iterator<CRhs> &rhs) ENTT_NOEXCEPT {
+
153  return !(lhs < rhs);
+
154 }
+
155 
+
156 template<typename It, typename... Other>
+
157 class extended_storage_iterator final {
+
158  template<typename Iter, typename... Args>
+
159  friend class extended_storage_iterator;
+
160 
+
161 public:
+
162  using value_type = decltype(std::tuple_cat(std::make_tuple(*std::declval<It>()), std::forward_as_tuple(*std::declval<Other>()...)));
+
163  using pointer = input_iterator_pointer<value_type>;
+
164  using reference = value_type;
+
165  using difference_type = std::ptrdiff_t;
+
166  using iterator_category = std::input_iterator_tag;
+
167 
+
168  extended_storage_iterator() = default;
+
169 
+
170  extended_storage_iterator(It base, Other... other)
+
171  : it{base, other...} {}
172 
-
173  extended_storage_iterator(It base, Other... other) ENTT_NOEXCEPT
-
174  : it{base, other...} {}
-
175 
-
176  template<typename... Args, typename = std::enable_if_t<(!std::is_same_v<Other, Args> && ...) && (std::is_constructible_v<Other, Args> && ...)>>
-
177  extended_storage_iterator(const extended_storage_iterator<It, Args...> &other) ENTT_NOEXCEPT
-
178  : it{other.it} {}
-
179 
-
180  extended_storage_iterator &operator++() ENTT_NOEXCEPT {
-
181  return ++std::get<It>(it), (++std::get<Other>(it), ...), *this;
-
182  }
-
183 
-
184  extended_storage_iterator operator++(int) ENTT_NOEXCEPT {
-
185  extended_storage_iterator orig = *this;
-
186  return ++(*this), orig;
-
187  }
-
188 
-
189  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
-
190  return operator*();
-
191  }
-
192 
-
193  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
-
194  return {*std::get<It>(it), *std::get<Other>(it)...};
-
195  }
+
173  template<typename... Args, typename = std::enable_if_t<(!std::is_same_v<Other, Args> && ...) && (std::is_constructible_v<Other, Args> && ...)>>
+
174  extended_storage_iterator(const extended_storage_iterator<It, Args...> &other)
+
175  : it{other.it} {}
+
176 
+
177  extended_storage_iterator &operator++() ENTT_NOEXCEPT {
+
178  return ++std::get<It>(it), (++std::get<Other>(it), ...), *this;
+
179  }
+
180 
+
181  extended_storage_iterator operator++(int) ENTT_NOEXCEPT {
+
182  extended_storage_iterator orig = *this;
+
183  return ++(*this), orig;
+
184  }
+
185 
+
186  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
187  return operator*();
+
188  }
+
189 
+
190  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
191  return {*std::get<It>(it), *std::get<Other>(it)...};
+
192  }
+
193 
+
194  template<typename... CLhs, typename... CRhs>
+
195  friend bool operator==(const extended_storage_iterator<CLhs...> &, const extended_storage_iterator<CRhs...> &) ENTT_NOEXCEPT;
196 
-
197  template<typename... CLhs, typename... CRhs>
-
198  friend bool operator==(const extended_storage_iterator<CLhs...> &, const extended_storage_iterator<CRhs...> &) ENTT_NOEXCEPT;
-
199 
-
200 private:
-
201  std::tuple<It, Other...> it;
-
202 };
-
203 
-
204 template<typename... CLhs, typename... CRhs>
-
205 [[nodiscard]] bool operator==(const extended_storage_iterator<CLhs...> &lhs, const extended_storage_iterator<CRhs...> &rhs) ENTT_NOEXCEPT {
-
206  return std::get<0>(lhs.it) == std::get<0>(rhs.it);
-
207 }
-
208 
-
209 template<typename... CLhs, typename... CRhs>
-
210 [[nodiscard]] bool operator!=(const extended_storage_iterator<CLhs...> &lhs, const extended_storage_iterator<CRhs...> &rhs) ENTT_NOEXCEPT {
-
211  return !(lhs == rhs);
-
212 }
-
213 
-
214 } // namespace internal
-
215 
-
236 template<typename Entity, typename Type, typename Allocator, typename>
-
237 class basic_storage: public basic_sparse_set<Entity, typename std::allocator_traits<Allocator>::template rebind_alloc<Entity>> {
-
238  using allocator_traits = std::allocator_traits<Allocator>;
-
239  using alloc = typename allocator_traits::template rebind_alloc<Type>;
-
240  using alloc_traits = typename std::allocator_traits<alloc>;
-
241 
-
242  using comp_traits = component_traits<Type>;
-
243  using underlying_type = basic_sparse_set<Entity, typename allocator_traits::template rebind_alloc<Entity>>;
-
244  using container_type = std::vector<typename alloc_traits::pointer, typename alloc_traits::template rebind_alloc<typename alloc_traits::pointer>>;
-
245 
-
246  [[nodiscard]] auto &element_at(const std::size_t pos) const {
-
247  return packed.first()[pos / comp_traits::page_size][fast_mod(pos, comp_traits::page_size)];
-
248  }
-
249 
-
250  auto assure_at_least(const std::size_t pos) {
-
251  auto &&container = packed.first();
-
252  const auto idx = pos / comp_traits::page_size;
-
253 
-
254  if(!(idx < container.size())) {
-
255  auto curr = container.size();
-
256  container.resize(idx + 1u, nullptr);
-
257 
-
258  ENTT_TRY {
-
259  for(const auto last = container.size(); curr < last; ++curr) {
-
260  container[curr] = alloc_traits::allocate(packed.second(), comp_traits::page_size);
-
261  }
-
262  }
-
263  ENTT_CATCH {
-
264  container.resize(curr);
-
265  ENTT_THROW;
-
266  }
-
267  }
+
197 private:
+
198  std::tuple<It, Other...> it;
+
199 };
+
200 
+
201 template<typename... CLhs, typename... CRhs>
+
202 [[nodiscard]] bool operator==(const extended_storage_iterator<CLhs...> &lhs, const extended_storage_iterator<CRhs...> &rhs) ENTT_NOEXCEPT {
+
203  return std::get<0>(lhs.it) == std::get<0>(rhs.it);
+
204 }
+
205 
+
206 template<typename... CLhs, typename... CRhs>
+
207 [[nodiscard]] bool operator!=(const extended_storage_iterator<CLhs...> &lhs, const extended_storage_iterator<CRhs...> &rhs) ENTT_NOEXCEPT {
+
208  return !(lhs == rhs);
+
209 }
+
210 
+
211 } // namespace internal
+
212 
+
233 template<typename Entity, typename Type, typename Allocator, typename>
+
234 class basic_storage: public basic_sparse_set<Entity, typename std::allocator_traits<Allocator>::template rebind_alloc<Entity>> {
+
235  static_assert(std::is_move_constructible_v<Type> && std::is_move_assignable_v<Type>, "The type must be at least move constructible/assignable");
+
236 
+
237  using alloc_traits = std::allocator_traits<Allocator>;
+
238  static_assert(std::is_same_v<typename alloc_traits::value_type, Type>, "Invalid value type");
+
239  using underlying_type = basic_sparse_set<Entity, typename alloc_traits::template rebind_alloc<Entity>>;
+
240  using container_type = std::vector<typename alloc_traits::pointer, typename alloc_traits::template rebind_alloc<typename alloc_traits::pointer>>;
+
241  using comp_traits = component_traits<Type>;
+
242 
+
243  [[nodiscard]] auto &element_at(const std::size_t pos) const {
+
244  return packed.first()[pos / comp_traits::page_size][fast_mod(pos, comp_traits::page_size)];
+
245  }
+
246 
+
247  auto assure_at_least(const std::size_t pos) {
+
248  auto &&container = packed.first();
+
249  const auto idx = pos / comp_traits::page_size;
+
250 
+
251  if(!(idx < container.size())) {
+
252  auto curr = container.size();
+
253  container.resize(idx + 1u, nullptr);
+
254 
+
255  ENTT_TRY {
+
256  for(const auto last = container.size(); curr < last; ++curr) {
+
257  container[curr] = alloc_traits::allocate(packed.second(), comp_traits::page_size);
+
258  }
+
259  }
+
260  ENTT_CATCH {
+
261  container.resize(curr);
+
262  ENTT_THROW;
+
263  }
+
264  }
+
265 
+
266  return container[idx] + fast_mod(pos, comp_traits::page_size);
+
267  }
268 
-
269  return container[idx] + fast_mod(pos, comp_traits::page_size);
-
270  }
-
271 
-
272  void release_unused_pages() {
-
273  auto &&container = packed.first();
-
274  auto page_allocator{packed.second()};
-
275  const auto in_use = (base_type::size() + comp_traits::page_size - 1u) / comp_traits::page_size;
-
276 
-
277  for(auto pos = in_use, last = container.size(); pos < last; ++pos) {
-
278  alloc_traits::deallocate(page_allocator, container[pos], comp_traits::page_size);
-
279  }
-
280 
-
281  container.resize(in_use);
-
282  }
+
269  template<typename... Args>
+
270  auto emplace_element(const Entity entt, const bool force_back, Args &&...args) {
+
271  const auto it = base_type::try_emplace(entt, force_back);
+
272 
+
273  ENTT_TRY {
+
274  auto elem = assure_at_least(static_cast<size_type>(it.index()));
+
275  entt::uninitialized_construct_using_allocator(to_address(elem), packed.second(), std::forward<Args>(args)...);
+
276  }
+
277  ENTT_CATCH {
+
278  if constexpr(comp_traits::in_place_delete) {
+
279  base_type::in_place_pop(it, it + 1u);
+
280  } else {
+
281  base_type::swap_and_pop(it, it + 1u);
+
282  }
283 
-
284  void release_all_pages() {
-
285  for(size_type pos{}, last = base_type::size(); pos < last; ++pos) {
-
286  if constexpr(comp_traits::in_place_delete) {
-
287  if(base_type::at(pos) != tombstone) {
-
288  std::destroy_at(std::addressof(element_at(pos)));
-
289  }
-
290  } else {
-
291  std::destroy_at(std::addressof(element_at(pos)));
-
292  }
-
293  }
-
294 
-
295  auto &&container = packed.first();
-
296  auto page_allocator{packed.second()};
-
297 
-
298  for(size_type pos{}, last = container.size(); pos < last; ++pos) {
-
299  alloc_traits::deallocate(page_allocator, container[pos], comp_traits::page_size);
-
300  }
-
301  }
-
302 
-
303  template<typename... Args>
-
304  void construct(typename alloc_traits::pointer ptr, Args &&...args) {
-
305  if constexpr(std::is_aggregate_v<value_type>) {
-
306  alloc_traits::construct(packed.second(), to_address(ptr), Type{std::forward<Args>(args)...});
-
307  } else {
-
308  alloc_traits::construct(packed.second(), to_address(ptr), std::forward<Args>(args)...);
-
309  }
+
284  ENTT_THROW;
+
285  }
+
286 
+
287  return it;
+
288  }
+
289 
+
290  void shrink_to_size(const std::size_t sz) {
+
291  for(auto pos = sz, length = base_type::size(); pos < length; ++pos) {
+
292  if constexpr(comp_traits::in_place_delete) {
+
293  if(base_type::at(pos) != tombstone) {
+
294  std::destroy_at(std::addressof(element_at(pos)));
+
295  }
+
296  } else {
+
297  std::destroy_at(std::addressof(element_at(pos)));
+
298  }
+
299  }
+
300 
+
301  auto &&container = packed.first();
+
302  auto page_allocator{packed.second()};
+
303  const auto from = (sz + comp_traits::page_size - 1u) / comp_traits::page_size;
+
304 
+
305  for(auto pos = from, last = container.size(); pos < last; ++pos) {
+
306  alloc_traits::deallocate(page_allocator, container[pos], comp_traits::page_size);
+
307  }
+
308 
+
309  container.resize(from);
310  }
311 
-
312  template<typename It, typename Generator>
-
313  void consume_range(It first, It last, Generator generator) {
-
314  for(const auto sz = base_type::size(); first != last && base_type::slot() != sz; ++first) {
-
315  emplace(*first, generator());
-
316  }
-
317 
-
318  const auto req = base_type::size() + std::distance(first, last);
-
319  base_type::reserve(req);
-
320  reserve(req);
+
312 private:
+
313  const void *get_at(const std::size_t pos) const final {
+
314  return std::addressof(element_at(pos));
+
315  }
+
316 
+
317  void swap_at(const std::size_t lhs, const std::size_t rhs) final {
+
318  using std::swap;
+
319  swap(element_at(lhs), element_at(rhs));
+
320  }
321 
-
322  for(; first != last; ++first) {
-
323  emplace(*first, generator());
-
324  }
-
325  }
-
326 
-
327 protected:
-
333  const void *get_at(const std::size_t pos) const ENTT_NOEXCEPT override {
-
334  return std::addressof(element_at(pos));
-
335  }
-
336 
-
342  void swap_at(const std::size_t lhs, const std::size_t rhs) final {
-
343  std::swap(element_at(lhs), element_at(rhs));
-
344  }
-
345 
-
351  void move_and_pop(const std::size_t from, const std::size_t to) final {
-
352  auto &elem = element_at(from);
-
353  construct(assure_at_least(to), std::move(elem));
-
354  std::destroy_at(std::addressof(elem));
-
355  }
-
356 
-
361  void swap_and_pop(const Entity entt) override {
-
362  const auto pos = base_type::index(entt);
-
363  const auto last = base_type::size() - 1u;
-
364 
-
365  auto &target = element_at(pos);
-
366  auto &elem = element_at(last);
-
367 
-
368  // support for nosy destructors
-
369  [[maybe_unused]] auto unused = std::move(target);
-
370  target = std::move(elem);
-
371  std::destroy_at(std::addressof(elem));
-
372 
-
373  base_type::swap_and_pop(entt);
-
374  }
-
375 
-
380  void in_place_pop(const Entity entt) override {
-
381  const auto pos = base_type::index(entt);
-
382  base_type::in_place_pop(entt);
-
383  // support for nosy destructors
-
384  std::destroy_at(std::addressof(element_at(pos)));
-
385  }
-
386 
-
392  void try_emplace([[maybe_unused]] const Entity entt, const void *value) override {
-
393  if(value) {
-
394  if constexpr(std::is_copy_constructible_v<value_type>) {
-
395  emplace(entt, *static_cast<const value_type *>(value));
-
396  }
-
397  } else {
-
398  if constexpr(std::is_default_constructible_v<value_type>) {
-
399  emplace(entt);
-
400  }
-
401  }
-
402  }
-
403 
-
404 public:
-
406  using base_type = underlying_type;
-
408  using allocator_type = Allocator;
-
410  using value_type = Type;
-
412  using entity_type = Entity;
-
414  using size_type = std::size_t;
-
416  using pointer = typename container_type::pointer;
-
418  using const_pointer = typename alloc_traits::template rebind_traits<typename alloc_traits::const_pointer>::const_pointer;
-
420  using iterator = internal::storage_iterator<container_type>;
-
422  using const_iterator = internal::storage_iterator<const container_type>;
-
424  using reverse_iterator = std::reverse_iterator<iterator>;
-
426  using const_reverse_iterator = std::reverse_iterator<const_iterator>;
-
428  using iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::iterator, iterator>>;
-
430  using const_iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::const_iterator, const_iterator>>;
-
431 
-
433  basic_storage()
-
434  : basic_storage{allocator_type{}} {}
-
435 
-
440  explicit basic_storage(const allocator_type &allocator)
-
441  : base_type{type_id<value_type>(), deletion_policy{comp_traits::in_place_delete}, allocator},
-
442  packed{container_type{allocator}, allocator} {}
-
443 
-
448  basic_storage(basic_storage &&other) ENTT_NOEXCEPT
-
449  : base_type{std::move(other)},
-
450  packed{std::move(other.packed)} {}
-
451 
-
457  basic_storage(basic_storage &&other, const allocator_type &allocator) ENTT_NOEXCEPT
-
458  : base_type{std::move(other), allocator},
-
459  packed{container_type{std::move(other.packed.first()), allocator}, allocator} {
-
460  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.second() == other.packed.second(), "Copying a storage is not allowed");
-
461  }
-
462 
-
464  ~basic_storage() override {
-
465  release_all_pages();
-
466  }
-
467 
-
473  basic_storage &operator=(basic_storage &&other) ENTT_NOEXCEPT {
-
474  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.second() == other.packed.second(), "Copying a sparse set is not allowed");
-
475 
-
476  release_all_pages();
-
477  base_type::operator=(std::move(other));
-
478  packed.first() = std::move(other.packed.first());
-
479  propagate_on_container_move_assignment(packed.second(), other.packed.second());
-
480  return *this;
-
481  }
-
482 
-
487  void swap(basic_storage &other) {
-
488  using std::swap;
-
489  underlying_type::swap(other);
-
490  propagate_on_container_swap(packed.second(), other.packed.second());
-
491  swap(packed.first(), other.packed.first());
-
492  }
-
493 
-
498  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
-
499  return allocator_type{packed.second()};
-
500  }
-
501 
-
510  void reserve(const size_type cap) override {
-
511  base_type::reserve(cap);
-
512 
-
513  if(cap > base_type::size()) {
-
514  assure_at_least(cap - 1u);
-
515  }
-
516  }
-
517 
-
523  [[nodiscard]] size_type capacity() const ENTT_NOEXCEPT override {
-
524  return packed.first().size() * comp_traits::page_size;
-
525  }
-
526 
-
528  void shrink_to_fit() override {
-
529  base_type::shrink_to_fit();
-
530  release_unused_pages();
+
322  void move_element(const std::size_t from, const std::size_t to) final {
+
323  auto &elem = element_at(from);
+
324  entt::uninitialized_construct_using_allocator(to_address(assure_at_least(to)), packed.second(), std::move(elem));
+
325  std::destroy_at(std::addressof(elem));
+
326  }
+
327 
+
328 protected:
+
334  void swap_and_pop(typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) override {
+
335  for(; first != last; ++first) {
+
336  auto &elem = element_at(base_type::size() - 1u);
+
337  // destroying on exit allows reentrant destructors
+
338  [[maybe_unused]] auto unused = std::exchange(element_at(static_cast<size_type>(first.index())), std::move(elem));
+
339  std::destroy_at(std::addressof(elem));
+
340  base_type::swap_and_pop(first, first + 1u);
+
341  }
+
342  }
+
343 
+
349  void in_place_pop(typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) override {
+
350  for(; first != last; ++first) {
+
351  base_type::in_place_pop(first, first + 1u);
+
352  std::destroy_at(std::addressof(element_at(static_cast<size_type>(first.index()))));
+
353  }
+
354  }
+
355 
+
363  typename underlying_type::basic_iterator try_emplace([[maybe_unused]] const Entity entt, const bool force_back, const void *value) override {
+
364  if(value) {
+
365  if constexpr(std::is_copy_constructible_v<value_type>) {
+
366  return emplace_element(entt, force_back, *static_cast<const value_type *>(value));
+
367  } else {
+
368  return base_type::end();
+
369  }
+
370  } else {
+
371  if constexpr(std::is_default_constructible_v<value_type>) {
+
372  return emplace_element(entt, force_back);
+
373  } else {
+
374  return base_type::end();
+
375  }
+
376  }
+
377  }
+
378 
+
379 public:
+
381  using base_type = underlying_type;
+
383  using allocator_type = Allocator;
+
385  using value_type = Type;
+
387  using entity_type = Entity;
+
389  using size_type = std::size_t;
+
391  using pointer = typename container_type::pointer;
+
393  using const_pointer = typename alloc_traits::template rebind_traits<typename alloc_traits::const_pointer>::const_pointer;
+
395  using iterator = internal::storage_iterator<container_type>;
+
397  using const_iterator = internal::storage_iterator<const container_type>;
+
399  using reverse_iterator = std::reverse_iterator<iterator>;
+
401  using const_reverse_iterator = std::reverse_iterator<const_iterator>;
+
403  using iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::iterator, iterator>>;
+
405  using const_iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::const_iterator, const_iterator>>;
+
406 
+
408  basic_storage()
+
409  : basic_storage{allocator_type{}} {}
+
410 
+
415  explicit basic_storage(const allocator_type &allocator)
+
416  : base_type{type_id<value_type>(), deletion_policy{comp_traits::in_place_delete}, allocator},
+
417  packed{container_type{allocator}, allocator} {}
+
418 
+
423  basic_storage(basic_storage &&other) ENTT_NOEXCEPT
+
424  : base_type{std::move(other)},
+
425  packed{std::move(other.packed)} {}
+
426 
+
432  basic_storage(basic_storage &&other, const allocator_type &allocator) ENTT_NOEXCEPT
+
433  : base_type{std::move(other), allocator},
+
434  packed{container_type{std::move(other.packed.first()), allocator}, allocator} {
+
435  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.second() == other.packed.second(), "Copying a storage is not allowed");
+
436  }
+
437 
+
439  ~basic_storage() override {
+
440  shrink_to_size(0u);
+
441  }
+
442 
+
448  basic_storage &operator=(basic_storage &&other) ENTT_NOEXCEPT {
+
449  ENTT_ASSERT(alloc_traits::is_always_equal::value || packed.second() == other.packed.second(), "Copying a storage is not allowed");
+
450 
+
451  shrink_to_size(0u);
+
452  base_type::operator=(std::move(other));
+
453  packed.first() = std::move(other.packed.first());
+
454  propagate_on_container_move_assignment(packed.second(), other.packed.second());
+
455  return *this;
+
456  }
+
457 
+
462  void swap(basic_storage &other) {
+
463  using std::swap;
+
464  underlying_type::swap(other);
+
465  propagate_on_container_swap(packed.second(), other.packed.second());
+
466  swap(packed.first(), other.packed.first());
+
467  }
+
468 
+
473  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
+
474  return allocator_type{packed.second()};
+
475  }
+
476 
+
485  void reserve(const size_type cap) override {
+
486  if(cap != 0u) {
+
487  base_type::reserve(cap);
+
488  assure_at_least(cap - 1u);
+
489  }
+
490  }
+
491 
+
497  [[nodiscard]] size_type capacity() const ENTT_NOEXCEPT override {
+
498  return packed.first().size() * comp_traits::page_size;
+
499  }
+
500 
+
502  void shrink_to_fit() override {
+
503  base_type::shrink_to_fit();
+
504  shrink_to_size(base_type::size());
+
505  }
+
506 
+
511  [[nodiscard]] const_pointer raw() const ENTT_NOEXCEPT {
+
512  return packed.first().data();
+
513  }
+
514 
+
516  [[nodiscard]] pointer raw() ENTT_NOEXCEPT {
+
517  return packed.first().data();
+
518  }
+
519 
+
528  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
+
529  const auto pos = static_cast<typename iterator::difference_type>(base_type::size());
+
530  return const_iterator{&packed.first(), pos};
531  }
532 
-
537  [[nodiscard]] const_pointer raw() const ENTT_NOEXCEPT {
-
538  return packed.first().data();
-
539  }
-
540 
-
542  [[nodiscard]] pointer raw() ENTT_NOEXCEPT {
-
543  return packed.first().data();
-
544  }
-
545 
-
554  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
-
555  const auto pos = static_cast<typename iterator::difference_type>(base_type::size());
-
556  return const_iterator{&packed.first(), pos};
-
557  }
-
558 
-
560  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
-
561  return cbegin();
-
562  }
-
563 
-
565  [[nodiscard]] iterator begin() ENTT_NOEXCEPT {
-
566  const auto pos = static_cast<typename iterator::difference_type>(base_type::size());
-
567  return iterator{&packed.first(), pos};
-
568  }
-
569 
-
580  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
-
581  return const_iterator{&packed.first(), {}};
-
582  }
-
583 
-
585  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
-
586  return cend();
-
587  }
-
588 
-
590  [[nodiscard]] iterator end() ENTT_NOEXCEPT {
-
591  return iterator{&packed.first(), {}};
-
592  }
-
593 
-
603  [[nodiscard]] const_reverse_iterator crbegin() const ENTT_NOEXCEPT {
-
604  return std::make_reverse_iterator(cend());
-
605  }
-
606 
-
608  [[nodiscard]] const_reverse_iterator rbegin() const ENTT_NOEXCEPT {
-
609  return crbegin();
-
610  }
-
611 
-
613  [[nodiscard]] reverse_iterator rbegin() ENTT_NOEXCEPT {
-
614  return std::make_reverse_iterator(end());
-
615  }
-
616 
-
627  [[nodiscard]] const_reverse_iterator crend() const ENTT_NOEXCEPT {
-
628  return std::make_reverse_iterator(cbegin());
-
629  }
-
630 
-
632  [[nodiscard]] const_reverse_iterator rend() const ENTT_NOEXCEPT {
-
633  return crend();
-
634  }
-
635 
-
637  [[nodiscard]] reverse_iterator rend() ENTT_NOEXCEPT {
-
638  return std::make_reverse_iterator(begin());
-
639  }
-
640 
-
651  [[nodiscard]] const value_type &get(const entity_type entt) const ENTT_NOEXCEPT {
-
652  return element_at(base_type::index(entt));
-
653  }
-
654 
-
656  [[nodiscard]] value_type &get(const entity_type entt) ENTT_NOEXCEPT {
-
657  return const_cast<value_type &>(std::as_const(*this).get(entt));
-
658  }
-
659 
-
668  [[nodiscard]] std::tuple<const value_type &> get_as_tuple(const entity_type entt) const ENTT_NOEXCEPT {
-
669  return std::forward_as_tuple(get(entt));
-
670  }
-
671 
-
673  [[nodiscard]] std::tuple<value_type &> get_as_tuple(const entity_type entt) ENTT_NOEXCEPT {
-
674  return std::forward_as_tuple(get(entt));
-
675  }
-
676 
-
689  template<typename... Args>
-
690  value_type &emplace(const entity_type entt, Args &&...args) {
-
691  const auto pos = base_type::slot();
-
692  auto elem = assure_at_least(pos);
-
693  construct(elem, std::forward<Args>(args)...);
-
694 
-
695  ENTT_TRY {
-
696  base_type::try_emplace(entt);
-
697  ENTT_ASSERT(pos == base_type::index(entt), "Misplaced component");
-
698  }
-
699  ENTT_CATCH {
-
700  std::destroy_at(std::addressof(*elem));
-
701  ENTT_THROW;
-
702  }
-
703 
-
704  return *elem;
-
705  }
-
706 
-
714  template<typename... Func>
-
715  value_type &patch(const entity_type entt, Func &&...func) {
-
716  const auto idx = base_type::index(entt);
-
717  auto &elem = element_at(idx);
-
718  (std::forward<Func>(func)(elem), ...);
-
719  return elem;
-
720  }
-
721 
-
735  template<typename It>
-
736  void insert(It first, It last, const value_type &value = {}) {
-
737  consume_range(std::move(first), std::move(last), [&value]() -> decltype(auto) { return value; });
-
738  }
-
739 
-
752  template<typename EIt, typename CIt, typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, value_type>>>
-
753  void insert(EIt first, EIt last, CIt from) {
-
754  consume_range(std::move(first), std::move(last), [&from]() -> decltype(auto) { return *(from++); });
-
755  }
-
756 
-
765  [[nodiscard]] iterable each() ENTT_NOEXCEPT {
-
766  return {internal::extended_storage_iterator{base_type::begin(), begin()}, internal::extended_storage_iterator{base_type::end(), end()}};
-
767  }
-
768 
-
770  [[nodiscard]] const_iterable each() const ENTT_NOEXCEPT {
-
771  return {internal::extended_storage_iterator{base_type::cbegin(), cbegin()}, internal::extended_storage_iterator{base_type::cend(), cend()}};
-
772  }
-
773 
-
774 private:
-
775  compressed_pair<container_type, alloc> packed;
-
776 };
-
777 
-
779 template<typename Entity, typename Type, typename Allocator>
-
780 class basic_storage<Entity, Type, Allocator, std::enable_if_t<ignore_as_empty_v<Type>>>
-
781  : public basic_sparse_set<Entity, typename std::allocator_traits<Allocator>::template rebind_alloc<Entity>> {
-
782  using allocator_traits = std::allocator_traits<Allocator>;
-
783  using comp_traits = component_traits<Type>;
-
784 
-
785 public:
-
787  using base_type = basic_sparse_set<Entity, typename allocator_traits::template rebind_alloc<Entity>>;
-
789  using allocator_type = Allocator;
-
791  using value_type = Type;
-
793  using entity_type = Entity;
-
795  using size_type = std::size_t;
-
797  using iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::iterator>>;
-
799  using const_iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::const_iterator>>;
-
800 
-
802  basic_storage()
-
803  : basic_storage{allocator_type{}} {}
-
804 
-
809  explicit basic_storage(const allocator_type &allocator)
-
810  : base_type{type_id<value_type>(), deletion_policy{comp_traits::in_place_delete}, allocator} {}
-
811 
-
816  basic_storage(basic_storage &&other) ENTT_NOEXCEPT = default;
-
817 
-
823  basic_storage(basic_storage &&other, const allocator_type &allocator) ENTT_NOEXCEPT
-
824  : base_type{std::move(other), allocator} {}
-
825 
-
831  basic_storage &operator=(basic_storage &&other) ENTT_NOEXCEPT = default;
-
832 
-
837  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
-
838  return allocator_type{base_type::get_allocator()};
-
839  }
-
840 
-
850  void get([[maybe_unused]] const entity_type entt) const ENTT_NOEXCEPT {
-
851  ENTT_ASSERT(base_type::contains(entt), "Storage does not contain entity");
+
534  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
+
535  return cbegin();
+
536  }
+
537 
+
539  [[nodiscard]] iterator begin() ENTT_NOEXCEPT {
+
540  const auto pos = static_cast<typename iterator::difference_type>(base_type::size());
+
541  return iterator{&packed.first(), pos};
+
542  }
+
543 
+
554  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
+
555  return const_iterator{&packed.first(), {}};
+
556  }
+
557 
+
559  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
+
560  return cend();
+
561  }
+
562 
+
564  [[nodiscard]] iterator end() ENTT_NOEXCEPT {
+
565  return iterator{&packed.first(), {}};
+
566  }
+
567 
+
577  [[nodiscard]] const_reverse_iterator crbegin() const ENTT_NOEXCEPT {
+
578  return std::make_reverse_iterator(cend());
+
579  }
+
580 
+
582  [[nodiscard]] const_reverse_iterator rbegin() const ENTT_NOEXCEPT {
+
583  return crbegin();
+
584  }
+
585 
+
587  [[nodiscard]] reverse_iterator rbegin() ENTT_NOEXCEPT {
+
588  return std::make_reverse_iterator(end());
+
589  }
+
590 
+
601  [[nodiscard]] const_reverse_iterator crend() const ENTT_NOEXCEPT {
+
602  return std::make_reverse_iterator(cbegin());
+
603  }
+
604 
+
606  [[nodiscard]] const_reverse_iterator rend() const ENTT_NOEXCEPT {
+
607  return crend();
+
608  }
+
609 
+
611  [[nodiscard]] reverse_iterator rend() ENTT_NOEXCEPT {
+
612  return std::make_reverse_iterator(begin());
+
613  }
+
614 
+
625  [[nodiscard]] const value_type &get(const entity_type entt) const ENTT_NOEXCEPT {
+
626  return element_at(base_type::index(entt));
+
627  }
+
628 
+
630  [[nodiscard]] value_type &get(const entity_type entt) ENTT_NOEXCEPT {
+
631  return const_cast<value_type &>(std::as_const(*this).get(entt));
+
632  }
+
633 
+
639  [[nodiscard]] std::tuple<const value_type &> get_as_tuple(const entity_type entt) const ENTT_NOEXCEPT {
+
640  return std::forward_as_tuple(get(entt));
+
641  }
+
642 
+
644  [[nodiscard]] std::tuple<value_type &> get_as_tuple(const entity_type entt) ENTT_NOEXCEPT {
+
645  return std::forward_as_tuple(get(entt));
+
646  }
+
647 
+
660  template<typename... Args>
+
661  value_type &emplace(const entity_type entt, Args &&...args) {
+
662  if constexpr(std::is_aggregate_v<value_type>) {
+
663  const auto it = emplace_element(entt, false, Type{std::forward<Args>(args)...});
+
664  return element_at(static_cast<size_type>(it.index()));
+
665  } else {
+
666  const auto it = emplace_element(entt, false, std::forward<Args>(args)...);
+
667  return element_at(static_cast<size_type>(it.index()));
+
668  }
+
669  }
+
670 
+
678  template<typename... Func>
+
679  value_type &patch(const entity_type entt, Func &&...func) {
+
680  const auto idx = base_type::index(entt);
+
681  auto &elem = element_at(idx);
+
682  (std::forward<Func>(func)(elem), ...);
+
683  return elem;
+
684  }
+
685 
+
699  template<typename It>
+
700  void insert(It first, It last, const value_type &value = {}) {
+
701  for(; first != last; ++first) {
+
702  emplace_element(*first, true, value);
+
703  }
+
704  }
+
705 
+
718  template<typename EIt, typename CIt, typename = std::enable_if_t<std::is_same_v<typename std::iterator_traits<CIt>::value_type, value_type>>>
+
719  void insert(EIt first, EIt last, CIt from) {
+
720  for(; first != last; ++first, ++from) {
+
721  emplace_element(*first, true, *from);
+
722  }
+
723  }
+
724 
+
733  [[nodiscard]] iterable each() ENTT_NOEXCEPT {
+
734  return {internal::extended_storage_iterator{base_type::begin(), begin()}, internal::extended_storage_iterator{base_type::end(), end()}};
+
735  }
+
736 
+
738  [[nodiscard]] const_iterable each() const ENTT_NOEXCEPT {
+
739  return {internal::extended_storage_iterator{base_type::cbegin(), cbegin()}, internal::extended_storage_iterator{base_type::cend(), cend()}};
+
740  }
+
741 
+
742 private:
+
743  compressed_pair<container_type, allocator_type> packed;
+
744 };
+
745 
+
747 template<typename Entity, typename Type, typename Allocator>
+
748 class basic_storage<Entity, Type, Allocator, std::enable_if_t<ignore_as_empty_v<Type>>>
+
749  : public basic_sparse_set<Entity, typename std::allocator_traits<Allocator>::template rebind_alloc<Entity>> {
+
750  using alloc_traits = std::allocator_traits<Allocator>;
+
751  static_assert(std::is_same_v<typename alloc_traits::value_type, Type>, "Invalid value type");
+
752  using underlying_type = basic_sparse_set<Entity, typename alloc_traits::template rebind_alloc<Entity>>;
+
753  using comp_traits = component_traits<Type>;
+
754 
+
755 public:
+
757  using base_type = underlying_type;
+
759  using allocator_type = Allocator;
+
761  using value_type = Type;
+
763  using entity_type = Entity;
+
765  using size_type = std::size_t;
+
767  using iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::iterator>>;
+
769  using const_iterable = iterable_adaptor<internal::extended_storage_iterator<typename base_type::const_iterator>>;
+
770 
+
772  basic_storage()
+
773  : basic_storage{allocator_type{}} {}
+
774 
+
779  explicit basic_storage(const allocator_type &allocator)
+
780  : base_type{type_id<value_type>(), deletion_policy{comp_traits::in_place_delete}, allocator} {}
+
781 
+
786  basic_storage(basic_storage &&other) ENTT_NOEXCEPT = default;
+
787 
+
793  basic_storage(basic_storage &&other, const allocator_type &allocator) ENTT_NOEXCEPT
+
794  : base_type{std::move(other), allocator} {}
+
795 
+
801  basic_storage &operator=(basic_storage &&other) ENTT_NOEXCEPT = default;
+
802 
+
807  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
+
808  return allocator_type{base_type::get_allocator()};
+
809  }
+
810 
+
820  void get([[maybe_unused]] const entity_type entt) const ENTT_NOEXCEPT {
+
821  ENTT_ASSERT(base_type::contains(entt), "Storage does not contain entity");
+
822  }
+
823 
+
834  [[nodiscard]] std::tuple<> get_as_tuple([[maybe_unused]] const entity_type entt) const ENTT_NOEXCEPT {
+
835  ENTT_ASSERT(base_type::contains(entt), "Storage does not contain entity");
+
836  return std::tuple{};
+
837  }
+
838 
+
849  template<typename... Args>
+
850  void emplace(const entity_type entt, Args &&...) {
+
851  base_type::try_emplace(entt, false);
852  }
853 
-
864  [[nodiscard]] std::tuple<> get_as_tuple([[maybe_unused]] const entity_type entt) const ENTT_NOEXCEPT {
-
865  ENTT_ASSERT(base_type::contains(entt), "Storage does not contain entity");
-
866  return std::tuple{};
-
867  }
-
868 
-
880  template<typename... Args>
-
881  void emplace(const entity_type entt, Args &&...args) {
-
882  [[maybe_unused]] const value_type elem{std::forward<Args>(args)...};
-
883  base_type::try_emplace(entt);
-
884  }
-
885 
-
892  template<typename... Func>
-
893  void patch([[maybe_unused]] const entity_type entt, Func &&...func) {
-
894  ENTT_ASSERT(base_type::contains(entt), "Storage does not contain entity");
-
895  (std::forward<Func>(func)(), ...);
-
896  }
-
897 
-
905  template<typename It, typename... Args>
-
906  void insert(It first, It last, Args &&...) {
-
907  for(const auto sz = base_type::size(); first != last && base_type::slot() != sz; ++first) {
-
908  emplace(*first);
-
909  }
-
910 
-
911  base_type::reserve(base_type::size() + std::distance(first, last));
-
912 
-
913  for(; first != last; ++first) {
-
914  emplace(*first);
-
915  }
-
916  }
-
917 
-
925  [[nodiscard]] iterable each() ENTT_NOEXCEPT {
-
926  return {internal::extended_storage_iterator{base_type::begin()}, internal::extended_storage_iterator{base_type::end()}};
-
927  }
-
928 
-
930  [[nodiscard]] const_iterable each() const ENTT_NOEXCEPT {
-
931  return {internal::extended_storage_iterator{base_type::cbegin()}, internal::extended_storage_iterator{base_type::cend()}};
-
932  }
-
933 };
-
934 
-
948 template<typename Type>
-
949 class sigh_storage_mixin final: public Type {
-
951  void swap_and_pop(const typename Type::entity_type entt) final {
-
952  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
-
953  destruction.publish(*owner, entt);
-
954  Type::swap_and_pop(entt);
-
955  }
-
956 
-
958  void in_place_pop(const typename Type::entity_type entt) final {
-
959  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
-
960  destruction.publish(*owner, entt);
-
961  Type::in_place_pop(entt);
-
962  }
-
963 
-
965  void try_emplace(const typename Type::entity_type entt, const void *value) final {
-
966  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
-
967  Type::try_emplace(entt, value);
-
968  construction.publish(*owner, entt);
-
969  }
-
970 
-
971 public:
-
973  using value_type = typename Type::value_type;
-
975  using entity_type = typename Type::entity_type;
-
976 
-
978  using Type::Type;
-
979 
-
991  [[nodiscard]] auto on_construct() ENTT_NOEXCEPT {
-
992  return sink{construction};
-
993  }
-
994 
-
1006  [[nodiscard]] auto on_update() ENTT_NOEXCEPT {
-
1007  return sink{update};
-
1008  }
-
1009 
-
1021  [[nodiscard]] auto on_destroy() ENTT_NOEXCEPT {
-
1022  return sink{destruction};
-
1023  }
-
1024 
-
1032  template<typename... Args>
-
1033  decltype(auto) emplace(const entity_type entt, Args &&...args) {
-
1034  Type::emplace(entt, std::forward<Args>(args)...);
-
1035  construction.publish(*owner, entt);
-
1036  return this->get(entt);
-
1037  }
-
1038 
-
1046  template<typename... Func>
-
1047  decltype(auto) patch(const entity_type entt, Func &&...func) {
-
1048  Type::patch(entt, std::forward<Func>(func)...);
-
1049  update.publish(*owner, entt);
-
1050  return this->get(entt);
-
1051  }
-
1052 
-
1063  template<typename It, typename... Args>
-
1064  void insert(It first, It last, Args &&...args) {
-
1065  Type::insert(first, last, std::forward<Args>(args)...);
-
1066 
-
1067  if(!construction.empty()) {
-
1068  for(; first != last; ++first) {
-
1069  construction.publish(*owner, *first);
-
1070  }
-
1071  }
-
1072  }
-
1073 
-
1078  void bind(any value) ENTT_NOEXCEPT final {
-
1079  auto *reg = any_cast<basic_registry<entity_type>>(&value);
-
1080  owner = reg ? reg : owner;
-
1081  Type::bind(std::move(value));
-
1082  }
-
1083 
-
1084 private:
-
1085  sigh<void(basic_registry<entity_type> &, const entity_type)> construction{};
-
1086  sigh<void(basic_registry<entity_type> &, const entity_type)> destruction{};
-
1087  sigh<void(basic_registry<entity_type> &, const entity_type)> update{};
-
1088  basic_registry<entity_type> *owner{};
-
1089 };
-
1090 
-
1096 template<typename Entity, typename Type, typename = void>
-
1097 struct storage_traits {
-
1099  using storage_type = sigh_storage_mixin<basic_storage<Entity, Type>>;
-
1100 };
-
1101 
-
1102 } // namespace entt
-
1103 
-
1104 #endif
-
entt::basic_any<>
-
entt::basic_registry< entity_type >
+
860  template<typename... Func>
+
861  void patch([[maybe_unused]] const entity_type entt, Func &&...func) {
+
862  ENTT_ASSERT(base_type::contains(entt), "Storage does not contain entity");
+
863  (std::forward<Func>(func)(), ...);
+
864  }
+
865 
+
873  template<typename It, typename... Args>
+
874  void insert(It first, It last, Args &&...) {
+
875  for(; first != last; ++first) {
+
876  base_type::try_emplace(*first, true);
+
877  }
+
878  }
+
879 
+
887  [[nodiscard]] iterable each() ENTT_NOEXCEPT {
+
888  return {internal::extended_storage_iterator{base_type::begin()}, internal::extended_storage_iterator{base_type::end()}};
+
889  }
+
890 
+
892  [[nodiscard]] const_iterable each() const ENTT_NOEXCEPT {
+
893  return {internal::extended_storage_iterator{base_type::cbegin()}, internal::extended_storage_iterator{base_type::cend()}};
+
894  }
+
895 };
+
896 
+
902 template<typename Entity, typename Type, typename = void>
+
903 struct storage_traits {
+
905  using storage_type = sigh_storage_mixin<basic_storage<Entity, Type>>;
+
906 };
+
907 
+
908 } // namespace entt
+
909 
+
910 #endif
entt::basic_sparse_set
Basic sparse set implementation.
Definition: sparse_set.hpp:174
-
entt::basic_sparse_set::swap
void swap(basic_sparse_set &other)
Exchanges the contents with those of a given sparse set.
Definition: sparse_set.hpp:388
-
entt::basic_sparse_set::index
size_type index(const entity_type entt) const
Returns the position of an entity in a sparse set.
Definition: sparse_set.hpp:611
-
entt::basic_sparse_set::end
iterator end() const
Returns an iterator to the end.
Definition: sparse_set.hpp:520
-
entt::basic_sparse_set::slot
size_type slot() const
Returns the next slot available for insertion.
Definition: sparse_set.hpp:417
-
entt::basic_sparse_set::swap_and_pop
virtual void swap_and_pop(const Entity entt)
Erase an entity from a sparse set.
Definition: sparse_set.hpp:226
-
entt::basic_sparse_set::reserve
virtual void reserve(const size_type cap)
Increases the capacity of a sparse set.
Definition: sparse_set.hpp:429
-
entt::basic_sparse_set::size
size_type size() const
Returns the number of elements in a sparse set.
Definition: sparse_set.hpp:471
-
entt::basic_sparse_set::shrink_to_fit
virtual void shrink_to_fit()
Requests the removal of unused capacity.
Definition: sparse_set.hpp:443
-
entt::basic_sparse_set::at
entity_type at(const size_type pos) const
Returns the entity at specified location, with bounds checking.
Definition: sparse_set.hpp:621
-
entt::basic_sparse_set::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:500
-
entt::basic_sparse_set::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:506
-
entt::basic_sparse_set::in_place_pop
virtual void in_place_pop(const Entity entt)
Erase an entity from a sparse set.
Definition: sparse_set.hpp:245
-
entt::basic_sparse_set::contains
bool contains(const entity_type entt) const
Checks if a sparse set contains an entity.
Definition: sparse_set.hpp:582
-
entt::basic_sparse_set::try_emplace
virtual void try_emplace(const Entity entt, const void *=nullptr)
Assigns an entity to a sparse set.
Definition: sparse_set.hpp:259
-
entt::basic_sparse_set::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: sparse_set.hpp:401
-
entt::basic_sparse_set::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: sparse_set.hpp:525
-
entt::basic_sparse_set::operator=
basic_sparse_set & operator=(basic_sparse_set &&other)
Move assignment operator.
Definition: sparse_set.hpp:372
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage
basic_storage(const allocator_type &allocator)
Constructs an empty container with a given allocator.
Definition: storage.hpp:809
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::emplace
void emplace(const entity_type entt, Args &&...args)
Assigns an entity to a storage and constructs its object.
Definition: storage.hpp:881
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage
basic_storage(basic_storage &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: storage.hpp:823
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: storage.hpp:837
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each
const_iterable each() const
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:930
+
entt::basic_sparse_set::swap
void swap(basic_sparse_set &other)
Exchanges the contents with those of a given sparse set.
Definition: sparse_set.hpp:390
+
entt::basic_sparse_set::index
size_type index(const entity_type entt) const
Returns the position of an entity in a sparse set.
Definition: sparse_set.hpp:605
+
entt::basic_sparse_set::try_emplace
virtual basic_iterator try_emplace(const Entity entt, const bool force_back, const void *=nullptr)
Assigns an entity to a sparse set.
Definition: sparse_set.hpp:271
+
entt::basic_sparse_set::end
iterator end() const
Returns an iterator to the end.
Definition: sparse_set.hpp:514
+
entt::basic_sparse_set::reserve
virtual void reserve(const size_type cap)
Increases the capacity of a sparse set.
Definition: sparse_set.hpp:423
+
entt::basic_sparse_set::size
size_type size() const
Returns the number of elements in a sparse set.
Definition: sparse_set.hpp:465
+
entt::basic_sparse_set::shrink_to_fit
virtual void shrink_to_fit()
Requests the removal of unused capacity.
Definition: sparse_set.hpp:437
+
entt::basic_sparse_set::swap_and_pop
virtual void swap_and_pop(basic_iterator first, basic_iterator last)
Erases entities from a sparse set.
Definition: sparse_set.hpp:241
+
entt::basic_sparse_set::at
entity_type at(const size_type pos) const
Returns the entity at specified location, with bounds checking.
Definition: sparse_set.hpp:615
+
entt::basic_sparse_set::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:494
+
entt::basic_sparse_set::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: sparse_set.hpp:500
+
entt::basic_sparse_set::basic_iterator
internal::sparse_set_iterator< packed_container_type > basic_iterator
Random access iterator type.
Definition: sparse_set.hpp:234
+
entt::basic_sparse_set::contains
bool contains(const entity_type entt) const
Checks if a sparse set contains an entity.
Definition: sparse_set.hpp:576
+
entt::basic_sparse_set::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: sparse_set.hpp:403
+
entt::basic_sparse_set::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: sparse_set.hpp:519
+
entt::basic_sparse_set::operator=
basic_sparse_set & operator=(basic_sparse_set &&other)
Move assignment operator.
Definition: sparse_set.hpp:374
+
entt::basic_sparse_set::in_place_pop
virtual void in_place_pop(basic_iterator first, basic_iterator last)
Erases entities from a sparse set.
Definition: sparse_set.hpp:258
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage
basic_storage(const allocator_type &allocator)
Constructs an empty container with a given allocator.
Definition: storage.hpp:779
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage
basic_storage(basic_storage &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: storage.hpp:793
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: storage.hpp:807
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each
const_iterable each() const
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:892
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage
basic_storage(basic_storage &&other)=default
Move constructor.
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::value_type
Type value_type
Type of the objects assigned to entities.
Definition: storage.hpp:791
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each
iterable each()
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:925
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::size_type
std::size_t size_type
Unsigned integer type.
Definition: storage.hpp:795
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::insert
void insert(It first, It last, Args &&...)
Assigns entities to a storage.
Definition: storage.hpp:906
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_as_tuple
std::tuple get_as_tuple([[maybe_unused]] const entity_type entt) const
Returns an empty tuple.
Definition: storage.hpp:864
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::patch
void patch([[maybe_unused]] const entity_type entt, Func &&...func)
Updates the instance assigned to a given entity in-place.
Definition: storage.hpp:893
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get
void get([[maybe_unused]] const entity_type entt) const
Returns the object assigned to an entity, that is void.
Definition: storage.hpp:850
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: storage.hpp:793
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage
basic_storage()
Default constructor.
Definition: storage.hpp:802
-
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::allocator_type
Allocator allocator_type
Allocator type.
Definition: storage.hpp:789
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::value_type
Type value_type
Type of the objects assigned to entities.
Definition: storage.hpp:761
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each
iterable each()
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:887
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::size_type
std::size_t size_type
Unsigned integer type.
Definition: storage.hpp:765
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::insert
void insert(It first, It last, Args &&...)
Assigns entities to a storage.
Definition: storage.hpp:874
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_as_tuple
std::tuple get_as_tuple([[maybe_unused]] const entity_type entt) const
Returns an empty tuple.
Definition: storage.hpp:834
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::patch
void patch([[maybe_unused]] const entity_type entt, Func &&...func)
Updates the instance assigned to a given entity in-place.
Definition: storage.hpp:861
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get
void get([[maybe_unused]] const entity_type entt) const
Returns the object assigned to an entity, that is void.
Definition: storage.hpp:820
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: storage.hpp:763
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage
basic_storage()
Default constructor.
Definition: storage.hpp:772
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::allocator_type
Allocator allocator_type
Allocator type.
Definition: storage.hpp:759
+
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::emplace
void emplace(const entity_type entt, Args &&...)
Assigns an entity to a storage and constructs its object.
Definition: storage.hpp:850
entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::operator=
basic_storage & operator=(basic_storage &&other)=default
Move assignment operator.
-
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:237
-
entt::basic_storage::get
value_type & get(const entity_type entt)
Returns the object assigned to an entity.
Definition: storage.hpp:656
-
entt::basic_storage::crend
const_reverse_iterator crend() const
Returns a reverse iterator to the end.
Definition: storage.hpp:627
-
entt::basic_storage::shrink_to_fit
void shrink_to_fit() override
Requests the removal of unused capacity.
Definition: storage.hpp:528
-
entt::basic_storage::end
iterator end()
Returns an iterator to the end.
Definition: storage.hpp:590
-
entt::basic_storage::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: storage.hpp:554
-
entt::basic_storage::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: storage.hpp:580
-
entt::basic_storage::reverse_iterator
std::reverse_iterator< iterator > reverse_iterator
Reverse iterator type.
Definition: storage.hpp:424
-
entt::basic_storage::rbegin
const_reverse_iterator rbegin() const
Returns a reverse iterator to the beginning.
Definition: storage.hpp:608
-
entt::basic_storage::allocator_type
Allocator allocator_type
Allocator type.
Definition: storage.hpp:408
-
entt::basic_storage::basic_storage
basic_storage(basic_storage &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: storage.hpp:457
-
entt::basic_storage::in_place_pop
void in_place_pop(const Entity entt) override
Erases an element from a storage.
Definition: storage.hpp:380
-
entt::basic_storage::swap_at
void swap_at(const std::size_t lhs, const std::size_t rhs) final
Swaps two elements in a storage.
Definition: storage.hpp:342
-
entt::basic_storage::get_as_tuple
std::tuple< value_type & > get_as_tuple(const entity_type entt)
Returns the object assigned to an entity as a tuple.
Definition: storage.hpp:673
-
entt::basic_storage::each
iterable each()
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:765
-
entt::basic_storage::iterator
internal::storage_iterator< container_type > iterator
Random access iterator type.
Definition: storage.hpp:420
-
entt::basic_storage::swap_and_pop
void swap_and_pop(const Entity entt) override
Erase an element from a storage.
Definition: storage.hpp:361
-
entt::basic_storage::const_iterator
internal::storage_iterator< const container_type > const_iterator
Constant random access iterator type.
Definition: storage.hpp:422
-
entt::basic_storage::rend
reverse_iterator rend()
Returns a reverse iterator to the end.
Definition: storage.hpp:637
-
entt::basic_storage::operator=
basic_storage & operator=(basic_storage &&other)
Move assignment operator.
Definition: storage.hpp:473
-
entt::basic_storage::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: storage.hpp:560
-
entt::basic_storage::emplace
value_type & emplace(const entity_type entt, Args &&...args)
Assigns an entity to a storage and constructs its object.
Definition: storage.hpp:690
-
entt::basic_storage::rbegin
reverse_iterator rbegin()
Returns a reverse iterator to the beginning.
Definition: storage.hpp:613
-
entt::basic_storage::raw
const_pointer raw() const
Direct access to the array of objects.
Definition: storage.hpp:537
-
entt::basic_storage::get_at
const void * get_at(const std::size_t pos) const override
Returns the element assigned to an entity.
Definition: storage.hpp:333
-
entt::basic_storage::basic_storage
basic_storage(basic_storage &&other)
Move constructor.
Definition: storage.hpp:448
-
entt::basic_storage::pointer
typename container_type::pointer pointer
Pointer type to contained elements.
Definition: storage.hpp:416
-
entt::basic_storage::reserve
void reserve(const size_type cap) override
Increases the capacity of a storage.
Definition: storage.hpp:510
-
entt::basic_storage::patch
value_type & patch(const entity_type entt, Func &&...func)
Updates the instance assigned to a given entity in-place.
Definition: storage.hpp:715
-
entt::basic_storage::rend
const_reverse_iterator rend() const
Returns a reverse iterator to the end.
Definition: storage.hpp:632
-
entt::basic_storage::size_type
std::size_t size_type
Unsigned integer type.
Definition: storage.hpp:414
-
entt::basic_storage::const_reverse_iterator
std::reverse_iterator< const_iterator > const_reverse_iterator
Constant reverse iterator type.
Definition: storage.hpp:426
-
entt::basic_storage::move_and_pop
void move_and_pop(const std::size_t from, const std::size_t to) final
Moves an element within a storage.
Definition: storage.hpp:351
-
entt::basic_storage::const_pointer
typename alloc_traits::template rebind_traits< typename alloc_traits::const_pointer >::const_pointer const_pointer
Constant pointer type to contained elements.
Definition: storage.hpp:418
-
entt::basic_storage::crbegin
const_reverse_iterator crbegin() const
Returns a reverse iterator to the beginning.
Definition: storage.hpp:603
-
entt::basic_storage::basic_storage
basic_storage(const allocator_type &allocator)
Constructs an empty storage with a given allocator.
Definition: storage.hpp:440
-
entt::basic_storage::end
const_iterator end() const
Returns an iterator to the end.
Definition: storage.hpp:585
-
entt::basic_storage::raw
pointer raw()
Direct access to the array of objects.
Definition: storage.hpp:542
-
entt::basic_storage::entity_type
Entity entity_type
Underlying entity identifier.
Definition: storage.hpp:412
-
entt::basic_storage::insert
void insert(It first, It last, const value_type &value={})
Assigns one or more entities to a storage and constructs their objects from a given instance.
Definition: storage.hpp:736
-
entt::basic_storage::try_emplace
void try_emplace([[maybe_unused]] const Entity entt, const void *value) override
Assigns an entity to a storage.
Definition: storage.hpp:392
-
entt::basic_storage::begin
iterator begin()
Returns an iterator to the beginning.
Definition: storage.hpp:565
-
entt::basic_storage::basic_storage
basic_storage()
Default constructor.
Definition: storage.hpp:433
-
entt::basic_storage::swap
void swap(basic_storage &other)
Exchanges the contents with those of a given storage.
Definition: storage.hpp:487
-
entt::basic_storage::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: storage.hpp:498
-
entt::basic_storage::insert
void insert(EIt first, EIt last, CIt from)
Assigns one or more entities to a storage and constructs their objects from a given range.
Definition: storage.hpp:753
-
entt::basic_storage::~basic_storage
~basic_storage() override
Default destructor.
Definition: storage.hpp:464
-
entt::basic_storage::each
const_iterable each() const
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:770
-
entt::basic_storage::value_type
Type value_type
Type of the objects assigned to entities.
Definition: storage.hpp:410
-
entt::basic_storage::get_as_tuple
std::tuple< const value_type & > get_as_tuple(const entity_type entt) const
Returns the object assigned to an entity as a tuple.
Definition: storage.hpp:668
-
entt::basic_storage::get
const value_type & get(const entity_type entt) const
Returns the object assigned to an entity.
Definition: storage.hpp:651
-
entt::basic_storage::capacity
size_type capacity() const override
Returns the number of elements that a storage has currently allocated space for.
Definition: storage.hpp:523
-
entt::compressed_pair< container_type, alloc >
+
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:234
+
entt::basic_storage::get
value_type & get(const entity_type entt)
Returns the object assigned to an entity.
Definition: storage.hpp:630
+
entt::basic_storage::crend
const_reverse_iterator crend() const
Returns a reverse iterator to the end.
Definition: storage.hpp:601
+
entt::basic_storage::shrink_to_fit
void shrink_to_fit() override
Requests the removal of unused capacity.
Definition: storage.hpp:502
+
entt::basic_storage::end
iterator end()
Returns an iterator to the end.
Definition: storage.hpp:564
+
entt::basic_storage::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: storage.hpp:528
+
entt::basic_storage::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: storage.hpp:554
+
entt::basic_storage::reverse_iterator
std::reverse_iterator< iterator > reverse_iterator
Reverse iterator type.
Definition: storage.hpp:399
+
entt::basic_storage::rbegin
const_reverse_iterator rbegin() const
Returns a reverse iterator to the beginning.
Definition: storage.hpp:582
+
entt::basic_storage::allocator_type
Allocator allocator_type
Allocator type.
Definition: storage.hpp:383
+
entt::basic_storage::basic_storage
basic_storage(basic_storage &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: storage.hpp:432
+
entt::basic_storage::try_emplace
underlying_type::basic_iterator try_emplace([[maybe_unused]] const Entity entt, const bool force_back, const void *value) override
Assigns an entity to a storage.
Definition: storage.hpp:363
+
entt::basic_storage::get_as_tuple
std::tuple< value_type & > get_as_tuple(const entity_type entt)
Returns the object assigned to an entity as a tuple.
Definition: storage.hpp:644
+
entt::basic_storage::each
iterable each()
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:733
+
entt::basic_storage::iterator
internal::storage_iterator< container_type > iterator
Random access iterator type.
Definition: storage.hpp:395
+
entt::basic_storage::const_iterator
internal::storage_iterator< const container_type > const_iterator
Constant random access iterator type.
Definition: storage.hpp:397
+
entt::basic_storage::rend
reverse_iterator rend()
Returns a reverse iterator to the end.
Definition: storage.hpp:611
+
entt::basic_storage::operator=
basic_storage & operator=(basic_storage &&other)
Move assignment operator.
Definition: storage.hpp:448
+
entt::basic_storage::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: storage.hpp:534
+
entt::basic_storage::emplace
value_type & emplace(const entity_type entt, Args &&...args)
Assigns an entity to a storage and constructs its object.
Definition: storage.hpp:661
+
entt::basic_storage::rbegin
reverse_iterator rbegin()
Returns a reverse iterator to the beginning.
Definition: storage.hpp:587
+
entt::basic_storage::raw
const_pointer raw() const
Direct access to the array of objects.
Definition: storage.hpp:511
+
entt::basic_storage::basic_storage
basic_storage(basic_storage &&other)
Move constructor.
Definition: storage.hpp:423
+
entt::basic_storage::pointer
typename container_type::pointer pointer
Pointer type to contained elements.
Definition: storage.hpp:391
+
entt::basic_storage::reserve
void reserve(const size_type cap) override
Increases the capacity of a storage.
Definition: storage.hpp:485
+
entt::basic_storage::patch
value_type & patch(const entity_type entt, Func &&...func)
Updates the instance assigned to a given entity in-place.
Definition: storage.hpp:679
+
entt::basic_storage::in_place_pop
void in_place_pop(typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) override
Erases elements from a storage.
Definition: storage.hpp:349
+
entt::basic_storage::rend
const_reverse_iterator rend() const
Returns a reverse iterator to the end.
Definition: storage.hpp:606
+
entt::basic_storage::size_type
std::size_t size_type
Unsigned integer type.
Definition: storage.hpp:389
+
entt::basic_storage::const_reverse_iterator
std::reverse_iterator< const_iterator > const_reverse_iterator
Constant reverse iterator type.
Definition: storage.hpp:401
+
entt::basic_storage::const_pointer
typename alloc_traits::template rebind_traits< typename alloc_traits::const_pointer >::const_pointer const_pointer
Constant pointer type to contained elements.
Definition: storage.hpp:393
+
entt::basic_storage::crbegin
const_reverse_iterator crbegin() const
Returns a reverse iterator to the beginning.
Definition: storage.hpp:577
+
entt::basic_storage::basic_storage
basic_storage(const allocator_type &allocator)
Constructs an empty storage with a given allocator.
Definition: storage.hpp:415
+
entt::basic_storage::end
const_iterator end() const
Returns an iterator to the end.
Definition: storage.hpp:559
+
entt::basic_storage::raw
pointer raw()
Direct access to the array of objects.
Definition: storage.hpp:516
+
entt::basic_storage::entity_type
Entity entity_type
Underlying entity identifier.
Definition: storage.hpp:387
+
entt::basic_storage::insert
void insert(It first, It last, const value_type &value={})
Assigns one or more entities to a storage and constructs their objects from a given instance.
Definition: storage.hpp:700
+
entt::basic_storage::begin
iterator begin()
Returns an iterator to the beginning.
Definition: storage.hpp:539
+
entt::basic_storage::basic_storage
basic_storage()
Default constructor.
Definition: storage.hpp:408
+
entt::basic_storage::swap
void swap(basic_storage &other)
Exchanges the contents with those of a given storage.
Definition: storage.hpp:462
+
entt::basic_storage::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: storage.hpp:473
+
entt::basic_storage::insert
void insert(EIt first, EIt last, CIt from)
Assigns one or more entities to a storage and constructs their objects from a given range.
Definition: storage.hpp:719
+
entt::basic_storage::swap_and_pop
void swap_and_pop(typename underlying_type::basic_iterator first, typename underlying_type::basic_iterator last) override
Erases elements from a storage.
Definition: storage.hpp:334
+
entt::basic_storage::~basic_storage
~basic_storage() override
Default destructor.
Definition: storage.hpp:439
+
entt::basic_storage::each
const_iterable each() const
Returns an iterable object to use to visit a storage.
Definition: storage.hpp:738
+
entt::basic_storage::value_type
Type value_type
Type of the objects assigned to entities.
Definition: storage.hpp:385
+
entt::basic_storage::get_as_tuple
std::tuple< const value_type & > get_as_tuple(const entity_type entt) const
Returns the object assigned to an entity as a tuple.
Definition: storage.hpp:639
+
entt::basic_storage::get
const value_type & get(const entity_type entt) const
Returns the object assigned to an entity.
Definition: storage.hpp:625
+
entt::basic_storage::capacity
size_type capacity() const override
Returns the number of elements that a storage has currently allocated space for.
Definition: storage.hpp:497
+
entt::compressed_pair< container_type, allocator_type >
entt::compressed_pair::second
second_type & second()
Returns the second element that a pair stores.
Definition: compressed_pair.hpp:185
entt::compressed_pair::first
first_type & first()
Returns the first element that a pair stores.
Definition: compressed_pair.hpp:172
-
entt::sigh_storage_mixin
Mixin type used to add signal support to storage types.
Definition: storage.hpp:949
-
entt::sigh_storage_mixin::bind
void bind(any value) final
Forwards variables to mixins, if any.
Definition: storage.hpp:1078
-
entt::sigh_storage_mixin::entity_type
typename Type::entity_type entity_type
Underlying entity identifier.
Definition: storage.hpp:975
-
entt::sigh_storage_mixin::on_destroy
auto on_destroy()
Returns a sink object.
Definition: storage.hpp:1021
-
entt::sigh_storage_mixin::value_type
typename Type::value_type value_type
Underlying value type.
Definition: storage.hpp:973
-
entt::sigh_storage_mixin::on_construct
auto on_construct()
Returns a sink object.
Definition: storage.hpp:991
-
entt::sigh_storage_mixin::insert
void insert(It first, It last, Args &&...args)
Assigns entities to a storage.
Definition: storage.hpp:1064
-
entt::sigh_storage_mixin::on_update
auto on_update()
Returns a sink object.
Definition: storage.hpp:1006
-
entt::sigh_storage_mixin::patch
decltype(auto) patch(const entity_type entt, Func &&...func)
Patches the given instance for an entity.
Definition: storage.hpp:1047
-
entt::sigh_storage_mixin::emplace
decltype(auto) emplace(const entity_type entt, Args &&...args)
Assigns entities to a storage.
Definition: storage.hpp:1033
-
entt::sigh
Unmanaged signal handler.
Definition: fwd.hpp:24
-
entt::sink
Sink class.
Definition: fwd.hpp:21
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:217
-
entt::propagate_on_container_move_assignment
constexpr void propagate_on_container_move_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
Utility function to design allocation-aware containers.
Definition: memory.hpp:48
-
entt::propagate_on_container_swap
constexpr void propagate_on_container_swap([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
Utility function to design allocation-aware containers.
Definition: memory.hpp:61
-
entt::fast_mod
constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
Fast module utility function (powers of two only).
Definition: memory.hpp:101
-
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:256
-
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:254
-
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:280
+
entt::sigh_storage_mixin
Mixin type used to add signal support to storage types.
Definition: sigh_storage_mixin.hpp:26
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
+
entt::propagate_on_container_move_assignment
constexpr void propagate_on_container_move_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
Utility function to design allocation-aware containers.
Definition: memory.hpp:49
+
entt::propagate_on_container_swap
constexpr void propagate_on_container_swap([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
Utility function to design allocation-aware containers.
Definition: memory.hpp:62
+
entt::fast_mod
constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
Fast module utility function (powers of two only).
Definition: memory.hpp:102
+
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:257
+
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:273
+
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:299
+
entt::uninitialized_construct_using_allocator
constexpr Type * uninitialized_construct_using_allocator(Type *value, const Allocator &allocator, Args &&...args)
Uses-allocator construction utility (waiting for C++20).
Definition: memory.hpp:283
entt::tombstone
constexpr tombstone_t tombstone
Compile-time constant for tombstone entities.
Definition: entity.hpp:335
entt::operator+
constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
Concatenates multiple type lists.
Definition: type_traits.hpp:157
-
entt::get
constexpr get_t< Type... > get
Variable template for lists of observed components.
Definition: utility.hpp:34
-
entt::to_address
constexpr auto to_address(Type &&ptr)
Unwraps fancy pointers, does nothing otherwise (waiting for C++20).
Definition: memory.hpp:20
-
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:241
+
entt::to_address
constexpr auto to_address(Type &&ptr)
Unwraps fancy pointers, does nothing otherwise (waiting for C++20).
Definition: memory.hpp:21
+
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:260
entt::deletion_policy
deletion_policy
Sparse set deletion policy.
Definition: sparse_set.hpp:143
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
-
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:267
-
entt::basic_component_traits::page_size
static constexpr auto page_size
Page size, default is ENTT_PACKED_PAGE.
Definition: component.hpp:16
-
entt::basic_component_traits::in_place_delete
static constexpr auto in_place_delete
Pointer stability, default is false.
Definition: component.hpp:12
-
entt::component_traits
Common way to access various properties of components.
Definition: component.hpp:24
-
entt::iterable_adaptor
Utility class to create an iterable object from a pair of iterators.
Definition: iterator.hpp:62
-
entt::storage_traits
Provides a common way to access certain properties of storage types.
Definition: storage.hpp:1097
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:286
+
entt::component_traits
Common way to access various properties of components.
Definition: component.hpp:43
+
entt::component_traits::page_size
static constexpr std::size_t page_size
Page size, default is ENTT_PACKED_PAGE for non-empty types.
Definition: component.hpp:49
+
entt::component_traits::in_place_delete
static constexpr bool in_place_delete
Pointer stability, default is false.
Definition: component.hpp:47
+
entt::iterable_adaptor
Utility class to create an iterable object from a pair of iterators.
Definition: iterator.hpp:63
+
entt::storage_traits
Provides a common way to access certain properties of storage types.
Definition: storage.hpp:903
diff --git a/structentt_1_1adl__meta__pointer__like-members.html b/structentt_1_1adl__meta__pointer__like-members.html index 38f2cea7c..cf2aa94e6 100644 --- a/structentt_1_1adl__meta__pointer__like-members.html +++ b/structentt_1_1adl__meta__pointer__like-members.html @@ -22,7 +22,7 @@
diff --git a/structentt_1_1adl__meta__pointer__like.html b/structentt_1_1adl__meta__pointer__like.html index 2b6203e5b..05526c0d1 100644 --- a/structentt_1_1adl__meta__pointer__like.html +++ b/structentt_1_1adl__meta__pointer__like.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1allocation__deleter-members.html b/structentt_1_1allocation__deleter-members.html new file mode 100644 index 000000000..20c46e2d8 --- /dev/null +++ b/structentt_1_1allocation__deleter-members.html @@ -0,0 +1,86 @@ + + + + + + + +EnTT: Member List + + + + + + + + + +
+
+
iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::find iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::find (const value_type & const value_type &  value)
- + - + @@ -1687,12 +1612,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
Returns
An iterator to an element with the given value. If no such element is found, a past-the-end iterator is returned.
-

Definition at line 635 of file dense_hash_set.hpp.

+

Definition at line 609 of file dense_set.hpp.

- -

◆ get_allocator()

+ +

◆ get_allocator()

@@ -1703,7 +1628,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -87,152 +87,166 @@ $(function() {
15 
21 namespace internal {
22 
-
23 template<typename Type>
+
23 template<typename Set>
24 class runtime_view_iterator final {
-
25  [[nodiscard]] bool valid() const {
-
26  return std::all_of(pools->begin(), pools->end(), [entt = *it](const auto *curr) { return curr->contains(entt); })
-
27  && std::none_of(filter->cbegin(), filter->cend(), [entt = *it](const auto *curr) { return curr && curr->contains(entt); });
-
28  }
-
29 
-
30 public:
-
31  using iterator_type = typename Type::iterator;
-
32  using difference_type = typename iterator_type::difference_type;
-
33  using value_type = typename iterator_type::value_type;
-
34  using pointer = typename iterator_type::pointer;
-
35  using reference = typename iterator_type::reference;
-
36  using iterator_category = std::bidirectional_iterator_tag;
-
37 
-
38  runtime_view_iterator() ENTT_NOEXCEPT = default;
+
25  using iterator_type = typename Set::iterator;
+
26 
+
27  [[nodiscard]] bool valid() const {
+
28  return (!tombstone_check || *it != tombstone)
+
29  && std::all_of(++pools->begin(), pools->end(), [entt = *it](const auto *curr) { return curr->contains(entt); })
+
30  && std::none_of(filter->cbegin(), filter->cend(), [entt = *it](const auto *curr) { return curr && curr->contains(entt); });
+
31  }
+
32 
+
33 public:
+
34  using difference_type = typename iterator_type::difference_type;
+
35  using value_type = typename iterator_type::value_type;
+
36  using pointer = typename iterator_type::pointer;
+
37  using reference = typename iterator_type::reference;
+
38  using iterator_category = std::bidirectional_iterator_tag;
39 
-
40  runtime_view_iterator(const std::vector<const Type *> &cpools, const std::vector<const Type *> &ignore, iterator_type curr) ENTT_NOEXCEPT
-
41  : pools{&cpools},
-
42  filter{&ignore},
-
43  it{curr} {
-
44  if(it != (*pools)[0]->end() && !valid()) {
-
45  ++(*this);
-
46  }
-
47  }
-
48 
-
49  runtime_view_iterator &operator++() {
-
50  while(++it != (*pools)[0]->end() && !valid()) {}
-
51  return *this;
-
52  }
-
53 
-
54  runtime_view_iterator operator++(int) {
-
55  runtime_view_iterator orig = *this;
-
56  return ++(*this), orig;
-
57  }
-
58 
-
59  runtime_view_iterator &operator--() ENTT_NOEXCEPT {
-
60  while(--it != (*pools)[0]->begin() && !valid()) {}
-
61  return *this;
-
62  }
-
63 
-
64  runtime_view_iterator operator--(int) ENTT_NOEXCEPT {
-
65  runtime_view_iterator orig = *this;
-
66  return operator--(), orig;
-
67  }
-
68 
-
69  [[nodiscard]] pointer operator->() const {
-
70  return it.operator->();
-
71  }
-
72 
-
73  [[nodiscard]] reference operator*() const {
-
74  return *operator->();
-
75  }
-
76 
-
77  [[nodiscard]] bool operator==(const runtime_view_iterator &other) const ENTT_NOEXCEPT {
-
78  return it == other.it;
-
79  }
-
80 
-
81  [[nodiscard]] bool operator!=(const runtime_view_iterator &other) const ENTT_NOEXCEPT {
-
82  return !(*this == other);
-
83  }
-
84 
-
85 private:
-
86  const std::vector<const Type *> *pools;
-
87  const std::vector<const Type *> *filter;
-
88  iterator_type it;
-
89 };
-
90 
-
91 } // namespace internal
-
92 
-
136 template<typename Entity>
-
137 class basic_runtime_view final {
-
138  using basic_common_type = basic_sparse_set<Entity>;
-
139 
-
140  [[nodiscard]] bool valid() const {
-
141  return !pools.empty() && pools.front();
-
142  }
-
143 
-
144 public:
-
146  using entity_type = Entity;
-
148  using size_type = std::size_t;
-
150  using iterator = internal::runtime_view_iterator<basic_common_type>;
-
151 
-
153  basic_runtime_view() ENTT_NOEXCEPT
-
154  : pools{},
-
155  filter{} {}
-
156 
-
162  basic_runtime_view(std::vector<const basic_common_type *> cpools, std::vector<const basic_common_type *> epools) ENTT_NOEXCEPT
-
163  : pools{std::move(cpools)},
-
164  filter{std::move(epools)} {
-
165  auto candidate = std::min_element(pools.begin(), pools.end(), [](const auto *lhs, const auto *rhs) {
-
166  return (!lhs && rhs) || (lhs && rhs && lhs->size() < rhs->size());
-
167  });
-
168 
-
169  // brings the best candidate (if any) on front of the vector
-
170  std::rotate(pools.begin(), candidate, pools.end());
-
171  }
-
172 
-
177  [[nodiscard]] size_type size_hint() const {
-
178  return valid() ? pools.front()->size() : size_type{};
-
179  }
-
180 
-
191  [[nodiscard]] iterator begin() const {
-
192  return valid() ? iterator{pools, filter, pools[0]->begin()} : iterator{};
+
40  runtime_view_iterator() ENTT_NOEXCEPT
+
41  : pools{},
+
42  filter{},
+
43  it{},
+
44  tombstone_check{} {}
+
45 
+
46  runtime_view_iterator(const std::vector<const Set *> &cpools, const std::vector<const Set *> &ignore, iterator_type curr) ENTT_NOEXCEPT
+
47  : pools{&cpools},
+
48  filter{&ignore},
+
49  it{curr},
+
50  tombstone_check{pools->size() == 1u && (*pools)[0u]->policy() == deletion_policy::in_place} {
+
51  if(it != (*pools)[0]->end() && !valid()) {
+
52  ++(*this);
+
53  }
+
54  }
+
55 
+
56  runtime_view_iterator &operator++() {
+
57  while(++it != (*pools)[0]->end() && !valid()) {}
+
58  return *this;
+
59  }
+
60 
+
61  runtime_view_iterator operator++(int) {
+
62  runtime_view_iterator orig = *this;
+
63  return ++(*this), orig;
+
64  }
+
65 
+
66  runtime_view_iterator &operator--() {
+
67  while(--it != (*pools)[0]->begin() && !valid()) {}
+
68  return *this;
+
69  }
+
70 
+
71  runtime_view_iterator operator--(int) {
+
72  runtime_view_iterator orig = *this;
+
73  return operator--(), orig;
+
74  }
+
75 
+
76  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
77  return it.operator->();
+
78  }
+
79 
+
80  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
81  return *operator->();
+
82  }
+
83 
+
84  [[nodiscard]] bool operator==(const runtime_view_iterator &other) const ENTT_NOEXCEPT {
+
85  return it == other.it;
+
86  }
+
87 
+
88  [[nodiscard]] bool operator!=(const runtime_view_iterator &other) const ENTT_NOEXCEPT {
+
89  return !(*this == other);
+
90  }
+
91 
+
92 private:
+
93  const std::vector<const Set *> *pools;
+
94  const std::vector<const Set *> *filter;
+
95  iterator_type it;
+
96  bool tombstone_check;
+
97 };
+
98 
+
99 } // namespace internal
+
100 
+
112 template<typename>
+
113 struct basic_runtime_view;
+
114 
+
154 template<typename Entity, typename Allocator>
+
155 struct basic_runtime_view<basic_sparse_set<Entity, Allocator>> {
+
157  using entity_type = Entity;
+
159  using size_type = std::size_t;
+
161  using base_type = basic_sparse_set<Entity, Allocator>;
+
163  using iterator = internal::runtime_view_iterator<base_type>;
+
164 
+
166  basic_runtime_view() ENTT_NOEXCEPT
+
167  : pools{},
+
168  filter{} {}
+
169 
+
175  basic_runtime_view &iterate(const base_type &base) {
+
176  if(pools.empty() || !(base.size() < pools[0u]->size())) {
+
177  pools.push_back(&base);
+
178  } else {
+
179  pools.push_back(std::exchange(pools[0u], &base));
+
180  }
+
181 
+
182  return *this;
+
183  }
+
184 
+
190  basic_runtime_view &exclude(const base_type &base) {
+
191  filter.push_back(&base);
+
192  return *this;
193  }
194 
-
206  [[nodiscard]] iterator end() const {
-
207  return valid() ? iterator{pools, filter, pools[0]->end()} : iterator{};
-
208  }
-
209 
-
215  [[nodiscard]] bool contains(const entity_type entt) const {
-
216  return valid() && std::all_of(pools.cbegin(), pools.cend(), [entt](const auto *curr) { return curr->contains(entt); })
-
217  && std::none_of(filter.cbegin(), filter.cend(), [entt](const auto *curr) { return curr && curr->contains(entt); });
-
218  }
-
219 
-
235  template<typename Func>
-
236  void each(Func func) const {
-
237  for(const auto entity: *this) {
-
238  func(entity);
-
239  }
-
240  }
-
241 
-
242 private:
-
243  std::vector<const basic_common_type *> pools;
-
244  std::vector<const basic_common_type *> filter;
-
245 };
-
246 
-
247 } // namespace entt
-
248 
-
249 #endif
-
entt::basic_runtime_view
Runtime view.
Definition: runtime_view.hpp:137
-
entt::basic_runtime_view::iterator
internal::runtime_view_iterator< basic_common_type > iterator
Bidirectional iterator type.
Definition: runtime_view.hpp:150
-
entt::basic_runtime_view::basic_runtime_view
basic_runtime_view()
Default constructor to use to create empty, invalid views.
Definition: runtime_view.hpp:153
-
entt::basic_runtime_view::basic_runtime_view
basic_runtime_view(std::vector< const basic_common_type * > cpools, std::vector< const basic_common_type * > epools)
Constructs a runtime view from a set of storage classes.
Definition: runtime_view.hpp:162
-
entt::basic_runtime_view::end
iterator end() const
Returns an iterator that is past the last entity that has the given components.
Definition: runtime_view.hpp:206
-
entt::basic_runtime_view::each
void each(Func func) const
Iterates entities and applies the given function object to them.
Definition: runtime_view.hpp:236
-
entt::basic_runtime_view::entity_type
Entity entity_type
Underlying entity identifier.
Definition: runtime_view.hpp:146
-
entt::basic_runtime_view::begin
iterator begin() const
Returns an iterator to the first entity that has the given components.
Definition: runtime_view.hpp:191
-
entt::basic_runtime_view::size_type
std::size_t size_type
Unsigned integer type.
Definition: runtime_view.hpp:148
-
entt::basic_runtime_view::contains
bool contains(const entity_type entt) const
Checks if a view contains an entity.
Definition: runtime_view.hpp:215
-
entt::basic_runtime_view::size_hint
size_type size_hint() const
Estimates the number of entities iterated by the view.
Definition: runtime_view.hpp:177
+
199  [[nodiscard]] size_type size_hint() const {
+
200  return pools.empty() ? size_type{} : pools.front()->size();
+
201  }
+
202 
+
213  [[nodiscard]] iterator begin() const {
+
214  return pools.empty() ? iterator{} : iterator{pools, filter, pools[0]->begin()};
+
215  }
+
216 
+
228  [[nodiscard]] iterator end() const {
+
229  return pools.empty() ? iterator{} : iterator{pools, filter, pools[0]->end()};
+
230  }
+
231 
+
237  [[nodiscard]] bool contains(const entity_type entt) const {
+
238  return !pools.empty()
+
239  && std::all_of(pools.cbegin(), pools.cend(), [entt](const auto *curr) { return curr->contains(entt); })
+
240  && std::none_of(filter.cbegin(), filter.cend(), [entt](const auto *curr) { return curr && curr->contains(entt); });
+
241  }
+
242 
+
258  template<typename Func>
+
259  void each(Func func) const {
+
260  for(const auto entity: *this) {
+
261  func(entity);
+
262  }
+
263  }
+
264 
+
265 private:
+
266  std::vector<const base_type *> pools;
+
267  std::vector<const base_type *> filter;
+
268 };
+
269 
+
270 } // namespace entt
+
271 
+
272 #endif
entt::basic_sparse_set
Basic sparse set implementation.
Definition: sparse_set.hpp:174
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:217
+
entt::basic_sparse_set::size
size_type size() const
Returns the number of elements in a sparse set.
Definition: sparse_set.hpp:465
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
entt::entity
entity
Default entity identifier.
Definition: fwd.hpp:47
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
+
entt::tombstone
constexpr tombstone_t tombstone
Compile-time constant for tombstone entities.
Definition: entity.hpp:335
+
entt::deletion_policy::in_place
@ in_place
In-place deletion policy.
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::contains
bool contains(const entity_type entt) const
Checks if a view contains an entity.
Definition: runtime_view.hpp:237
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::begin
iterator begin() const
Returns an iterator to the first entity that has the given components.
Definition: runtime_view.hpp:213
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::size_type
std::size_t size_type
Unsigned integer type.
Definition: runtime_view.hpp:159
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::basic_runtime_view
basic_runtime_view()
Default constructor to use to create empty, invalid views.
Definition: runtime_view.hpp:166
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::size_hint
size_type size_hint() const
Estimates the number of entities iterated by the view.
Definition: runtime_view.hpp:199
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::each
void each(Func func) const
Iterates entities and applies the given function object to them.
Definition: runtime_view.hpp:259
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::end
iterator end() const
Returns an iterator that is past the last entity that has the given components.
Definition: runtime_view.hpp:228
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::entity_type
Entity entity_type
Underlying entity identifier.
Definition: runtime_view.hpp:157
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::exclude
basic_runtime_view & exclude(const base_type &base)
Adds an opaque storage object as a filter of a runtime view.
Definition: runtime_view.hpp:190
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::iterate
basic_runtime_view & iterate(const base_type &base)
Appends an opaque storage object to a runtime view.
Definition: runtime_view.hpp:175
+
entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::iterator
internal::runtime_view_iterator< base_type > iterator
Bidirectional iterator type.
Definition: runtime_view.hpp:163
+
entt::basic_runtime_view
Runtime view implementation.
Definition: fwd.hpp:23
diff --git a/scheduler_8hpp_source.html b/scheduler_8hpp_source.html index 58e59c158..e828e359d 100644 --- a/scheduler_8hpp_source.html +++ b/scheduler_8hpp_source.html @@ -22,7 +22,7 @@
@@ -74,168 +74,161 @@ $(function() {
2 #define ENTT_PROCESS_SCHEDULER_HPP
3 
4 #include <algorithm>
-
5 #include <memory>
-
6 #include <type_traits>
-
7 #include <utility>
-
8 #include <vector>
-
9 #include "../config/config.h"
-
10 #include "process.hpp"
-
11 
-
12 namespace entt {
-
13 
-
40 template<typename Delta>
-
41 class scheduler {
-
42  struct process_handler {
-
43  using instance_type = std::unique_ptr<void, void (*)(void *)>;
-
44  using update_fn_type = bool(process_handler &, Delta, void *);
-
45  using abort_fn_type = void(process_handler &, bool);
-
46  using next_type = std::unique_ptr<process_handler>;
-
47 
-
48  instance_type instance;
-
49  update_fn_type *update;
-
50  abort_fn_type *abort;
-
51  next_type next;
-
52  };
-
53 
-
54  struct continuation {
-
55  continuation(process_handler *ref)
-
56  : handler{ref} {}
-
57 
-
58  template<typename Proc, typename... Args>
-
59  continuation then(Args &&...args) {
-
60  static_assert(std::is_base_of_v<process<Proc, Delta>, Proc>, "Invalid process type");
-
61  auto proc = typename process_handler::instance_type{new Proc{std::forward<Args>(args)...}, &scheduler::deleter<Proc>};
-
62  handler->next.reset(new process_handler{std::move(proc), &scheduler::update<Proc>, &scheduler::abort<Proc>, nullptr});
-
63  handler = handler->next.get();
-
64  return *this;
-
65  }
-
66 
-
67  template<typename Func>
-
68  continuation then(Func &&func) {
-
69  return then<process_adaptor<std::decay_t<Func>, Delta>>(std::forward<Func>(func));
-
70  }
-
71 
-
72  private:
-
73  process_handler *handler;
-
74  };
-
75 
-
76  template<typename Proc>
-
77  [[nodiscard]] static bool update(process_handler &handler, const Delta delta, void *data) {
-
78  auto *process = static_cast<Proc *>(handler.instance.get());
-
79  process->tick(delta, data);
-
80 
-
81  if(process->rejected()) {
-
82  return true;
-
83  } else if(process->finished()) {
-
84  if(handler.next) {
-
85  handler = std::move(*handler.next);
-
86  // forces the process to exit the uninitialized state
-
87  return handler.update(handler, {}, nullptr);
-
88  }
-
89 
-
90  return true;
-
91  }
-
92 
-
93  return false;
-
94  }
-
95 
-
96  template<typename Proc>
-
97  static void abort(process_handler &handler, const bool immediately) {
-
98  static_cast<Proc *>(handler.instance.get())->abort(immediately);
-
99  }
-
100 
-
101  template<typename Proc>
-
102  static void deleter(void *proc) {
-
103  delete static_cast<Proc *>(proc);
-
104  }
-
105 
-
106 public:
-
108  using size_type = std::size_t;
-
109 
-
111  scheduler() = default;
-
112 
-
114  scheduler(scheduler &&) = default;
-
115 
-
117  scheduler &operator=(scheduler &&) = default;
-
118 
-
123  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
-
124  return handlers.size();
-
125  }
-
126 
-
131  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
-
132  return handlers.empty();
-
133  }
-
134 
-
141  void clear() {
-
142  handlers.clear();
-
143  }
-
144 
-
170  template<typename Proc, typename... Args>
-
171  auto attach(Args &&...args) {
-
172  static_assert(std::is_base_of_v<process<Proc, Delta>, Proc>, "Invalid process type");
-
173  auto proc = typename process_handler::instance_type{new Proc{std::forward<Args>(args)...}, &scheduler::deleter<Proc>};
-
174  process_handler handler{std::move(proc), &scheduler::update<Proc>, &scheduler::abort<Proc>, nullptr};
-
175  // forces the process to exit the uninitialized state
-
176  handler.update(handler, {}, nullptr);
-
177  return continuation{&handlers.emplace_back(std::move(handler))};
-
178  }
-
179 
-
231  template<typename Func>
-
232  auto attach(Func &&func) {
-
233  using Proc = process_adaptor<std::decay_t<Func>, Delta>;
-
234  return attach<Proc>(std::forward<Func>(func));
-
235  }
-
236 
-
248  void update(const Delta delta, void *data = nullptr) {
-
249  auto sz = handlers.size();
-
250 
-
251  for(auto pos = handlers.size(); pos; --pos) {
-
252  auto &handler = handlers[pos - 1];
-
253 
-
254  if(const auto dead = handler.update(handler, delta, data); dead) {
-
255  std::swap(handler, handlers[--sz]);
+
5 #include <iterator>
+
6 #include <memory>
+
7 #include <type_traits>
+
8 #include <utility>
+
9 #include <vector>
+
10 #include "../config/config.h"
+
11 #include "process.hpp"
+
12 
+
13 namespace entt {
+
14 
+
41 template<typename Delta>
+
42 class scheduler {
+
43  struct process_handler {
+
44  using instance_type = std::unique_ptr<void, void (*)(void *)>;
+
45  using update_fn_type = bool(scheduler &, std::size_t, Delta, void *);
+
46  using abort_fn_type = void(scheduler &, std::size_t, bool);
+
47  using next_type = std::unique_ptr<process_handler>;
+
48 
+
49  instance_type instance;
+
50  update_fn_type *update;
+
51  abort_fn_type *abort;
+
52  next_type next;
+
53  };
+
54 
+
55  struct continuation {
+
56  continuation(process_handler *ref) ENTT_NOEXCEPT
+
57  : handler{ref} {}
+
58 
+
59  template<typename Proc, typename... Args>
+
60  continuation then(Args &&...args) {
+
61  static_assert(std::is_base_of_v<process<Proc, Delta>, Proc>, "Invalid process type");
+
62  auto proc = typename process_handler::instance_type{new Proc{std::forward<Args>(args)...}, &scheduler::deleter<Proc>};
+
63  handler->next.reset(new process_handler{std::move(proc), &scheduler::update<Proc>, &scheduler::abort<Proc>, nullptr});
+
64  handler = handler->next.get();
+
65  return *this;
+
66  }
+
67 
+
68  template<typename Func>
+
69  continuation then(Func &&func) {
+
70  return then<process_adaptor<std::decay_t<Func>, Delta>>(std::forward<Func>(func));
+
71  }
+
72 
+
73  private:
+
74  process_handler *handler;
+
75  };
+
76 
+
77  template<typename Proc>
+
78  [[nodiscard]] static bool update(scheduler &owner, std::size_t pos, const Delta delta, void *data) {
+
79  auto *process = static_cast<Proc *>(owner.handlers[pos].instance.get());
+
80  process->tick(delta, data);
+
81 
+
82  if(process->rejected()) {
+
83  return true;
+
84  } else if(process->finished()) {
+
85  if(auto &&handler = owner.handlers[pos]; handler.next) {
+
86  handler = std::move(*handler.next);
+
87  // forces the process to exit the uninitialized state
+
88  return handler.update(owner, pos, {}, nullptr);
+
89  }
+
90 
+
91  return true;
+
92  }
+
93 
+
94  return false;
+
95  }
+
96 
+
97  template<typename Proc>
+
98  static void abort(scheduler &owner, std::size_t pos, const bool immediately) {
+
99  static_cast<Proc *>(owner.handlers[pos].instance.get())->abort(immediately);
+
100  }
+
101 
+
102  template<typename Proc>
+
103  static void deleter(void *proc) {
+
104  delete static_cast<Proc *>(proc);
+
105  }
+
106 
+
107 public:
+
109  using size_type = std::size_t;
+
110 
+
112  scheduler() = default;
+
113 
+
115  scheduler(scheduler &&) = default;
+
116 
+
118  scheduler &operator=(scheduler &&) = default;
+
119 
+
124  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
+
125  return handlers.size();
+
126  }
+
127 
+
132  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
+
133  return handlers.empty();
+
134  }
+
135 
+
142  void clear() {
+
143  handlers.clear();
+
144  }
+
145 
+
171  template<typename Proc, typename... Args>
+
172  auto attach(Args &&...args) {
+
173  static_assert(std::is_base_of_v<process<Proc, Delta>, Proc>, "Invalid process type");
+
174  auto proc = typename process_handler::instance_type{new Proc{std::forward<Args>(args)...}, &scheduler::deleter<Proc>};
+
175  auto &&ref = handlers.emplace_back(process_handler{std::move(proc), &scheduler::update<Proc>, &scheduler::abort<Proc>, nullptr});
+
176  // forces the process to exit the uninitialized state
+
177  ref.update(*this, handlers.size() - 1u, {}, nullptr);
+
178  return continuation{&handlers.back()};
+
179  }
+
180 
+
232  template<typename Func>
+
233  auto attach(Func &&func) {
+
234  using Proc = process_adaptor<std::decay_t<Func>, Delta>;
+
235  return attach<Proc>(std::forward<Func>(func));
+
236  }
+
237 
+
249  void update(const Delta delta, void *data = nullptr) {
+
250  for(auto pos = handlers.size(); pos; --pos) {
+
251  const auto curr = pos - 1u;
+
252 
+
253  if(const auto dead = handlers[curr].update(*this, curr, delta, data); dead) {
+
254  std::swap(handlers[curr], handlers.back());
+
255  handlers.pop_back();
256  }
257  }
-
258 
-
259  handlers.erase(handlers.begin() + sz, handlers.end());
-
260  }
-
261 
-
272  void abort(const bool immediately = false) {
-
273  decltype(handlers) exec;
-
274  exec.swap(handlers);
-
275 
-
276  for(auto &&handler: exec) {
-
277  handler.abort(handler, immediately);
-
278  }
-
279 
-
280  std::move(handlers.begin(), handlers.end(), std::back_inserter(exec));
-
281  handlers.swap(exec);
-
282  }
-
283 
-
284 private:
-
285  std::vector<process_handler> handlers{};
-
286 };
-
287 
-
288 } // namespace entt
-
289 
-
290 #endif
+
258  }
+
259 
+
270  void abort(const bool immediately = false) {
+
271  for(auto pos = handlers.size(); pos; --pos) {
+
272  const auto curr = pos - 1u;
+
273  handlers[curr].abort(*this, curr, immediately);
+
274  }
+
275  }
+
276 
+
277 private:
+
278  std::vector<process_handler> handlers{};
+
279 };
+
280 
+
281 } // namespace entt
+
282 
+
283 #endif
entt::process
Base class for processes.
Definition: process.hpp:71
entt::process::finished
bool finished() const
Returns true if a process is already terminated.
Definition: process.hpp:203
entt::process::rejected
bool rejected() const
Returns true if a process terminated with errors.
Definition: process.hpp:219
entt::process::tick
void tick(const Delta delta, void *data=nullptr)
Updates a process and its internal state if required.
Definition: process.hpp:228
-
entt::scheduler
Cooperative scheduler for processes.
Definition: scheduler.hpp:41
-
entt::scheduler::size
size_type size() const
Number of processes currently scheduled.
Definition: scheduler.hpp:123
+
entt::scheduler
Cooperative scheduler for processes.
Definition: scheduler.hpp:42
+
entt::scheduler::size
size_type size() const
Number of processes currently scheduled.
Definition: scheduler.hpp:124
entt::scheduler::scheduler
scheduler()=default
Default constructor.
-
entt::scheduler::clear
void clear()
Discards all scheduled processes.
Definition: scheduler.hpp:141
-
entt::scheduler::update
void update(const Delta delta, void *data=nullptr)
Updates all scheduled processes.
Definition: scheduler.hpp:248
-
entt::scheduler::attach
auto attach(Func &&func)
Schedules a process for the next tick.
Definition: scheduler.hpp:232
-
entt::scheduler::abort
void abort(const bool immediately=false)
Aborts all scheduled processes.
Definition: scheduler.hpp:272
-
entt::scheduler::attach
auto attach(Args &&...args)
Schedules a process for the next tick.
Definition: scheduler.hpp:171
+
entt::scheduler::clear
void clear()
Discards all scheduled processes.
Definition: scheduler.hpp:142
+
entt::scheduler::update
void update(const Delta delta, void *data=nullptr)
Updates all scheduled processes.
Definition: scheduler.hpp:249
+
entt::scheduler::attach
auto attach(Func &&func)
Schedules a process for the next tick.
Definition: scheduler.hpp:233
+
entt::scheduler::abort
void abort(const bool immediately=false)
Aborts all scheduled processes.
Definition: scheduler.hpp:270
+
entt::scheduler::attach
auto attach(Args &&...args)
Schedules a process for the next tick.
Definition: scheduler.hpp:172
entt::scheduler::operator=
scheduler & operator=(scheduler &&)=default
Default move assignment operator.
-
entt::scheduler::empty
bool empty() const
Returns true if at least a process is currently scheduled.
Definition: scheduler.hpp:131
+
entt::scheduler::empty
bool empty() const
Returns true if at least a process is currently scheduled.
Definition: scheduler.hpp:132
entt::scheduler::scheduler
scheduler(scheduler &&)=default
Default move constructor.
-
entt::scheduler::size_type
std::size_t size_type
Unsigned integer type.
Definition: scheduler.hpp:108
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt::scheduler::size_type
std::size_t size_type
Unsigned integer type.
Definition: scheduler.hpp:109
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::process_adaptor
Adaptor for lambdas and functors to turn them into processes.
Definition: process.hpp:306
diff --git a/search/all_0.js b/search/all_0.js index 285a8757c..96832845c 100644 --- a/search/all_0.js +++ b/search/all_0.js @@ -3,26 +3,29 @@ var searchData= ['abort_0',['abort',['../classentt_1_1scheduler.html#aabc25388bff1b3b0770f913f54b915f2',1,'entt::scheduler::abort()'],['../classentt_1_1process.html#af27d28af408f1dfb260b8fe976e66ea3',1,'entt::process::abort()']]], ['adl_5fmeta_5fpointer_5flike_1',['adl_meta_pointer_like',['../structentt_1_1adl__meta__pointer__like.html',1,'entt']]], ['alignment_2',['alignment',['../classentt_1_1basic__any.html#a8248e8443c6208077db312079a05fd96',1,'entt::basic_any']]], - ['alive_3',['alive',['../classentt_1_1basic__registry.html#a7a42cddcb9bd14802bd597e789ff341f',1,'entt::basic_registry::alive()'],['../classentt_1_1process.html#a1a3e1f6d09d8bca974ed383def805f3d',1,'entt::process::alive()']]], + ['alive_3',['alive',['../classentt_1_1process.html#a1a3e1f6d09d8bca974ed383def805f3d',1,'entt::process::alive()'],['../classentt_1_1basic__registry.html#a7a42cddcb9bd14802bd597e789ff341f',1,'entt::basic_registry::alive()']]], ['all_5fof_4',['all_of',['../structentt_1_1basic__handle.html#a29185b95a343d6770517683daebb20c9',1,'entt::basic_handle::all_of()'],['../classentt_1_1basic__registry.html#a40072eca607846f43f47d0e3f11dd196',1,'entt::basic_registry::all_of()']]], - ['allocator_5ftype_5',['allocator_type',['../classentt_1_1dense__hash__map.html#acab6c328584c0cb66e895b6220e022f9',1,'entt::dense_hash_map::allocator_type()'],['../classentt_1_1dense__hash__set.html#ae1eff330a53ec4691ff2bc0f0e6e2ae1',1,'entt::dense_hash_set::allocator_type()'],['../classentt_1_1basic__sparse__set.html#af6faaccfb0c465afb6173b0fb8a37069',1,'entt::basic_sparse_set::allocator_type()'],['../classentt_1_1basic__storage.html#a2daf8e64dd510609d8063fe7f3c011f3',1,'entt::basic_storage::allocator_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ad8f51651fb3f99ee794787e29dbaf870',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::allocator_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a21c7a7c56b0975495827e8b4c16103ba',1,'entt::sigh< Ret(Args...), Allocator >::allocator_type()']]], - ['allow_5fcast_6',['allow_cast',['../classentt_1_1meta__any.html#a522ea5757c3eb8bd33ad3e1816141b5d',1,'entt::meta_any::allow_cast(const meta_type &type) const'],['../classentt_1_1meta__any.html#af80f94605c72c5c2ff30fd857b73010f',1,'entt::meta_any::allow_cast(const meta_type &type)'],['../classentt_1_1meta__any.html#a66606e3abbe512e064a0e1440a069594',1,'entt::meta_any::allow_cast() const'],['../classentt_1_1meta__any.html#af3bf7b2771fc6a67c2a26b19d364e85a',1,'entt::meta_any::allow_cast()']]], - ['any_7',['any',['../namespaceentt.html#a4846741b8f485584c196304f588b94ad',1,'entt']]], - ['any_5fcast_8',['any_cast',['../namespaceentt.html#ac53c0786eb32685bbbfc6a2b9806338b',1,'entt::any_cast(basic_any< Len, Align > *data)'],['../namespaceentt.html#aeaf3e0080cf2091703718dcbe558171b',1,'entt::any_cast(const basic_any< Len, Align > *data)'],['../namespaceentt.html#a1ade9ac7c0844a7c154287ca96ceba08',1,'entt::any_cast(basic_any< Len, Align > &&data)'],['../namespaceentt.html#a7c210bb2e08d184415f5c5680d87d74e',1,'entt::any_cast(basic_any< Len, Align > &data)'],['../namespaceentt.html#a2364ab41cab0fccd92cdaaf8779581cb',1,'entt::any_cast(const basic_any< Len, Align > &data)']]], - ['any_5fof_9',['any_of',['../structentt_1_1basic__handle.html#a01a92bc7ed67cc044bb245308de39443',1,'entt::basic_handle::any_of()'],['../classentt_1_1basic__registry.html#a08f819276fd2d8b2b2b6d01357f61a42',1,'entt::basic_registry::any_of()']]], - ['arg_10',['arg',['../structentt_1_1meta__data.html#a754ff9b953cd8f9195776e6d6202ce84',1,'entt::meta_data::arg()'],['../structentt_1_1meta__func.html#a190fd50a4862fd44216716a0a0dd0e66',1,'entt::meta_func::arg()']]], - ['args_5ftype_11',['args_type',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a9d0bdf951c08413401de8a4cb8f00541',1,'entt::meta_template_traits< Clazz< Args... > >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a883bd3dcad5433ed005974b56e08a476',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a9ef80c632428bbd3d479149ba6687691',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a8cc7260ed6098c519937116d1a276acb',1,'entt::meta_function_descriptor< Type, Ret Class::* >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a13814c123d03280c86bd85c5eeee25ab',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a4c949efd3cbd6865f33054d0713f4f53',1,'entt::meta_function_descriptor< Type, Ret(*)()>::args_type()']]], - ['arity_12',['arity',['../structentt_1_1meta__data.html#ae49c225400fa1938e53a5f65f6f36152',1,'entt::meta_data::arity()'],['../structentt_1_1meta__func.html#adabf1d427890eacd3a31c7f748f0441a',1,'entt::meta_func::arity()']]], - ['as_5fassociative_5fcontainer_13',['as_associative_container',['../classentt_1_1meta__any.html#afceb9729365e24ed957710c676e8d16c',1,'entt::meta_any::as_associative_container()'],['../classentt_1_1meta__any.html#ad413e2504354b7c130b487f5348b0f87',1,'entt::meta_any::as_associative_container() const']]], - ['as_5fcref_5ft_14',['as_cref_t',['../structentt_1_1as__cref__t.html',1,'entt']]], - ['as_5fgroup_15',['as_group',['../structentt_1_1as__group.html#a1e820abe8d20a6a64487b31bc5a2f879',1,'entt::as_group::as_group()'],['../namespaceentt.html#a4dcc1231f76478c7aa6f6ec9516cf045',1,'entt::as_group(basic_registry< Entity > &) -> as_group< Entity >'],['../namespaceentt.html#ad6e62063b33b410e0a4bf1acc5b59596',1,'entt::as_group(const basic_registry< Entity > &) -> as_group< const Entity >'],['../structentt_1_1as__group.html',1,'entt::as_group< Entity >']]], - ['as_5fis_5ft_16',['as_is_t',['../structentt_1_1as__is__t.html',1,'entt']]], - ['as_5fref_17',['as_ref',['../classentt_1_1basic__any.html#a7489b6cb743e74b8afcee0f66799b535',1,'entt::basic_any::as_ref()'],['../classentt_1_1basic__any.html#a50d19ca1f8421f57ba9765312935ee92',1,'entt::basic_any::as_ref() const'],['../classentt_1_1meta__any.html#ae5c5038d531db5739fdbe768be5909eb',1,'entt::meta_any::as_ref()'],['../classentt_1_1meta__any.html#ab07de5b666f0f198691eb8e92f70f4a1',1,'entt::meta_any::as_ref() const'],['../classentt_1_1basic__poly.html#a7ce289eca7eeaa98e53c09f421b89394',1,'entt::basic_poly::as_ref()'],['../classentt_1_1basic__poly.html#aa87cad0ad5c7db180dfeebf0dea8b90d',1,'entt::basic_poly::as_ref() const']]], - ['as_5fref_5ft_18',['as_ref_t',['../structentt_1_1as__ref__t.html',1,'entt']]], - ['as_5fsequence_5fcontainer_19',['as_sequence_container',['../classentt_1_1meta__any.html#a69ce5b726f86d8a5dc0a5a7ddf2f7c0e',1,'entt::meta_any::as_sequence_container()'],['../classentt_1_1meta__any.html#a8b9a3cebd9cf4e0c6c4f28b7bacdf4fc',1,'entt::meta_any::as_sequence_container() const']]], - ['as_5fview_20',['as_view',['../structentt_1_1as__view.html#a4298bb90698199b99820bce07d866ac7',1,'entt::as_view::as_view()'],['../namespaceentt.html#a4821869aa545da11205c90388fa2d08e',1,'entt::as_view(const basic_registry< Entity > &) -> as_view< const Entity >'],['../namespaceentt.html#af0922fd2ea330d84a2e1b6f19e877aed',1,'entt::as_view(basic_registry< Entity > &) -> as_view< Entity >'],['../structentt_1_1as__view.html',1,'entt::as_view< Entity >']]], - ['as_5fvoid_5ft_21',['as_void_t',['../structentt_1_1as__void__t.html',1,'entt']]], - ['assign_22',['assign',['../classentt_1_1basic__any.html#a641412fc4569ea9b2ec10d35a03835b3',1,'entt::basic_any::assign(const any &other)'],['../classentt_1_1basic__any.html#a5a6069fbe1c45bd6a8b10fbe872d3bc4',1,'entt::basic_any::assign(any &&other)'],['../classentt_1_1basic__registry.html#a35d217b9bc09235d55388941de380f72',1,'entt::basic_registry::assign()'],['../classentt_1_1meta__any.html#a77e67e73023b213a5fe46f88820f571f',1,'entt::meta_any::assign(meta_any &&other)'],['../classentt_1_1meta__any.html#a022362d5bb8ee42e3637e3d64a22027a',1,'entt::meta_any::assign(const meta_any &other)']]], - ['at_23',['at',['../classentt_1_1dense__hash__map.html#a1e168af85bd77d9bb6c1981c36c2592b',1,'entt::dense_hash_map::at(const key_type &key)'],['../classentt_1_1dense__hash__map.html#af191ee281e1c7f191536581d4fa641ec',1,'entt::dense_hash_map::at(const key_type &key) const'],['../classentt_1_1basic__sparse__set.html#aa0d4efaf22f43c1a8573e50c7460299a',1,'entt::basic_sparse_set::at()']]], - ['attach_24',['attach',['../classentt_1_1scheduler.html#aced8ede0331494ea80e2b19ac203cccc',1,'entt::scheduler::attach(Args &&...args)'],['../classentt_1_1scheduler.html#a871812d08af8483316d1ce5d1e9d686f',1,'entt::scheduler::attach(Func &&func)']]] + ['allocate_5femplace_5',['allocate_emplace',['../structentt_1_1locator.html#a9670f20018968edcf7677aa44ae036bf',1,'entt::locator']]], + ['allocate_5funique_6',['allocate_unique',['../namespaceentt.html#a34acc7c30062bc75491ea6f8c6ad5078',1,'entt']]], + ['allocation_5fdeleter_7',['allocation_deleter',['../structentt_1_1allocation__deleter.html#a1e40e8f850d327ed13dbb3eab6886b7d',1,'entt::allocation_deleter::allocation_deleter()'],['../structentt_1_1allocation__deleter.html',1,'entt::allocation_deleter< Allocator >']]], + ['allocator_5ftype_8',['allocator_type',['../classentt_1_1basic__storage.html#a2daf8e64dd510609d8063fe7f3c011f3',1,'entt::basic_storage::allocator_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ad8f51651fb3f99ee794787e29dbaf870',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::allocator_type()'],['../classentt_1_1resource__cache.html#ab1e2dc3aeffbbbce6d48e0c46d908cfd',1,'entt::resource_cache::allocator_type()'],['../classentt_1_1basic__dispatcher.html#a25129aec45c14bb934e9e9db3ed28015',1,'entt::basic_dispatcher::allocator_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a21c7a7c56b0975495827e8b4c16103ba',1,'entt::sigh< Ret(Args...), Allocator >::allocator_type()'],['../classentt_1_1dense__map.html#adc7feba2153b3764cc7789f31b926d78',1,'entt::dense_map::allocator_type()'],['../classentt_1_1dense__set.html#a8c83fbdb7d106f60f98d3ae3f395abc2',1,'entt::dense_set::allocator_type()'],['../structentt_1_1allocation__deleter.html#abce9d9de78a31b79e98745f4e029c863',1,'entt::allocation_deleter::allocator_type()'],['../classentt_1_1basic__sparse__set.html#af6faaccfb0c465afb6173b0fb8a37069',1,'entt::basic_sparse_set::allocator_type()']]], + ['allow_5fcast_9',['allow_cast',['../classentt_1_1meta__any.html#a522ea5757c3eb8bd33ad3e1816141b5d',1,'entt::meta_any::allow_cast(const meta_type &type) const'],['../classentt_1_1meta__any.html#af80f94605c72c5c2ff30fd857b73010f',1,'entt::meta_any::allow_cast(const meta_type &type)'],['../classentt_1_1meta__any.html#a66606e3abbe512e064a0e1440a069594',1,'entt::meta_any::allow_cast() const'],['../classentt_1_1meta__any.html#af3bf7b2771fc6a67c2a26b19d364e85a',1,'entt::meta_any::allow_cast()']]], + ['any_10',['any',['../namespaceentt.html#a4846741b8f485584c196304f588b94ad',1,'entt']]], + ['any_5fcast_11',['any_cast',['../namespaceentt.html#aeaf3e0080cf2091703718dcbe558171b',1,'entt::any_cast(const basic_any< Len, Align > *data)'],['../namespaceentt.html#a1ade9ac7c0844a7c154287ca96ceba08',1,'entt::any_cast(basic_any< Len, Align > &&data)'],['../namespaceentt.html#a7c210bb2e08d184415f5c5680d87d74e',1,'entt::any_cast(basic_any< Len, Align > &data)'],['../namespaceentt.html#a2364ab41cab0fccd92cdaaf8779581cb',1,'entt::any_cast(const basic_any< Len, Align > &data)'],['../namespaceentt.html#ac53c0786eb32685bbbfc6a2b9806338b',1,'entt::any_cast(basic_any< Len, Align > *data)']]], + ['any_5fof_12',['any_of',['../structentt_1_1basic__handle.html#a01a92bc7ed67cc044bb245308de39443',1,'entt::basic_handle::any_of()'],['../classentt_1_1basic__registry.html#a08f819276fd2d8b2b2b6d01357f61a42',1,'entt::basic_registry::any_of()']]], + ['arg_13',['arg',['../structentt_1_1meta__data.html#a754ff9b953cd8f9195776e6d6202ce84',1,'entt::meta_data::arg()'],['../structentt_1_1meta__func.html#a190fd50a4862fd44216716a0a0dd0e66',1,'entt::meta_func::arg()']]], + ['args_5ftype_14',['args_type',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a883bd3dcad5433ed005974b56e08a476',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a9ef80c632428bbd3d479149ba6687691',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a8cc7260ed6098c519937116d1a276acb',1,'entt::meta_function_descriptor< Type, Ret Class::* >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a1f9aff3c69a1576c2230a0511e94dd56',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a4c949efd3cbd6865f33054d0713f4f53',1,'entt::meta_function_descriptor< Type, Ret(*)()>::args_type()'],['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a9d0bdf951c08413401de8a4cb8f00541',1,'entt::meta_template_traits< Clazz< Args... > >::args_type()']]], + ['arity_15',['arity',['../structentt_1_1meta__func.html#adabf1d427890eacd3a31c7f748f0441a',1,'entt::meta_func::arity()'],['../structentt_1_1meta__data.html#ae49c225400fa1938e53a5f65f6f36152',1,'entt::meta_data::arity()']]], + ['as_5fassociative_5fcontainer_16',['as_associative_container',['../classentt_1_1meta__any.html#afceb9729365e24ed957710c676e8d16c',1,'entt::meta_any::as_associative_container()'],['../classentt_1_1meta__any.html#ad413e2504354b7c130b487f5348b0f87',1,'entt::meta_any::as_associative_container() const']]], + ['as_5fcref_5ft_17',['as_cref_t',['../structentt_1_1as__cref__t.html',1,'entt']]], + ['as_5fgroup_18',['as_group',['../structentt_1_1as__group.html#a1e820abe8d20a6a64487b31bc5a2f879',1,'entt::as_group::as_group()'],['../namespaceentt.html#a4dcc1231f76478c7aa6f6ec9516cf045',1,'entt::as_group(basic_registry< Entity > &) -> as_group< Entity >'],['../namespaceentt.html#ad6e62063b33b410e0a4bf1acc5b59596',1,'entt::as_group(const basic_registry< Entity > &) -> as_group< const Entity >'],['../structentt_1_1as__group.html',1,'entt::as_group< Entity >']]], + ['as_5fis_5ft_19',['as_is_t',['../structentt_1_1as__is__t.html',1,'entt']]], + ['as_5fref_20',['as_ref',['../classentt_1_1basic__any.html#a7489b6cb743e74b8afcee0f66799b535',1,'entt::basic_any::as_ref()'],['../classentt_1_1basic__any.html#a50d19ca1f8421f57ba9765312935ee92',1,'entt::basic_any::as_ref() const'],['../classentt_1_1meta__any.html#ae5c5038d531db5739fdbe768be5909eb',1,'entt::meta_any::as_ref()'],['../classentt_1_1meta__any.html#ab07de5b666f0f198691eb8e92f70f4a1',1,'entt::meta_any::as_ref() const'],['../classentt_1_1basic__poly.html#a7ce289eca7eeaa98e53c09f421b89394',1,'entt::basic_poly::as_ref()'],['../classentt_1_1basic__poly.html#aa87cad0ad5c7db180dfeebf0dea8b90d',1,'entt::basic_poly::as_ref() const']]], + ['as_5fref_5ft_21',['as_ref_t',['../structentt_1_1as__ref__t.html',1,'entt']]], + ['as_5fsequence_5fcontainer_22',['as_sequence_container',['../classentt_1_1meta__any.html#a69ce5b726f86d8a5dc0a5a7ddf2f7c0e',1,'entt::meta_any::as_sequence_container()'],['../classentt_1_1meta__any.html#a8b9a3cebd9cf4e0c6c4f28b7bacdf4fc',1,'entt::meta_any::as_sequence_container() const']]], + ['as_5fview_23',['as_view',['../structentt_1_1as__view.html#a4298bb90698199b99820bce07d866ac7',1,'entt::as_view::as_view()'],['../namespaceentt.html#a4821869aa545da11205c90388fa2d08e',1,'entt::as_view(const basic_registry< Entity > &) -> as_view< const Entity >'],['../namespaceentt.html#af0922fd2ea330d84a2e1b6f19e877aed',1,'entt::as_view(basic_registry< Entity > &) -> as_view< Entity >'],['../structentt_1_1as__view.html',1,'entt::as_view< Entity >']]], + ['as_5fvoid_5ft_24',['as_void_t',['../structentt_1_1as__void__t.html',1,'entt']]], + ['assign_25',['assign',['../classentt_1_1meta__any.html#a022362d5bb8ee42e3637e3d64a22027a',1,'entt::meta_any::assign(const meta_any &other)'],['../classentt_1_1meta__any.html#a77e67e73023b213a5fe46f88820f571f',1,'entt::meta_any::assign(meta_any &&other)'],['../classentt_1_1basic__any.html#a641412fc4569ea9b2ec10d35a03835b3',1,'entt::basic_any::assign(const any &other)'],['../classentt_1_1basic__any.html#a5a6069fbe1c45bd6a8b10fbe872d3bc4',1,'entt::basic_any::assign(any &&other)'],['../classentt_1_1basic__registry.html#a35d217b9bc09235d55388941de380f72',1,'entt::basic_registry::assign()']]], + ['at_26',['at',['../classentt_1_1dense__map.html#a929310e2edc90ec0b810eea982a2dd2a',1,'entt::dense_map::at()'],['../classentt_1_1basic__sparse__set.html#aa0d4efaf22f43c1a8573e50c7460299a',1,'entt::basic_sparse_set::at()'],['../classentt_1_1dense__map.html#a04ee0f865ad16834e845b786ac6d4aa6',1,'entt::dense_map::at()']]], + ['attach_27',['attach',['../classentt_1_1scheduler.html#aced8ede0331494ea80e2b19ac203cccc',1,'entt::scheduler::attach(Args &&...args)'],['../classentt_1_1scheduler.html#a871812d08af8483316d1ce5d1e9d686f',1,'entt::scheduler::attach(Func &&func)']]] ]; diff --git a/search/all_1.js b/search/all_1.js index e4d6f1e9f..52e7323c8 100644 --- a/search/all_1.js +++ b/search/all_1.js @@ -1,42 +1,45 @@ var searchData= [ - ['back_25',['back',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a308a495cd95cb8859ca80bcbd752417d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::back()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3a9f8b8e1603a0f7eed43fb2428e142d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a81c47aabb35b492703266db777de352f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a078e09804683968e5829c09782bf6e8a',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::back()']]], - ['base_26',['base',['../classentt_1_1meta__factory_3_01Type_01_4.html#a825c9621f778b0a1c8fffb16f4f1f1c7',1,'entt::meta_factory< Type >::base()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a1b25b042d4902929b3fb9be9c877749a',1,'entt::meta_sequence_container::meta_iterator::base()'],['../classentt_1_1meta__type.html#a2fc2ba44275f28e28536867ac6c20e79',1,'entt::meta_type::base() const'],['../classentt_1_1meta__type.html#a3c85444a003cbd6ae1063563f4694af5',1,'entt::meta_type::base(const id_type id) const']]], - ['base_5fnode_5ftype_27',['base_node_type',['../classentt_1_1meta__type.html#af5c8ce79f2b30967048acc2f4c890ff4',1,'entt::meta_type']]], - ['base_5ftype_28',['base_type',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#afa44a297867b649fc67f17b0431d7ee9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::base_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa84cd200af2da7539b2327f63b68250f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#adc648d57a591eff7041e3891711ee1e3',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::base_type()'],['../classentt_1_1basic__storage.html#abdba347d3fa01f615d4fa28b22257f82',1,'entt::basic_storage::base_type()'],['../classentt_1_1basic__registry.html#a70ffa0486e23004540f1655bdf46cef6',1,'entt::basic_registry::base_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2a750ebb99edab170da7f02378c44ea7',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a2344447157c3a7d1c82e5ac18db253a1',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::base_type()']]], - ['basic_5fany_29',['basic_any',['../classentt_1_1basic__any.html#abf56dc5f3a8324c15b40bf6c2a800702',1,'entt::basic_any::basic_any(basic_any &&other)'],['../classentt_1_1basic__any.html#a3196700b32252e5b59a79994b907afda',1,'entt::basic_any::basic_any(const basic_any &other)'],['../classentt_1_1basic__any.html#afb1d00c509ae9127faa1cc2a5887bdab',1,'entt::basic_any::basic_any(Type &&value)'],['../classentt_1_1basic__any.html#a3a84c837c69ab23b08a535ab79f7eefa',1,'entt::basic_any::basic_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__any.html#aab031eb7bfb02eb4e6ca6b170e3a2335',1,'entt::basic_any::basic_any()'],['../classentt_1_1basic__any.html',1,'entt::basic_any< Len, Align >']]], - ['basic_5fany_3c_3e_30',['basic_any<>',['../classentt_1_1basic__any.html',1,'entt']]], - ['basic_5fcollector_31',['basic_collector',['../structentt_1_1basic__collector.html',1,'entt']]], - ['basic_5fcollector_3c_20matcher_3c_20type_5flist_3c_20reject_2e_2e_2e_20_3e_2c_20type_5flist_3c_20require_2e_2e_2e_20_3e_2c_20rule_2e_2e_2e_20_3e_2c_20other_2e_2e_2e_20_3e_32',['basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html',1,'entt']]], - ['basic_5fcollector_3c_3e_33',['basic_collector<>',['../structentt_1_1basic__collector_3_4.html',1,'entt']]], - ['basic_5fcomponent_5ftraits_34',['basic_component_traits',['../structentt_1_1basic__component__traits.html',1,'entt']]], - ['basic_5fcontinuous_5floader_35',['basic_continuous_loader',['../classentt_1_1basic__continuous__loader.html#aeb36501b43761b28eb7de311dbd080d8',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_registry< entity_type > &source)'],['../classentt_1_1basic__continuous__loader.html#a619f3aa278b405481fd1e26c46a96a5c',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_continuous_loader &&)=default'],['../classentt_1_1basic__continuous__loader.html',1,'entt::basic_continuous_loader< Entity >']]], - ['basic_5fgroup_36',['basic_group',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a392e8d6bd37c21a5056c8935d273b261',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_group()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ae6509fc61bfb25482f93caa4336a1f3c',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_group()'],['../classentt_1_1basic__group.html',1,'entt::basic_group< typename, typename, typename, typename >']]], - ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_37',['basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html',1,'entt']]], - ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_38',['basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html',1,'entt']]], - ['basic_5fhandle_39',['basic_handle',['../namespaceentt.html#a288ec07d4e87a28179d43b367ff11eab',1,'entt::basic_handle(basic_registry< Entity > &, Entity) -> basic_handle< Entity >'],['../namespaceentt.html#a6de052205bafd99d67afde880b67a4e8',1,'entt::basic_handle(const basic_registry< Entity > &, Entity) -> basic_handle< const Entity >'],['../structentt_1_1basic__handle.html#ada86cadf8f425426e25e2a8712876137',1,'entt::basic_handle::basic_handle()'],['../structentt_1_1basic__handle.html#a9f88bf2f8fcb94b5ffe0f1290500004a',1,'entt::basic_handle::basic_handle(registry_type &ref, entity_type value)'],['../structentt_1_1basic__handle.html',1,'entt::basic_handle< Entity, Type >']]], - ['basic_5fhashed_5fstring_40',['basic_hashed_string',['../classentt_1_1basic__hashed__string.html#a564f57a39d02f5b94fa76a5ecf143299',1,'entt::basic_hashed_string::basic_hashed_string(const_wrapper wrapper)'],['../classentt_1_1basic__hashed__string.html#a0b0454a742c7556c805e79fc19b556dd',1,'entt::basic_hashed_string::basic_hashed_string(const value_type(&curr)[N])'],['../classentt_1_1basic__hashed__string.html#aa8b2ea90ba4d1bbb98d485f6a93e574e',1,'entt::basic_hashed_string::basic_hashed_string()'],['../namespaceentt.html#aaa97361ef962166a4fc51a582d7c6392',1,'entt::basic_hashed_string(const Char(&str)[N]) -> basic_hashed_string< Char >'],['../classentt_1_1basic__hashed__string.html',1,'entt::basic_hashed_string< Char >']]], - ['basic_5fobserver_41',['basic_observer',['../classentt_1_1basic__observer.html#accbe2546b1b74de1a59e673cb6250413',1,'entt::basic_observer::basic_observer(basic_observer &&)=delete'],['../classentt_1_1basic__observer.html#abef3c847acf610f1a6f856b05f0f0721',1,'entt::basic_observer::basic_observer(basic_registry< entity_type > &reg, basic_collector< Matcher... >)'],['../classentt_1_1basic__observer.html#aa685204c94266b5631c13540012e73c2',1,'entt::basic_observer::basic_observer(const basic_observer &)=delete'],['../classentt_1_1basic__observer.html#adfb08de0ef1c0f57fadc6f6d171b931a',1,'entt::basic_observer::basic_observer()'],['../classentt_1_1basic__observer.html',1,'entt::basic_observer< Entity >']]], - ['basic_5forganizer_42',['basic_organizer',['../classentt_1_1basic__organizer.html',1,'entt']]], - ['basic_5fpoly_43',['basic_poly',['../classentt_1_1basic__poly.html#aed074839fc14e757f761d89606895062',1,'entt::basic_poly::basic_poly(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__poly.html#a809e0991b76093a22fd879a4ebff359b',1,'entt::basic_poly::basic_poly()'],['../classentt_1_1basic__poly.html#a75dc28220ce2957bbe011a2ee576e543',1,'entt::basic_poly::basic_poly(Type &&value)'],['../classentt_1_1basic__poly.html',1,'entt::basic_poly< Concept, Len, Align >']]], - ['basic_5fregistry_44',['basic_registry',['../classentt_1_1basic__registry.html#a0998b4125d8d2c92817dccac31e7f652',1,'entt::basic_registry::basic_registry()=default'],['../classentt_1_1basic__registry.html#ad53e4667abee7aeeef32b38eb5d21ad9',1,'entt::basic_registry::basic_registry(basic_registry &&other)'],['../classentt_1_1basic__registry.html',1,'entt::basic_registry< Entity >']]], - ['basic_5fregistry_3c_20entity_20_3e_45',['basic_registry< Entity >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()']]], - ['basic_5fregistry_3c_20entity_5ftype_20_3e_46',['basic_registry< entity_type >',['../classentt_1_1basic__registry.html',1,'entt']]], - ['basic_5fruntime_5fview_47',['basic_runtime_view',['../classentt_1_1basic__runtime__view.html#a44fc26564d30e281963feb2360d65f70',1,'entt::basic_runtime_view::basic_runtime_view(std::vector< const basic_common_type * > cpools, std::vector< const basic_common_type * > epools)'],['../classentt_1_1basic__runtime__view.html#a3cb0b77768ac723208825f6e3c3d3291',1,'entt::basic_runtime_view::basic_runtime_view()'],['../classentt_1_1basic__runtime__view.html',1,'entt::basic_runtime_view< Entity >']]], - ['basic_5fsnapshot_48',['basic_snapshot',['../classentt_1_1basic__snapshot.html#a953942494e3ee84f87cb515a86e4cfe6',1,'entt::basic_snapshot::basic_snapshot(const basic_registry< entity_type > &source)'],['../classentt_1_1basic__snapshot.html#a10f658d8e4feb7df9da8b48119551334',1,'entt::basic_snapshot::basic_snapshot(basic_snapshot &&)=default'],['../classentt_1_1basic__snapshot.html',1,'entt::basic_snapshot< Entity >']]], - ['basic_5fsnapshot_5floader_49',['basic_snapshot_loader',['../classentt_1_1basic__snapshot__loader.html#ac7bf5c8d48c665020c8689f14879db77',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_registry< entity_type > &source)'],['../classentt_1_1basic__snapshot__loader.html#acc078b2e9068ae41a2910168b40322d4',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_snapshot_loader &&)=default'],['../classentt_1_1basic__snapshot__loader.html',1,'entt::basic_snapshot_loader< Entity >']]], - ['basic_5fsparse_5fset_50',['basic_sparse_set',['../classentt_1_1basic__sparse__set.html#a1b636566df9e6f3f36ff62d2bdde8d10',1,'entt::basic_sparse_set::basic_sparse_set(const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html#a8e264ab5a7e2d97a204004d25b14238b',1,'entt::basic_sparse_set::basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})'],['../classentt_1_1basic__sparse__set.html#a437620052f5c5ff261715e607d6a0b35',1,'entt::basic_sparse_set::basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})'],['../classentt_1_1basic__sparse__set.html#aba22aad9557f355b657798a1e2fd9aad',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other)'],['../classentt_1_1basic__sparse__set.html#a9d6e25d1435a6216c60b42babd64085d',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html#afc504894fc2c20ea25b7fc2864bd22e3',1,'entt::basic_sparse_set::basic_sparse_set()'],['../classentt_1_1basic__sparse__set.html',1,'entt::basic_sparse_set< Entity, Allocator >']]], - ['basic_5fsparse_5fset_3c_20entity_2c_20std_3a_3aallocator_5ftraits_3c_20allocator_20_3e_3a_3atemplate_20rebind_5falloc_3c_20entity_20_3e_20_3e_51',['basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >',['../classentt_1_1basic__sparse__set.html',1,'entt']]], - ['basic_5fstorage_52',['basic_storage',['../classentt_1_1basic__storage.html#ac46b0df21902a582df328c1b80c75cb3',1,'entt::basic_storage::basic_storage()'],['../classentt_1_1basic__storage.html#aaa785dc52f39f9133e42a854b6e7c20c',1,'entt::basic_storage::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage.html#a8723ddbf200fe151baf6dfcb613c7e31',1,'entt::basic_storage::basic_storage(basic_storage &&other)'],['../classentt_1_1basic__storage.html#a40805deb39243c09f5b8c94b62edc660',1,'entt::basic_storage::basic_storage(basic_storage &&other, const allocator_type &allocator)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ac4d7718deec2da15c55675b3f8d8d450',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a001472f2d65c53dbd0291a45a072e3d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a356b2fa07fb7a7ec7a1d234c732d91f0',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other)=default'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1b28000a5097dab14b65d22e75e3b182',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other, const allocator_type &allocator)'],['../classentt_1_1basic__storage.html',1,'entt::basic_storage< Entity, Type, Allocator, typename >']]], - ['basic_5fstorage_3c_20entity_2c_20type_2c_20allocator_2c_20std_3a_3aenable_5fif_5ft_3c_20ignore_5fas_5fempty_5fv_3c_20type_20_3e_20_3e_20_3e_53',['basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >',['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html',1,'entt']]], - ['basic_5fstorage_3c_20entity_5ftype_2c_20payload_5ftype_20_3e_54',['basic_storage< entity_type, payload_type >',['../classentt_1_1basic__storage.html',1,'entt']]], - ['basic_5fview_55',['basic_view',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2725bbe2abbf21fbee84e530ccbb3938',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af1773aa2167b270f1140591fd84e8693',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view(storage_type< Component > &...component, const storage_type< Exclude > &...epool)'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a825c412a2903dce44b76275f2666f03b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a56bd7a61d27ef592459bcfdf5e5a8c57',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view(storage_type &ref)'],['../namespaceentt.html#a270b9239b055bcfe25afa3fb32e1dba3',1,'entt::basic_view(Storage &...storage) -> basic_view< std::common_type_t< typename Storage::entity_type... >, get_t< constness_as_t< typename Storage::value_type, Storage >... >, exclude_t<>>'],['../classentt_1_1basic__view.html',1,'entt::basic_view< typename, typename, typename, typename >']]], - ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_20_3e_2c_20exclude_5ft_3c_3e_2c_20std_3a_3avoid_5ft_3c_20std_3a_3aenable_5fif_5ft_3c_21component_5ftraits_3c_20std_3a_3aremove_5fconst_5ft_3c_20component_20_3e_20_3e_3a_3ain_5fplace_5fdelete_20_3e_20_3e_20_3e_56',['basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html',1,'entt']]], - ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_57',['basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html',1,'entt']]], - ['before_58',['before',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a8a19dea2601e173756c99baa691a2d4b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a82cb32b12a951b4b1422e77cd13f4cca',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#aa147ac46f6871211d42a9d8887fb0a9a',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afe942d584cacb2ba131f2f287327023b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ae997af819ce9812c266403fd409e3a1d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type *value_or_instance)']]], - ['begin_59',['begin',['../classentt_1_1dense__hash__set.html#a56b2ff2c25286572ff3dcef04058a1a7',1,'entt::dense_hash_set::begin() const'],['../classentt_1_1dense__hash__set.html#a5db70dadcea9f668933a92fa349f244e',1,'entt::dense_hash_set::begin()'],['../classentt_1_1dense__hash__set.html#a6dbb18630e7b941b5217df3b94495e03',1,'entt::dense_hash_set::begin(const size_type index) const'],['../classentt_1_1dense__hash__set.html#a737a1954acf41233fa9bbdca8a2d33ed',1,'entt::dense_hash_set::begin(const size_type index)'],['../structentt_1_1iterable__adaptor.html#a017dd4bccfd6777df24cf5beb4e2cc06',1,'entt::iterable_adaptor::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adc21572e734fd65ce2b36af82d745b79',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a73d4f29365d01949346944ee14948636',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__observer.html#a2067fca77f219bea0b5a341583a1544f',1,'entt::basic_observer::begin()'],['../classentt_1_1basic__runtime__view.html#aa1d8a9b29404f27c02ff496fb52318ec',1,'entt::basic_runtime_view::begin()'],['../classentt_1_1basic__sparse__set.html#aa1527310d8e329776aa17f807387d6de',1,'entt::basic_sparse_set::begin()'],['../classentt_1_1basic__storage.html#a777bce46cd8db4bbdfbc21353ab062ce',1,'entt::basic_storage::begin() const'],['../classentt_1_1basic__storage.html#ac411762f98f026482ce332c6b1e4229a',1,'entt::basic_storage::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a64caf3a751520b3f0d6f2c0b04f7e34b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1dense__hash__map.html#ab3c5def2ac17358bb1067b7fc1ac3b15',1,'entt::dense_hash_map::begin()'],['../classentt_1_1meta__sequence__container.html#ad4f618296f1ec7d7f5859713ecdf1695',1,'entt::meta_sequence_container::begin()'],['../classentt_1_1meta__associative__container.html#a86dcac50a81b30cd2720b3ac69318ada',1,'entt::meta_associative_container::begin()'],['../structentt_1_1meta__range.html#ada1265752a1413ea58af92dc80e6ac77',1,'entt::meta_range::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a68bbb84d9163371095cc4fd02941829e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::begin()'],['../classentt_1_1dense__hash__map.html#acde08ff80555a9f0853e570bd6d0052b',1,'entt::dense_hash_map::begin() const'],['../classentt_1_1dense__hash__map.html#a9911489c3547416e9e14dc4dd3c6d403',1,'entt::dense_hash_map::begin(const size_type index) const'],['../classentt_1_1dense__hash__map.html#ac688db11b9c3dddac4aad10271ae6690',1,'entt::dense_hash_map::begin(const size_type index)']]], - ['bind_60',['bind',['../classentt_1_1basic__sparse__set.html#a407121400cf9f3a843caf131f169b4f1',1,'entt::basic_sparse_set::bind()'],['../classentt_1_1sigh__storage__mixin.html#a02b9de35ac5da422d251f147e5585874',1,'entt::sigh_storage_mixin::bind()'],['../structentt_1_1meta__ctx.html#a822a19d8313d4e5df379d1f28b9914c5',1,'entt::meta_ctx::bind()']]], - ['bucket_61',['bucket',['../classentt_1_1dense__hash__set.html#a0e0f51ed5adc247aa09e756d665ee7f2',1,'entt::dense_hash_set::bucket()'],['../classentt_1_1dense__hash__map.html#a977645e15046ce2078be5b938ce27582',1,'entt::dense_hash_map::bucket(const key_type &key) const']]], - ['bucket_5fcount_62',['bucket_count',['../classentt_1_1dense__hash__map.html#ab9c69d954cc0944821fa63dfda5119a3',1,'entt::dense_hash_map::bucket_count()'],['../classentt_1_1dense__hash__set.html#a5c728c7d5428ba82457403dc5b0fffdf',1,'entt::dense_hash_set::bucket_count()']]], - ['bucket_5fsize_63',['bucket_size',['../classentt_1_1dense__hash__map.html#a55abb2a650ef1a0fd193012343221b16',1,'entt::dense_hash_map::bucket_size()'],['../classentt_1_1dense__hash__set.html#a970a59307536b28048f8445dd2a7f0c5',1,'entt::dense_hash_set::bucket_size()']]] + ['back_28',['back',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a308a495cd95cb8859ca80bcbd752417d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::back()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3a9f8b8e1603a0f7eed43fb2428e142d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a81c47aabb35b492703266db777de352f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a078e09804683968e5829c09782bf6e8a',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::back()']]], + ['base_29',['base',['../classentt_1_1meta__type.html#a2fc2ba44275f28e28536867ac6c20e79',1,'entt::meta_type::base() const'],['../classentt_1_1meta__type.html#a3c85444a003cbd6ae1063563f4694af5',1,'entt::meta_type::base(const id_type id) const'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a825c9621f778b0a1c8fffb16f4f1f1c7',1,'entt::meta_factory< Type >::base()']]], + ['base_5fnode_5ftype_30',['base_node_type',['../classentt_1_1meta__type.html#af5c8ce79f2b30967048acc2f4c890ff4',1,'entt::meta_type']]], + ['base_5ftype_31',['base_type',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#afa44a297867b649fc67f17b0431d7ee9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::base_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa84cd200af2da7539b2327f63b68250f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a94e9ea42f96a26560c82ec23c4dd03bf',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::base_type()'],['../classentt_1_1basic__storage.html#abdba347d3fa01f615d4fa28b22257f82',1,'entt::basic_storage::base_type()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#af1abd6cb4b85b1b7ee4e5e9e2d675349',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::base_type()'],['../classentt_1_1basic__registry.html#a70ffa0486e23004540f1655bdf46cef6',1,'entt::basic_registry::base_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2a750ebb99edab170da7f02378c44ea7',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a2344447157c3a7d1c82e5ac18db253a1',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::base_type()']]], + ['basic_5fany_32',['basic_any',['../classentt_1_1basic__any.html#abf56dc5f3a8324c15b40bf6c2a800702',1,'entt::basic_any::basic_any(basic_any &&other)'],['../classentt_1_1basic__any.html#a3196700b32252e5b59a79994b907afda',1,'entt::basic_any::basic_any(const basic_any &other)'],['../classentt_1_1basic__any.html#afb1d00c509ae9127faa1cc2a5887bdab',1,'entt::basic_any::basic_any(Type &&value)'],['../classentt_1_1basic__any.html#a3a84c837c69ab23b08a535ab79f7eefa',1,'entt::basic_any::basic_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__any.html#aa0d7f14d3ce9be8148ce8b32e95bad4e',1,'entt::basic_any::basic_any()'],['../classentt_1_1basic__any.html',1,'entt::basic_any< Len, Align >']]], + ['basic_5fany_3c_3e_33',['basic_any<>',['../classentt_1_1basic__any.html',1,'entt']]], + ['basic_5fcollector_34',['basic_collector',['../structentt_1_1basic__collector.html',1,'entt']]], + ['basic_5fcollector_3c_20matcher_3c_20type_5flist_3c_20reject_2e_2e_2e_20_3e_2c_20type_5flist_3c_20require_2e_2e_2e_20_3e_2c_20rule_2e_2e_2e_20_3e_2c_20other_2e_2e_2e_20_3e_35',['basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html',1,'entt']]], + ['basic_5fcollector_3c_3e_36',['basic_collector<>',['../structentt_1_1basic__collector_3_4.html',1,'entt']]], + ['basic_5fcontinuous_5floader_37',['basic_continuous_loader',['../classentt_1_1basic__continuous__loader.html#a619f3aa278b405481fd1e26c46a96a5c',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_continuous_loader &&)=default'],['../classentt_1_1basic__continuous__loader.html#aeb36501b43761b28eb7de311dbd080d8',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_registry< entity_type > &source)'],['../classentt_1_1basic__continuous__loader.html',1,'entt::basic_continuous_loader< Entity >']]], + ['basic_5fdispatcher_38',['basic_dispatcher',['../classentt_1_1basic__dispatcher.html#ad479b016e5261d80b30c25a540cc4fbd',1,'entt::basic_dispatcher::basic_dispatcher()'],['../classentt_1_1basic__dispatcher.html#ad9f651ee2a41ecf134790e203d4f3654',1,'entt::basic_dispatcher::basic_dispatcher(const allocator_type &allocator)'],['../classentt_1_1basic__dispatcher.html#ad555d3076719c1981865f82638604260',1,'entt::basic_dispatcher::basic_dispatcher(basic_dispatcher &&other)'],['../classentt_1_1basic__dispatcher.html#a30ee1d0e53506ccde1d3f5411411380c',1,'entt::basic_dispatcher::basic_dispatcher(basic_dispatcher &&other, const allocator_type &allocator)'],['../classentt_1_1basic__dispatcher.html',1,'entt::basic_dispatcher< Allocator >']]], + ['basic_5fgroup_39',['basic_group',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a392e8d6bd37c21a5056c8935d273b261',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_group()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ae6509fc61bfb25482f93caa4336a1f3c',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_group()'],['../classentt_1_1basic__group.html',1,'entt::basic_group< typename, typename, typename, typename >']]], + ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_40',['basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html',1,'entt']]], + ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_41',['basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html',1,'entt']]], + ['basic_5fhandle_42',['basic_handle',['../namespaceentt.html#a288ec07d4e87a28179d43b367ff11eab',1,'entt::basic_handle()'],['../structentt_1_1basic__handle.html#a9f88bf2f8fcb94b5ffe0f1290500004a',1,'entt::basic_handle::basic_handle(registry_type &ref, entity_type value)'],['../structentt_1_1basic__handle.html#ada86cadf8f425426e25e2a8712876137',1,'entt::basic_handle::basic_handle()'],['../namespaceentt.html#a6de052205bafd99d67afde880b67a4e8',1,'entt::basic_handle(const basic_registry< Entity > &, Entity) -> basic_handle< const Entity >'],['../structentt_1_1basic__handle.html',1,'entt::basic_handle< Entity, Type >']]], + ['basic_5fhashed_5fstring_43',['basic_hashed_string',['../namespaceentt.html#a2238bd6227a1ee3da75a6d4d224c589e',1,'entt::basic_hashed_string(const Char *str, const std::size_t len) -> basic_hashed_string< Char >'],['../namespaceentt.html#aaa97361ef962166a4fc51a582d7c6392',1,'entt::basic_hashed_string(const Char(&str)[N]) -> basic_hashed_string< Char >'],['../classentt_1_1basic__hashed__string.html#a564f57a39d02f5b94fa76a5ecf143299',1,'entt::basic_hashed_string::basic_hashed_string(const_wrapper wrapper)'],['../classentt_1_1basic__hashed__string.html#aec8acecd9af1c36f4a2edc44f3eeeb0b',1,'entt::basic_hashed_string::basic_hashed_string(const value_type(&str)[N])'],['../classentt_1_1basic__hashed__string.html#a980863db27ae60a5f6b1a883784ee935',1,'entt::basic_hashed_string::basic_hashed_string(const value_type *str, const size_type len)'],['../classentt_1_1basic__hashed__string.html#aa8b2ea90ba4d1bbb98d485f6a93e574e',1,'entt::basic_hashed_string::basic_hashed_string()'],['../classentt_1_1basic__hashed__string.html',1,'entt::basic_hashed_string< Char >']]], + ['basic_5fiterator_44',['basic_iterator',['../classentt_1_1basic__sparse__set.html#ac56bb654b47a648d64a754d85c70b40a',1,'entt::basic_sparse_set']]], + ['basic_5fobserver_45',['basic_observer',['../classentt_1_1basic__observer.html#abef3c847acf610f1a6f856b05f0f0721',1,'entt::basic_observer::basic_observer(basic_registry< entity_type > &reg, basic_collector< Matcher... >)'],['../classentt_1_1basic__observer.html#accbe2546b1b74de1a59e673cb6250413',1,'entt::basic_observer::basic_observer(basic_observer &&)=delete'],['../classentt_1_1basic__observer.html#adfb08de0ef1c0f57fadc6f6d171b931a',1,'entt::basic_observer::basic_observer()'],['../classentt_1_1basic__observer.html#aa685204c94266b5631c13540012e73c2',1,'entt::basic_observer::basic_observer(const basic_observer &)=delete'],['../classentt_1_1basic__observer.html',1,'entt::basic_observer< Entity >']]], + ['basic_5forganizer_46',['basic_organizer',['../classentt_1_1basic__organizer.html',1,'entt']]], + ['basic_5fpoly_47',['basic_poly',['../classentt_1_1basic__poly.html#aed074839fc14e757f761d89606895062',1,'entt::basic_poly::basic_poly(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__poly.html#a75dc28220ce2957bbe011a2ee576e543',1,'entt::basic_poly::basic_poly(Type &&value)'],['../classentt_1_1basic__poly.html#a809e0991b76093a22fd879a4ebff359b',1,'entt::basic_poly::basic_poly()'],['../classentt_1_1basic__poly.html',1,'entt::basic_poly< Concept, Len, Align >']]], + ['basic_5fregistry_48',['basic_registry',['../classentt_1_1basic__registry.html#a84e8bba7010be819fd6d7fc4e1a6d22f',1,'entt::basic_registry::basic_registry()'],['../classentt_1_1basic__registry.html#a4bd283e261a9c61a100e660041ddb1a2',1,'entt::basic_registry::basic_registry(const size_type count)'],['../classentt_1_1basic__registry.html#ad53e4667abee7aeeef32b38eb5d21ad9',1,'entt::basic_registry::basic_registry(basic_registry &&other)'],['../classentt_1_1basic__registry.html',1,'entt::basic_registry< Entity >']]], + ['basic_5fregistry_3c_20entity_20_3e_49',['basic_registry< Entity >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()']]], + ['basic_5fregistry_3c_20entity_5ftype_20_3e_50',['basic_registry< entity_type >',['../classentt_1_1basic__registry.html',1,'entt']]], + ['basic_5fruntime_5fview_51',['basic_runtime_view',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a77263744bccee7de1fb10b7915d4bda5',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::basic_runtime_view()'],['../structentt_1_1basic__runtime__view.html',1,'entt::basic_runtime_view< typename >']]], + ['basic_5fruntime_5fview_3c_20basic_5fsparse_5fset_3c_20entity_2c_20allocator_20_3e_20_3e_52',['basic_runtime_view< basic_sparse_set< Entity, Allocator > >',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html',1,'entt']]], + ['basic_5fsnapshot_53',['basic_snapshot',['../classentt_1_1basic__snapshot.html#a953942494e3ee84f87cb515a86e4cfe6',1,'entt::basic_snapshot::basic_snapshot(const basic_registry< entity_type > &source)'],['../classentt_1_1basic__snapshot.html#a10f658d8e4feb7df9da8b48119551334',1,'entt::basic_snapshot::basic_snapshot(basic_snapshot &&)=default'],['../classentt_1_1basic__snapshot.html',1,'entt::basic_snapshot< Entity >']]], + ['basic_5fsnapshot_5floader_54',['basic_snapshot_loader',['../classentt_1_1basic__snapshot__loader.html#acc078b2e9068ae41a2910168b40322d4',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_snapshot_loader &&)=default'],['../classentt_1_1basic__snapshot__loader.html#ac7bf5c8d48c665020c8689f14879db77',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_registry< entity_type > &source)'],['../classentt_1_1basic__snapshot__loader.html',1,'entt::basic_snapshot_loader< Entity >']]], + ['basic_5fsparse_5fset_55',['basic_sparse_set',['../classentt_1_1basic__sparse__set.html#a8e264ab5a7e2d97a204004d25b14238b',1,'entt::basic_sparse_set::basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})'],['../classentt_1_1basic__sparse__set.html#a437620052f5c5ff261715e607d6a0b35',1,'entt::basic_sparse_set::basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})'],['../classentt_1_1basic__sparse__set.html#aba22aad9557f355b657798a1e2fd9aad',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other)'],['../classentt_1_1basic__sparse__set.html#a9d6e25d1435a6216c60b42babd64085d',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html#afc504894fc2c20ea25b7fc2864bd22e3',1,'entt::basic_sparse_set::basic_sparse_set()'],['../classentt_1_1basic__sparse__set.html#a1b636566df9e6f3f36ff62d2bdde8d10',1,'entt::basic_sparse_set::basic_sparse_set(const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html',1,'entt::basic_sparse_set< Entity, Allocator >']]], + ['basic_5fsparse_5fset_3c_20entity_2c_20std_3a_3aallocator_5ftraits_3c_20allocator_20_3e_3a_3atemplate_20rebind_5falloc_3c_20entity_20_3e_20_3e_56',['basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >',['../classentt_1_1basic__sparse__set.html',1,'entt']]], + ['basic_5fstorage_57',['basic_storage',['../classentt_1_1basic__storage.html#ac46b0df21902a582df328c1b80c75cb3',1,'entt::basic_storage::basic_storage()'],['../classentt_1_1basic__storage.html#aaa785dc52f39f9133e42a854b6e7c20c',1,'entt::basic_storage::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage.html#a8723ddbf200fe151baf6dfcb613c7e31',1,'entt::basic_storage::basic_storage(basic_storage &&other)'],['../classentt_1_1basic__storage.html#a40805deb39243c09f5b8c94b62edc660',1,'entt::basic_storage::basic_storage(basic_storage &&other, const allocator_type &allocator)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ac4d7718deec2da15c55675b3f8d8d450',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a001472f2d65c53dbd0291a45a072e3d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a356b2fa07fb7a7ec7a1d234c732d91f0',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other)=default'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1b28000a5097dab14b65d22e75e3b182',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other, const allocator_type &allocator)'],['../classentt_1_1basic__storage.html',1,'entt::basic_storage< Entity, Type, Allocator, typename >']]], + ['basic_5fstorage_3c_20entity_2c_20type_2c_20allocator_2c_20std_3a_3aenable_5fif_5ft_3c_20ignore_5fas_5fempty_5fv_3c_20type_20_3e_20_3e_20_3e_58',['basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >',['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html',1,'entt']]], + ['basic_5fstorage_3c_20entity_5ftype_2c_20payload_5ftype_20_3e_59',['basic_storage< entity_type, payload_type >',['../classentt_1_1basic__storage.html',1,'entt']]], + ['basic_5fview_60',['basic_view',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2725bbe2abbf21fbee84e530ccbb3938',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af1773aa2167b270f1140591fd84e8693',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view(storage_type< Component > &...component, const storage_type< Exclude > &...epool)'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a825c412a2903dce44b76275f2666f03b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a56bd7a61d27ef592459bcfdf5e5a8c57',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view(storage_type &ref)'],['../namespaceentt.html#a270b9239b055bcfe25afa3fb32e1dba3',1,'entt::basic_view(Storage &...storage) -> basic_view< std::common_type_t< typename Storage::entity_type... >, get_t< constness_as_t< typename Storage::value_type, Storage >... >, exclude_t<>>'],['../classentt_1_1basic__view.html',1,'entt::basic_view< typename, typename, typename, typename >']]], + ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_20_3e_2c_20exclude_5ft_3c_3e_2c_20std_3a_3avoid_5ft_3c_20std_3a_3aenable_5fif_5ft_3c_21component_5ftraits_3c_20std_3a_3aremove_5fconst_5ft_3c_20component_20_3e_20_3e_3a_3ain_5fplace_5fdelete_20_3e_20_3e_20_3e_61',['basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html',1,'entt']]], + ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_62',['basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html',1,'entt']]], + ['before_63',['before',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a82cb32b12a951b4b1422e77cd13f4cca',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#aa147ac46f6871211d42a9d8887fb0a9a',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afe942d584cacb2ba131f2f287327023b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ae997af819ce9812c266403fd409e3a1d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a8a19dea2601e173756c99baa691a2d4b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()']]], + ['begin_64',['begin',['../classentt_1_1dense__set.html#aff20ae4c1f02dc6955f16e00890baa2f',1,'entt::dense_set::begin()'],['../classentt_1_1dense__set.html#af40a2a303dddc229bce36516d18921d5',1,'entt::dense_set::begin(const size_type index) const'],['../classentt_1_1dense__set.html#af5dfa9caba33563b1678e85d2774609c',1,'entt::dense_set::begin(const size_type index)'],['../structentt_1_1iterable__adaptor.html#a24f0c0139b40ae81a191b8330b221004',1,'entt::iterable_adaptor::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adc21572e734fd65ce2b36af82d745b79',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a73d4f29365d01949346944ee14948636',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__observer.html#a2067fca77f219bea0b5a341583a1544f',1,'entt::basic_observer::begin()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a52e9897a4ac2c0ad21df7742a5b10b92',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::begin()'],['../classentt_1_1basic__sparse__set.html#aa1527310d8e329776aa17f807387d6de',1,'entt::basic_sparse_set::begin()'],['../classentt_1_1basic__storage.html#a777bce46cd8db4bbdfbc21353ab062ce',1,'entt::basic_storage::begin() const'],['../classentt_1_1basic__storage.html#ac411762f98f026482ce332c6b1e4229a',1,'entt::basic_storage::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a64caf3a751520b3f0d6f2c0b04f7e34b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a68bbb84d9163371095cc4fd02941829e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::begin()'],['../classentt_1_1meta__sequence__container.html#ad4f618296f1ec7d7f5859713ecdf1695',1,'entt::meta_sequence_container::begin()'],['../classentt_1_1meta__associative__container.html#a86dcac50a81b30cd2720b3ac69318ada',1,'entt::meta_associative_container::begin()'],['../classentt_1_1dense__map.html#a4b71476135fb7147c02ec7a801564c72',1,'entt::dense_map::begin()'],['../classentt_1_1resource__cache.html#a4a09c477294cbe8e4ed7664404633e3b',1,'entt::resource_cache::begin() const'],['../classentt_1_1resource__cache.html#acd993aefd78f8e80d413c3343bb61900',1,'entt::resource_cache::begin()'],['../structentt_1_1meta__range.html#ada1265752a1413ea58af92dc80e6ac77',1,'entt::meta_range::begin()'],['../classentt_1_1dense__map.html#a4e3cb06e2db3126bae58264615864ca7',1,'entt::dense_map::begin()'],['../classentt_1_1dense__map.html#a33900c670781f415f4eb0bfeb5be04a3',1,'entt::dense_map::begin(const size_type index) const'],['../classentt_1_1dense__map.html#a1e7f45435b51480254f3df29443c0437',1,'entt::dense_map::begin() const'],['../classentt_1_1dense__set.html#ac5b37f68aef0b6dc51f7ea65bb34c130',1,'entt::dense_set::begin()']]], + ['bind_65',['bind',['../classentt_1_1basic__sparse__set.html#a407121400cf9f3a843caf131f169b4f1',1,'entt::basic_sparse_set::bind()'],['../structentt_1_1meta__ctx.html#a822a19d8313d4e5df379d1f28b9914c5',1,'entt::meta_ctx::bind()'],['../classentt_1_1sigh__storage__mixin.html#a02b9de35ac5da422d251f147e5585874',1,'entt::sigh_storage_mixin::bind()']]], + ['bucket_66',['bucket',['../classentt_1_1dense__map.html#a9a591d419dd5649e52907a3032f8c0b8',1,'entt::dense_map::bucket()'],['../classentt_1_1dense__set.html#a36a7137bfb36d2ca5026d986710cc05a',1,'entt::dense_set::bucket()']]], + ['bucket_5fcount_67',['bucket_count',['../classentt_1_1dense__map.html#aee246b41534137f279a11eb5e225a6e5',1,'entt::dense_map::bucket_count()'],['../classentt_1_1dense__set.html#a4ad74d3386c317d8aa2f9a2c88f410e4',1,'entt::dense_set::bucket_count()']]], + ['bucket_5fsize_68',['bucket_size',['../classentt_1_1dense__map.html#ae094f65cda09d80851306f6a4bba7b50',1,'entt::dense_map::bucket_size()'],['../classentt_1_1dense__set.html#a001d564dcf11933f59592f15709830d0',1,'entt::dense_set::bucket_size()']]], + ['bump_69',['bump',['../classentt_1_1basic__sparse__set.html#adde9ce48f5ac80b0e79927306ce62937',1,'entt::basic_sparse_set']]] ]; diff --git a/search/all_10.js b/search/all_10.js index 4082f1299..7922f8f97 100644 --- a/search/all_10.js +++ b/search/all_10.js @@ -1,43 +1,39 @@ var searchData= [ - ['scheduler_436',['scheduler',['../classentt_1_1scheduler.html',1,'entt::scheduler< Delta >'],['../classentt_1_1scheduler.html#a49a81e662dc26831f4a951a715705d6e',1,'entt::scheduler::scheduler()=default'],['../classentt_1_1scheduler.html#af582ffea72368a83ea4dd7d9e563f715',1,'entt::scheduler::scheduler(scheduler &&)=default']]], - ['scoped_5fconnection_437',['scoped_connection',['../structentt_1_1scoped__connection.html',1,'entt::scoped_connection'],['../structentt_1_1scoped__connection.html#a5675cd808dd54a6d9546037d282d3c6c',1,'entt::scoped_connection::scoped_connection()=default'],['../structentt_1_1scoped__connection.html#ab3c50842fea4014f8bf2e51ce4cfbc8a',1,'entt::scoped_connection::scoped_connection(const connection &other)'],['../structentt_1_1scoped__connection.html#ad52da49cdabbfe1a4aada361f48fb9be',1,'entt::scoped_connection::scoped_connection(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#a82b3c022128eada5c6be2c5fc7d4bd2b',1,'entt::scoped_connection::scoped_connection(scoped_connection &&other)']]], - ['second_438',['second',['../classentt_1_1compressed__pair.html#a68d93c20d07b5f9badaf100193e2df52',1,'entt::compressed_pair::second() const'],['../classentt_1_1compressed__pair.html#a73cc7edd96358313d81fe92736467d3f',1,'entt::compressed_pair::second()']]], - ['second_5ftype_439',['second_type',['../classentt_1_1compressed__pair.html#aeadab3815d52ed579a96cde92f15eeb6',1,'entt::compressed_pair']]], - ['service_5flocator_440',['service_locator',['../structentt_1_1service__locator.html',1,'entt::service_locator< Service >'],['../structentt_1_1service__locator.html#a120cdb3eb1d820e5649f3d8bac8098d0',1,'entt::service_locator::service_locator()=delete']]], - ['service_5ftype_441',['service_type',['../structentt_1_1service__locator.html#af34a883e56f32a98d7b8a5db87bdf504',1,'entt::service_locator']]], - ['set_442',['set',['../classentt_1_1basic__registry.html#a9f04ea21a04ad05937274de518da705f',1,'entt::basic_registry::set()'],['../structentt_1_1service__locator.html#a1cab7cf8cff562d6ec95b7aaeaf12366',1,'entt::service_locator::set(Args &&...args)'],['../structentt_1_1service__locator.html#a86770e79d01ab5fb0dddffba0bf9a697',1,'entt::service_locator::set(std::shared_ptr< Service > ptr)'],['../classentt_1_1meta__any.html#aa82e0c3e29683d99cc611618d101488b',1,'entt::meta_any::set()'],['../structentt_1_1meta__data.html#a9cec301b83378b11ad316663e8ece835',1,'entt::meta_data::set()'],['../classentt_1_1meta__type.html#a708bdf89918c3fdf2b3539454201f1e9',1,'entt::meta_type::set()']]], - ['shrink_443',['shrink',['../classentt_1_1basic__continuous__loader.html#a01b949f4a5829bd5bf3738a7e0f776d2',1,'entt::basic_continuous_loader']]], - ['shrink_5fto_5ffit_444',['shrink_to_fit',['../classentt_1_1basic__sparse__set.html#a7e10cc6ddc7ef9c733aabdec849c5b79',1,'entt::basic_sparse_set::shrink_to_fit()'],['../classentt_1_1basic__storage.html#a0d791d4bb0c1e9c0c97bd7f9cfd33af9',1,'entt::basic_storage::shrink_to_fit()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a5b73b008214eee8f3692507ff8b8b7e4',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::shrink_to_fit()']]], - ['sigh_445',['sigh',['../classentt_1_1sigh.html',1,'entt::sigh< Type, typename >'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0118cc119e2d90dc667fe44916c560a7',1,'entt::sigh< Ret(Args...), Allocator >::sigh()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af800c7e4bafa5739172f5f4190a2fb81',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a3d281bf1e8e9aebc3b21f1b76412664f',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#adbcac376ce96c2750282754724f3d418',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other, const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a4d7a26fc9e4d8d94503f99b4c91dcc78',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a5c257082ad2bbbd6134012360a0c7373',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other, const allocator_type &allocator)']]], - ['sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_446',['sigh< Ret(Args...), Allocator >',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html',1,'entt']]], - ['sigh_3c_20void_28entt_3a_3abasic_5fregistry_3c_20entity_5ftype_20_3e_20_26_2c_20const_20entity_5ftype_29_3e_447',['sigh< void(entt::basic_registry< entity_type > &, const entity_type)>',['../classentt_1_1sigh.html',1,'entt']]], - ['sigh_3c_20void_28event_20_26_29_3e_448',['sigh< void(Event &)>',['../classentt_1_1sigh.html',1,'entt']]], - ['sigh_5fstorage_5fmixin_449',['sigh_storage_mixin',['../classentt_1_1sigh__storage__mixin.html',1,'entt']]], - ['similar_20projects_450',['Similar projects',['../md_docs_md_reference.html',1,'']]], - ['sink_451',['sink',['../classentt_1_1sink.html',1,'entt::sink< typename >'],['../classentt_1_1dispatcher.html#a0fd52abaeed110ec526918c255f6fcfa',1,'entt::dispatcher::sink()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a118455f8748e70c2e3a6e78ffd1f7175',1,'entt::sink< sigh< Ret(Args...), Allocator > >::sink()'],['../namespaceentt.html#aba4dd70afb5ef2529d05bc474b234f53',1,'entt::sink()'],['../classentt_1_1connection.html#afe2b37ace8306e708a0dc76c658a4b19',1,'entt::connection::sink()']]], - ['sink_3c_20sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_20_3e_452',['sink< sigh< Ret(Args...), Allocator > >',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html',1,'entt::sink< sigh< Ret(Args...), Allocator > >'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4b39de26549c75a8c7b66e2ada43c37',1,'entt::sigh< Ret(Args...), Allocator >::sink< sigh< Ret(Args...), Allocator > >()']]], - ['sink_5ftype_453',['sink_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa7f2f5776361d62d9f84f2046a869628',1,'entt::sigh< Ret(Args...), Allocator >']]], - ['size_454',['size',['../structentt_1_1type__list.html#a430c0675bdbcbb40be9b8f13f7259484',1,'entt::type_list::size()'],['../structentt_1_1value__list.html#a26bdc12c949cf22068f1bd411acf6cc7',1,'entt::value_list::size()'],['../classentt_1_1dense__hash__map.html#a6d119cf64191efa39b949e37905e2d02',1,'entt::dense_hash_map::size()'],['../classentt_1_1dense__hash__set.html#a7fb84bd3b74213d0a9c6ce1329c92327',1,'entt::dense_hash_set::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4b4a17bece15f2cf4507610d92cb0d15',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5946d6c8e4129956d3a7ec77ab26a427',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__observer.html#aae9024a8c5b14adfe90690a56fa09935',1,'entt::basic_observer::size()'],['../classentt_1_1basic__registry.html#a5b056608b1723b73a001e20d2f2592bc',1,'entt::basic_registry::size()'],['../classentt_1_1basic__sparse__set.html#a781b6cee81c02b5dd601d0c808cf97a8',1,'entt::basic_sparse_set::size()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a799bc0f08f63bbeac5154f22431db1e9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size()'],['../classentt_1_1meta__sequence__container.html#ab8e77ced086e11a170953992af5fbebf',1,'entt::meta_sequence_container::size()'],['../classentt_1_1meta__associative__container.html#ae7bf0859ac226d818a58cd6181915032',1,'entt::meta_associative_container::size()'],['../classentt_1_1scheduler.html#a137d1d00e30f8840051adb5002a69bc5',1,'entt::scheduler::size()'],['../classentt_1_1resource__cache.html#a90f4014d42bf22b536f720706a96d76d',1,'entt::resource_cache::size()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a6d3b17d4e20d0c478cee768dfa4d57b6',1,'entt::sigh< Ret(Args...), Allocator >::size()']]], - ['size_5fhint_455',['size_hint',['../classentt_1_1basic__runtime__view.html#afc03b5d755f01f2417beadca306a30f7',1,'entt::basic_runtime_view::size_hint()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ae8c282c644bd62bbd3838688b816b807',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_hint()']]], - ['size_5fof_456',['size_of',['../structentt_1_1size__of.html',1,'entt::size_of< Type, typename >'],['../classentt_1_1meta__type.html#a611f49dda24012f0a1c3eda4c2022501',1,'entt::meta_type::size_of()']]], - ['size_5fof_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_457',['size_of< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], - ['size_5fof_5fv_458',['size_of_v',['../namespaceentt.html#a15f9a70cbdd5a64f897a012ab2b5834f',1,'entt']]], - ['size_5ftype_459',['size_type',['../classentt_1_1dense__hash__set.html#ae229c0486758861995ed75580f1b9870',1,'entt::dense_hash_set::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac0a657b51e4a3d8bd7290a8f8b78cc24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a9636d703c95b047cbfbfe8c13e0fb5b6',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../structentt_1_1basic__handle.html#a0c6be936b2046833a789caf06e0567fe',1,'entt::basic_handle::size_type()'],['../classentt_1_1basic__observer.html#a147a0e35035fc3c19b67b31d66d2d80b',1,'entt::basic_observer::size_type()'],['../classentt_1_1basic__organizer.html#afcf528b532b3c41ab06c11d5c82a7260',1,'entt::basic_organizer::size_type()'],['../classentt_1_1basic__registry.html#a6a44260f861a699f1353097391c51636',1,'entt::basic_registry::size_type()'],['../classentt_1_1basic__runtime__view.html#aabb4450ce3d686fe05bd92e5975d11fb',1,'entt::basic_runtime_view::size_type()'],['../classentt_1_1basic__sparse__set.html#a6f41f1b0b70a30ee160cf2734bec448f',1,'entt::basic_sparse_set::size_type()'],['../classentt_1_1basic__storage.html#aa0e2c748f5a9f0a1a3fb7eb9d5fa8d83',1,'entt::basic_storage::size_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a67b50c6160f2ef1fc5ecbfaaad9c67f5',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a8a7e88587dbf957bc2d4b8b0592cee29',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a10af7cb14dfea9759c0a71fb197f74ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size_type()'],['../classentt_1_1meta__sequence__container.html#aa24e9df149bccfada6257266e5d829b1',1,'entt::meta_sequence_container::size_type()'],['../classentt_1_1meta__associative__container.html#a9ef078a3364ff3d53cec2bda15f4782f',1,'entt::meta_associative_container::size_type()'],['../structentt_1_1meta__data.html#ab322080e34d8e40621a67f2f0e0672b7',1,'entt::meta_data::size_type()'],['../structentt_1_1meta__func.html#aa35b75b107a0e02f7f03f0737980a428',1,'entt::meta_func::size_type()'],['../classentt_1_1meta__type.html#a9d7a45ed06b058813b928e2778499a5e',1,'entt::meta_type::size_type()'],['../classentt_1_1scheduler.html#afcec47d6ec28a994af2a7097348ce59f',1,'entt::scheduler::size_type()'],['../classentt_1_1resource__cache.html#aa9251f4bd388f39b18b6b416f58170e1',1,'entt::resource_cache::size_type()'],['../classentt_1_1resource__handle.html#aaa5bb317dff4e02ec3cef610705de341',1,'entt::resource_handle::size_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4da86f239ecc0eddc6c5d99350fbe91',1,'entt::sigh< Ret(Args...), Allocator >::size_type()'],['../classentt_1_1dense__hash__map.html#ab7a5cacd84728015914981f81c82e3a3',1,'entt::dense_hash_map::size_type()']]], - ['slot_460',['slot',['../classentt_1_1basic__sparse__set.html#a3cfe17211583fcac905a462dbe2d1c09',1,'entt::basic_sparse_set']]], - ['snapshot_461',['snapshot',['../namespaceentt.html#a80012f9fa628920a3507ae947704d447',1,'entt']]], - ['snapshot_5floader_462',['snapshot_loader',['../namespaceentt.html#ae7e50fc296c4ea68183db332950b99f5',1,'entt']]], - ['sort_463',['sort',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a982161711bb437ea1014b875e4f00422',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort(Compare compare, Sort algo=Sort{}, Args &&...args)'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac69a43f81a8089909591f3739f93b760',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad3428f8d0a65d65365fa26ead2bb727d',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::sort()'],['../classentt_1_1basic__registry.html#a413fa9d1dbe15b8043358ea9cdba6ba1',1,'entt::basic_registry::sort(Compare compare, Sort algo=Sort{}, Args &&...args)'],['../classentt_1_1basic__registry.html#a2907f89b80fb692b16727e5e67a91c5d',1,'entt::basic_registry::sort()'],['../classentt_1_1basic__sparse__set.html#ae7ceed81905adc0d65291eb9f4072f08',1,'entt::basic_sparse_set::sort(Compare compare, Sort algo=Sort{}, Args &&...args)']]], - ['sort_5fn_464',['sort_n',['../classentt_1_1basic__sparse__set.html#a43c1c0aa0fa525e12cee0791cd945915',1,'entt::basic_sparse_set']]], - ['sortable_465',['sortable',['../classentt_1_1basic__registry.html#a5f7af56d6b9fca94a6ebd6ab13896b27',1,'entt::basic_registry::sortable() const'],['../classentt_1_1basic__registry.html#a965ab1b09f078e4494ebc3962d16e0bb',1,'entt::basic_registry::sortable(const basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)']]], - ['sparse_5fset_466',['sparse_set',['../namespaceentt.html#ac27c0013e504d544508cdacc01170b68',1,'entt']]], - ['std_5fsort_467',['std_sort',['../structentt_1_1std__sort.html',1,'entt']]], - ['storage_468',['storage',['../classentt_1_1basic__registry.html#a71b8b9cf2ceccd12bdb84fc92349f85a',1,'entt::basic_registry::storage() const'],['../classentt_1_1basic__registry.html#a9d4824660a8fcee9362b39e2de46e8ce',1,'entt::basic_registry::storage(const id_type id=type_hash< Component >::value())'],['../classentt_1_1basic__registry.html#adbb78123b695ad38d8e6d120cc8908b1',1,'entt::basic_registry::storage(const id_type id=type_hash< Component >::value()) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__registry.html#a9cce13121f0ba615c290a48dedff53ad',1,'entt::basic_registry::storage()'],['../namespaceentt.html#abcedb8f29753130e2bf3185bca211f05',1,'entt::storage()']]], - ['storage_5ftraits_469',['storage_traits',['../structentt_1_1storage__traits.html',1,'entt']]], - ['storage_5ftype_470',['storage_type',['../structentt_1_1storage__traits.html#a7cda978d208a50c536ae96570d76bf8e',1,'entt::storage_traits']]], - ['succeed_471',['succeed',['../classentt_1_1process.html#a3b71fd166a1e6b42ea76f2e92bfa5edc',1,'entt::process']]], - ['swap_472',['swap',['../classentt_1_1basic__storage.html#ac4b412a6f425771044b2c903afe97235',1,'entt::basic_storage::swap()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa9fba3d3d4e6be85493982011d9f6d46',1,'entt::sigh< Ret(Args...), Allocator >::swap()'],['../classentt_1_1dense__hash__map.html#a7ef165b4b927086e73f200d288a11923',1,'entt::dense_hash_map::swap()'],['../classentt_1_1dense__hash__set.html#a04d35e41cb0d2ff7254d644bc81a2011',1,'entt::dense_hash_set::swap()'],['../classentt_1_1basic__sparse__set.html#a0ba4866849ffb525cce7b4eee58b83a8',1,'entt::basic_sparse_set::swap()'],['../classentt_1_1compressed__pair.html#a1f153123bcde4947f020ea2459d76e45',1,'entt::compressed_pair::swap()'],['../namespaceentt.html#aef08fc4202f32f712bde26f55db463cb',1,'entt::swap()']]], - ['swap_5fand_5fpop_473',['swap_and_pop',['../classentt_1_1basic__sparse__set.html#a40f3640062e18305e4fc7742f4f4c284',1,'entt::basic_sparse_set::swap_and_pop()'],['../classentt_1_1basic__storage.html#a66082b2fd40d10d749e99bc1b8144db8',1,'entt::basic_storage::swap_and_pop()'],['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581a8223d1ccb16b6dd0b19fe9c6fdb13708',1,'entt::swap_and_pop()']]], - ['swap_5fat_474',['swap_at',['../classentt_1_1basic__sparse__set.html#a7839ecd024cf400c2d5e8d22c8cff05f',1,'entt::basic_sparse_set::swap_at()'],['../classentt_1_1basic__storage.html#a4d761b7d0e922003761366ff46f01cec',1,'entt::basic_storage::swap_at()']]], - ['swap_5felements_475',['swap_elements',['../classentt_1_1basic__sparse__set.html#a2b82af720eca37261f3230c654d7fe1f',1,'entt::basic_sparse_set']]] + ['scheduler_433',['scheduler',['../classentt_1_1scheduler.html',1,'entt::scheduler< Delta >'],['../classentt_1_1scheduler.html#a49a81e662dc26831f4a951a715705d6e',1,'entt::scheduler::scheduler()=default'],['../classentt_1_1scheduler.html#af582ffea72368a83ea4dd7d9e563f715',1,'entt::scheduler::scheduler(scheduler &&)=default']]], + ['scoped_5fconnection_434',['scoped_connection',['../structentt_1_1scoped__connection.html',1,'entt::scoped_connection'],['../structentt_1_1scoped__connection.html#a5675cd808dd54a6d9546037d282d3c6c',1,'entt::scoped_connection::scoped_connection()=default'],['../structentt_1_1scoped__connection.html#ab3c50842fea4014f8bf2e51ce4cfbc8a',1,'entt::scoped_connection::scoped_connection(const connection &other)'],['../structentt_1_1scoped__connection.html#ad52da49cdabbfe1a4aada361f48fb9be',1,'entt::scoped_connection::scoped_connection(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#a82b3c022128eada5c6be2c5fc7d4bd2b',1,'entt::scoped_connection::scoped_connection(scoped_connection &&other)']]], + ['second_435',['second',['../classentt_1_1compressed__pair.html#a73cc7edd96358313d81fe92736467d3f',1,'entt::compressed_pair::second()'],['../classentt_1_1compressed__pair.html#a68d93c20d07b5f9badaf100193e2df52',1,'entt::compressed_pair::second() const']]], + ['second_5ftype_436',['second_type',['../classentt_1_1compressed__pair.html#aeadab3815d52ed579a96cde92f15eeb6',1,'entt::compressed_pair']]], + ['sentinel_437',['sentinel',['../structentt_1_1iterable__adaptor.html#a86150bc99361dabcbb7f574d84691e42',1,'entt::iterable_adaptor']]], + ['set_438',['set',['../classentt_1_1meta__any.html#aa82e0c3e29683d99cc611618d101488b',1,'entt::meta_any::set()'],['../structentt_1_1meta__data.html#a9cec301b83378b11ad316663e8ece835',1,'entt::meta_data::set()'],['../classentt_1_1meta__type.html#a708bdf89918c3fdf2b3539454201f1e9',1,'entt::meta_type::set()']]], + ['shrink_439',['shrink',['../classentt_1_1basic__continuous__loader.html#a01b949f4a5829bd5bf3738a7e0f776d2',1,'entt::basic_continuous_loader']]], + ['shrink_5fto_5ffit_440',['shrink_to_fit',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a5b73b008214eee8f3692507ff8b8b7e4',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::shrink_to_fit()'],['../classentt_1_1basic__sparse__set.html#a7e10cc6ddc7ef9c733aabdec849c5b79',1,'entt::basic_sparse_set::shrink_to_fit()'],['../classentt_1_1basic__storage.html#a0d791d4bb0c1e9c0c97bd7f9cfd33af9',1,'entt::basic_storage::shrink_to_fit()']]], + ['sigh_441',['sigh',['../classentt_1_1sigh.html',1,'entt::sigh< Type, typename >'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#adbcac376ce96c2750282754724f3d418',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other, const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a4d7a26fc9e4d8d94503f99b4c91dcc78',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a5c257082ad2bbbd6134012360a0c7373',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other, const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0118cc119e2d90dc667fe44916c560a7',1,'entt::sigh< Ret(Args...), Allocator >::sigh()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af800c7e4bafa5739172f5f4190a2fb81',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a3d281bf1e8e9aebc3b21f1b76412664f',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other)']]], + ['sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_442',['sigh< Ret(Args...), Allocator >',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html',1,'entt']]], + ['sigh_3c_20void_28entt_3a_3abasic_5fregistry_3c_20entity_5ftype_20_3e_20_26_2c_20const_20entity_5ftype_29_3e_443',['sigh< void(entt::basic_registry< entity_type > &, const entity_type)>',['../classentt_1_1sigh.html',1,'entt']]], + ['sigh_5fstorage_5fmixin_444',['sigh_storage_mixin',['../classentt_1_1sigh__storage__mixin.html',1,'entt']]], + ['similar_20projects_445',['Similar projects',['../md_docs_md_reference.html',1,'']]], + ['sink_446',['sink',['../classentt_1_1sink.html',1,'entt::sink< typename >'],['../namespaceentt.html#aba4dd70afb5ef2529d05bc474b234f53',1,'entt::sink(sigh< Ret(Args...), Allocator > &) -> sink< sigh< Ret(Args...), Allocator >>'],['../classentt_1_1connection.html#afe2b37ace8306e708a0dc76c658a4b19',1,'entt::connection::sink()'],['../classentt_1_1basic__dispatcher.html#a5612937de61684689e71ba7039913820',1,'entt::basic_dispatcher::sink()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a118455f8748e70c2e3a6e78ffd1f7175',1,'entt::sink< sigh< Ret(Args...), Allocator > >::sink()']]], + ['sink_3c_20sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_20_3e_447',['sink< sigh< Ret(Args...), Allocator > >',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html',1,'entt::sink< sigh< Ret(Args...), Allocator > >'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4b39de26549c75a8c7b66e2ada43c37',1,'entt::sigh< Ret(Args...), Allocator >::sink< sigh< Ret(Args...), Allocator > >()']]], + ['sink_5ftype_448',['sink_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa7f2f5776361d62d9f84f2046a869628',1,'entt::sigh< Ret(Args...), Allocator >']]], + ['size_449',['size',['../classentt_1_1basic__dispatcher.html#a11d69f559e877f65beb4dd23ea975fb0',1,'entt::basic_dispatcher::size()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a6d3b17d4e20d0c478cee768dfa4d57b6',1,'entt::sigh< Ret(Args...), Allocator >::size()'],['../structentt_1_1type__list.html#a430c0675bdbcbb40be9b8f13f7259484',1,'entt::type_list::size()'],['../structentt_1_1value__list.html#a26bdc12c949cf22068f1bd411acf6cc7',1,'entt::value_list::size()'],['../classentt_1_1dense__map.html#afeca346dc4e81401d0beb3e3387d8596',1,'entt::dense_map::size()'],['../classentt_1_1dense__set.html#a03fcb636493dcf1d4e417eba8e8976e9',1,'entt::dense_set::size()'],['../classentt_1_1basic__hashed__string.html#a78d52d39edf529df2225bd0b695e42d5',1,'entt::basic_hashed_string::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4b4a17bece15f2cf4507610d92cb0d15',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5946d6c8e4129956d3a7ec77ab26a427',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__observer.html#aae9024a8c5b14adfe90690a56fa09935',1,'entt::basic_observer::size()'],['../classentt_1_1basic__registry.html#a5b056608b1723b73a001e20d2f2592bc',1,'entt::basic_registry::size()'],['../classentt_1_1basic__sparse__set.html#a781b6cee81c02b5dd601d0c808cf97a8',1,'entt::basic_sparse_set::size()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a799bc0f08f63bbeac5154f22431db1e9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size()'],['../classentt_1_1meta__sequence__container.html#ab8e77ced086e11a170953992af5fbebf',1,'entt::meta_sequence_container::size()'],['../classentt_1_1meta__associative__container.html#ae7bf0859ac226d818a58cd6181915032',1,'entt::meta_associative_container::size()'],['../classentt_1_1scheduler.html#a137d1d00e30f8840051adb5002a69bc5',1,'entt::scheduler::size()'],['../classentt_1_1resource__cache.html#a63a0563cb6c49f1651f9d92832206ddf',1,'entt::resource_cache::size()'],['../classentt_1_1basic__dispatcher.html#a4e283dfc3896a2cdd4d89de24c293637',1,'entt::basic_dispatcher::size()']]], + ['size_5fhint_450',['size_hint',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a89fa897d13f068d50907936ff66d9a52',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::size_hint()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ae8c282c644bd62bbd3838688b816b807',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_hint()']]], + ['size_5fof_451',['size_of',['../structentt_1_1size__of.html',1,'entt::size_of< Type, typename >'],['../classentt_1_1meta__type.html#a611f49dda24012f0a1c3eda4c2022501',1,'entt::meta_type::size_of()']]], + ['size_5fof_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_452',['size_of< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], + ['size_5fof_5fv_453',['size_of_v',['../namespaceentt.html#a15f9a70cbdd5a64f897a012ab2b5834f',1,'entt']]], + ['size_5ftype_454',['size_type',['../classentt_1_1dense__set.html#a3355912feda8db49d87b75247f824ce0',1,'entt::dense_set::size_type()'],['../classentt_1_1basic__hashed__string.html#a4550e2c6eb3ec63c72d6d831182bd015',1,'entt::basic_hashed_string::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac0a657b51e4a3d8bd7290a8f8b78cc24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a9636d703c95b047cbfbfe8c13e0fb5b6',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../structentt_1_1basic__handle.html#a0c6be936b2046833a789caf06e0567fe',1,'entt::basic_handle::size_type()'],['../classentt_1_1basic__observer.html#a147a0e35035fc3c19b67b31d66d2d80b',1,'entt::basic_observer::size_type()'],['../classentt_1_1basic__organizer.html#afcf528b532b3c41ab06c11d5c82a7260',1,'entt::basic_organizer::size_type()'],['../classentt_1_1basic__registry.html#a6a44260f861a699f1353097391c51636',1,'entt::basic_registry::size_type()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a6b9c1f57fef57266a406e549f444280a',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::size_type()'],['../classentt_1_1basic__sparse__set.html#a6f41f1b0b70a30ee160cf2734bec448f',1,'entt::basic_sparse_set::size_type()'],['../classentt_1_1basic__storage.html#aa0e2c748f5a9f0a1a3fb7eb9d5fa8d83',1,'entt::basic_storage::size_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a67b50c6160f2ef1fc5ecbfaaad9c67f5',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a8a7e88587dbf957bc2d4b8b0592cee29',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a10af7cb14dfea9759c0a71fb197f74ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size_type()'],['../classentt_1_1meta__sequence__container.html#aa24e9df149bccfada6257266e5d829b1',1,'entt::meta_sequence_container::size_type()'],['../classentt_1_1meta__associative__container.html#a9ef078a3364ff3d53cec2bda15f4782f',1,'entt::meta_associative_container::size_type()'],['../structentt_1_1meta__data.html#ab322080e34d8e40621a67f2f0e0672b7',1,'entt::meta_data::size_type()'],['../structentt_1_1meta__func.html#aa35b75b107a0e02f7f03f0737980a428',1,'entt::meta_func::size_type()'],['../classentt_1_1meta__type.html#a9d7a45ed06b058813b928e2778499a5e',1,'entt::meta_type::size_type()'],['../classentt_1_1scheduler.html#afcec47d6ec28a994af2a7097348ce59f',1,'entt::scheduler::size_type()'],['../classentt_1_1resource__cache.html#af96dd3b16bdd0f1151b75786bdc0a2cb',1,'entt::resource_cache::size_type()'],['../classentt_1_1basic__dispatcher.html#a5be4fb80f4bb0055ffaf3b573a4681a6',1,'entt::basic_dispatcher::size_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4da86f239ecc0eddc6c5d99350fbe91',1,'entt::sigh< Ret(Args...), Allocator >::size_type()'],['../classentt_1_1dense__map.html#a38ef651a1992486e3d2151e7829777f1',1,'entt::dense_map::size_type()']]], + ['snapshot_455',['snapshot',['../namespaceentt.html#a80012f9fa628920a3507ae947704d447',1,'entt']]], + ['snapshot_5floader_456',['snapshot_loader',['../namespaceentt.html#ae7e50fc296c4ea68183db332950b99f5',1,'entt']]], + ['sort_457',['sort',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac69a43f81a8089909591f3739f93b760',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad3428f8d0a65d65365fa26ead2bb727d',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::sort()'],['../classentt_1_1basic__registry.html#a413fa9d1dbe15b8043358ea9cdba6ba1',1,'entt::basic_registry::sort(Compare compare, Sort algo=Sort{}, Args &&...args)'],['../classentt_1_1basic__registry.html#a2907f89b80fb692b16727e5e67a91c5d',1,'entt::basic_registry::sort()'],['../classentt_1_1basic__sparse__set.html#ae7ceed81905adc0d65291eb9f4072f08',1,'entt::basic_sparse_set::sort()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a982161711bb437ea1014b875e4f00422',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort()']]], + ['sort_5fn_458',['sort_n',['../classentt_1_1basic__sparse__set.html#a43c1c0aa0fa525e12cee0791cd945915',1,'entt::basic_sparse_set']]], + ['sortable_459',['sortable',['../classentt_1_1basic__registry.html#a0fcde0f4f2fd0d1cd6fef0c0078acdbc',1,'entt::basic_registry']]], + ['sparse_5fset_460',['sparse_set',['../namespaceentt.html#ac27c0013e504d544508cdacc01170b68',1,'entt']]], + ['std_5fsort_461',['std_sort',['../structentt_1_1std__sort.html',1,'entt']]], + ['storage_462',['storage',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage()'],['../classentt_1_1basic__registry.html#a9cce13121f0ba615c290a48dedff53ad',1,'entt::basic_registry::storage()'],['../classentt_1_1basic__registry.html#a71b8b9cf2ceccd12bdb84fc92349f85a',1,'entt::basic_registry::storage() const'],['../classentt_1_1basic__registry.html#a0c75448b09c552a37cae70467269b1e0',1,'entt::basic_registry::storage(const id_type id)'],['../classentt_1_1basic__registry.html#a808539348487eb249d64c8cdf7f0ada5',1,'entt::basic_registry::storage(const id_type id) const'],['../classentt_1_1basic__registry.html#a9ab204daf6990895532e5c25cd2880f3',1,'entt::basic_registry::storage(const id_type id=type_hash< std::remove_const_t< Component >>::value())'],['../classentt_1_1basic__registry.html#a39c7df751ab95f4023afc32cd99798cc',1,'entt::basic_registry::storage(const id_type id=type_hash< std::remove_const_t< Component >>::value()) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage()'],['../namespaceentt.html#abcedb8f29753130e2bf3185bca211f05',1,'entt::storage()']]], + ['storage_5ftraits_463',['storage_traits',['../structentt_1_1storage__traits.html',1,'entt']]], + ['storage_5ftype_464',['storage_type',['../structentt_1_1storage__traits.html#a7cda978d208a50c536ae96570d76bf8e',1,'entt::storage_traits']]], + ['succeed_465',['succeed',['../classentt_1_1process.html#a3b71fd166a1e6b42ea76f2e92bfa5edc',1,'entt::process']]], + ['swap_466',['swap',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa9fba3d3d4e6be85493982011d9f6d46',1,'entt::sigh< Ret(Args...), Allocator >::swap()'],['../classentt_1_1dense__map.html#ab88e2ffe045acc9aef1de4f77a23449b',1,'entt::dense_map::swap()'],['../classentt_1_1dense__set.html#a3eec96c16a044c4e687639177121e899',1,'entt::dense_set::swap()'],['../classentt_1_1basic__sparse__set.html#a0ba4866849ffb525cce7b4eee58b83a8',1,'entt::basic_sparse_set::swap()'],['../classentt_1_1compressed__pair.html#a1f153123bcde4947f020ea2459d76e45',1,'entt::compressed_pair::swap()'],['../classentt_1_1basic__storage.html#ac4b412a6f425771044b2c903afe97235',1,'entt::basic_storage::swap()'],['../classentt_1_1basic__dispatcher.html#a0588bf4eef21b89fc716ab7c0ad8ce01',1,'entt::basic_dispatcher::swap()'],['../namespaceentt.html#aef08fc4202f32f712bde26f55db463cb',1,'entt::swap()']]], + ['swap_5fand_5fpop_467',['swap_and_pop',['../classentt_1_1basic__sparse__set.html#a80b3de1b97d44ff6e9b2d4557da138c6',1,'entt::basic_sparse_set::swap_and_pop()'],['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581a8223d1ccb16b6dd0b19fe9c6fdb13708',1,'entt::swap_and_pop()'],['../classentt_1_1basic__storage.html#ae2f157f3fd68a192db771d06aee12bd5',1,'entt::basic_storage::swap_and_pop()']]], + ['swap_5felements_468',['swap_elements',['../classentt_1_1basic__sparse__set.html#a2b82af720eca37261f3230c654d7fe1f',1,'entt::basic_sparse_set']]] ]; diff --git a/search/all_11.js b/search/all_11.js index 97d53a169..dec34dbf3 100644 --- a/search/all_11.js +++ b/search/all_11.js @@ -1,53 +1,51 @@ var searchData= [ - ['tag_476',['tag',['../namespaceentt.html#a9f7bb8c357f08a01ad9c8dab0ea40c1c',1,'entt']]], - ['temp_477',['temp',['../classentt_1_1resource__cache.html#ad68eaab4f44691e76d128aaab4709d4f',1,'entt::resource_cache']]], - ['template_5farg_478',['template_arg',['../classentt_1_1meta__type.html#a0edd8f9efed70aa8a69b786d680fcc23',1,'entt::meta_type']]], - ['template_5farity_479',['template_arity',['../classentt_1_1meta__type.html#acf1cd27c37c4f52c1e2b720722be0c36',1,'entt::meta_type']]], - ['template_5ftype_480',['template_type',['../classentt_1_1meta__type.html#afd99912be885a6ad9b579596f5446286',1,'entt::meta_type']]], - ['tick_481',['tick',['../classentt_1_1process.html#aacc7fe0ef3265113079c70ff8cd9478d',1,'entt::process']]], - ['to_5faddress_482',['to_address',['../namespaceentt.html#a94ed50d1975e6adee73101eb05c88d73',1,'entt']]], - ['to_5fentity_483',['to_entity',['../namespaceentt.html#ae81b68364d770429f343d703f415d12a',1,'entt::to_entity(const basic_registry< Entity > &reg, const Component &instance)'],['../namespaceentt.html#ae1b0b05750caf25f9718c2bebf55d25c',1,'entt::to_entity(const Entity value)'],['../classentt_1_1entt__traits.html#a391b8de07d30bc1b9dd719b6886ddfe0',1,'entt::entt_traits::to_entity()']]], - ['to_5fintegral_484',['to_integral',['../namespaceentt.html#abd7521f3d3ca914ea5bd131269ba75aa',1,'entt::to_integral()'],['../classentt_1_1entt__traits.html#a3797423cba124a5d52a7fcd247b16842',1,'entt::entt_traits::to_integral(const value_type value)']]], - ['to_5fversion_485',['to_version',['../classentt_1_1entt__traits.html#aedb75689bab1bf13e99a8267662b7bc6',1,'entt::entt_traits::to_version()'],['../namespaceentt.html#ae7dc0f67afc2c0924dc2c0f51dcadadf',1,'entt::to_version(const Entity value)']]], - ['tombstone_486',['tombstone',['../namespaceentt.html#a674269102fdfe3fd6d7766210a828862',1,'entt']]], - ['tombstone_5ft_487',['tombstone_t',['../structentt_1_1tombstone__t.html',1,'entt']]], - ['top_5flevel_488',['top_level',['../structentt_1_1basic__organizer_1_1vertex.html#a33b714b2096db39c751734aea33ae949',1,'entt::basic_organizer::vertex']]], - ['trigger_489',['trigger',['../classentt_1_1dispatcher.html#a19e826de01548ef5181bf266c00b65df',1,'entt::dispatcher::trigger(Args &&...args)'],['../classentt_1_1dispatcher.html#a1d14234071d22c9fe09c453ebd818d2e',1,'entt::dispatcher::trigger(Event &&event)']]], - ['try_5fcast_490',['try_cast',['../classentt_1_1meta__any.html#aa545482520009cfd0b70c77269487213',1,'entt::meta_any::try_cast() const'],['../classentt_1_1meta__any.html#a92f9591ef0d0e8d146be79b2103efb33',1,'entt::meta_any::try_cast()']]], - ['try_5fctx_491',['try_ctx',['../classentt_1_1basic__registry.html#a8554b6cb789387d30ab3a42c26b06c72',1,'entt::basic_registry::try_ctx() const'],['../classentt_1_1basic__registry.html#ab25a060f43bbb5ce9aec1f7f5a698220',1,'entt::basic_registry::try_ctx()']]], - ['try_5femplace_492',['try_emplace',['../classentt_1_1dense__hash__map.html#add783d02674177a3c1e6dcd280f90437',1,'entt::dense_hash_map::try_emplace(const key_type &key, Args &&...args)'],['../classentt_1_1dense__hash__map.html#a5f353e2cf7f2e3a3b3c7d233ee04c5fc',1,'entt::dense_hash_map::try_emplace(key_type &&key, Args &&...args)'],['../classentt_1_1basic__sparse__set.html#ad2ffa27c249f22f503464d44df33271b',1,'entt::basic_sparse_set::try_emplace()'],['../classentt_1_1basic__storage.html#abe84d745f177cc703ce5e3f12ffdf64c',1,'entt::basic_storage::try_emplace()']]], - ['try_5fget_493',['try_get',['../structentt_1_1basic__handle.html#a51b5f344896763432c91008620678d46',1,'entt::basic_handle::try_get()'],['../classentt_1_1basic__registry.html#acc3f7f2d48549f2386b065988bc372b7',1,'entt::basic_registry::try_get([[maybe_unused]] const entity_type entity)'],['../classentt_1_1basic__registry.html#a9a01c958149b6c0d5b233a1a7c3c3bb3',1,'entt::basic_registry::try_get([[maybe_unused]] const entity_type entity) const']]], - ['tuple_5felement_3c_20index_2c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_494',['tuple_element< Index, entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], - ['tuple_5fsize_3c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_495',['tuple_size< entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], - ['type_496',['type',['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html#ac31754183e91b36738ecd41e291c521e',1,'entt::constness_as< To, const From >::type()'],['../classentt_1_1member__class.html#aa512dd4465bfab2dc09f759ae882a08a',1,'entt::member_class::type()'],['../classentt_1_1meta__function__helper.html#a74ea1aa3fe0edfad96898520cbf6eeae',1,'entt::meta_function_helper::type()'],['../classentt_1_1poly__vtable.html#a1114a981955e596da36603282cee2e4d',1,'entt::poly_vtable::type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ada5b094a0d859325dbe1241f3d956c02',1,'entt::delegate< Ret(Args...)>::type()'],['../classentt_1_1identifier.html#adb3aad553b8d57ef94581af39fc53178',1,'entt::identifier::type()'],['../classentt_1_1basic__any.html#a8cc9d2291706a0676e56fedce2b153fa',1,'entt::basic_any::type()'],['../classentt_1_1basic__sparse__set.html#ac560b393e391e11d203455a0c1ffc027',1,'entt::basic_sparse_set::type()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a4b02493f065b0b01d04f7256af06445e',1,'entt::meta_factory< Type >::type()'],['../classentt_1_1meta__any.html#a8bdf87354f140b2738e2f72d07af3350',1,'entt::meta_any::type()'],['../structentt_1_1meta__data.html#ad088d09cff4cea8b136d05a0d30049e6',1,'entt::meta_data::type()'],['../classentt_1_1basic__poly.html#aa745ccb8b2728d24dd88dccc9663a293',1,'entt::basic_poly::type()'],['../classentt_1_1family.html#ad2c16ecd854f12f1aa70ceaba094e43a',1,'entt::family::type()'],['../structentt_1_1type__identity.html#ae47a6cef2041ad7d82c8ecd6b97a8524',1,'entt::type_identity::type()'],['../structentt_1_1type__list.html#ad39ae8961200964418fef5090f44cd00',1,'entt::type_list::type()'],['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a9762bf53c4d223834d7ab7b0d9d66a3e',1,'entt::type_list_element< 0u, type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__cat_3_4.html#a957e88d5bc4c1cbf4a13fbddbe2e176f',1,'entt::type_list_cat<>::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#ae17db475954ad06eba24fd1eedba5f8b',1,'entt::type_list_cat< type_list< Type... >, type_list< Other... >, List... >::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html#a0c40287fad9d80f0532d80bf48f219ed',1,'entt::type_list_cat< type_list< Type... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a378823486aa4e4f288b1d73b2703c485',1,'entt::type_list_unique< type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html#a48245981f9818ca2601b9815cbfa5b79',1,'entt::type_list_unique< type_list<> >::type()'],['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html#a32f539337660ac18fe3c3461949fb0eb',1,'entt::type_list_diff< type_list< Type... >, type_list< Other... > >::type()'],['../structentt_1_1value__list.html#ae89d3f18fec9ab261e040bb4581001af',1,'entt::value_list::type()'],['../structentt_1_1value__list__cat_3_4.html#a7c88fc51906ef0549415cbb6b82190b4',1,'entt::value_list_cat<>::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#aeb78d396ce7f928fbd9c06803a1ce327',1,'entt::value_list_cat< value_list< Value... >, value_list< Other... >, List... >::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html#ad729ba83ae022614fa97930ae427b4ad',1,'entt::value_list_cat< value_list< Value... > >::type()'],['../structentt_1_1constness__as.html#aa6f690652abf564093112ca29f55af2e',1,'entt::constness_as::type()']]], - ['type_5fhash_497',['type_hash',['../structentt_1_1type__hash.html',1,'entt']]], - ['type_5fid_498',['type_id',['../classentt_1_1type__info.html#a5a705e7e31b06bb5eb2570dd505f4992',1,'entt::type_info::type_id()'],['../namespaceentt.html#a2e2dcd5e9e474d7ab0f2db24dae09dd5',1,'entt::type_id()']]], - ['type_5fidentity_499',['type_identity',['../structentt_1_1type__identity.html',1,'entt']]], - ['type_5fidentity_5ft_500',['type_identity_t',['../namespaceentt.html#a09f6bd6b4aebc03df720e7e69fdc6643',1,'entt']]], - ['type_5findex_501',['type_index',['../structentt_1_1type__index.html',1,'entt']]], - ['type_5finfo_502',['type_info',['../classentt_1_1type__info.html',1,'entt']]], - ['type_5flist_503',['type_list',['../structentt_1_1type__list.html',1,'entt']]], - ['type_5flist_3c_20type_2e_2e_2e_20_3e_504',['type_list< Type... >',['../structentt_1_1type__list.html',1,'entt']]], - ['type_5flist_5fcat_505',['type_list_cat',['../structentt_1_1type__list__cat.html',1,'entt']]], - ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_20_3e_506',['type_list_cat< type_list< Type... > >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_507',['type_list_cat< type_list< Type... >, type_list< Other... >, List... >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], - ['type_5flist_5fcat_3c_3e_508',['type_list_cat<>',['../structentt_1_1type__list__cat_3_4.html',1,'entt']]], - ['type_5flist_5fcat_5ft_509',['type_list_cat_t',['../namespaceentt.html#a546467a3662e9a915d5d519ad565e801',1,'entt']]], - ['type_5flist_5fcontains_510',['type_list_contains',['../structentt_1_1type__list__contains.html',1,'entt']]], - ['type_5flist_5fcontains_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20other_20_3e_511',['type_list_contains< type_list< Type... >, Other >',['../structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html',1,'entt']]], - ['type_5flist_5fcontains_5fv_512',['type_list_contains_v',['../namespaceentt.html#a988ce063936d499bf2d69406c391fd5c',1,'entt']]], - ['type_5flist_5fdiff_513',['type_list_diff',['../structentt_1_1type__list__diff.html',1,'entt']]], - ['type_5flist_5fdiff_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_514',['type_list_diff< type_list< Type... >, type_list< Other... > >',['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5fdiff_5ft_515',['type_list_diff_t',['../namespaceentt.html#af2992fc009cb3199b0ef9a86bed2285c',1,'entt']]], - ['type_5flist_5felement_516',['type_list_element',['../structentt_1_1type__list__element.html',1,'entt']]], - ['type_5flist_5felement_3c_200u_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_517',['type_list_element< 0u, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5felement_3c_20index_20_2d_201u_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_518',['type_list_element< Index - 1u, type_list< Other... > >',['../structentt_1_1type__list__element.html',1,'entt']]], - ['type_5flist_5felement_3c_20index_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_519',['type_list_element< Index, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5felement_5ft_520',['type_list_element_t',['../namespaceentt.html#ac839c1a03dba2436791d0056d6d0d1b6',1,'entt']]], - ['type_5flist_5funique_521',['type_list_unique',['../structentt_1_1type__list__unique.html',1,'entt']]], - ['type_5flist_5funique_3c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_522',['type_list_unique< type_list< Type, Other... > >',['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5funique_3c_20type_5flist_3c_3e_20_3e_523',['type_list_unique< type_list<> >',['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html',1,'entt']]], - ['type_5flist_5funique_5ft_524',['type_list_unique_t',['../namespaceentt.html#a75a277a6037279d65cd3874b46ec7166',1,'entt']]], - ['type_5fname_525',['type_name',['../structentt_1_1type__name.html',1,'entt']]] + ['tag_469',['tag',['../namespaceentt.html#a9f7bb8c357f08a01ad9c8dab0ea40c1c',1,'entt']]], + ['template_5farg_470',['template_arg',['../classentt_1_1meta__type.html#a0edd8f9efed70aa8a69b786d680fcc23',1,'entt::meta_type']]], + ['template_5farity_471',['template_arity',['../classentt_1_1meta__type.html#acf1cd27c37c4f52c1e2b720722be0c36',1,'entt::meta_type']]], + ['template_5ftype_472',['template_type',['../classentt_1_1meta__type.html#afd99912be885a6ad9b579596f5446286',1,'entt::meta_type']]], + ['tick_473',['tick',['../classentt_1_1process.html#aacc7fe0ef3265113079c70ff8cd9478d',1,'entt::process']]], + ['to_5faddress_474',['to_address',['../namespaceentt.html#a94ed50d1975e6adee73101eb05c88d73',1,'entt']]], + ['to_5fentity_475',['to_entity',['../classentt_1_1entt__traits.html#a391b8de07d30bc1b9dd719b6886ddfe0',1,'entt::entt_traits::to_entity()'],['../namespaceentt.html#ae1b0b05750caf25f9718c2bebf55d25c',1,'entt::to_entity(const Entity value)'],['../namespaceentt.html#ae81b68364d770429f343d703f415d12a',1,'entt::to_entity(const basic_registry< Entity > &reg, const Component &instance)']]], + ['to_5fintegral_476',['to_integral',['../classentt_1_1entt__traits.html#a3797423cba124a5d52a7fcd247b16842',1,'entt::entt_traits::to_integral()'],['../namespaceentt.html#abd7521f3d3ca914ea5bd131269ba75aa',1,'entt::to_integral()']]], + ['to_5fversion_477',['to_version',['../classentt_1_1entt__traits.html#aedb75689bab1bf13e99a8267662b7bc6',1,'entt::entt_traits::to_version()'],['../namespaceentt.html#ae7dc0f67afc2c0924dc2c0f51dcadadf',1,'entt::to_version(const Entity value)']]], + ['tombstone_478',['tombstone',['../namespaceentt.html#a674269102fdfe3fd6d7766210a828862',1,'entt']]], + ['tombstone_5ft_479',['tombstone_t',['../structentt_1_1tombstone__t.html',1,'entt']]], + ['top_5flevel_480',['top_level',['../structentt_1_1basic__organizer_1_1vertex.html#a33b714b2096db39c751734aea33ae949',1,'entt::basic_organizer::vertex']]], + ['trigger_481',['trigger',['../classentt_1_1basic__dispatcher.html#a825b9fe2ade4f96d7777f87c56177196',1,'entt::basic_dispatcher::trigger(Event &&event={})'],['../classentt_1_1basic__dispatcher.html#aff29187083d0d045b5ddb7a241970b6a',1,'entt::basic_dispatcher::trigger(const id_type id, Event &&event={})']]], + ['try_5fcast_482',['try_cast',['../classentt_1_1meta__any.html#aa545482520009cfd0b70c77269487213',1,'entt::meta_any::try_cast() const'],['../classentt_1_1meta__any.html#a92f9591ef0d0e8d146be79b2103efb33',1,'entt::meta_any::try_cast()']]], + ['try_5femplace_483',['try_emplace',['../classentt_1_1dense__map.html#abd1ecd879ab8c9ecf644c4c23a925d4a',1,'entt::dense_map::try_emplace(const key_type &key, Args &&...args)'],['../classentt_1_1dense__map.html#a447b045d0c6bf772a72b4d8e0068033b',1,'entt::dense_map::try_emplace(key_type &&key, Args &&...args)'],['../classentt_1_1basic__sparse__set.html#a1c62d9615acde55f57fcca92e44c747c',1,'entt::basic_sparse_set::try_emplace()'],['../classentt_1_1basic__storage.html#a409ebd1c259f1c55d3f6d928247b6210',1,'entt::basic_storage::try_emplace()']]], + ['try_5fget_484',['try_get',['../structentt_1_1basic__handle.html#a51b5f344896763432c91008620678d46',1,'entt::basic_handle::try_get()'],['../classentt_1_1basic__registry.html#a9a01c958149b6c0d5b233a1a7c3c3bb3',1,'entt::basic_registry::try_get([[maybe_unused]] const entity_type entity) const'],['../classentt_1_1basic__registry.html#acc3f7f2d48549f2386b065988bc372b7',1,'entt::basic_registry::try_get([[maybe_unused]] const entity_type entity)']]], + ['tuple_5felement_3c_20index_2c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_485',['tuple_element< Index, entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], + ['tuple_5fsize_3c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_486',['tuple_size< entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], + ['type_487',['type',['../structentt_1_1constness__as.html#aa6f690652abf564093112ca29f55af2e',1,'entt::constness_as::type()'],['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html#ac31754183e91b36738ecd41e291c521e',1,'entt::constness_as< To, const From >::type()'],['../classentt_1_1member__class.html#aa512dd4465bfab2dc09f759ae882a08a',1,'entt::member_class::type()'],['../structentt_1_1locator.html#aa1b4b856f4d36f39bbbecfd79cb380ee',1,'entt::locator::type()'],['../classentt_1_1meta__function__helper.html#a74ea1aa3fe0edfad96898520cbf6eeae',1,'entt::meta_function_helper::type()'],['../classentt_1_1poly__vtable.html#a1114a981955e596da36603282cee2e4d',1,'entt::poly_vtable::type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ada5b094a0d859325dbe1241f3d956c02',1,'entt::delegate< Ret(Args...)>::type()'],['../classentt_1_1family.html#ad2c16ecd854f12f1aa70ceaba094e43a',1,'entt::family::type()'],['../structentt_1_1type__identity.html#ae47a6cef2041ad7d82c8ecd6b97a8524',1,'entt::type_identity::type()'],['../classentt_1_1basic__any.html#a8cc9d2291706a0676e56fedce2b153fa',1,'entt::basic_any::type()'],['../classentt_1_1basic__sparse__set.html#ac560b393e391e11d203455a0c1ffc027',1,'entt::basic_sparse_set::type()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a4b02493f065b0b01d04f7256af06445e',1,'entt::meta_factory< Type >::type()'],['../classentt_1_1meta__any.html#a8bdf87354f140b2738e2f72d07af3350',1,'entt::meta_any::type()'],['../structentt_1_1meta__data.html#ad088d09cff4cea8b136d05a0d30049e6',1,'entt::meta_data::type()'],['../classentt_1_1basic__poly.html#aa745ccb8b2728d24dd88dccc9663a293',1,'entt::basic_poly::type()'],['../classentt_1_1identifier.html#adb3aad553b8d57ef94581af39fc53178',1,'entt::identifier::type()'],['../structentt_1_1type__list.html#ad39ae8961200964418fef5090f44cd00',1,'entt::type_list::type()'],['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a9762bf53c4d223834d7ab7b0d9d66a3e',1,'entt::type_list_element< 0u, type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__cat_3_4.html#a957e88d5bc4c1cbf4a13fbddbe2e176f',1,'entt::type_list_cat<>::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#ae17db475954ad06eba24fd1eedba5f8b',1,'entt::type_list_cat< type_list< Type... >, type_list< Other... >, List... >::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html#a0c40287fad9d80f0532d80bf48f219ed',1,'entt::type_list_cat< type_list< Type... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a9fbc6208d17e2bb1ab89e4fa87b9e077',1,'entt::type_list_unique< type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html#a48245981f9818ca2601b9815cbfa5b79',1,'entt::type_list_unique< type_list<> >::type()'],['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html#a32f539337660ac18fe3c3461949fb0eb',1,'entt::type_list_diff< type_list< Type... >, type_list< Other... > >::type()'],['../structentt_1_1value__list.html#ae89d3f18fec9ab261e040bb4581001af',1,'entt::value_list::type()'],['../structentt_1_1value__list__cat_3_4.html#a7c88fc51906ef0549415cbb6b82190b4',1,'entt::value_list_cat<>::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#aeb78d396ce7f928fbd9c06803a1ce327',1,'entt::value_list_cat< value_list< Value... >, value_list< Other... >, List... >::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html#ad729ba83ae022614fa97930ae427b4ad',1,'entt::value_list_cat< value_list< Value... > >::type()']]], + ['type_5fhash_488',['type_hash',['../structentt_1_1type__hash.html',1,'entt']]], + ['type_5fid_489',['type_id',['../namespaceentt.html#a2e2dcd5e9e474d7ab0f2db24dae09dd5',1,'entt::type_id()'],['../namespaceentt.html#ad6ef63a4532530a8a2fcfa61df68f6e5',1,'entt::type_id(Type &&)']]], + ['type_5fidentity_490',['type_identity',['../structentt_1_1type__identity.html',1,'entt']]], + ['type_5fidentity_5ft_491',['type_identity_t',['../namespaceentt.html#a09f6bd6b4aebc03df720e7e69fdc6643',1,'entt']]], + ['type_5findex_492',['type_index',['../structentt_1_1type__index.html',1,'entt']]], + ['type_5finfo_493',['type_info',['../structentt_1_1type__info.html',1,'entt::type_info'],['../structentt_1_1type__info.html#a4e6870bc5adf4ec30d92dc77dd5d8ca6',1,'entt::type_info::type_info()']]], + ['type_5flist_494',['type_list',['../structentt_1_1type__list.html',1,'entt']]], + ['type_5flist_3c_20type_2e_2e_2e_20_3e_495',['type_list< Type... >',['../structentt_1_1type__list.html',1,'entt']]], + ['type_5flist_5fcat_496',['type_list_cat',['../structentt_1_1type__list__cat.html',1,'entt']]], + ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_20_3e_497',['type_list_cat< type_list< Type... > >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_498',['type_list_cat< type_list< Type... >, type_list< Other... >, List... >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], + ['type_5flist_5fcat_3c_3e_499',['type_list_cat<>',['../structentt_1_1type__list__cat_3_4.html',1,'entt']]], + ['type_5flist_5fcat_5ft_500',['type_list_cat_t',['../namespaceentt.html#a546467a3662e9a915d5d519ad565e801',1,'entt']]], + ['type_5flist_5fcontains_501',['type_list_contains',['../structentt_1_1type__list__contains.html',1,'entt']]], + ['type_5flist_5fcontains_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20other_20_3e_502',['type_list_contains< type_list< Type... >, Other >',['../structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html',1,'entt']]], + ['type_5flist_5fcontains_5fv_503',['type_list_contains_v',['../namespaceentt.html#a988ce063936d499bf2d69406c391fd5c',1,'entt']]], + ['type_5flist_5fdiff_504',['type_list_diff',['../structentt_1_1type__list__diff.html',1,'entt']]], + ['type_5flist_5fdiff_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_505',['type_list_diff< type_list< Type... >, type_list< Other... > >',['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5fdiff_5ft_506',['type_list_diff_t',['../namespaceentt.html#af2992fc009cb3199b0ef9a86bed2285c',1,'entt']]], + ['type_5flist_5felement_507',['type_list_element',['../structentt_1_1type__list__element.html',1,'entt']]], + ['type_5flist_5felement_3c_200u_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_508',['type_list_element< 0u, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5felement_3c_20index_20_2d_201u_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_509',['type_list_element< Index - 1u, type_list< Other... > >',['../structentt_1_1type__list__element.html',1,'entt']]], + ['type_5flist_5felement_3c_20index_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_510',['type_list_element< Index, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5felement_5ft_511',['type_list_element_t',['../namespaceentt.html#ac839c1a03dba2436791d0056d6d0d1b6',1,'entt']]], + ['type_5flist_5funique_512',['type_list_unique',['../structentt_1_1type__list__unique.html',1,'entt']]], + ['type_5flist_5funique_3c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_513',['type_list_unique< type_list< Type, Other... > >',['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5funique_3c_20type_5flist_3c_3e_20_3e_514',['type_list_unique< type_list<> >',['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html',1,'entt']]], + ['type_5flist_5funique_5ft_515',['type_list_unique_t',['../namespaceentt.html#a75a277a6037279d65cd3874b46ec7166',1,'entt']]], + ['type_5fname_516',['type_name',['../structentt_1_1type__name.html',1,'entt']]] ]; diff --git a/search/all_12.js b/search/all_12.js index 86a9821da..593f93445 100644 --- a/search/all_12.js +++ b/search/all_12.js @@ -1,11 +1,12 @@ var searchData= [ - ['unpack_5fas_5ftype_526',['unpack_as_type',['../namespaceentt.html#ae62c84ccab78132ef356b13e4ff12dfa',1,'entt']]], - ['unpack_5fas_5fvalue_527',['unpack_as_value',['../namespaceentt.html#aee7558c4e09ee416fb7fa3576737ff65',1,'entt']]], - ['unpause_528',['unpause',['../classentt_1_1process.html#a828dd9665380d1ac41b7c14367e51835',1,'entt::process']]], - ['unset_529',['unset',['../classentt_1_1basic__registry.html#aaa23b74e76b1749bb510a86e9d31b9cd',1,'entt::basic_registry']]], - ['unwrap_5ftuple_530',['unwrap_tuple',['../namespaceentt.html#a29ad46972bf4848e06a728c232b94bf0',1,'entt']]], - ['update_531',['update',['../structentt_1_1basic__collector_3_4.html#af84fbd53436ec60b1e158b3d685a91d9',1,'entt::basic_collector<>::update()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac8bd4af93eec6631c6b3a56353d8b615',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::update()'],['../structentt_1_1process__adaptor.html#a7514fabbbda491742872bc0e52dde5c2',1,'entt::process_adaptor::update()'],['../classentt_1_1scheduler.html#a827eae426378df9ed9190752156a4154',1,'entt::scheduler::update()'],['../classentt_1_1dispatcher.html#aabed6fd7fa4027dcfa3afc7bc20f2784',1,'entt::dispatcher::update()'],['../classentt_1_1dispatcher.html#ae15c11634047d7718db5e2e30675c80c',1,'entt::dispatcher::update() const']]], - ['use_532',['use',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const']]], - ['use_5fcount_533',['use_count',['../classentt_1_1resource__handle.html#a47f319eeef51a7d1745961f2dc2ea331',1,'entt::resource_handle']]] + ['uninitialized_5fconstruct_5fusing_5fallocator_517',['uninitialized_construct_using_allocator',['../namespaceentt.html#a62b604f9b3045c7f380e86738d8623a9',1,'entt']]], + ['unpack_5fas_5ftype_518',['unpack_as_type',['../namespaceentt.html#ae62c84ccab78132ef356b13e4ff12dfa',1,'entt']]], + ['unpack_5fas_5fvalue_519',['unpack_as_value',['../namespaceentt.html#aee7558c4e09ee416fb7fa3576737ff65',1,'entt']]], + ['unpause_520',['unpause',['../classentt_1_1process.html#a828dd9665380d1ac41b7c14367e51835',1,'entt::process']]], + ['unwrap_5ftuple_521',['unwrap_tuple',['../namespaceentt.html#a29ad46972bf4848e06a728c232b94bf0',1,'entt']]], + ['update_522',['update',['../structentt_1_1basic__collector_3_4.html#af84fbd53436ec60b1e158b3d685a91d9',1,'entt::basic_collector<>::update()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac8bd4af93eec6631c6b3a56353d8b615',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::update()'],['../structentt_1_1process__adaptor.html#a7514fabbbda491742872bc0e52dde5c2',1,'entt::process_adaptor::update()'],['../classentt_1_1scheduler.html#a827eae426378df9ed9190752156a4154',1,'entt::scheduler::update()'],['../classentt_1_1basic__dispatcher.html#a8726412224a319104b2312aeec6c5b4f',1,'entt::basic_dispatcher::update(const id_type id=type_hash< Event >::value())'],['../classentt_1_1basic__dispatcher.html#a34b8c43b1d00707b09e9ea8cd53ff3fd',1,'entt::basic_dispatcher::update() const']]], + ['use_523',['use',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const']]], + ['use_5fcount_524',['use_count',['../classentt_1_1resource.html#a1bdea2c6634e42d5d0120cd5ae0ddfeb',1,'entt::resource']]], + ['uses_5fallocator_5fconstruction_5fargs_525',['uses_allocator_construction_args',['../namespaceentt.html#ace7e8d47071e1556a9ce83772468215e',1,'entt']]] ]; diff --git a/search/all_13.js b/search/all_13.js index dbf8dec2c..8b5e3a27d 100644 --- a/search/all_13.js +++ b/search/all_13.js @@ -1,22 +1,23 @@ var searchData= [ - ['valid_534',['valid',['../structentt_1_1basic__handle.html#aaa6afd3aa7fc2b92a02da90576a7af1e',1,'entt::basic_handle::valid()'],['../classentt_1_1basic__registry.html#a1795b1221d728f806319a685930f520d',1,'entt::basic_registry::valid()']]], - ['value_535',['value',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html#a7525593fea1bece0b7e43d2ea7a69411',1,'entt::value_list_element< 0u, value_list< Value, Other... > >::value()'],['../classentt_1_1basic__hashed__string.html#ac592a42bf7488cbecc5a1dd74efc0815',1,'entt::basic_hashed_string::value(const value_type *str, std::size_t size)'],['../classentt_1_1basic__hashed__string.html#a63725144b0b9af67e9965ab0a60c5862',1,'entt::basic_hashed_string::value(const value_type(&str)[N])'],['../classentt_1_1basic__hashed__string.html#a224b0f2486381e536b627bbde4de7c87',1,'entt::basic_hashed_string::value(const_wrapper wrapper)'],['../classentt_1_1basic__hashed__string.html#a40f85633eba5321389c5ceea4d19cebc',1,'entt::basic_hashed_string::value() const'],['../structentt_1_1type__index.html#ae35199e5bea69f748cef1866e52b5dc4',1,'entt::type_index::value()'],['../structentt_1_1type__hash.html#a95f5ae709a95f0959a7dfd1af6af6c74',1,'entt::type_hash::value()'],['../structentt_1_1type__name.html#a053ef91f965558bdf95dc2fbb3fc550b',1,'entt::type_name::value()'],['../structentt_1_1meta__prop.html#a82a1d1796e873be7ba0c9fb539ec22ef',1,'entt::meta_prop::value()']]], - ['value_5flist_536',['value_list',['../structentt_1_1value__list.html',1,'entt']]], - ['value_5flist_5fcat_537',['value_list_cat',['../structentt_1_1value__list__cat.html',1,'entt']]], - ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_20_3e_538',['value_list_cat< value_list< Value... > >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html',1,'entt']]], - ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_539',['value_list_cat< value_list< Value... >, value_list< Other... >, List... >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], - ['value_5flist_5fcat_3c_3e_540',['value_list_cat<>',['../structentt_1_1value__list__cat_3_4.html',1,'entt']]], - ['value_5flist_5fcat_5ft_541',['value_list_cat_t',['../namespaceentt.html#a1344cc62598091397018354e6905e431',1,'entt']]], - ['value_5flist_5felement_542',['value_list_element',['../structentt_1_1value__list__element.html',1,'entt']]], - ['value_5flist_5felement_3c_200u_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_543',['value_list_element< 0u, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['value_5flist_5felement_3c_20index_20_2d_201u_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_544',['value_list_element< Index - 1u, value_list< Other... > >',['../structentt_1_1value__list__element.html',1,'entt']]], - ['value_5flist_5felement_3c_20index_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_545',['value_list_element< Index, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['value_5flist_5felement_5fv_546',['value_list_element_v',['../namespaceentt.html#a4bbfb162708696f9c1497d61573b540f',1,'entt']]], - ['value_5ftype_547',['value_type',['../classentt_1_1dense__hash__set.html#a0513eb464767aa43cea5a715caa79a68',1,'entt::dense_hash_set::value_type()'],['../classentt_1_1basic__hashed__string.html#ad4e8f181e92b9218747ac43fe24c4cbc',1,'entt::basic_hashed_string::value_type()'],['../structentt_1_1iterable__adaptor.html#a5f2efe4d02ffa42b11ecd1bdf8bee6b0',1,'entt::iterable_adaptor::value_type()'],['../classentt_1_1entt__traits.html#a9898ec0342dfd6bdb937981e15e5fd65',1,'entt::entt_traits::value_type()'],['../classentt_1_1basic__storage.html#afad8274fbdff981737a962b375bd0d99',1,'entt::basic_storage::value_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a383edde6d3e4f797a24e446591d1a6d6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::value_type()'],['../classentt_1_1sigh__storage__mixin.html#a0e2d25bd7c3072ffacab6fbed19e05bf',1,'entt::sigh_storage_mixin::value_type()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a452e7367da253653f8a5e3a4c9d4f155',1,'entt::meta_sequence_container::meta_iterator::value_type()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#aedcf370f9d9d6666bbdebb0cb9883069',1,'entt::meta_associative_container::meta_iterator::value_type()'],['../classentt_1_1meta__sequence__container.html#a646230dd7877a61ea1d29126831830cf',1,'entt::meta_sequence_container::value_type()'],['../classentt_1_1meta__associative__container.html#a281330b84e3598834f62d72ae0174b69',1,'entt::meta_associative_container::value_type()'],['../classentt_1_1dense__hash__map.html#a64702376e2b40cf1ed53deb0c935ec7a',1,'entt::dense_hash_map::value_type()']]], - ['version_5ftype_548',['version_type',['../structentt_1_1basic__handle.html#aa6d8a9ac22ff96212d1a68deb63cac52',1,'entt::basic_handle::version_type()'],['../classentt_1_1basic__registry.html#a7f947b73e9c883ecf89af298eaefe7c1',1,'entt::basic_registry::version_type()'],['../classentt_1_1basic__sparse__set.html#a909de63f5d8a3fdc9fb1e0b6b70636d9',1,'entt::basic_sparse_set::version_type()'],['../classentt_1_1entt__traits.html#ad44954f9ad1b9a20bf997b9a8ba33c3a',1,'entt::entt_traits::version_type()']]], - ['vertex_549',['vertex',['../structentt_1_1basic__organizer_1_1vertex.html',1,'entt::basic_organizer< Entity >::vertex'],['../structentt_1_1basic__organizer_1_1vertex.html#aa0c8053ba7636d0dd6d6f211b922eba9',1,'entt::basic_organizer::vertex::vertex()']]], - ['view_550',['view',['../classentt_1_1basic__registry.html#aa50c2d25f9b9c7108ced52534e10d9d0',1,'entt::basic_registry::view(exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#a5a7b8466273429c44efdba1ada88afc1',1,'entt::basic_registry::view(exclude_t< Exclude... >={})'],['../namespaceentt.html#a87b7ba6bd51a290113765bc97188d247',1,'entt::view()']]], - ['visit_551',['visit',['../structentt_1_1basic__handle.html#a266813a96b5f9fcd92f0f45d775d3e25',1,'entt::basic_handle']]], - ['vtable_5ftype_552',['vtable_type',['../classentt_1_1basic__poly.html#abf0092d4a0a8976a742ff76a68851054',1,'entt::basic_poly']]] + ['valid_526',['valid',['../structentt_1_1basic__handle.html#aaa6afd3aa7fc2b92a02da90576a7af1e',1,'entt::basic_handle::valid()'],['../classentt_1_1basic__registry.html#a1795b1221d728f806319a685930f520d',1,'entt::basic_registry::valid()']]], + ['value_527',['value',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html#a7525593fea1bece0b7e43d2ea7a69411',1,'entt::value_list_element< 0u, value_list< Value, Other... > >::value()'],['../classentt_1_1basic__hashed__string.html#a508fdeb2af222f74dfffedffb8a18db0',1,'entt::basic_hashed_string::value(const value_type *str, const size_type len)'],['../classentt_1_1basic__hashed__string.html#a63725144b0b9af67e9965ab0a60c5862',1,'entt::basic_hashed_string::value(const value_type(&str)[N])'],['../classentt_1_1basic__hashed__string.html#a2524b59bd7e665f19751bfa3f415fb7f',1,'entt::basic_hashed_string::value(const_wrapper wrapper)'],['../classentt_1_1basic__hashed__string.html#a40f85633eba5321389c5ceea4d19cebc',1,'entt::basic_hashed_string::value() const'],['../structentt_1_1type__index.html#ae35199e5bea69f748cef1866e52b5dc4',1,'entt::type_index::value()'],['../structentt_1_1type__hash.html#a95f5ae709a95f0959a7dfd1af6af6c74',1,'entt::type_hash::value()'],['../structentt_1_1type__name.html#a053ef91f965558bdf95dc2fbb3fc550b',1,'entt::type_name::value()'],['../structentt_1_1locator.html#a22699e0d2a72b24d942e4937b001e0f8',1,'entt::locator::value()'],['../structentt_1_1meta__prop.html#a82a1d1796e873be7ba0c9fb539ec22ef',1,'entt::meta_prop::value()']]], + ['value_5flist_528',['value_list',['../structentt_1_1value__list.html',1,'entt']]], + ['value_5flist_5fcat_529',['value_list_cat',['../structentt_1_1value__list__cat.html',1,'entt']]], + ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_20_3e_530',['value_list_cat< value_list< Value... > >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html',1,'entt']]], + ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_531',['value_list_cat< value_list< Value... >, value_list< Other... >, List... >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], + ['value_5flist_5fcat_3c_3e_532',['value_list_cat<>',['../structentt_1_1value__list__cat_3_4.html',1,'entt']]], + ['value_5flist_5fcat_5ft_533',['value_list_cat_t',['../namespaceentt.html#a1344cc62598091397018354e6905e431',1,'entt']]], + ['value_5flist_5felement_534',['value_list_element',['../structentt_1_1value__list__element.html',1,'entt']]], + ['value_5flist_5felement_3c_200u_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_535',['value_list_element< 0u, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['value_5flist_5felement_3c_20index_20_2d_201u_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_536',['value_list_element< Index - 1u, value_list< Other... > >',['../structentt_1_1value__list__element.html',1,'entt']]], + ['value_5flist_5felement_3c_20index_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_537',['value_list_element< Index, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['value_5flist_5felement_5fv_538',['value_list_element_v',['../namespaceentt.html#a4bbfb162708696f9c1497d61573b540f',1,'entt']]], + ['value_5for_539',['value_or',['../structentt_1_1locator.html#a8948b6cc1b6f3446a26391c0025d1777',1,'entt::locator']]], + ['value_5ftype_540',['value_type',['../classentt_1_1dense__set.html#a42092d77add471a91a60b0aebd515829',1,'entt::dense_set::value_type()'],['../classentt_1_1basic__hashed__string.html#a0fa6c444b2d97cc14506cc509daef9b0',1,'entt::basic_hashed_string::value_type()'],['../structentt_1_1iterable__adaptor.html#adbde706b5ce0286d8e3fd6e71be12720',1,'entt::iterable_adaptor::value_type()'],['../classentt_1_1entt__traits.html#a9898ec0342dfd6bdb937981e15e5fd65',1,'entt::entt_traits::value_type()'],['../classentt_1_1basic__storage.html#afad8274fbdff981737a962b375bd0d99',1,'entt::basic_storage::value_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a383edde6d3e4f797a24e446591d1a6d6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::value_type()'],['../classentt_1_1resource__cache.html#a7405d91504b5793f260a93695f6cdee4',1,'entt::resource_cache::value_type()'],['../classentt_1_1meta__sequence__container.html#a646230dd7877a61ea1d29126831830cf',1,'entt::meta_sequence_container::value_type()'],['../classentt_1_1meta__associative__container.html#a281330b84e3598834f62d72ae0174b69',1,'entt::meta_associative_container::value_type()'],['../classentt_1_1dense__map.html#aa53501af8bfd66b6bf45e8cfa844e180',1,'entt::dense_map::value_type()']]], + ['version_5ftype_541',['version_type',['../classentt_1_1entt__traits.html#ad44954f9ad1b9a20bf997b9a8ba33c3a',1,'entt::entt_traits::version_type()'],['../structentt_1_1basic__handle.html#aa6d8a9ac22ff96212d1a68deb63cac52',1,'entt::basic_handle::version_type()'],['../classentt_1_1basic__registry.html#a7f947b73e9c883ecf89af298eaefe7c1',1,'entt::basic_registry::version_type()'],['../classentt_1_1basic__sparse__set.html#a909de63f5d8a3fdc9fb1e0b6b70636d9',1,'entt::basic_sparse_set::version_type()']]], + ['vertex_542',['vertex',['../structentt_1_1basic__organizer_1_1vertex.html',1,'entt::basic_organizer< Entity >::vertex'],['../structentt_1_1basic__organizer_1_1vertex.html#aa0c8053ba7636d0dd6d6f211b922eba9',1,'entt::basic_organizer::vertex::vertex()']]], + ['view_543',['view',['../classentt_1_1basic__registry.html#a28b6a0c2de593eaf6aee6c3b445e64a1',1,'entt::basic_registry::view(exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#a5e25dbc5db101ef2574c15432365b94d',1,'entt::basic_registry::view(exclude_t< Exclude... >={})'],['../namespaceentt.html#a87b7ba6bd51a290113765bc97188d247',1,'entt::view()']]], + ['visit_544',['visit',['../structentt_1_1basic__handle.html#a266813a96b5f9fcd92f0f45d775d3e25',1,'entt::basic_handle']]], + ['vtable_5ftype_545',['vtable_type',['../classentt_1_1basic__poly.html#abf0092d4a0a8976a742ff76a68851054',1,'entt::basic_poly']]] ]; diff --git a/search/all_14.js b/search/all_14.js index 8eecba31c..7fa135118 100644 --- a/search/all_14.js +++ b/search/all_14.js @@ -1,4 +1,4 @@ var searchData= [ - ['where_553',['where',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a21c361071415791fd940201a685b938e',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] + ['where_546',['where',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a21c361071415791fd940201a685b938e',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] ]; diff --git a/search/all_15.js b/search/all_15.js index 259939064..b680738fb 100644 --- a/search/all_15.js +++ b/search/all_15.js @@ -1,4 +1,4 @@ var searchData= [ - ['y_5fcombinator_554',['y_combinator',['../structentt_1_1y__combinator.html',1,'entt::y_combinator< Func >'],['../structentt_1_1y__combinator.html#a3ef9b5550c3de06bed6297ae3b79815f',1,'entt::y_combinator::y_combinator()']]] + ['y_5fcombinator_547',['y_combinator',['../structentt_1_1y__combinator.html',1,'entt::y_combinator< Func >'],['../structentt_1_1y__combinator.html#a3ef9b5550c3de06bed6297ae3b79815f',1,'entt::y_combinator::y_combinator()']]] ]; diff --git a/search/all_16.js b/search/all_16.js index 796342982..ed7a5ec47 100644 --- a/search/all_16.js +++ b/search/all_16.js @@ -1,14 +1,12 @@ var searchData= [ - ['_7ebasic_5fany_555',['~basic_any',['../classentt_1_1basic__any.html#ab103382955f577cd8a714c7b5b89d9c6',1,'entt::basic_any']]], - ['_7ebasic_5fobserver_556',['~basic_observer',['../classentt_1_1basic__observer.html#afb6fbd2a5ce7bc57013b0bd9ad482599',1,'entt::basic_observer']]], - ['_7ebasic_5fsparse_5fset_557',['~basic_sparse_set',['../classentt_1_1basic__sparse__set.html#ac56f048f614c38f14b19ba9cb27faa94',1,'entt::basic_sparse_set']]], - ['_7ebasic_5fstorage_558',['~basic_storage',['../classentt_1_1basic__storage.html#aefce30bb9922e977dcf76577ea739f3a',1,'entt::basic_storage']]], - ['_7edense_5fhash_5fmap_559',['~dense_hash_map',['../classentt_1_1dense__hash__map.html#afe433812c8b1395b47133bde9c9a19f8',1,'entt::dense_hash_map']]], - ['_7edense_5fhash_5fset_560',['~dense_hash_set',['../classentt_1_1dense__hash__set.html#a17d3d73a20b4bebe1cfcc8e4c974b3a1',1,'entt::dense_hash_set']]], - ['_7eemitter_561',['~emitter',['../classentt_1_1emitter.html#af3d352c547768be34f03f0fbfdd30b43',1,'entt::emitter']]], - ['_7emeta_5fany_562',['~meta_any',['../classentt_1_1meta__any.html#a816dae3d4ed3e41fcb376ec5ec9c38c1',1,'entt::meta_any']]], - ['_7eprocess_563',['~process',['../classentt_1_1process.html#a2baf1b6aef37c1420a77cd3f8eadcf79',1,'entt::process']]], - ['_7escoped_5fconnection_564',['~scoped_connection',['../structentt_1_1scoped__connection.html#a8bc8b8630e2ad076216b6aca416ce32c',1,'entt::scoped_connection']]], - ['_7eservice_5flocator_565',['~service_locator',['../structentt_1_1service__locator.html#a2cbb6cfc1614067ae92f1c60580236a8',1,'entt::service_locator']]] + ['_7ebasic_5fany_548',['~basic_any',['../classentt_1_1basic__any.html#ab103382955f577cd8a714c7b5b89d9c6',1,'entt::basic_any']]], + ['_7ebasic_5fobserver_549',['~basic_observer',['../classentt_1_1basic__observer.html#afb6fbd2a5ce7bc57013b0bd9ad482599',1,'entt::basic_observer']]], + ['_7ebasic_5fsparse_5fset_550',['~basic_sparse_set',['../classentt_1_1basic__sparse__set.html#ac56f048f614c38f14b19ba9cb27faa94',1,'entt::basic_sparse_set']]], + ['_7ebasic_5fstorage_551',['~basic_storage',['../classentt_1_1basic__storage.html#aefce30bb9922e977dcf76577ea739f3a',1,'entt::basic_storage']]], + ['_7eemitter_552',['~emitter',['../classentt_1_1emitter.html#af3d352c547768be34f03f0fbfdd30b43',1,'entt::emitter']]], + ['_7elocator_553',['~locator',['../structentt_1_1locator.html#a9f224d476bcb081004089f419a1ddde5',1,'entt::locator']]], + ['_7emeta_5fany_554',['~meta_any',['../classentt_1_1meta__any.html#a816dae3d4ed3e41fcb376ec5ec9c38c1',1,'entt::meta_any']]], + ['_7eprocess_555',['~process',['../classentt_1_1process.html#a2baf1b6aef37c1420a77cd3f8eadcf79',1,'entt::process']]], + ['_7escoped_5fconnection_556',['~scoped_connection',['../structentt_1_1scoped__connection.html#a8bc8b8630e2ad076216b6aca416ce32c',1,'entt::scoped_connection']]] ]; diff --git a/search/all_2.js b/search/all_2.js index 714bc620e..f20415939 100644 --- a/search/all_2.js +++ b/search/all_2.js @@ -1,61 +1,63 @@ var searchData= [ - ['callback_64',['callback',['../structentt_1_1basic__organizer_1_1vertex.html#adbda67e21133ac80f05e7131ee00aec2',1,'entt::basic_organizer::vertex']]], - ['capacity_65',['capacity',['../classentt_1_1basic__registry.html#a05fd96006ea9f68b679507cdc67260ce',1,'entt::basic_registry::capacity()'],['../classentt_1_1basic__sparse__set.html#ac563edfd09c8b37256d49b05bde4f872',1,'entt::basic_sparse_set::capacity()'],['../classentt_1_1basic__storage.html#aff2228c8f45265417bf83694a3a47ce6',1,'entt::basic_storage::capacity()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ada21c7b1c65df0c10ea107559447ede7',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::capacity()']]], - ['cast_66',['cast',['../classentt_1_1meta__any.html#a451353f531eac9870b155bf360aa08d0',1,'entt::meta_any::cast()'],['../classentt_1_1meta__any.html#a88f4699d57d87d6b450e681af5c9a07d',1,'entt::meta_any::cast() const']]], - ['cbegin_67',['cbegin',['../structentt_1_1meta__range.html#a1e6679691bb8b102dc742dc7d8794c15',1,'entt::meta_range::cbegin()'],['../classentt_1_1dense__hash__map.html#ab35c654d76a56bb215a301f15929b5a1',1,'entt::dense_hash_map::cbegin() const'],['../classentt_1_1dense__hash__map.html#a44712304f19ed749fbd0643fab4e531b',1,'entt::dense_hash_map::cbegin(const size_type index) const'],['../classentt_1_1dense__hash__set.html#a611e7737124032737435848a09d71015',1,'entt::dense_hash_set::cbegin() const'],['../classentt_1_1dense__hash__set.html#a2d8329bf6bf0c8dcd7c97da521cceb37',1,'entt::dense_hash_set::cbegin(const size_type index) const'],['../structentt_1_1iterable__adaptor.html#a33c94d2a866e0c93f3dbaabdf91e80fa',1,'entt::iterable_adaptor::cbegin()'],['../classentt_1_1basic__sparse__set.html#aaffd322c619ff4cb1545cd38eb01b04d',1,'entt::basic_sparse_set::cbegin()'],['../classentt_1_1basic__storage.html#a2160a4b2a4c05fcab3fb14a8933953a5',1,'entt::basic_storage::cbegin()']]], - ['cend_68',['cend',['../structentt_1_1iterable__adaptor.html#a647cd837df15e583db221c24af02abb6',1,'entt::iterable_adaptor::cend()'],['../classentt_1_1basic__sparse__set.html#aedb8abe8289cd85a48b990d66cb7f90c',1,'entt::basic_sparse_set::cend()'],['../classentt_1_1basic__storage.html#a253c6d2bd4677fa8a70bf12aab88d154',1,'entt::basic_storage::cend()'],['../structentt_1_1meta__range.html#a56dc6086d89e868639de03ebe41d4a65',1,'entt::meta_range::cend()'],['../classentt_1_1dense__hash__map.html#a8aec09d2f16cc82d107bbffd34cdd842',1,'entt::dense_hash_map::cend() const'],['../classentt_1_1dense__hash__map.html#a978b46b79f11e67cbf49b1cf41bd094a',1,'entt::dense_hash_map::cend([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__hash__set.html#a9f45e62de3b7dc871bd10800590a9303',1,'entt::dense_hash_set::cend() const'],['../classentt_1_1dense__hash__set.html#a0d9d2624b7afd6d19ff28d1ec603234e',1,'entt::dense_hash_set::cend([[maybe_unused]] const size_type index) const']]], - ['children_69',['children',['../structentt_1_1basic__organizer_1_1vertex.html#a9001bb3bbdfa60b8331d45d741a89de5',1,'entt::basic_organizer::vertex']]], - ['choice_70',['choice',['../namespaceentt.html#a089f75043b082abca3ea144bce44e9ae',1,'entt']]], - ['choice_5ft_71',['choice_t',['../structentt_1_1choice__t.html',1,'entt']]], - ['choice_5ft_3c_200_20_3e_72',['choice_t< 0 >',['../structentt_1_1choice__t_3_010_01_4.html',1,'entt']]], - ['class_5ftype_73',['class_type',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a4223977fdb0b34434781d3dccee131c0',1,'entt::meta_template_traits< Clazz< Args... > >']]], - ['clear_74',['clear',['../classentt_1_1basic__registry.html#aa4b08ad282560ead88ceeeddba16f552',1,'entt::basic_registry::clear()'],['../classentt_1_1basic__sparse__set.html#a6560773b887906122d50a413aea1faad',1,'entt::basic_sparse_set::clear()'],['../classentt_1_1meta__sequence__container.html#afd684301f43565b7fc23b32b8b92bb6e',1,'entt::meta_sequence_container::clear()'],['../classentt_1_1meta__associative__container.html#af8d886eee95047430e1272ae419be3e4',1,'entt::meta_associative_container::clear()'],['../classentt_1_1scheduler.html#a5a0f92dbe54b58751237a567e86805e0',1,'entt::scheduler::clear()'],['../classentt_1_1resource__cache.html#a2c6800c0d2ebb2c0a51f941af5fc9168',1,'entt::resource_cache::clear()'],['../classentt_1_1dispatcher.html#a7aacb035fbf90406fca1ccd10f28be86',1,'entt::dispatcher::clear()'],['../classentt_1_1emitter.html#a4e4324c59afee760ca13772eb6d2d522',1,'entt::emitter::clear()'],['../classentt_1_1emitter.html#afed3485e23fdbb87d007208382428813',1,'entt::emitter::clear()'],['../classentt_1_1dense__hash__map.html#a9bad3d67bfedb75206b5d04b0fa29ec4',1,'entt::dense_hash_map::clear()'],['../classentt_1_1dense__hash__set.html#a5138bded25378fb68122573c5ba39ece',1,'entt::dense_hash_set::clear()'],['../classentt_1_1basic__observer.html#ade730cb09309ed7077616a908b25c2e7',1,'entt::basic_observer::clear()'],['../classentt_1_1basic__organizer.html#abd9bb70defec160e5da0d5807c11b18f',1,'entt::basic_organizer::clear()']]], - ['collect_75',['collect',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af48a9fae33221a696db874e00516a7e1',1,'entt::sigh< Ret(Args...), Allocator >']]], - ['collector_76',['collector',['../namespaceentt.html#aea8b073b774362fe800d9cce3542927a',1,'entt']]], - ['combine_77',['combine',['../classentt_1_1entt__traits.html#aaba051e9884c8122ee8de8260a14fa68',1,'entt::entt_traits']]], - ['compact_78',['compact',['../classentt_1_1basic__registry.html#a27f61f6b3347811854b7d1c2bd97db99',1,'entt::basic_registry::compact()'],['../classentt_1_1basic__sparse__set.html#af4979ce48546cfcc705c4d23654faef2',1,'entt::basic_sparse_set::compact()']]], - ['component_79',['component',['../classentt_1_1basic__snapshot.html#a59cf70d5b7730d388f3a63845e8faede',1,'entt::basic_snapshot::component(Archive &archive) const'],['../classentt_1_1basic__snapshot.html#a05fff12a4af42f0ad77dc4893856772c',1,'entt::basic_snapshot::component(Archive &archive, It first, It last) const'],['../classentt_1_1basic__snapshot__loader.html#af7352e091c3421432cc2ef77010a0a2d',1,'entt::basic_snapshot_loader::component()'],['../classentt_1_1basic__continuous__loader.html#a25d4e67e41c6dfde95e39a2d9ef896c2',1,'entt::basic_continuous_loader::component()']]], - ['component_5ftraits_80',['component_traits',['../structentt_1_1component__traits.html',1,'entt']]], - ['compressed_5fpair_81',['compressed_pair',['../namespaceentt.html#af638f85aa855e8364af76d8bf93eee3b',1,'entt::compressed_pair()'],['../classentt_1_1compressed__pair.html#aed863f3bd0bde61f52c9cce84e9ecaac',1,'entt::compressed_pair::compressed_pair(std::piecewise_construct_t, std::tuple< Args... > args, std::tuple< Other... > other)'],['../classentt_1_1compressed__pair.html#ad232c3555664edad7dc1425672245054',1,'entt::compressed_pair::compressed_pair()'],['../classentt_1_1compressed__pair.html#a2a25fcd5670e614428cbb8b929f02fca',1,'entt::compressed_pair::compressed_pair(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#a91c6019fb88342859008675265a8d7d0',1,'entt::compressed_pair::compressed_pair(compressed_pair &&other)=default'],['../classentt_1_1compressed__pair.html#a728283e0d45f7f13d762642a48a10e76',1,'entt::compressed_pair::compressed_pair(Arg &&arg, Other &&other)'],['../classentt_1_1compressed__pair.html',1,'entt::compressed_pair< First, Second >']]], - ['compressed_5fpair_3c_20container_5ftype_2c_20alloc_20_3e_82',['compressed_pair< container_type, alloc >',['../classentt_1_1compressed__pair.html',1,'entt']]], - ['compressed_5fpair_3c_20packed_5fcontainer_5ftype_2c_20key_5fequal_20_3e_83',['compressed_pair< packed_container_type, key_equal >',['../classentt_1_1compressed__pair.html',1,'entt']]], - ['compressed_5fpair_3c_20sparse_5fcontainer_5ftype_2c_20hasher_20_3e_84',['compressed_pair< sparse_container_type, hasher >',['../classentt_1_1compressed__pair.html',1,'entt']]], - ['concept_5ftype_85',['concept_type',['../classentt_1_1basic__poly.html#ad3c8c25e48b14267dc3fc0de326a9660',1,'entt::basic_poly']]], - ['connect_86',['connect',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a567be37eb789e19d12106959c786f586',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ab1775693de213f96a67ec0b390eb932d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect(Type &&value_or_instance)'],['../classentt_1_1basic__observer.html#a7d69a8bc866b01cc677de492bc436209',1,'entt::basic_observer::connect()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#abd919bd2f167cbefbde08082b0e60c92',1,'entt::delegate< Ret(Args...)>::connect()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af7d419ad51b636ed828d8d41fe6dd698',1,'entt::delegate< Ret(Args...)>::connect(Type &value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#aa6446ef34be31a2e73d30af409d56126',1,'entt::delegate< Ret(Args...)>::connect(Type *value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a83e6d11605181db1a4a0396efcd55f55',1,'entt::delegate< Ret(Args...)>::connect(function_type *function, const void *payload=nullptr)']]], - ['connect_5farg_87',['connect_arg',['../namespaceentt.html#af1e73acd6f3d892955819677dc2664b7',1,'entt']]], - ['connect_5farg_5ft_88',['connect_arg_t',['../structentt_1_1connect__arg__t.html',1,'entt']]], - ['connection_89',['connection',['../structentt_1_1emitter_1_1connection.html#a3dcb29742c6824dd28743eb0d896f9c3',1,'entt::emitter::connection::connection()=default'],['../structentt_1_1emitter_1_1connection.html#a0fa687596e072155e92e586e9de089c3',1,'entt::emitter::connection::connection(typename pool_handler< Event >::connection_type conn)'],['../classentt_1_1connection.html#a1d11f6b9d00a3f0e5364111438a1cee5',1,'entt::connection::connection()'],['../classentt_1_1connection.html',1,'entt::connection'],['../structentt_1_1emitter_1_1connection.html',1,'entt::emitter< Derived >::connection< Event >']]], - ['const_5fhandle_90',['const_handle',['../namespaceentt.html#a54ab1aae5e5786a3ebb3b9bf1c7e82bd',1,'entt']]], - ['const_5fhandle_5fview_91',['const_handle_view',['../namespaceentt.html#aedfeed27a790ac90eb5989da8a3ea860',1,'entt']]], - ['const_5fiterable_92',['const_iterable',['../classentt_1_1basic__storage.html#acefab1ddb82825d8e04dfdfad804f1c0',1,'entt::basic_storage::const_iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1c73c836c2ef40a29b3caafc714ae61e',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::const_iterable()']]], - ['const_5fiterator_93',['const_iterator',['../classentt_1_1dense__hash__map.html#a5cd46f27bdaa94dbc949dd74f266d82c',1,'entt::dense_hash_map::const_iterator()'],['../classentt_1_1dense__hash__set.html#a5038f2ff0f91666e0181e0b81252951d',1,'entt::dense_hash_set::const_iterator()'],['../structentt_1_1iterable__adaptor.html#aa6ac835d7a8d53b23951fbdba6db850d',1,'entt::iterable_adaptor::const_iterator()'],['../classentt_1_1basic__sparse__set.html#a3688979d568f2450725d69aa89571f4f',1,'entt::basic_sparse_set::const_iterator()'],['../classentt_1_1basic__storage.html#a6715c42a370278ab10aac27edf52fe03',1,'entt::basic_storage::const_iterator()'],['../structentt_1_1meta__range.html#a28dd40f858f770c7e4bb03bfcf6ade2b',1,'entt::meta_range::const_iterator()']]], - ['const_5flocal_5fiterator_94',['const_local_iterator',['../classentt_1_1dense__hash__map.html#aca94f9e7ed377b5d9475cdee0cbfbe7b',1,'entt::dense_hash_map::const_local_iterator()'],['../classentt_1_1dense__hash__set.html#a1715c26458ecce19ee971f2dae46a0ee',1,'entt::dense_hash_set::const_local_iterator()']]], - ['const_5fpointer_95',['const_pointer',['../classentt_1_1basic__storage.html#aa646520c35b681b87e71c8daa9ad27cd',1,'entt::basic_storage']]], - ['const_5freverse_5fiterator_96',['const_reverse_iterator',['../classentt_1_1basic__sparse__set.html#a4d0d07e67ebda136c33fe39ea193c69e',1,'entt::basic_sparse_set::const_reverse_iterator()'],['../classentt_1_1basic__storage.html#aa37c4581b7b9fed29fb4530db6541ab8',1,'entt::basic_storage::const_reverse_iterator()']]], - ['constness_5fas_97',['constness_as',['../structentt_1_1constness__as.html',1,'entt']]], - ['constness_5fas_3c_20to_2c_20const_20from_20_3e_98',['constness_as< To, const From >',['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html',1,'entt']]], - ['constness_5fas_5ft_99',['constness_as_t',['../namespaceentt.html#a7b051461867d3c5c97f77f10b662c26b',1,'entt']]], - ['construct_100',['construct',['../classentt_1_1entt__traits.html#a3fae029105adcdb4d570290a04399202',1,'entt::entt_traits::construct()'],['../classentt_1_1meta__type.html#acd24936afdaa36484a6e508d52f49663',1,'entt::meta_type::construct(meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a429d2a56a3aab671a76f87828e7f10f6',1,'entt::meta_type::construct(Args &&...args) const']]], - ['contains_101',['contains',['../classentt_1_1basic__runtime__view.html#ace695506c87fd0299c49ce90e816074f',1,'entt::basic_runtime_view::contains()'],['../classentt_1_1basic__continuous__loader.html#a34d7062265e3b1f22aa6d4bb876ff3dd',1,'entt::basic_continuous_loader::contains()'],['../classentt_1_1basic__sparse__set.html#ad2c7f1ac19e1040c2c2d2245f521f291',1,'entt::basic_sparse_set::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ab81091685ac046513775b9e05dbafe34',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdc5cf0ebb1d03c27eed1a96c79050ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::contains()'],['../classentt_1_1resource__cache.html#a86bac75a12d6b8334c6438708f4b792f',1,'entt::resource_cache::contains()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aa8f37d5e7ddf5accf4b57961c736eb13',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1dense__hash__map.html#ab8aa4d44a5c642ad0c64153d99b83f62',1,'entt::dense_hash_map::contains(const key_type &key) const'],['../classentt_1_1dense__hash__map.html#a3ccb49138360b1262e36b30714a24f05',1,'entt::dense_hash_map::contains(const Other &key) const'],['../classentt_1_1dense__hash__set.html#afc2e126daf75c5de39a881fc13c7835d',1,'entt::dense_hash_set::contains(const value_type &value) const'],['../classentt_1_1dense__hash__set.html#a03867f506090a677e712b81902569cdd',1,'entt::dense_hash_set::contains(const Other &value) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a879bcfdaa77d67d7336039d63121dce8',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::contains()']]], - ['continuous_5floader_102',['continuous_loader',['../namespaceentt.html#a37b5b489846f6f2a5d143db2b4aea5d0',1,'entt']]], - ['conv_103',['conv',['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()']]], - ['crash_20course_3a_20configuration_104',['Crash Course: configuration',['../md_docs_md_config.html',1,'']]], - ['crash_20course_3a_20containers_105',['Crash Course: containers',['../md_docs_md_container.html',1,'']]], - ['crash_20course_3a_20cooperative_20scheduler_106',['Crash Course: cooperative scheduler',['../md_docs_md_process.html',1,'']]], - ['crash_20course_3a_20core_20functionalities_107',['Crash Course: core functionalities',['../md_docs_md_core.html',1,'']]], - ['crash_20course_3a_20entity_2dcomponent_20system_108',['Crash Course: entity-component system',['../md_docs_md_entity.html',1,'']]], - ['crash_20course_3a_20events_2c_20signals_20and_20everything_20in_20between_109',['Crash Course: events, signals and everything in between',['../md_docs_md_signal.html',1,'']]], - ['crash_20course_3a_20poly_110',['Crash Course: poly',['../md_docs_md_poly.html',1,'']]], - ['crash_20course_3a_20resource_20management_111',['Crash Course: resource management',['../md_docs_md_resource.html',1,'']]], - ['crash_20course_3a_20runtime_20reflection_20system_112',['Crash Course: runtime reflection system',['../md_docs_md_meta.html',1,'']]], - ['crash_20course_3a_20service_20locator_113',['Crash Course: service locator',['../md_docs_md_locator.html',1,'']]], - ['crbegin_114',['crbegin',['../classentt_1_1basic__sparse__set.html#a104a343b198eb136edc44a14e2926e17',1,'entt::basic_sparse_set::crbegin()'],['../classentt_1_1basic__storage.html#aa86ed935b31675eb3f6938755d671d2b',1,'entt::basic_storage::crbegin()']]], - ['create_115',['create',['../classentt_1_1basic__registry.html#a91bfd7ec05e6d718e47da581a893cdc4',1,'entt::basic_registry::create()'],['../classentt_1_1basic__registry.html#ab04ebcb3409a5e99a3a86a2f5b48e052',1,'entt::basic_registry::create(const entity_type hint)'],['../classentt_1_1basic__registry.html#a334768416fdf6372ecfdef9ec4f03e83',1,'entt::basic_registry::create(It first, It last)']]], - ['crend_116',['crend',['../classentt_1_1basic__sparse__set.html#a27796ccfcc21635bebede97f3d97a7af',1,'entt::basic_sparse_set::crend()'],['../classentt_1_1basic__storage.html#a0a4ae307c3423d97b779fe427b22feb6',1,'entt::basic_storage::crend()']]], - ['ctor_117',['ctor',['../classentt_1_1meta__factory_3_01Type_01_4.html#a938d731d306ebd02d2ef9e9d1b121f3f',1,'entt::meta_factory< Type >::ctor()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a83a4ce30e6792d17a88cc98a3df2ab39',1,'entt::meta_factory< Type >::ctor()']]], - ['ctx_118',['ctx',['../classentt_1_1basic__registry.html#aa7b72e3bdb0b072439afb85fe8af6ced',1,'entt::basic_registry::ctx() const'],['../classentt_1_1basic__registry.html#a03031127c53abc80f8dcb835290fa765',1,'entt::basic_registry::ctx()'],['../classentt_1_1basic__registry.html#adebb39eff1162ede07bffded9528e710',1,'entt::basic_registry::ctx(Func func) const']]], - ['ctx_5for_5fset_119',['ctx_or_set',['../classentt_1_1basic__registry.html#af68ea0a0b8e51794df74e1e378e9526d',1,'entt::basic_registry']]], - ['current_120',['current',['../classentt_1_1basic__registry.html#a199babc787d6baa6f7ccce761228a5f6',1,'entt::basic_registry::current()'],['../classentt_1_1basic__sparse__set.html#a5001ceb87ededb8ec8653aff795912b1',1,'entt::basic_sparse_set::current()']]], - ['current_5ftype_121',['current_type',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac7c32cf26795aa4fc08d21597c68bc3d',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] + ['callback_70',['callback',['../structentt_1_1basic__organizer_1_1vertex.html#adbda67e21133ac80f05e7131ee00aec2',1,'entt::basic_organizer::vertex']]], + ['capacity_71',['capacity',['../classentt_1_1basic__sparse__set.html#ac563edfd09c8b37256d49b05bde4f872',1,'entt::basic_sparse_set::capacity()'],['../classentt_1_1basic__storage.html#aff2228c8f45265417bf83694a3a47ce6',1,'entt::basic_storage::capacity()'],['../classentt_1_1basic__registry.html#a05fd96006ea9f68b679507cdc67260ce',1,'entt::basic_registry::capacity()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ada21c7b1c65df0c10ea107559447ede7',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::capacity()']]], + ['cast_72',['cast',['../classentt_1_1meta__any.html#a88f4699d57d87d6b450e681af5c9a07d',1,'entt::meta_any::cast() const'],['../classentt_1_1meta__any.html#a451353f531eac9870b155bf360aa08d0',1,'entt::meta_any::cast()']]], + ['cbegin_73',['cbegin',['../structentt_1_1meta__range.html#a1e6679691bb8b102dc742dc7d8794c15',1,'entt::meta_range::cbegin()'],['../classentt_1_1resource__cache.html#ae1e83d6e645e083b14afa3ad85c7cd5b',1,'entt::resource_cache::cbegin()'],['../classentt_1_1dense__map.html#a7f17fe6a4b6851ff25c2e01ded8ecb4b',1,'entt::dense_map::cbegin() const'],['../classentt_1_1dense__map.html#a9e9beebb937e95a40246455194c86c84',1,'entt::dense_map::cbegin(const size_type index) const'],['../classentt_1_1dense__set.html#a6ff9261fef680864f9a19d88b9bb6007',1,'entt::dense_set::cbegin() const'],['../classentt_1_1dense__set.html#af66d225983e161e2f5b6bcd839dd295e',1,'entt::dense_set::cbegin(const size_type index) const'],['../structentt_1_1iterable__adaptor.html#abf869d640cc961dba11d6e0b04a0f588',1,'entt::iterable_adaptor::cbegin()'],['../classentt_1_1basic__sparse__set.html#aaffd322c619ff4cb1545cd38eb01b04d',1,'entt::basic_sparse_set::cbegin()'],['../classentt_1_1basic__storage.html#a2160a4b2a4c05fcab3fb14a8933953a5',1,'entt::basic_storage::cbegin()']]], + ['cend_74',['cend',['../classentt_1_1basic__sparse__set.html#aedb8abe8289cd85a48b990d66cb7f90c',1,'entt::basic_sparse_set::cend()'],['../classentt_1_1basic__storage.html#a253c6d2bd4677fa8a70bf12aab88d154',1,'entt::basic_storage::cend()'],['../structentt_1_1meta__range.html#a56dc6086d89e868639de03ebe41d4a65',1,'entt::meta_range::cend()'],['../classentt_1_1resource__cache.html#a1dbcbf4bacbe7036068ac25165c81fa5',1,'entt::resource_cache::cend()'],['../structentt_1_1iterable__adaptor.html#ac7e87b44217f4c784b3efc9f074cabcf',1,'entt::iterable_adaptor::cend()'],['../classentt_1_1dense__map.html#a10b5ed3b2c9ef380d367511deeea9dcc',1,'entt::dense_map::cend() const'],['../classentt_1_1dense__map.html#af671980746e3d607f5933696d3936123',1,'entt::dense_map::cend([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__set.html#a099ad84905f6a252332b0f5b0068aac1',1,'entt::dense_set::cend() const'],['../classentt_1_1dense__set.html#a4cec8dc79a800f4b8b747c4e0a31c6fb',1,'entt::dense_set::cend([[maybe_unused]] const size_type index) const']]], + ['children_75',['children',['../structentt_1_1basic__organizer_1_1vertex.html#a9001bb3bbdfa60b8331d45d741a89de5',1,'entt::basic_organizer::vertex']]], + ['choice_76',['choice',['../namespaceentt.html#a089f75043b082abca3ea144bce44e9ae',1,'entt']]], + ['choice_5ft_77',['choice_t',['../structentt_1_1choice__t.html',1,'entt']]], + ['choice_5ft_3c_200_20_3e_78',['choice_t< 0 >',['../structentt_1_1choice__t_3_010_01_4.html',1,'entt']]], + ['class_5ftype_79',['class_type',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a4223977fdb0b34434781d3dccee131c0',1,'entt::meta_template_traits< Clazz< Args... > >']]], + ['clear_80',['clear',['../classentt_1_1basic__registry.html#aa4b08ad282560ead88ceeeddba16f552',1,'entt::basic_registry::clear()'],['../classentt_1_1emitter.html#afed3485e23fdbb87d007208382428813',1,'entt::emitter::clear()'],['../classentt_1_1emitter.html#a4e4324c59afee760ca13772eb6d2d522',1,'entt::emitter::clear()'],['../classentt_1_1basic__sparse__set.html#a6560773b887906122d50a413aea1faad',1,'entt::basic_sparse_set::clear()'],['../classentt_1_1basic__dispatcher.html#aa9ea948386b8eb098995cd6f2e981848',1,'entt::basic_dispatcher::clear()'],['../classentt_1_1basic__dispatcher.html#a38b6446c28a59b93d3c40da25c846e57',1,'entt::basic_dispatcher::clear(const id_type id=type_hash< Event >::value())'],['../classentt_1_1resource__cache.html#a45d256c8fe130284facc58071dcaa91f',1,'entt::resource_cache::clear()'],['../classentt_1_1scheduler.html#a5a0f92dbe54b58751237a567e86805e0',1,'entt::scheduler::clear()'],['../classentt_1_1meta__associative__container.html#af8d886eee95047430e1272ae419be3e4',1,'entt::meta_associative_container::clear()'],['../classentt_1_1meta__sequence__container.html#afd684301f43565b7fc23b32b8b92bb6e',1,'entt::meta_sequence_container::clear()'],['../classentt_1_1dense__map.html#a831cc52136a77d92c809a02a49faade6',1,'entt::dense_map::clear()'],['../classentt_1_1dense__set.html#adf3e56611d2bcebaeb7d27bbec2e3ef4',1,'entt::dense_set::clear()'],['../classentt_1_1basic__observer.html#ade730cb09309ed7077616a908b25c2e7',1,'entt::basic_observer::clear()'],['../classentt_1_1basic__organizer.html#abd9bb70defec160e5da0d5807c11b18f',1,'entt::basic_organizer::clear()']]], + ['collect_81',['collect',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af48a9fae33221a696db874e00516a7e1',1,'entt::sigh< Ret(Args...), Allocator >']]], + ['collector_82',['collector',['../namespaceentt.html#aea8b073b774362fe800d9cce3542927a',1,'entt']]], + ['combine_83',['combine',['../classentt_1_1entt__traits.html#aaba051e9884c8122ee8de8260a14fa68',1,'entt::entt_traits']]], + ['compact_84',['compact',['../classentt_1_1basic__registry.html#a27f61f6b3347811854b7d1c2bd97db99',1,'entt::basic_registry::compact()'],['../classentt_1_1basic__sparse__set.html#af4979ce48546cfcc705c4d23654faef2',1,'entt::basic_sparse_set::compact()']]], + ['component_85',['component',['../classentt_1_1basic__snapshot.html#a59cf70d5b7730d388f3a63845e8faede',1,'entt::basic_snapshot::component(Archive &archive) const'],['../classentt_1_1basic__snapshot.html#a05fff12a4af42f0ad77dc4893856772c',1,'entt::basic_snapshot::component(Archive &archive, It first, It last) const'],['../classentt_1_1basic__snapshot__loader.html#af7352e091c3421432cc2ef77010a0a2d',1,'entt::basic_snapshot_loader::component()'],['../classentt_1_1basic__continuous__loader.html#a25d4e67e41c6dfde95e39a2d9ef896c2',1,'entt::basic_continuous_loader::component()']]], + ['component_5ftraits_86',['component_traits',['../structentt_1_1component__traits.html',1,'entt']]], + ['compressed_5fpair_87',['compressed_pair',['../namespaceentt.html#af638f85aa855e8364af76d8bf93eee3b',1,'entt::compressed_pair()'],['../classentt_1_1compressed__pair.html#aed863f3bd0bde61f52c9cce84e9ecaac',1,'entt::compressed_pair::compressed_pair(std::piecewise_construct_t, std::tuple< Args... > args, std::tuple< Other... > other)'],['../classentt_1_1compressed__pair.html#ad232c3555664edad7dc1425672245054',1,'entt::compressed_pair::compressed_pair()'],['../classentt_1_1compressed__pair.html#a2a25fcd5670e614428cbb8b929f02fca',1,'entt::compressed_pair::compressed_pair(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#a91c6019fb88342859008675265a8d7d0',1,'entt::compressed_pair::compressed_pair(compressed_pair &&other)=default'],['../classentt_1_1compressed__pair.html#a728283e0d45f7f13d762642a48a10e76',1,'entt::compressed_pair::compressed_pair(Arg &&arg, Other &&other)'],['../classentt_1_1compressed__pair.html',1,'entt::compressed_pair< First, Second >']]], + ['compressed_5fpair_3c_20container_5ftype_2c_20allocator_5ftype_20_3e_88',['compressed_pair< container_type, allocator_type >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20entt_3a_3adense_5fmap_2c_20allocator_5ftype_20_3e_89',['compressed_pair< entt::dense_map, allocator_type >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20entt_3a_3adense_5fmap_2c_20loader_5ftype_20_3e_90',['compressed_pair< entt::dense_map, loader_type >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20packed_5fcontainer_5ftype_2c_20key_5fequal_20_3e_91',['compressed_pair< packed_container_type, key_equal >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20sparse_5fcontainer_5ftype_2c_20hasher_20_3e_92',['compressed_pair< sparse_container_type, hasher >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['concept_5ftype_93',['concept_type',['../classentt_1_1basic__poly.html#ad3c8c25e48b14267dc3fc0de326a9660',1,'entt::basic_poly']]], + ['connect_94',['connect',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a567be37eb789e19d12106959c786f586',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ab1775693de213f96a67ec0b390eb932d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect(Type &&value_or_instance)'],['../classentt_1_1basic__observer.html#a7d69a8bc866b01cc677de492bc436209',1,'entt::basic_observer::connect()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#abd919bd2f167cbefbde08082b0e60c92',1,'entt::delegate< Ret(Args...)>::connect()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af7d419ad51b636ed828d8d41fe6dd698',1,'entt::delegate< Ret(Args...)>::connect(Type &value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#aa6446ef34be31a2e73d30af409d56126',1,'entt::delegate< Ret(Args...)>::connect(Type *value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a83e6d11605181db1a4a0396efcd55f55',1,'entt::delegate< Ret(Args...)>::connect(function_type *function, const void *payload=nullptr)']]], + ['connect_5farg_95',['connect_arg',['../namespaceentt.html#af1e73acd6f3d892955819677dc2664b7',1,'entt']]], + ['connect_5farg_5ft_96',['connect_arg_t',['../structentt_1_1connect__arg__t.html',1,'entt']]], + ['connection_97',['connection',['../structentt_1_1emitter_1_1connection.html#a3dcb29742c6824dd28743eb0d896f9c3',1,'entt::emitter::connection::connection()=default'],['../structentt_1_1emitter_1_1connection.html#a0fa687596e072155e92e586e9de089c3',1,'entt::emitter::connection::connection(typename pool_handler< Event >::connection_type conn)'],['../classentt_1_1connection.html#a1d11f6b9d00a3f0e5364111438a1cee5',1,'entt::connection::connection()'],['../classentt_1_1connection.html',1,'entt::connection'],['../structentt_1_1emitter_1_1connection.html',1,'entt::emitter< Derived >::connection< Event >']]], + ['const_5fhandle_98',['const_handle',['../namespaceentt.html#a54ab1aae5e5786a3ebb3b9bf1c7e82bd',1,'entt']]], + ['const_5fhandle_5fview_99',['const_handle_view',['../namespaceentt.html#aedfeed27a790ac90eb5989da8a3ea860',1,'entt']]], + ['const_5fiterable_100',['const_iterable',['../classentt_1_1basic__storage.html#acefab1ddb82825d8e04dfdfad804f1c0',1,'entt::basic_storage::const_iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1c73c836c2ef40a29b3caafc714ae61e',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::const_iterable()']]], + ['const_5fiterator_101',['const_iterator',['../classentt_1_1dense__map.html#a5c236223418b9ef327397424e2df24f8',1,'entt::dense_map::const_iterator()'],['../classentt_1_1dense__set.html#a271e1e1f94361e8156c6de5a81746943',1,'entt::dense_set::const_iterator()'],['../classentt_1_1basic__sparse__set.html#a3688979d568f2450725d69aa89571f4f',1,'entt::basic_sparse_set::const_iterator()'],['../classentt_1_1basic__storage.html#a6715c42a370278ab10aac27edf52fe03',1,'entt::basic_storage::const_iterator()'],['../structentt_1_1meta__range.html#a28dd40f858f770c7e4bb03bfcf6ade2b',1,'entt::meta_range::const_iterator()'],['../classentt_1_1resource__cache.html#a8eb72ec2d185a953cba0ac2f6e87d693',1,'entt::resource_cache::const_iterator()']]], + ['const_5flocal_5fiterator_102',['const_local_iterator',['../classentt_1_1dense__map.html#ad699469dc43bfd00d9ea86c686afb394',1,'entt::dense_map::const_local_iterator()'],['../classentt_1_1dense__set.html#a0be70471e45867b1d18aa9ee57376496',1,'entt::dense_set::const_local_iterator()']]], + ['const_5fpointer_103',['const_pointer',['../classentt_1_1basic__storage.html#aa646520c35b681b87e71c8daa9ad27cd',1,'entt::basic_storage']]], + ['const_5freverse_5fiterator_104',['const_reverse_iterator',['../classentt_1_1basic__sparse__set.html#a4d0d07e67ebda136c33fe39ea193c69e',1,'entt::basic_sparse_set::const_reverse_iterator()'],['../classentt_1_1basic__storage.html#aa37c4581b7b9fed29fb4530db6541ab8',1,'entt::basic_storage::const_reverse_iterator()']]], + ['constness_5fas_105',['constness_as',['../structentt_1_1constness__as.html',1,'entt']]], + ['constness_5fas_3c_20to_2c_20const_20from_20_3e_106',['constness_as< To, const From >',['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html',1,'entt']]], + ['constness_5fas_5ft_107',['constness_as_t',['../namespaceentt.html#a7b051461867d3c5c97f77f10b662c26b',1,'entt']]], + ['construct_108',['construct',['../classentt_1_1entt__traits.html#a3fae029105adcdb4d570290a04399202',1,'entt::entt_traits::construct()'],['../classentt_1_1meta__type.html#acd24936afdaa36484a6e508d52f49663',1,'entt::meta_type::construct(meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a429d2a56a3aab671a76f87828e7f10f6',1,'entt::meta_type::construct(Args &&...args) const']]], + ['contains_109',['contains',['../classentt_1_1basic__continuous__loader.html#a34d7062265e3b1f22aa6d4bb876ff3dd',1,'entt::basic_continuous_loader::contains()'],['../classentt_1_1basic__sparse__set.html#ad2c7f1ac19e1040c2c2d2245f521f291',1,'entt::basic_sparse_set::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ab81091685ac046513775b9e05dbafe34',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1dense__map.html#a4d884a2b7164b3df97d93dd2804222b0',1,'entt::dense_map::contains()'],['../classentt_1_1resource__cache.html#aff744458b981ee509a7381ffdf544522',1,'entt::resource_cache::contains()'],['../classentt_1_1dense__map.html#abb9504d00b5829a2d92afd2296430192',1,'entt::dense_map::contains()'],['../classentt_1_1dense__set.html#afd77a2703fb72d17f382f5cb1aeb24b2',1,'entt::dense_set::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdc5cf0ebb1d03c27eed1a96c79050ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::contains()'],['../classentt_1_1dense__set.html#aa29df7e5860ee70d40b471683af20908',1,'entt::dense_set::contains()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a879bcfdaa77d67d7336039d63121dce8',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aa8f37d5e7ddf5accf4b57961c736eb13',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::contains()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a1d8e154538308a4ba6e4c41f3ec51475',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::contains()']]], + ['context_110',['context',['../classentt_1_1basic__registry.html#a16aab012e8aff625f0ae4412a1919801',1,'entt::basic_registry']]], + ['continuous_5floader_111',['continuous_loader',['../namespaceentt.html#a37b5b489846f6f2a5d143db2b4aea5d0',1,'entt']]], + ['conv_112',['conv',['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()']]], + ['crash_20course_3a_20configuration_113',['Crash Course: configuration',['../md_docs_md_config.html',1,'']]], + ['crash_20course_3a_20containers_114',['Crash Course: containers',['../md_docs_md_container.html',1,'']]], + ['crash_20course_3a_20cooperative_20scheduler_115',['Crash Course: cooperative scheduler',['../md_docs_md_process.html',1,'']]], + ['crash_20course_3a_20core_20functionalities_116',['Crash Course: core functionalities',['../md_docs_md_core.html',1,'']]], + ['crash_20course_3a_20entity_2dcomponent_20system_117',['Crash Course: entity-component system',['../md_docs_md_entity.html',1,'']]], + ['crash_20course_3a_20events_2c_20signals_20and_20everything_20in_20between_118',['Crash Course: events, signals and everything in between',['../md_docs_md_signal.html',1,'']]], + ['crash_20course_3a_20poly_119',['Crash Course: poly',['../md_docs_md_poly.html',1,'']]], + ['crash_20course_3a_20resource_20management_120',['Crash Course: resource management',['../md_docs_md_resource.html',1,'']]], + ['crash_20course_3a_20runtime_20reflection_20system_121',['Crash Course: runtime reflection system',['../md_docs_md_meta.html',1,'']]], + ['crash_20course_3a_20service_20locator_122',['Crash Course: service locator',['../md_docs_md_locator.html',1,'']]], + ['crbegin_123',['crbegin',['../classentt_1_1basic__sparse__set.html#a104a343b198eb136edc44a14e2926e17',1,'entt::basic_sparse_set::crbegin()'],['../classentt_1_1basic__storage.html#aa86ed935b31675eb3f6938755d671d2b',1,'entt::basic_storage::crbegin()']]], + ['create_124',['create',['../classentt_1_1basic__registry.html#a91bfd7ec05e6d718e47da581a893cdc4',1,'entt::basic_registry::create()'],['../classentt_1_1basic__registry.html#ab04ebcb3409a5e99a3a86a2f5b48e052',1,'entt::basic_registry::create(const entity_type hint)'],['../classentt_1_1basic__registry.html#a334768416fdf6372ecfdef9ec4f03e83',1,'entt::basic_registry::create(It first, It last)']]], + ['crend_125',['crend',['../classentt_1_1basic__sparse__set.html#a27796ccfcc21635bebede97f3d97a7af',1,'entt::basic_sparse_set::crend()'],['../classentt_1_1basic__storage.html#a0a4ae307c3423d97b779fe427b22feb6',1,'entt::basic_storage::crend()']]], + ['ctor_126',['ctor',['../classentt_1_1meta__factory_3_01Type_01_4.html#a83a4ce30e6792d17a88cc98a3df2ab39',1,'entt::meta_factory< Type >::ctor()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a938d731d306ebd02d2ef9e9d1b121f3f',1,'entt::meta_factory< Type >::ctor()']]], + ['ctx_127',['ctx',['../classentt_1_1basic__registry.html#a0a0058d4e71e1cbcb1f2049b96d2e51b',1,'entt::basic_registry::ctx()'],['../classentt_1_1basic__registry.html#a0610a31a816c3200124ad07590720430',1,'entt::basic_registry::ctx() const']]], + ['current_128',['current',['../classentt_1_1basic__registry.html#a199babc787d6baa6f7ccce761228a5f6',1,'entt::basic_registry::current()'],['../classentt_1_1basic__sparse__set.html#a5001ceb87ededb8ec8653aff795912b1',1,'entt::basic_sparse_set::current()']]], + ['current_5ftype_129',['current_type',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac7c32cf26795aa4fc08d21597c68bc3d',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] ]; diff --git a/search/all_3.js b/search/all_3.js index 738f3aa4e..e2047e50e 100644 --- a/search/all_3.js +++ b/search/all_3.js @@ -1,26 +1,22 @@ var searchData= [ - ['data_122',['data',['../classentt_1_1basic__observer.html#a9bbec438ee2735301a47725e0c137187',1,'entt::basic_observer::data()'],['../classentt_1_1basic__any.html#a237dfc1f1c43bf5c0358b32896eda8c4',1,'entt::basic_any::data() const'],['../classentt_1_1basic__any.html#a5bfddaf1f62e8f9922bf8d7963b07d5b',1,'entt::basic_any::data(const type_info &req) const'],['../classentt_1_1basic__any.html#a3115608210ccfa59b915b1d9d24d9ef9',1,'entt::basic_any::data()'],['../classentt_1_1basic__any.html#ad9370b9b130bccb406b20b6562c3f192',1,'entt::basic_any::data(const type_info &req)'],['../classentt_1_1basic__hashed__string.html#a2019106a9113950a488f43feaaa57ccc',1,'entt::basic_hashed_string::data()'],['../structentt_1_1basic__organizer_1_1vertex.html#a8e60b82f8db48e9bb2a8d0bf9cc5ac17',1,'entt::basic_organizer::vertex::data()'],['../classentt_1_1basic__registry.html#abd873a2d0dfb67f3fd27ce9ed23f61c2',1,'entt::basic_registry::data()'],['../classentt_1_1basic__sparse__set.html#adaa8a3f16cdaa2d85316683d008bf8c5',1,'entt::basic_sparse_set::data()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#addf18a70b4dea99bdc3fec0a537e042a',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__any.html#a3c16bceaf56eda12158f4b71ef879d5c',1,'entt::meta_any::data() const'],['../classentt_1_1meta__any.html#a5783b5eb8a7161452c3c61e3216acdc3',1,'entt::meta_any::data()'],['../classentt_1_1meta__type.html#afe554c6ab6bcd8ad77d55a5172e208a9',1,'entt::meta_type::data() const'],['../classentt_1_1meta__type.html#a68a81b038954d1727a6bb051ed1e810c',1,'entt::meta_type::data(const id_type id) const'],['../classentt_1_1basic__poly.html#ac2f41ea9e4b95871dc2f79db6855c122',1,'entt::basic_poly::data() const'],['../classentt_1_1basic__poly.html#a2f8e50be01a338fb93fc28b1e69865ad',1,'entt::basic_poly::data()']]], - ['delegate_123',['delegate',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a4629dd7c9c6e5dcb32d97c0c64702817',1,'entt::delegate< Ret(Args...)>::delegate()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a77c175e2f859a9dbbcfa6afee074e3e8',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a8b118ff23fbccfc60e5cff94a0056547',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >, Type &&value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af29157dd35ac7aefbdc8b7012e9d94ac',1,'entt::delegate< Ret(Args...)>::delegate(function_type *function, const void *payload=nullptr)'],['../namespaceentt.html#aaba06006a862fa5dc613e8561ac4e92c',1,'entt::delegate(Ret(*)(const void *, Args...), const void *=nullptr) -> delegate< Ret(Args...)>'],['../namespaceentt.html#a39ba791dbcdecb9415a5c11fe69c4b1c',1,'entt::delegate(connect_arg_t< Candidate >, Type &&) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate), Type >>>'],['../namespaceentt.html#a7c8907a3a72cd2da043d81f6fd50487a',1,'entt::delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>'],['../classentt_1_1delegate.html',1,'entt::delegate< typename >']]], - ['delegate_3c_20ret_28args_2e_2e_2e_29_3e_124',['delegate< Ret(Args...)>',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html',1,'entt']]], - ['delegate_3c_20void_28entt_3a_3abasic_5fobserver_20_26_29_3e_125',['delegate< void(entt::basic_observer &)>',['../classentt_1_1delegate.html',1,'entt']]], - ['delegate_3c_20void_28void_20_2a_29_3e_126',['delegate< void(void *)>',['../classentt_1_1delegate.html',1,'entt']]], - ['deletion_5fpolicy_127',['deletion_policy',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581',1,'entt']]], - ['delta_5ftype_128',['delta_type',['../classentt_1_1process.html#a625b574ea6d83e3a4933acc3d0279295',1,'entt::process']]], - ['dense_5fhash_5fmap_129',['dense_hash_map',['../classentt_1_1dense__hash__map.html#a5d24d9429d622b40c86099a8aa37ebec',1,'entt::dense_hash_map::dense_hash_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())'],['../classentt_1_1dense__hash__map.html#a5977ef237186dbb70223bcfc830dd543',1,'entt::dense_hash_map::dense_hash_map(const dense_hash_map &other)'],['../classentt_1_1dense__hash__map.html#a6b625b5893468f287c3e2177fa217d65',1,'entt::dense_hash_map::dense_hash_map(const dense_hash_map &other, const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#a1abb07a73f1b8bf4295463d03f5bb864',1,'entt::dense_hash_map::dense_hash_map(dense_hash_map &&other)=default'],['../classentt_1_1dense__hash__map.html#a6f670422a8aaa58490ce6c9b88ee79c8',1,'entt::dense_hash_map::dense_hash_map(dense_hash_map &&other, const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#a012db1332309d449965b7be0e7f3b32c',1,'entt::dense_hash_map::dense_hash_map()'],['../classentt_1_1dense__hash__map.html#a5dd833e19387f4f9c64c3402d7b98b0d',1,'entt::dense_hash_map::dense_hash_map(const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#a21d9faf77f24e47fed725ef2ad001f57',1,'entt::dense_hash_map::dense_hash_map(const size_type bucket_count, const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#abcfb4d580039e55c0e1cec274075c18c',1,'entt::dense_hash_map::dense_hash_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html',1,'entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >']]], - ['dense_5fhash_5fmap_3c_20entity_5ftype_2c_20std_3a_3apair_3c_20entity_5ftype_2c_20bool_20_3e_20_3e_130',['dense_hash_map< entity_type, std::pair< entity_type, bool > >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20entt_3a_3abasic_5fany_3c_200u_20_3e_2c_20entt_3a_3aidentity_20_3e_131',['dense_hash_map< id_type, entt::basic_any< 0u >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20entt_3a_3aresource_5fhandle_3c_20resource_5ftype_20_3e_2c_20entt_3a_3aidentity_20_3e_132',['dense_hash_map< id_type, entt::resource_handle< resource_type >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20basic_5fpool_20_3e_2c_20entt_3a_3aidentity_20_3e_133',['dense_hash_map< id_type, std::unique_ptr< basic_pool >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20entt_3a_3abasic_5fsparse_5fset_20_3e_2c_20entt_3a_3aidentity_20_3e_134',['dense_hash_map< id_type, std::unique_ptr< entt::basic_sparse_set >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20std_3a_3avector_3c_20std_3a_3apair_3c_20std_3a_3asize_5ft_2c_20bool_20_3e_20_3e_2c_20entt_3a_3aidentity_20_3e_135',['dense_hash_map< id_type, std::vector< std::pair< std::size_t, bool > >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fset_136',['dense_hash_set',['../classentt_1_1dense__hash__set.html#ac09146a8eb26e8c5b4efc2c1e02561a7',1,'entt::dense_hash_set::dense_hash_set()'],['../classentt_1_1dense__hash__set.html#ac33576576a26b7e19152076ff5c200c8',1,'entt::dense_hash_set::dense_hash_set(const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#a487c5c202d331e14c89481ac1d9649d1',1,'entt::dense_hash_set::dense_hash_set(const size_type bucket_count, const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#a96509b56922847fa5ad1e807fd13e7e7',1,'entt::dense_hash_set::dense_hash_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#aacb83c23ca789afc8ca984b92ed75c45',1,'entt::dense_hash_set::dense_hash_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())'],['../classentt_1_1dense__hash__set.html#ac4ccdf38e5449ae5338d2af5438f3009',1,'entt::dense_hash_set::dense_hash_set(const dense_hash_set &other)'],['../classentt_1_1dense__hash__set.html#a23feffcb9a2f3e523c5c1af938f6bee2',1,'entt::dense_hash_set::dense_hash_set(const dense_hash_set &other, const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#a80c7fb60484b93d36e91555454eefada',1,'entt::dense_hash_set::dense_hash_set(dense_hash_set &&other)=default'],['../classentt_1_1dense__hash__set.html#a075c207764dc1361bcd2bb713a0828ab',1,'entt::dense_hash_set::dense_hash_set(dense_hash_set &&other, const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html',1,'entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >']]], - ['dereference_137',['dereference',['../structentt_1_1adl__meta__pointer__like.html#afa27f416e32b351d85ab1a061c4597bd',1,'entt::adl_meta_pointer_like']]], - ['dereference_5fmeta_5fpointer_5flike_138',['dereference_meta_pointer_like',['../namespaceentt.html#a2ab7b51802157a98106f238335fa7503',1,'entt']]], - ['destroy_139',['destroy',['../classentt_1_1basic__registry.html#a6c163dcc335da90e727e2f40e67973b7',1,'entt::basic_registry::destroy()'],['../structentt_1_1basic__handle.html#aa3a4791483b3390d6d3f95767c240b49',1,'entt::basic_handle::destroy()'],['../structentt_1_1basic__handle.html#aed1520d6f7ca04a6d7180d4d10234f2e',1,'entt::basic_handle::destroy(const version_type version)'],['../classentt_1_1basic__registry.html#a7b2c0368d508a6af2d094a9fc592a4a0',1,'entt::basic_registry::destroy(const entity_type entity)'],['../classentt_1_1basic__registry.html#adc175a0d3bcf83a133c63890c674ceb3',1,'entt::basic_registry::destroy(const entity_type entity, const version_type version)']]], - ['difference_5ftype_140',['difference_type',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ae4a39185109f86cd44d997beb3a3b3f5',1,'entt::meta_sequence_container::meta_iterator::difference_type()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a901506acc5d79943261e81b3782825ea',1,'entt::meta_associative_container::meta_iterator::difference_type()']]], - ['discard_141',['discard',['../classentt_1_1resource__cache.html#a2620d6e8d97603ccd29f4e439e446480',1,'entt::resource_cache']]], - ['disconnect_142',['disconnect',['../classentt_1_1dispatcher.html#a7e93f9fd0fd8bff68c133518ee6246f0',1,'entt::dispatcher::disconnect(Type &value_or_instance)'],['../classentt_1_1dispatcher.html#a1c1b713d76354cfb0bd1bd6ed33f93ab',1,'entt::dispatcher::disconnect(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a50114245dd8dfb4872f035f36603fc02',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#abbe3bb47e3c295a45360d9ca99e79401',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a095608dfefdbd464edd6fcf858d62e84',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a43ac539a332574445dc674332bd0726d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()'],['../classentt_1_1basic__observer.html#a1337e8f885ca963383e5a3ed2a354955',1,'entt::basic_observer::disconnect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ad6dfd8bfe6c9509fc7eac357c4d7e27b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()']]], - ['dispatcher_143',['dispatcher',['../classentt_1_1dispatcher.html#a90ffb0ad33577c7211bfd2ec9ef58bed',1,'entt::dispatcher::dispatcher()=default'],['../classentt_1_1dispatcher.html#a017f5a6bcf2032968bd0493e0e01551a',1,'entt::dispatcher::dispatcher(dispatcher &&)=default'],['../classentt_1_1dispatcher.html',1,'entt::dispatcher']]], - ['dtor_144',['dtor',['../classentt_1_1meta__factory_3_01Type_01_4.html#af17b90b02db12a4e7f8e8327828b501b',1,'entt::meta_factory< Type >']]] + ['data_130',['data',['../classentt_1_1basic__sparse__set.html#adaa8a3f16cdaa2d85316683d008bf8c5',1,'entt::basic_sparse_set::data()'],['../classentt_1_1basic__any.html#a237dfc1f1c43bf5c0358b32896eda8c4',1,'entt::basic_any::data() const'],['../classentt_1_1basic__any.html#a5bfddaf1f62e8f9922bf8d7963b07d5b',1,'entt::basic_any::data(const type_info &req) const'],['../classentt_1_1basic__any.html#a3115608210ccfa59b915b1d9d24d9ef9',1,'entt::basic_any::data()'],['../classentt_1_1basic__any.html#ad9370b9b130bccb406b20b6562c3f192',1,'entt::basic_any::data(const type_info &req)'],['../classentt_1_1basic__hashed__string.html#a2019106a9113950a488f43feaaa57ccc',1,'entt::basic_hashed_string::data()'],['../classentt_1_1basic__observer.html#a9bbec438ee2735301a47725e0c137187',1,'entt::basic_observer::data()'],['../structentt_1_1basic__organizer_1_1vertex.html#a8e60b82f8db48e9bb2a8d0bf9cc5ac17',1,'entt::basic_organizer::vertex::data()'],['../classentt_1_1basic__registry.html#abd873a2d0dfb67f3fd27ce9ed23f61c2',1,'entt::basic_registry::data()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#addf18a70b4dea99bdc3fec0a537e042a',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__any.html#a3c16bceaf56eda12158f4b71ef879d5c',1,'entt::meta_any::data() const'],['../classentt_1_1meta__any.html#a5783b5eb8a7161452c3c61e3216acdc3',1,'entt::meta_any::data()'],['../classentt_1_1meta__type.html#afe554c6ab6bcd8ad77d55a5172e208a9',1,'entt::meta_type::data() const'],['../classentt_1_1meta__type.html#a68a81b038954d1727a6bb051ed1e810c',1,'entt::meta_type::data(const id_type id) const'],['../classentt_1_1basic__poly.html#ac2f41ea9e4b95871dc2f79db6855c122',1,'entt::basic_poly::data() const'],['../classentt_1_1basic__poly.html#a2f8e50be01a338fb93fc28b1e69865ad',1,'entt::basic_poly::data()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ab7b73e47afcc337b492078f36f73dd06',1,'entt::delegate< Ret(Args...)>::data() const']]], + ['delegate_131',['delegate',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af29157dd35ac7aefbdc8b7012e9d94ac',1,'entt::delegate< Ret(Args...)>::delegate()'],['../namespaceentt.html#aaba06006a862fa5dc613e8561ac4e92c',1,'entt::delegate(Ret(*)(const void *, Args...), const void *=nullptr) -> delegate< Ret(Args...)>'],['../namespaceentt.html#a39ba791dbcdecb9415a5c11fe69c4b1c',1,'entt::delegate(connect_arg_t< Candidate >, Type &&) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate), Type >>>'],['../namespaceentt.html#a7c8907a3a72cd2da043d81f6fd50487a',1,'entt::delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a4629dd7c9c6e5dcb32d97c0c64702817',1,'entt::delegate< Ret(Args...)>::delegate()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a77c175e2f859a9dbbcfa6afee074e3e8',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a8b118ff23fbccfc60e5cff94a0056547',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >, Type &&value_or_instance)'],['../classentt_1_1delegate.html',1,'entt::delegate< typename >']]], + ['delegate_3c_20ret_28args_2e_2e_2e_29_3e_132',['delegate< Ret(Args...)>',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html',1,'entt']]], + ['delegate_3c_20void_28entt_3a_3abasic_5fobserver_20_26_29_3e_133',['delegate< void(entt::basic_observer &)>',['../classentt_1_1delegate.html',1,'entt']]], + ['delegate_3c_20void_28void_20_2a_29_3e_134',['delegate< void(void *)>',['../classentt_1_1delegate.html',1,'entt']]], + ['deletion_5fpolicy_135',['deletion_policy',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581',1,'entt']]], + ['delta_5ftype_136',['delta_type',['../classentt_1_1process.html#a625b574ea6d83e3a4933acc3d0279295',1,'entt::process']]], + ['dense_5fmap_137',['dense_map',['../classentt_1_1dense__map.html#ae359eaeb5622f46d311ad104bdf01485',1,'entt::dense_map::dense_map(dense_map &&)=default'],['../classentt_1_1dense__map.html#a352da8efacf3d89715b5892e65b82f66',1,'entt::dense_map::dense_map(dense_map &&other, const allocator_type &allocator)'],['../classentt_1_1dense__map.html#af163bec2cf56f3571000a5fc0145832f',1,'entt::dense_map::dense_map()'],['../classentt_1_1dense__map.html#a096357c0bdb6342d7d304716e41fcea5',1,'entt::dense_map::dense_map(const allocator_type &allocator)'],['../classentt_1_1dense__map.html#af994882512db3e8e8738dab51caa57ce',1,'entt::dense_map::dense_map(const size_type bucket_count, const allocator_type &allocator)'],['../classentt_1_1dense__map.html#a83c1b7ad55e028f5db68a1233f686bce',1,'entt::dense_map::dense_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__map.html#a2b1bdc80b3c5c7c5968a4a93b0df8017',1,'entt::dense_map::dense_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})'],['../classentt_1_1dense__map.html#aaa72d92d87e8020e0ca5f035cd665d8b',1,'entt::dense_map::dense_map(const dense_map &)=default'],['../classentt_1_1dense__map.html#a8924f4faaa1879a84734ec58f11e6662',1,'entt::dense_map::dense_map(const dense_map &other, const allocator_type &allocator)'],['../classentt_1_1dense__map.html',1,'entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >']]], + ['dense_5fmap_3c_20entity_5ftype_2c_20std_3a_3apair_3c_20entity_5ftype_2c_20bool_20_3e_20_3e_138',['dense_map< entity_type, std::pair< entity_type, bool > >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20basic_5fpool_20_3e_2c_20entt_3a_3aidentity_20_3e_139',['dense_map< id_type, std::unique_ptr< basic_pool >, entt::identity >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20entt_3a_3abasic_5fsparse_5fset_20_3e_2c_20entt_3a_3aidentity_20_3e_140',['dense_map< id_type, std::unique_ptr< entt::basic_sparse_set >, entt::identity >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fmap_3c_20id_5ftype_2c_20std_3a_3avector_3c_20std_3a_3apair_3c_20std_3a_3asize_5ft_2c_20bool_20_3e_20_3e_2c_20entt_3a_3aidentity_20_3e_141',['dense_map< id_type, std::vector< std::pair< std::size_t, bool > >, entt::identity >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fset_142',['dense_set',['../classentt_1_1dense__set.html#acb2185a8bef7bb0e248a61605c3b0bca',1,'entt::dense_set::dense_set()'],['../classentt_1_1dense__set.html#ac6e88655aa8ad10f1abec3f096c64161',1,'entt::dense_set::dense_set(const allocator_type &allocator)'],['../classentt_1_1dense__set.html#a4017286b57009e512f2aadd07f31ce53',1,'entt::dense_set::dense_set(const size_type bucket_count, const allocator_type &allocator)'],['../classentt_1_1dense__set.html#aac496ad7374fca92ea770e96571dc3e8',1,'entt::dense_set::dense_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__set.html#abfcf95ebacf7a07bf8935e08688f92cc',1,'entt::dense_set::dense_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})'],['../classentt_1_1dense__set.html#aa84caa4b8ea63cc40d7c96158a35760f',1,'entt::dense_set::dense_set(const dense_set &)=default'],['../classentt_1_1dense__set.html#a68b3b28b433da48bece9ff3abf1d476e',1,'entt::dense_set::dense_set(const dense_set &other, const allocator_type &allocator)'],['../classentt_1_1dense__set.html#a06c7a4acb07f6f2a2f2adb1b05f9e777',1,'entt::dense_set::dense_set(dense_set &&)=default'],['../classentt_1_1dense__set.html#ada9ee844d6f84e1670da4088f0e38361',1,'entt::dense_set::dense_set(dense_set &&other, const allocator_type &allocator)'],['../classentt_1_1dense__set.html',1,'entt::dense_set< Type, Hash, KeyEqual, Allocator >']]], + ['dereference_143',['dereference',['../structentt_1_1adl__meta__pointer__like.html#afa27f416e32b351d85ab1a061c4597bd',1,'entt::adl_meta_pointer_like']]], + ['dereference_5fmeta_5fpointer_5flike_144',['dereference_meta_pointer_like',['../namespaceentt.html#a2ab7b51802157a98106f238335fa7503',1,'entt']]], + ['destroy_145',['destroy',['../structentt_1_1basic__handle.html#aa3a4791483b3390d6d3f95767c240b49',1,'entt::basic_handle::destroy()'],['../structentt_1_1basic__handle.html#aed1520d6f7ca04a6d7180d4d10234f2e',1,'entt::basic_handle::destroy(const version_type version)'],['../classentt_1_1basic__registry.html#a7b2c0368d508a6af2d094a9fc592a4a0',1,'entt::basic_registry::destroy(const entity_type entity)'],['../classentt_1_1basic__registry.html#adc175a0d3bcf83a133c63890c674ceb3',1,'entt::basic_registry::destroy(const entity_type entity, const version_type version)'],['../classentt_1_1basic__registry.html#a6c163dcc335da90e727e2f40e67973b7',1,'entt::basic_registry::destroy(It first, It last)']]], + ['disconnect_146',['disconnect',['../classentt_1_1basic__observer.html#a1337e8f885ca963383e5a3ed2a354955',1,'entt::basic_observer::disconnect()'],['../classentt_1_1basic__dispatcher.html#a6d3929fa7b3de337091f4305a564ba75',1,'entt::basic_dispatcher::disconnect(Type &value_or_instance)'],['../classentt_1_1basic__dispatcher.html#adb5bc2c8ef847a296fe66c230f84569b',1,'entt::basic_dispatcher::disconnect(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a50114245dd8dfb4872f035f36603fc02',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#abbe3bb47e3c295a45360d9ca99e79401',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a095608dfefdbd464edd6fcf858d62e84',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ad6dfd8bfe6c9509fc7eac357c4d7e27b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a43ac539a332574445dc674332bd0726d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()']]], + ['dispatcher_147',['dispatcher',['../namespaceentt.html#a3b9e500ff0298787e120786c6247ba7c',1,'entt']]], + ['dtor_148',['dtor',['../classentt_1_1meta__factory_3_01Type_01_4.html#af17b90b02db12a4e7f8e8327828b501b',1,'entt::meta_factory< Type >']]] ]; diff --git a/search/all_4.js b/search/all_4.js index ff11f2221..5fa1157a1 100644 --- a/search/all_4.js +++ b/search/all_4.js @@ -1,24 +1,25 @@ var searchData= [ - ['each_145',['each',['../classentt_1_1basic__storage.html#af96e8092c6380da54b1edd8fe513618e',1,'entt::basic_storage::each()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ad2bf4f55f4724aba209a8578a1436f1b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a9504ec9cb2f42300b1a1c723b1df7252',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a2660b2e7fd36f8438a564fabcbb8d61d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdd97fb1a4ff44d57b751d2bbb054f61',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each() const'],['../classentt_1_1resource__cache.html#a0af1a225eb2a22f38380fbb6b90ebc5e',1,'entt::resource_cache::each()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aded1e293c764ce80e77edf99c3015670',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a1da3cf6bed972be901bc1de385c4c112',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7a5fd57faabed2807b21b5a6355b3f94',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7e04e6a84be82f491283b8f11f9e93da',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__observer.html#a181a6724835a3a41e33610003f738525',1,'entt::basic_observer::each(Func func) const'],['../classentt_1_1basic__observer.html#a535f3ddf32641a54e1c8861519933c97',1,'entt::basic_observer::each(Func func)'],['../classentt_1_1basic__registry.html#a86d2b035f54225d82548e8f03de28754',1,'entt::basic_registry::each()'],['../classentt_1_1basic__runtime__view.html#a79fe059a28f768f4dc82edf48438cce0',1,'entt::basic_runtime_view::each()'],['../classentt_1_1basic__storage.html#a58a7d59cbbacef83d9c8897ece381b71',1,'entt::basic_storage::each()'],['../classentt_1_1resource__cache.html#aa91fbde235252dadf46ef1effe32bbe0',1,'entt::resource_cache::each()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a6053bb7998214f4c7ee8d6f0102ca5e6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a3160b3ba651856a9796adf396276b6d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each() const']]], - ['emitter_146',['emitter',['../structentt_1_1emitter_1_1connection.html#a0f3bb10ad57dc0e06298fc9ba38a7bd9',1,'entt::emitter::connection::emitter()'],['../classentt_1_1emitter.html#af36907a2dc7cc0a6607533c67e072f92',1,'entt::emitter::emitter()=default'],['../classentt_1_1emitter.html#a842fef69b914a160b0bcc211bb77b27b',1,'entt::emitter::emitter(emitter &&)=default'],['../classentt_1_1emitter.html',1,'entt::emitter< Derived >']]], - ['emplace_147',['emplace',['../classentt_1_1dense__hash__map.html#a43a4f3e5990fa4fe88db5a352d9e0eb5',1,'entt::dense_hash_map::emplace()'],['../classentt_1_1dense__hash__set.html#a0738a2f43b8f2395458a885a598f7ec6',1,'entt::dense_hash_set::emplace()'],['../classentt_1_1basic__any.html#a612abee6a4ebf016df27929668839fc0',1,'entt::basic_any::emplace()'],['../structentt_1_1basic__handle.html#a910e13063772bbd2c14a3287ea913ffd',1,'entt::basic_handle::emplace()'],['../classentt_1_1basic__organizer.html#a9c26a53ceaa41f54d88678b636e96ad5',1,'entt::basic_organizer::emplace(const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#ae28283f55e13443712ddfd29bf01f9f7',1,'entt::basic_organizer::emplace(Type &value_or_instance, const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#abed2a897fe81bd69f85ed9305c1fcdc3',1,'entt::basic_organizer::emplace(function_type *func, const void *payload=nullptr, const char *name=nullptr)'],['../classentt_1_1basic__registry.html#a4c9c0532972adc7a930a50888a97efdf',1,'entt::basic_registry::emplace()'],['../classentt_1_1basic__sparse__set.html#a54e6ca3fb905b6341faae9547e0c4a56',1,'entt::basic_sparse_set::emplace()'],['../classentt_1_1basic__storage.html#a7e6c99b2c108586141a75145748b2e8d',1,'entt::basic_storage::emplace()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a022a515247ef30e35163755e3faaffaa',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::emplace()'],['../classentt_1_1sigh__storage__mixin.html#ae09e60b8a910ebbcca85b8bd188027c3',1,'entt::sigh_storage_mixin::emplace()'],['../classentt_1_1meta__any.html#a3bb2e8e8a5eeb1cfaf1710b43382fef4',1,'entt::meta_any::emplace()'],['../classentt_1_1basic__poly.html#a6aaa4ef03f6f2a599abcf633412d6a8d',1,'entt::basic_poly::emplace()']]], - ['emplace_5for_5freplace_148',['emplace_or_replace',['../structentt_1_1basic__handle.html#a86866a41493a4136f1f50f87bf082e77',1,'entt::basic_handle::emplace_or_replace()'],['../classentt_1_1basic__registry.html#a3bbaebbb9365eef262453e42a8f7dc4b',1,'entt::basic_registry::emplace_or_replace()']]], - ['empty_149',['empty',['../classentt_1_1resource__cache.html#a68ac0bbd5731434c15bee4d7342c359f',1,'entt::resource_cache::empty()'],['../classentt_1_1emitter.html#a08c6111af231c9a82277069a3bf21b75',1,'entt::emitter::empty() const'],['../classentt_1_1emitter.html#ad395b7c4de0f1f6e01a6e1c113db6937',1,'entt::emitter::empty() const'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ad795af78f60131f0b5535379ed2862f8',1,'entt::sigh< Ret(Args...), Allocator >::empty()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afaf6a5593b48f50aa147a622bae61e28',1,'entt::sink< sigh< Ret(Args...), Allocator > >::empty()'],['../classentt_1_1dense__hash__map.html#a033287b193d0b1b2815584f14dafb6c2',1,'entt::dense_hash_map::empty()'],['../classentt_1_1dense__hash__set.html#a5b23a3f7c685e29034f8df10435c52a4',1,'entt::dense_hash_set::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac3ffbc5007d5215df8d602aa16bbaa26',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad8297620981e3f64f2c2ba9122b2330f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__observer.html#a591a0ed89d0b2cabfb51b729bfb33c3e',1,'entt::basic_observer::empty()'],['../classentt_1_1basic__registry.html#a519426ee64b3f6574b99e86b31acca14',1,'entt::basic_registry::empty()'],['../classentt_1_1basic__sparse__set.html#a3617c860500230b880f07215f21cb496',1,'entt::basic_sparse_set::empty()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aac7ae1d31c946459a6987d9f5bc15359',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::empty()'],['../structentt_1_1service__locator.html#ad96474e6acfb0edd0e123c584f79296b',1,'entt::service_locator::empty()'],['../classentt_1_1scheduler.html#af12c8d59db78f91c3fdc144e90f24155',1,'entt::scheduler::empty()']]], - ['end_150',['end',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3ada36e39b06701a9e0b7c7ab0d9cc84',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a0dbbf2ac4441e4f943c463b6b4d100d3',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::end()'],['../classentt_1_1meta__sequence__container.html#a4135860b75cc96aca7fa1212d5b17743',1,'entt::meta_sequence_container::end()'],['../classentt_1_1meta__associative__container.html#a33088db7e4cf2bc52ec2d47fa62d4705',1,'entt::meta_associative_container::end()'],['../structentt_1_1meta__range.html#a57c7d271b68054016e4430c9859a6d43',1,'entt::meta_range::end()'],['../classentt_1_1dense__hash__map.html#a1b3011cbcc1805b087dcfdf92119eff6',1,'entt::dense_hash_map::end() const'],['../classentt_1_1dense__hash__map.html#a9246029ea08502e580a2f2a04afedc78',1,'entt::dense_hash_map::end()'],['../classentt_1_1dense__hash__map.html#af1bbe8c69515bc8f8af4592ca4f8668c',1,'entt::dense_hash_map::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__hash__map.html#a72908cd782450fee8f3fbed2d7486a19',1,'entt::dense_hash_map::end([[maybe_unused]] const size_type index)'],['../classentt_1_1dense__hash__set.html#a79f6b13717510e261bf07616c707a0f2',1,'entt::dense_hash_set::end() const'],['../classentt_1_1dense__hash__set.html#aa44e1d209c5244ef98ae5880c4792379',1,'entt::dense_hash_set::end()'],['../classentt_1_1dense__hash__set.html#a9ee994b6d14ed9feb1b6e5b85a97a216',1,'entt::dense_hash_set::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__hash__set.html#a7690893f55722351b7b390699f943e6e',1,'entt::dense_hash_set::end([[maybe_unused]] const size_type index)'],['../structentt_1_1iterable__adaptor.html#a22e90b6cc6b986e07c3688de97f4a67b',1,'entt::iterable_adaptor::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ab6de232202dda2dd5cb0c76786caa0c9',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a75ba21a338f486624790b81b5cbf2904',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__observer.html#a730adbbd4f425bbf9d69b8bb4a0e2ac2',1,'entt::basic_observer::end()'],['../classentt_1_1basic__runtime__view.html#a5fc38f0e738d83d81a98b65b0e45d30b',1,'entt::basic_runtime_view::end()'],['../classentt_1_1basic__sparse__set.html#a34c40a25499f47f87e13591aa378a0fb',1,'entt::basic_sparse_set::end()'],['../classentt_1_1basic__storage.html#aaf44df9657be2a7975caf69cf92a4d3b',1,'entt::basic_storage::end() const'],['../classentt_1_1basic__storage.html#a19fe48ae234f9725c80948b19e705889',1,'entt::basic_storage::end()']]], - ['enqueue_151',['enqueue',['../classentt_1_1dispatcher.html#a1e0a488354698cbf3cba82396ac4b76e',1,'entt::dispatcher::enqueue(Event &&event)'],['../classentt_1_1dispatcher.html#a328a3693688d02f17356aec3ad0e0e24',1,'entt::dispatcher::enqueue(Args &&...args)']]], - ['entities_152',['entities',['../classentt_1_1basic__snapshot.html#a79fe1641f3b448b37b8aecfcabf52a5e',1,'entt::basic_snapshot::entities()'],['../classentt_1_1basic__snapshot__loader.html#a0ee608c24b47e2f54a1224177a0dc741',1,'entt::basic_snapshot_loader::entities()'],['../classentt_1_1basic__continuous__loader.html#ae6655c1c6868b11f2781cec2aee77abb',1,'entt::basic_continuous_loader::entities()']]], - ['entity_153',['entity',['../structentt_1_1basic__handle.html#a2710bc7f03d90693bbccceb3364e9494',1,'entt::basic_handle::entity()'],['../namespaceentt.html#a0b54e231d069e8a231e14b223388808a',1,'entt::entity()']]], - ['entity_5ftype_154',['entity_type',['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aad06de6f2dce8a44864026f4584176f1',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::entity_type()'],['../classentt_1_1sigh__storage__mixin.html#a031de2e34d8e3b4f99e6677e57a71fc7',1,'entt::sigh_storage_mixin::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2f18a277939bc391d972a284fdae5bef',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab39810cc33432d0ad315dae49ca0dbfe',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adea05bc43d16114d95b1596eb05736e3',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1entt__traits.html#a1d427b42c48fa8e384adf2e1bc858c7e',1,'entt::entt_traits::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a0d01c979940e44632742a6953f9ae618',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../structentt_1_1basic__handle.html#a4788afd7aa378b5ec2e44bf52f5bec14',1,'entt::basic_handle::entity_type()'],['../structentt_1_1as__view.html#ae9599a1614990478c3331fbf562f36c7',1,'entt::as_view::entity_type()'],['../structentt_1_1as__group.html#ab9e7aee21b99a979368535a5d5054137',1,'entt::as_group::entity_type()'],['../classentt_1_1basic__observer.html#af7a57f53ed7a6c835129480ff6594f7d',1,'entt::basic_observer::entity_type()'],['../classentt_1_1basic__organizer.html#a36b865f5d3802e48a0fa027c43e3a39c',1,'entt::basic_organizer::entity_type()'],['../classentt_1_1basic__registry.html#a7df39ef4ca62af9540f593dfb5550138',1,'entt::basic_registry::entity_type()'],['../classentt_1_1basic__runtime__view.html#a7ede80f53e93473099819167d42bf2f1',1,'entt::basic_runtime_view::entity_type()'],['../classentt_1_1basic__snapshot.html#aeb9724b67563bf7f74440e5a8feb711c',1,'entt::basic_snapshot::entity_type()'],['../classentt_1_1basic__snapshot__loader.html#a73d5864a57a78d528cc0bcbe36ff5039',1,'entt::basic_snapshot_loader::entity_type()'],['../classentt_1_1basic__continuous__loader.html#a90a0d33147978cb3c142408487428277',1,'entt::basic_continuous_loader::entity_type()'],['../classentt_1_1basic__sparse__set.html#a91c6508fa13b0b3e27679c3c814e6148',1,'entt::basic_sparse_set::entity_type()'],['../classentt_1_1basic__storage.html#abb0956e379c629ba413b4856baf5dc88',1,'entt::basic_storage::entity_type()']]], - ['entt_155',['entt',['../namespaceentt.html',1,'']]], - ['entt_20and_20unreal_20engine_156',['EnTT and Unreal Engine',['../md_docs_md_unreal.html',1,'']]], - ['entt_20in_20action_157',['EnTT in Action',['../md_docs_md_links.html',1,'']]], - ['entt_5ftraits_158',['entt_traits',['../classentt_1_1entt__traits.html',1,'entt']]], - ['enum_5fas_5fbitmask_159',['enum_as_bitmask',['../structentt_1_1enum__as__bitmask.html',1,'entt']]], - ['enum_5fas_5fbitmask_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28type_3a_3a_5fentt_5fenum_5fas_5fbitmask_29_3e_20_3e_160',['enum_as_bitmask< Type, std::void_t< decltype(Type::_entt_enum_as_bitmask)> >',['../structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html',1,'entt']]], - ['enum_5fas_5fbitmask_5fv_161',['enum_as_bitmask_v',['../namespaceentt.html#a8378b9330b5c90b6b11deee3637ebca6',1,'entt']]], - ['erase_162',['erase',['../classentt_1_1dense__hash__map.html#a9e7c762714af6e758140d4623c238c0c',1,'entt::dense_hash_map::erase(const_iterator pos)'],['../classentt_1_1dense__hash__map.html#a61032bc0a20016eacde54c9de2d5bf9a',1,'entt::dense_hash_map::erase(const_iterator first, const_iterator last)'],['../classentt_1_1dense__hash__map.html#a1b98dc9a6785a47f0db02028ab379c36',1,'entt::dense_hash_map::erase(const key_type &key)'],['../classentt_1_1dense__hash__set.html#a3bb014446d081e614e1738cf79a6077a',1,'entt::dense_hash_set::erase(const_iterator pos)'],['../classentt_1_1dense__hash__set.html#a6f1eb82a03cb9a73798d7306a651d4d1',1,'entt::dense_hash_set::erase(const value_type &value)'],['../structentt_1_1basic__handle.html#acf95b97a6facfb65d4405d944e390c68',1,'entt::basic_handle::erase()'],['../classentt_1_1basic__registry.html#ad7a51ade7ff181d7aa0b35915d0a4f2b',1,'entt::basic_registry::erase(const entity_type entity)'],['../classentt_1_1basic__registry.html#a887809806fd5188fe141525aad138a6c',1,'entt::basic_registry::erase(It first, It last)'],['../classentt_1_1basic__sparse__set.html#a0a41589e81003ca86b8a6104842680cb',1,'entt::basic_sparse_set::erase(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#a1f3bad1bb267d515e61fd717f4dbb011',1,'entt::basic_sparse_set::erase(It first, It last)'],['../classentt_1_1meta__sequence__container.html#aa9217ce5b5060ec970b67f25eacef021',1,'entt::meta_sequence_container::erase()'],['../classentt_1_1meta__associative__container.html#ab171d3ca8fd0787911540ac8c7cb2818',1,'entt::meta_associative_container::erase()'],['../classentt_1_1emitter.html#a9525364769b8daf55dd942599aa0a09c',1,'entt::emitter::erase()'],['../classentt_1_1dense__hash__set.html#aced2a3f170ca6dcf2d9ed721519c0858',1,'entt::dense_hash_set::erase()']]], - ['exclude_163',['exclude',['../namespaceentt.html#a5b73210cef43c4db35ef8ce477cc38a6',1,'entt']]], - ['exclude_5ft_164',['exclude_t',['../structentt_1_1exclude__t.html',1,'entt']]], - ['extent_165',['extent',['../classentt_1_1basic__sparse__set.html#a9df44971fcaba319e05955a2943baa14',1,'entt::basic_sparse_set']]] + ['each_149',['each',['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a6053bb7998214f4c7ee8d6f0102ca5e6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a2660b2e7fd36f8438a564fabcbb8d61d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdd97fb1a4ff44d57b751d2bbb054f61',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aded1e293c764ce80e77edf99c3015670',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a1da3cf6bed972be901bc1de385c4c112',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7a5fd57faabed2807b21b5a6355b3f94',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7e04e6a84be82f491283b8f11f9e93da',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__observer.html#a181a6724835a3a41e33610003f738525',1,'entt::basic_observer::each(Func func) const'],['../classentt_1_1basic__observer.html#a535f3ddf32641a54e1c8861519933c97',1,'entt::basic_observer::each(Func func)'],['../classentt_1_1basic__registry.html#a86d2b035f54225d82548e8f03de28754',1,'entt::basic_registry::each()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#ac01f845d06ff929c7318fd7b123a3f7e',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::each()'],['../classentt_1_1basic__storage.html#a58a7d59cbbacef83d9c8897ece381b71',1,'entt::basic_storage::each()'],['../classentt_1_1basic__storage.html#af96e8092c6380da54b1edd8fe513618e',1,'entt::basic_storage::each() const'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a3160b3ba651856a9796adf396276b6d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ad2bf4f55f4724aba209a8578a1436f1b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a9504ec9cb2f42300b1a1c723b1df7252',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each() const']]], + ['emitter_150',['emitter',['../structentt_1_1emitter_1_1connection.html#a0f3bb10ad57dc0e06298fc9ba38a7bd9',1,'entt::emitter::connection::emitter()'],['../classentt_1_1emitter.html#af36907a2dc7cc0a6607533c67e072f92',1,'entt::emitter::emitter()=default'],['../classentt_1_1emitter.html#a842fef69b914a160b0bcc211bb77b27b',1,'entt::emitter::emitter(emitter &&)=default'],['../classentt_1_1emitter.html',1,'entt::emitter< Derived >']]], + ['emplace_151',['emplace',['../classentt_1_1basic__storage.html#a7e6c99b2c108586141a75145748b2e8d',1,'entt::basic_storage::emplace()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ae3f1982eeb9d1dbcf61b55091df2e9a5',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::emplace()'],['../structentt_1_1locator.html#ab01151d77654a589cc94b302ced3c679',1,'entt::locator::emplace()'],['../classentt_1_1meta__any.html#a3bb2e8e8a5eeb1cfaf1710b43382fef4',1,'entt::meta_any::emplace()'],['../classentt_1_1basic__poly.html#a6aaa4ef03f6f2a599abcf633412d6a8d',1,'entt::basic_poly::emplace()'],['../classentt_1_1dense__map.html#aae95d12d4f3b6db611fd9d061b242596',1,'entt::dense_map::emplace()'],['../classentt_1_1dense__set.html#a2cf312c6d6d94d701db9674ca24a2353',1,'entt::dense_set::emplace()'],['../classentt_1_1basic__any.html#a612abee6a4ebf016df27929668839fc0',1,'entt::basic_any::emplace()'],['../structentt_1_1basic__handle.html#a910e13063772bbd2c14a3287ea913ffd',1,'entt::basic_handle::emplace()'],['../classentt_1_1basic__organizer.html#a9c26a53ceaa41f54d88678b636e96ad5',1,'entt::basic_organizer::emplace(const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#ae28283f55e13443712ddfd29bf01f9f7',1,'entt::basic_organizer::emplace(Type &value_or_instance, const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#abed2a897fe81bd69f85ed9305c1fcdc3',1,'entt::basic_organizer::emplace(function_type *func, const void *payload=nullptr, const char *name=nullptr)'],['../classentt_1_1basic__registry.html#a4c9c0532972adc7a930a50888a97efdf',1,'entt::basic_registry::emplace()'],['../classentt_1_1sigh__storage__mixin.html#ae09e60b8a910ebbcca85b8bd188027c3',1,'entt::sigh_storage_mixin::emplace()'],['../classentt_1_1basic__sparse__set.html#a5b8e9abf9cbe8e9955b4f6f12f4c19b2',1,'entt::basic_sparse_set::emplace()']]], + ['emplace_5for_5freplace_152',['emplace_or_replace',['../structentt_1_1basic__handle.html#a86866a41493a4136f1f50f87bf082e77',1,'entt::basic_handle::emplace_or_replace()'],['../classentt_1_1basic__registry.html#a3bbaebbb9365eef262453e42a8f7dc4b',1,'entt::basic_registry::emplace_or_replace()']]], + ['empty_153',['empty',['../classentt_1_1resource__cache.html#a764d7a559461002c10c4163bf31609dc',1,'entt::resource_cache::empty()'],['../classentt_1_1emitter.html#a08c6111af231c9a82277069a3bf21b75',1,'entt::emitter::empty() const'],['../classentt_1_1emitter.html#ad395b7c4de0f1f6e01a6e1c113db6937',1,'entt::emitter::empty() const'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ad795af78f60131f0b5535379ed2862f8',1,'entt::sigh< Ret(Args...), Allocator >::empty()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afaf6a5593b48f50aa147a622bae61e28',1,'entt::sink< sigh< Ret(Args...), Allocator > >::empty()'],['../classentt_1_1dense__map.html#aea10a92374160b51ee9ed3e6478c0794',1,'entt::dense_map::empty()'],['../classentt_1_1dense__set.html#a09be88c9817f9ab0a7cfbfb584a3c0b3',1,'entt::dense_set::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac3ffbc5007d5215df8d602aa16bbaa26',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad8297620981e3f64f2c2ba9122b2330f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__observer.html#a591a0ed89d0b2cabfb51b729bfb33c3e',1,'entt::basic_observer::empty()'],['../classentt_1_1basic__registry.html#a519426ee64b3f6574b99e86b31acca14',1,'entt::basic_registry::empty()'],['../classentt_1_1basic__sparse__set.html#a3617c860500230b880f07215f21cb496',1,'entt::basic_sparse_set::empty()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aac7ae1d31c946459a6987d9f5bc15359',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::empty()'],['../classentt_1_1scheduler.html#af12c8d59db78f91c3fdc144e90f24155',1,'entt::scheduler::empty()']]], + ['end_154',['end',['../classentt_1_1meta__sequence__container.html#a4135860b75cc96aca7fa1212d5b17743',1,'entt::meta_sequence_container::end()'],['../classentt_1_1meta__associative__container.html#a33088db7e4cf2bc52ec2d47fa62d4705',1,'entt::meta_associative_container::end()'],['../structentt_1_1meta__range.html#a57c7d271b68054016e4430c9859a6d43',1,'entt::meta_range::end()'],['../classentt_1_1resource__cache.html#af1cc6e780dbb6f51e7148051c0b24202',1,'entt::resource_cache::end() const'],['../classentt_1_1resource__cache.html#a0701aef8b311f0f2801d889a926bce9c',1,'entt::resource_cache::end()'],['../classentt_1_1dense__map.html#a99770e28badfb2f0fed214c1f98af532',1,'entt::dense_map::end() const'],['../classentt_1_1dense__map.html#a4483cb816f7a534a52abe915256e59fb',1,'entt::dense_map::end()'],['../classentt_1_1dense__map.html#a8f189067d9876f13f15ad94deaff1fcd',1,'entt::dense_map::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__map.html#a93abf3bc3a57a4ecf3c2d899ae9614e1',1,'entt::dense_map::end([[maybe_unused]] const size_type index)'],['../classentt_1_1dense__set.html#a406d8a3b304f0c297f070ce430ca8e28',1,'entt::dense_set::end() const'],['../classentt_1_1dense__set.html#ab9b6cf5f94c9f86d8f227321e6e0247c',1,'entt::dense_set::end()'],['../classentt_1_1dense__set.html#a95160ca1c1af1ac0d036eddf11b1fe42',1,'entt::dense_set::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__set.html#a56deb9de4bb522af0bac4eccd1d10dfa',1,'entt::dense_set::end([[maybe_unused]] const size_type index)'],['../structentt_1_1iterable__adaptor.html#a91d5e906cec2aeae1289ac8f06774295',1,'entt::iterable_adaptor::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ab6de232202dda2dd5cb0c76786caa0c9',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a75ba21a338f486624790b81b5cbf2904',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__observer.html#a730adbbd4f425bbf9d69b8bb4a0e2ac2',1,'entt::basic_observer::end()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#ac91472891e1c83bd5e3d7b3936268148',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::end()'],['../classentt_1_1basic__sparse__set.html#a34c40a25499f47f87e13591aa378a0fb',1,'entt::basic_sparse_set::end()'],['../classentt_1_1basic__storage.html#aaf44df9657be2a7975caf69cf92a4d3b',1,'entt::basic_storage::end() const'],['../classentt_1_1basic__storage.html#a19fe48ae234f9725c80948b19e705889',1,'entt::basic_storage::end()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3ada36e39b06701a9e0b7c7ab0d9cc84',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a0dbbf2ac4441e4f943c463b6b4d100d3',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::end()']]], + ['enqueue_155',['enqueue',['../classentt_1_1basic__dispatcher.html#aefeb6cfbb14cf16ad7bee0148a324867',1,'entt::basic_dispatcher::enqueue(Args &&...args)'],['../classentt_1_1basic__dispatcher.html#a20300e90ffc19c714c071aecd3539523',1,'entt::basic_dispatcher::enqueue(Event &&event)']]], + ['enqueue_5fhint_156',['enqueue_hint',['../classentt_1_1basic__dispatcher.html#a3da25e303527faa6f57616a077333681',1,'entt::basic_dispatcher::enqueue_hint(const id_type id, Args &&...args)'],['../classentt_1_1basic__dispatcher.html#acb5874579dc28c664c265883a49cad8f',1,'entt::basic_dispatcher::enqueue_hint(const id_type id, Event &&event)']]], + ['entities_157',['entities',['../classentt_1_1basic__snapshot.html#a79fe1641f3b448b37b8aecfcabf52a5e',1,'entt::basic_snapshot::entities()'],['../classentt_1_1basic__snapshot__loader.html#a0ee608c24b47e2f54a1224177a0dc741',1,'entt::basic_snapshot_loader::entities()'],['../classentt_1_1basic__continuous__loader.html#ae6655c1c6868b11f2781cec2aee77abb',1,'entt::basic_continuous_loader::entities()']]], + ['entity_158',['entity',['../structentt_1_1basic__handle.html#a2710bc7f03d90693bbccceb3364e9494',1,'entt::basic_handle::entity()'],['../namespaceentt.html#a0b54e231d069e8a231e14b223388808a',1,'entt::entity()']]], + ['entity_5ftype_159',['entity_type',['../classentt_1_1basic__storage.html#abb0956e379c629ba413b4856baf5dc88',1,'entt::basic_storage::entity_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aad06de6f2dce8a44864026f4584176f1',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2f18a277939bc391d972a284fdae5bef',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab39810cc33432d0ad315dae49ca0dbfe',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adea05bc43d16114d95b1596eb05736e3',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1entt__traits.html#a1d427b42c48fa8e384adf2e1bc858c7e',1,'entt::entt_traits::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a0d01c979940e44632742a6953f9ae618',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../structentt_1_1basic__handle.html#a4788afd7aa378b5ec2e44bf52f5bec14',1,'entt::basic_handle::entity_type()'],['../structentt_1_1as__view.html#ae9599a1614990478c3331fbf562f36c7',1,'entt::as_view::entity_type()'],['../structentt_1_1as__group.html#ab9e7aee21b99a979368535a5d5054137',1,'entt::as_group::entity_type()'],['../classentt_1_1basic__observer.html#af7a57f53ed7a6c835129480ff6594f7d',1,'entt::basic_observer::entity_type()'],['../classentt_1_1basic__organizer.html#a36b865f5d3802e48a0fa027c43e3a39c',1,'entt::basic_organizer::entity_type()'],['../classentt_1_1basic__registry.html#a7df39ef4ca62af9540f593dfb5550138',1,'entt::basic_registry::entity_type()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#ad55512e74ab9c4b6a5aac21147b9eefe',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::entity_type()'],['../classentt_1_1sigh__storage__mixin.html#a031de2e34d8e3b4f99e6677e57a71fc7',1,'entt::sigh_storage_mixin::entity_type()'],['../classentt_1_1basic__snapshot.html#aeb9724b67563bf7f74440e5a8feb711c',1,'entt::basic_snapshot::entity_type()'],['../classentt_1_1basic__snapshot__loader.html#a73d5864a57a78d528cc0bcbe36ff5039',1,'entt::basic_snapshot_loader::entity_type()'],['../classentt_1_1basic__continuous__loader.html#a90a0d33147978cb3c142408487428277',1,'entt::basic_continuous_loader::entity_type()'],['../classentt_1_1basic__sparse__set.html#a91c6508fa13b0b3e27679c3c814e6148',1,'entt::basic_sparse_set::entity_type()']]], + ['entt_160',['entt',['../namespaceentt.html',1,'']]], + ['entt_20and_20unreal_20engine_161',['EnTT and Unreal Engine',['../md_docs_md_unreal.html',1,'']]], + ['entt_20in_20action_162',['EnTT in Action',['../md_docs_md_links.html',1,'']]], + ['entt_5ftraits_163',['entt_traits',['../classentt_1_1entt__traits.html',1,'entt']]], + ['enum_5fas_5fbitmask_164',['enum_as_bitmask',['../structentt_1_1enum__as__bitmask.html',1,'entt']]], + ['enum_5fas_5fbitmask_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28type_3a_3a_5fentt_5fenum_5fas_5fbitmask_29_3e_20_3e_165',['enum_as_bitmask< Type, std::void_t< decltype(Type::_entt_enum_as_bitmask)> >',['../structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html',1,'entt']]], + ['enum_5fas_5fbitmask_5fv_166',['enum_as_bitmask_v',['../namespaceentt.html#a8378b9330b5c90b6b11deee3637ebca6',1,'entt']]], + ['erase_167',['erase',['../classentt_1_1dense__map.html#a83036e3f167d28ba9afa943271fb5587',1,'entt::dense_map::erase(const_iterator pos)'],['../classentt_1_1dense__map.html#a49bb9a8de8e27cff97395d4fc527ad04',1,'entt::dense_map::erase(const_iterator first, const_iterator last)'],['../classentt_1_1dense__map.html#a12d1730a14bac304cbd173c05cb2cbf2',1,'entt::dense_map::erase(const key_type &key)'],['../classentt_1_1dense__set.html#ad4ada548c135e15f963efcbdac476e1b',1,'entt::dense_set::erase(const_iterator pos)'],['../classentt_1_1dense__set.html#a2c82fe5721d008445d6bb9af2448cbcd',1,'entt::dense_set::erase(const_iterator first, const_iterator last)'],['../classentt_1_1dense__set.html#abe614f630f49556a49f65c7ed3e1183a',1,'entt::dense_set::erase(const value_type &value)'],['../structentt_1_1basic__handle.html#acf95b97a6facfb65d4405d944e390c68',1,'entt::basic_handle::erase()'],['../classentt_1_1basic__registry.html#a887809806fd5188fe141525aad138a6c',1,'entt::basic_registry::erase()'],['../classentt_1_1basic__sparse__set.html#a0a41589e81003ca86b8a6104842680cb',1,'entt::basic_sparse_set::erase(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#a1f3bad1bb267d515e61fd717f4dbb011',1,'entt::basic_sparse_set::erase(It first, It last)'],['../classentt_1_1meta__sequence__container.html#aa9217ce5b5060ec970b67f25eacef021',1,'entt::meta_sequence_container::erase()'],['../classentt_1_1meta__associative__container.html#ab171d3ca8fd0787911540ac8c7cb2818',1,'entt::meta_associative_container::erase()'],['../classentt_1_1resource__cache.html#a59fd1af63515fbb9e9ed26cb13dbe041',1,'entt::resource_cache::erase(const_iterator pos)'],['../classentt_1_1resource__cache.html#af9938c0c0228fd59b67470e7a904cf3a',1,'entt::resource_cache::erase(const_iterator first, const_iterator last)'],['../classentt_1_1resource__cache.html#a0166a373140e75be2c5b41ccd39d8375',1,'entt::resource_cache::erase(const id_type id)'],['../classentt_1_1emitter.html#a9525364769b8daf55dd942599aa0a09c',1,'entt::emitter::erase()'],['../classentt_1_1basic__registry.html#ad7a51ade7ff181d7aa0b35915d0a4f2b',1,'entt::basic_registry::erase()']]], + ['exclude_168',['exclude',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#afc46e46972b73a235058399f5514c402',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::exclude()'],['../namespaceentt.html#a5b73210cef43c4db35ef8ce477cc38a6',1,'entt::exclude()']]], + ['exclude_5ft_169',['exclude_t',['../structentt_1_1exclude__t.html',1,'entt']]], + ['extent_170',['extent',['../classentt_1_1basic__sparse__set.html#a9df44971fcaba319e05955a2943baa14',1,'entt::basic_sparse_set']]] ]; diff --git a/search/all_5.js b/search/all_5.js index bb9349fef..30e07d57e 100644 --- a/search/all_5.js +++ b/search/all_5.js @@ -1,17 +1,18 @@ var searchData= [ - ['fail_166',['fail',['../classentt_1_1process.html#a43cb8f82148fb6d688fcc9eca358892a',1,'entt::process']]], - ['family_167',['family',['../classentt_1_1family.html',1,'entt']]], - ['family_5ftype_168',['family_type',['../classentt_1_1family.html#ab2ede62709be8a4a63329ed2594cd181',1,'entt::family']]], - ['fast_5fmod_169',['fast_mod',['../namespaceentt.html#a28fe7952c2a11ebc2b47d95fb749adda',1,'entt']]], - ['find_170',['find',['../classentt_1_1dense__hash__map.html#a3fd2b636b76186f0ca533272f9d0cdc9',1,'entt::dense_hash_map::find(const key_type &key)'],['../classentt_1_1dense__hash__map.html#a241db02c8b817ddcc719852d94983d03',1,'entt::dense_hash_map::find(const key_type &key) const'],['../classentt_1_1dense__hash__map.html#ad7a4f36d1824b400e1cde0d489425112',1,'entt::dense_hash_map::find(const Other &key)'],['../classentt_1_1dense__hash__map.html#aa1cfdc510527f6d26a29097f368d5d6d',1,'entt::dense_hash_map::find(const Other &key) const'],['../classentt_1_1dense__hash__set.html#a0e811a6c5e27c8ecbbd0881f3f4e984a',1,'entt::dense_hash_set::find(const value_type &value)'],['../classentt_1_1dense__hash__set.html#afe3dd99554cfe0133a9daaa103993084',1,'entt::dense_hash_set::find(const value_type &value) const'],['../classentt_1_1dense__hash__set.html#af896fa38e01405f432196eab938e6fa2',1,'entt::dense_hash_set::find(const Other &value)'],['../classentt_1_1dense__hash__set.html#a21ec1289ede45e871ba74cc7152fde25',1,'entt::dense_hash_set::find(const Other &value) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac2d477372d9e935a65a48837fdcf9bcb',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad4b27437cb2afe0d10895c947fdd8b4e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__sparse__set.html#a82ea72545db86b1c25a790772d015c3d',1,'entt::basic_sparse_set::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a287ba682eec0501138b8ffd0802f3d75',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a563cf005cc97d5684cebb8e7e56c0ee5',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::find()'],['../classentt_1_1meta__associative__container.html#a2886d0a5df87b31cb7c8804ab097b585',1,'entt::meta_associative_container::find()']]], - ['finished_171',['finished',['../classentt_1_1process.html#a5de9babd993af32324cf044102e0c5b2',1,'entt::process']]], - ['first_172',['first',['../classentt_1_1compressed__pair.html#ad1a1aa91e51aff649bbcf4110a3a42bc',1,'entt::compressed_pair::first() const'],['../classentt_1_1compressed__pair.html#a805ab68ef0b7776421ee4bf8e06110b8',1,'entt::compressed_pair::first()']]], - ['first_5ftype_173',['first_type',['../classentt_1_1compressed__pair.html#a6db727eef0bb9927d0d299f6a620005a',1,'entt::compressed_pair']]], - ['forward_5fas_5fany_174',['forward_as_any',['../namespaceentt.html#a810f66c2c91deba50f96cae9119f2feb',1,'entt']]], - ['forward_5fas_5fmeta_175',['forward_as_meta',['../namespaceentt.html#a77c7a5a8ac08bc879abdaa00f920a996',1,'entt']]], - ['frequently_20asked_20questions_176',['Frequently Asked Questions',['../md_docs_md_faq.html',1,'']]], - ['front_177',['front',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a93c6dc5202ec19f518cafc6ccee7b8d0',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a4eac71cfa295892fb8a8171cd2c7ad06',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa19f76497105652b9d238f80bec72623',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a37b3245c9540f3122f9e791c6210d183',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::front()']]], - ['func_178',['func',['../classentt_1_1meta__factory_3_01Type_01_4.html#aaa7071ebe16911bc60f1cac87d119611',1,'entt::meta_factory< Type >::func()'],['../classentt_1_1meta__type.html#a28ca81206511c7f9aa55cca85e687a5d',1,'entt::meta_type::func() const'],['../classentt_1_1meta__type.html#a3e345e527b4f36c2146254e1ed9b6649',1,'entt::meta_type::func(const id_type id) const']]], - ['function_5ftype_179',['function_type',['../classentt_1_1basic__organizer.html#a8eb83a2af62a10e9515776b8f26b1edc',1,'entt::basic_organizer::function_type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a1a5ceebde7cebde69a1b2022f539a656',1,'entt::delegate< Ret(Args...)>::function_type()']]] + ['fail_171',['fail',['../classentt_1_1process.html#a43cb8f82148fb6d688fcc9eca358892a',1,'entt::process']]], + ['family_172',['family',['../classentt_1_1family.html',1,'entt']]], + ['family_5ftype_173',['family_type',['../classentt_1_1family.html#ab2ede62709be8a4a63329ed2594cd181',1,'entt::family']]], + ['fast_5fmod_174',['fast_mod',['../namespaceentt.html#a28fe7952c2a11ebc2b47d95fb749adda',1,'entt']]], + ['find_175',['find',['../classentt_1_1dense__map.html#a77aa062268245a84c4c27dcc01839814',1,'entt::dense_map::find(const key_type &key)'],['../classentt_1_1dense__map.html#a5b47e5c447352298fca87921774c4a3d',1,'entt::dense_map::find(const key_type &key) const'],['../classentt_1_1dense__map.html#ab38c37f74845b4fcee780be50a4468bd',1,'entt::dense_map::find(const Other &key)'],['../classentt_1_1dense__map.html#afe6fec31e84e2783bc7b740d4373e5ec',1,'entt::dense_map::find(const Other &key) const'],['../classentt_1_1dense__set.html#a3cb64f1ed07507fc9ecbc6f94e582e44',1,'entt::dense_set::find(const value_type &value)'],['../classentt_1_1dense__set.html#a6e8732dc86fd8f04f585deebb0b39ad5',1,'entt::dense_set::find(const value_type &value) const'],['../classentt_1_1dense__set.html#a66102dbe9ecb0e7e70f33b1b012ba288',1,'entt::dense_set::find(const Other &value)'],['../classentt_1_1dense__set.html#aaecba9bf17f757c52d1caee78c6ca2b1',1,'entt::dense_set::find(const Other &value) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac2d477372d9e935a65a48837fdcf9bcb',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad4b27437cb2afe0d10895c947fdd8b4e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__sparse__set.html#a82ea72545db86b1c25a790772d015c3d',1,'entt::basic_sparse_set::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a287ba682eec0501138b8ffd0802f3d75',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a563cf005cc97d5684cebb8e7e56c0ee5',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::find()'],['../classentt_1_1meta__associative__container.html#a2886d0a5df87b31cb7c8804ab097b585',1,'entt::meta_associative_container::find()']]], + ['finished_176',['finished',['../classentt_1_1process.html#a5de9babd993af32324cf044102e0c5b2',1,'entt::process']]], + ['first_177',['first',['../classentt_1_1compressed__pair.html#ad1a1aa91e51aff649bbcf4110a3a42bc',1,'entt::compressed_pair::first() const'],['../classentt_1_1compressed__pair.html#a805ab68ef0b7776421ee4bf8e06110b8',1,'entt::compressed_pair::first()']]], + ['first_5ftype_178',['first_type',['../classentt_1_1compressed__pair.html#a6db727eef0bb9927d0d299f6a620005a',1,'entt::compressed_pair']]], + ['force_5fload_179',['force_load',['../classentt_1_1resource__cache.html#a3a29a1bce27e98fd4f8407fb9eb5b58e',1,'entt::resource_cache']]], + ['forward_5fas_5fany_180',['forward_as_any',['../namespaceentt.html#a810f66c2c91deba50f96cae9119f2feb',1,'entt']]], + ['forward_5fas_5fmeta_181',['forward_as_meta',['../namespaceentt.html#a77c7a5a8ac08bc879abdaa00f920a996',1,'entt']]], + ['frequently_20asked_20questions_182',['Frequently Asked Questions',['../md_docs_md_faq.html',1,'']]], + ['front_183',['front',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a93c6dc5202ec19f518cafc6ccee7b8d0',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a4eac71cfa295892fb8a8171cd2c7ad06',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa19f76497105652b9d238f80bec72623',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a37b3245c9540f3122f9e791c6210d183',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::front()']]], + ['func_184',['func',['../classentt_1_1meta__factory_3_01Type_01_4.html#aaa7071ebe16911bc60f1cac87d119611',1,'entt::meta_factory< Type >::func()'],['../classentt_1_1meta__type.html#a28ca81206511c7f9aa55cca85e687a5d',1,'entt::meta_type::func() const'],['../classentt_1_1meta__type.html#a3e345e527b4f36c2146254e1ed9b6649',1,'entt::meta_type::func(const id_type id) const']]], + ['function_5ftype_185',['function_type',['../classentt_1_1basic__organizer.html#a8eb83a2af62a10e9515776b8f26b1edc',1,'entt::basic_organizer::function_type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a1a5ceebde7cebde69a1b2022f539a656',1,'entt::delegate< Ret(Args...)>::function_type()']]] ]; diff --git a/search/all_6.js b/search/all_6.js index ba12fb72f..eafa9b87d 100644 --- a/search/all_6.js +++ b/search/all_6.js @@ -1,12 +1,11 @@ var searchData= [ - ['get_180',['get',['../structentt_1_1basic__handle.html#a1e27c0778d8018e7c54249a365716127',1,'entt::basic_handle::get()'],['../classentt_1_1compressed__pair.html#a26925f0fdea3a43aab4bb53763a377af',1,'entt::compressed_pair::get()'],['../classentt_1_1compressed__pair.html#a74e585a52a150969030cf28867de1ca5',1,'entt::compressed_pair::get() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a242ad9c9470fb5eb0768dff41fc5daf6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a36ff5e13b90d71785c78020e9ee999d9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../classentt_1_1basic__storage.html#afdb98de467567bf81772382ba2970413',1,'entt::basic_storage::get()'],['../classentt_1_1basic__registry.html#a3a683bb33971cc5a0bbbf4a9409208df',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity) const'],['../classentt_1_1basic__registry.html#a0b1a73cf6349646adfd6a6715be93df1',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity)'],['../classentt_1_1basic__sparse__set.html#a5cb0c7a8bab49d31b3351739209b24d0',1,'entt::basic_sparse_set::get(const entity_type entt) const'],['../classentt_1_1basic__sparse__set.html#af14c08f49b27ce6404d1603b0c28f472',1,'entt::basic_sparse_set::get(const entity_type entt)'],['../namespaceentt.html#a8c24ecc5ab0055f9f2a4725c95afb29e',1,'entt::get()'],['../classentt_1_1basic__storage.html#a05808e1a5b2f90d23fb01fb15a1effba',1,'entt::basic_storage::get()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aa4e1de1896a651e5dd15a332fa95e4cc',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ac36208f2be65bfcd89f82198d34f40aa',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aec4e611c49123dfed2fbf3944ad91144',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../structentt_1_1service__locator.html#a88134390e70265359dda08f5aba2877f',1,'entt::service_locator::get()'],['../classentt_1_1meta__any.html#a57e3fcd87f90240e6152324ab8e761dc',1,'entt::meta_any::get(const id_type id) const'],['../classentt_1_1meta__any.html#ac79a3b8f874ad75bcccaa2055dc730fb',1,'entt::meta_any::get(const id_type id)'],['../structentt_1_1meta__data.html#a754da41b4c8057f7c9a3ff4738935d04',1,'entt::meta_data::get()'],['../classentt_1_1meta__type.html#ab702cf8050c2625eaf9e4c82c8381117',1,'entt::meta_type::get()'],['../classentt_1_1resource__handle.html#a31d8af87e1bf0fd0502da76fd2797cfd',1,'entt::resource_handle::get()']]], - ['get_5fallocator_181',['get_allocator',['../classentt_1_1dense__hash__set.html#a6462c1ffe716a5a9bc9bc9b33d6161d1',1,'entt::dense_hash_set::get_allocator()'],['../classentt_1_1basic__sparse__set.html#ade252400c95d50a4a2dcc97cd1c12de3',1,'entt::basic_sparse_set::get_allocator()'],['../classentt_1_1basic__storage.html#ac59504fc3055e5543c555989e295c4ba',1,'entt::basic_storage::get_allocator()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a2b2fa7fed833654ab4ba5625d5b81af7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_allocator()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a8bd1f4b5715aca937fb047b1493e4926',1,'entt::sigh< Ret(Args...), Allocator >::get_allocator()'],['../classentt_1_1dense__hash__map.html#a611d61b365bc13cad473665e9f474e72',1,'entt::dense_hash_map::get_allocator()']]], - ['get_5fas_5ftuple_182',['get_as_tuple',['../classentt_1_1basic__storage.html#afcf228fe6c79886e49ce98274a80dcc3',1,'entt::basic_storage::get_as_tuple(const entity_type entt) const'],['../classentt_1_1basic__storage.html#a4fef4784b0834dd36644746dde9f4f84',1,'entt::basic_storage::get_as_tuple(const entity_type entt)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a7f4f6cd9032955d975bc7da5e5577231',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_as_tuple()']]], - ['get_5fat_183',['get_at',['../classentt_1_1basic__sparse__set.html#a47d951c4f97bfb7f871d1a2bcc475e7c',1,'entt::basic_sparse_set::get_at()'],['../classentt_1_1basic__storage.html#a861f8c31572ffcf76c8cc0c0e83945e7',1,'entt::basic_storage::get_at()']]], - ['get_5for_5femplace_184',['get_or_emplace',['../structentt_1_1basic__handle.html#ad992486f889906c7e15d38a1b9d9e842',1,'entt::basic_handle::get_or_emplace()'],['../classentt_1_1basic__registry.html#a9c355683752313135c209bc7ba9820bc',1,'entt::basic_registry::get_or_emplace()']]], - ['get_5ft_185',['get_t',['../structentt_1_1get__t.html',1,'entt']]], - ['graph_186',['graph',['../classentt_1_1basic__organizer.html#abb49a4c59833592036dce927cae6143d',1,'entt::basic_organizer']]], - ['group_187',['group',['../structentt_1_1basic__collector_3_4.html#a40cd31653a616e0e87a6f9d840c36d5d',1,'entt::basic_collector<>::group()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a72c0576faa0e9a418fa72fd25987b9f4',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::group()'],['../classentt_1_1basic__registry.html#afcbbbd8a765fa8133d384806d60d5828',1,'entt::basic_registry::group(get_t< Get... >, exclude_t< Exclude... >={})'],['../classentt_1_1basic__registry.html#a51b8e8123331de142d031953a847ac3b',1,'entt::basic_registry::group(exclude_t< Exclude... >={})'],['../namespaceentt.html#a2628e82fa8042f75d817c58fc09c7aaf',1,'entt::group()']]], - ['group_5fif_5fexists_188',['group_if_exists',['../classentt_1_1basic__registry.html#af6565c2b50a938f6a594f6a28bbfd804',1,'entt::basic_registry::group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#aa53e065b954c58908db7eb87e8863612',1,'entt::basic_registry::group_if_exists(exclude_t< Exclude... >={}) const']]] + ['get_186',['get',['../structentt_1_1basic__handle.html#a1e27c0778d8018e7c54249a365716127',1,'entt::basic_handle::get()'],['../classentt_1_1compressed__pair.html#a26925f0fdea3a43aab4bb53763a377af',1,'entt::compressed_pair::get()'],['../classentt_1_1compressed__pair.html#a74e585a52a150969030cf28867de1ca5',1,'entt::compressed_pair::get() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a242ad9c9470fb5eb0768dff41fc5daf6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a36ff5e13b90d71785c78020e9ee999d9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../classentt_1_1basic__storage.html#afdb98de467567bf81772382ba2970413',1,'entt::basic_storage::get()'],['../classentt_1_1basic__registry.html#a3a683bb33971cc5a0bbbf4a9409208df',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity) const'],['../classentt_1_1basic__registry.html#a0b1a73cf6349646adfd6a6715be93df1',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity)'],['../classentt_1_1basic__sparse__set.html#a5cb0c7a8bab49d31b3351739209b24d0',1,'entt::basic_sparse_set::get(const entity_type entt) const'],['../classentt_1_1basic__sparse__set.html#af14c08f49b27ce6404d1603b0c28f472',1,'entt::basic_sparse_set::get(const entity_type entt)'],['../namespaceentt.html#a8c24ecc5ab0055f9f2a4725c95afb29e',1,'entt::get()'],['../classentt_1_1basic__storage.html#a05808e1a5b2f90d23fb01fb15a1effba',1,'entt::basic_storage::get()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aa4e1de1896a651e5dd15a332fa95e4cc',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ac36208f2be65bfcd89f82198d34f40aa',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aec4e611c49123dfed2fbf3944ad91144',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../classentt_1_1meta__any.html#a57e3fcd87f90240e6152324ab8e761dc',1,'entt::meta_any::get(const id_type id) const'],['../classentt_1_1meta__any.html#ac79a3b8f874ad75bcccaa2055dc730fb',1,'entt::meta_any::get(const id_type id)'],['../structentt_1_1meta__data.html#a754da41b4c8057f7c9a3ff4738935d04',1,'entt::meta_data::get()'],['../classentt_1_1meta__type.html#ab702cf8050c2625eaf9e4c82c8381117',1,'entt::meta_type::get()']]], + ['get_5fallocator_187',['get_allocator',['../classentt_1_1dense__map.html#add2b683b0072d4b74e5431ae94b894ca',1,'entt::dense_map::get_allocator()'],['../classentt_1_1dense__set.html#a3db7a9585119a95c8bec8bbb58677790',1,'entt::dense_set::get_allocator()'],['../classentt_1_1basic__sparse__set.html#ade252400c95d50a4a2dcc97cd1c12de3',1,'entt::basic_sparse_set::get_allocator()'],['../classentt_1_1basic__storage.html#ac59504fc3055e5543c555989e295c4ba',1,'entt::basic_storage::get_allocator()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a2b2fa7fed833654ab4ba5625d5b81af7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_allocator()'],['../classentt_1_1resource__cache.html#a7fbba6086da8afe5a19edfb569ccfb21',1,'entt::resource_cache::get_allocator()'],['../classentt_1_1basic__dispatcher.html#a10d41d34e7119af95ee716fbdc99e51f',1,'entt::basic_dispatcher::get_allocator()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a8bd1f4b5715aca937fb047b1493e4926',1,'entt::sigh< Ret(Args...), Allocator >::get_allocator()']]], + ['get_5fas_5ftuple_188',['get_as_tuple',['../classentt_1_1basic__storage.html#afcf228fe6c79886e49ce98274a80dcc3',1,'entt::basic_storage::get_as_tuple(const entity_type entt) const'],['../classentt_1_1basic__storage.html#a4fef4784b0834dd36644746dde9f4f84',1,'entt::basic_storage::get_as_tuple(const entity_type entt)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a7f4f6cd9032955d975bc7da5e5577231',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_as_tuple()']]], + ['get_5for_5femplace_189',['get_or_emplace',['../structentt_1_1basic__handle.html#ad992486f889906c7e15d38a1b9d9e842',1,'entt::basic_handle::get_or_emplace()'],['../classentt_1_1basic__registry.html#a9c355683752313135c209bc7ba9820bc',1,'entt::basic_registry::get_or_emplace()']]], + ['get_5ft_190',['get_t',['../structentt_1_1get__t.html',1,'entt']]], + ['graph_191',['graph',['../classentt_1_1basic__organizer.html#abb49a4c59833592036dce927cae6143d',1,'entt::basic_organizer']]], + ['group_192',['group',['../structentt_1_1basic__collector_3_4.html#a40cd31653a616e0e87a6f9d840c36d5d',1,'entt::basic_collector<>::group()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a72c0576faa0e9a418fa72fd25987b9f4',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::group()'],['../classentt_1_1basic__registry.html#addce99ec727e0879d3d85121b9c44fee',1,'entt::basic_registry::group(get_t< Get... >, exclude_t< Exclude... >={})'],['../classentt_1_1basic__registry.html#ae898414dbf6aa9bb22b54b36e97953ba',1,'entt::basic_registry::group(exclude_t< Exclude... >={})'],['../namespaceentt.html#a2628e82fa8042f75d817c58fc09c7aaf',1,'entt::group()']]], + ['group_5fif_5fexists_193',['group_if_exists',['../classentt_1_1basic__registry.html#a7b9e34350c1b545cf7087adc3e570a3c',1,'entt::basic_registry::group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#aea999ab0b78f773100516b3689a31944',1,'entt::basic_registry::group_if_exists(exclude_t< Exclude... >={}) const']]] ]; diff --git a/search/all_7.js b/search/all_7.js index 001601385..ce5d3dd19 100644 --- a/search/all_7.js +++ b/search/all_7.js @@ -1,11 +1,12 @@ var searchData= [ - ['handle_189',['handle',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a7d59e75c62809a425d642f0f90bb18c5',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a0f42aedec77ad7d0c0434c1539c51c6f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ac41277543f1ce2cb02306a5203a6fc8c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::handle()'],['../classentt_1_1resource__cache.html#a4b5cd3213a1f22aa6b8a5c4ce876a630',1,'entt::resource_cache::handle(const id_type id) const'],['../classentt_1_1resource__cache.html#a616c6f32c7bd4db18be22208a3e88e45',1,'entt::resource_cache::handle(const id_type id)'],['../namespaceentt.html#a5a0027b922894421f703102c374c234c',1,'entt::handle()']]], - ['handle_5fview_190',['handle_view',['../namespaceentt.html#aaa5809ceb50ec17713e8690c20a79490',1,'entt']]], - ['hash_191',['hash',['../classentt_1_1type__info.html#a3d7ec25f2563841a8d7a0d3cf26afb2c',1,'entt::type_info']]], - ['hash_5ffunction_192',['hash_function',['../classentt_1_1dense__hash__map.html#a93e17fb3689d7acf44562c1cfc84d565',1,'entt::dense_hash_map::hash_function()'],['../classentt_1_1dense__hash__set.html#a1e8e74dd32d2ea8cbbc87a71479b0c37',1,'entt::dense_hash_set::hash_function()']]], - ['hash_5ftype_193',['hash_type',['../classentt_1_1basic__hashed__string.html#a1631b1f6ecd56a451366eeb228a6ffb9',1,'entt::basic_hashed_string']]], - ['hashed_5fstring_194',['hashed_string',['../namespaceentt.html#a8f9dd22ce26cd7913a294b3fd520649b',1,'entt']]], - ['hashed_5fwstring_195',['hashed_wstring',['../namespaceentt.html#af2768719b1f5967caf5836b2656d0ed6',1,'entt']]], - ['hasher_196',['hasher',['../classentt_1_1dense__hash__map.html#a21012b59f56628eec6cf4583d0b914f6',1,'entt::dense_hash_map::hasher()'],['../classentt_1_1dense__hash__set.html#aea3f377ae05670c06922cd3a98b1f3b9',1,'entt::dense_hash_set::hasher()']]] + ['handle_194',['handle',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a7d59e75c62809a425d642f0f90bb18c5',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a0f42aedec77ad7d0c0434c1539c51c6f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ac41277543f1ce2cb02306a5203a6fc8c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::handle()'],['../namespaceentt.html#a5a0027b922894421f703102c374c234c',1,'entt::handle()']]], + ['handle_5fview_195',['handle_view',['../namespaceentt.html#aaa5809ceb50ec17713e8690c20a79490',1,'entt']]], + ['has_5fvalue_196',['has_value',['../structentt_1_1locator.html#a8beabd097ab7cb7edc9194b109bc25a2',1,'entt::locator']]], + ['hash_197',['hash',['../structentt_1_1type__info.html#a3d7ec25f2563841a8d7a0d3cf26afb2c',1,'entt::type_info']]], + ['hash_5ffunction_198',['hash_function',['../classentt_1_1dense__map.html#afa1426bfb2ff55c9c4d0471303fcf6cc',1,'entt::dense_map::hash_function()'],['../classentt_1_1dense__set.html#a7f9a2eaac7725273d76b340f6e46c821',1,'entt::dense_set::hash_function()']]], + ['hash_5ftype_199',['hash_type',['../classentt_1_1basic__hashed__string.html#a7b625799426407d8083f7d418e2c6a9e',1,'entt::basic_hashed_string']]], + ['hashed_5fstring_200',['hashed_string',['../namespaceentt.html#a8f9dd22ce26cd7913a294b3fd520649b',1,'entt']]], + ['hashed_5fwstring_201',['hashed_wstring',['../namespaceentt.html#af2768719b1f5967caf5836b2656d0ed6',1,'entt']]], + ['hasher_202',['hasher',['../classentt_1_1dense__map.html#ae62722d472417185388e952655b120e9',1,'entt::dense_map::hasher()'],['../classentt_1_1dense__set.html#a2fb78f57d6f35f6235468e4aadb2fe0e',1,'entt::dense_set::hasher()']]] ]; diff --git a/search/all_8.js b/search/all_8.js index 25a6b9337..e20a23953 100644 --- a/search/all_8.js +++ b/search/all_8.js @@ -1,53 +1,47 @@ var searchData= [ - ['id_197',['id',['../structentt_1_1meta__data.html#a5e1bd9202426e41b5a0d1f25874fa7ec',1,'entt::meta_data::id()'],['../structentt_1_1meta__func.html#a5ea4ea1a05e16dcd4b19ade2bf8ffcf9',1,'entt::meta_func::id()'],['../classentt_1_1meta__type.html#aa7cd3deb7464bd95259e836e21bf1710',1,'entt::meta_type::id()']]], - ['id_5ftype_198',['id_type',['../namespaceentt.html#a13e040e7b38a8f86d1ab2f096f37b627',1,'entt']]], - ['identifier_199',['identifier',['../classentt_1_1identifier.html',1,'entt']]], - ['identifier_5ftype_200',['identifier_type',['../classentt_1_1identifier.html#a5ed0559dce16ea40707502274dba382b',1,'entt::identifier']]], - ['identity_201',['identity',['../structentt_1_1identity.html',1,'entt']]], - ['ignore_5fas_5fempty_5fv_202',['ignore_as_empty_v',['../namespaceentt.html#ab9f9b531ebde614244a0da111d4b66ff',1,'entt']]], - ['ignore_5fif_5fempty_203',['ignore_if_empty',['../structentt_1_1basic__component__traits.html#a2e58d8aa7b15b837cbfb0963cc0c3d46',1,'entt::basic_component_traits']]], - ['in_5fplace_204',['in_place',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581aa49f99ae99ae9daddd1fb79b73d2db28',1,'entt']]], - ['in_5fplace_5fdelete_205',['in_place_delete',['../structentt_1_1basic__component__traits.html#a4ca4508bcd9833ab7c3354704144c90b',1,'entt::basic_component_traits']]], - ['in_5fplace_5fpop_206',['in_place_pop',['../classentt_1_1basic__sparse__set.html#ac307017fd20239e750c615986ba97bdf',1,'entt::basic_sparse_set::in_place_pop()'],['../classentt_1_1basic__storage.html#a428656927bf4fda2ef9cd88415e0096b',1,'entt::basic_storage::in_place_pop()']]], - ['index_207',['index',['../classentt_1_1type__info.html#a8281d599d6462d5e3717f570a8daef93',1,'entt::type_info::index()'],['../classentt_1_1basic__sparse__set.html#a1af775539f37a31b1da7254491a53b1f',1,'entt::basic_sparse_set::index()']]], - ['info_208',['info',['../structentt_1_1basic__organizer_1_1vertex.html#ad8302d45c317e73c115bf8b77f89cc1d',1,'entt::basic_organizer::vertex::info()'],['../classentt_1_1meta__type.html#a05199b5705d56386eb18e36ef73cd5f1',1,'entt::meta_type::info()']]], - ['input_5fiterator_5fpointer_209',['input_iterator_pointer',['../structentt_1_1input__iterator__pointer.html',1,'entt::input_iterator_pointer< Type >'],['../structentt_1_1input__iterator__pointer.html#ae1e2a7eda1fb7650a6bba71590959bbb',1,'entt::input_iterator_pointer::input_iterator_pointer(Type &&val)'],['../structentt_1_1input__iterator__pointer.html#a6ec178da7c2622b21dbf2852c5035bf5',1,'entt::input_iterator_pointer::input_iterator_pointer(const input_iterator_pointer &)=delete'],['../structentt_1_1input__iterator__pointer.html#a2603e381cfe846c6ffaf0376ef3e1882',1,'entt::input_iterator_pointer::input_iterator_pointer(input_iterator_pointer &&)=default']]], - ['insert_210',['insert',['../classentt_1_1meta__associative__container.html#a292d90c2d8cbee3d6c2c32a899a9cb5e',1,'entt::meta_associative_container::insert()'],['../classentt_1_1dense__hash__map.html#a03b7d39d19ffed5acc6d6595744e1ef1',1,'entt::dense_hash_map::insert(const value_type &value)'],['../classentt_1_1dense__hash__map.html#ae0d01d2987f57c021d155042b87c2510',1,'entt::dense_hash_map::insert(value_type &&value)'],['../classentt_1_1dense__hash__map.html#a7a1ec556df5df66db184ef2dda5582f1',1,'entt::dense_hash_map::insert(Arg &&value)'],['../classentt_1_1dense__hash__map.html#a0125eb5324d36d3f5ffed1e562aefb80',1,'entt::dense_hash_map::insert(It first, It last)'],['../classentt_1_1dense__hash__set.html#a771a6075947fd72f7b11e1fc6e5d9767',1,'entt::dense_hash_set::insert(const value_type &value)'],['../classentt_1_1dense__hash__set.html#ae249fe3c8d3a9f721f8c07fd0dbe9128',1,'entt::dense_hash_set::insert(value_type &&value)'],['../classentt_1_1dense__hash__set.html#aca2d94dd4813fd5c3b0fb0c1f6568ce6',1,'entt::dense_hash_set::insert(It first, It last)'],['../classentt_1_1basic__registry.html#a3587004bdab85280c2a2a1b6371fd4c5',1,'entt::basic_registry::insert(It first, It last, const Component &value={})'],['../classentt_1_1basic__registry.html#a1a37b2a842fd3877bc25e3217a01ee11',1,'entt::basic_registry::insert(EIt first, EIt last, CIt from)'],['../classentt_1_1basic__sparse__set.html#a1a3903daddc7ec0a8260d8828b009402',1,'entt::basic_sparse_set::insert()'],['../classentt_1_1basic__storage.html#abc4d7d3a84ecc5fc8e878772074ce35f',1,'entt::basic_storage::insert(It first, It last, const value_type &value={})'],['../classentt_1_1basic__storage.html#ac9670a9916dc77f24403e4a41fdaed96',1,'entt::basic_storage::insert(EIt first, EIt last, CIt from)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a700a2428a1a0469b912b0dbdeb9e91b2',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::insert()'],['../classentt_1_1sigh__storage__mixin.html#a88cb74a6060bd49ea3f26f3921a47f81',1,'entt::sigh_storage_mixin::insert()'],['../classentt_1_1meta__sequence__container.html#aaa0fc1c19ebad3201054dae00952d07f',1,'entt::meta_sequence_container::insert()']]], - ['insert_5for_5fassign_211',['insert_or_assign',['../classentt_1_1dense__hash__map.html#a4d60d3f5873f7835029659f303a15ca3',1,'entt::dense_hash_map::insert_or_assign(const key_type &key, Arg &&value)'],['../classentt_1_1dense__hash__map.html#abfef5cf406b5ffd0d12ffd758aaffd30',1,'entt::dense_hash_map::insert_or_assign(key_type &&key, Arg &&value)']]], - ['insertion_5fsort_212',['insertion_sort',['../structentt_1_1insertion__sort.html',1,'entt']]], - ['instance_213',['instance',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a132448b3ee95cea57ac746f2cd306765',1,'entt::delegate< Ret(Args...)>::instance()'],['../classentt_1_1poly__vtable.html#afb72fb3a81dd22f2ca36b87adebfff46',1,'entt::poly_vtable::instance()']]], - ['instance_5ftype_214',['instance_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a9c23ea85323b3053fbe9fc377e78c303',1,'entt::sigh< Ret(Args...), Allocator >']]], - ['integral_5fconstant_215',['integral_constant',['../namespaceentt.html#a0d9fd5898acf13553bbcf14b99159f4d',1,'entt']]], - ['invoke_216',['invoke',['../classentt_1_1meta__any.html#acaf2cd2589c5c3f8fa34b8bf7aca03f8',1,'entt::meta_any::invoke(const id_type id, Args &&...args) const'],['../classentt_1_1meta__any.html#a6dd24fc5445f7038c386696355773332',1,'entt::meta_any::invoke(const id_type id, Args &&...args)'],['../structentt_1_1meta__func.html#a83fb3576c1a3873de1e1e041f759180b',1,'entt::meta_func::invoke(meta_handle instance, meta_any *const args, const size_type sz) const'],['../structentt_1_1meta__func.html#aa10b325b5da2a1c04259f2d6dc1f6746',1,'entt::meta_func::invoke(meta_handle instance, Args &&...args) const'],['../classentt_1_1meta__type.html#ad846c918ce1e2f496b7464cc6a6d6d5e',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a99a835b500d3aa1f4f25090d8bef3802',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, Args &&...args) const'],['../structentt_1_1poly__inspector.html#a8539b30952dd5a66aa24f334ae4976de',1,'entt::poly_inspector::invoke(Args &&...args) const'],['../structentt_1_1poly__inspector.html#ac829c393c3d78f306edd0307f71139cb',1,'entt::poly_inspector::invoke(Args &&...args)'],['../structentt_1_1poly__base.html#a814fd041b02ddfe60577b23d174e7182',1,'entt::poly_base::invoke(const poly_base &self, Args &&...args) const'],['../structentt_1_1poly__base.html#a8e782d45ce62d6bd620ad22a0ee913e2',1,'entt::poly_base::invoke(poly_base &self, Args &&...args)'],['../namespaceentt.html#aa512a354fe328df6be5a92eb43cd4d69',1,'entt::invoke(basic_registry< Entity > &reg, const Entity entt)']]], - ['is_5fapplicable_217',['is_applicable',['../structentt_1_1is__applicable.html',1,'entt']]], - ['is_5fapplicable_3c_20func_2c_20const_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_218',['is_applicable< Func, const Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['is_5fapplicable_3c_20func_2c_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_219',['is_applicable< Func, Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['is_5fapplicable_5fr_220',['is_applicable_r',['../structentt_1_1is__applicable__r.html',1,'entt']]], - ['is_5fapplicable_5fr_3c_20ret_2c_20func_2c_20std_3a_3atuple_3c_20args_2e_2e_2e_20_3e_20_3e_221',['is_applicable_r< Ret, Func, std::tuple< Args... > >',['../structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['is_5fapplicable_5fr_5fv_222',['is_applicable_r_v',['../namespaceentt.html#ae764716fab8c01b12d3e209004b62647',1,'entt']]], - ['is_5fapplicable_5fv_223',['is_applicable_v',['../namespaceentt.html#a4f238620469de3ef2bafdb28fe4657ef',1,'entt']]], - ['is_5farithmetic_224',['is_arithmetic',['../classentt_1_1meta__type.html#a399e9840beaadc9be07c8ec8acb8a66d',1,'entt::meta_type']]], - ['is_5farray_225',['is_array',['../classentt_1_1meta__type.html#aac2e57ea9054001d5b6575a512337f2a',1,'entt::meta_type']]], - ['is_5fassociative_5fcontainer_226',['is_associative_container',['../classentt_1_1meta__type.html#a1cfeeb52708c5cc454b57904acde9c65',1,'entt::meta_type']]], - ['is_5fclass_227',['is_class',['../classentt_1_1meta__type.html#a8810160ba713e725bf3b672e546fba35',1,'entt::meta_type']]], - ['is_5fcomplete_228',['is_complete',['../structentt_1_1is__complete.html',1,'entt']]], - ['is_5fcomplete_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_229',['is_complete< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], - ['is_5fcomplete_5fv_230',['is_complete_v',['../namespaceentt.html#a8a96fcc4bc8da9a2aa1cdb0bc15b75c8',1,'entt']]], - ['is_5fconst_231',['is_const',['../structentt_1_1meta__data.html#a821782f679650835b47ac17949bb5f4d',1,'entt::meta_data::is_const()'],['../structentt_1_1meta__func.html#a7d21c937f1e1337e3f9eab27ccee52a9',1,'entt::meta_func::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a0b5490df3a06e36ae87f2757449bf297',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a8227699d91d302cbe93fa8f36434aacd',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a19154b177e459db7b337ef47e3ddd43c',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#ab7c56f9d9f9297a6d8941e38417a4047',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a301bb7ebf5340b15920e021b2e69a3bb',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_const()']]], - ['is_5febco_5feligible_232',['is_ebco_eligible',['../structentt_1_1is__ebco__eligible.html',1,'entt']]], - ['is_5febco_5feligible_5fv_233',['is_ebco_eligible_v',['../namespaceentt.html#afb5b1446d23f1cba20563114f5da1f9d',1,'entt']]], - ['is_5fenum_234',['is_enum',['../classentt_1_1meta__type.html#ad4467cc578b7bbe9799cbd2984144376',1,'entt::meta_type']]], - ['is_5fequality_5fcomparable_235',['is_equality_comparable',['../structentt_1_1is__equality__comparable.html',1,'entt']]], - ['is_5fequality_5fcomparable_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28std_3a_3adeclval_3c_20type_20_3e_28_29_3d_3dstd_3a_3adeclval_3c_20type_20_3e_28_29_29_3e_20_3e_236',['is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> >',['../structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html',1,'entt']]], - ['is_5fequality_5fcomparable_5fv_237',['is_equality_comparable_v',['../namespaceentt.html#a068dd98a70c771935d2bf3dd96dbad6d',1,'entt']]], - ['is_5fiterator_238',['is_iterator',['../structentt_1_1is__iterator.html',1,'entt']]], - ['is_5fiterator_3c_20type_2c_20std_3a_3aenable_5fif_5ft_3c_21std_3a_3ais_5fsame_5fv_3c_20std_3a_3aremove_5fconst_5ft_3c_20std_3a_3aremove_5fpointer_5ft_3c_20type_20_3e_20_3e_2c_20void_20_3e_20_3e_20_3e_239',['is_iterator< Type, std::enable_if_t<!std::is_same_v< std::remove_const_t< std::remove_pointer_t< Type > >, void > > >',['../structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html',1,'entt']]], - ['is_5fiterator_5ftype_240',['is_iterator_type',['../structentt_1_1is__iterator__type.html',1,'entt']]], - ['is_5fiterator_5ftype_3c_20type_2c_20it_2c_20std_3a_3aenable_5fif_5ft_3c_20is_5fiterator_5fv_3c_20type_20_3e_20_26_26std_3a_3ais_5fsame_5fv_3c_20type_2c_20it_20_3e_20_3e_20_3e_241',['is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > >',['../structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_1c6d668122d93a8a6f6186aab47dc295.html',1,'entt']]], - ['is_5fiterator_5ftype_3c_20type_2c_20it_2c_20std_3a_3aenable_5fif_5ft_3c_21std_3a_3ais_5fsame_5fv_3c_20type_2c_20it_20_3e_2c_20std_3a_3avoid_5ft_3c_20typename_20it_3a_3aiterator_5ftype_20_3e_20_3e_20_3e_242',['is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > >',['../structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__d827a14c04f195b53a7b353d4f3d2a15.html',1,'entt']]], - ['is_5fiterator_5ftype_3c_20type_2c_20it_3a_3aiterator_5ftype_20_3e_243',['is_iterator_type< Type, It::iterator_type >',['../structentt_1_1is__iterator__type.html',1,'entt']]], - ['is_5fiterator_5ftype_5fv_244',['is_iterator_type_v',['../namespaceentt.html#ac4081aa5332fcb3367063eeba93918b8',1,'entt']]], + ['id_203',['id',['../structentt_1_1meta__data.html#a5e1bd9202426e41b5a0d1f25874fa7ec',1,'entt::meta_data::id()'],['../classentt_1_1meta__type.html#aa7cd3deb7464bd95259e836e21bf1710',1,'entt::meta_type::id()'],['../structentt_1_1meta__func.html#a5ea4ea1a05e16dcd4b19ade2bf8ffcf9',1,'entt::meta_func::id()']]], + ['id_5ftype_204',['id_type',['../namespaceentt.html#a13e040e7b38a8f86d1ab2f096f37b627',1,'entt']]], + ['identifier_205',['identifier',['../classentt_1_1identifier.html',1,'entt']]], + ['identifier_5ftype_206',['identifier_type',['../classentt_1_1identifier.html#a5ed0559dce16ea40707502274dba382b',1,'entt::identifier']]], + ['identity_207',['identity',['../structentt_1_1identity.html',1,'entt']]], + ['ignore_5fas_5fempty_5fv_208',['ignore_as_empty_v',['../namespaceentt.html#ab9f9b531ebde614244a0da111d4b66ff',1,'entt']]], + ['in_5fplace_209',['in_place',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581aa49f99ae99ae9daddd1fb79b73d2db28',1,'entt']]], + ['in_5fplace_5fdelete_210',['in_place_delete',['../structentt_1_1component__traits.html#ac3efe50eb183fe2a31b642ade474017f',1,'entt::component_traits']]], + ['in_5fplace_5fpop_211',['in_place_pop',['../classentt_1_1basic__storage.html#a9a78ace899003f10c24cd1a75441840a',1,'entt::basic_storage::in_place_pop()'],['../classentt_1_1basic__sparse__set.html#aff8a2d818cbe74cc59687261627d3531',1,'entt::basic_sparse_set::in_place_pop(basic_iterator first, basic_iterator last)']]], + ['index_212',['index',['../classentt_1_1basic__sparse__set.html#a1af775539f37a31b1da7254491a53b1f',1,'entt::basic_sparse_set::index()'],['../structentt_1_1type__info.html#a8281d599d6462d5e3717f570a8daef93',1,'entt::type_info::index()']]], + ['info_213',['info',['../structentt_1_1basic__organizer_1_1vertex.html#ad8302d45c317e73c115bf8b77f89cc1d',1,'entt::basic_organizer::vertex::info()'],['../classentt_1_1meta__type.html#a05199b5705d56386eb18e36ef73cd5f1',1,'entt::meta_type::info()']]], + ['input_5fiterator_5fpointer_214',['input_iterator_pointer',['../structentt_1_1input__iterator__pointer.html',1,'entt::input_iterator_pointer< Type >'],['../structentt_1_1input__iterator__pointer.html#a6ec178da7c2622b21dbf2852c5035bf5',1,'entt::input_iterator_pointer::input_iterator_pointer(const input_iterator_pointer &)=delete'],['../structentt_1_1input__iterator__pointer.html#a2603e381cfe846c6ffaf0376ef3e1882',1,'entt::input_iterator_pointer::input_iterator_pointer(input_iterator_pointer &&)=default'],['../structentt_1_1input__iterator__pointer.html#ae1e2a7eda1fb7650a6bba71590959bbb',1,'entt::input_iterator_pointer::input_iterator_pointer(Type &&val)']]], + ['insert_215',['insert',['../classentt_1_1dense__map.html#a81f7b5a5d5436d97e3134cc5b2cb2041',1,'entt::dense_map::insert()'],['../classentt_1_1dense__set.html#ad1d0c5c6ecc943ea7ddaa9085cc7103c',1,'entt::dense_set::insert(const value_type &value)'],['../classentt_1_1dense__set.html#a1ba08ce069cae4e9cfa30ad0a0971c28',1,'entt::dense_set::insert(value_type &&value)'],['../classentt_1_1dense__set.html#ae52c7f8b38e6bfc15e421fcc8021ba15',1,'entt::dense_set::insert(It first, It last)'],['../classentt_1_1basic__registry.html#a3587004bdab85280c2a2a1b6371fd4c5',1,'entt::basic_registry::insert()'],['../classentt_1_1meta__associative__container.html#a292d90c2d8cbee3d6c2c32a899a9cb5e',1,'entt::meta_associative_container::insert()'],['../classentt_1_1meta__sequence__container.html#aaa0fc1c19ebad3201054dae00952d07f',1,'entt::meta_sequence_container::insert()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a700a2428a1a0469b912b0dbdeb9e91b2',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::insert()'],['../classentt_1_1basic__storage.html#ac9670a9916dc77f24403e4a41fdaed96',1,'entt::basic_storage::insert(EIt first, EIt last, CIt from)'],['../classentt_1_1basic__storage.html#abc4d7d3a84ecc5fc8e878772074ce35f',1,'entt::basic_storage::insert(It first, It last, const value_type &value={})'],['../classentt_1_1basic__sparse__set.html#a9730e27e1155b725975120a8c494b3e2',1,'entt::basic_sparse_set::insert()'],['../classentt_1_1sigh__storage__mixin.html#a88cb74a6060bd49ea3f26f3921a47f81',1,'entt::sigh_storage_mixin::insert()'],['../classentt_1_1basic__registry.html#a1a37b2a842fd3877bc25e3217a01ee11',1,'entt::basic_registry::insert()'],['../classentt_1_1dense__map.html#a3c94e139b8d65ac65df36161183a8a49',1,'entt::dense_map::insert(It first, It last)'],['../classentt_1_1dense__map.html#a519ceafe87d98b4a60ea91e1efe1c976',1,'entt::dense_map::insert(const value_type &value)'],['../classentt_1_1dense__map.html#a67ccf24563c5908e2bad9820f48cf432',1,'entt::dense_map::insert(value_type &&value)']]], + ['insert_5for_5fassign_216',['insert_or_assign',['../classentt_1_1dense__map.html#a604f5b0b48633852e364205d5e246c3c',1,'entt::dense_map::insert_or_assign(key_type &&key, Arg &&value)'],['../classentt_1_1dense__map.html#a8edc6058714f6faa339bf8e8e8c4f294',1,'entt::dense_map::insert_or_assign(const key_type &key, Arg &&value)']]], + ['insertion_5fsort_217',['insertion_sort',['../structentt_1_1insertion__sort.html',1,'entt']]], + ['instance_218',['instance',['../classentt_1_1poly__vtable.html#afb72fb3a81dd22f2ca36b87adebfff46',1,'entt::poly_vtable']]], + ['instance_5ftype_219',['instance_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a9c23ea85323b3053fbe9fc377e78c303',1,'entt::sigh< Ret(Args...), Allocator >']]], + ['integral_5fconstant_220',['integral_constant',['../namespaceentt.html#a0d9fd5898acf13553bbcf14b99159f4d',1,'entt']]], + ['invoke_221',['invoke',['../classentt_1_1meta__type.html#ad846c918ce1e2f496b7464cc6a6d6d5e',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a99a835b500d3aa1f4f25090d8bef3802',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, Args &&...args) const'],['../structentt_1_1poly__inspector.html#a8539b30952dd5a66aa24f334ae4976de',1,'entt::poly_inspector::invoke(Args &&...args) const'],['../structentt_1_1poly__inspector.html#ac829c393c3d78f306edd0307f71139cb',1,'entt::poly_inspector::invoke(Args &&...args)'],['../structentt_1_1poly__base.html#a814fd041b02ddfe60577b23d174e7182',1,'entt::poly_base::invoke(const poly_base &self, Args &&...args) const'],['../structentt_1_1poly__base.html#a8e782d45ce62d6bd620ad22a0ee913e2',1,'entt::poly_base::invoke(poly_base &self, Args &&...args)'],['../namespaceentt.html#aa512a354fe328df6be5a92eb43cd4d69',1,'entt::invoke()'],['../classentt_1_1meta__any.html#acaf2cd2589c5c3f8fa34b8bf7aca03f8',1,'entt::meta_any::invoke(const id_type id, Args &&...args) const'],['../classentt_1_1meta__any.html#a6dd24fc5445f7038c386696355773332',1,'entt::meta_any::invoke(const id_type id, Args &&...args)'],['../structentt_1_1meta__func.html#a83fb3576c1a3873de1e1e041f759180b',1,'entt::meta_func::invoke(meta_handle instance, meta_any *const args, const size_type sz) const'],['../structentt_1_1meta__func.html#aa10b325b5da2a1c04259f2d6dc1f6746',1,'entt::meta_func::invoke(meta_handle instance, Args &&...args) const']]], + ['is_5fapplicable_222',['is_applicable',['../structentt_1_1is__applicable.html',1,'entt']]], + ['is_5fapplicable_3c_20func_2c_20const_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_223',['is_applicable< Func, const Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['is_5fapplicable_3c_20func_2c_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_224',['is_applicable< Func, Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['is_5fapplicable_5fr_225',['is_applicable_r',['../structentt_1_1is__applicable__r.html',1,'entt']]], + ['is_5fapplicable_5fr_3c_20ret_2c_20func_2c_20std_3a_3atuple_3c_20args_2e_2e_2e_20_3e_20_3e_226',['is_applicable_r< Ret, Func, std::tuple< Args... > >',['../structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['is_5fapplicable_5fr_5fv_227',['is_applicable_r_v',['../namespaceentt.html#ae764716fab8c01b12d3e209004b62647',1,'entt']]], + ['is_5fapplicable_5fv_228',['is_applicable_v',['../namespaceentt.html#a4f238620469de3ef2bafdb28fe4657ef',1,'entt']]], + ['is_5farithmetic_229',['is_arithmetic',['../classentt_1_1meta__type.html#a399e9840beaadc9be07c8ec8acb8a66d',1,'entt::meta_type']]], + ['is_5farray_230',['is_array',['../classentt_1_1meta__type.html#aac2e57ea9054001d5b6575a512337f2a',1,'entt::meta_type']]], + ['is_5fassociative_5fcontainer_231',['is_associative_container',['../classentt_1_1meta__type.html#a1cfeeb52708c5cc454b57904acde9c65',1,'entt::meta_type']]], + ['is_5fclass_232',['is_class',['../classentt_1_1meta__type.html#a8810160ba713e725bf3b672e546fba35',1,'entt::meta_type']]], + ['is_5fcomplete_233',['is_complete',['../structentt_1_1is__complete.html',1,'entt']]], + ['is_5fcomplete_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_234',['is_complete< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], + ['is_5fcomplete_5fv_235',['is_complete_v',['../namespaceentt.html#a8a96fcc4bc8da9a2aa1cdb0bc15b75c8',1,'entt']]], + ['is_5fconst_236',['is_const',['../structentt_1_1meta__func.html#a7d21c937f1e1337e3f9eab27ccee52a9',1,'entt::meta_func::is_const()'],['../structentt_1_1meta__data.html#a821782f679650835b47ac17949bb5f4d',1,'entt::meta_data::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a301bb7ebf5340b15920e021b2e69a3bb',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a0b5490df3a06e36ae87f2757449bf297',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a8227699d91d302cbe93fa8f36434aacd',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a19154b177e459db7b337ef47e3ddd43c',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#ab7c56f9d9f9297a6d8941e38417a4047',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_const()']]], + ['is_5febco_5feligible_237',['is_ebco_eligible',['../structentt_1_1is__ebco__eligible.html',1,'entt']]], + ['is_5febco_5feligible_5fv_238',['is_ebco_eligible_v',['../namespaceentt.html#afb5b1446d23f1cba20563114f5da1f9d',1,'entt']]], + ['is_5fenum_239',['is_enum',['../classentt_1_1meta__type.html#ad4467cc578b7bbe9799cbd2984144376',1,'entt::meta_type']]], + ['is_5fequality_5fcomparable_240',['is_equality_comparable',['../structentt_1_1is__equality__comparable.html',1,'entt']]], + ['is_5fequality_5fcomparable_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28std_3a_3adeclval_3c_20type_20_3e_28_29_3d_3dstd_3a_3adeclval_3c_20type_20_3e_28_29_29_3e_20_3e_241',['is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> >',['../structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html',1,'entt']]], + ['is_5fequality_5fcomparable_5fv_242',['is_equality_comparable_v',['../namespaceentt.html#a068dd98a70c771935d2bf3dd96dbad6d',1,'entt']]], + ['is_5fiterator_243',['is_iterator',['../structentt_1_1is__iterator.html',1,'entt']]], + ['is_5fiterator_3c_20type_2c_20std_3a_3aenable_5fif_5ft_3c_21std_3a_3ais_5fsame_5fv_3c_20std_3a_3aremove_5fconst_5ft_3c_20std_3a_3aremove_5fpointer_5ft_3c_20type_20_3e_20_3e_2c_20void_20_3e_20_3e_20_3e_244',['is_iterator< Type, std::enable_if_t<!std::is_same_v< std::remove_const_t< std::remove_pointer_t< Type > >, void > > >',['../structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html',1,'entt']]], ['is_5fiterator_5fv_245',['is_iterator_v',['../namespaceentt.html#a3ac133ddb24ec535a11baf3143d188d6',1,'entt']]], ['is_5fmeta_5fpointer_5flike_246',['is_meta_pointer_like',['../structentt_1_1is__meta__pointer__like.html',1,'entt']]], ['is_5fmeta_5fpointer_5flike_3c_20const_20type_20_3e_247',['is_meta_pointer_like< const Type >',['../structentt_1_1is__meta__pointer__like_3_01const_01Type_01_4.html',1,'entt']]], @@ -61,13 +55,13 @@ var searchData= ['is_5fpointer_5flike_255',['is_pointer_like',['../classentt_1_1meta__type.html#a9f632add22a4194a8a968badfff7c6f6',1,'entt::meta_type']]], ['is_5fpower_5fof_5ftwo_256',['is_power_of_two',['../namespaceentt.html#a3755517604de1d9d3f3e0a5549c750c5',1,'entt']]], ['is_5fsequence_5fcontainer_257',['is_sequence_container',['../classentt_1_1meta__type.html#ab42d82a42e847fc9c5d6ac905c0d3736',1,'entt::meta_type']]], - ['is_5fstatic_258',['is_static',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a5c674d0c648557b14c0e7d81e6414417',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_static()'],['../structentt_1_1meta__data.html#a08417d17ad41c753ec292abdeafd1782',1,'entt::meta_data::is_static()'],['../structentt_1_1meta__func.html#aab0625ceb6c319304e3d42f12aa1fb54',1,'entt::meta_func::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#ad677df460bd44063d268f841e37efe9f',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a0f3d42096f81fb16c1f7f4f62f540ad1',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a5fc6893ccbbd9cafd726c361efe6ad59',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#ad6eb8df95c6c2763db264ae94a844098',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_static()']]], + ['is_5fstatic_258',['is_static',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#ad677df460bd44063d268f841e37efe9f',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a0f3d42096f81fb16c1f7f4f62f540ad1',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a5fc6893ccbbd9cafd726c361efe6ad59',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#ad6eb8df95c6c2763db264ae94a844098',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_static()'],['../structentt_1_1meta__data.html#a08417d17ad41c753ec292abdeafd1782',1,'entt::meta_data::is_static()'],['../structentt_1_1meta__func.html#aab0625ceb6c319304e3d42f12aa1fb54',1,'entt::meta_func::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a5c674d0c648557b14c0e7d81e6414417',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_static()']]], ['is_5ftemplate_5fspecialization_259',['is_template_specialization',['../classentt_1_1meta__type.html#ae7d676d99412337ef5214545e61618a6',1,'entt::meta_type']]], ['is_5ftransparent_260',['is_transparent',['../structentt_1_1is__transparent.html',1,'entt::is_transparent< Type, typename >'],['../structentt_1_1identity.html#a4781035b1edd550804a131d80852e258',1,'entt::identity::is_transparent()']]], ['is_5ftransparent_3c_20type_2c_20std_3a_3avoid_5ft_3c_20typename_20type_3a_3ais_5ftransparent_20_3e_20_3e_261',['is_transparent< Type, std::void_t< typename Type::is_transparent > >',['../structentt_1_1is__transparent_3_01Type_00_01std_1_1void__t_3_01typename_01Type_1_1is__transparent_01_4_01_4.html',1,'entt']]], ['is_5ftransparent_5fv_262',['is_transparent_v',['../namespaceentt.html#a5fd3998d86cc531f800d0104478771f4',1,'entt']]], - ['iterable_263',['iterable',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#affda5e25fae74678a98ed29b7f4652c1',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a8a13798063fd9e34727b7de27dd2937c',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a40a1870044ed0d131c7007744f9fb726',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__storage.html#afe8de841a13f390e1d55cb4cd508e1c4',1,'entt::basic_storage::iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a371bf4723147609e9ba3a3ec5525f052',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::iterable()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a9517bc8413354e5bd9972978ad79a4c2',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterable()']]], - ['iterable_5fadaptor_264',['iterable_adaptor',['../structentt_1_1iterable__adaptor.html',1,'entt::iterable_adaptor< It >'],['../structentt_1_1iterable__adaptor.html#a047f9b4bd49dd52067defbfb50ad1e92',1,'entt::iterable_adaptor::iterable_adaptor()=default'],['../structentt_1_1iterable__adaptor.html#adc0ab97bc15ec48970b44911ad7d0661',1,'entt::iterable_adaptor::iterable_adaptor(It from, It to)']]], - ['iterator_265',['iterator',['../classentt_1_1dense__hash__set.html#a92770d7ee1512c5f230f670a76616821',1,'entt::dense_hash_set::iterator()'],['../structentt_1_1iterable__adaptor.html#a7d3d37eb178ab61415cec31e23012478',1,'entt::iterable_adaptor::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a9be93489b31459555199bdc70caa7ff6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5e02cbec8d7d0661fbd987f1f8be65e8',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__observer.html#a3b57e5efae80301542b1b4011debb680',1,'entt::basic_observer::iterator()'],['../classentt_1_1basic__runtime__view.html#a0af3c7cc57aadc3166b8e53627ba1039',1,'entt::basic_runtime_view::iterator()'],['../classentt_1_1basic__sparse__set.html#a79c9252bb1121ae98e12c3308c150726',1,'entt::basic_sparse_set::iterator()'],['../classentt_1_1basic__storage.html#a61680bb8085862ffbd988b3cf1d04b98',1,'entt::basic_storage::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a79f3c8f7fa7c2dc89510b914594d77ea',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1meta__sequence__container.html#a878e2f710e88a6ae42449cb7a93c3928',1,'entt::meta_sequence_container::iterator()'],['../classentt_1_1meta__associative__container.html#aafbaf281035562432a4e8e55443e9584',1,'entt::meta_associative_container::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a7fd1da2f8aac98d0e560fe08e6a49def',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterator()'],['../classentt_1_1dense__hash__map.html#a8441cd459283e4345021b93a0de0f6ff',1,'entt::dense_hash_map::iterator()'],['../structentt_1_1meta__range.html#ae7ab3712220f7a5ab04b14ecdccf8abd',1,'entt::meta_range::iterator()']]], - ['iterator_5fcategory_266',['iterator_category',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#aade7df8f3ede442e7c811828e93bbd3c',1,'entt::meta_sequence_container::meta_iterator::iterator_category()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a8243592766417eadc3118ce9d251350e',1,'entt::meta_associative_container::meta_iterator::iterator_category()']]] + ['iterable_263',['iterable',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a9517bc8413354e5bd9972978ad79a4c2',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterable()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a8a13798063fd9e34727b7de27dd2937c',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a130f5183c9eb278711f3d8a00228bdfa',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__storage.html#afe8de841a13f390e1d55cb4cd508e1c4',1,'entt::basic_storage::iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a371bf4723147609e9ba3a3ec5525f052',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::iterable()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#affda5e25fae74678a98ed29b7f4652c1',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterable()']]], + ['iterable_5fadaptor_264',['iterable_adaptor',['../structentt_1_1iterable__adaptor.html',1,'entt::iterable_adaptor< It, Sentinel >'],['../structentt_1_1iterable__adaptor.html#a633a07efaa72436004db4c0923481921',1,'entt::iterable_adaptor::iterable_adaptor()=default'],['../structentt_1_1iterable__adaptor.html#adb0c73a7ef046ad97eb836b6692f7010',1,'entt::iterable_adaptor::iterable_adaptor(iterator from, sentinel to)']]], + ['iterate_265',['iterate',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#afd6fe84b1d7d4b72e6217432f7bf3435',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >']]], + ['iterator_266',['iterator',['../classentt_1_1dense__map.html#acc07b299f15a57db885089cc1a31322d',1,'entt::dense_map::iterator()'],['../classentt_1_1dense__set.html#a44f127ff9c4a0fa1c8284f7d072bd5c3',1,'entt::dense_set::iterator()'],['../structentt_1_1iterable__adaptor.html#a5f7920bf5cba9b4aa765affe21490a2d',1,'entt::iterable_adaptor::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a9be93489b31459555199bdc70caa7ff6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5e02cbec8d7d0661fbd987f1f8be65e8',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__observer.html#a3b57e5efae80301542b1b4011debb680',1,'entt::basic_observer::iterator()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#afe87f720128165503248ddf319647a0f',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::iterator()'],['../classentt_1_1basic__sparse__set.html#a6cea231ae7386a12487164d918f632b0',1,'entt::basic_sparse_set::iterator()'],['../classentt_1_1basic__storage.html#a61680bb8085862ffbd988b3cf1d04b98',1,'entt::basic_storage::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a79f3c8f7fa7c2dc89510b914594d77ea',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1meta__sequence__container.html#a878e2f710e88a6ae42449cb7a93c3928',1,'entt::meta_sequence_container::iterator()'],['../structentt_1_1meta__range.html#ae7ab3712220f7a5ab04b14ecdccf8abd',1,'entt::meta_range::iterator()'],['../classentt_1_1resource__cache.html#aad6a23cc2ea4a9367ebdb9b186308353',1,'entt::resource_cache::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a7fd1da2f8aac98d0e560fe08e6a49def',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterator()'],['../classentt_1_1meta__associative__container.html#aafbaf281035562432a4e8e55443e9584',1,'entt::meta_associative_container::iterator()']]] ]; diff --git a/search/all_9.js b/search/all_9.js index 888d7e990..5dca6f243 100644 --- a/search/all_9.js +++ b/search/all_9.js @@ -1,8 +1,8 @@ var searchData= [ ['key_267',['key',['../structentt_1_1meta__prop.html#ae8bd5282326b1e77f8f927a02f631a56',1,'entt::meta_prop']]], - ['key_5feq_268',['key_eq',['../classentt_1_1dense__hash__map.html#ae232711a88d1a581edc664d3da83e64d',1,'entt::dense_hash_map::key_eq()'],['../classentt_1_1dense__hash__set.html#ace63db5c5bc5ba7f4960c4d154b6388a',1,'entt::dense_hash_set::key_eq()']]], - ['key_5fequal_269',['key_equal',['../classentt_1_1dense__hash__map.html#abe69eea318126c0e1a5ff94e284a3d96',1,'entt::dense_hash_map::key_equal()'],['../classentt_1_1dense__hash__set.html#a5aa2bcb03496ef89983dec8ab4d98319',1,'entt::dense_hash_set::key_equal()']]], + ['key_5feq_268',['key_eq',['../classentt_1_1dense__map.html#ac2039886ad16466a4f9928dc737cd711',1,'entt::dense_map::key_eq()'],['../classentt_1_1dense__set.html#a2520bd4106132dab9a4c71ef8388e186',1,'entt::dense_set::key_eq()']]], + ['key_5fequal_269',['key_equal',['../classentt_1_1dense__map.html#a41a26ee3be60abf7b5ecf16c99948086',1,'entt::dense_map::key_equal()'],['../classentt_1_1dense__set.html#a266d306cce7016dba8fdbf3790a0cb39',1,'entt::dense_set::key_equal()']]], ['key_5fonly_270',['key_only',['../classentt_1_1meta__associative__container.html#a070ac4ad334603401ba50963391af2ac',1,'entt::meta_associative_container']]], - ['key_5ftype_271',['key_type',['../classentt_1_1dense__hash__map.html#ac7eb7342bc6b0af30716056870463390',1,'entt::dense_hash_map::key_type()'],['../classentt_1_1dense__hash__set.html#a6618e17373f49ffdd2a54c1ed0712a1f',1,'entt::dense_hash_set::key_type()'],['../classentt_1_1meta__associative__container.html#abef8bb4ecb8e3424bfa52be5357da618',1,'entt::meta_associative_container::key_type()']]] + ['key_5ftype_271',['key_type',['../classentt_1_1dense__map.html#aeb9e305df1fc9e886d6c761324dc15ab',1,'entt::dense_map::key_type()'],['../classentt_1_1dense__set.html#a404f1b7ec2ba2fe41d72f4deacf3ed3f',1,'entt::dense_set::key_type()'],['../classentt_1_1meta__associative__container.html#abef8bb4ecb8e3424bfa52be5357da618',1,'entt::meta_associative_container::key_type()']]] ]; diff --git a/search/all_a.js b/search/all_a.js index 6f884f782..7af248416 100644 --- a/search/all_a.js +++ b/search/all_a.js @@ -2,7 +2,10 @@ var searchData= [ ['length_272',['length',['../classentt_1_1basic__any.html#a5fbc1fb99c934c59524af552ae2a33c3',1,'entt::basic_any']]], ['listener_273',['listener',['../classentt_1_1emitter.html#a1200216d9abb1adb18db6035d99b60da',1,'entt::emitter']]], - ['load_274',['load',['../classentt_1_1resource__cache.html#a5d32fa751e6f6ca1a595ebb5642cff23',1,'entt::resource_cache']]], - ['load_5ffactor_275',['load_factor',['../classentt_1_1dense__hash__map.html#a0946139bd54514775c186c798b6420a2',1,'entt::dense_hash_map::load_factor()'],['../classentt_1_1dense__hash__set.html#ade7113017ebe7e65e344fa9554c770f3',1,'entt::dense_hash_set::load_factor()']]], - ['local_5fiterator_276',['local_iterator',['../classentt_1_1dense__hash__map.html#ad453a64541b6cc8427b4757cce425e75',1,'entt::dense_hash_map::local_iterator()'],['../classentt_1_1dense__hash__set.html#a6e82513508be1f87570db8984061d73d',1,'entt::dense_hash_set::local_iterator()']]] + ['load_274',['load',['../classentt_1_1resource__cache.html#a913f42ea03648c365c8cbbf8b405b6d4',1,'entt::resource_cache']]], + ['load_5ffactor_275',['load_factor',['../classentt_1_1dense__map.html#a0ebd2095ae61e1908572efa33dc3df56',1,'entt::dense_map::load_factor()'],['../classentt_1_1dense__set.html#abceb56d6788f953e79b6d6924bfcbfe2',1,'entt::dense_set::load_factor()']]], + ['loader_276',['loader',['../classentt_1_1resource__cache.html#a29225250d340dfc89818ab6662efe774',1,'entt::resource_cache']]], + ['loader_5ftype_277',['loader_type',['../classentt_1_1resource__cache.html#a834f161302d84ba1303358ce22f6e982',1,'entt::resource_cache']]], + ['local_5fiterator_278',['local_iterator',['../classentt_1_1dense__map.html#ad05e437f37f277cbe5c6121e67a4e89a',1,'entt::dense_map::local_iterator()'],['../classentt_1_1dense__set.html#a83489efab7359c9c31d910844d96faa5',1,'entt::dense_set::local_iterator()']]], + ['locator_279',['locator',['../structentt_1_1locator.html',1,'entt::locator< Service >'],['../structentt_1_1locator.html#af0226a1ca179eba7e3b63ee47c1d668c',1,'entt::locator::locator()']]] ]; diff --git a/search/all_b.js b/search/all_b.js index 19930adcb..7f8602dfd 100644 --- a/search/all_b.js +++ b/search/all_b.js @@ -1,57 +1,56 @@ var searchData= [ - ['make_5fany_277',['make_any',['../namespaceentt.html#a246375cb799b9dc67b9a555f91d94099',1,'entt']]], - ['make_5fmeta_278',['make_meta',['../namespaceentt.html#abdd5e7fb78b64f8238eacae2f10ba06e',1,'entt']]], - ['map_279',['map',['../classentt_1_1basic__continuous__loader.html#a8cf619f4617f38dcb2a8c07c83262b42',1,'entt::basic_continuous_loader']]], - ['mapped_5ftype_280',['mapped_type',['../classentt_1_1dense__hash__map.html#af3e58ee3f55ff7b7e76ac8cdc8a64ca9',1,'entt::dense_hash_map::mapped_type()'],['../classentt_1_1meta__associative__container.html#ac4654bf85edf4eb784e7a4e9f12ef59d',1,'entt::meta_associative_container::mapped_type()']]], - ['matcher_281',['matcher',['../structentt_1_1matcher.html',1,'entt']]], - ['max_5fbucket_5fcount_282',['max_bucket_count',['../classentt_1_1dense__hash__set.html#a51059d55f874d8d6bdd4ba9595b81ecf',1,'entt::dense_hash_set::max_bucket_count()'],['../classentt_1_1dense__hash__map.html#a11220c20418cb9fdd1815d0bf770441f',1,'entt::dense_hash_map::max_bucket_count() const']]], - ['max_5fload_5ffactor_283',['max_load_factor',['../classentt_1_1dense__hash__map.html#aba259e25dc36bac32d68708078d96c0a',1,'entt::dense_hash_map::max_load_factor()'],['../classentt_1_1dense__hash__set.html#a7a3e770b94014121ea3fb45bde617bfd',1,'entt::dense_hash_set::max_load_factor(const float value)'],['../classentt_1_1dense__hash__set.html#a2bc7b8061a73bbfac129c5c673b8cbf6',1,'entt::dense_hash_set::max_load_factor() const'],['../classentt_1_1dense__hash__map.html#a4f4664f0b5925e898fb36e35e1c27835',1,'entt::dense_hash_map::max_load_factor()']]], - ['member_5fclass_284',['member_class',['../classentt_1_1member__class.html',1,'entt']]], - ['member_5fclass_5ft_285',['member_class_t',['../namespaceentt.html#a49f19d031690e5ebfffd6c7a4f6bd364',1,'entt']]], - ['meta_286',['meta',['../namespaceentt.html#a3ae5a1bdbb378be2ae0556ff437cf513',1,'entt']]], - ['meta_5fany_287',['meta_any',['../classentt_1_1meta__any.html',1,'entt::meta_any'],['../classentt_1_1meta__any.html#afb14535cc13fc0b3c9790d150d3d7bf5',1,'entt::meta_any::meta_any(meta_any &&other)'],['../classentt_1_1meta__any.html#a51936bb6212a3bfc87b71afb2d6085c3',1,'entt::meta_any::meta_any(const meta_any &other)=default'],['../classentt_1_1meta__any.html#a7e1dba79e26c96a353743a327d1c7b8e',1,'entt::meta_any::meta_any(Type &&value)'],['../classentt_1_1meta__any.html#a327704bdb52c21b9ea8f221cdac11b20',1,'entt::meta_any::meta_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1meta__any.html#a00d2839b7929d7043b47fd0fad15fc1e',1,'entt::meta_any::meta_any()']]], - ['meta_5fassociative_5fcontainer_288',['meta_associative_container',['../classentt_1_1meta__associative__container.html',1,'entt::meta_associative_container'],['../classentt_1_1meta__associative__container.html#ac2405eee51b302c36e3aaefb97fcd0cd',1,'entt::meta_associative_container::meta_associative_container(std::in_place_type_t< Type >, any instance)'],['../classentt_1_1meta__associative__container.html#a088ac917d0505b0dd55a0378cc725225',1,'entt::meta_associative_container::meta_associative_container()=default']]], - ['meta_5fassociative_5fcontainer_5ftraits_289',['meta_associative_container_traits',['../structentt_1_1meta__associative__container__traits.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fhash_5fmap_3c_20key_2c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_290',['meta_associative_container_traits< dense_hash_map< Key, Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fhash_5fset_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_291',['meta_associative_container_traits< dense_hash_set< Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3amap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_292',['meta_associative_container_traits< std::map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_293',['meta_associative_container_traits< std::set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fmap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_294',['meta_associative_container_traits< std::unordered_map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_295',['meta_associative_container_traits< std::unordered_set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fclass_5ftemplate_5ftag_296',['meta_class_template_tag',['../structentt_1_1meta__class__template__tag.html',1,'entt']]], - ['meta_5fconstruct_297',['meta_construct',['../namespaceentt.html#aef8c196db303590ebe456287b5890cf4',1,'entt::meta_construct(Candidate &&candidate, meta_any *const args)'],['../namespaceentt.html#a681f2bc9d84e3851405cf4b8c8e21455',1,'entt::meta_construct(meta_any *const args)'],['../namespaceentt.html#a3b0d075524517183181aa512417358a0',1,'entt::meta_construct(meta_any *const args)']]], - ['meta_5fctx_298',['meta_ctx',['../structentt_1_1meta__ctx.html',1,'entt']]], - ['meta_5fdata_299',['meta_data',['../structentt_1_1meta__data.html',1,'entt::meta_data'],['../structentt_1_1meta__data.html#a287652cfd950c698d124d12820ec9d10',1,'entt::meta_data::meta_data()']]], - ['meta_5fdispatch_300',['meta_dispatch',['../namespaceentt.html#a957782a57268c06cef354868d4402c74',1,'entt']]], - ['meta_5ffactory_301',['meta_factory',['../classentt_1_1meta__factory.html',1,'entt::meta_factory<... >'],['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#afd118c3e987d809b5e5a43a836e0e405',1,'entt::meta_factory< Type, Spec... >::meta_factory()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#ab51530893e710d51fbc99c95f32931be',1,'entt::meta_factory< Type >::meta_factory()']]], - ['meta_5ffactory_3c_20type_20_3e_302',['meta_factory< Type >',['../classentt_1_1meta__factory_3_01Type_01_4.html',1,'entt']]], - ['meta_5ffactory_3c_20type_2c_20spec_2e_2e_2e_20_3e_303',['meta_factory< Type, Spec... >',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html',1,'entt']]], - ['meta_5ffunc_304',['meta_func',['../structentt_1_1meta__func.html',1,'entt::meta_func'],['../structentt_1_1meta__func.html#afa6ee51299057be3baddee875b37b6d3',1,'entt::meta_func::meta_func()']]], - ['meta_5ffunction_5fdescriptor_305',['meta_function_descriptor',['../structentt_1_1meta__function__descriptor.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_20class_3a_3a_2a_20_3e_306',['meta_function_descriptor< Type, Ret Class::* >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28_29_3e_307',['meta_function_descriptor< Type, Ret(*)()>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28maybetype_2c_20args_2e_2e_2e_29_3e_308',['meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_20const_20_3e_309',['meta_function_descriptor< Type, Ret(Class::*)(Args...) const >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_3e_310',['meta_function_descriptor< Type, Ret(Class::*)(Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html',1,'entt']]], - ['meta_5ffunction_5fhelper_311',['meta_function_helper',['../classentt_1_1meta__function__helper.html',1,'entt']]], - ['meta_5ffunction_5fhelper_5ft_312',['meta_function_helper_t',['../namespaceentt.html#a692beabf853ee0f9dc68beab816a6b27',1,'entt']]], - ['meta_5fgetter_313',['meta_getter',['../namespaceentt.html#a3fe26d091f302630470004fe314a6a8d',1,'entt']]], - ['meta_5fhandle_314',['meta_handle',['../structentt_1_1meta__handle.html',1,'entt::meta_handle'],['../structentt_1_1meta__handle.html#a8d02bbf3a8088aa698db4491374dbf4c',1,'entt::meta_handle::meta_handle()=default'],['../structentt_1_1meta__handle.html#acaaa33d743703cf1af62691de0b86f50',1,'entt::meta_handle::meta_handle(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#aa988b1809a9687be4d25f21722075da5',1,'entt::meta_handle::meta_handle(meta_handle &&)=default'],['../structentt_1_1meta__handle.html#aed6a735b7dd561d9231334e54fe6fe55',1,'entt::meta_handle::meta_handle(Type &value)']]], - ['meta_5finvoke_315',['meta_invoke',['../namespaceentt.html#a00d375156fcfcc72d62eab6728650556',1,'entt::meta_invoke([[maybe_unused]] meta_handle instance, Candidate &&candidate, [[maybe_unused]] meta_any *const args)'],['../namespaceentt.html#a3281f612575b11cef54d9d1008d7a469',1,'entt::meta_invoke(meta_handle instance, meta_any *const args)']]], - ['meta_5fiterator_316',['meta_iterator',['../classentt_1_1meta__associative__container_1_1meta__iterator.html',1,'entt::meta_associative_container::meta_iterator'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html',1,'entt::meta_sequence_container::meta_iterator'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a6821f88f44fed32de0a72da1b2f7b577',1,'entt::meta_sequence_container::meta_iterator::meta_iterator()=default'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a027834ba004cd79ca12ed34065378876',1,'entt::meta_sequence_container::meta_iterator::meta_iterator(It iter)'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a2682e9f7aba8440775ce5dbe91fe5640',1,'entt::meta_associative_container::meta_iterator::meta_iterator()=default'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#aed07ae38ce5daef3641909a93dd5895b',1,'entt::meta_associative_container::meta_iterator::meta_iterator(std::integral_constant< bool, KeyOnly >, It iter)']]], - ['meta_5fprop_317',['meta_prop',['../structentt_1_1meta__prop.html',1,'entt::meta_prop'],['../structentt_1_1meta__prop.html#a7103135ff9cf911f33850916e5b9e66d',1,'entt::meta_prop::meta_prop()']]], - ['meta_5frange_318',['meta_range',['../structentt_1_1meta__range.html',1,'entt::meta_range< Type, Node >'],['../structentt_1_1meta__range.html#aa9eb66c65013ff00985f88e956360511',1,'entt::meta_range::meta_range(node_type *head)'],['../structentt_1_1meta__range.html#ab8064a6fa2209baf3af9501230165615',1,'entt::meta_range::meta_range()=default']]], - ['meta_5freset_319',['meta_reset',['../namespaceentt.html#a4f5090482af8e4ab0afa3e27abf1eec3',1,'entt::meta_reset(const id_type id)'],['../namespaceentt.html#a0e6591abe0fd3b376413e2ba5ba760ea',1,'entt::meta_reset()']]], - ['meta_5fsequence_5fcontainer_320',['meta_sequence_container',['../classentt_1_1meta__sequence__container.html',1,'entt::meta_sequence_container'],['../classentt_1_1meta__sequence__container.html#a392df26352c3267384c89e71cd9b2b0b',1,'entt::meta_sequence_container::meta_sequence_container()=default'],['../classentt_1_1meta__sequence__container.html#aa819089d23af053d3e413f6c8baffa71',1,'entt::meta_sequence_container::meta_sequence_container(std::in_place_type_t< Type >, any instance)']]], - ['meta_5fsequence_5fcontainer_5ftraits_321',['meta_sequence_container_traits',['../structentt_1_1meta__sequence__container__traits.html',1,'entt']]], - ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3aarray_3c_20type_2c_20n_20_3e_20_3e_322',['meta_sequence_container_traits< std::array< Type, N > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html',1,'entt']]], - ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3avector_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_323',['meta_sequence_container_traits< std::vector< Type, Args... > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fsetter_324',['meta_setter',['../namespaceentt.html#adbe109e5134bae55cb519799acbed732',1,'entt']]], - ['meta_5ftemplate_5ftraits_325',['meta_template_traits',['../structentt_1_1meta__template__traits.html',1,'entt']]], - ['meta_5ftemplate_5ftraits_3c_20clazz_3c_20args_2e_2e_2e_20_3e_20_3e_326',['meta_template_traits< Clazz< Args... > >',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5ftype_327',['meta_type',['../classentt_1_1meta__type.html',1,'entt::meta_type'],['../classentt_1_1meta__type.html#ad5e1e307b880f8777b93e7f0db625b6b',1,'entt::meta_type::meta_type(const node_type *curr=nullptr)'],['../classentt_1_1meta__type.html#accc26762b2ac418d8bc0308cf5b46b05',1,'entt::meta_type::meta_type(const base_node_type *curr)']]], - ['monostate_328',['monostate',['../structentt_1_1monostate.html',1,'entt']]], - ['monostate_5fv_329',['monostate_v',['../namespaceentt.html#ab43a13f7ee60bcb0d04a001f92b86fa2',1,'entt']]], - ['move_5fand_5fpop_330',['move_and_pop',['../classentt_1_1basic__sparse__set.html#abe61ba2bc567ec90efd60b619ba76d57',1,'entt::basic_sparse_set::move_and_pop()'],['../classentt_1_1basic__storage.html#aa5da3f4cfbda0add7a0fbcee565d842d',1,'entt::basic_storage::move_and_pop()']]] + ['make_5fany_280',['make_any',['../namespaceentt.html#a246375cb799b9dc67b9a555f91d94099',1,'entt']]], + ['make_5fmeta_281',['make_meta',['../namespaceentt.html#abdd5e7fb78b64f8238eacae2f10ba06e',1,'entt']]], + ['make_5fobj_5fusing_5fallocator_282',['make_obj_using_allocator',['../namespaceentt.html#a12e4d0c58f9c4cc6f5513c39c530b9b7',1,'entt']]], + ['map_283',['map',['../classentt_1_1basic__continuous__loader.html#a8cf619f4617f38dcb2a8c07c83262b42',1,'entt::basic_continuous_loader']]], + ['mapped_5ftype_284',['mapped_type',['../classentt_1_1dense__map.html#a7cdfe85f102518543b7a684c9e8e3bd3',1,'entt::dense_map::mapped_type()'],['../classentt_1_1meta__associative__container.html#ac4654bf85edf4eb784e7a4e9f12ef59d',1,'entt::meta_associative_container::mapped_type()']]], + ['matcher_285',['matcher',['../structentt_1_1matcher.html',1,'entt']]], + ['max_5fbucket_5fcount_286',['max_bucket_count',['../classentt_1_1dense__set.html#ac3410a73c0331657be2da1c8f0855949',1,'entt::dense_set::max_bucket_count()'],['../classentt_1_1dense__map.html#a4818548e35a239228a5fae77af01e7f5',1,'entt::dense_map::max_bucket_count() const']]], + ['max_5fload_5ffactor_287',['max_load_factor',['../classentt_1_1dense__map.html#a54a2dd65d401a992fd91fb8a91faea86',1,'entt::dense_map::max_load_factor() const'],['../classentt_1_1dense__map.html#a608539db499acbc3a7548421ea5d8709',1,'entt::dense_map::max_load_factor(const float value)'],['../classentt_1_1dense__set.html#ab740b6ce89b700657c796b7388563569',1,'entt::dense_set::max_load_factor(const float value)'],['../classentt_1_1dense__set.html#aeb02fd08b390059b8c1cffc39a6f40f1',1,'entt::dense_set::max_load_factor() const']]], + ['member_5fclass_288',['member_class',['../classentt_1_1member__class.html',1,'entt']]], + ['member_5fclass_5ft_289',['member_class_t',['../namespaceentt.html#a49f19d031690e5ebfffd6c7a4f6bd364',1,'entt']]], + ['meta_290',['meta',['../namespaceentt.html#a3ae5a1bdbb378be2ae0556ff437cf513',1,'entt']]], + ['meta_5fany_291',['meta_any',['../classentt_1_1meta__any.html',1,'entt::meta_any'],['../classentt_1_1meta__any.html#afb14535cc13fc0b3c9790d150d3d7bf5',1,'entt::meta_any::meta_any(meta_any &&other)'],['../classentt_1_1meta__any.html#a51936bb6212a3bfc87b71afb2d6085c3',1,'entt::meta_any::meta_any(const meta_any &other)=default'],['../classentt_1_1meta__any.html#a7e1dba79e26c96a353743a327d1c7b8e',1,'entt::meta_any::meta_any(Type &&value)'],['../classentt_1_1meta__any.html#a327704bdb52c21b9ea8f221cdac11b20',1,'entt::meta_any::meta_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1meta__any.html#a00d2839b7929d7043b47fd0fad15fc1e',1,'entt::meta_any::meta_any()']]], + ['meta_5fassociative_5fcontainer_292',['meta_associative_container',['../classentt_1_1meta__associative__container.html',1,'entt::meta_associative_container'],['../classentt_1_1meta__associative__container.html#ac2405eee51b302c36e3aaefb97fcd0cd',1,'entt::meta_associative_container::meta_associative_container(std::in_place_type_t< Type >, any instance)'],['../classentt_1_1meta__associative__container.html#a088ac917d0505b0dd55a0378cc725225',1,'entt::meta_associative_container::meta_associative_container()=default']]], + ['meta_5fassociative_5fcontainer_5ftraits_293',['meta_associative_container_traits',['../structentt_1_1meta__associative__container__traits.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fmap_3c_20key_2c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_294',['meta_associative_container_traits< dense_map< Key, Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fset_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_295',['meta_associative_container_traits< dense_set< Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3amap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_296',['meta_associative_container_traits< std::map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_297',['meta_associative_container_traits< std::set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fmap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_298',['meta_associative_container_traits< std::unordered_map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_299',['meta_associative_container_traits< std::unordered_set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fclass_5ftemplate_5ftag_300',['meta_class_template_tag',['../structentt_1_1meta__class__template__tag.html',1,'entt']]], + ['meta_5fconstruct_301',['meta_construct',['../namespaceentt.html#a681f2bc9d84e3851405cf4b8c8e21455',1,'entt::meta_construct(meta_any *const args)'],['../namespaceentt.html#aef8c196db303590ebe456287b5890cf4',1,'entt::meta_construct(Candidate &&candidate, meta_any *const args)'],['../namespaceentt.html#a3b0d075524517183181aa512417358a0',1,'entt::meta_construct(meta_any *const args)']]], + ['meta_5fctx_302',['meta_ctx',['../structentt_1_1meta__ctx.html',1,'entt']]], + ['meta_5fdata_303',['meta_data',['../structentt_1_1meta__data.html',1,'entt::meta_data'],['../structentt_1_1meta__data.html#a287652cfd950c698d124d12820ec9d10',1,'entt::meta_data::meta_data()']]], + ['meta_5fdispatch_304',['meta_dispatch',['../namespaceentt.html#a957782a57268c06cef354868d4402c74',1,'entt']]], + ['meta_5ffactory_305',['meta_factory',['../classentt_1_1meta__factory.html',1,'entt::meta_factory<... >'],['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#afd118c3e987d809b5e5a43a836e0e405',1,'entt::meta_factory< Type, Spec... >::meta_factory()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#ab51530893e710d51fbc99c95f32931be',1,'entt::meta_factory< Type >::meta_factory()']]], + ['meta_5ffactory_3c_20type_20_3e_306',['meta_factory< Type >',['../classentt_1_1meta__factory_3_01Type_01_4.html',1,'entt']]], + ['meta_5ffactory_3c_20type_2c_20spec_2e_2e_2e_20_3e_307',['meta_factory< Type, Spec... >',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html',1,'entt']]], + ['meta_5ffunc_308',['meta_func',['../structentt_1_1meta__func.html',1,'entt::meta_func'],['../structentt_1_1meta__func.html#afa6ee51299057be3baddee875b37b6d3',1,'entt::meta_func::meta_func()']]], + ['meta_5ffunction_5fdescriptor_309',['meta_function_descriptor',['../structentt_1_1meta__function__descriptor.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_20class_3a_3a_2a_20_3e_310',['meta_function_descriptor< Type, Ret Class::* >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28_29_3e_311',['meta_function_descriptor< Type, Ret(*)()>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28maybetype_2c_20args_2e_2e_2e_29_3e_312',['meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_20const_20_3e_313',['meta_function_descriptor< Type, Ret(Class::*)(Args...) const >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_3e_314',['meta_function_descriptor< Type, Ret(Class::*)(Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html',1,'entt']]], + ['meta_5ffunction_5fhelper_315',['meta_function_helper',['../classentt_1_1meta__function__helper.html',1,'entt']]], + ['meta_5ffunction_5fhelper_5ft_316',['meta_function_helper_t',['../namespaceentt.html#a692beabf853ee0f9dc68beab816a6b27',1,'entt']]], + ['meta_5fgetter_317',['meta_getter',['../namespaceentt.html#a3fe26d091f302630470004fe314a6a8d',1,'entt']]], + ['meta_5fhandle_318',['meta_handle',['../structentt_1_1meta__handle.html',1,'entt::meta_handle'],['../structentt_1_1meta__handle.html#a8d02bbf3a8088aa698db4491374dbf4c',1,'entt::meta_handle::meta_handle()=default'],['../structentt_1_1meta__handle.html#acaaa33d743703cf1af62691de0b86f50',1,'entt::meta_handle::meta_handle(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#aa988b1809a9687be4d25f21722075da5',1,'entt::meta_handle::meta_handle(meta_handle &&)=default'],['../structentt_1_1meta__handle.html#aed6a735b7dd561d9231334e54fe6fe55',1,'entt::meta_handle::meta_handle(Type &value)']]], + ['meta_5finvoke_319',['meta_invoke',['../namespaceentt.html#a00d375156fcfcc72d62eab6728650556',1,'entt::meta_invoke([[maybe_unused]] meta_handle instance, Candidate &&candidate, [[maybe_unused]] meta_any *const args)'],['../namespaceentt.html#a3281f612575b11cef54d9d1008d7a469',1,'entt::meta_invoke(meta_handle instance, meta_any *const args)']]], + ['meta_5fprop_320',['meta_prop',['../structentt_1_1meta__prop.html',1,'entt::meta_prop'],['../structentt_1_1meta__prop.html#a7103135ff9cf911f33850916e5b9e66d',1,'entt::meta_prop::meta_prop()']]], + ['meta_5frange_321',['meta_range',['../structentt_1_1meta__range.html',1,'entt::meta_range< Type, Node >'],['../structentt_1_1meta__range.html#ab8064a6fa2209baf3af9501230165615',1,'entt::meta_range::meta_range()=default'],['../structentt_1_1meta__range.html#aa9eb66c65013ff00985f88e956360511',1,'entt::meta_range::meta_range(node_type *head)']]], + ['meta_5freset_322',['meta_reset',['../namespaceentt.html#a4f5090482af8e4ab0afa3e27abf1eec3',1,'entt::meta_reset(const id_type id)'],['../namespaceentt.html#a0e6591abe0fd3b376413e2ba5ba760ea',1,'entt::meta_reset()']]], + ['meta_5fsequence_5fcontainer_323',['meta_sequence_container',['../classentt_1_1meta__sequence__container.html',1,'entt::meta_sequence_container'],['../classentt_1_1meta__sequence__container.html#aa819089d23af053d3e413f6c8baffa71',1,'entt::meta_sequence_container::meta_sequence_container(std::in_place_type_t< Type >, any instance)'],['../classentt_1_1meta__sequence__container.html#a392df26352c3267384c89e71cd9b2b0b',1,'entt::meta_sequence_container::meta_sequence_container()=default']]], + ['meta_5fsequence_5fcontainer_5ftraits_324',['meta_sequence_container_traits',['../structentt_1_1meta__sequence__container__traits.html',1,'entt']]], + ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3aarray_3c_20type_2c_20n_20_3e_20_3e_325',['meta_sequence_container_traits< std::array< Type, N > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html',1,'entt']]], + ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3avector_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_326',['meta_sequence_container_traits< std::vector< Type, Args... > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fsetter_327',['meta_setter',['../namespaceentt.html#adbe109e5134bae55cb519799acbed732',1,'entt']]], + ['meta_5ftemplate_5ftraits_328',['meta_template_traits',['../structentt_1_1meta__template__traits.html',1,'entt']]], + ['meta_5ftemplate_5ftraits_3c_20clazz_3c_20args_2e_2e_2e_20_3e_20_3e_329',['meta_template_traits< Clazz< Args... > >',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5ftype_330',['meta_type',['../classentt_1_1meta__type.html',1,'entt::meta_type'],['../classentt_1_1meta__type.html#ad5e1e307b880f8777b93e7f0db625b6b',1,'entt::meta_type::meta_type(const node_type *curr=nullptr)'],['../classentt_1_1meta__type.html#accc26762b2ac418d8bc0308cf5b46b05',1,'entt::meta_type::meta_type(const base_node_type *curr)']]], + ['monostate_331',['monostate',['../structentt_1_1monostate.html',1,'entt']]], + ['monostate_5fv_332',['monostate_v',['../namespaceentt.html#ab43a13f7ee60bcb0d04a001f92b86fa2',1,'entt']]] ]; diff --git a/search/all_c.js b/search/all_c.js index 4f377a26b..2688b73f4 100644 --- a/search/all_c.js +++ b/search/all_c.js @@ -1,8 +1,8 @@ var searchData= [ - ['name_331',['name',['../classentt_1_1type__info.html#a0e7a10db927c013184939421cbeb7815',1,'entt::type_info::name()'],['../structentt_1_1basic__organizer_1_1vertex.html#aacc9f65a7bd16763647677d8b84bb74b',1,'entt::basic_organizer::vertex::name()']]], - ['next_5fpower_5fof_5ftwo_332',['next_power_of_two',['../namespaceentt.html#a5a2dbf5d86123af800abdd8fe69542ca',1,'entt']]], - ['node_5ftype_333',['node_type',['../structentt_1_1meta__prop.html#a9da5b4916bdadd45ff0e0d90b245226c',1,'entt::meta_prop::node_type()'],['../structentt_1_1meta__data.html#a0aa23c3d404c35751aa6b85870eafc21',1,'entt::meta_data::node_type()'],['../structentt_1_1meta__func.html#ac3c77ffeae29f5d511a5961cc25617c0',1,'entt::meta_func::node_type()'],['../classentt_1_1meta__type.html#a2dc19d640208c4f887a1abb5d4fe7f61',1,'entt::meta_type::node_type()'],['../structentt_1_1meta__range.html#a432a47eca3a3f2615a989f74d45b08d8',1,'entt::meta_range::node_type()']]], - ['null_334',['null',['../namespaceentt.html#a2f0c0a1c1d953ea991591748744cdd8b',1,'entt']]], - ['null_5ft_335',['null_t',['../structentt_1_1null__t.html',1,'entt']]] + ['name_333',['name',['../structentt_1_1type__info.html#a0e7a10db927c013184939421cbeb7815',1,'entt::type_info::name()'],['../structentt_1_1basic__organizer_1_1vertex.html#aacc9f65a7bd16763647677d8b84bb74b',1,'entt::basic_organizer::vertex::name()']]], + ['next_5fpower_5fof_5ftwo_334',['next_power_of_two',['../namespaceentt.html#a5a2dbf5d86123af800abdd8fe69542ca',1,'entt']]], + ['node_5ftype_335',['node_type',['../structentt_1_1meta__prop.html#a9da5b4916bdadd45ff0e0d90b245226c',1,'entt::meta_prop::node_type()'],['../structentt_1_1meta__data.html#a0aa23c3d404c35751aa6b85870eafc21',1,'entt::meta_data::node_type()'],['../structentt_1_1meta__func.html#ac3c77ffeae29f5d511a5961cc25617c0',1,'entt::meta_func::node_type()'],['../classentt_1_1meta__type.html#a2dc19d640208c4f887a1abb5d4fe7f61',1,'entt::meta_type::node_type()'],['../structentt_1_1meta__range.html#a432a47eca3a3f2615a989f74d45b08d8',1,'entt::meta_range::node_type()']]], + ['null_336',['null',['../namespaceentt.html#a2f0c0a1c1d953ea991591748744cdd8b',1,'entt']]], + ['null_5ft_337',['null_t',['../structentt_1_1null__t.html',1,'entt']]] ]; diff --git a/search/all_d.js b/search/all_d.js index 6daad9f20..610b19470 100644 --- a/search/all_d.js +++ b/search/all_d.js @@ -1,46 +1,45 @@ var searchData= [ - ['observer_336',['observer',['../namespaceentt.html#a48dfbb2991c5a19c6e2578830f7e3eda',1,'entt']]], - ['on_337',['on',['../classentt_1_1emitter.html#a0b580005200bb810a4a3e94320efcd8a',1,'entt::emitter']]], - ['on_5fconstruct_338',['on_construct',['../classentt_1_1basic__registry.html#adc3cd847e65843f936824cd7d45984a5',1,'entt::basic_registry::on_construct()'],['../classentt_1_1sigh__storage__mixin.html#a307e783d42de1994678bb9aaeb86305d',1,'entt::sigh_storage_mixin::on_construct()']]], - ['on_5fdestroy_339',['on_destroy',['../classentt_1_1basic__registry.html#ad87a72c6d1e49a2fd992ddb7fd9d5a93',1,'entt::basic_registry::on_destroy()'],['../classentt_1_1sigh__storage__mixin.html#a04cc3ac5e26e6a0070fc87a8e5e5fb3e',1,'entt::sigh_storage_mixin::on_destroy()']]], - ['on_5fupdate_340',['on_update',['../classentt_1_1basic__registry.html#aaaf474d42df7b8852c4656152cc4a295',1,'entt::basic_registry::on_update()'],['../classentt_1_1sigh__storage__mixin.html#aad9a29530cf1408803a45573ffbee711',1,'entt::sigh_storage_mixin::on_update()']]], - ['once_341',['once',['../classentt_1_1emitter.html#a79834d452b0600ebe0e70c54f4a21fd6',1,'entt::emitter']]], - ['operator_20basic_5fgroup_3c_20entity_5ftype_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_2c_20exclude_20_3e_342',['operator basic_group< entity_type, owned_t< Owned... >, Get, Exclude >',['../structentt_1_1as__group.html#a35cbba4f387f92c80935183da08798ca',1,'entt::as_group']]], - ['operator_20basic_5fhandle_3c_20other_2c_20args_2e_2e_2e_20_3e_343',['operator basic_handle< Other, Args... >',['../structentt_1_1basic__handle.html#a3e3190a9991d334cdd20b4d8841d7545',1,'entt::basic_handle']]], - ['operator_20basic_5fview_3c_20entity_5ftype_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_20_3e_344',['operator basic_view< entity_type, get_t< Component... >, Exclude >',['../structentt_1_1as__view.html#a33df5ef10293a3153cd467edd72be425',1,'entt::as_view']]], - ['operator_20bool_345',['operator bool',['../classentt_1_1meta__any.html#a307d84b99d93841efc574e7807ac7786',1,'entt::meta_any::operator bool()'],['../classentt_1_1basic__any.html#a071b4fda8629b1767b384d01a0113496',1,'entt::basic_any::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a71396a63f68d8375329a1253b9634c7b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a177bb26a1d23da0502aeca143a3ae2a9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../structentt_1_1basic__handle.html#a80b439c1dd5924807bc26585c3c1ef4d',1,'entt::basic_handle::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aed52b322f7405bb527769aa051d6186e',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aa1e551e84f124033b5cfb5bfd09b630f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator bool()'],['../classentt_1_1meta__sequence__container.html#a004cb45ad3f51dbde8346fa1b202a13f',1,'entt::meta_sequence_container::operator bool()'],['../classentt_1_1meta__associative__container.html#a202720cb81c234e0e8e16db48b4adf2e',1,'entt::meta_associative_container::operator bool()'],['../structentt_1_1meta__handle.html#a6936d403200fd97fd34d366d9c980c6c',1,'entt::meta_handle::operator bool()'],['../structentt_1_1meta__prop.html#a95a94a16e568cbf443056406155e122e',1,'entt::meta_prop::operator bool()'],['../structentt_1_1meta__data.html#a597429fb3dfbc05a48d2f8dd31133d97',1,'entt::meta_data::operator bool()'],['../structentt_1_1meta__func.html#a84da8b799b2feab77060a686da004b45',1,'entt::meta_func::operator bool()'],['../classentt_1_1meta__type.html#aaf7716aacffeaf51c8dcb283a6cc4630',1,'entt::meta_type::operator bool()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a4671598328a55a00a9631bd109d9bc10',1,'entt::meta_sequence_container::meta_iterator::operator bool()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#aad5300ee6bc83f198a24d8f6dc8bf73a',1,'entt::meta_associative_container::meta_iterator::operator bool()'],['../classentt_1_1basic__poly.html#a311984ecc234832af9603c6ba1e3cd02',1,'entt::basic_poly::operator bool()'],['../classentt_1_1resource__handle.html#a78608879425212e25817c16e3393ee07',1,'entt::resource_handle::operator bool()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af9dcbcb5c62a4cbfeb41cae502e5236e',1,'entt::delegate< Ret(Args...)>::operator bool()'],['../classentt_1_1connection.html#ad912298fe40bd1b6aa5b8b950850bb70',1,'entt::connection::operator bool()'],['../structentt_1_1scoped__connection.html#a0b4e9958e0dbc1b1ba14a878531a475d',1,'entt::scoped_connection::operator bool()']]], - ['operator_20const_20value_5ftype_20_2a_346',['operator const value_type *',['../classentt_1_1basic__hashed__string.html#aa9ade09d3f55abe5bbae3438331aa7a2',1,'entt::basic_hashed_string']]], - ['operator_20entity_347',['operator Entity',['../structentt_1_1null__t.html#a816903f5ef0036594891edcf253d2570',1,'entt::null_t::operator Entity()'],['../structentt_1_1tombstone__t.html#a486219c88fe6ca91248095914fca745e',1,'entt::tombstone_t::operator Entity()']]], - ['operator_20entity_5ftype_348',['operator entity_type',['../structentt_1_1basic__handle.html#ae094b8474a9e4363b5c4503753b9ec4c',1,'entt::basic_handle']]], - ['operator_20hash_5ftype_349',['operator hash_type',['../classentt_1_1basic__hashed__string.html#a342323328cacb574f886a5720dd71580',1,'entt::basic_hashed_string']]], - ['operator_20id_5ftype_350',['operator id_type',['../structentt_1_1type__index.html#a5909d64d944e5957c22df8be65e17926',1,'entt::type_index::operator id_type()'],['../structentt_1_1type__hash.html#af86c7a01cb72943521b4dd6e7ac0bc8c',1,'entt::type_hash::operator id_type()']]], - ['operator_20resource_5ftype_20_26_351',['operator resource_type &',['../classentt_1_1resource__handle.html#a9ef20d31d925a71d0fa95c8ac5a28dec',1,'entt::resource_handle']]], - ['operator_20type_352',['operator Type',['../structentt_1_1monostate.html#a1ec272e17db93124df74bd15d36b1e1d',1,'entt::monostate']]], - ['operator_20type_20_26_26_353',['operator Type &&',['../structentt_1_1poly__inspector.html#a5b44cbea11e79b2ff918165b7bf100eb',1,'entt::poly_inspector']]], - ['operator_21_3d_354',['operator!=',['../namespaceentt.html#a845d4ef2c448264153449c92157a0359',1,'entt::operator!=()'],['../structentt_1_1null__t.html#a1bd5e7e2a2fdc78944cf32ee03a6d0ab',1,'entt::null_t::operator!=([[maybe_unused]] const null_t other) const'],['../structentt_1_1null__t.html#a1e155d4d92605008969c3df64484ed44',1,'entt::null_t::operator!=(const Entity entity) const'],['../structentt_1_1tombstone__t.html#af2e901bd03a7676aa3596f8c55f91d1e',1,'entt::tombstone_t::operator!=([[maybe_unused]] const tombstone_t other) const'],['../structentt_1_1tombstone__t.html#ae75cbf2733dcde452dd782d3c7eda923',1,'entt::tombstone_t::operator!=(const Entity entity) const'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a1f3c9f4a3d71e6d8686ee509bcca51aa',1,'entt::meta_sequence_container::meta_iterator::operator!=()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a1c44654e6c852593ecbe572405ae157c',1,'entt::meta_associative_container::meta_iterator::operator!=()'],['../namespaceentt.html#ac200eb460760246368bb737dc434c0eb',1,'entt::operator!=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ae38ac5bc7b9097ec21eb1058db206cff',1,'entt::operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)'],['../namespaceentt.html#a5b6b2e64d7d0ca7bd46c4fc9009cb552',1,'entt::operator!=(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a6185f9faa3f9fa26ecb1b9a837016147',1,'entt::operator!=(const Entity entity, const null_t other)'],['../namespaceentt.html#a39702a79d9ba6f5d7cb8668b0a7a1524',1,'entt::operator!=(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#a7ef0d5ec3214e57aa4b8406fbe9ee3a5',1,'entt::operator!=(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)'],['../namespaceentt.html#a04ebb219547c34209a94c9eb6d26eda1',1,'entt::operator!=(const meta_type &lhs, const meta_type &rhs)'],['../namespaceentt.html#ac8711ef7a24e5329d7cbd0d05136874e',1,'entt::operator!=(const delegate< Ret(Args...)> &lhs, const delegate< Ret(Args...)> &rhs)']]], - ['operator_22_22_5fhs_355',['operator""_hs',['../namespaceentt.html#a556190d147a6a92fc16bbf31bd4b263a',1,'entt::literals']]], - ['operator_22_22_5fhws_356',['operator""_hws',['../namespaceentt.html#a226e03b3f52eb1bbce832ec53106bd6a',1,'entt::literals']]], - ['operator_28_29_357',['operator()',['../structentt_1_1radix__sort.html#a1989f6fbe18d3d82fdea9745d6b9ee96',1,'entt::radix_sort::operator()()'],['../structentt_1_1identity.html#a4bab5676dfa9eca188b2145708a086b8',1,'entt::identity::operator()()'],['../structentt_1_1y__combinator.html#a353f6f122334b26a90ce81cc32744ec3',1,'entt::y_combinator::operator()(Args &&...args) const'],['../structentt_1_1y__combinator.html#ade7f955583e7a887220e6ef391bfb7d2',1,'entt::y_combinator::operator()(Args &&...args)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a0e53caedb53810bc96aa71bce199c990',1,'entt::delegate< Ret(Args...)>::operator()()'],['../structentt_1_1std__sort.html#a8895e4acd1677a60e07d7e28748fe667',1,'entt::std_sort::operator()()'],['../structentt_1_1insertion__sort.html#a73a5644fe5b683f9b9376c89ac47f2b8',1,'entt::insertion_sort::operator()()']]], - ['operator_2a_358',['operator*',['../classentt_1_1meta__any.html#a15c62ff440280cb6e25e6a5b781a8aae',1,'entt::meta_any::operator*()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a9417a9f49bfdb6ad4edda6a17bfe6650',1,'entt::meta_associative_container::meta_iterator::operator*()'],['../classentt_1_1resource__handle.html#a505077caf97084b6f507c635e4d3630b',1,'entt::resource_handle::operator*()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ab88fe602ee7756bc182bd2b75554ac56',1,'entt::meta_sequence_container::meta_iterator::operator*()']]], - ['operator_2b_359',['operator+',['../namespaceentt.html#a6c6e966c8af5b1452811aa55adbbdf47',1,'entt::operator+(type_list< Type... >, type_list< Other... >)'],['../namespaceentt.html#aabc6dd5fb4d2bc92d9e5101b7b0bce1d',1,'entt::operator+(value_list< Value... >, value_list< Other... >)']]], - ['operator_2b_2b_360',['operator++',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a9ce70316ca703976d7ad5f0feac6db11',1,'entt::meta_sequence_container::meta_iterator::operator++()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a2ca9ecc7a3bd732c1ef21969b410d547',1,'entt::meta_sequence_container::meta_iterator::operator++(int)'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#ae9e913c2e2e757e44873661b795ea56c',1,'entt::meta_associative_container::meta_iterator::operator++()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#acdb2a5e8516133e976b8158766e000fa',1,'entt::meta_associative_container::meta_iterator::operator++(int)']]], - ['operator_2d_3e_361',['operator->',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ad0386e92772a88a2904a295c88e9cb7a',1,'entt::meta_sequence_container::meta_iterator::operator->()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#ac796300fe40920c0cd4a2724f9d0e2fa',1,'entt::meta_associative_container::meta_iterator::operator->()'],['../classentt_1_1basic__poly.html#a06f659d892ece6b3908644a5452ed550',1,'entt::basic_poly::operator->()'],['../classentt_1_1basic__poly.html#a0d3461b19558dceb0b60d7f7f2e23ef2',1,'entt::basic_poly::operator->() const'],['../classentt_1_1resource__handle.html#abdb14da5bcb5a4d1676235d9cc6b6ee3',1,'entt::resource_handle::operator->()'],['../structentt_1_1input__iterator__pointer.html#ab4a5b1478272e26c60f7123b0a2e155f',1,'entt::input_iterator_pointer::operator->()'],['../structentt_1_1meta__handle.html#ad1309701800c7727eb519ee14b655e30',1,'entt::meta_handle::operator->()'],['../structentt_1_1meta__handle.html#aeaeac6808357732eeb2ce615c7ccb0eb',1,'entt::meta_handle::operator->() const']]], - ['operator_3c_362',['operator<',['../namespaceentt.html#ac2789bea84be3354b9ec3f48b0af539c',1,'entt::operator<(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a95abccf779882bf65c4bb1cb99b8059c',1,'entt::operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)']]], - ['operator_3c_3d_363',['operator<=',['../namespaceentt.html#a400fd2e18a1fe98013bd4cdb281ad98f',1,'entt::operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ac99351681df5ffc84efcc14603ab6fc3',1,'entt::operator<=(const type_info &lhs, const type_info &rhs)']]], - ['operator_3d_364',['operator=',['../structentt_1_1monostate.html#aaffae05e053ccedffd625e8c1f0664c5',1,'entt::monostate::operator=()'],['../classentt_1_1basic__snapshot.html#a1484b609195cfd057bbdd8808d4392bc',1,'entt::basic_snapshot::operator=()'],['../classentt_1_1basic__snapshot__loader.html#aa55eeaad2ab4dd117524afff9d6e184b',1,'entt::basic_snapshot_loader::operator=()'],['../classentt_1_1basic__continuous__loader.html#afd396d84cb27e070a6a812bd28140c75',1,'entt::basic_continuous_loader::operator=()'],['../classentt_1_1basic__sparse__set.html#afd87d086a1b895ac6253c311eb90affb',1,'entt::basic_sparse_set::operator=()'],['../classentt_1_1basic__storage.html#a7672e87c11c51f4edf70ae68def122c8',1,'entt::basic_storage::operator=()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aef13645252ab183b46fa966bfcdd4ded',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::operator=()'],['../classentt_1_1meta__any.html#a97360c78351767409f9db58c9f785ad5',1,'entt::meta_any::operator=(const meta_any &other)'],['../classentt_1_1meta__any.html#a867681175c0928270919df9476ba10c5',1,'entt::meta_any::operator=(meta_any &&other)'],['../classentt_1_1meta__any.html#ae9298a9b894c870392da35f696fbb044',1,'entt::meta_any::operator=(Type &&value)'],['../structentt_1_1meta__handle.html#a750eb55693845b28da117db4d342b8e6',1,'entt::meta_handle::operator=(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#aacfd03669af75ce2684917e8e9f90132',1,'entt::meta_handle::operator=(meta_handle &&)=default'],['../classentt_1_1scheduler.html#aea6ab78dbf00ba17c6e828ee0505afd9',1,'entt::scheduler::operator=()'],['../classentt_1_1resource__cache.html#a1aecfbf6c4faaadb05ce5005c202223c',1,'entt::resource_cache::operator=()'],['../classentt_1_1resource__handle.html#a32c522c1b72534ba95ceb7c17b9baebf',1,'entt::resource_handle::operator=(const resource_handle &other)=default'],['../classentt_1_1resource__handle.html#a93f95303ff32ef9686bfa69bb75abbb6',1,'entt::resource_handle::operator=(resource_handle &&other)=default'],['../classentt_1_1resource__handle.html#a6dab45269845d4eb2e90daa813b318a6',1,'entt::resource_handle::operator=(const resource_handle< Other > &other)'],['../classentt_1_1resource__handle.html#a8236f83607681c7e421613f19eb79f56',1,'entt::resource_handle::operator=(resource_handle< Other > &&other)'],['../classentt_1_1dispatcher.html#aa316ef3726d611b15bd1b02f720342a5',1,'entt::dispatcher::operator=()'],['../classentt_1_1emitter.html#ab270d2c6d986621a781467e29e64629c',1,'entt::emitter::operator=()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a23c0e4cfafdc631539651db4af7f0ac2',1,'entt::sigh< Ret(Args...), Allocator >::operator=(const sigh &other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a515f527211650b9b3882deb4e4c5d650',1,'entt::sigh< Ret(Args...), Allocator >::operator=(sigh &&other)'],['../structentt_1_1scoped__connection.html#ae079c45e0eb97f31ec1d5a4be76163fc',1,'entt::scoped_connection::operator=(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#abe0ec74231b7bece430c6dd5ffdeddc2',1,'entt::scoped_connection::operator=(scoped_connection &&other)'],['../structentt_1_1scoped__connection.html#a900d499bf30a8f33beb19f41af9b93b3',1,'entt::scoped_connection::operator=(connection other)'],['../classentt_1_1basic__observer.html#a8b7cd199f236a4dee02f202ec0fd6281',1,'entt::basic_observer::operator=()'],['../structentt_1_1input__iterator__pointer.html#a24452709a3e3c45713c033073f02c485',1,'entt::input_iterator_pointer::operator=()'],['../classentt_1_1dense__hash__map.html#a7c4f2479f3c41a71518e6edd9f2c7b36',1,'entt::dense_hash_map::operator=()'],['../classentt_1_1basic__observer.html#a03dcb6b0999d29bc39410d7ae6d9ac53',1,'entt::basic_observer::operator=()'],['../classentt_1_1basic__registry.html#a23d233b9e2c4a92395a60087891c52fe',1,'entt::basic_registry::operator=()'],['../classentt_1_1dense__hash__map.html#a01b3c79588b4d4b279fb3ff2ac510945',1,'entt::dense_hash_map::operator=()'],['../classentt_1_1dense__hash__set.html#a221ba9727d93399d0520ad17e12b47df',1,'entt::dense_hash_set::operator=(const dense_hash_set &other)'],['../classentt_1_1dense__hash__set.html#ab68be75780de7db8116c669555066d08',1,'entt::dense_hash_set::operator=(dense_hash_set &&other)=default'],['../classentt_1_1basic__any.html#a2918b13d6957ccaae7796ea76be6807f',1,'entt::basic_any::operator=(const basic_any &other)'],['../classentt_1_1basic__any.html#ab8d80c9b2be44588959c2a3cb451c162',1,'entt::basic_any::operator=(basic_any &&other)'],['../classentt_1_1basic__any.html#a58bb0a9c97a6a75e5b7984acf6fd268b',1,'entt::basic_any::operator=(Type &&value)'],['../classentt_1_1compressed__pair.html#a73b4a959b934357bc41b8e9c53b47496',1,'entt::compressed_pair::operator=(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#ad61f40edf314083598c0b0d76aa90fa1',1,'entt::compressed_pair::operator=(compressed_pair &&other)=default'],['../structentt_1_1input__iterator__pointer.html#acdd70bff5e5dc7dedd5851432bbed9d9',1,'entt::input_iterator_pointer::operator=()']]], - ['operator_3d_3d_365',['operator==',['../structentt_1_1null__t.html#aa9a56492571f7949c26fc7ce4c9aa441',1,'entt::null_t::operator==()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#adf1a347090bce0e5e133695110988442',1,'entt::meta_sequence_container::meta_iterator::operator==()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a5de494fe89185aff94920c5dbaac67fc',1,'entt::meta_associative_container::meta_iterator::operator==()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ab1cf637f608b81e72070b7d6cc385e9d',1,'entt::delegate< Ret(Args...)>::operator==()'],['../classentt_1_1meta__type.html#a39159083cd8ac72bb27859ccd4f0f732',1,'entt::meta_type::operator==()'],['../classentt_1_1basic__any.html#adc66c85290945fc808d1979db9040454',1,'entt::basic_any::operator==()'],['../classentt_1_1meta__any.html#a1bd17bffb75be10543e85c78185d765a',1,'entt::meta_any::operator==()'],['../structentt_1_1tombstone__t.html#aa55c02c8ea69dc462ea78e4ad20c385f',1,'entt::tombstone_t::operator==(const Entity entity) const'],['../structentt_1_1tombstone__t.html#aa54c795fa1a8e817e56f14e29fc8beee',1,'entt::tombstone_t::operator==([[maybe_unused]] const tombstone_t other) const'],['../structentt_1_1null__t.html#a510e2259bb0ed264ecdf64f7e8b51665',1,'entt::null_t::operator==()'],['../namespaceentt.html#a07b2e32d6df969a3d20a8f263265fe96',1,'entt::operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a13f95d943a5794e7f7b481d3e02a2d96',1,'entt::operator==(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#af6de691c4ec15d4a63ea8960563bbea0',1,'entt::operator==(const Entity entity, const null_t other)'],['../namespaceentt.html#a0f371da1ef604fa726a88e9733e5ee54',1,'entt::operator==(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#aee5fe16dfbb40ab097d339b0c008fae7',1,'entt::operator==(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)']]], - ['operator_3e_366',['operator>',['../namespaceentt.html#affca347714c6771f1f5928f1c18a070f',1,'entt::operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a28f32860fd6de66a832389b365045047',1,'entt::operator>(const type_info &lhs, const type_info &rhs)']]], - ['operator_3e_3d_367',['operator>=',['../namespaceentt.html#a5d583f542e17fa8eb56d8d01c34b8920',1,'entt::operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a2e6acc16fe38d13c69b5d1fb237e4ac5',1,'entt::operator>=(const type_info &lhs, const type_info &rhs)']]], - ['operator_5b_5d_368',['operator[]',['../classentt_1_1meta__sequence__container.html#a69ecff5787961fb20256491e56df04ee',1,'entt::meta_sequence_container::operator[]()'],['../classentt_1_1dense__hash__map.html#a656c8e3719618ba7ffc32ac3c674acfd',1,'entt::dense_hash_map::operator[](const key_type &key)'],['../classentt_1_1dense__hash__map.html#addf363098d44c17aad8ef72a8869054d',1,'entt::dense_hash_map::operator[](key_type &&key)'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aaaf16dde27d8d4aed568a519a87b5b1b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aeed935700bcf21af637b96e144178a56',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__sparse__set.html#a3f88e4df5066e55ebfba192a85050553',1,'entt::basic_sparse_set::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a29cfb727d48591b93b58a5acb1d85fae',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab5aed61f5c7416b66f6e93c61b9e787b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[](const size_type pos) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aab90453fa7feb640ec46e2b50b4caace',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[](const entity_type entt) const']]], - ['operator_7c_369',['operator|',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a71bf0b47a5091541cb870f669aca6a1d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator|()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a1267ff896c8bd61b41b3e9d069f9ecc4',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator|()']]], - ['organizer_370',['organizer',['../namespaceentt.html#a5870a148e25a503557bdd47327c7a05a',1,'entt']]], - ['orphan_371',['orphan',['../classentt_1_1basic__registry.html#a10f5e61d4cabab9e9c1e87edc30de551',1,'entt::basic_registry::orphan()'],['../structentt_1_1basic__handle.html#a04557a12530c2c86cd90694d2f4c7bc7',1,'entt::basic_handle::orphan()']]], - ['orphans_372',['orphans',['../classentt_1_1basic__snapshot__loader.html#acd881016761f5eb598763fbf3595a625',1,'entt::basic_snapshot_loader::orphans()'],['../classentt_1_1basic__continuous__loader.html#ac8b328bb8c6c4acde51ab5b943f0ea86',1,'entt::basic_continuous_loader::orphans()']]], - ['overload_373',['overload',['../namespaceentt.html#a386a739051d9d37a5578785b77fc426b',1,'entt::overload(Type Class::*member)'],['../namespaceentt.html#ad4ea6822ef21f52c732ba3baea450159',1,'entt::overload(Func *func)']]], - ['overloaded_374',['overloaded',['../structentt_1_1overloaded.html',1,'entt::overloaded< Func >'],['../namespaceentt.html#a26eb67ac302229374c5fb623d529f5eb',1,'entt::overloaded(Func...) -> overloaded< Func... >']]], - ['owned_375',['owned',['../namespaceentt.html#ac91ddbe2446a912714a5fe7251e25768',1,'entt']]], - ['owned_5ft_376',['owned_t',['../structentt_1_1owned__t.html',1,'entt']]], - ['owner_377',['owner',['../classentt_1_1basic__any.html#ae20c3f5eecdcdaf715b332bbc363ee4d',1,'entt::basic_any::owner()'],['../classentt_1_1meta__any.html#abc6c66b9bf085ec3c67c10540d1f48a7',1,'entt::meta_any::owner()']]], - ['string_5fview_378',['string_view',['../structentt_1_1type__name.html#a5c425f6e665e43b4cf0a2249b8c127e2',1,'entt::type_name']]] + ['observer_338',['observer',['../namespaceentt.html#a48dfbb2991c5a19c6e2578830f7e3eda',1,'entt']]], + ['on_339',['on',['../classentt_1_1emitter.html#a0b580005200bb810a4a3e94320efcd8a',1,'entt::emitter']]], + ['on_5fconstruct_340',['on_construct',['../classentt_1_1basic__registry.html#adc3cd847e65843f936824cd7d45984a5',1,'entt::basic_registry::on_construct()'],['../classentt_1_1sigh__storage__mixin.html#a307e783d42de1994678bb9aaeb86305d',1,'entt::sigh_storage_mixin::on_construct()']]], + ['on_5fdestroy_341',['on_destroy',['../classentt_1_1basic__registry.html#ad87a72c6d1e49a2fd992ddb7fd9d5a93',1,'entt::basic_registry::on_destroy()'],['../classentt_1_1sigh__storage__mixin.html#a04cc3ac5e26e6a0070fc87a8e5e5fb3e',1,'entt::sigh_storage_mixin::on_destroy()']]], + ['on_5fupdate_342',['on_update',['../classentt_1_1basic__registry.html#aaaf474d42df7b8852c4656152cc4a295',1,'entt::basic_registry::on_update()'],['../classentt_1_1sigh__storage__mixin.html#aad9a29530cf1408803a45573ffbee711',1,'entt::sigh_storage_mixin::on_update()']]], + ['once_343',['once',['../classentt_1_1emitter.html#a79834d452b0600ebe0e70c54f4a21fd6',1,'entt::emitter']]], + ['operator_20basic_5fgroup_3c_20entity_5ftype_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_2c_20exclude_20_3e_344',['operator basic_group< entity_type, owned_t< Owned... >, Get, Exclude >',['../structentt_1_1as__group.html#a35cbba4f387f92c80935183da08798ca',1,'entt::as_group']]], + ['operator_20basic_5fhandle_3c_20other_2c_20args_2e_2e_2e_20_3e_345',['operator basic_handle< Other, Args... >',['../structentt_1_1basic__handle.html#a3e3190a9991d334cdd20b4d8841d7545',1,'entt::basic_handle']]], + ['operator_20basic_5fview_3c_20entity_5ftype_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_20_3e_346',['operator basic_view< entity_type, get_t< Component... >, Exclude >',['../structentt_1_1as__view.html#a33df5ef10293a3153cd467edd72be425',1,'entt::as_view']]], + ['operator_20bool_347',['operator bool',['../structentt_1_1scoped__connection.html#a0b4e9958e0dbc1b1ba14a878531a475d',1,'entt::scoped_connection::operator bool()'],['../classentt_1_1meta__associative__container.html#a202720cb81c234e0e8e16db48b4adf2e',1,'entt::meta_associative_container::operator bool()'],['../classentt_1_1basic__any.html#a071b4fda8629b1767b384d01a0113496',1,'entt::basic_any::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a71396a63f68d8375329a1253b9634c7b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a177bb26a1d23da0502aeca143a3ae2a9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../structentt_1_1basic__handle.html#a80b439c1dd5924807bc26585c3c1ef4d',1,'entt::basic_handle::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aed52b322f7405bb527769aa051d6186e',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aa1e551e84f124033b5cfb5bfd09b630f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator bool()'],['../classentt_1_1meta__sequence__container.html#a004cb45ad3f51dbde8346fa1b202a13f',1,'entt::meta_sequence_container::operator bool()'],['../classentt_1_1meta__any.html#a307d84b99d93841efc574e7807ac7786',1,'entt::meta_any::operator bool()'],['../structentt_1_1meta__handle.html#a6936d403200fd97fd34d366d9c980c6c',1,'entt::meta_handle::operator bool()'],['../structentt_1_1meta__prop.html#a95a94a16e568cbf443056406155e122e',1,'entt::meta_prop::operator bool()'],['../structentt_1_1meta__data.html#a597429fb3dfbc05a48d2f8dd31133d97',1,'entt::meta_data::operator bool()'],['../structentt_1_1meta__func.html#a84da8b799b2feab77060a686da004b45',1,'entt::meta_func::operator bool()'],['../classentt_1_1meta__type.html#aaf7716aacffeaf51c8dcb283a6cc4630',1,'entt::meta_type::operator bool()'],['../classentt_1_1basic__poly.html#a311984ecc234832af9603c6ba1e3cd02',1,'entt::basic_poly::operator bool()'],['../classentt_1_1resource.html#a4724946781a3d5e062d5c6c5a210ee28',1,'entt::resource::operator bool()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af9dcbcb5c62a4cbfeb41cae502e5236e',1,'entt::delegate< Ret(Args...)>::operator bool()'],['../classentt_1_1connection.html#ad912298fe40bd1b6aa5b8b950850bb70',1,'entt::connection::operator bool()']]], + ['operator_20const_20value_5ftype_20_2a_348',['operator const value_type *',['../classentt_1_1basic__hashed__string.html#aa9ade09d3f55abe5bbae3438331aa7a2',1,'entt::basic_hashed_string']]], + ['operator_20entity_349',['operator Entity',['../structentt_1_1null__t.html#a816903f5ef0036594891edcf253d2570',1,'entt::null_t::operator Entity()'],['../structentt_1_1tombstone__t.html#a486219c88fe6ca91248095914fca745e',1,'entt::tombstone_t::operator Entity()']]], + ['operator_20entity_5ftype_350',['operator entity_type',['../structentt_1_1basic__handle.html#ae094b8474a9e4363b5c4503753b9ec4c',1,'entt::basic_handle']]], + ['operator_20hash_5ftype_351',['operator hash_type',['../classentt_1_1basic__hashed__string.html#a342323328cacb574f886a5720dd71580',1,'entt::basic_hashed_string']]], + ['operator_20id_5ftype_352',['operator id_type',['../structentt_1_1type__index.html#a5909d64d944e5957c22df8be65e17926',1,'entt::type_index::operator id_type()'],['../structentt_1_1type__hash.html#af86c7a01cb72943521b4dd6e7ac0bc8c',1,'entt::type_hash::operator id_type()']]], + ['operator_20type_353',['operator Type',['../structentt_1_1monostate.html#a1ec272e17db93124df74bd15d36b1e1d',1,'entt::monostate']]], + ['operator_20type_20_26_354',['operator Type &',['../classentt_1_1resource.html#a0cc7200575e1047b645932f51b79af32',1,'entt::resource']]], + ['operator_20type_20_26_26_355',['operator Type &&',['../structentt_1_1poly__inspector.html#a5b44cbea11e79b2ff918165b7bf100eb',1,'entt::poly_inspector']]], + ['operator_21_3d_356',['operator!=',['../namespaceentt.html#ae38ac5bc7b9097ec21eb1058db206cff',1,'entt::operator!=()'],['../structentt_1_1null__t.html#a1bd5e7e2a2fdc78944cf32ee03a6d0ab',1,'entt::null_t::operator!=([[maybe_unused]] const null_t other) const'],['../structentt_1_1null__t.html#a1e155d4d92605008969c3df64484ed44',1,'entt::null_t::operator!=(const Entity entity) const'],['../structentt_1_1tombstone__t.html#af2e901bd03a7676aa3596f8c55f91d1e',1,'entt::tombstone_t::operator!=([[maybe_unused]] const tombstone_t other) const'],['../structentt_1_1tombstone__t.html#ae75cbf2733dcde452dd782d3c7eda923',1,'entt::tombstone_t::operator!=(const Entity entity) const'],['../namespaceentt.html#a845d4ef2c448264153449c92157a0359',1,'entt::operator!=(const meta_any &lhs, const meta_any &rhs)'],['../namespaceentt.html#ac200eb460760246368bb737dc434c0eb',1,'entt::operator!=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a5b6b2e64d7d0ca7bd46c4fc9009cb552',1,'entt::operator!=(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a6185f9faa3f9fa26ecb1b9a837016147',1,'entt::operator!=(const Entity entity, const null_t other)'],['../namespaceentt.html#a39702a79d9ba6f5d7cb8668b0a7a1524',1,'entt::operator!=(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#a7ef0d5ec3214e57aa4b8406fbe9ee3a5',1,'entt::operator!=(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)'],['../namespaceentt.html#a04ebb219547c34209a94c9eb6d26eda1',1,'entt::operator!=(const meta_type &lhs, const meta_type &rhs)'],['../namespaceentt.html#ab45b13a74468617a1b7f497454b76b26',1,'entt::operator!=(const resource< ILhs > &lhs, const resource< IRhs > &rhs)'],['../namespaceentt.html#ac8711ef7a24e5329d7cbd0d05136874e',1,'entt::operator!=(const delegate< Ret(Args...)> &lhs, const delegate< Ret(Args...)> &rhs)']]], + ['operator_22_22_5fhs_357',['operator""_hs',['../namespaceentt.html#a05a416d8267b21fb9d85529efbee5f52',1,'entt::literals']]], + ['operator_22_22_5fhws_358',['operator""_hws',['../namespaceentt.html#a1b7823b3abb5f879174a26b2a051f65a',1,'entt::literals']]], + ['operator_28_29_359',['operator()',['../structentt_1_1insertion__sort.html#a73a5644fe5b683f9b9376c89ac47f2b8',1,'entt::insertion_sort::operator()()'],['../structentt_1_1radix__sort.html#a1989f6fbe18d3d82fdea9745d6b9ee96',1,'entt::radix_sort::operator()()'],['../structentt_1_1identity.html#a4bab5676dfa9eca188b2145708a086b8',1,'entt::identity::operator()()'],['../structentt_1_1y__combinator.html#a353f6f122334b26a90ce81cc32744ec3',1,'entt::y_combinator::operator()(Args &&...args) const'],['../structentt_1_1y__combinator.html#ade7f955583e7a887220e6ef391bfb7d2',1,'entt::y_combinator::operator()(Args &&...args)'],['../structentt_1_1resource__loader.html#a675f609c3081613b042167bd44050e70',1,'entt::resource_loader::operator()()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a0e53caedb53810bc96aa71bce199c990',1,'entt::delegate< Ret(Args...)>::operator()()'],['../structentt_1_1allocation__deleter.html#acf2b15c272b52afdcbe6897713b0a4a4',1,'entt::allocation_deleter::operator()()'],['../structentt_1_1std__sort.html#a8895e4acd1677a60e07d7e28748fe667',1,'entt::std_sort::operator()()']]], + ['operator_2a_360',['operator*',['../classentt_1_1meta__any.html#a15c62ff440280cb6e25e6a5b781a8aae',1,'entt::meta_any::operator*()'],['../classentt_1_1resource.html#a5da08fd8beef8e5af8a0aac7ebefc491',1,'entt::resource::operator*()']]], + ['operator_2b_361',['operator+',['../namespaceentt.html#a6c6e966c8af5b1452811aa55adbbdf47',1,'entt::operator+(type_list< Type... >, type_list< Other... >)'],['../namespaceentt.html#aabc6dd5fb4d2bc92d9e5101b7b0bce1d',1,'entt::operator+(value_list< Value... >, value_list< Other... >)']]], + ['operator_2d_3e_362',['operator->',['../structentt_1_1input__iterator__pointer.html#ab4a5b1478272e26c60f7123b0a2e155f',1,'entt::input_iterator_pointer::operator->()'],['../structentt_1_1meta__handle.html#aeaeac6808357732eeb2ce615c7ccb0eb',1,'entt::meta_handle::operator->() const'],['../structentt_1_1meta__handle.html#ad1309701800c7727eb519ee14b655e30',1,'entt::meta_handle::operator->()'],['../classentt_1_1basic__poly.html#a06f659d892ece6b3908644a5452ed550',1,'entt::basic_poly::operator->()'],['../classentt_1_1basic__poly.html#a0d3461b19558dceb0b60d7f7f2e23ef2',1,'entt::basic_poly::operator->() const'],['../classentt_1_1resource.html#a740a657eabb34596ee84e248025dc57c',1,'entt::resource::operator->()']]], + ['operator_3c_363',['operator<',['../namespaceentt.html#a95abccf779882bf65c4bb1cb99b8059c',1,'entt::operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ac2789bea84be3354b9ec3f48b0af539c',1,'entt::operator<(const type_info &lhs, const type_info &rhs)']]], + ['operator_3c_3d_364',['operator<=',['../namespaceentt.html#a400fd2e18a1fe98013bd4cdb281ad98f',1,'entt::operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ac99351681df5ffc84efcc14603ab6fc3',1,'entt::operator<=(const type_info &lhs, const type_info &rhs)']]], + ['operator_3d_365',['operator=',['../classentt_1_1basic__snapshot__loader.html#aa55eeaad2ab4dd117524afff9d6e184b',1,'entt::basic_snapshot_loader::operator=()'],['../classentt_1_1basic__continuous__loader.html#afd396d84cb27e070a6a812bd28140c75',1,'entt::basic_continuous_loader::operator=()'],['../classentt_1_1basic__sparse__set.html#afd87d086a1b895ac6253c311eb90affb',1,'entt::basic_sparse_set::operator=()'],['../classentt_1_1basic__storage.html#a7672e87c11c51f4edf70ae68def122c8',1,'entt::basic_storage::operator=()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aef13645252ab183b46fa966bfcdd4ded',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::operator=()'],['../classentt_1_1meta__any.html#a97360c78351767409f9db58c9f785ad5',1,'entt::meta_any::operator=(const meta_any &other)'],['../classentt_1_1meta__any.html#a867681175c0928270919df9476ba10c5',1,'entt::meta_any::operator=(meta_any &&other)'],['../classentt_1_1meta__any.html#ae9298a9b894c870392da35f696fbb044',1,'entt::meta_any::operator=(Type &&value)'],['../structentt_1_1meta__handle.html#a750eb55693845b28da117db4d342b8e6',1,'entt::meta_handle::operator=(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#aacfd03669af75ce2684917e8e9f90132',1,'entt::meta_handle::operator=(meta_handle &&)=default'],['../classentt_1_1scheduler.html#aea6ab78dbf00ba17c6e828ee0505afd9',1,'entt::scheduler::operator=()'],['../classentt_1_1resource__cache.html#ac62e77427a14f432ce48e73be6d0e99b',1,'entt::resource_cache::operator=(const resource_cache &)=default'],['../classentt_1_1resource__cache.html#aa45af1086197beca5820c03ecf2188f4',1,'entt::resource_cache::operator=(resource_cache &&)=default'],['../classentt_1_1resource.html#af2ffb65e0b5b160305c0ad7b73797c28',1,'entt::resource::operator=(const resource &)=default'],['../classentt_1_1resource.html#a85556f1c70980a5882dd3199438e0179',1,'entt::resource::operator=(resource &&)=default'],['../classentt_1_1resource.html#a6f48057e3737c8dd9b6baec5e58996ba',1,'entt::resource::operator=(const resource< Other > &other)'],['../classentt_1_1resource.html#a06d72fcef4d307cb9c601e56886fe4ff',1,'entt::resource::operator=(resource< Other > &&other)'],['../classentt_1_1basic__dispatcher.html#a6a8f6c84d439a372cf837509d540cc86',1,'entt::basic_dispatcher::operator=()'],['../classentt_1_1emitter.html#ab270d2c6d986621a781467e29e64629c',1,'entt::emitter::operator=()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a23c0e4cfafdc631539651db4af7f0ac2',1,'entt::sigh< Ret(Args...), Allocator >::operator=(const sigh &other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a515f527211650b9b3882deb4e4c5d650',1,'entt::sigh< Ret(Args...), Allocator >::operator=(sigh &&other)'],['../structentt_1_1scoped__connection.html#ae079c45e0eb97f31ec1d5a4be76163fc',1,'entt::scoped_connection::operator=(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#abe0ec74231b7bece430c6dd5ffdeddc2',1,'entt::scoped_connection::operator=(scoped_connection &&other)'],['../structentt_1_1scoped__connection.html#a900d499bf30a8f33beb19f41af9b93b3',1,'entt::scoped_connection::operator=(connection other)'],['../classentt_1_1dense__map.html#aa25873c134ef5594814afe17d76c283b',1,'entt::dense_map::operator=(const dense_map &)=default'],['../classentt_1_1dense__map.html#a0d12dd6f2862dc8f72d170f52e86fdcd',1,'entt::dense_map::operator=(dense_map &&)=default'],['../classentt_1_1dense__set.html#a4286ac0c51fefa80dff5feb425aed034',1,'entt::dense_set::operator=(const dense_set &)=default'],['../classentt_1_1dense__set.html#ac3fd2bba7dc5b180d0b10ef4b2422406',1,'entt::dense_set::operator=(dense_set &&)=default'],['../classentt_1_1basic__any.html#a2918b13d6957ccaae7796ea76be6807f',1,'entt::basic_any::operator=(const basic_any &other)'],['../classentt_1_1basic__any.html#ab8d80c9b2be44588959c2a3cb451c162',1,'entt::basic_any::operator=(basic_any &&other)'],['../classentt_1_1basic__any.html#a58bb0a9c97a6a75e5b7984acf6fd268b',1,'entt::basic_any::operator=(Type &&value)'],['../classentt_1_1compressed__pair.html#a73b4a959b934357bc41b8e9c53b47496',1,'entt::compressed_pair::operator=(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#ad61f40edf314083598c0b0d76aa90fa1',1,'entt::compressed_pair::operator=(compressed_pair &&other)=default'],['../structentt_1_1input__iterator__pointer.html#acdd70bff5e5dc7dedd5851432bbed9d9',1,'entt::input_iterator_pointer::operator=(const input_iterator_pointer &)=delete'],['../structentt_1_1input__iterator__pointer.html#a24452709a3e3c45713c033073f02c485',1,'entt::input_iterator_pointer::operator=(input_iterator_pointer &&)=default'],['../structentt_1_1monostate.html#aaffae05e053ccedffd625e8c1f0664c5',1,'entt::monostate::operator=()'],['../classentt_1_1basic__observer.html#a03dcb6b0999d29bc39410d7ae6d9ac53',1,'entt::basic_observer::operator=(const basic_observer &)=delete'],['../classentt_1_1basic__observer.html#a8b7cd199f236a4dee02f202ec0fd6281',1,'entt::basic_observer::operator=(basic_observer &&)=delete'],['../classentt_1_1basic__registry.html#a23d233b9e2c4a92395a60087891c52fe',1,'entt::basic_registry::operator=()'],['../classentt_1_1basic__snapshot.html#a1484b609195cfd057bbdd8808d4392bc',1,'entt::basic_snapshot::operator=()']]], + ['operator_3d_3d_366',['operator==',['../structentt_1_1tombstone__t.html#aa55c02c8ea69dc462ea78e4ad20c385f',1,'entt::tombstone_t::operator==()'],['../classentt_1_1meta__any.html#a1bd17bffb75be10543e85c78185d765a',1,'entt::meta_any::operator==()'],['../classentt_1_1meta__type.html#a39159083cd8ac72bb27859ccd4f0f732',1,'entt::meta_type::operator==()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ab1cf637f608b81e72070b7d6cc385e9d',1,'entt::delegate< Ret(Args...)>::operator==()'],['../namespaceentt.html#a8ba0fe41e17e0c506e6fe7d58f499d1c',1,'entt::operator==(const resource< Res > &lhs, const resource< Other > &rhs)'],['../namespaceentt.html#aee5fe16dfbb40ab097d339b0c008fae7',1,'entt::operator==(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)'],['../namespaceentt.html#a0f371da1ef604fa726a88e9733e5ee54',1,'entt::operator==(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#af6de691c4ec15d4a63ea8960563bbea0',1,'entt::operator==(const Entity entity, const null_t other)'],['../namespaceentt.html#a13f95d943a5794e7f7b481d3e02a2d96',1,'entt::operator==(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a07b2e32d6df969a3d20a8f263265fe96',1,'entt::operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../classentt_1_1basic__any.html#adc66c85290945fc808d1979db9040454',1,'entt::basic_any::operator==()'],['../structentt_1_1null__t.html#aa9a56492571f7949c26fc7ce4c9aa441',1,'entt::null_t::operator==([[maybe_unused]] const null_t other) const'],['../structentt_1_1null__t.html#a510e2259bb0ed264ecdf64f7e8b51665',1,'entt::null_t::operator==(const Entity entity) const'],['../structentt_1_1tombstone__t.html#aa54c795fa1a8e817e56f14e29fc8beee',1,'entt::tombstone_t::operator==()']]], + ['operator_3e_367',['operator>',['../namespaceentt.html#a28f32860fd6de66a832389b365045047',1,'entt::operator>(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#affca347714c6771f1f5928f1c18a070f',1,'entt::operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)']]], + ['operator_3e_3d_368',['operator>=',['../namespaceentt.html#a5d583f542e17fa8eb56d8d01c34b8920',1,'entt::operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a2e6acc16fe38d13c69b5d1fb237e4ac5',1,'entt::operator>=(const type_info &lhs, const type_info &rhs)']]], + ['operator_5b_5d_369',['operator[]',['../classentt_1_1meta__sequence__container.html#a69ecff5787961fb20256491e56df04ee',1,'entt::meta_sequence_container::operator[]()'],['../classentt_1_1resource__cache.html#ac5d5a3100bb36367700d12a808286fbb',1,'entt::resource_cache::operator[](const id_type id) const'],['../classentt_1_1resource__cache.html#af571e731540287786242dbb28ef0fe1f',1,'entt::resource_cache::operator[](const id_type id)'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aab90453fa7feb640ec46e2b50b4caace',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[]()'],['../classentt_1_1dense__map.html#a1a6524541824c6a5a544ea026629488c',1,'entt::dense_map::operator[](const key_type &key)'],['../classentt_1_1dense__map.html#adbc0bc46615a25a4079651b75eebbe4c',1,'entt::dense_map::operator[](key_type &&key)'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aaaf16dde27d8d4aed568a519a87b5b1b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aeed935700bcf21af637b96e144178a56',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__sparse__set.html#a3f88e4df5066e55ebfba192a85050553',1,'entt::basic_sparse_set::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a29cfb727d48591b93b58a5acb1d85fae',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab5aed61f5c7416b66f6e93c61b9e787b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[]()']]], + ['operator_7c_370',['operator|',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a71bf0b47a5091541cb870f669aca6a1d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator|()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a1267ff896c8bd61b41b3e9d069f9ecc4',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator|()']]], + ['organizer_371',['organizer',['../namespaceentt.html#a5870a148e25a503557bdd47327c7a05a',1,'entt']]], + ['orphan_372',['orphan',['../structentt_1_1basic__handle.html#a04557a12530c2c86cd90694d2f4c7bc7',1,'entt::basic_handle::orphan()'],['../classentt_1_1basic__registry.html#a10f5e61d4cabab9e9c1e87edc30de551',1,'entt::basic_registry::orphan()']]], + ['orphans_373',['orphans',['../classentt_1_1basic__continuous__loader.html#ac8b328bb8c6c4acde51ab5b943f0ea86',1,'entt::basic_continuous_loader::orphans()'],['../classentt_1_1basic__snapshot__loader.html#acd881016761f5eb598763fbf3595a625',1,'entt::basic_snapshot_loader::orphans()']]], + ['overload_374',['overload',['../namespaceentt.html#a386a739051d9d37a5578785b77fc426b',1,'entt::overload(Type Class::*member)'],['../namespaceentt.html#ad4ea6822ef21f52c732ba3baea450159',1,'entt::overload(Func *func)']]], + ['overloaded_375',['overloaded',['../structentt_1_1overloaded.html',1,'entt::overloaded< Func >'],['../namespaceentt.html#a26eb67ac302229374c5fb623d529f5eb',1,'entt::overloaded(Func...) -> overloaded< Func... >']]], + ['owned_376',['owned',['../classentt_1_1basic__registry.html#a9b93ba6498a1513daff8548c242dc80a',1,'entt::basic_registry::owned()'],['../namespaceentt.html#ac91ddbe2446a912714a5fe7251e25768',1,'entt::owned()']]], + ['owned_5ft_377',['owned_t',['../structentt_1_1owned__t.html',1,'entt']]], + ['owner_378',['owner',['../classentt_1_1meta__any.html#abc6c66b9bf085ec3c67c10540d1f48a7',1,'entt::meta_any::owner()'],['../classentt_1_1basic__any.html#ae20c3f5eecdcdaf715b332bbc363ee4d',1,'entt::basic_any::owner()']]], + ['string_5fview_379',['string_view',['../structentt_1_1type__name.html#a5c425f6e665e43b4cf0a2249b8c127e2',1,'entt::type_name']]] ]; diff --git a/search/all_e.js b/search/all_e.js index c5f74fd74..a31c9554b 100644 --- a/search/all_e.js +++ b/search/all_e.js @@ -1,26 +1,26 @@ var searchData= [ - ['page_5fsize_379',['page_size',['../structentt_1_1basic__component__traits.html#a4b00cb76e92fe28071c08f0b07d37539',1,'entt::basic_component_traits::page_size()'],['../classentt_1_1entt__traits.html#a16382ceec002b305cf6c48a2a913836a',1,'entt::entt_traits::page_size()']]], - ['patch_380',['patch',['../structentt_1_1basic__handle.html#a78728a75868fc9a74fc033f3249ba642',1,'entt::basic_handle::patch()'],['../classentt_1_1basic__registry.html#a22454253689ff77e41326f849bfea976',1,'entt::basic_registry::patch()'],['../classentt_1_1basic__storage.html#a93762825431af9dc007dd5db8c5bc21c',1,'entt::basic_storage::patch()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a9840b8e1334f079dec3a37d46fb9a1fe',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::patch()'],['../classentt_1_1sigh__storage__mixin.html#adb5cd6a62df2a85126b3d77b31eb1b83',1,'entt::sigh_storage_mixin::patch()']]], - ['pause_381',['pause',['../classentt_1_1process.html#a46b356ef2c1f09818b4dc546721f49fa',1,'entt::process']]], - ['paused_382',['paused',['../classentt_1_1process.html#a80e3a0f9dd6724683946f88fb519ec75',1,'entt::process']]], - ['pointer_383',['pointer',['../classentt_1_1basic__sparse__set.html#a8b18963e68d4f003e19389fd342f90cc',1,'entt::basic_sparse_set::pointer()'],['../classentt_1_1basic__storage.html#a8bca364f11af0d3d2d44105b2391fe7a',1,'entt::basic_storage::pointer()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ab36fb6642c45d6d7a2112e486fc6bc88',1,'entt::meta_sequence_container::meta_iterator::pointer()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a7c58c38ae75a68a1665aac08efdbe071',1,'entt::meta_associative_container::meta_iterator::pointer()'],['../structentt_1_1input__iterator__pointer.html#ad1529bc3215ecfc42d7bd908306527fb',1,'entt::input_iterator_pointer::pointer()']]], - ['policy_384',['policy',['../classentt_1_1basic__sparse__set.html#a02c273b23bb87b33e04dc598409eeede',1,'entt::basic_sparse_set']]], - ['poly_385',['poly',['../namespaceentt.html#aad3d1f1d0e83ad8f124155c9e511c2cd',1,'entt']]], - ['poly_5fbase_386',['poly_base',['../structentt_1_1poly__base.html',1,'entt']]], - ['poly_5fbase_3c_20basic_5fpoly_20_3e_387',['poly_base< basic_poly >',['../classentt_1_1basic__poly.html#a4f532417307014ab3c9eb0070beaf7fc',1,'entt::basic_poly']]], - ['poly_5fcall_388',['poly_call',['../namespaceentt.html#a8b4f2adf317a555138ef5c1cf45b034a',1,'entt']]], - ['poly_5finspector_389',['poly_inspector',['../structentt_1_1poly__inspector.html',1,'entt']]], - ['poly_5fvtable_390',['poly_vtable',['../classentt_1_1poly__vtable.html',1,'entt']]], - ['prepare_391',['prepare',['../structentt_1_1basic__organizer_1_1vertex.html#a9208ce46f18ba46229bacbc070fd8eec',1,'entt::basic_organizer::vertex']]], - ['process_392',['process',['../classentt_1_1process.html',1,'entt']]], - ['process_3c_20process_5fadaptor_3c_20func_2c_20delta_20_3e_2c_20delta_20_3e_393',['process< process_adaptor< Func, Delta >, Delta >',['../classentt_1_1process.html',1,'entt']]], - ['process_5fadaptor_394',['process_adaptor',['../structentt_1_1process__adaptor.html',1,'entt::process_adaptor< Func, Delta >'],['../structentt_1_1process__adaptor.html#af065d57ac7c645279e4a5033f326abd8',1,'entt::process_adaptor::process_adaptor()']]], - ['prop_395',['prop',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a000d32f9fe649aa4526a174c3a0e25e9',1,'entt::meta_factory< Type, Spec... >::prop()'],['../structentt_1_1meta__data.html#abe3ebb33e7c66a067c5162715c66c880',1,'entt::meta_data::prop() const'],['../structentt_1_1meta__data.html#a2258b0808fc9c35a27846804b1388fd9',1,'entt::meta_data::prop(meta_any key) const'],['../structentt_1_1meta__func.html#a5094550dfc4082e825fb1408160a234e',1,'entt::meta_func::prop() const'],['../structentt_1_1meta__func.html#a78c007b0f307c817ae519004b14d3ea0',1,'entt::meta_func::prop(meta_any key) const'],['../classentt_1_1meta__type.html#afee5a926f135e9f2f75d8b5522866ab8',1,'entt::meta_type::prop() const'],['../classentt_1_1meta__type.html#a4931fc02b58faf3b4c6c99e57d264691',1,'entt::meta_type::prop(meta_any key) const']]], - ['propagate_5fon_5fcontainer_5fcopy_5fassignment_396',['propagate_on_container_copy_assignment',['../namespaceentt.html#a9eb49df8bf1b69e836039b76e5b9938e',1,'entt']]], - ['propagate_5fon_5fcontainer_5fmove_5fassignment_397',['propagate_on_container_move_assignment',['../namespaceentt.html#a122ae54373a080574c45c77319cec7f7',1,'entt']]], - ['propagate_5fon_5fcontainer_5fswap_398',['propagate_on_container_swap',['../namespaceentt.html#a1359cd624e6726f884df34df66656855',1,'entt']]], - ['props_399',['props',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a5f469f90597875f661bade58bdb28a93',1,'entt::meta_factory< Type, Spec... >']]], - ['publish_400',['publish',['../classentt_1_1emitter.html#ad2877515662e6fce3558688b4fd598aa',1,'entt::emitter::publish()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0893ef46dac20781070826fb93c50fb4',1,'entt::sigh< Ret(Args...), Allocator >::publish()']]], - ['push_20entt_20across_20boundaries_401',['Push EnTT across boundaries',['../md_docs_md_lib.html',1,'']]] + ['page_5fsize_380',['page_size',['../structentt_1_1component__traits.html#a8fa4acd0fc9b0c554ea805961a5b6f8b',1,'entt::component_traits::page_size()'],['../classentt_1_1entt__traits.html#a16382ceec002b305cf6c48a2a913836a',1,'entt::entt_traits::page_size()']]], + ['patch_381',['patch',['../structentt_1_1basic__handle.html#a78728a75868fc9a74fc033f3249ba642',1,'entt::basic_handle::patch()'],['../classentt_1_1basic__registry.html#a22454253689ff77e41326f849bfea976',1,'entt::basic_registry::patch()'],['../classentt_1_1sigh__storage__mixin.html#adb5cd6a62df2a85126b3d77b31eb1b83',1,'entt::sigh_storage_mixin::patch()'],['../classentt_1_1basic__storage.html#a93762825431af9dc007dd5db8c5bc21c',1,'entt::basic_storage::patch()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a9840b8e1334f079dec3a37d46fb9a1fe',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::patch()']]], + ['pause_382',['pause',['../classentt_1_1process.html#a46b356ef2c1f09818b4dc546721f49fa',1,'entt::process']]], + ['paused_383',['paused',['../classentt_1_1process.html#a80e3a0f9dd6724683946f88fb519ec75',1,'entt::process']]], + ['pointer_384',['pointer',['../structentt_1_1input__iterator__pointer.html#ad1541f6a78eb2f792fc03d9a6bfefbab',1,'entt::input_iterator_pointer::pointer()'],['../structentt_1_1allocation__deleter.html#a37186f63eb16409b00b0261041b68c5c',1,'entt::allocation_deleter::pointer()'],['../classentt_1_1basic__sparse__set.html#a8b18963e68d4f003e19389fd342f90cc',1,'entt::basic_sparse_set::pointer()'],['../classentt_1_1basic__storage.html#a8bca364f11af0d3d2d44105b2391fe7a',1,'entt::basic_storage::pointer()']]], + ['policy_385',['policy',['../classentt_1_1basic__sparse__set.html#a02c273b23bb87b33e04dc598409eeede',1,'entt::basic_sparse_set']]], + ['poly_386',['poly',['../namespaceentt.html#a53c6f86f6643c525f654540c3d4c6819',1,'entt']]], + ['poly_5fbase_387',['poly_base',['../structentt_1_1poly__base.html',1,'entt']]], + ['poly_5fbase_3c_20basic_5fpoly_20_3e_388',['poly_base< basic_poly >',['../classentt_1_1basic__poly.html#a4f532417307014ab3c9eb0070beaf7fc',1,'entt::basic_poly']]], + ['poly_5fcall_389',['poly_call',['../namespaceentt.html#a8b4f2adf317a555138ef5c1cf45b034a',1,'entt']]], + ['poly_5finspector_390',['poly_inspector',['../structentt_1_1poly__inspector.html',1,'entt']]], + ['poly_5fvtable_391',['poly_vtable',['../classentt_1_1poly__vtable.html',1,'entt']]], + ['prepare_392',['prepare',['../structentt_1_1basic__organizer_1_1vertex.html#a9208ce46f18ba46229bacbc070fd8eec',1,'entt::basic_organizer::vertex']]], + ['process_393',['process',['../classentt_1_1process.html',1,'entt']]], + ['process_3c_20process_5fadaptor_3c_20func_2c_20delta_20_3e_2c_20delta_20_3e_394',['process< process_adaptor< Func, Delta >, Delta >',['../classentt_1_1process.html',1,'entt']]], + ['process_5fadaptor_395',['process_adaptor',['../structentt_1_1process__adaptor.html',1,'entt::process_adaptor< Func, Delta >'],['../structentt_1_1process__adaptor.html#af065d57ac7c645279e4a5033f326abd8',1,'entt::process_adaptor::process_adaptor()']]], + ['prop_396',['prop',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a000d32f9fe649aa4526a174c3a0e25e9',1,'entt::meta_factory< Type, Spec... >::prop()'],['../structentt_1_1meta__data.html#abe3ebb33e7c66a067c5162715c66c880',1,'entt::meta_data::prop() const'],['../structentt_1_1meta__data.html#a2258b0808fc9c35a27846804b1388fd9',1,'entt::meta_data::prop(meta_any key) const'],['../structentt_1_1meta__func.html#a5094550dfc4082e825fb1408160a234e',1,'entt::meta_func::prop() const'],['../structentt_1_1meta__func.html#a78c007b0f307c817ae519004b14d3ea0',1,'entt::meta_func::prop(meta_any key) const'],['../classentt_1_1meta__type.html#afee5a926f135e9f2f75d8b5522866ab8',1,'entt::meta_type::prop() const'],['../classentt_1_1meta__type.html#a4931fc02b58faf3b4c6c99e57d264691',1,'entt::meta_type::prop(meta_any key) const']]], + ['propagate_5fon_5fcontainer_5fcopy_5fassignment_397',['propagate_on_container_copy_assignment',['../namespaceentt.html#a9eb49df8bf1b69e836039b76e5b9938e',1,'entt']]], + ['propagate_5fon_5fcontainer_5fmove_5fassignment_398',['propagate_on_container_move_assignment',['../namespaceentt.html#a122ae54373a080574c45c77319cec7f7',1,'entt']]], + ['propagate_5fon_5fcontainer_5fswap_399',['propagate_on_container_swap',['../namespaceentt.html#a1359cd624e6726f884df34df66656855',1,'entt']]], + ['props_400',['props',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a5f469f90597875f661bade58bdb28a93',1,'entt::meta_factory< Type, Spec... >']]], + ['publish_401',['publish',['../classentt_1_1emitter.html#ad2877515662e6fce3558688b4fd598aa',1,'entt::emitter::publish()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0893ef46dac20781070826fb93c50fb4',1,'entt::sigh< Ret(Args...), Allocator >::publish()']]], + ['push_20entt_20across_20boundaries_402',['Push EnTT across boundaries',['../md_docs_md_lib.html',1,'']]] ]; diff --git a/search/all_f.js b/search/all_f.js index 2f7381a8b..09efa5408 100644 --- a/search/all_f.js +++ b/search/all_f.js @@ -1,37 +1,33 @@ var searchData= [ - ['radix_5fsort_402',['radix_sort',['../structentt_1_1radix__sort.html',1,'entt']]], - ['raw_403',['raw',['../classentt_1_1basic__storage.html#a842d101561221a5b6823ecb68297d0c7',1,'entt::basic_storage::raw() const'],['../classentt_1_1basic__storage.html#ab8dc30f83d69d4fcaae062dc2a6334c4',1,'entt::basic_storage::raw()']]], - ['rbegin_404',['rbegin',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ad7540139e3e2097c301b25de94867576',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8d0936203f3174c74cb26f79d9125afe',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__sparse__set.html#aeb97353b34992345fde1fe763885ef41',1,'entt::basic_sparse_set::rbegin()'],['../classentt_1_1basic__storage.html#a294e9330b74e232a905b9f78a6524917',1,'entt::basic_storage::rbegin() const'],['../classentt_1_1basic__storage.html#a7f86841bc48d579993a8f3c0f8e080c3',1,'entt::basic_storage::rbegin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a3469e9faa0e1c34beead1a483f1b0504',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rbegin()']]], - ['ref_405',['ref',['../structentt_1_1service__locator.html#a5379f8d798c2de5b1c41756ba3959e06',1,'entt::service_locator']]], - ['reference_406',['reference',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a57962b1345c3905a11a88cf259aaa288',1,'entt::meta_sequence_container::meta_iterator::reference()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a48908a48014b9b889a0f610b469d03ef',1,'entt::meta_associative_container::meta_iterator::reference()']]], - ['registry_407',['registry',['../namespaceentt.html#a292643317d1dbb13e45824f757bd1086',1,'entt::registry()'],['../structentt_1_1basic__handle.html#a32db2781fd85be391ba5cb39a8fd3b57',1,'entt::basic_handle::registry()']]], - ['registry_5ftype_408',['registry_type',['../structentt_1_1as__view.html#acf6e812f1ff9a8a0a0af828b6597dace',1,'entt::as_view::registry_type()'],['../structentt_1_1as__group.html#a6aa30140ac29c50156197aad66b54ccb',1,'entt::as_group::registry_type()'],['../structentt_1_1basic__handle.html#ae5df0bde40739b99085169d1955dc1fb',1,'entt::basic_handle::registry_type()']]], - ['rehash_409',['rehash',['../classentt_1_1dense__hash__map.html#ab75c7e8afb0a3564f49844829a74a7bf',1,'entt::dense_hash_map::rehash()'],['../classentt_1_1dense__hash__set.html#aaec6797bcad6e06dc6f4c1b7f88088a8',1,'entt::dense_hash_set::rehash()']]], - ['rejected_410',['rejected',['../classentt_1_1process.html#a871cc9aa013c2aba9f7c0712a5fe3b98',1,'entt::process']]], - ['release_411',['release',['../classentt_1_1basic__registry.html#a3d9cb2368384b0952cb54848e777359e',1,'entt::basic_registry::release(const entity_type entity)'],['../classentt_1_1basic__registry.html#af9c919867fc93a7e1a2d0762ac3a9877',1,'entt::basic_registry::release(const entity_type entity, const version_type version)'],['../classentt_1_1basic__registry.html#a69fa71876716487256ac47e19f27c553',1,'entt::basic_registry::release(It first, It last)'],['../classentt_1_1connection.html#ae564477ab623301169916c1992c970a8',1,'entt::connection::release()'],['../structentt_1_1scoped__connection.html#a7bd2be785ba586664d8e8d039dc73ead',1,'entt::scoped_connection::release()']]], - ['released_412',['released',['../classentt_1_1basic__registry.html#a48630f103bc6448af1f2b2928df4f488',1,'entt::basic_registry']]], - ['reload_413',['reload',['../classentt_1_1resource__cache.html#a99bb176aa037d33218b4ea625a82300c',1,'entt::resource_cache']]], - ['remove_414',['remove',['../structentt_1_1basic__handle.html#ac47661c3d8845005ac3826c6c124a2d5',1,'entt::basic_handle::remove()'],['../classentt_1_1basic__registry.html#aa66ca71c5eb6c2e1b3bde6ff86a268c7',1,'entt::basic_registry::remove(const entity_type entity)'],['../classentt_1_1basic__registry.html#a597e4d37d39c02801f7b244148d5e4af',1,'entt::basic_registry::remove(It first, It last)'],['../classentt_1_1basic__sparse__set.html#af02e5833d5edb2450303bd1c029213b8',1,'entt::basic_sparse_set::remove(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#ab2b4ee6c81e845f332c35c89acb8f436',1,'entt::basic_sparse_set::remove(It first, It last)']]], - ['rend_415',['rend',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4a01916334cf8dfcf87818c9d60a7d29',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ab4b09ef323459fb46b2a2bdea31759fa',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__sparse__set.html#a1bc1fee7c920941ac936ed7df9207343',1,'entt::basic_sparse_set::rend()'],['../classentt_1_1basic__storage.html#a9f85346282d5ea0f578607e02b37f1dd',1,'entt::basic_storage::rend() const'],['../classentt_1_1basic__storage.html#a72789cfb1fec3eae4fb1197965eadae2',1,'entt::basic_storage::rend()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a4bc3a043ad6ff8f74082764f5cd3a22c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rend()']]], - ['replace_416',['replace',['../structentt_1_1basic__handle.html#a4cf1511f05374af28498b513c32c4a45',1,'entt::basic_handle::replace()'],['../classentt_1_1basic__registry.html#a0501ff5a96a3421f3eec427bf5d62380',1,'entt::basic_registry::replace()']]], - ['reserve_417',['reserve',['../classentt_1_1basic__sparse__set.html#a58d49df52ee3133a1347dc01131a4f1a',1,'entt::basic_sparse_set::reserve()'],['../classentt_1_1basic__storage.html#a9006cd644effed8a5290283d05352ce7',1,'entt::basic_storage::reserve()'],['../classentt_1_1dense__hash__map.html#ac97a269ac4883ed9b269ca33a2728724',1,'entt::dense_hash_map::reserve()'],['../classentt_1_1dense__hash__set.html#a031f5e348d126c0c68c08dc49024a17c',1,'entt::dense_hash_set::reserve()'],['../classentt_1_1basic__registry.html#a97677776c466a310547be1fdfdf84ff9',1,'entt::basic_registry::reserve()']]], - ['reserved_418',['reserved',['../classentt_1_1entt__traits.html#a376f015afde8d69c3e6f52a5da9429d1',1,'entt::entt_traits']]], - ['reset_419',['reset',['../classentt_1_1meta__any.html#a92cb99988bdeb9453f2470b02c5249fb',1,'entt::meta_any::reset()'],['../classentt_1_1basic__any.html#a0f267d3bbc148e7e240b902b1819c9a6',1,'entt::basic_any::reset()'],['../structentt_1_1service__locator.html#a4d655acab54d87058ad41a266830d0e8',1,'entt::service_locator::reset()'],['../classentt_1_1basic__poly.html#a43ab35169a0fdb31f7f5db5e5ad0e17d',1,'entt::basic_poly::reset()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a20cfbc558d087ab1022a41f9453d2f3f',1,'entt::delegate< Ret(Args...)>::reset()']]], - ['resize_420',['resize',['../classentt_1_1meta__sequence__container.html#a7ef2656ac8dcdfb0b78313dab532f531',1,'entt::meta_sequence_container']]], - ['resolve_421',['resolve',['../namespaceentt.html#a0b62be0d39676cb86f2aefefa890b198',1,'entt::resolve()'],['../namespaceentt.html#a1915a651e7ce55938a09269c3d9c98e4',1,'entt::resolve(const id_type id)'],['../namespaceentt.html#a834693b80a8d9af8b6d6edb81cb54b39',1,'entt::resolve(const type_info &info)']]], - ['resource_5fcache_422',['resource_cache',['../classentt_1_1resource__cache.html',1,'entt::resource_cache< Resource >'],['../classentt_1_1resource__loader.html#a4112be35c9b6819c3b0d429a94f77728',1,'entt::resource_loader::resource_cache()'],['../classentt_1_1resource__cache.html#a919d10578aeda6ad9dd04e1b969b8a9c',1,'entt::resource_cache::resource_cache()=default'],['../classentt_1_1resource__cache.html#ac785934919090b5755a87ab34804b163',1,'entt::resource_cache::resource_cache(resource_cache &&)=default']]], - ['resource_5fhandle_423',['resource_handle',['../classentt_1_1resource__handle.html',1,'entt::resource_handle< Resource >'],['../classentt_1_1resource__handle.html#a8b6a99848ceb85976f502438792c4b2a',1,'entt::resource_handle::resource_handle()'],['../classentt_1_1resource__handle.html#afb9bff321847029a473ffe4e7c486b42',1,'entt::resource_handle::resource_handle()=default'],['../classentt_1_1resource__handle.html#a956f8cad244f0239984326e6e341ff0e',1,'entt::resource_handle::resource_handle(std::shared_ptr< resource_type > res)'],['../classentt_1_1resource__handle.html#ab41848b032f6f27bc52c7cfa1f19cb36',1,'entt::resource_handle::resource_handle(const resource_handle &other)=default'],['../classentt_1_1resource__handle.html#a15d311a1fdcde8ee910df415b21e9f07',1,'entt::resource_handle::resource_handle(resource_handle &&other)=default'],['../classentt_1_1resource__handle.html#a7e10e22e344bc029eb6b1f90293276a0',1,'entt::resource_handle::resource_handle(const resource_handle< Other > &other, resource_type &res) noexcept'],['../classentt_1_1resource__handle.html#aa6462af299f1cd36898e916bbce96f55',1,'entt::resource_handle::resource_handle(const resource_handle< Other > &other)'],['../classentt_1_1resource__handle.html#a5a8f44ef759531027a6d8a7e7556b5de',1,'entt::resource_handle::resource_handle(resource_handle< Other > &&other)']]], - ['resource_5floader_424',['resource_loader',['../classentt_1_1resource__loader.html',1,'entt']]], - ['resource_5ftype_425',['resource_type',['../classentt_1_1resource__cache.html#a3c660fb622942292cf7242e5361f80b7',1,'entt::resource_cache::resource_type()'],['../classentt_1_1resource__handle.html#a8fed7493bab627b5378f1e027e7c845b',1,'entt::resource_handle::resource_type()']]], - ['respect_426',['respect',['../classentt_1_1basic__sparse__set.html#ad6b9f10f5212846bfea6e4fd0ba7a1e4',1,'entt::basic_sparse_set']]], - ['result_5ftype_427',['result_type',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a9bca9876e6671a34c6503b7de65402b6',1,'entt::delegate< Ret(Args...)>']]], - ['ret_428',['ret',['../structentt_1_1meta__func.html#a67437385a837f1f4020258a315a2ee67',1,'entt::meta_func']]], - ['return_5ftype_429',['return_type',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#aa4fd5493c0249390c63edba5fd70f189',1,'entt::meta_function_descriptor< Type, Ret Class::* >::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a1b3e630352b1d4518f9c9686d722a9ce',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a10117f6bac8c1b6f3ba673a03ff476ff',1,'entt::meta_function_descriptor< Type, Ret(*)()>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#aae0a4b941e6c2a4ee5239d5110c88e39',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a63465b01fc295a119b70095722c0e677',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::return_type()']]], - ['reverse_5fiterator_430',['reverse_iterator',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aec8cef39d3a53563f3d21af3ce360c59',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8abbb4c03d956b89c2c73ded7f07f206',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__sparse__set.html#afe62c143e816cf5e12078a607966c003',1,'entt::basic_sparse_set::reverse_iterator()'],['../classentt_1_1basic__storage.html#a2947b5cf419bfd039cf5fca0c56cbb74',1,'entt::basic_storage::reverse_iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ada7749a76ed2d4a96bd03ddf3c7b6d7e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::reverse_iterator()']]], - ['ro_5fcount_431',['ro_count',['../structentt_1_1basic__organizer_1_1vertex.html#a7ac52b2bcd9d4a5fa78b92822fc88418',1,'entt::basic_organizer::vertex']]], - ['ro_5fdependency_432',['ro_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a8b5be2b47c8609fcf3cb9df26c2b3c86',1,'entt::basic_organizer::vertex']]], - ['runtime_5fview_433',['runtime_view',['../classentt_1_1basic__registry.html#af1d54beb5ae95d5f867c60c05319d1eb',1,'entt::basic_registry::runtime_view()'],['../namespaceentt.html#a85d470a55d982d87388e899c322e9ddc',1,'entt::runtime_view()']]], - ['rw_5fcount_434',['rw_count',['../structentt_1_1basic__organizer_1_1vertex.html#a0d1f98d28191735e9d22cce081f98b02',1,'entt::basic_organizer::vertex']]], - ['rw_5fdependency_435',['rw_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a6307d593373be2e865e4ca8d463a76e5',1,'entt::basic_organizer::vertex']]] + ['radix_5fsort_403',['radix_sort',['../structentt_1_1radix__sort.html',1,'entt']]], + ['raw_404',['raw',['../classentt_1_1basic__storage.html#a842d101561221a5b6823ecb68297d0c7',1,'entt::basic_storage::raw() const'],['../classentt_1_1basic__storage.html#ab8dc30f83d69d4fcaae062dc2a6334c4',1,'entt::basic_storage::raw()']]], + ['rbegin_405',['rbegin',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ad7540139e3e2097c301b25de94867576',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8d0936203f3174c74cb26f79d9125afe',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__sparse__set.html#aeb97353b34992345fde1fe763885ef41',1,'entt::basic_sparse_set::rbegin()'],['../classentt_1_1basic__storage.html#a294e9330b74e232a905b9f78a6524917',1,'entt::basic_storage::rbegin() const'],['../classentt_1_1basic__storage.html#a7f86841bc48d579993a8f3c0f8e080c3',1,'entt::basic_storage::rbegin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a3469e9faa0e1c34beead1a483f1b0504',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rbegin()']]], + ['registry_406',['registry',['../namespaceentt.html#a292643317d1dbb13e45824f757bd1086',1,'entt::registry()'],['../structentt_1_1basic__handle.html#a32db2781fd85be391ba5cb39a8fd3b57',1,'entt::basic_handle::registry() const']]], + ['registry_5ftype_407',['registry_type',['../structentt_1_1basic__handle.html#ae5df0bde40739b99085169d1955dc1fb',1,'entt::basic_handle::registry_type()'],['../structentt_1_1as__view.html#acf6e812f1ff9a8a0a0af828b6597dace',1,'entt::as_view::registry_type()'],['../structentt_1_1as__group.html#a6aa30140ac29c50156197aad66b54ccb',1,'entt::as_group::registry_type()']]], + ['rehash_408',['rehash',['../classentt_1_1dense__set.html#a41d37c3108301ef8021e00f33daeeada',1,'entt::dense_set::rehash()'],['../classentt_1_1dense__map.html#acfb4e8961af9f2be78836aa8ecba464d',1,'entt::dense_map::rehash()']]], + ['rejected_409',['rejected',['../classentt_1_1process.html#a871cc9aa013c2aba9f7c0712a5fe3b98',1,'entt::process']]], + ['release_410',['release',['../classentt_1_1connection.html#ae564477ab623301169916c1992c970a8',1,'entt::connection::release()'],['../structentt_1_1scoped__connection.html#a7bd2be785ba586664d8e8d039dc73ead',1,'entt::scoped_connection::release()'],['../classentt_1_1basic__registry.html#a3d9cb2368384b0952cb54848e777359e',1,'entt::basic_registry::release(const entity_type entity)'],['../classentt_1_1basic__registry.html#af9c919867fc93a7e1a2d0762ac3a9877',1,'entt::basic_registry::release(const entity_type entity, const version_type version)'],['../classentt_1_1basic__registry.html#a69fa71876716487256ac47e19f27c553',1,'entt::basic_registry::release(It first, It last)']]], + ['released_411',['released',['../classentt_1_1basic__registry.html#a48630f103bc6448af1f2b2928df4f488',1,'entt::basic_registry']]], + ['remove_412',['remove',['../structentt_1_1basic__handle.html#ac47661c3d8845005ac3826c6c124a2d5',1,'entt::basic_handle::remove()'],['../classentt_1_1basic__registry.html#aa66ca71c5eb6c2e1b3bde6ff86a268c7',1,'entt::basic_registry::remove(const entity_type entity)'],['../classentt_1_1basic__registry.html#a597e4d37d39c02801f7b244148d5e4af',1,'entt::basic_registry::remove(It first, It last)'],['../classentt_1_1basic__sparse__set.html#af02e5833d5edb2450303bd1c029213b8',1,'entt::basic_sparse_set::remove(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#ab2b4ee6c81e845f332c35c89acb8f436',1,'entt::basic_sparse_set::remove(It first, It last)']]], + ['rend_413',['rend',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4a01916334cf8dfcf87818c9d60a7d29',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ab4b09ef323459fb46b2a2bdea31759fa',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__sparse__set.html#a1bc1fee7c920941ac936ed7df9207343',1,'entt::basic_sparse_set::rend()'],['../classentt_1_1basic__storage.html#a9f85346282d5ea0f578607e02b37f1dd',1,'entt::basic_storage::rend() const'],['../classentt_1_1basic__storage.html#a72789cfb1fec3eae4fb1197965eadae2',1,'entt::basic_storage::rend()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a4bc3a043ad6ff8f74082764f5cd3a22c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rend()']]], + ['replace_414',['replace',['../structentt_1_1basic__handle.html#a4cf1511f05374af28498b513c32c4a45',1,'entt::basic_handle::replace()'],['../classentt_1_1basic__registry.html#a0501ff5a96a3421f3eec427bf5d62380',1,'entt::basic_registry::replace()']]], + ['reserve_415',['reserve',['../classentt_1_1basic__storage.html#a9006cd644effed8a5290283d05352ce7',1,'entt::basic_storage::reserve()'],['../classentt_1_1dense__map.html#aefd32a0147886f0470267db5cabbb06d',1,'entt::dense_map::reserve()'],['../classentt_1_1dense__set.html#ad2d49660bbbfe781919f2ea9bf0ff167',1,'entt::dense_set::reserve()'],['../classentt_1_1basic__registry.html#a97677776c466a310547be1fdfdf84ff9',1,'entt::basic_registry::reserve()'],['../classentt_1_1basic__sparse__set.html#a58d49df52ee3133a1347dc01131a4f1a',1,'entt::basic_sparse_set::reserve()']]], + ['reserved_416',['reserved',['../classentt_1_1entt__traits.html#a376f015afde8d69c3e6f52a5da9429d1',1,'entt::entt_traits']]], + ['reset_417',['reset',['../classentt_1_1basic__poly.html#a43ab35169a0fdb31f7f5db5e5ad0e17d',1,'entt::basic_poly::reset()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a20cfbc558d087ab1022a41f9453d2f3f',1,'entt::delegate< Ret(Args...)>::reset()'],['../classentt_1_1basic__any.html#a0f267d3bbc148e7e240b902b1819c9a6',1,'entt::basic_any::reset()'],['../structentt_1_1locator.html#acf587655946b69f0c483c204a76ca84b',1,'entt::locator::reset()'],['../classentt_1_1meta__any.html#a92cb99988bdeb9453f2470b02c5249fb',1,'entt::meta_any::reset()']]], + ['resize_418',['resize',['../classentt_1_1meta__sequence__container.html#a7ef2656ac8dcdfb0b78313dab532f531',1,'entt::meta_sequence_container']]], + ['resolve_419',['resolve',['../namespaceentt.html#a0b62be0d39676cb86f2aefefa890b198',1,'entt::resolve()'],['../namespaceentt.html#a1915a651e7ce55938a09269c3d9c98e4',1,'entt::resolve(const id_type id)'],['../namespaceentt.html#a834693b80a8d9af8b6d6edb81cb54b39',1,'entt::resolve(const type_info &info)']]], + ['resource_420',['resource',['../classentt_1_1resource.html',1,'entt::resource< Type >'],['../classentt_1_1resource.html#a10dac526a08b422e1767d8fa1cfd8dd3',1,'entt::resource::resource()'],['../classentt_1_1resource.html#a5d2a41b70dfa8111f9c6dbab77f736ad',1,'entt::resource::resource()'],['../classentt_1_1resource.html#a6f76bc2b33dc5808f851085b3bf22901',1,'entt::resource::resource(std::shared_ptr< Type > res)'],['../classentt_1_1resource.html#a86aaf1b31fc18461c3f47a5424eb3fbf',1,'entt::resource::resource(const resource &)=default'],['../classentt_1_1resource.html#aa6c2c9559587898d2d46bff7614032b2',1,'entt::resource::resource(resource &&)=default'],['../classentt_1_1resource.html#a74651bbd6ec5b5bbd94efde2d5aa4764',1,'entt::resource::resource(const resource< Other > &other, Type &res)'],['../classentt_1_1resource.html#a9507660bf6e8547f8c0e1be0ca05684f',1,'entt::resource::resource(const resource< Other > &other)'],['../classentt_1_1resource.html#a75c84414a2241405fe138b706820b171',1,'entt::resource::resource(resource< Other > &&other)']]], + ['resource_5fcache_421',['resource_cache',['../classentt_1_1resource__cache.html',1,'entt::resource_cache< Type, Loader, Allocator >'],['../classentt_1_1resource__cache.html#a06ba856c4484f52a91a8ee140a223bd5',1,'entt::resource_cache::resource_cache()'],['../classentt_1_1resource__cache.html#a85024663deca781eb063b03254a3f825',1,'entt::resource_cache::resource_cache(const allocator_type &allocator)'],['../classentt_1_1resource__cache.html#a87b5fdd8fd001e8444d1b51de6fd9189',1,'entt::resource_cache::resource_cache(const loader_type &callable, const allocator_type &allocator=allocator_type{})'],['../classentt_1_1resource__cache.html#ab35522f4f96e42e7ac246ce69abd2ee1',1,'entt::resource_cache::resource_cache(const resource_cache &)=default'],['../classentt_1_1resource__cache.html#a1a91e3e3d19167b6c65e826e5419e273',1,'entt::resource_cache::resource_cache(const resource_cache &other, const allocator_type &allocator)'],['../classentt_1_1resource__cache.html#aa54d9a10a10019476cbb863ffb27c3f0',1,'entt::resource_cache::resource_cache(resource_cache &&)=default'],['../classentt_1_1resource__cache.html#a8419d3c2c6e142ca851e2a31d6813c63',1,'entt::resource_cache::resource_cache(resource_cache &&other, const allocator_type &allocator)']]], + ['resource_5floader_422',['resource_loader',['../structentt_1_1resource__loader.html',1,'entt']]], + ['respect_423',['respect',['../classentt_1_1basic__sparse__set.html#ad6b9f10f5212846bfea6e4fd0ba7a1e4',1,'entt::basic_sparse_set']]], + ['result_5ftype_424',['result_type',['../structentt_1_1resource__loader.html#add7a5c71b563bbc139c0983837764dc1',1,'entt::resource_loader::result_type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a9bca9876e6671a34c6503b7de65402b6',1,'entt::delegate< Ret(Args...)>::result_type()']]], + ['ret_425',['ret',['../structentt_1_1meta__func.html#a67437385a837f1f4020258a315a2ee67',1,'entt::meta_func']]], + ['return_5ftype_426',['return_type',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a1b3e630352b1d4518f9c9686d722a9ce',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a10117f6bac8c1b6f3ba673a03ff476ff',1,'entt::meta_function_descriptor< Type, Ret(*)()>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#aae0a4b941e6c2a4ee5239d5110c88e39',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a63465b01fc295a119b70095722c0e677',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#aa4fd5493c0249390c63edba5fd70f189',1,'entt::meta_function_descriptor< Type, Ret Class::* >::return_type()']]], + ['reverse_5fiterator_427',['reverse_iterator',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aec8cef39d3a53563f3d21af3ce360c59',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8abbb4c03d956b89c2c73ded7f07f206',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__sparse__set.html#afe62c143e816cf5e12078a607966c003',1,'entt::basic_sparse_set::reverse_iterator()'],['../classentt_1_1basic__storage.html#a2947b5cf419bfd039cf5fca0c56cbb74',1,'entt::basic_storage::reverse_iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ada7749a76ed2d4a96bd03ddf3c7b6d7e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::reverse_iterator()']]], + ['ro_5fcount_428',['ro_count',['../structentt_1_1basic__organizer_1_1vertex.html#a7ac52b2bcd9d4a5fa78b92822fc88418',1,'entt::basic_organizer::vertex']]], + ['ro_5fdependency_429',['ro_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a8b5be2b47c8609fcf3cb9df26c2b3c86',1,'entt::basic_organizer::vertex']]], + ['runtime_5fview_430',['runtime_view',['../namespaceentt.html#a4d1433f3effac40f4a6d1b92b89f68e9',1,'entt']]], + ['rw_5fcount_431',['rw_count',['../structentt_1_1basic__organizer_1_1vertex.html#a0d1f98d28191735e9d22cce081f98b02',1,'entt::basic_organizer::vertex']]], + ['rw_5fdependency_432',['rw_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a6307d593373be2e865e4ca8d463a76e5',1,'entt::basic_organizer::vertex']]] ]; diff --git a/search/classes_0.js b/search/classes_0.js index 1e0dcdcaa..f007e5745 100644 --- a/search/classes_0.js +++ b/search/classes_0.js @@ -1,10 +1,11 @@ var searchData= [ - ['adl_5fmeta_5fpointer_5flike_566',['adl_meta_pointer_like',['../structentt_1_1adl__meta__pointer__like.html',1,'entt']]], - ['as_5fcref_5ft_567',['as_cref_t',['../structentt_1_1as__cref__t.html',1,'entt']]], - ['as_5fgroup_568',['as_group',['../structentt_1_1as__group.html',1,'entt']]], - ['as_5fis_5ft_569',['as_is_t',['../structentt_1_1as__is__t.html',1,'entt']]], - ['as_5fref_5ft_570',['as_ref_t',['../structentt_1_1as__ref__t.html',1,'entt']]], - ['as_5fview_571',['as_view',['../structentt_1_1as__view.html',1,'entt']]], - ['as_5fvoid_5ft_572',['as_void_t',['../structentt_1_1as__void__t.html',1,'entt']]] + ['adl_5fmeta_5fpointer_5flike_557',['adl_meta_pointer_like',['../structentt_1_1adl__meta__pointer__like.html',1,'entt']]], + ['allocation_5fdeleter_558',['allocation_deleter',['../structentt_1_1allocation__deleter.html',1,'entt']]], + ['as_5fcref_5ft_559',['as_cref_t',['../structentt_1_1as__cref__t.html',1,'entt']]], + ['as_5fgroup_560',['as_group',['../structentt_1_1as__group.html',1,'entt']]], + ['as_5fis_5ft_561',['as_is_t',['../structentt_1_1as__is__t.html',1,'entt']]], + ['as_5fref_5ft_562',['as_ref_t',['../structentt_1_1as__ref__t.html',1,'entt']]], + ['as_5fview_563',['as_view',['../structentt_1_1as__view.html',1,'entt']]], + ['as_5fvoid_5ft_564',['as_void_t',['../structentt_1_1as__void__t.html',1,'entt']]] ]; diff --git a/search/classes_1.js b/search/classes_1.js index e3748f34a..9b957f3ff 100644 --- a/search/classes_1.js +++ b/search/classes_1.js @@ -1,31 +1,32 @@ var searchData= [ - ['basic_5fany_573',['basic_any',['../classentt_1_1basic__any.html',1,'entt']]], - ['basic_5fany_3c_3e_574',['basic_any<>',['../classentt_1_1basic__any.html',1,'entt']]], - ['basic_5fcollector_575',['basic_collector',['../structentt_1_1basic__collector.html',1,'entt']]], - ['basic_5fcollector_3c_20matcher_3c_20type_5flist_3c_20reject_2e_2e_2e_20_3e_2c_20type_5flist_3c_20require_2e_2e_2e_20_3e_2c_20rule_2e_2e_2e_20_3e_2c_20other_2e_2e_2e_20_3e_576',['basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html',1,'entt']]], - ['basic_5fcollector_3c_3e_577',['basic_collector<>',['../structentt_1_1basic__collector_3_4.html',1,'entt']]], - ['basic_5fcomponent_5ftraits_578',['basic_component_traits',['../structentt_1_1basic__component__traits.html',1,'entt']]], - ['basic_5fcontinuous_5floader_579',['basic_continuous_loader',['../classentt_1_1basic__continuous__loader.html',1,'entt']]], - ['basic_5fgroup_580',['basic_group',['../classentt_1_1basic__group.html',1,'entt']]], - ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_581',['basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html',1,'entt']]], - ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_582',['basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html',1,'entt']]], - ['basic_5fhandle_583',['basic_handle',['../structentt_1_1basic__handle.html',1,'entt']]], - ['basic_5fhashed_5fstring_584',['basic_hashed_string',['../classentt_1_1basic__hashed__string.html',1,'entt']]], - ['basic_5fobserver_585',['basic_observer',['../classentt_1_1basic__observer.html',1,'entt']]], - ['basic_5forganizer_586',['basic_organizer',['../classentt_1_1basic__organizer.html',1,'entt']]], - ['basic_5fpoly_587',['basic_poly',['../classentt_1_1basic__poly.html',1,'entt']]], - ['basic_5fregistry_588',['basic_registry',['../classentt_1_1basic__registry.html',1,'entt']]], - ['basic_5fregistry_3c_20entity_5ftype_20_3e_589',['basic_registry< entity_type >',['../classentt_1_1basic__registry.html',1,'entt']]], - ['basic_5fruntime_5fview_590',['basic_runtime_view',['../classentt_1_1basic__runtime__view.html',1,'entt']]], - ['basic_5fsnapshot_591',['basic_snapshot',['../classentt_1_1basic__snapshot.html',1,'entt']]], - ['basic_5fsnapshot_5floader_592',['basic_snapshot_loader',['../classentt_1_1basic__snapshot__loader.html',1,'entt']]], - ['basic_5fsparse_5fset_593',['basic_sparse_set',['../classentt_1_1basic__sparse__set.html',1,'entt']]], - ['basic_5fsparse_5fset_3c_20entity_2c_20std_3a_3aallocator_5ftraits_3c_20allocator_20_3e_3a_3atemplate_20rebind_5falloc_3c_20entity_20_3e_20_3e_594',['basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >',['../classentt_1_1basic__sparse__set.html',1,'entt']]], - ['basic_5fstorage_595',['basic_storage',['../classentt_1_1basic__storage.html',1,'entt']]], - ['basic_5fstorage_3c_20entity_2c_20type_2c_20allocator_2c_20std_3a_3aenable_5fif_5ft_3c_20ignore_5fas_5fempty_5fv_3c_20type_20_3e_20_3e_20_3e_596',['basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >',['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html',1,'entt']]], - ['basic_5fstorage_3c_20entity_5ftype_2c_20payload_5ftype_20_3e_597',['basic_storage< entity_type, payload_type >',['../classentt_1_1basic__storage.html',1,'entt']]], - ['basic_5fview_598',['basic_view',['../classentt_1_1basic__view.html',1,'entt']]], - ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_20_3e_2c_20exclude_5ft_3c_3e_2c_20std_3a_3avoid_5ft_3c_20std_3a_3aenable_5fif_5ft_3c_21component_5ftraits_3c_20std_3a_3aremove_5fconst_5ft_3c_20component_20_3e_20_3e_3a_3ain_5fplace_5fdelete_20_3e_20_3e_20_3e_599',['basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html',1,'entt']]], - ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_600',['basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html',1,'entt']]] + ['basic_5fany_565',['basic_any',['../classentt_1_1basic__any.html',1,'entt']]], + ['basic_5fany_3c_3e_566',['basic_any<>',['../classentt_1_1basic__any.html',1,'entt']]], + ['basic_5fcollector_567',['basic_collector',['../structentt_1_1basic__collector.html',1,'entt']]], + ['basic_5fcollector_3c_20matcher_3c_20type_5flist_3c_20reject_2e_2e_2e_20_3e_2c_20type_5flist_3c_20require_2e_2e_2e_20_3e_2c_20rule_2e_2e_2e_20_3e_2c_20other_2e_2e_2e_20_3e_568',['basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html',1,'entt']]], + ['basic_5fcollector_3c_3e_569',['basic_collector<>',['../structentt_1_1basic__collector_3_4.html',1,'entt']]], + ['basic_5fcontinuous_5floader_570',['basic_continuous_loader',['../classentt_1_1basic__continuous__loader.html',1,'entt']]], + ['basic_5fdispatcher_571',['basic_dispatcher',['../classentt_1_1basic__dispatcher.html',1,'entt']]], + ['basic_5fgroup_572',['basic_group',['../classentt_1_1basic__group.html',1,'entt']]], + ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_573',['basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html',1,'entt']]], + ['basic_5fgroup_3c_20entity_2c_20owned_5ft_3c_3e_2c_20get_5ft_3c_20get_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_574',['basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html',1,'entt']]], + ['basic_5fhandle_575',['basic_handle',['../structentt_1_1basic__handle.html',1,'entt']]], + ['basic_5fhashed_5fstring_576',['basic_hashed_string',['../classentt_1_1basic__hashed__string.html',1,'entt']]], + ['basic_5fobserver_577',['basic_observer',['../classentt_1_1basic__observer.html',1,'entt']]], + ['basic_5forganizer_578',['basic_organizer',['../classentt_1_1basic__organizer.html',1,'entt']]], + ['basic_5fpoly_579',['basic_poly',['../classentt_1_1basic__poly.html',1,'entt']]], + ['basic_5fregistry_580',['basic_registry',['../classentt_1_1basic__registry.html',1,'entt']]], + ['basic_5fregistry_3c_20entity_5ftype_20_3e_581',['basic_registry< entity_type >',['../classentt_1_1basic__registry.html',1,'entt']]], + ['basic_5fruntime_5fview_582',['basic_runtime_view',['../structentt_1_1basic__runtime__view.html',1,'entt']]], + ['basic_5fruntime_5fview_3c_20basic_5fsparse_5fset_3c_20entity_2c_20allocator_20_3e_20_3e_583',['basic_runtime_view< basic_sparse_set< Entity, Allocator > >',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html',1,'entt']]], + ['basic_5fsnapshot_584',['basic_snapshot',['../classentt_1_1basic__snapshot.html',1,'entt']]], + ['basic_5fsnapshot_5floader_585',['basic_snapshot_loader',['../classentt_1_1basic__snapshot__loader.html',1,'entt']]], + ['basic_5fsparse_5fset_586',['basic_sparse_set',['../classentt_1_1basic__sparse__set.html',1,'entt']]], + ['basic_5fsparse_5fset_3c_20entity_2c_20std_3a_3aallocator_5ftraits_3c_20allocator_20_3e_3a_3atemplate_20rebind_5falloc_3c_20entity_20_3e_20_3e_587',['basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >',['../classentt_1_1basic__sparse__set.html',1,'entt']]], + ['basic_5fstorage_588',['basic_storage',['../classentt_1_1basic__storage.html',1,'entt']]], + ['basic_5fstorage_3c_20entity_2c_20type_2c_20allocator_2c_20std_3a_3aenable_5fif_5ft_3c_20ignore_5fas_5fempty_5fv_3c_20type_20_3e_20_3e_20_3e_589',['basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >',['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html',1,'entt']]], + ['basic_5fstorage_3c_20entity_5ftype_2c_20payload_5ftype_20_3e_590',['basic_storage< entity_type, payload_type >',['../classentt_1_1basic__storage.html',1,'entt']]], + ['basic_5fview_591',['basic_view',['../classentt_1_1basic__view.html',1,'entt']]], + ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_20_3e_2c_20exclude_5ft_3c_3e_2c_20std_3a_3avoid_5ft_3c_20std_3a_3aenable_5fif_5ft_3c_21component_5ftraits_3c_20std_3a_3aremove_5fconst_5ft_3c_20component_20_3e_20_3e_3a_3ain_5fplace_5fdelete_20_3e_20_3e_20_3e_592',['basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html',1,'entt']]], + ['basic_5fview_3c_20entity_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_5ft_3c_20exclude_2e_2e_2e_20_3e_20_3e_593',['basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html',1,'entt']]] ]; diff --git a/search/classes_10.js b/search/classes_10.js index 55ef4f859..970ff6ee8 100644 --- a/search/classes_10.js +++ b/search/classes_10.js @@ -1,4 +1,13 @@ var searchData= [ - ['y_5fcombinator_761',['y_combinator',['../structentt_1_1y__combinator.html',1,'entt']]] + ['value_5flist_737',['value_list',['../structentt_1_1value__list.html',1,'entt']]], + ['value_5flist_5fcat_738',['value_list_cat',['../structentt_1_1value__list__cat.html',1,'entt']]], + ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_20_3e_739',['value_list_cat< value_list< Value... > >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html',1,'entt']]], + ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_740',['value_list_cat< value_list< Value... >, value_list< Other... >, List... >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], + ['value_5flist_5fcat_3c_3e_741',['value_list_cat<>',['../structentt_1_1value__list__cat_3_4.html',1,'entt']]], + ['value_5flist_5felement_742',['value_list_element',['../structentt_1_1value__list__element.html',1,'entt']]], + ['value_5flist_5felement_3c_200u_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_743',['value_list_element< 0u, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['value_5flist_5felement_3c_20index_20_2d_201u_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_744',['value_list_element< Index - 1u, value_list< Other... > >',['../structentt_1_1value__list__element.html',1,'entt']]], + ['value_5flist_5felement_3c_20index_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_745',['value_list_element< Index, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['vertex_746',['vertex',['../structentt_1_1basic__organizer_1_1vertex.html',1,'entt::basic_organizer']]] ]; diff --git a/search/related_5.html b/search/classes_11.html similarity index 95% rename from search/related_5.html rename to search/classes_11.html index c48055800..ed167c849 100644 --- a/search/related_5.html +++ b/search/classes_11.html @@ -4,7 +4,7 @@ - + diff --git a/search/classes_11.js b/search/classes_11.js new file mode 100644 index 000000000..ab19b7558 --- /dev/null +++ b/search/classes_11.js @@ -0,0 +1,4 @@ +var searchData= +[ + ['y_5fcombinator_747',['y_combinator',['../structentt_1_1y__combinator.html',1,'entt']]] +]; diff --git a/search/classes_2.js b/search/classes_2.js index cdaf28e9d..8ca856603 100644 --- a/search/classes_2.js +++ b/search/classes_2.js @@ -1,14 +1,16 @@ var searchData= [ - ['choice_5ft_601',['choice_t',['../structentt_1_1choice__t.html',1,'entt']]], - ['choice_5ft_3c_200_20_3e_602',['choice_t< 0 >',['../structentt_1_1choice__t_3_010_01_4.html',1,'entt']]], - ['component_5ftraits_603',['component_traits',['../structentt_1_1component__traits.html',1,'entt']]], - ['compressed_5fpair_604',['compressed_pair',['../classentt_1_1compressed__pair.html',1,'entt']]], - ['compressed_5fpair_3c_20container_5ftype_2c_20alloc_20_3e_605',['compressed_pair< container_type, alloc >',['../classentt_1_1compressed__pair.html',1,'entt']]], - ['compressed_5fpair_3c_20packed_5fcontainer_5ftype_2c_20key_5fequal_20_3e_606',['compressed_pair< packed_container_type, key_equal >',['../classentt_1_1compressed__pair.html',1,'entt']]], - ['compressed_5fpair_3c_20sparse_5fcontainer_5ftype_2c_20hasher_20_3e_607',['compressed_pair< sparse_container_type, hasher >',['../classentt_1_1compressed__pair.html',1,'entt']]], - ['connect_5farg_5ft_608',['connect_arg_t',['../structentt_1_1connect__arg__t.html',1,'entt']]], - ['connection_609',['connection',['../classentt_1_1connection.html',1,'entt::connection'],['../structentt_1_1emitter_1_1connection.html',1,'entt::emitter< Derived >::connection< Event >']]], - ['constness_5fas_610',['constness_as',['../structentt_1_1constness__as.html',1,'entt']]], - ['constness_5fas_3c_20to_2c_20const_20from_20_3e_611',['constness_as< To, const From >',['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html',1,'entt']]] + ['choice_5ft_594',['choice_t',['../structentt_1_1choice__t.html',1,'entt']]], + ['choice_5ft_3c_200_20_3e_595',['choice_t< 0 >',['../structentt_1_1choice__t_3_010_01_4.html',1,'entt']]], + ['component_5ftraits_596',['component_traits',['../structentt_1_1component__traits.html',1,'entt']]], + ['compressed_5fpair_597',['compressed_pair',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20container_5ftype_2c_20allocator_5ftype_20_3e_598',['compressed_pair< container_type, allocator_type >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20entt_3a_3adense_5fmap_2c_20allocator_5ftype_20_3e_599',['compressed_pair< entt::dense_map, allocator_type >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20entt_3a_3adense_5fmap_2c_20loader_5ftype_20_3e_600',['compressed_pair< entt::dense_map, loader_type >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20packed_5fcontainer_5ftype_2c_20key_5fequal_20_3e_601',['compressed_pair< packed_container_type, key_equal >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['compressed_5fpair_3c_20sparse_5fcontainer_5ftype_2c_20hasher_20_3e_602',['compressed_pair< sparse_container_type, hasher >',['../classentt_1_1compressed__pair.html',1,'entt']]], + ['connect_5farg_5ft_603',['connect_arg_t',['../structentt_1_1connect__arg__t.html',1,'entt']]], + ['connection_604',['connection',['../classentt_1_1connection.html',1,'entt::connection'],['../structentt_1_1emitter_1_1connection.html',1,'entt::emitter< Derived >::connection< Event >']]], + ['constness_5fas_605',['constness_as',['../structentt_1_1constness__as.html',1,'entt']]], + ['constness_5fas_3c_20to_2c_20const_20from_20_3e_606',['constness_as< To, const From >',['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html',1,'entt']]] ]; diff --git a/search/classes_3.js b/search/classes_3.js index c25dc0f9f..89ba25185 100644 --- a/search/classes_3.js +++ b/search/classes_3.js @@ -1,16 +1,13 @@ var searchData= [ - ['delegate_612',['delegate',['../classentt_1_1delegate.html',1,'entt']]], - ['delegate_3c_20ret_28args_2e_2e_2e_29_3e_613',['delegate< Ret(Args...)>',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html',1,'entt']]], - ['delegate_3c_20void_28entt_3a_3abasic_5fobserver_20_26_29_3e_614',['delegate< void(entt::basic_observer &)>',['../classentt_1_1delegate.html',1,'entt']]], - ['delegate_3c_20void_28void_20_2a_29_3e_615',['delegate< void(void *)>',['../classentt_1_1delegate.html',1,'entt']]], - ['dense_5fhash_5fmap_616',['dense_hash_map',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20entity_5ftype_2c_20std_3a_3apair_3c_20entity_5ftype_2c_20bool_20_3e_20_3e_617',['dense_hash_map< entity_type, std::pair< entity_type, bool > >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20entt_3a_3abasic_5fany_3c_200u_20_3e_2c_20entt_3a_3aidentity_20_3e_618',['dense_hash_map< id_type, entt::basic_any< 0u >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20entt_3a_3aresource_5fhandle_3c_20resource_5ftype_20_3e_2c_20entt_3a_3aidentity_20_3e_619',['dense_hash_map< id_type, entt::resource_handle< resource_type >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20basic_5fpool_20_3e_2c_20entt_3a_3aidentity_20_3e_620',['dense_hash_map< id_type, std::unique_ptr< basic_pool >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20entt_3a_3abasic_5fsparse_5fset_20_3e_2c_20entt_3a_3aidentity_20_3e_621',['dense_hash_map< id_type, std::unique_ptr< entt::basic_sparse_set >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fmap_3c_20id_5ftype_2c_20std_3a_3avector_3c_20std_3a_3apair_3c_20std_3a_3asize_5ft_2c_20bool_20_3e_20_3e_2c_20entt_3a_3aidentity_20_3e_622',['dense_hash_map< id_type, std::vector< std::pair< std::size_t, bool > >, entt::identity >',['../classentt_1_1dense__hash__map.html',1,'entt']]], - ['dense_5fhash_5fset_623',['dense_hash_set',['../classentt_1_1dense__hash__set.html',1,'entt']]], - ['dispatcher_624',['dispatcher',['../classentt_1_1dispatcher.html',1,'entt']]] + ['delegate_607',['delegate',['../classentt_1_1delegate.html',1,'entt']]], + ['delegate_3c_20ret_28args_2e_2e_2e_29_3e_608',['delegate< Ret(Args...)>',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html',1,'entt']]], + ['delegate_3c_20void_28entt_3a_3abasic_5fobserver_20_26_29_3e_609',['delegate< void(entt::basic_observer &)>',['../classentt_1_1delegate.html',1,'entt']]], + ['delegate_3c_20void_28void_20_2a_29_3e_610',['delegate< void(void *)>',['../classentt_1_1delegate.html',1,'entt']]], + ['dense_5fmap_611',['dense_map',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fmap_3c_20entity_5ftype_2c_20std_3a_3apair_3c_20entity_5ftype_2c_20bool_20_3e_20_3e_612',['dense_map< entity_type, std::pair< entity_type, bool > >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20basic_5fpool_20_3e_2c_20entt_3a_3aidentity_20_3e_613',['dense_map< id_type, std::unique_ptr< basic_pool >, entt::identity >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fmap_3c_20id_5ftype_2c_20std_3a_3aunique_5fptr_3c_20entt_3a_3abasic_5fsparse_5fset_20_3e_2c_20entt_3a_3aidentity_20_3e_614',['dense_map< id_type, std::unique_ptr< entt::basic_sparse_set >, entt::identity >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fmap_3c_20id_5ftype_2c_20std_3a_3avector_3c_20std_3a_3apair_3c_20std_3a_3asize_5ft_2c_20bool_20_3e_20_3e_2c_20entt_3a_3aidentity_20_3e_615',['dense_map< id_type, std::vector< std::pair< std::size_t, bool > >, entt::identity >',['../classentt_1_1dense__map.html',1,'entt']]], + ['dense_5fset_616',['dense_set',['../classentt_1_1dense__set.html',1,'entt']]] ]; diff --git a/search/classes_4.js b/search/classes_4.js index 31fbf59a6..fe4136bd7 100644 --- a/search/classes_4.js +++ b/search/classes_4.js @@ -1,8 +1,8 @@ var searchData= [ - ['emitter_625',['emitter',['../classentt_1_1emitter.html',1,'entt']]], - ['entt_5ftraits_626',['entt_traits',['../classentt_1_1entt__traits.html',1,'entt']]], - ['enum_5fas_5fbitmask_627',['enum_as_bitmask',['../structentt_1_1enum__as__bitmask.html',1,'entt']]], - ['enum_5fas_5fbitmask_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28type_3a_3a_5fentt_5fenum_5fas_5fbitmask_29_3e_20_3e_628',['enum_as_bitmask< Type, std::void_t< decltype(Type::_entt_enum_as_bitmask)> >',['../structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html',1,'entt']]], - ['exclude_5ft_629',['exclude_t',['../structentt_1_1exclude__t.html',1,'entt']]] + ['emitter_617',['emitter',['../classentt_1_1emitter.html',1,'entt']]], + ['entt_5ftraits_618',['entt_traits',['../classentt_1_1entt__traits.html',1,'entt']]], + ['enum_5fas_5fbitmask_619',['enum_as_bitmask',['../structentt_1_1enum__as__bitmask.html',1,'entt']]], + ['enum_5fas_5fbitmask_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28type_3a_3a_5fentt_5fenum_5fas_5fbitmask_29_3e_20_3e_620',['enum_as_bitmask< Type, std::void_t< decltype(Type::_entt_enum_as_bitmask)> >',['../structentt_1_1enum__as__bitmask_3_01Type_00_01std_1_1void__t_3_01decltype_07Type_1_1__entt__enum__as__bitmask_08_4_01_4.html',1,'entt']]], + ['exclude_5ft_621',['exclude_t',['../structentt_1_1exclude__t.html',1,'entt']]] ]; diff --git a/search/classes_5.js b/search/classes_5.js index 8827f866d..bd04da18c 100644 --- a/search/classes_5.js +++ b/search/classes_5.js @@ -1,4 +1,4 @@ var searchData= [ - ['family_630',['family',['../classentt_1_1family.html',1,'entt']]] + ['family_622',['family',['../classentt_1_1family.html',1,'entt']]] ]; diff --git a/search/classes_6.js b/search/classes_6.js index c12e3ae5d..4551b983f 100644 --- a/search/classes_6.js +++ b/search/classes_6.js @@ -1,4 +1,4 @@ var searchData= [ - ['get_5ft_631',['get_t',['../structentt_1_1get__t.html',1,'entt']]] + ['get_5ft_623',['get_t',['../structentt_1_1get__t.html',1,'entt']]] ]; diff --git a/search/classes_7.js b/search/classes_7.js index 7e7c7005d..311646346 100644 --- a/search/classes_7.js +++ b/search/classes_7.js @@ -1,33 +1,29 @@ var searchData= [ - ['identifier_632',['identifier',['../classentt_1_1identifier.html',1,'entt']]], - ['identity_633',['identity',['../structentt_1_1identity.html',1,'entt']]], - ['input_5fiterator_5fpointer_634',['input_iterator_pointer',['../structentt_1_1input__iterator__pointer.html',1,'entt']]], - ['insertion_5fsort_635',['insertion_sort',['../structentt_1_1insertion__sort.html',1,'entt']]], - ['is_5fapplicable_636',['is_applicable',['../structentt_1_1is__applicable.html',1,'entt']]], - ['is_5fapplicable_3c_20func_2c_20const_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_637',['is_applicable< Func, const Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['is_5fapplicable_3c_20func_2c_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_638',['is_applicable< Func, Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['is_5fapplicable_5fr_639',['is_applicable_r',['../structentt_1_1is__applicable__r.html',1,'entt']]], - ['is_5fapplicable_5fr_3c_20ret_2c_20func_2c_20std_3a_3atuple_3c_20args_2e_2e_2e_20_3e_20_3e_640',['is_applicable_r< Ret, Func, std::tuple< Args... > >',['../structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['is_5fcomplete_641',['is_complete',['../structentt_1_1is__complete.html',1,'entt']]], - ['is_5fcomplete_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_642',['is_complete< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], - ['is_5febco_5feligible_643',['is_ebco_eligible',['../structentt_1_1is__ebco__eligible.html',1,'entt']]], - ['is_5fequality_5fcomparable_644',['is_equality_comparable',['../structentt_1_1is__equality__comparable.html',1,'entt']]], - ['is_5fequality_5fcomparable_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28std_3a_3adeclval_3c_20type_20_3e_28_29_3d_3dstd_3a_3adeclval_3c_20type_20_3e_28_29_29_3e_20_3e_645',['is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> >',['../structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html',1,'entt']]], - ['is_5fiterator_646',['is_iterator',['../structentt_1_1is__iterator.html',1,'entt']]], - ['is_5fiterator_3c_20type_2c_20std_3a_3aenable_5fif_5ft_3c_21std_3a_3ais_5fsame_5fv_3c_20std_3a_3aremove_5fconst_5ft_3c_20std_3a_3aremove_5fpointer_5ft_3c_20type_20_3e_20_3e_2c_20void_20_3e_20_3e_20_3e_647',['is_iterator< Type, std::enable_if_t<!std::is_same_v< std::remove_const_t< std::remove_pointer_t< Type > >, void > > >',['../structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html',1,'entt']]], - ['is_5fiterator_5ftype_648',['is_iterator_type',['../structentt_1_1is__iterator__type.html',1,'entt']]], - ['is_5fiterator_5ftype_3c_20type_2c_20it_2c_20std_3a_3aenable_5fif_5ft_3c_20is_5fiterator_5fv_3c_20type_20_3e_20_26_26std_3a_3ais_5fsame_5fv_3c_20type_2c_20it_20_3e_20_3e_20_3e_649',['is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > >',['../structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_1c6d668122d93a8a6f6186aab47dc295.html',1,'entt']]], - ['is_5fiterator_5ftype_3c_20type_2c_20it_2c_20std_3a_3aenable_5fif_5ft_3c_21std_3a_3ais_5fsame_5fv_3c_20type_2c_20it_20_3e_2c_20std_3a_3avoid_5ft_3c_20typename_20it_3a_3aiterator_5ftype_20_3e_20_3e_20_3e_650',['is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > >',['../structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__d827a14c04f195b53a7b353d4f3d2a15.html',1,'entt']]], - ['is_5fiterator_5ftype_3c_20type_2c_20it_3a_3aiterator_5ftype_20_3e_651',['is_iterator_type< Type, It::iterator_type >',['../structentt_1_1is__iterator__type.html',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_652',['is_meta_pointer_like',['../structentt_1_1is__meta__pointer__like.html',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_3c_20const_20type_20_3e_653',['is_meta_pointer_like< const Type >',['../structentt_1_1is__meta__pointer__like_3_01const_01Type_01_4.html',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_3c_20std_3a_3ashared_5fptr_3c_20type_20_3e_20_3e_654',['is_meta_pointer_like< std::shared_ptr< Type > >',['../structentt_1_1is__meta__pointer__like_3_01std_1_1shared__ptr_3_01Type_01_4_01_4.html',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_3c_20std_3a_3aunique_5fptr_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_655',['is_meta_pointer_like< std::unique_ptr< Type, Args... > >',['../structentt_1_1is__meta__pointer__like_3_01std_1_1unique__ptr_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_3c_20type_20_2a_20_3e_656',['is_meta_pointer_like< Type * >',['../structentt_1_1is__meta__pointer__like_3_01Type_01_5_01_4.html',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_3c_20type_20_3e_657',['is_meta_pointer_like< Type >',['../structentt_1_1is__meta__pointer__like.html',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_3c_20type_28_2a_29_5bn_5d_3e_658',['is_meta_pointer_like< Type(*)[N]>',['../structentt_1_1is__meta__pointer__like_3_01Type_07_5_08_0fN_0e_4.html',1,'entt']]], - ['is_5ftransparent_659',['is_transparent',['../structentt_1_1is__transparent.html',1,'entt']]], - ['is_5ftransparent_3c_20type_2c_20std_3a_3avoid_5ft_3c_20typename_20type_3a_3ais_5ftransparent_20_3e_20_3e_660',['is_transparent< Type, std::void_t< typename Type::is_transparent > >',['../structentt_1_1is__transparent_3_01Type_00_01std_1_1void__t_3_01typename_01Type_1_1is__transparent_01_4_01_4.html',1,'entt']]], - ['iterable_5fadaptor_661',['iterable_adaptor',['../structentt_1_1iterable__adaptor.html',1,'entt']]] + ['identifier_624',['identifier',['../classentt_1_1identifier.html',1,'entt']]], + ['identity_625',['identity',['../structentt_1_1identity.html',1,'entt']]], + ['input_5fiterator_5fpointer_626',['input_iterator_pointer',['../structentt_1_1input__iterator__pointer.html',1,'entt']]], + ['insertion_5fsort_627',['insertion_sort',['../structentt_1_1insertion__sort.html',1,'entt']]], + ['is_5fapplicable_628',['is_applicable',['../structentt_1_1is__applicable.html',1,'entt']]], + ['is_5fapplicable_3c_20func_2c_20const_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_629',['is_applicable< Func, const Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['is_5fapplicable_3c_20func_2c_20tuple_3c_20args_2e_2e_2e_20_3e_20_3e_630',['is_applicable< Func, Tuple< Args... > >',['../structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['is_5fapplicable_5fr_631',['is_applicable_r',['../structentt_1_1is__applicable__r.html',1,'entt']]], + ['is_5fapplicable_5fr_3c_20ret_2c_20func_2c_20std_3a_3atuple_3c_20args_2e_2e_2e_20_3e_20_3e_632',['is_applicable_r< Ret, Func, std::tuple< Args... > >',['../structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['is_5fcomplete_633',['is_complete',['../structentt_1_1is__complete.html',1,'entt']]], + ['is_5fcomplete_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_634',['is_complete< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], + ['is_5febco_5feligible_635',['is_ebco_eligible',['../structentt_1_1is__ebco__eligible.html',1,'entt']]], + ['is_5fequality_5fcomparable_636',['is_equality_comparable',['../structentt_1_1is__equality__comparable.html',1,'entt']]], + ['is_5fequality_5fcomparable_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28std_3a_3adeclval_3c_20type_20_3e_28_29_3d_3dstd_3a_3adeclval_3c_20type_20_3e_28_29_29_3e_20_3e_637',['is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> >',['../structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html',1,'entt']]], + ['is_5fiterator_638',['is_iterator',['../structentt_1_1is__iterator.html',1,'entt']]], + ['is_5fiterator_3c_20type_2c_20std_3a_3aenable_5fif_5ft_3c_21std_3a_3ais_5fsame_5fv_3c_20std_3a_3aremove_5fconst_5ft_3c_20std_3a_3aremove_5fpointer_5ft_3c_20type_20_3e_20_3e_2c_20void_20_3e_20_3e_20_3e_639',['is_iterator< Type, std::enable_if_t<!std::is_same_v< std::remove_const_t< std::remove_pointer_t< Type > >, void > > >',['../structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_640',['is_meta_pointer_like',['../structentt_1_1is__meta__pointer__like.html',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_3c_20const_20type_20_3e_641',['is_meta_pointer_like< const Type >',['../structentt_1_1is__meta__pointer__like_3_01const_01Type_01_4.html',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_3c_20std_3a_3ashared_5fptr_3c_20type_20_3e_20_3e_642',['is_meta_pointer_like< std::shared_ptr< Type > >',['../structentt_1_1is__meta__pointer__like_3_01std_1_1shared__ptr_3_01Type_01_4_01_4.html',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_3c_20std_3a_3aunique_5fptr_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_643',['is_meta_pointer_like< std::unique_ptr< Type, Args... > >',['../structentt_1_1is__meta__pointer__like_3_01std_1_1unique__ptr_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_3c_20type_20_2a_20_3e_644',['is_meta_pointer_like< Type * >',['../structentt_1_1is__meta__pointer__like_3_01Type_01_5_01_4.html',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_3c_20type_20_3e_645',['is_meta_pointer_like< Type >',['../structentt_1_1is__meta__pointer__like.html',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_3c_20type_28_2a_29_5bn_5d_3e_646',['is_meta_pointer_like< Type(*)[N]>',['../structentt_1_1is__meta__pointer__like_3_01Type_07_5_08_0fN_0e_4.html',1,'entt']]], + ['is_5ftransparent_647',['is_transparent',['../structentt_1_1is__transparent.html',1,'entt']]], + ['is_5ftransparent_3c_20type_2c_20std_3a_3avoid_5ft_3c_20typename_20type_3a_3ais_5ftransparent_20_3e_20_3e_648',['is_transparent< Type, std::void_t< typename Type::is_transparent > >',['../structentt_1_1is__transparent_3_01Type_00_01std_1_1void__t_3_01typename_01Type_1_1is__transparent_01_4_01_4.html',1,'entt']]], + ['iterable_5fadaptor_649',['iterable_adaptor',['../structentt_1_1iterable__adaptor.html',1,'entt']]] ]; diff --git a/search/classes_8.js b/search/classes_8.js index f996361bd..e54022187 100644 --- a/search/classes_8.js +++ b/search/classes_8.js @@ -1,40 +1,4 @@ var searchData= [ - ['matcher_662',['matcher',['../structentt_1_1matcher.html',1,'entt']]], - ['member_5fclass_663',['member_class',['../classentt_1_1member__class.html',1,'entt']]], - ['meta_5fany_664',['meta_any',['../classentt_1_1meta__any.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_665',['meta_associative_container',['../classentt_1_1meta__associative__container.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_666',['meta_associative_container_traits',['../structentt_1_1meta__associative__container__traits.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fhash_5fmap_3c_20key_2c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_667',['meta_associative_container_traits< dense_hash_map< Key, Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fhash_5fset_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_668',['meta_associative_container_traits< dense_hash_set< Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3amap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_669',['meta_associative_container_traits< std::map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_670',['meta_associative_container_traits< std::set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fmap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_671',['meta_associative_container_traits< std::unordered_map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_672',['meta_associative_container_traits< std::unordered_set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5fclass_5ftemplate_5ftag_673',['meta_class_template_tag',['../structentt_1_1meta__class__template__tag.html',1,'entt']]], - ['meta_5fctx_674',['meta_ctx',['../structentt_1_1meta__ctx.html',1,'entt']]], - ['meta_5fdata_675',['meta_data',['../structentt_1_1meta__data.html',1,'entt']]], - ['meta_5ffactory_676',['meta_factory',['../classentt_1_1meta__factory.html',1,'entt']]], - ['meta_5ffactory_3c_20type_20_3e_677',['meta_factory< Type >',['../classentt_1_1meta__factory_3_01Type_01_4.html',1,'entt']]], - ['meta_5ffactory_3c_20type_2c_20spec_2e_2e_2e_20_3e_678',['meta_factory< Type, Spec... >',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html',1,'entt']]], - ['meta_5ffunc_679',['meta_func',['../structentt_1_1meta__func.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_680',['meta_function_descriptor',['../structentt_1_1meta__function__descriptor.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_20class_3a_3a_2a_20_3e_681',['meta_function_descriptor< Type, Ret Class::* >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28_29_3e_682',['meta_function_descriptor< Type, Ret(*)()>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28maybetype_2c_20args_2e_2e_2e_29_3e_683',['meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_20const_20_3e_684',['meta_function_descriptor< Type, Ret(Class::*)(Args...) const >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html',1,'entt']]], - ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_3e_685',['meta_function_descriptor< Type, Ret(Class::*)(Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html',1,'entt']]], - ['meta_5ffunction_5fhelper_686',['meta_function_helper',['../classentt_1_1meta__function__helper.html',1,'entt']]], - ['meta_5fhandle_687',['meta_handle',['../structentt_1_1meta__handle.html',1,'entt']]], - ['meta_5fiterator_688',['meta_iterator',['../classentt_1_1meta__associative__container_1_1meta__iterator.html',1,'entt::meta_associative_container::meta_iterator'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html',1,'entt::meta_sequence_container::meta_iterator']]], - ['meta_5fprop_689',['meta_prop',['../structentt_1_1meta__prop.html',1,'entt']]], - ['meta_5frange_690',['meta_range',['../structentt_1_1meta__range.html',1,'entt']]], - ['meta_5fsequence_5fcontainer_691',['meta_sequence_container',['../classentt_1_1meta__sequence__container.html',1,'entt']]], - ['meta_5fsequence_5fcontainer_5ftraits_692',['meta_sequence_container_traits',['../structentt_1_1meta__sequence__container__traits.html',1,'entt']]], - ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3aarray_3c_20type_2c_20n_20_3e_20_3e_693',['meta_sequence_container_traits< std::array< Type, N > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html',1,'entt']]], - ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3avector_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_694',['meta_sequence_container_traits< std::vector< Type, Args... > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5ftemplate_5ftraits_695',['meta_template_traits',['../structentt_1_1meta__template__traits.html',1,'entt']]], - ['meta_5ftemplate_5ftraits_3c_20clazz_3c_20args_2e_2e_2e_20_3e_20_3e_696',['meta_template_traits< Clazz< Args... > >',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], - ['meta_5ftype_697',['meta_type',['../classentt_1_1meta__type.html',1,'entt']]], - ['monostate_698',['monostate',['../structentt_1_1monostate.html',1,'entt']]] + ['locator_650',['locator',['../structentt_1_1locator.html',1,'entt']]] ]; diff --git a/search/classes_9.js b/search/classes_9.js index 007a35b89..db16cb179 100644 --- a/search/classes_9.js +++ b/search/classes_9.js @@ -1,4 +1,39 @@ var searchData= [ - ['null_5ft_699',['null_t',['../structentt_1_1null__t.html',1,'entt']]] + ['matcher_651',['matcher',['../structentt_1_1matcher.html',1,'entt']]], + ['member_5fclass_652',['member_class',['../classentt_1_1member__class.html',1,'entt']]], + ['meta_5fany_653',['meta_any',['../classentt_1_1meta__any.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_654',['meta_associative_container',['../classentt_1_1meta__associative__container.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_655',['meta_associative_container_traits',['../structentt_1_1meta__associative__container__traits.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fmap_3c_20key_2c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_656',['meta_associative_container_traits< dense_map< Key, Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20dense_5fset_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_657',['meta_associative_container_traits< dense_set< Type, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3amap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_658',['meta_associative_container_traits< std::map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_659',['meta_associative_container_traits< std::set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fmap_3c_20key_2c_20value_2c_20args_2e_2e_2e_20_3e_20_3e_660',['meta_associative_container_traits< std::unordered_map< Key, Value, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fassociative_5fcontainer_5ftraits_3c_20std_3a_3aunordered_5fset_3c_20key_2c_20args_2e_2e_2e_20_3e_20_3e_661',['meta_associative_container_traits< std::unordered_set< Key, Args... > >',['../structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5fclass_5ftemplate_5ftag_662',['meta_class_template_tag',['../structentt_1_1meta__class__template__tag.html',1,'entt']]], + ['meta_5fctx_663',['meta_ctx',['../structentt_1_1meta__ctx.html',1,'entt']]], + ['meta_5fdata_664',['meta_data',['../structentt_1_1meta__data.html',1,'entt']]], + ['meta_5ffactory_665',['meta_factory',['../classentt_1_1meta__factory.html',1,'entt']]], + ['meta_5ffactory_3c_20type_20_3e_666',['meta_factory< Type >',['../classentt_1_1meta__factory_3_01Type_01_4.html',1,'entt']]], + ['meta_5ffactory_3c_20type_2c_20spec_2e_2e_2e_20_3e_667',['meta_factory< Type, Spec... >',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html',1,'entt']]], + ['meta_5ffunc_668',['meta_func',['../structentt_1_1meta__func.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_669',['meta_function_descriptor',['../structentt_1_1meta__function__descriptor.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_20class_3a_3a_2a_20_3e_670',['meta_function_descriptor< Type, Ret Class::* >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28_29_3e_671',['meta_function_descriptor< Type, Ret(*)()>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28_2a_29_28maybetype_2c_20args_2e_2e_2e_29_3e_672',['meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_20const_20_3e_673',['meta_function_descriptor< Type, Ret(Class::*)(Args...) const >',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html',1,'entt']]], + ['meta_5ffunction_5fdescriptor_3c_20type_2c_20ret_28class_3a_3a_2a_29_28args_2e_2e_2e_29_3e_674',['meta_function_descriptor< Type, Ret(Class::*)(Args...)>',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html',1,'entt']]], + ['meta_5ffunction_5fhelper_675',['meta_function_helper',['../classentt_1_1meta__function__helper.html',1,'entt']]], + ['meta_5fhandle_676',['meta_handle',['../structentt_1_1meta__handle.html',1,'entt']]], + ['meta_5fprop_677',['meta_prop',['../structentt_1_1meta__prop.html',1,'entt']]], + ['meta_5frange_678',['meta_range',['../structentt_1_1meta__range.html',1,'entt']]], + ['meta_5fsequence_5fcontainer_679',['meta_sequence_container',['../classentt_1_1meta__sequence__container.html',1,'entt']]], + ['meta_5fsequence_5fcontainer_5ftraits_680',['meta_sequence_container_traits',['../structentt_1_1meta__sequence__container__traits.html',1,'entt']]], + ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3aarray_3c_20type_2c_20n_20_3e_20_3e_681',['meta_sequence_container_traits< std::array< Type, N > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html',1,'entt']]], + ['meta_5fsequence_5fcontainer_5ftraits_3c_20std_3a_3avector_3c_20type_2c_20args_2e_2e_2e_20_3e_20_3e_682',['meta_sequence_container_traits< std::vector< Type, Args... > >',['../structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5ftemplate_5ftraits_683',['meta_template_traits',['../structentt_1_1meta__template__traits.html',1,'entt']]], + ['meta_5ftemplate_5ftraits_3c_20clazz_3c_20args_2e_2e_2e_20_3e_20_3e_684',['meta_template_traits< Clazz< Args... > >',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html',1,'entt']]], + ['meta_5ftype_685',['meta_type',['../classentt_1_1meta__type.html',1,'entt']]], + ['monostate_686',['monostate',['../structentt_1_1monostate.html',1,'entt']]] ]; diff --git a/search/classes_a.js b/search/classes_a.js index 0022d329a..18147aa52 100644 --- a/search/classes_a.js +++ b/search/classes_a.js @@ -1,5 +1,4 @@ var searchData= [ - ['overloaded_700',['overloaded',['../structentt_1_1overloaded.html',1,'entt']]], - ['owned_5ft_701',['owned_t',['../structentt_1_1owned__t.html',1,'entt']]] + ['null_5ft_687',['null_t',['../structentt_1_1null__t.html',1,'entt']]] ]; diff --git a/search/classes_b.js b/search/classes_b.js index b62c06364..97ea96b7a 100644 --- a/search/classes_b.js +++ b/search/classes_b.js @@ -1,9 +1,5 @@ var searchData= [ - ['poly_5fbase_702',['poly_base',['../structentt_1_1poly__base.html',1,'entt']]], - ['poly_5finspector_703',['poly_inspector',['../structentt_1_1poly__inspector.html',1,'entt']]], - ['poly_5fvtable_704',['poly_vtable',['../classentt_1_1poly__vtable.html',1,'entt']]], - ['process_705',['process',['../classentt_1_1process.html',1,'entt']]], - ['process_3c_20process_5fadaptor_3c_20func_2c_20delta_20_3e_2c_20delta_20_3e_706',['process< process_adaptor< Func, Delta >, Delta >',['../classentt_1_1process.html',1,'entt']]], - ['process_5fadaptor_707',['process_adaptor',['../structentt_1_1process__adaptor.html',1,'entt']]] + ['overloaded_688',['overloaded',['../structentt_1_1overloaded.html',1,'entt']]], + ['owned_5ft_689',['owned_t',['../structentt_1_1owned__t.html',1,'entt']]] ]; diff --git a/search/classes_c.js b/search/classes_c.js index c27c1a404..e3efe50ae 100644 --- a/search/classes_c.js +++ b/search/classes_c.js @@ -1,7 +1,9 @@ var searchData= [ - ['radix_5fsort_708',['radix_sort',['../structentt_1_1radix__sort.html',1,'entt']]], - ['resource_5fcache_709',['resource_cache',['../classentt_1_1resource__cache.html',1,'entt']]], - ['resource_5fhandle_710',['resource_handle',['../classentt_1_1resource__handle.html',1,'entt']]], - ['resource_5floader_711',['resource_loader',['../classentt_1_1resource__loader.html',1,'entt']]] + ['poly_5fbase_690',['poly_base',['../structentt_1_1poly__base.html',1,'entt']]], + ['poly_5finspector_691',['poly_inspector',['../structentt_1_1poly__inspector.html',1,'entt']]], + ['poly_5fvtable_692',['poly_vtable',['../classentt_1_1poly__vtable.html',1,'entt']]], + ['process_693',['process',['../classentt_1_1process.html',1,'entt']]], + ['process_3c_20process_5fadaptor_3c_20func_2c_20delta_20_3e_2c_20delta_20_3e_694',['process< process_adaptor< Func, Delta >, Delta >',['../classentt_1_1process.html',1,'entt']]], + ['process_5fadaptor_695',['process_adaptor',['../structentt_1_1process__adaptor.html',1,'entt']]] ]; diff --git a/search/classes_d.js b/search/classes_d.js index e1158511f..d367982a6 100644 --- a/search/classes_d.js +++ b/search/classes_d.js @@ -1,17 +1,7 @@ var searchData= [ - ['scheduler_712',['scheduler',['../classentt_1_1scheduler.html',1,'entt']]], - ['scoped_5fconnection_713',['scoped_connection',['../structentt_1_1scoped__connection.html',1,'entt']]], - ['service_5flocator_714',['service_locator',['../structentt_1_1service__locator.html',1,'entt']]], - ['sigh_715',['sigh',['../classentt_1_1sigh.html',1,'entt']]], - ['sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_716',['sigh< Ret(Args...), Allocator >',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html',1,'entt']]], - ['sigh_3c_20void_28entt_3a_3abasic_5fregistry_3c_20entity_5ftype_20_3e_20_26_2c_20const_20entity_5ftype_29_3e_717',['sigh< void(entt::basic_registry< entity_type > &, const entity_type)>',['../classentt_1_1sigh.html',1,'entt']]], - ['sigh_3c_20void_28event_20_26_29_3e_718',['sigh< void(Event &)>',['../classentt_1_1sigh.html',1,'entt']]], - ['sigh_5fstorage_5fmixin_719',['sigh_storage_mixin',['../classentt_1_1sigh__storage__mixin.html',1,'entt']]], - ['sink_720',['sink',['../classentt_1_1sink.html',1,'entt']]], - ['sink_3c_20sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_20_3e_721',['sink< sigh< Ret(Args...), Allocator > >',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html',1,'entt']]], - ['size_5fof_722',['size_of',['../structentt_1_1size__of.html',1,'entt']]], - ['size_5fof_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_723',['size_of< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], - ['std_5fsort_724',['std_sort',['../structentt_1_1std__sort.html',1,'entt']]], - ['storage_5ftraits_725',['storage_traits',['../structentt_1_1storage__traits.html',1,'entt']]] + ['radix_5fsort_696',['radix_sort',['../structentt_1_1radix__sort.html',1,'entt']]], + ['resource_697',['resource',['../classentt_1_1resource.html',1,'entt']]], + ['resource_5fcache_698',['resource_cache',['../classentt_1_1resource__cache.html',1,'entt']]], + ['resource_5floader_699',['resource_loader',['../structentt_1_1resource__loader.html',1,'entt']]] ]; diff --git a/search/classes_e.js b/search/classes_e.js index a3d23ef56..3a403c63f 100644 --- a/search/classes_e.js +++ b/search/classes_e.js @@ -1,28 +1,15 @@ var searchData= [ - ['tombstone_5ft_726',['tombstone_t',['../structentt_1_1tombstone__t.html',1,'entt']]], - ['tuple_5felement_3c_20index_2c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_727',['tuple_element< Index, entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], - ['tuple_5fsize_3c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_728',['tuple_size< entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], - ['type_5fhash_729',['type_hash',['../structentt_1_1type__hash.html',1,'entt']]], - ['type_5fidentity_730',['type_identity',['../structentt_1_1type__identity.html',1,'entt']]], - ['type_5findex_731',['type_index',['../structentt_1_1type__index.html',1,'entt']]], - ['type_5finfo_732',['type_info',['../classentt_1_1type__info.html',1,'entt']]], - ['type_5flist_733',['type_list',['../structentt_1_1type__list.html',1,'entt']]], - ['type_5flist_3c_20type_2e_2e_2e_20_3e_734',['type_list< Type... >',['../structentt_1_1type__list.html',1,'entt']]], - ['type_5flist_5fcat_735',['type_list_cat',['../structentt_1_1type__list__cat.html',1,'entt']]], - ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_20_3e_736',['type_list_cat< type_list< Type... > >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_737',['type_list_cat< type_list< Type... >, type_list< Other... >, List... >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], - ['type_5flist_5fcat_3c_3e_738',['type_list_cat<>',['../structentt_1_1type__list__cat_3_4.html',1,'entt']]], - ['type_5flist_5fcontains_739',['type_list_contains',['../structentt_1_1type__list__contains.html',1,'entt']]], - ['type_5flist_5fcontains_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20other_20_3e_740',['type_list_contains< type_list< Type... >, Other >',['../structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html',1,'entt']]], - ['type_5flist_5fdiff_741',['type_list_diff',['../structentt_1_1type__list__diff.html',1,'entt']]], - ['type_5flist_5fdiff_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_742',['type_list_diff< type_list< Type... >, type_list< Other... > >',['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5felement_743',['type_list_element',['../structentt_1_1type__list__element.html',1,'entt']]], - ['type_5flist_5felement_3c_200u_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_744',['type_list_element< 0u, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5felement_3c_20index_20_2d_201u_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_745',['type_list_element< Index - 1u, type_list< Other... > >',['../structentt_1_1type__list__element.html',1,'entt']]], - ['type_5flist_5felement_3c_20index_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_746',['type_list_element< Index, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5funique_747',['type_list_unique',['../structentt_1_1type__list__unique.html',1,'entt']]], - ['type_5flist_5funique_3c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_748',['type_list_unique< type_list< Type, Other... > >',['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['type_5flist_5funique_3c_20type_5flist_3c_3e_20_3e_749',['type_list_unique< type_list<> >',['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html',1,'entt']]], - ['type_5fname_750',['type_name',['../structentt_1_1type__name.html',1,'entt']]] + ['scheduler_700',['scheduler',['../classentt_1_1scheduler.html',1,'entt']]], + ['scoped_5fconnection_701',['scoped_connection',['../structentt_1_1scoped__connection.html',1,'entt']]], + ['sigh_702',['sigh',['../classentt_1_1sigh.html',1,'entt']]], + ['sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_703',['sigh< Ret(Args...), Allocator >',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html',1,'entt']]], + ['sigh_3c_20void_28entt_3a_3abasic_5fregistry_3c_20entity_5ftype_20_3e_20_26_2c_20const_20entity_5ftype_29_3e_704',['sigh< void(entt::basic_registry< entity_type > &, const entity_type)>',['../classentt_1_1sigh.html',1,'entt']]], + ['sigh_5fstorage_5fmixin_705',['sigh_storage_mixin',['../classentt_1_1sigh__storage__mixin.html',1,'entt']]], + ['sink_706',['sink',['../classentt_1_1sink.html',1,'entt']]], + ['sink_3c_20sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_20_3e_707',['sink< sigh< Ret(Args...), Allocator > >',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html',1,'entt']]], + ['size_5fof_708',['size_of',['../structentt_1_1size__of.html',1,'entt']]], + ['size_5fof_3c_20type_2c_20std_3a_3avoid_5ft_3c_20decltype_28sizeof_28type_29_29_3e_20_3e_709',['size_of< Type, std::void_t< decltype(sizeof(Type))> >',['../structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html',1,'entt']]], + ['std_5fsort_710',['std_sort',['../structentt_1_1std__sort.html',1,'entt']]], + ['storage_5ftraits_711',['storage_traits',['../structentt_1_1storage__traits.html',1,'entt']]] ]; diff --git a/search/classes_f.js b/search/classes_f.js index 660374b7d..50315dc31 100644 --- a/search/classes_f.js +++ b/search/classes_f.js @@ -1,13 +1,28 @@ var searchData= [ - ['value_5flist_751',['value_list',['../structentt_1_1value__list.html',1,'entt']]], - ['value_5flist_5fcat_752',['value_list_cat',['../structentt_1_1value__list__cat.html',1,'entt']]], - ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_20_3e_753',['value_list_cat< value_list< Value... > >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html',1,'entt']]], - ['value_5flist_5fcat_3c_20value_5flist_3c_20value_2e_2e_2e_20_3e_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_754',['value_list_cat< value_list< Value... >, value_list< Other... >, List... >',['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], - ['value_5flist_5fcat_3c_3e_755',['value_list_cat<>',['../structentt_1_1value__list__cat_3_4.html',1,'entt']]], - ['value_5flist_5felement_756',['value_list_element',['../structentt_1_1value__list__element.html',1,'entt']]], - ['value_5flist_5felement_3c_200u_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_757',['value_list_element< 0u, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['value_5flist_5felement_3c_20index_20_2d_201u_2c_20value_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_758',['value_list_element< Index - 1u, value_list< Other... > >',['../structentt_1_1value__list__element.html',1,'entt']]], - ['value_5flist_5felement_3c_20index_2c_20value_5flist_3c_20value_2c_20other_2e_2e_2e_20_3e_20_3e_759',['value_list_element< Index, value_list< Value, Other... > >',['../structentt_1_1value__list__element_3_01Index_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], - ['vertex_760',['vertex',['../structentt_1_1basic__organizer_1_1vertex.html',1,'entt::basic_organizer']]] + ['tombstone_5ft_712',['tombstone_t',['../structentt_1_1tombstone__t.html',1,'entt']]], + ['tuple_5felement_3c_20index_2c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_713',['tuple_element< Index, entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], + ['tuple_5fsize_3c_20entt_3a_3acompressed_5fpair_3c_20first_2c_20second_20_3e_20_3e_714',['tuple_size< entt::compressed_pair< First, Second > >',['../structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html',1,'std']]], + ['type_5fhash_715',['type_hash',['../structentt_1_1type__hash.html',1,'entt']]], + ['type_5fidentity_716',['type_identity',['../structentt_1_1type__identity.html',1,'entt']]], + ['type_5findex_717',['type_index',['../structentt_1_1type__index.html',1,'entt']]], + ['type_5finfo_718',['type_info',['../structentt_1_1type__info.html',1,'entt']]], + ['type_5flist_719',['type_list',['../structentt_1_1type__list.html',1,'entt']]], + ['type_5flist_3c_20type_2e_2e_2e_20_3e_720',['type_list< Type... >',['../structentt_1_1type__list.html',1,'entt']]], + ['type_5flist_5fcat_721',['type_list_cat',['../structentt_1_1type__list__cat.html',1,'entt']]], + ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_20_3e_722',['type_list_cat< type_list< Type... > >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5fcat_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_2c_20list_2e_2e_2e_20_3e_723',['type_list_cat< type_list< Type... >, type_list< Other... >, List... >',['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html',1,'entt']]], + ['type_5flist_5fcat_3c_3e_724',['type_list_cat<>',['../structentt_1_1type__list__cat_3_4.html',1,'entt']]], + ['type_5flist_5fcontains_725',['type_list_contains',['../structentt_1_1type__list__contains.html',1,'entt']]], + ['type_5flist_5fcontains_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20other_20_3e_726',['type_list_contains< type_list< Type... >, Other >',['../structentt_1_1type__list__contains_3_01type__list_3_01Type_8_8_8_01_4_00_01Other_01_4.html',1,'entt']]], + ['type_5flist_5fdiff_727',['type_list_diff',['../structentt_1_1type__list__diff.html',1,'entt']]], + ['type_5flist_5fdiff_3c_20type_5flist_3c_20type_2e_2e_2e_20_3e_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_728',['type_list_diff< type_list< Type... >, type_list< Other... > >',['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5felement_729',['type_list_element',['../structentt_1_1type__list__element.html',1,'entt']]], + ['type_5flist_5felement_3c_200u_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_730',['type_list_element< 0u, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5felement_3c_20index_20_2d_201u_2c_20type_5flist_3c_20other_2e_2e_2e_20_3e_20_3e_731',['type_list_element< Index - 1u, type_list< Other... > >',['../structentt_1_1type__list__element.html',1,'entt']]], + ['type_5flist_5felement_3c_20index_2c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_732',['type_list_element< Index, type_list< Type, Other... > >',['../structentt_1_1type__list__element_3_01Index_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5funique_733',['type_list_unique',['../structentt_1_1type__list__unique.html',1,'entt']]], + ['type_5flist_5funique_3c_20type_5flist_3c_20type_2c_20other_2e_2e_2e_20_3e_20_3e_734',['type_list_unique< type_list< Type, Other... > >',['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html',1,'entt']]], + ['type_5flist_5funique_3c_20type_5flist_3c_3e_20_3e_735',['type_list_unique< type_list<> >',['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html',1,'entt']]], + ['type_5fname_736',['type_name',['../structentt_1_1type__name.html',1,'entt']]] ]; diff --git a/search/enums_0.js b/search/enums_0.js index 6d9de0907..43bd7651c 100644 --- a/search/enums_0.js +++ b/search/enums_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['deletion_5fpolicy_1178',['deletion_policy',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581',1,'entt']]] + ['deletion_5fpolicy_1162',['deletion_policy',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581',1,'entt']]] ]; diff --git a/search/enums_1.js b/search/enums_1.js index 02b2eba29..391f68b5c 100644 --- a/search/enums_1.js +++ b/search/enums_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['entity_1179',['entity',['../namespaceentt.html#a0b54e231d069e8a231e14b223388808a',1,'entt']]] + ['entity_1163',['entity',['../namespaceentt.html#a0b54e231d069e8a231e14b223388808a',1,'entt']]] ]; diff --git a/search/enumvalues_0.js b/search/enumvalues_0.js index 0f142395f..518ccf27d 100644 --- a/search/enumvalues_0.js +++ b/search/enumvalues_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['in_5fplace_1180',['in_place',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581aa49f99ae99ae9daddd1fb79b73d2db28',1,'entt']]] + ['in_5fplace_1164',['in_place',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581aa49f99ae99ae9daddd1fb79b73d2db28',1,'entt']]] ]; diff --git a/search/enumvalues_1.js b/search/enumvalues_1.js index b0751cf1c..d1bcfe2e7 100644 --- a/search/enumvalues_1.js +++ b/search/enumvalues_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['swap_5fand_5fpop_1181',['swap_and_pop',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581a8223d1ccb16b6dd0b19fe9c6fdb13708',1,'entt']]] + ['swap_5fand_5fpop_1165',['swap_and_pop',['../namespaceentt.html#abc4d0fa77fae26e7c01793990996c581a8223d1ccb16b6dd0b19fe9c6fdb13708',1,'entt']]] ]; diff --git a/search/functions_0.js b/search/functions_0.js index b8b6ddc85..79e948136 100644 --- a/search/functions_0.js +++ b/search/functions_0.js @@ -1,19 +1,22 @@ var searchData= [ - ['abort_763',['abort',['../classentt_1_1process.html#af27d28af408f1dfb260b8fe976e66ea3',1,'entt::process::abort()'],['../classentt_1_1scheduler.html#aabc25388bff1b3b0770f913f54b915f2',1,'entt::scheduler::abort()']]], - ['alive_764',['alive',['../classentt_1_1basic__registry.html#a7a42cddcb9bd14802bd597e789ff341f',1,'entt::basic_registry::alive()'],['../classentt_1_1process.html#a1a3e1f6d09d8bca974ed383def805f3d',1,'entt::process::alive()']]], - ['all_5fof_765',['all_of',['../structentt_1_1basic__handle.html#a29185b95a343d6770517683daebb20c9',1,'entt::basic_handle::all_of()'],['../classentt_1_1basic__registry.html#a40072eca607846f43f47d0e3f11dd196',1,'entt::basic_registry::all_of()']]], - ['allow_5fcast_766',['allow_cast',['../classentt_1_1meta__any.html#a522ea5757c3eb8bd33ad3e1816141b5d',1,'entt::meta_any::allow_cast(const meta_type &type) const'],['../classentt_1_1meta__any.html#af80f94605c72c5c2ff30fd857b73010f',1,'entt::meta_any::allow_cast(const meta_type &type)'],['../classentt_1_1meta__any.html#a66606e3abbe512e064a0e1440a069594',1,'entt::meta_any::allow_cast() const'],['../classentt_1_1meta__any.html#af3bf7b2771fc6a67c2a26b19d364e85a',1,'entt::meta_any::allow_cast()']]], - ['any_5fcast_767',['any_cast',['../namespaceentt.html#aeaf3e0080cf2091703718dcbe558171b',1,'entt::any_cast(const basic_any< Len, Align > *data)'],['../namespaceentt.html#a2364ab41cab0fccd92cdaaf8779581cb',1,'entt::any_cast(const basic_any< Len, Align > &data)'],['../namespaceentt.html#a7c210bb2e08d184415f5c5680d87d74e',1,'entt::any_cast(basic_any< Len, Align > &data)'],['../namespaceentt.html#a1ade9ac7c0844a7c154287ca96ceba08',1,'entt::any_cast(basic_any< Len, Align > &&data)'],['../namespaceentt.html#ac53c0786eb32685bbbfc6a2b9806338b',1,'entt::any_cast(basic_any< Len, Align > *data)']]], - ['any_5fof_768',['any_of',['../structentt_1_1basic__handle.html#a01a92bc7ed67cc044bb245308de39443',1,'entt::basic_handle::any_of()'],['../classentt_1_1basic__registry.html#a08f819276fd2d8b2b2b6d01357f61a42',1,'entt::basic_registry::any_of()']]], - ['arg_769',['arg',['../structentt_1_1meta__data.html#a754ff9b953cd8f9195776e6d6202ce84',1,'entt::meta_data::arg()'],['../structentt_1_1meta__func.html#a190fd50a4862fd44216716a0a0dd0e66',1,'entt::meta_func::arg()']]], - ['arity_770',['arity',['../structentt_1_1meta__data.html#ae49c225400fa1938e53a5f65f6f36152',1,'entt::meta_data::arity()'],['../structentt_1_1meta__func.html#adabf1d427890eacd3a31c7f748f0441a',1,'entt::meta_func::arity()']]], - ['as_5fassociative_5fcontainer_771',['as_associative_container',['../classentt_1_1meta__any.html#afceb9729365e24ed957710c676e8d16c',1,'entt::meta_any::as_associative_container()'],['../classentt_1_1meta__any.html#ad413e2504354b7c130b487f5348b0f87',1,'entt::meta_any::as_associative_container() const']]], - ['as_5fgroup_772',['as_group',['../structentt_1_1as__group.html#a1e820abe8d20a6a64487b31bc5a2f879',1,'entt::as_group::as_group()'],['../namespaceentt.html#a4dcc1231f76478c7aa6f6ec9516cf045',1,'entt::as_group(basic_registry< Entity > &) -> as_group< Entity >'],['../namespaceentt.html#ad6e62063b33b410e0a4bf1acc5b59596',1,'entt::as_group(const basic_registry< Entity > &) -> as_group< const Entity >']]], - ['as_5fref_773',['as_ref',['../classentt_1_1basic__any.html#a50d19ca1f8421f57ba9765312935ee92',1,'entt::basic_any::as_ref()'],['../classentt_1_1meta__any.html#ae5c5038d531db5739fdbe768be5909eb',1,'entt::meta_any::as_ref()'],['../classentt_1_1meta__any.html#ab07de5b666f0f198691eb8e92f70f4a1',1,'entt::meta_any::as_ref() const'],['../classentt_1_1basic__poly.html#a7ce289eca7eeaa98e53c09f421b89394',1,'entt::basic_poly::as_ref()'],['../classentt_1_1basic__poly.html#aa87cad0ad5c7db180dfeebf0dea8b90d',1,'entt::basic_poly::as_ref() const'],['../classentt_1_1basic__any.html#a7489b6cb743e74b8afcee0f66799b535',1,'entt::basic_any::as_ref()']]], - ['as_5fsequence_5fcontainer_774',['as_sequence_container',['../classentt_1_1meta__any.html#a69ce5b726f86d8a5dc0a5a7ddf2f7c0e',1,'entt::meta_any::as_sequence_container()'],['../classentt_1_1meta__any.html#a8b9a3cebd9cf4e0c6c4f28b7bacdf4fc',1,'entt::meta_any::as_sequence_container() const']]], - ['as_5fview_775',['as_view',['../structentt_1_1as__view.html#a4298bb90698199b99820bce07d866ac7',1,'entt::as_view::as_view()'],['../namespaceentt.html#a4821869aa545da11205c90388fa2d08e',1,'entt::as_view(const basic_registry< Entity > &) -> as_view< const Entity >'],['../namespaceentt.html#af0922fd2ea330d84a2e1b6f19e877aed',1,'entt::as_view(basic_registry< Entity > &) -> as_view< Entity >']]], - ['assign_776',['assign',['../classentt_1_1meta__any.html#a77e67e73023b213a5fe46f88820f571f',1,'entt::meta_any::assign()'],['../classentt_1_1basic__any.html#a641412fc4569ea9b2ec10d35a03835b3',1,'entt::basic_any::assign(const any &other)'],['../classentt_1_1basic__any.html#a5a6069fbe1c45bd6a8b10fbe872d3bc4',1,'entt::basic_any::assign(any &&other)'],['../classentt_1_1basic__registry.html#a35d217b9bc09235d55388941de380f72',1,'entt::basic_registry::assign()'],['../classentt_1_1meta__any.html#a022362d5bb8ee42e3637e3d64a22027a',1,'entt::meta_any::assign()']]], - ['at_777',['at',['../classentt_1_1dense__hash__map.html#a1e168af85bd77d9bb6c1981c36c2592b',1,'entt::dense_hash_map::at(const key_type &key)'],['../classentt_1_1dense__hash__map.html#af191ee281e1c7f191536581d4fa641ec',1,'entt::dense_hash_map::at(const key_type &key) const'],['../classentt_1_1basic__sparse__set.html#aa0d4efaf22f43c1a8573e50c7460299a',1,'entt::basic_sparse_set::at()']]], - ['attach_778',['attach',['../classentt_1_1scheduler.html#a871812d08af8483316d1ce5d1e9d686f',1,'entt::scheduler::attach(Func &&func)'],['../classentt_1_1scheduler.html#aced8ede0331494ea80e2b19ac203cccc',1,'entt::scheduler::attach(Args &&...args)']]] + ['abort_749',['abort',['../classentt_1_1process.html#af27d28af408f1dfb260b8fe976e66ea3',1,'entt::process::abort()'],['../classentt_1_1scheduler.html#aabc25388bff1b3b0770f913f54b915f2',1,'entt::scheduler::abort()']]], + ['alive_750',['alive',['../classentt_1_1basic__registry.html#a7a42cddcb9bd14802bd597e789ff341f',1,'entt::basic_registry::alive()'],['../classentt_1_1process.html#a1a3e1f6d09d8bca974ed383def805f3d',1,'entt::process::alive()']]], + ['all_5fof_751',['all_of',['../structentt_1_1basic__handle.html#a29185b95a343d6770517683daebb20c9',1,'entt::basic_handle::all_of()'],['../classentt_1_1basic__registry.html#a40072eca607846f43f47d0e3f11dd196',1,'entt::basic_registry::all_of()']]], + ['allocate_5femplace_752',['allocate_emplace',['../structentt_1_1locator.html#a9670f20018968edcf7677aa44ae036bf',1,'entt::locator']]], + ['allocate_5funique_753',['allocate_unique',['../namespaceentt.html#a34acc7c30062bc75491ea6f8c6ad5078',1,'entt']]], + ['allocation_5fdeleter_754',['allocation_deleter',['../structentt_1_1allocation__deleter.html#a1e40e8f850d327ed13dbb3eab6886b7d',1,'entt::allocation_deleter']]], + ['allow_5fcast_755',['allow_cast',['../classentt_1_1meta__any.html#a522ea5757c3eb8bd33ad3e1816141b5d',1,'entt::meta_any::allow_cast(const meta_type &type) const'],['../classentt_1_1meta__any.html#af80f94605c72c5c2ff30fd857b73010f',1,'entt::meta_any::allow_cast(const meta_type &type)'],['../classentt_1_1meta__any.html#a66606e3abbe512e064a0e1440a069594',1,'entt::meta_any::allow_cast() const'],['../classentt_1_1meta__any.html#af3bf7b2771fc6a67c2a26b19d364e85a',1,'entt::meta_any::allow_cast()']]], + ['any_5fcast_756',['any_cast',['../namespaceentt.html#a1ade9ac7c0844a7c154287ca96ceba08',1,'entt::any_cast(basic_any< Len, Align > &&data)'],['../namespaceentt.html#a2364ab41cab0fccd92cdaaf8779581cb',1,'entt::any_cast(const basic_any< Len, Align > &data)'],['../namespaceentt.html#a7c210bb2e08d184415f5c5680d87d74e',1,'entt::any_cast(basic_any< Len, Align > &data)'],['../namespaceentt.html#aeaf3e0080cf2091703718dcbe558171b',1,'entt::any_cast(const basic_any< Len, Align > *data)'],['../namespaceentt.html#ac53c0786eb32685bbbfc6a2b9806338b',1,'entt::any_cast(basic_any< Len, Align > *data)']]], + ['any_5fof_757',['any_of',['../structentt_1_1basic__handle.html#a01a92bc7ed67cc044bb245308de39443',1,'entt::basic_handle::any_of()'],['../classentt_1_1basic__registry.html#a08f819276fd2d8b2b2b6d01357f61a42',1,'entt::basic_registry::any_of()']]], + ['arg_758',['arg',['../structentt_1_1meta__data.html#a754ff9b953cd8f9195776e6d6202ce84',1,'entt::meta_data::arg()'],['../structentt_1_1meta__func.html#a190fd50a4862fd44216716a0a0dd0e66',1,'entt::meta_func::arg()']]], + ['arity_759',['arity',['../structentt_1_1meta__data.html#ae49c225400fa1938e53a5f65f6f36152',1,'entt::meta_data::arity()'],['../structentt_1_1meta__func.html#adabf1d427890eacd3a31c7f748f0441a',1,'entt::meta_func::arity()']]], + ['as_5fassociative_5fcontainer_760',['as_associative_container',['../classentt_1_1meta__any.html#afceb9729365e24ed957710c676e8d16c',1,'entt::meta_any::as_associative_container()'],['../classentt_1_1meta__any.html#ad413e2504354b7c130b487f5348b0f87',1,'entt::meta_any::as_associative_container() const']]], + ['as_5fgroup_761',['as_group',['../structentt_1_1as__group.html#a1e820abe8d20a6a64487b31bc5a2f879',1,'entt::as_group::as_group()'],['../namespaceentt.html#a4dcc1231f76478c7aa6f6ec9516cf045',1,'entt::as_group(basic_registry< Entity > &) -> as_group< Entity >'],['../namespaceentt.html#ad6e62063b33b410e0a4bf1acc5b59596',1,'entt::as_group(const basic_registry< Entity > &) -> as_group< const Entity >']]], + ['as_5fref_762',['as_ref',['../classentt_1_1meta__any.html#ae5c5038d531db5739fdbe768be5909eb',1,'entt::meta_any::as_ref()'],['../classentt_1_1meta__any.html#ab07de5b666f0f198691eb8e92f70f4a1',1,'entt::meta_any::as_ref() const'],['../classentt_1_1basic__poly.html#a7ce289eca7eeaa98e53c09f421b89394',1,'entt::basic_poly::as_ref()'],['../classentt_1_1basic__poly.html#aa87cad0ad5c7db180dfeebf0dea8b90d',1,'entt::basic_poly::as_ref() const'],['../classentt_1_1basic__any.html#a7489b6cb743e74b8afcee0f66799b535',1,'entt::basic_any::as_ref()'],['../classentt_1_1basic__any.html#a50d19ca1f8421f57ba9765312935ee92',1,'entt::basic_any::as_ref() const']]], + ['as_5fsequence_5fcontainer_763',['as_sequence_container',['../classentt_1_1meta__any.html#a69ce5b726f86d8a5dc0a5a7ddf2f7c0e',1,'entt::meta_any::as_sequence_container()'],['../classentt_1_1meta__any.html#a8b9a3cebd9cf4e0c6c4f28b7bacdf4fc',1,'entt::meta_any::as_sequence_container() const']]], + ['as_5fview_764',['as_view',['../structentt_1_1as__view.html#a4298bb90698199b99820bce07d866ac7',1,'entt::as_view::as_view()'],['../namespaceentt.html#a4821869aa545da11205c90388fa2d08e',1,'entt::as_view(const basic_registry< Entity > &) -> as_view< const Entity >'],['../namespaceentt.html#af0922fd2ea330d84a2e1b6f19e877aed',1,'entt::as_view(basic_registry< Entity > &) -> as_view< Entity >']]], + ['assign_765',['assign',['../classentt_1_1basic__any.html#a641412fc4569ea9b2ec10d35a03835b3',1,'entt::basic_any::assign(const any &other)'],['../classentt_1_1basic__any.html#a5a6069fbe1c45bd6a8b10fbe872d3bc4',1,'entt::basic_any::assign(any &&other)'],['../classentt_1_1basic__registry.html#a35d217b9bc09235d55388941de380f72',1,'entt::basic_registry::assign()'],['../classentt_1_1meta__any.html#a022362d5bb8ee42e3637e3d64a22027a',1,'entt::meta_any::assign(const meta_any &other)'],['../classentt_1_1meta__any.html#a77e67e73023b213a5fe46f88820f571f',1,'entt::meta_any::assign(meta_any &&other)']]], + ['at_766',['at',['../classentt_1_1dense__map.html#a04ee0f865ad16834e845b786ac6d4aa6',1,'entt::dense_map::at(const key_type &key)'],['../classentt_1_1dense__map.html#a929310e2edc90ec0b810eea982a2dd2a',1,'entt::dense_map::at(const key_type &key) const'],['../classentt_1_1basic__sparse__set.html#aa0d4efaf22f43c1a8573e50c7460299a',1,'entt::basic_sparse_set::at()']]], + ['attach_767',['attach',['../classentt_1_1scheduler.html#aced8ede0331494ea80e2b19ac203cccc',1,'entt::scheduler::attach(Args &&...args)'],['../classentt_1_1scheduler.html#a871812d08af8483316d1ce5d1e9d686f',1,'entt::scheduler::attach(Func &&func)']]] ]; diff --git a/search/functions_1.js b/search/functions_1.js index 49fca27b3..14b60dc19 100644 --- a/search/functions_1.js +++ b/search/functions_1.js @@ -1,25 +1,27 @@ var searchData= [ - ['back_779',['back',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a078e09804683968e5829c09782bf6e8a',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a81c47aabb35b492703266db777de352f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3a9f8b8e1603a0f7eed43fb2428e142d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a308a495cd95cb8859ca80bcbd752417d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::back()']]], - ['base_780',['base',['../classentt_1_1meta__factory_3_01Type_01_4.html#a825c9621f778b0a1c8fffb16f4f1f1c7',1,'entt::meta_factory< Type >::base()'],['../classentt_1_1meta__type.html#a2fc2ba44275f28e28536867ac6c20e79',1,'entt::meta_type::base() const'],['../classentt_1_1meta__type.html#a3c85444a003cbd6ae1063563f4694af5',1,'entt::meta_type::base(const id_type id) const'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a1b25b042d4902929b3fb9be9c877749a',1,'entt::meta_sequence_container::meta_iterator::base()']]], - ['basic_5fany_781',['basic_any',['../classentt_1_1basic__any.html#aab031eb7bfb02eb4e6ca6b170e3a2335',1,'entt::basic_any::basic_any()'],['../classentt_1_1basic__any.html#a3a84c837c69ab23b08a535ab79f7eefa',1,'entt::basic_any::basic_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__any.html#afb1d00c509ae9127faa1cc2a5887bdab',1,'entt::basic_any::basic_any(Type &&value)'],['../classentt_1_1basic__any.html#a3196700b32252e5b59a79994b907afda',1,'entt::basic_any::basic_any(const basic_any &other)'],['../classentt_1_1basic__any.html#abf56dc5f3a8324c15b40bf6c2a800702',1,'entt::basic_any::basic_any(basic_any &&other)']]], - ['basic_5fcontinuous_5floader_782',['basic_continuous_loader',['../classentt_1_1basic__continuous__loader.html#aeb36501b43761b28eb7de311dbd080d8',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_registry< entity_type > &source)'],['../classentt_1_1basic__continuous__loader.html#a619f3aa278b405481fd1e26c46a96a5c',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_continuous_loader &&)=default']]], - ['basic_5fgroup_783',['basic_group',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a392e8d6bd37c21a5056c8935d273b261',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_group()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ae6509fc61bfb25482f93caa4336a1f3c',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_group()']]], - ['basic_5fhandle_784',['basic_handle',['../structentt_1_1basic__handle.html#ada86cadf8f425426e25e2a8712876137',1,'entt::basic_handle::basic_handle()'],['../structentt_1_1basic__handle.html#a9f88bf2f8fcb94b5ffe0f1290500004a',1,'entt::basic_handle::basic_handle(registry_type &ref, entity_type value)'],['../namespaceentt.html#a288ec07d4e87a28179d43b367ff11eab',1,'entt::basic_handle(basic_registry< Entity > &, Entity) -> basic_handle< Entity >'],['../namespaceentt.html#a6de052205bafd99d67afde880b67a4e8',1,'entt::basic_handle(const basic_registry< Entity > &, Entity) -> basic_handle< const Entity >']]], - ['basic_5fhashed_5fstring_785',['basic_hashed_string',['../classentt_1_1basic__hashed__string.html#aa8b2ea90ba4d1bbb98d485f6a93e574e',1,'entt::basic_hashed_string::basic_hashed_string()'],['../classentt_1_1basic__hashed__string.html#a0b0454a742c7556c805e79fc19b556dd',1,'entt::basic_hashed_string::basic_hashed_string(const value_type(&curr)[N])'],['../classentt_1_1basic__hashed__string.html#a564f57a39d02f5b94fa76a5ecf143299',1,'entt::basic_hashed_string::basic_hashed_string(const_wrapper wrapper)'],['../namespaceentt.html#aaa97361ef962166a4fc51a582d7c6392',1,'entt::basic_hashed_string()']]], - ['basic_5fobserver_786',['basic_observer',['../classentt_1_1basic__observer.html#abef3c847acf610f1a6f856b05f0f0721',1,'entt::basic_observer::basic_observer(basic_registry< entity_type > &reg, basic_collector< Matcher... >)'],['../classentt_1_1basic__observer.html#adfb08de0ef1c0f57fadc6f6d171b931a',1,'entt::basic_observer::basic_observer()'],['../classentt_1_1basic__observer.html#aa685204c94266b5631c13540012e73c2',1,'entt::basic_observer::basic_observer(const basic_observer &)=delete'],['../classentt_1_1basic__observer.html#accbe2546b1b74de1a59e673cb6250413',1,'entt::basic_observer::basic_observer(basic_observer &&)=delete']]], - ['basic_5fpoly_787',['basic_poly',['../classentt_1_1basic__poly.html#a809e0991b76093a22fd879a4ebff359b',1,'entt::basic_poly::basic_poly()'],['../classentt_1_1basic__poly.html#aed074839fc14e757f761d89606895062',1,'entt::basic_poly::basic_poly(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__poly.html#a75dc28220ce2957bbe011a2ee576e543',1,'entt::basic_poly::basic_poly(Type &&value)']]], - ['basic_5fregistry_788',['basic_registry',['../classentt_1_1basic__registry.html#a0998b4125d8d2c92817dccac31e7f652',1,'entt::basic_registry::basic_registry()=default'],['../classentt_1_1basic__registry.html#ad53e4667abee7aeeef32b38eb5d21ad9',1,'entt::basic_registry::basic_registry(basic_registry &&other)']]], - ['basic_5fruntime_5fview_789',['basic_runtime_view',['../classentt_1_1basic__runtime__view.html#a3cb0b77768ac723208825f6e3c3d3291',1,'entt::basic_runtime_view::basic_runtime_view()'],['../classentt_1_1basic__runtime__view.html#a44fc26564d30e281963feb2360d65f70',1,'entt::basic_runtime_view::basic_runtime_view(std::vector< const basic_common_type * > cpools, std::vector< const basic_common_type * > epools)']]], - ['basic_5fsnapshot_790',['basic_snapshot',['../classentt_1_1basic__snapshot.html#a953942494e3ee84f87cb515a86e4cfe6',1,'entt::basic_snapshot::basic_snapshot(const basic_registry< entity_type > &source)'],['../classentt_1_1basic__snapshot.html#a10f658d8e4feb7df9da8b48119551334',1,'entt::basic_snapshot::basic_snapshot(basic_snapshot &&)=default']]], - ['basic_5fsnapshot_5floader_791',['basic_snapshot_loader',['../classentt_1_1basic__snapshot__loader.html#acc078b2e9068ae41a2910168b40322d4',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_snapshot_loader &&)=default'],['../classentt_1_1basic__snapshot__loader.html#ac7bf5c8d48c665020c8689f14879db77',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_registry< entity_type > &source)']]], - ['basic_5fsparse_5fset_792',['basic_sparse_set',['../classentt_1_1basic__sparse__set.html#afc504894fc2c20ea25b7fc2864bd22e3',1,'entt::basic_sparse_set::basic_sparse_set()'],['../classentt_1_1basic__sparse__set.html#a1b636566df9e6f3f36ff62d2bdde8d10',1,'entt::basic_sparse_set::basic_sparse_set(const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html#a8e264ab5a7e2d97a204004d25b14238b',1,'entt::basic_sparse_set::basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})'],['../classentt_1_1basic__sparse__set.html#aba22aad9557f355b657798a1e2fd9aad',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other)'],['../classentt_1_1basic__sparse__set.html#a9d6e25d1435a6216c60b42babd64085d',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html#a437620052f5c5ff261715e607d6a0b35',1,'entt::basic_sparse_set::basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})']]], - ['basic_5fstorage_793',['basic_storage',['../classentt_1_1basic__storage.html#a40805deb39243c09f5b8c94b62edc660',1,'entt::basic_storage::basic_storage()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ac4d7718deec2da15c55675b3f8d8d450',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a001472f2d65c53dbd0291a45a072e3d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a356b2fa07fb7a7ec7a1d234c732d91f0',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other)=default'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1b28000a5097dab14b65d22e75e3b182',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other, const allocator_type &allocator)'],['../classentt_1_1basic__storage.html#ac46b0df21902a582df328c1b80c75cb3',1,'entt::basic_storage::basic_storage()'],['../classentt_1_1basic__storage.html#aaa785dc52f39f9133e42a854b6e7c20c',1,'entt::basic_storage::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage.html#a8723ddbf200fe151baf6dfcb613c7e31',1,'entt::basic_storage::basic_storage(basic_storage &&other)']]], - ['basic_5fview_794',['basic_view',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a56bd7a61d27ef592459bcfdf5e5a8c57',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view()'],['../namespaceentt.html#a270b9239b055bcfe25afa3fb32e1dba3',1,'entt::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2725bbe2abbf21fbee84e530ccbb3938',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af1773aa2167b270f1140591fd84e8693',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view(storage_type< Component > &...component, const storage_type< Exclude > &...epool)'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a825c412a2903dce44b76275f2666f03b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view()']]], - ['before_795',['before',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a82cb32b12a951b4b1422e77cd13f4cca',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#aa147ac46f6871211d42a9d8887fb0a9a',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afe942d584cacb2ba131f2f287327023b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ae997af819ce9812c266403fd409e3a1d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a8a19dea2601e173756c99baa691a2d4b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()']]], - ['begin_796',['begin',['../classentt_1_1dense__hash__map.html#ac688db11b9c3dddac4aad10271ae6690',1,'entt::dense_hash_map::begin()'],['../classentt_1_1dense__hash__set.html#a56b2ff2c25286572ff3dcef04058a1a7',1,'entt::dense_hash_set::begin() const'],['../classentt_1_1dense__hash__set.html#a5db70dadcea9f668933a92fa349f244e',1,'entt::dense_hash_set::begin()'],['../classentt_1_1dense__hash__set.html#a6dbb18630e7b941b5217df3b94495e03',1,'entt::dense_hash_set::begin(const size_type index) const'],['../classentt_1_1dense__hash__set.html#a737a1954acf41233fa9bbdca8a2d33ed',1,'entt::dense_hash_set::begin(const size_type index)'],['../structentt_1_1iterable__adaptor.html#a017dd4bccfd6777df24cf5beb4e2cc06',1,'entt::iterable_adaptor::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adc21572e734fd65ce2b36af82d745b79',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a73d4f29365d01949346944ee14948636',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__runtime__view.html#aa1d8a9b29404f27c02ff496fb52318ec',1,'entt::basic_runtime_view::begin()'],['../classentt_1_1basic__sparse__set.html#aa1527310d8e329776aa17f807387d6de',1,'entt::basic_sparse_set::begin()'],['../classentt_1_1basic__storage.html#a777bce46cd8db4bbdfbc21353ab062ce',1,'entt::basic_storage::begin() const'],['../classentt_1_1basic__storage.html#ac411762f98f026482ce332c6b1e4229a',1,'entt::basic_storage::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a64caf3a751520b3f0d6f2c0b04f7e34b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a68bbb84d9163371095cc4fd02941829e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::begin()'],['../classentt_1_1meta__sequence__container.html#ad4f618296f1ec7d7f5859713ecdf1695',1,'entt::meta_sequence_container::begin()'],['../classentt_1_1meta__associative__container.html#a86dcac50a81b30cd2720b3ac69318ada',1,'entt::meta_associative_container::begin()'],['../structentt_1_1meta__range.html#ada1265752a1413ea58af92dc80e6ac77',1,'entt::meta_range::begin()'],['../classentt_1_1basic__observer.html#a2067fca77f219bea0b5a341583a1544f',1,'entt::basic_observer::begin()'],['../classentt_1_1dense__hash__map.html#acde08ff80555a9f0853e570bd6d0052b',1,'entt::dense_hash_map::begin() const'],['../classentt_1_1dense__hash__map.html#ab3c5def2ac17358bb1067b7fc1ac3b15',1,'entt::dense_hash_map::begin()'],['../classentt_1_1dense__hash__map.html#a9911489c3547416e9e14dc4dd3c6d403',1,'entt::dense_hash_map::begin(const size_type index) const']]], - ['bind_797',['bind',['../classentt_1_1basic__sparse__set.html#a407121400cf9f3a843caf131f169b4f1',1,'entt::basic_sparse_set::bind()'],['../structentt_1_1meta__ctx.html#a822a19d8313d4e5df379d1f28b9914c5',1,'entt::meta_ctx::bind()'],['../classentt_1_1sigh__storage__mixin.html#a02b9de35ac5da422d251f147e5585874',1,'entt::sigh_storage_mixin::bind()']]], - ['bucket_798',['bucket',['../classentt_1_1dense__hash__set.html#a0e0f51ed5adc247aa09e756d665ee7f2',1,'entt::dense_hash_set::bucket()'],['../classentt_1_1dense__hash__map.html#a977645e15046ce2078be5b938ce27582',1,'entt::dense_hash_map::bucket(const key_type &key) const']]], - ['bucket_5fcount_799',['bucket_count',['../classentt_1_1dense__hash__map.html#ab9c69d954cc0944821fa63dfda5119a3',1,'entt::dense_hash_map::bucket_count()'],['../classentt_1_1dense__hash__set.html#a5c728c7d5428ba82457403dc5b0fffdf',1,'entt::dense_hash_set::bucket_count()']]], - ['bucket_5fsize_800',['bucket_size',['../classentt_1_1dense__hash__map.html#a55abb2a650ef1a0fd193012343221b16',1,'entt::dense_hash_map::bucket_size()'],['../classentt_1_1dense__hash__set.html#a970a59307536b28048f8445dd2a7f0c5',1,'entt::dense_hash_set::bucket_size()']]] + ['back_768',['back',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a078e09804683968e5829c09782bf6e8a',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a81c47aabb35b492703266db777de352f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3a9f8b8e1603a0f7eed43fb2428e142d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::back()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a308a495cd95cb8859ca80bcbd752417d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::back()']]], + ['base_769',['base',['../classentt_1_1meta__factory_3_01Type_01_4.html#a825c9621f778b0a1c8fffb16f4f1f1c7',1,'entt::meta_factory< Type >::base()'],['../classentt_1_1meta__type.html#a2fc2ba44275f28e28536867ac6c20e79',1,'entt::meta_type::base() const'],['../classentt_1_1meta__type.html#a3c85444a003cbd6ae1063563f4694af5',1,'entt::meta_type::base(const id_type id) const']]], + ['basic_5fany_770',['basic_any',['../classentt_1_1basic__any.html#aa0d7f14d3ce9be8148ce8b32e95bad4e',1,'entt::basic_any::basic_any()'],['../classentt_1_1basic__any.html#a3a84c837c69ab23b08a535ab79f7eefa',1,'entt::basic_any::basic_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__any.html#afb1d00c509ae9127faa1cc2a5887bdab',1,'entt::basic_any::basic_any(Type &&value)'],['../classentt_1_1basic__any.html#a3196700b32252e5b59a79994b907afda',1,'entt::basic_any::basic_any(const basic_any &other)'],['../classentt_1_1basic__any.html#abf56dc5f3a8324c15b40bf6c2a800702',1,'entt::basic_any::basic_any(basic_any &&other)']]], + ['basic_5fcontinuous_5floader_771',['basic_continuous_loader',['../classentt_1_1basic__continuous__loader.html#aeb36501b43761b28eb7de311dbd080d8',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_registry< entity_type > &source)'],['../classentt_1_1basic__continuous__loader.html#a619f3aa278b405481fd1e26c46a96a5c',1,'entt::basic_continuous_loader::basic_continuous_loader(basic_continuous_loader &&)=default']]], + ['basic_5fdispatcher_772',['basic_dispatcher',['../classentt_1_1basic__dispatcher.html#ad479b016e5261d80b30c25a540cc4fbd',1,'entt::basic_dispatcher::basic_dispatcher()'],['../classentt_1_1basic__dispatcher.html#ad9f651ee2a41ecf134790e203d4f3654',1,'entt::basic_dispatcher::basic_dispatcher(const allocator_type &allocator)'],['../classentt_1_1basic__dispatcher.html#ad555d3076719c1981865f82638604260',1,'entt::basic_dispatcher::basic_dispatcher(basic_dispatcher &&other)'],['../classentt_1_1basic__dispatcher.html#a30ee1d0e53506ccde1d3f5411411380c',1,'entt::basic_dispatcher::basic_dispatcher(basic_dispatcher &&other, const allocator_type &allocator)']]], + ['basic_5fgroup_773',['basic_group',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a392e8d6bd37c21a5056c8935d273b261',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_group()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ae6509fc61bfb25482f93caa4336a1f3c',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_group()']]], + ['basic_5fhandle_774',['basic_handle',['../structentt_1_1basic__handle.html#ada86cadf8f425426e25e2a8712876137',1,'entt::basic_handle::basic_handle()'],['../structentt_1_1basic__handle.html#a9f88bf2f8fcb94b5ffe0f1290500004a',1,'entt::basic_handle::basic_handle(registry_type &ref, entity_type value)'],['../namespaceentt.html#a288ec07d4e87a28179d43b367ff11eab',1,'entt::basic_handle(basic_registry< Entity > &, Entity) -> basic_handle< Entity >'],['../namespaceentt.html#a6de052205bafd99d67afde880b67a4e8',1,'entt::basic_handle(const basic_registry< Entity > &, Entity) -> basic_handle< const Entity >']]], + ['basic_5fhashed_5fstring_775',['basic_hashed_string',['../classentt_1_1basic__hashed__string.html#aec8acecd9af1c36f4a2edc44f3eeeb0b',1,'entt::basic_hashed_string::basic_hashed_string(const value_type(&str)[N])'],['../classentt_1_1basic__hashed__string.html#a564f57a39d02f5b94fa76a5ecf143299',1,'entt::basic_hashed_string::basic_hashed_string(const_wrapper wrapper)'],['../namespaceentt.html#aaa97361ef962166a4fc51a582d7c6392',1,'entt::basic_hashed_string()'],['../classentt_1_1basic__hashed__string.html#aa8b2ea90ba4d1bbb98d485f6a93e574e',1,'entt::basic_hashed_string::basic_hashed_string()'],['../classentt_1_1basic__hashed__string.html#a980863db27ae60a5f6b1a883784ee935',1,'entt::basic_hashed_string::basic_hashed_string(const value_type *str, const size_type len)'],['../namespaceentt.html#a2238bd6227a1ee3da75a6d4d224c589e',1,'entt::basic_hashed_string()']]], + ['basic_5fobserver_776',['basic_observer',['../classentt_1_1basic__observer.html#adfb08de0ef1c0f57fadc6f6d171b931a',1,'entt::basic_observer::basic_observer()'],['../classentt_1_1basic__observer.html#aa685204c94266b5631c13540012e73c2',1,'entt::basic_observer::basic_observer(const basic_observer &)=delete'],['../classentt_1_1basic__observer.html#accbe2546b1b74de1a59e673cb6250413',1,'entt::basic_observer::basic_observer(basic_observer &&)=delete'],['../classentt_1_1basic__observer.html#abef3c847acf610f1a6f856b05f0f0721',1,'entt::basic_observer::basic_observer(basic_registry< entity_type > &reg, basic_collector< Matcher... >)']]], + ['basic_5fpoly_777',['basic_poly',['../classentt_1_1basic__poly.html#a809e0991b76093a22fd879a4ebff359b',1,'entt::basic_poly::basic_poly()'],['../classentt_1_1basic__poly.html#aed074839fc14e757f761d89606895062',1,'entt::basic_poly::basic_poly(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1basic__poly.html#a75dc28220ce2957bbe011a2ee576e543',1,'entt::basic_poly::basic_poly(Type &&value)']]], + ['basic_5fregistry_778',['basic_registry',['../classentt_1_1basic__registry.html#a84e8bba7010be819fd6d7fc4e1a6d22f',1,'entt::basic_registry::basic_registry()'],['../classentt_1_1basic__registry.html#a4bd283e261a9c61a100e660041ddb1a2',1,'entt::basic_registry::basic_registry(const size_type count)'],['../classentt_1_1basic__registry.html#ad53e4667abee7aeeef32b38eb5d21ad9',1,'entt::basic_registry::basic_registry(basic_registry &&other)']]], + ['basic_5fruntime_5fview_779',['basic_runtime_view',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a77263744bccee7de1fb10b7915d4bda5',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >']]], + ['basic_5fsnapshot_780',['basic_snapshot',['../classentt_1_1basic__snapshot.html#a953942494e3ee84f87cb515a86e4cfe6',1,'entt::basic_snapshot::basic_snapshot(const basic_registry< entity_type > &source)'],['../classentt_1_1basic__snapshot.html#a10f658d8e4feb7df9da8b48119551334',1,'entt::basic_snapshot::basic_snapshot(basic_snapshot &&)=default']]], + ['basic_5fsnapshot_5floader_781',['basic_snapshot_loader',['../classentt_1_1basic__snapshot__loader.html#ac7bf5c8d48c665020c8689f14879db77',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_registry< entity_type > &source)'],['../classentt_1_1basic__snapshot__loader.html#acc078b2e9068ae41a2910168b40322d4',1,'entt::basic_snapshot_loader::basic_snapshot_loader(basic_snapshot_loader &&)=default']]], + ['basic_5fsparse_5fset_782',['basic_sparse_set',['../classentt_1_1basic__sparse__set.html#afc504894fc2c20ea25b7fc2864bd22e3',1,'entt::basic_sparse_set::basic_sparse_set()'],['../classentt_1_1basic__sparse__set.html#a1b636566df9e6f3f36ff62d2bdde8d10',1,'entt::basic_sparse_set::basic_sparse_set(const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html#a8e264ab5a7e2d97a204004d25b14238b',1,'entt::basic_sparse_set::basic_sparse_set(deletion_policy pol, const allocator_type &allocator={})'],['../classentt_1_1basic__sparse__set.html#aba22aad9557f355b657798a1e2fd9aad',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other)'],['../classentt_1_1basic__sparse__set.html#a9d6e25d1435a6216c60b42babd64085d',1,'entt::basic_sparse_set::basic_sparse_set(basic_sparse_set &&other, const allocator_type &allocator)'],['../classentt_1_1basic__sparse__set.html#a437620052f5c5ff261715e607d6a0b35',1,'entt::basic_sparse_set::basic_sparse_set(const type_info &value, deletion_policy pol=deletion_policy::swap_and_pop, const allocator_type &allocator={})']]], + ['basic_5fstorage_783',['basic_storage',['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ac4d7718deec2da15c55675b3f8d8d450',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a001472f2d65c53dbd0291a45a072e3d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a356b2fa07fb7a7ec7a1d234c732d91f0',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other)=default'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1b28000a5097dab14b65d22e75e3b182',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::basic_storage(basic_storage &&other, const allocator_type &allocator)'],['../classentt_1_1basic__storage.html#ac46b0df21902a582df328c1b80c75cb3',1,'entt::basic_storage::basic_storage()'],['../classentt_1_1basic__storage.html#aaa785dc52f39f9133e42a854b6e7c20c',1,'entt::basic_storage::basic_storage(const allocator_type &allocator)'],['../classentt_1_1basic__storage.html#a8723ddbf200fe151baf6dfcb613c7e31',1,'entt::basic_storage::basic_storage(basic_storage &&other)'],['../classentt_1_1basic__storage.html#a40805deb39243c09f5b8c94b62edc660',1,'entt::basic_storage::basic_storage(basic_storage &&other, const allocator_type &allocator)']]], + ['basic_5fview_784',['basic_view',['../namespaceentt.html#a270b9239b055bcfe25afa3fb32e1dba3',1,'entt::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2725bbe2abbf21fbee84e530ccbb3938',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af1773aa2167b270f1140591fd84e8693',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::basic_view(storage_type< Component > &...component, const storage_type< Exclude > &...epool)'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a825c412a2903dce44b76275f2666f03b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a56bd7a61d27ef592459bcfdf5e5a8c57',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::basic_view(storage_type &ref)']]], + ['before_785',['before',['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a82cb32b12a951b4b1422e77cd13f4cca',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#aa147ac46f6871211d42a9d8887fb0a9a',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afe942d584cacb2ba131f2f287327023b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type &value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ae997af819ce9812c266403fd409e3a1d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a8a19dea2601e173756c99baa691a2d4b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::before()']]], + ['begin_786',['begin',['../classentt_1_1dense__set.html#ac5b37f68aef0b6dc51f7ea65bb34c130',1,'entt::dense_set::begin() const'],['../classentt_1_1dense__set.html#aff20ae4c1f02dc6955f16e00890baa2f',1,'entt::dense_set::begin()'],['../classentt_1_1dense__set.html#af40a2a303dddc229bce36516d18921d5',1,'entt::dense_set::begin(const size_type index) const'],['../classentt_1_1dense__set.html#af5dfa9caba33563b1678e85d2774609c',1,'entt::dense_set::begin(const size_type index)'],['../structentt_1_1iterable__adaptor.html#a24f0c0139b40ae81a191b8330b221004',1,'entt::iterable_adaptor::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adc21572e734fd65ce2b36af82d745b79',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a73d4f29365d01949346944ee14948636',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__observer.html#a2067fca77f219bea0b5a341583a1544f',1,'entt::basic_observer::begin()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a52e9897a4ac2c0ad21df7742a5b10b92',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::begin()'],['../classentt_1_1basic__storage.html#a777bce46cd8db4bbdfbc21353ab062ce',1,'entt::basic_storage::begin() const'],['../classentt_1_1basic__storage.html#ac411762f98f026482ce332c6b1e4229a',1,'entt::basic_storage::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a64caf3a751520b3f0d6f2c0b04f7e34b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::begin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a68bbb84d9163371095cc4fd02941829e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::begin()'],['../classentt_1_1meta__sequence__container.html#ad4f618296f1ec7d7f5859713ecdf1695',1,'entt::meta_sequence_container::begin()'],['../classentt_1_1meta__associative__container.html#a86dcac50a81b30cd2720b3ac69318ada',1,'entt::meta_associative_container::begin()'],['../structentt_1_1meta__range.html#ada1265752a1413ea58af92dc80e6ac77',1,'entt::meta_range::begin()'],['../classentt_1_1resource__cache.html#a4a09c477294cbe8e4ed7664404633e3b',1,'entt::resource_cache::begin() const'],['../classentt_1_1resource__cache.html#acd993aefd78f8e80d413c3343bb61900',1,'entt::resource_cache::begin()'],['../classentt_1_1basic__sparse__set.html#aa1527310d8e329776aa17f807387d6de',1,'entt::basic_sparse_set::begin()'],['../classentt_1_1dense__map.html#a1e7f45435b51480254f3df29443c0437',1,'entt::dense_map::begin() const'],['../classentt_1_1dense__map.html#a4e3cb06e2db3126bae58264615864ca7',1,'entt::dense_map::begin()'],['../classentt_1_1dense__map.html#a33900c670781f415f4eb0bfeb5be04a3',1,'entt::dense_map::begin(const size_type index) const'],['../classentt_1_1dense__map.html#a4b71476135fb7147c02ec7a801564c72',1,'entt::dense_map::begin(const size_type index)']]], + ['bind_787',['bind',['../classentt_1_1basic__sparse__set.html#a407121400cf9f3a843caf131f169b4f1',1,'entt::basic_sparse_set::bind()'],['../classentt_1_1sigh__storage__mixin.html#a02b9de35ac5da422d251f147e5585874',1,'entt::sigh_storage_mixin::bind()'],['../structentt_1_1meta__ctx.html#a822a19d8313d4e5df379d1f28b9914c5',1,'entt::meta_ctx::bind()']]], + ['bucket_788',['bucket',['../classentt_1_1dense__set.html#a36a7137bfb36d2ca5026d986710cc05a',1,'entt::dense_set::bucket()'],['../classentt_1_1dense__map.html#a9a591d419dd5649e52907a3032f8c0b8',1,'entt::dense_map::bucket(const key_type &key) const']]], + ['bucket_5fcount_789',['bucket_count',['../classentt_1_1dense__map.html#aee246b41534137f279a11eb5e225a6e5',1,'entt::dense_map::bucket_count()'],['../classentt_1_1dense__set.html#a4ad74d3386c317d8aa2f9a2c88f410e4',1,'entt::dense_set::bucket_count()']]], + ['bucket_5fsize_790',['bucket_size',['../classentt_1_1dense__map.html#ae094f65cda09d80851306f6a4bba7b50',1,'entt::dense_map::bucket_size()'],['../classentt_1_1dense__set.html#a001d564dcf11933f59592f15709830d0',1,'entt::dense_set::bucket_size()']]], + ['bump_791',['bump',['../classentt_1_1basic__sparse__set.html#adde9ce48f5ac80b0e79927306ce62937',1,'entt::basic_sparse_set']]] ]; diff --git a/search/functions_10.js b/search/functions_10.js index 5a75f9597..c12188b42 100644 --- a/search/functions_10.js +++ b/search/functions_10.js @@ -1,25 +1,22 @@ var searchData= [ - ['scheduler_999',['scheduler',['../classentt_1_1scheduler.html#a49a81e662dc26831f4a951a715705d6e',1,'entt::scheduler::scheduler()=default'],['../classentt_1_1scheduler.html#af582ffea72368a83ea4dd7d9e563f715',1,'entt::scheduler::scheduler(scheduler &&)=default']]], - ['scoped_5fconnection_1000',['scoped_connection',['../structentt_1_1scoped__connection.html#a5675cd808dd54a6d9546037d282d3c6c',1,'entt::scoped_connection::scoped_connection()=default'],['../structentt_1_1scoped__connection.html#ab3c50842fea4014f8bf2e51ce4cfbc8a',1,'entt::scoped_connection::scoped_connection(const connection &other)'],['../structentt_1_1scoped__connection.html#ad52da49cdabbfe1a4aada361f48fb9be',1,'entt::scoped_connection::scoped_connection(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#a82b3c022128eada5c6be2c5fc7d4bd2b',1,'entt::scoped_connection::scoped_connection(scoped_connection &&other)']]], - ['second_1001',['second',['../classentt_1_1compressed__pair.html#a73cc7edd96358313d81fe92736467d3f',1,'entt::compressed_pair::second()'],['../classentt_1_1compressed__pair.html#a68d93c20d07b5f9badaf100193e2df52',1,'entt::compressed_pair::second() const']]], - ['service_5flocator_1002',['service_locator',['../structentt_1_1service__locator.html#a120cdb3eb1d820e5649f3d8bac8098d0',1,'entt::service_locator']]], - ['set_1003',['set',['../classentt_1_1basic__registry.html#a9f04ea21a04ad05937274de518da705f',1,'entt::basic_registry::set()'],['../structentt_1_1service__locator.html#a1cab7cf8cff562d6ec95b7aaeaf12366',1,'entt::service_locator::set(Args &&...args)'],['../structentt_1_1service__locator.html#a86770e79d01ab5fb0dddffba0bf9a697',1,'entt::service_locator::set(std::shared_ptr< Service > ptr)'],['../classentt_1_1meta__any.html#aa82e0c3e29683d99cc611618d101488b',1,'entt::meta_any::set()'],['../structentt_1_1meta__data.html#a9cec301b83378b11ad316663e8ece835',1,'entt::meta_data::set()'],['../classentt_1_1meta__type.html#a708bdf89918c3fdf2b3539454201f1e9',1,'entt::meta_type::set()']]], - ['shrink_1004',['shrink',['../classentt_1_1basic__continuous__loader.html#a01b949f4a5829bd5bf3738a7e0f776d2',1,'entt::basic_continuous_loader']]], - ['shrink_5fto_5ffit_1005',['shrink_to_fit',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a5b73b008214eee8f3692507ff8b8b7e4',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::shrink_to_fit()'],['../classentt_1_1basic__sparse__set.html#a7e10cc6ddc7ef9c733aabdec849c5b79',1,'entt::basic_sparse_set::shrink_to_fit()'],['../classentt_1_1basic__storage.html#a0d791d4bb0c1e9c0c97bd7f9cfd33af9',1,'entt::basic_storage::shrink_to_fit()']]], - ['sigh_1006',['sigh',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0118cc119e2d90dc667fe44916c560a7',1,'entt::sigh< Ret(Args...), Allocator >::sigh()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af800c7e4bafa5739172f5f4190a2fb81',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a3d281bf1e8e9aebc3b21f1b76412664f',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#adbcac376ce96c2750282754724f3d418',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other, const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a4d7a26fc9e4d8d94503f99b4c91dcc78',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a5c257082ad2bbbd6134012360a0c7373',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other, const allocator_type &allocator)']]], - ['sink_1007',['sink',['../classentt_1_1dispatcher.html#a0fd52abaeed110ec526918c255f6fcfa',1,'entt::dispatcher::sink()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a118455f8748e70c2e3a6e78ffd1f7175',1,'entt::sink< sigh< Ret(Args...), Allocator > >::sink()'],['../namespaceentt.html#aba4dd70afb5ef2529d05bc474b234f53',1,'entt::sink()']]], - ['size_1008',['size',['../classentt_1_1dense__hash__set.html#a7fb84bd3b74213d0a9c6ce1329c92327',1,'entt::dense_hash_set::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4b4a17bece15f2cf4507610d92cb0d15',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5946d6c8e4129956d3a7ec77ab26a427',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__observer.html#aae9024a8c5b14adfe90690a56fa09935',1,'entt::basic_observer::size()'],['../classentt_1_1basic__registry.html#a5b056608b1723b73a001e20d2f2592bc',1,'entt::basic_registry::size()'],['../classentt_1_1basic__sparse__set.html#a781b6cee81c02b5dd601d0c808cf97a8',1,'entt::basic_sparse_set::size()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a799bc0f08f63bbeac5154f22431db1e9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size()'],['../classentt_1_1meta__sequence__container.html#ab8e77ced086e11a170953992af5fbebf',1,'entt::meta_sequence_container::size()'],['../classentt_1_1meta__associative__container.html#ae7bf0859ac226d818a58cd6181915032',1,'entt::meta_associative_container::size()'],['../classentt_1_1scheduler.html#a137d1d00e30f8840051adb5002a69bc5',1,'entt::scheduler::size()'],['../classentt_1_1resource__cache.html#a90f4014d42bf22b536f720706a96d76d',1,'entt::resource_cache::size()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a6d3b17d4e20d0c478cee768dfa4d57b6',1,'entt::sigh< Ret(Args...), Allocator >::size()'],['../classentt_1_1dense__hash__map.html#a6d119cf64191efa39b949e37905e2d02',1,'entt::dense_hash_map::size()']]], - ['size_5fhint_1009',['size_hint',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ae8c282c644bd62bbd3838688b816b807',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_hint()'],['../classentt_1_1basic__runtime__view.html#afc03b5d755f01f2417beadca306a30f7',1,'entt::basic_runtime_view::size_hint()']]], - ['size_5fof_1010',['size_of',['../classentt_1_1meta__type.html#a611f49dda24012f0a1c3eda4c2022501',1,'entt::meta_type']]], - ['slot_1011',['slot',['../classentt_1_1basic__sparse__set.html#a3cfe17211583fcac905a462dbe2d1c09',1,'entt::basic_sparse_set']]], - ['sort_1012',['sort',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a982161711bb437ea1014b875e4f00422',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort(Compare compare, Sort algo=Sort{}, Args &&...args)'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac69a43f81a8089909591f3739f93b760',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad3428f8d0a65d65365fa26ead2bb727d',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::sort()'],['../classentt_1_1basic__registry.html#a413fa9d1dbe15b8043358ea9cdba6ba1',1,'entt::basic_registry::sort(Compare compare, Sort algo=Sort{}, Args &&...args)'],['../classentt_1_1basic__registry.html#a2907f89b80fb692b16727e5e67a91c5d',1,'entt::basic_registry::sort()'],['../classentt_1_1basic__sparse__set.html#ae7ceed81905adc0d65291eb9f4072f08',1,'entt::basic_sparse_set::sort(Compare compare, Sort algo=Sort{}, Args &&...args)']]], - ['sort_5fn_1013',['sort_n',['../classentt_1_1basic__sparse__set.html#a43c1c0aa0fa525e12cee0791cd945915',1,'entt::basic_sparse_set']]], - ['sortable_1014',['sortable',['../classentt_1_1basic__registry.html#a5f7af56d6b9fca94a6ebd6ab13896b27',1,'entt::basic_registry::sortable() const'],['../classentt_1_1basic__registry.html#a965ab1b09f078e4494ebc3962d16e0bb',1,'entt::basic_registry::sortable(const basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)']]], - ['storage_1015',['storage',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__registry.html#a9cce13121f0ba615c290a48dedff53ad',1,'entt::basic_registry::storage()'],['../classentt_1_1basic__registry.html#a71b8b9cf2ceccd12bdb84fc92349f85a',1,'entt::basic_registry::storage() const'],['../classentt_1_1basic__registry.html#a9d4824660a8fcee9362b39e2de46e8ce',1,'entt::basic_registry::storage(const id_type id=type_hash< Component >::value())'],['../classentt_1_1basic__registry.html#adbb78123b695ad38d8e6d120cc8908b1',1,'entt::basic_registry::storage(const id_type id=type_hash< Component >::value()) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage()']]], - ['succeed_1016',['succeed',['../classentt_1_1process.html#a3b71fd166a1e6b42ea76f2e92bfa5edc',1,'entt::process']]], - ['swap_1017',['swap',['../classentt_1_1dense__hash__map.html#a7ef165b4b927086e73f200d288a11923',1,'entt::dense_hash_map::swap()'],['../classentt_1_1dense__hash__set.html#a04d35e41cb0d2ff7254d644bc81a2011',1,'entt::dense_hash_set::swap()'],['../classentt_1_1compressed__pair.html#a1f153123bcde4947f020ea2459d76e45',1,'entt::compressed_pair::swap()'],['../classentt_1_1basic__sparse__set.html#a0ba4866849ffb525cce7b4eee58b83a8',1,'entt::basic_sparse_set::swap()'],['../classentt_1_1basic__storage.html#ac4b412a6f425771044b2c903afe97235',1,'entt::basic_storage::swap()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa9fba3d3d4e6be85493982011d9f6d46',1,'entt::sigh< Ret(Args...), Allocator >::swap()'],['../namespaceentt.html#aef08fc4202f32f712bde26f55db463cb',1,'entt::swap()']]], - ['swap_5fand_5fpop_1018',['swap_and_pop',['../classentt_1_1basic__sparse__set.html#a40f3640062e18305e4fc7742f4f4c284',1,'entt::basic_sparse_set::swap_and_pop()'],['../classentt_1_1basic__storage.html#a66082b2fd40d10d749e99bc1b8144db8',1,'entt::basic_storage::swap_and_pop()']]], - ['swap_5fat_1019',['swap_at',['../classentt_1_1basic__sparse__set.html#a7839ecd024cf400c2d5e8d22c8cff05f',1,'entt::basic_sparse_set::swap_at()'],['../classentt_1_1basic__storage.html#a4d761b7d0e922003761366ff46f01cec',1,'entt::basic_storage::swap_at()']]], - ['swap_5felements_1020',['swap_elements',['../classentt_1_1basic__sparse__set.html#a2b82af720eca37261f3230c654d7fe1f',1,'entt::basic_sparse_set']]] + ['scheduler_989',['scheduler',['../classentt_1_1scheduler.html#a49a81e662dc26831f4a951a715705d6e',1,'entt::scheduler::scheduler()=default'],['../classentt_1_1scheduler.html#af582ffea72368a83ea4dd7d9e563f715',1,'entt::scheduler::scheduler(scheduler &&)=default']]], + ['scoped_5fconnection_990',['scoped_connection',['../structentt_1_1scoped__connection.html#a5675cd808dd54a6d9546037d282d3c6c',1,'entt::scoped_connection::scoped_connection()=default'],['../structentt_1_1scoped__connection.html#ab3c50842fea4014f8bf2e51ce4cfbc8a',1,'entt::scoped_connection::scoped_connection(const connection &other)'],['../structentt_1_1scoped__connection.html#ad52da49cdabbfe1a4aada361f48fb9be',1,'entt::scoped_connection::scoped_connection(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#a82b3c022128eada5c6be2c5fc7d4bd2b',1,'entt::scoped_connection::scoped_connection(scoped_connection &&other)']]], + ['second_991',['second',['../classentt_1_1compressed__pair.html#a73cc7edd96358313d81fe92736467d3f',1,'entt::compressed_pair::second()'],['../classentt_1_1compressed__pair.html#a68d93c20d07b5f9badaf100193e2df52',1,'entt::compressed_pair::second() const']]], + ['set_992',['set',['../classentt_1_1meta__any.html#aa82e0c3e29683d99cc611618d101488b',1,'entt::meta_any::set()'],['../structentt_1_1meta__data.html#a9cec301b83378b11ad316663e8ece835',1,'entt::meta_data::set()'],['../classentt_1_1meta__type.html#a708bdf89918c3fdf2b3539454201f1e9',1,'entt::meta_type::set()']]], + ['shrink_993',['shrink',['../classentt_1_1basic__continuous__loader.html#a01b949f4a5829bd5bf3738a7e0f776d2',1,'entt::basic_continuous_loader']]], + ['shrink_5fto_5ffit_994',['shrink_to_fit',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a5b73b008214eee8f3692507ff8b8b7e4',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::shrink_to_fit()'],['../classentt_1_1basic__sparse__set.html#a7e10cc6ddc7ef9c733aabdec849c5b79',1,'entt::basic_sparse_set::shrink_to_fit()'],['../classentt_1_1basic__storage.html#a0d791d4bb0c1e9c0c97bd7f9cfd33af9',1,'entt::basic_storage::shrink_to_fit()']]], + ['sigh_995',['sigh',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0118cc119e2d90dc667fe44916c560a7',1,'entt::sigh< Ret(Args...), Allocator >::sigh()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af800c7e4bafa5739172f5f4190a2fb81',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a3d281bf1e8e9aebc3b21f1b76412664f',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#adbcac376ce96c2750282754724f3d418',1,'entt::sigh< Ret(Args...), Allocator >::sigh(const sigh &other, const allocator_type &allocator)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a4d7a26fc9e4d8d94503f99b4c91dcc78',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a5c257082ad2bbbd6134012360a0c7373',1,'entt::sigh< Ret(Args...), Allocator >::sigh(sigh &&other, const allocator_type &allocator)']]], + ['sink_996',['sink',['../classentt_1_1basic__dispatcher.html#a5612937de61684689e71ba7039913820',1,'entt::basic_dispatcher::sink()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a118455f8748e70c2e3a6e78ffd1f7175',1,'entt::sink< sigh< Ret(Args...), Allocator > >::sink()'],['../namespaceentt.html#aba4dd70afb5ef2529d05bc474b234f53',1,'entt::sink()']]], + ['size_997',['size',['../classentt_1_1dense__set.html#a03fcb636493dcf1d4e417eba8e8976e9',1,'entt::dense_set::size()'],['../classentt_1_1basic__hashed__string.html#a78d52d39edf529df2225bd0b695e42d5',1,'entt::basic_hashed_string::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4b4a17bece15f2cf4507610d92cb0d15',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5946d6c8e4129956d3a7ec77ab26a427',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size()'],['../classentt_1_1basic__observer.html#aae9024a8c5b14adfe90690a56fa09935',1,'entt::basic_observer::size()'],['../classentt_1_1basic__registry.html#a5b056608b1723b73a001e20d2f2592bc',1,'entt::basic_registry::size()'],['../classentt_1_1basic__sparse__set.html#a781b6cee81c02b5dd601d0c808cf97a8',1,'entt::basic_sparse_set::size()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a799bc0f08f63bbeac5154f22431db1e9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size()'],['../classentt_1_1meta__sequence__container.html#ab8e77ced086e11a170953992af5fbebf',1,'entt::meta_sequence_container::size()'],['../classentt_1_1meta__associative__container.html#ae7bf0859ac226d818a58cd6181915032',1,'entt::meta_associative_container::size()'],['../classentt_1_1scheduler.html#a137d1d00e30f8840051adb5002a69bc5',1,'entt::scheduler::size()'],['../classentt_1_1resource__cache.html#a63a0563cb6c49f1651f9d92832206ddf',1,'entt::resource_cache::size()'],['../classentt_1_1basic__dispatcher.html#a4e283dfc3896a2cdd4d89de24c293637',1,'entt::basic_dispatcher::size(const id_type id=type_hash< Event >::value()) const'],['../classentt_1_1basic__dispatcher.html#a11d69f559e877f65beb4dd23ea975fb0',1,'entt::basic_dispatcher::size() const'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a6d3b17d4e20d0c478cee768dfa4d57b6',1,'entt::sigh< Ret(Args...), Allocator >::size()'],['../classentt_1_1dense__map.html#afeca346dc4e81401d0beb3e3387d8596',1,'entt::dense_map::size()']]], + ['size_5fhint_998',['size_hint',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ae8c282c644bd62bbd3838688b816b807',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_hint()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a89fa897d13f068d50907936ff66d9a52',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::size_hint()']]], + ['size_5fof_999',['size_of',['../classentt_1_1meta__type.html#a611f49dda24012f0a1c3eda4c2022501',1,'entt::meta_type']]], + ['sort_1000',['sort',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a982161711bb437ea1014b875e4f00422',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort(Compare compare, Sort algo=Sort{}, Args &&...args)'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac69a43f81a8089909591f3739f93b760',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::sort() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad3428f8d0a65d65365fa26ead2bb727d',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::sort()'],['../classentt_1_1basic__registry.html#a413fa9d1dbe15b8043358ea9cdba6ba1',1,'entt::basic_registry::sort(Compare compare, Sort algo=Sort{}, Args &&...args)'],['../classentt_1_1basic__registry.html#a2907f89b80fb692b16727e5e67a91c5d',1,'entt::basic_registry::sort()'],['../classentt_1_1basic__sparse__set.html#ae7ceed81905adc0d65291eb9f4072f08',1,'entt::basic_sparse_set::sort(Compare compare, Sort algo=Sort{}, Args &&...args)']]], + ['sort_5fn_1001',['sort_n',['../classentt_1_1basic__sparse__set.html#a43c1c0aa0fa525e12cee0791cd945915',1,'entt::basic_sparse_set']]], + ['sortable_1002',['sortable',['../classentt_1_1basic__registry.html#a0fcde0f4f2fd0d1cd6fef0c0078acdbc',1,'entt::basic_registry']]], + ['storage_1003',['storage',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2c7a70f488590b07ac39508977936d8e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__registry.html#a9cce13121f0ba615c290a48dedff53ad',1,'entt::basic_registry::storage()'],['../classentt_1_1basic__registry.html#a71b8b9cf2ceccd12bdb84fc92349f85a',1,'entt::basic_registry::storage() const'],['../classentt_1_1basic__registry.html#a0c75448b09c552a37cae70467269b1e0',1,'entt::basic_registry::storage(const id_type id)'],['../classentt_1_1basic__registry.html#a808539348487eb249d64c8cdf7f0ada5',1,'entt::basic_registry::storage(const id_type id) const'],['../classentt_1_1basic__registry.html#a9ab204daf6990895532e5c25cd2880f3',1,'entt::basic_registry::storage(const id_type id=type_hash< std::remove_const_t< Component >>::value())'],['../classentt_1_1basic__registry.html#a39c7df751ab95f4023afc32cd99798cc',1,'entt::basic_registry::storage(const id_type id=type_hash< std::remove_const_t< Component >>::value()) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#af6d0a5b3295d54ceb15cbb4170df9820',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#abe0214f2ff037157e39711c5abc7616f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::storage() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a6708124b0023cd5699701258863ceb3e',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::storage()']]], + ['succeed_1004',['succeed',['../classentt_1_1process.html#a3b71fd166a1e6b42ea76f2e92bfa5edc',1,'entt::process']]], + ['swap_1005',['swap',['../classentt_1_1dense__map.html#ab88e2ffe045acc9aef1de4f77a23449b',1,'entt::dense_map::swap()'],['../classentt_1_1dense__set.html#a3eec96c16a044c4e687639177121e899',1,'entt::dense_set::swap()'],['../classentt_1_1compressed__pair.html#a1f153123bcde4947f020ea2459d76e45',1,'entt::compressed_pair::swap()'],['../classentt_1_1basic__sparse__set.html#a0ba4866849ffb525cce7b4eee58b83a8',1,'entt::basic_sparse_set::swap()'],['../classentt_1_1basic__storage.html#ac4b412a6f425771044b2c903afe97235',1,'entt::basic_storage::swap()'],['../classentt_1_1basic__dispatcher.html#a0588bf4eef21b89fc716ab7c0ad8ce01',1,'entt::basic_dispatcher::swap()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa9fba3d3d4e6be85493982011d9f6d46',1,'entt::sigh< Ret(Args...), Allocator >::swap()'],['../namespaceentt.html#aef08fc4202f32f712bde26f55db463cb',1,'entt::swap()']]], + ['swap_5fand_5fpop_1006',['swap_and_pop',['../classentt_1_1basic__sparse__set.html#a80b3de1b97d44ff6e9b2d4557da138c6',1,'entt::basic_sparse_set::swap_and_pop()'],['../classentt_1_1basic__storage.html#ae2f157f3fd68a192db771d06aee12bd5',1,'entt::basic_storage::swap_and_pop()']]], + ['swap_5felements_1007',['swap_elements',['../classentt_1_1basic__sparse__set.html#a2b82af720eca37261f3230c654d7fe1f',1,'entt::basic_sparse_set']]] ]; diff --git a/search/functions_11.js b/search/functions_11.js index 2a9a5f00f..b042843cb 100644 --- a/search/functions_11.js +++ b/search/functions_11.js @@ -1,20 +1,19 @@ var searchData= [ - ['temp_1021',['temp',['../classentt_1_1resource__cache.html#ad68eaab4f44691e76d128aaab4709d4f',1,'entt::resource_cache']]], - ['template_5farg_1022',['template_arg',['../classentt_1_1meta__type.html#a0edd8f9efed70aa8a69b786d680fcc23',1,'entt::meta_type']]], - ['template_5farity_1023',['template_arity',['../classentt_1_1meta__type.html#acf1cd27c37c4f52c1e2b720722be0c36',1,'entt::meta_type']]], - ['template_5ftype_1024',['template_type',['../classentt_1_1meta__type.html#afd99912be885a6ad9b579596f5446286',1,'entt::meta_type']]], - ['tick_1025',['tick',['../classentt_1_1process.html#aacc7fe0ef3265113079c70ff8cd9478d',1,'entt::process']]], - ['to_5faddress_1026',['to_address',['../namespaceentt.html#a94ed50d1975e6adee73101eb05c88d73',1,'entt']]], - ['to_5fentity_1027',['to_entity',['../classentt_1_1entt__traits.html#a391b8de07d30bc1b9dd719b6886ddfe0',1,'entt::entt_traits::to_entity()'],['../namespaceentt.html#ae1b0b05750caf25f9718c2bebf55d25c',1,'entt::to_entity(const Entity value)'],['../namespaceentt.html#ae81b68364d770429f343d703f415d12a',1,'entt::to_entity(const basic_registry< Entity > &reg, const Component &instance)']]], - ['to_5fintegral_1028',['to_integral',['../classentt_1_1entt__traits.html#a3797423cba124a5d52a7fcd247b16842',1,'entt::entt_traits::to_integral()'],['../namespaceentt.html#abd7521f3d3ca914ea5bd131269ba75aa',1,'entt::to_integral()']]], - ['to_5fversion_1029',['to_version',['../classentt_1_1entt__traits.html#aedb75689bab1bf13e99a8267662b7bc6',1,'entt::entt_traits::to_version()'],['../namespaceentt.html#ae7dc0f67afc2c0924dc2c0f51dcadadf',1,'entt::to_version()']]], - ['top_5flevel_1030',['top_level',['../structentt_1_1basic__organizer_1_1vertex.html#a33b714b2096db39c751734aea33ae949',1,'entt::basic_organizer::vertex']]], - ['trigger_1031',['trigger',['../classentt_1_1dispatcher.html#a19e826de01548ef5181bf266c00b65df',1,'entt::dispatcher::trigger(Args &&...args)'],['../classentt_1_1dispatcher.html#a1d14234071d22c9fe09c453ebd818d2e',1,'entt::dispatcher::trigger(Event &&event)']]], - ['try_5fcast_1032',['try_cast',['../classentt_1_1meta__any.html#aa545482520009cfd0b70c77269487213',1,'entt::meta_any::try_cast() const'],['../classentt_1_1meta__any.html#a92f9591ef0d0e8d146be79b2103efb33',1,'entt::meta_any::try_cast()']]], - ['try_5fctx_1033',['try_ctx',['../classentt_1_1basic__registry.html#a8554b6cb789387d30ab3a42c26b06c72',1,'entt::basic_registry::try_ctx() const'],['../classentt_1_1basic__registry.html#ab25a060f43bbb5ce9aec1f7f5a698220',1,'entt::basic_registry::try_ctx()']]], - ['try_5femplace_1034',['try_emplace',['../classentt_1_1dense__hash__map.html#a5f353e2cf7f2e3a3b3c7d233ee04c5fc',1,'entt::dense_hash_map::try_emplace()'],['../classentt_1_1basic__sparse__set.html#ad2ffa27c249f22f503464d44df33271b',1,'entt::basic_sparse_set::try_emplace()'],['../classentt_1_1basic__storage.html#abe84d745f177cc703ce5e3f12ffdf64c',1,'entt::basic_storage::try_emplace()'],['../classentt_1_1dense__hash__map.html#add783d02674177a3c1e6dcd280f90437',1,'entt::dense_hash_map::try_emplace()']]], - ['try_5fget_1035',['try_get',['../structentt_1_1basic__handle.html#a51b5f344896763432c91008620678d46',1,'entt::basic_handle::try_get()'],['../classentt_1_1basic__registry.html#a9a01c958149b6c0d5b233a1a7c3c3bb3',1,'entt::basic_registry::try_get([[maybe_unused]] const entity_type entity) const'],['../classentt_1_1basic__registry.html#acc3f7f2d48549f2386b065988bc372b7',1,'entt::basic_registry::try_get([[maybe_unused]] const entity_type entity)']]], - ['type_1036',['type',['../classentt_1_1meta__factory_3_01Type_01_4.html#a4b02493f065b0b01d04f7256af06445e',1,'entt::meta_factory< Type >::type()'],['../classentt_1_1meta__any.html#a8bdf87354f140b2738e2f72d07af3350',1,'entt::meta_any::type()'],['../structentt_1_1meta__data.html#ad088d09cff4cea8b136d05a0d30049e6',1,'entt::meta_data::type()'],['../classentt_1_1basic__poly.html#aa745ccb8b2728d24dd88dccc9663a293',1,'entt::basic_poly::type()'],['../classentt_1_1basic__any.html#a8cc9d2291706a0676e56fedce2b153fa',1,'entt::basic_any::type()'],['../classentt_1_1basic__sparse__set.html#ac560b393e391e11d203455a0c1ffc027',1,'entt::basic_sparse_set::type()']]], - ['type_5fid_1037',['type_id',['../namespaceentt.html#a2e2dcd5e9e474d7ab0f2db24dae09dd5',1,'entt']]] + ['template_5farg_1008',['template_arg',['../classentt_1_1meta__type.html#a0edd8f9efed70aa8a69b786d680fcc23',1,'entt::meta_type']]], + ['template_5farity_1009',['template_arity',['../classentt_1_1meta__type.html#acf1cd27c37c4f52c1e2b720722be0c36',1,'entt::meta_type']]], + ['template_5ftype_1010',['template_type',['../classentt_1_1meta__type.html#afd99912be885a6ad9b579596f5446286',1,'entt::meta_type']]], + ['tick_1011',['tick',['../classentt_1_1process.html#aacc7fe0ef3265113079c70ff8cd9478d',1,'entt::process']]], + ['to_5faddress_1012',['to_address',['../namespaceentt.html#a94ed50d1975e6adee73101eb05c88d73',1,'entt']]], + ['to_5fentity_1013',['to_entity',['../classentt_1_1entt__traits.html#a391b8de07d30bc1b9dd719b6886ddfe0',1,'entt::entt_traits::to_entity()'],['../namespaceentt.html#ae1b0b05750caf25f9718c2bebf55d25c',1,'entt::to_entity(const Entity value)'],['../namespaceentt.html#ae81b68364d770429f343d703f415d12a',1,'entt::to_entity(const basic_registry< Entity > &reg, const Component &instance)']]], + ['to_5fintegral_1014',['to_integral',['../classentt_1_1entt__traits.html#a3797423cba124a5d52a7fcd247b16842',1,'entt::entt_traits::to_integral()'],['../namespaceentt.html#abd7521f3d3ca914ea5bd131269ba75aa',1,'entt::to_integral()']]], + ['to_5fversion_1015',['to_version',['../classentt_1_1entt__traits.html#aedb75689bab1bf13e99a8267662b7bc6',1,'entt::entt_traits::to_version()'],['../namespaceentt.html#ae7dc0f67afc2c0924dc2c0f51dcadadf',1,'entt::to_version()']]], + ['top_5flevel_1016',['top_level',['../structentt_1_1basic__organizer_1_1vertex.html#a33b714b2096db39c751734aea33ae949',1,'entt::basic_organizer::vertex']]], + ['trigger_1017',['trigger',['../classentt_1_1basic__dispatcher.html#a825b9fe2ade4f96d7777f87c56177196',1,'entt::basic_dispatcher::trigger(Event &&event={})'],['../classentt_1_1basic__dispatcher.html#aff29187083d0d045b5ddb7a241970b6a',1,'entt::basic_dispatcher::trigger(const id_type id, Event &&event={})']]], + ['try_5fcast_1018',['try_cast',['../classentt_1_1meta__any.html#aa545482520009cfd0b70c77269487213',1,'entt::meta_any::try_cast() const'],['../classentt_1_1meta__any.html#a92f9591ef0d0e8d146be79b2103efb33',1,'entt::meta_any::try_cast()']]], + ['try_5femplace_1019',['try_emplace',['../classentt_1_1dense__map.html#abd1ecd879ab8c9ecf644c4c23a925d4a',1,'entt::dense_map::try_emplace(const key_type &key, Args &&...args)'],['../classentt_1_1dense__map.html#a447b045d0c6bf772a72b4d8e0068033b',1,'entt::dense_map::try_emplace(key_type &&key, Args &&...args)'],['../classentt_1_1basic__sparse__set.html#a1c62d9615acde55f57fcca92e44c747c',1,'entt::basic_sparse_set::try_emplace()'],['../classentt_1_1basic__storage.html#a409ebd1c259f1c55d3f6d928247b6210',1,'entt::basic_storage::try_emplace()']]], + ['try_5fget_1020',['try_get',['../classentt_1_1basic__registry.html#acc3f7f2d48549f2386b065988bc372b7',1,'entt::basic_registry::try_get()'],['../structentt_1_1basic__handle.html#a51b5f344896763432c91008620678d46',1,'entt::basic_handle::try_get()'],['../classentt_1_1basic__registry.html#a9a01c958149b6c0d5b233a1a7c3c3bb3',1,'entt::basic_registry::try_get()']]], + ['type_1021',['type',['../classentt_1_1basic__poly.html#aa745ccb8b2728d24dd88dccc9663a293',1,'entt::basic_poly::type()'],['../classentt_1_1basic__any.html#a8cc9d2291706a0676e56fedce2b153fa',1,'entt::basic_any::type()'],['../classentt_1_1basic__sparse__set.html#ac560b393e391e11d203455a0c1ffc027',1,'entt::basic_sparse_set::type()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a4b02493f065b0b01d04f7256af06445e',1,'entt::meta_factory< Type >::type()'],['../classentt_1_1meta__any.html#a8bdf87354f140b2738e2f72d07af3350',1,'entt::meta_any::type()'],['../structentt_1_1meta__data.html#ad088d09cff4cea8b136d05a0d30049e6',1,'entt::meta_data::type()']]], + ['type_5fid_1022',['type_id',['../namespaceentt.html#a2e2dcd5e9e474d7ab0f2db24dae09dd5',1,'entt::type_id()'],['../namespaceentt.html#ad6ef63a4532530a8a2fcfa61df68f6e5',1,'entt::type_id(Type &&)']]], + ['type_5finfo_1023',['type_info',['../structentt_1_1type__info.html#a4e6870bc5adf4ec30d92dc77dd5d8ca6',1,'entt::type_info']]] ]; diff --git a/search/functions_12.js b/search/functions_12.js index cac812654..48b45ff31 100644 --- a/search/functions_12.js +++ b/search/functions_12.js @@ -1,9 +1,10 @@ var searchData= [ - ['unpause_1038',['unpause',['../classentt_1_1process.html#a828dd9665380d1ac41b7c14367e51835',1,'entt::process']]], - ['unset_1039',['unset',['../classentt_1_1basic__registry.html#aaa23b74e76b1749bb510a86e9d31b9cd',1,'entt::basic_registry']]], - ['unwrap_5ftuple_1040',['unwrap_tuple',['../namespaceentt.html#a29ad46972bf4848e06a728c232b94bf0',1,'entt']]], - ['update_1041',['update',['../structentt_1_1basic__collector_3_4.html#af84fbd53436ec60b1e158b3d685a91d9',1,'entt::basic_collector<>::update()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac8bd4af93eec6631c6b3a56353d8b615',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::update()'],['../structentt_1_1process__adaptor.html#a7514fabbbda491742872bc0e52dde5c2',1,'entt::process_adaptor::update()'],['../classentt_1_1scheduler.html#a827eae426378df9ed9190752156a4154',1,'entt::scheduler::update()'],['../classentt_1_1dispatcher.html#aabed6fd7fa4027dcfa3afc7bc20f2784',1,'entt::dispatcher::update()'],['../classentt_1_1dispatcher.html#ae15c11634047d7718db5e2e30675c80c',1,'entt::dispatcher::update() const']]], - ['use_1042',['use',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const']]], - ['use_5fcount_1043',['use_count',['../classentt_1_1resource__handle.html#a47f319eeef51a7d1745961f2dc2ea331',1,'entt::resource_handle']]] + ['uninitialized_5fconstruct_5fusing_5fallocator_1024',['uninitialized_construct_using_allocator',['../namespaceentt.html#a62b604f9b3045c7f380e86738d8623a9',1,'entt']]], + ['unpause_1025',['unpause',['../classentt_1_1process.html#a828dd9665380d1ac41b7c14367e51835',1,'entt::process']]], + ['unwrap_5ftuple_1026',['unwrap_tuple',['../namespaceentt.html#a29ad46972bf4848e06a728c232b94bf0',1,'entt']]], + ['update_1027',['update',['../structentt_1_1basic__collector_3_4.html#af84fbd53436ec60b1e158b3d685a91d9',1,'entt::basic_collector<>::update()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac8bd4af93eec6631c6b3a56353d8b615',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::update()'],['../structentt_1_1process__adaptor.html#a7514fabbbda491742872bc0e52dde5c2',1,'entt::process_adaptor::update()'],['../classentt_1_1scheduler.html#a827eae426378df9ed9190752156a4154',1,'entt::scheduler::update()'],['../classentt_1_1basic__dispatcher.html#a8726412224a319104b2312aeec6c5b4f',1,'entt::basic_dispatcher::update(const id_type id=type_hash< Event >::value())'],['../classentt_1_1basic__dispatcher.html#a34b8c43b1d00707b09e9ea8cd53ff3fd',1,'entt::basic_dispatcher::update() const']]], + ['use_1028',['use',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a97b67219ee8a1d3bc657e81c4368c7f4',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::use() const']]], + ['use_5fcount_1029',['use_count',['../classentt_1_1resource.html#a1bdea2c6634e42d5d0120cd5ae0ddfeb',1,'entt::resource']]], + ['uses_5fallocator_5fconstruction_5fargs_1030',['uses_allocator_construction_args',['../namespaceentt.html#ace7e8d47071e1556a9ce83772468215e',1,'entt']]] ]; diff --git a/search/functions_13.js b/search/functions_13.js index 58eebd0e0..92defd455 100644 --- a/search/functions_13.js +++ b/search/functions_13.js @@ -1,9 +1,10 @@ var searchData= [ - ['valid_1044',['valid',['../structentt_1_1basic__handle.html#aaa6afd3aa7fc2b92a02da90576a7af1e',1,'entt::basic_handle::valid()'],['../classentt_1_1basic__registry.html#a1795b1221d728f806319a685930f520d',1,'entt::basic_registry::valid()']]], - ['value_1045',['value',['../classentt_1_1basic__hashed__string.html#ac592a42bf7488cbecc5a1dd74efc0815',1,'entt::basic_hashed_string::value(const value_type *str, std::size_t size)'],['../classentt_1_1basic__hashed__string.html#a63725144b0b9af67e9965ab0a60c5862',1,'entt::basic_hashed_string::value(const value_type(&str)[N])'],['../classentt_1_1basic__hashed__string.html#a224b0f2486381e536b627bbde4de7c87',1,'entt::basic_hashed_string::value(const_wrapper wrapper)'],['../classentt_1_1basic__hashed__string.html#a40f85633eba5321389c5ceea4d19cebc',1,'entt::basic_hashed_string::value() const'],['../structentt_1_1type__index.html#ae35199e5bea69f748cef1866e52b5dc4',1,'entt::type_index::value()'],['../structentt_1_1type__hash.html#a95f5ae709a95f0959a7dfd1af6af6c74',1,'entt::type_hash::value()'],['../structentt_1_1type__name.html#a053ef91f965558bdf95dc2fbb3fc550b',1,'entt::type_name::value()'],['../structentt_1_1meta__prop.html#a82a1d1796e873be7ba0c9fb539ec22ef',1,'entt::meta_prop::value()']]], - ['value_5ftype_1046',['value_type',['../classentt_1_1meta__sequence__container.html#a646230dd7877a61ea1d29126831830cf',1,'entt::meta_sequence_container::value_type()'],['../classentt_1_1meta__associative__container.html#a281330b84e3598834f62d72ae0174b69',1,'entt::meta_associative_container::value_type()']]], - ['vertex_1047',['vertex',['../structentt_1_1basic__organizer_1_1vertex.html#aa0c8053ba7636d0dd6d6f211b922eba9',1,'entt::basic_organizer::vertex']]], - ['view_1048',['view',['../classentt_1_1basic__registry.html#aa50c2d25f9b9c7108ced52534e10d9d0',1,'entt::basic_registry::view(exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#a5a7b8466273429c44efdba1ada88afc1',1,'entt::basic_registry::view(exclude_t< Exclude... >={})']]], - ['visit_1049',['visit',['../structentt_1_1basic__handle.html#a266813a96b5f9fcd92f0f45d775d3e25',1,'entt::basic_handle']]] + ['valid_1031',['valid',['../structentt_1_1basic__handle.html#aaa6afd3aa7fc2b92a02da90576a7af1e',1,'entt::basic_handle::valid()'],['../classentt_1_1basic__registry.html#a1795b1221d728f806319a685930f520d',1,'entt::basic_registry::valid()']]], + ['value_1032',['value',['../classentt_1_1basic__hashed__string.html#a508fdeb2af222f74dfffedffb8a18db0',1,'entt::basic_hashed_string::value(const value_type *str, const size_type len)'],['../classentt_1_1basic__hashed__string.html#a63725144b0b9af67e9965ab0a60c5862',1,'entt::basic_hashed_string::value(const value_type(&str)[N])'],['../classentt_1_1basic__hashed__string.html#a2524b59bd7e665f19751bfa3f415fb7f',1,'entt::basic_hashed_string::value(const_wrapper wrapper)'],['../classentt_1_1basic__hashed__string.html#a40f85633eba5321389c5ceea4d19cebc',1,'entt::basic_hashed_string::value() const'],['../structentt_1_1type__index.html#ae35199e5bea69f748cef1866e52b5dc4',1,'entt::type_index::value()'],['../structentt_1_1type__hash.html#a95f5ae709a95f0959a7dfd1af6af6c74',1,'entt::type_hash::value()'],['../structentt_1_1type__name.html#a053ef91f965558bdf95dc2fbb3fc550b',1,'entt::type_name::value()'],['../structentt_1_1locator.html#a22699e0d2a72b24d942e4937b001e0f8',1,'entt::locator::value()'],['../structentt_1_1meta__prop.html#a82a1d1796e873be7ba0c9fb539ec22ef',1,'entt::meta_prop::value()']]], + ['value_5for_1033',['value_or',['../structentt_1_1locator.html#a8948b6cc1b6f3446a26391c0025d1777',1,'entt::locator']]], + ['value_5ftype_1034',['value_type',['../classentt_1_1meta__sequence__container.html#a646230dd7877a61ea1d29126831830cf',1,'entt::meta_sequence_container::value_type()'],['../classentt_1_1meta__associative__container.html#a281330b84e3598834f62d72ae0174b69',1,'entt::meta_associative_container::value_type()']]], + ['vertex_1035',['vertex',['../structentt_1_1basic__organizer_1_1vertex.html#aa0c8053ba7636d0dd6d6f211b922eba9',1,'entt::basic_organizer::vertex']]], + ['view_1036',['view',['../classentt_1_1basic__registry.html#a28b6a0c2de593eaf6aee6c3b445e64a1',1,'entt::basic_registry::view(exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#a5e25dbc5db101ef2574c15432365b94d',1,'entt::basic_registry::view(exclude_t< Exclude... >={})']]], + ['visit_1037',['visit',['../structentt_1_1basic__handle.html#a266813a96b5f9fcd92f0f45d775d3e25',1,'entt::basic_handle']]] ]; diff --git a/search/functions_14.js b/search/functions_14.js index 8f2e36771..f9a29f2c5 100644 --- a/search/functions_14.js +++ b/search/functions_14.js @@ -1,4 +1,4 @@ var searchData= [ - ['where_1050',['where',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a21c361071415791fd940201a685b938e',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] + ['where_1038',['where',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a21c361071415791fd940201a685b938e',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] ]; diff --git a/search/functions_15.js b/search/functions_15.js index 45a7e7843..426c9766b 100644 --- a/search/functions_15.js +++ b/search/functions_15.js @@ -1,4 +1,4 @@ var searchData= [ - ['y_5fcombinator_1051',['y_combinator',['../structentt_1_1y__combinator.html#a3ef9b5550c3de06bed6297ae3b79815f',1,'entt::y_combinator']]] + ['y_5fcombinator_1039',['y_combinator',['../structentt_1_1y__combinator.html#a3ef9b5550c3de06bed6297ae3b79815f',1,'entt::y_combinator']]] ]; diff --git a/search/functions_16.js b/search/functions_16.js index 00e3d0ea2..dfe827d48 100644 --- a/search/functions_16.js +++ b/search/functions_16.js @@ -1,14 +1,12 @@ var searchData= [ - ['_7ebasic_5fany_1052',['~basic_any',['../classentt_1_1basic__any.html#ab103382955f577cd8a714c7b5b89d9c6',1,'entt::basic_any']]], - ['_7ebasic_5fobserver_1053',['~basic_observer',['../classentt_1_1basic__observer.html#afb6fbd2a5ce7bc57013b0bd9ad482599',1,'entt::basic_observer']]], - ['_7ebasic_5fsparse_5fset_1054',['~basic_sparse_set',['../classentt_1_1basic__sparse__set.html#ac56f048f614c38f14b19ba9cb27faa94',1,'entt::basic_sparse_set']]], - ['_7ebasic_5fstorage_1055',['~basic_storage',['../classentt_1_1basic__storage.html#aefce30bb9922e977dcf76577ea739f3a',1,'entt::basic_storage']]], - ['_7edense_5fhash_5fmap_1056',['~dense_hash_map',['../classentt_1_1dense__hash__map.html#afe433812c8b1395b47133bde9c9a19f8',1,'entt::dense_hash_map']]], - ['_7edense_5fhash_5fset_1057',['~dense_hash_set',['../classentt_1_1dense__hash__set.html#a17d3d73a20b4bebe1cfcc8e4c974b3a1',1,'entt::dense_hash_set']]], - ['_7eemitter_1058',['~emitter',['../classentt_1_1emitter.html#af3d352c547768be34f03f0fbfdd30b43',1,'entt::emitter']]], - ['_7emeta_5fany_1059',['~meta_any',['../classentt_1_1meta__any.html#a816dae3d4ed3e41fcb376ec5ec9c38c1',1,'entt::meta_any']]], - ['_7eprocess_1060',['~process',['../classentt_1_1process.html#a2baf1b6aef37c1420a77cd3f8eadcf79',1,'entt::process']]], - ['_7escoped_5fconnection_1061',['~scoped_connection',['../structentt_1_1scoped__connection.html#a8bc8b8630e2ad076216b6aca416ce32c',1,'entt::scoped_connection']]], - ['_7eservice_5flocator_1062',['~service_locator',['../structentt_1_1service__locator.html#a2cbb6cfc1614067ae92f1c60580236a8',1,'entt::service_locator']]] + ['_7ebasic_5fany_1040',['~basic_any',['../classentt_1_1basic__any.html#ab103382955f577cd8a714c7b5b89d9c6',1,'entt::basic_any']]], + ['_7ebasic_5fobserver_1041',['~basic_observer',['../classentt_1_1basic__observer.html#afb6fbd2a5ce7bc57013b0bd9ad482599',1,'entt::basic_observer']]], + ['_7ebasic_5fsparse_5fset_1042',['~basic_sparse_set',['../classentt_1_1basic__sparse__set.html#ac56f048f614c38f14b19ba9cb27faa94',1,'entt::basic_sparse_set']]], + ['_7ebasic_5fstorage_1043',['~basic_storage',['../classentt_1_1basic__storage.html#aefce30bb9922e977dcf76577ea739f3a',1,'entt::basic_storage']]], + ['_7eemitter_1044',['~emitter',['../classentt_1_1emitter.html#af3d352c547768be34f03f0fbfdd30b43',1,'entt::emitter']]], + ['_7elocator_1045',['~locator',['../structentt_1_1locator.html#a9f224d476bcb081004089f419a1ddde5',1,'entt::locator']]], + ['_7emeta_5fany_1046',['~meta_any',['../classentt_1_1meta__any.html#a816dae3d4ed3e41fcb376ec5ec9c38c1',1,'entt::meta_any']]], + ['_7eprocess_1047',['~process',['../classentt_1_1process.html#a2baf1b6aef37c1420a77cd3f8eadcf79',1,'entt::process']]], + ['_7escoped_5fconnection_1048',['~scoped_connection',['../structentt_1_1scoped__connection.html#a8bc8b8630e2ad076216b6aca416ce32c',1,'entt::scoped_connection']]] ]; diff --git a/search/functions_2.js b/search/functions_2.js index 8ce1c00bc..082e7c201 100644 --- a/search/functions_2.js +++ b/search/functions_2.js @@ -1,27 +1,26 @@ var searchData= [ - ['callback_801',['callback',['../structentt_1_1basic__organizer_1_1vertex.html#adbda67e21133ac80f05e7131ee00aec2',1,'entt::basic_organizer::vertex']]], - ['capacity_802',['capacity',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ada21c7b1c65df0c10ea107559447ede7',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::capacity()'],['../classentt_1_1basic__registry.html#a05fd96006ea9f68b679507cdc67260ce',1,'entt::basic_registry::capacity()'],['../classentt_1_1basic__sparse__set.html#ac563edfd09c8b37256d49b05bde4f872',1,'entt::basic_sparse_set::capacity()'],['../classentt_1_1basic__storage.html#aff2228c8f45265417bf83694a3a47ce6',1,'entt::basic_storage::capacity()']]], - ['cast_803',['cast',['../classentt_1_1meta__any.html#a88f4699d57d87d6b450e681af5c9a07d',1,'entt::meta_any::cast() const'],['../classentt_1_1meta__any.html#a451353f531eac9870b155bf360aa08d0',1,'entt::meta_any::cast()']]], - ['cbegin_804',['cbegin',['../classentt_1_1dense__hash__map.html#ab35c654d76a56bb215a301f15929b5a1',1,'entt::dense_hash_map::cbegin() const'],['../classentt_1_1dense__hash__map.html#a44712304f19ed749fbd0643fab4e531b',1,'entt::dense_hash_map::cbegin(const size_type index) const'],['../classentt_1_1dense__hash__set.html#a611e7737124032737435848a09d71015',1,'entt::dense_hash_set::cbegin() const'],['../classentt_1_1dense__hash__set.html#a2d8329bf6bf0c8dcd7c97da521cceb37',1,'entt::dense_hash_set::cbegin(const size_type index) const'],['../structentt_1_1iterable__adaptor.html#a33c94d2a866e0c93f3dbaabdf91e80fa',1,'entt::iterable_adaptor::cbegin()'],['../classentt_1_1basic__sparse__set.html#aaffd322c619ff4cb1545cd38eb01b04d',1,'entt::basic_sparse_set::cbegin()'],['../classentt_1_1basic__storage.html#a2160a4b2a4c05fcab3fb14a8933953a5',1,'entt::basic_storage::cbegin()'],['../structentt_1_1meta__range.html#a1e6679691bb8b102dc742dc7d8794c15',1,'entt::meta_range::cbegin()']]], - ['cend_805',['cend',['../classentt_1_1dense__hash__map.html#a8aec09d2f16cc82d107bbffd34cdd842',1,'entt::dense_hash_map::cend() const'],['../classentt_1_1dense__hash__map.html#a978b46b79f11e67cbf49b1cf41bd094a',1,'entt::dense_hash_map::cend([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__hash__set.html#a9f45e62de3b7dc871bd10800590a9303',1,'entt::dense_hash_set::cend() const'],['../classentt_1_1dense__hash__set.html#a0d9d2624b7afd6d19ff28d1ec603234e',1,'entt::dense_hash_set::cend([[maybe_unused]] const size_type index) const'],['../structentt_1_1iterable__adaptor.html#a647cd837df15e583db221c24af02abb6',1,'entt::iterable_adaptor::cend()'],['../classentt_1_1basic__sparse__set.html#aedb8abe8289cd85a48b990d66cb7f90c',1,'entt::basic_sparse_set::cend()'],['../classentt_1_1basic__storage.html#a253c6d2bd4677fa8a70bf12aab88d154',1,'entt::basic_storage::cend()'],['../structentt_1_1meta__range.html#a56dc6086d89e868639de03ebe41d4a65',1,'entt::meta_range::cend()']]], - ['children_806',['children',['../structentt_1_1basic__organizer_1_1vertex.html#a9001bb3bbdfa60b8331d45d741a89de5',1,'entt::basic_organizer::vertex']]], - ['clear_807',['clear',['../classentt_1_1dense__hash__map.html#a9bad3d67bfedb75206b5d04b0fa29ec4',1,'entt::dense_hash_map::clear()'],['../classentt_1_1dense__hash__set.html#a5138bded25378fb68122573c5ba39ece',1,'entt::dense_hash_set::clear()'],['../classentt_1_1basic__observer.html#ade730cb09309ed7077616a908b25c2e7',1,'entt::basic_observer::clear()'],['../classentt_1_1basic__organizer.html#abd9bb70defec160e5da0d5807c11b18f',1,'entt::basic_organizer::clear()'],['../classentt_1_1basic__registry.html#aa4b08ad282560ead88ceeeddba16f552',1,'entt::basic_registry::clear()'],['../classentt_1_1basic__sparse__set.html#a6560773b887906122d50a413aea1faad',1,'entt::basic_sparse_set::clear()'],['../classentt_1_1meta__sequence__container.html#afd684301f43565b7fc23b32b8b92bb6e',1,'entt::meta_sequence_container::clear()'],['../classentt_1_1meta__associative__container.html#af8d886eee95047430e1272ae419be3e4',1,'entt::meta_associative_container::clear()'],['../classentt_1_1scheduler.html#a5a0f92dbe54b58751237a567e86805e0',1,'entt::scheduler::clear()'],['../classentt_1_1resource__cache.html#a2c6800c0d2ebb2c0a51f941af5fc9168',1,'entt::resource_cache::clear()'],['../classentt_1_1dispatcher.html#a7aacb035fbf90406fca1ccd10f28be86',1,'entt::dispatcher::clear()'],['../classentt_1_1emitter.html#a4e4324c59afee760ca13772eb6d2d522',1,'entt::emitter::clear()'],['../classentt_1_1emitter.html#afed3485e23fdbb87d007208382428813',1,'entt::emitter::clear()']]], - ['collect_808',['collect',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af48a9fae33221a696db874e00516a7e1',1,'entt::sigh< Ret(Args...), Allocator >']]], - ['combine_809',['combine',['../classentt_1_1entt__traits.html#aaba051e9884c8122ee8de8260a14fa68',1,'entt::entt_traits']]], - ['compact_810',['compact',['../classentt_1_1basic__registry.html#a27f61f6b3347811854b7d1c2bd97db99',1,'entt::basic_registry::compact()'],['../classentt_1_1basic__sparse__set.html#af4979ce48546cfcc705c4d23654faef2',1,'entt::basic_sparse_set::compact()']]], - ['component_811',['component',['../classentt_1_1basic__snapshot.html#a59cf70d5b7730d388f3a63845e8faede',1,'entt::basic_snapshot::component(Archive &archive) const'],['../classentt_1_1basic__snapshot.html#a05fff12a4af42f0ad77dc4893856772c',1,'entt::basic_snapshot::component(Archive &archive, It first, It last) const'],['../classentt_1_1basic__snapshot__loader.html#af7352e091c3421432cc2ef77010a0a2d',1,'entt::basic_snapshot_loader::component()'],['../classentt_1_1basic__continuous__loader.html#a25d4e67e41c6dfde95e39a2d9ef896c2',1,'entt::basic_continuous_loader::component()']]], - ['compressed_5fpair_812',['compressed_pair',['../classentt_1_1compressed__pair.html#ad232c3555664edad7dc1425672245054',1,'entt::compressed_pair::compressed_pair()'],['../classentt_1_1compressed__pair.html#a2a25fcd5670e614428cbb8b929f02fca',1,'entt::compressed_pair::compressed_pair(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#a91c6019fb88342859008675265a8d7d0',1,'entt::compressed_pair::compressed_pair(compressed_pair &&other)=default'],['../classentt_1_1compressed__pair.html#a728283e0d45f7f13d762642a48a10e76',1,'entt::compressed_pair::compressed_pair(Arg &&arg, Other &&other)'],['../classentt_1_1compressed__pair.html#aed863f3bd0bde61f52c9cce84e9ecaac',1,'entt::compressed_pair::compressed_pair(std::piecewise_construct_t, std::tuple< Args... > args, std::tuple< Other... > other)'],['../namespaceentt.html#af638f85aa855e8364af76d8bf93eee3b',1,'entt::compressed_pair()']]], - ['connect_813',['connect',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#abd919bd2f167cbefbde08082b0e60c92',1,'entt::delegate< Ret(Args...)>::connect()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af7d419ad51b636ed828d8d41fe6dd698',1,'entt::delegate< Ret(Args...)>::connect(Type &value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#aa6446ef34be31a2e73d30af409d56126',1,'entt::delegate< Ret(Args...)>::connect(Type *value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a83e6d11605181db1a4a0396efcd55f55',1,'entt::delegate< Ret(Args...)>::connect(function_type *function, const void *payload=nullptr)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a567be37eb789e19d12106959c786f586',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ab1775693de213f96a67ec0b390eb932d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect(Type &&value_or_instance)'],['../classentt_1_1basic__observer.html#a7d69a8bc866b01cc677de492bc436209',1,'entt::basic_observer::connect()']]], - ['connection_814',['connection',['../structentt_1_1emitter_1_1connection.html#a3dcb29742c6824dd28743eb0d896f9c3',1,'entt::emitter::connection::connection()=default'],['../structentt_1_1emitter_1_1connection.html#a0fa687596e072155e92e586e9de089c3',1,'entt::emitter::connection::connection(typename pool_handler< Event >::connection_type conn)'],['../classentt_1_1connection.html#a1d11f6b9d00a3f0e5364111438a1cee5',1,'entt::connection::connection()']]], - ['construct_815',['construct',['../classentt_1_1entt__traits.html#a3fae029105adcdb4d570290a04399202',1,'entt::entt_traits::construct()'],['../classentt_1_1meta__type.html#acd24936afdaa36484a6e508d52f49663',1,'entt::meta_type::construct(meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a429d2a56a3aab671a76f87828e7f10f6',1,'entt::meta_type::construct(Args &&...args) const']]], - ['contains_816',['contains',['../classentt_1_1dense__hash__map.html#ab8aa4d44a5c642ad0c64153d99b83f62',1,'entt::dense_hash_map::contains(const key_type &key) const'],['../classentt_1_1dense__hash__map.html#a3ccb49138360b1262e36b30714a24f05',1,'entt::dense_hash_map::contains(const Other &key) const'],['../classentt_1_1dense__hash__set.html#afc2e126daf75c5de39a881fc13c7835d',1,'entt::dense_hash_set::contains(const value_type &value) const'],['../classentt_1_1dense__hash__set.html#a03867f506090a677e712b81902569cdd',1,'entt::dense_hash_set::contains(const Other &value) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a879bcfdaa77d67d7336039d63121dce8',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aa8f37d5e7ddf5accf4b57961c736eb13',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1basic__runtime__view.html#ace695506c87fd0299c49ce90e816074f',1,'entt::basic_runtime_view::contains()'],['../classentt_1_1basic__sparse__set.html#ad2c7f1ac19e1040c2c2d2245f521f291',1,'entt::basic_sparse_set::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ab81091685ac046513775b9e05dbafe34',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdc5cf0ebb1d03c27eed1a96c79050ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::contains()'],['../classentt_1_1resource__cache.html#a86bac75a12d6b8334c6438708f4b792f',1,'entt::resource_cache::contains()'],['../classentt_1_1basic__continuous__loader.html#a34d7062265e3b1f22aa6d4bb876ff3dd',1,'entt::basic_continuous_loader::contains()']]], - ['conv_817',['conv',['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()']]], - ['crbegin_818',['crbegin',['../classentt_1_1basic__sparse__set.html#a104a343b198eb136edc44a14e2926e17',1,'entt::basic_sparse_set::crbegin()'],['../classentt_1_1basic__storage.html#aa86ed935b31675eb3f6938755d671d2b',1,'entt::basic_storage::crbegin()']]], - ['create_819',['create',['../classentt_1_1basic__registry.html#a91bfd7ec05e6d718e47da581a893cdc4',1,'entt::basic_registry::create()'],['../classentt_1_1basic__registry.html#ab04ebcb3409a5e99a3a86a2f5b48e052',1,'entt::basic_registry::create(const entity_type hint)'],['../classentt_1_1basic__registry.html#a334768416fdf6372ecfdef9ec4f03e83',1,'entt::basic_registry::create(It first, It last)']]], - ['crend_820',['crend',['../classentt_1_1basic__storage.html#a0a4ae307c3423d97b779fe427b22feb6',1,'entt::basic_storage::crend()'],['../classentt_1_1basic__sparse__set.html#a27796ccfcc21635bebede97f3d97a7af',1,'entt::basic_sparse_set::crend()']]], - ['ctor_821',['ctor',['../classentt_1_1meta__factory_3_01Type_01_4.html#a938d731d306ebd02d2ef9e9d1b121f3f',1,'entt::meta_factory< Type >::ctor()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a83a4ce30e6792d17a88cc98a3df2ab39',1,'entt::meta_factory< Type >::ctor()']]], - ['ctx_822',['ctx',['../classentt_1_1basic__registry.html#aa7b72e3bdb0b072439afb85fe8af6ced',1,'entt::basic_registry::ctx() const'],['../classentt_1_1basic__registry.html#adebb39eff1162ede07bffded9528e710',1,'entt::basic_registry::ctx(Func func) const'],['../classentt_1_1basic__registry.html#a03031127c53abc80f8dcb835290fa765',1,'entt::basic_registry::ctx()']]], - ['ctx_5for_5fset_823',['ctx_or_set',['../classentt_1_1basic__registry.html#af68ea0a0b8e51794df74e1e378e9526d',1,'entt::basic_registry']]], - ['current_824',['current',['../classentt_1_1basic__registry.html#a199babc787d6baa6f7ccce761228a5f6',1,'entt::basic_registry::current()'],['../classentt_1_1basic__sparse__set.html#a5001ceb87ededb8ec8653aff795912b1',1,'entt::basic_sparse_set::current()']]] + ['callback_792',['callback',['../structentt_1_1basic__organizer_1_1vertex.html#adbda67e21133ac80f05e7131ee00aec2',1,'entt::basic_organizer::vertex']]], + ['capacity_793',['capacity',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ada21c7b1c65df0c10ea107559447ede7',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::capacity()'],['../classentt_1_1basic__registry.html#a05fd96006ea9f68b679507cdc67260ce',1,'entt::basic_registry::capacity()'],['../classentt_1_1basic__sparse__set.html#ac563edfd09c8b37256d49b05bde4f872',1,'entt::basic_sparse_set::capacity()'],['../classentt_1_1basic__storage.html#aff2228c8f45265417bf83694a3a47ce6',1,'entt::basic_storage::capacity()']]], + ['cast_794',['cast',['../classentt_1_1meta__any.html#a88f4699d57d87d6b450e681af5c9a07d',1,'entt::meta_any::cast() const'],['../classentt_1_1meta__any.html#a451353f531eac9870b155bf360aa08d0',1,'entt::meta_any::cast()']]], + ['cbegin_795',['cbegin',['../classentt_1_1dense__map.html#a7f17fe6a4b6851ff25c2e01ded8ecb4b',1,'entt::dense_map::cbegin() const'],['../classentt_1_1dense__map.html#a9e9beebb937e95a40246455194c86c84',1,'entt::dense_map::cbegin(const size_type index) const'],['../classentt_1_1dense__set.html#a6ff9261fef680864f9a19d88b9bb6007',1,'entt::dense_set::cbegin() const'],['../classentt_1_1dense__set.html#af66d225983e161e2f5b6bcd839dd295e',1,'entt::dense_set::cbegin(const size_type index) const'],['../structentt_1_1iterable__adaptor.html#abf869d640cc961dba11d6e0b04a0f588',1,'entt::iterable_adaptor::cbegin()'],['../classentt_1_1basic__sparse__set.html#aaffd322c619ff4cb1545cd38eb01b04d',1,'entt::basic_sparse_set::cbegin()'],['../classentt_1_1basic__storage.html#a2160a4b2a4c05fcab3fb14a8933953a5',1,'entt::basic_storage::cbegin()'],['../structentt_1_1meta__range.html#a1e6679691bb8b102dc742dc7d8794c15',1,'entt::meta_range::cbegin()'],['../classentt_1_1resource__cache.html#ae1e83d6e645e083b14afa3ad85c7cd5b',1,'entt::resource_cache::cbegin()']]], + ['cend_796',['cend',['../classentt_1_1dense__map.html#a10b5ed3b2c9ef380d367511deeea9dcc',1,'entt::dense_map::cend() const'],['../classentt_1_1dense__map.html#af671980746e3d607f5933696d3936123',1,'entt::dense_map::cend([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__set.html#a099ad84905f6a252332b0f5b0068aac1',1,'entt::dense_set::cend() const'],['../classentt_1_1dense__set.html#a4cec8dc79a800f4b8b747c4e0a31c6fb',1,'entt::dense_set::cend([[maybe_unused]] const size_type index) const'],['../structentt_1_1iterable__adaptor.html#ac7e87b44217f4c784b3efc9f074cabcf',1,'entt::iterable_adaptor::cend()'],['../classentt_1_1basic__sparse__set.html#aedb8abe8289cd85a48b990d66cb7f90c',1,'entt::basic_sparse_set::cend()'],['../classentt_1_1basic__storage.html#a253c6d2bd4677fa8a70bf12aab88d154',1,'entt::basic_storage::cend()'],['../structentt_1_1meta__range.html#a56dc6086d89e868639de03ebe41d4a65',1,'entt::meta_range::cend()'],['../classentt_1_1resource__cache.html#a1dbcbf4bacbe7036068ac25165c81fa5',1,'entt::resource_cache::cend()']]], + ['children_797',['children',['../structentt_1_1basic__organizer_1_1vertex.html#a9001bb3bbdfa60b8331d45d741a89de5',1,'entt::basic_organizer::vertex']]], + ['clear_798',['clear',['../classentt_1_1dense__map.html#a831cc52136a77d92c809a02a49faade6',1,'entt::dense_map::clear()'],['../classentt_1_1dense__set.html#adf3e56611d2bcebaeb7d27bbec2e3ef4',1,'entt::dense_set::clear()'],['../classentt_1_1basic__observer.html#ade730cb09309ed7077616a908b25c2e7',1,'entt::basic_observer::clear()'],['../classentt_1_1basic__organizer.html#abd9bb70defec160e5da0d5807c11b18f',1,'entt::basic_organizer::clear()'],['../classentt_1_1basic__registry.html#aa4b08ad282560ead88ceeeddba16f552',1,'entt::basic_registry::clear()'],['../classentt_1_1basic__sparse__set.html#a6560773b887906122d50a413aea1faad',1,'entt::basic_sparse_set::clear()'],['../classentt_1_1meta__sequence__container.html#afd684301f43565b7fc23b32b8b92bb6e',1,'entt::meta_sequence_container::clear()'],['../classentt_1_1meta__associative__container.html#af8d886eee95047430e1272ae419be3e4',1,'entt::meta_associative_container::clear()'],['../classentt_1_1scheduler.html#a5a0f92dbe54b58751237a567e86805e0',1,'entt::scheduler::clear()'],['../classentt_1_1resource__cache.html#a45d256c8fe130284facc58071dcaa91f',1,'entt::resource_cache::clear()'],['../classentt_1_1basic__dispatcher.html#a38b6446c28a59b93d3c40da25c846e57',1,'entt::basic_dispatcher::clear(const id_type id=type_hash< Event >::value())'],['../classentt_1_1basic__dispatcher.html#aa9ea948386b8eb098995cd6f2e981848',1,'entt::basic_dispatcher::clear()'],['../classentt_1_1emitter.html#a4e4324c59afee760ca13772eb6d2d522',1,'entt::emitter::clear()'],['../classentt_1_1emitter.html#afed3485e23fdbb87d007208382428813',1,'entt::emitter::clear()']]], + ['collect_799',['collect',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#af48a9fae33221a696db874e00516a7e1',1,'entt::sigh< Ret(Args...), Allocator >']]], + ['combine_800',['combine',['../classentt_1_1entt__traits.html#aaba051e9884c8122ee8de8260a14fa68',1,'entt::entt_traits']]], + ['compact_801',['compact',['../classentt_1_1basic__registry.html#a27f61f6b3347811854b7d1c2bd97db99',1,'entt::basic_registry::compact()'],['../classentt_1_1basic__sparse__set.html#af4979ce48546cfcc705c4d23654faef2',1,'entt::basic_sparse_set::compact()']]], + ['component_802',['component',['../classentt_1_1basic__snapshot.html#a59cf70d5b7730d388f3a63845e8faede',1,'entt::basic_snapshot::component(Archive &archive) const'],['../classentt_1_1basic__snapshot.html#a05fff12a4af42f0ad77dc4893856772c',1,'entt::basic_snapshot::component(Archive &archive, It first, It last) const'],['../classentt_1_1basic__snapshot__loader.html#af7352e091c3421432cc2ef77010a0a2d',1,'entt::basic_snapshot_loader::component()'],['../classentt_1_1basic__continuous__loader.html#a25d4e67e41c6dfde95e39a2d9ef896c2',1,'entt::basic_continuous_loader::component()']]], + ['compressed_5fpair_803',['compressed_pair',['../classentt_1_1compressed__pair.html#ad232c3555664edad7dc1425672245054',1,'entt::compressed_pair::compressed_pair()'],['../classentt_1_1compressed__pair.html#a2a25fcd5670e614428cbb8b929f02fca',1,'entt::compressed_pair::compressed_pair(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#a91c6019fb88342859008675265a8d7d0',1,'entt::compressed_pair::compressed_pair(compressed_pair &&other)=default'],['../classentt_1_1compressed__pair.html#a728283e0d45f7f13d762642a48a10e76',1,'entt::compressed_pair::compressed_pair(Arg &&arg, Other &&other)'],['../classentt_1_1compressed__pair.html#aed863f3bd0bde61f52c9cce84e9ecaac',1,'entt::compressed_pair::compressed_pair(std::piecewise_construct_t, std::tuple< Args... > args, std::tuple< Other... > other)'],['../namespaceentt.html#af638f85aa855e8364af76d8bf93eee3b',1,'entt::compressed_pair()']]], + ['connect_804',['connect',['../classentt_1_1basic__observer.html#a7d69a8bc866b01cc677de492bc436209',1,'entt::basic_observer::connect()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#abd919bd2f167cbefbde08082b0e60c92',1,'entt::delegate< Ret(Args...)>::connect()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af7d419ad51b636ed828d8d41fe6dd698',1,'entt::delegate< Ret(Args...)>::connect(Type &value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#aa6446ef34be31a2e73d30af409d56126',1,'entt::delegate< Ret(Args...)>::connect(Type *value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a83e6d11605181db1a4a0396efcd55f55',1,'entt::delegate< Ret(Args...)>::connect(function_type *function, const void *payload=nullptr)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a567be37eb789e19d12106959c786f586',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ab1775693de213f96a67ec0b390eb932d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::connect(Type &&value_or_instance)']]], + ['connection_805',['connection',['../structentt_1_1emitter_1_1connection.html#a3dcb29742c6824dd28743eb0d896f9c3',1,'entt::emitter::connection::connection()=default'],['../structentt_1_1emitter_1_1connection.html#a0fa687596e072155e92e586e9de089c3',1,'entt::emitter::connection::connection(typename pool_handler< Event >::connection_type conn)'],['../classentt_1_1connection.html#a1d11f6b9d00a3f0e5364111438a1cee5',1,'entt::connection::connection()']]], + ['construct_806',['construct',['../classentt_1_1entt__traits.html#a3fae029105adcdb4d570290a04399202',1,'entt::entt_traits::construct()'],['../classentt_1_1meta__type.html#acd24936afdaa36484a6e508d52f49663',1,'entt::meta_type::construct(meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a429d2a56a3aab671a76f87828e7f10f6',1,'entt::meta_type::construct(Args &&...args) const']]], + ['contains_807',['contains',['../classentt_1_1dense__map.html#abb9504d00b5829a2d92afd2296430192',1,'entt::dense_map::contains()'],['../classentt_1_1dense__set.html#afd77a2703fb72d17f382f5cb1aeb24b2',1,'entt::dense_set::contains(const value_type &value) const'],['../classentt_1_1dense__set.html#aa29df7e5860ee70d40b471683af20908',1,'entt::dense_set::contains(const Other &value) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a879bcfdaa77d67d7336039d63121dce8',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1dense__map.html#a4d884a2b7164b3df97d93dd2804222b0',1,'entt::dense_map::contains()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a1d8e154538308a4ba6e4c41f3ec51475',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::contains()'],['../classentt_1_1basic__continuous__loader.html#a34d7062265e3b1f22aa6d4bb876ff3dd',1,'entt::basic_continuous_loader::contains()'],['../classentt_1_1basic__sparse__set.html#ad2c7f1ac19e1040c2c2d2245f521f291',1,'entt::basic_sparse_set::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ab81091685ac046513775b9e05dbafe34',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::contains()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdc5cf0ebb1d03c27eed1a96c79050ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::contains()'],['../classentt_1_1resource__cache.html#aff744458b981ee509a7381ffdf544522',1,'entt::resource_cache::contains()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aa8f37d5e7ddf5accf4b57961c736eb13',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::contains()']]], + ['conv_808',['conv',['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a8a6ec2dfd4e5ab0513972e4a276cba8b',1,'entt::meta_factory< Type >::conv()']]], + ['crbegin_809',['crbegin',['../classentt_1_1basic__sparse__set.html#a104a343b198eb136edc44a14e2926e17',1,'entt::basic_sparse_set::crbegin()'],['../classentt_1_1basic__storage.html#aa86ed935b31675eb3f6938755d671d2b',1,'entt::basic_storage::crbegin()']]], + ['create_810',['create',['../classentt_1_1basic__registry.html#ab04ebcb3409a5e99a3a86a2f5b48e052',1,'entt::basic_registry::create(const entity_type hint)'],['../classentt_1_1basic__registry.html#a334768416fdf6372ecfdef9ec4f03e83',1,'entt::basic_registry::create(It first, It last)'],['../classentt_1_1basic__registry.html#a91bfd7ec05e6d718e47da581a893cdc4',1,'entt::basic_registry::create()']]], + ['crend_811',['crend',['../classentt_1_1basic__sparse__set.html#a27796ccfcc21635bebede97f3d97a7af',1,'entt::basic_sparse_set::crend()'],['../classentt_1_1basic__storage.html#a0a4ae307c3423d97b779fe427b22feb6',1,'entt::basic_storage::crend()']]], + ['ctor_812',['ctor',['../classentt_1_1meta__factory_3_01Type_01_4.html#a938d731d306ebd02d2ef9e9d1b121f3f',1,'entt::meta_factory< Type >::ctor()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a83a4ce30e6792d17a88cc98a3df2ab39',1,'entt::meta_factory< Type >::ctor()']]], + ['ctx_813',['ctx',['../classentt_1_1basic__registry.html#a0a0058d4e71e1cbcb1f2049b96d2e51b',1,'entt::basic_registry::ctx()'],['../classentt_1_1basic__registry.html#a0610a31a816c3200124ad07590720430',1,'entt::basic_registry::ctx() const']]], + ['current_814',['current',['../classentt_1_1basic__registry.html#a199babc787d6baa6f7ccce761228a5f6',1,'entt::basic_registry::current()'],['../classentt_1_1basic__sparse__set.html#a5001ceb87ededb8ec8653aff795912b1',1,'entt::basic_sparse_set::current()']]] ]; diff --git a/search/functions_3.js b/search/functions_3.js index 694d425c6..604563390 100644 --- a/search/functions_3.js +++ b/search/functions_3.js @@ -1,14 +1,12 @@ var searchData= [ - ['data_825',['data',['../classentt_1_1basic__any.html#a237dfc1f1c43bf5c0358b32896eda8c4',1,'entt::basic_any::data() const'],['../classentt_1_1basic__any.html#a5bfddaf1f62e8f9922bf8d7963b07d5b',1,'entt::basic_any::data(const type_info &req) const'],['../classentt_1_1basic__any.html#a3115608210ccfa59b915b1d9d24d9ef9',1,'entt::basic_any::data()'],['../classentt_1_1basic__any.html#ad9370b9b130bccb406b20b6562c3f192',1,'entt::basic_any::data(const type_info &req)'],['../classentt_1_1basic__hashed__string.html#a2019106a9113950a488f43feaaa57ccc',1,'entt::basic_hashed_string::data()'],['../classentt_1_1basic__observer.html#a9bbec438ee2735301a47725e0c137187',1,'entt::basic_observer::data()'],['../structentt_1_1basic__organizer_1_1vertex.html#a8e60b82f8db48e9bb2a8d0bf9cc5ac17',1,'entt::basic_organizer::vertex::data()'],['../classentt_1_1basic__registry.html#abd873a2d0dfb67f3fd27ce9ed23f61c2',1,'entt::basic_registry::data()'],['../classentt_1_1basic__sparse__set.html#adaa8a3f16cdaa2d85316683d008bf8c5',1,'entt::basic_sparse_set::data()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#addf18a70b4dea99bdc3fec0a537e042a',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__any.html#a3c16bceaf56eda12158f4b71ef879d5c',1,'entt::meta_any::data() const'],['../classentt_1_1meta__any.html#a5783b5eb8a7161452c3c61e3216acdc3',1,'entt::meta_any::data()'],['../classentt_1_1meta__type.html#afe554c6ab6bcd8ad77d55a5172e208a9',1,'entt::meta_type::data() const'],['../classentt_1_1meta__type.html#a68a81b038954d1727a6bb051ed1e810c',1,'entt::meta_type::data(const id_type id) const'],['../classentt_1_1basic__poly.html#ac2f41ea9e4b95871dc2f79db6855c122',1,'entt::basic_poly::data() const'],['../classentt_1_1basic__poly.html#a2f8e50be01a338fb93fc28b1e69865ad',1,'entt::basic_poly::data()']]], - ['delegate_826',['delegate',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a4629dd7c9c6e5dcb32d97c0c64702817',1,'entt::delegate< Ret(Args...)>::delegate()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a77c175e2f859a9dbbcfa6afee074e3e8',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a8b118ff23fbccfc60e5cff94a0056547',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >, Type &&value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af29157dd35ac7aefbdc8b7012e9d94ac',1,'entt::delegate< Ret(Args...)>::delegate(function_type *function, const void *payload=nullptr)'],['../namespaceentt.html#a7c8907a3a72cd2da043d81f6fd50487a',1,'entt::delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>'],['../namespaceentt.html#a39ba791dbcdecb9415a5c11fe69c4b1c',1,'entt::delegate(connect_arg_t< Candidate >, Type &&) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate), Type >>>'],['../namespaceentt.html#aaba06006a862fa5dc613e8561ac4e92c',1,'entt::delegate(Ret(*)(const void *, Args...), const void *=nullptr) -> delegate< Ret(Args...)>']]], - ['dense_5fhash_5fmap_827',['dense_hash_map',['../classentt_1_1dense__hash__map.html#a012db1332309d449965b7be0e7f3b32c',1,'entt::dense_hash_map::dense_hash_map()'],['../classentt_1_1dense__hash__map.html#a5dd833e19387f4f9c64c3402d7b98b0d',1,'entt::dense_hash_map::dense_hash_map(const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#a21d9faf77f24e47fed725ef2ad001f57',1,'entt::dense_hash_map::dense_hash_map(const size_type bucket_count, const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#abcfb4d580039e55c0e1cec274075c18c',1,'entt::dense_hash_map::dense_hash_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#a5d24d9429d622b40c86099a8aa37ebec',1,'entt::dense_hash_map::dense_hash_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())'],['../classentt_1_1dense__hash__map.html#a5977ef237186dbb70223bcfc830dd543',1,'entt::dense_hash_map::dense_hash_map(const dense_hash_map &other)'],['../classentt_1_1dense__hash__map.html#a6b625b5893468f287c3e2177fa217d65',1,'entt::dense_hash_map::dense_hash_map(const dense_hash_map &other, const allocator_type &allocator)'],['../classentt_1_1dense__hash__map.html#a1abb07a73f1b8bf4295463d03f5bb864',1,'entt::dense_hash_map::dense_hash_map(dense_hash_map &&other)=default'],['../classentt_1_1dense__hash__map.html#a6f670422a8aaa58490ce6c9b88ee79c8',1,'entt::dense_hash_map::dense_hash_map(dense_hash_map &&other, const allocator_type &allocator)']]], - ['dense_5fhash_5fset_828',['dense_hash_set',['../classentt_1_1dense__hash__set.html#a96509b56922847fa5ad1e807fd13e7e7',1,'entt::dense_hash_set::dense_hash_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#aacb83c23ca789afc8ca984b92ed75c45',1,'entt::dense_hash_set::dense_hash_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())'],['../classentt_1_1dense__hash__set.html#ac4ccdf38e5449ae5338d2af5438f3009',1,'entt::dense_hash_set::dense_hash_set(const dense_hash_set &other)'],['../classentt_1_1dense__hash__set.html#a23feffcb9a2f3e523c5c1af938f6bee2',1,'entt::dense_hash_set::dense_hash_set(const dense_hash_set &other, const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#a80c7fb60484b93d36e91555454eefada',1,'entt::dense_hash_set::dense_hash_set(dense_hash_set &&other)=default'],['../classentt_1_1dense__hash__set.html#a075c207764dc1361bcd2bb713a0828ab',1,'entt::dense_hash_set::dense_hash_set(dense_hash_set &&other, const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#ac09146a8eb26e8c5b4efc2c1e02561a7',1,'entt::dense_hash_set::dense_hash_set()'],['../classentt_1_1dense__hash__set.html#ac33576576a26b7e19152076ff5c200c8',1,'entt::dense_hash_set::dense_hash_set(const allocator_type &allocator)'],['../classentt_1_1dense__hash__set.html#a487c5c202d331e14c89481ac1d9649d1',1,'entt::dense_hash_set::dense_hash_set(const size_type bucket_count, const allocator_type &allocator)']]], - ['dereference_829',['dereference',['../structentt_1_1adl__meta__pointer__like.html#afa27f416e32b351d85ab1a061c4597bd',1,'entt::adl_meta_pointer_like']]], - ['dereference_5fmeta_5fpointer_5flike_830',['dereference_meta_pointer_like',['../namespaceentt.html#a2ab7b51802157a98106f238335fa7503',1,'entt']]], - ['destroy_831',['destroy',['../classentt_1_1basic__registry.html#a7b2c0368d508a6af2d094a9fc592a4a0',1,'entt::basic_registry::destroy(const entity_type entity)'],['../classentt_1_1basic__registry.html#adc175a0d3bcf83a133c63890c674ceb3',1,'entt::basic_registry::destroy(const entity_type entity, const version_type version)'],['../classentt_1_1basic__registry.html#a6c163dcc335da90e727e2f40e67973b7',1,'entt::basic_registry::destroy(It first, It last)'],['../structentt_1_1basic__handle.html#aa3a4791483b3390d6d3f95767c240b49',1,'entt::basic_handle::destroy()'],['../structentt_1_1basic__handle.html#aed1520d6f7ca04a6d7180d4d10234f2e',1,'entt::basic_handle::destroy(const version_type version)']]], - ['discard_832',['discard',['../classentt_1_1resource__cache.html#a2620d6e8d97603ccd29f4e439e446480',1,'entt::resource_cache']]], - ['disconnect_833',['disconnect',['../classentt_1_1dispatcher.html#a7e93f9fd0fd8bff68c133518ee6246f0',1,'entt::dispatcher::disconnect(Type &value_or_instance)'],['../classentt_1_1dispatcher.html#a1c1b713d76354cfb0bd1bd6ed33f93ab',1,'entt::dispatcher::disconnect(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a50114245dd8dfb4872f035f36603fc02',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#abbe3bb47e3c295a45360d9ca99e79401',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a095608dfefdbd464edd6fcf858d62e84',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ad6dfd8bfe6c9509fc7eac357c4d7e27b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type *value_or_instance)'],['../classentt_1_1basic__observer.html#a1337e8f885ca963383e5a3ed2a354955',1,'entt::basic_observer::disconnect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a43ac539a332574445dc674332bd0726d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()']]], - ['dispatcher_834',['dispatcher',['../classentt_1_1dispatcher.html#a90ffb0ad33577c7211bfd2ec9ef58bed',1,'entt::dispatcher::dispatcher()=default'],['../classentt_1_1dispatcher.html#a017f5a6bcf2032968bd0493e0e01551a',1,'entt::dispatcher::dispatcher(dispatcher &&)=default']]], - ['dtor_835',['dtor',['../classentt_1_1meta__factory_3_01Type_01_4.html#af17b90b02db12a4e7f8e8327828b501b',1,'entt::meta_factory< Type >']]] + ['data_815',['data',['../classentt_1_1basic__any.html#a237dfc1f1c43bf5c0358b32896eda8c4',1,'entt::basic_any::data() const'],['../classentt_1_1basic__any.html#a5bfddaf1f62e8f9922bf8d7963b07d5b',1,'entt::basic_any::data(const type_info &req) const'],['../classentt_1_1basic__any.html#a3115608210ccfa59b915b1d9d24d9ef9',1,'entt::basic_any::data()'],['../classentt_1_1basic__any.html#ad9370b9b130bccb406b20b6562c3f192',1,'entt::basic_any::data(const type_info &req)'],['../classentt_1_1basic__hashed__string.html#a2019106a9113950a488f43feaaa57ccc',1,'entt::basic_hashed_string::data()'],['../classentt_1_1basic__observer.html#a9bbec438ee2735301a47725e0c137187',1,'entt::basic_observer::data()'],['../structentt_1_1basic__organizer_1_1vertex.html#a8e60b82f8db48e9bb2a8d0bf9cc5ac17',1,'entt::basic_organizer::vertex::data()'],['../classentt_1_1basic__registry.html#abd873a2d0dfb67f3fd27ce9ed23f61c2',1,'entt::basic_registry::data()'],['../classentt_1_1basic__sparse__set.html#adaa8a3f16cdaa2d85316683d008bf8c5',1,'entt::basic_sparse_set::data()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#addf18a70b4dea99bdc3fec0a537e042a',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__factory_3_01Type_01_4.html#a68add4bb8e6639b5a1449624608a3462',1,'entt::meta_factory< Type >::data(const id_type id)'],['../classentt_1_1meta__any.html#a3c16bceaf56eda12158f4b71ef879d5c',1,'entt::meta_any::data() const'],['../classentt_1_1meta__any.html#a5783b5eb8a7161452c3c61e3216acdc3',1,'entt::meta_any::data()'],['../classentt_1_1meta__type.html#afe554c6ab6bcd8ad77d55a5172e208a9',1,'entt::meta_type::data() const'],['../classentt_1_1meta__type.html#a68a81b038954d1727a6bb051ed1e810c',1,'entt::meta_type::data(const id_type id) const'],['../classentt_1_1basic__poly.html#ac2f41ea9e4b95871dc2f79db6855c122',1,'entt::basic_poly::data() const'],['../classentt_1_1basic__poly.html#a2f8e50be01a338fb93fc28b1e69865ad',1,'entt::basic_poly::data()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ab7b73e47afcc337b492078f36f73dd06',1,'entt::delegate< Ret(Args...)>::data() const']]], + ['delegate_816',['delegate',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a4629dd7c9c6e5dcb32d97c0c64702817',1,'entt::delegate< Ret(Args...)>::delegate()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a77c175e2f859a9dbbcfa6afee074e3e8',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a8b118ff23fbccfc60e5cff94a0056547',1,'entt::delegate< Ret(Args...)>::delegate(connect_arg_t< Candidate >, Type &&value_or_instance)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af29157dd35ac7aefbdc8b7012e9d94ac',1,'entt::delegate< Ret(Args...)>::delegate(function_type *function, const void *payload=nullptr)'],['../namespaceentt.html#a7c8907a3a72cd2da043d81f6fd50487a',1,'entt::delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>'],['../namespaceentt.html#a39ba791dbcdecb9415a5c11fe69c4b1c',1,'entt::delegate(connect_arg_t< Candidate >, Type &&) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate), Type >>>'],['../namespaceentt.html#aaba06006a862fa5dc613e8561ac4e92c',1,'entt::delegate(Ret(*)(const void *, Args...), const void *=nullptr) -> delegate< Ret(Args...)>']]], + ['dense_5fmap_817',['dense_map',['../classentt_1_1dense__map.html#a83c1b7ad55e028f5db68a1233f686bce',1,'entt::dense_map::dense_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__map.html#a2b1bdc80b3c5c7c5968a4a93b0df8017',1,'entt::dense_map::dense_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})'],['../classentt_1_1dense__map.html#aaa72d92d87e8020e0ca5f035cd665d8b',1,'entt::dense_map::dense_map(const dense_map &)=default'],['../classentt_1_1dense__map.html#a8924f4faaa1879a84734ec58f11e6662',1,'entt::dense_map::dense_map(const dense_map &other, const allocator_type &allocator)'],['../classentt_1_1dense__map.html#ae359eaeb5622f46d311ad104bdf01485',1,'entt::dense_map::dense_map(dense_map &&)=default'],['../classentt_1_1dense__map.html#a352da8efacf3d89715b5892e65b82f66',1,'entt::dense_map::dense_map(dense_map &&other, const allocator_type &allocator)'],['../classentt_1_1dense__map.html#af163bec2cf56f3571000a5fc0145832f',1,'entt::dense_map::dense_map()'],['../classentt_1_1dense__map.html#a096357c0bdb6342d7d304716e41fcea5',1,'entt::dense_map::dense_map(const allocator_type &allocator)'],['../classentt_1_1dense__map.html#af994882512db3e8e8738dab51caa57ce',1,'entt::dense_map::dense_map(const size_type bucket_count, const allocator_type &allocator)']]], + ['dense_5fset_818',['dense_set',['../classentt_1_1dense__set.html#aac496ad7374fca92ea770e96571dc3e8',1,'entt::dense_set::dense_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)'],['../classentt_1_1dense__set.html#abfcf95ebacf7a07bf8935e08688f92cc',1,'entt::dense_set::dense_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})'],['../classentt_1_1dense__set.html#aa84caa4b8ea63cc40d7c96158a35760f',1,'entt::dense_set::dense_set(const dense_set &)=default'],['../classentt_1_1dense__set.html#a68b3b28b433da48bece9ff3abf1d476e',1,'entt::dense_set::dense_set(const dense_set &other, const allocator_type &allocator)'],['../classentt_1_1dense__set.html#a06c7a4acb07f6f2a2f2adb1b05f9e777',1,'entt::dense_set::dense_set(dense_set &&)=default'],['../classentt_1_1dense__set.html#ada9ee844d6f84e1670da4088f0e38361',1,'entt::dense_set::dense_set(dense_set &&other, const allocator_type &allocator)'],['../classentt_1_1dense__set.html#acb2185a8bef7bb0e248a61605c3b0bca',1,'entt::dense_set::dense_set()'],['../classentt_1_1dense__set.html#ac6e88655aa8ad10f1abec3f096c64161',1,'entt::dense_set::dense_set(const allocator_type &allocator)'],['../classentt_1_1dense__set.html#a4017286b57009e512f2aadd07f31ce53',1,'entt::dense_set::dense_set(const size_type bucket_count, const allocator_type &allocator)']]], + ['dereference_819',['dereference',['../structentt_1_1adl__meta__pointer__like.html#afa27f416e32b351d85ab1a061c4597bd',1,'entt::adl_meta_pointer_like']]], + ['dereference_5fmeta_5fpointer_5flike_820',['dereference_meta_pointer_like',['../namespaceentt.html#a2ab7b51802157a98106f238335fa7503',1,'entt']]], + ['destroy_821',['destroy',['../structentt_1_1basic__handle.html#aa3a4791483b3390d6d3f95767c240b49',1,'entt::basic_handle::destroy()'],['../structentt_1_1basic__handle.html#aed1520d6f7ca04a6d7180d4d10234f2e',1,'entt::basic_handle::destroy(const version_type version)'],['../classentt_1_1basic__registry.html#a7b2c0368d508a6af2d094a9fc592a4a0',1,'entt::basic_registry::destroy(const entity_type entity)'],['../classentt_1_1basic__registry.html#a6c163dcc335da90e727e2f40e67973b7',1,'entt::basic_registry::destroy(It first, It last)'],['../classentt_1_1basic__registry.html#adc175a0d3bcf83a133c63890c674ceb3',1,'entt::basic_registry::destroy(const entity_type entity, const version_type version)']]], + ['disconnect_822',['disconnect',['../classentt_1_1basic__observer.html#a1337e8f885ca963383e5a3ed2a354955',1,'entt::basic_observer::disconnect()'],['../classentt_1_1basic__dispatcher.html#a6d3929fa7b3de337091f4305a564ba75',1,'entt::basic_dispatcher::disconnect(Type &value_or_instance)'],['../classentt_1_1basic__dispatcher.html#adb5bc2c8ef847a296fe66c230f84569b',1,'entt::basic_dispatcher::disconnect(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a50114245dd8dfb4872f035f36603fc02',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#abbe3bb47e3c295a45360d9ca99e79401',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &&value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#ad6dfd8bfe6c9509fc7eac357c4d7e27b',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type *value_or_instance)'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a43ac539a332574445dc674332bd0726d',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#a095608dfefdbd464edd6fcf858d62e84',1,'entt::sink< sigh< Ret(Args...), Allocator > >::disconnect(Type &value_or_instance)']]], + ['dtor_823',['dtor',['../classentt_1_1meta__factory_3_01Type_01_4.html#af17b90b02db12a4e7f8e8327828b501b',1,'entt::meta_factory< Type >']]] ]; diff --git a/search/functions_4.js b/search/functions_4.js index b9b8f23ec..28a198c47 100644 --- a/search/functions_4.js +++ b/search/functions_4.js @@ -1,14 +1,16 @@ var searchData= [ - ['each_836',['each',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aded1e293c764ce80e77edf99c3015670',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a1da3cf6bed972be901bc1de385c4c112',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7a5fd57faabed2807b21b5a6355b3f94',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7e04e6a84be82f491283b8f11f9e93da',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__observer.html#a181a6724835a3a41e33610003f738525',1,'entt::basic_observer::each(Func func) const'],['../classentt_1_1basic__observer.html#a535f3ddf32641a54e1c8861519933c97',1,'entt::basic_observer::each(Func func)'],['../classentt_1_1basic__registry.html#a86d2b035f54225d82548e8f03de28754',1,'entt::basic_registry::each()'],['../classentt_1_1basic__runtime__view.html#a79fe059a28f768f4dc82edf48438cce0',1,'entt::basic_runtime_view::each()'],['../classentt_1_1basic__storage.html#a58a7d59cbbacef83d9c8897ece381b71',1,'entt::basic_storage::each()'],['../classentt_1_1basic__storage.html#af96e8092c6380da54b1edd8fe513618e',1,'entt::basic_storage::each() const'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a6053bb7998214f4c7ee8d6f0102ca5e6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a3160b3ba651856a9796adf396276b6d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ad2bf4f55f4724aba209a8578a1436f1b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a9504ec9cb2f42300b1a1c723b1df7252',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a2660b2e7fd36f8438a564fabcbb8d61d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdd97fb1a4ff44d57b751d2bbb054f61',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each() const'],['../classentt_1_1resource__cache.html#a0af1a225eb2a22f38380fbb6b90ebc5e',1,'entt::resource_cache::each(Func func) const'],['../classentt_1_1resource__cache.html#aa91fbde235252dadf46ef1effe32bbe0',1,'entt::resource_cache::each(Func func)']]], - ['emitter_837',['emitter',['../classentt_1_1emitter.html#af36907a2dc7cc0a6607533c67e072f92',1,'entt::emitter::emitter()=default'],['../classentt_1_1emitter.html#a842fef69b914a160b0bcc211bb77b27b',1,'entt::emitter::emitter(emitter &&)=default']]], - ['emplace_838',['emplace',['../classentt_1_1dense__hash__map.html#a43a4f3e5990fa4fe88db5a352d9e0eb5',1,'entt::dense_hash_map::emplace()'],['../classentt_1_1dense__hash__set.html#a0738a2f43b8f2395458a885a598f7ec6',1,'entt::dense_hash_set::emplace()'],['../classentt_1_1basic__any.html#a612abee6a4ebf016df27929668839fc0',1,'entt::basic_any::emplace()'],['../structentt_1_1basic__handle.html#a910e13063772bbd2c14a3287ea913ffd',1,'entt::basic_handle::emplace()'],['../classentt_1_1basic__organizer.html#a9c26a53ceaa41f54d88678b636e96ad5',1,'entt::basic_organizer::emplace(const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#ae28283f55e13443712ddfd29bf01f9f7',1,'entt::basic_organizer::emplace(Type &value_or_instance, const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#abed2a897fe81bd69f85ed9305c1fcdc3',1,'entt::basic_organizer::emplace(function_type *func, const void *payload=nullptr, const char *name=nullptr)'],['../classentt_1_1basic__registry.html#a4c9c0532972adc7a930a50888a97efdf',1,'entt::basic_registry::emplace()'],['../classentt_1_1basic__sparse__set.html#a54e6ca3fb905b6341faae9547e0c4a56',1,'entt::basic_sparse_set::emplace()'],['../classentt_1_1basic__storage.html#a7e6c99b2c108586141a75145748b2e8d',1,'entt::basic_storage::emplace()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a022a515247ef30e35163755e3faaffaa',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::emplace()'],['../classentt_1_1sigh__storage__mixin.html#ae09e60b8a910ebbcca85b8bd188027c3',1,'entt::sigh_storage_mixin::emplace()'],['../classentt_1_1meta__any.html#a3bb2e8e8a5eeb1cfaf1710b43382fef4',1,'entt::meta_any::emplace()'],['../classentt_1_1basic__poly.html#a6aaa4ef03f6f2a599abcf633412d6a8d',1,'entt::basic_poly::emplace()']]], - ['emplace_5for_5freplace_839',['emplace_or_replace',['../structentt_1_1basic__handle.html#a86866a41493a4136f1f50f87bf082e77',1,'entt::basic_handle::emplace_or_replace()'],['../classentt_1_1basic__registry.html#a3bbaebbb9365eef262453e42a8f7dc4b',1,'entt::basic_registry::emplace_or_replace()']]], - ['empty_840',['empty',['../classentt_1_1dense__hash__map.html#a033287b193d0b1b2815584f14dafb6c2',1,'entt::dense_hash_map::empty()'],['../classentt_1_1dense__hash__set.html#a5b23a3f7c685e29034f8df10435c52a4',1,'entt::dense_hash_set::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac3ffbc5007d5215df8d602aa16bbaa26',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad8297620981e3f64f2c2ba9122b2330f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__observer.html#a591a0ed89d0b2cabfb51b729bfb33c3e',1,'entt::basic_observer::empty()'],['../classentt_1_1basic__registry.html#a519426ee64b3f6574b99e86b31acca14',1,'entt::basic_registry::empty()'],['../classentt_1_1basic__sparse__set.html#a3617c860500230b880f07215f21cb496',1,'entt::basic_sparse_set::empty()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aac7ae1d31c946459a6987d9f5bc15359',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::empty()'],['../structentt_1_1service__locator.html#ad96474e6acfb0edd0e123c584f79296b',1,'entt::service_locator::empty()'],['../classentt_1_1scheduler.html#af12c8d59db78f91c3fdc144e90f24155',1,'entt::scheduler::empty()'],['../classentt_1_1resource__cache.html#a68ac0bbd5731434c15bee4d7342c359f',1,'entt::resource_cache::empty()'],['../classentt_1_1emitter.html#a08c6111af231c9a82277069a3bf21b75',1,'entt::emitter::empty() const'],['../classentt_1_1emitter.html#ad395b7c4de0f1f6e01a6e1c113db6937',1,'entt::emitter::empty() const'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ad795af78f60131f0b5535379ed2862f8',1,'entt::sigh< Ret(Args...), Allocator >::empty()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afaf6a5593b48f50aa147a622bae61e28',1,'entt::sink< sigh< Ret(Args...), Allocator > >::empty()']]], - ['end_841',['end',['../classentt_1_1dense__hash__map.html#a1b3011cbcc1805b087dcfdf92119eff6',1,'entt::dense_hash_map::end() const'],['../classentt_1_1dense__hash__map.html#a9246029ea08502e580a2f2a04afedc78',1,'entt::dense_hash_map::end()'],['../classentt_1_1dense__hash__map.html#af1bbe8c69515bc8f8af4592ca4f8668c',1,'entt::dense_hash_map::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__hash__map.html#a72908cd782450fee8f3fbed2d7486a19',1,'entt::dense_hash_map::end([[maybe_unused]] const size_type index)'],['../classentt_1_1dense__hash__set.html#a79f6b13717510e261bf07616c707a0f2',1,'entt::dense_hash_set::end() const'],['../classentt_1_1dense__hash__set.html#aa44e1d209c5244ef98ae5880c4792379',1,'entt::dense_hash_set::end()'],['../classentt_1_1dense__hash__set.html#a9ee994b6d14ed9feb1b6e5b85a97a216',1,'entt::dense_hash_set::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__hash__set.html#a7690893f55722351b7b390699f943e6e',1,'entt::dense_hash_set::end([[maybe_unused]] const size_type index)'],['../structentt_1_1iterable__adaptor.html#a22e90b6cc6b986e07c3688de97f4a67b',1,'entt::iterable_adaptor::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ab6de232202dda2dd5cb0c76786caa0c9',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a75ba21a338f486624790b81b5cbf2904',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__observer.html#a730adbbd4f425bbf9d69b8bb4a0e2ac2',1,'entt::basic_observer::end()'],['../classentt_1_1basic__runtime__view.html#a5fc38f0e738d83d81a98b65b0e45d30b',1,'entt::basic_runtime_view::end()'],['../classentt_1_1basic__sparse__set.html#a34c40a25499f47f87e13591aa378a0fb',1,'entt::basic_sparse_set::end()'],['../classentt_1_1basic__storage.html#aaf44df9657be2a7975caf69cf92a4d3b',1,'entt::basic_storage::end() const'],['../classentt_1_1basic__storage.html#a19fe48ae234f9725c80948b19e705889',1,'entt::basic_storage::end()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3ada36e39b06701a9e0b7c7ab0d9cc84',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a0dbbf2ac4441e4f943c463b6b4d100d3',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::end()'],['../classentt_1_1meta__sequence__container.html#a4135860b75cc96aca7fa1212d5b17743',1,'entt::meta_sequence_container::end()'],['../classentt_1_1meta__associative__container.html#a33088db7e4cf2bc52ec2d47fa62d4705',1,'entt::meta_associative_container::end()'],['../structentt_1_1meta__range.html#a57c7d271b68054016e4430c9859a6d43',1,'entt::meta_range::end()']]], - ['enqueue_842',['enqueue',['../classentt_1_1dispatcher.html#a328a3693688d02f17356aec3ad0e0e24',1,'entt::dispatcher::enqueue(Args &&...args)'],['../classentt_1_1dispatcher.html#a1e0a488354698cbf3cba82396ac4b76e',1,'entt::dispatcher::enqueue(Event &&event)']]], - ['entities_843',['entities',['../classentt_1_1basic__snapshot.html#a79fe1641f3b448b37b8aecfcabf52a5e',1,'entt::basic_snapshot::entities()'],['../classentt_1_1basic__snapshot__loader.html#a0ee608c24b47e2f54a1224177a0dc741',1,'entt::basic_snapshot_loader::entities()'],['../classentt_1_1basic__continuous__loader.html#ae6655c1c6868b11f2781cec2aee77abb',1,'entt::basic_continuous_loader::entities()']]], - ['entity_844',['entity',['../structentt_1_1basic__handle.html#a2710bc7f03d90693bbccceb3364e9494',1,'entt::basic_handle']]], - ['erase_845',['erase',['../classentt_1_1dense__hash__map.html#a9e7c762714af6e758140d4623c238c0c',1,'entt::dense_hash_map::erase(const_iterator pos)'],['../classentt_1_1dense__hash__map.html#a61032bc0a20016eacde54c9de2d5bf9a',1,'entt::dense_hash_map::erase(const_iterator first, const_iterator last)'],['../classentt_1_1dense__hash__map.html#a1b98dc9a6785a47f0db02028ab379c36',1,'entt::dense_hash_map::erase(const key_type &key)'],['../classentt_1_1dense__hash__set.html#a3bb014446d081e614e1738cf79a6077a',1,'entt::dense_hash_set::erase(const_iterator pos)'],['../classentt_1_1dense__hash__set.html#aced2a3f170ca6dcf2d9ed721519c0858',1,'entt::dense_hash_set::erase(const_iterator first, const_iterator last)'],['../classentt_1_1dense__hash__set.html#a6f1eb82a03cb9a73798d7306a651d4d1',1,'entt::dense_hash_set::erase(const value_type &value)'],['../structentt_1_1basic__handle.html#acf95b97a6facfb65d4405d944e390c68',1,'entt::basic_handle::erase()'],['../classentt_1_1basic__registry.html#ad7a51ade7ff181d7aa0b35915d0a4f2b',1,'entt::basic_registry::erase(const entity_type entity)'],['../classentt_1_1basic__registry.html#a887809806fd5188fe141525aad138a6c',1,'entt::basic_registry::erase(It first, It last)'],['../classentt_1_1basic__sparse__set.html#a0a41589e81003ca86b8a6104842680cb',1,'entt::basic_sparse_set::erase(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#a1f3bad1bb267d515e61fd717f4dbb011',1,'entt::basic_sparse_set::erase(It first, It last)'],['../classentt_1_1meta__sequence__container.html#aa9217ce5b5060ec970b67f25eacef021',1,'entt::meta_sequence_container::erase()'],['../classentt_1_1meta__associative__container.html#ab171d3ca8fd0787911540ac8c7cb2818',1,'entt::meta_associative_container::erase()'],['../classentt_1_1emitter.html#a9525364769b8daf55dd942599aa0a09c',1,'entt::emitter::erase()']]], - ['extent_846',['extent',['../classentt_1_1basic__sparse__set.html#a9df44971fcaba319e05955a2943baa14',1,'entt::basic_sparse_set']]] + ['each_824',['each',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aded1e293c764ce80e77edf99c3015670',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a1da3cf6bed972be901bc1de385c4c112',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7a5fd57faabed2807b21b5a6355b3f94',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a7e04e6a84be82f491283b8f11f9e93da',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__observer.html#a181a6724835a3a41e33610003f738525',1,'entt::basic_observer::each(Func func) const'],['../classentt_1_1basic__observer.html#a535f3ddf32641a54e1c8861519933c97',1,'entt::basic_observer::each(Func func)'],['../classentt_1_1basic__registry.html#a86d2b035f54225d82548e8f03de28754',1,'entt::basic_registry::each()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#ac01f845d06ff929c7318fd7b123a3f7e',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::each()'],['../classentt_1_1basic__storage.html#a58a7d59cbbacef83d9c8897ece381b71',1,'entt::basic_storage::each()'],['../classentt_1_1basic__storage.html#af96e8092c6380da54b1edd8fe513618e',1,'entt::basic_storage::each() const'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a6053bb7998214f4c7ee8d6f0102ca5e6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a3160b3ba651856a9796adf396276b6d7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::each() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ad2bf4f55f4724aba209a8578a1436f1b',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a9504ec9cb2f42300b1a1c723b1df7252',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::each() const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a2660b2e7fd36f8438a564fabcbb8d61d',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each(Func func) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#acdd97fb1a4ff44d57b751d2bbb054f61',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::each() const']]], + ['emitter_825',['emitter',['../classentt_1_1emitter.html#af36907a2dc7cc0a6607533c67e072f92',1,'entt::emitter::emitter()=default'],['../classentt_1_1emitter.html#a842fef69b914a160b0bcc211bb77b27b',1,'entt::emitter::emitter(emitter &&)=default']]], + ['emplace_826',['emplace',['../classentt_1_1dense__map.html#aae95d12d4f3b6db611fd9d061b242596',1,'entt::dense_map::emplace()'],['../classentt_1_1dense__set.html#a2cf312c6d6d94d701db9674ca24a2353',1,'entt::dense_set::emplace()'],['../classentt_1_1basic__any.html#a612abee6a4ebf016df27929668839fc0',1,'entt::basic_any::emplace()'],['../structentt_1_1basic__handle.html#a910e13063772bbd2c14a3287ea913ffd',1,'entt::basic_handle::emplace()'],['../classentt_1_1basic__organizer.html#a9c26a53ceaa41f54d88678b636e96ad5',1,'entt::basic_organizer::emplace(const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#ae28283f55e13443712ddfd29bf01f9f7',1,'entt::basic_organizer::emplace(Type &value_or_instance, const char *name=nullptr)'],['../classentt_1_1basic__organizer.html#abed2a897fe81bd69f85ed9305c1fcdc3',1,'entt::basic_organizer::emplace(function_type *func, const void *payload=nullptr, const char *name=nullptr)'],['../classentt_1_1basic__registry.html#a4c9c0532972adc7a930a50888a97efdf',1,'entt::basic_registry::emplace()'],['../classentt_1_1sigh__storage__mixin.html#ae09e60b8a910ebbcca85b8bd188027c3',1,'entt::sigh_storage_mixin::emplace()'],['../classentt_1_1basic__sparse__set.html#a5b8e9abf9cbe8e9955b4f6f12f4c19b2',1,'entt::basic_sparse_set::emplace()'],['../classentt_1_1basic__storage.html#a7e6c99b2c108586141a75145748b2e8d',1,'entt::basic_storage::emplace()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ae3f1982eeb9d1dbcf61b55091df2e9a5',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::emplace()'],['../structentt_1_1locator.html#ab01151d77654a589cc94b302ced3c679',1,'entt::locator::emplace()'],['../classentt_1_1meta__any.html#a3bb2e8e8a5eeb1cfaf1710b43382fef4',1,'entt::meta_any::emplace()'],['../classentt_1_1basic__poly.html#a6aaa4ef03f6f2a599abcf633412d6a8d',1,'entt::basic_poly::emplace()']]], + ['emplace_5for_5freplace_827',['emplace_or_replace',['../structentt_1_1basic__handle.html#a86866a41493a4136f1f50f87bf082e77',1,'entt::basic_handle::emplace_or_replace()'],['../classentt_1_1basic__registry.html#a3bbaebbb9365eef262453e42a8f7dc4b',1,'entt::basic_registry::emplace_or_replace()']]], + ['empty_828',['empty',['../classentt_1_1dense__map.html#aea10a92374160b51ee9ed3e6478c0794',1,'entt::dense_map::empty()'],['../classentt_1_1dense__set.html#a09be88c9817f9ab0a7cfbfb584a3c0b3',1,'entt::dense_set::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac3ffbc5007d5215df8d602aa16bbaa26',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad8297620981e3f64f2c2ba9122b2330f',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::empty()'],['../classentt_1_1basic__observer.html#a591a0ed89d0b2cabfb51b729bfb33c3e',1,'entt::basic_observer::empty()'],['../classentt_1_1basic__registry.html#a519426ee64b3f6574b99e86b31acca14',1,'entt::basic_registry::empty()'],['../classentt_1_1basic__sparse__set.html#a3617c860500230b880f07215f21cb496',1,'entt::basic_sparse_set::empty()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aac7ae1d31c946459a6987d9f5bc15359',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::empty()'],['../classentt_1_1scheduler.html#af12c8d59db78f91c3fdc144e90f24155',1,'entt::scheduler::empty()'],['../classentt_1_1resource__cache.html#a764d7a559461002c10c4163bf31609dc',1,'entt::resource_cache::empty()'],['../classentt_1_1emitter.html#a08c6111af231c9a82277069a3bf21b75',1,'entt::emitter::empty() const'],['../classentt_1_1emitter.html#ad395b7c4de0f1f6e01a6e1c113db6937',1,'entt::emitter::empty() const'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ad795af78f60131f0b5535379ed2862f8',1,'entt::sigh< Ret(Args...), Allocator >::empty()'],['../classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html#afaf6a5593b48f50aa147a622bae61e28',1,'entt::sink< sigh< Ret(Args...), Allocator > >::empty()']]], + ['end_829',['end',['../classentt_1_1dense__map.html#a99770e28badfb2f0fed214c1f98af532',1,'entt::dense_map::end() const'],['../classentt_1_1dense__map.html#a4483cb816f7a534a52abe915256e59fb',1,'entt::dense_map::end()'],['../classentt_1_1dense__map.html#a8f189067d9876f13f15ad94deaff1fcd',1,'entt::dense_map::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__map.html#a93abf3bc3a57a4ecf3c2d899ae9614e1',1,'entt::dense_map::end([[maybe_unused]] const size_type index)'],['../classentt_1_1dense__set.html#a406d8a3b304f0c297f070ce430ca8e28',1,'entt::dense_set::end() const'],['../classentt_1_1dense__set.html#ab9b6cf5f94c9f86d8f227321e6e0247c',1,'entt::dense_set::end()'],['../classentt_1_1dense__set.html#a95160ca1c1af1ac0d036eddf11b1fe42',1,'entt::dense_set::end([[maybe_unused]] const size_type index) const'],['../classentt_1_1dense__set.html#a56deb9de4bb522af0bac4eccd1d10dfa',1,'entt::dense_set::end([[maybe_unused]] const size_type index)'],['../structentt_1_1iterable__adaptor.html#a91d5e906cec2aeae1289ac8f06774295',1,'entt::iterable_adaptor::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ab6de232202dda2dd5cb0c76786caa0c9',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a75ba21a338f486624790b81b5cbf2904',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__observer.html#a730adbbd4f425bbf9d69b8bb4a0e2ac2',1,'entt::basic_observer::end()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#ac91472891e1c83bd5e3d7b3936268148',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::end()'],['../classentt_1_1basic__sparse__set.html#a34c40a25499f47f87e13591aa378a0fb',1,'entt::basic_sparse_set::end()'],['../classentt_1_1basic__storage.html#aaf44df9657be2a7975caf69cf92a4d3b',1,'entt::basic_storage::end() const'],['../classentt_1_1basic__storage.html#a19fe48ae234f9725c80948b19e705889',1,'entt::basic_storage::end()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a3ada36e39b06701a9e0b7c7ab0d9cc84',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::end()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a0dbbf2ac4441e4f943c463b6b4d100d3',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::end()'],['../classentt_1_1meta__sequence__container.html#a4135860b75cc96aca7fa1212d5b17743',1,'entt::meta_sequence_container::end()'],['../classentt_1_1meta__associative__container.html#a33088db7e4cf2bc52ec2d47fa62d4705',1,'entt::meta_associative_container::end()'],['../structentt_1_1meta__range.html#a57c7d271b68054016e4430c9859a6d43',1,'entt::meta_range::end()'],['../classentt_1_1resource__cache.html#af1cc6e780dbb6f51e7148051c0b24202',1,'entt::resource_cache::end() const'],['../classentt_1_1resource__cache.html#a0701aef8b311f0f2801d889a926bce9c',1,'entt::resource_cache::end()']]], + ['enqueue_830',['enqueue',['../classentt_1_1basic__dispatcher.html#aefeb6cfbb14cf16ad7bee0148a324867',1,'entt::basic_dispatcher::enqueue(Args &&...args)'],['../classentt_1_1basic__dispatcher.html#a20300e90ffc19c714c071aecd3539523',1,'entt::basic_dispatcher::enqueue(Event &&event)']]], + ['enqueue_5fhint_831',['enqueue_hint',['../classentt_1_1basic__dispatcher.html#a3da25e303527faa6f57616a077333681',1,'entt::basic_dispatcher::enqueue_hint(const id_type id, Args &&...args)'],['../classentt_1_1basic__dispatcher.html#acb5874579dc28c664c265883a49cad8f',1,'entt::basic_dispatcher::enqueue_hint(const id_type id, Event &&event)']]], + ['entities_832',['entities',['../classentt_1_1basic__snapshot.html#a79fe1641f3b448b37b8aecfcabf52a5e',1,'entt::basic_snapshot::entities()'],['../classentt_1_1basic__snapshot__loader.html#a0ee608c24b47e2f54a1224177a0dc741',1,'entt::basic_snapshot_loader::entities()'],['../classentt_1_1basic__continuous__loader.html#ae6655c1c6868b11f2781cec2aee77abb',1,'entt::basic_continuous_loader::entities()']]], + ['entity_833',['entity',['../structentt_1_1basic__handle.html#a2710bc7f03d90693bbccceb3364e9494',1,'entt::basic_handle']]], + ['erase_834',['erase',['../classentt_1_1dense__map.html#a83036e3f167d28ba9afa943271fb5587',1,'entt::dense_map::erase(const_iterator pos)'],['../classentt_1_1dense__map.html#a49bb9a8de8e27cff97395d4fc527ad04',1,'entt::dense_map::erase(const_iterator first, const_iterator last)'],['../classentt_1_1dense__map.html#a12d1730a14bac304cbd173c05cb2cbf2',1,'entt::dense_map::erase(const key_type &key)'],['../classentt_1_1dense__set.html#ad4ada548c135e15f963efcbdac476e1b',1,'entt::dense_set::erase(const_iterator pos)'],['../classentt_1_1dense__set.html#a2c82fe5721d008445d6bb9af2448cbcd',1,'entt::dense_set::erase(const_iterator first, const_iterator last)'],['../classentt_1_1dense__set.html#abe614f630f49556a49f65c7ed3e1183a',1,'entt::dense_set::erase(const value_type &value)'],['../structentt_1_1basic__handle.html#acf95b97a6facfb65d4405d944e390c68',1,'entt::basic_handle::erase()'],['../classentt_1_1basic__registry.html#ad7a51ade7ff181d7aa0b35915d0a4f2b',1,'entt::basic_registry::erase(const entity_type entity)'],['../classentt_1_1basic__registry.html#a887809806fd5188fe141525aad138a6c',1,'entt::basic_registry::erase(It first, It last)'],['../classentt_1_1basic__sparse__set.html#a0a41589e81003ca86b8a6104842680cb',1,'entt::basic_sparse_set::erase(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#a1f3bad1bb267d515e61fd717f4dbb011',1,'entt::basic_sparse_set::erase(It first, It last)'],['../classentt_1_1meta__sequence__container.html#aa9217ce5b5060ec970b67f25eacef021',1,'entt::meta_sequence_container::erase()'],['../classentt_1_1meta__associative__container.html#ab171d3ca8fd0787911540ac8c7cb2818',1,'entt::meta_associative_container::erase()'],['../classentt_1_1resource__cache.html#a59fd1af63515fbb9e9ed26cb13dbe041',1,'entt::resource_cache::erase(const_iterator pos)'],['../classentt_1_1resource__cache.html#af9938c0c0228fd59b67470e7a904cf3a',1,'entt::resource_cache::erase(const_iterator first, const_iterator last)'],['../classentt_1_1resource__cache.html#a0166a373140e75be2c5b41ccd39d8375',1,'entt::resource_cache::erase(const id_type id)'],['../classentt_1_1emitter.html#a9525364769b8daf55dd942599aa0a09c',1,'entt::emitter::erase()']]], + ['exclude_835',['exclude',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#afc46e46972b73a235058399f5514c402',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >']]], + ['extent_836',['extent',['../classentt_1_1basic__sparse__set.html#a9df44971fcaba319e05955a2943baa14',1,'entt::basic_sparse_set']]] ]; diff --git a/search/functions_5.js b/search/functions_5.js index 8d8553060..d71df0734 100644 --- a/search/functions_5.js +++ b/search/functions_5.js @@ -1,12 +1,13 @@ var searchData= [ - ['fail_847',['fail',['../classentt_1_1process.html#a43cb8f82148fb6d688fcc9eca358892a',1,'entt::process']]], - ['fast_5fmod_848',['fast_mod',['../namespaceentt.html#a28fe7952c2a11ebc2b47d95fb749adda',1,'entt']]], - ['find_849',['find',['../classentt_1_1dense__hash__map.html#a3fd2b636b76186f0ca533272f9d0cdc9',1,'entt::dense_hash_map::find(const key_type &key)'],['../classentt_1_1dense__hash__map.html#a241db02c8b817ddcc719852d94983d03',1,'entt::dense_hash_map::find(const key_type &key) const'],['../classentt_1_1dense__hash__map.html#ad7a4f36d1824b400e1cde0d489425112',1,'entt::dense_hash_map::find(const Other &key)'],['../classentt_1_1dense__hash__map.html#aa1cfdc510527f6d26a29097f368d5d6d',1,'entt::dense_hash_map::find(const Other &key) const'],['../classentt_1_1dense__hash__set.html#a0e811a6c5e27c8ecbbd0881f3f4e984a',1,'entt::dense_hash_set::find(const value_type &value)'],['../classentt_1_1dense__hash__set.html#afe3dd99554cfe0133a9daaa103993084',1,'entt::dense_hash_set::find(const value_type &value) const'],['../classentt_1_1dense__hash__set.html#af896fa38e01405f432196eab938e6fa2',1,'entt::dense_hash_set::find(const Other &value)'],['../classentt_1_1dense__hash__set.html#a21ec1289ede45e871ba74cc7152fde25',1,'entt::dense_hash_set::find(const Other &value) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac2d477372d9e935a65a48837fdcf9bcb',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad4b27437cb2afe0d10895c947fdd8b4e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__sparse__set.html#a82ea72545db86b1c25a790772d015c3d',1,'entt::basic_sparse_set::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a287ba682eec0501138b8ffd0802f3d75',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a563cf005cc97d5684cebb8e7e56c0ee5',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::find()'],['../classentt_1_1meta__associative__container.html#a2886d0a5df87b31cb7c8804ab097b585',1,'entt::meta_associative_container::find()']]], - ['finished_850',['finished',['../classentt_1_1process.html#a5de9babd993af32324cf044102e0c5b2',1,'entt::process']]], - ['first_851',['first',['../classentt_1_1compressed__pair.html#a805ab68ef0b7776421ee4bf8e06110b8',1,'entt::compressed_pair::first()'],['../classentt_1_1compressed__pair.html#ad1a1aa91e51aff649bbcf4110a3a42bc',1,'entt::compressed_pair::first() const']]], - ['forward_5fas_5fany_852',['forward_as_any',['../namespaceentt.html#a810f66c2c91deba50f96cae9119f2feb',1,'entt']]], - ['forward_5fas_5fmeta_853',['forward_as_meta',['../namespaceentt.html#a77c7a5a8ac08bc879abdaa00f920a996',1,'entt']]], - ['front_854',['front',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a93c6dc5202ec19f518cafc6ccee7b8d0',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a4eac71cfa295892fb8a8171cd2c7ad06',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa19f76497105652b9d238f80bec72623',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a37b3245c9540f3122f9e791c6210d183',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::front()']]], - ['func_855',['func',['../classentt_1_1meta__factory_3_01Type_01_4.html#aaa7071ebe16911bc60f1cac87d119611',1,'entt::meta_factory< Type >::func()'],['../classentt_1_1meta__type.html#a28ca81206511c7f9aa55cca85e687a5d',1,'entt::meta_type::func() const'],['../classentt_1_1meta__type.html#a3e345e527b4f36c2146254e1ed9b6649',1,'entt::meta_type::func(const id_type id) const']]] + ['fail_837',['fail',['../classentt_1_1process.html#a43cb8f82148fb6d688fcc9eca358892a',1,'entt::process']]], + ['fast_5fmod_838',['fast_mod',['../namespaceentt.html#a28fe7952c2a11ebc2b47d95fb749adda',1,'entt']]], + ['find_839',['find',['../classentt_1_1dense__map.html#a77aa062268245a84c4c27dcc01839814',1,'entt::dense_map::find(const key_type &key)'],['../classentt_1_1dense__map.html#a5b47e5c447352298fca87921774c4a3d',1,'entt::dense_map::find(const key_type &key) const'],['../classentt_1_1dense__map.html#ab38c37f74845b4fcee780be50a4468bd',1,'entt::dense_map::find(const Other &key)'],['../classentt_1_1dense__map.html#afe6fec31e84e2783bc7b740d4373e5ec',1,'entt::dense_map::find(const Other &key) const'],['../classentt_1_1dense__set.html#a3cb64f1ed07507fc9ecbc6f94e582e44',1,'entt::dense_set::find(const value_type &value)'],['../classentt_1_1dense__set.html#a6e8732dc86fd8f04f585deebb0b39ad5',1,'entt::dense_set::find(const value_type &value) const'],['../classentt_1_1dense__set.html#a66102dbe9ecb0e7e70f33b1b012ba288',1,'entt::dense_set::find(const Other &value)'],['../classentt_1_1dense__set.html#aaecba9bf17f757c52d1caee78c6ca2b1',1,'entt::dense_set::find(const Other &value) const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac2d477372d9e935a65a48837fdcf9bcb',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ad4b27437cb2afe0d10895c947fdd8b4e',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__sparse__set.html#a82ea72545db86b1c25a790772d015c3d',1,'entt::basic_sparse_set::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a287ba682eec0501138b8ffd0802f3d75',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::find()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a563cf005cc97d5684cebb8e7e56c0ee5',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::find()'],['../classentt_1_1meta__associative__container.html#a2886d0a5df87b31cb7c8804ab097b585',1,'entt::meta_associative_container::find()']]], + ['finished_840',['finished',['../classentt_1_1process.html#a5de9babd993af32324cf044102e0c5b2',1,'entt::process']]], + ['first_841',['first',['../classentt_1_1compressed__pair.html#a805ab68ef0b7776421ee4bf8e06110b8',1,'entt::compressed_pair::first()'],['../classentt_1_1compressed__pair.html#ad1a1aa91e51aff649bbcf4110a3a42bc',1,'entt::compressed_pair::first() const']]], + ['force_5fload_842',['force_load',['../classentt_1_1resource__cache.html#a3a29a1bce27e98fd4f8407fb9eb5b58e',1,'entt::resource_cache']]], + ['forward_5fas_5fany_843',['forward_as_any',['../namespaceentt.html#a810f66c2c91deba50f96cae9119f2feb',1,'entt']]], + ['forward_5fas_5fmeta_844',['forward_as_meta',['../namespaceentt.html#a77c7a5a8ac08bc879abdaa00f920a996',1,'entt']]], + ['front_845',['front',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a93c6dc5202ec19f518cafc6ccee7b8d0',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a4eac71cfa295892fb8a8171cd2c7ad06',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa19f76497105652b9d238f80bec72623',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::front()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a37b3245c9540f3122f9e791c6210d183',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::front()']]], + ['func_846',['func',['../classentt_1_1meta__factory_3_01Type_01_4.html#aaa7071ebe16911bc60f1cac87d119611',1,'entt::meta_factory< Type >::func()'],['../classentt_1_1meta__type.html#a28ca81206511c7f9aa55cca85e687a5d',1,'entt::meta_type::func() const'],['../classentt_1_1meta__type.html#a3e345e527b4f36c2146254e1ed9b6649',1,'entt::meta_type::func(const id_type id) const']]] ]; diff --git a/search/functions_6.js b/search/functions_6.js index 0734db4a4..14c79c1f2 100644 --- a/search/functions_6.js +++ b/search/functions_6.js @@ -1,11 +1,10 @@ var searchData= [ - ['get_856',['get',['../classentt_1_1compressed__pair.html#a26925f0fdea3a43aab4bb53763a377af',1,'entt::compressed_pair::get()'],['../classentt_1_1compressed__pair.html#a74e585a52a150969030cf28867de1ca5',1,'entt::compressed_pair::get() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a242ad9c9470fb5eb0768dff41fc5daf6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a36ff5e13b90d71785c78020e9ee999d9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../structentt_1_1basic__handle.html#a1e27c0778d8018e7c54249a365716127',1,'entt::basic_handle::get()'],['../classentt_1_1basic__registry.html#a3a683bb33971cc5a0bbbf4a9409208df',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity) const'],['../classentt_1_1basic__registry.html#a0b1a73cf6349646adfd6a6715be93df1',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity)'],['../classentt_1_1basic__sparse__set.html#a5cb0c7a8bab49d31b3351739209b24d0',1,'entt::basic_sparse_set::get(const entity_type entt) const'],['../classentt_1_1basic__sparse__set.html#af14c08f49b27ce6404d1603b0c28f472',1,'entt::basic_sparse_set::get(const entity_type entt)'],['../classentt_1_1basic__storage.html#afdb98de467567bf81772382ba2970413',1,'entt::basic_storage::get(const entity_type entt) const'],['../classentt_1_1basic__storage.html#a05808e1a5b2f90d23fb01fb15a1effba',1,'entt::basic_storage::get(const entity_type entt)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aa4e1de1896a651e5dd15a332fa95e4cc',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ac36208f2be65bfcd89f82198d34f40aa',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aec4e611c49123dfed2fbf3944ad91144',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../structentt_1_1service__locator.html#a88134390e70265359dda08f5aba2877f',1,'entt::service_locator::get()'],['../classentt_1_1meta__any.html#a57e3fcd87f90240e6152324ab8e761dc',1,'entt::meta_any::get(const id_type id) const'],['../classentt_1_1meta__any.html#ac79a3b8f874ad75bcccaa2055dc730fb',1,'entt::meta_any::get(const id_type id)'],['../structentt_1_1meta__data.html#a754da41b4c8057f7c9a3ff4738935d04',1,'entt::meta_data::get()'],['../classentt_1_1meta__type.html#ab702cf8050c2625eaf9e4c82c8381117',1,'entt::meta_type::get()'],['../classentt_1_1resource__handle.html#a31d8af87e1bf0fd0502da76fd2797cfd',1,'entt::resource_handle::get()']]], - ['get_5fallocator_857',['get_allocator',['../classentt_1_1dense__hash__map.html#a611d61b365bc13cad473665e9f474e72',1,'entt::dense_hash_map::get_allocator()'],['../classentt_1_1dense__hash__set.html#a6462c1ffe716a5a9bc9bc9b33d6161d1',1,'entt::dense_hash_set::get_allocator()'],['../classentt_1_1basic__sparse__set.html#ade252400c95d50a4a2dcc97cd1c12de3',1,'entt::basic_sparse_set::get_allocator()'],['../classentt_1_1basic__storage.html#ac59504fc3055e5543c555989e295c4ba',1,'entt::basic_storage::get_allocator()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a2b2fa7fed833654ab4ba5625d5b81af7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_allocator()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a8bd1f4b5715aca937fb047b1493e4926',1,'entt::sigh< Ret(Args...), Allocator >::get_allocator()']]], - ['get_5fas_5ftuple_858',['get_as_tuple',['../classentt_1_1basic__storage.html#afcf228fe6c79886e49ce98274a80dcc3',1,'entt::basic_storage::get_as_tuple(const entity_type entt) const'],['../classentt_1_1basic__storage.html#a4fef4784b0834dd36644746dde9f4f84',1,'entt::basic_storage::get_as_tuple(const entity_type entt)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a7f4f6cd9032955d975bc7da5e5577231',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_as_tuple()']]], - ['get_5fat_859',['get_at',['../classentt_1_1basic__sparse__set.html#a47d951c4f97bfb7f871d1a2bcc475e7c',1,'entt::basic_sparse_set::get_at()'],['../classentt_1_1basic__storage.html#a861f8c31572ffcf76c8cc0c0e83945e7',1,'entt::basic_storage::get_at()']]], - ['get_5for_5femplace_860',['get_or_emplace',['../structentt_1_1basic__handle.html#ad992486f889906c7e15d38a1b9d9e842',1,'entt::basic_handle::get_or_emplace()'],['../classentt_1_1basic__registry.html#a9c355683752313135c209bc7ba9820bc',1,'entt::basic_registry::get_or_emplace()']]], - ['graph_861',['graph',['../classentt_1_1basic__organizer.html#abb49a4c59833592036dce927cae6143d',1,'entt::basic_organizer']]], - ['group_862',['group',['../structentt_1_1basic__collector_3_4.html#a40cd31653a616e0e87a6f9d840c36d5d',1,'entt::basic_collector<>::group()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a72c0576faa0e9a418fa72fd25987b9f4',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::group()'],['../classentt_1_1basic__registry.html#afcbbbd8a765fa8133d384806d60d5828',1,'entt::basic_registry::group(get_t< Get... >, exclude_t< Exclude... >={})'],['../classentt_1_1basic__registry.html#a51b8e8123331de142d031953a847ac3b',1,'entt::basic_registry::group(exclude_t< Exclude... >={})']]], - ['group_5fif_5fexists_863',['group_if_exists',['../classentt_1_1basic__registry.html#af6565c2b50a938f6a594f6a28bbfd804',1,'entt::basic_registry::group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#aa53e065b954c58908db7eb87e8863612',1,'entt::basic_registry::group_if_exists(exclude_t< Exclude... >={}) const']]] + ['get_847',['get',['../classentt_1_1compressed__pair.html#a26925f0fdea3a43aab4bb53763a377af',1,'entt::compressed_pair::get()'],['../classentt_1_1compressed__pair.html#a74e585a52a150969030cf28867de1ca5',1,'entt::compressed_pair::get() const'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a242ad9c9470fb5eb0768dff41fc5daf6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a36ff5e13b90d71785c78020e9ee999d9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::get()'],['../structentt_1_1basic__handle.html#a1e27c0778d8018e7c54249a365716127',1,'entt::basic_handle::get()'],['../classentt_1_1basic__registry.html#a3a683bb33971cc5a0bbbf4a9409208df',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity) const'],['../classentt_1_1basic__registry.html#a0b1a73cf6349646adfd6a6715be93df1',1,'entt::basic_registry::get([[maybe_unused]] const entity_type entity)'],['../classentt_1_1basic__sparse__set.html#a5cb0c7a8bab49d31b3351739209b24d0',1,'entt::basic_sparse_set::get(const entity_type entt) const'],['../classentt_1_1basic__sparse__set.html#af14c08f49b27ce6404d1603b0c28f472',1,'entt::basic_sparse_set::get(const entity_type entt)'],['../classentt_1_1basic__storage.html#afdb98de467567bf81772382ba2970413',1,'entt::basic_storage::get(const entity_type entt) const'],['../classentt_1_1basic__storage.html#a05808e1a5b2f90d23fb01fb15a1effba',1,'entt::basic_storage::get(const entity_type entt)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aa4e1de1896a651e5dd15a332fa95e4cc',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#ac36208f2be65bfcd89f82198d34f40aa',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aec4e611c49123dfed2fbf3944ad91144',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a5411dd99682276fe044e60c53540ed21',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::get(const entity_type entt) const'],['../classentt_1_1meta__any.html#a57e3fcd87f90240e6152324ab8e761dc',1,'entt::meta_any::get(const id_type id) const'],['../classentt_1_1meta__any.html#ac79a3b8f874ad75bcccaa2055dc730fb',1,'entt::meta_any::get(const id_type id)'],['../structentt_1_1meta__data.html#a754da41b4c8057f7c9a3ff4738935d04',1,'entt::meta_data::get()'],['../classentt_1_1meta__type.html#ab702cf8050c2625eaf9e4c82c8381117',1,'entt::meta_type::get()']]], + ['get_5fallocator_848',['get_allocator',['../classentt_1_1dense__map.html#add2b683b0072d4b74e5431ae94b894ca',1,'entt::dense_map::get_allocator()'],['../classentt_1_1dense__set.html#a3db7a9585119a95c8bec8bbb58677790',1,'entt::dense_set::get_allocator()'],['../classentt_1_1basic__sparse__set.html#ade252400c95d50a4a2dcc97cd1c12de3',1,'entt::basic_sparse_set::get_allocator()'],['../classentt_1_1basic__storage.html#ac59504fc3055e5543c555989e295c4ba',1,'entt::basic_storage::get_allocator()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a2b2fa7fed833654ab4ba5625d5b81af7',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_allocator()'],['../classentt_1_1resource__cache.html#a7fbba6086da8afe5a19edfb569ccfb21',1,'entt::resource_cache::get_allocator()'],['../classentt_1_1basic__dispatcher.html#a10d41d34e7119af95ee716fbdc99e51f',1,'entt::basic_dispatcher::get_allocator()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a8bd1f4b5715aca937fb047b1493e4926',1,'entt::sigh< Ret(Args...), Allocator >::get_allocator()']]], + ['get_5fas_5ftuple_849',['get_as_tuple',['../classentt_1_1basic__storage.html#afcf228fe6c79886e49ce98274a80dcc3',1,'entt::basic_storage::get_as_tuple(const entity_type entt) const'],['../classentt_1_1basic__storage.html#a4fef4784b0834dd36644746dde9f4f84',1,'entt::basic_storage::get_as_tuple(const entity_type entt)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a7f4f6cd9032955d975bc7da5e5577231',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::get_as_tuple()']]], + ['get_5for_5femplace_850',['get_or_emplace',['../structentt_1_1basic__handle.html#ad992486f889906c7e15d38a1b9d9e842',1,'entt::basic_handle::get_or_emplace()'],['../classentt_1_1basic__registry.html#a9c355683752313135c209bc7ba9820bc',1,'entt::basic_registry::get_or_emplace()']]], + ['graph_851',['graph',['../classentt_1_1basic__organizer.html#abb49a4c59833592036dce927cae6143d',1,'entt::basic_organizer']]], + ['group_852',['group',['../structentt_1_1basic__collector_3_4.html#a40cd31653a616e0e87a6f9d840c36d5d',1,'entt::basic_collector<>::group()'],['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#a72c0576faa0e9a418fa72fd25987b9f4',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::group()'],['../classentt_1_1basic__registry.html#addce99ec727e0879d3d85121b9c44fee',1,'entt::basic_registry::group(get_t< Get... >, exclude_t< Exclude... >={})'],['../classentt_1_1basic__registry.html#ae898414dbf6aa9bb22b54b36e97953ba',1,'entt::basic_registry::group(exclude_t< Exclude... >={})']]], + ['group_5fif_5fexists_853',['group_if_exists',['../classentt_1_1basic__registry.html#a7b9e34350c1b545cf7087adc3e570a3c',1,'entt::basic_registry::group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) const'],['../classentt_1_1basic__registry.html#aea999ab0b78f773100516b3689a31944',1,'entt::basic_registry::group_if_exists(exclude_t< Exclude... >={}) const']]] ]; diff --git a/search/functions_7.js b/search/functions_7.js index d4a4e649b..ef153ce39 100644 --- a/search/functions_7.js +++ b/search/functions_7.js @@ -1,6 +1,7 @@ var searchData= [ - ['handle_864',['handle',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a7d59e75c62809a425d642f0f90bb18c5',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a0f42aedec77ad7d0c0434c1539c51c6f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ac41277543f1ce2cb02306a5203a6fc8c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::handle()'],['../classentt_1_1resource__cache.html#a4b5cd3213a1f22aa6b8a5c4ce876a630',1,'entt::resource_cache::handle(const id_type id) const'],['../classentt_1_1resource__cache.html#a616c6f32c7bd4db18be22208a3e88e45',1,'entt::resource_cache::handle(const id_type id)']]], - ['hash_865',['hash',['../classentt_1_1type__info.html#a3d7ec25f2563841a8d7a0d3cf26afb2c',1,'entt::type_info']]], - ['hash_5ffunction_866',['hash_function',['../classentt_1_1dense__hash__map.html#a93e17fb3689d7acf44562c1cfc84d565',1,'entt::dense_hash_map::hash_function()'],['../classentt_1_1dense__hash__set.html#a1e8e74dd32d2ea8cbbc87a71479b0c37',1,'entt::dense_hash_set::hash_function()']]] + ['handle_854',['handle',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a7d59e75c62809a425d642f0f90bb18c5',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a0f42aedec77ad7d0c0434c1539c51c6f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::handle()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ac41277543f1ce2cb02306a5203a6fc8c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::handle()']]], + ['has_5fvalue_855',['has_value',['../structentt_1_1locator.html#a8beabd097ab7cb7edc9194b109bc25a2',1,'entt::locator']]], + ['hash_856',['hash',['../structentt_1_1type__info.html#a3d7ec25f2563841a8d7a0d3cf26afb2c',1,'entt::type_info']]], + ['hash_5ffunction_857',['hash_function',['../classentt_1_1dense__map.html#afa1426bfb2ff55c9c4d0471303fcf6cc',1,'entt::dense_map::hash_function()'],['../classentt_1_1dense__set.html#a7f9a2eaac7725273d76b340f6e46c821',1,'entt::dense_set::hash_function()']]] ]; diff --git a/search/functions_8.js b/search/functions_8.js index 2d104a3cf..bab0cad34 100644 --- a/search/functions_8.js +++ b/search/functions_8.js @@ -1,25 +1,26 @@ var searchData= [ - ['id_867',['id',['../structentt_1_1meta__data.html#a5e1bd9202426e41b5a0d1f25874fa7ec',1,'entt::meta_data::id()'],['../structentt_1_1meta__func.html#a5ea4ea1a05e16dcd4b19ade2bf8ffcf9',1,'entt::meta_func::id()'],['../classentt_1_1meta__type.html#aa7cd3deb7464bd95259e836e21bf1710',1,'entt::meta_type::id()']]], - ['in_5fplace_5fpop_868',['in_place_pop',['../classentt_1_1basic__sparse__set.html#ac307017fd20239e750c615986ba97bdf',1,'entt::basic_sparse_set::in_place_pop()'],['../classentt_1_1basic__storage.html#a428656927bf4fda2ef9cd88415e0096b',1,'entt::basic_storage::in_place_pop()']]], - ['index_869',['index',['../classentt_1_1type__info.html#a8281d599d6462d5e3717f570a8daef93',1,'entt::type_info::index()'],['../classentt_1_1basic__sparse__set.html#a1af775539f37a31b1da7254491a53b1f',1,'entt::basic_sparse_set::index()']]], - ['info_870',['info',['../structentt_1_1basic__organizer_1_1vertex.html#ad8302d45c317e73c115bf8b77f89cc1d',1,'entt::basic_organizer::vertex::info()'],['../classentt_1_1meta__type.html#a05199b5705d56386eb18e36ef73cd5f1',1,'entt::meta_type::info()']]], - ['input_5fiterator_5fpointer_871',['input_iterator_pointer',['../structentt_1_1input__iterator__pointer.html#a6ec178da7c2622b21dbf2852c5035bf5',1,'entt::input_iterator_pointer::input_iterator_pointer(const input_iterator_pointer &)=delete'],['../structentt_1_1input__iterator__pointer.html#a2603e381cfe846c6ffaf0376ef3e1882',1,'entt::input_iterator_pointer::input_iterator_pointer(input_iterator_pointer &&)=default'],['../structentt_1_1input__iterator__pointer.html#ae1e2a7eda1fb7650a6bba71590959bbb',1,'entt::input_iterator_pointer::input_iterator_pointer(Type &&val)']]], - ['insert_872',['insert',['../classentt_1_1dense__hash__map.html#a03b7d39d19ffed5acc6d6595744e1ef1',1,'entt::dense_hash_map::insert(const value_type &value)'],['../classentt_1_1dense__hash__map.html#ae0d01d2987f57c021d155042b87c2510',1,'entt::dense_hash_map::insert(value_type &&value)'],['../classentt_1_1dense__hash__map.html#a7a1ec556df5df66db184ef2dda5582f1',1,'entt::dense_hash_map::insert(Arg &&value)'],['../classentt_1_1dense__hash__map.html#a0125eb5324d36d3f5ffed1e562aefb80',1,'entt::dense_hash_map::insert(It first, It last)'],['../classentt_1_1dense__hash__set.html#a771a6075947fd72f7b11e1fc6e5d9767',1,'entt::dense_hash_set::insert(const value_type &value)'],['../classentt_1_1dense__hash__set.html#ae249fe3c8d3a9f721f8c07fd0dbe9128',1,'entt::dense_hash_set::insert(value_type &&value)'],['../classentt_1_1dense__hash__set.html#aca2d94dd4813fd5c3b0fb0c1f6568ce6',1,'entt::dense_hash_set::insert(It first, It last)'],['../classentt_1_1basic__registry.html#a3587004bdab85280c2a2a1b6371fd4c5',1,'entt::basic_registry::insert(It first, It last, const Component &value={})'],['../classentt_1_1basic__registry.html#a1a37b2a842fd3877bc25e3217a01ee11',1,'entt::basic_registry::insert(EIt first, EIt last, CIt from)'],['../classentt_1_1basic__sparse__set.html#a1a3903daddc7ec0a8260d8828b009402',1,'entt::basic_sparse_set::insert()'],['../classentt_1_1basic__storage.html#abc4d7d3a84ecc5fc8e878772074ce35f',1,'entt::basic_storage::insert(It first, It last, const value_type &value={})'],['../classentt_1_1basic__storage.html#ac9670a9916dc77f24403e4a41fdaed96',1,'entt::basic_storage::insert(EIt first, EIt last, CIt from)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a700a2428a1a0469b912b0dbdeb9e91b2',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::insert()'],['../classentt_1_1sigh__storage__mixin.html#a88cb74a6060bd49ea3f26f3921a47f81',1,'entt::sigh_storage_mixin::insert()'],['../classentt_1_1meta__sequence__container.html#aaa0fc1c19ebad3201054dae00952d07f',1,'entt::meta_sequence_container::insert()'],['../classentt_1_1meta__associative__container.html#a292d90c2d8cbee3d6c2c32a899a9cb5e',1,'entt::meta_associative_container::insert()']]], - ['insert_5for_5fassign_873',['insert_or_assign',['../classentt_1_1dense__hash__map.html#a4d60d3f5873f7835029659f303a15ca3',1,'entt::dense_hash_map::insert_or_assign(const key_type &key, Arg &&value)'],['../classentt_1_1dense__hash__map.html#abfef5cf406b5ffd0d12ffd758aaffd30',1,'entt::dense_hash_map::insert_or_assign(key_type &&key, Arg &&value)']]], - ['instance_874',['instance',['../classentt_1_1poly__vtable.html#afb72fb3a81dd22f2ca36b87adebfff46',1,'entt::poly_vtable::instance()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a132448b3ee95cea57ac746f2cd306765',1,'entt::delegate< Ret(Args...)>::instance()']]], - ['invoke_875',['invoke',['../classentt_1_1meta__any.html#acaf2cd2589c5c3f8fa34b8bf7aca03f8',1,'entt::meta_any::invoke(const id_type id, Args &&...args) const'],['../classentt_1_1meta__any.html#a6dd24fc5445f7038c386696355773332',1,'entt::meta_any::invoke(const id_type id, Args &&...args)'],['../structentt_1_1meta__func.html#a83fb3576c1a3873de1e1e041f759180b',1,'entt::meta_func::invoke(meta_handle instance, meta_any *const args, const size_type sz) const'],['../structentt_1_1meta__func.html#aa10b325b5da2a1c04259f2d6dc1f6746',1,'entt::meta_func::invoke(meta_handle instance, Args &&...args) const'],['../classentt_1_1meta__type.html#ad846c918ce1e2f496b7464cc6a6d6d5e',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a99a835b500d3aa1f4f25090d8bef3802',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, Args &&...args) const'],['../structentt_1_1poly__inspector.html#a8539b30952dd5a66aa24f334ae4976de',1,'entt::poly_inspector::invoke(Args &&...args) const'],['../structentt_1_1poly__inspector.html#ac829c393c3d78f306edd0307f71139cb',1,'entt::poly_inspector::invoke(Args &&...args)'],['../structentt_1_1poly__base.html#a814fd041b02ddfe60577b23d174e7182',1,'entt::poly_base::invoke(const poly_base &self, Args &&...args) const'],['../structentt_1_1poly__base.html#a8e782d45ce62d6bd620ad22a0ee913e2',1,'entt::poly_base::invoke(poly_base &self, Args &&...args)'],['../namespaceentt.html#aa512a354fe328df6be5a92eb43cd4d69',1,'entt::invoke()']]], - ['is_5farithmetic_876',['is_arithmetic',['../classentt_1_1meta__type.html#a399e9840beaadc9be07c8ec8acb8a66d',1,'entt::meta_type']]], - ['is_5farray_877',['is_array',['../classentt_1_1meta__type.html#aac2e57ea9054001d5b6575a512337f2a',1,'entt::meta_type']]], - ['is_5fassociative_5fcontainer_878',['is_associative_container',['../classentt_1_1meta__type.html#a1cfeeb52708c5cc454b57904acde9c65',1,'entt::meta_type']]], - ['is_5fclass_879',['is_class',['../classentt_1_1meta__type.html#a8810160ba713e725bf3b672e546fba35',1,'entt::meta_type']]], - ['is_5fconst_880',['is_const',['../structentt_1_1meta__data.html#a821782f679650835b47ac17949bb5f4d',1,'entt::meta_data::is_const()'],['../structentt_1_1meta__func.html#a7d21c937f1e1337e3f9eab27ccee52a9',1,'entt::meta_func::is_const()']]], - ['is_5fenum_881',['is_enum',['../classentt_1_1meta__type.html#ad4467cc578b7bbe9799cbd2984144376',1,'entt::meta_type']]], - ['is_5fpointer_882',['is_pointer',['../classentt_1_1meta__type.html#a83ff488f0e3b09cd82190a000adb16fc',1,'entt::meta_type']]], - ['is_5fpointer_5flike_883',['is_pointer_like',['../classentt_1_1meta__type.html#a9f632add22a4194a8a968badfff7c6f6',1,'entt::meta_type']]], - ['is_5fpower_5fof_5ftwo_884',['is_power_of_two',['../namespaceentt.html#a3755517604de1d9d3f3e0a5549c750c5',1,'entt']]], - ['is_5fsequence_5fcontainer_885',['is_sequence_container',['../classentt_1_1meta__type.html#ab42d82a42e847fc9c5d6ac905c0d3736',1,'entt::meta_type']]], - ['is_5fstatic_886',['is_static',['../structentt_1_1meta__data.html#a08417d17ad41c753ec292abdeafd1782',1,'entt::meta_data::is_static()'],['../structentt_1_1meta__func.html#aab0625ceb6c319304e3d42f12aa1fb54',1,'entt::meta_func::is_static()']]], - ['is_5ftemplate_5fspecialization_887',['is_template_specialization',['../classentt_1_1meta__type.html#ae7d676d99412337ef5214545e61618a6',1,'entt::meta_type']]], - ['iterable_5fadaptor_888',['iterable_adaptor',['../structentt_1_1iterable__adaptor.html#a047f9b4bd49dd52067defbfb50ad1e92',1,'entt::iterable_adaptor::iterable_adaptor()=default'],['../structentt_1_1iterable__adaptor.html#adc0ab97bc15ec48970b44911ad7d0661',1,'entt::iterable_adaptor::iterable_adaptor(It from, It to)']]] + ['id_858',['id',['../structentt_1_1meta__data.html#a5e1bd9202426e41b5a0d1f25874fa7ec',1,'entt::meta_data::id()'],['../structentt_1_1meta__func.html#a5ea4ea1a05e16dcd4b19ade2bf8ffcf9',1,'entt::meta_func::id()'],['../classentt_1_1meta__type.html#aa7cd3deb7464bd95259e836e21bf1710',1,'entt::meta_type::id()']]], + ['in_5fplace_5fpop_859',['in_place_pop',['../classentt_1_1basic__sparse__set.html#aff8a2d818cbe74cc59687261627d3531',1,'entt::basic_sparse_set::in_place_pop()'],['../classentt_1_1basic__storage.html#a9a78ace899003f10c24cd1a75441840a',1,'entt::basic_storage::in_place_pop()']]], + ['index_860',['index',['../structentt_1_1type__info.html#a8281d599d6462d5e3717f570a8daef93',1,'entt::type_info::index()'],['../classentt_1_1basic__sparse__set.html#a1af775539f37a31b1da7254491a53b1f',1,'entt::basic_sparse_set::index()']]], + ['info_861',['info',['../structentt_1_1basic__organizer_1_1vertex.html#ad8302d45c317e73c115bf8b77f89cc1d',1,'entt::basic_organizer::vertex::info()'],['../classentt_1_1meta__type.html#a05199b5705d56386eb18e36ef73cd5f1',1,'entt::meta_type::info()']]], + ['input_5fiterator_5fpointer_862',['input_iterator_pointer',['../structentt_1_1input__iterator__pointer.html#a6ec178da7c2622b21dbf2852c5035bf5',1,'entt::input_iterator_pointer::input_iterator_pointer(const input_iterator_pointer &)=delete'],['../structentt_1_1input__iterator__pointer.html#a2603e381cfe846c6ffaf0376ef3e1882',1,'entt::input_iterator_pointer::input_iterator_pointer(input_iterator_pointer &&)=default'],['../structentt_1_1input__iterator__pointer.html#ae1e2a7eda1fb7650a6bba71590959bbb',1,'entt::input_iterator_pointer::input_iterator_pointer(Type &&val)']]], + ['insert_863',['insert',['../classentt_1_1dense__map.html#a519ceafe87d98b4a60ea91e1efe1c976',1,'entt::dense_map::insert(const value_type &value)'],['../classentt_1_1dense__map.html#a67ccf24563c5908e2bad9820f48cf432',1,'entt::dense_map::insert(value_type &&value)'],['../classentt_1_1dense__map.html#a81f7b5a5d5436d97e3134cc5b2cb2041',1,'entt::dense_map::insert(Arg &&value)'],['../classentt_1_1dense__map.html#a3c94e139b8d65ac65df36161183a8a49',1,'entt::dense_map::insert(It first, It last)'],['../classentt_1_1dense__set.html#ad1d0c5c6ecc943ea7ddaa9085cc7103c',1,'entt::dense_set::insert(const value_type &value)'],['../classentt_1_1dense__set.html#a1ba08ce069cae4e9cfa30ad0a0971c28',1,'entt::dense_set::insert(value_type &&value)'],['../classentt_1_1dense__set.html#ae52c7f8b38e6bfc15e421fcc8021ba15',1,'entt::dense_set::insert(It first, It last)'],['../classentt_1_1basic__registry.html#a3587004bdab85280c2a2a1b6371fd4c5',1,'entt::basic_registry::insert(It first, It last, const Component &value={})'],['../classentt_1_1basic__registry.html#a1a37b2a842fd3877bc25e3217a01ee11',1,'entt::basic_registry::insert(EIt first, EIt last, CIt from)'],['../classentt_1_1sigh__storage__mixin.html#a88cb74a6060bd49ea3f26f3921a47f81',1,'entt::sigh_storage_mixin::insert()'],['../classentt_1_1basic__sparse__set.html#a9730e27e1155b725975120a8c494b3e2',1,'entt::basic_sparse_set::insert()'],['../classentt_1_1basic__storage.html#abc4d7d3a84ecc5fc8e878772074ce35f',1,'entt::basic_storage::insert(It first, It last, const value_type &value={})'],['../classentt_1_1basic__storage.html#ac9670a9916dc77f24403e4a41fdaed96',1,'entt::basic_storage::insert(EIt first, EIt last, CIt from)'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a700a2428a1a0469b912b0dbdeb9e91b2',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::insert()'],['../classentt_1_1meta__sequence__container.html#aaa0fc1c19ebad3201054dae00952d07f',1,'entt::meta_sequence_container::insert()'],['../classentt_1_1meta__associative__container.html#a292d90c2d8cbee3d6c2c32a899a9cb5e',1,'entt::meta_associative_container::insert()']]], + ['insert_5for_5fassign_864',['insert_or_assign',['../classentt_1_1dense__map.html#a8edc6058714f6faa339bf8e8e8c4f294',1,'entt::dense_map::insert_or_assign(const key_type &key, Arg &&value)'],['../classentt_1_1dense__map.html#a604f5b0b48633852e364205d5e246c3c',1,'entt::dense_map::insert_or_assign(key_type &&key, Arg &&value)']]], + ['instance_865',['instance',['../classentt_1_1poly__vtable.html#afb72fb3a81dd22f2ca36b87adebfff46',1,'entt::poly_vtable']]], + ['invoke_866',['invoke',['../classentt_1_1meta__any.html#acaf2cd2589c5c3f8fa34b8bf7aca03f8',1,'entt::meta_any::invoke(const id_type id, Args &&...args) const'],['../classentt_1_1meta__any.html#a6dd24fc5445f7038c386696355773332',1,'entt::meta_any::invoke(const id_type id, Args &&...args)'],['../structentt_1_1meta__func.html#a83fb3576c1a3873de1e1e041f759180b',1,'entt::meta_func::invoke(meta_handle instance, meta_any *const args, const size_type sz) const'],['../structentt_1_1meta__func.html#aa10b325b5da2a1c04259f2d6dc1f6746',1,'entt::meta_func::invoke(meta_handle instance, Args &&...args) const'],['../classentt_1_1meta__type.html#ad846c918ce1e2f496b7464cc6a6d6d5e',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const'],['../classentt_1_1meta__type.html#a99a835b500d3aa1f4f25090d8bef3802',1,'entt::meta_type::invoke(const id_type id, meta_handle instance, Args &&...args) const'],['../structentt_1_1poly__inspector.html#a8539b30952dd5a66aa24f334ae4976de',1,'entt::poly_inspector::invoke(Args &&...args) const'],['../structentt_1_1poly__inspector.html#ac829c393c3d78f306edd0307f71139cb',1,'entt::poly_inspector::invoke(Args &&...args)'],['../structentt_1_1poly__base.html#a814fd041b02ddfe60577b23d174e7182',1,'entt::poly_base::invoke(const poly_base &self, Args &&...args) const'],['../structentt_1_1poly__base.html#a8e782d45ce62d6bd620ad22a0ee913e2',1,'entt::poly_base::invoke(poly_base &self, Args &&...args)'],['../namespaceentt.html#aa512a354fe328df6be5a92eb43cd4d69',1,'entt::invoke()']]], + ['is_5farithmetic_867',['is_arithmetic',['../classentt_1_1meta__type.html#a399e9840beaadc9be07c8ec8acb8a66d',1,'entt::meta_type']]], + ['is_5farray_868',['is_array',['../classentt_1_1meta__type.html#aac2e57ea9054001d5b6575a512337f2a',1,'entt::meta_type']]], + ['is_5fassociative_5fcontainer_869',['is_associative_container',['../classentt_1_1meta__type.html#a1cfeeb52708c5cc454b57904acde9c65',1,'entt::meta_type']]], + ['is_5fclass_870',['is_class',['../classentt_1_1meta__type.html#a8810160ba713e725bf3b672e546fba35',1,'entt::meta_type']]], + ['is_5fconst_871',['is_const',['../structentt_1_1meta__data.html#a821782f679650835b47ac17949bb5f4d',1,'entt::meta_data::is_const()'],['../structentt_1_1meta__func.html#a7d21c937f1e1337e3f9eab27ccee52a9',1,'entt::meta_func::is_const()']]], + ['is_5fenum_872',['is_enum',['../classentt_1_1meta__type.html#ad4467cc578b7bbe9799cbd2984144376',1,'entt::meta_type']]], + ['is_5fpointer_873',['is_pointer',['../classentt_1_1meta__type.html#a83ff488f0e3b09cd82190a000adb16fc',1,'entt::meta_type']]], + ['is_5fpointer_5flike_874',['is_pointer_like',['../classentt_1_1meta__type.html#a9f632add22a4194a8a968badfff7c6f6',1,'entt::meta_type']]], + ['is_5fpower_5fof_5ftwo_875',['is_power_of_two',['../namespaceentt.html#a3755517604de1d9d3f3e0a5549c750c5',1,'entt']]], + ['is_5fsequence_5fcontainer_876',['is_sequence_container',['../classentt_1_1meta__type.html#ab42d82a42e847fc9c5d6ac905c0d3736',1,'entt::meta_type']]], + ['is_5fstatic_877',['is_static',['../structentt_1_1meta__func.html#aab0625ceb6c319304e3d42f12aa1fb54',1,'entt::meta_func::is_static()'],['../structentt_1_1meta__data.html#a08417d17ad41c753ec292abdeafd1782',1,'entt::meta_data::is_static()']]], + ['is_5ftemplate_5fspecialization_878',['is_template_specialization',['../classentt_1_1meta__type.html#ae7d676d99412337ef5214545e61618a6',1,'entt::meta_type']]], + ['iterable_5fadaptor_879',['iterable_adaptor',['../structentt_1_1iterable__adaptor.html#a633a07efaa72436004db4c0923481921',1,'entt::iterable_adaptor::iterable_adaptor()=default'],['../structentt_1_1iterable__adaptor.html#adb0c73a7ef046ad97eb836b6692f7010',1,'entt::iterable_adaptor::iterable_adaptor(iterator from, sentinel to)']]], + ['iterate_880',['iterate',['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#afd6fe84b1d7d4b72e6217432f7bf3435',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >']]] ]; diff --git a/search/functions_9.js b/search/functions_9.js index 62783f800..229977589 100644 --- a/search/functions_9.js +++ b/search/functions_9.js @@ -1,7 +1,7 @@ var searchData= [ - ['key_889',['key',['../structentt_1_1meta__prop.html#ae8bd5282326b1e77f8f927a02f631a56',1,'entt::meta_prop']]], - ['key_5feq_890',['key_eq',['../classentt_1_1dense__hash__map.html#ae232711a88d1a581edc664d3da83e64d',1,'entt::dense_hash_map::key_eq()'],['../classentt_1_1dense__hash__set.html#ace63db5c5bc5ba7f4960c4d154b6388a',1,'entt::dense_hash_set::key_eq()']]], - ['key_5fonly_891',['key_only',['../classentt_1_1meta__associative__container.html#a070ac4ad334603401ba50963391af2ac',1,'entt::meta_associative_container']]], - ['key_5ftype_892',['key_type',['../classentt_1_1meta__associative__container.html#abef8bb4ecb8e3424bfa52be5357da618',1,'entt::meta_associative_container']]] + ['key_881',['key',['../structentt_1_1meta__prop.html#ae8bd5282326b1e77f8f927a02f631a56',1,'entt::meta_prop']]], + ['key_5feq_882',['key_eq',['../classentt_1_1dense__map.html#ac2039886ad16466a4f9928dc737cd711',1,'entt::dense_map::key_eq()'],['../classentt_1_1dense__set.html#a2520bd4106132dab9a4c71ef8388e186',1,'entt::dense_set::key_eq()']]], + ['key_5fonly_883',['key_only',['../classentt_1_1meta__associative__container.html#a070ac4ad334603401ba50963391af2ac',1,'entt::meta_associative_container']]], + ['key_5ftype_884',['key_type',['../classentt_1_1meta__associative__container.html#abef8bb4ecb8e3424bfa52be5357da618',1,'entt::meta_associative_container']]] ]; diff --git a/search/functions_a.js b/search/functions_a.js index e4ce47a37..986e24ea5 100644 --- a/search/functions_a.js +++ b/search/functions_a.js @@ -1,5 +1,7 @@ var searchData= [ - ['load_893',['load',['../classentt_1_1resource__cache.html#a5d32fa751e6f6ca1a595ebb5642cff23',1,'entt::resource_cache']]], - ['load_5ffactor_894',['load_factor',['../classentt_1_1dense__hash__map.html#a0946139bd54514775c186c798b6420a2',1,'entt::dense_hash_map::load_factor()'],['../classentt_1_1dense__hash__set.html#ade7113017ebe7e65e344fa9554c770f3',1,'entt::dense_hash_set::load_factor()']]] + ['load_885',['load',['../classentt_1_1resource__cache.html#a913f42ea03648c365c8cbbf8b405b6d4',1,'entt::resource_cache']]], + ['load_5ffactor_886',['load_factor',['../classentt_1_1dense__map.html#a0ebd2095ae61e1908572efa33dc3df56',1,'entt::dense_map::load_factor()'],['../classentt_1_1dense__set.html#abceb56d6788f953e79b6d6924bfcbfe2',1,'entt::dense_set::load_factor()']]], + ['loader_887',['loader',['../classentt_1_1resource__cache.html#a29225250d340dfc89818ab6662efe774',1,'entt::resource_cache']]], + ['locator_888',['locator',['../structentt_1_1locator.html#af0226a1ca179eba7e3b63ee47c1d668c',1,'entt::locator']]] ]; diff --git a/search/functions_b.js b/search/functions_b.js index b6f7ddb74..ddba4f340 100644 --- a/search/functions_b.js +++ b/search/functions_b.js @@ -1,28 +1,27 @@ var searchData= [ - ['make_5fany_895',['make_any',['../namespaceentt.html#a246375cb799b9dc67b9a555f91d94099',1,'entt']]], - ['make_5fmeta_896',['make_meta',['../namespaceentt.html#abdd5e7fb78b64f8238eacae2f10ba06e',1,'entt']]], - ['map_897',['map',['../classentt_1_1basic__continuous__loader.html#a8cf619f4617f38dcb2a8c07c83262b42',1,'entt::basic_continuous_loader']]], - ['mapped_5ftype_898',['mapped_type',['../classentt_1_1meta__associative__container.html#ac4654bf85edf4eb784e7a4e9f12ef59d',1,'entt::meta_associative_container']]], - ['max_5fbucket_5fcount_899',['max_bucket_count',['../classentt_1_1dense__hash__map.html#a11220c20418cb9fdd1815d0bf770441f',1,'entt::dense_hash_map::max_bucket_count()'],['../classentt_1_1dense__hash__set.html#a51059d55f874d8d6bdd4ba9595b81ecf',1,'entt::dense_hash_set::max_bucket_count()']]], - ['max_5fload_5ffactor_900',['max_load_factor',['../classentt_1_1dense__hash__map.html#a4f4664f0b5925e898fb36e35e1c27835',1,'entt::dense_hash_map::max_load_factor() const'],['../classentt_1_1dense__hash__map.html#aba259e25dc36bac32d68708078d96c0a',1,'entt::dense_hash_map::max_load_factor(const float value)'],['../classentt_1_1dense__hash__set.html#a2bc7b8061a73bbfac129c5c673b8cbf6',1,'entt::dense_hash_set::max_load_factor() const'],['../classentt_1_1dense__hash__set.html#a7a3e770b94014121ea3fb45bde617bfd',1,'entt::dense_hash_set::max_load_factor(const float value)']]], - ['meta_901',['meta',['../namespaceentt.html#a3ae5a1bdbb378be2ae0556ff437cf513',1,'entt']]], - ['meta_5fany_902',['meta_any',['../classentt_1_1meta__any.html#a00d2839b7929d7043b47fd0fad15fc1e',1,'entt::meta_any::meta_any()'],['../classentt_1_1meta__any.html#a327704bdb52c21b9ea8f221cdac11b20',1,'entt::meta_any::meta_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1meta__any.html#a7e1dba79e26c96a353743a327d1c7b8e',1,'entt::meta_any::meta_any(Type &&value)'],['../classentt_1_1meta__any.html#a51936bb6212a3bfc87b71afb2d6085c3',1,'entt::meta_any::meta_any(const meta_any &other)=default'],['../classentt_1_1meta__any.html#afb14535cc13fc0b3c9790d150d3d7bf5',1,'entt::meta_any::meta_any(meta_any &&other)']]], - ['meta_5fassociative_5fcontainer_903',['meta_associative_container',['../classentt_1_1meta__associative__container.html#a088ac917d0505b0dd55a0378cc725225',1,'entt::meta_associative_container::meta_associative_container()=default'],['../classentt_1_1meta__associative__container.html#ac2405eee51b302c36e3aaefb97fcd0cd',1,'entt::meta_associative_container::meta_associative_container(std::in_place_type_t< Type >, any instance)']]], - ['meta_5fconstruct_904',['meta_construct',['../namespaceentt.html#a681f2bc9d84e3851405cf4b8c8e21455',1,'entt::meta_construct(meta_any *const args)'],['../namespaceentt.html#aef8c196db303590ebe456287b5890cf4',1,'entt::meta_construct(Candidate &&candidate, meta_any *const args)'],['../namespaceentt.html#a3b0d075524517183181aa512417358a0',1,'entt::meta_construct(meta_any *const args)']]], - ['meta_5fdata_905',['meta_data',['../structentt_1_1meta__data.html#a287652cfd950c698d124d12820ec9d10',1,'entt::meta_data']]], - ['meta_5fdispatch_906',['meta_dispatch',['../namespaceentt.html#a957782a57268c06cef354868d4402c74',1,'entt']]], - ['meta_5ffactory_907',['meta_factory',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#afd118c3e987d809b5e5a43a836e0e405',1,'entt::meta_factory< Type, Spec... >::meta_factory()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#ab51530893e710d51fbc99c95f32931be',1,'entt::meta_factory< Type >::meta_factory()']]], - ['meta_5ffunc_908',['meta_func',['../structentt_1_1meta__func.html#afa6ee51299057be3baddee875b37b6d3',1,'entt::meta_func']]], - ['meta_5fgetter_909',['meta_getter',['../namespaceentt.html#a3fe26d091f302630470004fe314a6a8d',1,'entt']]], - ['meta_5fhandle_910',['meta_handle',['../structentt_1_1meta__handle.html#aed6a735b7dd561d9231334e54fe6fe55',1,'entt::meta_handle::meta_handle(Type &value)'],['../structentt_1_1meta__handle.html#aa988b1809a9687be4d25f21722075da5',1,'entt::meta_handle::meta_handle(meta_handle &&)=default'],['../structentt_1_1meta__handle.html#acaaa33d743703cf1af62691de0b86f50',1,'entt::meta_handle::meta_handle(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#a8d02bbf3a8088aa698db4491374dbf4c',1,'entt::meta_handle::meta_handle()=default']]], - ['meta_5finvoke_911',['meta_invoke',['../namespaceentt.html#a00d375156fcfcc72d62eab6728650556',1,'entt::meta_invoke([[maybe_unused]] meta_handle instance, Candidate &&candidate, [[maybe_unused]] meta_any *const args)'],['../namespaceentt.html#a3281f612575b11cef54d9d1008d7a469',1,'entt::meta_invoke(meta_handle instance, meta_any *const args)']]], - ['meta_5fiterator_912',['meta_iterator',['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a2682e9f7aba8440775ce5dbe91fe5640',1,'entt::meta_associative_container::meta_iterator::meta_iterator()=default'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#aed07ae38ce5daef3641909a93dd5895b',1,'entt::meta_associative_container::meta_iterator::meta_iterator(std::integral_constant< bool, KeyOnly >, It iter)'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a6821f88f44fed32de0a72da1b2f7b577',1,'entt::meta_sequence_container::meta_iterator::meta_iterator()=default'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a027834ba004cd79ca12ed34065378876',1,'entt::meta_sequence_container::meta_iterator::meta_iterator(It iter)']]], - ['meta_5fprop_913',['meta_prop',['../structentt_1_1meta__prop.html#a7103135ff9cf911f33850916e5b9e66d',1,'entt::meta_prop']]], - ['meta_5frange_914',['meta_range',['../structentt_1_1meta__range.html#ab8064a6fa2209baf3af9501230165615',1,'entt::meta_range::meta_range()=default'],['../structentt_1_1meta__range.html#aa9eb66c65013ff00985f88e956360511',1,'entt::meta_range::meta_range(node_type *head)']]], - ['meta_5freset_915',['meta_reset',['../namespaceentt.html#a4f5090482af8e4ab0afa3e27abf1eec3',1,'entt::meta_reset(const id_type id)'],['../namespaceentt.html#a0e6591abe0fd3b376413e2ba5ba760ea',1,'entt::meta_reset()']]], - ['meta_5fsequence_5fcontainer_916',['meta_sequence_container',['../classentt_1_1meta__sequence__container.html#a392df26352c3267384c89e71cd9b2b0b',1,'entt::meta_sequence_container::meta_sequence_container()=default'],['../classentt_1_1meta__sequence__container.html#aa819089d23af053d3e413f6c8baffa71',1,'entt::meta_sequence_container::meta_sequence_container(std::in_place_type_t< Type >, any instance)']]], - ['meta_5fsetter_917',['meta_setter',['../namespaceentt.html#adbe109e5134bae55cb519799acbed732',1,'entt']]], - ['meta_5ftype_918',['meta_type',['../classentt_1_1meta__type.html#ad5e1e307b880f8777b93e7f0db625b6b',1,'entt::meta_type::meta_type(const node_type *curr=nullptr)'],['../classentt_1_1meta__type.html#accc26762b2ac418d8bc0308cf5b46b05',1,'entt::meta_type::meta_type(const base_node_type *curr)']]], - ['move_5fand_5fpop_919',['move_and_pop',['../classentt_1_1basic__sparse__set.html#abe61ba2bc567ec90efd60b619ba76d57',1,'entt::basic_sparse_set::move_and_pop()'],['../classentt_1_1basic__storage.html#aa5da3f4cfbda0add7a0fbcee565d842d',1,'entt::basic_storage::move_and_pop()']]] + ['make_5fany_889',['make_any',['../namespaceentt.html#a246375cb799b9dc67b9a555f91d94099',1,'entt']]], + ['make_5fmeta_890',['make_meta',['../namespaceentt.html#abdd5e7fb78b64f8238eacae2f10ba06e',1,'entt']]], + ['make_5fobj_5fusing_5fallocator_891',['make_obj_using_allocator',['../namespaceentt.html#a12e4d0c58f9c4cc6f5513c39c530b9b7',1,'entt']]], + ['map_892',['map',['../classentt_1_1basic__continuous__loader.html#a8cf619f4617f38dcb2a8c07c83262b42',1,'entt::basic_continuous_loader']]], + ['mapped_5ftype_893',['mapped_type',['../classentt_1_1meta__associative__container.html#ac4654bf85edf4eb784e7a4e9f12ef59d',1,'entt::meta_associative_container']]], + ['max_5fbucket_5fcount_894',['max_bucket_count',['../classentt_1_1dense__map.html#a4818548e35a239228a5fae77af01e7f5',1,'entt::dense_map::max_bucket_count()'],['../classentt_1_1dense__set.html#ac3410a73c0331657be2da1c8f0855949',1,'entt::dense_set::max_bucket_count()']]], + ['max_5fload_5ffactor_895',['max_load_factor',['../classentt_1_1dense__map.html#a54a2dd65d401a992fd91fb8a91faea86',1,'entt::dense_map::max_load_factor() const'],['../classentt_1_1dense__map.html#a608539db499acbc3a7548421ea5d8709',1,'entt::dense_map::max_load_factor(const float value)'],['../classentt_1_1dense__set.html#aeb02fd08b390059b8c1cffc39a6f40f1',1,'entt::dense_set::max_load_factor() const'],['../classentt_1_1dense__set.html#ab740b6ce89b700657c796b7388563569',1,'entt::dense_set::max_load_factor(const float value)']]], + ['meta_896',['meta',['../namespaceentt.html#a3ae5a1bdbb378be2ae0556ff437cf513',1,'entt']]], + ['meta_5fany_897',['meta_any',['../classentt_1_1meta__any.html#a00d2839b7929d7043b47fd0fad15fc1e',1,'entt::meta_any::meta_any()'],['../classentt_1_1meta__any.html#a327704bdb52c21b9ea8f221cdac11b20',1,'entt::meta_any::meta_any(std::in_place_type_t< Type >, Args &&...args)'],['../classentt_1_1meta__any.html#a7e1dba79e26c96a353743a327d1c7b8e',1,'entt::meta_any::meta_any(Type &&value)'],['../classentt_1_1meta__any.html#a51936bb6212a3bfc87b71afb2d6085c3',1,'entt::meta_any::meta_any(const meta_any &other)=default'],['../classentt_1_1meta__any.html#afb14535cc13fc0b3c9790d150d3d7bf5',1,'entt::meta_any::meta_any(meta_any &&other)']]], + ['meta_5fassociative_5fcontainer_898',['meta_associative_container',['../classentt_1_1meta__associative__container.html#a088ac917d0505b0dd55a0378cc725225',1,'entt::meta_associative_container::meta_associative_container()=default'],['../classentt_1_1meta__associative__container.html#ac2405eee51b302c36e3aaefb97fcd0cd',1,'entt::meta_associative_container::meta_associative_container(std::in_place_type_t< Type >, any instance)']]], + ['meta_5fconstruct_899',['meta_construct',['../namespaceentt.html#a3b0d075524517183181aa512417358a0',1,'entt::meta_construct(meta_any *const args)'],['../namespaceentt.html#aef8c196db303590ebe456287b5890cf4',1,'entt::meta_construct(Candidate &&candidate, meta_any *const args)'],['../namespaceentt.html#a681f2bc9d84e3851405cf4b8c8e21455',1,'entt::meta_construct(meta_any *const args)']]], + ['meta_5fdata_900',['meta_data',['../structentt_1_1meta__data.html#a287652cfd950c698d124d12820ec9d10',1,'entt::meta_data']]], + ['meta_5fdispatch_901',['meta_dispatch',['../namespaceentt.html#a957782a57268c06cef354868d4402c74',1,'entt']]], + ['meta_5ffactory_902',['meta_factory',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#afd118c3e987d809b5e5a43a836e0e405',1,'entt::meta_factory< Type, Spec... >::meta_factory()'],['../classentt_1_1meta__factory_3_01Type_01_4.html#ab51530893e710d51fbc99c95f32931be',1,'entt::meta_factory< Type >::meta_factory()']]], + ['meta_5ffunc_903',['meta_func',['../structentt_1_1meta__func.html#afa6ee51299057be3baddee875b37b6d3',1,'entt::meta_func']]], + ['meta_5fgetter_904',['meta_getter',['../namespaceentt.html#a3fe26d091f302630470004fe314a6a8d',1,'entt']]], + ['meta_5fhandle_905',['meta_handle',['../structentt_1_1meta__handle.html#aa988b1809a9687be4d25f21722075da5',1,'entt::meta_handle::meta_handle(meta_handle &&)=default'],['../structentt_1_1meta__handle.html#acaaa33d743703cf1af62691de0b86f50',1,'entt::meta_handle::meta_handle(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#a8d02bbf3a8088aa698db4491374dbf4c',1,'entt::meta_handle::meta_handle()=default'],['../structentt_1_1meta__handle.html#aed6a735b7dd561d9231334e54fe6fe55',1,'entt::meta_handle::meta_handle(Type &value)']]], + ['meta_5finvoke_906',['meta_invoke',['../namespaceentt.html#a00d375156fcfcc72d62eab6728650556',1,'entt::meta_invoke([[maybe_unused]] meta_handle instance, Candidate &&candidate, [[maybe_unused]] meta_any *const args)'],['../namespaceentt.html#a3281f612575b11cef54d9d1008d7a469',1,'entt::meta_invoke(meta_handle instance, meta_any *const args)']]], + ['meta_5fprop_907',['meta_prop',['../structentt_1_1meta__prop.html#a7103135ff9cf911f33850916e5b9e66d',1,'entt::meta_prop']]], + ['meta_5frange_908',['meta_range',['../structentt_1_1meta__range.html#ab8064a6fa2209baf3af9501230165615',1,'entt::meta_range::meta_range()=default'],['../structentt_1_1meta__range.html#aa9eb66c65013ff00985f88e956360511',1,'entt::meta_range::meta_range(node_type *head)']]], + ['meta_5freset_909',['meta_reset',['../namespaceentt.html#a4f5090482af8e4ab0afa3e27abf1eec3',1,'entt::meta_reset(const id_type id)'],['../namespaceentt.html#a0e6591abe0fd3b376413e2ba5ba760ea',1,'entt::meta_reset()']]], + ['meta_5fsequence_5fcontainer_910',['meta_sequence_container',['../classentt_1_1meta__sequence__container.html#a392df26352c3267384c89e71cd9b2b0b',1,'entt::meta_sequence_container::meta_sequence_container()=default'],['../classentt_1_1meta__sequence__container.html#aa819089d23af053d3e413f6c8baffa71',1,'entt::meta_sequence_container::meta_sequence_container(std::in_place_type_t< Type >, any instance)']]], + ['meta_5fsetter_911',['meta_setter',['../namespaceentt.html#adbe109e5134bae55cb519799acbed732',1,'entt']]], + ['meta_5ftype_912',['meta_type',['../classentt_1_1meta__type.html#ad5e1e307b880f8777b93e7f0db625b6b',1,'entt::meta_type::meta_type(const node_type *curr=nullptr)'],['../classentt_1_1meta__type.html#accc26762b2ac418d8bc0308cf5b46b05',1,'entt::meta_type::meta_type(const base_node_type *curr)']]] ]; diff --git a/search/functions_c.js b/search/functions_c.js index fb5c9916d..0996e70d9 100644 --- a/search/functions_c.js +++ b/search/functions_c.js @@ -1,5 +1,5 @@ var searchData= [ - ['name_920',['name',['../classentt_1_1type__info.html#a0e7a10db927c013184939421cbeb7815',1,'entt::type_info::name()'],['../structentt_1_1basic__organizer_1_1vertex.html#aacc9f65a7bd16763647677d8b84bb74b',1,'entt::basic_organizer::vertex::name()']]], - ['next_5fpower_5fof_5ftwo_921',['next_power_of_two',['../namespaceentt.html#a5a2dbf5d86123af800abdd8fe69542ca',1,'entt']]] + ['name_913',['name',['../structentt_1_1type__info.html#a0e7a10db927c013184939421cbeb7815',1,'entt::type_info::name()'],['../structentt_1_1basic__organizer_1_1vertex.html#aacc9f65a7bd16763647677d8b84bb74b',1,'entt::basic_organizer::vertex::name()']]], + ['next_5fpower_5fof_5ftwo_914',['next_power_of_two',['../namespaceentt.html#a5a2dbf5d86123af800abdd8fe69542ca',1,'entt']]] ]; diff --git a/search/functions_d.js b/search/functions_d.js index 80be5a913..ea127f2c6 100644 --- a/search/functions_d.js +++ b/search/functions_d.js @@ -1,42 +1,42 @@ var searchData= [ - ['on_922',['on',['../classentt_1_1emitter.html#a0b580005200bb810a4a3e94320efcd8a',1,'entt::emitter']]], - ['on_5fconstruct_923',['on_construct',['../classentt_1_1basic__registry.html#adc3cd847e65843f936824cd7d45984a5',1,'entt::basic_registry::on_construct()'],['../classentt_1_1sigh__storage__mixin.html#a307e783d42de1994678bb9aaeb86305d',1,'entt::sigh_storage_mixin::on_construct()']]], - ['on_5fdestroy_924',['on_destroy',['../classentt_1_1basic__registry.html#ad87a72c6d1e49a2fd992ddb7fd9d5a93',1,'entt::basic_registry::on_destroy()'],['../classentt_1_1sigh__storage__mixin.html#a04cc3ac5e26e6a0070fc87a8e5e5fb3e',1,'entt::sigh_storage_mixin::on_destroy()']]], - ['on_5fupdate_925',['on_update',['../classentt_1_1basic__registry.html#aaaf474d42df7b8852c4656152cc4a295',1,'entt::basic_registry::on_update()'],['../classentt_1_1sigh__storage__mixin.html#aad9a29530cf1408803a45573ffbee711',1,'entt::sigh_storage_mixin::on_update()']]], - ['once_926',['once',['../classentt_1_1emitter.html#a79834d452b0600ebe0e70c54f4a21fd6',1,'entt::emitter']]], - ['operator_20basic_5fgroup_3c_20entity_5ftype_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_2c_20exclude_20_3e_927',['operator basic_group< entity_type, owned_t< Owned... >, Get, Exclude >',['../structentt_1_1as__group.html#a35cbba4f387f92c80935183da08798ca',1,'entt::as_group']]], - ['operator_20basic_5fhandle_3c_20other_2c_20args_2e_2e_2e_20_3e_928',['operator basic_handle< Other, Args... >',['../structentt_1_1basic__handle.html#a3e3190a9991d334cdd20b4d8841d7545',1,'entt::basic_handle']]], - ['operator_20basic_5fview_3c_20entity_5ftype_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_20_3e_929',['operator basic_view< entity_type, get_t< Component... >, Exclude >',['../structentt_1_1as__view.html#a33df5ef10293a3153cd467edd72be425',1,'entt::as_view']]], - ['operator_20bool_930',['operator bool',['../classentt_1_1basic__any.html#a071b4fda8629b1767b384d01a0113496',1,'entt::basic_any::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a71396a63f68d8375329a1253b9634c7b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a177bb26a1d23da0502aeca143a3ae2a9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../structentt_1_1basic__handle.html#a80b439c1dd5924807bc26585c3c1ef4d',1,'entt::basic_handle::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aed52b322f7405bb527769aa051d6186e',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aa1e551e84f124033b5cfb5bfd09b630f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator bool()'],['../classentt_1_1meta__sequence__container.html#a004cb45ad3f51dbde8346fa1b202a13f',1,'entt::meta_sequence_container::operator bool()'],['../classentt_1_1meta__associative__container.html#a202720cb81c234e0e8e16db48b4adf2e',1,'entt::meta_associative_container::operator bool()'],['../classentt_1_1meta__any.html#a307d84b99d93841efc574e7807ac7786',1,'entt::meta_any::operator bool()'],['../structentt_1_1meta__handle.html#a6936d403200fd97fd34d366d9c980c6c',1,'entt::meta_handle::operator bool()'],['../structentt_1_1meta__prop.html#a95a94a16e568cbf443056406155e122e',1,'entt::meta_prop::operator bool()'],['../structentt_1_1meta__data.html#a597429fb3dfbc05a48d2f8dd31133d97',1,'entt::meta_data::operator bool()'],['../structentt_1_1meta__func.html#a84da8b799b2feab77060a686da004b45',1,'entt::meta_func::operator bool()'],['../classentt_1_1meta__type.html#aaf7716aacffeaf51c8dcb283a6cc4630',1,'entt::meta_type::operator bool()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a4671598328a55a00a9631bd109d9bc10',1,'entt::meta_sequence_container::meta_iterator::operator bool()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#aad5300ee6bc83f198a24d8f6dc8bf73a',1,'entt::meta_associative_container::meta_iterator::operator bool()'],['../classentt_1_1basic__poly.html#a311984ecc234832af9603c6ba1e3cd02',1,'entt::basic_poly::operator bool()'],['../classentt_1_1resource__handle.html#a78608879425212e25817c16e3393ee07',1,'entt::resource_handle::operator bool()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af9dcbcb5c62a4cbfeb41cae502e5236e',1,'entt::delegate< Ret(Args...)>::operator bool()'],['../classentt_1_1connection.html#ad912298fe40bd1b6aa5b8b950850bb70',1,'entt::connection::operator bool()'],['../structentt_1_1scoped__connection.html#a0b4e9958e0dbc1b1ba14a878531a475d',1,'entt::scoped_connection::operator bool()']]], - ['operator_20const_20value_5ftype_20_2a_931',['operator const value_type *',['../classentt_1_1basic__hashed__string.html#aa9ade09d3f55abe5bbae3438331aa7a2',1,'entt::basic_hashed_string']]], - ['operator_20entity_932',['operator Entity',['../structentt_1_1null__t.html#a816903f5ef0036594891edcf253d2570',1,'entt::null_t::operator Entity()'],['../structentt_1_1tombstone__t.html#a486219c88fe6ca91248095914fca745e',1,'entt::tombstone_t::operator Entity()']]], - ['operator_20entity_5ftype_933',['operator entity_type',['../structentt_1_1basic__handle.html#ae094b8474a9e4363b5c4503753b9ec4c',1,'entt::basic_handle']]], - ['operator_20hash_5ftype_934',['operator hash_type',['../classentt_1_1basic__hashed__string.html#a342323328cacb574f886a5720dd71580',1,'entt::basic_hashed_string']]], - ['operator_20id_5ftype_935',['operator id_type',['../structentt_1_1type__index.html#a5909d64d944e5957c22df8be65e17926',1,'entt::type_index::operator id_type()'],['../structentt_1_1type__hash.html#af86c7a01cb72943521b4dd6e7ac0bc8c',1,'entt::type_hash::operator id_type()']]], - ['operator_20resource_5ftype_20_26_936',['operator resource_type &',['../classentt_1_1resource__handle.html#a9ef20d31d925a71d0fa95c8ac5a28dec',1,'entt::resource_handle']]], - ['operator_20type_937',['operator Type',['../structentt_1_1monostate.html#a1ec272e17db93124df74bd15d36b1e1d',1,'entt::monostate']]], - ['operator_20type_20_26_26_938',['operator Type &&',['../structentt_1_1poly__inspector.html#a5b44cbea11e79b2ff918165b7bf100eb',1,'entt::poly_inspector']]], - ['operator_21_3d_939',['operator!=',['../namespaceentt.html#ac8711ef7a24e5329d7cbd0d05136874e',1,'entt::operator!=()'],['../structentt_1_1null__t.html#a1bd5e7e2a2fdc78944cf32ee03a6d0ab',1,'entt::null_t::operator!=([[maybe_unused]] const null_t other) const'],['../structentt_1_1null__t.html#a1e155d4d92605008969c3df64484ed44',1,'entt::null_t::operator!=(const Entity entity) const'],['../structentt_1_1tombstone__t.html#af2e901bd03a7676aa3596f8c55f91d1e',1,'entt::tombstone_t::operator!=([[maybe_unused]] const tombstone_t other) const'],['../structentt_1_1tombstone__t.html#ae75cbf2733dcde452dd782d3c7eda923',1,'entt::tombstone_t::operator!=(const Entity entity) const'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a1f3c9f4a3d71e6d8686ee509bcca51aa',1,'entt::meta_sequence_container::meta_iterator::operator!=()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a1c44654e6c852593ecbe572405ae157c',1,'entt::meta_associative_container::meta_iterator::operator!=()'],['../namespaceentt.html#a39702a79d9ba6f5d7cb8668b0a7a1524',1,'entt::operator!=(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#ae38ac5bc7b9097ec21eb1058db206cff',1,'entt::operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)'],['../namespaceentt.html#ac200eb460760246368bb737dc434c0eb',1,'entt::operator!=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a5b6b2e64d7d0ca7bd46c4fc9009cb552',1,'entt::operator!=(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a6185f9faa3f9fa26ecb1b9a837016147',1,'entt::operator!=(const Entity entity, const null_t other)'],['../namespaceentt.html#a7ef0d5ec3214e57aa4b8406fbe9ee3a5',1,'entt::operator!=(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)'],['../namespaceentt.html#a845d4ef2c448264153449c92157a0359',1,'entt::operator!=(const meta_any &lhs, const meta_any &rhs)'],['../namespaceentt.html#a04ebb219547c34209a94c9eb6d26eda1',1,'entt::operator!=(const meta_type &lhs, const meta_type &rhs)']]], - ['operator_22_22_5fhs_940',['operator""_hs',['../namespaceentt.html#a556190d147a6a92fc16bbf31bd4b263a',1,'entt::literals']]], - ['operator_22_22_5fhws_941',['operator""_hws',['../namespaceentt.html#a226e03b3f52eb1bbce832ec53106bd6a',1,'entt::literals']]], - ['operator_28_29_942',['operator()',['../structentt_1_1std__sort.html#a8895e4acd1677a60e07d7e28748fe667',1,'entt::std_sort::operator()()'],['../structentt_1_1insertion__sort.html#a73a5644fe5b683f9b9376c89ac47f2b8',1,'entt::insertion_sort::operator()()'],['../structentt_1_1radix__sort.html#a1989f6fbe18d3d82fdea9745d6b9ee96',1,'entt::radix_sort::operator()()'],['../structentt_1_1identity.html#a4bab5676dfa9eca188b2145708a086b8',1,'entt::identity::operator()()'],['../structentt_1_1y__combinator.html#a353f6f122334b26a90ce81cc32744ec3',1,'entt::y_combinator::operator()(Args &&...args) const'],['../structentt_1_1y__combinator.html#ade7f955583e7a887220e6ef391bfb7d2',1,'entt::y_combinator::operator()(Args &&...args)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a0e53caedb53810bc96aa71bce199c990',1,'entt::delegate< Ret(Args...)>::operator()()']]], - ['operator_2a_943',['operator*',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ab88fe602ee7756bc182bd2b75554ac56',1,'entt::meta_sequence_container::meta_iterator::operator*()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a9417a9f49bfdb6ad4edda6a17bfe6650',1,'entt::meta_associative_container::meta_iterator::operator*()'],['../classentt_1_1resource__handle.html#a505077caf97084b6f507c635e4d3630b',1,'entt::resource_handle::operator*()'],['../classentt_1_1meta__any.html#a15c62ff440280cb6e25e6a5b781a8aae',1,'entt::meta_any::operator*()']]], - ['operator_2b_944',['operator+',['../namespaceentt.html#a6c6e966c8af5b1452811aa55adbbdf47',1,'entt::operator+(type_list< Type... >, type_list< Other... >)'],['../namespaceentt.html#aabc6dd5fb4d2bc92d9e5101b7b0bce1d',1,'entt::operator+(value_list< Value... >, value_list< Other... >)']]], - ['operator_2b_2b_945',['operator++',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a9ce70316ca703976d7ad5f0feac6db11',1,'entt::meta_sequence_container::meta_iterator::operator++()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a2ca9ecc7a3bd732c1ef21969b410d547',1,'entt::meta_sequence_container::meta_iterator::operator++(int)'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#ae9e913c2e2e757e44873661b795ea56c',1,'entt::meta_associative_container::meta_iterator::operator++()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#acdb2a5e8516133e976b8158766e000fa',1,'entt::meta_associative_container::meta_iterator::operator++(int)']]], - ['operator_2d_3e_946',['operator->',['../structentt_1_1input__iterator__pointer.html#ab4a5b1478272e26c60f7123b0a2e155f',1,'entt::input_iterator_pointer::operator->()'],['../structentt_1_1meta__handle.html#aeaeac6808357732eeb2ce615c7ccb0eb',1,'entt::meta_handle::operator->()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ad0386e92772a88a2904a295c88e9cb7a',1,'entt::meta_sequence_container::meta_iterator::operator->()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#ac796300fe40920c0cd4a2724f9d0e2fa',1,'entt::meta_associative_container::meta_iterator::operator->()'],['../classentt_1_1basic__poly.html#a06f659d892ece6b3908644a5452ed550',1,'entt::basic_poly::operator->()'],['../classentt_1_1basic__poly.html#a0d3461b19558dceb0b60d7f7f2e23ef2',1,'entt::basic_poly::operator->() const'],['../classentt_1_1resource__handle.html#abdb14da5bcb5a4d1676235d9cc6b6ee3',1,'entt::resource_handle::operator->()'],['../structentt_1_1meta__handle.html#ad1309701800c7727eb519ee14b655e30',1,'entt::meta_handle::operator->()']]], - ['operator_3c_947',['operator<',['../namespaceentt.html#a95abccf779882bf65c4bb1cb99b8059c',1,'entt::operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ac2789bea84be3354b9ec3f48b0af539c',1,'entt::operator<(const type_info &lhs, const type_info &rhs)']]], - ['operator_3c_3d_948',['operator<=',['../namespaceentt.html#a400fd2e18a1fe98013bd4cdb281ad98f',1,'entt::operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ac99351681df5ffc84efcc14603ab6fc3',1,'entt::operator<=(const type_info &lhs, const type_info &rhs)']]], - ['operator_3d_949',['operator=',['../classentt_1_1basic__snapshot__loader.html#aa55eeaad2ab4dd117524afff9d6e184b',1,'entt::basic_snapshot_loader::operator=()'],['../classentt_1_1basic__continuous__loader.html#afd396d84cb27e070a6a812bd28140c75',1,'entt::basic_continuous_loader::operator=()'],['../classentt_1_1basic__sparse__set.html#afd87d086a1b895ac6253c311eb90affb',1,'entt::basic_sparse_set::operator=()'],['../classentt_1_1basic__storage.html#a7672e87c11c51f4edf70ae68def122c8',1,'entt::basic_storage::operator=()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aef13645252ab183b46fa966bfcdd4ded',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::operator=()'],['../classentt_1_1meta__any.html#a97360c78351767409f9db58c9f785ad5',1,'entt::meta_any::operator=(const meta_any &other)'],['../classentt_1_1meta__any.html#a867681175c0928270919df9476ba10c5',1,'entt::meta_any::operator=(meta_any &&other)'],['../classentt_1_1meta__any.html#ae9298a9b894c870392da35f696fbb044',1,'entt::meta_any::operator=(Type &&value)'],['../structentt_1_1meta__handle.html#a750eb55693845b28da117db4d342b8e6',1,'entt::meta_handle::operator=(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#aacfd03669af75ce2684917e8e9f90132',1,'entt::meta_handle::operator=(meta_handle &&)=default'],['../classentt_1_1scheduler.html#aea6ab78dbf00ba17c6e828ee0505afd9',1,'entt::scheduler::operator=()'],['../classentt_1_1resource__cache.html#a1aecfbf6c4faaadb05ce5005c202223c',1,'entt::resource_cache::operator=()'],['../classentt_1_1resource__handle.html#a32c522c1b72534ba95ceb7c17b9baebf',1,'entt::resource_handle::operator=(const resource_handle &other)=default'],['../classentt_1_1resource__handle.html#a93f95303ff32ef9686bfa69bb75abbb6',1,'entt::resource_handle::operator=(resource_handle &&other)=default'],['../classentt_1_1resource__handle.html#a6dab45269845d4eb2e90daa813b318a6',1,'entt::resource_handle::operator=(const resource_handle< Other > &other)'],['../classentt_1_1resource__handle.html#a8236f83607681c7e421613f19eb79f56',1,'entt::resource_handle::operator=(resource_handle< Other > &&other)'],['../classentt_1_1dispatcher.html#aa316ef3726d611b15bd1b02f720342a5',1,'entt::dispatcher::operator=()'],['../classentt_1_1emitter.html#ab270d2c6d986621a781467e29e64629c',1,'entt::emitter::operator=()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a23c0e4cfafdc631539651db4af7f0ac2',1,'entt::sigh< Ret(Args...), Allocator >::operator=(const sigh &other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a515f527211650b9b3882deb4e4c5d650',1,'entt::sigh< Ret(Args...), Allocator >::operator=(sigh &&other)'],['../structentt_1_1scoped__connection.html#ae079c45e0eb97f31ec1d5a4be76163fc',1,'entt::scoped_connection::operator=(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#abe0ec74231b7bece430c6dd5ffdeddc2',1,'entt::scoped_connection::operator=(scoped_connection &&other)'],['../structentt_1_1scoped__connection.html#a900d499bf30a8f33beb19f41af9b93b3',1,'entt::scoped_connection::operator=(connection other)'],['../classentt_1_1dense__hash__map.html#a01b3c79588b4d4b279fb3ff2ac510945',1,'entt::dense_hash_map::operator=(const dense_hash_map &other)'],['../classentt_1_1dense__hash__map.html#a7c4f2479f3c41a71518e6edd9f2c7b36',1,'entt::dense_hash_map::operator=(dense_hash_map &&other)=default'],['../classentt_1_1dense__hash__set.html#a221ba9727d93399d0520ad17e12b47df',1,'entt::dense_hash_set::operator=(const dense_hash_set &other)'],['../classentt_1_1dense__hash__set.html#ab68be75780de7db8116c669555066d08',1,'entt::dense_hash_set::operator=(dense_hash_set &&other)=default'],['../classentt_1_1basic__any.html#a2918b13d6957ccaae7796ea76be6807f',1,'entt::basic_any::operator=(const basic_any &other)'],['../classentt_1_1basic__any.html#ab8d80c9b2be44588959c2a3cb451c162',1,'entt::basic_any::operator=(basic_any &&other)'],['../classentt_1_1basic__any.html#a58bb0a9c97a6a75e5b7984acf6fd268b',1,'entt::basic_any::operator=(Type &&value)'],['../classentt_1_1compressed__pair.html#a73b4a959b934357bc41b8e9c53b47496',1,'entt::compressed_pair::operator=(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#ad61f40edf314083598c0b0d76aa90fa1',1,'entt::compressed_pair::operator=(compressed_pair &&other)=default'],['../structentt_1_1input__iterator__pointer.html#acdd70bff5e5dc7dedd5851432bbed9d9',1,'entt::input_iterator_pointer::operator=(const input_iterator_pointer &)=delete'],['../structentt_1_1input__iterator__pointer.html#a24452709a3e3c45713c033073f02c485',1,'entt::input_iterator_pointer::operator=(input_iterator_pointer &&)=default'],['../structentt_1_1monostate.html#aaffae05e053ccedffd625e8c1f0664c5',1,'entt::monostate::operator=()'],['../classentt_1_1basic__observer.html#a03dcb6b0999d29bc39410d7ae6d9ac53',1,'entt::basic_observer::operator=(const basic_observer &)=delete'],['../classentt_1_1basic__observer.html#a8b7cd199f236a4dee02f202ec0fd6281',1,'entt::basic_observer::operator=(basic_observer &&)=delete'],['../classentt_1_1basic__registry.html#a23d233b9e2c4a92395a60087891c52fe',1,'entt::basic_registry::operator=()'],['../classentt_1_1basic__snapshot.html#a1484b609195cfd057bbdd8808d4392bc',1,'entt::basic_snapshot::operator=()']]], - ['operator_3d_3d_950',['operator==',['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a5de494fe89185aff94920c5dbaac67fc',1,'entt::meta_associative_container::meta_iterator::operator==()'],['../classentt_1_1meta__type.html#a39159083cd8ac72bb27859ccd4f0f732',1,'entt::meta_type::operator==()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#adf1a347090bce0e5e133695110988442',1,'entt::meta_sequence_container::meta_iterator::operator==()'],['../namespaceentt.html#aee5fe16dfbb40ab097d339b0c008fae7',1,'entt::operator==(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)'],['../namespaceentt.html#a0f371da1ef604fa726a88e9733e5ee54',1,'entt::operator==(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#af6de691c4ec15d4a63ea8960563bbea0',1,'entt::operator==(const Entity entity, const null_t other)'],['../namespaceentt.html#a13f95d943a5794e7f7b481d3e02a2d96',1,'entt::operator==(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a07b2e32d6df969a3d20a8f263265fe96',1,'entt::operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ab1cf637f608b81e72070b7d6cc385e9d',1,'entt::delegate< Ret(Args...)>::operator==()'],['../classentt_1_1basic__any.html#adc66c85290945fc808d1979db9040454',1,'entt::basic_any::operator==()'],['../structentt_1_1null__t.html#aa9a56492571f7949c26fc7ce4c9aa441',1,'entt::null_t::operator==([[maybe_unused]] const null_t other) const'],['../structentt_1_1null__t.html#a510e2259bb0ed264ecdf64f7e8b51665',1,'entt::null_t::operator==(const Entity entity) const'],['../structentt_1_1tombstone__t.html#aa54c795fa1a8e817e56f14e29fc8beee',1,'entt::tombstone_t::operator==([[maybe_unused]] const tombstone_t other) const'],['../structentt_1_1tombstone__t.html#aa55c02c8ea69dc462ea78e4ad20c385f',1,'entt::tombstone_t::operator==(const Entity entity) const'],['../classentt_1_1meta__any.html#a1bd17bffb75be10543e85c78185d765a',1,'entt::meta_any::operator==()']]], - ['operator_3e_951',['operator>',['../namespaceentt.html#a28f32860fd6de66a832389b365045047',1,'entt::operator>(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#affca347714c6771f1f5928f1c18a070f',1,'entt::operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)']]], - ['operator_3e_3d_952',['operator>=',['../namespaceentt.html#a5d583f542e17fa8eb56d8d01c34b8920',1,'entt::operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a2e6acc16fe38d13c69b5d1fb237e4ac5',1,'entt::operator>=(const type_info &lhs, const type_info &rhs)']]], - ['operator_5b_5d_953',['operator[]',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a29cfb727d48591b93b58a5acb1d85fae',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab5aed61f5c7416b66f6e93c61b9e787b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[]()'],['../classentt_1_1dense__hash__map.html#a656c8e3719618ba7ffc32ac3c674acfd',1,'entt::dense_hash_map::operator[](const key_type &key)'],['../classentt_1_1dense__hash__map.html#addf363098d44c17aad8ef72a8869054d',1,'entt::dense_hash_map::operator[](key_type &&key)'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aaaf16dde27d8d4aed568a519a87b5b1b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aeed935700bcf21af637b96e144178a56',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__sparse__set.html#a3f88e4df5066e55ebfba192a85050553',1,'entt::basic_sparse_set::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aab90453fa7feb640ec46e2b50b4caace',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[]()'],['../classentt_1_1meta__sequence__container.html#a69ecff5787961fb20256491e56df04ee',1,'entt::meta_sequence_container::operator[]()']]], - ['operator_7c_954',['operator|',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a1267ff896c8bd61b41b3e9d069f9ecc4',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator|()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a71bf0b47a5091541cb870f669aca6a1d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator|()']]], - ['orphan_955',['orphan',['../classentt_1_1basic__registry.html#a10f5e61d4cabab9e9c1e87edc30de551',1,'entt::basic_registry::orphan()'],['../structentt_1_1basic__handle.html#a04557a12530c2c86cd90694d2f4c7bc7',1,'entt::basic_handle::orphan()']]], - ['orphans_956',['orphans',['../classentt_1_1basic__continuous__loader.html#ac8b328bb8c6c4acde51ab5b943f0ea86',1,'entt::basic_continuous_loader::orphans()'],['../classentt_1_1basic__snapshot__loader.html#acd881016761f5eb598763fbf3595a625',1,'entt::basic_snapshot_loader::orphans()']]], - ['overload_957',['overload',['../namespaceentt.html#a386a739051d9d37a5578785b77fc426b',1,'entt::overload(Type Class::*member)'],['../namespaceentt.html#ad4ea6822ef21f52c732ba3baea450159',1,'entt::overload(Func *func)']]], - ['overloaded_958',['overloaded',['../namespaceentt.html#a26eb67ac302229374c5fb623d529f5eb',1,'entt']]], - ['owner_959',['owner',['../classentt_1_1basic__any.html#ae20c3f5eecdcdaf715b332bbc363ee4d',1,'entt::basic_any::owner()'],['../classentt_1_1meta__any.html#abc6c66b9bf085ec3c67c10540d1f48a7',1,'entt::meta_any::owner()']]], - ['string_5fview_960',['string_view',['../structentt_1_1type__name.html#a5c425f6e665e43b4cf0a2249b8c127e2',1,'entt::type_name']]] + ['on_915',['on',['../classentt_1_1emitter.html#a0b580005200bb810a4a3e94320efcd8a',1,'entt::emitter']]], + ['on_5fconstruct_916',['on_construct',['../classentt_1_1basic__registry.html#adc3cd847e65843f936824cd7d45984a5',1,'entt::basic_registry::on_construct()'],['../classentt_1_1sigh__storage__mixin.html#a307e783d42de1994678bb9aaeb86305d',1,'entt::sigh_storage_mixin::on_construct()']]], + ['on_5fdestroy_917',['on_destroy',['../classentt_1_1basic__registry.html#ad87a72c6d1e49a2fd992ddb7fd9d5a93',1,'entt::basic_registry::on_destroy()'],['../classentt_1_1sigh__storage__mixin.html#a04cc3ac5e26e6a0070fc87a8e5e5fb3e',1,'entt::sigh_storage_mixin::on_destroy()']]], + ['on_5fupdate_918',['on_update',['../classentt_1_1basic__registry.html#aaaf474d42df7b8852c4656152cc4a295',1,'entt::basic_registry::on_update()'],['../classentt_1_1sigh__storage__mixin.html#aad9a29530cf1408803a45573ffbee711',1,'entt::sigh_storage_mixin::on_update()']]], + ['once_919',['once',['../classentt_1_1emitter.html#a79834d452b0600ebe0e70c54f4a21fd6',1,'entt::emitter']]], + ['operator_20basic_5fgroup_3c_20entity_5ftype_2c_20owned_5ft_3c_20owned_2e_2e_2e_20_3e_2c_20get_2c_20exclude_20_3e_920',['operator basic_group< entity_type, owned_t< Owned... >, Get, Exclude >',['../structentt_1_1as__group.html#a35cbba4f387f92c80935183da08798ca',1,'entt::as_group']]], + ['operator_20basic_5fhandle_3c_20other_2c_20args_2e_2e_2e_20_3e_921',['operator basic_handle< Other, Args... >',['../structentt_1_1basic__handle.html#a3e3190a9991d334cdd20b4d8841d7545',1,'entt::basic_handle']]], + ['operator_20basic_5fview_3c_20entity_5ftype_2c_20get_5ft_3c_20component_2e_2e_2e_20_3e_2c_20exclude_20_3e_922',['operator basic_view< entity_type, get_t< Component... >, Exclude >',['../structentt_1_1as__view.html#a33df5ef10293a3153cd467edd72be425',1,'entt::as_view']]], + ['operator_20bool_923',['operator bool',['../classentt_1_1basic__any.html#a071b4fda8629b1767b384d01a0113496',1,'entt::basic_any::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a71396a63f68d8375329a1253b9634c7b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a177bb26a1d23da0502aeca143a3ae2a9',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator bool()'],['../structentt_1_1basic__handle.html#a80b439c1dd5924807bc26585c3c1ef4d',1,'entt::basic_handle::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aed52b322f7405bb527769aa051d6186e',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator bool()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aa1e551e84f124033b5cfb5bfd09b630f',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator bool()'],['../classentt_1_1meta__sequence__container.html#a004cb45ad3f51dbde8346fa1b202a13f',1,'entt::meta_sequence_container::operator bool()'],['../classentt_1_1meta__associative__container.html#a202720cb81c234e0e8e16db48b4adf2e',1,'entt::meta_associative_container::operator bool()'],['../classentt_1_1meta__any.html#a307d84b99d93841efc574e7807ac7786',1,'entt::meta_any::operator bool()'],['../structentt_1_1meta__handle.html#a6936d403200fd97fd34d366d9c980c6c',1,'entt::meta_handle::operator bool()'],['../structentt_1_1meta__prop.html#a95a94a16e568cbf443056406155e122e',1,'entt::meta_prop::operator bool()'],['../structentt_1_1meta__data.html#a597429fb3dfbc05a48d2f8dd31133d97',1,'entt::meta_data::operator bool()'],['../structentt_1_1meta__func.html#a84da8b799b2feab77060a686da004b45',1,'entt::meta_func::operator bool()'],['../classentt_1_1meta__type.html#aaf7716aacffeaf51c8dcb283a6cc4630',1,'entt::meta_type::operator bool()'],['../classentt_1_1basic__poly.html#a311984ecc234832af9603c6ba1e3cd02',1,'entt::basic_poly::operator bool()'],['../classentt_1_1resource.html#a4724946781a3d5e062d5c6c5a210ee28',1,'entt::resource::operator bool()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#af9dcbcb5c62a4cbfeb41cae502e5236e',1,'entt::delegate< Ret(Args...)>::operator bool()'],['../classentt_1_1connection.html#ad912298fe40bd1b6aa5b8b950850bb70',1,'entt::connection::operator bool()'],['../structentt_1_1scoped__connection.html#a0b4e9958e0dbc1b1ba14a878531a475d',1,'entt::scoped_connection::operator bool()']]], + ['operator_20const_20value_5ftype_20_2a_924',['operator const value_type *',['../classentt_1_1basic__hashed__string.html#aa9ade09d3f55abe5bbae3438331aa7a2',1,'entt::basic_hashed_string']]], + ['operator_20entity_925',['operator Entity',['../structentt_1_1null__t.html#a816903f5ef0036594891edcf253d2570',1,'entt::null_t::operator Entity()'],['../structentt_1_1tombstone__t.html#a486219c88fe6ca91248095914fca745e',1,'entt::tombstone_t::operator Entity()']]], + ['operator_20entity_5ftype_926',['operator entity_type',['../structentt_1_1basic__handle.html#ae094b8474a9e4363b5c4503753b9ec4c',1,'entt::basic_handle']]], + ['operator_20hash_5ftype_927',['operator hash_type',['../classentt_1_1basic__hashed__string.html#a342323328cacb574f886a5720dd71580',1,'entt::basic_hashed_string']]], + ['operator_20id_5ftype_928',['operator id_type',['../structentt_1_1type__index.html#a5909d64d944e5957c22df8be65e17926',1,'entt::type_index::operator id_type()'],['../structentt_1_1type__hash.html#af86c7a01cb72943521b4dd6e7ac0bc8c',1,'entt::type_hash::operator id_type()']]], + ['operator_20type_929',['operator Type',['../structentt_1_1monostate.html#a1ec272e17db93124df74bd15d36b1e1d',1,'entt::monostate']]], + ['operator_20type_20_26_930',['operator Type &',['../classentt_1_1resource.html#a0cc7200575e1047b645932f51b79af32',1,'entt::resource']]], + ['operator_20type_20_26_26_931',['operator Type &&',['../structentt_1_1poly__inspector.html#a5b44cbea11e79b2ff918165b7bf100eb',1,'entt::poly_inspector']]], + ['operator_21_3d_932',['operator!=',['../structentt_1_1null__t.html#a1bd5e7e2a2fdc78944cf32ee03a6d0ab',1,'entt::null_t::operator!=([[maybe_unused]] const null_t other) const'],['../structentt_1_1null__t.html#a1e155d4d92605008969c3df64484ed44',1,'entt::null_t::operator!=(const Entity entity) const'],['../structentt_1_1tombstone__t.html#af2e901bd03a7676aa3596f8c55f91d1e',1,'entt::tombstone_t::operator!=([[maybe_unused]] const tombstone_t other) const'],['../structentt_1_1tombstone__t.html#ae75cbf2733dcde452dd782d3c7eda923',1,'entt::tombstone_t::operator!=(const Entity entity) const'],['../namespaceentt.html#a04ebb219547c34209a94c9eb6d26eda1',1,'entt::operator!=(const meta_type &lhs, const meta_type &rhs)'],['../namespaceentt.html#ae38ac5bc7b9097ec21eb1058db206cff',1,'entt::operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)'],['../namespaceentt.html#ac200eb460760246368bb737dc434c0eb',1,'entt::operator!=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a5b6b2e64d7d0ca7bd46c4fc9009cb552',1,'entt::operator!=(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a6185f9faa3f9fa26ecb1b9a837016147',1,'entt::operator!=(const Entity entity, const null_t other)'],['../namespaceentt.html#a39702a79d9ba6f5d7cb8668b0a7a1524',1,'entt::operator!=(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#a7ef0d5ec3214e57aa4b8406fbe9ee3a5',1,'entt::operator!=(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)'],['../namespaceentt.html#a845d4ef2c448264153449c92157a0359',1,'entt::operator!=(const meta_any &lhs, const meta_any &rhs)'],['../namespaceentt.html#ab45b13a74468617a1b7f497454b76b26',1,'entt::operator!=(const resource< ILhs > &lhs, const resource< IRhs > &rhs)'],['../namespaceentt.html#ac8711ef7a24e5329d7cbd0d05136874e',1,'entt::operator!=(const delegate< Ret(Args...)> &lhs, const delegate< Ret(Args...)> &rhs)']]], + ['operator_22_22_5fhs_933',['operator""_hs',['../namespaceentt.html#a05a416d8267b21fb9d85529efbee5f52',1,'entt::literals']]], + ['operator_22_22_5fhws_934',['operator""_hws',['../namespaceentt.html#a1b7823b3abb5f879174a26b2a051f65a',1,'entt::literals']]], + ['operator_28_29_935',['operator()',['../structentt_1_1std__sort.html#a8895e4acd1677a60e07d7e28748fe667',1,'entt::std_sort::operator()()'],['../structentt_1_1insertion__sort.html#a73a5644fe5b683f9b9376c89ac47f2b8',1,'entt::insertion_sort::operator()()'],['../structentt_1_1radix__sort.html#a1989f6fbe18d3d82fdea9745d6b9ee96',1,'entt::radix_sort::operator()()'],['../structentt_1_1allocation__deleter.html#acf2b15c272b52afdcbe6897713b0a4a4',1,'entt::allocation_deleter::operator()()'],['../structentt_1_1identity.html#a4bab5676dfa9eca188b2145708a086b8',1,'entt::identity::operator()()'],['../structentt_1_1y__combinator.html#a353f6f122334b26a90ce81cc32744ec3',1,'entt::y_combinator::operator()(Args &&...args) const'],['../structentt_1_1y__combinator.html#ade7f955583e7a887220e6ef391bfb7d2',1,'entt::y_combinator::operator()(Args &&...args)'],['../structentt_1_1resource__loader.html#a675f609c3081613b042167bd44050e70',1,'entt::resource_loader::operator()()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a0e53caedb53810bc96aa71bce199c990',1,'entt::delegate< Ret(Args...)>::operator()()']]], + ['operator_2a_936',['operator*',['../classentt_1_1meta__any.html#a15c62ff440280cb6e25e6a5b781a8aae',1,'entt::meta_any::operator*()'],['../classentt_1_1resource.html#a5da08fd8beef8e5af8a0aac7ebefc491',1,'entt::resource::operator*()']]], + ['operator_2b_937',['operator+',['../namespaceentt.html#a6c6e966c8af5b1452811aa55adbbdf47',1,'entt::operator+(type_list< Type... >, type_list< Other... >)'],['../namespaceentt.html#aabc6dd5fb4d2bc92d9e5101b7b0bce1d',1,'entt::operator+(value_list< Value... >, value_list< Other... >)']]], + ['operator_2d_3e_938',['operator->',['../classentt_1_1basic__poly.html#a0d3461b19558dceb0b60d7f7f2e23ef2',1,'entt::basic_poly::operator->() const'],['../classentt_1_1basic__poly.html#a06f659d892ece6b3908644a5452ed550',1,'entt::basic_poly::operator->()'],['../structentt_1_1input__iterator__pointer.html#ab4a5b1478272e26c60f7123b0a2e155f',1,'entt::input_iterator_pointer::operator->()'],['../classentt_1_1resource.html#a740a657eabb34596ee84e248025dc57c',1,'entt::resource::operator->()'],['../structentt_1_1meta__handle.html#ad1309701800c7727eb519ee14b655e30',1,'entt::meta_handle::operator->()'],['../structentt_1_1meta__handle.html#aeaeac6808357732eeb2ce615c7ccb0eb',1,'entt::meta_handle::operator->() const']]], + ['operator_3c_939',['operator<',['../namespaceentt.html#a95abccf779882bf65c4bb1cb99b8059c',1,'entt::operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ac2789bea84be3354b9ec3f48b0af539c',1,'entt::operator<(const type_info &lhs, const type_info &rhs)']]], + ['operator_3c_3d_940',['operator<=',['../namespaceentt.html#a400fd2e18a1fe98013bd4cdb281ad98f',1,'entt::operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#ac99351681df5ffc84efcc14603ab6fc3',1,'entt::operator<=(const type_info &lhs, const type_info &rhs)']]], + ['operator_3d_941',['operator=',['../classentt_1_1basic__continuous__loader.html#afd396d84cb27e070a6a812bd28140c75',1,'entt::basic_continuous_loader::operator=()'],['../classentt_1_1basic__sparse__set.html#afd87d086a1b895ac6253c311eb90affb',1,'entt::basic_sparse_set::operator=()'],['../classentt_1_1basic__storage.html#a7672e87c11c51f4edf70ae68def122c8',1,'entt::basic_storage::operator=()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aef13645252ab183b46fa966bfcdd4ded',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::operator=()'],['../classentt_1_1meta__any.html#a97360c78351767409f9db58c9f785ad5',1,'entt::meta_any::operator=(const meta_any &other)'],['../classentt_1_1meta__any.html#a867681175c0928270919df9476ba10c5',1,'entt::meta_any::operator=(meta_any &&other)'],['../classentt_1_1meta__any.html#ae9298a9b894c870392da35f696fbb044',1,'entt::meta_any::operator=(Type &&value)'],['../structentt_1_1meta__handle.html#a750eb55693845b28da117db4d342b8e6',1,'entt::meta_handle::operator=(const meta_handle &)=delete'],['../structentt_1_1meta__handle.html#aacfd03669af75ce2684917e8e9f90132',1,'entt::meta_handle::operator=(meta_handle &&)=default'],['../classentt_1_1scheduler.html#aea6ab78dbf00ba17c6e828ee0505afd9',1,'entt::scheduler::operator=()'],['../classentt_1_1resource__cache.html#ac62e77427a14f432ce48e73be6d0e99b',1,'entt::resource_cache::operator=(const resource_cache &)=default'],['../classentt_1_1resource__cache.html#aa45af1086197beca5820c03ecf2188f4',1,'entt::resource_cache::operator=(resource_cache &&)=default'],['../classentt_1_1resource.html#af2ffb65e0b5b160305c0ad7b73797c28',1,'entt::resource::operator=(const resource &)=default'],['../classentt_1_1resource.html#a85556f1c70980a5882dd3199438e0179',1,'entt::resource::operator=(resource &&)=default'],['../classentt_1_1resource.html#a6f48057e3737c8dd9b6baec5e58996ba',1,'entt::resource::operator=(const resource< Other > &other)'],['../classentt_1_1resource.html#a06d72fcef4d307cb9c601e56886fe4ff',1,'entt::resource::operator=(resource< Other > &&other)'],['../classentt_1_1basic__dispatcher.html#a6a8f6c84d439a372cf837509d540cc86',1,'entt::basic_dispatcher::operator=()'],['../classentt_1_1emitter.html#ab270d2c6d986621a781467e29e64629c',1,'entt::emitter::operator=()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a23c0e4cfafdc631539651db4af7f0ac2',1,'entt::sigh< Ret(Args...), Allocator >::operator=(const sigh &other)'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a515f527211650b9b3882deb4e4c5d650',1,'entt::sigh< Ret(Args...), Allocator >::operator=(sigh &&other)'],['../structentt_1_1scoped__connection.html#ae079c45e0eb97f31ec1d5a4be76163fc',1,'entt::scoped_connection::operator=(const scoped_connection &)=delete'],['../structentt_1_1scoped__connection.html#abe0ec74231b7bece430c6dd5ffdeddc2',1,'entt::scoped_connection::operator=(scoped_connection &&other)'],['../structentt_1_1scoped__connection.html#a900d499bf30a8f33beb19f41af9b93b3',1,'entt::scoped_connection::operator=(connection other)'],['../classentt_1_1dense__map.html#aa25873c134ef5594814afe17d76c283b',1,'entt::dense_map::operator=(const dense_map &)=default'],['../classentt_1_1dense__map.html#a0d12dd6f2862dc8f72d170f52e86fdcd',1,'entt::dense_map::operator=(dense_map &&)=default'],['../classentt_1_1dense__set.html#a4286ac0c51fefa80dff5feb425aed034',1,'entt::dense_set::operator=(const dense_set &)=default'],['../classentt_1_1dense__set.html#ac3fd2bba7dc5b180d0b10ef4b2422406',1,'entt::dense_set::operator=(dense_set &&)=default'],['../classentt_1_1basic__any.html#a2918b13d6957ccaae7796ea76be6807f',1,'entt::basic_any::operator=(const basic_any &other)'],['../classentt_1_1basic__any.html#ab8d80c9b2be44588959c2a3cb451c162',1,'entt::basic_any::operator=(basic_any &&other)'],['../classentt_1_1basic__any.html#a58bb0a9c97a6a75e5b7984acf6fd268b',1,'entt::basic_any::operator=(Type &&value)'],['../classentt_1_1compressed__pair.html#a73b4a959b934357bc41b8e9c53b47496',1,'entt::compressed_pair::operator=(const compressed_pair &other)=default'],['../classentt_1_1compressed__pair.html#ad61f40edf314083598c0b0d76aa90fa1',1,'entt::compressed_pair::operator=(compressed_pair &&other)=default'],['../structentt_1_1input__iterator__pointer.html#acdd70bff5e5dc7dedd5851432bbed9d9',1,'entt::input_iterator_pointer::operator=(const input_iterator_pointer &)=delete'],['../structentt_1_1input__iterator__pointer.html#a24452709a3e3c45713c033073f02c485',1,'entt::input_iterator_pointer::operator=(input_iterator_pointer &&)=default'],['../structentt_1_1monostate.html#aaffae05e053ccedffd625e8c1f0664c5',1,'entt::monostate::operator=()'],['../classentt_1_1basic__observer.html#a03dcb6b0999d29bc39410d7ae6d9ac53',1,'entt::basic_observer::operator=(const basic_observer &)=delete'],['../classentt_1_1basic__observer.html#a8b7cd199f236a4dee02f202ec0fd6281',1,'entt::basic_observer::operator=(basic_observer &&)=delete'],['../classentt_1_1basic__registry.html#a23d233b9e2c4a92395a60087891c52fe',1,'entt::basic_registry::operator=()'],['../classentt_1_1basic__snapshot.html#a1484b609195cfd057bbdd8808d4392bc',1,'entt::basic_snapshot::operator=()'],['../classentt_1_1basic__snapshot__loader.html#aa55eeaad2ab4dd117524afff9d6e184b',1,'entt::basic_snapshot_loader::operator=()']]], + ['operator_3d_3d_942',['operator==',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ab1cf637f608b81e72070b7d6cc385e9d',1,'entt::delegate< Ret(Args...)>::operator==()'],['../namespaceentt.html#a8ba0fe41e17e0c506e6fe7d58f499d1c',1,'entt::operator==(const resource< Res > &lhs, const resource< Other > &rhs)'],['../namespaceentt.html#aee5fe16dfbb40ab097d339b0c008fae7',1,'entt::operator==(const basic_handle< Args... > &lhs, const basic_handle< Other... > &rhs)'],['../namespaceentt.html#a0f371da1ef604fa726a88e9733e5ee54',1,'entt::operator==(const Entity entity, const tombstone_t other)'],['../namespaceentt.html#af6de691c4ec15d4a63ea8960563bbea0',1,'entt::operator==(const Entity entity, const null_t other)'],['../namespaceentt.html#a13f95d943a5794e7f7b481d3e02a2d96',1,'entt::operator==(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a07b2e32d6df969a3d20a8f263265fe96',1,'entt::operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../classentt_1_1basic__any.html#adc66c85290945fc808d1979db9040454',1,'entt::basic_any::operator==()'],['../structentt_1_1null__t.html#aa9a56492571f7949c26fc7ce4c9aa441',1,'entt::null_t::operator==([[maybe_unused]] const null_t other) const'],['../structentt_1_1null__t.html#a510e2259bb0ed264ecdf64f7e8b51665',1,'entt::null_t::operator==(const Entity entity) const'],['../structentt_1_1tombstone__t.html#aa54c795fa1a8e817e56f14e29fc8beee',1,'entt::tombstone_t::operator==([[maybe_unused]] const tombstone_t other) const'],['../structentt_1_1tombstone__t.html#aa55c02c8ea69dc462ea78e4ad20c385f',1,'entt::tombstone_t::operator==(const Entity entity) const'],['../classentt_1_1meta__any.html#a1bd17bffb75be10543e85c78185d765a',1,'entt::meta_any::operator==()'],['../classentt_1_1meta__type.html#a39159083cd8ac72bb27859ccd4f0f732',1,'entt::meta_type::operator==()']]], + ['operator_3e_943',['operator>',['../namespaceentt.html#affca347714c6771f1f5928f1c18a070f',1,'entt::operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)'],['../namespaceentt.html#a28f32860fd6de66a832389b365045047',1,'entt::operator>(const type_info &lhs, const type_info &rhs)']]], + ['operator_3e_3d_944',['operator>=',['../namespaceentt.html#a2e6acc16fe38d13c69b5d1fb237e4ac5',1,'entt::operator>=(const type_info &lhs, const type_info &rhs)'],['../namespaceentt.html#a5d583f542e17fa8eb56d8d01c34b8920',1,'entt::operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)']]], + ['operator_5b_5d_945',['operator[]',['../classentt_1_1resource__cache.html#ac5d5a3100bb36367700d12a808286fbb',1,'entt::resource_cache::operator[]()'],['../classentt_1_1dense__map.html#a1a6524541824c6a5a544ea026629488c',1,'entt::dense_map::operator[](const key_type &key)'],['../classentt_1_1dense__map.html#adbc0bc46615a25a4079651b75eebbe4c',1,'entt::dense_map::operator[](key_type &&key)'],['../classentt_1_1resource__cache.html#af571e731540287786242dbb28ef0fe1f',1,'entt::resource_cache::operator[]()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aaaf16dde27d8d4aed568a519a87b5b1b',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#aeed935700bcf21af637b96e144178a56',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__sparse__set.html#a3f88e4df5066e55ebfba192a85050553',1,'entt::basic_sparse_set::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a29cfb727d48591b93b58a5acb1d85fae',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator[]()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab5aed61f5c7416b66f6e93c61b9e787b',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[](const size_type pos) const'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#aab90453fa7feb640ec46e2b50b4caace',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator[](const entity_type entt) const'],['../classentt_1_1meta__sequence__container.html#a69ecff5787961fb20256491e56df04ee',1,'entt::meta_sequence_container::operator[]()']]], + ['operator_7c_946',['operator|',['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a1267ff896c8bd61b41b3e9d069f9ecc4',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::operator|()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a71bf0b47a5091541cb870f669aca6a1d',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::operator|()']]], + ['orphan_947',['orphan',['../structentt_1_1basic__handle.html#a04557a12530c2c86cd90694d2f4c7bc7',1,'entt::basic_handle::orphan()'],['../classentt_1_1basic__registry.html#a10f5e61d4cabab9e9c1e87edc30de551',1,'entt::basic_registry::orphan()']]], + ['orphans_948',['orphans',['../classentt_1_1basic__continuous__loader.html#ac8b328bb8c6c4acde51ab5b943f0ea86',1,'entt::basic_continuous_loader::orphans()'],['../classentt_1_1basic__snapshot__loader.html#acd881016761f5eb598763fbf3595a625',1,'entt::basic_snapshot_loader::orphans()']]], + ['overload_949',['overload',['../namespaceentt.html#a386a739051d9d37a5578785b77fc426b',1,'entt::overload(Type Class::*member)'],['../namespaceentt.html#ad4ea6822ef21f52c732ba3baea450159',1,'entt::overload(Func *func)']]], + ['overloaded_950',['overloaded',['../namespaceentt.html#a26eb67ac302229374c5fb623d529f5eb',1,'entt']]], + ['owned_951',['owned',['../classentt_1_1basic__registry.html#a9b93ba6498a1513daff8548c242dc80a',1,'entt::basic_registry']]], + ['owner_952',['owner',['../classentt_1_1meta__any.html#abc6c66b9bf085ec3c67c10540d1f48a7',1,'entt::meta_any::owner()'],['../classentt_1_1basic__any.html#ae20c3f5eecdcdaf715b332bbc363ee4d',1,'entt::basic_any::owner()']]], + ['string_5fview_953',['string_view',['../structentt_1_1type__name.html#a5c425f6e665e43b4cf0a2249b8c127e2',1,'entt::type_name']]] ]; diff --git a/search/functions_e.js b/search/functions_e.js index 0b11f6eff..58b7004c6 100644 --- a/search/functions_e.js +++ b/search/functions_e.js @@ -1,16 +1,16 @@ var searchData= [ - ['patch_961',['patch',['../structentt_1_1basic__handle.html#a78728a75868fc9a74fc033f3249ba642',1,'entt::basic_handle::patch()'],['../classentt_1_1basic__registry.html#a22454253689ff77e41326f849bfea976',1,'entt::basic_registry::patch()'],['../classentt_1_1basic__storage.html#a93762825431af9dc007dd5db8c5bc21c',1,'entt::basic_storage::patch()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a9840b8e1334f079dec3a37d46fb9a1fe',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::patch()'],['../classentt_1_1sigh__storage__mixin.html#adb5cd6a62df2a85126b3d77b31eb1b83',1,'entt::sigh_storage_mixin::patch()']]], - ['pause_962',['pause',['../classentt_1_1process.html#a46b356ef2c1f09818b4dc546721f49fa',1,'entt::process']]], - ['paused_963',['paused',['../classentt_1_1process.html#a80e3a0f9dd6724683946f88fb519ec75',1,'entt::process']]], - ['policy_964',['policy',['../classentt_1_1basic__sparse__set.html#a02c273b23bb87b33e04dc598409eeede',1,'entt::basic_sparse_set']]], - ['poly_5fcall_965',['poly_call',['../namespaceentt.html#a8b4f2adf317a555138ef5c1cf45b034a',1,'entt']]], - ['prepare_966',['prepare',['../structentt_1_1basic__organizer_1_1vertex.html#a9208ce46f18ba46229bacbc070fd8eec',1,'entt::basic_organizer::vertex']]], - ['process_5fadaptor_967',['process_adaptor',['../structentt_1_1process__adaptor.html#af065d57ac7c645279e4a5033f326abd8',1,'entt::process_adaptor']]], - ['prop_968',['prop',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a000d32f9fe649aa4526a174c3a0e25e9',1,'entt::meta_factory< Type, Spec... >::prop()'],['../structentt_1_1meta__data.html#abe3ebb33e7c66a067c5162715c66c880',1,'entt::meta_data::prop() const'],['../structentt_1_1meta__data.html#a2258b0808fc9c35a27846804b1388fd9',1,'entt::meta_data::prop(meta_any key) const'],['../structentt_1_1meta__func.html#a5094550dfc4082e825fb1408160a234e',1,'entt::meta_func::prop() const'],['../structentt_1_1meta__func.html#a78c007b0f307c817ae519004b14d3ea0',1,'entt::meta_func::prop(meta_any key) const'],['../classentt_1_1meta__type.html#afee5a926f135e9f2f75d8b5522866ab8',1,'entt::meta_type::prop() const'],['../classentt_1_1meta__type.html#a4931fc02b58faf3b4c6c99e57d264691',1,'entt::meta_type::prop(meta_any key) const']]], - ['propagate_5fon_5fcontainer_5fcopy_5fassignment_969',['propagate_on_container_copy_assignment',['../namespaceentt.html#a9eb49df8bf1b69e836039b76e5b9938e',1,'entt']]], - ['propagate_5fon_5fcontainer_5fmove_5fassignment_970',['propagate_on_container_move_assignment',['../namespaceentt.html#a122ae54373a080574c45c77319cec7f7',1,'entt']]], - ['propagate_5fon_5fcontainer_5fswap_971',['propagate_on_container_swap',['../namespaceentt.html#a1359cd624e6726f884df34df66656855',1,'entt']]], - ['props_972',['props',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a5f469f90597875f661bade58bdb28a93',1,'entt::meta_factory< Type, Spec... >']]], - ['publish_973',['publish',['../classentt_1_1emitter.html#ad2877515662e6fce3558688b4fd598aa',1,'entt::emitter::publish()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0893ef46dac20781070826fb93c50fb4',1,'entt::sigh< Ret(Args...), Allocator >::publish()']]] + ['patch_954',['patch',['../structentt_1_1basic__handle.html#a78728a75868fc9a74fc033f3249ba642',1,'entt::basic_handle::patch()'],['../classentt_1_1basic__registry.html#a22454253689ff77e41326f849bfea976',1,'entt::basic_registry::patch()'],['../classentt_1_1sigh__storage__mixin.html#adb5cd6a62df2a85126b3d77b31eb1b83',1,'entt::sigh_storage_mixin::patch()'],['../classentt_1_1basic__storage.html#a93762825431af9dc007dd5db8c5bc21c',1,'entt::basic_storage::patch()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a9840b8e1334f079dec3a37d46fb9a1fe',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::patch()']]], + ['pause_955',['pause',['../classentt_1_1process.html#a46b356ef2c1f09818b4dc546721f49fa',1,'entt::process']]], + ['paused_956',['paused',['../classentt_1_1process.html#a80e3a0f9dd6724683946f88fb519ec75',1,'entt::process']]], + ['policy_957',['policy',['../classentt_1_1basic__sparse__set.html#a02c273b23bb87b33e04dc598409eeede',1,'entt::basic_sparse_set']]], + ['poly_5fcall_958',['poly_call',['../namespaceentt.html#a8b4f2adf317a555138ef5c1cf45b034a',1,'entt']]], + ['prepare_959',['prepare',['../structentt_1_1basic__organizer_1_1vertex.html#a9208ce46f18ba46229bacbc070fd8eec',1,'entt::basic_organizer::vertex']]], + ['process_5fadaptor_960',['process_adaptor',['../structentt_1_1process__adaptor.html#af065d57ac7c645279e4a5033f326abd8',1,'entt::process_adaptor']]], + ['prop_961',['prop',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a000d32f9fe649aa4526a174c3a0e25e9',1,'entt::meta_factory< Type, Spec... >::prop()'],['../structentt_1_1meta__data.html#abe3ebb33e7c66a067c5162715c66c880',1,'entt::meta_data::prop() const'],['../structentt_1_1meta__data.html#a2258b0808fc9c35a27846804b1388fd9',1,'entt::meta_data::prop(meta_any key) const'],['../structentt_1_1meta__func.html#a5094550dfc4082e825fb1408160a234e',1,'entt::meta_func::prop() const'],['../structentt_1_1meta__func.html#a78c007b0f307c817ae519004b14d3ea0',1,'entt::meta_func::prop(meta_any key) const'],['../classentt_1_1meta__type.html#afee5a926f135e9f2f75d8b5522866ab8',1,'entt::meta_type::prop() const'],['../classentt_1_1meta__type.html#a4931fc02b58faf3b4c6c99e57d264691',1,'entt::meta_type::prop(meta_any key) const']]], + ['propagate_5fon_5fcontainer_5fcopy_5fassignment_962',['propagate_on_container_copy_assignment',['../namespaceentt.html#a9eb49df8bf1b69e836039b76e5b9938e',1,'entt']]], + ['propagate_5fon_5fcontainer_5fmove_5fassignment_963',['propagate_on_container_move_assignment',['../namespaceentt.html#a122ae54373a080574c45c77319cec7f7',1,'entt']]], + ['propagate_5fon_5fcontainer_5fswap_964',['propagate_on_container_swap',['../namespaceentt.html#a1359cd624e6726f884df34df66656855',1,'entt']]], + ['props_965',['props',['../classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html#a5f469f90597875f661bade58bdb28a93',1,'entt::meta_factory< Type, Spec... >']]], + ['publish_966',['publish',['../classentt_1_1emitter.html#ad2877515662e6fce3558688b4fd598aa',1,'entt::emitter::publish()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a0893ef46dac20781070826fb93c50fb4',1,'entt::sigh< Ret(Args...), Allocator >::publish()']]] ]; diff --git a/search/functions_f.js b/search/functions_f.js index b5d09cfb9..605378641 100644 --- a/search/functions_f.js +++ b/search/functions_f.js @@ -1,28 +1,25 @@ var searchData= [ - ['raw_974',['raw',['../classentt_1_1basic__storage.html#a842d101561221a5b6823ecb68297d0c7',1,'entt::basic_storage::raw() const'],['../classentt_1_1basic__storage.html#ab8dc30f83d69d4fcaae062dc2a6334c4',1,'entt::basic_storage::raw()']]], - ['rbegin_975',['rbegin',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ad7540139e3e2097c301b25de94867576',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8d0936203f3174c74cb26f79d9125afe',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__sparse__set.html#aeb97353b34992345fde1fe763885ef41',1,'entt::basic_sparse_set::rbegin()'],['../classentt_1_1basic__storage.html#a294e9330b74e232a905b9f78a6524917',1,'entt::basic_storage::rbegin() const'],['../classentt_1_1basic__storage.html#a7f86841bc48d579993a8f3c0f8e080c3',1,'entt::basic_storage::rbegin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a3469e9faa0e1c34beead1a483f1b0504',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rbegin()']]], - ['ref_976',['ref',['../structentt_1_1service__locator.html#a5379f8d798c2de5b1c41756ba3959e06',1,'entt::service_locator']]], - ['registry_977',['registry',['../structentt_1_1basic__handle.html#a32db2781fd85be391ba5cb39a8fd3b57',1,'entt::basic_handle']]], - ['rehash_978',['rehash',['../classentt_1_1dense__hash__map.html#ab75c7e8afb0a3564f49844829a74a7bf',1,'entt::dense_hash_map::rehash()'],['../classentt_1_1dense__hash__set.html#aaec6797bcad6e06dc6f4c1b7f88088a8',1,'entt::dense_hash_set::rehash()']]], - ['rejected_979',['rejected',['../classentt_1_1process.html#a871cc9aa013c2aba9f7c0712a5fe3b98',1,'entt::process']]], - ['release_980',['release',['../classentt_1_1basic__registry.html#a3d9cb2368384b0952cb54848e777359e',1,'entt::basic_registry::release(const entity_type entity)'],['../classentt_1_1basic__registry.html#af9c919867fc93a7e1a2d0762ac3a9877',1,'entt::basic_registry::release(const entity_type entity, const version_type version)'],['../classentt_1_1basic__registry.html#a69fa71876716487256ac47e19f27c553',1,'entt::basic_registry::release(It first, It last)'],['../classentt_1_1connection.html#ae564477ab623301169916c1992c970a8',1,'entt::connection::release()'],['../structentt_1_1scoped__connection.html#a7bd2be785ba586664d8e8d039dc73ead',1,'entt::scoped_connection::release()']]], - ['released_981',['released',['../classentt_1_1basic__registry.html#a48630f103bc6448af1f2b2928df4f488',1,'entt::basic_registry']]], - ['reload_982',['reload',['../classentt_1_1resource__cache.html#a99bb176aa037d33218b4ea625a82300c',1,'entt::resource_cache']]], - ['remove_983',['remove',['../structentt_1_1basic__handle.html#ac47661c3d8845005ac3826c6c124a2d5',1,'entt::basic_handle::remove()'],['../classentt_1_1basic__registry.html#aa66ca71c5eb6c2e1b3bde6ff86a268c7',1,'entt::basic_registry::remove(const entity_type entity)'],['../classentt_1_1basic__registry.html#a597e4d37d39c02801f7b244148d5e4af',1,'entt::basic_registry::remove(It first, It last)'],['../classentt_1_1basic__sparse__set.html#af02e5833d5edb2450303bd1c029213b8',1,'entt::basic_sparse_set::remove(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#ab2b4ee6c81e845f332c35c89acb8f436',1,'entt::basic_sparse_set::remove(It first, It last)']]], - ['rend_984',['rend',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4a01916334cf8dfcf87818c9d60a7d29',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ab4b09ef323459fb46b2a2bdea31759fa',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__sparse__set.html#a1bc1fee7c920941ac936ed7df9207343',1,'entt::basic_sparse_set::rend()'],['../classentt_1_1basic__storage.html#a9f85346282d5ea0f578607e02b37f1dd',1,'entt::basic_storage::rend() const'],['../classentt_1_1basic__storage.html#a72789cfb1fec3eae4fb1197965eadae2',1,'entt::basic_storage::rend()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a4bc3a043ad6ff8f74082764f5cd3a22c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rend()']]], - ['replace_985',['replace',['../structentt_1_1basic__handle.html#a4cf1511f05374af28498b513c32c4a45',1,'entt::basic_handle::replace()'],['../classentt_1_1basic__registry.html#a0501ff5a96a3421f3eec427bf5d62380',1,'entt::basic_registry::replace()']]], - ['reserve_986',['reserve',['../classentt_1_1dense__hash__map.html#ac97a269ac4883ed9b269ca33a2728724',1,'entt::dense_hash_map::reserve()'],['../classentt_1_1dense__hash__set.html#a031f5e348d126c0c68c08dc49024a17c',1,'entt::dense_hash_set::reserve()'],['../classentt_1_1basic__registry.html#a97677776c466a310547be1fdfdf84ff9',1,'entt::basic_registry::reserve()'],['../classentt_1_1basic__sparse__set.html#a58d49df52ee3133a1347dc01131a4f1a',1,'entt::basic_sparse_set::reserve()'],['../classentt_1_1basic__storage.html#a9006cd644effed8a5290283d05352ce7',1,'entt::basic_storage::reserve()']]], - ['reset_987',['reset',['../classentt_1_1basic__any.html#a0f267d3bbc148e7e240b902b1819c9a6',1,'entt::basic_any::reset()'],['../structentt_1_1service__locator.html#a4d655acab54d87058ad41a266830d0e8',1,'entt::service_locator::reset()'],['../classentt_1_1meta__any.html#a92cb99988bdeb9453f2470b02c5249fb',1,'entt::meta_any::reset()'],['../classentt_1_1basic__poly.html#a43ab35169a0fdb31f7f5db5e5ad0e17d',1,'entt::basic_poly::reset()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a20cfbc558d087ab1022a41f9453d2f3f',1,'entt::delegate< Ret(Args...)>::reset()']]], - ['resize_988',['resize',['../classentt_1_1meta__sequence__container.html#a7ef2656ac8dcdfb0b78313dab532f531',1,'entt::meta_sequence_container']]], - ['resolve_989',['resolve',['../namespaceentt.html#a834693b80a8d9af8b6d6edb81cb54b39',1,'entt::resolve(const type_info &info)'],['../namespaceentt.html#a0b62be0d39676cb86f2aefefa890b198',1,'entt::resolve()'],['../namespaceentt.html#a1915a651e7ce55938a09269c3d9c98e4',1,'entt::resolve(const id_type id)']]], - ['resource_5fcache_990',['resource_cache',['../classentt_1_1resource__cache.html#a919d10578aeda6ad9dd04e1b969b8a9c',1,'entt::resource_cache::resource_cache()=default'],['../classentt_1_1resource__cache.html#ac785934919090b5755a87ab34804b163',1,'entt::resource_cache::resource_cache(resource_cache &&)=default']]], - ['resource_5fhandle_991',['resource_handle',['../classentt_1_1resource__handle.html#afb9bff321847029a473ffe4e7c486b42',1,'entt::resource_handle::resource_handle()=default'],['../classentt_1_1resource__handle.html#a956f8cad244f0239984326e6e341ff0e',1,'entt::resource_handle::resource_handle(std::shared_ptr< resource_type > res)'],['../classentt_1_1resource__handle.html#a15d311a1fdcde8ee910df415b21e9f07',1,'entt::resource_handle::resource_handle(resource_handle &&other)=default'],['../classentt_1_1resource__handle.html#a7e10e22e344bc029eb6b1f90293276a0',1,'entt::resource_handle::resource_handle(const resource_handle< Other > &other, resource_type &res) noexcept'],['../classentt_1_1resource__handle.html#aa6462af299f1cd36898e916bbce96f55',1,'entt::resource_handle::resource_handle(const resource_handle< Other > &other)'],['../classentt_1_1resource__handle.html#a5a8f44ef759531027a6d8a7e7556b5de',1,'entt::resource_handle::resource_handle(resource_handle< Other > &&other)'],['../classentt_1_1resource__handle.html#ab41848b032f6f27bc52c7cfa1f19cb36',1,'entt::resource_handle::resource_handle(const resource_handle &other)=default']]], - ['respect_992',['respect',['../classentt_1_1basic__sparse__set.html#ad6b9f10f5212846bfea6e4fd0ba7a1e4',1,'entt::basic_sparse_set']]], - ['ret_993',['ret',['../structentt_1_1meta__func.html#a67437385a837f1f4020258a315a2ee67',1,'entt::meta_func']]], - ['ro_5fcount_994',['ro_count',['../structentt_1_1basic__organizer_1_1vertex.html#a7ac52b2bcd9d4a5fa78b92822fc88418',1,'entt::basic_organizer::vertex']]], - ['ro_5fdependency_995',['ro_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a8b5be2b47c8609fcf3cb9df26c2b3c86',1,'entt::basic_organizer::vertex']]], - ['runtime_5fview_996',['runtime_view',['../classentt_1_1basic__registry.html#af1d54beb5ae95d5f867c60c05319d1eb',1,'entt::basic_registry']]], - ['rw_5fcount_997',['rw_count',['../structentt_1_1basic__organizer_1_1vertex.html#a0d1f98d28191735e9d22cce081f98b02',1,'entt::basic_organizer::vertex']]], - ['rw_5fdependency_998',['rw_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a6307d593373be2e865e4ca8d463a76e5',1,'entt::basic_organizer::vertex']]] + ['raw_967',['raw',['../classentt_1_1basic__storage.html#a842d101561221a5b6823ecb68297d0c7',1,'entt::basic_storage::raw() const'],['../classentt_1_1basic__storage.html#ab8dc30f83d69d4fcaae062dc2a6334c4',1,'entt::basic_storage::raw()']]], + ['rbegin_968',['rbegin',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ad7540139e3e2097c301b25de94867576',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8d0936203f3174c74cb26f79d9125afe',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rbegin()'],['../classentt_1_1basic__sparse__set.html#aeb97353b34992345fde1fe763885ef41',1,'entt::basic_sparse_set::rbegin()'],['../classentt_1_1basic__storage.html#a294e9330b74e232a905b9f78a6524917',1,'entt::basic_storage::rbegin() const'],['../classentt_1_1basic__storage.html#a7f86841bc48d579993a8f3c0f8e080c3',1,'entt::basic_storage::rbegin()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a3469e9faa0e1c34beead1a483f1b0504',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rbegin()']]], + ['registry_969',['registry',['../structentt_1_1basic__handle.html#a32db2781fd85be391ba5cb39a8fd3b57',1,'entt::basic_handle']]], + ['rehash_970',['rehash',['../classentt_1_1dense__map.html#acfb4e8961af9f2be78836aa8ecba464d',1,'entt::dense_map::rehash()'],['../classentt_1_1dense__set.html#a41d37c3108301ef8021e00f33daeeada',1,'entt::dense_set::rehash()']]], + ['rejected_971',['rejected',['../classentt_1_1process.html#a871cc9aa013c2aba9f7c0712a5fe3b98',1,'entt::process']]], + ['release_972',['release',['../classentt_1_1basic__registry.html#a3d9cb2368384b0952cb54848e777359e',1,'entt::basic_registry::release(const entity_type entity)'],['../classentt_1_1basic__registry.html#af9c919867fc93a7e1a2d0762ac3a9877',1,'entt::basic_registry::release(const entity_type entity, const version_type version)'],['../classentt_1_1basic__registry.html#a69fa71876716487256ac47e19f27c553',1,'entt::basic_registry::release(It first, It last)'],['../classentt_1_1connection.html#ae564477ab623301169916c1992c970a8',1,'entt::connection::release()'],['../structentt_1_1scoped__connection.html#a7bd2be785ba586664d8e8d039dc73ead',1,'entt::scoped_connection::release()']]], + ['released_973',['released',['../classentt_1_1basic__registry.html#a48630f103bc6448af1f2b2928df4f488',1,'entt::basic_registry']]], + ['remove_974',['remove',['../structentt_1_1basic__handle.html#ac47661c3d8845005ac3826c6c124a2d5',1,'entt::basic_handle::remove()'],['../classentt_1_1basic__registry.html#aa66ca71c5eb6c2e1b3bde6ff86a268c7',1,'entt::basic_registry::remove(const entity_type entity)'],['../classentt_1_1basic__registry.html#a597e4d37d39c02801f7b244148d5e4af',1,'entt::basic_registry::remove(It first, It last)'],['../classentt_1_1basic__sparse__set.html#af02e5833d5edb2450303bd1c029213b8',1,'entt::basic_sparse_set::remove(const entity_type entt)'],['../classentt_1_1basic__sparse__set.html#ab2b4ee6c81e845f332c35c89acb8f436',1,'entt::basic_sparse_set::remove(It first, It last)']]], + ['rend_975',['rend',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a4a01916334cf8dfcf87818c9d60a7d29',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#ab4b09ef323459fb46b2a2bdea31759fa',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rend()'],['../classentt_1_1basic__sparse__set.html#a1bc1fee7c920941ac936ed7df9207343',1,'entt::basic_sparse_set::rend()'],['../classentt_1_1basic__storage.html#a9f85346282d5ea0f578607e02b37f1dd',1,'entt::basic_storage::rend() const'],['../classentt_1_1basic__storage.html#a72789cfb1fec3eae4fb1197965eadae2',1,'entt::basic_storage::rend()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a4bc3a043ad6ff8f74082764f5cd3a22c',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::rend()']]], + ['replace_976',['replace',['../structentt_1_1basic__handle.html#a4cf1511f05374af28498b513c32c4a45',1,'entt::basic_handle::replace()'],['../classentt_1_1basic__registry.html#a0501ff5a96a3421f3eec427bf5d62380',1,'entt::basic_registry::replace()']]], + ['reserve_977',['reserve',['../classentt_1_1dense__map.html#aefd32a0147886f0470267db5cabbb06d',1,'entt::dense_map::reserve()'],['../classentt_1_1dense__set.html#ad2d49660bbbfe781919f2ea9bf0ff167',1,'entt::dense_set::reserve()'],['../classentt_1_1basic__registry.html#a97677776c466a310547be1fdfdf84ff9',1,'entt::basic_registry::reserve()'],['../classentt_1_1basic__sparse__set.html#a58d49df52ee3133a1347dc01131a4f1a',1,'entt::basic_sparse_set::reserve()'],['../classentt_1_1basic__storage.html#a9006cd644effed8a5290283d05352ce7',1,'entt::basic_storage::reserve()']]], + ['reset_978',['reset',['../classentt_1_1basic__any.html#a0f267d3bbc148e7e240b902b1819c9a6',1,'entt::basic_any::reset()'],['../structentt_1_1locator.html#acf587655946b69f0c483c204a76ca84b',1,'entt::locator::reset()'],['../classentt_1_1meta__any.html#a92cb99988bdeb9453f2470b02c5249fb',1,'entt::meta_any::reset()'],['../classentt_1_1basic__poly.html#a43ab35169a0fdb31f7f5db5e5ad0e17d',1,'entt::basic_poly::reset()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a20cfbc558d087ab1022a41f9453d2f3f',1,'entt::delegate< Ret(Args...)>::reset()']]], + ['resize_979',['resize',['../classentt_1_1meta__sequence__container.html#a7ef2656ac8dcdfb0b78313dab532f531',1,'entt::meta_sequence_container']]], + ['resolve_980',['resolve',['../namespaceentt.html#a834693b80a8d9af8b6d6edb81cb54b39',1,'entt::resolve(const type_info &info)'],['../namespaceentt.html#a0b62be0d39676cb86f2aefefa890b198',1,'entt::resolve()'],['../namespaceentt.html#a1915a651e7ce55938a09269c3d9c98e4',1,'entt::resolve(const id_type id)']]], + ['resource_981',['resource',['../classentt_1_1resource.html#a5d2a41b70dfa8111f9c6dbab77f736ad',1,'entt::resource::resource()'],['../classentt_1_1resource.html#a6f76bc2b33dc5808f851085b3bf22901',1,'entt::resource::resource(std::shared_ptr< Type > res)'],['../classentt_1_1resource.html#a86aaf1b31fc18461c3f47a5424eb3fbf',1,'entt::resource::resource(const resource &)=default'],['../classentt_1_1resource.html#aa6c2c9559587898d2d46bff7614032b2',1,'entt::resource::resource(resource &&)=default'],['../classentt_1_1resource.html#a74651bbd6ec5b5bbd94efde2d5aa4764',1,'entt::resource::resource(const resource< Other > &other, Type &res)'],['../classentt_1_1resource.html#a9507660bf6e8547f8c0e1be0ca05684f',1,'entt::resource::resource(const resource< Other > &other)'],['../classentt_1_1resource.html#a75c84414a2241405fe138b706820b171',1,'entt::resource::resource(resource< Other > &&other)']]], + ['resource_5fcache_982',['resource_cache',['../classentt_1_1resource__cache.html#a06ba856c4484f52a91a8ee140a223bd5',1,'entt::resource_cache::resource_cache()'],['../classentt_1_1resource__cache.html#a85024663deca781eb063b03254a3f825',1,'entt::resource_cache::resource_cache(const allocator_type &allocator)'],['../classentt_1_1resource__cache.html#a87b5fdd8fd001e8444d1b51de6fd9189',1,'entt::resource_cache::resource_cache(const loader_type &callable, const allocator_type &allocator=allocator_type{})'],['../classentt_1_1resource__cache.html#ab35522f4f96e42e7ac246ce69abd2ee1',1,'entt::resource_cache::resource_cache(const resource_cache &)=default'],['../classentt_1_1resource__cache.html#a1a91e3e3d19167b6c65e826e5419e273',1,'entt::resource_cache::resource_cache(const resource_cache &other, const allocator_type &allocator)'],['../classentt_1_1resource__cache.html#aa54d9a10a10019476cbb863ffb27c3f0',1,'entt::resource_cache::resource_cache(resource_cache &&)=default'],['../classentt_1_1resource__cache.html#a8419d3c2c6e142ca851e2a31d6813c63',1,'entt::resource_cache::resource_cache(resource_cache &&other, const allocator_type &allocator)']]], + ['respect_983',['respect',['../classentt_1_1basic__sparse__set.html#ad6b9f10f5212846bfea6e4fd0ba7a1e4',1,'entt::basic_sparse_set']]], + ['ret_984',['ret',['../structentt_1_1meta__func.html#a67437385a837f1f4020258a315a2ee67',1,'entt::meta_func']]], + ['ro_5fcount_985',['ro_count',['../structentt_1_1basic__organizer_1_1vertex.html#a7ac52b2bcd9d4a5fa78b92822fc88418',1,'entt::basic_organizer::vertex']]], + ['ro_5fdependency_986',['ro_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a8b5be2b47c8609fcf3cb9df26c2b3c86',1,'entt::basic_organizer::vertex']]], + ['rw_5fcount_987',['rw_count',['../structentt_1_1basic__organizer_1_1vertex.html#a0d1f98d28191735e9d22cce081f98b02',1,'entt::basic_organizer::vertex']]], + ['rw_5fdependency_988',['rw_dependency',['../structentt_1_1basic__organizer_1_1vertex.html#a6307d593373be2e865e4ca8d463a76e5',1,'entt::basic_organizer::vertex']]] ]; diff --git a/search/namespaces_0.js b/search/namespaces_0.js index d1e530f0e..bac76e22f 100644 --- a/search/namespaces_0.js +++ b/search/namespaces_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['entt_762',['entt',['../namespaceentt.html',1,'']]] + ['entt_748',['entt',['../namespaceentt.html',1,'']]] ]; diff --git a/search/pages_0.js b/search/pages_0.js index aad546552..e7861913c 100644 --- a/search/pages_0.js +++ b/search/pages_0.js @@ -1,13 +1,13 @@ var searchData= [ - ['crash_20course_3a_20configuration_1190',['Crash Course: configuration',['../md_docs_md_config.html',1,'']]], - ['crash_20course_3a_20containers_1191',['Crash Course: containers',['../md_docs_md_container.html',1,'']]], - ['crash_20course_3a_20cooperative_20scheduler_1192',['Crash Course: cooperative scheduler',['../md_docs_md_process.html',1,'']]], - ['crash_20course_3a_20core_20functionalities_1193',['Crash Course: core functionalities',['../md_docs_md_core.html',1,'']]], - ['crash_20course_3a_20entity_2dcomponent_20system_1194',['Crash Course: entity-component system',['../md_docs_md_entity.html',1,'']]], - ['crash_20course_3a_20events_2c_20signals_20and_20everything_20in_20between_1195',['Crash Course: events, signals and everything in between',['../md_docs_md_signal.html',1,'']]], - ['crash_20course_3a_20poly_1196',['Crash Course: poly',['../md_docs_md_poly.html',1,'']]], - ['crash_20course_3a_20resource_20management_1197',['Crash Course: resource management',['../md_docs_md_resource.html',1,'']]], - ['crash_20course_3a_20runtime_20reflection_20system_1198',['Crash Course: runtime reflection system',['../md_docs_md_meta.html',1,'']]], - ['crash_20course_3a_20service_20locator_1199',['Crash Course: service locator',['../md_docs_md_locator.html',1,'']]] + ['crash_20course_3a_20configuration_1172',['Crash Course: configuration',['../md_docs_md_config.html',1,'']]], + ['crash_20course_3a_20containers_1173',['Crash Course: containers',['../md_docs_md_container.html',1,'']]], + ['crash_20course_3a_20cooperative_20scheduler_1174',['Crash Course: cooperative scheduler',['../md_docs_md_process.html',1,'']]], + ['crash_20course_3a_20core_20functionalities_1175',['Crash Course: core functionalities',['../md_docs_md_core.html',1,'']]], + ['crash_20course_3a_20entity_2dcomponent_20system_1176',['Crash Course: entity-component system',['../md_docs_md_entity.html',1,'']]], + ['crash_20course_3a_20events_2c_20signals_20and_20everything_20in_20between_1177',['Crash Course: events, signals and everything in between',['../md_docs_md_signal.html',1,'']]], + ['crash_20course_3a_20poly_1178',['Crash Course: poly',['../md_docs_md_poly.html',1,'']]], + ['crash_20course_3a_20resource_20management_1179',['Crash Course: resource management',['../md_docs_md_resource.html',1,'']]], + ['crash_20course_3a_20runtime_20reflection_20system_1180',['Crash Course: runtime reflection system',['../md_docs_md_meta.html',1,'']]], + ['crash_20course_3a_20service_20locator_1181',['Crash Course: service locator',['../md_docs_md_locator.html',1,'']]] ]; diff --git a/search/pages_1.js b/search/pages_1.js index 45dcbb981..53031691e 100644 --- a/search/pages_1.js +++ b/search/pages_1.js @@ -1,5 +1,5 @@ var searchData= [ - ['entt_20and_20unreal_20engine_1200',['EnTT and Unreal Engine',['../md_docs_md_unreal.html',1,'']]], - ['entt_20in_20action_1201',['EnTT in Action',['../md_docs_md_links.html',1,'']]] + ['entt_20and_20unreal_20engine_1182',['EnTT and Unreal Engine',['../md_docs_md_unreal.html',1,'']]], + ['entt_20in_20action_1183',['EnTT in Action',['../md_docs_md_links.html',1,'']]] ]; diff --git a/search/pages_2.js b/search/pages_2.js index e494b4b0d..cab9313e2 100644 --- a/search/pages_2.js +++ b/search/pages_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['frequently_20asked_20questions_1202',['Frequently Asked Questions',['../md_docs_md_faq.html',1,'']]] + ['frequently_20asked_20questions_1184',['Frequently Asked Questions',['../md_docs_md_faq.html',1,'']]] ]; diff --git a/search/pages_3.js b/search/pages_3.js index afa7ca646..4e006e8e6 100644 --- a/search/pages_3.js +++ b/search/pages_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['push_20entt_20across_20boundaries_1203',['Push EnTT across boundaries',['../md_docs_md_lib.html',1,'']]] + ['push_20entt_20across_20boundaries_1185',['Push EnTT across boundaries',['../md_docs_md_lib.html',1,'']]] ]; diff --git a/search/pages_4.js b/search/pages_4.js index a4808e213..422455a40 100644 --- a/search/pages_4.js +++ b/search/pages_4.js @@ -1,4 +1,4 @@ var searchData= [ - ['similar_20projects_1204',['Similar projects',['../md_docs_md_reference.html',1,'']]] + ['similar_20projects_1186',['Similar projects',['../md_docs_md_reference.html',1,'']]] ]; diff --git a/search/related_0.js b/search/related_0.js index 2a9e06643..857c23cdd 100644 --- a/search/related_0.js +++ b/search/related_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['basic_5fregistry_3c_20entity_20_3e_1182',['basic_registry< Entity >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()']]] + ['basic_5fregistry_3c_20entity_20_3e_1166',['basic_registry< Entity >',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a60c928831c22b7dd2216dbc469f68f24',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_registry< Entity >()']]] ]; diff --git a/search/related_1.js b/search/related_1.js index 53ab4187f..ec9b61ef8 100644 --- a/search/related_1.js +++ b/search/related_1.js @@ -1,4 +1,4 @@ var searchData= [ - ['emitter_1183',['emitter',['../structentt_1_1emitter_1_1connection.html#a0f3bb10ad57dc0e06298fc9ba38a7bd9',1,'entt::emitter::connection']]] + ['emitter_1167',['emitter',['../structentt_1_1emitter_1_1connection.html#a0f3bb10ad57dc0e06298fc9ba38a7bd9',1,'entt::emitter::connection']]] ]; diff --git a/search/related_2.js b/search/related_2.js index ef1189941..68231aa29 100644 --- a/search/related_2.js +++ b/search/related_2.js @@ -1,4 +1,4 @@ var searchData= [ - ['poly_5fbase_3c_20basic_5fpoly_20_3e_1184',['poly_base< basic_poly >',['../classentt_1_1basic__poly.html#a4f532417307014ab3c9eb0070beaf7fc',1,'entt::basic_poly']]] + ['poly_5fbase_3c_20basic_5fpoly_20_3e_1168',['poly_base< basic_poly >',['../classentt_1_1basic__poly.html#a4f532417307014ab3c9eb0070beaf7fc',1,'entt::basic_poly']]] ]; diff --git a/search/related_3.js b/search/related_3.js index a97d9d603..6a2046180 100644 --- a/search/related_3.js +++ b/search/related_3.js @@ -1,5 +1,4 @@ var searchData= [ - ['resource_5fcache_1185',['resource_cache',['../classentt_1_1resource__loader.html#a4112be35c9b6819c3b0d429a94f77728',1,'entt::resource_loader']]], - ['resource_5fhandle_1186',['resource_handle',['../classentt_1_1resource__handle.html#a8b6a99848ceb85976f502438792c4b2a',1,'entt::resource_handle']]] + ['resource_1169',['resource',['../classentt_1_1resource.html#a10dac526a08b422e1767d8fa1cfd8dd3',1,'entt::resource']]] ]; diff --git a/search/related_4.js b/search/related_4.js index 60f05af17..4549124e9 100644 --- a/search/related_4.js +++ b/search/related_4.js @@ -1,5 +1,5 @@ var searchData= [ - ['sink_1187',['sink',['../classentt_1_1connection.html#afe2b37ace8306e708a0dc76c658a4b19',1,'entt::connection']]], - ['sink_3c_20sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_20_3e_1188',['sink< sigh< Ret(Args...), Allocator > >',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4b39de26549c75a8c7b66e2ada43c37',1,'entt::sigh< Ret(Args...), Allocator >']]] + ['sink_1170',['sink',['../classentt_1_1connection.html#afe2b37ace8306e708a0dc76c658a4b19',1,'entt::connection']]], + ['sink_3c_20sigh_3c_20ret_28args_2e_2e_2e_29_2c_20allocator_20_3e_20_3e_1171',['sink< sigh< Ret(Args...), Allocator > >',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4b39de26549c75a8c7b66e2ada43c37',1,'entt::sigh< Ret(Args...), Allocator >']]] ]; diff --git a/search/related_5.js b/search/related_5.js deleted file mode 100644 index 0eabbcd8f..000000000 --- a/search/related_5.js +++ /dev/null @@ -1,4 +0,0 @@ -var searchData= -[ - ['type_5fid_1189',['type_id',['../classentt_1_1type__info.html#a5a705e7e31b06bb5eb2570dd505f4992',1,'entt::type_info']]] -]; diff --git a/search/searchdata.js b/search/searchdata.js index 44854f788..1ccb93931 100644 --- a/search/searchdata.js +++ b/search/searchdata.js @@ -1,14 +1,14 @@ var indexSectionsWithContent = { 0: "abcdefghiklmnoprstuvwy~", - 1: "abcdefgimnoprstvy", + 1: "abcdefgilmnoprstvy", 2: "e", 3: "abcdefghiklmnoprstuvwy~", 4: "acegilmnoprstuv", 5: "abcdefghiklmnoprstuv", 6: "de", 7: "is", - 8: "beprst", + 8: "beprs", 9: "cefps" }; diff --git a/search/typedefs_0.js b/search/typedefs_0.js index 37b05ff5c..c0291dd1e 100644 --- a/search/typedefs_0.js +++ b/search/typedefs_0.js @@ -1,6 +1,6 @@ var searchData= [ - ['allocator_5ftype_1098',['allocator_type',['../classentt_1_1dense__hash__map.html#acab6c328584c0cb66e895b6220e022f9',1,'entt::dense_hash_map::allocator_type()'],['../classentt_1_1dense__hash__set.html#ae1eff330a53ec4691ff2bc0f0e6e2ae1',1,'entt::dense_hash_set::allocator_type()'],['../classentt_1_1basic__sparse__set.html#af6faaccfb0c465afb6173b0fb8a37069',1,'entt::basic_sparse_set::allocator_type()'],['../classentt_1_1basic__storage.html#a2daf8e64dd510609d8063fe7f3c011f3',1,'entt::basic_storage::allocator_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ad8f51651fb3f99ee794787e29dbaf870',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::allocator_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a21c7a7c56b0975495827e8b4c16103ba',1,'entt::sigh< Ret(Args...), Allocator >::allocator_type()']]], - ['any_1099',['any',['../namespaceentt.html#a4846741b8f485584c196304f588b94ad',1,'entt']]], - ['args_5ftype_1100',['args_type',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a9d0bdf951c08413401de8a4cb8f00541',1,'entt::meta_template_traits< Clazz< Args... > >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a883bd3dcad5433ed005974b56e08a476',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a9ef80c632428bbd3d479149ba6687691',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a8cc7260ed6098c519937116d1a276acb',1,'entt::meta_function_descriptor< Type, Ret Class::* >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a13814c123d03280c86bd85c5eeee25ab',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a4c949efd3cbd6865f33054d0713f4f53',1,'entt::meta_function_descriptor< Type, Ret(*)()>::args_type()']]] + ['allocator_5ftype_1082',['allocator_type',['../classentt_1_1dense__map.html#adc7feba2153b3764cc7789f31b926d78',1,'entt::dense_map::allocator_type()'],['../classentt_1_1dense__set.html#a8c83fbdb7d106f60f98d3ae3f395abc2',1,'entt::dense_set::allocator_type()'],['../structentt_1_1allocation__deleter.html#abce9d9de78a31b79e98745f4e029c863',1,'entt::allocation_deleter::allocator_type()'],['../classentt_1_1basic__sparse__set.html#af6faaccfb0c465afb6173b0fb8a37069',1,'entt::basic_sparse_set::allocator_type()'],['../classentt_1_1basic__storage.html#a2daf8e64dd510609d8063fe7f3c011f3',1,'entt::basic_storage::allocator_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#ad8f51651fb3f99ee794787e29dbaf870',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::allocator_type()'],['../classentt_1_1resource__cache.html#ab1e2dc3aeffbbbce6d48e0c46d908cfd',1,'entt::resource_cache::allocator_type()'],['../classentt_1_1basic__dispatcher.html#a25129aec45c14bb934e9e9db3ed28015',1,'entt::basic_dispatcher::allocator_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a21c7a7c56b0975495827e8b4c16103ba',1,'entt::sigh< Ret(Args...), Allocator >::allocator_type()']]], + ['any_1083',['any',['../namespaceentt.html#a4846741b8f485584c196304f588b94ad',1,'entt']]], + ['args_5ftype_1084',['args_type',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a9d0bdf951c08413401de8a4cb8f00541',1,'entt::meta_template_traits< Clazz< Args... > >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a883bd3dcad5433ed005974b56e08a476',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a9ef80c632428bbd3d479149ba6687691',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a8cc7260ed6098c519937116d1a276acb',1,'entt::meta_function_descriptor< Type, Ret Class::* >::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a1f9aff3c69a1576c2230a0511e94dd56',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::args_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a4c949efd3cbd6865f33054d0713f4f53',1,'entt::meta_function_descriptor< Type, Ret(*)()>::args_type()']]] ]; diff --git a/search/typedefs_1.js b/search/typedefs_1.js index bb28874a2..bfaea7f05 100644 --- a/search/typedefs_1.js +++ b/search/typedefs_1.js @@ -1,5 +1,6 @@ var searchData= [ - ['base_5fnode_5ftype_1101',['base_node_type',['../classentt_1_1meta__type.html#af5c8ce79f2b30967048acc2f4c890ff4',1,'entt::meta_type']]], - ['base_5ftype_1102',['base_type',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a2344447157c3a7d1c82e5ac18db253a1',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2a750ebb99edab170da7f02378c44ea7',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__registry.html#a70ffa0486e23004540f1655bdf46cef6',1,'entt::basic_registry::base_type()'],['../classentt_1_1basic__storage.html#abdba347d3fa01f615d4fa28b22257f82',1,'entt::basic_storage::base_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#adc648d57a591eff7041e3891711ee1e3',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::base_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa84cd200af2da7539b2327f63b68250f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#afa44a297867b649fc67f17b0431d7ee9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::base_type()']]] + ['base_5fnode_5ftype_1085',['base_node_type',['../classentt_1_1meta__type.html#af5c8ce79f2b30967048acc2f4c890ff4',1,'entt::meta_type']]], + ['base_5ftype_1086',['base_type',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a2344447157c3a7d1c82e5ac18db253a1',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a2a750ebb99edab170da7f02378c44ea7',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__registry.html#a70ffa0486e23004540f1655bdf46cef6',1,'entt::basic_registry::base_type()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#af1abd6cb4b85b1b7ee4e5e9e2d675349',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::base_type()'],['../classentt_1_1basic__storage.html#abdba347d3fa01f615d4fa28b22257f82',1,'entt::basic_storage::base_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a94e9ea42f96a26560c82ec23c4dd03bf',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::base_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#aa84cd200af2da7539b2327f63b68250f',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::base_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#afa44a297867b649fc67f17b0431d7ee9',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::base_type()']]], + ['basic_5fiterator_1087',['basic_iterator',['../classentt_1_1basic__sparse__set.html#ac56bb654b47a648d64a754d85c70b40a',1,'entt::basic_sparse_set']]] ]; diff --git a/search/typedefs_10.js b/search/typedefs_10.js index a8c68c707..5ad148656 100644 --- a/search/typedefs_10.js +++ b/search/typedefs_10.js @@ -1,12 +1,12 @@ var searchData= [ - ['second_5ftype_1156',['second_type',['../classentt_1_1compressed__pair.html#aeadab3815d52ed579a96cde92f15eeb6',1,'entt::compressed_pair']]], - ['service_5ftype_1157',['service_type',['../structentt_1_1service__locator.html#af34a883e56f32a98d7b8a5db87bdf504',1,'entt::service_locator']]], - ['sink_5ftype_1158',['sink_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa7f2f5776361d62d9f84f2046a869628',1,'entt::sigh< Ret(Args...), Allocator >']]], - ['size_5ftype_1159',['size_type',['../classentt_1_1dense__hash__map.html#ab7a5cacd84728015914981f81c82e3a3',1,'entt::dense_hash_map::size_type()'],['../classentt_1_1dense__hash__set.html#ae229c0486758861995ed75580f1b9870',1,'entt::dense_hash_set::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac0a657b51e4a3d8bd7290a8f8b78cc24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a9636d703c95b047cbfbfe8c13e0fb5b6',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../structentt_1_1basic__handle.html#a0c6be936b2046833a789caf06e0567fe',1,'entt::basic_handle::size_type()'],['../classentt_1_1basic__observer.html#a147a0e35035fc3c19b67b31d66d2d80b',1,'entt::basic_observer::size_type()'],['../classentt_1_1basic__organizer.html#afcf528b532b3c41ab06c11d5c82a7260',1,'entt::basic_organizer::size_type()'],['../classentt_1_1basic__registry.html#a6a44260f861a699f1353097391c51636',1,'entt::basic_registry::size_type()'],['../classentt_1_1basic__runtime__view.html#aabb4450ce3d686fe05bd92e5975d11fb',1,'entt::basic_runtime_view::size_type()'],['../classentt_1_1basic__sparse__set.html#a6f41f1b0b70a30ee160cf2734bec448f',1,'entt::basic_sparse_set::size_type()'],['../classentt_1_1basic__storage.html#aa0e2c748f5a9f0a1a3fb7eb9d5fa8d83',1,'entt::basic_storage::size_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a67b50c6160f2ef1fc5ecbfaaad9c67f5',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a8a7e88587dbf957bc2d4b8b0592cee29',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a10af7cb14dfea9759c0a71fb197f74ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size_type()'],['../classentt_1_1meta__sequence__container.html#aa24e9df149bccfada6257266e5d829b1',1,'entt::meta_sequence_container::size_type()'],['../classentt_1_1meta__associative__container.html#a9ef078a3364ff3d53cec2bda15f4782f',1,'entt::meta_associative_container::size_type()'],['../structentt_1_1meta__data.html#ab322080e34d8e40621a67f2f0e0672b7',1,'entt::meta_data::size_type()'],['../structentt_1_1meta__func.html#aa35b75b107a0e02f7f03f0737980a428',1,'entt::meta_func::size_type()'],['../classentt_1_1meta__type.html#a9d7a45ed06b058813b928e2778499a5e',1,'entt::meta_type::size_type()'],['../classentt_1_1scheduler.html#afcec47d6ec28a994af2a7097348ce59f',1,'entt::scheduler::size_type()'],['../classentt_1_1resource__cache.html#aa9251f4bd388f39b18b6b416f58170e1',1,'entt::resource_cache::size_type()'],['../classentt_1_1resource__handle.html#aaa5bb317dff4e02ec3cef610705de341',1,'entt::resource_handle::size_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4da86f239ecc0eddc6c5d99350fbe91',1,'entt::sigh< Ret(Args...), Allocator >::size_type()']]], - ['snapshot_1160',['snapshot',['../namespaceentt.html#a80012f9fa628920a3507ae947704d447',1,'entt']]], - ['snapshot_5floader_1161',['snapshot_loader',['../namespaceentt.html#ae7e50fc296c4ea68183db332950b99f5',1,'entt']]], - ['sparse_5fset_1162',['sparse_set',['../namespaceentt.html#ac27c0013e504d544508cdacc01170b68',1,'entt']]], - ['storage_1163',['storage',['../namespaceentt.html#abcedb8f29753130e2bf3185bca211f05',1,'entt']]], - ['storage_5ftype_1164',['storage_type',['../structentt_1_1storage__traits.html#a7cda978d208a50c536ae96570d76bf8e',1,'entt::storage_traits']]] + ['second_5ftype_1140',['second_type',['../classentt_1_1compressed__pair.html#aeadab3815d52ed579a96cde92f15eeb6',1,'entt::compressed_pair']]], + ['sentinel_1141',['sentinel',['../structentt_1_1iterable__adaptor.html#a86150bc99361dabcbb7f574d84691e42',1,'entt::iterable_adaptor']]], + ['sink_5ftype_1142',['sink_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#aa7f2f5776361d62d9f84f2046a869628',1,'entt::sigh< Ret(Args...), Allocator >']]], + ['size_5ftype_1143',['size_type',['../classentt_1_1dense__map.html#a38ef651a1992486e3d2151e7829777f1',1,'entt::dense_map::size_type()'],['../classentt_1_1dense__set.html#a3355912feda8db49d87b75247f824ce0',1,'entt::dense_set::size_type()'],['../classentt_1_1basic__hashed__string.html#a4550e2c6eb3ec63c72d6d831182bd015',1,'entt::basic_hashed_string::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#ac0a657b51e4a3d8bd7290a8f8b78cc24',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a9636d703c95b047cbfbfe8c13e0fb5b6',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size_type()'],['../structentt_1_1basic__handle.html#a0c6be936b2046833a789caf06e0567fe',1,'entt::basic_handle::size_type()'],['../classentt_1_1basic__observer.html#a147a0e35035fc3c19b67b31d66d2d80b',1,'entt::basic_observer::size_type()'],['../classentt_1_1basic__organizer.html#afcf528b532b3c41ab06c11d5c82a7260',1,'entt::basic_organizer::size_type()'],['../classentt_1_1basic__registry.html#a6a44260f861a699f1353097391c51636',1,'entt::basic_registry::size_type()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#a6b9c1f57fef57266a406e549f444280a',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::size_type()'],['../classentt_1_1basic__sparse__set.html#a6f41f1b0b70a30ee160cf2734bec448f',1,'entt::basic_sparse_set::size_type()'],['../classentt_1_1basic__storage.html#aa0e2c748f5a9f0a1a3fb7eb9d5fa8d83',1,'entt::basic_storage::size_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a67b50c6160f2ef1fc5ecbfaaad9c67f5',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a8a7e88587dbf957bc2d4b8b0592cee29',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::size_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a10af7cb14dfea9759c0a71fb197f74ba',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::size_type()'],['../classentt_1_1meta__sequence__container.html#aa24e9df149bccfada6257266e5d829b1',1,'entt::meta_sequence_container::size_type()'],['../classentt_1_1meta__associative__container.html#a9ef078a3364ff3d53cec2bda15f4782f',1,'entt::meta_associative_container::size_type()'],['../structentt_1_1meta__data.html#ab322080e34d8e40621a67f2f0e0672b7',1,'entt::meta_data::size_type()'],['../structentt_1_1meta__func.html#aa35b75b107a0e02f7f03f0737980a428',1,'entt::meta_func::size_type()'],['../classentt_1_1meta__type.html#a9d7a45ed06b058813b928e2778499a5e',1,'entt::meta_type::size_type()'],['../classentt_1_1scheduler.html#afcec47d6ec28a994af2a7097348ce59f',1,'entt::scheduler::size_type()'],['../classentt_1_1resource__cache.html#af96dd3b16bdd0f1151b75786bdc0a2cb',1,'entt::resource_cache::size_type()'],['../classentt_1_1basic__dispatcher.html#a5be4fb80f4bb0055ffaf3b573a4681a6',1,'entt::basic_dispatcher::size_type()'],['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#ac4da86f239ecc0eddc6c5d99350fbe91',1,'entt::sigh< Ret(Args...), Allocator >::size_type()']]], + ['snapshot_1144',['snapshot',['../namespaceentt.html#a80012f9fa628920a3507ae947704d447',1,'entt']]], + ['snapshot_5floader_1145',['snapshot_loader',['../namespaceentt.html#ae7e50fc296c4ea68183db332950b99f5',1,'entt']]], + ['sparse_5fset_1146',['sparse_set',['../namespaceentt.html#ac27c0013e504d544508cdacc01170b68',1,'entt']]], + ['storage_1147',['storage',['../namespaceentt.html#abcedb8f29753130e2bf3185bca211f05',1,'entt']]], + ['storage_5ftype_1148',['storage_type',['../structentt_1_1storage__traits.html#a7cda978d208a50c536ae96570d76bf8e',1,'entt::storage_traits']]] ]; diff --git a/search/typedefs_11.js b/search/typedefs_11.js index 6b47c9198..78fc4ca40 100644 --- a/search/typedefs_11.js +++ b/search/typedefs_11.js @@ -1,10 +1,10 @@ var searchData= [ - ['tag_1165',['tag',['../namespaceentt.html#a9f7bb8c357f08a01ad9c8dab0ea40c1c',1,'entt']]], - ['type_1166',['type',['../structentt_1_1type__identity.html#ae47a6cef2041ad7d82c8ecd6b97a8524',1,'entt::type_identity::type()'],['../structentt_1_1type__list.html#ad39ae8961200964418fef5090f44cd00',1,'entt::type_list::type()'],['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a9762bf53c4d223834d7ab7b0d9d66a3e',1,'entt::type_list_element< 0u, type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__cat_3_4.html#a957e88d5bc4c1cbf4a13fbddbe2e176f',1,'entt::type_list_cat<>::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#ae17db475954ad06eba24fd1eedba5f8b',1,'entt::type_list_cat< type_list< Type... >, type_list< Other... >, List... >::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html#a0c40287fad9d80f0532d80bf48f219ed',1,'entt::type_list_cat< type_list< Type... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a378823486aa4e4f288b1d73b2703c485',1,'entt::type_list_unique< type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html#a48245981f9818ca2601b9815cbfa5b79',1,'entt::type_list_unique< type_list<> >::type()'],['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html#a32f539337660ac18fe3c3461949fb0eb',1,'entt::type_list_diff< type_list< Type... >, type_list< Other... > >::type()'],['../structentt_1_1value__list.html#ae89d3f18fec9ab261e040bb4581001af',1,'entt::value_list::type()'],['../structentt_1_1value__list__cat_3_4.html#a7c88fc51906ef0549415cbb6b82190b4',1,'entt::value_list_cat<>::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#aeb78d396ce7f928fbd9c06803a1ce327',1,'entt::value_list_cat< value_list< Value... >, value_list< Other... >, List... >::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html#ad729ba83ae022614fa97930ae427b4ad',1,'entt::value_list_cat< value_list< Value... > >::type()'],['../structentt_1_1constness__as.html#aa6f690652abf564093112ca29f55af2e',1,'entt::constness_as::type()'],['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html#ac31754183e91b36738ecd41e291c521e',1,'entt::constness_as< To, const From >::type()'],['../classentt_1_1member__class.html#aa512dd4465bfab2dc09f759ae882a08a',1,'entt::member_class::type()'],['../classentt_1_1meta__function__helper.html#a74ea1aa3fe0edfad96898520cbf6eeae',1,'entt::meta_function_helper::type()'],['../classentt_1_1poly__vtable.html#a1114a981955e596da36603282cee2e4d',1,'entt::poly_vtable::type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ada5b094a0d859325dbe1241f3d956c02',1,'entt::delegate< Ret(Args...)>::type()']]], - ['type_5fidentity_5ft_1167',['type_identity_t',['../namespaceentt.html#a09f6bd6b4aebc03df720e7e69fdc6643',1,'entt']]], - ['type_5flist_5fcat_5ft_1168',['type_list_cat_t',['../namespaceentt.html#a546467a3662e9a915d5d519ad565e801',1,'entt']]], - ['type_5flist_5fdiff_5ft_1169',['type_list_diff_t',['../namespaceentt.html#af2992fc009cb3199b0ef9a86bed2285c',1,'entt']]], - ['type_5flist_5felement_5ft_1170',['type_list_element_t',['../namespaceentt.html#ac839c1a03dba2436791d0056d6d0d1b6',1,'entt']]], - ['type_5flist_5funique_5ft_1171',['type_list_unique_t',['../namespaceentt.html#a75a277a6037279d65cd3874b46ec7166',1,'entt']]] + ['tag_1149',['tag',['../namespaceentt.html#a9f7bb8c357f08a01ad9c8dab0ea40c1c',1,'entt']]], + ['type_1150',['type',['../structentt_1_1type__identity.html#ae47a6cef2041ad7d82c8ecd6b97a8524',1,'entt::type_identity::type()'],['../structentt_1_1type__list.html#ad39ae8961200964418fef5090f44cd00',1,'entt::type_list::type()'],['../structentt_1_1type__list__element_3_010u_00_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a9762bf53c4d223834d7ab7b0d9d66a3e',1,'entt::type_list_element< 0u, type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__cat_3_4.html#a957e88d5bc4c1cbf4a13fbddbe2e176f',1,'entt::type_list_cat<>::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#ae17db475954ad06eba24fd1eedba5f8b',1,'entt::type_list_cat< type_list< Type... >, type_list< Other... >, List... >::type()'],['../structentt_1_1type__list__cat_3_01type__list_3_01Type_8_8_8_01_4_01_4.html#a0c40287fad9d80f0532d80bf48f219ed',1,'entt::type_list_cat< type_list< Type... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html#a9fbc6208d17e2bb1ab89e4fa87b9e077',1,'entt::type_list_unique< type_list< Type, Other... > >::type()'],['../structentt_1_1type__list__unique_3_01type__list_3_4_01_4.html#a48245981f9818ca2601b9815cbfa5b79',1,'entt::type_list_unique< type_list<> >::type()'],['../structentt_1_1type__list__diff_3_01type__list_3_01Type_8_8_8_01_4_00_01type__list_3_01Other_8_8_8_01_4_01_4.html#a32f539337660ac18fe3c3461949fb0eb',1,'entt::type_list_diff< type_list< Type... >, type_list< Other... > >::type()'],['../structentt_1_1value__list.html#ae89d3f18fec9ab261e040bb4581001af',1,'entt::value_list::type()'],['../structentt_1_1value__list__cat_3_4.html#a7c88fc51906ef0549415cbb6b82190b4',1,'entt::value_list_cat<>::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_00_01value__list_3_01Other_8_8_8_01_4_00_01List_8_8_8_01_4.html#aeb78d396ce7f928fbd9c06803a1ce327',1,'entt::value_list_cat< value_list< Value... >, value_list< Other... >, List... >::type()'],['../structentt_1_1value__list__cat_3_01value__list_3_01Value_8_8_8_01_4_01_4.html#ad729ba83ae022614fa97930ae427b4ad',1,'entt::value_list_cat< value_list< Value... > >::type()'],['../structentt_1_1constness__as.html#aa6f690652abf564093112ca29f55af2e',1,'entt::constness_as::type()'],['../structentt_1_1constness__as_3_01To_00_01const_01From_01_4.html#ac31754183e91b36738ecd41e291c521e',1,'entt::constness_as< To, const From >::type()'],['../classentt_1_1member__class.html#aa512dd4465bfab2dc09f759ae882a08a',1,'entt::member_class::type()'],['../structentt_1_1locator.html#aa1b4b856f4d36f39bbbecfd79cb380ee',1,'entt::locator::type()'],['../classentt_1_1meta__function__helper.html#a74ea1aa3fe0edfad96898520cbf6eeae',1,'entt::meta_function_helper::type()'],['../classentt_1_1poly__vtable.html#a1114a981955e596da36603282cee2e4d',1,'entt::poly_vtable::type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#ada5b094a0d859325dbe1241f3d956c02',1,'entt::delegate< Ret(Args...)>::type()']]], + ['type_5fidentity_5ft_1151',['type_identity_t',['../namespaceentt.html#a09f6bd6b4aebc03df720e7e69fdc6643',1,'entt']]], + ['type_5flist_5fcat_5ft_1152',['type_list_cat_t',['../namespaceentt.html#a546467a3662e9a915d5d519ad565e801',1,'entt']]], + ['type_5flist_5fdiff_5ft_1153',['type_list_diff_t',['../namespaceentt.html#af2992fc009cb3199b0ef9a86bed2285c',1,'entt']]], + ['type_5flist_5felement_5ft_1154',['type_list_element_t',['../namespaceentt.html#ac839c1a03dba2436791d0056d6d0d1b6',1,'entt']]], + ['type_5flist_5funique_5ft_1155',['type_list_unique_t',['../namespaceentt.html#a75a277a6037279d65cd3874b46ec7166',1,'entt']]] ]; diff --git a/search/typedefs_12.js b/search/typedefs_12.js index a4e1c3c5a..9eedb0940 100644 --- a/search/typedefs_12.js +++ b/search/typedefs_12.js @@ -1,4 +1,4 @@ var searchData= [ - ['unpack_5fas_5ftype_1172',['unpack_as_type',['../namespaceentt.html#ae62c84ccab78132ef356b13e4ff12dfa',1,'entt']]] + ['unpack_5fas_5ftype_1156',['unpack_as_type',['../namespaceentt.html#ae62c84ccab78132ef356b13e4ff12dfa',1,'entt']]] ]; diff --git a/search/typedefs_13.js b/search/typedefs_13.js index 79f03618f..469c5c57f 100644 --- a/search/typedefs_13.js +++ b/search/typedefs_13.js @@ -1,8 +1,8 @@ var searchData= [ - ['value_5flist_5fcat_5ft_1173',['value_list_cat_t',['../namespaceentt.html#a1344cc62598091397018354e6905e431',1,'entt']]], - ['value_5ftype_1174',['value_type',['../classentt_1_1dense__hash__map.html#a64702376e2b40cf1ed53deb0c935ec7a',1,'entt::dense_hash_map::value_type()'],['../classentt_1_1dense__hash__set.html#a0513eb464767aa43cea5a715caa79a68',1,'entt::dense_hash_set::value_type()'],['../classentt_1_1basic__hashed__string.html#ad4e8f181e92b9218747ac43fe24c4cbc',1,'entt::basic_hashed_string::value_type()'],['../structentt_1_1iterable__adaptor.html#a5f2efe4d02ffa42b11ecd1bdf8bee6b0',1,'entt::iterable_adaptor::value_type()'],['../classentt_1_1entt__traits.html#a9898ec0342dfd6bdb937981e15e5fd65',1,'entt::entt_traits::value_type()'],['../classentt_1_1basic__storage.html#afad8274fbdff981737a962b375bd0d99',1,'entt::basic_storage::value_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a383edde6d3e4f797a24e446591d1a6d6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::value_type()'],['../classentt_1_1sigh__storage__mixin.html#a0e2d25bd7c3072ffacab6fbed19e05bf',1,'entt::sigh_storage_mixin::value_type()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a452e7367da253653f8a5e3a4c9d4f155',1,'entt::meta_sequence_container::meta_iterator::value_type()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#aedcf370f9d9d6666bbdebb0cb9883069',1,'entt::meta_associative_container::meta_iterator::value_type()']]], - ['version_5ftype_1175',['version_type',['../classentt_1_1entt__traits.html#ad44954f9ad1b9a20bf997b9a8ba33c3a',1,'entt::entt_traits::version_type()'],['../structentt_1_1basic__handle.html#aa6d8a9ac22ff96212d1a68deb63cac52',1,'entt::basic_handle::version_type()'],['../classentt_1_1basic__registry.html#a7f947b73e9c883ecf89af298eaefe7c1',1,'entt::basic_registry::version_type()'],['../classentt_1_1basic__sparse__set.html#a909de63f5d8a3fdc9fb1e0b6b70636d9',1,'entt::basic_sparse_set::version_type()']]], - ['view_1176',['view',['../namespaceentt.html#a87b7ba6bd51a290113765bc97188d247',1,'entt']]], - ['vtable_5ftype_1177',['vtable_type',['../classentt_1_1basic__poly.html#abf0092d4a0a8976a742ff76a68851054',1,'entt::basic_poly']]] + ['value_5flist_5fcat_5ft_1157',['value_list_cat_t',['../namespaceentt.html#a1344cc62598091397018354e6905e431',1,'entt']]], + ['value_5ftype_1158',['value_type',['../classentt_1_1dense__map.html#aa53501af8bfd66b6bf45e8cfa844e180',1,'entt::dense_map::value_type()'],['../classentt_1_1dense__set.html#a42092d77add471a91a60b0aebd515829',1,'entt::dense_set::value_type()'],['../classentt_1_1basic__hashed__string.html#a0fa6c444b2d97cc14506cc509daef9b0',1,'entt::basic_hashed_string::value_type()'],['../structentt_1_1iterable__adaptor.html#adbde706b5ce0286d8e3fd6e71be12720',1,'entt::iterable_adaptor::value_type()'],['../classentt_1_1entt__traits.html#a9898ec0342dfd6bdb937981e15e5fd65',1,'entt::entt_traits::value_type()'],['../classentt_1_1basic__storage.html#afad8274fbdff981737a962b375bd0d99',1,'entt::basic_storage::value_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a383edde6d3e4f797a24e446591d1a6d6',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::value_type()'],['../classentt_1_1resource__cache.html#a7405d91504b5793f260a93695f6cdee4',1,'entt::resource_cache::value_type()']]], + ['version_5ftype_1159',['version_type',['../classentt_1_1entt__traits.html#ad44954f9ad1b9a20bf997b9a8ba33c3a',1,'entt::entt_traits::version_type()'],['../structentt_1_1basic__handle.html#aa6d8a9ac22ff96212d1a68deb63cac52',1,'entt::basic_handle::version_type()'],['../classentt_1_1basic__registry.html#a7f947b73e9c883ecf89af298eaefe7c1',1,'entt::basic_registry::version_type()'],['../classentt_1_1basic__sparse__set.html#a909de63f5d8a3fdc9fb1e0b6b70636d9',1,'entt::basic_sparse_set::version_type()']]], + ['view_1160',['view',['../namespaceentt.html#a87b7ba6bd51a290113765bc97188d247',1,'entt']]], + ['vtable_5ftype_1161',['vtable_type',['../classentt_1_1basic__poly.html#abf0092d4a0a8976a742ff76a68851054',1,'entt::basic_poly']]] ]; diff --git a/search/typedefs_2.js b/search/typedefs_2.js index 82df5095a..01644a92e 100644 --- a/search/typedefs_2.js +++ b/search/typedefs_2.js @@ -1,15 +1,16 @@ var searchData= [ - ['class_5ftype_1103',['class_type',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a4223977fdb0b34434781d3dccee131c0',1,'entt::meta_template_traits< Clazz< Args... > >']]], - ['concept_5ftype_1104',['concept_type',['../classentt_1_1basic__poly.html#ad3c8c25e48b14267dc3fc0de326a9660',1,'entt::basic_poly']]], - ['const_5fhandle_1105',['const_handle',['../namespaceentt.html#a54ab1aae5e5786a3ebb3b9bf1c7e82bd',1,'entt']]], - ['const_5fhandle_5fview_1106',['const_handle_view',['../namespaceentt.html#aedfeed27a790ac90eb5989da8a3ea860',1,'entt']]], - ['const_5fiterable_1107',['const_iterable',['../classentt_1_1basic__storage.html#acefab1ddb82825d8e04dfdfad804f1c0',1,'entt::basic_storage::const_iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1c73c836c2ef40a29b3caafc714ae61e',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::const_iterable()']]], - ['const_5fiterator_1108',['const_iterator',['../classentt_1_1dense__hash__map.html#a5cd46f27bdaa94dbc949dd74f266d82c',1,'entt::dense_hash_map::const_iterator()'],['../classentt_1_1dense__hash__set.html#a5038f2ff0f91666e0181e0b81252951d',1,'entt::dense_hash_set::const_iterator()'],['../structentt_1_1iterable__adaptor.html#aa6ac835d7a8d53b23951fbdba6db850d',1,'entt::iterable_adaptor::const_iterator()'],['../classentt_1_1basic__sparse__set.html#a3688979d568f2450725d69aa89571f4f',1,'entt::basic_sparse_set::const_iterator()'],['../classentt_1_1basic__storage.html#a6715c42a370278ab10aac27edf52fe03',1,'entt::basic_storage::const_iterator()'],['../structentt_1_1meta__range.html#a28dd40f858f770c7e4bb03bfcf6ade2b',1,'entt::meta_range::const_iterator()']]], - ['const_5flocal_5fiterator_1109',['const_local_iterator',['../classentt_1_1dense__hash__map.html#aca94f9e7ed377b5d9475cdee0cbfbe7b',1,'entt::dense_hash_map::const_local_iterator()'],['../classentt_1_1dense__hash__set.html#a1715c26458ecce19ee971f2dae46a0ee',1,'entt::dense_hash_set::const_local_iterator()']]], - ['const_5fpointer_1110',['const_pointer',['../classentt_1_1basic__storage.html#aa646520c35b681b87e71c8daa9ad27cd',1,'entt::basic_storage']]], - ['const_5freverse_5fiterator_1111',['const_reverse_iterator',['../classentt_1_1basic__sparse__set.html#a4d0d07e67ebda136c33fe39ea193c69e',1,'entt::basic_sparse_set::const_reverse_iterator()'],['../classentt_1_1basic__storage.html#aa37c4581b7b9fed29fb4530db6541ab8',1,'entt::basic_storage::const_reverse_iterator()']]], - ['constness_5fas_5ft_1112',['constness_as_t',['../namespaceentt.html#a7b051461867d3c5c97f77f10b662c26b',1,'entt']]], - ['continuous_5floader_1113',['continuous_loader',['../namespaceentt.html#a37b5b489846f6f2a5d143db2b4aea5d0',1,'entt']]], - ['current_5ftype_1114',['current_type',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac7c32cf26795aa4fc08d21597c68bc3d',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] + ['class_5ftype_1088',['class_type',['../structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html#a4223977fdb0b34434781d3dccee131c0',1,'entt::meta_template_traits< Clazz< Args... > >']]], + ['concept_5ftype_1089',['concept_type',['../classentt_1_1basic__poly.html#ad3c8c25e48b14267dc3fc0de326a9660',1,'entt::basic_poly']]], + ['const_5fhandle_1090',['const_handle',['../namespaceentt.html#a54ab1aae5e5786a3ebb3b9bf1c7e82bd',1,'entt']]], + ['const_5fhandle_5fview_1091',['const_handle_view',['../namespaceentt.html#aedfeed27a790ac90eb5989da8a3ea860',1,'entt']]], + ['const_5fiterable_1092',['const_iterable',['../classentt_1_1basic__storage.html#acefab1ddb82825d8e04dfdfad804f1c0',1,'entt::basic_storage::const_iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a1c73c836c2ef40a29b3caafc714ae61e',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::const_iterable()']]], + ['const_5fiterator_1093',['const_iterator',['../classentt_1_1dense__map.html#a5c236223418b9ef327397424e2df24f8',1,'entt::dense_map::const_iterator()'],['../classentt_1_1dense__set.html#a271e1e1f94361e8156c6de5a81746943',1,'entt::dense_set::const_iterator()'],['../classentt_1_1basic__sparse__set.html#a3688979d568f2450725d69aa89571f4f',1,'entt::basic_sparse_set::const_iterator()'],['../classentt_1_1basic__storage.html#a6715c42a370278ab10aac27edf52fe03',1,'entt::basic_storage::const_iterator()'],['../structentt_1_1meta__range.html#a28dd40f858f770c7e4bb03bfcf6ade2b',1,'entt::meta_range::const_iterator()'],['../classentt_1_1resource__cache.html#a8eb72ec2d185a953cba0ac2f6e87d693',1,'entt::resource_cache::const_iterator()']]], + ['const_5flocal_5fiterator_1094',['const_local_iterator',['../classentt_1_1dense__map.html#ad699469dc43bfd00d9ea86c686afb394',1,'entt::dense_map::const_local_iterator()'],['../classentt_1_1dense__set.html#a0be70471e45867b1d18aa9ee57376496',1,'entt::dense_set::const_local_iterator()']]], + ['const_5fpointer_1095',['const_pointer',['../classentt_1_1basic__storage.html#aa646520c35b681b87e71c8daa9ad27cd',1,'entt::basic_storage']]], + ['const_5freverse_5fiterator_1096',['const_reverse_iterator',['../classentt_1_1basic__sparse__set.html#a4d0d07e67ebda136c33fe39ea193c69e',1,'entt::basic_sparse_set::const_reverse_iterator()'],['../classentt_1_1basic__storage.html#aa37c4581b7b9fed29fb4530db6541ab8',1,'entt::basic_storage::const_reverse_iterator()']]], + ['constness_5fas_5ft_1097',['constness_as_t',['../namespaceentt.html#a7b051461867d3c5c97f77f10b662c26b',1,'entt']]], + ['context_1098',['context',['../classentt_1_1basic__registry.html#a16aab012e8aff625f0ae4412a1919801',1,'entt::basic_registry']]], + ['continuous_5floader_1099',['continuous_loader',['../namespaceentt.html#a37b5b489846f6f2a5d143db2b4aea5d0',1,'entt']]], + ['current_5ftype_1100',['current_type',['../structentt_1_1basic__collector_3_01matcher_3_01type__list_3_01Reject_8_8_8_01_4_00_01type__list_98a79514dcad34a82f321f0796064ffb.html#ac7c32cf26795aa4fc08d21597c68bc3d',1,'entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >']]] ]; diff --git a/search/typedefs_3.js b/search/typedefs_3.js index 83bc2f715..f2d941b9b 100644 --- a/search/typedefs_3.js +++ b/search/typedefs_3.js @@ -1,5 +1,5 @@ var searchData= [ - ['delta_5ftype_1115',['delta_type',['../classentt_1_1process.html#a625b574ea6d83e3a4933acc3d0279295',1,'entt::process']]], - ['difference_5ftype_1116',['difference_type',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ae4a39185109f86cd44d997beb3a3b3f5',1,'entt::meta_sequence_container::meta_iterator::difference_type()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a901506acc5d79943261e81b3782825ea',1,'entt::meta_associative_container::meta_iterator::difference_type()']]] + ['delta_5ftype_1101',['delta_type',['../classentt_1_1process.html#a625b574ea6d83e3a4933acc3d0279295',1,'entt::process']]], + ['dispatcher_1102',['dispatcher',['../namespaceentt.html#a3b9e500ff0298787e120786c6247ba7c',1,'entt']]] ]; diff --git a/search/typedefs_4.js b/search/typedefs_4.js index 64ecbaabb..c086b122e 100644 --- a/search/typedefs_4.js +++ b/search/typedefs_4.js @@ -1,4 +1,4 @@ var searchData= [ - ['entity_5ftype_1117',['entity_type',['../classentt_1_1entt__traits.html#a1d427b42c48fa8e384adf2e1bc858c7e',1,'entt::entt_traits::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adea05bc43d16114d95b1596eb05736e3',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a0d01c979940e44632742a6953f9ae618',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../structentt_1_1basic__handle.html#a4788afd7aa378b5ec2e44bf52f5bec14',1,'entt::basic_handle::entity_type()'],['../structentt_1_1as__view.html#ae9599a1614990478c3331fbf562f36c7',1,'entt::as_view::entity_type()'],['../structentt_1_1as__group.html#ab9e7aee21b99a979368535a5d5054137',1,'entt::as_group::entity_type()'],['../classentt_1_1basic__observer.html#af7a57f53ed7a6c835129480ff6594f7d',1,'entt::basic_observer::entity_type()'],['../classentt_1_1basic__organizer.html#a36b865f5d3802e48a0fa027c43e3a39c',1,'entt::basic_organizer::entity_type()'],['../classentt_1_1basic__registry.html#a7df39ef4ca62af9540f593dfb5550138',1,'entt::basic_registry::entity_type()'],['../classentt_1_1basic__runtime__view.html#a7ede80f53e93473099819167d42bf2f1',1,'entt::basic_runtime_view::entity_type()'],['../classentt_1_1basic__snapshot.html#aeb9724b67563bf7f74440e5a8feb711c',1,'entt::basic_snapshot::entity_type()'],['../classentt_1_1basic__snapshot__loader.html#a73d5864a57a78d528cc0bcbe36ff5039',1,'entt::basic_snapshot_loader::entity_type()'],['../classentt_1_1basic__continuous__loader.html#a90a0d33147978cb3c142408487428277',1,'entt::basic_continuous_loader::entity_type()'],['../classentt_1_1basic__sparse__set.html#a91c6508fa13b0b3e27679c3c814e6148',1,'entt::basic_sparse_set::entity_type()'],['../classentt_1_1basic__storage.html#abb0956e379c629ba413b4856baf5dc88',1,'entt::basic_storage::entity_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aad06de6f2dce8a44864026f4584176f1',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::entity_type()'],['../classentt_1_1sigh__storage__mixin.html#a031de2e34d8e3b4f99e6677e57a71fc7',1,'entt::sigh_storage_mixin::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2f18a277939bc391d972a284fdae5bef',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab39810cc33432d0ad315dae49ca0dbfe',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type()']]] + ['entity_5ftype_1103',['entity_type',['../classentt_1_1entt__traits.html#a1d427b42c48fa8e384adf2e1bc858c7e',1,'entt::entt_traits::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#adea05bc43d16114d95b1596eb05736e3',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a0d01c979940e44632742a6953f9ae618',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type()'],['../structentt_1_1basic__handle.html#a4788afd7aa378b5ec2e44bf52f5bec14',1,'entt::basic_handle::entity_type()'],['../structentt_1_1as__view.html#ae9599a1614990478c3331fbf562f36c7',1,'entt::as_view::entity_type()'],['../structentt_1_1as__group.html#ab9e7aee21b99a979368535a5d5054137',1,'entt::as_group::entity_type()'],['../classentt_1_1basic__observer.html#af7a57f53ed7a6c835129480ff6594f7d',1,'entt::basic_observer::entity_type()'],['../classentt_1_1basic__organizer.html#a36b865f5d3802e48a0fa027c43e3a39c',1,'entt::basic_organizer::entity_type()'],['../classentt_1_1basic__registry.html#a7df39ef4ca62af9540f593dfb5550138',1,'entt::basic_registry::entity_type()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#ad55512e74ab9c4b6a5aac21147b9eefe',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::entity_type()'],['../classentt_1_1sigh__storage__mixin.html#a031de2e34d8e3b4f99e6677e57a71fc7',1,'entt::sigh_storage_mixin::entity_type()'],['../classentt_1_1basic__snapshot.html#aeb9724b67563bf7f74440e5a8feb711c',1,'entt::basic_snapshot::entity_type()'],['../classentt_1_1basic__snapshot__loader.html#a73d5864a57a78d528cc0bcbe36ff5039',1,'entt::basic_snapshot_loader::entity_type()'],['../classentt_1_1basic__continuous__loader.html#a90a0d33147978cb3c142408487428277',1,'entt::basic_continuous_loader::entity_type()'],['../classentt_1_1basic__sparse__set.html#a91c6508fa13b0b3e27679c3c814e6148',1,'entt::basic_sparse_set::entity_type()'],['../classentt_1_1basic__storage.html#abb0956e379c629ba413b4856baf5dc88',1,'entt::basic_storage::entity_type()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#aad06de6f2dce8a44864026f4584176f1',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a2f18a277939bc391d972a284fdae5bef',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::entity_type()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ab39810cc33432d0ad315dae49ca0dbfe',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::entity_type()']]] ]; diff --git a/search/typedefs_5.js b/search/typedefs_5.js index 32a96fa33..b9f8ab0f1 100644 --- a/search/typedefs_5.js +++ b/search/typedefs_5.js @@ -1,6 +1,6 @@ var searchData= [ - ['family_5ftype_1118',['family_type',['../classentt_1_1family.html#ab2ede62709be8a4a63329ed2594cd181',1,'entt::family']]], - ['first_5ftype_1119',['first_type',['../classentt_1_1compressed__pair.html#a6db727eef0bb9927d0d299f6a620005a',1,'entt::compressed_pair']]], - ['function_5ftype_1120',['function_type',['../classentt_1_1basic__organizer.html#a8eb83a2af62a10e9515776b8f26b1edc',1,'entt::basic_organizer::function_type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a1a5ceebde7cebde69a1b2022f539a656',1,'entt::delegate< Ret(Args...)>::function_type()']]] + ['family_5ftype_1104',['family_type',['../classentt_1_1family.html#ab2ede62709be8a4a63329ed2594cd181',1,'entt::family']]], + ['first_5ftype_1105',['first_type',['../classentt_1_1compressed__pair.html#a6db727eef0bb9927d0d299f6a620005a',1,'entt::compressed_pair']]], + ['function_5ftype_1106',['function_type',['../classentt_1_1basic__organizer.html#a8eb83a2af62a10e9515776b8f26b1edc',1,'entt::basic_organizer::function_type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a1a5ceebde7cebde69a1b2022f539a656',1,'entt::delegate< Ret(Args...)>::function_type()']]] ]; diff --git a/search/typedefs_6.js b/search/typedefs_6.js index 99fe01972..0a6feb189 100644 --- a/search/typedefs_6.js +++ b/search/typedefs_6.js @@ -1,4 +1,4 @@ var searchData= [ - ['group_1121',['group',['../namespaceentt.html#a2628e82fa8042f75d817c58fc09c7aaf',1,'entt']]] + ['group_1107',['group',['../namespaceentt.html#a2628e82fa8042f75d817c58fc09c7aaf',1,'entt']]] ]; diff --git a/search/typedefs_7.js b/search/typedefs_7.js index eb05053b2..1f2313849 100644 --- a/search/typedefs_7.js +++ b/search/typedefs_7.js @@ -1,9 +1,9 @@ var searchData= [ - ['handle_1122',['handle',['../namespaceentt.html#a5a0027b922894421f703102c374c234c',1,'entt']]], - ['handle_5fview_1123',['handle_view',['../namespaceentt.html#aaa5809ceb50ec17713e8690c20a79490',1,'entt']]], - ['hash_5ftype_1124',['hash_type',['../classentt_1_1basic__hashed__string.html#a1631b1f6ecd56a451366eeb228a6ffb9',1,'entt::basic_hashed_string']]], - ['hashed_5fstring_1125',['hashed_string',['../namespaceentt.html#a8f9dd22ce26cd7913a294b3fd520649b',1,'entt']]], - ['hashed_5fwstring_1126',['hashed_wstring',['../namespaceentt.html#af2768719b1f5967caf5836b2656d0ed6',1,'entt']]], - ['hasher_1127',['hasher',['../classentt_1_1dense__hash__map.html#a21012b59f56628eec6cf4583d0b914f6',1,'entt::dense_hash_map::hasher()'],['../classentt_1_1dense__hash__set.html#aea3f377ae05670c06922cd3a98b1f3b9',1,'entt::dense_hash_set::hasher()']]] + ['handle_1108',['handle',['../namespaceentt.html#a5a0027b922894421f703102c374c234c',1,'entt']]], + ['handle_5fview_1109',['handle_view',['../namespaceentt.html#aaa5809ceb50ec17713e8690c20a79490',1,'entt']]], + ['hash_5ftype_1110',['hash_type',['../classentt_1_1basic__hashed__string.html#a7b625799426407d8083f7d418e2c6a9e',1,'entt::basic_hashed_string']]], + ['hashed_5fstring_1111',['hashed_string',['../namespaceentt.html#a8f9dd22ce26cd7913a294b3fd520649b',1,'entt']]], + ['hashed_5fwstring_1112',['hashed_wstring',['../namespaceentt.html#af2768719b1f5967caf5836b2656d0ed6',1,'entt']]], + ['hasher_1113',['hasher',['../classentt_1_1dense__map.html#ae62722d472417185388e952655b120e9',1,'entt::dense_map::hasher()'],['../classentt_1_1dense__set.html#a2fb78f57d6f35f6235468e4aadb2fe0e',1,'entt::dense_set::hasher()']]] ]; diff --git a/search/typedefs_8.js b/search/typedefs_8.js index 51d4d459b..99412aaef 100644 --- a/search/typedefs_8.js +++ b/search/typedefs_8.js @@ -1,11 +1,10 @@ var searchData= [ - ['id_5ftype_1128',['id_type',['../namespaceentt.html#a13e040e7b38a8f86d1ab2f096f37b627',1,'entt']]], - ['identifier_5ftype_1129',['identifier_type',['../classentt_1_1identifier.html#a5ed0559dce16ea40707502274dba382b',1,'entt::identifier']]], - ['instance_5ftype_1130',['instance_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a9c23ea85323b3053fbe9fc377e78c303',1,'entt::sigh< Ret(Args...), Allocator >']]], - ['integral_5fconstant_1131',['integral_constant',['../namespaceentt.html#a0d9fd5898acf13553bbcf14b99159f4d',1,'entt']]], - ['is_5ftransparent_1132',['is_transparent',['../structentt_1_1identity.html#a4781035b1edd550804a131d80852e258',1,'entt::identity']]], - ['iterable_1133',['iterable',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a8a13798063fd9e34727b7de27dd2937c',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a40a1870044ed0d131c7007744f9fb726',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__storage.html#afe8de841a13f390e1d55cb4cd508e1c4',1,'entt::basic_storage::iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a371bf4723147609e9ba3a3ec5525f052',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::iterable()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#affda5e25fae74678a98ed29b7f4652c1',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a9517bc8413354e5bd9972978ad79a4c2',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterable()']]], - ['iterator_1134',['iterator',['../classentt_1_1dense__hash__map.html#a8441cd459283e4345021b93a0de0f6ff',1,'entt::dense_hash_map::iterator()'],['../classentt_1_1dense__hash__set.html#a92770d7ee1512c5f230f670a76616821',1,'entt::dense_hash_set::iterator()'],['../structentt_1_1iterable__adaptor.html#a7d3d37eb178ab61415cec31e23012478',1,'entt::iterable_adaptor::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a9be93489b31459555199bdc70caa7ff6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5e02cbec8d7d0661fbd987f1f8be65e8',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__observer.html#a3b57e5efae80301542b1b4011debb680',1,'entt::basic_observer::iterator()'],['../classentt_1_1basic__runtime__view.html#a0af3c7cc57aadc3166b8e53627ba1039',1,'entt::basic_runtime_view::iterator()'],['../classentt_1_1basic__sparse__set.html#a79c9252bb1121ae98e12c3308c150726',1,'entt::basic_sparse_set::iterator()'],['../classentt_1_1basic__storage.html#a61680bb8085862ffbd988b3cf1d04b98',1,'entt::basic_storage::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a79f3c8f7fa7c2dc89510b914594d77ea',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a7fd1da2f8aac98d0e560fe08e6a49def',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterator()'],['../classentt_1_1meta__sequence__container.html#a878e2f710e88a6ae42449cb7a93c3928',1,'entt::meta_sequence_container::iterator()'],['../classentt_1_1meta__associative__container.html#aafbaf281035562432a4e8e55443e9584',1,'entt::meta_associative_container::iterator()'],['../structentt_1_1meta__range.html#ae7ab3712220f7a5ab04b14ecdccf8abd',1,'entt::meta_range::iterator()']]], - ['iterator_5fcategory_1135',['iterator_category',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#aade7df8f3ede442e7c811828e93bbd3c',1,'entt::meta_sequence_container::meta_iterator::iterator_category()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a8243592766417eadc3118ce9d251350e',1,'entt::meta_associative_container::meta_iterator::iterator_category()']]] + ['id_5ftype_1114',['id_type',['../namespaceentt.html#a13e040e7b38a8f86d1ab2f096f37b627',1,'entt']]], + ['identifier_5ftype_1115',['identifier_type',['../classentt_1_1identifier.html#a5ed0559dce16ea40707502274dba382b',1,'entt::identifier']]], + ['instance_5ftype_1116',['instance_type',['../classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html#a9c23ea85323b3053fbe9fc377e78c303',1,'entt::sigh< Ret(Args...), Allocator >']]], + ['integral_5fconstant_1117',['integral_constant',['../namespaceentt.html#a0d9fd5898acf13553bbcf14b99159f4d',1,'entt']]], + ['is_5ftransparent_1118',['is_transparent',['../structentt_1_1identity.html#a4781035b1edd550804a131d80852e258',1,'entt::identity']]], + ['iterable_1119',['iterable',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a8a13798063fd9e34727b7de27dd2937c',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a130f5183c9eb278711f3d8a00228bdfa',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__storage.html#afe8de841a13f390e1d55cb4cd508e1c4',1,'entt::basic_storage::iterable()'],['../classentt_1_1basic__storage_3_01Entity_00_01Type_00_01Allocator_00_01std_1_1enable__if__t_3_01igb49d3f82639348392c5a5f0f427d22ad.html#a371bf4723147609e9ba3a3ec5525f052',1,'entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >::iterable()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#affda5e25fae74678a98ed29b7f4652c1',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterable()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a9517bc8413354e5bd9972978ad79a4c2',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterable()']]], + ['iterator_1120',['iterator',['../classentt_1_1dense__map.html#acc07b299f15a57db885089cc1a31322d',1,'entt::dense_map::iterator()'],['../classentt_1_1dense__set.html#a44f127ff9c4a0fa1c8284f7d072bd5c3',1,'entt::dense_set::iterator()'],['../structentt_1_1iterable__adaptor.html#a5f7920bf5cba9b4aa765affe21490a2d',1,'entt::iterable_adaptor::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#a9be93489b31459555199bdc70caa7ff6',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a5e02cbec8d7d0661fbd987f1f8be65e8',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__observer.html#a3b57e5efae80301542b1b4011debb680',1,'entt::basic_observer::iterator()'],['../structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html#afe87f720128165503248ddf319647a0f',1,'entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::iterator()'],['../classentt_1_1basic__sparse__set.html#a6cea231ae7386a12487164d918f632b0',1,'entt::basic_sparse_set::iterator()'],['../classentt_1_1basic__storage.html#a61680bb8085862ffbd988b3cf1d04b98',1,'entt::basic_storage::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_8_8_8_01_4_00_01exclude__t_3_01Exclude_8_8_8_01_4_01_4.html#a79f3c8f7fa7c2dc89510b914594d77ea',1,'entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >::iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#a7fd1da2f8aac98d0e560fe08e6a49def',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::iterator()'],['../classentt_1_1meta__sequence__container.html#a878e2f710e88a6ae42449cb7a93c3928',1,'entt::meta_sequence_container::iterator()'],['../classentt_1_1meta__associative__container.html#aafbaf281035562432a4e8e55443e9584',1,'entt::meta_associative_container::iterator()'],['../structentt_1_1meta__range.html#ae7ab3712220f7a5ab04b14ecdccf8abd',1,'entt::meta_range::iterator()'],['../classentt_1_1resource__cache.html#aad6a23cc2ea4a9367ebdb9b186308353',1,'entt::resource_cache::iterator()']]] ]; diff --git a/search/typedefs_9.js b/search/typedefs_9.js index 7efbee313..a1fb36ec0 100644 --- a/search/typedefs_9.js +++ b/search/typedefs_9.js @@ -1,5 +1,5 @@ var searchData= [ - ['key_5fequal_1136',['key_equal',['../classentt_1_1dense__hash__map.html#abe69eea318126c0e1a5ff94e284a3d96',1,'entt::dense_hash_map::key_equal()'],['../classentt_1_1dense__hash__set.html#a5aa2bcb03496ef89983dec8ab4d98319',1,'entt::dense_hash_set::key_equal()']]], - ['key_5ftype_1137',['key_type',['../classentt_1_1dense__hash__map.html#ac7eb7342bc6b0af30716056870463390',1,'entt::dense_hash_map::key_type()'],['../classentt_1_1dense__hash__set.html#a6618e17373f49ffdd2a54c1ed0712a1f',1,'entt::dense_hash_set::key_type()']]] + ['key_5fequal_1121',['key_equal',['../classentt_1_1dense__map.html#a41a26ee3be60abf7b5ecf16c99948086',1,'entt::dense_map::key_equal()'],['../classentt_1_1dense__set.html#a266d306cce7016dba8fdbf3790a0cb39',1,'entt::dense_set::key_equal()']]], + ['key_5ftype_1122',['key_type',['../classentt_1_1dense__map.html#aeb9e305df1fc9e886d6c761324dc15ab',1,'entt::dense_map::key_type()'],['../classentt_1_1dense__set.html#a404f1b7ec2ba2fe41d72f4deacf3ed3f',1,'entt::dense_set::key_type()']]] ]; diff --git a/search/typedefs_a.js b/search/typedefs_a.js index 0b5c28c3f..8e080c0f2 100644 --- a/search/typedefs_a.js +++ b/search/typedefs_a.js @@ -1,5 +1,6 @@ var searchData= [ - ['listener_1138',['listener',['../classentt_1_1emitter.html#a1200216d9abb1adb18db6035d99b60da',1,'entt::emitter']]], - ['local_5fiterator_1139',['local_iterator',['../classentt_1_1dense__hash__map.html#ad453a64541b6cc8427b4757cce425e75',1,'entt::dense_hash_map::local_iterator()'],['../classentt_1_1dense__hash__set.html#a6e82513508be1f87570db8984061d73d',1,'entt::dense_hash_set::local_iterator()']]] + ['listener_1123',['listener',['../classentt_1_1emitter.html#a1200216d9abb1adb18db6035d99b60da',1,'entt::emitter']]], + ['loader_5ftype_1124',['loader_type',['../classentt_1_1resource__cache.html#a834f161302d84ba1303358ce22f6e982',1,'entt::resource_cache']]], + ['local_5fiterator_1125',['local_iterator',['../classentt_1_1dense__map.html#ad05e437f37f277cbe5c6121e67a4e89a',1,'entt::dense_map::local_iterator()'],['../classentt_1_1dense__set.html#a83489efab7359c9c31d910844d96faa5',1,'entt::dense_set::local_iterator()']]] ]; diff --git a/search/typedefs_b.js b/search/typedefs_b.js index 11f3cc4b0..202da05b9 100644 --- a/search/typedefs_b.js +++ b/search/typedefs_b.js @@ -1,6 +1,6 @@ var searchData= [ - ['mapped_5ftype_1140',['mapped_type',['../classentt_1_1dense__hash__map.html#af3e58ee3f55ff7b7e76ac8cdc8a64ca9',1,'entt::dense_hash_map']]], - ['member_5fclass_5ft_1141',['member_class_t',['../namespaceentt.html#a49f19d031690e5ebfffd6c7a4f6bd364',1,'entt']]], - ['meta_5ffunction_5fhelper_5ft_1142',['meta_function_helper_t',['../namespaceentt.html#a692beabf853ee0f9dc68beab816a6b27',1,'entt']]] + ['mapped_5ftype_1126',['mapped_type',['../classentt_1_1dense__map.html#a7cdfe85f102518543b7a684c9e8e3bd3',1,'entt::dense_map']]], + ['member_5fclass_5ft_1127',['member_class_t',['../namespaceentt.html#a49f19d031690e5ebfffd6c7a4f6bd364',1,'entt']]], + ['meta_5ffunction_5fhelper_5ft_1128',['meta_function_helper_t',['../namespaceentt.html#a692beabf853ee0f9dc68beab816a6b27',1,'entt']]] ]; diff --git a/search/typedefs_c.js b/search/typedefs_c.js index d50f3e48e..5c9724939 100644 --- a/search/typedefs_c.js +++ b/search/typedefs_c.js @@ -1,4 +1,4 @@ var searchData= [ - ['node_5ftype_1143',['node_type',['../structentt_1_1meta__prop.html#a9da5b4916bdadd45ff0e0d90b245226c',1,'entt::meta_prop::node_type()'],['../structentt_1_1meta__data.html#a0aa23c3d404c35751aa6b85870eafc21',1,'entt::meta_data::node_type()'],['../structentt_1_1meta__func.html#ac3c77ffeae29f5d511a5961cc25617c0',1,'entt::meta_func::node_type()'],['../classentt_1_1meta__type.html#a2dc19d640208c4f887a1abb5d4fe7f61',1,'entt::meta_type::node_type()'],['../structentt_1_1meta__range.html#a432a47eca3a3f2615a989f74d45b08d8',1,'entt::meta_range::node_type()']]] + ['node_5ftype_1129',['node_type',['../structentt_1_1meta__prop.html#a9da5b4916bdadd45ff0e0d90b245226c',1,'entt::meta_prop::node_type()'],['../structentt_1_1meta__data.html#a0aa23c3d404c35751aa6b85870eafc21',1,'entt::meta_data::node_type()'],['../structentt_1_1meta__func.html#ac3c77ffeae29f5d511a5961cc25617c0',1,'entt::meta_func::node_type()'],['../classentt_1_1meta__type.html#a2dc19d640208c4f887a1abb5d4fe7f61',1,'entt::meta_type::node_type()'],['../structentt_1_1meta__range.html#a432a47eca3a3f2615a989f74d45b08d8',1,'entt::meta_range::node_type()']]] ]; diff --git a/search/typedefs_d.js b/search/typedefs_d.js index 7c1ff4501..a495f5fd8 100644 --- a/search/typedefs_d.js +++ b/search/typedefs_d.js @@ -1,5 +1,5 @@ var searchData= [ - ['observer_1144',['observer',['../namespaceentt.html#a48dfbb2991c5a19c6e2578830f7e3eda',1,'entt']]], - ['organizer_1145',['organizer',['../namespaceentt.html#a5870a148e25a503557bdd47327c7a05a',1,'entt']]] + ['observer_1130',['observer',['../namespaceentt.html#a48dfbb2991c5a19c6e2578830f7e3eda',1,'entt']]], + ['organizer_1131',['organizer',['../namespaceentt.html#a5870a148e25a503557bdd47327c7a05a',1,'entt']]] ]; diff --git a/search/typedefs_e.js b/search/typedefs_e.js index 593b5c6d2..d6c29120c 100644 --- a/search/typedefs_e.js +++ b/search/typedefs_e.js @@ -1,5 +1,5 @@ var searchData= [ - ['pointer_1146',['pointer',['../structentt_1_1input__iterator__pointer.html#ad1529bc3215ecfc42d7bd908306527fb',1,'entt::input_iterator_pointer::pointer()'],['../classentt_1_1basic__sparse__set.html#a8b18963e68d4f003e19389fd342f90cc',1,'entt::basic_sparse_set::pointer()'],['../classentt_1_1basic__storage.html#a8bca364f11af0d3d2d44105b2391fe7a',1,'entt::basic_storage::pointer()'],['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#ab36fb6642c45d6d7a2112e486fc6bc88',1,'entt::meta_sequence_container::meta_iterator::pointer()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a7c58c38ae75a68a1665aac08efdbe071',1,'entt::meta_associative_container::meta_iterator::pointer()']]], - ['poly_1147',['poly',['../namespaceentt.html#aad3d1f1d0e83ad8f124155c9e511c2cd',1,'entt']]] + ['pointer_1132',['pointer',['../structentt_1_1input__iterator__pointer.html#ad1541f6a78eb2f792fc03d9a6bfefbab',1,'entt::input_iterator_pointer::pointer()'],['../structentt_1_1allocation__deleter.html#a37186f63eb16409b00b0261041b68c5c',1,'entt::allocation_deleter::pointer()'],['../classentt_1_1basic__sparse__set.html#a8b18963e68d4f003e19389fd342f90cc',1,'entt::basic_sparse_set::pointer()'],['../classentt_1_1basic__storage.html#a8bca364f11af0d3d2d44105b2391fe7a',1,'entt::basic_storage::pointer()']]], + ['poly_1133',['poly',['../namespaceentt.html#a53c6f86f6643c525f654540c3d4c6819',1,'entt']]] ]; diff --git a/search/typedefs_f.js b/search/typedefs_f.js index 3e355f9dc..10841e6ac 100644 --- a/search/typedefs_f.js +++ b/search/typedefs_f.js @@ -1,11 +1,9 @@ var searchData= [ - ['reference_1148',['reference',['../classentt_1_1meta__sequence__container_1_1meta__iterator.html#a57962b1345c3905a11a88cf259aaa288',1,'entt::meta_sequence_container::meta_iterator::reference()'],['../classentt_1_1meta__associative__container_1_1meta__iterator.html#a48908a48014b9b889a0f610b469d03ef',1,'entt::meta_associative_container::meta_iterator::reference()']]], - ['registry_1149',['registry',['../namespaceentt.html#a292643317d1dbb13e45824f757bd1086',1,'entt']]], - ['registry_5ftype_1150',['registry_type',['../structentt_1_1basic__handle.html#ae5df0bde40739b99085169d1955dc1fb',1,'entt::basic_handle::registry_type()'],['../structentt_1_1as__view.html#acf6e812f1ff9a8a0a0af828b6597dace',1,'entt::as_view::registry_type()'],['../structentt_1_1as__group.html#a6aa30140ac29c50156197aad66b54ccb',1,'entt::as_group::registry_type()']]], - ['resource_5ftype_1151',['resource_type',['../classentt_1_1resource__cache.html#a3c660fb622942292cf7242e5361f80b7',1,'entt::resource_cache::resource_type()'],['../classentt_1_1resource__handle.html#a8fed7493bab627b5378f1e027e7c845b',1,'entt::resource_handle::resource_type()']]], - ['result_5ftype_1152',['result_type',['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a9bca9876e6671a34c6503b7de65402b6',1,'entt::delegate< Ret(Args...)>']]], - ['return_5ftype_1153',['return_type',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#aae0a4b941e6c2a4ee5239d5110c88e39',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a63465b01fc295a119b70095722c0e677',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#aa4fd5493c0249390c63edba5fd70f189',1,'entt::meta_function_descriptor< Type, Ret Class::* >::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a1b3e630352b1d4518f9c9686d722a9ce',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a10117f6bac8c1b6f3ba673a03ff476ff',1,'entt::meta_function_descriptor< Type, Ret(*)()>::return_type()']]], - ['reverse_5fiterator_1154',['reverse_iterator',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aec8cef39d3a53563f3d21af3ce360c59',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8abbb4c03d956b89c2c73ded7f07f206',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__sparse__set.html#afe62c143e816cf5e12078a607966c003',1,'entt::basic_sparse_set::reverse_iterator()'],['../classentt_1_1basic__storage.html#a2947b5cf419bfd039cf5fca0c56cbb74',1,'entt::basic_storage::reverse_iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ada7749a76ed2d4a96bd03ddf3c7b6d7e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::reverse_iterator()']]], - ['runtime_5fview_1155',['runtime_view',['../namespaceentt.html#a85d470a55d982d87388e899c322e9ddc',1,'entt']]] + ['registry_1134',['registry',['../namespaceentt.html#a292643317d1dbb13e45824f757bd1086',1,'entt']]], + ['registry_5ftype_1135',['registry_type',['../structentt_1_1basic__handle.html#ae5df0bde40739b99085169d1955dc1fb',1,'entt::basic_handle::registry_type()'],['../structentt_1_1as__view.html#acf6e812f1ff9a8a0a0af828b6597dace',1,'entt::as_view::registry_type()'],['../structentt_1_1as__group.html#a6aa30140ac29c50156197aad66b54ccb',1,'entt::as_group::registry_type()']]], + ['result_5ftype_1136',['result_type',['../structentt_1_1resource__loader.html#add7a5c71b563bbc139c0983837764dc1',1,'entt::resource_loader::result_type()'],['../classentt_1_1delegate_3_01Ret_07Args_8_8_8_08_4.html#a9bca9876e6671a34c6503b7de65402b6',1,'entt::delegate< Ret(Args...)>::result_type()']]], + ['return_5ftype_1137',['return_type',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#aae0a4b941e6c2a4ee5239d5110c88e39',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a63465b01fc295a119b70095722c0e677',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#aa4fd5493c0249390c63edba5fd70f189',1,'entt::meta_function_descriptor< Type, Ret Class::* >::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a1b3e630352b1d4518f9c9686d722a9ce',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::return_type()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a10117f6bac8c1b6f3ba673a03ff476ff',1,'entt::meta_function_descriptor< Type, Ret(*)()>::return_type()']]], + ['reverse_5fiterator_1138',['reverse_iterator',['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_4_00_01get__t_3_01Get_8_8_8_01_4_00_01exclu1dcd462b241f859eda99da588b99288a.html#aec8cef39d3a53563f3d21af3ce360c59',1,'entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__group_3_01Entity_00_01owned__t_3_01Owned_8_8_8_01_4_00_01get__t_3_01Get_8_8_7e553a767a43a044ebe212daf245cf6c.html#a8abbb4c03d956b89c2c73ded7f07f206',1,'entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator()'],['../classentt_1_1basic__sparse__set.html#afe62c143e816cf5e12078a607966c003',1,'entt::basic_sparse_set::reverse_iterator()'],['../classentt_1_1basic__storage.html#a2947b5cf419bfd039cf5fca0c56cbb74',1,'entt::basic_storage::reverse_iterator()'],['../classentt_1_1basic__view_3_01Entity_00_01get__t_3_01Component_01_4_00_01exclude__t_3_4_00_01std_bf8e2b91f3656eee29ec275c7d65682d.html#ada7749a76ed2d4a96bd03ddf3c7b6d7e',1,'entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >::reverse_iterator()']]], + ['runtime_5fview_1139',['runtime_view',['../namespaceentt.html#a4d1433f3effac40f4a6d1b92b89f68e9',1,'entt']]] ]; diff --git a/search/variables_0.js b/search/variables_0.js index 6d7d27022..2ea61b364 100644 --- a/search/variables_0.js +++ b/search/variables_0.js @@ -1,4 +1,4 @@ var searchData= [ - ['alignment_1063',['alignment',['../classentt_1_1basic__any.html#a8248e8443c6208077db312079a05fd96',1,'entt::basic_any']]] + ['alignment_1049',['alignment',['../classentt_1_1basic__any.html#a8248e8443c6208077db312079a05fd96',1,'entt::basic_any']]] ]; diff --git a/search/variables_1.js b/search/variables_1.js index 3c8a7dc89..90ea1b1b9 100644 --- a/search/variables_1.js +++ b/search/variables_1.js @@ -1,6 +1,6 @@ var searchData= [ - ['choice_1064',['choice',['../namespaceentt.html#a089f75043b082abca3ea144bce44e9ae',1,'entt']]], - ['collector_1065',['collector',['../namespaceentt.html#aea8b073b774362fe800d9cce3542927a',1,'entt']]], - ['connect_5farg_1066',['connect_arg',['../namespaceentt.html#af1e73acd6f3d892955819677dc2664b7',1,'entt']]] + ['choice_1050',['choice',['../namespaceentt.html#a089f75043b082abca3ea144bce44e9ae',1,'entt']]], + ['collector_1051',['collector',['../namespaceentt.html#aea8b073b774362fe800d9cce3542927a',1,'entt']]], + ['connect_5farg_1052',['connect_arg',['../namespaceentt.html#af1e73acd6f3d892955819677dc2664b7',1,'entt']]] ]; diff --git a/search/variables_2.js b/search/variables_2.js index 6b6359d3e..c24d05e92 100644 --- a/search/variables_2.js +++ b/search/variables_2.js @@ -1,5 +1,5 @@ var searchData= [ - ['enum_5fas_5fbitmask_5fv_1067',['enum_as_bitmask_v',['../namespaceentt.html#a8378b9330b5c90b6b11deee3637ebca6',1,'entt']]], - ['exclude_1068',['exclude',['../namespaceentt.html#a5b73210cef43c4db35ef8ce477cc38a6',1,'entt']]] + ['enum_5fas_5fbitmask_5fv_1053',['enum_as_bitmask_v',['../namespaceentt.html#a8378b9330b5c90b6b11deee3637ebca6',1,'entt']]], + ['exclude_1054',['exclude',['../namespaceentt.html#a5b73210cef43c4db35ef8ce477cc38a6',1,'entt']]] ]; diff --git a/search/variables_3.js b/search/variables_3.js index 630464502..a409d7716 100644 --- a/search/variables_3.js +++ b/search/variables_3.js @@ -1,4 +1,4 @@ var searchData= [ - ['get_1069',['get',['../namespaceentt.html#a8c24ecc5ab0055f9f2a4725c95afb29e',1,'entt']]] + ['get_1055',['get',['../namespaceentt.html#a8c24ecc5ab0055f9f2a4725c95afb29e',1,'entt']]] ]; diff --git a/search/variables_4.js b/search/variables_4.js index cc692f1a1..38518a153 100644 --- a/search/variables_4.js +++ b/search/variables_4.js @@ -1,17 +1,15 @@ var searchData= [ - ['ignore_5fas_5fempty_5fv_1070',['ignore_as_empty_v',['../namespaceentt.html#ab9f9b531ebde614244a0da111d4b66ff',1,'entt']]], - ['ignore_5fif_5fempty_1071',['ignore_if_empty',['../structentt_1_1basic__component__traits.html#a2e58d8aa7b15b837cbfb0963cc0c3d46',1,'entt::basic_component_traits']]], - ['in_5fplace_5fdelete_1072',['in_place_delete',['../structentt_1_1basic__component__traits.html#a4ca4508bcd9833ab7c3354704144c90b',1,'entt::basic_component_traits']]], - ['is_5fapplicable_5fr_5fv_1073',['is_applicable_r_v',['../namespaceentt.html#ae764716fab8c01b12d3e209004b62647',1,'entt']]], - ['is_5fapplicable_5fv_1074',['is_applicable_v',['../namespaceentt.html#a4f238620469de3ef2bafdb28fe4657ef',1,'entt']]], - ['is_5fcomplete_5fv_1075',['is_complete_v',['../namespaceentt.html#a8a96fcc4bc8da9a2aa1cdb0bc15b75c8',1,'entt']]], - ['is_5fconst_1076',['is_const',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a8227699d91d302cbe93fa8f36434aacd',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a19154b177e459db7b337ef47e3ddd43c',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#ab7c56f9d9f9297a6d8941e38417a4047',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a0b5490df3a06e36ae87f2757449bf297',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a301bb7ebf5340b15920e021b2e69a3bb',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_const()']]], - ['is_5febco_5feligible_5fv_1077',['is_ebco_eligible_v',['../namespaceentt.html#afb5b1446d23f1cba20563114f5da1f9d',1,'entt']]], - ['is_5fequality_5fcomparable_5fv_1078',['is_equality_comparable_v',['../namespaceentt.html#a068dd98a70c771935d2bf3dd96dbad6d',1,'entt']]], - ['is_5fiterator_5ftype_5fv_1079',['is_iterator_type_v',['../namespaceentt.html#ac4081aa5332fcb3367063eeba93918b8',1,'entt']]], - ['is_5fiterator_5fv_1080',['is_iterator_v',['../namespaceentt.html#a3ac133ddb24ec535a11baf3143d188d6',1,'entt']]], - ['is_5fmeta_5fpointer_5flike_5fv_1081',['is_meta_pointer_like_v',['../namespaceentt.html#aaa8c390cfe71301a0c10f4844e98424c',1,'entt']]], - ['is_5fstatic_1082',['is_static',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#ad677df460bd44063d268f841e37efe9f',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a0f3d42096f81fb16c1f7f4f62f540ad1',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a5fc6893ccbbd9cafd726c361efe6ad59',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#ad6eb8df95c6c2763db264ae94a844098',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a5c674d0c648557b14c0e7d81e6414417',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_static()']]], - ['is_5ftransparent_5fv_1083',['is_transparent_v',['../namespaceentt.html#a5fd3998d86cc531f800d0104478771f4',1,'entt']]] + ['ignore_5fas_5fempty_5fv_1056',['ignore_as_empty_v',['../namespaceentt.html#ab9f9b531ebde614244a0da111d4b66ff',1,'entt']]], + ['in_5fplace_5fdelete_1057',['in_place_delete',['../structentt_1_1component__traits.html#ac3efe50eb183fe2a31b642ade474017f',1,'entt::component_traits']]], + ['is_5fapplicable_5fr_5fv_1058',['is_applicable_r_v',['../namespaceentt.html#ae764716fab8c01b12d3e209004b62647',1,'entt']]], + ['is_5fapplicable_5fv_1059',['is_applicable_v',['../namespaceentt.html#a4f238620469de3ef2bafdb28fe4657ef',1,'entt']]], + ['is_5fcomplete_5fv_1060',['is_complete_v',['../namespaceentt.html#a8a96fcc4bc8da9a2aa1cdb0bc15b75c8',1,'entt']]], + ['is_5fconst_1061',['is_const',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#a8227699d91d302cbe93fa8f36434aacd',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a19154b177e459db7b337ef47e3ddd43c',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#ab7c56f9d9f9297a6d8941e38417a4047',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#a0b5490df3a06e36ae87f2757449bf297',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_const()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a301bb7ebf5340b15920e021b2e69a3bb',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_const()']]], + ['is_5febco_5feligible_5fv_1062',['is_ebco_eligible_v',['../namespaceentt.html#afb5b1446d23f1cba20563114f5da1f9d',1,'entt']]], + ['is_5fequality_5fcomparable_5fv_1063',['is_equality_comparable_v',['../namespaceentt.html#a068dd98a70c771935d2bf3dd96dbad6d',1,'entt']]], + ['is_5fiterator_5fv_1064',['is_iterator_v',['../namespaceentt.html#a3ac133ddb24ec535a11baf3143d188d6',1,'entt']]], + ['is_5fmeta_5fpointer_5flike_5fv_1065',['is_meta_pointer_like_v',['../namespaceentt.html#aaa8c390cfe71301a0c10f4844e98424c',1,'entt']]], + ['is_5fstatic_1066',['is_static',['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html#ad677df460bd44063d268f841e37efe9f',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html#a0f3d42096f81fb16c1f7f4f62f540ad1',1,'entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html#a5fc6893ccbbd9cafd726c361efe6ad59',1,'entt::meta_function_descriptor< Type, Ret Class::* >::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html#ad6eb8df95c6c2763db264ae94a844098',1,'entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::is_static()'],['../structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html#a5c674d0c648557b14c0e7d81e6414417',1,'entt::meta_function_descriptor< Type, Ret(*)()>::is_static()']]], + ['is_5ftransparent_5fv_1067',['is_transparent_v',['../namespaceentt.html#a5fd3998d86cc531f800d0104478771f4',1,'entt']]] ]; diff --git a/search/variables_5.js b/search/variables_5.js index 4a0e5aef7..25bf89e37 100644 --- a/search/variables_5.js +++ b/search/variables_5.js @@ -1,4 +1,4 @@ var searchData= [ - ['length_1084',['length',['../classentt_1_1basic__any.html#a5fbc1fb99c934c59524af552ae2a33c3',1,'entt::basic_any']]] + ['length_1068',['length',['../classentt_1_1basic__any.html#a5fbc1fb99c934c59524af552ae2a33c3',1,'entt::basic_any']]] ]; diff --git a/search/variables_6.js b/search/variables_6.js index d24c3796a..0698bad6b 100644 --- a/search/variables_6.js +++ b/search/variables_6.js @@ -1,4 +1,4 @@ var searchData= [ - ['monostate_5fv_1085',['monostate_v',['../namespaceentt.html#ab43a13f7ee60bcb0d04a001f92b86fa2',1,'entt']]] + ['monostate_5fv_1069',['monostate_v',['../namespaceentt.html#ab43a13f7ee60bcb0d04a001f92b86fa2',1,'entt']]] ]; diff --git a/search/variables_7.js b/search/variables_7.js index d236d6748..e9d562b76 100644 --- a/search/variables_7.js +++ b/search/variables_7.js @@ -1,4 +1,4 @@ var searchData= [ - ['null_1086',['null',['../namespaceentt.html#a2f0c0a1c1d953ea991591748744cdd8b',1,'entt']]] + ['null_1070',['null',['../namespaceentt.html#a2f0c0a1c1d953ea991591748744cdd8b',1,'entt']]] ]; diff --git a/search/variables_8.js b/search/variables_8.js index 3d9a72f3e..ebae40490 100644 --- a/search/variables_8.js +++ b/search/variables_8.js @@ -1,4 +1,4 @@ var searchData= [ - ['owned_1087',['owned',['../namespaceentt.html#ac91ddbe2446a912714a5fe7251e25768',1,'entt']]] + ['owned_1071',['owned',['../namespaceentt.html#ac91ddbe2446a912714a5fe7251e25768',1,'entt']]] ]; diff --git a/search/variables_9.js b/search/variables_9.js index 525715782..5963547a9 100644 --- a/search/variables_9.js +++ b/search/variables_9.js @@ -1,4 +1,4 @@ var searchData= [ - ['page_5fsize_1088',['page_size',['../structentt_1_1basic__component__traits.html#a4b00cb76e92fe28071c08f0b07d37539',1,'entt::basic_component_traits::page_size()'],['../classentt_1_1entt__traits.html#a16382ceec002b305cf6c48a2a913836a',1,'entt::entt_traits::page_size()']]] + ['page_5fsize_1072',['page_size',['../structentt_1_1component__traits.html#a8fa4acd0fc9b0c554ea805961a5b6f8b',1,'entt::component_traits::page_size()'],['../classentt_1_1entt__traits.html#a16382ceec002b305cf6c48a2a913836a',1,'entt::entt_traits::page_size()']]] ]; diff --git a/search/variables_a.js b/search/variables_a.js index ee761b9a3..5c862ef2e 100644 --- a/search/variables_a.js +++ b/search/variables_a.js @@ -1,4 +1,4 @@ var searchData= [ - ['reserved_1089',['reserved',['../classentt_1_1entt__traits.html#a376f015afde8d69c3e6f52a5da9429d1',1,'entt::entt_traits']]] + ['reserved_1073',['reserved',['../classentt_1_1entt__traits.html#a376f015afde8d69c3e6f52a5da9429d1',1,'entt::entt_traits']]] ]; diff --git a/search/variables_b.js b/search/variables_b.js index 390840657..46328e340 100644 --- a/search/variables_b.js +++ b/search/variables_b.js @@ -1,5 +1,5 @@ var searchData= [ - ['size_1090',['size',['../structentt_1_1type__list.html#a430c0675bdbcbb40be9b8f13f7259484',1,'entt::type_list::size()'],['../structentt_1_1value__list.html#a26bdc12c949cf22068f1bd411acf6cc7',1,'entt::value_list::size()']]], - ['size_5fof_5fv_1091',['size_of_v',['../namespaceentt.html#a15f9a70cbdd5a64f897a012ab2b5834f',1,'entt']]] + ['size_1074',['size',['../structentt_1_1type__list.html#a430c0675bdbcbb40be9b8f13f7259484',1,'entt::type_list::size()'],['../structentt_1_1value__list.html#a26bdc12c949cf22068f1bd411acf6cc7',1,'entt::value_list::size()']]], + ['size_5fof_5fv_1075',['size_of_v',['../namespaceentt.html#a15f9a70cbdd5a64f897a012ab2b5834f',1,'entt']]] ]; diff --git a/search/variables_c.js b/search/variables_c.js index 9781afbec..5d0b78314 100644 --- a/search/variables_c.js +++ b/search/variables_c.js @@ -1,6 +1,6 @@ var searchData= [ - ['tombstone_1092',['tombstone',['../namespaceentt.html#a674269102fdfe3fd6d7766210a828862',1,'entt']]], - ['type_1093',['type',['../classentt_1_1family.html#ad2c16ecd854f12f1aa70ceaba094e43a',1,'entt::family::type()'],['../classentt_1_1identifier.html#adb3aad553b8d57ef94581af39fc53178',1,'entt::identifier::type()']]], - ['type_5flist_5fcontains_5fv_1094',['type_list_contains_v',['../namespaceentt.html#a988ce063936d499bf2d69406c391fd5c',1,'entt']]] + ['tombstone_1076',['tombstone',['../namespaceentt.html#a674269102fdfe3fd6d7766210a828862',1,'entt']]], + ['type_1077',['type',['../classentt_1_1family.html#ad2c16ecd854f12f1aa70ceaba094e43a',1,'entt::family::type()'],['../classentt_1_1identifier.html#adb3aad553b8d57ef94581af39fc53178',1,'entt::identifier::type()']]], + ['type_5flist_5fcontains_5fv_1078',['type_list_contains_v',['../namespaceentt.html#a988ce063936d499bf2d69406c391fd5c',1,'entt']]] ]; diff --git a/search/variables_d.js b/search/variables_d.js index 7d8591b2b..de9367333 100644 --- a/search/variables_d.js +++ b/search/variables_d.js @@ -1,4 +1,4 @@ var searchData= [ - ['unpack_5fas_5fvalue_1095',['unpack_as_value',['../namespaceentt.html#aee7558c4e09ee416fb7fa3576737ff65',1,'entt']]] + ['unpack_5fas_5fvalue_1079',['unpack_as_value',['../namespaceentt.html#aee7558c4e09ee416fb7fa3576737ff65',1,'entt']]] ]; diff --git a/search/variables_e.js b/search/variables_e.js index ef674f608..104eb0e3f 100644 --- a/search/variables_e.js +++ b/search/variables_e.js @@ -1,5 +1,5 @@ var searchData= [ - ['value_1096',['value',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html#a7525593fea1bece0b7e43d2ea7a69411',1,'entt::value_list_element< 0u, value_list< Value, Other... > >']]], - ['value_5flist_5felement_5fv_1097',['value_list_element_v',['../namespaceentt.html#a4bbfb162708696f9c1497d61573b540f',1,'entt']]] + ['value_1080',['value',['../structentt_1_1value__list__element_3_010u_00_01value__list_3_01Value_00_01Other_8_8_8_01_4_01_4.html#a7525593fea1bece0b7e43d2ea7a69411',1,'entt::value_list_element< 0u, value_list< Value, Other... > >']]], + ['value_5flist_5felement_5fv_1081',['value_list_element_v',['../namespaceentt.html#a4bbfb162708696f9c1497d61573b540f',1,'entt']]] ]; diff --git a/sigh_8hpp_source.html b/sigh_8hpp_source.html index 9013665d5..14e6a4b36 100644 --- a/sigh_8hpp_source.html +++ b/sigh_8hpp_source.html @@ -22,7 +22,7 @@ @@ -75,380 +75,377 @@ $(function() {
3 
4 #include <algorithm>
5 #include <functional>
-
6 #include <iterator>
-
7 #include <type_traits>
-
8 #include <utility>
-
9 #include <vector>
-
10 #include "../config/config.h"
-
11 #include "delegate.hpp"
-
12 #include "fwd.hpp"
-
13 
-
14 namespace entt {
-
15 
-
24 template<typename Type>
-
25 class sink;
-
26 
-
36 template<typename Type, typename Allocator>
-
37 class sigh;
-
38 
-
55 template<typename Ret, typename... Args, typename Allocator>
-
56 class sigh<Ret(Args...), Allocator> {
-
58  friend class sink<sigh<Ret(Args...), Allocator>>;
-
59 
-
60  using allocator_traits = std::allocator_traits<Allocator>;
-
61  using alloc = typename allocator_traits::template rebind_alloc<delegate<Ret(Args...)>>;
-
62  using alloc_traits = typename std::allocator_traits<alloc>;
-
63 
-
64  using container_type = std::vector<delegate<Ret(Args...)>, alloc>;
-
65 
-
66 public:
-
68  using allocator_type = Allocator;
-
70  using size_type = std::size_t;
-
72  using sink_type = sink<sigh<Ret(Args...), Allocator>>;
-
73 
-
75  sigh()
-
76  : sigh{allocator_type{}} {}
-
77 
-
82  explicit sigh(const allocator_type &allocator)
-
83  : calls{allocator} {}
-
84 
-
89  sigh(const sigh &other)
-
90  : calls{other.calls} {}
-
91 
-
97  sigh(const sigh &other, const allocator_type &allocator)
-
98  : calls{other.calls, allocator} {}
-
99 
-
104  sigh(sigh &&other) ENTT_NOEXCEPT
-
105  : calls{std::move(other.calls)} {}
-
106 
-
112  sigh(sigh &&other, const allocator_type &allocator) ENTT_NOEXCEPT
-
113  : calls{std::move(other.calls), allocator} {}
-
114 
-
120  sigh &operator=(const sigh &other) {
-
121  calls = other.calls;
-
122  return *this;
-
123  }
-
124 
-
130  sigh &operator=(sigh &&other) ENTT_NOEXCEPT {
-
131  calls = std::move(other.calls);
-
132  return *this;
-
133  }
-
134 
-
139  void swap(sigh &other) {
-
140  using std::swap;
-
141  swap(calls, other.calls);
-
142  }
-
143 
-
148  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
-
149  return calls.get_allocator();
-
150  }
-
151 
-
156  template<typename Class>
-
157  using instance_type = Class *;
-
158 
-
163  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
-
164  return calls.size();
-
165  }
-
166 
-
171  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
-
172  return calls.empty();
-
173  }
-
174 
-
182  void publish(Args... args) const {
-
183  for(auto &&call: std::as_const(calls)) {
-
184  call(args...);
-
185  }
-
186  }
-
187 
-
202  template<typename Func>
-
203  void collect(Func func, Args... args) const {
-
204  for(auto &&call: calls) {
-
205  if constexpr(std::is_void_v<Ret>) {
-
206  if constexpr(std::is_invocable_r_v<bool, Func>) {
+
6 #include <type_traits>
+
7 #include <utility>
+
8 #include <vector>
+
9 #include "../config/config.h"
+
10 #include "delegate.hpp"
+
11 #include "fwd.hpp"
+
12 
+
13 namespace entt {
+
14 
+
23 template<typename Type>
+
24 class sink;
+
25 
+
35 template<typename Type, typename Allocator>
+
36 class sigh;
+
37 
+
54 template<typename Ret, typename... Args, typename Allocator>
+
55 class sigh<Ret(Args...), Allocator> {
+
57  friend class sink<sigh<Ret(Args...), Allocator>>;
+
58 
+
59  using alloc_traits = std::allocator_traits<Allocator>;
+
60  static_assert(std::is_same_v<typename alloc_traits::value_type, Ret (*)(Args...)>, "Invalid value type");
+
61  using container_type = std::vector<delegate<Ret(Args...)>, typename alloc_traits::template rebind_alloc<delegate<Ret(Args...)>>>;
+
62 
+
63 public:
+
65  using allocator_type = Allocator;
+
67  using size_type = std::size_t;
+
69  using sink_type = sink<sigh<Ret(Args...), Allocator>>;
+
70 
+
72  sigh()
+
73  : sigh{allocator_type{}} {}
+
74 
+
79  explicit sigh(const allocator_type &allocator)
+
80  : calls{allocator} {}
+
81 
+
86  sigh(const sigh &other)
+
87  : calls{other.calls} {}
+
88 
+
94  sigh(const sigh &other, const allocator_type &allocator)
+
95  : calls{other.calls, allocator} {}
+
96 
+
101  sigh(sigh &&other) ENTT_NOEXCEPT
+
102  : calls{std::move(other.calls)} {}
+
103 
+
109  sigh(sigh &&other, const allocator_type &allocator) ENTT_NOEXCEPT
+
110  : calls{std::move(other.calls), allocator} {}
+
111 
+
117  sigh &operator=(const sigh &other) {
+
118  calls = other.calls;
+
119  return *this;
+
120  }
+
121 
+
127  sigh &operator=(sigh &&other) ENTT_NOEXCEPT {
+
128  calls = std::move(other.calls);
+
129  return *this;
+
130  }
+
131 
+
136  void swap(sigh &other) {
+
137  using std::swap;
+
138  swap(calls, other.calls);
+
139  }
+
140 
+
145  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
+
146  return calls.get_allocator();
+
147  }
+
148 
+
153  template<typename Class>
+
154  using instance_type = Class *;
+
155 
+
160  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
+
161  return calls.size();
+
162  }
+
163 
+
168  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
+
169  return calls.empty();
+
170  }
+
171 
+
179  void publish(Args... args) const {
+
180  for(auto &&call: std::as_const(calls)) {
+
181  call(args...);
+
182  }
+
183  }
+
184 
+
199  template<typename Func>
+
200  void collect(Func func, Args... args) const {
+
201  for(auto &&call: calls) {
+
202  if constexpr(std::is_void_v<Ret>) {
+
203  if constexpr(std::is_invocable_r_v<bool, Func>) {
+
204  call(args...);
+
205  if(func()) { break; }
+
206  } else {
207  call(args...);
-
208  if(func()) { break; }
-
209  } else {
-
210  call(args...);
-
211  func();
-
212  }
-
213  } else {
-
214  if constexpr(std::is_invocable_r_v<bool, Func, Ret>) {
-
215  if(func(call(args...))) { break; }
-
216  } else {
-
217  func(call(args...));
-
218  }
-
219  }
-
220  }
-
221  }
-
222 
-
223 private:
-
224  container_type calls;
-
225 };
-
226 
-
234 class connection {
-
236  template<typename>
-
237  friend class sink;
+
208  func();
+
209  }
+
210  } else {
+
211  if constexpr(std::is_invocable_r_v<bool, Func, Ret>) {
+
212  if(func(call(args...))) { break; }
+
213  } else {
+
214  func(call(args...));
+
215  }
+
216  }
+
217  }
+
218  }
+
219 
+
220 private:
+
221  container_type calls;
+
222 };
+
223 
+
231 class connection {
+
233  template<typename>
+
234  friend class sink;
+
235 
+
236  connection(delegate<void(void *)> fn, void *ref)
+
237  : disconnect{fn}, signal{ref} {}
238 
-
239  connection(delegate<void(void *)> fn, void *ref)
-
240  : disconnect{fn}, signal{ref} {}
-
241 
-
242 public:
-
244  connection() = default;
-
245 
-
250  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
-
251  return static_cast<bool>(disconnect);
-
252  }
-
253 
-
255  void release() {
-
256  if(disconnect) {
-
257  disconnect(signal);
-
258  disconnect.reset();
-
259  }
-
260  }
-
261 
-
262 private:
-
263  delegate<void(void *)> disconnect;
-
264  void *signal{};
-
265 };
-
266 
-
276 struct scoped_connection {
-
278  scoped_connection() = default;
-
279 
-
284  scoped_connection(const connection &other)
-
285  : conn{other} {}
+
239 public:
+
241  connection() = default;
+
242 
+
247  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
+
248  return static_cast<bool>(disconnect);
+
249  }
+
250 
+
252  void release() {
+
253  if(disconnect) {
+
254  disconnect(signal);
+
255  disconnect.reset();
+
256  }
+
257  }
+
258 
+
259 private:
+
260  delegate<void(void *)> disconnect;
+
261  void *signal{};
+
262 };
+
263 
+
273 struct scoped_connection {
+
275  scoped_connection() = default;
+
276 
+
281  scoped_connection(const connection &other)
+
282  : conn{other} {}
+
283 
+
285  scoped_connection(const scoped_connection &) = delete;
286 
-
288  scoped_connection(const scoped_connection &) = delete;
-
289 
-
294  scoped_connection(scoped_connection &&other) ENTT_NOEXCEPT
-
295  : conn{std::exchange(other.conn, {})} {}
-
296 
-
298  ~scoped_connection() {
-
299  conn.release();
-
300  }
-
301 
-
306  scoped_connection &operator=(const scoped_connection &) = delete;
-
307 
-
313  scoped_connection &operator=(scoped_connection &&other) ENTT_NOEXCEPT {
-
314  conn = std::exchange(other.conn, {});
-
315  return *this;
-
316  }
-
317 
-
323  scoped_connection &operator=(connection other) {
-
324  conn = std::move(other);
-
325  return *this;
-
326  }
-
327 
-
332  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
-
333  return static_cast<bool>(conn);
-
334  }
-
335 
-
337  void release() {
-
338  conn.release();
-
339  }
-
340 
-
341 private:
-
342  connection conn;
-
343 };
-
344 
-
364 template<typename Ret, typename... Args, typename Allocator>
-
365 class sink<sigh<Ret(Args...), Allocator>> {
-
366  using signal_type = sigh<Ret(Args...), Allocator>;
-
367  using difference_type = typename std::iterator_traits<typename decltype(signal_type::calls)::iterator>::difference_type;
-
368 
-
369  template<auto Candidate, typename Type>
-
370  static void release(Type value_or_instance, void *signal) {
-
371  sink{*static_cast<signal_type *>(signal)}.disconnect<Candidate>(value_or_instance);
-
372  }
-
373 
-
374  template<auto Candidate>
-
375  static void release(void *signal) {
-
376  sink{*static_cast<signal_type *>(signal)}.disconnect<Candidate>();
-
377  }
-
378 
-
379 public:
-
384  sink(sigh<Ret(Args...), Allocator> &ref) ENTT_NOEXCEPT
-
385  : offset{},
-
386  signal{&ref} {}
-
387 
-
392  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
-
393  return signal->calls.empty();
-
394  }
-
395 
-
402  template<auto Function>
-
403  [[nodiscard]] sink before() {
-
404  delegate<Ret(Args...)> call{};
-
405  call.template connect<Function>();
+
291  scoped_connection(scoped_connection &&other) ENTT_NOEXCEPT
+
292  : conn{std::exchange(other.conn, {})} {}
+
293 
+
295  ~scoped_connection() {
+
296  conn.release();
+
297  }
+
298 
+
303  scoped_connection &operator=(const scoped_connection &) = delete;
+
304 
+
310  scoped_connection &operator=(scoped_connection &&other) ENTT_NOEXCEPT {
+
311  conn = std::exchange(other.conn, {});
+
312  return *this;
+
313  }
+
314 
+
320  scoped_connection &operator=(connection other) {
+
321  conn = std::move(other);
+
322  return *this;
+
323  }
+
324 
+
329  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
+
330  return static_cast<bool>(conn);
+
331  }
+
332 
+
334  void release() {
+
335  conn.release();
+
336  }
+
337 
+
338 private:
+
339  connection conn;
+
340 };
+
341 
+
361 template<typename Ret, typename... Args, typename Allocator>
+
362 class sink<sigh<Ret(Args...), Allocator>> {
+
363  using signal_type = sigh<Ret(Args...), Allocator>;
+
364  using difference_type = typename signal_type::container_type::difference_type;
+
365 
+
366  template<auto Candidate, typename Type>
+
367  static void release(Type value_or_instance, void *signal) {
+
368  sink{*static_cast<signal_type *>(signal)}.disconnect<Candidate>(value_or_instance);
+
369  }
+
370 
+
371  template<auto Candidate>
+
372  static void release(void *signal) {
+
373  sink{*static_cast<signal_type *>(signal)}.disconnect<Candidate>();
+
374  }
+
375 
+
376 public:
+
381  sink(sigh<Ret(Args...), Allocator> &ref) ENTT_NOEXCEPT
+
382  : offset{},
+
383  signal{&ref} {}
+
384 
+
389  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
+
390  return signal->calls.empty();
+
391  }
+
392 
+
399  template<auto Function>
+
400  [[nodiscard]] sink before() {
+
401  delegate<Ret(Args...)> call{};
+
402  call.template connect<Function>();
+
403 
+
404  const auto &calls = signal->calls;
+
405  const auto it = std::find(calls.cbegin(), calls.cend(), std::move(call));
406 
-
407  const auto &calls = signal->calls;
-
408  const auto it = std::find(calls.cbegin(), calls.cend(), std::move(call));
-
409 
-
410  sink other{*this};
-
411  other.offset = std::distance(it, calls.cend());
-
412  return other;
-
413  }
-
414 
-
423  template<auto Candidate, typename Type>
-
424  [[nodiscard]] sink before(Type &&value_or_instance) {
-
425  delegate<Ret(Args...)> call{};
-
426  call.template connect<Candidate>(value_or_instance);
+
407  sink other{*this};
+
408  other.offset = calls.cend() - it;
+
409  return other;
+
410  }
+
411 
+
420  template<auto Candidate, typename Type>
+
421  [[nodiscard]] sink before(Type &&value_or_instance) {
+
422  delegate<Ret(Args...)> call{};
+
423  call.template connect<Candidate>(value_or_instance);
+
424 
+
425  const auto &calls = signal->calls;
+
426  const auto it = std::find(calls.cbegin(), calls.cend(), std::move(call));
427 
-
428  const auto &calls = signal->calls;
-
429  const auto it = std::find(calls.cbegin(), calls.cend(), std::move(call));
-
430 
-
431  sink other{*this};
-
432  other.offset = std::distance(it, calls.cend());
-
433  return other;
-
434  }
-
435 
-
443  template<typename Type>
-
444  [[nodiscard]] sink before(Type &value_or_instance) {
-
445  return before(&value_or_instance);
-
446  }
-
447 
-
455  template<typename Type>
-
456  [[nodiscard]] sink before(Type *value_or_instance) {
-
457  sink other{*this};
-
458 
-
459  if(value_or_instance) {
-
460  const auto &calls = signal->calls;
-
461  const auto it = std::find_if(calls.cbegin(), calls.cend(), [value_or_instance](const auto &delegate) {
-
462  return delegate.instance() == value_or_instance;
-
463  });
+
428  sink other{*this};
+
429  other.offset = calls.cend() - it;
+
430  return other;
+
431  }
+
432 
+
440  template<typename Type>
+
441  [[nodiscard]] sink before(Type &value_or_instance) {
+
442  return before(&value_or_instance);
+
443  }
+
444 
+
452  template<typename Type>
+
453  [[nodiscard]] sink before(Type *value_or_instance) {
+
454  sink other{*this};
+
455 
+
456  if(value_or_instance) {
+
457  const auto &calls = signal->calls;
+
458  const auto it = std::find_if(calls.cbegin(), calls.cend(), [value_or_instance](const auto &delegate) {
+
459  return delegate.data() == value_or_instance;
+
460  });
+
461 
+
462  other.offset = calls.cend() - it;
+
463  }
464 
-
465  other.offset = std::distance(it, calls.cend());
-
466  }
+
465  return other;
+
466  }
467 
-
468  return other;
-
469  }
-
470 
-
475  [[nodiscard]] sink before() {
-
476  sink other{*this};
-
477  other.offset = signal->calls.size();
-
478  return other;
-
479  }
-
480 
-
490  template<auto Candidate>
-
491  connection connect() {
-
492  disconnect<Candidate>();
-
493 
-
494  delegate<Ret(Args...)> call{};
-
495  call.template connect<Candidate>();
-
496  signal->calls.insert(signal->calls.end() - offset, std::move(call));
-
497 
-
498  delegate<void(void *)> conn{};
-
499  conn.template connect<&release<Candidate>>();
-
500  return {std::move(conn), signal};
-
501  }
-
502 
-
520  template<auto Candidate, typename Type>
-
521  connection connect(Type &&value_or_instance) {
-
522  disconnect<Candidate>(value_or_instance);
-
523 
-
524  delegate<Ret(Args...)> call{};
-
525  call.template connect<Candidate>(value_or_instance);
-
526  signal->calls.insert(signal->calls.end() - offset, std::move(call));
-
527 
-
528  delegate<void(void *)> conn{};
-
529  conn.template connect<&release<Candidate, Type>>(value_or_instance);
-
530  return {std::move(conn), signal};
-
531  }
-
532 
-
537  template<auto Candidate>
-
538  void disconnect() {
-
539  auto &calls = signal->calls;
-
540  delegate<Ret(Args...)> call{};
-
541  call.template connect<Candidate>();
-
542  calls.erase(std::remove(calls.begin(), calls.end(), std::move(call)), calls.end());
-
543  }
-
544 
-
552  template<auto Candidate, typename Type>
-
553  void disconnect(Type &&value_or_instance) {
-
554  auto &calls = signal->calls;
-
555  delegate<Ret(Args...)> call{};
-
556  call.template connect<Candidate>(value_or_instance);
-
557  calls.erase(std::remove(calls.begin(), calls.end(), std::move(call)), calls.end());
-
558  }
-
559 
-
566  template<typename Type>
-
567  void disconnect(Type &value_or_instance) {
-
568  disconnect(&value_or_instance);
-
569  }
-
570 
-
577  template<typename Type>
-
578  void disconnect(Type *value_or_instance) {
-
579  if(value_or_instance) {
-
580  auto &calls = signal->calls;
-
581  auto predicate = [value_or_instance](const auto &delegate) { return delegate.instance() == value_or_instance; };
-
582  calls.erase(std::remove_if(calls.begin(), calls.end(), std::move(predicate)), calls.end());
-
583  }
-
584  }
-
585 
-
587  void disconnect() {
-
588  signal->calls.clear();
-
589  }
-
590 
-
591 private:
-
592  difference_type offset;
-
593  signal_type *signal;
-
594 };
-
595 
-
606 template<typename Ret, typename... Args, typename Allocator>
-
607 sink(sigh<Ret(Args...), Allocator> &) -> sink<sigh<Ret(Args...), Allocator>>;
-
608 
-
609 } // namespace entt
-
610 
-
611 #endif
-
entt::connection
Connection class.
Definition: sigh.hpp:234
+
472  [[nodiscard]] sink before() {
+
473  sink other{*this};
+
474  other.offset = signal->calls.size();
+
475  return other;
+
476  }
+
477 
+
487  template<auto Candidate>
+
488  connection connect() {
+
489  disconnect<Candidate>();
+
490 
+
491  delegate<Ret(Args...)> call{};
+
492  call.template connect<Candidate>();
+
493  signal->calls.insert(signal->calls.end() - offset, std::move(call));
+
494 
+
495  delegate<void(void *)> conn{};
+
496  conn.template connect<&release<Candidate>>();
+
497  return {std::move(conn), signal};
+
498  }
+
499 
+
517  template<auto Candidate, typename Type>
+
518  connection connect(Type &&value_or_instance) {
+
519  disconnect<Candidate>(value_or_instance);
+
520 
+
521  delegate<Ret(Args...)> call{};
+
522  call.template connect<Candidate>(value_or_instance);
+
523  signal->calls.insert(signal->calls.end() - offset, std::move(call));
+
524 
+
525  delegate<void(void *)> conn{};
+
526  conn.template connect<&release<Candidate, Type>>(value_or_instance);
+
527  return {std::move(conn), signal};
+
528  }
+
529 
+
534  template<auto Candidate>
+
535  void disconnect() {
+
536  auto &calls = signal->calls;
+
537  delegate<Ret(Args...)> call{};
+
538  call.template connect<Candidate>();
+
539  calls.erase(std::remove(calls.begin(), calls.end(), std::move(call)), calls.end());
+
540  }
+
541 
+
549  template<auto Candidate, typename Type>
+
550  void disconnect(Type &&value_or_instance) {
+
551  auto &calls = signal->calls;
+
552  delegate<Ret(Args...)> call{};
+
553  call.template connect<Candidate>(value_or_instance);
+
554  calls.erase(std::remove(calls.begin(), calls.end(), std::move(call)), calls.end());
+
555  }
+
556 
+
563  template<typename Type>
+
564  void disconnect(Type &value_or_instance) {
+
565  disconnect(&value_or_instance);
+
566  }
+
567 
+
574  template<typename Type>
+
575  void disconnect(Type *value_or_instance) {
+
576  if(value_or_instance) {
+
577  auto &calls = signal->calls;
+
578  auto predicate = [value_or_instance](const auto &delegate) { return delegate.data() == value_or_instance; };
+
579  calls.erase(std::remove_if(calls.begin(), calls.end(), std::move(predicate)), calls.end());
+
580  }
+
581  }
+
582 
+
584  void disconnect() {
+
585  signal->calls.clear();
+
586  }
+
587 
+
588 private:
+
589  difference_type offset;
+
590  signal_type *signal;
+
591 };
+
592 
+
603 template<typename Ret, typename... Args, typename Allocator>
+
604 sink(sigh<Ret(Args...), Allocator> &) -> sink<sigh<Ret(Args...), Allocator>>;
+
605 
+
606 } // namespace entt
+
607 
+
608 #endif
+
entt::connection
Connection class.
Definition: sigh.hpp:231
entt::connection::connection
connection()=default
Default constructor.
-
entt::connection::release
void release()
Breaks the connection.
Definition: sigh.hpp:255
-
entt::delegate
Basic delegate implementation.
Definition: delegate.hpp:66
-
entt::sigh< Ret(Args...), Allocator >
Unmanaged signal handler.
Definition: sigh.hpp:56
-
entt::sigh< Ret(Args...), Allocator >::sigh
sigh()
Default constructor.
Definition: sigh.hpp:75
-
entt::sigh< Ret(Args...), Allocator >::publish
void publish(Args... args) const
Triggers a signal.
Definition: sigh.hpp:182
-
entt::sigh< Ret(Args...), Allocator >::allocator_type
Allocator allocator_type
Allocator type.
Definition: sigh.hpp:68
-
entt::sigh< Ret(Args...), Allocator >::operator=
sigh & operator=(const sigh &other)
Default copy assignment operator.
Definition: sigh.hpp:120
-
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(const sigh &other)
Default copy constructor.
Definition: sigh.hpp:89
-
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(sigh &&other)
Default move constructor.
Definition: sigh.hpp:104
-
entt::sigh< Ret(Args...), Allocator >::operator=
sigh & operator=(sigh &&other)
Default move assignment operator.
Definition: sigh.hpp:130
-
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(sigh &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: sigh.hpp:112
-
entt::sigh< Ret(Args...), Allocator >::size
size_type size() const
Number of listeners connected to the signal.
Definition: sigh.hpp:163
-
entt::sigh< Ret(Args...), Allocator >::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: sigh.hpp:148
-
entt::sigh< Ret(Args...), Allocator >::instance_type
Class * instance_type
Instance type when it comes to connecting member functions.
Definition: sigh.hpp:157
-
entt::sigh< Ret(Args...), Allocator >::swap
void swap(sigh &other)
Exchanges the contents with those of a given signal handler.
Definition: sigh.hpp:139
-
entt::sigh< Ret(Args...), Allocator >::size_type
std::size_t size_type
Unsigned integer type.
Definition: sigh.hpp:70
-
entt::sigh< Ret(Args...), Allocator >::empty
bool empty() const
Returns false if at least a listener is connected to the signal.
Definition: sigh.hpp:171
-
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(const sigh &other, const allocator_type &allocator)
Allocator-extended copy constructor.
Definition: sigh.hpp:97
-
entt::sigh< Ret(Args...), Allocator >::collect
void collect(Func func, Args... args) const
Collects return values from the listeners.
Definition: sigh.hpp:203
-
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(const allocator_type &allocator)
Constructs a signal handler with a given allocator.
Definition: sigh.hpp:82
-
entt::sigh
Unmanaged signal handler.
Definition: fwd.hpp:24
- -
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect(Type &value_or_instance)
Disconnects free functions with payload or bound members from a signal.
Definition: sigh.hpp:567
-
entt::sink< sigh< Ret(Args...), Allocator > >::sink
sink(sigh< Ret(Args...), Allocator > &ref)
Constructs a sink that is allowed to modify a given signal.
Definition: sigh.hpp:384
-
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect()
Disconnects all the listeners from a signal.
Definition: sigh.hpp:587
-
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect()
Disconnects a free function or an unbound member from a signal.
Definition: sigh.hpp:538
-
entt::sink< sigh< Ret(Args...), Allocator > >::connect
connection connect()
Connects a free function or an unbound member to a signal.
Definition: sigh.hpp:491
-
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before()
Returns a sink that connects before a given free function or an unbound member.
Definition: sigh.hpp:403
-
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before()
Returns a sink that connects before anything else.
Definition: sigh.hpp:475
-
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before(Type &&value_or_instance)
Returns a sink that connects before a free function with payload or a bound member.
Definition: sigh.hpp:424
-
entt::sink< sigh< Ret(Args...), Allocator > >::connect
connection connect(Type &&value_or_instance)
Connects a free function with payload or a bound member to a signal.
Definition: sigh.hpp:521
-
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect(Type &&value_or_instance)
Disconnects a free function with payload or a bound member from a signal.
Definition: sigh.hpp:553
-
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect(Type *value_or_instance)
Disconnects free functions with payload or bound members from a signal.
Definition: sigh.hpp:578
-
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before(Type *value_or_instance)
Returns a sink that connects before a given instance or specific payload.
Definition: sigh.hpp:456
-
entt::sink< sigh< Ret(Args...), Allocator > >::empty
bool empty() const
Returns false if at least a listener is connected to the sink.
Definition: sigh.hpp:392
-
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before(Type &value_or_instance)
Returns a sink that connects before a given instance or specific payload.
Definition: sigh.hpp:444
-
entt::sink
Sink class.
Definition: fwd.hpp:21
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt::connection::release
void release()
Breaks the connection.
Definition: sigh.hpp:252
+
entt::delegate
Basic delegate implementation.
Definition: delegate.hpp:67
+
entt::sigh< Ret(Args...), Allocator >
Unmanaged signal handler.
Definition: sigh.hpp:55
+
entt::sigh< Ret(Args...), Allocator >::sigh
sigh()
Default constructor.
Definition: sigh.hpp:72
+
entt::sigh< Ret(Args...), Allocator >::publish
void publish(Args... args) const
Triggers a signal.
Definition: sigh.hpp:179
+
entt::sigh< Ret(Args...), Allocator >::allocator_type
Allocator allocator_type
Allocator type.
Definition: sigh.hpp:65
+
entt::sigh< Ret(Args...), Allocator >::operator=
sigh & operator=(const sigh &other)
Copy assignment operator.
Definition: sigh.hpp:117
+
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(const sigh &other)
Copy constructor.
Definition: sigh.hpp:86
+
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(sigh &&other)
Move constructor.
Definition: sigh.hpp:101
+
entt::sigh< Ret(Args...), Allocator >::operator=
sigh & operator=(sigh &&other)
Move assignment operator.
Definition: sigh.hpp:127
+
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(sigh &&other, const allocator_type &allocator)
Allocator-extended move constructor.
Definition: sigh.hpp:109
+
entt::sigh< Ret(Args...), Allocator >::size
size_type size() const
Number of listeners connected to the signal.
Definition: sigh.hpp:160
+
entt::sigh< Ret(Args...), Allocator >::get_allocator
constexpr allocator_type get_allocator() const
Returns the associated allocator.
Definition: sigh.hpp:145
+
entt::sigh< Ret(Args...), Allocator >::instance_type
Class * instance_type
Instance type when it comes to connecting member functions.
Definition: sigh.hpp:154
+
entt::sigh< Ret(Args...), Allocator >::swap
void swap(sigh &other)
Exchanges the contents with those of a given signal handler.
Definition: sigh.hpp:136
+
entt::sigh< Ret(Args...), Allocator >::size_type
std::size_t size_type
Unsigned integer type.
Definition: sigh.hpp:67
+
entt::sigh< Ret(Args...), Allocator >::empty
bool empty() const
Returns false if at least a listener is connected to the signal.
Definition: sigh.hpp:168
+
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(const sigh &other, const allocator_type &allocator)
Allocator-extended copy constructor.
Definition: sigh.hpp:94
+
entt::sigh< Ret(Args...), Allocator >::collect
void collect(Func func, Args... args) const
Collects return values from the listeners.
Definition: sigh.hpp:200
+
entt::sigh< Ret(Args...), Allocator >::sigh
sigh(const allocator_type &allocator)
Constructs a signal handler with a given allocator.
Definition: sigh.hpp:79
+
entt::sigh
Unmanaged signal handler.
Definition: fwd.hpp:25
+ +
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect(Type &value_or_instance)
Disconnects free functions with payload or bound members from a signal.
Definition: sigh.hpp:564
+
entt::sink< sigh< Ret(Args...), Allocator > >::sink
sink(sigh< Ret(Args...), Allocator > &ref)
Constructs a sink that is allowed to modify a given signal.
Definition: sigh.hpp:381
+
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect()
Disconnects all the listeners from a signal.
Definition: sigh.hpp:584
+
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect()
Disconnects a free function or an unbound member from a signal.
Definition: sigh.hpp:535
+
entt::sink< sigh< Ret(Args...), Allocator > >::connect
connection connect()
Connects a free function or an unbound member to a signal.
Definition: sigh.hpp:488
+
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before()
Returns a sink that connects before a given free function or an unbound member.
Definition: sigh.hpp:400
+
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before()
Returns a sink that connects before anything else.
Definition: sigh.hpp:472
+
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before(Type &&value_or_instance)
Returns a sink that connects before a free function with payload or a bound member.
Definition: sigh.hpp:421
+
entt::sink< sigh< Ret(Args...), Allocator > >::connect
connection connect(Type &&value_or_instance)
Connects a free function with payload or a bound member to a signal.
Definition: sigh.hpp:518
+
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect(Type &&value_or_instance)
Disconnects a free function with payload or a bound member from a signal.
Definition: sigh.hpp:550
+
entt::sink< sigh< Ret(Args...), Allocator > >::disconnect
void disconnect(Type *value_or_instance)
Disconnects free functions with payload or bound members from a signal.
Definition: sigh.hpp:575
+
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before(Type *value_or_instance)
Returns a sink that connects before a given instance or specific payload.
Definition: sigh.hpp:453
+
entt::sink< sigh< Ret(Args...), Allocator > >::empty
bool empty() const
Returns false if at least a listener is connected to the sink.
Definition: sigh.hpp:389
+
entt::sink< sigh< Ret(Args...), Allocator > >::before
sink before(Type &value_or_instance)
Returns a sink that connects before a given instance or specific payload.
Definition: sigh.hpp:441
+
entt::sink
Sink class.
Definition: fwd.hpp:22
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::delegate
delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>
Deduction guide.
entt::sink
sink(sigh< Ret(Args...), Allocator > &) -> sink< sigh< Ret(Args...), Allocator >>
Deduction guide.
entt::swap
void swap(compressed_pair< First, Second > &lhs, compressed_pair< First, Second > &rhs)
Swaps two compressed pair objects.
Definition: compressed_pair.hpp:248
-
entt::scoped_connection
Scoped connection class.
Definition: sigh.hpp:276
+
entt::scoped_connection
Scoped connection class.
Definition: sigh.hpp:273
entt::scoped_connection::scoped_connection
scoped_connection()=default
Default constructor.
-
entt::scoped_connection::release
void release()
Breaks the connection.
Definition: sigh.hpp:337
-
entt::scoped_connection::scoped_connection
scoped_connection(scoped_connection &&other)
Move constructor.
Definition: sigh.hpp:294
-
entt::scoped_connection::~scoped_connection
~scoped_connection()
Automatically breaks the link on destruction.
Definition: sigh.hpp:298
-
entt::scoped_connection::operator=
scoped_connection & operator=(connection other)
Acquires a connection.
Definition: sigh.hpp:323
-
entt::scoped_connection::scoped_connection
scoped_connection(const connection &other)
Constructs a scoped connection from a basic connection.
Definition: sigh.hpp:284
-
entt::scoped_connection::operator=
scoped_connection & operator=(scoped_connection &&other)
Move assignment operator.
Definition: sigh.hpp:313
+
entt::scoped_connection::release
void release()
Breaks the connection.
Definition: sigh.hpp:334
+
entt::scoped_connection::scoped_connection
scoped_connection(scoped_connection &&other)
Move constructor.
Definition: sigh.hpp:291
+
entt::scoped_connection::~scoped_connection
~scoped_connection()
Automatically breaks the link on destruction.
Definition: sigh.hpp:295
+
entt::scoped_connection::operator=
scoped_connection & operator=(connection other)
Acquires a connection.
Definition: sigh.hpp:320
+
entt::scoped_connection::scoped_connection
scoped_connection(const connection &other)
Constructs a scoped connection from a basic connection.
Definition: sigh.hpp:281
+
entt::scoped_connection::operator=
scoped_connection & operator=(scoped_connection &&other)
Move assignment operator.
Definition: sigh.hpp:310
entt::scoped_connection::scoped_connection
scoped_connection(const scoped_connection &)=delete
Default copy constructor, deleted on purpose.
entt::scoped_connection::operator=
scoped_connection & operator=(const scoped_connection &)=delete
Default copy assignment operator, deleted on purpose.
diff --git a/sigh__storage__mixin_8hpp_source.html b/sigh__storage__mixin_8hpp_source.html new file mode 100644 index 000000000..872f170bd --- /dev/null +++ b/sigh__storage__mixin_8hpp_source.html @@ -0,0 +1,195 @@ + + + + + + + +EnTT: src/entt/entity/sigh_storage_mixin.hpp Source File + + + + + + + + + +
+
+
const_iterator entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::find const_iterator entt::dense_set< Type, Hash, KeyEqual, Allocator >::find (const value_type & const value_type &  value) const
- + @@ -1719,12 +1644,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

Returns the associated allocator.

Returns
The associated allocator.
-

Definition at line 457 of file dense_hash_set.hpp.

+

Definition at line 407 of file dense_set.hpp.

- -

◆ hash_function()

+ +

◆ hash_function()

@@ -1735,7 +1660,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -138,10 +138,10 @@ $(function() {
71 struct meta_data_node {
72  using size_type = std::size_t;
73  id_type id;
-
74  meta_data_node *next;
-
75  meta_prop_node *prop;
-
76  const size_type arity;
-
77  const meta_traits traits;
+
74  const meta_traits traits;
+
75  meta_data_node *next;
+
76  meta_prop_node *prop;
+
77  const size_type arity;
78  meta_type_node *const type;
79  meta_type (*const arg)(const size_type) ENTT_NOEXCEPT;
80  bool (*const set)(meta_handle, meta_any);
@@ -151,10 +151,10 @@ $(function() {
84 struct meta_func_node {
85  using size_type = std::size_t;
86  id_type id;
-
87  meta_func_node *next;
-
88  meta_prop_node *prop;
-
89  const size_type arity;
-
90  const meta_traits traits;
+
87  const meta_traits traits;
+
88  meta_func_node *next;
+
89  meta_prop_node *prop;
+
90  const size_type arity;
91  meta_type_node *const ret;
92  meta_type (*const arg)(const size_type) ENTT_NOEXCEPT;
93  meta_any (*const invoke)(meta_handle, meta_any *const);
@@ -171,10 +171,10 @@ $(function() {
104  using size_type = std::size_t;
105  const type_info *info;
106  id_type id;
-
107  meta_type_node *next;
-
108  meta_prop_node *prop;
-
109  const size_type size_of;
-
110  const meta_traits traits;
+
107  const meta_traits traits;
+
108  meta_type_node *next;
+
109  meta_prop_node *prop;
+
110  const size_type size_of;
111  meta_any (*const default_constructor)();
112  double (*const conversion_helper)(void *, const void *);
113  const meta_template_node *const templ;
@@ -235,18 +235,18 @@ $(function() {
168  static meta_type_node node{
169  &type_id<Type>(),
170  {},
-
171  nullptr,
-
172  nullptr,
-
173  size_of_v<Type>,
-
174  internal::meta_traits::is_none
-
175  | (std::is_arithmetic_v<Type> ? internal::meta_traits::is_arithmetic : internal::meta_traits::is_none)
-
176  | (std::is_array_v<Type> ? internal::meta_traits::is_array : internal::meta_traits::is_none)
-
177  | (std::is_enum_v<Type> ? internal::meta_traits::is_enum : internal::meta_traits::is_none)
-
178  | (std::is_class_v<Type> ? internal::meta_traits::is_class : internal::meta_traits::is_none)
-
179  | (std::is_pointer_v<Type> ? internal::meta_traits::is_pointer : internal::meta_traits::is_none)
-
180  | (is_meta_pointer_like_v<Type> ? internal::meta_traits::is_meta_pointer_like : internal::meta_traits::is_none)
-
181  | (is_complete_v<meta_sequence_container_traits<Type>> ? internal::meta_traits::is_meta_sequence_container : internal::meta_traits::is_none)
-
182  | (is_complete_v<meta_associative_container_traits<Type>> ? internal::meta_traits::is_meta_associative_container : internal::meta_traits::is_none),
+
171  internal::meta_traits::is_none
+
172  | (std::is_arithmetic_v<Type> ? internal::meta_traits::is_arithmetic : internal::meta_traits::is_none)
+
173  | (std::is_array_v<Type> ? internal::meta_traits::is_array : internal::meta_traits::is_none)
+
174  | (std::is_enum_v<Type> ? internal::meta_traits::is_enum : internal::meta_traits::is_none)
+
175  | (std::is_class_v<Type> ? internal::meta_traits::is_class : internal::meta_traits::is_none)
+
176  | (std::is_pointer_v<Type> ? internal::meta_traits::is_pointer : internal::meta_traits::is_none)
+
177  | (is_meta_pointer_like_v<Type> ? internal::meta_traits::is_meta_pointer_like : internal::meta_traits::is_none)
+
178  | (is_complete_v<meta_sequence_container_traits<Type>> ? internal::meta_traits::is_meta_sequence_container : internal::meta_traits::is_none)
+
179  | (is_complete_v<meta_associative_container_traits<Type>> ? internal::meta_traits::is_meta_associative_container : internal::meta_traits::is_none),
+
180  nullptr,
+
181  nullptr,
+
182  size_of_v<Type>,
183  meta_default_constructor(),
184  meta_conversion_helper(),
185  meta_template_info()
@@ -259,12 +259,12 @@ $(function() {
192 
193 template<typename... Args>
194 [[nodiscard]] meta_type_node *meta_arg_node(type_list<Args...>, const std::size_t index) ENTT_NOEXCEPT {
-
195  meta_type_node *args[sizeof...(Args) + 1u]{nullptr, internal::meta_node<std::remove_const_t<std::remove_reference_t<Args>>>::resolve()...};
+
195  meta_type_node *args[sizeof...(Args) + 1u]{nullptr, internal::meta_node<std::remove_cv_t<std::remove_reference_t<Args>>>::resolve()...};
196  return args[index + 1u];
197 }
198 
199 template<auto Member, typename Type>
-
200 [[nodiscard]] static std::decay_t<decltype(std::declval<internal::meta_type_node>().*Member)> find_by(const Type &info_or_id, const internal::meta_type_node *node) {
+
200 [[nodiscard]] static std::decay_t<decltype(std::declval<internal::meta_type_node>().*Member)> find_by(const Type &info_or_id, const internal::meta_type_node *node) ENTT_NOEXCEPT {
201  for(auto *curr = node->*Member; curr; curr = curr->next) {
202  if constexpr(std::is_same_v<Type, type_info>) {
203  if(*curr->type->info == info_or_id) {
@@ -295,9 +295,9 @@ $(function() {
233 } // namespace entt
234 
235 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::resolve
meta_type resolve()
Returns the meta type associated with a given type.
Definition: resolve.hpp:19
-
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:13
+
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:14
entt::is_complete_v
constexpr bool is_complete_v
Helper variable template.
Definition: type_traits.hpp:447
entt::get
constexpr get_t< Type... > get
Variable template for lists of observed components.
Definition: utility.hpp:34
entt::invoke
void invoke(basic_registry< Entity > &reg, const Entity entt)
Helper to create a listener that directly invokes a member function.
Definition: helper.hpp:119
diff --git a/observer_8hpp_source.html b/observer_8hpp_source.html index 5d528c35b..7eb3ba109 100644 --- a/observer_8hpp_source.html +++ b/observer_8hpp_source.html @@ -22,7 +22,7 @@ @@ -237,7 +237,7 @@ $(function() {
267 public:
269  using entity_type = Entity;
271  using size_type = std::size_t;
-
273  using iterator = typename basic_sparse_set<Entity>::iterator;
+
273  using iterator = typename basic_sparse_set<Entity>::iterator;
274 
276  basic_observer()
277  : release{},
@@ -338,19 +338,19 @@ $(function() {
entt::basic_observer::basic_observer
basic_observer()
Default constructor.
Definition: observer.hpp:276
entt::basic_observer::entity_type
Entity entity_type
Underlying entity identifier.
Definition: observer.hpp:269
entt::basic_observer::~basic_observer
~basic_observer()=default
Default destructor.
-
entt::basic_registry
Fast and reliable entity-component system.
Definition: registry.hpp:173
-
entt::basic_sparse_set::erase
void erase(const entity_type entt)
Erases an entity from a sparse set.
Definition: sparse_set.hpp:703
-
entt::basic_sparse_set::empty
bool empty() const
Checks whether a sparse set is empty.
Definition: sparse_set.hpp:479
-
entt::basic_sparse_set::clear
void clear()
Clears a sparse set.
Definition: sparse_set.hpp:907
-
entt::basic_sparse_set::size
size_type size() const
Returns the number of elements in a sparse set.
Definition: sparse_set.hpp:471
-
entt::basic_sparse_set::iterator
internal::sparse_set_iterator< packed_container_type > iterator
Random access iterator type.
Definition: sparse_set.hpp:297
-
entt::basic_sparse_set::contains
bool contains(const entity_type entt) const
Checks if a sparse set contains an entity.
Definition: sparse_set.hpp:582
-
entt::basic_sparse_set::data
pointer data() const
Direct access to the internal packed array.
Definition: sparse_set.hpp:487
-
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:237
-
entt::basic_storage::emplace
value_type & emplace(const entity_type entt, Args &&...args)
Assigns an entity to a storage and constructs its object.
Definition: storage.hpp:690
-
entt::basic_storage::get
const value_type & get(const entity_type entt) const
Returns the object assigned to an entity.
Definition: storage.hpp:651
-
entt::delegate
Basic delegate implementation.
Definition: delegate.hpp:66
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt::basic_registry
Fast and reliable entity-component system.
Definition: registry.hpp:221
+
entt::basic_sparse_set::erase
void erase(const entity_type entt)
Erases an entity from a sparse set.
Definition: sparse_set.hpp:710
+
entt::basic_sparse_set::empty
bool empty() const
Checks whether a sparse set is empty.
Definition: sparse_set.hpp:473
+
entt::basic_sparse_set::clear
void clear()
Clears a sparse set.
Definition: sparse_set.hpp:922
+
entt::basic_sparse_set::iterator
basic_iterator iterator
Random access iterator type.
Definition: sparse_set.hpp:298
+
entt::basic_sparse_set::size
size_type size() const
Returns the number of elements in a sparse set.
Definition: sparse_set.hpp:465
+
entt::basic_sparse_set::contains
bool contains(const entity_type entt) const
Checks if a sparse set contains an entity.
Definition: sparse_set.hpp:576
+
entt::basic_sparse_set::data
pointer data() const
Direct access to the internal packed array.
Definition: sparse_set.hpp:481
+
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:234
+
entt::basic_storage::emplace
value_type & emplace(const entity_type entt, Args &&...args)
Assigns an entity to a storage and constructs its object.
Definition: storage.hpp:661
+
entt::basic_storage::get
const value_type & get(const entity_type entt) const
Returns the object assigned to an entity.
Definition: storage.hpp:625
+
entt::delegate
Basic delegate implementation.
Definition: delegate.hpp:67
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::entity
entity
Default entity identifier.
Definition: fwd.hpp:47
entt::collector
constexpr basic_collector collector
Variable template used to ease the definition of collectors.
Definition: observer.hpp:113
entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >::where
static constexpr auto where(exclude_t< NoneOf... >={})
Updates the filter of the last added matcher.
Definition: observer.hpp:106
diff --git a/organizer_8hpp_source.html b/organizer_8hpp_source.html index e6271e8c2..41e5eff63 100644 --- a/organizer_8hpp_source.html +++ b/organizer_8hpp_source.html @@ -22,7 +22,7 @@ @@ -78,7 +78,7 @@ $(function() {
6 #include <type_traits>
7 #include <utility>
8 #include <vector>
-
9 #include "../container/dense_hash_map.hpp"
+
9 #include "../container/dense_map.hpp"
10 #include "../core/type_info.hpp"
11 #include "../core/type_traits.hpp"
12 #include "../core/utility.hpp"
@@ -132,355 +132,353 @@ $(function() {
65  : unpack_type<basic_view<Entity, get_t<Component...>, exclude_t<Exclude...>>, type_list<Override...>> {};
66 
67 template<typename, typename>
-
68 struct resource;
+
68 struct resource_traits;
69 
70 template<typename... Args, typename... Req>
-
71 struct resource<type_list<Args...>, type_list<Req...>> {
+
71 struct resource_traits<type_list<Args...>, type_list<Req...>> {
72  using args = type_list<std::remove_const_t<Args>...>;
73  using ro = type_list_cat_t<typename unpack_type<Args, type_list<Req...>>::ro..., typename unpack_type<Req, type_list<>>::ro...>;
74  using rw = type_list_cat_t<typename unpack_type<Args, type_list<Req...>>::rw..., typename unpack_type<Req, type_list<>>::rw...>;
75 };
76 
77 template<typename... Req, typename Ret, typename... Args>
-
78 resource<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> free_function_to_resource(Ret (*)(Args...));
+
78 resource_traits<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> free_function_to_resource_traits(Ret (*)(Args...));
79 
80 template<typename... Req, typename Ret, typename Type, typename... Args>
-
81 resource<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> constrained_function_to_resource(Ret (*)(Type &, Args...));
+
81 resource_traits<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> constrained_function_to_resource_traits(Ret (*)(Type &, Args...));
82 
83 template<typename... Req, typename Ret, typename Class, typename... Args>
-
84 resource<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> constrained_function_to_resource(Ret (Class::*)(Args...));
+
84 resource_traits<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> constrained_function_to_resource_traits(Ret (Class::*)(Args...));
85 
86 template<typename... Req, typename Ret, typename Class, typename... Args>
-
87 resource<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> constrained_function_to_resource(Ret (Class::*)(Args...) const);
+
87 resource_traits<type_list<std::remove_reference_t<Args>...>, type_list<Req...>> constrained_function_to_resource_traits(Ret (Class::*)(Args...) const);
88 
-
89 template<typename... Req>
-
90 resource<type_list<>, type_list<Req...>> to_resource();
-
91 
-
92 } // namespace internal
-
93 
-
110 template<typename Entity>
-
111 class basic_organizer final {
-
112  using callback_type = void(const void *, basic_registry<Entity> &);
-
113  using prepare_type = void(basic_registry<Entity> &);
-
114  using dependency_type = std::size_t(const bool, const type_info **, const std::size_t);
-
115 
-
116  struct vertex_data final {
-
117  std::size_t ro_count{};
-
118  std::size_t rw_count{};
-
119  const char *name{};
-
120  const void *payload{};
-
121  callback_type *callback{};
-
122  dependency_type *dependency;
-
123  prepare_type *prepare{};
-
124  const type_info *info{};
-
125  };
-
126 
-
127  template<typename Type>
-
128  [[nodiscard]] static decltype(auto) extract(basic_registry<Entity> &reg) {
-
129  if constexpr(std::is_same_v<Type, basic_registry<Entity>>) {
-
130  return reg;
-
131  } else if constexpr(internal::is_view_v<Type>) {
-
132  return as_view{reg};
-
133  } else {
-
134  return reg.template ctx_or_set<std::remove_reference_t<Type>>();
-
135  }
-
136  }
-
137 
-
138  template<typename... Args>
-
139  [[nodiscard]] static auto to_args(basic_registry<Entity> &reg, type_list<Args...>) {
-
140  return std::tuple<decltype(extract<Args>(reg))...>(extract<Args>(reg)...);
-
141  }
-
142 
-
143  template<typename... Type>
-
144  static std::size_t fill_dependencies(type_list<Type...>, [[maybe_unused]] const type_info **buffer, [[maybe_unused]] const std::size_t count) {
-
145  if constexpr(sizeof...(Type) == 0u) {
-
146  return {};
-
147  } else {
-
148  const type_info *info[sizeof...(Type)]{&type_id<Type>()...};
-
149  const auto length = (std::min)(count, sizeof...(Type));
-
150  std::copy_n(info, length, buffer);
-
151  return length;
-
152  }
-
153  }
-
154 
-
155  template<typename... RO, typename... RW>
-
156  void track_dependencies(std::size_t index, const bool requires_registry, type_list<RO...>, type_list<RW...>) {
-
157  dependencies[type_hash<basic_registry<Entity>>::value()].emplace_back(index, requires_registry || (sizeof...(RO) + sizeof...(RW) == 0u));
-
158  (dependencies[type_hash<RO>::value()].emplace_back(index, false), ...);
-
159  (dependencies[type_hash<RW>::value()].emplace_back(index, true), ...);
-
160  }
-
161 
-
162  [[nodiscard]] std::vector<bool> adjacency_matrix() {
-
163  const auto length = vertices.size();
-
164  std::vector<bool> edges(length * length, false);
-
165 
-
166  // creates the ajacency matrix
-
167  for(const auto &deps: dependencies) {
-
168  const auto last = deps.second.cend();
-
169  auto it = deps.second.cbegin();
-
170 
-
171  while(it != last) {
-
172  if(it->second) {
-
173  // rw item
-
174  if(auto curr = it++; it != last) {
-
175  if(it->second) {
-
176  edges[curr->first * length + it->first] = true;
-
177  } else {
-
178  if(const auto next = std::find_if(it, last, [](const auto &elem) { return elem.second; }); next != last) {
-
179  for(; it != next; ++it) {
-
180  edges[curr->first * length + it->first] = true;
-
181  edges[it->first * length + next->first] = true;
-
182  }
-
183  } else {
-
184  for(; it != next; ++it) {
-
185  edges[curr->first * length + it->first] = true;
-
186  }
-
187  }
-
188  }
-
189  }
-
190  } else {
-
191  // ro item, possibly only on first iteration
-
192  if(const auto next = std::find_if(it, last, [](const auto &elem) { return elem.second; }); next != last) {
-
193  for(; it != next; ++it) {
-
194  edges[it->first * length + next->first] = true;
-
195  }
-
196  } else {
-
197  it = last;
-
198  }
-
199  }
-
200  }
-
201  }
-
202 
-
203  // computes the transitive closure
-
204  for(std::size_t vk{}; vk < length; ++vk) {
-
205  for(std::size_t vi{}; vi < length; ++vi) {
-
206  for(std::size_t vj{}; vj < length; ++vj) {
-
207  edges[vi * length + vj] = edges[vi * length + vj] || (edges[vi * length + vk] && edges[vk * length + vj]);
-
208  }
-
209  }
-
210  }
-
211 
-
212  // applies the transitive reduction
-
213  for(std::size_t vert{}; vert < length; ++vert) {
-
214  edges[vert * length + vert] = false;
-
215  }
-
216 
-
217  for(std::size_t vj{}; vj < length; ++vj) {
-
218  for(std::size_t vi{}; vi < length; ++vi) {
-
219  if(edges[vi * length + vj]) {
-
220  for(std::size_t vk{}; vk < length; ++vk) {
-
221  if(edges[vj * length + vk]) {
-
222  edges[vi * length + vk] = false;
-
223  }
-
224  }
-
225  }
-
226  }
-
227  }
+
89 } // namespace internal
+
90 
+
107 template<typename Entity>
+
108 class basic_organizer final {
+
109  using callback_type = void(const void *, basic_registry<Entity> &);
+
110  using prepare_type = void(basic_registry<Entity> &);
+
111  using dependency_type = std::size_t(const bool, const type_info **, const std::size_t);
+
112 
+
113  struct vertex_data final {
+
114  std::size_t ro_count{};
+
115  std::size_t rw_count{};
+
116  const char *name{};
+
117  const void *payload{};
+
118  callback_type *callback{};
+
119  dependency_type *dependency;
+
120  prepare_type *prepare{};
+
121  const type_info *info{};
+
122  };
+
123 
+
124  template<typename Type>
+
125  [[nodiscard]] static decltype(auto) extract(basic_registry<Entity> &reg) {
+
126  if constexpr(std::is_same_v<Type, basic_registry<Entity>>) {
+
127  return reg;
+
128  } else if constexpr(internal::is_view_v<Type>) {
+
129  return as_view{reg};
+
130  } else {
+
131  return reg.ctx().template emplace<std::remove_reference_t<Type>>();
+
132  }
+
133  }
+
134 
+
135  template<typename... Args>
+
136  [[nodiscard]] static auto to_args(basic_registry<Entity> &reg, type_list<Args...>) {
+
137  return std::tuple<decltype(extract<Args>(reg))...>(extract<Args>(reg)...);
+
138  }
+
139 
+
140  template<typename... Type>
+
141  static std::size_t fill_dependencies(type_list<Type...>, [[maybe_unused]] const type_info **buffer, [[maybe_unused]] const std::size_t count) {
+
142  if constexpr(sizeof...(Type) == 0u) {
+
143  return {};
+
144  } else {
+
145  const type_info *info[sizeof...(Type)]{&type_id<Type>()...};
+
146  const auto length = (std::min)(count, sizeof...(Type));
+
147  std::copy_n(info, length, buffer);
+
148  return length;
+
149  }
+
150  }
+
151 
+
152  template<typename... RO, typename... RW>
+
153  void track_dependencies(std::size_t index, const bool requires_registry, type_list<RO...>, type_list<RW...>) {
+
154  dependencies[type_hash<basic_registry<Entity>>::value()].emplace_back(index, requires_registry || (sizeof...(RO) + sizeof...(RW) == 0u));
+
155  (dependencies[type_hash<RO>::value()].emplace_back(index, false), ...);
+
156  (dependencies[type_hash<RW>::value()].emplace_back(index, true), ...);
+
157  }
+
158 
+
159  [[nodiscard]] std::vector<bool> adjacency_matrix() {
+
160  const auto length = vertices.size();
+
161  std::vector<bool> edges(length * length, false);
+
162 
+
163  // creates the adjacency matrix
+
164  for(const auto &deps: dependencies) {
+
165  const auto last = deps.second.cend();
+
166  auto it = deps.second.cbegin();
+
167 
+
168  while(it != last) {
+
169  if(it->second) {
+
170  // rw item
+
171  if(auto curr = it++; it != last) {
+
172  if(it->second) {
+
173  edges[curr->first * length + it->first] = true;
+
174  } else {
+
175  if(const auto next = std::find_if(it, last, [](const auto &elem) { return elem.second; }); next != last) {
+
176  for(; it != next; ++it) {
+
177  edges[curr->first * length + it->first] = true;
+
178  edges[it->first * length + next->first] = true;
+
179  }
+
180  } else {
+
181  for(; it != next; ++it) {
+
182  edges[curr->first * length + it->first] = true;
+
183  }
+
184  }
+
185  }
+
186  }
+
187  } else {
+
188  // ro item, possibly only on first iteration
+
189  if(const auto next = std::find_if(it, last, [](const auto &elem) { return elem.second; }); next != last) {
+
190  for(; it != next; ++it) {
+
191  edges[it->first * length + next->first] = true;
+
192  }
+
193  } else {
+
194  it = last;
+
195  }
+
196  }
+
197  }
+
198  }
+
199 
+
200  // computes the transitive closure
+
201  for(std::size_t vk{}; vk < length; ++vk) {
+
202  for(std::size_t vi{}; vi < length; ++vi) {
+
203  for(std::size_t vj{}; vj < length; ++vj) {
+
204  edges[vi * length + vj] = edges[vi * length + vj] || (edges[vi * length + vk] && edges[vk * length + vj]);
+
205  }
+
206  }
+
207  }
+
208 
+
209  // applies the transitive reduction
+
210  for(std::size_t vert{}; vert < length; ++vert) {
+
211  edges[vert * length + vert] = false;
+
212  }
+
213 
+
214  for(std::size_t vj{}; vj < length; ++vj) {
+
215  for(std::size_t vi{}; vi < length; ++vi) {
+
216  if(edges[vi * length + vj]) {
+
217  for(std::size_t vk{}; vk < length; ++vk) {
+
218  if(edges[vj * length + vk]) {
+
219  edges[vi * length + vk] = false;
+
220  }
+
221  }
+
222  }
+
223  }
+
224  }
+
225 
+
226  return edges;
+
227  }
228 
-
229  return edges;
-
230  }
-
231 
-
232 public:
-
234  using entity_type = Entity;
-
236  using size_type = std::size_t;
-
238  using function_type = callback_type;
-
239 
-
241  struct vertex {
-
248  vertex(const bool vtype, vertex_data data, std::vector<std::size_t> edges)
-
249  : is_top_level{vtype},
-
250  node{std::move(data)},
-
251  reachable{std::move(edges)} {}
-
252 
-
260  size_type ro_dependency(const type_info **buffer, const std::size_t length) const ENTT_NOEXCEPT {
-
261  return node.dependency(false, buffer, length);
-
262  }
-
263 
-
271  size_type rw_dependency(const type_info **buffer, const std::size_t length) const ENTT_NOEXCEPT {
-
272  return node.dependency(true, buffer, length);
-
273  }
-
274 
-
279  size_type ro_count() const ENTT_NOEXCEPT {
-
280  return node.ro_count;
-
281  }
-
282 
-
287  size_type rw_count() const ENTT_NOEXCEPT {
-
288  return node.rw_count;
-
289  }
-
290 
-
295  bool top_level() const ENTT_NOEXCEPT {
-
296  return is_top_level;
-
297  }
-
298 
-
303  const type_info &info() const ENTT_NOEXCEPT {
-
304  return *node.info;
-
305  }
-
306 
-
311  const char *name() const ENTT_NOEXCEPT {
-
312  return node.name;
-
313  }
-
314 
-
319  function_type *callback() const ENTT_NOEXCEPT {
-
320  return node.callback;
-
321  }
-
322 
-
327  const void *data() const ENTT_NOEXCEPT {
-
328  return node.payload;
-
329  }
-
330 
-
335  const std::vector<std::size_t> &children() const ENTT_NOEXCEPT {
-
336  return reachable;
-
337  }
-
338 
-
344  void prepare(basic_registry<entity_type> &reg) const {
-
345  node.prepare ? node.prepare(reg) : void();
-
346  }
-
347 
-
348  private:
-
349  bool is_top_level;
-
350  vertex_data node;
-
351  std::vector<std::size_t> reachable;
-
352  };
-
353 
-
360  template<auto Candidate, typename... Req>
-
361  void emplace(const char *name = nullptr) {
-
362  using resource_type = decltype(internal::free_function_to_resource<Req...>(Candidate));
-
363  constexpr auto requires_registry = type_list_contains_v<typename resource_type::args, basic_registry<entity_type>>;
-
364 
-
365  callback_type *callback = +[](const void *, basic_registry<entity_type> &reg) {
-
366  std::apply(Candidate, to_args(reg, typename resource_type::args{}));
-
367  };
-
368 
-
369  vertex_data vdata{
-
370  resource_type::ro::size,
-
371  resource_type::rw::size,
-
372  name,
-
373  nullptr,
-
374  callback,
-
375  +[](const bool rw, const type_info **buffer, const std::size_t length) { return rw ? fill_dependencies(typename resource_type::rw{}, buffer, length) : fill_dependencies(typename resource_type::ro{}, buffer, length); },
-
376  +[](basic_registry<entity_type> &reg) { void(to_args(reg, typename resource_type::args{})); },
-
377  &type_id<std::integral_constant<decltype(Candidate), Candidate>>()};
-
378 
-
379  track_dependencies(vertices.size(), requires_registry, typename resource_type::ro{}, typename resource_type::rw{});
-
380  vertices.push_back(std::move(vdata));
-
381  }
-
382 
-
392  template<auto Candidate, typename... Req, typename Type>
-
393  void emplace(Type &value_or_instance, const char *name = nullptr) {
-
394  using resource_type = decltype(internal::constrained_function_to_resource<Req...>(Candidate));
-
395  constexpr auto requires_registry = type_list_contains_v<typename resource_type::args, basic_registry<entity_type>>;
-
396 
-
397  callback_type *callback = +[](const void *payload, basic_registry<entity_type> &reg) {
-
398  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
-
399  std::apply(Candidate, std::tuple_cat(std::forward_as_tuple(*curr), to_args(reg, typename resource_type::args{})));
-
400  };
-
401 
-
402  vertex_data vdata{
-
403  resource_type::ro::size,
-
404  resource_type::rw::size,
-
405  name,
-
406  &value_or_instance,
-
407  callback,
-
408  +[](const bool rw, const type_info **buffer, const std::size_t length) { return rw ? fill_dependencies(typename resource_type::rw{}, buffer, length) : fill_dependencies(typename resource_type::ro{}, buffer, length); },
-
409  +[](basic_registry<entity_type> &reg) { void(to_args(reg, typename resource_type::args{})); },
-
410  &type_id<std::integral_constant<decltype(Candidate), Candidate>>()};
-
411 
-
412  track_dependencies(vertices.size(), requires_registry, typename resource_type::ro{}, typename resource_type::rw{});
-
413  vertices.push_back(std::move(vdata));
-
414  }
-
415 
-
424  template<typename... Req>
-
425  void emplace(function_type *func, const void *payload = nullptr, const char *name = nullptr) {
-
426  using resource_type = internal::resource<type_list<>, type_list<Req...>>;
-
427  track_dependencies(vertices.size(), true, typename resource_type::ro{}, typename resource_type::rw{});
-
428 
-
429  vertex_data vdata{
-
430  resource_type::ro::size,
-
431  resource_type::rw::size,
-
432  name,
-
433  payload,
-
434  func,
-
435  +[](const bool rw, const type_info **buffer, const std::size_t length) { return rw ? fill_dependencies(typename resource_type::rw{}, buffer, length) : fill_dependencies(typename resource_type::ro{}, buffer, length); },
-
436  nullptr,
-
437  &type_id<void>()};
+
229 public:
+
231  using entity_type = Entity;
+
233  using size_type = std::size_t;
+
235  using function_type = callback_type;
+
236 
+
238  struct vertex {
+
245  vertex(const bool vtype, vertex_data data, std::vector<std::size_t> edges)
+
246  : is_top_level{vtype},
+
247  node{std::move(data)},
+
248  reachable{std::move(edges)} {}
+
249 
+
257  size_type ro_dependency(const type_info **buffer, const std::size_t length) const ENTT_NOEXCEPT {
+
258  return node.dependency(false, buffer, length);
+
259  }
+
260 
+
268  size_type rw_dependency(const type_info **buffer, const std::size_t length) const ENTT_NOEXCEPT {
+
269  return node.dependency(true, buffer, length);
+
270  }
+
271 
+
276  size_type ro_count() const ENTT_NOEXCEPT {
+
277  return node.ro_count;
+
278  }
+
279 
+
284  size_type rw_count() const ENTT_NOEXCEPT {
+
285  return node.rw_count;
+
286  }
+
287 
+
292  bool top_level() const ENTT_NOEXCEPT {
+
293  return is_top_level;
+
294  }
+
295 
+
300  const type_info &info() const ENTT_NOEXCEPT {
+
301  return *node.info;
+
302  }
+
303 
+
308  const char *name() const ENTT_NOEXCEPT {
+
309  return node.name;
+
310  }
+
311 
+
316  function_type *callback() const ENTT_NOEXCEPT {
+
317  return node.callback;
+
318  }
+
319 
+
324  const void *data() const ENTT_NOEXCEPT {
+
325  return node.payload;
+
326  }
+
327 
+
332  const std::vector<std::size_t> &children() const ENTT_NOEXCEPT {
+
333  return reachable;
+
334  }
+
335 
+
341  void prepare(basic_registry<entity_type> &reg) const {
+
342  node.prepare ? node.prepare(reg) : void();
+
343  }
+
344 
+
345  private:
+
346  bool is_top_level;
+
347  vertex_data node;
+
348  std::vector<std::size_t> reachable;
+
349  };
+
350 
+
357  template<auto Candidate, typename... Req>
+
358  void emplace(const char *name = nullptr) {
+
359  using resource_type = decltype(internal::free_function_to_resource_traits<Req...>(Candidate));
+
360  constexpr auto requires_registry = type_list_contains_v<typename resource_type::args, basic_registry<entity_type>>;
+
361 
+
362  callback_type *callback = +[](const void *, basic_registry<entity_type> &reg) {
+
363  std::apply(Candidate, to_args(reg, typename resource_type::args{}));
+
364  };
+
365 
+
366  vertex_data vdata{
+
367  resource_type::ro::size,
+
368  resource_type::rw::size,
+
369  name,
+
370  nullptr,
+
371  callback,
+
372  +[](const bool rw, const type_info **buffer, const std::size_t length) { return rw ? fill_dependencies(typename resource_type::rw{}, buffer, length) : fill_dependencies(typename resource_type::ro{}, buffer, length); },
+
373  +[](basic_registry<entity_type> &reg) { void(to_args(reg, typename resource_type::args{})); },
+
374  &type_id<std::integral_constant<decltype(Candidate), Candidate>>()};
+
375 
+
376  track_dependencies(vertices.size(), requires_registry, typename resource_type::ro{}, typename resource_type::rw{});
+
377  vertices.push_back(std::move(vdata));
+
378  }
+
379 
+
389  template<auto Candidate, typename... Req, typename Type>
+
390  void emplace(Type &value_or_instance, const char *name = nullptr) {
+
391  using resource_type = decltype(internal::constrained_function_to_resource_traits<Req...>(Candidate));
+
392  constexpr auto requires_registry = type_list_contains_v<typename resource_type::args, basic_registry<entity_type>>;
+
393 
+
394  callback_type *callback = +[](const void *payload, basic_registry<entity_type> &reg) {
+
395  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
+
396  std::apply(Candidate, std::tuple_cat(std::forward_as_tuple(*curr), to_args(reg, typename resource_type::args{})));
+
397  };
+
398 
+
399  vertex_data vdata{
+
400  resource_type::ro::size,
+
401  resource_type::rw::size,
+
402  name,
+
403  &value_or_instance,
+
404  callback,
+
405  +[](const bool rw, const type_info **buffer, const std::size_t length) { return rw ? fill_dependencies(typename resource_type::rw{}, buffer, length) : fill_dependencies(typename resource_type::ro{}, buffer, length); },
+
406  +[](basic_registry<entity_type> &reg) { void(to_args(reg, typename resource_type::args{})); },
+
407  &type_id<std::integral_constant<decltype(Candidate), Candidate>>()};
+
408 
+
409  track_dependencies(vertices.size(), requires_registry, typename resource_type::ro{}, typename resource_type::rw{});
+
410  vertices.push_back(std::move(vdata));
+
411  }
+
412 
+
421  template<typename... Req>
+
422  void emplace(function_type *func, const void *payload = nullptr, const char *name = nullptr) {
+
423  using resource_type = internal::resource_traits<type_list<>, type_list<Req...>>;
+
424  track_dependencies(vertices.size(), true, typename resource_type::ro{}, typename resource_type::rw{});
+
425 
+
426  vertex_data vdata{
+
427  resource_type::ro::size,
+
428  resource_type::rw::size,
+
429  name,
+
430  payload,
+
431  func,
+
432  +[](const bool rw, const type_info **buffer, const std::size_t length) { return rw ? fill_dependencies(typename resource_type::rw{}, buffer, length) : fill_dependencies(typename resource_type::ro{}, buffer, length); },
+
433  nullptr,
+
434  &type_id<void>()};
+
435 
+
436  vertices.push_back(std::move(vdata));
+
437  }
438 
-
439  vertices.push_back(std::move(vdata));
-
440  }
-
441 
-
446  std::vector<vertex> graph() {
-
447  const auto edges = adjacency_matrix();
-
448 
-
449  // creates the adjacency list
-
450  std::vector<vertex> adjacency_list{};
-
451  adjacency_list.reserve(vertices.size());
-
452 
-
453  for(std::size_t col{}, length = vertices.size(); col < length; ++col) {
-
454  std::vector<std::size_t> reachable{};
-
455  const auto row = col * length;
-
456  bool is_top_level = true;
-
457 
-
458  for(std::size_t next{}; next < length; ++next) {
-
459  if(edges[row + next]) {
-
460  reachable.push_back(next);
-
461  }
-
462  }
-
463 
-
464  for(std::size_t next{}; next < length && is_top_level; ++next) {
-
465  is_top_level = !edges[next * length + col];
-
466  }
+
443  std::vector<vertex> graph() {
+
444  const auto edges = adjacency_matrix();
+
445 
+
446  // creates the adjacency list
+
447  std::vector<vertex> adjacency_list{};
+
448  adjacency_list.reserve(vertices.size());
+
449 
+
450  for(std::size_t col{}, length = vertices.size(); col < length; ++col) {
+
451  std::vector<std::size_t> reachable{};
+
452  const auto row = col * length;
+
453  bool is_top_level = true;
+
454 
+
455  for(std::size_t next{}; next < length; ++next) {
+
456  if(edges[row + next]) {
+
457  reachable.push_back(next);
+
458  }
+
459  }
+
460 
+
461  for(std::size_t next{}; next < length && is_top_level; ++next) {
+
462  is_top_level = !edges[next * length + col];
+
463  }
+
464 
+
465  adjacency_list.emplace_back(is_top_level, vertices[col], std::move(reachable));
+
466  }
467 
-
468  adjacency_list.emplace_back(is_top_level, vertices[col], std::move(reachable));
-
469  }
+
468  return adjacency_list;
+
469  }
470 
-
471  return adjacency_list;
-
472  }
-
473 
-
475  void clear() {
-
476  dependencies.clear();
-
477  vertices.clear();
-
478  }
-
479 
-
480 private:
-
481  dense_hash_map<id_type, std::vector<std::pair<std::size_t, bool>>, identity> dependencies;
-
482  std::vector<vertex_data> vertices;
-
483 };
-
484 
-
485 } // namespace entt
-
486 
-
487 #endif
-
entt::basic_organizer
Utility class for creating a static task graph.
Definition: organizer.hpp:111
-
entt::basic_organizer::entity_type
Entity entity_type
Underlying entity identifier.
Definition: organizer.hpp:234
-
entt::basic_organizer::function_type
callback_type function_type
Raw task function type.
Definition: organizer.hpp:238
-
entt::basic_organizer::emplace
void emplace(const char *name=nullptr)
Adds a free function to the task list.
Definition: organizer.hpp:361
-
entt::basic_organizer::graph
std::vector< vertex > graph()
Generates a task graph for the current content.
Definition: organizer.hpp:446
-
entt::basic_organizer::clear
void clear()
Erases all elements from a container.
Definition: organizer.hpp:475
-
entt::basic_organizer::emplace
void emplace(function_type *func, const void *payload=nullptr, const char *name=nullptr)
Adds an user defined function with optional payload to the task list.
Definition: organizer.hpp:425
-
entt::basic_organizer::emplace
void emplace(Type &value_or_instance, const char *name=nullptr)
Adds a free function with payload or a member function with an instance to the task list.
Definition: organizer.hpp:393
-
entt::basic_organizer::size_type
std::size_t size_type
Unsigned integer type.
Definition: organizer.hpp:236
-
entt::basic_registry
Fast and reliable entity-component system.
Definition: registry.hpp:173
-
entt::dense_hash_map
Associative container for key-value pairs with unique keys.
Definition: dense_hash_map.hpp:240
-
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
472  void clear() {
+
473  dependencies.clear();
+
474  vertices.clear();
+
475  }
+
476 
+
477 private:
+
478  dense_map<id_type, std::vector<std::pair<std::size_t, bool>>, identity> dependencies;
+
479  std::vector<vertex_data> vertices;
+
480 };
+
481 
+
482 } // namespace entt
+
483 
+
484 #endif
+
entt::basic_organizer
Utility class for creating a static task graph.
Definition: organizer.hpp:108
+
entt::basic_organizer::entity_type
Entity entity_type
Underlying entity identifier.
Definition: organizer.hpp:231
+
entt::basic_organizer::function_type
callback_type function_type
Raw task function type.
Definition: organizer.hpp:235
+
entt::basic_organizer::emplace
void emplace(const char *name=nullptr)
Adds a free function to the task list.
Definition: organizer.hpp:358
+
entt::basic_organizer::graph
std::vector< vertex > graph()
Generates a task graph for the current content.
Definition: organizer.hpp:443
+
entt::basic_organizer::clear
void clear()
Erases all elements from a container.
Definition: organizer.hpp:472
+
entt::basic_organizer::emplace
void emplace(function_type *func, const void *payload=nullptr, const char *name=nullptr)
Adds an user defined function with optional payload to the task list.
Definition: organizer.hpp:422
+
entt::basic_organizer::emplace
void emplace(Type &value_or_instance, const char *name=nullptr)
Adds a free function with payload or a member function with an instance to the task list.
Definition: organizer.hpp:390
+
entt::basic_organizer::size_type
std::size_t size_type
Unsigned integer type.
Definition: organizer.hpp:233
+
entt::basic_registry
Fast and reliable entity-component system.
Definition: registry.hpp:221
+
entt::basic_registry::ctx
context & ctx()
Returns the context object, that is, a general purpose container.
Definition: registry.hpp:1476
+
entt::dense_map
Associative container for key-value pairs with unique keys.
Definition: dense_map.hpp:265
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::basic_view
basic_view(Storage &...storage) -> basic_view< std::common_type_t< typename Storage::entity_type... >, get_t< constness_as_t< typename Storage::value_type, Storage >... >, exclude_t<>>
Deduction guide.
-
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:256
+
entt::type_id
const type_info & type_id()
Returns the type info object associated to a given type.
Definition: type_info.hpp:257
entt::type_list_cat_t
typename type_list_cat< List... >::type type_list_cat_t
Helper type.
Definition: type_traits.hpp:199
-
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:645
+
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:618
entt::as_view
Converts a registry to a view.
Definition: helper.hpp:19
-
entt::basic_organizer::vertex
Vertex type of a task graph defined as an adjacency list.
Definition: organizer.hpp:241
-
entt::basic_organizer::vertex::rw_count
size_type rw_count() const
Returns the number of writable resources of a vertex.
Definition: organizer.hpp:287
-
entt::basic_organizer::vertex::top_level
bool top_level() const
Checks if a vertex is also a top-level one.
Definition: organizer.hpp:295
-
entt::basic_organizer::vertex::rw_dependency
size_type rw_dependency(const type_info **buffer, const std::size_t length) const
Fills a buffer with the type info objects for the read-only resources of a vertex.
Definition: organizer.hpp:271
-
entt::basic_organizer::vertex::ro_count
size_type ro_count() const
Returns the number of read-only resources of a vertex.
Definition: organizer.hpp:279
-
entt::basic_organizer::vertex::ro_dependency
size_type ro_dependency(const type_info **buffer, const std::size_t length) const
Fills a buffer with the type info objects for the writable resources of a vertex.
Definition: organizer.hpp:260
-
entt::basic_organizer::vertex::data
const void * data() const
Returns the payload associated with a vertex, if any.
Definition: organizer.hpp:327
-
entt::basic_organizer::vertex::children
const std::vector< std::size_t > & children() const
Returns the list of nodes reachable from a given vertex.
Definition: organizer.hpp:335
-
entt::basic_organizer::vertex::prepare
void prepare(basic_registry< entity_type > &reg) const
Prepares a registry and assures that all required resources are properly instantiated before using th...
Definition: organizer.hpp:344
-
entt::basic_organizer::vertex::vertex
vertex(const bool vtype, vertex_data data, std::vector< std::size_t > edges)
Constructs a vertex of the task graph.
Definition: organizer.hpp:248
-
entt::basic_organizer::vertex::name
const char * name() const
Returns a user defined name associated with a vertex, if any.
Definition: organizer.hpp:311
-
entt::basic_organizer::vertex::info
const type_info & info() const
Returns a type info object associated with a vertex.
Definition: organizer.hpp:303
-
entt::basic_organizer::vertex::callback
function_type * callback() const
Returns the function associated with a vertex.
Definition: organizer.hpp:319
+
entt::basic_organizer::vertex
Vertex type of a task graph defined as an adjacency list.
Definition: organizer.hpp:238
+
entt::basic_organizer::vertex::rw_count
size_type rw_count() const
Returns the number of writable resources of a vertex.
Definition: organizer.hpp:284
+
entt::basic_organizer::vertex::top_level
bool top_level() const
Checks if a vertex is also a top-level one.
Definition: organizer.hpp:292
+
entt::basic_organizer::vertex::rw_dependency
size_type rw_dependency(const type_info **buffer, const std::size_t length) const
Fills a buffer with the type info objects for the read-only resources of a vertex.
Definition: organizer.hpp:268
+
entt::basic_organizer::vertex::ro_count
size_type ro_count() const
Returns the number of read-only resources of a vertex.
Definition: organizer.hpp:276
+
entt::basic_organizer::vertex::ro_dependency
size_type ro_dependency(const type_info **buffer, const std::size_t length) const
Fills a buffer with the type info objects for the writable resources of a vertex.
Definition: organizer.hpp:257
+
entt::basic_organizer::vertex::data
const void * data() const
Returns the payload associated with a vertex, if any.
Definition: organizer.hpp:324
+
entt::basic_organizer::vertex::children
const std::vector< std::size_t > & children() const
Returns the list of nodes reachable from a given vertex.
Definition: organizer.hpp:332
+
entt::basic_organizer::vertex::prepare
void prepare(basic_registry< entity_type > &reg) const
Prepares a registry and assures that all required resources are properly instantiated before using th...
Definition: organizer.hpp:341
+
entt::basic_organizer::vertex::vertex
vertex(const bool vtype, vertex_data data, std::vector< std::size_t > edges)
Constructs a vertex of the task graph.
Definition: organizer.hpp:245
+
entt::basic_organizer::vertex::name
const char * name() const
Returns a user defined name associated with a vertex, if any.
Definition: organizer.hpp:308
+
entt::basic_organizer::vertex::info
const type_info & info() const
Returns a type info object associated with a vertex.
Definition: organizer.hpp:300
+
entt::basic_organizer::vertex::callback
function_type * callback() const
Returns the function associated with a vertex.
Definition: organizer.hpp:316
entt::identity
Identity function object (waiting for C++20).
Definition: utility.hpp:10
entt::type_hash
Type hash.
Definition: type_info.hpp:100
entt::type_hash::value
static constexpr id_type value()
Returns the numeric representation of a given type.
Definition: type_info.hpp:109
+
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
entt::type_list
A class to use to push around lists of types, nothing more.
Definition: type_traits.hpp:110
diff --git a/pages.html b/pages.html index 5d3500b2a..07cd80f8f 100644 --- a/pages.html +++ b/pages.html @@ -22,7 +22,7 @@ diff --git a/pointer_8hpp_source.html b/pointer_8hpp_source.html index 62d56006b..950727961 100644 --- a/pointer_8hpp_source.html +++ b/pointer_8hpp_source.html @@ -22,7 +22,7 @@ @@ -98,7 +98,7 @@ $(function() {
46 } // namespace entt
47 
48 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::is_meta_pointer_like
Provides the member constant value to true if a given type is a pointer-like type from the point of v...
Definition: type_traits.hpp:36
diff --git a/policy_8hpp_source.html b/policy_8hpp_source.html index 55468e534..6edd16a37 100644 --- a/policy_8hpp_source.html +++ b/policy_8hpp_source.html @@ -22,7 +22,7 @@ @@ -100,7 +100,7 @@ $(function() {
64 } // namespace entt
65 
66 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::as_cref_t
Empty class type used to request the as cref policy.
Definition: policy.hpp:23
entt::as_is_t
Empty class type used to request the as-is policy.
Definition: policy.hpp:37
entt::as_ref_t
Empty class type used to request the as ref policy.
Definition: policy.hpp:9
diff --git a/poly_2fwd_8hpp_source.html b/poly_2fwd_8hpp_source.html index 9da7605df..122b17b0f 100644 --- a/poly_2fwd_8hpp_source.html +++ b/poly_2fwd_8hpp_source.html @@ -22,7 +22,7 @@ @@ -73,21 +73,22 @@ $(function() {
1 #ifndef ENTT_POLY_FWD_HPP
2 #define ENTT_POLY_FWD_HPP
3 
-
4 #include <type_traits>
-
5 
-
6 namespace entt {
-
7 
-
8 template<typename, std::size_t Len, std::size_t = alignof(typename std::aligned_storage_t<Len + !Len>)>
-
9 class basic_poly;
-
10 
-
15 template<typename Concept>
-
16 using poly = basic_poly<Concept, sizeof(double[2])>;
-
17 
-
18 } // namespace entt
-
19 
-
20 #endif
-
entt::basic_poly
Static polymorphism made simple and within everyone's reach.
Definition: poly.hpp:192
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
4 #include <cstdint>
+
5 #include <type_traits>
+
6 
+
7 namespace entt {
+
8 
+
9 template<typename, std::size_t Len = sizeof(double[2]), std::size_t = alignof(typename std::aligned_storage_t<Len + !Len>)>
+
10 class basic_poly;
+
11 
+
16 template<typename Concept>
+
17 using poly = basic_poly<Concept>;
+
18 
+
19 } // namespace entt
+
20 
+
21 #endif
+
entt::basic_poly
Static polymorphism made simple and within everyone's reach.
Definition: poly.hpp:193
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
diff --git a/poly_8hpp_source.html b/poly_8hpp_source.html index 958a5d94f..3480b0a84 100644 --- a/poly_8hpp_source.html +++ b/poly_8hpp_source.html @@ -22,7 +22,7 @@
@@ -90,10 +90,10 @@ $(function() {
23  template<class Type>
24  operator Type &&() const;
25 
-
33  template<auto Member, typename... Args>
+
33  template<std::size_t Member, typename... Args>
34  poly_inspector invoke(Args &&...args) const;
35 
-
37  template<auto Member, typename... Args>
+
37  template<std::size_t Member, typename... Args>
38  poly_inspector invoke(Args &&...args);
39 };
40 
@@ -117,11 +117,11 @@ $(function() {
64  static auto vtable_entry(Ret (inspector::*)(Args...) const) -> Ret (*)(const basic_any<Len, Align> &, Args...);
65 
66  template<auto... Candidate>
-
67  static auto make_vtable(value_list<Candidate...>)
+
67  static auto make_vtable(value_list<Candidate...>) ENTT_NOEXCEPT
68  -> decltype(std::make_tuple(vtable_entry(Candidate)...));
69 
70  template<typename... Func>
-
71  [[nodiscard]] static constexpr auto make_vtable(type_list<Func...>) {
+
71  [[nodiscard]] static constexpr auto make_vtable(type_list<Func...>) ENTT_NOEXCEPT {
72  if constexpr(sizeof...(Func) == 0u) {
73  return decltype(make_vtable(typename Concept::template impl<inspector>{})){};
74  } else if constexpr((std::is_function_v<Func> && ...)) {
@@ -130,7 +130,7 @@ $(function() {
77  }
78 
79  template<typename Type, auto Candidate, typename Ret, typename Any, typename... Args>
-
80  static void fill_vtable_entry(Ret (*&entry)(Any &, Args...)) {
+
80  static void fill_vtable_entry(Ret (*&entry)(Any &, Args...)) ENTT_NOEXCEPT {
81  if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Args...>) {
82  entry = +[](Any &, Args... args) -> Ret {
83  return std::invoke(Candidate, std::forward<Args>(args)...);
@@ -143,7 +143,7 @@ $(function() {
90  }
91 
92  template<typename Type, auto... Index>
-
93  [[nodiscard]] static auto fill_vtable(std::index_sequence<Index...>) {
+
93  [[nodiscard]] static auto fill_vtable(std::index_sequence<Index...>) ENTT_NOEXCEPT {
94  vtable_type impl{};
95  (fill_vtable_entry<Type, value_list_element_v<Index, typename Concept::template impl<Type>>>(std::get<Index>(impl)), ...);
96  return impl;
@@ -156,7 +156,7 @@ $(function() {
104  using type = std::conditional_t<is_mono_v, std::tuple_element_t<0u, vtable_type>, const vtable_type *>;
105 
111  template<typename Type>
-
112  [[nodiscard]] static type instance() {
+
112  [[nodiscard]] static type instance() ENTT_NOEXCEPT {
113  static_assert(std::is_same_v<Type, std::decay_t<Type>>, "Type differs from its decayed form");
114  static const vtable_type vtable = fill_vtable<Type>(std::make_index_sequence<Concept::template impl<Type>::size>{});
115 
@@ -170,7 +170,7 @@ $(function() {
123 
128 template<typename Poly>
129 struct poly_base {
-
138  template<auto Member, typename... Args>
+
138  template<std::size_t Member, typename... Args>
139  [[nodiscard]] decltype(auto) invoke(const poly_base &self, Args &&...args) const {
140  const auto &poly = static_cast<const Poly &>(self);
141 
@@ -181,133 +181,134 @@ $(function() {
146  }
147  }
148 
-
150  template<auto Member, typename... Args>
+
150  template<std::size_t Member, typename... Args>
151  [[nodiscard]] decltype(auto) invoke(poly_base &self, Args &&...args) {
152  auto &poly = static_cast<Poly &>(self);
153 
154  if constexpr(std::is_function_v<std::remove_pointer_t<decltype(poly.vtable)>>) {
-
155  return poly.vtable(poly.storage, std::forward<Args>(args)...);
-
156  } else {
-
157  return std::get<Member>(*poly.vtable)(poly.storage, std::forward<Args>(args)...);
-
158  }
-
159  }
-
160 };
-
161 
-
171 template<auto Member, typename Poly, typename... Args>
-
172 decltype(auto) poly_call(Poly &&self, Args &&...args) {
-
173  return std::forward<Poly>(self).template invoke<Member>(self, std::forward<Args>(args)...);
-
174 }
-
175 
-
191 template<typename Concept, std::size_t Len, std::size_t Align>
-
192 class basic_poly: private Concept::template type<poly_base<basic_poly<Concept, Len, Align>>> {
-
194  friend struct poly_base<basic_poly>;
-
195 
-
196 public:
-
198  using concept_type = typename Concept::template type<poly_base<basic_poly>>;
-
200  using vtable_type = typename poly_vtable<Concept, Len, Align>::type;
-
201 
-
203  basic_poly() ENTT_NOEXCEPT
-
204  : storage{},
-
205  vtable{} {}
-
206 
-
213  template<typename Type, typename... Args>
-
214  explicit basic_poly(std::in_place_type_t<Type>, Args &&...args)
-
215  : storage{std::in_place_type<Type>, std::forward<Args>(args)...},
-
216  vtable{poly_vtable<Concept, Len, Align>::template instance<std::remove_const_t<std::remove_reference_t<Type>>>()} {}
-
217 
-
223  template<typename Type, typename = std::enable_if_t<!std::is_same_v<std::remove_cv_t<std::remove_reference_t<Type>>, basic_poly>>>
-
224  basic_poly(Type &&value) ENTT_NOEXCEPT
-
225  : basic_poly{std::in_place_type<std::remove_cv_t<std::remove_reference_t<Type>>>, std::forward<Type>(value)} {}
-
226 
-
231  [[nodiscard]] const type_info &type() const ENTT_NOEXCEPT {
-
232  return storage.type();
-
233  }
-
234 
-
239  [[nodiscard]] const void *data() const ENTT_NOEXCEPT {
-
240  return storage.data();
-
241  }
-
242 
-
244  [[nodiscard]] void *data() ENTT_NOEXCEPT {
-
245  return storage.data();
-
246  }
-
247 
-
254  template<typename Type, typename... Args>
-
255  void emplace(Args &&...args) {
-
256  storage.template emplace<Type>(std::forward<Args>(args)...);
-
257  vtable = poly_vtable<Concept, Len, Align>::template instance<std::remove_const_t<std::remove_reference_t<Type>>>();
-
258  }
-
259 
-
261  void reset() {
-
262  storage.reset();
-
263  vtable = {};
-
264  }
-
265 
-
270  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
-
271  return static_cast<bool>(storage);
-
272  }
-
273 
-
278  [[nodiscard]] concept_type *operator->() ENTT_NOEXCEPT {
-
279  return this;
-
280  }
-
281 
-
283  [[nodiscard]] const concept_type *operator->() const ENTT_NOEXCEPT {
-
284  return this;
-
285  }
-
286 
-
291  [[nodiscard]] basic_poly as_ref() ENTT_NOEXCEPT {
-
292  basic_poly ref{};
-
293  ref.storage = storage.as_ref();
-
294  ref.vtable = vtable;
-
295  return ref;
-
296  }
-
297 
-
299  [[nodiscard]] basic_poly as_ref() const ENTT_NOEXCEPT {
-
300  basic_poly ref{};
-
301  ref.storage = storage.as_ref();
-
302  ref.vtable = vtable;
-
303  return ref;
-
304  }
-
305 
-
306 private:
-
307  basic_any<Len, Align> storage;
-
308  vtable_type vtable;
-
309 };
-
310 
-
311 } // namespace entt
-
312 
-
313 #endif
+
155  static_assert(Member == 0u, "Unknown member");
+
156  return poly.vtable(poly.storage, std::forward<Args>(args)...);
+
157  } else {
+
158  return std::get<Member>(*poly.vtable)(poly.storage, std::forward<Args>(args)...);
+
159  }
+
160  }
+
161 };
+
162 
+
172 template<std::size_t Member, typename Poly, typename... Args>
+
173 decltype(auto) poly_call(Poly &&self, Args &&...args) {
+
174  return std::forward<Poly>(self).template invoke<Member>(self, std::forward<Args>(args)...);
+
175 }
+
176 
+
192 template<typename Concept, std::size_t Len, std::size_t Align>
+
193 class basic_poly: private Concept::template type<poly_base<basic_poly<Concept, Len, Align>>> {
+
195  friend struct poly_base<basic_poly>;
+
196 
+
197 public:
+
199  using concept_type = typename Concept::template type<poly_base<basic_poly>>;
+
201  using vtable_type = typename poly_vtable<Concept, Len, Align>::type;
+
202 
+
204  basic_poly() ENTT_NOEXCEPT
+
205  : storage{},
+
206  vtable{} {}
+
207 
+
214  template<typename Type, typename... Args>
+
215  explicit basic_poly(std::in_place_type_t<Type>, Args &&...args)
+
216  : storage{std::in_place_type<Type>, std::forward<Args>(args)...},
+
217  vtable{poly_vtable<Concept, Len, Align>::template instance<std::remove_cv_t<std::remove_reference_t<Type>>>()} {}
+
218 
+
224  template<typename Type, typename = std::enable_if_t<!std::is_same_v<std::remove_cv_t<std::remove_reference_t<Type>>, basic_poly>>>
+
225  basic_poly(Type &&value) ENTT_NOEXCEPT
+
226  : basic_poly{std::in_place_type<std::remove_cv_t<std::remove_reference_t<Type>>>, std::forward<Type>(value)} {}
+
227 
+
232  [[nodiscard]] const type_info &type() const ENTT_NOEXCEPT {
+
233  return storage.type();
+
234  }
+
235 
+
240  [[nodiscard]] const void *data() const ENTT_NOEXCEPT {
+
241  return storage.data();
+
242  }
+
243 
+
245  [[nodiscard]] void *data() ENTT_NOEXCEPT {
+
246  return storage.data();
+
247  }
+
248 
+
255  template<typename Type, typename... Args>
+
256  void emplace(Args &&...args) {
+
257  storage.template emplace<Type>(std::forward<Args>(args)...);
+
258  vtable = poly_vtable<Concept, Len, Align>::template instance<std::remove_cv_t<std::remove_reference_t<Type>>>();
+
259  }
+
260 
+
262  void reset() {
+
263  storage.reset();
+
264  vtable = {};
+
265  }
+
266 
+
271  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
+
272  return static_cast<bool>(storage);
+
273  }
+
274 
+
279  [[nodiscard]] concept_type *operator->() ENTT_NOEXCEPT {
+
280  return this;
+
281  }
+
282 
+
284  [[nodiscard]] const concept_type *operator->() const ENTT_NOEXCEPT {
+
285  return this;
+
286  }
+
287 
+
292  [[nodiscard]] basic_poly as_ref() ENTT_NOEXCEPT {
+
293  basic_poly ref{};
+
294  ref.storage = storage.as_ref();
+
295  ref.vtable = vtable;
+
296  return ref;
+
297  }
+
298 
+
300  [[nodiscard]] basic_poly as_ref() const ENTT_NOEXCEPT {
+
301  basic_poly ref{};
+
302  ref.storage = storage.as_ref();
+
303  ref.vtable = vtable;
+
304  return ref;
+
305  }
+
306 
+
307 private:
+
308  basic_any<Len, Align> storage;
+
309  vtable_type vtable;
+
310 };
+
311 
+
312 } // namespace entt
+
313 
+
314 #endif
entt::basic_any
A SBO friendly, type-safe container for single values of any type.
Definition: any.hpp:22
-
entt::basic_poly
Static polymorphism made simple and within everyone's reach.
Definition: poly.hpp:192
-
entt::basic_poly::operator->
concept_type * operator->()
Returns a pointer to the underlying concept.
Definition: poly.hpp:278
-
entt::basic_poly::operator->
const concept_type * operator->() const
Returns a pointer to the underlying concept.
Definition: poly.hpp:283
-
entt::basic_poly::data
void * data()
Returns an opaque pointer to the contained instance.
Definition: poly.hpp:244
-
entt::basic_poly::reset
void reset()
Destroys contained object.
Definition: poly.hpp:261
-
entt::basic_poly::emplace
void emplace(Args &&...args)
Replaces the contained object by creating a new instance directly.
Definition: poly.hpp:255
-
entt::basic_poly::basic_poly
basic_poly(Type &&value)
Constructs a poly from a given value.
Definition: poly.hpp:224
-
entt::basic_poly::as_ref
basic_poly as_ref()
Aliasing constructor.
Definition: poly.hpp:291
-
entt::basic_poly::basic_poly
basic_poly()
Default constructor.
Definition: poly.hpp:203
-
entt::basic_poly::type
const type_info & type() const
Returns the object type if any, type_id<void>() otherwise.
Definition: poly.hpp:231
-
entt::basic_poly::as_ref
basic_poly as_ref() const
Aliasing constructor.
Definition: poly.hpp:299
-
entt::basic_poly::vtable_type
typename poly_vtable< Concept, Len, Align >::type vtable_type
Virtual table type.
Definition: poly.hpp:200
-
entt::basic_poly::data
const void * data() const
Returns an opaque pointer to the contained instance.
Definition: poly.hpp:239
-
entt::basic_poly::concept_type
typename Concept::template type< poly_base< basic_poly > > concept_type
Concept type.
Definition: poly.hpp:198
-
entt::basic_poly::basic_poly
basic_poly(std::in_place_type_t< Type >, Args &&...args)
Constructs a poly by directly initializing the new object.
Definition: poly.hpp:214
-
entt::basic_sparse_set::type
const type_info & type() const
Returned value type, if any.
Definition: sparse_set.hpp:918
-
entt::basic_sparse_set::data
pointer data() const
Direct access to the internal packed array.
Definition: sparse_set.hpp:487
-
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:237
+
entt::basic_poly
Static polymorphism made simple and within everyone's reach.
Definition: poly.hpp:193
+
entt::basic_poly::operator->
concept_type * operator->()
Returns a pointer to the underlying concept.
Definition: poly.hpp:279
+
entt::basic_poly::operator->
const concept_type * operator->() const
Returns a pointer to the underlying concept.
Definition: poly.hpp:284
+
entt::basic_poly::data
void * data()
Returns an opaque pointer to the contained instance.
Definition: poly.hpp:245
+
entt::basic_poly::reset
void reset()
Destroys contained object.
Definition: poly.hpp:262
+
entt::basic_poly::emplace
void emplace(Args &&...args)
Replaces the contained object by creating a new instance directly.
Definition: poly.hpp:256
+
entt::basic_poly::basic_poly
basic_poly(Type &&value)
Constructs a poly from a given value.
Definition: poly.hpp:225
+
entt::basic_poly::as_ref
basic_poly as_ref()
Aliasing constructor.
Definition: poly.hpp:292
+
entt::basic_poly::basic_poly
basic_poly()
Default constructor.
Definition: poly.hpp:204
+
entt::basic_poly::type
const type_info & type() const
Returns the object type if any, type_id<void>() otherwise.
Definition: poly.hpp:232
+
entt::basic_poly::as_ref
basic_poly as_ref() const
Aliasing constructor.
Definition: poly.hpp:300
+
entt::basic_poly::vtable_type
typename poly_vtable< Concept, Len, Align >::type vtable_type
Virtual table type.
Definition: poly.hpp:201
+
entt::basic_poly::data
const void * data() const
Returns an opaque pointer to the contained instance.
Definition: poly.hpp:240
+
entt::basic_poly::concept_type
typename Concept::template type< poly_base< basic_poly > > concept_type
Concept type.
Definition: poly.hpp:199
+
entt::basic_poly::basic_poly
basic_poly(std::in_place_type_t< Type >, Args &&...args)
Constructs a poly by directly initializing the new object.
Definition: poly.hpp:215
+
entt::basic_sparse_set::type
const type_info & type() const
Returned value type, if any.
Definition: sparse_set.hpp:942
+
entt::basic_sparse_set::data
pointer data() const
Direct access to the internal packed array.
Definition: sparse_set.hpp:481
+
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:234
entt::poly_vtable
Static virtual table factory.
Definition: poly.hpp:48
entt::poly_vtable::type
std::conditional_t< is_mono_v, std::tuple_element_t< 0u, vtable_type >, const vtable_type * > type
Virtual table type.
Definition: poly.hpp:104
entt::poly_vtable::instance
static type instance()
Returns a static virtual table for a specific concept and type.
Definition: poly.hpp:112
-
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::any_cast
Type any_cast(const basic_any< Len, Align > &data)
Performs type-safe access to the contained object.
Definition: any.hpp:419
-
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:645
-
entt::poly_call
decltype(auto) poly_call(Poly &&self, Args &&...args)
Shortcut for calling poly_base<Type>invoke.
Definition: poly.hpp:172
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::any_cast
Type any_cast(const basic_any< Len, Align > &data)
Performs type-safe access to the contained object.
Definition: any.hpp:415
+
entt::constness_as_t
typename constness_as< To, From >::type constness_as_t
Alias template to facilitate the transcription of the constness.
Definition: type_traits.hpp:618
+
entt::poly_call
decltype(auto) poly_call(Poly &&self, Args &&...args)
Shortcut for calling poly_base<Type>invoke.
Definition: poly.hpp:173
entt::poly_base
Poly base class used to inject functionalities into concepts.
Definition: poly.hpp:129
entt::poly_base::invoke
decltype(auto) invoke(const poly_base &self, Args &&...args) const
Invokes a function from the static virtual table.
Definition: poly.hpp:139
entt::poly_inspector
Inspector class used to infer the type of the virtual table.
Definition: poly.hpp:18
entt::poly_inspector::invoke
poly_inspector invoke(Args &&...args) const
Dummy invocation function (definition only).
entt::poly_inspector::invoke
poly_inspector invoke(Args &&...args)
Dummy invocation function (definition only).
+
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
entt::type_list
A class to use to push around lists of types, nothing more.
Definition: type_traits.hpp:110
entt::value_list
A class to use to push around lists of constant values, nothing more.
Definition: type_traits.hpp:285
diff --git a/process_8hpp_source.html b/process_8hpp_source.html index 10fd93995..1d12aa438 100644 --- a/process_8hpp_source.html +++ b/process_8hpp_source.html @@ -22,7 +22,7 @@ @@ -153,7 +153,7 @@ $(function() {
164 public:
166  using delta_type = Delta;
167 
-
169  virtual ~process() {
+
169  virtual ~process() ENTT_NOEXCEPT {
170  static_assert(std::is_base_of_v<process, Derived>, "Incorrect use of the class template");
171  }
172 
@@ -252,7 +252,7 @@ $(function() {
entt::process::rejected
bool rejected() const
Returns true if a process terminated with errors.
Definition: process.hpp:219
entt::process::tick
void tick(const Delta delta, void *data=nullptr)
Updates a process and its internal state if required.
Definition: process.hpp:228
entt::process::abort
void abort(const bool immediately=false)
Aborts a process if it's still alive.
Definition: process.hpp:181
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::process_adaptor
Adaptor for lambdas and functors to turn them into processes.
Definition: process.hpp:306
entt::process_adaptor::update
void update(const Delta delta, void *data)
Updates a process and its internal state if required.
Definition: process.hpp:321
entt::process_adaptor::process_adaptor
process_adaptor(Args &&...args)
Constructs a process adaptor from a lambda or a functor.
Definition: process.hpp:313
diff --git a/range_8hpp_source.html b/range_8hpp_source.html index 2d041b95c..fbc013860 100644 --- a/range_8hpp_source.html +++ b/range_8hpp_source.html @@ -22,7 +22,7 @@ @@ -82,7 +82,7 @@ $(function() {
15 namespace internal {
16 
17 template<typename Type, typename Node>
-
18 struct meta_range_iterator {
+
18 struct meta_range_iterator final {
19  using difference_type = std::ptrdiff_t;
20  using value_type = Type;
21  using pointer = input_iterator_pointer<value_type>;
@@ -90,88 +90,89 @@ $(function() {
23  using iterator_category = std::input_iterator_tag;
24  using node_type = Node;
25 
-
26  meta_range_iterator() ENTT_NOEXCEPT = default;
-
27 
-
28  meta_range_iterator(node_type *head) ENTT_NOEXCEPT
-
29  : it{head} {}
-
30 
-
31  meta_range_iterator &operator++() ENTT_NOEXCEPT {
-
32  return (it = it->next), *this;
-
33  }
-
34 
-
35  meta_range_iterator operator++(int) ENTT_NOEXCEPT {
-
36  meta_range_iterator orig = *this;
-
37  return ++(*this), orig;
-
38  }
-
39 
-
40  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
-
41  return it;
-
42  }
-
43 
-
44  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
-
45  return operator*();
-
46  }
-
47 
-
48  [[nodiscard]] bool operator==(const meta_range_iterator &other) const ENTT_NOEXCEPT {
-
49  return it == other.it;
-
50  }
-
51 
-
52  [[nodiscard]] bool operator!=(const meta_range_iterator &other) const ENTT_NOEXCEPT {
-
53  return !(*this == other);
-
54  }
-
55 
-
56 private:
-
57  node_type *it{};
-
58 };
-
59 
-
60 } // namespace internal
-
61 
-
72 template<typename Type, typename Node = typename Type::node_type>
-
73 struct meta_range {
-
75  using node_type = Node;
-
77  using iterator = internal::meta_range_iterator<Type, Node>;
-
79  using const_iterator = iterator;
-
80 
-
82  meta_range() ENTT_NOEXCEPT = default;
-
83 
-
88  meta_range(node_type *head)
-
89  : node{head} {}
-
90 
-
95  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
-
96  return iterator{node};
-
97  }
-
98 
-
100  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
-
101  return cbegin();
-
102  }
-
103 
-
109  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
-
110  return iterator{};
-
111  }
-
112 
-
114  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
-
115  return cend();
-
116  }
-
117 
-
118 private:
-
119  node_type *node{nullptr};
-
120 };
-
121 
-
122 } // namespace entt
-
123 
-
124 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:217
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
-
entt::meta_range
Iterable range to use to iterate all types of meta objects.
Definition: range.hpp:73
-
entt::meta_range::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: range.hpp:95
-
entt::meta_range::const_iterator
iterator const_iterator
Constant input iterator type.
Definition: range.hpp:79
-
entt::meta_range::node_type
Node node_type
Node type.
Definition: range.hpp:75
-
entt::meta_range::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: range.hpp:109
-
entt::meta_range::end
iterator end() const
Returns an iterator to the end.
Definition: range.hpp:114
+
26  meta_range_iterator() ENTT_NOEXCEPT
+
27  : it{} {}
+
28 
+
29  meta_range_iterator(node_type *head) ENTT_NOEXCEPT
+
30  : it{head} {}
+
31 
+
32  meta_range_iterator &operator++() ENTT_NOEXCEPT {
+
33  return (it = it->next), *this;
+
34  }
+
35 
+
36  meta_range_iterator operator++(int) ENTT_NOEXCEPT {
+
37  meta_range_iterator orig = *this;
+
38  return ++(*this), orig;
+
39  }
+
40 
+
41  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
42  return it;
+
43  }
+
44 
+
45  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
46  return operator*();
+
47  }
+
48 
+
49  [[nodiscard]] bool operator==(const meta_range_iterator &other) const ENTT_NOEXCEPT {
+
50  return it == other.it;
+
51  }
+
52 
+
53  [[nodiscard]] bool operator!=(const meta_range_iterator &other) const ENTT_NOEXCEPT {
+
54  return !(*this == other);
+
55  }
+
56 
+
57 private:
+
58  node_type *it;
+
59 };
+
60 
+
61 } // namespace internal
+
62 
+
73 template<typename Type, typename Node = typename Type::node_type>
+
74 struct meta_range final {
+
76  using node_type = Node;
+
78  using iterator = internal::meta_range_iterator<Type, Node>;
+
80  using const_iterator = iterator;
+
81 
+
83  meta_range() ENTT_NOEXCEPT = default;
+
84 
+
89  meta_range(node_type *head) ENTT_NOEXCEPT
+
90  : node{head} {}
+
91 
+
96  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
+
97  return iterator{node};
+
98  }
+
99 
+
101  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
+
102  return cbegin();
+
103  }
+
104 
+
110  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
+
111  return iterator{};
+
112  }
+
113 
+
115  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
+
116  return cend();
+
117  }
+
118 
+
119 private:
+
120  node_type *node{nullptr};
+
121 };
+
122 
+
123 } // namespace entt
+
124 
+
125 #endif
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::meta_range
Iterable range to use to iterate all types of meta objects.
Definition: range.hpp:74
+
entt::meta_range::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: range.hpp:96
+
entt::meta_range::const_iterator
iterator const_iterator
Constant input iterator type.
Definition: range.hpp:80
+
entt::meta_range::node_type
Node node_type
Node type.
Definition: range.hpp:76
+
entt::meta_range::cend
const_iterator cend() const
Returns an iterator to the end.
Definition: range.hpp:110
+
entt::meta_range::end
iterator end() const
Returns an iterator to the end.
Definition: range.hpp:115
entt::meta_range::meta_range
meta_range()=default
Default constructor.
-
entt::meta_range::begin
iterator begin() const
Returns an iterator to the beginning.
Definition: range.hpp:100
-
entt::meta_range::iterator
internal::meta_range_iterator< Type, Node > iterator
Input iterator type.
Definition: range.hpp:77
+
entt::meta_range::begin
iterator begin() const
Returns an iterator to the beginning.
Definition: range.hpp:101
+
entt::meta_range::iterator
internal::meta_range_iterator< Type, Node > iterator
Input iterator type.
Definition: range.hpp:78
diff --git a/registry_8hpp_source.html b/registry_8hpp_source.html index 7975d99be..9f9d6b6c6 100644 --- a/registry_8hpp_source.html +++ b/registry_8hpp_source.html @@ -22,7 +22,7 @@
@@ -82,7 +82,7 @@ $(function() {
10 #include <utility>
11 #include <vector>
12 #include "../config/config.h"
-
13 #include "../container/dense_hash_map.hpp"
+
13 #include "../container/dense_map.hpp"
14 #include "../core/algorithm.hpp"
15 #include "../core/any.hpp"
16 #include "../core/fwd.hpp"
@@ -105,911 +105,916 @@ $(function() {
38 namespace internal {
39 
40 template<typename It>
-
41 class storage_proxy_iterator {
+
41 class storage_proxy_iterator final {
42  template<typename Other>
43  friend class storage_proxy_iterator;
44 
-
45  using iterator_traits = std::iterator_traits<It>;
-
46  using first_type = typename iterator_traits::value_type::first_type;
-
47  using second_type = typename iterator_traits::value_type::second_type::element_type;
-
48 
-
49 public:
-
50  using value_type = std::pair<first_type, constness_as_t<second_type, std::remove_reference_t<typename iterator_traits::reference>> &>;
-
51  using pointer = input_iterator_pointer<value_type>;
-
52  using reference = value_type;
-
53  using difference_type = typename iterator_traits::difference_type;
-
54  using iterator_category = std::input_iterator_tag;
-
55 
-
56  storage_proxy_iterator() ENTT_NOEXCEPT = default;
-
57 
-
58  storage_proxy_iterator(const It iter) ENTT_NOEXCEPT
-
59  : it{iter} {}
-
60 
-
61  template<typename Other, typename = std::enable_if_t<!std::is_same_v<It, Other> && std::is_constructible_v<It, Other>>>
-
62  storage_proxy_iterator(const storage_proxy_iterator<Other> &other)
-
63  : it{other.it} {}
-
64 
-
65  storage_proxy_iterator &operator++() ENTT_NOEXCEPT {
-
66  return ++it, *this;
-
67  }
-
68 
-
69  storage_proxy_iterator operator++(int) ENTT_NOEXCEPT {
-
70  storage_proxy_iterator orig = *this;
-
71  return ++(*this), orig;
-
72  }
-
73 
-
74  storage_proxy_iterator &operator--() ENTT_NOEXCEPT {
-
75  return --it, *this;
-
76  }
-
77 
-
78  storage_proxy_iterator operator--(int) ENTT_NOEXCEPT {
-
79  storage_proxy_iterator orig = *this;
-
80  return operator--(), orig;
-
81  }
-
82 
-
83  storage_proxy_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
-
84  it += value;
-
85  return *this;
-
86  }
-
87 
-
88  storage_proxy_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
-
89  storage_proxy_iterator copy = *this;
-
90  return (copy += value);
-
91  }
-
92 
-
93  storage_proxy_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
-
94  return (*this += -value);
-
95  }
-
96 
-
97  storage_proxy_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
-
98  return (*this + -value);
-
99  }
-
100 
-
101  [[nodiscard]] reference operator[](const difference_type value) const {
-
102  return {it[value].first, *it[value].second};
-
103  }
-
104 
-
105  [[nodiscard]] reference operator*() const {
-
106  return {it->first, *it->second};
-
107  }
-
108 
-
109  [[nodiscard]] pointer operator->() const {
-
110  return operator*();
-
111  }
-
112 
-
113  template<typename ILhs, typename IRhs>
-
114  friend auto operator-(const storage_proxy_iterator<ILhs> &, const storage_proxy_iterator<IRhs> &) ENTT_NOEXCEPT;
-
115 
-
116  template<typename ILhs, typename IRhs>
-
117  friend bool operator==(const storage_proxy_iterator<ILhs> &, const storage_proxy_iterator<IRhs> &) ENTT_NOEXCEPT;
-
118 
-
119  template<typename ILhs, typename IRhs>
-
120  friend bool operator<(const storage_proxy_iterator<ILhs> &, const storage_proxy_iterator<IRhs> &) ENTT_NOEXCEPT;
-
121 
-
122 private:
-
123  It it;
-
124 };
-
125 
-
126 template<typename ILhs, typename IRhs>
-
127 [[nodiscard]] auto operator-(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
-
128  return lhs.it - rhs.it;
-
129 }
-
130 
-
131 template<typename ILhs, typename IRhs>
-
132 [[nodiscard]] bool operator==(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
-
133  return lhs.it == rhs.it;
-
134 }
-
135 
-
136 template<typename ILhs, typename IRhs>
-
137 [[nodiscard]] bool operator!=(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
-
138  return !(lhs == rhs);
-
139 }
-
140 
-
141 template<typename ILhs, typename IRhs>
-
142 [[nodiscard]] bool operator<(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
-
143  return lhs.it < rhs.it;
-
144 }
-
145 
-
146 template<typename ILhs, typename IRhs>
-
147 [[nodiscard]] bool operator>(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
-
148  return rhs < lhs;
-
149 }
-
150 
-
151 template<typename ILhs, typename IRhs>
-
152 [[nodiscard]] bool operator<=(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
-
153  return !(lhs > rhs);
-
154 }
-
155 
-
156 template<typename ILhs, typename IRhs>
-
157 [[nodiscard]] bool operator>=(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
-
158  return !(lhs < rhs);
-
159 }
-
160 
-
161 } // namespace internal
-
162 
-
172 template<typename Entity>
-
173 class basic_registry {
-
174  using entity_traits = entt_traits<Entity>;
-
175  using basic_common_type = basic_sparse_set<Entity>;
+
45  using mapped_type = std::remove_reference_t<decltype(std::declval<It>()->second)>;
+
46 
+
47 public:
+
48  using value_type = std::pair<id_type, constness_as_t<typename mapped_type::element_type, mapped_type> &>;
+
49  using pointer = input_iterator_pointer<value_type>;
+
50  using reference = value_type;
+
51  using difference_type = std::ptrdiff_t;
+
52  using iterator_category = std::input_iterator_tag;
+
53 
+
54  storage_proxy_iterator() ENTT_NOEXCEPT
+
55  : it{} {}
+
56 
+
57  storage_proxy_iterator(const It iter) ENTT_NOEXCEPT
+
58  : it{iter} {}
+
59 
+
60  template<typename Other, typename = std::enable_if_t<!std::is_same_v<It, Other> && std::is_constructible_v<It, Other>>>
+
61  storage_proxy_iterator(const storage_proxy_iterator<Other> &other) ENTT_NOEXCEPT
+
62  : it{other.it} {}
+
63 
+
64  storage_proxy_iterator &operator++() ENTT_NOEXCEPT {
+
65  return ++it, *this;
+
66  }
+
67 
+
68  storage_proxy_iterator operator++(int) ENTT_NOEXCEPT {
+
69  storage_proxy_iterator orig = *this;
+
70  return ++(*this), orig;
+
71  }
+
72 
+
73  storage_proxy_iterator &operator--() ENTT_NOEXCEPT {
+
74  return --it, *this;
+
75  }
+
76 
+
77  storage_proxy_iterator operator--(int) ENTT_NOEXCEPT {
+
78  storage_proxy_iterator orig = *this;
+
79  return operator--(), orig;
+
80  }
+
81 
+
82  storage_proxy_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
+
83  it += value;
+
84  return *this;
+
85  }
+
86 
+
87  storage_proxy_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
+
88  storage_proxy_iterator copy = *this;
+
89  return (copy += value);
+
90  }
+
91 
+
92  storage_proxy_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
+
93  return (*this += -value);
+
94  }
+
95 
+
96  storage_proxy_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
+
97  return (*this + -value);
+
98  }
+
99 
+
100  [[nodiscard]] reference operator[](const difference_type value) const ENTT_NOEXCEPT {
+
101  return {it[value].first, *it[value].second};
+
102  }
+
103 
+
104  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
+
105  return {it->first, *it->second};
+
106  }
+
107 
+
108  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
+
109  return operator*();
+
110  }
+
111 
+
112  template<typename ILhs, typename IRhs>
+
113  friend std::ptrdiff_t operator-(const storage_proxy_iterator<ILhs> &, const storage_proxy_iterator<IRhs> &) ENTT_NOEXCEPT;
+
114 
+
115  template<typename ILhs, typename IRhs>
+
116  friend bool operator==(const storage_proxy_iterator<ILhs> &, const storage_proxy_iterator<IRhs> &) ENTT_NOEXCEPT;
+
117 
+
118  template<typename ILhs, typename IRhs>
+
119  friend bool operator<(const storage_proxy_iterator<ILhs> &, const storage_proxy_iterator<IRhs> &) ENTT_NOEXCEPT;
+
120 
+
121 private:
+
122  It it;
+
123 };
+
124 
+
125 template<typename ILhs, typename IRhs>
+
126 [[nodiscard]] std::ptrdiff_t operator-(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
+
127  return lhs.it - rhs.it;
+
128 }
+
129 
+
130 template<typename ILhs, typename IRhs>
+
131 [[nodiscard]] bool operator==(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
+
132  return lhs.it == rhs.it;
+
133 }
+
134 
+
135 template<typename ILhs, typename IRhs>
+
136 [[nodiscard]] bool operator!=(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
+
137  return !(lhs == rhs);
+
138 }
+
139 
+
140 template<typename ILhs, typename IRhs>
+
141 [[nodiscard]] bool operator<(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
+
142  return lhs.it < rhs.it;
+
143 }
+
144 
+
145 template<typename ILhs, typename IRhs>
+
146 [[nodiscard]] bool operator>(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
+
147  return rhs < lhs;
+
148 }
+
149 
+
150 template<typename ILhs, typename IRhs>
+
151 [[nodiscard]] bool operator<=(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
+
152  return !(lhs > rhs);
+
153 }
+
154 
+
155 template<typename ILhs, typename IRhs>
+
156 [[nodiscard]] bool operator>=(const storage_proxy_iterator<ILhs> &lhs, const storage_proxy_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
+
157  return !(lhs < rhs);
+
158 }
+
159 
+
160 struct registry_context {
+
161  template<typename Type, typename... Args>
+
162  Type &emplace_hint(const id_type id, Args &&...args) {
+
163  return any_cast<Type &>(data.try_emplace(id, std::in_place_type<Type>, std::forward<Args>(args)...).first->second);
+
164  }
+
165 
+
166  template<typename Type, typename... Args>
+
167  Type &emplace(Args &&...args) {
+
168  return emplace_hint<Type>(type_id<Type>().hash(), std::forward<Args>(args)...);
+
169  }
+
170 
+
171  template<typename Type>
+
172  bool erase(const id_type id = type_id<Type>().hash()) {
+
173  const auto it = data.find(id);
+
174  return it != data.end() && it->second.type() == type_id<Type>() ? (data.erase(it), true) : false;
+
175  }
176 
-
177  template<typename Component>
-
178  using storage_type = typename storage_traits<Entity, Component>::storage_type;
-
179 
-
180  template<typename...>
-
181  struct group_handler;
-
182 
-
183  template<typename... Exclude, typename... Get, typename... Owned>
-
184  struct group_handler<exclude_t<Exclude...>, get_t<Get...>, Owned...> {
-
185  // nasty workaround for an issue with the toolset v141 that doesn't accept a fold expression here
-
186  static_assert(!std::disjunction_v<std::bool_constant<component_traits<Owned>::in_place_delete>...>, "Groups do not support in-place delete");
-
187  std::conditional_t<sizeof...(Owned) == 0, basic_common_type, std::size_t> current{};
-
188 
-
189  template<typename Component>
-
190  void maybe_valid_if(basic_registry &owner, const Entity entt) {
-
191  [[maybe_unused]] const auto cpools = std::forward_as_tuple(owner.assure<Owned>()...);
+
177  template<typename Type>
+
178  [[nodiscard]] std::add_const_t<Type> &at(const id_type id = type_id<Type>().hash()) const {
+
179  return any_cast<std::add_const_t<Type> &>(data.at(id));
+
180  }
+
181 
+
182  template<typename Type>
+
183  [[nodiscard]] Type &at(const id_type id = type_id<Type>().hash()) {
+
184  return any_cast<Type &>(data.at(id));
+
185  }
+
186 
+
187  template<typename Type>
+
188  [[nodiscard]] std::add_const_t<Type> *find(const id_type id = type_id<Type>().hash()) const {
+
189  const auto it = data.find(id);
+
190  return it != data.cend() ? any_cast<std::add_const_t<Type>>(&it->second) : nullptr;
+
191  }
192 
-
193  const auto is_valid = ((std::is_same_v<Component, Owned> || std::get<storage_type<Owned> &>(cpools).contains(entt)) && ...)
-
194  && ((std::is_same_v<Component, Get> || owner.assure<Get>().contains(entt)) && ...)
-
195  && ((std::is_same_v<Component, Exclude> || !owner.assure<Exclude>().contains(entt)) && ...);
-
196 
-
197  if constexpr(sizeof...(Owned) == 0) {
-
198  if(is_valid && !current.contains(entt)) {
-
199  current.emplace(entt);
-
200  }
-
201  } else {
-
202  if(is_valid && !(std::get<0>(cpools).index(entt) < current)) {
-
203  const auto pos = current++;
-
204  (std::get<storage_type<Owned> &>(cpools).swap_elements(std::get<storage_type<Owned> &>(cpools).data()[pos], entt), ...);
-
205  }
-
206  }
-
207  }
+
193  template<typename Type>
+
194  [[nodiscard]] Type *find(const id_type id = type_id<Type>().hash()) {
+
195  const auto it = data.find(id);
+
196  return it != data.end() ? any_cast<Type>(&it->second) : nullptr;
+
197  }
+
198 
+
199  template<typename Type>
+
200  [[nodiscard]] bool contains(const id_type id = type_id<Type>().hash()) const {
+
201  const auto it = data.find(id);
+
202  return it != data.end() && it->second.type() == type_id<Type>();
+
203  }
+
204 
+
205 private:
+
206  dense_map<id_type, basic_any<0u>, identity> data;
+
207 };
208 
-
209  void discard_if([[maybe_unused]] basic_registry &owner, const Entity entt) {
-
210  if constexpr(sizeof...(Owned) == 0) {
-
211  current.remove(entt);
-
212  } else {
-
213  if(const auto cpools = std::forward_as_tuple(owner.assure<Owned>()...); std::get<0>(cpools).contains(entt) && (std::get<0>(cpools).index(entt) < current)) {
-
214  const auto pos = --current;
-
215  (std::get<storage_type<Owned> &>(cpools).swap_elements(std::get<storage_type<Owned> &>(cpools).data()[pos], entt), ...);
-
216  }
-
217  }
-
218  }
-
219  };
-
220 
-
221  struct group_data {
-
222  std::size_t size;
-
223  std::unique_ptr<void, void (*)(void *)> group;
-
224  bool (*owned)(const id_type) ENTT_NOEXCEPT;
-
225  bool (*get)(const id_type) ENTT_NOEXCEPT;
-
226  bool (*exclude)(const id_type) ENTT_NOEXCEPT;
-
227  };
-
228 
-
229  template<typename Component>
-
230  [[nodiscard]] auto &assure(const id_type id = type_hash<Component>::value()) {
-
231  static_assert(std::is_same_v<Component, std::decay_t<Component>>, "Non-decayed types not allowed");
-
232  auto &&cpool = pools[id];
-
233 
-
234  if(!cpool) {
-
235  cpool.reset(new storage_type<Component>{});
-
236  cpool->bind(forward_as_any(*this));
-
237  }
-
238 
-
239  return static_cast<storage_type<Component> &>(*cpool);
-
240  }
-
241 
-
242  template<typename Component>
-
243  [[nodiscard]] const auto &assure(const id_type id = type_hash<Component>::value()) const {
-
244  static_assert(std::is_same_v<Component, std::decay_t<Component>>, "Non-decayed types not allowed");
-
245 
-
246  if(const auto it = pools.find(id); it != pools.cend()) {
-
247  return static_cast<const storage_type<Component> &>(*it->second);
-
248  }
-
249 
-
250  static storage_type<Component> placeholder{};
-
251  return placeholder;
-
252  }
-
253 
-
254  auto generate_identifier(const std::size_t pos) ENTT_NOEXCEPT {
-
255  ENTT_ASSERT(pos < entity_traits::to_integral(null), "No entities available");
-
256  return entity_traits::combine(static_cast<typename entity_traits::entity_type>(pos), {});
-
257  }
-
258 
-
259  auto recycle_identifier() ENTT_NOEXCEPT {
-
260  ENTT_ASSERT(free_list != null, "No entities available");
-
261  const auto curr = entity_traits::to_entity(free_list);
-
262  free_list = entity_traits::combine(entity_traits::to_integral(entities[curr]), tombstone);
-
263  return (entities[curr] = entity_traits::combine(curr, entity_traits::to_integral(entities[curr])));
-
264  }
-
265 
-
266  auto release_entity(const Entity entity, const typename entity_traits::version_type version) {
-
267  const typename entity_traits::version_type vers = version + (version == entity_traits::to_version(tombstone));
-
268  entities[entity_traits::to_entity(entity)] = entity_traits::construct(entity_traits::to_integral(free_list), vers);
-
269  free_list = entity_traits::combine(entity_traits::to_integral(entity), tombstone);
-
270  return vers;
-
271  }
-
272 
-
273 public:
-
275  using entity_type = Entity;
-
277  using version_type = typename entity_traits::version_type;
-
279  using size_type = std::size_t;
-
281  using base_type = basic_common_type;
-
282 
-
284  basic_registry() = default;
-
285 
-
290  basic_registry(basic_registry &&other) ENTT_NOEXCEPT
-
291  : pools{std::move(other.pools)},
-
292  vars{std::move(other.vars)},
-
293  groups{std::move(other.groups)},
-
294  entities{std::move(other.entities)},
-
295  free_list{other.free_list} {
-
296  for(auto &&curr: pools) {
-
297  curr.second->bind(forward_as_any(*this));
+
209 } // namespace internal
+
210 
+
220 template<typename Entity>
+
221 class basic_registry {
+
222  using entity_traits = entt_traits<Entity>;
+
223  using basic_common_type = basic_sparse_set<Entity>;
+
224 
+
225  template<typename Component>
+
226  using storage_type = typename storage_traits<Entity, Component>::storage_type;
+
227 
+
228  template<typename...>
+
229  struct group_handler;
+
230 
+
231  template<typename... Exclude, typename... Get, typename... Owned>
+
232  struct group_handler<exclude_t<Exclude...>, get_t<Get...>, Owned...> {
+
233  // nasty workaround for an issue with the toolset v141 that doesn't accept a fold expression here
+
234  static_assert(!std::disjunction_v<std::bool_constant<component_traits<Owned>::in_place_delete>...>, "Groups do not support in-place delete");
+
235  std::conditional_t<sizeof...(Owned) == 0, basic_common_type, std::size_t> current{};
+
236 
+
237  template<typename Component>
+
238  void maybe_valid_if(basic_registry &owner, const Entity entt) {
+
239  [[maybe_unused]] const auto cpools = std::forward_as_tuple(owner.assure<Owned>()...);
+
240 
+
241  const auto is_valid = ((std::is_same_v<Component, Owned> || std::get<storage_type<Owned> &>(cpools).contains(entt)) && ...)
+
242  && ((std::is_same_v<Component, Get> || owner.assure<Get>().contains(entt)) && ...)
+
243  && ((std::is_same_v<Component, Exclude> || !owner.assure<Exclude>().contains(entt)) && ...);
+
244 
+
245  if constexpr(sizeof...(Owned) == 0) {
+
246  if(is_valid && !current.contains(entt)) {
+
247  current.emplace(entt);
+
248  }
+
249  } else {
+
250  if(is_valid && !(std::get<0>(cpools).index(entt) < current)) {
+
251  const auto pos = current++;
+
252  (std::get<storage_type<Owned> &>(cpools).swap_elements(std::get<storage_type<Owned> &>(cpools).data()[pos], entt), ...);
+
253  }
+
254  }
+
255  }
+
256 
+
257  void discard_if([[maybe_unused]] basic_registry &owner, const Entity entt) {
+
258  if constexpr(sizeof...(Owned) == 0) {
+
259  current.remove(entt);
+
260  } else {
+
261  if(const auto cpools = std::forward_as_tuple(owner.assure<Owned>()...); std::get<0>(cpools).contains(entt) && (std::get<0>(cpools).index(entt) < current)) {
+
262  const auto pos = --current;
+
263  (std::get<storage_type<Owned> &>(cpools).swap_elements(std::get<storage_type<Owned> &>(cpools).data()[pos], entt), ...);
+
264  }
+
265  }
+
266  }
+
267  };
+
268 
+
269  struct group_data {
+
270  std::size_t size;
+
271  std::unique_ptr<void, void (*)(void *)> group;
+
272  bool (*owned)(const id_type) ENTT_NOEXCEPT;
+
273  bool (*get)(const id_type) ENTT_NOEXCEPT;
+
274  bool (*exclude)(const id_type) ENTT_NOEXCEPT;
+
275  };
+
276 
+
277  template<typename Component>
+
278  [[nodiscard]] auto &assure(const id_type id = type_hash<Component>::value()) {
+
279  static_assert(std::is_same_v<Component, std::decay_t<Component>>, "Non-decayed types not allowed");
+
280  auto &&cpool = pools[id];
+
281 
+
282  if(!cpool) {
+
283  cpool.reset(new storage_type<Component>{});
+
284  cpool->bind(forward_as_any(*this));
+
285  }
+
286 
+
287  ENTT_ASSERT(cpool->type() == type_id<Component>(), "Unexpected type");
+
288  return static_cast<storage_type<Component> &>(*cpool);
+
289  }
+
290 
+
291  template<typename Component>
+
292  [[nodiscard]] const auto &assure(const id_type id = type_hash<Component>::value()) const {
+
293  static_assert(std::is_same_v<Component, std::decay_t<Component>>, "Non-decayed types not allowed");
+
294 
+
295  if(const auto it = pools.find(id); it != pools.cend()) {
+
296  ENTT_ASSERT(it->second->type() == type_id<Component>(), "Unexpected type");
+
297  return static_cast<const storage_type<Component> &>(*it->second);
298  }
-
299  }
-
300 
-
306  basic_registry &operator=(basic_registry &&other) ENTT_NOEXCEPT {
-
307  pools = std::move(other.pools);
-
308  vars = std::move(other.vars);
-
309  groups = std::move(other.groups);
-
310  entities = std::move(other.entities);
-
311  free_list = other.free_list;
-
312 
-
313  for(auto &&curr: pools) {
-
314  curr.second->bind(forward_as_any(*this));
-
315  }
-
316 
-
317  return *this;
-
318  }
-
319 
-
328  [[nodiscard]] auto storage() ENTT_NOEXCEPT {
-
329  return iterable_adaptor{internal::storage_proxy_iterator{pools.begin()}, internal::storage_proxy_iterator{pools.end()}};
-
330  }
-
331 
-
333  [[nodiscard]] auto storage() const ENTT_NOEXCEPT {
-
334  return iterable_adaptor{internal::storage_proxy_iterator{pools.cbegin()}, internal::storage_proxy_iterator{pools.cend()}};
-
335  }
-
336 
-
343  template<typename Component>
-
344  [[nodiscard]] decltype(auto) storage(const id_type id = type_hash<Component>::value()) {
-
345  return assure<Component>(id);
-
346  }
-
347 
-
359  template<typename Component>
-
360  [[nodiscard]] decltype(auto) storage(const id_type id = type_hash<Component>::value()) const {
-
361  return assure<Component>(id);
-
362  }
-
363 
-
368  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
-
369  return entities.size();
-
370  }
-
371 
-
376  [[nodiscard]] size_type alive() const {
-
377  auto sz = entities.size();
-
378 
-
379  for(auto curr = free_list; curr != null; --sz) {
-
380  curr = entities[entity_traits::to_entity(curr)];
-
381  }
+
299 
+
300  static storage_type<Component> placeholder{};
+
301  return placeholder;
+
302  }
+
303 
+
304  auto generate_identifier(const std::size_t pos) ENTT_NOEXCEPT {
+
305  ENTT_ASSERT(pos < entity_traits::to_integral(null), "No entities available");
+
306  return entity_traits::combine(static_cast<typename entity_traits::entity_type>(pos), {});
+
307  }
+
308 
+
309  auto recycle_identifier() ENTT_NOEXCEPT {
+
310  ENTT_ASSERT(free_list != null, "No entities available");
+
311  const auto curr = entity_traits::to_entity(free_list);
+
312  free_list = entity_traits::combine(entity_traits::to_integral(entities[curr]), tombstone);
+
313  return (entities[curr] = entity_traits::combine(curr, entity_traits::to_integral(entities[curr])));
+
314  }
+
315 
+
316  auto release_entity(const Entity entity, const typename entity_traits::version_type version) {
+
317  const typename entity_traits::version_type vers = version + (version == entity_traits::to_version(tombstone));
+
318  entities[entity_traits::to_entity(entity)] = entity_traits::construct(entity_traits::to_integral(free_list), vers);
+
319  free_list = entity_traits::combine(entity_traits::to_integral(entity), tombstone);
+
320  return vers;
+
321  }
+
322 
+
323 public:
+
325  using entity_type = Entity;
+
327  using version_type = typename entity_traits::version_type;
+
329  using size_type = std::size_t;
+
331  using base_type = basic_common_type;
+
333  using context = internal::registry_context;
+
334 
+
336  basic_registry()
+
337  : pools{},
+
338  groups{},
+
339  entities{},
+
340  free_list{tombstone},
+
341  vars{} {}
+
342 
+
347  basic_registry(const size_type count)
+
348  : pools{},
+
349  groups{},
+
350  entities{},
+
351  free_list{tombstone},
+
352  vars{} {
+
353  pools.reserve(count);
+
354  }
+
355 
+
360  basic_registry(basic_registry &&other)
+
361  : pools{std::move(other.pools)},
+
362  groups{std::move(other.groups)},
+
363  entities{std::move(other.entities)},
+
364  free_list{other.free_list},
+
365  vars{std::move(other.vars)} {
+
366  for(auto &&curr: pools) {
+
367  curr.second->bind(forward_as_any(*this));
+
368  }
+
369  }
+
370 
+
376  basic_registry &operator=(basic_registry &&other) {
+
377  pools = std::move(other.pools);
+
378  groups = std::move(other.groups);
+
379  entities = std::move(other.entities);
+
380  free_list = other.free_list;
+
381  vars = std::move(other.vars);
382 
-
383  return sz;
-
384  }
-
385 
-
390  void reserve(const size_type cap) {
-
391  entities.reserve(cap);
-
392  }
-
393 
-
399  [[nodiscard]] size_type capacity() const ENTT_NOEXCEPT {
-
400  return entities.capacity();
-
401  }
-
402 
-
407  [[nodiscard]] bool empty() const {
-
408  return !alive();
-
409  }
-
410 
-
423  [[nodiscard]] const entity_type *data() const ENTT_NOEXCEPT {
-
424  return entities.data();
+
383  for(auto &&curr: pools) {
+
384  curr.second->bind(forward_as_any(*this));
+
385  }
+
386 
+
387  return *this;
+
388  }
+
389 
+
398  [[nodiscard]] auto storage() ENTT_NOEXCEPT {
+
399  return iterable_adaptor{internal::storage_proxy_iterator{pools.begin()}, internal::storage_proxy_iterator{pools.end()}};
+
400  }
+
401 
+
403  [[nodiscard]] auto storage() const ENTT_NOEXCEPT {
+
404  return iterable_adaptor{internal::storage_proxy_iterator{pools.cbegin()}, internal::storage_proxy_iterator{pools.cend()}};
+
405  }
+
406 
+
413  [[nodiscard]] auto storage(const id_type id) {
+
414  return internal::storage_proxy_iterator{pools.find(id)};
+
415  }
+
416 
+
423  [[nodiscard]] auto storage(const id_type id) const {
+
424  return internal::storage_proxy_iterator{pools.find(id)};
425  }
426 
-
435  [[nodiscard]] entity_type released() const ENTT_NOEXCEPT {
-
436  return free_list;
-
437  }
-
438 
-
444  [[nodiscard]] bool valid(const entity_type entity) const {
-
445  const auto pos = size_type(entity_traits::to_entity(entity));
-
446  return (pos < entities.size() && entities[pos] == entity);
-
447  }
-
448 
-
455  [[nodiscard]] version_type current(const entity_type entity) const {
-
456  const auto pos = size_type(entity_traits::to_entity(entity));
-
457  return entity_traits::to_version(pos < entities.size() ? entities[pos] : tombstone);
-
458  }
-
459 
-
464  [[nodiscard]] entity_type create() {
-
465  return (free_list == null) ? entities.emplace_back(generate_identifier(entities.size())) : recycle_identifier();
-
466  }
-
467 
-
477  [[nodiscard]] entity_type create(const entity_type hint) {
-
478  const auto length = entities.size();
+
433  template<typename Component>
+
434  decltype(auto) storage(const id_type id = type_hash<std::remove_const_t<Component>>::value()) {
+
435  if constexpr(std::is_const_v<Component>) {
+
436  return std::as_const(*this).template storage<std::remove_const_t<Component>>(id);
+
437  } else {
+
438  return assure<Component>(id);
+
439  }
+
440  }
+
441 
+
453  template<typename Component>
+
454  decltype(auto) storage(const id_type id = type_hash<std::remove_const_t<Component>>::value()) const {
+
455  return assure<std::remove_const_t<Component>>(id);
+
456  }
+
457 
+
462  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
+
463  return entities.size();
+
464  }
+
465 
+
470  [[nodiscard]] size_type alive() const {
+
471  auto sz = entities.size();
+
472 
+
473  for(auto curr = free_list; curr != null; --sz) {
+
474  curr = entities[entity_traits::to_entity(curr)];
+
475  }
+
476 
+
477  return sz;
+
478  }
479 
-
480  if(hint == null || hint == tombstone) {
-
481  return create();
-
482  } else if(const auto req = entity_traits::to_entity(hint); !(req < length)) {
-
483  entities.resize(size_type(req) + 1u, null);
-
484 
-
485  for(auto pos = length; pos < req; ++pos) {
-
486  release_entity(generate_identifier(pos), {});
-
487  }
-
488 
-
489  return (entities[req] = hint);
-
490  } else if(const auto curr = entity_traits::to_entity(entities[req]); req == curr) {
-
491  return create();
-
492  } else {
-
493  auto *it = &free_list;
-
494  for(; entity_traits::to_entity(*it) != req; it = &entities[entity_traits::to_entity(*it)]) {}
-
495  *it = entity_traits::combine(curr, entity_traits::to_integral(*it));
-
496  return (entities[req] = hint);
-
497  }
-
498  }
-
499 
-
509  template<typename It>
-
510  void create(It first, It last) {
-
511  for(; free_list != null && first != last; ++first) {
-
512  *first = recycle_identifier();
-
513  }
-
514 
-
515  const auto length = entities.size();
-
516  entities.resize(length + std::distance(first, last), null);
-
517 
-
518  for(auto pos = length; first != last; ++first, ++pos) {
-
519  *first = entities[pos] = generate_identifier(pos);
-
520  }
-
521  }
-
522 
-
540  template<typename It>
-
541  void assign(It first, It last, const entity_type destroyed) {
-
542  ENTT_ASSERT(!alive(), "Entities still alive");
-
543  entities.assign(first, last);
-
544  free_list = destroyed;
-
545  }
-
546 
-
558  version_type release(const entity_type entity) {
-
559  return release(entity, entity_traits::to_version(entity) + 1u);
+
484  void reserve(const size_type cap) {
+
485  entities.reserve(cap);
+
486  }
+
487 
+
493  [[nodiscard]] size_type capacity() const ENTT_NOEXCEPT {
+
494  return entities.capacity();
+
495  }
+
496 
+
501  [[nodiscard]] bool empty() const {
+
502  return !alive();
+
503  }
+
504 
+
517  [[nodiscard]] const entity_type *data() const ENTT_NOEXCEPT {
+
518  return entities.data();
+
519  }
+
520 
+
529  [[nodiscard]] entity_type released() const ENTT_NOEXCEPT {
+
530  return free_list;
+
531  }
+
532 
+
538  [[nodiscard]] bool valid(const entity_type entity) const {
+
539  const auto pos = size_type(entity_traits::to_entity(entity));
+
540  return (pos < entities.size() && entities[pos] == entity);
+
541  }
+
542 
+
549  [[nodiscard]] version_type current(const entity_type entity) const {
+
550  const auto pos = size_type(entity_traits::to_entity(entity));
+
551  return entity_traits::to_version(pos < entities.size() ? entities[pos] : tombstone);
+
552  }
+
553 
+
558  [[nodiscard]] entity_type create() {
+
559  return (free_list == null) ? entities.emplace_back(generate_identifier(entities.size())) : recycle_identifier();
560  }
561 
-
574  version_type release(const entity_type entity, const version_type version) {
-
575  ENTT_ASSERT(orphan(entity), "Non-orphan entity");
-
576  return release_entity(entity, version);
-
577  }
+
571  [[nodiscard]] entity_type create(const entity_type hint) {
+
572  const auto length = entities.size();
+
573 
+
574  if(hint == null || hint == tombstone) {
+
575  return create();
+
576  } else if(const auto req = entity_traits::to_entity(hint); !(req < length)) {
+
577  entities.resize(size_type(req) + 1u, null);
578 
-
588  template<typename It>
-
589  void release(It first, It last) {
-
590  for(; first != last; ++first) {
-
591  release(*first, entity_traits::to_version(*first) + 1u);
-
592  }
-
593  }
-
594 
-
608  version_type destroy(const entity_type entity) {
-
609  return destroy(entity, entity_traits::to_version(entity) + 1u);
-
610  }
+
579  for(auto pos = length; pos < req; ++pos) {
+
580  release_entity(generate_identifier(pos), {});
+
581  }
+
582 
+
583  return (entities[req] = hint);
+
584  } else if(const auto curr = entity_traits::to_entity(entities[req]); req == curr) {
+
585  return create();
+
586  } else {
+
587  auto *it = &free_list;
+
588  for(; entity_traits::to_entity(*it) != req; it = &entities[entity_traits::to_entity(*it)]) {}
+
589  *it = entity_traits::combine(curr, entity_traits::to_integral(*it));
+
590  return (entities[req] = hint);
+
591  }
+
592  }
+
593 
+
603  template<typename It>
+
604  void create(It first, It last) {
+
605  for(; free_list != null && first != last; ++first) {
+
606  *first = recycle_identifier();
+
607  }
+
608 
+
609  const auto length = entities.size();
+
610  entities.resize(length + std::distance(first, last), null);
611 
-
624  version_type destroy(const entity_type entity, const version_type version) {
-
625  ENTT_ASSERT(valid(entity), "Invalid entity");
-
626 
-
627  for(auto &&curr: pools) {
-
628  curr.second->remove(entity);
-
629  }
-
630 
-
631  return release_entity(entity, version);
-
632  }
-
633 
-
643  template<typename It>
-
644  void destroy(It first, It last) {
-
645  if constexpr(is_iterator_type_v<typename basic_common_type::iterator, It>) {
-
646  for(; first != last; ++first) {
-
647  destroy(*first, entity_traits::to_version(*first) + 1u);
-
648  }
-
649  } else {
-
650  for(auto &&curr: pools) {
-
651  curr.second->remove(first, last);
-
652  }
-
653 
-
654  release(first, last);
-
655  }
-
656  }
-
657 
-
673  template<typename Component, typename... Args>
-
674  decltype(auto) emplace(const entity_type entity, Args &&...args) {
-
675  ENTT_ASSERT(valid(entity), "Invalid entity");
-
676  return assure<Component>().emplace(entity, std::forward<Args>(args)...);
-
677  }
-
678 
-
690  template<typename Component, typename It>
-
691  void insert(It first, It last, const Component &value = {}) {
-
692  ENTT_ASSERT(std::all_of(first, last, [this](const auto entity) { return valid(entity); }), "Invalid entity");
-
693  assure<Component>().insert(first, last, value);
-
694  }
-
695 
-
708  template<typename Component, typename EIt, typename CIt, typename = std::enable_if_t<std::is_same_v<std::decay_t<typename std::iterator_traits<CIt>::value_type>, Component>>>
-
709  void insert(EIt first, EIt last, CIt from) {
-
710  ENTT_ASSERT(std::all_of(first, last, [this](const auto entity) { return valid(entity); }), "Invalid entity");
-
711  assure<Component>().insert(first, last, from);
-
712  }
-
713 
-
726  template<typename Component, typename... Args>
-
727  decltype(auto) emplace_or_replace(const entity_type entity, Args &&...args) {
-
728  ENTT_ASSERT(valid(entity), "Invalid entity");
-
729  auto &cpool = assure<Component>();
-
730 
-
731  return cpool.contains(entity)
-
732  ? cpool.patch(entity, [&args...](auto &...curr) { ((curr = Component{std::forward<Args>(args)...}), ...); })
-
733  : cpool.emplace(entity, std::forward<Args>(args)...);
-
734  }
-
735 
-
760  template<typename Component, typename... Func>
-
761  decltype(auto) patch(const entity_type entity, Func &&...func) {
-
762  ENTT_ASSERT(valid(entity), "Invalid entity");
-
763  return assure<Component>().patch(entity, std::forward<Func>(func)...);
-
764  }
-
765 
-
781  template<typename Component, typename... Args>
-
782  decltype(auto) replace(const entity_type entity, Args &&...args) {
-
783  ENTT_ASSERT(valid(entity), "Invalid entity");
-
784  return assure<Component>().patch(entity, [&args...](auto &...curr) { ((curr = Component{std::forward<Args>(args)...}), ...); });
-
785  }
-
786 
-
798  template<typename Component, typename... Other>
-
799  size_type remove(const entity_type entity) {
-
800  ENTT_ASSERT(valid(entity), "Invalid entity");
-
801  return (assure<Component>().remove(entity) + ... + assure<Other>().remove(entity));
-
802  }
-
803 
-
816  template<typename Component, typename... Other, typename It>
-
817  size_type remove(It first, It last) {
-
818  size_type count{};
-
819 
-
820  for(const auto cpools = std::forward_as_tuple(assure<Component>(), assure<Other>()...); first != last; ++first) {
-
821  const auto entity = *first;
-
822  ENTT_ASSERT(valid(entity), "Invalid entity");
-
823  count += (std::get<storage_type<Component> &>(cpools).remove(entity) + ... + std::get<storage_type<Other> &>(cpools).remove(entity));
-
824  }
-
825 
-
826  return count;
-
827  }
-
828 
-
840  template<typename Component, typename... Other>
-
841  void erase(const entity_type entity) {
-
842  ENTT_ASSERT(valid(entity), "Invalid entity");
-
843  (assure<Component>().erase(entity), (assure<Other>().erase(entity), ...));
-
844  }
-
845 
-
857  template<typename Component, typename... Other, typename It>
-
858  void erase(It first, It last) {
-
859  for(const auto cpools = std::forward_as_tuple(assure<Component>(), assure<Other>()...); first != last; ++first) {
-
860  const auto entity = *first;
-
861  ENTT_ASSERT(valid(entity), "Invalid entity");
-
862  (std::get<storage_type<Component> &>(cpools).erase(entity), (std::get<storage_type<Other> &>(cpools).erase(entity), ...));
-
863  }
-
864  }
-
865 
-
871  template<typename... Component>
-
872  void compact() {
-
873  if constexpr(sizeof...(Component) == 0) {
-
874  for(auto &&curr: pools) {
-
875  curr.second->compact();
-
876  }
-
877  } else {
-
878  (assure<Component>().compact(), ...);
-
879  }
-
880  }
-
881 
-
892  template<typename... Component>
-
893  [[nodiscard]] bool all_of(const entity_type entity) const {
-
894  ENTT_ASSERT(valid(entity), "Invalid entity");
-
895  return (assure<std::remove_const_t<Component>>().contains(entity) && ...);
-
896  }
-
897 
-
909  template<typename... Component>
-
910  [[nodiscard]] bool any_of(const entity_type entity) const {
-
911  ENTT_ASSERT(valid(entity), "Invalid entity");
-
912  return (assure<std::remove_const_t<Component>>().contains(entity) || ...);
-
913  }
+
612  for(auto pos = length; first != last; ++first, ++pos) {
+
613  *first = entities[pos] = generate_identifier(pos);
+
614  }
+
615  }
+
616 
+
634  template<typename It>
+
635  void assign(It first, It last, const entity_type destroyed) {
+
636  ENTT_ASSERT(!alive(), "Entities still alive");
+
637  entities.assign(first, last);
+
638  free_list = destroyed;
+
639  }
+
640 
+
652  version_type release(const entity_type entity) {
+
653  return release(entity, static_cast<version_type>(entity_traits::to_version(entity) + 1u));
+
654  }
+
655 
+
668  version_type release(const entity_type entity, const version_type version) {
+
669  ENTT_ASSERT(orphan(entity), "Non-orphan entity");
+
670  return release_entity(entity, version);
+
671  }
+
672 
+
682  template<typename It>
+
683  void release(It first, It last) {
+
684  for(; first != last; ++first) {
+
685  release(*first);
+
686  }
+
687  }
+
688 
+
702  version_type destroy(const entity_type entity) {
+
703  return destroy(entity, static_cast<version_type>(entity_traits::to_version(entity) + 1u));
+
704  }
+
705 
+
718  version_type destroy(const entity_type entity, const version_type version) {
+
719  ENTT_ASSERT(valid(entity), "Invalid entity");
+
720 
+
721  for(size_type pos = pools.size(); pos; --pos) {
+
722  pools.begin()[pos - 1u].second->remove(entity);
+
723  }
+
724 
+
725  return release_entity(entity, version);
+
726  }
+
727 
+
737  template<typename It>
+
738  void destroy(It first, It last) {
+
739  for(; first != last; ++first) {
+
740  destroy(*first);
+
741  }
+
742  }
+
743 
+
759  template<typename Component, typename... Args>
+
760  decltype(auto) emplace(const entity_type entity, Args &&...args) {
+
761  ENTT_ASSERT(valid(entity), "Invalid entity");
+
762  return assure<Component>().emplace(entity, std::forward<Args>(args)...);
+
763  }
+
764 
+
776  template<typename Component, typename It>
+
777  void insert(It first, It last, const Component &value = {}) {
+
778  ENTT_ASSERT(std::all_of(first, last, [this](const auto entity) { return valid(entity); }), "Invalid entity");
+
779  assure<Component>().insert(first, last, value);
+
780  }
+
781 
+
794  template<typename Component, typename EIt, typename CIt, typename = std::enable_if_t<std::is_same_v<typename std::iterator_traits<CIt>::value_type, Component>>>
+
795  void insert(EIt first, EIt last, CIt from) {
+
796  ENTT_ASSERT(std::all_of(first, last, [this](const auto entity) { return valid(entity); }), "Invalid entity");
+
797  assure<Component>().insert(first, last, from);
+
798  }
+
799 
+
812  template<typename Component, typename... Args>
+
813  decltype(auto) emplace_or_replace(const entity_type entity, Args &&...args) {
+
814  ENTT_ASSERT(valid(entity), "Invalid entity");
+
815  auto &cpool = assure<Component>();
+
816 
+
817  return cpool.contains(entity)
+
818  ? cpool.patch(entity, [&args...](auto &...curr) { ((curr = Component{std::forward<Args>(args)...}), ...); })
+
819  : cpool.emplace(entity, std::forward<Args>(args)...);
+
820  }
+
821 
+
846  template<typename Component, typename... Func>
+
847  decltype(auto) patch(const entity_type entity, Func &&...func) {
+
848  ENTT_ASSERT(valid(entity), "Invalid entity");
+
849  return assure<Component>().patch(entity, std::forward<Func>(func)...);
+
850  }
+
851 
+
867  template<typename Component, typename... Args>
+
868  decltype(auto) replace(const entity_type entity, Args &&...args) {
+
869  ENTT_ASSERT(valid(entity), "Invalid entity");
+
870  return assure<Component>().patch(entity, [&args...](auto &...curr) { ((curr = Component{std::forward<Args>(args)...}), ...); });
+
871  }
+
872 
+
884  template<typename Component, typename... Other>
+
885  size_type remove(const entity_type entity) {
+
886  ENTT_ASSERT(valid(entity), "Invalid entity");
+
887  return (assure<Component>().remove(entity) + ... + assure<Other>().remove(entity));
+
888  }
+
889 
+
902  template<typename Component, typename... Other, typename It>
+
903  size_type remove(It first, It last) {
+
904  if constexpr(sizeof...(Other) == 0u) {
+
905  ENTT_ASSERT(std::all_of(first, last, [this](const auto entity) { return valid(entity); }), "Invalid entity");
+
906  return assure<Component>().remove(std::move(first), std::move(last));
+
907  } else {
+
908  size_type count{};
+
909 
+
910  for(auto cpools = std::forward_as_tuple(assure<Component>(), assure<Other>()...); first != last; ++first) {
+
911  ENTT_ASSERT(valid(*first), "Invalid entity");
+
912  count += std::apply([entt = *first](auto &...curr) { return (curr.remove(entt) + ... + 0u); }, cpools);
+
913  }
914 
-
926  template<typename... Component>
-
927  [[nodiscard]] decltype(auto) get([[maybe_unused]] const entity_type entity) const {
-
928  ENTT_ASSERT(valid(entity), "Invalid entity");
-
929  return view<Component...>().template get<const Component...>(entity);
-
930  }
-
931 
-
933  template<typename... Component>
-
934  [[nodiscard]] decltype(auto) get([[maybe_unused]] const entity_type entity) {
-
935  ENTT_ASSERT(valid(entity), "Invalid entity");
-
936  return view<Component...>().template get<Component...>(entity);
-
937  }
-
938 
-
954  template<typename Component, typename... Args>
-
955  [[nodiscard]] decltype(auto) get_or_emplace(const entity_type entity, Args &&...args) {
-
956  ENTT_ASSERT(valid(entity), "Invalid entity");
-
957  auto &cpool = assure<Component>();
-
958  return cpool.contains(entity) ? cpool.get(entity) : cpool.emplace(entity, std::forward<Args>(args)...);
-
959  }
-
960 
-
974  template<typename... Component>
-
975  [[nodiscard]] auto try_get([[maybe_unused]] const entity_type entity) const {
-
976  ENTT_ASSERT(valid(entity), "Invalid entity");
-
977 
-
978  if constexpr(sizeof...(Component) == 1) {
-
979  const auto &cpool = assure<std::remove_const_t<Component>...>();
-
980  return cpool.contains(entity) ? std::addressof(cpool.get(entity)) : nullptr;
-
981  } else {
-
982  return std::make_tuple(try_get<Component>(entity)...);
-
983  }
-
984  }
-
985 
-
987  template<typename... Component>
-
988  [[nodiscard]] auto try_get([[maybe_unused]] const entity_type entity) {
-
989  if constexpr(sizeof...(Component) == 1) {
-
990  return (const_cast<Component *>(std::as_const(*this).template try_get<Component>(entity)), ...);
-
991  } else {
-
992  return std::make_tuple(try_get<Component>(entity)...);
-
993  }
-
994  }
-
995 
-
1000  template<typename... Component>
-
1001  void clear() {
-
1002  if constexpr(sizeof...(Component) == 0) {
-
1003  for(auto &&curr: pools) {
-
1004  curr.second->clear();
-
1005  }
-
1006 
-
1007  each([this](const auto entity) { release_entity(entity, entity_traits::to_version(entity) + 1u); });
-
1008  } else {
-
1009  (assure<Component>().clear(), ...);
-
1010  }
-
1011  }
-
1012 
-
1027  template<typename Func>
-
1028  void each(Func func) const {
-
1029  if(free_list == null) {
-
1030  for(auto pos = entities.size(); pos; --pos) {
-
1031  func(entities[pos - 1]);
-
1032  }
-
1033  } else {
-
1034  for(auto pos = entities.size(); pos; --pos) {
-
1035  if(const auto entity = entities[pos - 1]; entity_traits::to_entity(entity) == (pos - 1)) {
-
1036  func(entity);
-
1037  }
-
1038  }
-
1039  }
-
1040  }
-
1041 
-
1047  [[nodiscard]] bool orphan(const entity_type entity) const {
-
1048  ENTT_ASSERT(valid(entity), "Invalid entity");
-
1049  return std::none_of(pools.cbegin(), pools.cend(), [entity](auto &&curr) { return curr.second->contains(entity); });
-
1050  }
-
1051 
-
1070  template<typename Component>
-
1071  [[nodiscard]] auto on_construct() {
-
1072  return assure<Component>().on_construct();
-
1073  }
-
1074 
-
1093  template<typename Component>
-
1094  [[nodiscard]] auto on_update() {
-
1095  return assure<Component>().on_update();
-
1096  }
-
1097 
-
1116  template<typename Component>
-
1117  [[nodiscard]] auto on_destroy() {
-
1118  return assure<Component>().on_destroy();
-
1119  }
-
1120 
-
1134  template<typename Component, typename... Other, typename... Exclude>
-
1135  [[nodiscard]] basic_view<Entity, get_t<std::add_const_t<Component>, std::add_const_t<Other>...>, exclude_t<Exclude...>> view(exclude_t<Exclude...> = {}) const {
-
1136  return {assure<std::remove_const_t<Component>>(), assure<std::remove_const_t<Other>>()..., assure<Exclude>()...};
-
1137  }
-
1138 
-
1140  template<typename Component, typename... Other, typename... Exclude>
-
1141  [[nodiscard]] basic_view<Entity, get_t<Component, Other...>, exclude_t<Exclude...>> view(exclude_t<Exclude...> = {}) {
-
1142  return {assure<std::remove_const_t<Component>>(), assure<std::remove_const_t<Other>>()..., assure<Exclude>()...};
-
1143  }
-
1144 
-
1168  template<typename ItComp, typename ItExcl = id_type *>
-
1169  [[nodiscard]] basic_runtime_view<Entity> runtime_view(ItComp first, ItComp last, ItExcl from = {}, ItExcl to = {}) const {
-
1170  std::vector<const basic_common_type *> component{};
-
1171  std::vector<const basic_common_type *> filter{};
-
1172 
-
1173  component.reserve(std::distance(first, last));
-
1174  filter.reserve(std::distance(from, to));
-
1175 
-
1176  for(; first != last; ++first) {
-
1177  const auto it = pools.find(*first);
-
1178  component.emplace_back(it == pools.cend() ? nullptr : it->second.get());
-
1179  }
-
1180 
-
1181  for(; from != to; ++from) {
-
1182  const auto it = pools.find(*from);
-
1183  filter.emplace_back(it == pools.cend() ? nullptr : it->second.get());
-
1184  }
-
1185 
-
1186  return {std::move(component), std::move(filter)};
-
1187  }
-
1188 
-
1213  template<typename... Owned, typename... Get, typename... Exclude>
-
1214  [[nodiscard]] basic_group<Entity, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...>> group(get_t<Get...>, exclude_t<Exclude...> = {}) {
-
1215  static_assert(sizeof...(Owned) + sizeof...(Get) > 0, "Exclusion-only groups are not supported");
-
1216  static_assert(sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude) > 1, "Single component groups are not allowed");
-
1217 
-
1218  using handler_type = group_handler<exclude_t<std::remove_const_t<Exclude>...>, get_t<std::remove_const_t<Get>...>, std::remove_const_t<Owned>...>;
-
1219 
-
1220  const auto cpools = std::forward_as_tuple(assure<std::remove_const_t<Owned>>()..., assure<std::remove_const_t<Get>>()...);
-
1221  constexpr auto size = sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude);
-
1222  handler_type *handler = nullptr;
-
1223 
-
1224  auto it = std::find_if(groups.cbegin(), groups.cend(), [size](const auto &gdata) {
-
1225  return gdata.size == size
-
1226  && (gdata.owned(type_hash<std::remove_const_t<Owned>>::value()) && ...)
-
1227  && (gdata.get(type_hash<std::remove_const_t<Get>>::value()) && ...)
-
1228  && (gdata.exclude(type_hash<Exclude>::value()) && ...);
-
1229  });
-
1230 
-
1231  if(it != groups.cend()) {
-
1232  handler = static_cast<handler_type *>(it->group.get());
-
1233  } else {
-
1234  group_data candidate = {
-
1235  size,
-
1236  {new handler_type{}, [](void *instance) { delete static_cast<handler_type *>(instance); }},
-
1237  []([[maybe_unused]] const id_type ctype) ENTT_NOEXCEPT { return ((ctype == type_hash<std::remove_const_t<Owned>>::value()) || ...); },
-
1238  []([[maybe_unused]] const id_type ctype) ENTT_NOEXCEPT { return ((ctype == type_hash<std::remove_const_t<Get>>::value()) || ...); },
-
1239  []([[maybe_unused]] const id_type ctype) ENTT_NOEXCEPT { return ((ctype == type_hash<Exclude>::value()) || ...); },
-
1240  };
-
1241 
-
1242  handler = static_cast<handler_type *>(candidate.group.get());
-
1243 
-
1244  const void *maybe_valid_if = nullptr;
-
1245  const void *discard_if = nullptr;
-
1246 
-
1247  if constexpr(sizeof...(Owned) == 0) {
-
1248  groups.push_back(std::move(candidate));
-
1249  } else {
-
1250  [[maybe_unused]] auto has_conflict = [size](const auto &gdata) {
-
1251  const auto overlapping = (0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value()));
-
1252  const auto sz = overlapping + (0u + ... + gdata.get(type_hash<std::remove_const_t<Get>>::value())) + (0u + ... + gdata.exclude(type_hash<Exclude>::value()));
-
1253  return !overlapping || ((sz == size) || (sz == gdata.size));
-
1254  };
-
1255 
-
1256  ENTT_ASSERT(std::all_of(groups.cbegin(), groups.cend(), std::move(has_conflict)), "Conflicting groups");
-
1257 
-
1258  const auto next = std::find_if_not(groups.cbegin(), groups.cend(), [size](const auto &gdata) {
-
1259  return !(0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value())) || (size > gdata.size);
-
1260  });
-
1261 
-
1262  const auto prev = std::find_if(std::make_reverse_iterator(next), groups.crend(), [](const auto &gdata) {
-
1263  return (0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value()));
-
1264  });
-
1265 
-
1266  maybe_valid_if = (next == groups.cend() ? maybe_valid_if : next->group.get());
-
1267  discard_if = (prev == groups.crend() ? discard_if : prev->group.get());
-
1268  groups.insert(next, std::move(candidate));
-
1269  }
-
1270 
-
1271  (on_construct<std::remove_const_t<Owned>>().before(maybe_valid_if).template connect<&handler_type::template maybe_valid_if<std::remove_const_t<Owned>>>(*handler), ...);
-
1272  (on_construct<std::remove_const_t<Get>>().before(maybe_valid_if).template connect<&handler_type::template maybe_valid_if<std::remove_const_t<Get>>>(*handler), ...);
-
1273  (on_destroy<Exclude>().before(maybe_valid_if).template connect<&handler_type::template maybe_valid_if<Exclude>>(*handler), ...);
-
1274 
-
1275  (on_destroy<std::remove_const_t<Owned>>().before(discard_if).template connect<&handler_type::discard_if>(*handler), ...);
-
1276  (on_destroy<std::remove_const_t<Get>>().before(discard_if).template connect<&handler_type::discard_if>(*handler), ...);
-
1277  (on_construct<Exclude>().before(discard_if).template connect<&handler_type::discard_if>(*handler), ...);
-
1278 
-
1279  if constexpr(sizeof...(Owned) == 0) {
-
1280  for(const auto entity: view<Owned..., Get...>(exclude<Exclude...>)) {
-
1281  handler->current.emplace(entity);
-
1282  }
-
1283  } else {
-
1284  // we cannot iterate backwards because we want to leave behind valid entities in case of owned types
-
1285  for(auto *first = std::get<0>(cpools).data(), *last = first + std::get<0>(cpools).size(); first != last; ++first) {
-
1286  handler->template maybe_valid_if<type_list_element_t<0, type_list<std::remove_const_t<Owned>...>>>(*this, *first);
-
1287  }
-
1288  }
-
1289  }
-
1290 
-
1291  return {handler->current, std::get<storage_type<std::remove_const_t<Owned>> &>(cpools)..., std::get<storage_type<std::remove_const_t<Get>> &>(cpools)...};
-
1292  }
+
915  return count;
+
916  }
+
917  }
+
918 
+
930  template<typename Component, typename... Other>
+
931  void erase(const entity_type entity) {
+
932  ENTT_ASSERT(valid(entity), "Invalid entity");
+
933  (assure<Component>().erase(entity), (assure<Other>().erase(entity), ...));
+
934  }
+
935 
+
947  template<typename Component, typename... Other, typename It>
+
948  void erase(It first, It last) {
+
949  if constexpr(sizeof...(Other) == 0u) {
+
950  ENTT_ASSERT(std::all_of(first, last, [this](const auto entity) { return valid(entity); }), "Invalid entity");
+
951  assure<Component>().erase(std::move(first), std::move(last));
+
952  } else {
+
953  for(auto cpools = std::forward_as_tuple(assure<Component>(), assure<Other>()...); first != last; ++first) {
+
954  ENTT_ASSERT(valid(*first), "Invalid entity");
+
955  std::apply([entt = *first](auto &...curr) { (curr.erase(entt), ...); }, cpools);
+
956  }
+
957  }
+
958  }
+
959 
+
965  template<typename... Component>
+
966  void compact() {
+
967  if constexpr(sizeof...(Component) == 0) {
+
968  for(auto &&curr: pools) {
+
969  curr.second->compact();
+
970  }
+
971  } else {
+
972  (assure<Component>().compact(), ...);
+
973  }
+
974  }
+
975 
+
986  template<typename... Component>
+
987  [[nodiscard]] bool all_of(const entity_type entity) const {
+
988  ENTT_ASSERT(valid(entity), "Invalid entity");
+
989  return (assure<std::remove_const_t<Component>>().contains(entity) && ...);
+
990  }
+
991 
+
1003  template<typename... Component>
+
1004  [[nodiscard]] bool any_of(const entity_type entity) const {
+
1005  ENTT_ASSERT(valid(entity), "Invalid entity");
+
1006  return (assure<std::remove_const_t<Component>>().contains(entity) || ...);
+
1007  }
+
1008 
+
1020  template<typename... Component>
+
1021  [[nodiscard]] decltype(auto) get([[maybe_unused]] const entity_type entity) const {
+
1022  ENTT_ASSERT(valid(entity), "Invalid entity");
+
1023  return view<Component...>().template get<const Component...>(entity);
+
1024  }
+
1025 
+
1027  template<typename... Component>
+
1028  [[nodiscard]] decltype(auto) get([[maybe_unused]] const entity_type entity) {
+
1029  ENTT_ASSERT(valid(entity), "Invalid entity");
+
1030  return view<Component...>().template get<Component...>(entity);
+
1031  }
+
1032 
+
1048  template<typename Component, typename... Args>
+
1049  [[nodiscard]] decltype(auto) get_or_emplace(const entity_type entity, Args &&...args) {
+
1050  ENTT_ASSERT(valid(entity), "Invalid entity");
+
1051  auto &cpool = assure<Component>();
+
1052  return cpool.contains(entity) ? cpool.get(entity) : cpool.emplace(entity, std::forward<Args>(args)...);
+
1053  }
+
1054 
+
1068  template<typename... Component>
+
1069  [[nodiscard]] auto try_get([[maybe_unused]] const entity_type entity) const {
+
1070  ENTT_ASSERT(valid(entity), "Invalid entity");
+
1071 
+
1072  if constexpr(sizeof...(Component) == 1) {
+
1073  const auto &cpool = assure<std::remove_const_t<Component>...>();
+
1074  return cpool.contains(entity) ? std::addressof(cpool.get(entity)) : nullptr;
+
1075  } else {
+
1076  return std::make_tuple(try_get<Component>(entity)...);
+
1077  }
+
1078  }
+
1079 
+
1081  template<typename... Component>
+
1082  [[nodiscard]] auto try_get([[maybe_unused]] const entity_type entity) {
+
1083  if constexpr(sizeof...(Component) == 1) {
+
1084  return (const_cast<Component *>(std::as_const(*this).template try_get<Component>(entity)), ...);
+
1085  } else {
+
1086  return std::make_tuple(try_get<Component>(entity)...);
+
1087  }
+
1088  }
+
1089 
+
1094  template<typename... Component>
+
1095  void clear() {
+
1096  if constexpr(sizeof...(Component) == 0) {
+
1097  for(auto &&curr: pools) {
+
1098  curr.second->clear();
+
1099  }
+
1100 
+
1101  each([this](const auto entity) { this->release(entity); });
+
1102  } else {
+
1103  (assure<Component>().clear(), ...);
+
1104  }
+
1105  }
+
1106 
+
1121  template<typename Func>
+
1122  void each(Func func) const {
+
1123  if(free_list == null) {
+
1124  for(auto pos = entities.size(); pos; --pos) {
+
1125  func(entities[pos - 1]);
+
1126  }
+
1127  } else {
+
1128  for(auto pos = entities.size(); pos; --pos) {
+
1129  if(const auto entity = entities[pos - 1]; entity_traits::to_entity(entity) == (pos - 1)) {
+
1130  func(entity);
+
1131  }
+
1132  }
+
1133  }
+
1134  }
+
1135 
+
1141  [[nodiscard]] bool orphan(const entity_type entity) const {
+
1142  ENTT_ASSERT(valid(entity), "Invalid entity");
+
1143  return std::none_of(pools.cbegin(), pools.cend(), [entity](auto &&curr) { return curr.second->contains(entity); });
+
1144  }
+
1145 
+
1164  template<typename Component>
+
1165  [[nodiscard]] auto on_construct() {
+
1166  return assure<Component>().on_construct();
+
1167  }
+
1168 
+
1187  template<typename Component>
+
1188  [[nodiscard]] auto on_update() {
+
1189  return assure<Component>().on_update();
+
1190  }
+
1191 
+
1210  template<typename Component>
+
1211  [[nodiscard]] auto on_destroy() {
+
1212  return assure<Component>().on_destroy();
+
1213  }
+
1214 
+
1228  template<typename Component, typename... Other, typename... Exclude>
+
1229  [[nodiscard]] basic_view<entity_type, get_t<std::add_const_t<Component>, std::add_const_t<Other>...>, exclude_t<Exclude...>> view(exclude_t<Exclude...> = {}) const {
+
1230  return {assure<std::remove_const_t<Component>>(), assure<std::remove_const_t<Other>>()..., assure<Exclude>()...};
+
1231  }
+
1232 
+
1234  template<typename Component, typename... Other, typename... Exclude>
+
1235  [[nodiscard]] basic_view<entity_type, get_t<Component, Other...>, exclude_t<Exclude...>> view(exclude_t<Exclude...> = {}) {
+
1236  return {assure<std::remove_const_t<Component>>(), assure<std::remove_const_t<Other>>()..., assure<Exclude>()...};
+
1237  }
+
1238 
+
1263  template<typename... Owned, typename... Get, typename... Exclude>
+
1264  [[nodiscard]] basic_group<entity_type, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...>> group(get_t<Get...>, exclude_t<Exclude...> = {}) {
+
1265  static_assert(sizeof...(Owned) + sizeof...(Get) > 0, "Exclusion-only groups are not supported");
+
1266  static_assert(sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude) > 1, "Single component groups are not allowed");
+
1267 
+
1268  using handler_type = group_handler<exclude_t<std::remove_const_t<Exclude>...>, get_t<std::remove_const_t<Get>...>, std::remove_const_t<Owned>...>;
+
1269 
+
1270  const auto cpools = std::forward_as_tuple(assure<std::remove_const_t<Owned>>()..., assure<std::remove_const_t<Get>>()...);
+
1271  constexpr auto size = sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude);
+
1272  handler_type *handler = nullptr;
+
1273 
+
1274  auto it = std::find_if(groups.cbegin(), groups.cend(), [size](const auto &gdata) {
+
1275  return gdata.size == size
+
1276  && (gdata.owned(type_hash<std::remove_const_t<Owned>>::value()) && ...)
+
1277  && (gdata.get(type_hash<std::remove_const_t<Get>>::value()) && ...)
+
1278  && (gdata.exclude(type_hash<Exclude>::value()) && ...);
+
1279  });
+
1280 
+
1281  if(it != groups.cend()) {
+
1282  handler = static_cast<handler_type *>(it->group.get());
+
1283  } else {
+
1284  group_data candidate = {
+
1285  size,
+
1286  {new handler_type{}, [](void *instance) { delete static_cast<handler_type *>(instance); }},
+
1287  []([[maybe_unused]] const id_type ctype) ENTT_NOEXCEPT { return ((ctype == type_hash<std::remove_const_t<Owned>>::value()) || ...); },
+
1288  []([[maybe_unused]] const id_type ctype) ENTT_NOEXCEPT { return ((ctype == type_hash<std::remove_const_t<Get>>::value()) || ...); },
+
1289  []([[maybe_unused]] const id_type ctype) ENTT_NOEXCEPT { return ((ctype == type_hash<Exclude>::value()) || ...); },
+
1290  };
+
1291 
+
1292  handler = static_cast<handler_type *>(candidate.group.get());
1293 
-
1295  template<typename... Owned, typename... Get, typename... Exclude>
-
1296  [[nodiscard]] basic_group<Entity, owned_t<std::add_const_t<Owned>...>, get_t<std::add_const_t<Get>...>, exclude_t<Exclude...>> group_if_exists(get_t<Get...>, exclude_t<Exclude...> = {}) const {
-
1297  auto it = std::find_if(groups.cbegin(), groups.cend(), [](const auto &gdata) {
-
1298  return gdata.size == (sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude))
-
1299  && (gdata.owned(type_hash<std::remove_const_t<Owned>>::value()) && ...)
-
1300  && (gdata.get(type_hash<std::remove_const_t<Get>>::value()) && ...)
-
1301  && (gdata.exclude(type_hash<Exclude>::value()) && ...);
-
1302  });
-
1303 
-
1304  if(it == groups.cend()) {
-
1305  return {};
-
1306  } else {
-
1307  using handler_type = group_handler<exclude_t<std::remove_const_t<Exclude>...>, get_t<std::remove_const_t<Get>...>, std::remove_const_t<Owned>...>;
-
1308  return {static_cast<handler_type *>(it->group.get())->current, assure<std::remove_const_t<Owned>>()..., assure<std::remove_const_t<Get>>()...};
-
1309  }
-
1310  }
+
1294  const void *maybe_valid_if = nullptr;
+
1295  const void *discard_if = nullptr;
+
1296 
+
1297  if constexpr(sizeof...(Owned) == 0) {
+
1298  groups.push_back(std::move(candidate));
+
1299  } else {
+
1300  [[maybe_unused]] auto has_conflict = [size](const auto &gdata) {
+
1301  const auto overlapping = (0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value()));
+
1302  const auto sz = overlapping + (0u + ... + gdata.get(type_hash<std::remove_const_t<Get>>::value())) + (0u + ... + gdata.exclude(type_hash<Exclude>::value()));
+
1303  return !overlapping || ((sz == size) || (sz == gdata.size));
+
1304  };
+
1305 
+
1306  ENTT_ASSERT(std::all_of(groups.cbegin(), groups.cend(), std::move(has_conflict)), "Conflicting groups");
+
1307 
+
1308  const auto next = std::find_if_not(groups.cbegin(), groups.cend(), [size](const auto &gdata) {
+
1309  return !(0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value())) || (size > gdata.size);
+
1310  });
1311 
-
1313  template<typename... Owned, typename... Exclude>
-
1314  [[nodiscard]] basic_group<Entity, owned_t<Owned...>, get_t<>, exclude_t<Exclude...>> group(exclude_t<Exclude...> = {}) {
-
1315  return group<Owned...>(get_t<>{}, exclude<Exclude...>);
-
1316  }
-
1317 
-
1319  template<typename... Owned, typename... Exclude>
-
1320  [[nodiscard]] basic_group<Entity, owned_t<std::add_const_t<Owned>...>, get_t<>, exclude_t<Exclude...>> group_if_exists(exclude_t<Exclude...> = {}) const {
-
1321  return group_if_exists<std::add_const_t<Owned>...>(get_t<>{}, exclude<Exclude...>);
-
1322  }
-
1323 
-
1330  template<typename... Component>
-
1331  [[nodiscard]] bool sortable() const {
-
1332  return std::none_of(groups.cbegin(), groups.cend(), [](auto &&gdata) { return (gdata.owned(type_hash<std::remove_const_t<Component>>::value()) || ...); });
-
1333  }
-
1334 
-
1342  template<typename... Owned, typename... Get, typename... Exclude>
-
1343  [[nodiscard]] bool sortable(const basic_group<Entity, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...>> &) ENTT_NOEXCEPT {
-
1344  constexpr auto size = sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude);
-
1345  auto pred = [size](const auto &gdata) { return (0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value())) && (size < gdata.size); };
-
1346  return std::find_if(groups.cbegin(), groups.cend(), std::move(pred)) == groups.cend();
-
1347  }
-
1348 
-
1384  template<typename Component, typename Compare, typename Sort = std_sort, typename... Args>
-
1385  void sort(Compare compare, Sort algo = Sort{}, Args &&...args) {
-
1386  ENTT_ASSERT(sortable<Component>(), "Cannot sort owned storage");
-
1387  auto &cpool = assure<Component>();
-
1388 
-
1389  if constexpr(std::is_invocable_v<Compare, decltype(cpool.get({})), decltype(cpool.get({}))>) {
-
1390  auto comp = [&cpool, compare = std::move(compare)](const auto lhs, const auto rhs) { return compare(std::as_const(cpool.get(lhs)), std::as_const(cpool.get(rhs))); };
-
1391  cpool.sort(std::move(comp), std::move(algo), std::forward<Args>(args)...);
-
1392  } else {
-
1393  cpool.sort(std::move(compare), std::move(algo), std::forward<Args>(args)...);
-
1394  }
-
1395  }
-
1396 
-
1416  template<typename To, typename From>
-
1417  void sort() {
-
1418  ENTT_ASSERT(sortable<To>(), "Cannot sort owned storage");
-
1419  assure<To>().respect(assure<From>());
-
1420  }
-
1421 
-
1433  template<typename Type, typename... Args>
-
1434  Type &set(Args &&...args) {
-
1435  auto &&elem = vars[type_hash<std::remove_const_t<std::remove_reference_t<Type>>>::value()];
-
1436  elem.template emplace<Type>(std::forward<Args>(args)...);
-
1437  return any_cast<Type &>(elem);
-
1438  }
-
1439 
-
1444  template<typename Type>
-
1445  void unset() {
-
1446  vars.erase(type_hash<std::remove_const_t<std::remove_reference_t<Type>>>::value());
-
1447  }
-
1448 
-
1460  template<typename Type, typename... Args>
-
1461  [[nodiscard]] Type &ctx_or_set(Args &&...args) {
-
1462  auto *elem = try_ctx<Type>();
-
1463  return elem ? *elem : set<Type>(std::forward<Args>(args)...);
-
1464  }
-
1465 
-
1472  template<typename Type>
-
1473  [[nodiscard]] std::add_const_t<Type> *try_ctx() const {
-
1474  auto it = vars.find(type_hash<std::remove_const_t<std::remove_reference_t<Type>>>::value());
-
1475  return it == vars.cend() ? nullptr : any_cast<Type>(&it->second);
-
1476  }
-
1477 
-
1479  template<typename Type>
-
1480  [[nodiscard]] Type *try_ctx() {
-
1481  if constexpr(std::is_const_v<Type>) {
-
1482  return std::as_const(*this).template try_ctx<Type>();
-
1483  } else {
-
1484  auto it = vars.find(type_hash<std::remove_const_t<std::remove_reference_t<Type>>>::value());
-
1485  return it == vars.end() ? nullptr : any_cast<Type>(&it->second);
-
1486  }
-
1487  }
-
1488 
-
1499  template<typename Type>
-
1500  [[nodiscard]] std::add_const_t<Type> &ctx() const {
-
1501  auto *value = try_ctx<Type>();
-
1502  ENTT_ASSERT(value != nullptr, "Invalid instance");
-
1503  return *value;
-
1504  }
-
1505 
-
1507  template<typename Type>
-
1508  [[nodiscard]] Type &ctx() {
-
1509  auto *value = try_ctx<Type>();
-
1510  ENTT_ASSERT(value != nullptr, "Invalid instance");
-
1511  return *value;
-
1512  }
-
1513 
-
1531  template<typename Func>
-
1532  void ctx(Func func) const {
-
1533  for(auto &&curr: vars) {
-
1534  func(curr.second.type());
-
1535  }
-
1536  }
-
1537 
-
1538 private:
-
1539  dense_hash_map<id_type, std::unique_ptr<basic_common_type>, identity> pools{};
-
1540  dense_hash_map<id_type, basic_any<0u>, identity> vars{};
-
1541  std::vector<group_data> groups{};
-
1542  std::vector<entity_type> entities{};
-
1543  entity_type free_list{tombstone};
-
1544 };
-
1545 
-
1546 } // namespace entt
-
1547 
-
1548 #endif
+
1312  const auto prev = std::find_if(std::make_reverse_iterator(next), groups.crend(), [](const auto &gdata) {
+
1313  return (0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value()));
+
1314  });
+
1315 
+
1316  maybe_valid_if = (next == groups.cend() ? maybe_valid_if : next->group.get());
+
1317  discard_if = (prev == groups.crend() ? discard_if : prev->group.get());
+
1318  groups.insert(next, std::move(candidate));
+
1319  }
+
1320 
+
1321  (on_construct<std::remove_const_t<Owned>>().before(maybe_valid_if).template connect<&handler_type::template maybe_valid_if<std::remove_const_t<Owned>>>(*handler), ...);
+
1322  (on_construct<std::remove_const_t<Get>>().before(maybe_valid_if).template connect<&handler_type::template maybe_valid_if<std::remove_const_t<Get>>>(*handler), ...);
+
1323  (on_destroy<Exclude>().before(maybe_valid_if).template connect<&handler_type::template maybe_valid_if<Exclude>>(*handler), ...);
+
1324 
+
1325  (on_destroy<std::remove_const_t<Owned>>().before(discard_if).template connect<&handler_type::discard_if>(*handler), ...);
+
1326  (on_destroy<std::remove_const_t<Get>>().before(discard_if).template connect<&handler_type::discard_if>(*handler), ...);
+
1327  (on_construct<Exclude>().before(discard_if).template connect<&handler_type::discard_if>(*handler), ...);
+
1328 
+
1329  if constexpr(sizeof...(Owned) == 0) {
+
1330  for(const auto entity: view<Owned..., Get...>(exclude<Exclude...>)) {
+
1331  handler->current.emplace(entity);
+
1332  }
+
1333  } else {
+
1334  // we cannot iterate backwards because we want to leave behind valid entities in case of owned types
+
1335  for(auto *first = std::get<0>(cpools).data(), *last = first + std::get<0>(cpools).size(); first != last; ++first) {
+
1336  handler->template maybe_valid_if<type_list_element_t<0, type_list<std::remove_const_t<Owned>...>>>(*this, *first);
+
1337  }
+
1338  }
+
1339  }
+
1340 
+
1341  return {handler->current, std::get<storage_type<std::remove_const_t<Owned>> &>(cpools)..., std::get<storage_type<std::remove_const_t<Get>> &>(cpools)...};
+
1342  }
+
1343 
+
1345  template<typename... Owned, typename... Get, typename... Exclude>
+
1346  [[nodiscard]] basic_group<entity_type, owned_t<std::add_const_t<Owned>...>, get_t<std::add_const_t<Get>...>, exclude_t<Exclude...>> group_if_exists(get_t<Get...>, exclude_t<Exclude...> = {}) const {
+
1347  auto it = std::find_if(groups.cbegin(), groups.cend(), [](const auto &gdata) {
+
1348  return gdata.size == (sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude))
+
1349  && (gdata.owned(type_hash<std::remove_const_t<Owned>>::value()) && ...)
+
1350  && (gdata.get(type_hash<std::remove_const_t<Get>>::value()) && ...)
+
1351  && (gdata.exclude(type_hash<Exclude>::value()) && ...);
+
1352  });
+
1353 
+
1354  if(it == groups.cend()) {
+
1355  return {};
+
1356  } else {
+
1357  using handler_type = group_handler<exclude_t<std::remove_const_t<Exclude>...>, get_t<std::remove_const_t<Get>...>, std::remove_const_t<Owned>...>;
+
1358  return {static_cast<handler_type *>(it->group.get())->current, assure<std::remove_const_t<Owned>>()..., assure<std::remove_const_t<Get>>()...};
+
1359  }
+
1360  }
+
1361 
+
1363  template<typename... Owned, typename... Exclude>
+
1364  [[nodiscard]] basic_group<entity_type, owned_t<Owned...>, get_t<>, exclude_t<Exclude...>> group(exclude_t<Exclude...> = {}) {
+
1365  return group<Owned...>(get_t<>{}, exclude<Exclude...>);
+
1366  }
+
1367 
+
1369  template<typename... Owned, typename... Exclude>
+
1370  [[nodiscard]] basic_group<entity_type, owned_t<std::add_const_t<Owned>...>, get_t<>, exclude_t<Exclude...>> group_if_exists(exclude_t<Exclude...> = {}) const {
+
1371  return group_if_exists<std::add_const_t<Owned>...>(get_t<>{}, exclude<Exclude...>);
+
1372  }
+
1373 
+
1380  template<typename... Component>
+
1381  [[nodiscard]] bool owned() const {
+
1382  return std::any_of(groups.cbegin(), groups.cend(), [](auto &&gdata) { return (gdata.owned(type_hash<std::remove_const_t<Component>>::value()) || ...); });
+
1383  }
+
1384 
+
1392  template<typename... Owned, typename... Get, typename... Exclude>
+
1393  [[nodiscard]] bool sortable(const basic_group<entity_type, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...>> &) ENTT_NOEXCEPT {
+
1394  constexpr auto size = sizeof...(Owned) + sizeof...(Get) + sizeof...(Exclude);
+
1395  auto pred = [size](const auto &gdata) { return (0u + ... + gdata.owned(type_hash<std::remove_const_t<Owned>>::value())) && (size < gdata.size); };
+
1396  return std::find_if(groups.cbegin(), groups.cend(), std::move(pred)) == groups.cend();
+
1397  }
+
1398 
+
1434  template<typename Component, typename Compare, typename Sort = std_sort, typename... Args>
+
1435  void sort(Compare compare, Sort algo = Sort{}, Args &&...args) {
+
1436  ENTT_ASSERT(!owned<Component>(), "Cannot sort owned storage");
+
1437  auto &cpool = assure<Component>();
+
1438 
+
1439  if constexpr(std::is_invocable_v<Compare, decltype(cpool.get({})), decltype(cpool.get({}))>) {
+
1440  auto comp = [&cpool, compare = std::move(compare)](const auto lhs, const auto rhs) { return compare(std::as_const(cpool.get(lhs)), std::as_const(cpool.get(rhs))); };
+
1441  cpool.sort(std::move(comp), std::move(algo), std::forward<Args>(args)...);
+
1442  } else {
+
1443  cpool.sort(std::move(compare), std::move(algo), std::forward<Args>(args)...);
+
1444  }
+
1445  }
+
1446 
+
1466  template<typename To, typename From>
+
1467  void sort() {
+
1468  ENTT_ASSERT(!owned<To>(), "Cannot sort owned storage");
+
1469  assure<To>().respect(assure<From>());
+
1470  }
+
1471 
+
1476  context &ctx() ENTT_NOEXCEPT {
+
1477  return vars;
+
1478  }
+
1479 
+
1481  const context &ctx() const ENTT_NOEXCEPT {
+
1482  return vars;
+
1483  }
+
1484 
+
1485 private:
+
1486  dense_map<id_type, std::unique_ptr<base_type>, identity> pools;
+
1487  std::vector<group_data> groups;
+
1488  std::vector<entity_type> entities;
+
1489  entity_type free_list;
+
1490  context vars;
+
1491 };
+
1492 
+
1493 } // namespace entt
+
1494 
+
1495 #endif
entt::basic_group
Group.
Definition: fwd.hpp:26
-
entt::basic_registry
Fast and reliable entity-component system.
Definition: registry.hpp:173
-
entt::basic_registry::ctx
Type & ctx()
Returns a reference to an object in the context of the registry.
Definition: registry.hpp:1508
-
entt::basic_registry::capacity
size_type capacity() const
Returns the number of entities that a registry has currently allocated space for.
Definition: registry.hpp:399
-
entt::basic_registry::any_of
bool any_of(const entity_type entity) const
Checks if an entity has at least one of the given components.
Definition: registry.hpp:910
-
entt::basic_registry::basic_registry
basic_registry()=default
Default constructor.
-
entt::basic_registry::orphan
bool orphan(const entity_type entity) const
Checks if an entity has components assigned.
Definition: registry.hpp:1047
-
entt::basic_registry::valid
bool valid(const entity_type entity) const
Checks if an identifier refers to a valid entity.
Definition: registry.hpp:444
-
entt::basic_registry::current
version_type current(const entity_type entity) const
Returns the actual version for an identifier.
Definition: registry.hpp:455
-
entt::basic_registry::insert
void insert(EIt first, EIt last, CIt from)
Assigns each entity in a range the given components.
Definition: registry.hpp:709
-
entt::basic_registry::operator=
basic_registry & operator=(basic_registry &&other)
Move assignment operator.
Definition: registry.hpp:306
-
entt::basic_registry::compact
void compact()
Removes all tombstones from a registry or only the pools for the given components.
Definition: registry.hpp:872
-
entt::basic_registry::sort
void sort()
Sorts two pools of components in the same way.
Definition: registry.hpp:1417
-
entt::basic_registry::create
void create(It first, It last)
Assigns each element in a range an identifier.
Definition: registry.hpp:510
-
entt::basic_registry::insert
void insert(It first, It last, const Component &value={})
Assigns each entity in a range the given component.
Definition: registry.hpp:691
-
entt::basic_registry::assign
void assign(It first, It last, const entity_type destroyed)
Assigns identifiers to an empty registry.
Definition: registry.hpp:541
-
entt::basic_registry::get
decltype(auto) get([[maybe_unused]] const entity_type entity) const
Returns references to the given components for an entity.
Definition: registry.hpp:927
-
entt::basic_registry::emplace_or_replace
decltype(auto) emplace_or_replace(const entity_type entity, Args &&...args)
Assigns or replaces the given component for an entity.
Definition: registry.hpp:727
-
entt::basic_registry::release
version_type release(const entity_type entity)
Releases an identifier.
Definition: registry.hpp:558
-
entt::basic_registry::all_of
bool all_of(const entity_type entity) const
Checks if an entity has all the given components.
Definition: registry.hpp:893
-
entt::basic_registry::sort
void sort(Compare compare, Sort algo=Sort{}, Args &&...args)
Sorts the elements of a given component.
Definition: registry.hpp:1385
-
entt::basic_registry::released
entity_type released() const
Returns the head of the list of released entities.
Definition: registry.hpp:435
-
entt::basic_registry::emplace
decltype(auto) emplace(const entity_type entity, Args &&...args)
Assigns the given component to an entity.
Definition: registry.hpp:674
-
entt::basic_registry::empty
bool empty() const
Checks whether the registry is empty (no entities still in use).
Definition: registry.hpp:407
-
entt::basic_registry::group
basic_group< Entity, owned_t< Owned... >, get_t<>, exclude_t< Exclude... > > group(exclude_t< Exclude... >={})
Returns a group for the given components.
Definition: registry.hpp:1314
-
entt::basic_registry::remove
size_type remove(It first, It last)
Removes the given components from all the entities in a range.
Definition: registry.hpp:817
-
entt::basic_registry::view
basic_view< Entity, get_t< Component, Other... >, exclude_t< Exclude... > > view(exclude_t< Exclude... >={})
Returns a view for the given components.
Definition: registry.hpp:1141
-
entt::basic_registry::size
size_type size() const
Returns the number of entities created so far.
Definition: registry.hpp:368
-
entt::basic_registry::sortable
bool sortable() const
Checks whether the given components belong to any group.
Definition: registry.hpp:1331
-
entt::basic_registry::release
void release(It first, It last)
Releases all identifiers in a range.
Definition: registry.hpp:589
-
entt::basic_registry::size_type
std::size_t size_type
Unsigned integer type.
Definition: registry.hpp:279
-
entt::basic_registry::destroy
void destroy(It first, It last)
Destroys all entities in a range and releases their identifiers.
Definition: registry.hpp:644
-
entt::basic_registry::storage
auto storage() const
Returns an iterable object to use to visit a registry.
Definition: registry.hpp:333
-
entt::basic_registry::alive
size_type alive() const
Returns the number of entities still in use.
Definition: registry.hpp:376
-
entt::basic_registry::destroy
version_type destroy(const entity_type entity)
Destroys an entity and releases its identifier.
Definition: registry.hpp:608
-
entt::basic_registry::entity_type
Entity entity_type
Underlying entity identifier.
Definition: registry.hpp:275
-
entt::basic_registry::version_type
typename entity_traits::version_type version_type
Underlying version type.
Definition: registry.hpp:277
-
entt::basic_registry::try_ctx
std::add_const_t< Type > * try_ctx() const
Returns a pointer to an object in the context of the registry.
Definition: registry.hpp:1473
-
entt::basic_registry::each
void each(Func func) const
Iterates all the entities that are still in use.
Definition: registry.hpp:1028
-
entt::basic_registry::erase
void erase(It first, It last)
Erases the given components from all the entities in a range.
Definition: registry.hpp:858
-
entt::basic_registry::create
entity_type create()
Creates a new entity or recycles a destroyed one.
Definition: registry.hpp:464
-
entt::basic_registry::sortable
bool sortable(const basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)
Checks whether a group can be sorted.
Definition: registry.hpp:1343
-
entt::basic_registry::reserve
void reserve(const size_type cap)
Increases the capacity (number of entities) of the registry.
Definition: registry.hpp:390
-
entt::basic_registry::try_get
auto try_get([[maybe_unused]] const entity_type entity) const
Returns pointers to the given components for an entity.
Definition: registry.hpp:975
-
entt::basic_registry::storage
auto storage()
Returns an iterable object to use to visit a registry.
Definition: registry.hpp:328
-
entt::basic_registry::set
Type & set(Args &&...args)
Binds an object to the context of the registry.
Definition: registry.hpp:1434
-
entt::basic_registry::clear
void clear()
Clears a whole registry or the pools for the given components.
Definition: registry.hpp:1001
-
entt::basic_registry::view
basic_view< Entity, get_t< std::add_const_t< Component >, std::add_const_t< Other >... >, exclude_t< Exclude... > > view(exclude_t< Exclude... >={}) const
Returns a view for the given components.
Definition: registry.hpp:1135
-
entt::basic_registry::group_if_exists
basic_group< Entity, owned_t< std::add_const_t< Owned >... >, get_t<>, exclude_t< Exclude... > > group_if_exists(exclude_t< Exclude... >={}) const
Returns a group for the given components.
Definition: registry.hpp:1320
-
entt::basic_registry::remove
size_type remove(const entity_type entity)
Removes the given components from an entity.
Definition: registry.hpp:799
-
entt::basic_registry::ctx
std::add_const_t< Type > & ctx() const
Returns a reference to an object in the context of the registry.
Definition: registry.hpp:1500
-
entt::basic_registry::unset
void unset()
Unsets a context variable if it exists.
Definition: registry.hpp:1445
-
entt::basic_registry::on_update
auto on_update()
Returns a sink object for the given component.
Definition: registry.hpp:1094
-
entt::basic_registry::create
entity_type create(const entity_type hint)
Creates a new entity or recycles a destroyed one.
Definition: registry.hpp:477
-
entt::basic_registry::try_ctx
Type * try_ctx()
Returns a pointer to an object in the context of the registry.
Definition: registry.hpp:1480
-
entt::basic_registry::data
const entity_type * data() const
Direct access to the list of entities of a registry.
Definition: registry.hpp:423
-
entt::basic_registry::try_get
auto try_get([[maybe_unused]] const entity_type entity)
Returns pointers to the given components for an entity.
Definition: registry.hpp:988
-
entt::basic_registry::basic_registry
basic_registry(basic_registry &&other)
Move constructor.
Definition: registry.hpp:290
-
entt::basic_registry::erase
void erase(const entity_type entity)
Erases the given components from an entity.
Definition: registry.hpp:841
-
entt::basic_registry::on_destroy
auto on_destroy()
Returns a sink object for the given component.
Definition: registry.hpp:1117
-
entt::basic_registry::destroy
version_type destroy(const entity_type entity, const version_type version)
Destroys an entity and releases its identifier.
Definition: registry.hpp:624
-
entt::basic_registry::on_construct
auto on_construct()
Returns a sink object for the given component.
Definition: registry.hpp:1071
-
entt::basic_registry::ctx
void ctx(Func func) const
Visits a registry and returns the type info for its context variables.
Definition: registry.hpp:1532
-
entt::basic_registry::runtime_view
basic_runtime_view< Entity > runtime_view(ItComp first, ItComp last, ItExcl from={}, ItExcl to={}) const
Returns a runtime view for the given components.
Definition: registry.hpp:1169
-
entt::basic_registry::group_if_exists
basic_group< Entity, owned_t< std::add_const_t< Owned >... >, get_t< std::add_const_t< Get >... >, exclude_t< Exclude... > > group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) const
Returns a group for the given components.
Definition: registry.hpp:1296
-
entt::basic_registry::ctx_or_set
Type & ctx_or_set(Args &&...args)
Binds an object to the context of the registry.
Definition: registry.hpp:1461
-
entt::basic_registry::release
version_type release(const entity_type entity, const version_type version)
Releases an identifier.
Definition: registry.hpp:574
-
entt::basic_registry::group
basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > group(get_t< Get... >, exclude_t< Exclude... >={})
Returns a group for the given components.
Definition: registry.hpp:1214
-
entt::basic_runtime_view
Runtime view.
Definition: runtime_view.hpp:137
+
entt::basic_registry
Fast and reliable entity-component system.
Definition: registry.hpp:221
+
entt::basic_registry::capacity
size_type capacity() const
Returns the number of entities that a registry has currently allocated space for.
Definition: registry.hpp:493
+
entt::basic_registry::ctx
const context & ctx() const
Returns the context object, that is, a general purpose container.
Definition: registry.hpp:1481
+
entt::basic_registry::any_of
bool any_of(const entity_type entity) const
Checks if an entity has at least one of the given components.
Definition: registry.hpp:1004
+
entt::basic_registry::ctx
context & ctx()
Returns the context object, that is, a general purpose container.
Definition: registry.hpp:1476
+
entt::basic_registry::storage
auto storage(const id_type id)
Finds the storage associated with a given name, if any.
Definition: registry.hpp:413
+
entt::basic_registry::sortable
bool sortable(const basic_group< entity_type, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... >> &)
Checks whether a group can be sorted.
Definition: registry.hpp:1393
+
entt::basic_registry::orphan
bool orphan(const entity_type entity) const
Checks if an entity has components assigned.
Definition: registry.hpp:1141
+
entt::basic_registry::context
internal::registry_context context
Context type.
Definition: registry.hpp:333
+
entt::basic_registry::valid
bool valid(const entity_type entity) const
Checks if an identifier refers to a valid entity.
Definition: registry.hpp:538
+
entt::basic_registry::current
version_type current(const entity_type entity) const
Returns the actual version for an identifier.
Definition: registry.hpp:549
+
entt::basic_registry::insert
void insert(EIt first, EIt last, CIt from)
Assigns each entity in a range the given components.
Definition: registry.hpp:795
+
entt::basic_registry::operator=
basic_registry & operator=(basic_registry &&other)
Move assignment operator.
Definition: registry.hpp:376
+
entt::basic_registry::compact
void compact()
Removes all tombstones from a registry or only the pools for the given components.
Definition: registry.hpp:966
+
entt::basic_registry::view
basic_view< entity_type, get_t< std::add_const_t< Component >, std::add_const_t< Other >... >, exclude_t< Exclude... > > view(exclude_t< Exclude... >={}) const
Returns a view for the given components.
Definition: registry.hpp:1229
+
entt::basic_registry::sort
void sort()
Sorts two pools of components in the same way.
Definition: registry.hpp:1467
+
entt::basic_registry::create
void create(It first, It last)
Assigns each element in a range an identifier.
Definition: registry.hpp:604
+
entt::basic_registry::insert
void insert(It first, It last, const Component &value={})
Assigns each entity in a range the given component.
Definition: registry.hpp:777
+
entt::basic_registry::assign
void assign(It first, It last, const entity_type destroyed)
Assigns identifiers to an empty registry.
Definition: registry.hpp:635
+
entt::basic_registry::get
decltype(auto) get([[maybe_unused]] const entity_type entity) const
Returns references to the given components for an entity.
Definition: registry.hpp:1021
+
entt::basic_registry::emplace_or_replace
decltype(auto) emplace_or_replace(const entity_type entity, Args &&...args)
Assigns or replaces the given component for an entity.
Definition: registry.hpp:813
+
entt::basic_registry::release
version_type release(const entity_type entity)
Releases an identifier.
Definition: registry.hpp:652
+
entt::basic_registry::all_of
bool all_of(const entity_type entity) const
Checks if an entity has all the given components.
Definition: registry.hpp:987
+
entt::basic_registry::sort
void sort(Compare compare, Sort algo=Sort{}, Args &&...args)
Sorts the elements of a given component.
Definition: registry.hpp:1435
+
entt::basic_registry::released
entity_type released() const
Returns the head of the list of released entities.
Definition: registry.hpp:529
+
entt::basic_registry::basic_registry
basic_registry(const size_type count)
Allocates enough memory upon construction to store count pools.
Definition: registry.hpp:347
+
entt::basic_registry::emplace
decltype(auto) emplace(const entity_type entity, Args &&...args)
Assigns the given component to an entity.
Definition: registry.hpp:760
+
entt::basic_registry::empty
bool empty() const
Checks whether the registry is empty (no entities still in use).
Definition: registry.hpp:501
+
entt::basic_registry::remove
size_type remove(It first, It last)
Removes the given components from all the entities in a range.
Definition: registry.hpp:903
+
entt::basic_registry::size
size_type size() const
Returns the number of entities created so far.
Definition: registry.hpp:462
+
entt::basic_registry::view
basic_view< entity_type, get_t< Component, Other... >, exclude_t< Exclude... > > view(exclude_t< Exclude... >={})
Returns a view for the given components.
Definition: registry.hpp:1235
+
entt::basic_registry::release
void release(It first, It last)
Releases all identifiers in a range.
Definition: registry.hpp:683
+
entt::basic_registry::size_type
std::size_t size_type
Unsigned integer type.
Definition: registry.hpp:329
+
entt::basic_registry::destroy
void destroy(It first, It last)
Destroys all entities in a range and releases their identifiers.
Definition: registry.hpp:738
+
entt::basic_registry::storage
auto storage() const
Returns an iterable object to use to visit a registry.
Definition: registry.hpp:403
+
entt::basic_registry::alive
size_type alive() const
Returns the number of entities still in use.
Definition: registry.hpp:470
+
entt::basic_registry::destroy
version_type destroy(const entity_type entity)
Destroys an entity and releases its identifier.
Definition: registry.hpp:702
+
entt::basic_registry::group_if_exists
basic_group< entity_type, owned_t< std::add_const_t< Owned >... >, get_t< std::add_const_t< Get >... >, exclude_t< Exclude... > > group_if_exists(get_t< Get... >, exclude_t< Exclude... >={}) const
Returns a group for the given components.
Definition: registry.hpp:1346
+
entt::basic_registry::entity_type
Entity entity_type
Underlying entity identifier.
Definition: registry.hpp:325
+
entt::basic_registry::version_type
typename entity_traits::version_type version_type
Underlying version type.
Definition: registry.hpp:327
+
entt::basic_registry::storage
auto storage(const id_type id) const
Finds the storage associated with a given name, if any.
Definition: registry.hpp:423
+
entt::basic_registry::basic_registry
basic_registry()
Default constructor.
Definition: registry.hpp:336
+
entt::basic_registry::each
void each(Func func) const
Iterates all the entities that are still in use.
Definition: registry.hpp:1122
+
entt::basic_registry::erase
void erase(It first, It last)
Erases the given components from all the entities in a range.
Definition: registry.hpp:948
+
entt::basic_registry::create
entity_type create()
Creates a new entity or recycles a destroyed one.
Definition: registry.hpp:558
+
entt::basic_registry::reserve
void reserve(const size_type cap)
Increases the capacity (number of entities) of the registry.
Definition: registry.hpp:484
+
entt::basic_registry::try_get
auto try_get([[maybe_unused]] const entity_type entity) const
Returns pointers to the given components for an entity.
Definition: registry.hpp:1069
+
entt::basic_registry::owned
bool owned() const
Checks whether the given components belong to any group.
Definition: registry.hpp:1381
+
entt::basic_registry::storage
auto storage()
Returns an iterable object to use to visit a registry.
Definition: registry.hpp:398
+
entt::basic_registry::clear
void clear()
Clears a whole registry or the pools for the given components.
Definition: registry.hpp:1095
+
entt::basic_registry::remove
size_type remove(const entity_type entity)
Removes the given components from an entity.
Definition: registry.hpp:885
+
entt::basic_registry::on_update
auto on_update()
Returns a sink object for the given component.
Definition: registry.hpp:1188
+
entt::basic_registry::create
entity_type create(const entity_type hint)
Creates a new entity or recycles a destroyed one.
Definition: registry.hpp:571
+
entt::basic_registry::data
const entity_type * data() const
Direct access to the list of entities of a registry.
Definition: registry.hpp:517
+
entt::basic_registry::try_get
auto try_get([[maybe_unused]] const entity_type entity)
Returns pointers to the given components for an entity.
Definition: registry.hpp:1082
+
entt::basic_registry::basic_registry
basic_registry(basic_registry &&other)
Move constructor.
Definition: registry.hpp:360
+
entt::basic_registry::erase
void erase(const entity_type entity)
Erases the given components from an entity.
Definition: registry.hpp:931
+
entt::basic_registry::on_destroy
auto on_destroy()
Returns a sink object for the given component.
Definition: registry.hpp:1211
+
entt::basic_registry::destroy
version_type destroy(const entity_type entity, const version_type version)
Destroys an entity and releases its identifier.
Definition: registry.hpp:718
+
entt::basic_registry::on_construct
auto on_construct()
Returns a sink object for the given component.
Definition: registry.hpp:1165
+
entt::basic_registry::group
basic_group< entity_type, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > group(get_t< Get... >, exclude_t< Exclude... >={})
Returns a group for the given components.
Definition: registry.hpp:1264
+
entt::basic_registry::group
basic_group< entity_type, owned_t< Owned... >, get_t<>, exclude_t< Exclude... > > group(exclude_t< Exclude... >={})
Returns a group for the given components.
Definition: registry.hpp:1364
+
entt::basic_registry::group_if_exists
basic_group< entity_type, owned_t< std::add_const_t< Owned >... >, get_t<>, exclude_t< Exclude... > > group_if_exists(exclude_t< Exclude... >={}) const
Returns a group for the given components.
Definition: registry.hpp:1370
+
entt::basic_registry::release
version_type release(const entity_type entity, const version_type version)
Releases an identifier.
Definition: registry.hpp:668
entt::basic_sparse_set
Basic sparse set implementation.
Definition: sparse_set.hpp:174
-
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:237
+
entt::basic_storage
Basic storage implementation.
Definition: storage.hpp:234
entt::basic_view
View implementation.
Definition: fwd.hpp:20
-
entt::dense_hash_map
Associative container for key-value pairs with unique keys.
Definition: dense_hash_map.hpp:240
+
entt::dense_map
Associative container for key-value pairs with unique keys.
Definition: dense_map.hpp:265
entt::entt_traits
Entity traits.
Definition: entity.hpp:62
entt::entt_traits::entity_type
typename base_type::entity_type entity_type
Underlying entity type.
Definition: entity.hpp:69
entt::entt_traits::to_integral
static constexpr entity_type to_integral(const value_type value)
Converts an entity to its underlying type.
Definition: entity.hpp:82
@@ -1018,28 +1023,25 @@ $(function() {
entt::entt_traits::combine
static constexpr value_type combine(const entity_type lhs, const entity_type rhs)
Combines two identifiers in a single one.
Definition: entity.hpp:128
entt::entt_traits::version_type
typename base_type::version_type version_type
Underlying version type.
Definition: entity.hpp:71
entt::entt_traits::to_version
static constexpr version_type to_version(const value_type value)
Returns the version part once converted to the underlying type.
Definition: entity.hpp:100
-
entt::sigh_storage_mixin
Mixin type used to add signal support to storage types.
Definition: storage.hpp:949
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
-
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:217
+
entt::sigh_storage_mixin
Mixin type used to add signal support to storage types.
Definition: sigh_storage_mixin.hpp:26
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
+
entt::operator==
constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:236
entt::entity
entity
Default entity identifier.
Definition: fwd.hpp:47
-
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:13
-
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:254
+
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:14
+
entt::operator<=
constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:273
entt::exclude
constexpr exclude_t< Type... > exclude
Variable template for exclusion lists.
Definition: utility.hpp:20
-
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:280
+
entt::operator>=
constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:299
entt::tombstone
constexpr tombstone_t tombstone
Compile-time constant for tombstone entities.
Definition: entity.hpp:335
entt::operator+
constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
Concatenates multiple type lists.
Definition: type_traits.hpp:157
-
entt::forward_as_any
basic_any< Len, Align > forward_as_any(Type &&value)
Forwards its argument and avoids copies for lvalue references.
Definition: any.hpp:488
-
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:241
-
entt::owned
constexpr owned_t< Type... > owned
Variable template for lists of owned components.
Definition: utility.hpp:48
-
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:406
-
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:267
-
entt::component_traits
Common way to access various properties of components.
Definition: component.hpp:24
+
entt::forward_as_any
basic_any< Len, Align > forward_as_any(Type &&value)
Forwards its argument and avoids copies for lvalue references.
Definition: any.hpp:484
+
entt::operator<
constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:260
+
entt::operator!=
bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
Checks if two wrappers differ in their content.
Definition: any.hpp:402
+
entt::operator>
constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
Compares two hashed strings.
Definition: hashed_string.hpp:286
+
entt::component_traits
Common way to access various properties of components.
Definition: component.hpp:43
entt::exclude_t
Alias for exclusion lists.
Definition: utility.hpp:13
entt::get_t
Alias for lists of observed components.
Definition: utility.hpp:27
entt::identity
Identity function object (waiting for C++20).
Definition: utility.hpp:10
-
entt::iterable_adaptor
Utility class to create an iterable object from a pair of iterators.
Definition: iterator.hpp:62
-
entt::iterable_adaptor::begin
const_iterator begin() const
Returns an iterator to the beginning.
Definition: iterator.hpp:86
-
entt::iterable_adaptor::cbegin
const_iterator cbegin() const
Returns an iterator to the beginning.
Definition: iterator.hpp:100
+
entt::iterable_adaptor
Utility class to create an iterable object from a pair of iterators.
Definition: iterator.hpp:63
entt::owned_t
Alias for lists of owned components.
Definition: utility.hpp:41
entt::std_sort
Function object to wrap std::sort in a class type.
Definition: algorithm.hpp:21
entt::type_hash
Type hash.
Definition: type_info.hpp:100
diff --git a/resolve_8hpp_source.html b/resolve_8hpp_source.html index ea28006ac..82310676c 100644 --- a/resolve_8hpp_source.html +++ b/resolve_8hpp_source.html @@ -22,7 +22,7 @@ @@ -84,10 +84,10 @@ $(function() {
12 
18 template<typename Type>
19 [[nodiscard]] meta_type resolve() ENTT_NOEXCEPT {
-
20  return internal::meta_node<std::remove_const_t<std::remove_reference_t<Type>>>::resolve();
+
20  return internal::meta_node<std::remove_cv_t<std::remove_reference_t<Type>>>::resolve();
21 }
22 
-
27 [[nodiscard]] inline meta_range<meta_type> resolve() {
+
27 [[nodiscard]] inline meta_range<meta_type> resolve() ENTT_NOEXCEPT {
28  return *internal::meta_context::global();
29 }
30 
@@ -101,7 +101,7 @@ $(function() {
43  return {};
44 }
45 
-
51 [[nodiscard]] inline meta_type resolve(const type_info &info) ENTT_NOEXCEPT {
+
51 [[nodiscard]] inline meta_type resolve(const type_info &info) ENTT_NOEXCEPT {
52  for(auto &&curr: resolve()) {
53  if(curr.info() == info) {
54  return curr;
@@ -114,11 +114,11 @@ $(function() {
61 } // namespace entt
62 
63 #endif
-
entt::meta_type
Opaque wrapper for types.
Definition: meta.hpp:980
-
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
entt::meta_type
Opaque wrapper for types.
Definition: meta.hpp:949
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
entt::resolve
meta_type resolve()
Returns the meta type associated with a given type.
Definition: resolve.hpp:19
-
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:13
+
entt::id_type
std::uint32_t id_type
Alias declaration for type identifiers.
Definition: fwd.hpp:14
+
entt::type_info
Implementation specific information about a type.
Definition: type_info.hpp:141
diff --git a/resource_2fwd_8hpp_source.html b/resource_2fwd_8hpp_source.html index 25ee3bd7b..3966d909d 100644 --- a/resource_2fwd_8hpp_source.html +++ b/resource_2fwd_8hpp_source.html @@ -22,7 +22,7 @@
@@ -73,21 +73,23 @@ $(function() {
1 #ifndef ENTT_RESOURCE_FWD_HPP
2 #define ENTT_RESOURCE_FWD_HPP
3 
-
4 namespace entt {
+
4 #include <memory>
5 
-
6 template<typename>
-
7 class resource_cache;
-
8 
-
9 template<typename>
-
10 class resource_handle;
-
11 
-
12 template<typename, typename>
-
13 class resource_loader;
-
14 
-
15 } // namespace entt
+
6 namespace entt {
+
7 
+
8 template<typename>
+
9 struct resource_loader;
+
10 
+
11 template<typename Type, typename = resource_loader<Type>, typename = std::allocator<Type>>
+
12 class resource_cache;
+
13 
+
14 template<typename>
+
15 class resource;
16 
-
17 #endif
-
entt
EnTT default namespace.
Definition: dense_hash_map.hpp:21
+
17 } // namespace entt
+
18 
+
19 #endif
+
entt
EnTT default namespace.
Definition: dense_map.hpp:22
diff --git a/resource_2handle_8hpp_source.html b/resource_2handle_8hpp_source.html deleted file mode 100644 index 6738489ca..000000000 --- a/resource_2handle_8hpp_source.html +++ /dev/null @@ -1,187 +0,0 @@ - - - - - - - -EnTT: src/entt/resource/handle.hpp Source File - - - - - - - - - -
-
-
constexpr allocator_type entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::get_allocator constexpr allocator_type entt::dense_set< Type, Hash, KeyEqual, Allocator >::get_allocator ( ) const - + @@ -1751,12 +1676,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

Returns the function used to hash the elements.

Returns
The function used to hash the elements.
-

Definition at line 829 of file dense_hash_set.hpp.

+

Definition at line 803 of file dense_set.hpp.

- -

◆ insert() [1/3]

+ +

◆ insert() [1/3]

@@ -1767,9 +1692,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
@@ -65,6 +65,9 @@ $(function() {
Here is a list of all documented namespace members with links to the namespaces they belong to:

- a -

    +
  • allocate_unique() +: entt +
  • any : entt
    • @@ -85,7 +88,7 @@ $(function() { : entt
  • basic_hashed_string() -: entt +: entt
  • basic_view() : entt @@ -131,6 +134,9 @@ $(function() {
  • dereference_meta_pointer_like() : entt
    • +
  • dispatcher +: entt +
@@ -214,9 +220,6 @@ $(function() {
  • is_equality_comparable_v : entt
    • -
  • is_iterator_type_v -: entt -
  • is_iterator_v : entt
    • @@ -239,6 +242,9 @@ $(function() {
  • make_meta() : entt
    • +
  • make_obj_using_allocator() +: entt +
  • member_class_t : entt
    • @@ -290,10 +296,10 @@ $(function() { : entt
  • operator""_hs() -: entt +: entt
  • operator""_hws() -: entt +: entt
  • operator+() : entt @@ -330,7 +336,7 @@ $(function() {

    - p -

    @@ -429,6 +435,9 @@ $(function() {

    - u -

      +
    • uninitialized_construct_using_allocator() +: entt +
    • unpack_as_type : entt
      • @@ -438,6 +447,9 @@ $(function() {
    • unwrap_tuple() : entt
      • +
    • uses_allocator_construction_args() +: entt +
    diff --git a/namespacemembers_enum.html b/namespacemembers_enum.html index 476953d15..a6dcb0960 100644 --- a/namespacemembers_enum.html +++ b/namespacemembers_enum.html @@ -22,7 +22,7 @@
    • diff --git a/namespacemembers_func.html b/namespacemembers_func.html index 78ee4b524..c24fd1ebf 100644 --- a/namespacemembers_func.html +++ b/namespacemembers_func.html @@ -22,7 +22,7 @@ @@ -65,6 +65,9 @@ $(function() {  

    - a -

      +
    • allocate_unique() +: entt +
    • any_cast() : entt
      • @@ -82,7 +85,7 @@ $(function() { : entt
    • basic_hashed_string() -: entt +: entt
    • basic_view() : entt @@ -137,6 +140,9 @@ $(function() {
    • make_meta() : entt
      • +
    • make_obj_using_allocator() +: entt +
    • meta() : entt
      • @@ -173,10 +179,10 @@ $(function() { : entt
    • operator""_hs() -: entt +: entt
    • operator""_hws() -: entt +: entt
    • operator+() : entt @@ -258,9 +264,15 @@ $(function() {

      - u -

        +
      • uninitialized_construct_using_allocator() +: entt +
      • unwrap_tuple() : entt
        • +
      • uses_allocator_construction_args() +: entt +
      diff --git a/namespacemembers_type.html b/namespacemembers_type.html index 95ff8f3f1..597d7c167 100644 --- a/namespacemembers_type.html +++ b/namespacemembers_type.html @@ -22,7 +22,7 @@
    @@ -87,6 +87,13 @@ $(function() { +

    - d -

      +
    • dispatcher +: entt +
      • +
    + +

    - g -

    • group : entt @@ -142,7 +149,7 @@ $(function() {

      - p -

      @@ -152,7 +159,7 @@ $(function() { : entt
    • runtime_view -: entt +: entt
    diff --git a/namespacemembers_vars.html b/namespacemembers_vars.html index 25d76d73c..c702661e8 100644 --- a/namespacemembers_vars.html +++ b/namespacemembers_vars.html @@ -22,7 +22,7 @@ @@ -99,9 +99,6 @@ $(function() {
  • is_equality_comparable_v : entt
    • -
  • is_iterator_type_v -: entt -
  • is_iterator_v : entt
    • diff --git a/namespaces.html b/namespaces.html index 7c090561f..9a33fb07e 100644 --- a/namespaces.html +++ b/namespaces.html @@ -22,7 +22,7 @@ @@ -69,8 +69,8 @@ $(function() {
    Here is a list of all documented namespaces with brief descriptions:
    [detail level 123]
    hasher entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::hash_function hasher entt::dense_set< Type, Hash, KeyEqual, Allocator >::hash_function ( ) const - + - + @@ -1790,12 +1715,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    Returns
    A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
    -

    Definition at line 537 of file dense_hash_set.hpp.

    +

    Definition at line 487 of file dense_set.hpp.

    - -

    ◆ insert() [2/3]

    + +

    ◆ insert() [2/3]

    @@ -1808,7 +1733,7 @@ template<typename It >
    - + - + @@ -3549,8 +3777,8 @@ template<typename Entity > - -

    ◆ operator""_hs()

    + +

    ◆ operator""_hs()

    @@ -3559,7 +3787,7 @@ template<typename Entity >
    @@ -5433,7 +5869,7 @@ template<class Type > -

    Definition at line 33 of file component.hpp.

    +

    Definition at line 57 of file component.hpp.

    @@ -5572,7 +6008,7 @@ template<typename Type > -

    Definition at line 530 of file type_traits.hpp.

    +

    Definition at line 503 of file type_traits.hpp.

    @@ -5606,42 +6042,7 @@ template<typename Type > -

    Definition at line 619 of file type_traits.hpp.

    - - - - -

    ◆ is_iterator_type_v

    - -
    -
    -
    -template<typename Type , typename It >
    -
    std::pair<iterator, bool> entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::insert std::pair<iterator, bool> entt::dense_set< Type, Hash, KeyEqual, Allocator >::insert (const value_type & const value_type &  value)
    - + @@ -1847,12 +1772,12 @@ template<typename It > -

    Definition at line 553 of file dense_hash_set.hpp.

    +

    Definition at line 503 of file dense_set.hpp.

    - -

    ◆ insert() [3/3]

    + +

    ◆ insert() [3/3]

    @@ -1863,9 +1788,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    @@ -71,109 +71,350 @@ $(function() { Public Member Functions | List of all members
    -
    entt::resource_cache< Resource > Class Template Reference
    +
    entt::resource_cache< Type, Loader, Allocator > Class Template Reference
    -

    Simple cache for resources of a given type. +

    Basic cache for resources of any type. More...

    #include <cache.hpp>

    void entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::insert void entt::dense_set< Type, Hash, KeyEqual, Allocator >::insert ( It  first, - + - + @@ -1886,12 +1811,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    Returns
    A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
    -

    Definition at line 542 of file dense_hash_set.hpp.

    +

    Definition at line 492 of file dense_set.hpp.

    - -

    ◆ key_eq()

    + +

    ◆ key_eq()

    @@ -1902,7 +1827,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    diff --git a/classentt_1_1meta__type.html b/classentt_1_1meta__type.html index 3913ca8d3..67c21c15f 100644 --- a/classentt_1_1meta__type.html +++ b/classentt_1_1meta__type.html @@ -22,7 +22,7 @@ @@ -103,7 +103,7 @@ Public Member Functions - + @@ -203,7 +203,7 @@ Public Member Functions

    Detailed Description

    Opaque wrapper for types.

    -

    Definition at line 980 of file meta.hpp.

    +

    Definition at line 949 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_type() [1/2]

    @@ -237,7 +237,7 @@ Public Member Functions -

    Definition at line 1029 of file meta.hpp.

    +

    Definition at line 998 of file meta.hpp.

    @@ -273,7 +273,7 @@ Public Member Functions -

    Definition at line 1036 of file meta.hpp.

    +

    Definition at line 1005 of file meta.hpp.

    @@ -304,7 +304,7 @@ Public Member Functions

    Returns a range to visit registered top-level base meta types.

    Returns
    An iterable range to visit registered top-level base meta types.
    -

    Definition at line 1171 of file meta.hpp.

    +

    Definition at line 1140 of file meta.hpp.

    @@ -341,7 +341,7 @@ Public Member Functions
    Returns
    The registered base meta type for the given identifier, if any.
    -

    Definition at line 1180 of file meta.hpp.

    +

    Definition at line 1149 of file meta.hpp.

    @@ -387,7 +387,7 @@ template<typename... Args>
    Returns
    A wrapper containing the new instance, if any.
    -

    Definition at line 1252 of file meta.hpp.

    +

    Definition at line 1221 of file meta.hpp.

    @@ -437,7 +437,7 @@ template<typename... Args>
    Returns
    A wrapper containing the new instance, if any.
    -

    Definition at line 1237 of file meta.hpp.

    +

    Definition at line 1206 of file meta.hpp.

    @@ -467,7 +467,7 @@ template<typename... Args>

    Returns a range to visit registered top-level meta data.

    Returns
    An iterable range to visit registered top-level meta data.
    -

    Definition at line 1188 of file meta.hpp.

    +

    Definition at line 1157 of file meta.hpp.

    @@ -505,7 +505,7 @@ template<typename... Args>
    Returns
    The registered meta data for the given identifier, if any.
    -

    Definition at line 1200 of file meta.hpp.

    +

    Definition at line 1169 of file meta.hpp.

    @@ -535,7 +535,7 @@ template<typename... Args>

    Returns a range to visit registered top-level functions.

    Returns
    An iterable range to visit registered top-level functions.
    -

    Definition at line 1208 of file meta.hpp.

    +

    Definition at line 1177 of file meta.hpp.

    @@ -574,7 +574,7 @@ template<typename... Args>
    Returns
    The registered meta function for the given identifier, if any.
    -

    Definition at line 1222 of file meta.hpp.

    +

    Definition at line 1191 of file meta.hpp.

    @@ -613,7 +613,7 @@ template<typename... Args>

    Gets the value of a given variable.

    -

    It must be possible to cast the instance to the parent type of the data member. Otherwise, invoking the getter results in an undefined behavior.

    +

    It must be possible to cast the instance to the parent type of the data member.

    Parameters
    std::pair<iterator, bool> entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::insert std::pair<iterator, bool> entt::dense_set< Type, Hash, KeyEqual, Allocator >::insert (value_type && value_type &&  value)
    - + @@ -1918,12 +1843,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

    Returns the function used to compare elements for equality.

    Returns
    The function used to compare elements for equality.
    -

    Definition at line 837 of file dense_hash_set.hpp.

    +

    Definition at line 811 of file dense_set.hpp.

    - -

    ◆ load_factor()

    + +

    ◆ load_factor()

    @@ -1934,7 +1859,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    diff --git a/classentt_1_1meta__function__helper.html b/classentt_1_1meta__function__helper.html index 694b05e11..92cab8f6b 100644 --- a/classentt_1_1meta__function__helper.html +++ b/classentt_1_1meta__function__helper.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1meta__sequence__container-members.html b/classentt_1_1meta__sequence__container-members.html index 69f8e231f..d47416271 100644 --- a/classentt_1_1meta__sequence__container-members.html +++ b/classentt_1_1meta__sequence__container-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1meta__sequence__container.html b/classentt_1_1meta__sequence__container.html index df5a64334..fd7837725 100644 --- a/classentt_1_1meta__sequence__container.html +++ b/classentt_1_1meta__sequence__container.html @@ -22,7 +22,7 @@ @@ -67,7 +67,6 @@ $(function() {
    -Classes | Public Types | Public Member Functions | List of all members
    @@ -81,12 +80,6 @@ $(function() {

    #include <meta.hpp>

    key_equal entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::key_eq key_equal entt::dense_set< Type, Hash, KeyEqual, Allocator >::key_eq ( ) const - + @@ -1950,12 +1875,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

    Returns the average number of elements per bucket.

    Returns
    The average number of elements per bucket.
    -

    Definition at line 773 of file dense_hash_set.hpp.

    +

    Definition at line 747 of file dense_set.hpp.

    - -

    ◆ max_bucket_count()

    + +

    ◆ max_bucket_count()

    @@ -1966,7 +1891,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    float entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::load_factor float entt::dense_set< Type, Hash, KeyEqual, Allocator >::load_factor ( ) const - + @@ -1982,12 +1907,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

    Returns the maximum number of buckets.

    Returns
    The maximum number of buckets.
    -

    Definition at line 747 of file dense_hash_set.hpp.

    +

    Definition at line 721 of file dense_set.hpp.

    - -

    ◆ max_load_factor() [1/2]

    + +

    ◆ max_load_factor() [1/2]

    @@ -1998,7 +1923,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    diff --git a/classentt_1_1meta__factory_3_01Type_01_4.html b/classentt_1_1meta__factory_3_01Type_01_4.html index aa362bf8c..08c47154e 100644 --- a/classentt_1_1meta__factory_3_01Type_01_4.html +++ b/classentt_1_1meta__factory_3_01Type_01_4.html @@ -22,7 +22,7 @@ @@ -135,7 +135,7 @@ Public Member Functions - +
    size_type entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::max_bucket_count size_type entt::dense_set< Type, Hash, KeyEqual, Allocator >::max_bucket_count ( ) const - + @@ -2014,12 +1939,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

    Returns the maximum average number of elements per bucket.

    Returns
    The maximum average number of elements per bucket.
    -

    Definition at line 781 of file dense_hash_set.hpp.

    +

    Definition at line 755 of file dense_set.hpp.

    - -

    ◆ max_load_factor() [2/2]

    + +

    ◆ max_load_factor() [2/2]

    @@ -2030,7 +1955,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html index 607d1c9f3..fea6d3d0a 100644 --- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html +++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html index dba791291..a0c6dad7c 100644 --- a/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html +++ b/classentt_1_1meta__factory_3_01Type_00_01Spec_8_8_8_01_4.html @@ -22,7 +22,7 @@ @@ -156,7 +156,7 @@ Public Member Functions - +
    float entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::max_load_factor float entt::dense_set< Type, Hash, KeyEqual, Allocator >::max_load_factor ( ) const - + @@ -2052,12 +1977,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

    Definition at line 789 of file dense_hash_set.hpp.

    +

    Definition at line 763 of file dense_set.hpp.

    - -

    ◆ operator=() [1/2]

    + +

    ◆ operator=() [1/2]

    @@ -2068,35 +1993,27 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    +default
    void entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::max_load_factor void entt::dense_set< Type, Hash, KeyEqual, Allocator >::max_load_factor ( const float  value) - + - - + +
    dense_hash_set& entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::operator= dense_set& entt::dense_set< Type, Hash, KeyEqual, Allocator >::operator= (const dense_hash_set< Type, Hash, KeyEqual, Allocator > & other)const dense_set< Type, Hash, KeyEqual, Allocator > & )
    		-inline
    -

    Copy assignment operator.

    -
    Parameters
    - - -
    otherThe instance to copy from.
    -
    -
    +

    Default copy assignment operator.

    Returns
    This container.
    -

    Definition at line 436 of file dense_hash_set.hpp.

    -
    - -

    ◆ operator=() [2/2]

    + +

    ◆ operator=() [2/2]

    @@ -2107,10 +2024,10 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    		- + - - + +
    dense_hash_set& entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::operator= dense_set& entt::dense_set< Type, Hash, KeyEqual, Allocator >::operator= (dense_hash_set< Type, Hash, KeyEqual, Allocator > && other)dense_set< Type, Hash, KeyEqual, Allocator > && )
    @@ -2122,18 +2039,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

    Default move assignment operator.

    -
    Parameters
    - - -
    otherThe instance to move from.
    -
    -
    Returns
    This container.
    - -

    ◆ rehash()

    + +

    ◆ rehash()

    @@ -2144,9 +2055,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    		- + - + @@ -2166,12 +2077,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

    Definition at line 800 of file dense_hash_set.hpp.

    +

    Definition at line 774 of file dense_set.hpp.

    - -

    ◆ reserve()

    + +

    ◆ reserve()

    @@ -2182,9 +2093,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    diff --git a/classentt_1_1meta__associative__container.html b/classentt_1_1meta__associative__container.html index dd6b7f7f3..5403c5bff 100644 --- a/classentt_1_1meta__associative__container.html +++ b/classentt_1_1meta__associative__container.html @@ -22,7 +22,7 @@ @@ -67,7 +67,6 @@ $(function() {
    -Classes | Public Types | Public Member Functions | List of all members
    @@ -81,12 +80,6 @@ $(function() {

    #include <meta.hpp>

    void entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::rehash void entt::dense_set< Type, Hash, KeyEqual, Allocator >::rehash (const size_type const size_type  count)
    - + - + @@ -2204,12 +2115,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

    Definition at line 820 of file dense_hash_set.hpp.

    +

    Definition at line 794 of file dense_set.hpp.

    - -

    ◆ size()

    + +

    ◆ size()

    @@ -2220,7 +2131,7 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    void entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::reserve void entt::dense_set< Type, Hash, KeyEqual, Allocator >::reserve (const size_type const size_type  count)
    - + @@ -2236,12 +2147,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat

    Returns the number of elements in a container.

    Returns
    Number of elements in a container.
    -

    Definition at line 519 of file dense_hash_set.hpp.

    +

    Definition at line 469 of file dense_set.hpp.

    - -

    ◆ swap()

    + +

    ◆ swap()

    @@ -2252,9 +2163,9 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat
    diff --git a/classentt_1_1emitter.html b/classentt_1_1emitter.html index f76e1a67b..01d241fd9 100644 --- a/classentt_1_1emitter.html +++ b/classentt_1_1emitter.html @@ -22,7 +22,7 @@ @@ -162,7 +162,7 @@ class entt::emitter< Derived > -

    Definition at line 41 of file emitter.hpp.

    +

    Definition at line 42 of file emitter.hpp.

    Member Function Documentation

    ◆ clear() [1/2]

    @@ -200,7 +200,7 @@ template<typename Event > -

    Definition at line 273 of file emitter.hpp.

    +

    Definition at line 274 of file emitter.hpp.

    @@ -232,7 +232,7 @@ template<typename Derived >

    Disconnects all the listeners.

    All the connections previously returned are invalidated. Using them results in undefined behavior.

    -

    Definition at line 283 of file emitter.hpp.

    +

    Definition at line 284 of file emitter.hpp.

    @@ -272,7 +272,7 @@ template<typename Event >
    Returns
    True if there are no listeners registered, false otherwise.
    -

    Definition at line 295 of file emitter.hpp.

    +

    Definition at line 296 of file emitter.hpp.

    @@ -304,7 +304,7 @@ template<typename Derived >

    Checks if there are listeners registered with the event emitter.

    Returns
    True if there are no listeners registered, false otherwise.
    -

    Definition at line 304 of file emitter.hpp.

    +

    Definition at line 305 of file emitter.hpp.

    @@ -351,7 +351,7 @@ template<typename Event > -

    Definition at line 260 of file emitter.hpp.

    +

    Definition at line 261 of file emitter.hpp.

    @@ -402,7 +402,7 @@ template<typename Event >
    Returns
    Connection object that can be used to disconnect the listener.
    -

    Definition at line 221 of file emitter.hpp.

    +

    Definition at line 222 of file emitter.hpp.

    @@ -453,7 +453,7 @@ template<typename Event >
    Returns
    Connection object that can be used to disconnect the listener.
    -

    Definition at line 246 of file emitter.hpp.

    +

    Definition at line 247 of file emitter.hpp.

    @@ -532,7 +532,7 @@ template<typename Event , typename... Args> -

    Definition at line 195 of file emitter.hpp.

    +

    Definition at line 196 of file emitter.hpp.

    diff --git a/classentt_1_1entt__traits-members.html b/classentt_1_1entt__traits-members.html index 7418dd4ba..2de67e41f 100644 --- a/classentt_1_1entt__traits-members.html +++ b/classentt_1_1entt__traits-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1entt__traits.html b/classentt_1_1entt__traits.html index 32e3a2fe6..7744202d1 100644 --- a/classentt_1_1entt__traits.html +++ b/classentt_1_1entt__traits.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1family-members.html b/classentt_1_1family-members.html index f621da959..866f6a075 100644 --- a/classentt_1_1family-members.html +++ b/classentt_1_1family-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1family.html b/classentt_1_1family.html index e1782766a..c9662496d 100644 --- a/classentt_1_1family.html +++ b/classentt_1_1family.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1identifier-members.html b/classentt_1_1identifier-members.html index 0b600d0f0..3fcf8994b 100644 --- a/classentt_1_1identifier-members.html +++ b/classentt_1_1identifier-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1identifier.html b/classentt_1_1identifier.html index 7f15a9c13..8e5e71672 100644 --- a/classentt_1_1identifier.html +++ b/classentt_1_1identifier.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1member__class-members.html b/classentt_1_1member__class-members.html index bda00a3d2..dc59ddc6a 100644 --- a/classentt_1_1member__class-members.html +++ b/classentt_1_1member__class-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1member__class.html b/classentt_1_1member__class.html index 77e94bc3f..827f9b700 100644 --- a/classentt_1_1member__class.html +++ b/classentt_1_1member__class.html @@ -22,7 +22,7 @@ @@ -98,7 +98,7 @@ class entt::member_class< Member > -

    Definition at line 652 of file type_traits.hpp.

    +

    Definition at line 625 of file type_traits.hpp.

    The documentation for this class was generated from the following file: diff --git a/classentt_1_1meta__any-members.html b/classentt_1_1meta__any-members.html index b78d7656a..7c2ecfd57 100644 --- a/classentt_1_1meta__any-members.html +++ b/classentt_1_1meta__any-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1meta__any.html b/classentt_1_1meta__any.html index 6a80dcbfe..c1cf9f792 100644 --- a/classentt_1_1meta__any.html +++ b/classentt_1_1meta__any.html @@ -22,7 +22,7 @@ @@ -114,7 +114,7 @@ Public Member Functions - + @@ -175,14 +175,13 @@ Public Member Functions - + - + - - + + @@ -218,7 +217,7 @@ void 
    size_type entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::size size_type entt::dense_set< Type, Hash, KeyEqual, Allocator >::size ( ) const - + - + @@ -2274,12 +2185,12 @@ template<typename Type , typename Hash , typename KeyEqual , typename Allocat -

    Definition at line 617 of file dense_hash_set.hpp.

    +

    Definition at line 591 of file dense_set.hpp.

    The documentation for this class was generated from the following file: diff --git a/classentt_1_1dispatcher-members.html b/classentt_1_1dispatcher-members.html deleted file mode 100644 index 2effb0b70..000000000 --- a/classentt_1_1dispatcher-members.html +++ /dev/null @@ -1,95 +0,0 @@ - - - - - - - -EnTT: Member List - - - - - - - - - -
    -
    -
    void entt::dense_hash_set< Type, Hash, KeyEqual, Allocator >::swap void entt::dense_set< Type, Hash, KeyEqual, Allocator >::swap (dense_hash_set< Type, Hash, KeyEqual, Allocator > & dense_set< Type, Hash, KeyEqual, Allocator > &  other)
    - - - - - -
    -
    EnTT -  3.9.0 -
    -
    - - - - - - - - - -
    -
    - - -
    - -
    - - - -
    -
    -
    entt::dispatcher Member List
    -
    -
    - -

    This is the complete list of members for entt::dispatcher, including all inherited members.

    - - - - - - - - - - - - - - -
    clear()entt::dispatcherinline
    disconnect(Type &value_or_instance)entt::dispatcherinline
    disconnect(Type *value_or_instance)entt::dispatcherinline
    dispatcher()=defaultentt::dispatcher
    dispatcher(dispatcher &&)=defaultentt::dispatcher
    enqueue(Args &&...args)entt::dispatcherinline
    enqueue(Event &&event)entt::dispatcherinline
    operator=(dispatcher &&)=defaultentt::dispatcher
    sink()entt::dispatcherinline
    trigger(Args &&...args)entt::dispatcherinline
    trigger(Event &&event)entt::dispatcherinline
    update()entt::dispatcherinline
    update() constentt::dispatcherinline
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1dispatcher.html b/classentt_1_1dispatcher.html deleted file mode 100644 index f5db669cf..000000000 --- a/classentt_1_1dispatcher.html +++ /dev/null @@ -1,600 +0,0 @@ - - - - - - - -EnTT: entt::dispatcher Class Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -Classes | -Public Member Functions | -List of all members
    -
    -
    entt::dispatcher Class Reference
    -
    -
    - -

    Basic dispatcher implementation. - More...

    - -

    #include <dispatcher.hpp>

    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

    -Public Member Functions

    - dispatcher ()=default
     Default constructor.
     
    - dispatcher (dispatcher &&)=default
     Default move constructor.
     
    dispatcher & operator= (dispatcher &&)=default
     Default move assignment operator. More...
     
    template<typename Event >
    auto sink ()
     Returns a sink object for the given event. More...
     
    template<typename Event , typename... Args>
    void trigger (Args &&...args)
     Triggers an immediate event of the given type. More...
     
    template<typename Event >
    void trigger (Event &&event)
     Triggers an immediate event of the given type. More...
     
    template<typename Event , typename... Args>
    void enqueue (Args &&...args)
     Enqueues an event of the given type. More...
     
    template<typename Event >
    void enqueue (Event &&event)
     Enqueues an event of the given type. More...
     
    template<typename Type >
    void disconnect (Type &value_or_instance)
     Utility function to disconnect everything related to a given value or instance from a dispatcher. More...
     
    template<typename Type >
    void disconnect (Type *value_or_instance)
     Utility function to disconnect everything related to a given value or instance from a dispatcher. More...
     
    template<typename... Event>
    void clear ()
     Discards all the events queued so far. More...
     
    template<typename Event >
    void update ()
     Delivers all the pending events of the given type. More...
     
    void update () const
     Delivers all the pending events. More...
     
    -

    Detailed Description

    -

    Basic dispatcher implementation.

    -

    A dispatcher can be used either to trigger an immediate event or to enqueue events to be published all together once per tick.
    - Listeners are provided in the form of member functions. For each event of type Event, listeners are such that they can be invoked with an argument of type Event &, no matter what the return type is.

    -

    The dispatcher creates instances of the sigh class internally. Refer to the documentation of the latter for more details.

    - -

    Definition at line 30 of file dispatcher.hpp.

    -

    Member Function Documentation

    - -

    ◆ clear()

    - -
    -
    -
    -template<typename... Event>
    - - - - - -
    - - - - - - - -
    void entt::dispatcher::clear ()
    -     		-inline
    -
    - -

    Discards all the events queued so far.

    -

    If no types are provided, the dispatcher will clear all the existing pools.

    -
    Template Parameters
    - - -
    EventType of events to discard.
    -
    -
    - -

    Definition at line 221 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ disconnect() [1/2]

    - -
    -
    -
    -template<typename Type >
    - - - - - -
    - - - - - - - - -
    void entt::dispatcher::disconnect (Type & value_or_instance)
    -     		-inline
    -
    - -

    Utility function to disconnect everything related to a given value or instance from a dispatcher.

    -
    Template Parameters
    - - -
    TypeType of class or type of payload.
    -
    -
    -
    Parameters
    - - -
    value_or_instanceA valid object that fits the purpose.
    -
    -
    - -

    Definition at line 195 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ disconnect() [2/2]

    - -
    -
    -
    -template<typename Type >
    - - - - - -
    - - - - - - - - -
    void entt::dispatcher::disconnect (Type * value_or_instance)
    -     		-inline
    -
    - -

    Utility function to disconnect everything related to a given value or instance from a dispatcher.

    -
    Template Parameters
    - - -
    TypeType of class or type of payload.
    -
    -
    -
    Parameters
    - - -
    value_or_instanceA valid object that fits the purpose.
    -
    -
    - -

    Definition at line 206 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ enqueue() [1/2]

    - -
    -
    -
    -template<typename Event , typename... Args>
    - - - - - -
    - - - - - - - - -
    void entt::dispatcher::enqueue (Args &&... args)
    -     		-inline
    -
    - -

    Enqueues an event of the given type.

    -

    An event of the given type is queued. No listener is invoked. Use the update member function to notify listeners when ready.

    -
    Template Parameters
    - - - -
    EventType of event to enqueue.
    ArgsTypes of arguments to use to construct the event.
    -
    -
    -
    Parameters
    - - -
    argsArguments to use to construct the event.
    -
    -
    - -

    Definition at line 170 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ enqueue() [2/2]

    - -
    -
    -
    -template<typename Event >
    - - - - - -
    - - - - - - - - -
    void entt::dispatcher::enqueue (Event && event)
    -     		-inline
    -
    - -

    Enqueues an event of the given type.

    -

    An event of the given type is queued. No listener is invoked. Use the update member function to notify listeners when ready.

    -
    Template Parameters
    - - -
    EventType of event to enqueue.
    -
    -
    -
    Parameters
    - - -
    eventAn instance of the given type of event.
    -
    -
    - -

    Definition at line 184 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ operator=()

    - -
    -
    - - - - - -
    - - - - - - - - -
    dispatcher& entt::dispatcher::operator= (dispatcher && )
    -     		-default
    -
    - -

    Default move assignment operator.

    -
    Returns
    This dispatcher.
    - -
    -
    - -

    ◆ sink()

    - -
    -
    -
    -template<typename Event >
    - - - - - -
    - - - - - - - -
    auto entt::dispatcher::sink ()
    -     		-inline
    -
    - -

    Returns a sink object for the given event.

    -

    A sink is an opaque object used to connect listeners to events.

    -

    The function type for a listener is compatible with:

    void(Event &);
    -

    The order of invocation of the listeners isn't guaranteed.

    -
    See also
    sink
    -
    Template Parameters
    - - -
    EventType of event of which to get the sink.
    -
    -
    -
    Returns
    A temporary sink object.
    - -

    Definition at line 126 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ trigger() [1/2]

    - -
    -
    -
    -template<typename Event , typename... Args>
    - - - - - -
    - - - - - - - - -
    void entt::dispatcher::trigger (Args &&... args)
    -     		-inline
    -
    - -

    Triggers an immediate event of the given type.

    -

    All the listeners registered for the given type are immediately notified. The event is discarded after the execution.

    -
    Template Parameters
    - - - -
    EventType of event to trigger.
    ArgsTypes of arguments to use to construct the event.
    -
    -
    -
    Parameters
    - - -
    argsArguments to use to construct the event.
    -
    -
    - -

    Definition at line 141 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ trigger() [2/2]

    - -
    -
    -
    -template<typename Event >
    - - - - - -
    - - - - - - - - -
    void entt::dispatcher::trigger (Event && event)
    -     		-inline
    -
    - -

    Triggers an immediate event of the given type.

    -

    All the listeners registered for the given type are immediately notified. The event is discarded after the execution.

    -
    Template Parameters
    - - -
    EventType of event to trigger.
    -
    -
    -
    Parameters
    - - -
    eventAn instance of the given type of event.
    -
    -
    - -

    Definition at line 155 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ update() [1/2]

    - -
    -
    -
    -template<typename Event >
    - - - - - -
    - - - - - - - -
    void entt::dispatcher::update ()
    -     		-inline
    -
    - -

    Delivers all the pending events of the given type.

    -

    This method is blocking and it doesn't return until all the events are delivered to the registered listeners. It's responsibility of the users to reduce at a minimum the time spent in the bodies of the listeners.

    -
    Template Parameters
    - - -
    EventType of events to send.
    -
    -
    - -

    Definition at line 241 of file dispatcher.hpp.

    - -
    -
    - -

    ◆ update() [2/2]

    - -
    -
    - - - - - -
    - - - - - - - -
    void entt::dispatcher::update () const
    -     		-inline
    -
    - -

    Delivers all the pending events.

    -

    This method is blocking and it doesn't return until all the events are delivered to the registered listeners. It's responsibility of the users to reduce at a minimum the time spent in the bodies of the listeners.

    - -

    Definition at line 252 of file dispatcher.hpp.

    - -
    -
    -
    The documentation for this class was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1emitter-members.html b/classentt_1_1emitter-members.html index ee762aca2..7f3cd47d0 100644 --- a/classentt_1_1emitter-members.html +++ b/classentt_1_1emitter-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     Value assignment operator. More...
     
    meta_type type () const
     Returns the type of the underlying object. More...
     Returns the object type if any, type_id<void>() otherwise. More...
     
    const void * data () const
     Returns an opaque pointer to the contained instance. More...
     Replaces the contained object by creating a new instance directly. More...
     
    bool assign (const meta_any &other)
     Copy assigns a value to the contained object without replacing it. More...
     Assigns a value to the contained object without replacing it. More...
     
    bool assign (meta_any &&other)
     Move assigns a value to the contained object without replacing it. More...
     Assigns a value to the contained object without replacing it. More...
     
    -void reset ()
     Destroys contained object.
    void reset ()
     Destroys contained object. More...
     
    meta_sequence_container as_sequence_container ()
     Returns a sequence container proxy. More...

    Detailed Description

    Opaque wrapper for values of any type.

    -

    Definition at line 148 of file meta.hpp.

    +

    Definition at line 141 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_any() [1/4]

    @@ -424,7 +423,7 @@ template<typename Type >
    Returns
    True if there exists a viable conversion, false otherwise.
    -

    Definition at line 458 of file meta.hpp.

    +

    Definition at line 452 of file meta.hpp.

    @@ -462,7 +461,7 @@ template<typename Type >
    Returns
    A valid meta any object if there exists a viable conversion, an invalid one otherwise.
    -

    Definition at line 442 of file meta.hpp.

    +

    Definition at line 436 of file meta.hpp.

    @@ -499,7 +498,7 @@ template<typename Type >
    Returns
    True if there exists a viable conversion, false otherwise.
    -

    Definition at line 423 of file meta.hpp.

    +

    Definition at line 417 of file meta.hpp.

    @@ -536,7 +535,7 @@ template<typename Type >
    Returns
    A valid meta any object if there exists a viable conversion, an invalid one otherwise.
    -

    Definition at line 1408 of file meta.hpp.

    +

    Definition at line 1380 of file meta.hpp.

    @@ -566,7 +565,7 @@ template<typename Type >

    Returns an associative container proxy.

    Returns
    An associative container proxy for the underlying object.
    -

    Definition at line 530 of file meta.hpp.

    +

    Definition at line 511 of file meta.hpp.

    @@ -596,7 +595,7 @@ template<typename Type >

    Returns an associative container proxy.

    Returns
    An associative container proxy for the underlying object.
    -

    Definition at line 538 of file meta.hpp.

    +

    Definition at line 519 of file meta.hpp.

    @@ -626,7 +625,7 @@ template<typename Type >

    Aliasing constructor.

    Returns
    A wrapper that shares a reference to an unmanaged object.
    -

    Definition at line 577 of file meta.hpp.

    +

    Definition at line 551 of file meta.hpp.

    @@ -656,7 +655,7 @@ template<typename Type >

    Aliasing constructor.

    Returns
    A wrapper that shares a reference to an unmanaged object.
    -

    Definition at line 582 of file meta.hpp.

    +

    Definition at line 556 of file meta.hpp.

    @@ -686,7 +685,7 @@ template<typename Type >

    Returns a sequence container proxy.

    Returns
    A sequence container proxy for the underlying object.
    -

    Definition at line 511 of file meta.hpp.

    +

    Definition at line 492 of file meta.hpp.

    @@ -716,7 +715,7 @@ template<typename Type >

    Returns a sequence container proxy.

    Returns
    A sequence container proxy for the underlying object.
    -

    Definition at line 519 of file meta.hpp.

    +

    Definition at line 500 of file meta.hpp.

    @@ -744,7 +743,7 @@ template<typename Type >
    -

    Copy assigns a value to the contained object without replacing it.

    +

    Assigns a value to the contained object without replacing it.

    Parameters
    @@ -753,7 +752,7 @@ template<typename Type >
    Returns
    True in case of success, false otherwise.
    -

    Definition at line 1439 of file meta.hpp.

    +

    Definition at line 1411 of file meta.hpp.

    @@ -781,7 +780,7 @@ template<typename Type >
    otherThe value to assign to the contained object.
    -

    Move assigns a value to the contained object without replacing it.

    +

    Assigns a value to the contained object without replacing it.

    Parameters
    @@ -790,7 +789,7 @@ template<typename Type >
    Returns
    True in case of success, false otherwise.
    -

    Definition at line 1444 of file meta.hpp.

    +

    Definition at line 1416 of file meta.hpp.

    @@ -830,7 +829,7 @@ template<typename Type >
    Returns
    A reference to the contained instance.
    -

    Definition at line 403 of file meta.hpp.

    +

    Definition at line 397 of file meta.hpp.

    @@ -870,7 +869,7 @@ template<typename Type >
    Returns
    A reference to the contained instance.
    -

    Definition at line 395 of file meta.hpp.

    +

    Definition at line 389 of file meta.hpp.

    @@ -900,7 +899,7 @@ template<typename Type >

    Returns an opaque pointer to the contained instance.

    Returns
    An opaque pointer the contained instance, if any.
    -

    Definition at line 300 of file meta.hpp.

    +

    Definition at line 294 of file meta.hpp.

    @@ -930,7 +929,7 @@ template<typename Type >

    Returns an opaque pointer to the contained instance.

    Returns
    An opaque pointer the contained instance, if any.
    -

    Definition at line 295 of file meta.hpp.

    +

    Definition at line 289 of file meta.hpp.

    @@ -975,7 +974,7 @@ template<typename Type , typename... Args> -

    Definition at line 478 of file meta.hpp.

    +

    Definition at line 467 of file meta.hpp.

    @@ -1012,7 +1011,7 @@ template<typename Type , typename... Args>
    Returns
    A wrapper containing the value of the underlying variable.
    -

    Definition at line 1404 of file meta.hpp.

    +

    Definition at line 1376 of file meta.hpp.

    @@ -1049,7 +1048,7 @@ template<typename Type , typename... Args>
    Returns
    A wrapper containing the value of the underlying variable.
    -

    Definition at line 1400 of file meta.hpp.

    +

    Definition at line 1372 of file meta.hpp.

    @@ -1098,7 +1097,7 @@ template<typename... Args>
    Returns
    A wrapper containing the returned value, if any.
    -

    Definition at line 1391 of file meta.hpp.

    +

    Definition at line 1363 of file meta.hpp.

    @@ -1147,7 +1146,7 @@ template<typename... Args>
    Returns
    A wrapper containing the returned value, if any.
    -

    Definition at line 1386 of file meta.hpp.

    +

    Definition at line 1358 of file meta.hpp.

    @@ -1177,7 +1176,7 @@ template<typename... Args>

    Returns false if a wrapper is invalid, true otherwise.

    Returns
    False if the wrapper is invalid, true otherwise.
    -

    Definition at line 560 of file meta.hpp.

    +

    Definition at line 541 of file meta.hpp.

    @@ -1207,7 +1206,7 @@ template<typename... Args>

    Indirection operator for dereferencing opaque objects.

    Returns
    A wrapper that shares a reference to an unmanaged object if the wrapped element is dereferenceable, an invalid meta any otherwise.
    -

    Definition at line 550 of file meta.hpp.

    +

    Definition at line 531 of file meta.hpp.

    @@ -1363,7 +1362,7 @@ template<typename Type >
    Returns
    False if the two objects differ in their content, true otherwise.
    -

    Definition at line 569 of file meta.hpp.

    +

    Definition at line 546 of file meta.hpp.

    @@ -1393,7 +1392,36 @@ template<typename Type >

    Returns true if a wrapper owns its object, false otherwise.

    Returns
    True if the wrapper owns its object, false otherwise.
    -

    Definition at line 590 of file meta.hpp.

    +

    Definition at line 561 of file meta.hpp.

    + + + + +

    ◆ reset()

    + +
    +
    +
    otherThe value to assign to the contained object.
    + + + + +
    + + + + + + + +
    void entt::meta_any::reset ()
    +     		+inline
    +
    + +

    Destroys contained object.

    + +

    Definition at line 481 of file meta.hpp.

    @@ -1442,7 +1470,7 @@ template<typename Type >
    Returns
    True in case of success, false otherwise.
    -

    Definition at line 1396 of file meta.hpp.

    +

    Definition at line 1368 of file meta.hpp.

    @@ -1480,7 +1508,7 @@ template<typename Type >
    Returns
    A (possibly null) pointer to the contained instance.
    -

    Definition at line 369 of file meta.hpp.

    +

    Definition at line 363 of file meta.hpp.

    @@ -1518,7 +1546,7 @@ template<typename Type >
    Returns
    A (possibly null) pointer to the contained instance.
    -

    Definition at line 351 of file meta.hpp.

    +

    Definition at line 345 of file meta.hpp.

    @@ -1545,10 +1573,10 @@ template<typename Type >
    -

    Returns the type of the underlying object.

    -
    Returns
    The type of the underlying object, if any.
    +

    Returns the object type if any, type_id<void>() otherwise.

    +
    Returns
    The object type if any, type_id<void>() otherwise.
    -

    Definition at line 1381 of file meta.hpp.

    +

    Definition at line 1353 of file meta.hpp.

    diff --git a/classentt_1_1meta__associative__container-members.html b/classentt_1_1meta__associative__container-members.html index 685de6e93..2f98e238a 100644 --- a/classentt_1_1meta__associative__container-members.html +++ b/classentt_1_1meta__associative__container-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - -

    -Classes

    class  meta_iterator
     Opaque iterator for associative containers. More...
     
    +using 

    Public Types

    @@ -94,7 +87,7 @@ using  Unsigned integer type.
     
    -using iterator = meta_iterator
    iterator = meta_iterator
     Meta iterator type.
     
    @@ -148,7 +141,7 @@ Public Member Functions

    Detailed Description

    Proxy object for associative containers.

    -

    Definition at line 83 of file meta.hpp.

    +

    Definition at line 78 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_associative_container()

    @@ -200,7 +193,7 @@ template<typename Type > -

    Definition at line 101 of file meta.hpp.

    +

    Definition at line 96 of file meta.hpp.

    @@ -231,7 +224,7 @@ template<typename Type >

    Returns an iterator to the first element of a container.

    Returns
    An iterator to the first element of the container.
    -

    Definition at line 1821 of file meta.hpp.

    +

    Definition at line 1731 of file meta.hpp.

    @@ -261,7 +254,7 @@ template<typename Type >

    Clears the content of a container.

    Returns
    True in case of success, false otherwise.
    -

    Definition at line 1816 of file meta.hpp.

    +

    Definition at line 1726 of file meta.hpp.

    @@ -291,7 +284,7 @@ template<typename Type >

    Returns an iterator that is past the last element of a container.

    Returns
    An iterator that is past the last element of the container.
    -

    Definition at line 1826 of file meta.hpp.

    +

    Definition at line 1736 of file meta.hpp.

    @@ -328,7 +321,7 @@ template<typename Type >
    Returns
    A bool denoting whether the removal took place.
    -

    Definition at line 1845 of file meta.hpp.

    +

    Definition at line 1755 of file meta.hpp.

    @@ -365,7 +358,7 @@ template<typename Type >
    Returns
    An iterator to the element with the given key, if any.
    -

    Definition at line 1854 of file meta.hpp.

    +

    Definition at line 1764 of file meta.hpp.

    @@ -413,7 +406,7 @@ template<typename Type >
    Returns
    A bool denoting whether the insertion took place.
    -

    Definition at line 1836 of file meta.hpp.

    +

    Definition at line 1746 of file meta.hpp.

    @@ -443,7 +436,7 @@ template<typename Type >

    Returns true if a container is also key-only, false otherwise.

    Returns
    True if the associative container is also key-only, false otherwise.
    -

    Definition at line 1785 of file meta.hpp.

    +

    Definition at line 1695 of file meta.hpp.

    @@ -473,7 +466,7 @@ template<typename Type >

    Returns the meta key type of a container.

    Returns
    The meta key type of the a container.
    -

    Definition at line 1793 of file meta.hpp.

    +

    Definition at line 1703 of file meta.hpp.

    @@ -503,7 +496,7 @@ template<typename Type >

    Returns the meta mapped type of a container.

    Returns
    The meta mapped type of the a container.
    -

    Definition at line 1801 of file meta.hpp.

    +

    Definition at line 1711 of file meta.hpp.

    @@ -533,7 +526,7 @@ template<typename Type >

    Returns false if a proxy is invalid, true otherwise.

    Returns
    False if the proxy is invalid, true otherwise.
    -

    Definition at line 1862 of file meta.hpp.

    +

    Definition at line 1772 of file meta.hpp.

    @@ -563,7 +556,7 @@ template<typename Type >

    Returns the size of a container.

    Returns
    The size of the container.
    -

    Definition at line 1811 of file meta.hpp.

    +

    Definition at line 1721 of file meta.hpp.

    @@ -593,7 +586,7 @@ template<typename Type >

    Returns the meta value type of a container.

    Returns
    The meta value type of the container.
    -

    Definition at line 1806 of file meta.hpp.

    +

    Definition at line 1716 of file meta.hpp.

    diff --git a/classentt_1_1meta__associative__container_1_1meta__iterator-members.html b/classentt_1_1meta__associative__container_1_1meta__iterator-members.html deleted file mode 100644 index 3b8f58045..000000000 --- a/classentt_1_1meta__associative__container_1_1meta__iterator-members.html +++ /dev/null @@ -1,96 +0,0 @@ - - - - - - - -EnTT: Member List - - - - - - - - - -
    -
    -
    - - - - - -
    -
    EnTT -  3.9.0 -
    -
    - - - - - - - - - -
    -
    - - -
    - -
    - - - -
    -
    -
    entt::meta_associative_container::meta_iterator Member List
    -
    -
    - -

    This is the complete list of members for entt::meta_associative_container::meta_iterator, including all inherited members.

    - - - - - - - - - - - - - - - -
    difference_type typedefentt::meta_associative_container::meta_iterator
    iterator_category typedefentt::meta_associative_container::meta_iterator
    meta_iterator()=defaultentt::meta_associative_container::meta_iterator
    meta_iterator(std::integral_constant< bool, KeyOnly >, It iter)entt::meta_associative_container::meta_iteratorinline
    operator bool() constentt::meta_associative_container::meta_iteratorinlineexplicit
    operator!=(const meta_iterator &other) constentt::meta_associative_container::meta_iteratorinline
    operator*() constentt::meta_associative_container::meta_iteratorinline
    operator++()entt::meta_associative_container::meta_iteratorinline
    operator++(int)entt::meta_associative_container::meta_iteratorinline
    operator->() constentt::meta_associative_container::meta_iteratorinline
    operator==(const meta_iterator &other) constentt::meta_associative_container::meta_iteratorinline
    pointer typedefentt::meta_associative_container::meta_iterator
    reference typedefentt::meta_associative_container::meta_iterator
    value_type typedefentt::meta_associative_container::meta_iterator
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1meta__associative__container_1_1meta__iterator.html b/classentt_1_1meta__associative__container_1_1meta__iterator.html deleted file mode 100644 index cc5d704ff..000000000 --- a/classentt_1_1meta__associative__container_1_1meta__iterator.html +++ /dev/null @@ -1,433 +0,0 @@ - - - - - - - -EnTT: entt::meta_associative_container::meta_iterator Class Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -Public Types | -Public Member Functions | -List of all members
    -
    -
    entt::meta_associative_container::meta_iterator Class Reference
    -
    -
    - -

    Opaque iterator for associative containers. - More...

    - -

    #include <meta.hpp>

    - - - - - - - - - - - - - - - - - -

    -Public Types

    -using difference_type = std::ptrdiff_t
     Signed integer type.
     
    -using value_type = std::pair< meta_any, meta_any >
     Type of elements returned by the iterator.
     
    -using pointer = input_iterator_pointer< value_type >
     Pointer type, it's a safe temporary object.
     
    -using reference = value_type
     Reference type, it's not an actual reference.
     
    -using iterator_category = std::input_iterator_tag
     Iterator category.
     
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

    -Public Member Functions

    - meta_iterator ()=default
     Default constructor.
     
    template<bool KeyOnly, typename It >
     meta_iterator (std::integral_constant< bool, KeyOnly >, It iter)
     Constructs an meta iterator from a given iterator. More...
     
    meta_iterator & operator++ ()
     Pre-increment operator. More...
     
    meta_iterator operator++ (int)
     Post-increment operator. More...
     
    reference operator* () const
     Indirection operator for accessing the pointed opaque object. More...
     
    pointer operator-> () const
     Access operator for accessing the pointed opaque object. More...
     
     operator bool () const
     Returns false if an iterator is invalid, true otherwise. More...
     
    bool operator== (const meta_iterator &other) const
     Checks if two iterators refer to the same element. More...
     
    bool operator!= (const meta_iterator &other) const
     Checks if two iterators refer to the same element. More...
     
    -

    Detailed Description

    -

    Opaque iterator for associative containers.

    - -

    Definition at line 1669 of file meta.hpp.

    -

    Constructor & Destructor Documentation

    - -

    ◆ meta_iterator()

    - -
    -
    -
    -template<bool KeyOnly, typename It >
    - - - - - -
    - - - - - - - - - - - - - - - - - - -
    entt::meta_associative_container::meta_iterator::meta_iterator (std::integral_constant< bool, KeyOnly > ,
    It iter 
    )
    -     		-inline
    -
    - -

    Constructs an meta iterator from a given iterator.

    -
    Template Parameters
    - - - -
    KeyOnlyTrue if the container is also key-only, false otherwise.
    ItType of actual iterator with which to build the meta iterator.
    -
    -
    -
    Parameters
    - - -
    iterThe actual iterator with which to build the meta iterator.
    -
    -
    - -

    Definition at line 1717 of file meta.hpp.

    - -
    -
    -

    Member Function Documentation

    - -

    ◆ operator bool()

    - -
    -
    - - - - - -
    - - - - - - - -
    entt::meta_associative_container::meta_iterator::operator bool () const
    -     		-inlineexplicit
    -
    - -

    Returns false if an iterator is invalid, true otherwise.

    -
    Returns
    False if the iterator is invalid, true otherwise.
    - -

    Definition at line 1754 of file meta.hpp.

    - -
    -
    - -

    ◆ operator!=()

    - -
    -
    - - - - - -
    - - - - - - - - -
    bool entt::meta_associative_container::meta_iterator::operator!= (const meta_iterator & other) const
    -     		-inline
    -
    - -

    Checks if two iterators refer to the same element.

    -
    Parameters
    - - -
    otherThe iterator with which to compare.
    -
    -
    -
    Returns
    False if the iterators refer to the same element, true otherwise.
    - -

    Definition at line 1772 of file meta.hpp.

    - -
    -
    - -

    ◆ operator*()

    - -
    -
    - - - - - -
    - - - - - - - -
    reference entt::meta_associative_container::meta_iterator::operator* () const
    -     		-inline
    -
    - -

    Indirection operator for accessing the pointed opaque object.

    -
    Returns
    The element to which the iterator points.
    - -

    Definition at line 1736 of file meta.hpp.

    - -
    -
    - -

    ◆ operator++() [1/2]

    - -
    -
    - - - - - -
    - - - - - - - -
    meta_iterator& entt::meta_associative_container::meta_iterator::operator++ ()
    -     		-inline
    -
    - -

    Pre-increment operator.

    -
    Returns
    This iterator.
    - -

    Definition at line 1722 of file meta.hpp.

    - -
    -
    - -

    ◆ operator++() [2/2]

    - -
    -
    - - - - - -
    - - - - - - - - -
    meta_iterator entt::meta_associative_container::meta_iterator::operator++ (int )
    -     		-inline
    -
    - -

    Post-increment operator.

    -
    Returns
    This iterator.
    - -

    Definition at line 1727 of file meta.hpp.

    - -
    -
    - -

    ◆ operator->()

    - -
    -
    - - - - - -
    - - - - - - - -
    pointer entt::meta_associative_container::meta_iterator::operator-> () const
    -     		-inline
    -
    - -

    Access operator for accessing the pointed opaque object.

    -
    Returns
    The element to which the iterator points.
    - -

    Definition at line 1746 of file meta.hpp.

    - -
    -
    - -

    ◆ operator==()

    - -
    -
    - - - - - -
    - - - - - - - - -
    bool entt::meta_associative_container::meta_iterator::operator== (const meta_iterator & other) const
    -     		-inline
    -
    - -

    Checks if two iterators refer to the same element.

    -
    Parameters
    - - -
    otherThe iterator with which to compare.
    -
    -
    -
    Returns
    True if the iterators refer to the same element, false otherwise.
    - -

    Definition at line 1763 of file meta.hpp.

    - -
    -
    -
    The documentation for this class was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1meta__factory.html b/classentt_1_1meta__factory.html index 8ef07eb95..7ae0fdba2 100644 --- a/classentt_1_1meta__factory.html +++ b/classentt_1_1meta__factory.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     
    template<auto Candidate, typename Policy = as_is_t>
    auto func (const id_type id)
     Assigns a meta funcion to a meta type. More...
     Assigns a meta function to a meta type. More...
     

    Detailed Description

    diff --git a/classentt_1_1meta__factory_3_01Type_01_4-members.html b/classentt_1_1meta__factory_3_01Type_01_4-members.html index 7ff01faf1..ebf057c3b 100644 --- a/classentt_1_1meta__factory_3_01Type_01_4-members.html +++ b/classentt_1_1meta__factory_3_01Type_01_4-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     
    template<auto Candidate, typename Policy = as_is_t>
    auto func (const id_type id)
     Assigns a meta funcion to a meta type. More...
     Assigns a meta function to a meta type. More...
     

    Detailed Description

    @@ -315,7 +315,7 @@ template<auto Candidate, typename Policy = as_is_t>
    Returns
    An extended meta factory for the parent type.
    -

    Definition at line 323 of file factory.hpp.

    +

    Definition at line 321 of file factory.hpp.

    @@ -356,7 +356,7 @@ template<typename... Args>
    Returns
    An extended meta factory for the parent type.
    -

    Definition at line 351 of file factory.hpp.

    +

    Definition at line 349 of file factory.hpp.

    @@ -406,7 +406,7 @@ template<auto Data, typename Policy = as_is_t>
    Returns
    An extended meta factory for the parent type.
    -

    Definition at line 405 of file factory.hpp.

    +

    Definition at line 403 of file factory.hpp.

    @@ -458,7 +458,7 @@ template<auto Setter, auto Getter, typename Policy = as_is_t>
    Returns
    An extended meta factory for the parent type.
    -

    Definition at line 467 of file factory.hpp.

    +

    Definition at line 465 of file factory.hpp.

    @@ -510,7 +510,7 @@ template<typename Setter , auto Getter, typename Policy = as_is_t>
    Returns
    An extended meta factory for the parent type.
    -

    Definition at line 528 of file factory.hpp.

    +

    Definition at line 526 of file factory.hpp.

    @@ -555,7 +555,7 @@ template<auto Func>
    Returns
    A meta factory for the parent type.
    -

    Definition at line 385 of file factory.hpp.

    +

    Definition at line 383 of file factory.hpp.

    @@ -587,7 +587,7 @@ template<auto Candidate, typename Policy = as_is_t>
    -

    Assigns a meta funcion to a meta type.

    +

    Assigns a meta function to a meta type.

    Both member functions and free functions can be assigned to a meta type.
    From a client's point of view, all the functions associated with the reflected object will appear as if they were part of the type itself.

    Template Parameters
    @@ -605,7 +605,7 @@ template<auto Candidate, typename Policy = as_is_t>
    Returns
    An extended meta factory for the parent type.
    -

    Definition at line 546 of file factory.hpp.

    +

    Definition at line 544 of file factory.hpp.

    diff --git a/classentt_1_1meta__function__helper-members.html b/classentt_1_1meta__function__helper-members.html index 2f3a31261..1b34d4cb3 100644 --- a/classentt_1_1meta__function__helper-members.html +++ b/classentt_1_1meta__function__helper-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - -

    -Classes

    class  meta_iterator
     Opaque iterator for sequence containers. More...
     
    +using 

    Public Types

    @@ -94,7 +87,7 @@ using  Unsigned integer type.
     
    -using iterator = meta_iterator
    iterator = meta_iterator
     Meta iterator type.
     
    @@ -142,7 +135,7 @@ Public Member Functions

    Detailed Description

    Proxy object for sequence containers.

    -

    Definition at line 28 of file meta.hpp.

    +

    Definition at line 29 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_sequence_container()

    @@ -194,7 +187,7 @@ template<typename Type > -

    Definition at line 46 of file meta.hpp.

    +

    Definition at line 47 of file meta.hpp.

    @@ -225,7 +218,7 @@ template<typename Type >

    Returns an iterator to the first element of a container.

    Returns
    An iterator to the first element of the container.
    -

    Definition at line 1619 of file meta.hpp.

    +

    Definition at line 1640 of file meta.hpp.

    @@ -255,7 +248,7 @@ template<typename Type >

    Clears the content of a container.

    Returns
    True in case of success, false otherwise.
    -

    Definition at line 1611 of file meta.hpp.

    +

    Definition at line 1632 of file meta.hpp.

    @@ -285,7 +278,7 @@ template<typename Type >

    Returns an iterator that is past the last element of a container.

    Returns
    An iterator that is past the last element of the container.
    -

    Definition at line 1627 of file meta.hpp.

    +

    Definition at line 1648 of file meta.hpp.

    @@ -322,7 +315,7 @@ template<typename Type >
    Returns
    A possibly invalid iterator following the last removed element.
    -

    Definition at line 1646 of file meta.hpp.

    +

    Definition at line 1667 of file meta.hpp.

    @@ -370,7 +363,7 @@ template<typename Type >
    Returns
    A possibly invalid iterator to the inserted element.
    -

    Definition at line 1637 of file meta.hpp.

    +

    Definition at line 1658 of file meta.hpp.

    @@ -400,7 +393,7 @@ template<typename Type >

    Returns false if a proxy is invalid, true otherwise.

    Returns
    False if the proxy is invalid, true otherwise.
    -

    Definition at line 1664 of file meta.hpp.

    +

    Definition at line 1687 of file meta.hpp.

    @@ -437,7 +430,7 @@ template<typename Type >
    Returns
    A reference to the requested element properly wrapped.
    -

    Definition at line 1656 of file meta.hpp.

    +

    Definition at line 1677 of file meta.hpp.

    @@ -474,7 +467,7 @@ template<typename Type >
    Returns
    True in case of success, false otherwise.
    -

    Definition at line 1603 of file meta.hpp.

    +

    Definition at line 1624 of file meta.hpp.

    @@ -504,7 +497,7 @@ template<typename Type >

    Returns the size of a container.

    Returns
    The size of the container.
    -

    Definition at line 1594 of file meta.hpp.

    +

    Definition at line 1615 of file meta.hpp.

    @@ -534,7 +527,7 @@ template<typename Type >

    Returns the meta value type of a container.

    Returns
    The meta value type of the container.
    -

    Definition at line 1586 of file meta.hpp.

    +

    Definition at line 1607 of file meta.hpp.

    diff --git a/classentt_1_1meta__sequence__container_1_1meta__iterator-members.html b/classentt_1_1meta__sequence__container_1_1meta__iterator-members.html deleted file mode 100644 index eeafc2bff..000000000 --- a/classentt_1_1meta__sequence__container_1_1meta__iterator-members.html +++ /dev/null @@ -1,97 +0,0 @@ - - - - - - - -EnTT: Member List - - - - - - - - - -
    -
    -
    - - - - - -
    -
    EnTT -  3.9.0 -
    -
    - - - - - - - - - -
    -
    - - -
    - -
    - - - -
    -
    -
    entt::meta_sequence_container::meta_iterator Member List
    -
    -
    - -

    This is the complete list of members for entt::meta_sequence_container::meta_iterator, including all inherited members.

    - - - - - - - - - - - - - - - - -
    base() constentt::meta_sequence_container::meta_iteratorinline
    difference_type typedefentt::meta_sequence_container::meta_iterator
    iterator_category typedefentt::meta_sequence_container::meta_iterator
    meta_iterator()=defaultentt::meta_sequence_container::meta_iterator
    meta_iterator(It iter)entt::meta_sequence_container::meta_iteratorinlineexplicit
    operator bool() constentt::meta_sequence_container::meta_iteratorinlineexplicit
    operator!=(const meta_iterator &other) constentt::meta_sequence_container::meta_iteratorinline
    operator*() constentt::meta_sequence_container::meta_iteratorinline
    operator++()entt::meta_sequence_container::meta_iteratorinline
    operator++(int)entt::meta_sequence_container::meta_iteratorinline
    operator->() constentt::meta_sequence_container::meta_iteratorinline
    operator==(const meta_iterator &other) constentt::meta_sequence_container::meta_iteratorinline
    pointer typedefentt::meta_sequence_container::meta_iterator
    reference typedefentt::meta_sequence_container::meta_iterator
    value_type typedefentt::meta_sequence_container::meta_iterator
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1meta__sequence__container_1_1meta__iterator.html b/classentt_1_1meta__sequence__container_1_1meta__iterator.html deleted file mode 100644 index 81cae5496..000000000 --- a/classentt_1_1meta__sequence__container_1_1meta__iterator.html +++ /dev/null @@ -1,455 +0,0 @@ - - - - - - - -EnTT: entt::meta_sequence_container::meta_iterator Class Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -Public Types | -Public Member Functions | -List of all members
    -
    -
    entt::meta_sequence_container::meta_iterator Class Reference
    -
    -
    - -

    Opaque iterator for sequence containers. - More...

    - -

    #include <meta.hpp>

    - - - - - - - - - - - - - - - - - -

    -Public Types

    -using difference_type = std::ptrdiff_t
     Signed integer type.
     
    -using value_type = meta_any
     Type of elements returned by the iterator.
     
    -using pointer = input_iterator_pointer< value_type >
     Pointer type, it's a safe temporary object.
     
    -using reference = value_type
     Reference type, it's not an actual reference.
     
    -using iterator_category = std::input_iterator_tag
     Iterator category.
     
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

    -Public Member Functions

    - meta_iterator ()=default
     Default constructor.
     
    template<typename It >
     meta_iterator (It iter)
     Constructs a meta iterator from a given iterator. More...
     
    meta_iterator & operator++ ()
     Pre-increment operator. More...
     
    meta_iterator operator++ (int)
     Post-increment operator. More...
     
    reference operator* () const
     Indirection operator for accessing the pointed opaque object. More...
     
    pointer operator-> () const
     Access operator for accessing the pointed opaque object. More...
     
     operator bool () const
     Returns false if an iterator is invalid, true otherwise. More...
     
    bool operator== (const meta_iterator &other) const
     Checks if two iterators refer to the same element. More...
     
    bool operator!= (const meta_iterator &other) const
     Checks if two iterators refer to the same element. More...
     
    any base () const
     Returns the underlying iterator. More...
     
    -

    Detailed Description

    -

    Opaque iterator for sequence containers.

    - -

    Definition at line 1469 of file meta.hpp.

    -

    Constructor & Destructor Documentation

    - -

    ◆ meta_iterator()

    - -
    -
    -
    -template<typename It >
    - - - - - -
    - - - - - - - - -
    entt::meta_sequence_container::meta_iterator::meta_iterator (It iter)
    -     		-inlineexplicit
    -
    - -

    Constructs a meta iterator from a given iterator.

    -
    Template Parameters
    - - -
    ItType of actual iterator with which to build the meta iterator.
    -
    -
    -
    Parameters
    - - -
    iterThe actual iterator with which to build the meta iterator.
    -
    -
    - -

    Definition at line 1510 of file meta.hpp.

    - -
    -
    -

    Member Function Documentation

    - -

    ◆ base()

    - -
    -
    - - - - - -
    - - - - - - - -
    any entt::meta_sequence_container::meta_iterator::base () const
    -     		-inline
    -
    - -

    Returns the underlying iterator.

    -
    Returns
    The underlying iterator.
    - -

    Definition at line 1573 of file meta.hpp.

    - -
    -
    - -

    ◆ operator bool()

    - -
    -
    - - - - - -
    - - - - - - - -
    entt::meta_sequence_container::meta_iterator::operator bool () const
    -     		-inlineexplicit
    -
    - -

    Returns false if an iterator is invalid, true otherwise.

    -
    Returns
    False if the iterator is invalid, true otherwise.
    - -

    Definition at line 1547 of file meta.hpp.

    - -
    -
    - -

    ◆ operator!=()

    - -
    -
    - - - - - -
    - - - - - - - - -
    bool entt::meta_sequence_container::meta_iterator::operator!= (const meta_iterator & other) const
    -     		-inline
    -
    - -

    Checks if two iterators refer to the same element.

    -
    Parameters
    - - -
    otherThe iterator with which to compare.
    -
    -
    -
    Returns
    False if the iterators refer to the same element, true otherwise.
    - -

    Definition at line 1565 of file meta.hpp.

    - -
    -
    - -

    ◆ operator*()

    - -
    -
    - - - - - -
    - - - - - - - -
    reference entt::meta_sequence_container::meta_iterator::operator* () const
    -     		-inline
    -
    - -

    Indirection operator for accessing the pointed opaque object.

    -
    Returns
    The element to which the iterator points.
    - -

    Definition at line 1529 of file meta.hpp.

    - -
    -
    - -

    ◆ operator++() [1/2]

    - -
    -
    - - - - - -
    - - - - - - - -
    meta_iterator& entt::meta_sequence_container::meta_iterator::operator++ ()
    -     		-inline
    -
    - -

    Pre-increment operator.

    -
    Returns
    This iterator.
    - -

    Definition at line 1515 of file meta.hpp.

    - -
    -
    - -

    ◆ operator++() [2/2]

    - -
    -
    - - - - - -
    - - - - - - - - -
    meta_iterator entt::meta_sequence_container::meta_iterator::operator++ (int )
    -     		-inline
    -
    - -

    Post-increment operator.

    -
    Returns
    This iterator.
    - -

    Definition at line 1520 of file meta.hpp.

    - -
    -
    - -

    ◆ operator->()

    - -
    -
    - - - - - -
    - - - - - - - -
    pointer entt::meta_sequence_container::meta_iterator::operator-> () const
    -     		-inline
    -
    - -

    Access operator for accessing the pointed opaque object.

    -
    Returns
    The element to which the iterator points.
    - -

    Definition at line 1539 of file meta.hpp.

    - -
    -
    - -

    ◆ operator==()

    - -
    -
    - - - - - -
    - - - - - - - - -
    bool entt::meta_sequence_container::meta_iterator::operator== (const meta_iterator & other) const
    -     		-inline
    -
    - -

    Checks if two iterators refer to the same element.

    -
    Parameters
    - - -
    otherThe iterator with which to compare.
    -
    -
    -
    Returns
    True if the iterators refer to the same element, false otherwise.
    - -

    Definition at line 1556 of file meta.hpp.

    - -
    -
    -
    The documentation for this class was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1meta__type-members.html b/classentt_1_1meta__type-members.html index f08c1be76..c261aee06 100644 --- a/classentt_1_1meta__type-members.html +++ b/classentt_1_1meta__type-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     meta_type (const base_node_type *curr)
     Constructs an instance from a given base node. More...
     
    const type_info & info () const
    const type_info & info () const
     Returns the type info object of the underlying type. More...
     
    id_type id () const
    @@ -623,7 +623,7 @@ template<typename... Args>
    Returns
    A wrapper containing the value of the underlying variable.
    -

    Definition at line 1325 of file meta.hpp.

    +

    Definition at line 1297 of file meta.hpp.

    @@ -653,7 +653,7 @@ template<typename... Args>

    Returns the identifier assigned to a type.

    Returns
    The identifier assigned to the type.
    -

    Definition at line 1051 of file meta.hpp.

    +

    Definition at line 1020 of file meta.hpp.

    @@ -667,7 +667,7 @@ template<typename... Args> @@ -67,29 +67,46 @@ $(function() {
    -
    entt::resource_cache< Resource > Member List
    +
    entt::resource_cache< Type, Loader, Allocator > Member List
    -

    This is the complete list of members for entt::resource_cache< Resource >, including all inherited members.

    +

    This is the complete list of members for entt::resource_cache< Type, Loader, Allocator >, including all inherited members.

    idUnique identifier.
    - + @@ -683,7 +683,7 @@ template<typename... Args>

    Returns the type info object of the underlying type.

    Returns
    The type info object of the underlying type.
    -

    Definition at line 1043 of file meta.hpp.

    +

    Definition at line 1012 of file meta.hpp.

    @@ -752,7 +752,7 @@ template<typename... Args>
    Returns
    A wrapper containing the new instance, if any.
    -

    Definition at line 1289 of file meta.hpp.

    +

    Definition at line 1262 of file meta.hpp.

    @@ -803,7 +803,7 @@ template<typename... Args>

    Invokes a function given an identifier, if possible.

    -

    It must be possible to cast the instance to the parent type of the member function. Otherwise, invoking the underlying function results in an undefined behavior.

    +

    It must be possible to cast the instance to the parent type of the member function.

    See also
    meta_func::invoke
    Parameters
    const type_info& entt::meta_type::info const type_info& entt::meta_type::info ( ) const
    @@ -816,7 +816,7 @@ template<typename... Args>
    Returns
    A wrapper containing the returned value, if any.
    -

    Definition at line 1272 of file meta.hpp.

    +

    Definition at line 1240 of file meta.hpp.

    @@ -846,7 +846,7 @@ template<typename... Args>

    Checks whether a type refers to an arithmetic type or not.

    Returns
    True if the underlying type is an arithmetic type, false otherwise.
    -

    Definition at line 1068 of file meta.hpp.

    +

    Definition at line 1037 of file meta.hpp.

    @@ -876,7 +876,7 @@ template<typename... Args>

    Checks whether a type refers to an array type or not.

    Returns
    True if the underlying type is an array type, false otherwise.
    -

    Definition at line 1076 of file meta.hpp.

    +

    Definition at line 1045 of file meta.hpp.

    @@ -906,7 +906,7 @@ template<typename... Args>

    Checks whether a type refers to an associative container or not.

    Returns
    True if the type is an associative container, false otherwise.
    -

    Definition at line 1125 of file meta.hpp.

    +

    Definition at line 1094 of file meta.hpp.

    @@ -936,7 +936,7 @@ template<typename... Args>

    Checks whether a type refers to a class or not.

    Returns
    True if the underlying type is a class, false otherwise.
    -

    Definition at line 1092 of file meta.hpp.

    +

    Definition at line 1061 of file meta.hpp.

    @@ -966,7 +966,7 @@ template<typename... Args>

    Checks whether a type refers to an enum or not.

    Returns
    True if the underlying type is an enum, false otherwise.
    -

    Definition at line 1084 of file meta.hpp.

    +

    Definition at line 1053 of file meta.hpp.

    @@ -996,7 +996,7 @@ template<typename... Args>

    Checks whether a type refers to a pointer or not.

    Returns
    True if the underlying type is a pointer, false otherwise.
    -

    Definition at line 1100 of file meta.hpp.

    +

    Definition at line 1069 of file meta.hpp.

    @@ -1026,7 +1026,7 @@ template<typename... Args>

    Checks whether a type is a pointer-like type or not.

    Returns
    True if the underlying type is a pointer-like one, false otherwise.
    -

    Definition at line 1109 of file meta.hpp.

    +

    Definition at line 1078 of file meta.hpp.

    @@ -1056,7 +1056,7 @@ template<typename... Args>

    Checks whether a type refers to a sequence container or not.

    Returns
    True if the type is a sequence container, false otherwise.
    -

    Definition at line 1117 of file meta.hpp.

    +

    Definition at line 1086 of file meta.hpp.

    @@ -1086,7 +1086,7 @@ template<typename... Args>

    Checks whether a type refers to a recognized class template specialization or not.

    Returns
    True if the type is a recognized class template specialization, false otherwise.
    -

    Definition at line 1135 of file meta.hpp.

    +

    Definition at line 1104 of file meta.hpp.

    @@ -1116,7 +1116,7 @@ template<typename... Args>

    Returns true if an object is valid, false otherwise.

    Returns
    True if the object is valid, false otherwise.
    -

    Definition at line 1354 of file meta.hpp.

    +

    Definition at line 1326 of file meta.hpp.

    @@ -1153,7 +1153,7 @@ template<typename... Args>
    Returns
    True if the objects refer to the same type, false otherwise.
    -

    Definition at line 1363 of file meta.hpp.

    +

    Definition at line 1335 of file meta.hpp.

    @@ -1183,7 +1183,7 @@ template<typename... Args>

    Returns a range to visit registered top-level meta properties.

    Returns
    An iterable range to visit registered top-level meta properties.
    -

    Definition at line 1334 of file meta.hpp.

    +

    Definition at line 1306 of file meta.hpp.

    @@ -1221,7 +1221,7 @@ template<typename... Args>
    Returns
    The registered meta property for the given key, if any.
    -

    Definition at line 1346 of file meta.hpp.

    +

    Definition at line 1318 of file meta.hpp.

    @@ -1268,7 +1268,7 @@ template<typename Type >

    Sets the value of a given variable.

    -

    It must be possible to cast the instance to the parent type of the data member. Otherwise, invoking the setter results in an undefined behavior.
    +

    It must be possible to cast the instance to the parent type of the data member.
    The type of the value is such that a cast or conversion to the type of the variable is possible. Otherwise, invoking the setter does nothing.

    Template Parameters
    @@ -1286,7 +1286,7 @@ template<typename Type >
    Returns
    True in case of success, false otherwise.
    -

    Definition at line 1310 of file meta.hpp.

    +

    Definition at line 1282 of file meta.hpp.

    @@ -1316,7 +1316,7 @@ template<typename Type >

    Returns the size of the underlying type if known.

    Returns
    The size of the underlying type if known, 0 otherwise.
    -

    Definition at line 1059 of file meta.hpp.

    +

    Definition at line 1028 of file meta.hpp.

    @@ -1353,7 +1353,7 @@ template<typename Type >
    Returns
    The type of the i-th template argument of a type.
    -

    Definition at line 1163 of file meta.hpp.

    +

    Definition at line 1132 of file meta.hpp.

    @@ -1383,7 +1383,7 @@ template<typename Type >

    Returns the number of template arguments.

    Returns
    The number of template arguments.
    -

    Definition at line 1143 of file meta.hpp.

    +

    Definition at line 1112 of file meta.hpp.

    @@ -1414,7 +1414,7 @@ template<typename Type >
    See also
    meta_class_template_tag
    Returns
    The tag for the class template of the underlying type.
    -

    Definition at line 1154 of file meta.hpp.

    +

    Definition at line 1123 of file meta.hpp.

    diff --git a/classentt_1_1poly__vtable-members.html b/classentt_1_1poly__vtable-members.html index 68e552cc8..8af87fcd7 100644 --- a/classentt_1_1poly__vtable-members.html +++ b/classentt_1_1poly__vtable-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1poly__vtable.html b/classentt_1_1poly__vtable.html index abf3f0fb3..5f7c7e76e 100644 --- a/classentt_1_1poly__vtable.html +++ b/classentt_1_1poly__vtable.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1process-members.html b/classentt_1_1process-members.html index f3f4c6323..ea035b05d 100644 --- a/classentt_1_1process-members.html +++ b/classentt_1_1process-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1process.html b/classentt_1_1process.html index 9c79e7a03..307d60754 100644 --- a/classentt_1_1process.html +++ b/classentt_1_1process.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1resource-members.html b/classentt_1_1resource-members.html new file mode 100644 index 000000000..b05a94504 --- /dev/null +++ b/classentt_1_1resource-members.html @@ -0,0 +1,99 @@ + + + + + + + +EnTT: Member List + + + + + + + + + +
    +
    +
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    + + + + + +
    +
    EnTT +  3.10.0 +
    +
    + + + + + + + + + +
    +
    + + +
    + +
    + + + +
    +
    +
    entt::resource< Type > Member List
    +
    +
    + +

    This is the complete list of members for entt::resource< Type >, including all inherited members.

    + + + + + + + + + + + + + + + + + + +
    operator bool() constentt::resource< Type >inlineexplicit
    operator Type &() constentt::resource< Type >inline
    operator*() constentt::resource< Type >inline
    operator->() constentt::resource< Type >inline
    operator=(const resource &)=defaultentt::resource< Type >
    operator=(resource &&)=defaultentt::resource< Type >
    operator=(const resource< Other > &other)entt::resource< Type >inline
    operator=(resource< Other > &&other)entt::resource< Type >inline
    resource classentt::resource< Type >friend
    resource()entt::resource< Type >inline
    resource(std::shared_ptr< Type > res)entt::resource< Type >inlineexplicit
    resource(const resource &)=defaultentt::resource< Type >
    resource(resource &&)=defaultentt::resource< Type >
    resource(const resource< Other > &other, Type &res)entt::resource< Type >inline
    resource(const resource< Other > &other)entt::resource< Type >inline
    resource(resource< Other > &&other)entt::resource< Type >inline
    use_count() constentt::resource< Type >inline
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/classentt_1_1resource.html b/classentt_1_1resource.html new file mode 100644 index 000000000..336c7dd7b --- /dev/null +++ b/classentt_1_1resource.html @@ -0,0 +1,682 @@ + + + + + + + +EnTT: entt::resource< Type > Class Template Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Public Member Functions | +Friends | +List of all members
    +
    +
    entt::resource< Type > Class Template Reference
    +
    +
    + +

    Basic resource handle. + More...

    + +

    #include <resource.hpp>

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Public Member Functions

    + resource ()
     Default constructor.
     
     resource (std::shared_ptr< Type > res)
     Creates a handle from a weak pointer, namely a resource. More...
     
    + resource (const resource &)=default
     Default copy constructor.
     
    + resource (resource &&)=default
     Default move constructor.
     
    template<typename Other >
     resource (const resource< Other > &other, Type &res)
     Aliasing constructor. More...
     
    template<typename Other , typename = std::enable_if_t<is_acceptable_v<Other>>>
     resource (const resource< Other > &other)
     Copy constructs a handle which shares ownership of the resource. More...
     
    template<typename Other , typename = std::enable_if_t<is_acceptable_v<Other>>>
     resource (resource< Other > &&other)
     Move constructs a handle which takes ownership of the resource. More...
     
    resource & operator= (const resource &)=default
     Default copy assignment operator. More...
     
    resource & operator= (resource &&)=default
     Default move assignment operator. More...
     
    template<typename Other >
    std::enable_if_t< is_acceptable_v< Other >, resource & > operator= (const resource< Other > &other)
     Copy assignment operator from foreign handle. More...
     
    template<typename Other >
    std::enable_if_t< is_acceptable_v< Other >, resource & > operator= (resource< Other > &&other)
     Move assignment operator from foreign handle. More...
     
    Type & operator* () const
     Returns a reference to the managed resource. More...
     
     operator Type & () const
     Returns a reference to the managed resource. More...
     
    Type * operator-> () const
     Returns a pointer to the managed resource. More...
     
     operator bool () const
     Returns true if a handle contains a resource, false otherwise. More...
     
    long use_count () const
     Returns the number of handles pointing the same resource. More...
     
    + + + + + +

    +Friends

    +template<typename >
    class resource
     Resource handles are friends with each other.
     
    +

    Detailed Description

    +

    template<typename Type>
    +class entt::resource< Type >

    + +

    Basic resource handle.

    +

    A handle wraps a resource and extends its lifetime. It also shares the same resource with all other handles constructed from the same element.
    + As a rule of thumb, resources should never be copied nor moved. Handles are the way to go to push references around.

    +
    Template Parameters
    + + +
    TypeType of resource managed by a handle.
    +
    +
    + +

    Definition at line 23 of file resource.hpp.

    +

    Constructor & Destructor Documentation

    + +

    ◆ resource() [1/4]

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + + +
    entt::resource< Type >::resource (std::shared_ptr< Type > res)
    +     		+inlineexplicit
    +
    + +

    Creates a handle from a weak pointer, namely a resource.

    +
    Parameters
    + + +
    resA weak pointer to a resource.
    +
    +
    + +

    Definition at line 40 of file resource.hpp.

    + +
    +
    + +

    ◆ resource() [2/4]

    + +
    +
    +
    +template<typename Type >
    +
    +template<typename Other >
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    entt::resource< Type >::resource (const resource< Other > & other,
    Type & res 
    )
    +     		+inline
    +
    + +

    Aliasing constructor.

    +
    Template Parameters
    + + +
    OtherType of resource managed by the received handle.
    +
    +
    +
    Parameters
    + + + +
    otherThe handle with which to share ownership information.
    resUnrelated and unmanaged resources.
    +
    +
    + +

    Definition at line 56 of file resource.hpp.

    + +
    +
    + +

    ◆ resource() [3/4]

    + +
    +
    +
    +template<typename Type >
    +
    +template<typename Other , typename = std::enable_if_t<is_acceptable_v<Other>>>
    + + + + + +
    + + + + + + + + +
    entt::resource< Type >::resource (const resource< Other > & other)
    +     		+inline
    +
    + +

    Copy constructs a handle which shares ownership of the resource.

    +
    Template Parameters
    + + +
    OtherType of resource managed by the received handle.
    +
    +
    +
    Parameters
    + + +
    otherThe handle to copy from.
    +
    +
    + +

    Definition at line 65 of file resource.hpp.

    + +
    +
    + +

    ◆ resource() [4/4]

    + +
    +
    +
    +template<typename Type >
    +
    +template<typename Other , typename = std::enable_if_t<is_acceptable_v<Other>>>
    + + + + + +
    + + + + + + + + +
    entt::resource< Type >::resource (resource< Other > && other)
    +     		+inline
    +
    + +

    Move constructs a handle which takes ownership of the resource.

    +
    Template Parameters
    + + +
    OtherType of resource managed by the received handle.
    +
    +
    +
    Parameters
    + + +
    otherThe handle to move from.
    +
    +
    + +

    Definition at line 74 of file resource.hpp.

    + +
    +
    +

    Member Function Documentation

    + +

    ◆ operator bool()

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + +
    entt::resource< Type >::operator bool () const
    +     		+inlineexplicit
    +
    + +

    Returns true if a handle contains a resource, false otherwise.

    +
    Returns
    True if the handle contains a resource, false otherwise.
    + +

    Definition at line 144 of file resource.hpp.

    + +
    +
    + +

    ◆ operator Type &()

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + +
    entt::resource< Type >::operator Type & () const
    +     		+inline
    +
    + +

    Returns a reference to the managed resource.

    +
    Warning
    The behavior is undefined if the handle doesn't contain a resource.
    +
    Returns
    A reference to the managed resource.
    + +

    Definition at line 128 of file resource.hpp.

    + +
    +
    + +

    ◆ operator*()

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + +
    Type& entt::resource< Type >::operator* () const
    +     		+inline
    +
    + +

    Returns a reference to the managed resource.

    +
    Warning
    The behavior is undefined if the handle doesn't contain a resource.
    +
    Returns
    A reference to the managed resource.
    + +

    Definition at line 123 of file resource.hpp.

    + +
    +
    + +

    ◆ operator->()

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + +
    Type* entt::resource< Type >::operator-> () const
    +     		+inline
    +
    + +

    Returns a pointer to the managed resource.

    +
    Returns
    A pointer to the managed resource.
    + +

    Definition at line 136 of file resource.hpp.

    + +
    +
    + +

    ◆ operator=() [1/4]

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + + +
    resource& entt::resource< Type >::operator= (const resource< Type > & )
    +     		+default
    +
    + +

    Default copy assignment operator.

    +
    Returns
    This resource handle.
    + +
    +
    + +

    ◆ operator=() [2/4]

    + +
    +
    +
    +template<typename Type >
    +
    +template<typename Other >
    + + + + + +
    + + + + + + + + +
    std::enable_if_t<is_acceptable_v<Other>, resource &> entt::resource< Type >::operator= (const resource< Other > & other)
    +     		+inline
    +
    + +

    Copy assignment operator from foreign handle.

    +
    Template Parameters
    + + +
    OtherType of resource managed by the received handle.
    +
    +
    +
    Parameters
    + + +
    otherThe handle to copy from.
    +
    +
    +
    Returns
    This resource handle.
    + +

    Definition at line 97 of file resource.hpp.

    + +
    +
    + +

    ◆ operator=() [3/4]

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + + +
    resource& entt::resource< Type >::operator= (resource< Type > && )
    +     		+default
    +
    + +

    Default move assignment operator.

    +
    Returns
    This resource handle.
    + +
    +
    + +

    ◆ operator=() [4/4]

    + +
    +
    +
    +template<typename Type >
    +
    +template<typename Other >
    + + + + + +
    + + + + + + + + +
    std::enable_if_t<is_acceptable_v<Other>, resource &> entt::resource< Type >::operator= (resource< Other > && other)
    +     		+inline
    +
    + +

    Move assignment operator from foreign handle.

    +
    Template Parameters
    + + +
    OtherType of resource managed by the received handle.
    +
    +
    +
    Parameters
    + + +
    otherThe handle to move from.
    +
    +
    +
    Returns
    This resource handle.
    + +

    Definition at line 110 of file resource.hpp.

    + +
    +
    + +

    ◆ use_count()

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + +
    long entt::resource< Type >::use_count () const
    +     		+inline
    +
    + +

    Returns the number of handles pointing the same resource.

    +
    Returns
    The number of handles pointing the same resource.
    + +

    Definition at line 152 of file resource.hpp.

    + +
    +
    +
    The documentation for this class was generated from the following files: +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/classentt_1_1resource__cache-members.html b/classentt_1_1resource__cache-members.html index 481c101c9..167c63acc 100644 --- a/classentt_1_1resource__cache-members.html +++ b/classentt_1_1resource__cache-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    clear()entt::resource_cache< Resource >inline
    contains(const id_type id) constentt::resource_cache< Resource >inline
    discard(const id_type id)entt::resource_cache< Resource >inline
    each(Func func) constentt::resource_cache< Resource >inline
    each(Func func)entt::resource_cache< Resource >inline
    empty() constentt::resource_cache< Resource >inline
    handle(const id_type id) constentt::resource_cache< Resource >inline
    handle(const id_type id)entt::resource_cache< Resource >inline
    load(const id_type id, Args &&...args)entt::resource_cache< Resource >inline
    operator=(resource_cache &&)=defaultentt::resource_cache< Resource >
    reload(const id_type id, Args &&...args)entt::resource_cache< Resource >inline
    resource_cache()=defaultentt::resource_cache< Resource >
    resource_cache(resource_cache &&)=defaultentt::resource_cache< Resource >
    resource_type typedefentt::resource_cache< Resource >
    size() constentt::resource_cache< Resource >inline
    size_type typedefentt::resource_cache< Resource >
    temp(Args &&...args) constentt::resource_cache< Resource >inline
    allocator_type typedefentt::resource_cache< Type, Loader, Allocator >
    begin() constentt::resource_cache< Type, Loader, Allocator >inline
    begin()entt::resource_cache< Type, Loader, Allocator >inline
    cbegin() constentt::resource_cache< Type, Loader, Allocator >inline
    cend() constentt::resource_cache< Type, Loader, Allocator >inline
    clear()entt::resource_cache< Type, Loader, Allocator >inline
    const_iterator typedefentt::resource_cache< Type, Loader, Allocator >
    contains(const id_type id) constentt::resource_cache< Type, Loader, Allocator >inline
    empty() constentt::resource_cache< Type, Loader, Allocator >inline
    end() constentt::resource_cache< Type, Loader, Allocator >inline
    end()entt::resource_cache< Type, Loader, Allocator >inline
    erase(const_iterator pos)entt::resource_cache< Type, Loader, Allocator >inline
    erase(const_iterator first, const_iterator last)entt::resource_cache< Type, Loader, Allocator >inline
    erase(const id_type id)entt::resource_cache< Type, Loader, Allocator >inline
    force_load(const id_type id, Args &&...args)entt::resource_cache< Type, Loader, Allocator >inline
    get_allocator() constentt::resource_cache< Type, Loader, Allocator >inline
    iterator typedefentt::resource_cache< Type, Loader, Allocator >
    load(const id_type id, Args &&...args)entt::resource_cache< Type, Loader, Allocator >inline
    loader() constentt::resource_cache< Type, Loader, Allocator >inline
    loader_type typedefentt::resource_cache< Type, Loader, Allocator >
    operator=(const resource_cache &)=defaultentt::resource_cache< Type, Loader, Allocator >
    operator=(resource_cache &&)=defaultentt::resource_cache< Type, Loader, Allocator >
    operator[](const id_type id) constentt::resource_cache< Type, Loader, Allocator >inline
    operator[](const id_type id)entt::resource_cache< Type, Loader, Allocator >inline
    resource_cache()entt::resource_cache< Type, Loader, Allocator >inline
    resource_cache(const allocator_type &allocator)entt::resource_cache< Type, Loader, Allocator >inlineexplicit
    resource_cache(const loader_type &callable, const allocator_type &allocator=allocator_type{})entt::resource_cache< Type, Loader, Allocator >inlineexplicit
    resource_cache(const resource_cache &)=defaultentt::resource_cache< Type, Loader, Allocator >
    resource_cache(const resource_cache &other, const allocator_type &allocator)entt::resource_cache< Type, Loader, Allocator >inline
    resource_cache(resource_cache &&)=defaultentt::resource_cache< Type, Loader, Allocator >
    resource_cache(resource_cache &&other, const allocator_type &allocator)entt::resource_cache< Type, Loader, Allocator >inline
    size() constentt::resource_cache< Type, Loader, Allocator >inline
    size_type typedefentt::resource_cache< Type, Loader, Allocator >
    value_type typedefentt::resource_cache< Type, Loader, Allocator >
    diff --git a/classentt_1_1resource__cache.html b/classentt_1_1resource__cache.html index 84f42e351..7a17a194a 100644 --- a/classentt_1_1resource__cache.html +++ b/classentt_1_1resource__cache.html @@ -5,7 +5,7 @@ -EnTT: entt::resource_cache< Resource > Class Template Reference +EnTT: entt::resource_cache< Type, Loader, Allocator > Class Template Reference @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - - - - - + + + + + + + + + + + + + + + + + +

    Public Types

    -using size_type = std::size_t
     Unsigned integer type.
     
    -using resource_type = Resource
     Type of resources managed by a cache.
     
    +using value_type = Type
     Resource type.
     
    +using size_type = std::size_t
     Unsigned integer type.
     
    +using loader_type = Loader
     Loader type.
     
    +using allocator_type = Allocator
     Allocator type.
     
    +using iterator = internal::resource_cache_iterator< Type, typename container_type::iterator >
     Input iterator type.
     
    +using const_iterator = internal::resource_cache_iterator< const Type, typename container_type::const_iterator >
     Constant input iterator type.
     
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +

    Public Member Functions

    - resource_cache ()=default
     Default constructor.
     
    - resource_cache (resource_cache &&)=default
     Default move constructor.
     
    resource_cache & operator= (resource_cache &&)=default
     Default move assignment operator. More...
     
    size_type size () const
     Number of resources managed by a cache. More...
     
    bool empty () const
     Returns true if a cache contains no resources, false otherwise. More...
     
    void clear ()
     Clears a cache and discards all its resources. More...
     
    template<typename Loader , typename... Args>
    resource_handle< resource_type > load (const id_type id, Args &&...args)
     Loads the resource that corresponds to a given identifier. More...
     
    template<typename Loader , typename... Args>
    resource_handle< resource_type > reload (const id_type id, Args &&...args)
     Reloads a resource or loads it for the first time if not present. More...
     
    template<typename Loader , typename... Args>
    resource_handle< resource_type > temp (Args &&...args) const
     Creates a temporary handle for a resource. More...
     
    resource_handle< const resource_type > handle (const id_type id) const
     Creates a handle for a given resource identifier. More...
     
    resource_handle< resource_type > handle (const id_type id)
     Creates a handle for a given resource identifier. More...
     
    bool contains (const id_type id) const
     Checks if a cache contains a given identifier. More...
     
    void discard (const id_type id)
     Discards the resource that corresponds to a given identifier. More...
     
    template<typename Func >
    void each (Func func) const
     Iterates all resources. More...
     
    template<typename Func >
    void each (Func func)
     Iterates all resources. More...
     
    + resource_cache ()
     Default constructor.
     
     resource_cache (const allocator_type &allocator)
     Constructs an empty cache with a given allocator. More...
     
     resource_cache (const loader_type &callable, const allocator_type &allocator=allocator_type{})
     Constructs an empty cache with a given allocator and loader. More...
     
    + resource_cache (const resource_cache &)=default
     Default copy constructor.
     
     resource_cache (const resource_cache &other, const allocator_type &allocator)
     Allocator-extended copy constructor. More...
     
    + resource_cache (resource_cache &&)=default
     Default move constructor.
     
     resource_cache (resource_cache &&other, const allocator_type &allocator)
     Allocator-extended move constructor. More...
     
    resource_cache & operator= (const resource_cache &)=default
     Default copy assignment operator. More...
     
    resource_cache & operator= (resource_cache &&)=default
     Default move assignment operator. More...
     
    constexpr allocator_type get_allocator () const
     Returns the associated allocator. More...
     
    const_iterator cbegin () const
     Returns an iterator to the beginning. More...
     
    const_iterator begin () const
     Returns an iterator to the beginning. More...
     
    iterator begin ()
     Returns an iterator to the beginning. More...
     
    const_iterator cend () const
     Returns an iterator to the end. More...
     
    const_iterator end () const
     Returns an iterator to the end. More...
     
    iterator end ()
     Returns an iterator to the end. More...
     
    bool empty () const
     Returns true if a cache contains no resources, false otherwise. More...
     
    size_type size () const
     Number of resources managed by a cache. More...
     
    +void clear ()
     Clears a cache.
     
    template<typename... Args>
    std::pair< iterator, bool > load (const id_type id, Args &&...args)
     Loads a resource, if its identifier does not exist. More...
     
    template<typename... Args>
    std::pair< iterator, bool > force_load (const id_type id, Args &&...args)
     Force loads a resource, if its identifier does not exist. More...
     
    resource< const value_type > operator[] (const id_type id) const
     Returns a handle for a given resource identifier. More...
     
    resource< value_type > operator[] (const id_type id)
     Returns a handle for a given resource identifier. More...
     
    bool contains (const id_type id) const
     Checks if a cache contains a given identifier. More...
     
    iterator erase (const_iterator pos)
     Removes an element from a given position. More...
     
    iterator erase (const_iterator first, const_iterator last)
     Removes the given elements from a cache. More...
     
    size_type erase (const id_type id)
     Removes the given elements from a cache. More...
     
    loader_type loader () const
     Returns the loader used to create resources. More...
     

    Detailed Description

    -

    template<typename Resource>
    -class entt::resource_cache< Resource >

    +

    template<typename Type, typename Loader, typename Allocator>
    +class entt::resource_cache< Type, Loader, Allocator >

    -

    Simple cache for resources of a given type.

    -

    Minimal implementation of a cache for resources of a given type. It doesn't offer much functionalities but it's suitable for small or medium sized applications and can be freely inherited to add targeted functionalities for large sized applications.

    +

    Basic cache for resources of any type.

    Template Parameters
    - + + +
    ResourceType of resources managed by a cache.
    TypeType of resources managed by a cache.
    LoaderType of loader used to create the resources.
    AllocatorType of allocator used to manage memory and elements.
    -

    Definition at line 27 of file cache.hpp.

    -

    Member Function Documentation

    - -

    ◆ clear()

    +

    Definition at line 161 of file cache.hpp.

    +

    Constructor & Destructor Documentation

    + +

    ◆ resource_cache() [1/4]

    -template<typename Resource >
    +template<typename Type , typename Loader , typename Allocator >
    + + +
    - + + + + + + +
    void entt::resource_cache< Resource >::clear entt::resource_cache< Type, Loader, Allocator >::resource_cache (const allocator_type & allocator)
    +     		+inlineexplicit
    +
    + +

    Constructs an empty cache with a given allocator.

    +
    Parameters
    + + +
    allocatorThe allocator to use.
    +
    +
    + +

    Definition at line 189 of file cache.hpp.

    + +
    + + +

    ◆ resource_cache() [2/4]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    entt::resource_cache< Type, Loader, Allocator >::resource_cache (const loader_type & callable,
    const allocator_type & allocator = allocator_type{} 
    )
    +     		+inlineexplicit
    +
    + +

    Constructs an empty cache with a given allocator and loader.

    +
    Parameters
    + + + +
    callableThe loader to use.
    allocatorThe allocator to use.
    +
    +
    + +

    Definition at line 197 of file cache.hpp.

    + +
    +
    + +

    ◆ resource_cache() [3/4]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    entt::resource_cache< Type, Loader, Allocator >::resource_cache (const resource_cache< Type, Loader, Allocator > & other,
    const allocator_type & allocator 
    )
    +     		+inline
    +
    + +

    Allocator-extended copy constructor.

    +
    Parameters
    + + + +
    otherThe instance to copy from.
    allocatorThe allocator to use.
    +
    +
    + +

    Definition at line 208 of file cache.hpp.

    + +
    +
    + +

    ◆ resource_cache() [4/4]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    entt::resource_cache< Type, Loader, Allocator >::resource_cache (resource_cache< Type, Loader, Allocator > && other,
    const allocator_type & allocator 
    )
    +     		+inline
    +
    + +

    Allocator-extended move constructor.

    +
    Parameters
    + + + +
    otherThe instance to move from.
    allocatorThe allocator to use.
    +
    +
    + +

    Definition at line 219 of file cache.hpp.

    + +
    +
    +

    Member Function Documentation

    + +

    ◆ begin() [1/2]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + diff --git a/md_docs_md_container.html b/md_docs_md_container.html index b3640182e..1ad815ef6 100644 --- a/md_docs_md_container.html +++ b/md_docs_md_container.html @@ -22,7 +22,7 @@ @@ -76,14 +76,20 @@ Introduction

    Containers

    -Dense hash map

    -

    The dense hash map made available in EnTT is a map that aims to return a packed array of elements, so as to reduce the number of jumps in memory during the iteration.
    +Dense map +

    The dense map made available in EnTT is a hash map that aims to return a packed array of elements, so as to reduce the number of jumps in memory during iterations.
    The implementation is based on sparse sets and each bucket is identified by an implicit list within the packed array itself.

    -

    The interface is in all respects similar to its counterpart in the standard library, that is, std::unordered_map.
    - Therefore, there is no need to go into the API description.

    +

    The interface is very close to its counterpart in the standard library, that is, std::unordered_map.
    + However, both local and non-local iterators returned by a dense map belong to the input iterator category although they respectively model the concepts of a forward iterator type and a random access iterator type.
    + This is because they return a pair of references rather than a reference to a pair. In other words, dense maps return a so called proxy iterator the value type of which is:

    +
      +
    • std::pair<const Key &, Type &> for non-const iterator types.
      • +
    • std::pair<const Key &, const Type &> for const iterator types.
      • +
    +

    This is quite different from what any standard library map returns and should be taken into account when looking for a drop-in replacement.

    -Dense hash set

    -

    The dense hash set made available in EnTT is a set that aims to return a packed array of elements, so as to reduce the number of jumps in memory during the iteration.
    +Dense set +

    The dense set made available in EnTT is a hash set that aims to return a packed array of elements, so as to reduce the number of jumps in memory during iterations.
    The implementation is based on sparse sets and each bucket is identified by an implicit list within the packed array itself.

    The interface is in all respects similar to its counterpart in the standard library, that is, std::unordered_set.
    Therefore, there is no need to go into the API description.

    diff --git a/md_docs_md_core.html b/md_docs_md_core.html index 6f11c92ff..679cfd986 100644 --- a/md_docs_md_core.html +++ b/md_docs_md_core.html @@ -22,7 +22,7 @@ @@ -71,107 +71,9 @@ Introduction

    EnTT comes with a bunch of core functionalities mostly used by the other parts of the library itself.
    Hardly users will include these features in their code, but it's worth describing what EnTT offers so as not to reinvent the wheel in case of need.

    -Unique sequential identifiers

    -

    Sometimes it's useful to be able to give unique, sequential numeric identifiers to types either at compile-time or runtime.
    - There are plenty of different solutions for this out there and I could have used one of them. However, I decided to spend my time to define a couple of tools that fully embraces what the modern C++ has to offer.

    -

    -Compile-time generator

    -

    To generate sequential numeric identifiers at compile-time, EnTT offers the identifier class template:

    -
    // defines the identifiers for the given types
    -
    using id = entt::identifier<a_type, another_type>;
    -
    -
    // ...
    -
    -
    switch(a_type_identifier) {
    -
    case id::type<a_type>:
    -
    // ...
    -
    break;
    -
    case id::type<another_type>:
    -
    // ...
    -
    break;
    -
    default:
    -
    // ...
    -
    }
    -
    entt::identifier
    Types identifiers.
    Definition: ident.hpp:41
    -

    This is all what this class template has to offer: a type inline variable that contains a numeric identifier for the given type. It can be used in any context where constant expressions are required.

    -

    As long as the list remains unchanged, identifiers are also guaranteed to be stable across different runs. In case they have been used in a production environment and a type has to be removed, one can just use a placeholder to left the other identifiers unchanged:

    -
    template<typename> struct ignore_type {};
    -
    -
    using id = entt::identifier<
    -
    a_type_still_valid,
    -
    ignore_type<a_type_no_longer_valid>,
    -
    another_type_still_valid
    -
    >;
    -

    Perhaps a bit ugly to see in a codebase but it gets the job done at least.

    -

    -Runtime generator

    -

    To generate sequential numeric identifiers at runtime, EnTT offers the family class template:

    -
    // defines a custom generator
    -
    using id = entt::family<struct my_tag>;
    -
    -
    // ...
    -
    -
    const auto a_type_id = id::type<a_type>;
    -
    const auto another_type_id = id::type<another_type>;
    -
    entt::family
    Dynamic identifier generator.
    Definition: family.hpp:17
    -

    This is all what a family has to offer: a type inline variable that contains a numeric identifier for the given type.
    - The generator is customizable, so as to get different sequences for different purposes if needed.

    -

    Please, note that identifiers aren't guaranteed to be stable across different runs. Indeed it mostly depends on the flow of execution.

    -

    -Hashed strings

    -

    A hashed string is a zero overhead unique identifier. Users can use human-readable identifiers in the codebase while using their numeric counterparts at runtime, thus without affecting performance.
    - The class has an implicit constexpr constructor that chews a bunch of characters. Once created, all what one can do with it is getting back the original string through the data member function or converting the instance into a number.
    - The good part is that a hashed string can be used wherever a constant expression is required and no string-to-number conversion will take place at runtime if used carefully.

    -

    Example of use:

    -
    auto load(entt::hashed_string::hash_type resource) {
    -
    // uses the numeric representation of the resource to load and return it
    -
    }
    -
    -
    auto resource = load(entt::hashed_string{"gui/background"});
    -
    entt::basic_hashed_string
    Zero overhead unique identifier.
    Definition: hashed_string.hpp:58
    -
    entt::basic_hashed_string::hash_type
    id_type hash_type
    Unsigned integer type.
    Definition: hashed_string.hpp:82
    -

    There is also a user defined literal dedicated to hashed strings to make them more user-friendly:

    -
    using namespace entt::literals;
    -
    constexpr auto str = "text"_hs;
    -

    To use it, remember that all user defined literals in EnTT are enclosed in the entt::literals namespace. Therefore, the entire namespace or selectively the literal of interest must be explicitly included before each use, a bit like std::literals.
    - Finally, in case users need to create hashed strings at runtime, this class also offers the necessary functionalities:

    -
    std::string orig{"text"};
    -
    -
    // create a full-featured hashed string...
    -
    entt::hashed_string str{orig.c_str()};
    -
    -
    // ... or compute only the unique identifier
    -
    const auto hash = entt::hashed_string::value(orig.c_str());
    -
    entt::basic_hashed_string::value
    constexpr hash_type value() const
    Returns the numeric representation of a hashed string.
    Definition: hashed_string.hpp:174
    -

    This possibility shouldn't be exploited in tight loops, since the computation takes place at runtime and no longer at compile-time and could therefore impact performance to some degrees.

    -

    -Wide characters

    -

    The hashed string has a design that is close to that of an std::basic_string. It means that hashed_string is nothing more than an alias for basic_hashed_string<char>. For those who want to use the C++ type for wide character representation, there exists also the alias hashed_wstring for basic_hashed_string<wchar_t>.
    - In this case, the user defined literal to use to create hashed strings on the fly is _hws:

    -
    constexpr auto str = L"text"_hws;
    -

    Note that the hash type of the hashed_wstring is the same of its counterpart.

    -

    -Conflicts

    -

    The hashed string class uses internally FNV-1a to compute the numeric counterpart of a string. Because of the pigeonhole principle, conflicts are possible. This is a fact.
    - There is no silver bullet to solve the problem of conflicts when dealing with hashing functions. In this case, the best solution seemed to be to give up. That's all.
    - After all, human-readable unique identifiers aren't something strictly defined and over which users have not the control. Choosing a slightly different identifier is probably the best solution to make the conflict disappear in this case.

    -

    -Monostate

    -

    The monostate pattern is often presented as an alternative to a singleton based configuration system. This is exactly its purpose in EnTT. Moreover, this implementation is thread safe by design (hopefully).
    - Keys are represented by hashed strings, values are basic types like ints or bools. Values of different types can be associated to each key, even more than one at a time. Because of this, users must pay attention to use the same type both during an assignment and when they try to read back their data. Otherwise, they will probably incur in unexpected results.

    -

    Example of use:

    -
    entt::monostate<entt::hashed_string{"mykey"}>{} = true;
    -
    entt::monostate<"mykey"_hs>{} = 42;
    -
    -
    // ...
    -
    -
    const bool b = entt::monostate<"mykey"_hs>{};
    -
    const int i = entt::monostate<entt::hashed_string{"mykey"}>{};
    -
    entt::monostate
    Minimal implementation of the monostate pattern.
    Definition: monostate.hpp:21
    -

    Any as in any type

    EnTT comes with its own any type. It may seem redundant considering that C++17 introduced std::any, but it is not (hopefully).
    - In fact, the type returned by an std::any is a const reference to an std::type_info, an implementation defined class that's not something everyone wants to see in a software. Furthermore, there is no way to connect it with the type system of the library and therefore with its integrated RTTI support.
    + First of all, the type returned by an std::any is a const reference to an std::type_info, an implementation defined class that's not something everyone wants to see in a software. Furthermore, there is no way to connect it with the type system of the library and therefore with its integrated RTTI support.
    Note that this class is largely used internally by the library itself.

    The API is very similar to that of its most famous counterpart, mainly because this class serves the same purpose of being an opaque container for any type of value.
    Instances of any also minimize the number of allocations by relying on a well known technique called small buffer optimization and a fake vtable.

    @@ -185,12 +87,12 @@ Any as in any type
    // in place construction
    entt::any in_place{std::in_place_type<int>, 42};
    entt::basic_any<>
    -
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:16
    +
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:17
    entt::deletion_policy::in_place
    @ in_place
    In-place deletion policy.

    Alternatively, the make_any function serves the same purpose but requires to always be explicit about the type:

    entt::any any = entt::make_any<int>(42);

    In both cases, the any class takes the burden of destroying the contained element when required, regardless of the storage strategy used for the specific object.
    - Furthermore, an instance of any is not tied to an actual type. Therefore, the wrapper will be reconfigured by assigning it an object of a different type than the one contained, so as to be able to handle the new instance.

    + Furthermore, an instance of any isn't tied to an actual type. Therefore, the wrapper is reconfigured when it's assigned a new object of a type other than the one it contains.

    There exists also a way to directly assign a value to the variable contained by an entt::any, without necessarily replacing it. This is especially useful when the object is used in aliasing mode, as described below:

    entt::any any{42};
    entt::any value{3};
    @@ -200,7 +102,7 @@ Any as in any type
    // assigns by move
    any.assign(std::move(value));
    -
    entt::basic_any::assign
    bool assign(const any &other)
    Copy assigns a value to the contained object without replacing it.
    Definition: any.hpp:309
    +
    entt::basic_any::assign
    bool assign(const any &other)
    Assigns a value to the contained object without replacing it.
    Definition: any.hpp:309

    The any class will also perform a check on the type information and whether or not the original type was copy or move assignable, as appropriate.
    In all cases, the assign function returns a boolean value to indicate the success or failure of the operation.

    When in doubt about the type of object contained, the type member function of any returns a const reference to the type_info associated with its element, or type_id<void>() if the container is empty. The type is also used internally when comparing two any objects:

    @@ -216,19 +118,19 @@ Any as in any type
    any.emplace<const int &>(value);
    entt::basic_any::emplace
    void emplace(Args &&...args)
    Replaces the contained object by creating a new instance directly.
    Definition: any.hpp:299
    -
    entt::forward_as_any
    basic_any< Len, Align > forward_as_any(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: any.hpp:488
    +
    entt::forward_as_any
    basic_any< Len, Align > forward_as_any(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: any.hpp:484

    In other words, whenever any is explicitly told to construct an alias, it acts as a pointer to the original instance rather than making a copy of it or moving it internally. The contained object is never destroyed and users must ensure that its lifetime exceeds that of the container.
    Similarly, it's possible to create non-owning copies of any from an existing object:

    // aliasing constructor
    entt::any ref = other.as_ref();
    -
    entt::basic_any::as_ref
    basic_any as_ref()
    Aliasing constructor.
    Definition: any.hpp:370
    +
    entt::basic_any::as_ref
    basic_any as_ref()
    Aliasing constructor.
    Definition: any.hpp:366

    In this case, it doesn't matter if the original container actually holds an object or acts already as a reference for unmanaged elements, the new instance thus created won't create copies and will only serve as a reference for the original item.
    - This means that, starting from the example above, both ref andother will point to the same object, whether it's initially contained in other or already an unmanaged element.

    + This means that, starting from the example above, both ref and other will point to the same object, whether it's initially contained in other or already an unmanaged element.

    As a side note, it's worth mentioning that, while everything works transparently when it comes to non-const references, there are some exceptions when it comes to const references.
    In particular, the data member function invoked on a non-const instance of any that wraps a const reference will return a null pointer in all cases.

    To cast an instance of any to a type, the library offers a set of any_cast functions in all respects similar to their most famous counterparts.
    The only difference is that, in the case of EnTT, these won't raise exceptions but will only trigger an assert in debug mode, otherwise resulting in undefined behavior in case of misuse in release mode.

    -

    +

    Small buffer optimization

    The any class uses a technique called small buffer optimization to reduce the number of allocations where possible.
    The default reserved size for an instance of any is sizeof(double[2]). However, this is also configurable if needed. In fact, any is defined as an alias for basic_any<Len>, where Len is the size above.
    @@ -237,169 +139,14 @@ Small buffer optimization

    This feature, in addition to allowing the choice of a size that best suits the needs of an application, also offers the possibility of forcing dynamic creation of objects during construction.
    In other terms, if the size is 0, any avoids the use of any optimization and always dynamically allocates objects (except for aliasing cases).

    Note that the size of the internal storage as well as the alignment requirements are directly part of the type and therefore contribute to define different types that won't be able to interoperate with each other.

    -

    +

    Alignment requirement

    The alignment requirement is optional and by default the most stringent (the largest) for any object whose size is at most equal to the one provided.
    The basic_any class template inspects the alignment requirements in each case, even when not provided and may decide not to use the small buffer optimization in order to meet them.

    The alignment requirement is provided as an optional second parameter following the desired size for the internal storage:

    using my_any = entt::basic_any<sizeof(double[4]), alignof(double[4])>;

    Note that the alignment requirements as well as the size of the internal storage are directly part of the type and therefore contribute to define different types that won't be able to interoperate with each other.

    -

    -Type support

    -

    EnTT provides some basic information about types of all kinds.
    - It also offers additional features that are not yet available in the standard library or that will never be.

    -

    -Built-in RTTI support

    -

    Runtime type identification support (or RTTI) is one of the most frequently disabled features in the C++ world, especially in the gaming sector. Regardless of the reasons for this, it's often a shame not to be able to rely on opaque type information at runtime.
    - The library tries to fill this gap by offering a built-in system that doesn't serve as a replacement but comes very close to being one and offers similar information to that provided by its counterpart.

    -

    Basically, the whole system relies on a handful of classes. In particular:

    -
      -
    • The unique sequential identifier associated with a given type:
      • -
    -
    auto index = entt::type_index<a_type>::value();
    -
    entt::type_index::value
    static id_type value()
    Returns the sequential identifier of a given type.
    Definition: type_info.hpp:84
    -

    The returned value isn't guaranteed to be stable across different runs. However, it can be very useful as index in associative and unordered associative containers or for positional accesses in a vector or an array.

    -

    So as not to conflict with the other tools available, the family class isn't used to generate these indexes. Therefore, the numeric identifiers returned by the two tools may differ.
    - On the other hand, this leaves users with full powers over the family class and therefore the generation of custom runtime sequences of indices for their own purposes, if necessary.

    -

    An external generator can also be used if needed. In fact, type_index can be specialized by type and is also sfinae-friendly in order to allow more refined specializations such as:

    -
    template<typename Type>
    -
    struct entt::type_index<Type, std::void_d<decltype(Type::index())>> {
    -
    static entt::id_type value() ENTT_NOEXCEPT {
    -
    return Type::index();
    -
    }
    -
    };
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    -
    entt::type_index
    Type sequential identifier.
    Definition: type_info.hpp:79
    -

    Note that indexes must still be generated sequentially in this case.
    - The tool is widely used within EnTT. Generating indices not sequentially would break an assumption and would likely lead to undesired behaviors.

    -
      -
    • The hash value associated with a given type:
      • -
    -
    auto hash = entt::type_hash<a_type>::value();
    -
    entt::type_hash::value
    static constexpr id_type value()
    Returns the numeric representation of a given type.
    Definition: type_info.hpp:109
    -

    In general, the value function exposed by type_hash is also constexpr but this isn't guaranteed for all compilers and platforms (although it's valid with the most well-known and popular ones).

    -

    This function can use non-standard features of the language for its own purposes. This makes it possible to provide compile-time identifiers that remain stable across different runs.
    - In all cases, users can prevent the library from using these features by means of the ENTT_STANDARD_CPP definition. In this case, there is no guarantee that identifiers remain stable across executions. Moreover, they are generated at runtime and are no longer a compile-time thing.

    -

    As for type_index, also type_hash is a sfinae-friendly class that can be specialized in order to customize its behavior globally or on a per-type or per-traits basis.

    -
      -
    • The name associated with a given type:
      • -
    -
    auto name = entt::type_name<a_type>::value();
    -
    entt::type_name::value
    static constexpr std::string_view value()
    Returns the name of a given type.
    Definition: type_info.hpp:130
    -

    The name associated with a type is extracted from some information generally made available by the compiler in use. Therefore, it may differ depending on the compiler and may be empty in the event that this information isn't available.
    - For example, given the following class:

    -
    struct my_type { /* ... */ };
    -

    The name is my_type when compiled with GCC or CLang and struct my_type when MSVC is in use.
    - Most of the time the name is also retrieved at compile-time and is therefore always returned through an std::string_view. Users can easily access it and modify it as needed, for example by removing the word struct to standardize the result. EnTT won't do this for obvious reasons, since it requires copying and creating a new string potentially at runtime.

    -

    This function can use non-standard features of the language for its own purposes. Users can prevent the library from using non-standard features by means of the ENTT_STANDARD_CPP definition. In this case, the name will be empty by default.

    -

    As for type_index, also type_name is a sfinae-friendly class that can be specialized in order to customize its behavior globally or on a per-type or per-traits basis.

    -

    These are then combined into utilities that aim to offer an API that is somewhat similar to that offered by the language.

    -

    -Type info

    -

    The type_info class isn't a drop-in replacement for std::type_info but can provide similar information which are not implementation defined and don't require to enable RTTI.
    - Therefore, they can sometimes be even more reliable than those obtained otherwise.

    -

    A type info object is an opaque class that is also copy and move constructible. Objects of this class are returned by the type_id function template:

    -
    auto info = entt::type_id<a_type>();
    -

    These are the information made available by a type_info object:

    -
      -
    • The index associated with a given type:
      • -
    -
    auto idx = entt::type_id<a_type>().index();
    -

    This is also an alias for the following:

    -
    auto idx = entt::type_index<std::remove_const_t<std::remove_reference_t<a_type>>>::value();
    -
      -
    • The hash value associated with a given type:
      • -
    -
    auto hash = entt::type_id<a_type>().hash();
    -

    This is also an alias for the following:

    -
    auto hash = entt::type_hash<std::remove_const_t<std::remove_reference_t<a_type>>>::value();
    -
    entt::type_hash
    Type hash.
    Definition: type_info.hpp:100
    -
      -
    • The name associated with a given type:
      • -
    -
    auto name = entt::type_id<my_type>().name();
    -

    This is also an alias for the following:

    -
    auto name = entt::type_name<std::remove_const_t<std::remove_reference_t<a_type>>>::value();
    -
    entt::type_name
    Type name.
    Definition: type_info.hpp:125
    -

    Where all accessed features are available at compile-time, the type_info class is also fully constexpr. However, this cannot be guaranteed in advance and depends mainly on the compiler in use and any specializations of the classes described above.

    -

    -Almost unique identifiers

    -

    Since the default non-standard, compile-time implementation of type_hash makes use of hashed strings, it may happen that two types are assigned the same hash value.
    - In fact, although this is quite rare, it's not entirely excluded.

    -

    Another case where two types are assigned the same identifier is when classes from different contexts (for example two or more libraries loaded at runtime) have the same fully qualified name. In this case, also type_name will return the same value for the two types.
    - Fortunately, there are several easy ways to deal with this:

    -
      -
    • The most trivial one is to define the ENTT_STANDARD_CPP macro. Runtime identifiers don't suffer from the same problem in fact. However, this solution doesn't work well with a plugin system, where the libraries aren't linked.
      • -
    • Another possibility is to specialize the type_name class for one of the conflicting types, in order to assign it a custom identifier. This is probably the easiest solution that also preserves the feature of the tool.
      • -
    • A fully customized identifier generation policy (based for example on enum classes or preprocessing steps) may represent yet another option.
      • -
    -

    These are just some examples of possible approaches to the problem but there are many others. As already mentioned above, since users have full control over their types, this problem is in any case easy to solve and should not worry too much.
    - In all likelihood, it will never happen to run into a conflict anyway.

    -

    -Type traits

    -

    A handful of utilities and traits not present in the standard template library but which can be useful in everyday life.
    - This list is not exhaustive and contains only some of the most useful classes. Refer to the inline documentation for more information on the features offered by this module.

    -

    -Size of

    -

    The standard operator sizeof complains when users provide it for example with function or incomplete types. On the other hand, it's guaranteed that its result is always nonzero, even if applied to an empty class type.
    - This small class combines the two and offers an alternative to sizeof that works under all circumstances, returning zero if the type isn't supported:

    -
    const auto size = entt::size_of_v<void>;
    -

    -Is applicable

    -

    The standard library offers the great std::is_invocable trait in several forms. This takes a function type and a series of arguments and returns true if the condition is satisfied.
    - Moreover, users are also provided with std::apply, a tool for combining invocable elements and tuples of arguments.

    -

    It would therefore be a good idea to have a variant of std::is_invocable that also accepts its arguments in the form of a tuple-like type, so as to complete the offer:

    -
    constexpr bool result = entt::is_applicable<Func, std::tuple<a_type, another_type>>;
    -
    entt::is_applicable
    Same as std::is_invocable, but with tuples.
    Definition: type_traits.hpp:378
    -

    This trait is built on top of std::is_invocable and does nothing but unpack a tuple-like type and simplify the code at the call site.

    -

    -Constness as

    -

    An utility to easily transfer the constness of a type to another type:

    -
    // type is const dst_type because of the constness of src_type
    -
    using type = entt::constness_as_t<dst_type, const src_type>;
    -
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:645
    -

    The trait is subject to the rules of the language. Therefore, for example, transferring constness between references won't give the desired effect.

    -

    -Member class type

    -

    The auto template parameter introduced with C++17 made it possible to simplify many class templates and template functions but also made the class type opaque when members are passed as template arguments.
    - The purpose of this utility is to extract the class type in a few lines of code:

    -
    template<typename Member>
    -
    using clazz = entt::member_class_t<Member>;
    -
    entt::member_class_t
    typename member_class< Member >::type member_class_t
    Helper type.
    Definition: type_traits.hpp:674
    -

    -Integral constant

    -

    Since std::integral_constant may be annoying because of its form that requires to specify both a type and a value of that type, there is a more user-friendly shortcut for the creation of integral constants.
    - This shortcut is the alias template entt::integral_constant:

    -
    constexpr auto constant = entt::integral_constant<42>;
    -
    entt::integral_constant
    std::integral_constant< decltype(Value), Value > integral_constant
    Wraps a static constant.
    Definition: type_traits.hpp:96
    -

    Among the other uses, when combined with a hashed string it helps to define tags as human-readable names where actual types would be required otherwise:

    -
    constexpr auto enemy_tag = entt::integral_constant<"enemy"_hs>;
    -
    registry.emplace<enemy_tag>(entity);
    -
    entt::entity
    entity
    Default entity identifier.
    Definition: fwd.hpp:47
    -
    entt::registry
    basic_registry< entity > registry
    Alias declaration for the most common use case.
    Definition: fwd.hpp:60
    -

    -Tag

    -

    Since id_type is very important and widely used in EnTT, there is a more user-friendly shortcut for the creation of integral constants based on it.
    - This shortcut is the alias template entt::tag.

    -

    If used in combination with hashed strings, it helps to use human-readable names where types would be required otherwise. As an example:

    -
    registry.emplace<entt::tag<"enemy"_hs>>(entity);
    -
    entt::tag
    integral_constant< Value > tag
    Alias template to facilitate the creation of named values.
    Definition: type_traits.hpp:103
    -

    However, this isn't the only permitted use. Literally any value convertible to id_type is a good candidate, such as the named constants of an unscoped enum.

    -

    -Type list and value list

    -

    There is no respectable library where the much desired type list can be missing.
    - EnTT is no exception and provides (making extensive use of it internally) the type_list type, in addition to its value_list counterpart dedicated to non-type template parameters.

    -

    Here is a (possibly incomplete) list of the functionalities that come with a type list:

    -
      -
    • type_list_element[_t] to get the N-th element of a type list.
      • -
    • type_list_cat[_t] and a handy operator+ to concatenate type lists.
      • -
    • type_list_unique[_t] to remove duplicate types from a type list.
      • -
    • type_list_contains[_v] to know if a type list contains a given type.
      • -
    • type_list_diff[_t] to remove types from type lists.
      • -
    -

    I'm also pretty sure that more and more utilities will be added over time as needs become apparent.
    - Many of these functionalities also exist in their version dedicated to value lists. We therefore have value_list_element[_v] as well as value_list_cat[_t]and so on.

    -

    +

    Compressed pair

    Primarily designed for internal use and far from being feature complete, the compressed_pair class does exactly what it promises: it tries to reduce the size of a pair by exploiting Empty Base Class Optimization (or EBCO).
    This class is not a drop-in replacement for std::pair. However, it offers enough functionalities to be a good alternative for when reducing memory usage is more important than having some cool and probably useless feature.

    @@ -409,7 +156,7 @@ Compressed pair
    entt::compressed_pair
    A compressed pair.
    Definition: compressed_pair.hpp:95
    entt::compressed_pair::first
    first_type & first()
    Returns the first element that a pair stores.
    Definition: compressed_pair.hpp:172

    There isn't much to describe then. It's recommended to rely on documentation and intuition. At the end of the day, it's just a pair and nothing more.

    -

    +

    Enum as bitmask

    Sometimes it's useful to be able to use enums as bitmasks. However, enum classes aren't really suitable for the purpose out of the box. Main problem is that they don't convert implicitly to their underlying type.
    All that remains is to make a choice between using old-fashioned enums (with all their problems that I don't want to discuss here) or writing ugly code.

    @@ -439,7 +186,290 @@ Enum as bitmask
    };

    In this case, there is no need to specialize the enum_as_bitmask traits, since EnTT will automatically detect the flag and enable the bitmask support.
    Once the enum class has been registered (in one way or the other) all the most common operators will be available, such as &, | but also &= and |=. Refer to the official documentation for the full list of operators.

    +

    +Hashed strings

    +

    A hashed string is a zero overhead unique identifier. Users can use human-readable identifiers in the codebase while using their numeric counterparts at runtime, thus without affecting performance.
    + The class has an implicit constexpr constructor that chews a bunch of characters. Once created, all what one can do with it is getting back the original string through the data member function or converting the instance into a number.
    + The good part is that a hashed string can be used wherever a constant expression is required and no string-to-number conversion will take place at runtime if used carefully.

    +

    Example of use:

    +
    auto load(entt::hashed_string::hash_type resource) {
    +
    // uses the numeric representation of the resource to load and return it
    +
    }
    +
    +
    auto resource = load(entt::hashed_string{"gui/background"});
    +
    entt::basic_hashed_string
    Zero overhead unique identifier.
    Definition: hashed_string.hpp:69
    +
    entt::basic_hashed_string::hash_type
    typename base_type::hash_type hash_type
    Unsigned integer type.
    Definition: hashed_string.hpp:107
    +

    There is also a user defined literal dedicated to hashed strings to make them more user-friendly:

    +
    using namespace entt::literals;
    +
    constexpr auto str = "text"_hs;
    +

    To use it, remember that all user defined literals in EnTT are enclosed in the entt::literals namespace. Therefore, the entire namespace or selectively the literal of interest must be explicitly included before each use, a bit like std::literals.
    + Finally, in case users need to create hashed strings at runtime, this class also offers the necessary functionalities:

    +
    std::string orig{"text"};
    +
    +
    // create a full-featured hashed string...
    +
    entt::hashed_string str{orig.c_str()};
    +
    +
    // ... or compute only the unique identifier
    +
    const auto hash = entt::hashed_string::value(orig.c_str());
    +
    entt::basic_hashed_string::value
    constexpr hash_type value() const
    Returns the numeric representation of a hashed string.
    Definition: hashed_string.hpp:192
    +

    This possibility shouldn't be exploited in tight loops, since the computation takes place at runtime and no longer at compile-time and could therefore impact performance to some degrees.

    +

    +Wide characters

    +

    The hashed string has a design that is close to that of an std::basic_string. It means that hashed_string is nothing more than an alias for basic_hashed_string<char>. For those who want to use the C++ type for wide character representation, there exists also the alias hashed_wstring for basic_hashed_string<wchar_t>.
    + In this case, the user defined literal to use to create hashed strings on the fly is _hws:

    +
    constexpr auto str = L"text"_hws;
    +

    Note that the hash type of the hashed_wstring is the same of its counterpart.

    +

    +Conflicts

    +

    The hashed string class uses internally FNV-1a to compute the numeric counterpart of a string. Because of the pigeonhole principle, conflicts are possible. This is a fact.
    + There is no silver bullet to solve the problem of conflicts when dealing with hashing functions. In this case, the best solution seemed to be to give up. That's all.
    + After all, human-readable unique identifiers aren't something strictly defined and over which users have not the control. Choosing a slightly different identifier is probably the best solution to make the conflict disappear in this case.

    +

    +Memory

    +

    There are a handful of tools within EnTT to interact with memory in one way or another.
    + Some are geared towards simplifying the implementation of (internal or external) allocator aware containers. Others, on the other hand, are designed to help the developer with everyday problems.

    +

    The former are very specific and for niche problems. These are tools designed to unwrap fancy or plain pointers (to_address) or to help forget the meaning of acronyms like POCCA, POCMA or POCS.
    + I won't describe them here in detail. Instead, I recommend reading the inline documentation to those interested in the subject.

    +

    +Power of two and fast modulus

    +

    Finding out if a number is a power of two (is_power_of_two) or what the next power of two is given a random value (next_power_of_two) is very useful at times.
    + For example, it helps to allocate memory in pages having a size suitable for the fast modulus:

    +
    const std::size_t result = entt::fast_mod(value, modulus);
    +
    entt::fast_mod
    constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
    Fast module utility function (powers of two only).
    Definition: memory.hpp:102
    +

    Where modulus is necessarily a power of two. Perhaps not everyone knows that this type of operation is far superior in terms of performance to the basic modulus and for this reason preferred in many areas.

    +

    +Allocator aware unique pointers

    +

    A nasty thing in C++ (at least up to C++20) is the fact that shared pointers support allocators while unique pointers don't.
    + There is a proposal at the moment that also shows among the other things how this can be implemented without any compiler support.

    +

    The allocate_unique function follows this proposal, making a virtue out of necessity:

    +
    std::unique_ptr<my_type, entt::allocation_deleter<my_type>> ptr = entt::allocate_unique<my_type>(allocator, arguments);
    +

    Although the internal implementation is slightly different from what is proposed for the standard, this function offers an API that is a drop-in replacement for the same feature.

    +

    +Monostate

    +

    The monostate pattern is often presented as an alternative to a singleton based configuration system. This is exactly its purpose in EnTT. Moreover, this implementation is thread safe by design (hopefully).
    + Keys are represented by hashed strings, values are basic types like ints or bools. Values of different types can be associated to each key, even more than one at a time. Because of this, users must pay attention to use the same type both during an assignment and when they try to read back their data. Otherwise, they will probably incur in unexpected results.

    +

    Example of use:

    +
    entt::monostate<entt::hashed_string{"mykey"}>{} = true;
    +
    entt::monostate<"mykey"_hs>{} = 42;
    +
    +
    // ...
    +
    +
    const bool b = entt::monostate<"mykey"_hs>{};
    +
    const int i = entt::monostate<entt::hashed_string{"mykey"}>{};
    +
    entt::monostate
    Minimal implementation of the monostate pattern.
    Definition: monostate.hpp:21
    +

    +Type support

    +

    EnTT provides some basic information about types of all kinds.
    + It also offers additional features that are not yet available in the standard library or that will never be.

    +

    +Built-in RTTI support

    +

    Runtime type identification support (or RTTI) is one of the most frequently disabled features in the C++ world, especially in the gaming sector. Regardless of the reasons for this, it's often a shame not to be able to rely on opaque type information at runtime.
    + The library tries to fill this gap by offering a built-in system that doesn't serve as a replacement but comes very close to being one and offers similar information to that provided by its counterpart.

    +

    Basically, the whole system relies on a handful of classes. In particular:

    +
      +
    • The unique sequential identifier associated with a given type:
      • +
    +
    auto index = entt::type_index<a_type>::value();
    +
    entt::type_index::value
    static id_type value()
    Returns the sequential identifier of a given type.
    Definition: type_info.hpp:84
    +

    The returned value isn't guaranteed to be stable across different runs. However, it can be very useful as index in associative and unordered associative containers or for positional accesses in a vector or an array.

    +

    So as not to conflict with the other tools available, the family class isn't used to generate these indexes. Therefore, the numeric identifiers returned by the two tools may differ.
    + On the other hand, this leaves users with full powers over the family class and therefore the generation of custom runtime sequences of indices for their own purposes, if necessary.

    +

    An external generator can also be used if needed. In fact, type_index can be specialized by type and is also sfinae-friendly in order to allow more refined specializations such as:

    +
    template<typename Type>
    +
    struct entt::type_index<Type, std::void_d<decltype(Type::index())>> {
    +
    static entt::id_type value() ENTT_NOEXCEPT {
    +
    return Type::index();
    +
    }
    +
    };
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    +
    entt::type_index
    Type sequential identifier.
    Definition: type_info.hpp:79
    +

    Note that indexes must still be generated sequentially in this case.
    + The tool is widely used within EnTT. Generating indices not sequentially would break an assumption and would likely lead to undesired behaviors.

    +
      +
    • The hash value associated with a given type:
      • +
    +
    auto hash = entt::type_hash<a_type>::value();
    +
    entt::type_hash::value
    static constexpr id_type value()
    Returns the numeric representation of a given type.
    Definition: type_info.hpp:109
    +

    In general, the value function exposed by type_hash is also constexpr but this isn't guaranteed for all compilers and platforms (although it's valid with the most well-known and popular ones).

    +

    This function can use non-standard features of the language for its own purposes. This makes it possible to provide compile-time identifiers that remain stable across different runs.
    + In all cases, users can prevent the library from using these features by means of the ENTT_STANDARD_CPP definition. In this case, there is no guarantee that identifiers remain stable across executions. Moreover, they are generated at runtime and are no longer a compile-time thing.

    +

    As for type_index, also type_hash is a sfinae-friendly class that can be specialized in order to customize its behavior globally or on a per-type or per-traits basis.

    +
      +
    • The name associated with a given type:
      • +
    +
    auto name = entt::type_name<a_type>::value();
    +
    entt::type_name::value
    static constexpr std::string_view value()
    Returns the name of a given type.
    Definition: type_info.hpp:130
    +

    The name associated with a type is extracted from some information generally made available by the compiler in use. Therefore, it may differ depending on the compiler and may be empty in the event that this information isn't available.
    + For example, given the following class:

    +
    struct my_type { /* ... */ };
    +

    The name is my_type when compiled with GCC or CLang and struct my_type when MSVC is in use.
    + Most of the time the name is also retrieved at compile-time and is therefore always returned through an std::string_view. Users can easily access it and modify it as needed, for example by removing the word struct to standardize the result. EnTT won't do this for obvious reasons, since it requires copying and creating a new string potentially at runtime.

    +

    This function can use non-standard features of the language for its own purposes. Users can prevent the library from using non-standard features by means of the ENTT_STANDARD_CPP definition. In this case, the name will be empty by default.

    +

    As for type_index, also type_name is a sfinae-friendly class that can be specialized in order to customize its behavior globally or on a per-type or per-traits basis.

    +

    These are then combined into utilities that aim to offer an API that is somewhat similar to that offered by the language.

    +

    +Type info

    +

    The type_info class isn't a drop-in replacement for std::type_info but can provide similar information which are not implementation defined and don't require to enable RTTI.
    + Therefore, they can sometimes be even more reliable than those obtained otherwise.

    +

    Its type defines an opaque class that is also copyable and movable.
    + Objects of this type are generally returned by the type_id functions:

    +
    // by type
    +
    auto info = entt::type_id<a_type>();
    +
    +
    // by value
    +
    auto other = entt::type_id(42);
    +
    entt::type_id
    const type_info & type_id()
    Returns the type info object associated to a given type.
    Definition: type_info.hpp:257
    +

    All elements thus received are nothing more than const references to instances of type_info with static storage duration.
    + This is convenient for saving the entire object aside for the cost of a pointer. However, nothing prevents from constructing type_info objects directly:

    +
    entt::type_info info{std::in_place_type<int>};
    +
    entt::type_info
    Implementation specific information about a type.
    Definition: type_info.hpp:141
    +

    These are the information made available by type_info:

    +
      +
    • The index associated with a given type:
      • +
    +
    auto idx = entt::type_id<a_type>().index();
    +

    This is also an alias for the following:

    +
    auto idx = entt::type_index<std::remove_cv_t<std::remove_reference_t<a_type>>>::value();
    +
      +
    • The hash value associated with a given type:
      • +
    +
    auto hash = entt::type_id<a_type>().hash();
    +

    This is also an alias for the following:

    +
    auto hash = entt::type_hash<std::remove_cv_t<std::remove_reference_t<a_type>>>::value();
    +
    entt::type_hash
    Type hash.
    Definition: type_info.hpp:100
    +
      +
    • The name associated with a given type:
      • +
    +
    auto name = entt::type_id<my_type>().name();
    +

    This is also an alias for the following:

    +
    auto name = entt::type_name<std::remove_cv_t<std::remove_reference_t<a_type>>>::value();
    +
    entt::type_name
    Type name.
    Definition: type_info.hpp:125
    +

    Where all accessed features are available at compile-time, the type_info class is also fully constexpr. However, this cannot be guaranteed in advance and depends mainly on the compiler in use and any specializations of the classes described above.

    +

    +Almost unique identifiers

    +

    Since the default non-standard, compile-time implementation of type_hash makes use of hashed strings, it may happen that two types are assigned the same hash value.
    + In fact, although this is quite rare, it's not entirely excluded.

    +

    Another case where two types are assigned the same identifier is when classes from different contexts (for example two or more libraries loaded at runtime) have the same fully qualified name. In this case, also type_name will return the same value for the two types.
    + Fortunately, there are several easy ways to deal with this:

    +
      +
    • The most trivial one is to define the ENTT_STANDARD_CPP macro. Runtime identifiers don't suffer from the same problem in fact. However, this solution doesn't work well with a plugin system, where the libraries aren't linked.
      • +
    • Another possibility is to specialize the type_name class for one of the conflicting types, in order to assign it a custom identifier. This is probably the easiest solution that also preserves the feature of the tool.
      • +
    • A fully customized identifier generation policy (based for example on enum classes or preprocessing steps) may represent yet another option.
      • +
    +

    These are just some examples of possible approaches to the problem but there are many others. As already mentioned above, since users have full control over their types, this problem is in any case easy to solve and should not worry too much.
    + In all likelihood, it will never happen to run into a conflict anyway.

    +

    +Type traits

    +

    A handful of utilities and traits not present in the standard template library but which can be useful in everyday life.
    + This list is not exhaustive and contains only some of the most useful classes. Refer to the inline documentation for more information on the features offered by this module.

    +

    +Size of

    +

    The standard operator sizeof complains when users provide it for example with function or incomplete types. On the other hand, it's guaranteed that its result is always nonzero, even if applied to an empty class type.
    + This small class combines the two and offers an alternative to sizeof that works under all circumstances, returning zero if the type isn't supported:

    +
    const auto size = entt::size_of_v<void>;
    +

    +Is applicable

    +

    The standard library offers the great std::is_invocable trait in several forms. This takes a function type and a series of arguments and returns true if the condition is satisfied.
    + Moreover, users are also provided with std::apply, a tool for combining invocable elements and tuples of arguments.

    +

    It would therefore be a good idea to have a variant of std::is_invocable that also accepts its arguments in the form of a tuple-like type, so as to complete the offer:

    +
    constexpr bool result = entt::is_applicable<Func, std::tuple<a_type, another_type>>;
    +
    entt::is_applicable
    Same as std::is_invocable, but with tuples.
    Definition: type_traits.hpp:378
    +

    This trait is built on top of std::is_invocable and does nothing but unpack a tuple-like type and simplify the code at the call site.

    +

    +Constness as

    +

    An utility to easily transfer the constness of a type to another type:

    +
    // type is const dst_type because of the constness of src_type
    +
    using type = entt::constness_as_t<dst_type, const src_type>;
    +
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:618
    +

    The trait is subject to the rules of the language. Therefore, for example, transferring constness between references won't give the desired effect.

    +

    +Member class type

    +

    The auto template parameter introduced with C++17 made it possible to simplify many class templates and template functions but also made the class type opaque when members are passed as template arguments.
    + The purpose of this utility is to extract the class type in a few lines of code:

    +
    template<typename Member>
    +
    using clazz = entt::member_class_t<Member>;
    +
    entt::member_class_t
    typename member_class< Member >::type member_class_t
    Helper type.
    Definition: type_traits.hpp:647
    +

    +Integral constant

    +

    Since std::integral_constant may be annoying because of its form that requires to specify both a type and a value of that type, there is a more user-friendly shortcut for the creation of integral constants.
    + This shortcut is the alias template entt::integral_constant:

    +
    constexpr auto constant = entt::integral_constant<42>;
    +
    entt::integral_constant
    std::integral_constant< decltype(Value), Value > integral_constant
    Wraps a static constant.
    Definition: type_traits.hpp:96
    +

    Among the other uses, when combined with a hashed string it helps to define tags as human-readable names where actual types would be required otherwise:

    +
    constexpr auto enemy_tag = entt::integral_constant<"enemy"_hs>;
    +
    registry.emplace<enemy_tag>(entity);
    +
    entt::entity
    entity
    Default entity identifier.
    Definition: fwd.hpp:47
    +
    entt::registry
    basic_registry< entity > registry
    Alias declaration for the most common use case.
    Definition: fwd.hpp:60
    +

    +Tag

    +

    Since id_type is very important and widely used in EnTT, there is a more user-friendly shortcut for the creation of integral constants based on it.
    + This shortcut is the alias template entt::tag.

    +

    If used in combination with hashed strings, it helps to use human-readable names where types would be required otherwise. As an example:

    +
    registry.emplace<entt::tag<"enemy"_hs>>(entity);
    +
    entt::tag
    integral_constant< Value > tag
    Alias template to facilitate the creation of named values.
    Definition: type_traits.hpp:103
    +

    However, this isn't the only permitted use. Literally any value convertible to id_type is a good candidate, such as the named constants of an unscoped enum.

    +

    +Type list and value list

    +

    There is no respectable library where the much desired type list can be missing.
    + EnTT is no exception and provides (making extensive use of it internally) the type_list type, in addition to its value_list counterpart dedicated to non-type template parameters.

    +

    Here is a (possibly incomplete) list of the functionalities that come with a type list:

    +
      +
    • type_list_element[_t] to get the N-th element of a type list.
      • +
    • type_list_cat[_t] and a handy operator+ to concatenate type lists.
      • +
    • type_list_unique[_t] to remove duplicate types from a type list.
      • +
    • type_list_contains[_v] to know if a type list contains a given type.
      • +
    • type_list_diff[_t] to remove types from type lists.
      • +
    +

    I'm also pretty sure that more and more utilities will be added over time as needs become apparent.
    + Many of these functionalities also exist in their version dedicated to value lists. We therefore have value_list_element[_v] as well as value_list_cat[_t]and so on.

    +Unique sequential identifiers

    +

    Sometimes it's useful to be able to give unique, sequential numeric identifiers to types either at compile-time or runtime.
    + There are plenty of different solutions for this out there and I could have used one of them. However, I decided to spend my time to define a couple of tools that fully embraces what the modern C++ has to offer.

    +

    +Compile-time generator

    +

    To generate sequential numeric identifiers at compile-time, EnTT offers the identifier class template:

    +
    // defines the identifiers for the given types
    +
    using id = entt::identifier<a_type, another_type>;
    +
    +
    // ...
    +
    +
    switch(a_type_identifier) {
    +
    case id::type<a_type>:
    +
    // ...
    +
    break;
    +
    case id::type<another_type>:
    +
    // ...
    +
    break;
    +
    default:
    +
    // ...
    +
    }
    +
    entt::identifier
    Types identifiers.
    Definition: ident.hpp:41
    +

    This is all what this class template has to offer: a type inline variable that contains a numeric identifier for the given type. It can be used in any context where constant expressions are required.

    +

    As long as the list remains unchanged, identifiers are also guaranteed to be stable across different runs. In case they have been used in a production environment and a type has to be removed, one can just use a placeholder to left the other identifiers unchanged:

    +
    template<typename> struct ignore_type {};
    +
    +
    using id = entt::identifier<
    +
    a_type_still_valid,
    +
    ignore_type<a_type_no_longer_valid>,
    +
    another_type_still_valid
    +
    >;
    +

    Perhaps a bit ugly to see in a codebase but it gets the job done at least.

    +

    +Runtime generator

    +

    To generate sequential numeric identifiers at runtime, EnTT offers the family class template:

    +
    // defines a custom generator
    +
    using id = entt::family<struct my_tag>;
    +
    +
    // ...
    +
    +
    const auto a_type_id = id::type<a_type>;
    +
    const auto another_type_id = id::type<another_type>;
    +
    entt::family
    Dynamic identifier generator.
    Definition: family.hpp:17
    +

    This is all what a family has to offer: a type inline variable that contains a numeric identifier for the given type.
    + The generator is customizable, so as to get different sequences for different purposes if needed.

    +

    Please, note that identifiers aren't guaranteed to be stable across different runs. Indeed it mostly depends on the flow of execution.

    +

    Utilities

    It's not possible to escape the temptation to add utilities of some kind to a library. In fact, EnTT also provides a handful of tools to simplify the life of developers:

      diff --git a/md_docs_md_entity.html b/md_docs_md_entity.html index 4d8c5dce9..73403a6ac 100644 --- a/md_docs_md_entity.html +++ b/md_docs_md_entity.html @@ -22,7 +22,7 @@
    @@ -66,59 +66,57 @@ $(function() {
    Crash Course: entity-component system
    -

    +

    Introduction

    EnTT is a header-only, tiny and easy to use entity-component system (and much more) written in modern C++.
    The entity-component-system (also known as ECS) is an architectural pattern used mostly in game development.

    -

    +

    Design decisions

    -

    +

    Type-less and bitset-free

    -

    EnTT offers a bitset-free entity-component system that doesn't require users to specify the set of components neither at compile-time nor at runtime.
    +

    EnTT offers a sparse set based model that doesn't require users to specify the set of components neither at compile-time nor at runtime.
    This is why users can instantiate the core class simply like:

    entt::registry registry;
    -
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:173
    +
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:221
    entt::registry
    basic_registry< entity > registry
    Alias declaration for the most common use case.
    Definition: fwd.hpp:60

    In place of its more annoying and error-prone counterpart:

    entt::registry<comp_0, comp_1, ..., comp_n> registry;

    Furthermore, it isn't necessary to announce the existence of a component type. When the time comes, just use it and that's all.

    -

    +

    Build your own

    -

    EnTT is designed as a container that can be used at any time just as a vector or any other tool would be used. It doesn't attempt in any way to take over on the user code base, nor to control its main loop or process scheduling.
    - Unlike other more or less known models, it makes use of independent pools. This has some advantages and disadvantages. The main purpose is to provide a fully customizable tool, where users have the freedom to define pools and opaque proxies for types with specific requirements.

    -

    The library provides a default implementation for many things and a mixin model that allows users to completely replace or even just enrich the pool dedicated to one or more components.
    - The built-in signal support is an example of that: defined as a mixin, it's easily disabled if not needed. Similarly, the storage class has a specialization that shows how everything is customizable down to the smallest detail.

    -

    +

    EnTT is designed as a container that can be used at any time, just like a vector or any other container. It doesn't attempt in any way to take over on the user codebase, nor to control its main loop or process scheduling.
    + Unlike other more or less well known models, it also makes use of independent pools that can be extended via static mixins. The built-in signal support is an example of this flexible model: defined as a mixin, it's easily disabled if not needed. Similarly, the storage class has a specialization that shows how everything is customizable down to the smallest detail.

    +

    Pay per use

    EnTT is entirely designed around the principle that users have to pay only for what they want.

    -

    When it comes to using an entity-component system, the tradeoff is usually between performance and memory usage. The faster it is, the more memory it uses. Even worse, some approaches tend to heavily affect other functionalities like the construction and destruction of components to favor iterations, even when it isn't strictly required. In fact, slightly worse performance along non-critical paths are the right price to pay to reduce memory usage and have overall better perfomance sometimes and I've always wondered why this kind of tools do not leave me the choice.
    +

    When it comes to using an entity-component system, the tradeoff is usually between performance and memory usage. The faster it is, the more memory it uses. Even worse, some approaches tend to heavily affect other functionalities like the construction and destruction of components to favor iterations, even when it isn't strictly required. In fact, slightly worse performance along non-critical paths are the right price to pay to reduce memory usage and have overall better performance.
    EnTT follows a completely different approach. It gets the best out from the basic data structures and gives users the possibility to pay more for higher performance where needed.

    So far, this choice has proven to be a good one and I really hope it can be for many others besides me.

    -

    +

    All or nothing

    EnTT is such that a T** pointer (or whatever a custom pool returns) is always available to directly access all the instances of a given component type T.
    I cannot say whether it will be useful or not to the reader, but it's worth to mention it since it's one of the corner stones of this library.

    Many of the tools described below give the possibility to get this information and have been designed around this need.
    The rest is experimentation and the desire to invent something new, hoping to have succeeded.

    -

    +

    Vademecum

    The registry to store, the views and the groups to iterate. That's all.

    -

    An entity (the E of an ECS) is an opaque identifier that users should use as-is. Inspecting an identifier isn't recommended since its format can change in future and a registry has all the functionalities to query them out-of-the-box. The type entt::entity implements the concept of entity identifier.
    - Components (the C of an ECS) must be both move constructible and move assignable. They are list initialized by using the parameters provided to construct the component itself. No need to register components or their types neither with the registry nor with the entity-component system at all.
    +

    The entt::entity type implements the concept of entity identifier. An entity (the E of an ECS) is an opaque element to use as-is. Inspecting it isn't recommended since its format can change in future.
    + Components (the C of an ECS) are both move constructible and move assignable types. No need to register them nor their types.
    Systems (the S of an ECS) can be plain functions, functors, lambdas and so on. It's not required to announce them in any case and have no requirements.

    -

    The following sections explain in short how to use the entity-component system, the core part of the whole library.
    - The project is composed of many other classes in addition to those describe below. For more details, please refer to the inline documentation.

    -

    +

    The next sections go into detail on how to use the entity-component system part of the EnTT library.
    + The project is composed of many other classes in addition to those described below. For more details, please refer to the inline documentation.

    +

    Pools

    -

    In EnTT, pools of components are made available through a specialized version of a sparse set.

    -

    Each pool contains all the instances of a single component and all the entities to which it's assigned. Sparse arrays are paged to avoid wasting memory in some cases. Packed arrays of components are also paged to have pointer stability upon additions. Packed arrays of entities are not instead.
    - All pools can rearrange their items in order to keep the internal arrays tightly packed and maximize performance.

    -

    +

    Pools of components are a sort of specialized version of a sparse set. Each pool contains all the instances of a single component type and all the entities to which it's assigned.
    + Sparse arrays are paged to avoid wasting memory. Packed arrays of components are also paged to have pointer stability upon additions. Packed arrays of entities are not instead.
    + All pools rearranges their items in order to keep the internal arrays tightly packed and maximize performance, unless pointer stability is enabled.

    +

    The Registry, the Entity and the Component

    -

    A registry can store and manage entities, as well as create views and groups to iterate the underlying data structures.
    - The class template basic_registry lets users decide what's the preferred type to represent an entity. Because std::uint32_t is large enough for almost all the cases, there exists also the enum class entt::entity that wraps it and the alias entt::registry for entt::basic_registry<entt::entity>.

    +

    A registry stores and manages entities (or better, identifiers) and pools.
    + The class template basic_registry lets users decide what's the preferred type to represent an entity. Because std::uint32_t is large enough for almost all the cases, there also exists the enum class entt::entity that wraps it and the alias entt::registry for entt::basic_registry<entt::entity>.

    Entities are represented by entity identifiers. An entity identifier contains information about the entity itself and its version.
    - User defined identifiers can be introduced through enum classes and class types that define an entity_type member of type std::uint32_t or std::uint64_t.

    + User defined identifiers are allowed as enum classes and class types that define an entity_type member of type std::uint32_t or std::uint64_t.

    A registry is used both to construct and to destroy entities:

    // constructs a naked entity with no components and returns its identifier
    auto entity = registry.create();
    @@ -126,12 +124,12 @@ The Registry, the Entity and the Component

    // destroys an entity and all its components
    registry.destroy(entity);
    entt::entity
    entity
    Default entity identifier.
    Definition: fwd.hpp:47
    -

    The create member function accepts also a hint and has an overload that gets two iterators and can be used to generate multiple entities at once efficiently. Similarly, the destroy member function works also with a range of entities:

    +

    The create member function also accepts a hint and has an overload that gets two iterators and can be used to generate multiple entities at once efficiently. Similarly, the destroy member function also works with a range of entities:

    // destroys all the entities in a range
    auto view = registry.view<a_component, another_component>();
    registry.destroy(view.begin(), view.end());
    entt::view
    basic_view< entity, Get, Exclude > view
    Alias declaration for the most common use case.
    Definition: fwd.hpp:103
    -

    In addition to offering an overload to force the version upon destruction. Note that this function removes all components from an entity before releasing its identifier. There exists also a lighter alternative that only releases the elements without poking in any pool, for use with orphaned entities:

    +

    In addition to offering an overload to force the version upon destruction. Note that this function removes all components from an entity before releasing its identifier. There also exists a lighter alternative that only releases the elements without poking in any pool, for use with orphaned entities:

    // releases an orphaned identifier
    registry.release(entity);

    As with the destroy function, also in this case entity ranges are supported and it's possible to force the version during release.

    @@ -190,7 +188,7 @@ The Registry, the Entity and the Component
    // true if entity has at least one of the given components
    bool any = registry.any_of<position, velocity>(entity);
    -
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:16
    +
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:17

    If the goal is to delete a component from an entity that owns it, the erase member function template is the way to go:

    registry.erase<position>(entity);

    When in doubt whether the entity owns the component, use the remove member function instead. It behaves similarly to erase but it erases the component if and only if it exists, otherwise it returns safely to the caller:

    @@ -215,11 +213,11 @@ The Registry, the Entity and the Component
    const auto [cpos, cvel] = cregistry.get<position, velocity>(entity);
    auto [pos, vel] = registry.get<position, velocity>(entity);

    The get member function template gives direct access to the component of an entity stored in the underlying data structures of the registry. There exists also an alternative member function named try_get that returns a pointer to the component owned by an entity if any, a null pointer otherwise.

    -

    +

    Observe changes

    -

    Because of how the registry works internally, it stores a bunch of signal handlers for each pool in order to notify some of its data structures on the construction and destruction of components or when an instance of a component is explicitly replaced by the user.
    - These signal handlers are also exposed and made available to users. These are the basic bricks to build fancy things like dependencies and reactive systems.

    -

    To get a sink to be used to connect and disconnect listeners so as to be notified on the creation of a component, use the on_construct member function:

    +

    By default, each storage comes with a mixin that adds signal support to it.
    + This allows for fancy things like dependencies and reactive systems.

    +

    The on_construct member function returns a sink (which is an object for connecting and disconnecting listeners) for those interested in notifications when a new instance of a given component type is created:

    // connects a free function
    registry.on_construct<position>().connect<&my_free_function>();
    @@ -231,9 +229,9 @@ Observe changes
    // disconnects a member function
    registry.on_construct<position>().disconnect<&my_class::member>(instance);
    -

    To be notified when a component is destroyed, use the on_destroy member function instead. Finally, the on_update member function will return a sink to which to connect listeners to observe changes.
    - In the last case, given the way C++ works, it's also necessary to use specific member functions to allow the signal to be triggered. In particular, listeners attached to on_update will only be invoked following a call to replace or patch.

    -

    The function type of a listener should be equivalent to the following:

    +

    Similarly, on_destroy and on_update are used to receive notifications about the destruction and update of an instance, respectively.
    + Because of how C++ works, listeners attached to on_update are only invoked following a call to replace, emplace_or_replace or patch.

    +

    The function type of a listener is equivalent to the following:

    void(entt::registry &, entt::entity);

    In all cases, listeners are provided with the registry that triggered the notification and the involved entity.

    Note also that:

    @@ -248,11 +246,9 @@ Observe changes
  • Removing the component from within the body of a listener that observes the construction or update of instances of a given type isn't allowed.
  • Assigning and removing components from within the body of a listener that observes the destruction of instances of a given type should be avoided. It can lead to undefined behavior in some cases. This type of listeners is intended to provide users with an easy way to perform cleanup and nothing more.
    • -

    To a certain extent, these limitations don't apply. However, it's risky to try to force them and users should respect the limitations unless they know exactly what they are doing.

    -

    Events and therefore listeners must not be used as replacements for systems. They shouldn't contain much logic and interactions with a registry should be kept to a minimum. Moreover, the greater the number of listeners, the greater the performance hit when components are created or destroyed.

    -

    Please, refer to the documentation of the signal class to know all the features it offers.
    +

    Please, refer to the documentation of the signal class to know about all the features it offers.
    There are many useful but less known functionalities that aren't described here, such as the connection objects or the possibility to attach listeners with a list of parameters that is shorter than that of the signal itself.

    -

    +

    They call me Reactive System

    Signals are the basic tools to construct reactive systems, even if they aren't enough on their own. EnTT tries to take another step in that direction with the observer class template.
    In order to explain what reactive systems are, this is a slightly revised quote from the documentation of the library that first introduced this tool, Entitas:

    @@ -299,12 +295,12 @@ They call me Reactive System

    In addition, a matcher can be filtered with a where clause:

    entt::collector.update<sprite>().where<position>(entt::exclude<velocity>);

    This clause introduces a way to intercept entities if and only if they are already part of a hypothetical group. If they are not, they aren't returned by the observer, no matter if they matched the given rule.
    - In the example above, whenever the component sprite of an entity is updated, the observer probes the entity itself to verify that it has at least position and has not velocity before to store it aside. If one of the two conditions of the filter isn't respected, the entity is discared, no matter what.

    + In the example above, whenever the component sprite of an entity is updated, the observer probes the entity itself to verify that it has at least position and has not velocity before to store it aside. If one of the two conditions of the filter isn't respected, the entity is discarded, no matter what.

    A where clause accepts a theoretically unlimited number of types as well as multiple elements in the exclusion list. Moreover, every matcher can have its own clause and multiple clauses for the same matcher are combined in a single one.

    -

    +

    Sorting: is it possible?

    -

    Sorting entities and components is possible with EnTT. In particular, it's feasible with an in-place algorithm that doesn't require memory allocations nor anything else and is therefore particularly convenient.
    - With this in mind, there are two functions that respond to slightly different needs:

    +

    Sorting entities and components is possible with EnTT. In particular, it uses an in-place algorithm that doesn't require memory allocations nor anything else and is therefore particularly convenient.
    + There are two functions that respond to slightly different needs:

    • Components can be sorted either directly:
    @@ -322,13 +318,12 @@ Sorting: is it possible?
    registry.sort<movement, physics>();

    In this case, instances of movement are arranged in memory so that cache misses are minimized when the two components are iterated together.

    As a side note, the use of groups limits the possibility of sorting pools of components. Refer to the specific documentation for more details.

    -

    +

    Helpers

    -

    The so called helpers are small classes and functions mainly designed to offer built-in support for the most basic functionalities.
    - The list of helpers will grow longer as time passes and new ideas come out.

    -

    +

    The so called helpers are small classes and functions mainly designed to offer built-in support for the most basic functionalities.

    +

    Null entity

    -

    In EnTT, the entt::null variable models the concept of null entity.
    +

    The entt::null variable models the concept of null entity.
    The library guarantees that the following expression always returns false:

    registry.valid(entt::null);
    entt::null
    constexpr null_t null
    Compile-time constant for null entities.
    Definition: entity.hpp:326
    @@ -340,10 +335,10 @@ Null entity
    const bool null = (entity == entt::null);

    As for its integral form, the null entity only affects the entity part of an identifier and is instead completely transparent to its version.

    Be aware that entt::null and entity 0 aren't the same thing. Likewise, a zero initialized entity isn't the same as entt::null. Therefore, although entt::entity{} is in some sense an alias for entity 0, none of them can be used to create a null entity.

    -

    +

    Tombstone

    -

    In addition to the null entity, EnTT also models the concept of tombstone with the entt::tombstone variable.
    - Once created, the integral form of the two values is the same, although they affect different parts of an identifier. In fact, the tombstone uses only the version part and is completely transparent to the entity part.

    +

    Similar to the null entity, the entt::tombstone variable models the concept of tombstone.
    + Once created, the integral form of the two values is the same, although they affect different parts of an identifier. In fact, the tombstone only uses the version part of it and is completely transparent to the entity part.

    Also in this case, the following expression always returns false:

    registry.valid(entt::tombstone);
    entt::tombstone
    constexpr tombstone_t tombstone
    Compile-time constant for tombstone entities.
    Definition: entity.hpp:335
    @@ -356,14 +351,14 @@ Tombstone
    const auto entity = registry.create();
    const bool tombstone = (entity == entt::tombstone);

    Be aware that entt::tombstone and entity 0 aren't the same thing. Likewise, a zero initialized entity isn't the same as entt::tombstone. Therefore, although entt::entity{} is in some sense an alias for entity 0, none of them can be used to create tombstones.

    -

    +

    To entity

    Sometimes it's useful to get the entity from a component instance.
    This is what the entt::to_entity helper does. It accepts a registry and an instance of a component and returns the entity associated with the latter:

    const auto entity = entt::to_entity(registry, position);
    entt::to_entity
    constexpr entt_traits< Entity >::entity_type to_entity(const Entity value)
    Returns the entity part once converted to the underlying type.
    Definition: entity.hpp:148

    A null entity is returned in case the component doesn't belong to the registry.

    -

    +

    Dependencies

    The registry class is designed to be able to create short circuits between its functions. This simplifies the definition of dependencies between different operations.
    For example, the following adds (or replaces) the component a_type whenever my_type is assigned to an entity:

    @@ -373,13 +368,13 @@ Dependencies

    A dependency can also be easily broken as follows:

    registry.on_construct<my_type>().disconnect<&entt::registry::emplace_or_replace<a_type>>();

    There are many other types of dependencies. In general, most of the functions that accept an entity as the first argument are good candidates for this purpose.

    -

    +

    Invoke

    -

    Sometimes it's useful to be able to directly invoke a member function of a component as a callback. It's already possible in practice but requires users to extend their classes and this may not always be possible.
    +

    Sometimes it's useful to directly invoke a member function of a component as a callback. It's already possible in practice but requires users to extend their classes and this may not always be possible.
    The invoke helper allows to propagate the signal in these cases:

    registry.on_construct<clazz>().connect<entt::invoke<&clazz::func>>();

    All it does is pick up the right component for the received entity and invoke the requested method, passing on the arguments if necessary.

    -

    +

    Handle

    A handle is a thin wrapper around an entity and a registry. It provides the same functions that the registry offers for working with components, such as emplace, get, patch, remove and so on. The difference being that the entity is implicitly passed to the registry.
    It's default constructible as an invalid handle that contains a null registry and a null entity. When it contains a null registry, calling functions that delegate execution to the registry will cause an undefined behavior, so it's recommended to check the validity of the handle with implicit cast to bool when in doubt.
    @@ -388,15 +383,15 @@ Handle Users can also easily create their own aliases for custom identifiers as:

    using my_handle = entt::basic_handle<my_identifier>;
    using my_const_handle = entt::basic_handle<const my_identifier>;
    -
    entt::basic_handle
    Non-owning handle to an entity.
    Definition: handle.hpp:23
    +
    entt::basic_handle
    Non-owning handle to an entity.
    Definition: handle.hpp:23

    Handles are also implicitly convertible to const handles out of the box but not the other way around.
    A handle stores a non-const pointer to a registry and therefore it can do all the things that can be done with a non-const registry. On the other hand, a const handles store const pointers to registries and offer a restricted set of functionalities.

    This class is intended to simplify function signatures. In case of functions that take a registry and an entity and do most of their work on that entity, users might want to consider using handles, either const or non-const.

    -

    +

    Organizer

    -

    The organizer class template offers minimal support (but sufficient in many cases) for creating an execution graph from functions and their requirements on resources.
    +

    The organizer class template offers support for creating an execution graph from a set of functions and their requirements on resources.
    The resulting tasks aren't executed in any case. This isn't the goal of this tool. Instead, they are returned to the user in the form of a graph that allows for safe execution.

    -

    The functions are added in order of execution to the organizer. Free functions and member functions are supported as template parameters, however there is also the possibility to pass pointers to free functions or decayed lambdas as parameters to the emplace member function:

    +

    All functions are added in order of execution to the organizer:

    entt::organizer organizer;
    // adds a free function to the organizer
    @@ -408,15 +403,15 @@ Organizer
    // adds a decayed lambda directly
    organizer.emplace(+[](const void *, entt::registry &) { /* ... */ });
    -
    entt::basic_organizer
    Utility class for creating a static task graph.
    Definition: organizer.hpp:111
    +
    entt::basic_organizer
    Utility class for creating a static task graph.
    Definition: organizer.hpp:108
    entt::organizer
    basic_organizer< entity > organizer
    Alias declaration for the most common use case.
    Definition: fwd.hpp:66
    -

    As for free functions and member functions, these are the parameters that can be presented by their function types and that will be correctly handled:

    +

    These are the parameters that a free function or a member function can accept:

      -
    • A possibly constant reference to a registry. The one passed to the task when it's run will also be passed to the function as-is.
      • -
    • An entt::view with any possible combination of types. It will be created from the registry passed to the task and supplied directly to the function.
      • -
    • A possibly constant reference to any type T. It will be interpreted as context variable, which will be created within the registry and passed to the function.
      • +
    • A possibly constant reference to a registry.
      • +
    • An entt::basic_view with any possible combination of types.
      • +
    • A possibly constant reference to any type T (that is, a context variable).
    -

    The function type for free functions and decayed lambdas passed as parameters to emplace is void(const void *, entt::registry &) instead. The registry is the same as provided to the task. The first parameter is an optional pointer to user defined data to provide upon registration:

    +

    The function type for free functions and decayed lambdas passed as parameters to emplace is void(const void *, entt::registry &) instead. The first parameter is an optional pointer to user defined data to provide upon registration:

    clazz instance;
    organizer.emplace(+[](const void *, entt::registry &) { /* ... */ }, &instance);

    In all cases, it's also possible to associate a name with the task when creating it. For example:

    @@ -449,76 +444,81 @@ Organizer
    node.prepare(registry);
    }

    The actual scheduling of the tasks is the responsibility of the user, who can use the preferred tool.

    -

    +

    Context variables

    -

    It is often convenient to assign context variables to a registry, so as to make it the only source of truth of an application.
    - This is possible by means of a member function named set to use to create a context variable from a given type. Either ctx or try_ctx can be used to retrieve the newly created instance, while unset is meant to clear the variable if needed:

    -
    // creates a new context variable initialized with the given values
    -
    registry.set<my_type>(42, 'c');
    +

    Each registry has a context associated with it, which is an any object map accessible by both type and name for convenience. The name isn't really a name though. In fact, it's a numeric id of type id_type to be used as a key for the variable. Any value is accepted, even runtime ones.
    + The context is returned via the ctx functions and offers a minimal set of feature including the following:

    +
    // creates a new context variable by type
    +
    registry.ctx().emplace<my_type>(42, 'c');
    -
    // gets the context variable as a non-const reference from a non-const registry
    -
    auto &var = registry.ctx<my_type>();
    +
    // creates a new context variable with a name
    +
    registry.ctx().emplace_hint<my_type>("my_variable"_hs, 42, 'c');
    -
    // gets the context variable as a const reference from either a const or a non-const registry
    -
    const auto &cvar = registry.ctx<const my_type>();
    +
    // gets the context variable by type as a non-const reference from a non-const registry
    +
    auto &var = registry.ctx().at<my_type>();
    -
    // unsets the context variable
    -
    registry.unset<my_type>();
    -

    The type of a context variable must be such that it's default constructible and can be moved. The set member function either creates a new instance of the context variable or overwrites an already existing one if any.
    - The try_ctx member function returns a pointer to the context variable if it exists, otherwise it returns a null pointer. As ctx, it supports both const and non-const types and requires a const one when used on a const registry:

    -
    if(auto *cptr = registry.try_ctx<const my_type>(); cptr) {
    -
    // uses the context variable associated with the registry, if any
    -
    }
    -

    +
    // gets the context variable by name as a const reference from either a const or a non-const registry
    +
    const auto &cvar = registry.ctx().at<const my_type>("my_variable"_hs);
    +
    +
    // resets the context variable by type
    +
    registry.ctx().erase<my_type>();
    +
    +
    // resets the context variable associated with the given name
    +
    registry.ctx().erase<my_type>("my_variable"_hs);
    +

    The type of a context variable must be such that it's default constructible and can be moved. If the supplied type doesn't match that of the variable when using a name, the operation will fail.
    + For all users who want to use the context but don't want to create elements, the contains and find functions are also available:

    +
    const bool contains = registry.ctx().contains<my_type>();
    +
    const my_type *value = registry.ctx().find<const my_type>("my_variable"_hs);
    +

    Also in this case, both functions support constant types and accept a name for the variable to look up, as does at.

    +

    Aliased properties

    Context variables can also be used to create aliases for existing variables that aren't directly managed by the registry. In this case, it's also possible to make them read-only.
    To do that, the type used upon construction must be a reference type and an lvalue is necessarily provided as an argument:

    time clock;
    -
    registry.set<my_type &>(clock);
    +
    registry.ctx().emplace<my_type &>(clock);

    Read-only aliased properties are created using const types instead:

    -
    registry.set<const my_type &>(clock);
    -

    From the point of view of the user, there are no differences between a variable that is managed by the registry and an aliased property. However, read-only variables aren't accesible as non-const references:

    +
    registry.ctx().emplace<const my_type &>(clock);
    +

    From the point of view of the user, there are no differences between a variable that is managed by the registry and an aliased property. However, read-only variables aren't accessible as non-const references:

    // read-only variables only support const access
    -
    const my_type *ptr = registry.try_ctx<const my_type>();
    -
    const my_type &var = registry.ctx<const my_type>();
    -

    Aliased properties can be unset and are overwritten when set is invoked, as it happens with standard variables.

    -

    +
    const my_type *ptr = registry.ctx().find<const my_type>();
    +
    const my_type &var = registry.ctx().at<const my_type>();
    +

    Aliased properties can be erased as it happens with any other variable. Similarly, they can also be associated with user-generated names (or ids).

    +

    +Component traits

    +

    In EnTT, almost everything is customizable. Components are no exception.
    + In this case, the standardized way to access all component properties is the component_traits class.

    +

    Various parts of the library access component properties through this class. It makes it possible to use any type as a component, as long as its specialization of component_traits implements all the required functionalities.
    + The non-specialized version of this class contains the following members:

    +
      +
    • in_place_delete: Type::in_place_delete if present, false otherwise.
      • +
    • page_size: Type::page_size if present, ENTT_PACKED_PAGE (for non-empty types) or 0 (for empty types) otherwise.
      • +
    +

    Where Type is any type of component. All properties can be customized by specializing the above class and defining all its members, or by adding only those of interest to a component definition:

    +
    struct transform {
    +
    static constexpr auto in_place_delete = true;
    +
    // ... other data members ...
    +
    };
    +

    The component_traits class template will take care of correctly extracting the properties from the supplied type to pass them to the rest of the library.
    + In the case of a direct specialization, the class is also sfinae-friendly. It supports single and multi type specializations as well as feature-based ones.

    +

    Pointer stability

    The ability to achieve pointer stability for one, several or all components is a direct consequence of the design of EnTT and of its default storage.
    In fact, although it contains what is commonly referred to as a packed array, the default storage is paged and doesn't suffer from invalidation of references when it runs out of space and has to reallocate.
    However, this isn't enough to ensure pointer stability in case of deletion. For this reason, a stable deletion method is also offered. This one is such that the position of the elements is preserved by creating tombstones upon deletion rather than trying to fill the holes that are created.

    -

    For performance reasons, EnTT will also favor storage compaction in all cases, although often accessing a component occurs mostly randomly or traversing pools in a non-linear order on the user side (as in the case of a hierarchy).
    +

    For performance reasons, EnTT favors storage compaction in all cases, although often accessing a component occurs mostly randomly or traversing pools in a non-linear order on the user side (as in the case of a hierarchy).
    In other words, pointer stability is not automatic but is enabled on request.

    -

    +

    In-place delete

    -

    By default, EnTT keeps all pools compact when a component is removed. This is done through a swap-and-pop between the removed item and the one occupying the last position in the storage.
    - Unfortunately, this also inevitably leads the components to change position within the storage, making direct access almost impossible (be it via pointer or index).

    -

    However, the underlying model with its independent pools helps introduce storage with different deletion policies, so that users can best choose type by type.
    - In particular, the library offers out of the box support for in-place deletion, thus offering storage with completely stable pointers. To do so, it's required to specialize the component_traits class.
    - The definition common to all components is the following:

    -
    struct basic_component_traits {
    -
    static constexpr auto in_place_delete = false;
    -
    static constexpr auto ignore_if_empty = ENTT_IGNORE_IF_EMPTY;
    -
    static constexpr auto page_size = ENTT_PACKED_PAGE;
    -
    };
    -

    Where in_place_delete instructs the library on the deletion policy for a given type while ignore_if_empty selectively disables empty type optimization and page_size dictates the storage behavior for non-empty types.
    - The component_traits class template is sfinae-friendly, it supports single and multi type specializations as well as feature-based ones:

    -
    template<>
    -
    struct entt::component_traits<position>: basic_component_traits {
    -
    using in_place_delete = std::true_type;
    -
    };
    -
    entt::basic_component_traits::in_place_delete
    static constexpr auto in_place_delete
    Pointer stability, default is false.
    Definition: component.hpp:12
    -
    entt::component_traits
    Common way to access various properties of components.
    Definition: component.hpp:24
    -

    This will ensure in-place deletion for the position component without further user intervention.
    - Views and groups adapt accordingly when they detect a storage with a different deletion policy than the default. No specific action is required from the user once in-place deletion is enabled. In particular:

    +

    The library offers out of the box support for in-place deletion, thus offering storage with completely stable pointers. This is achieved by specializing the component_traits class or by adding the required properties to the component definition when needed.
    + Views and groups adapt accordingly when they detect a storage with a different deletion policy than the default. In particular:

      -
    • Groups are incompatible with stable storage and will trigger a compile-time error if detected.
      • -
    • Multi type views are completely transparent to storage policies.
      • +
    • Groups are incompatible with stable storage and will even refuse to compile.
      • +
    • Multi type and runtime views are completely transparent to storage policies.
    • Single type views for stable storage types offer the same interface of multi type views. For example, only size_hint is available.
    -

    In other words, the more generic version of a view will be provided in case of stable storage, even for single components, always supported by an appropriate iteration policy if required.
    - The latter will be such that in no case will a tombstone be returned from the view itself, regardless of the iteration method. Similarly, no non-existent components will be accessed, which could result in an UB otherwise.

    -

    +

    In other words, the more generic version of a view is provided in case of stable storage, even for a single type view.
    + In no case a tombstone is returned from the view itself. Likewise, non-existent components aren't returned, which could otherwise result in an UB.

    +

    Hierarchies and the like

    EnTT doesn't attempt in any way to offer built-in methods with hidden or unclear costs to facilitate the creation of hierarchies.
    There are various solutions to the problem, such as using the following class:

    @@ -533,48 +533,27 @@ Hierarchies and the like

    However, it should be pointed out that the possibility of having stable pointers for one, many or all types solves the problem of hierarchies at the root in many cases.
    In fact, if a certain type of component is visited mainly in random order or according to hierarchical relationships, using direct pointers has many advantages:

    struct transform {
    +
    static constexpr auto in_place_delete = true;
    +
    transform *parent;
    // ... other data members ...
    };
    -
    -
    template<>
    -
    struct entt::component_traits<transform>: basic_component_traits {
    -
    using in_place_delete = std::true_type;
    -
    };
    -

    Furthermore, it's quite common for a group of elements to be created close in time and therefore fallback into adjacent positions, thus favoring locality even on random accesses. Locality that won't be sacrificed over time given the stability of storage positions, with undoubted performance advantages.
    - Of course, the cost moves to linear iterations, where views and groups will have to identify (and discard) all tombstones. However, once considered the benefits, from performance to ease of use, and given the many optimizations that make this cost negligible, this is configured as one of the most convenient solutions and certainly something to take into consideration.

    -

    -Making the most of range-destroy

    -

    The range-destroy functionality offers an improved path under the hood. To understand it, let's try to describe what problem it tries to solve.
    - This function accepts two iterators that point to the beginning and end of a range of entities. If the iterators are those returned from a view, this pair cannot be passed to the first storage asking to remove all entities and then to all other storage. This is because the range may be empty when passed to the second pool, as not all of those entities still own all the components iterated from the view itself.
    - As a result, only one component is removed and no entities are destroyed.

    -

    To avoid this, in many cases the registry doesn't pass the range to all pools. Instead, it iterates the range and passes an entity at a time to all pools.
    - It goes without saying that the latter is slightly slower than the former.

    -

    On the other side, the destroy function also uses is_iterator_type under the hood to detect dangerous iterators. Whenever possible, it still chooses the fastest path.
    - This means that performance will improve if, for example, two iterators returned from an std::vector are used or, more in general, with all iterators that are not part of EnTT.

    -

    Unfortunately, this risks falling into the error described above in some corner cases. In particular, where an iterator is used that is not defined by EnTT but which uses one of the latter within it.
    - It's quite unlikely to happen even in large software. However, the library offers a solution also in this case, so as to allow for custom iterators and better performance at the same time.
    - In particular, it's necessary to either expose the member type iterator_type and declare that an iterator from EnTT is used internally or specialize the is_iterator_type class to drive the choice of the destroy function.
    - In both cases, the aim is to not choose the optimized route if it can cause problems.

    -

    With a good chance, the last note can be ignored and there will never be a need to do the above even after writing millions of lines of code.
    - However, it's good to know how to exploit the destroy function to get the best out of it.

    -

    +

    Furthermore, it's quite common for a group of elements to be created close in time and therefore fallback into adjacent positions, thus favoring locality even on random accesses. Locality that won't be sacrificed over time given the stability of storage positions, with undoubted performance advantages.

    +

    Meet the runtime

    -

    EnTT takes full advantage of what the language offers at compile-time.
    - However, this can have its downsides (well known to those familiar with type erasure techniques).

    -

    To bridge this gap, the library provides a bunch of utilities and features that can be very useful when needed.
    - On the one hand, storage classes are standalone objects that allow users to work with components within certain limits and without knowing the actual types. On the other hand, it's possible to create component storage dynamically and link them to a name rather than a type.

    -

    +

    EnTT takes advantage of what the language offers at compile-time. However, this can have its downsides (well known to those familiar with type erasure techniques).
    + To fill the gap, the library also provides a bunch of utilities and feature that can be very useful to handle types and pools at runtime.

    +

    A base class to rule them all

    Storage classes are fully self-contained types. These can be extended via mixins to add more functionalities (generic or type specific). In addition, they offer a basic set of functions that already allow users to go very far.
    - The aim is to limit the need for customizations as much as possible, offering what is usually necessary for the majority of cases.

    + The aim is to limit the need for customizations as much as possible, offering what is usually necessary for the vast majority of cases.

    When a storage is used through its base class (i.e. when its actual type isn't known), there is always the possibility of receiving a type_info describing the type of the objects associated with the entities (if any):

    if(entt::type_id<velocity>() == base.type()) {
    // ...
    }
    -

    Furthermore, all features rely on internal functions that forward the calls to the mixins. The latter can then make use of any context variables, which can be set via bind:

    +

    Furthermore, all features rely on internal functions that forward the calls to the mixins. The latter can then make use of any information, which can be set via bind:

    base.bind(entt::forward_as_any(registry));
    -
    entt::forward_as_any
    basic_any< Len, Align > forward_as_any(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: any.hpp:488
    +
    entt::forward_as_any
    basic_any< Len, Align > forward_as_any(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: any.hpp:484

    The bind function accepts an entt::any object, that is a typed type-erased value.
    This is how a registry passes itself to all pools that support signals and also why a storage keeps sending events without requiring the registry to be passed to it every time.

    Alongside these more specific things, there are also a couple of functions designed to address some common requirements such as copying an entity.
    @@ -588,17 +567,17 @@ A base class to rule them all

    This means that, starting from a reference to the base, it's possible to bind components with entities without knowing their actual type and even initialize them by copy if needed:

    // create a copy of an entity component by component
    for(auto &&curr: registry.storage()) {
    -
    if(auto &storage = curr.second; storage.contains(entity)) {
    -
    storage.emplace(other, storage.get(entity));
    +
    if(auto &storage = curr.second; storage.contains(src)) {
    +
    storage.emplace(dst, storage.get(src));
    }
    }
    entt::storage
    basic_storage< entity, Args... > storage
    Alias declaration for the most common use case.
    Definition: fwd.hpp:57

    This is particularly useful to clone entities in an opaque way. In addition, the decoupling of features allows for filtering or use of different copying policies depending on the type.

    -

    +

    Beam me up, registry

    EnTT is strongly based on types and has always allowed to create only one storage of a certain type within a registry.
    However, this doesn't work well for users who want to create multiple storage of the same type associated with different names, such as for interacting with a scripting system.

    -

    Nowadays, the library has solved this limitation and offers the possibility of associating a type with a name (or rather, a numeric identifier):

    +

    Nowadays, the library has solved this problem and offers the possibility of associating a type with a name (or rather, a numeric identifier):

    using namespace entt::literals;
    auto &&storage = registry.storage<velocity>("second pool"_hs);

    If a name isn't provided, the default storage associated with the given type is always returned.
    @@ -612,7 +591,7 @@ Beam me up, registry On the other hand, those calls involving all storage are guaranteed to also reach manually created ones:

    // will remove the entity from both storage
    registry.destroy(entity);
    -

    Finally, a storage of this type can be used with any view (which also accept multiple storages of the same type, if necessary):

    +

    Finally, a storage of this type can be used with any view (which also accepts multiple storages of the same type, if necessary):

    // direct initialization
    entt::basic_view direct{
    registry.storage<velocity>(),
    @@ -624,7 +603,7 @@ Beam me up, registry
    entt::basic_view
    View implementation.
    Definition: fwd.hpp:20

    The possibility of direct use of storage combined with the freedom of being able to create and use more than one of the same type opens the door to the use of EnTT at runtime, which was previously quite limited.
    Sure the basic design remains very type-bound, but finally it's no longer bound to this one option alone.

    -

    +

    Snapshot: complete vs continuous

    The registry class offers basic support to serialization.
    It doesn't convert components to bytes directly, there wasn't the need of another tool for serialization out there. Instead, it accepts an opaque object with a suitable interface (namely an archive) to serialize its internal data structures and restore them later. The way types and instances are converted to a bunch of bytes is completely in charge to the archive and thus to final users.

    @@ -653,7 +632,7 @@ Snapshot: complete vs continuous

    Note that component stores items along with entities. It means that it works properly without a call to the entities member function.

    Once a snapshot is created, there exist mainly two ways to load it: as a whole and in a kind of continuous mode.
    The following sections describe both loaders and archives in details.

    -

    +

    Snapshot loader

    A snapshot loader requires that the destination registry be empty and loads all the data at once while keeping intact the identifiers that the entities originally had.
    To use it, just pass to the constructor a valid registry:

    @@ -668,7 +647,7 @@ Snapshot loader

    The entities member function restores the sets of entities and the versions that they originally had at the source.

    The component member function restores all and only the components specified and assigns them to the right entities. Note that the template parameter list must be exactly the same used during the serialization.

    The orphans member function literally releases those entities that have no components attached. It's usually useless if the snapshot is a full dump of the source. However, in case all the entities are serialized but only few components are saved, it could happen that some of the entities have no components once restored. The best the users can do to deal with them is to release those entities and thus update their versions.

    -

    +

    Continuous loader

    A continuous loader is designed to load data from a source registry to a (possibly) non-empty destination. The loader can accommodate in a registry more than one snapshot in a sort of continuous loading that updates the destination one step at a time.
    Identifiers that entities originally had are not transferred to the target. Instead, the loader maps remote identifiers to local ones while restoring a snapshot. Because of that, this kind of loader offers a way to update automatically identifiers that are part of components (as an example, as data members or gathered in a container).
    @@ -688,7 +667,7 @@ Continuous loader In case the component contains entities itself (either as data members of type entt::entity or as containers of entities), the loader can update them automatically. To do that, it's enough to specify the data members to update as shown in the example.

    The orphans member function literally releases those entities that have no components after a restore. It has exactly the same purpose described in the previous section and works the same way.

    Finally, shrink helps to purge local entities that no longer have a remote conterpart. Users should invoke this member function after restoring each snapshot, unless they know exactly what they are doing.

    -

    +

    Archives

    Archives must publicly expose a predefined set of member functions. The API is straightforward and consists only of a group of function call operators that are invoked by the snapshot class and the loaders.

    In particular:

    @@ -712,12 +691,12 @@ Archives

    In addition, the archive must accept a pair of references to an entity and its component for each type to be restored. Therefore, given a type T, the archive must contain a function call operator with the following signature:

    void operator()(entt::entity &, T &);

    Every time such an operator is invoked, the archive must read the next elements from the underlying storage and copy them in the given variables.

    -

    +

    One example to rule them all

    EnTT comes with some examples (actually some tests) that show how to integrate a well known library for serialization as an archive. It uses Cereal C++ under the hood, mainly because I wanted to learn how it works at the time I was writing the code.

    The code is not production-ready and it isn't neither the only nor (probably) the best way to do it. However, feel free to use it at your own risk.

    The basic idea is to store everything in a group of queues in memory, then bring everything back to the registry with different loaders.

    -

    +

    Views and Groups

    First of all, it's worth answering a question: why views and groups?
    Briefly, they're a good tool to enforce single responsibility. A system that has access to a registry can create and destroy entities, as well as assign and remove components. On the other side, a system that has access to a view or a group can only iterate, read and update entities and components.
    @@ -733,7 +712,7 @@ Views and Groups

    Groups come in three different flavors: full-owning groups, partial-owning groups and non-owning groups. The main difference between them is in terms of performance.
    Groups can literally own one or more component types. They are allowed to rearrange pools so as to speed up iterations. Roughly speaking: the more components a group owns, the faster it is to iterate them.
    A given component can belong to multiple groups only if they are nested, so users have to define groups carefully to get the best out of them.

    -

    +

    Views

    A view behaves differently if it's constructed for a single component or if it has been created to iterate multiple components. Even the API is slightly different in the two cases.

    Single type views are specialized to give a boost in terms of performance in all the situations. This kind of views can access the underlying data structures directly and avoid superfluous checks. There is nothing as fast as a single type view. In fact, they walk through a packed (actually paged) array of components and return them one at a time.
    @@ -788,7 +767,7 @@ Views

    // ...
    }

    Note: prefer the get member function of a view instead of that of a registry during iterations to get the types iterated by the view itself.

    -

    +

    View pack

    Views are combined with each other to create new and more specific types.
    The type returned when combining multiple views together is itself a view, more in general a multi component one.

    @@ -799,34 +778,33 @@ View pack
    auto pack = view | other;

    The constness of the types is preserved and their order depends on the order in which the views are combined. Therefore, the pack in the example above will return an instance of position first and then one of velocity.
    Since combining views generates views, a chain can be of arbitrary length and the above type order rules apply sequentially.

    -

    +

    Runtime views

    Runtime views iterate entities that have at least all the given components in their bags. During construction, these views look at the number of entities available for each component and pick up a reference to the smallest set of candidates in order to speed up iterations.
    They offer more or less the same functionalities of a multi type view. However, they don't expose a get member function and users should refer to the registry that generated the view to access components. In particular, a runtime view exposes utility functions to get the estimated number of entities it is going to return and to know whether it's empty or not. It's also possible to ask a runtime view if it contains a given entity.
    Refer to the inline documentation for all the details.

    Runtime views are pretty cheap to construct and should not be stored aside in any case. They should be used immediately after creation and then they should be thrown away.
    To iterate a runtime view, either use it in a range-for loop:

    -
    entt::id_type types[] = { entt::type_hash<position>::value(), entt::type_hash<velocity>::value() };
    -
    auto view = registry.runtime_view(std::cbegin(types), std::cend(types));
    +
    entt::runtime_view view{};
    +
    view.iterate(registry.storage<position>()).iterate(registry.storage<velocity>());
    for(auto entity: view) {
    // ...
    }
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    -
    entt::type_hash::value
    static constexpr id_type value()
    Returns the numeric representation of a given type.
    Definition: type_info.hpp:109
    +
    entt::basic_runtime_view
    Runtime view implementation.
    Definition: fwd.hpp:23

    Or rely on the each member function to iterate entities:

    -
    entt::id_type types[] = { entt::type_hash<position>::value(), entt::type_hash<velocity>::value() };
    -
    -
    registry.runtime_view(std::cbegin(types), std::cend(types)).each([](auto entity) {
    -
    // ...
    -
    });
    +
    entt::runtime_view{}
    +
    .iterate(registry.storage<position>())
    +
    .iterate(registry.storage<velocity>())
    +
    .each([](auto entity) {
    +
    // ...
    +
    });

    Performance are exactly the same in both cases.
    Filtering entities by components is also supported for this kind of views:

    -
    entt::id_type components[] = { entt::type_hash<position>::value() };
    -
    entt::id_type filter[] = { entt::type_hash<velocity>::value() };
    -
    auto view = registry.runtime_view(std::cbegin(components), std::cend(components), std::cbegin(filter), std::cend(filter));
    -

    Note: runtime views are meant for all those cases where users don't know at compile-time what components to use to iterate entities. If possible, don't use runtime views as their performance are inferior to those of the other views.

    -

    +
    entt::runtime_view view{};
    +
    view.iterate(registry.storage<position>()).exclude(registry.storage<velocity>());
    +

    Runtime views are meant for when users don't know at compile-time what types to use to iterate entities. The storage member function of a registry could be useful in this regard.

    +

    Groups

    Groups are meant to iterate multiple components at once and to offer a faster alternative to multi type views.
    Groups overcome the performance of the other tools available but require to get the ownership of components and this sets some constraints on pools. On the other side, groups aren't an automatism that increases memory consumption, affects functionalities and tries to optimize iterations for all the possible combinations of components. Users can decide when to pay for groups and to what extent.
    @@ -868,7 +846,7 @@ Groups

    Note that entities can also be excluded from the parameter list when received through a callback and this can improve even further the performance during iterations.
    Since they aren't explicitly instantiated, empty components aren't returned in any case.

    Note: prefer the get member function of a group instead of that of a registry during iterations to get the types iterated by the group itself.

    -

    +

    Full-owning groups

    A full-owning group is the fastest tool an user can expect to use to iterate multiple components at once. It iterates all the components directly, no indirection required. This type of groups performs more or less as if users are accessing sequentially a bunch of packed arrays of components all sorted identically, with no jumps nor branches.

    A full-owning group is created as:

    @@ -877,7 +855,7 @@ Full-owning groups
    auto group = registry.group<position, velocity>(entt::exclude<renderable>);

    Once created, the group gets the ownership of all the components specified in the template parameter list and arranges their pools as needed.

    Sorting owned components is no longer allowed once the group has been created. However, full-owning groups can be sorted by means of their sort member functions. Sorting a full-owning group affects all its instances.

    -

    +

    Partial-owning groups

    A partial-owning group works similarly to a full-owning group for the components it owns, but relies on indirection to get components owned by other groups. This isn't as fast as a full-owning group, but it's already much faster than views when there are only one or two free components to retrieve (the most common cases likely). In the worst case, it's not slower than views anyway.

    A partial-owning group is created as:

    @@ -886,7 +864,7 @@ Partial-owning groups
    auto group = registry.group<position>(entt::get<velocity>, entt::exclude<renderable>);

    Once created, the group gets the ownership of all the components specified in the template parameter list and arranges their pools as needed. The ownership of the types provided via entt::get doesn't pass to the group instead.

    Sorting owned components is no longer allowed once the group has been created. However, partial-owning groups can be sorted by means of their sort member functions. Sorting a partial-owning group affects all its instances.

    -

    +

    Non-owning groups

    Non-owning groups are usually fast enough, for sure faster than views and well suited for most of the cases. However, they require custom data structures to work properly and they increase memory consumption. As a rule of thumb, users should avoid using non-owning groups, if possible.

    A non-owning group is created as:

    @@ -895,7 +873,7 @@ Non-owning groups
    auto group = registry.group<>(entt::get<position, velocity>, entt::exclude<renderable>);

    The group doesn't receive the ownership of any type of component in this case. This type of groups is therefore the least performing in general, but also the only one that can be used in any situation to slightly improve performance.

    Non-owning groups can be sorted by means of their sort member functions. Sorting a non-owning group affects all its instances.

    -

    +

    Nested groups

    A type of component cannot be owned by two or more conflicting groups such as:

      @@ -909,7 +887,7 @@ Nested groups

    Fortunately, these are also very common cases if not the most common ones.
    It allows to increase performance on a greater number of component combinations.

    -

    Two nested groups are such that they own at least one componet type and the list of component types involved by one of them is contained entirely in that of the other. More specifically, this applies independently to all component lists used to define a group.
    +

    Two nested groups are such that they own at least one component type and the list of component types involved by one of them is contained entirely in that of the other. More specifically, this applies independently to all component lists used to define a group.
    Therefore, the rules for defining whether two or more groups are nested can be summarized as:

    • One of the groups involves one or more additional component types with respect to the other, whether they are owned, observed or excluded.
      • @@ -940,7 +918,7 @@ Nested groups In fact, given a list of component types involved by a group, the greater the number of those owned, the greater the performance of the group itself.

      As a side note, it's no longer possible to sort all groups when defining nested ones. This is because the most restrictive group shares its elements with the less restrictive ones and ordering the latter would invalidate the former.
      However, given a family of nested groups, it's still possible to sort the most restrictive of them. To prevent users from having to remember which of their groups is the most restrictive, the registry class offers the sortable member function to know if a group can be sorted or not.

      -

      +

      Types: const, non-const and all in between

      The registry class offers two overloads when it comes to constructing views and groups: a const version and a non-const one. The former accepts only const types as template parameters, the latter accepts both const and non-const types instead.
      It means that views and groups can be constructed from a const registry and they propagate the constness of the registry to the types involved. As an example:

      @@ -964,7 +942,7 @@ Types: const, non-const and all in between
      });

    A caller can still refer to the position components through a const reference because of the rules of the language that fortunately already allow it.

    The same concepts apply to groups as well.

    -

    +

    Give me everything

    Views and groups are narrow windows on the entire list of entities. They work by filtering entities according to their components.
    In some cases there may be the need to iterate all the entities still in use regardless of their components. The registry offers a specific member function to do that:

    @@ -980,7 +958,7 @@ Give me everything
    });

    In general, iterating all entities can result in poor performance. It should not be done frequently to avoid the risk of a performance hit.
    However, it can be convenient when initializing an editor or to reclaim pending identifiers.

    -

    +

    What is allowed and what is not

    Most of the ECS available out there don't allow to create and destroy entities and components during iterations, nor to have pointer stability.
    EnTT partially solves the problem with a few limitations:

    @@ -1005,9 +983,9 @@ What is allowed and what is not
  • Mark entities and components with a proper tag component that indicates they must be purged, then perform a second iteration to clean them up one by one.

    • A notable side effect of this feature is that the number of required allocations is further reduced in most cases.

    -

    +

    More performance, more constraints

    -

    Groups are a (much) faster alternative to views. However, the higher the performance, the greater the constraints on what is allowed and what is not.
    +

    Groups are a faster alternative to views. However, the higher the performance, the greater the constraints on what is allowed and what is not.
    In particular, groups add in some rare cases a limitation on the creation of components during iterations. It happens in quite particular cases. Given the nature and the scope of the groups, it isn't something in which it will happen to come across probably, but it's good to know it anyway.

    First of all, it must be said that creating components while iterating a group isn't a problem at all and can be done freely as it happens with the views. The same applies to the destruction of components and entities, for which the rules mentioned above apply.

    The additional limitation pops out instead when a given component that is owned by a group is iterated outside of it. In this case, adding components that are part of the group itself may invalidate the iterators. There are no further limitations to the destruction of components and entities.
    @@ -1018,20 +996,15 @@ More performance, more constraints

    In other words, the limitation doesn't exist as long as a type is treated as a free type (as an example with multi type views and partial- or non-owning groups) or iterated with its own group, but it can occur if the type is used as a main type to rule on an iteration.
    This happens because groups own the pools of their components and organize the data internally to maximize performance. Because of that, full consistency for owned components is guaranteed only when they are iterated as part of their groups or as free types with multi type views and groups in general.

    -

    +

    Empty type optimization

    -

    An empty type T is such that std::is_empty_v<T> returns true. They are also the same types for which empty base optimization (EBO) is possibile.
    +

    An empty type T is such that std::is_empty_v<T> returns true. They also are the same types for which empty base optimization (EBO) is possible.
    EnTT handles these types in a special way, optimizing both in terms of performance and memory usage. However, this also has consequences that are worth mentioning.

    -

    When an empty type is detected, it's not instantiated in any case. Therefore, only the entities to which it's assigned are made available.
    - There doesn't exist a way to get empty types from a registry, views and groups will never return instances for them (for example, during a call to each) and some functions such as try_get or the raw access to the list of components aren't available for empty types. Finally, the sort functionality will only accepts callbacks that require to return entities rather than components:

    -
    registry.sort<empty_type>([](const entt::entity lhs, const entt::entity rhs) {
    -
    return entt::registry::entity(lhs) < entt::registry::entity(rhs);
    -
    });
    -

    On the other hand, iterations are faster because only the entities to which the type is assigned are considered. Moreover, less memory is used, mainly because there doesn't exist any instance of the component, no matter how many entities it is assigned to.

    -

    More in general, none of the features offered by the library is affected, but for the ones that require to return actual instances.
    - This optimization can be disabled for the whole application by defining the ENTT_NO_ETO macro. In this case, empty types will be treated like all other types, no matter what.
    - Otherwise, users can specialize the component_traits template class and in particular the ignore_if_empty alias, disabling this optimization for some types only.

    -

    +

    When an empty type is detected, it's not instantiated by default. Therefore, only the entities to which it's assigned are made available. There doesn't exist a way to get empty types from a registry. Views and groups will never return their instances (for example, during a call to each).
    + On the other hand, iterations are faster because only the entities to which the type is assigned are considered. Moreover, less memory is used, mainly because there doesn't exist any instance of the component, no matter how many entities it is assigned to.

    +

    More in general, none of the feature offered by the library is affected, but for the ones that require to return actual instances.
    + This optimization is disabled by defining the ENTT_NO_ETO macro. In this case, empty types are treated like all other types. Setting a page size at component level via the component_traits class template is another way to disable this optimization selectively rather than globally.

    +

    Multithreading

    In general, the entire registry isn't thread safe as it is. Thread safety isn't something that users should want out of the box for several reasons. Just to mention one of them: performance.
    Views, groups and consequently the approach adopted by EnTT are the great exception to the rule. It's true that views, groups and iterators in general aren't thread safe by themselves. Because of this users shouldn't try to iterate a set of components and modify the same set concurrently. However:

    @@ -1044,7 +1017,7 @@ Multithreading

    Finally, EnTT can be configured via a few compile-time definitions to make some of its parts implicitly thread-safe, roughly speaking only the ones that really make sense and can't be turned around.
    In particular, when multiple instances of objects referencing the type index generator (such as the registry class) are used in different threads, then it might be useful to define ENTT_USE_ATOMIC.
    See the relevant documentation for more information.

    -

    +

    Iterators

    A special mention is needed for the iterators returned by views and groups. Most of the times they meet the requirements of random access iterators, in all cases they meet at least the requirements of forward iterators.
    In other terms, they are suitable for use with the parallel algorithms of the standard library. If it's not clear, this is a great thing.

    @@ -1057,7 +1030,7 @@ Iterators

    This can increase the throughput considerably, even without resorting to who knows what artifacts that are difficult to maintain over time.

    Unfortunately, because of the limitations of the current revision of the standard, the parallel std::for_each accepts only forward iterators. This means that the default iterators provided by the library cannot return proxy objects as references and must return actual reference types instead.
    This may change in the future and the iterators will almost certainly return both the entities and a list of references to their components by default sooner or later. Multi-pass guarantee won't break in any case and the performance should even benefit from it further.

    -

    +

    Const registry

    A const registry is also fully thread safe. This means that it won't be able to lazily initialize a missing storage when a view is generated.
    The reason for this is easy to explain. To avoid requiring types to be announced in advance, a registry lazily creates the storage objects for the different components. However, this isn't possible for a thread safe const registry.
    @@ -1066,9 +1039,9 @@ Const registry As a result, a view created from a const registry may behave incorrectly over time if it's kept for a second use.
    Therefore, if the general advice is to create views when necessary and discard them immediately afterwards, this becomes almost a rule when it comes to views generated from a const registry.

    Fortunately, there is also a way to instantiate storage classes early when in doubt or when there are special requirements.
    - Calling the prepare method is equivalent to announcing the existence of a particular storage, to avoid running into problems. For those interested, there are also alternative approaches, such as a single threaded tick for the registry warm-up, but these are not always applicable.
    + Calling the storage method is equivalent to announcing the existence of a particular storage, to avoid running into problems. For those interested, there are also alternative approaches, such as a single threaded tick for the registry warm-up, but these are not always applicable.
    In this case, no placeholders will be used since all storage exist. In other words, views never risk becoming invalid.

    -

    +

    Beyond this document

    There are many other features and functions not listed in this document.
    EnTT and in particular its ECS part is in continuous development and some things could be forgotten, others could have been omitted on purpose to reduce the size of this file. Unfortunately, some parts may even be outdated and still to be updated.

    diff --git a/md_docs_md_faq.html b/md_docs_md_faq.html index e55618000..837f83f2c 100644 --- a/md_docs_md_faq.html +++ b/md_docs_md_faq.html @@ -22,7 +22,7 @@ @@ -66,13 +66,13 @@ $(function() {
    Frequently Asked Questions
    -

    +

    Introduction

    This is a constantly updated section where I'll try to put the answers to the most frequently asked questions.
    If you don't find your answer here, there are two cases: nobody has done it yet or this section needs updating. In both cases, try to open a new issue or enter the gitter channel and ask your question. Probably someone already has an answer for you and we can then integrate this part of the documentation.

    -

    +

    FAQ

    -

    +

    Why is my debug build on Windows so slow?

    EnTT is an experimental project that I also use to keep me up-to-date with the latest revision of the language and the standard library. For this reason, it's likely that some classes you're working with are using standard containers under the hood.
    Unfortunately, it's known that the standard containers aren't particularly performing in debugging (the reasons for this go beyond this document) and are even less so on Windows apparently. Fortunately this can also be mitigated a lot, achieving good results in many cases.

    @@ -85,13 +85,13 @@ Why is my debug build on Windows so slow?

    #define ENTT_ASSERT(...) ((void)0)

    These asserts are introduced to help the users but they require to access to the underlying containers and therefore risk ruining the performance in some cases.

    With these changes, debug performance should increase enough for most cases. If you want something more, you can can also switch to an optimization level O0 or preferably O1.

    -

    +

    How can I represent hierarchies with my components?

    This is one of the first questions that anyone makes when starting to work with the entity-component-system architectural pattern.
    There are several approaches to the problem and what’s the best one depends mainly on the real problem one is facing. In all cases, how to do it doesn't strictly depend on the library in use, but the latter can certainly allow or not different techniques depending on how the data are laid out.

    I tried to describe some of the techniques that fit well with the model of EnTT. Here is the first post of a series that tries to explore the problem. More will probably come in future.
    In addition, EnTT also offers the possibility to create stable storage types and therefore have pointer stability for one, all or some components. This is by far the most convenient solution when it comes to creating hierarchies and whatnot. See the documentation for the ECS part of the library and in particular what concerns the component_traits class for further details.

    -

    +

    Custom entity identifiers: yay or nay?

    Custom entity identifiers are definitely a good idea in two cases at least:

      @@ -103,7 +103,7 @@ Custom entity identifiers: yay or nay?
      enum class entity: std::uint32_t {};
      entt::entity
      entity
      Default entity identifier.
      Definition: fwd.hpp:47

      There is no limit to the number of identifiers that can be defined.

      -

      +

      Warning C4307: integral constant overflow

      According to this issue, using a hashed string under VS could generate a warning.
      First of all, I want to reassure you: it's expected and harmless. However, it can be annoying.

      @@ -116,31 +116,35 @@ Warning C4307: integral constant overflow

    With an example of use included:

    constexpr auto identifier = HS("my/resource/identifier");

    Thanks to huwpascoe for the courtesy.

    -

    +

    Warning C4003: the min, the max and the macro

    On Windows, a header file defines two macros min and max which may result in conflicts with their counterparts in the standard library and therefore in errors during compilation.

    It's a pretty big problem but fortunately it's not a problem of EnTT and there is a fairly simple solution to it.
    It consists in defining the NOMINMAX macro before to include any other header so as to get rid of the extra definitions:

    #define NOMINMAX

    Please refer to this issue for more details.

    -

    +

    The standard and the non-copyable types

    -

    EnTT uses internally the trait std::is_copy_constructible_v to check if a component is actually copyable. This trait doesn't check if an object can actually be copied but only verifies if there is a copy constructor available.
    - This can lead to surprising results due to some idiosyncrasies of the standard mainly related to the need to guarantee backward compatibility.

    -

    For example, std::vector defines a copy constructor no matter if its value type is copyable or not. As a result, std::is_copy_constructible_v is true for the following specialization:

    +

    EnTT uses internally the trait std::is_copy_constructible_v to check if a component is actually copyable. However, this trait doesn't really check whether a type is actually copyable. Instead, it just checks that a suitable copy constructor and copy operator exist.
    + This can lead to surprising results due to some idiosyncrasies of the standard.

    +

    For example, std::vector defines a copy constructor that is conditionally enabled depending on whether the value type is copyable or not. As a result, std::is_copy_constructible_v returns true for the following specialization:

    struct type {
    std::vector<std::unique_ptr<action>> vec;
    };
    -

    When trying to assign an instance of this type to an entity in the ECS part, this may trigger a compilation error because we cannot really make a copy of it.
    - As a workaround, users can mark the type explicitly as non-copyable:

    +

    However, the copy constructor is effectively disabled upon specialization. Therefore, trying to assign an instance of this type to an entity may trigger a compilation error.
    + As a workaround, users can mark the type explicitly as non-copyable. This also suppresses the implicit generation of the move constructor and operator, which will therefore have to be defaulted accordingly:

    struct type {
    type(const type &) = delete;
    +
    type(type &&) = default;
    +
    type & operator=(const type &) = delete;
    +
    type & operator=(type &&) = default;
    std::vector<std::unique_ptr<action>> vec;
    };
    -

    Unfortunately, this will also disable aggregate initialization.

    -

    +

    Note that aggregate initialization is also disabled as a consequence.
    + Fortunately, this type of trick is quite rare. The bad news is that there is no way to deal with it at the library level, this being due to the design of the language. On the other hand, the fact that the language itself also offers a way to mitigate the problem makes it manageable.

    +

    Which functions trigger which signals

    The registry class offers three signals that are emitted following specific operations. Maybe not everyone knows what these operations are, though.
    If this isn't clear, below you can find a vademecum for this purpose:

    diff --git a/md_docs_md_lib.html b/md_docs_md_lib.html index 1d0f5a8c7..e30a88b88 100644 --- a/md_docs_md_lib.html +++ b/md_docs_md_lib.html @@ -22,7 +22,7 @@ @@ -66,11 +66,11 @@ $(function() {
    Push EnTT across boundaries
    -

    +

    Working across boundaries

    EnTT has historically had a limit when used across boundaries on Windows in general and on GNU/Linux when default visibility was set to hidden. The limitation was mainly due to a custom utility used to assign unique, sequential identifiers with different types.
    Fortunately, nowadays using EnTT across boundaries is much easier.

    -

    +

    Smooth until proven otherwise

    Many classes in EnTT make extensive use of type erasure for their purposes. This isn't a problem on itself (in fact, it's the basis of an API so convenient to use). However, a way is needed to recognize the objects whose type has been erased on the other side of a boundary.
    The type_hash class template is how identifiers are generated and thus made available to the rest of the library. In general, this class doesn't arouse much interest. The only exception is when a conflict between identifiers occurs (definitely uncommon though) or when the default solution proposed by EnTT isn't suitable for the user's purposes.
    @@ -79,7 +79,7 @@ Smooth until proven otherwise

    On the other hand, everything should run smoothly when working with plugins or shared libraries that don't export any symbols.

    For anyone who needs more details, the test suite contains multiple examples covering the most common cases (see the lib directory for all details).
    It goes without saying that it's impossible to cover all possible cases. However, what is offered should hopefully serve as a basis for all of them.

    -

    +

    Meta context

    The runtime reflection system deserves a special mention when it comes to using it across boundaries.
    Since it's linked already to a static context to which the visible components are attached and different contexts don't relate to each other, they must be shared to allow the use of meta types across boundaries.

    @@ -94,7 +94,7 @@ Meta context
    entt::meta_ctx::bind(entt::meta_ctx{});

    This is allowed because local and global contexts are separated. Therefore, it's always possible to make the local context the current one again.

    Before to release a context, all locally registered types should be reset to avoid dangling references. Otherwise, if a type is accessed from another space by name, there could be an attempt to address its parts that are no longer available.

    -

    +

    Memory Management

    There is another subtle problem due to memory management that can lead to headaches.
    It can occur where there are pools of objects (such as components or events) dynamically created on demand. This is usually not a problem when working with linked libraries that rely on the same dynamic runtime. However, it can occur in the case of plugins or statically linked runtimes.

    diff --git a/md_docs_md_links.html b/md_docs_md_links.html index 60998cb91..6cef08eeb 100644 --- a/md_docs_md_links.html +++ b/md_docs_md_links.html @@ -22,7 +22,7 @@
    @@ -73,8 +73,11 @@ $(function() {
  • Games:
  • Engines and the like:
      @@ -128,9 +133,10 @@ $(function() {
    • Electro: high performance 3D game engine with a high emphasis on rendering.
    • Kawaii: a modern data oriented game engine.
    • Becketron: a game engine written mostly in C++.
      • -
    • Spatial Engine: A cross-platform engine created on top of google's filament rendering engine.
      • +
    • Spatial Engine: a cross-platform engine created on top of google's filament rendering engine.
    • Kaguya: D3D12 Rendering Engine.
      • -
    • OpenAWE: Open implementation of the Alan Wake Engine.
      • +
    • OpenAWE: open implementation of the Alan Wake Engine.
      • +
    • Nazara Engine: fast, cross-platform, object-oriented API to help in daily developer life.
  • Articles, videos and blog posts:
      diff --git a/md_docs_md_locator.html b/md_docs_md_locator.html index 93cdfc00c..4cdb9cdb5 100644 --- a/md_docs_md_locator.html +++ b/md_docs_md_locator.html @@ -22,7 +22,7 @@
    • @@ -66,52 +66,30 @@ $(function() {
    Crash Course: service locator
    -

    +

    Introduction

    -

    Usually service locators are tightly bound to the services they expose and it's hard to define a general purpose solution. This template based implementation tries to fill the gap and to get rid of the burden of defining a different specific locator for each application.
    - This class is tiny, partially unsafe and thus risky to use. Moreover it doesn't fit probably most of the scenarios in which a service locator is required. Look at it as a small tool that can sometimes be useful if users know how to handle it.

    -

    +

    Usually service locators are tightly bound to the services they expose and it's hard to define a general purpose solution.
    + This tiny class tries to fill the gap and to get rid of the burden of defining a different specific locator for each application.

    +

    Service locator

    -

    The API is straightforward. The basic idea is that services are implemented by means of interfaces and rely on polymorphism.
    - The locator is instantiated with the base type of the service if any and a concrete implementation is provided along with all the parameters required to initialize it. As an example:

    -
    // the service has no base type, a locator is used to treat it as a kind of singleton
    -
    entt::service_locator<my_service>::set(params...);
    -
    -
    // sets up an opaque service
    -
    entt::service_locator<audio_interface>::set<audio_implementation>(params...);
    -
    -
    // resets (destroys) the service
    -
    entt::service_locator<audio_interface>::reset();
    -
    entt::service_locator
    Service locator, nothing more.
    Definition: locator.hpp:22
    -
    entt::service_locator::set
    static void set(Args &&...args)
    Sets or replaces a service.
    Definition: locator.hpp:78
    -
    entt::service_locator::reset
    static void reset()
    Resets a service.
    Definition: locator.hpp:96
    -

    The locator can also be queried to know if an active service is currently set and to retrieve it if necessary (either as a pointer or as a reference):

    -
    // no service currently set
    -
    auto empty = entt::service_locator<audio_interface>::empty();
    -
    -
    // gets a (possibly empty) shared pointer to the service ...
    -
    std::shared_ptr<audio_interface> ptr = entt::service_locator<audio_interface>::get();
    -
    -
    // ... or a reference, but it's undefined behaviour if the service isn't set yet
    -
    audio_interface &ref = entt::service_locator<audio_interface>::ref();
    -
    entt::service_locator::ref
    static Service & ref()
    Returns a weak reference to a service implementation, if any.
    Definition: locator.hpp:67
    -
    entt::service_locator::get
    static std::weak_ptr< Service > get()
    Returns a weak pointer to a service implementation, if any.
    Definition: locator.hpp:49
    -
    entt::service_locator::empty
    static bool empty()
    Tests if a valid service implementation is set.
    Definition: locator.hpp:35
    -

    A common use is to wrap the different locators in a container class, creating aliases for the various services:

    -
    struct locator {
    -
    using camera = entt::service_locator<camera_interface>;
    -
    using audio = entt::service_locator<audio_interface>;
    -
    // ...
    -
    };
    -
    -
    // ...
    -
    -
    void init() {
    -
    locator::camera::set<camera_null>();
    -
    locator::audio::set<audio_implementation>(params...);
    +

    The service locator API tries to mimic that of std::optional and adds some extra functionalities on top of it such as allocator support.
    + There are a couple of functions to set up a service, namely emplace and allocate_emplace:

    +
    entt::locator<interface>::emplace<service>(argument);
    +
    entt::locator<interface>::allocate_emplace<service>(allocator, argument);
    +
    entt::locator
    Service locator, nothing more.
    Definition: locator.hpp:27
    +

    The difference is that the latter expects an allocator as the first argument and uses it to allocate the service itself.
    + Once a service has been set up, it's retrieved using the value function:

    +
    interface &service = entt::locator<interface>::value();
    +
    entt::locator::value
    static Service & value()
    Returns a reference to a valid service, if any.
    Definition: locator.hpp:53
    +

    Since the service may not be set (and therefore this function may result in an undefined behavior), the has_value and value_or functions are also available to test a service locator and to get a fallback service in case there is none:

    +
    if(entt::locator<interface>::has_value()) {
    // ...
    }
    -
    +
    +
    interface &service = entt::locator<interface>::value_or<fallback_impl>(argument);
    +

    All arguments are used only if necessary, that is, if a service doesn't already exist and therefore the fallback service is constructed and returned. In all other cases, they are discarded.
    + Finally, to reset a service, use the reset function.

    +
    diff --git a/md_docs_md_meta.html b/md_docs_md_meta.html index 35cf2b4cd..ce7add896 100644 --- a/md_docs_md_meta.html +++ b/md_docs_md_meta.html @@ -22,7 +22,7 @@
    @@ -66,11 +66,11 @@ $(function() {
    Crash Course: runtime reflection system
    -

    +

    Introduction

    Reflection (or rather, its lack) is a trending topic in the C++ world and a tool that can unlock a lot of interesting feature in the specific case of EnTT. I looked for a third-party library that met my needs on the subject, but I always came across some details that I didn't like: macros, being intrusive, too many allocations, and so on.
    I finally decided to write a built-in, non-intrusive and macro-free runtime reflection system for EnTT. Maybe I didn't do better than others or maybe yes, time will tell me, but at least I can model this tool around the library to which it belongs and not the opposite.

    -

    +

    Names and identifiers

    The meta system doesn't force users to rely on the tools provided by the library when it comes to working with names and identifiers. It does this by offering an API that works with opaque identifiers that may or may not be generated by means of a hashed string.
    This means that users can assign any type of identifier to the meta objects, as long as they are numeric. It doesn't matter if they are generated at runtime, at compile-time or with custom functions.

    @@ -79,7 +79,7 @@ Names and identifiers

    For what it's worth, this is likely completely equivalent to:

    auto factory = entt::meta<my_type>().type(42);

    Obviously, human-readable identifiers are more convenient to use and highly recommended.

    -

    +

    Reflection in a nutshell

    Reflection always starts from real types (users cannot reflect imaginary types and it would not make much sense, we wouldn't be talking about reflection anymore).
    To create a meta node, the library provides the meta function that accepts a type to reflect as a template parameter:

    @@ -141,7 +141,7 @@ Reflection in a nutshell
    entt::meta<double>().conv<int>();

    That's all, everything users need to create meta types and enjoy the reflection system. At first glance it may not seem that much, but users usually learn to appreciate it over time.
    Also, do not forget what these few lines hide under the hood: a built-in, non-intrusive and macro-free system for reflection in C++. Features that are definitely worth the price, at least for me.

    -

    +

    Any to the rescue

    The reflection system offers a kind of extended version of the entt::any class (see the core module for more details).
    The purpose is to add some feature on top of those already present, so as to integrate it with the meta type system without having to duplicate the code.

    @@ -150,10 +150,10 @@ Any to the rescue Similar to any, this class can also be used to create aliases for unmanaged objects either with forward_as_meta or using the std::in_place_type<T &> disambiguation tag, as well as from an existing object by means of the as_ref member function. However, unlike any, meta_any treats an empty instance and one initialized with void differently:

    entt::meta_any empty{};
    entt::meta_any other{std::in_place_type<void>};
    -
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:148
    +
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:141

    While any considers both as empty, meta_any treats objects initialized with void as if they were valid ones. This allows to differentiate between failed function calls and function calls that are successful but return nothing.
    Finally, the member functions try_cast, cast and allow_cast are used to cast the underlying object to a given type (either a reference or a value type) or to convert a meta_any in such a way that a cast becomes viable for the resulting object. There is in fact no any_cast equivalent for meta_any.

    -

    +

    Enjoy the runtime

    Once the web of reflected types has been constructed, it's a matter of using it at runtime where required.
    All this has the great merit that the reflection system stands in fact as a non-intrusive tool for the runtime, unlike the vast majority of the things offered by this library and closely linked to the compile-time.

    @@ -205,7 +205,7 @@ Enjoy the runtime Similarly, conversion functions aren't directly accessible. They are used internally by meta_any and the meta objects when needed.

    Meta types and meta objects in general contain much more than what is said: a plethora of functions in addition to those listed whose purposes and uses go unfortunately beyond the scope of this document.
    I invite anyone interested in the subject to look at the code, experiment and read the inline documentation to get the best out of this powerful tool.

    -

    +

    Container support

    The runtime reflection system also supports containers of all types.
    Moreover, containers doesn't necessarily mean those offered by the C++ standard library. In fact, user defined data structures can also work with the meta system in many cases.

    @@ -228,8 +228,8 @@ Container support
    }
    }
    entt::basic_any::type
    const type_info & type() const
    Returns the object type if any, type_id<void>() otherwise.
    Definition: any.hpp:254
    -
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:16
    -
    entt::forward_as_meta
    meta_any forward_as_meta(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: meta.hpp:629
    +
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:17
    +
    entt::forward_as_meta
    meta_any forward_as_meta(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: meta.hpp:600

    The method to use to get a proxy object for associative containers is as_associative_container instead.
    It goes without saying that it's not necessary to perform a double check. Instead, it's sufficient to query the meta type or verify that the proxy object is valid. In fact, proxies are contextually convertible to bool to know if they are valid. For example, invalid proxies are returned when the wrapped object isn't a container.
    In all cases, users aren't expected to reflect containers explicitly. It's sufficient to assign a container for which a specialization of the traits classes exists to a meta_any object to be able to get its proxy object.

    @@ -241,7 +241,7 @@ Container support
    const auto size = view.size();
    entt::view
    basic_view< entity, Get, Exclude > view
    Alias declaration for the most common use case.
    Definition: fwd.hpp:103
      -
    • The resize member function allows to resize the wrapped container and returns true in case of succes:
      • +
    • The resize member function allows to resize the wrapped container and returns true in case of success:
    const bool ok = view.resize(3u);

    For example, it's not possible to resize fixed size containers.

    @@ -322,7 +322,7 @@ Container support
    entt::meta_any value = view[42];

    The function returns instances of meta_any that directly refer to the actual elements. Modifying the returned object will then directly modify the element inside the container.

    Container support is minimal but likely sufficient to satisfy all needs.

    -

    +

    Pointer-like types

    As with containers, it's also possible to communicate to the meta system which types to consider pointers. This will allow to dereference instances of meta_any, thus obtaining light references to the pointed objects that are also correctly associated with their meta types.
    To make the meta system recognize a type as pointer-like, users can specialize the is_meta_pointer_like class. EnTT already exports the specializations for some common classes. In particular:

    @@ -366,7 +366,7 @@ Pointer-like types
    entt::adl_meta_pointer_like
    Fake ADL based lookup function for meta pointer-like types.
    Definition: adl_pointer.hpp:22
    entt::adl_meta_pointer_like::dereference
    static decltype(auto) dereference(const Type &value)
    Uses the default ADL based lookup method to resolve the call.
    Definition: adl_pointer.hpp:28

    In all other cases, that is, when dereferencing a pointer works as expected and regardless of the pointed type, no user intervention is required.

    -

    +

    Template information

    Meta types also provide a minimal set of information about the nature of the original type in case it's a class template.
    By default, this works out of the box and requires no user action. However, it's important to include the header file template.hpp to make these information available to the compiler when needed.

    @@ -382,7 +382,7 @@ Template information
    // meta type of the i-th argument
    auto arg_type = type.template_arg(0u);
    }
    -
    entt::meta_type::is_template_specialization
    bool is_template_specialization() const
    Checks whether a type refers to a recognized class template specialization or not.
    Definition: meta.hpp:1135
    +
    entt::meta_type::is_template_specialization
    bool is_template_specialization() const
    Checks whether a type refers to a recognized class template specialization or not.
    Definition: meta.hpp:1104

    Typically, when template information for a type are required, what the library provides is sufficient. However, there are some cases where a user may want more details or a different set of information.
    Consider the case of a class template that is meant to wrap function types:

    template<typename>
    @@ -400,7 +400,7 @@ Template information
    entt::meta_template_traits
    Traits class template to be specialized to enable support for meta template information.
    Definition: type_traits.hpp:14

    The reflection system doesn't verify the accuracy of the information nor infer a correspondence between real types and meta types.
    Therefore, the specialization will be used as is and the information it contains will be associated with the appropriate type when required.

    -

    +

    Automatic conversions

    In C++, there are a number of conversions allowed between arithmetic types that make it convenient to work with this kind of data.
    If this were to be translated into explicit registrations with the reflection system, it would result in a long series of instructions such as the following:

    @@ -422,10 +422,10 @@ Automatic conversions
    entt::meta_any any{my_enum::a_value};
    any.allow_cast(type);
    int value = any.cast<int>();
    -
    entt::meta_type
    Opaque wrapper for types.
    Definition: meta.hpp:980
    +
    entt::meta_type
    Opaque wrapper for types.
    Definition: meta.hpp:949

    This should make working with arithmetic types and scoped or unscoped enums as easy as it is in C++.
    It's also worth noting that it's still possible to set up conversion functions manually and these will always be preferred over the automatic ones.

    -

    +

    Implicitly generated default constructor

    In many cases, it's useful to be able to create objects of default constructible types through the reflection system, while not having to explicitly register the meta type or the default constructor.
    For example, in the case of primitive types like int or char, but not just them.

    @@ -434,7 +434,7 @@ Implicitly generated default constructor
    entt::resolve<int>().construct();

    Where the meta type can be for example the one returned from a meta container, useful for building keys without knowing or having to register the actual types.

    In all cases, when users register default constructors, they are preferred both during searches and when the construct member function is invoked.

    -

    +

    Policies: the more, the less

    Policies are a kind of compile-time directives that can be used when registering reflection information.
    Their purpose is to require slightly different behavior than the default in some specific cases. For example, when reading a given data member, its value is returned wrapped in a meta_any object which, by default, makes a copy of it. For large objects or if the caller wants to access the original instance, this behavior isn't desirable. Policies are there to offer a solution to this and other problems.

    @@ -458,7 +458,7 @@ Policies: the more, the less

    These policies work with constructors (for example, when objects are taken from an external container rather than created on demand), data members and functions in general.
    If on the one hand as_cref_t always forces the return type to be const, as_ref_t adapts to the constness of the passed object and to that of the return type if any.

    Some uses are rather trivial, but it's useful to note that there are some less obvious corner cases that can in turn be solved with the use of policies.

    -

    +

    Named constants and enums

    A special mention should be made for constant values and enums. It wouldn't be necessary, but it will help distracted readers.

    As mentioned, the data member function can be used to reflect constants of any type among the other things.
    @@ -475,7 +475,7 @@ Named constants and enums

    auto value = entt::resolve<my_enum>().data("a_value"_hs).get({}).cast<my_enum>();
    auto max = entt::resolve<int>().data("max_int"_hs).get({}).cast<int>();

    As a side note, remember that all this happens behind the scenes without any allocation because of the small object optimization performed by the meta_any class.

    -

    +

    Properties and meta objects

    Sometimes (for example, when it comes to creating an editor) it might be useful to attach properties to the meta objects created. Fortunately, this is possible for most of them.
    For the meta objects that support properties, the member functions of the factory used for registering them will return a decorated version of the factory itself. The latter can be used to attach properties to the last created meta object.
    @@ -512,14 +512,14 @@ Properties and meta objects

    // search for a given property by name
    auto prop = entt::resolve<my_type>().prop("tooltip"_hs);

    Meta properties are objects having a fairly poor interface, all in all. They only provide the key and the value member functions to be used to retrieve the key and the value contained in the form of meta_any objects, respectively.

    -

    +

    Unregister types

    A type registered with the reflection system can also be unregistered. This means unregistering all its data members, member functions, conversion functions and so on. However, base classes aren't unregistered as well, since they don't necessarily depend on it. Similarly, implicitly generated types (as an example, the meta types implicitly generated for function parameters when needed) aren't unregistered.
    Roughly speaking, unregistering a type means disconnecting all associated meta objects from it and making its identifier no longer visible. The underlying node will remain available though, as if it were implicitly generated:

    entt::meta_reset<my_type>();

    It's also possible to reset types by their unique identifiers if required:

    entt::meta_reset("my_type"_hs);
    -
    entt::meta_reset
    void meta_reset(const id_type id)
    Resets a type and all its parts.
    Definition: factory.hpp:599
    +
    entt::meta_reset
    void meta_reset(const id_type id)
    Resets a type and all its parts.
    Definition: factory.hpp:597

    Finally, there exists a non-template overload of the meta_reset function that doesn't accept argument and resets all searchable types (that is, all types that were assigned an unique identifier):

    entt::meta_reset();

    All types can be re-registered later with a completely different name and form.

    diff --git a/md_docs_md_poly.html b/md_docs_md_poly.html index 8b2fa58dc..dadf9ef5b 100644 --- a/md_docs_md_poly.html +++ b/md_docs_md_poly.html @@ -22,7 +22,7 @@     @@ -66,16 +66,16 @@ $(function() {
    Crash Course: poly
    -

    +

    Introduction

    Static polymorphism is a very powerful tool in C++, albeit sometimes cumbersome to obtain.
    This module aims to make it simple and easy to use.

    -

    The library allows to define concepts as interfaces to fullfill with concrete classes withouth having to inherit from a common base.
    +

    The library allows to define concepts as interfaces to fulfill with concrete classes without having to inherit from a common base.
    This is, among others, one of the advantages of static polymorphism in general and of a generic wrapper like that offered by the poly class template in particular.
    What users get is an object that can be passed around as such and not through a reference or a pointer, as happens when it comes to working with dynamic polymorphism.

    Since the poly class template makes use of entt::any internally, it also supports most of its feature. Among the most important, the possibility to create aliases to existing and thus unmanaged objects. This allows users to exploit the static polymorphism while maintaining ownership of objects.
    Likewise, the poly class template also benefits from the small buffer optimization offered by the entt::any class and therefore minimizes the number of allocations, avoiding them altogether where possible.

    -

    +

    Other libraries

    There are some very interesting libraries regarding static polymorphism.
    Among all, the two that I prefer are:

    @@ -86,13 +86,13 @@ Other libraries

    The former is admittedly an experimental library, with many interesting ideas. I've some doubts about the usefulness of some feature in real world projects, but perhaps my lack of experience comes into play here. In my opinion, its only flaw is the API which I find slightly more cumbersome than other solutions.
    The latter was undoubtedly a source of inspiration for this module, although I opted for different choices in the implementation of both the final API and some feature.

    Either way, the authors are gurus of the C++ community, people I only have to learn from.

    -

    +

    Concept and implementation

    The first thing to do to create a type-erasing polymorphic object wrapper (to use the terminology introduced by Eric Niebler) is to define a concept that types will have to adhere to.
    For this purpose, the library offers a single class that supports both deduced and fully defined interfaces. Although having interfaces deduced automatically is convenient and allows users to write less code in most cases, this has some limitations and it's therefore useful to be able to get around the deduction by providing a custom definition for the static virtual table.

    -

    Once the interface is defined, it will be sufficient to provide a generic implementation to fullfill the concept.
    +

    Once the interface is defined, it will be sufficient to provide a generic implementation to fulfill the concept.
    Also in this case, the library allows customizations based on types or families of types, so as to be able to go beyond the generic case where necessary.

    -

    +

    Deduced interface

    This is how a concept with a deduced interface is introduced:

    struct Drawable: entt::type_list<> {
    @@ -105,7 +105,7 @@ Deduced interface
    };
    entt::type_list
    A class to use to push around lists of types, nothing more.
    Definition: type_traits.hpp:110

    It's recognizable by the fact that it inherits from an empty type list.
    - Functions can also be const, accept any number of paramters and return a type other than void:

    + Functions can also be const, accept any number of parameters and return a type other than void:

    struct Drawable: entt::type_list<> {
    template<typename Base>
    struct type: Base {
    @@ -126,7 +126,7 @@ Deduced interface
    };

    Once the concept is defined, users must provide a generic implementation of it in order to tell the system how any type can satisfy its requirements. This is done via an alias template within the concept itself.
    The index passed as a template parameter to either invoke or poly_call refers to how this alias is defined.

    -

    +

    Defined interface

    A fully defined concept is no different to one for which the interface is deduced, with the only difference that the list of types is not empty this time:

    struct Drawable: entt::type_list<void()> {
    @@ -157,8 +157,8 @@ Defined interface

    In other words, it's not possible to make use of functions not belonging to the interface, even if they are present in the types that fulfill the concept.
    Similarly, it's not possible to deduce a function in the static virtual table with a function type different from that of the associated member function in the interface itself.

    Explicitly defining a static virtual table suppresses the deduction step and allows maximum flexibility when providing the implementation for a concept.

    -

    -Fullfill a concept

    +

    +Fulfill a concept

    The impl alias template of a concept is used to define how it's fulfilled:

    struct Drawable: entt::type_list<> {
    // ...
    @@ -168,7 +168,7 @@ Fullfill a concept
    };
    entt::value_list
    A class to use to push around lists of constant values, nothing more.
    Definition: type_traits.hpp:285

    In this case, it's stated that the draw method of a generic type will be enough to satisfy the requirements of the Drawable concept.
    - Both member functions and free functions are supported to fullfill concepts:

    + Both member functions and free functions are supported to fulfill concepts:

    template<typename Type>
    void print(Type &self) { self.print(); }
    @@ -181,7 +181,7 @@ Fullfill a concept

    Likewise, as long as the parameter types and return type support conversions to and from those of the function type referenced in the static virtual table, the actual implementation may differ in its function type since it's erased internally.
    Moreover, the self parameter isn't strictly required by the system and can be left out for free functions if not required.

    Refer to the inline documentation for more details.

    -

    +

    Inheritance

    Concept inheritance is straightforward due to how poly looks like in EnTT. Therefore, it's quite easy to build hierarchies of concepts if necessary.
    The only constraint is that all concepts in a hierarchy must belong to the same family, that is, they must be either all deduced or all defined.

    @@ -217,7 +217,7 @@ Inheritance
    entt::type_list_cat_t
    typename type_list_cat< List... >::type type_list_cat_t
    Helper type.
    Definition: type_traits.hpp:199

    Similar to above, type_list_cat_t is used to concatenate the underlying static virtual table with the new function types.
    Everything else is the same as already shown instead.

    -

    +

    Static polymorphism in the wild

    Once the concept and implementation have been introduced, it will be possible to use the poly class template to contain instances that meet the requirements:

    using drawable = entt::poly<Drawable>;
    @@ -237,7 +237,7 @@ Static polymorphism in the wild
    instance = square{};
    instance->draw();
    -
    entt::basic_poly
    Static polymorphism made simple and within everyone's reach.
    Definition: poly.hpp:192
    +
    entt::basic_poly
    Static polymorphism made simple and within everyone's reach.
    Definition: poly.hpp:193

    The poly class template offers a wide range of constructors, from the default one (which will return an uninitialized poly object) to the copy and move constructors, as well as the ability to create objects in-place.
    Among others, there is also a constructor that allows users to wrap unmanaged objects in a poly instance (either const or non-const ones):

    circle shape;
    @@ -247,7 +247,7 @@ Static polymorphism in the wild

    In both cases, although the interface of the poly object doesn't change, it won't construct any element or take care of destroying the referenced objects.

    Note also how the underlying concept is accessed via a call to operator-> and not directly as instance.draw().
    This allows users to decouple the API of the wrapper from that of the concept. Therefore, where instance.data() will invoke the data member function of the poly object, instance->data() will map directly to the functionality exposed by the underlying concept.

    -

    +

    Storage size and alignment requirement

    Under the hood, the poly class template makes use of entt::any. Therefore, it can take advantage of the possibility of defining at compile-time the size of the storage suitable for the small buffer optimization as well as the alignment requirements:

    entt::basic_poly<Drawable, sizeof(double[4]), alignof(double[4])>
    diff --git a/md_docs_md_process.html b/md_docs_md_process.html index 4c35868db..a487e4a05 100644 --- a/md_docs_md_process.html +++ b/md_docs_md_process.html @@ -22,7 +22,7 @@
    @@ -66,11 +66,11 @@ $(function() {
    Crash Course: cooperative scheduler
    -

    +

    Introduction

    Sometimes processes are a useful tool to work around the strict definition of a system and introduce logic in a different way, usually without resorting to the introduction of other components.

    EnTT offers a minimal support to this paradigm by introducing a few classes that users can use to define and execute cooperative processes.

    -

    +

    The process

    A typical process must inherit from the process class template that stays true to the CRTP idiom. Moreover, derived classes must specify what's the intended type for elapsed times.

    A process should expose publicly the following member functions whether needed (note that it isn't required to define a function unless the derived class wants to override the default behavior):

    @@ -115,7 +115,7 @@ The process

    };
    entt::process
    Base class for processes.
    Definition: process.hpp:71
    entt::process::succeed
    void succeed()
    Terminates a process with success if it's still alive.
    Definition: process.hpp:122
    -

    +

    Adaptor

    Lambdas and functors can't be used directly with a scheduler for they are not properly defined processes with managed life cycles.
    This class helps in filling the gap and turning lambdas and functors into full featured processes usable by a scheduler.

    @@ -130,14 +130,14 @@ Adaptor

    Both succeed and fail accept no parameters at all.

    Note that usually users shouldn't worry about creating adaptors at all. A scheduler creates them internally each and every time a lambda or a functor is used as a process.

    -

    +

    The scheduler

    A cooperative scheduler runs different processes and helps managing their life cycles.

    Each process is invoked once per tick. If it terminates, it's removed automatically from the scheduler and it's never invoked again. Otherwise it's a good candidate to run one more time the next tick.
    A process can also have a child. In this case, the parent process is replaced with its child when it terminates and only if it returns with success. In case of errors, both the parent process and its child are discarded. This way, it's easy to create chain of processes to run sequentially.

    Using a scheduler is straightforward. To create it, users must provide only the type for the elapsed times and no arguments at all:

    entt::scheduler<std::uint32_t> scheduler;
    -
    entt::scheduler
    Cooperative scheduler for processes.
    Definition: scheduler.hpp:41
    +
    entt::scheduler
    Cooperative scheduler for processes.
    Definition: scheduler.hpp:42

    It has member functions to query its internal data structures, like empty or size, as well as a clear utility to reset it to a clean state:

    // checks if there are processes still running
    const auto empty = scheduler.empty();
    @@ -147,16 +147,16 @@ The scheduler
    // resets the scheduler to its initial state and discards all the processes
    scheduler.clear();
    -
    entt::scheduler::size
    size_type size() const
    Number of processes currently scheduled.
    Definition: scheduler.hpp:123
    -
    entt::scheduler::clear
    void clear()
    Discards all scheduled processes.
    Definition: scheduler.hpp:141
    -
    entt::scheduler::empty
    bool empty() const
    Returns true if at least a process is currently scheduled.
    Definition: scheduler.hpp:131
    -
    entt::scheduler::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: scheduler.hpp:108
    +
    entt::scheduler::size
    size_type size() const
    Number of processes currently scheduled.
    Definition: scheduler.hpp:124
    +
    entt::scheduler::clear
    void clear()
    Discards all scheduled processes.
    Definition: scheduler.hpp:142
    +
    entt::scheduler::empty
    bool empty() const
    Returns true if at least a process is currently scheduled.
    Definition: scheduler.hpp:132
    +
    entt::scheduler::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: scheduler.hpp:109

    To attach a process to a scheduler there are mainly two ways:

    • If the process inherits from the process class template, it's enough to indicate its type and submit all the parameters required to construct it to the attach member function:
    scheduler.attach<my_process>(1000u);
    -
    entt::scheduler::attach
    auto attach(Args &&...args)
    Schedules a process for the next tick.
    Definition: scheduler.hpp:171
    +
    entt::scheduler::attach
    auto attach(Args &&...args)
    Schedules a process for the next tick.
    Definition: scheduler.hpp:172
    • Otherwise, in case of a lambda or a functor, it's enough to provide an instance of the class to the attach member function:
    diff --git a/md_docs_md_reference.html b/md_docs_md_reference.html index fc36c7184..ea88a8ce8 100644 --- a/md_docs_md_reference.html +++ b/md_docs_md_reference.html @@ -22,7 +22,7 @@     @@ -84,6 +84,7 @@ $(function() {
  • decs: a chunk based archetype ECS.
  • ecst: a multithreaded compile-time ECS that uses sparse sets to keep track of entities in systems.
  • EntityX: a bitset based ECS that uses a single large matrix of components indexed with entities.
    • +
  • Gaia-ECS: a chunk based archetype ECS.
  • Polypropylene: a hybrid solution between an ECS and dynamic mixins.
    • @@ -113,6 +114,7 @@ $(function() {
  • Rust:
    • Legion: a chunk based archetype ECS.
    • Shipyard: it borrows some ideas from EnTT and offers a sparse sets based ECS with grouping functionalities.
      • +
    • Sparsey: sparse set based ECS written in Rust.
    • Specs: a parallel ECS based mainly on hierarchical bitsets that allows different types of storage as needed.
    • diff --git a/md_docs_md_resource.html b/md_docs_md_resource.html index 12be92297..77c4e53ab 100644 --- a/md_docs_md_resource.html +++ b/md_docs_md_resource.html @@ -22,7 +22,7 @@     @@ -66,109 +66,102 @@ $(function() {
    Crash Course: resource management
    -

    +

    Introduction

    Resource management is usually one of the most critical part of a software like a game. Solutions are often tuned to the particular application. There exist several approaches and all of them are perfectly fine as long as they fit the requirements of the piece of software in which they are used.
    Examples are loading everything on start, loading on request, predictive loading, and so on.

    -

    EnTT doesn't pretend to offer a one-fits-all solution for the different cases. Instead, it offers a minimal and perhaps trivial cache that can be useful most of the time during prototyping and sometimes even in a production environments.
    - For those interested in the subject, the plan is to improve it considerably over time in terms of performance, memory usage and functionalities. Hoping to make it, of course, one step at a time.

    -

    +

    EnTT doesn't pretend to offer a one-fits-all solution for the different cases.
    + Instead, the library offers a minimal, general purpose resource cache that might be useful in many cases.

    +

    The resource, the loader and the cache

    -

    There are three main actors in the model: the resource, the loader and the cache.

    -

    The resource is whatever users want it to be. An image, a video, an audio, whatever. There are no limits.
    - As a minimal example:

    +

    Resource, loader and cache are the three main actors for the purpose.
    + The resource is an image, an audio, a video or any other type:

    struct my_resource { const int value; };
    -

    A loader is a class the aim of which is to load a specific resource. It has to inherit directly from a dedicated base class as in the following example:

    -
    struct my_loader final: entt::resource_loader<my_loader, my_resource> {
    -
    // ...
    -
    };
    -
    entt::resource_loader
    Base class for resource loaders.
    Definition: loader.hpp:42
    -

    Where my_resource is the type of resources it creates.
    - A resource loader must also expose a public const member function named load that accepts a variable number of arguments and returns a shared pointer to a resource.
    - As an example:

    -
    struct my_loader: entt::resource_loader<my_loader, my_resource> {
    -
    std::shared_ptr<my_resource> load(int value) const {
    +

    The loader is a callable type the aim of which is to load a specific resource:

    +
    struct my_loader final {
    +
    using result_type = std::shared_ptr<my_resource>;
    +
    +
    result_type operator()(int value) const {
    // ...
    -
    return std::shared_ptr<my_resource>(new my_resource{ value });
    +
    return std::make_shared<my_resource>(value);
    }
    };
    -

    In general, resource loaders should not have a state or retain data of any type. They should let the cache manage their resources instead.
    - As a side note, base class and CRTP idiom aren't strictly required with the current implementation. One could argue that a cache can easily work with loaders of any type. However, future changes won't be breaking ones by forcing the use of a base class today and that's why the model is already in its place.

    -

    Finally, a cache is a specialization of a class template tailored to a specific resource:

    -
    using my_cache = entt::resource_cache<my_resource>;
    +

    Its function operator can accept any arguments and should return a value of the declared result type (std::shared_ptr<my_resource> in the example).
    + A loader can also overload its function call operator to make it possible to construct the same or another resource from different lists of arguments.

    +

    Finally, a cache is a specialization of a class template tailored to a specific resource and (optionally) a loader:

    +
    using my_cache = entt::resource_cache<my_resource, my_loader>;
    // ...
    my_cache cache{};
    -
    entt::resource_cache
    Simple cache for resources of a given type.
    Definition: cache.hpp:27
    -

    The idea is to create different caches for different types of resources and to manage each one independently in the most appropriate way.
    - As a (very) trivial example, audio tracks can survive in most of the scenes of an application while meshes can be associated with a single scene and then discarded when users leave it.

    -

    A cache offers a set of basic functionalities to query its internal state and to organize it:

    -
    // gets the number of resources managed by a cache
    -
    const auto size = cache.size();
    +
    entt::resource_cache
    Basic cache for resources of any type.
    Definition: cache.hpp:161
    +

    The cache is meant to be used to create different caches for different types of resources and to manage each one independently in the most appropriate way.
    + As a (very) trivial example, audio tracks can survive in most of the scenes of an application while meshes can be associated with a single scene only, then discarded when a player leaves it.

    +

    +Resource handle

    +

    Resources aren't returned directly to the caller. Instead, they are wrapped in a resource handle identified by the entt::resource class template.
    + For those who know the flyweight design pattern already, that's exactly what it is. To all others, this is the time to brush up on some notions instead.

    +

    A shared pointer could have been used as a resource handle. In fact, the default handle mostly maps the interface of its standard counterpart and only adds a few things to it.
    + However, the handle in EnTT is designed as a standalone class template named resource. It boils down to the fact that specializing a class in the standard is often undefined behavior while having the ability to specialize the handle for one, more or all resource types could help over time.

    +

    +Loaders

    +

    A loader is a class that is responsible for loading the resources.
    + By default, it's just a callable object which forwards its arguments to the resource itself. That is, a passthrough type. All the work is demanded to the constructor(s) of the resource itself.
    + Loaders also are fully customizable as expected.

    +

    A custom loader is a class with at least one function call operator and a member type named result_type.
    + The loader isn't required to return a resource handle. As long as return_type is suitable for constructing a handle, that's fine.

    +

    When using the default handle, it expects a resource type which is convertible to or suitable for constructing an std::shared_ptr<Type> (where Type is the actual resource type).
    + In other terms, the loader should return shared pointers to the given resource type. However, it isn't mandatory. Users can easily get around this constraint by specializing both the handle and the loader.

    +

    A cache forwards all its arguments to the loader if required. This means that loaders can also support tag dispatching to offer different loading policies:

    +
    struct my_loader {
    +
    using result_type = std::shared_ptr<my_resource>;
    -
    // checks if a cache contains at least a valid resource
    -
    const auto empty = cache.empty();
    +
    struct from_disk_tag{};
    +
    struct from_network_tag{};
    -
    // clears a cache and discards its content
    -
    cache.clear();
    -

    Besides these member functions, a cache contains what is needed to load, use and discard resources of the given type.
    - Before exploring this part of the interface, it makes sense to mention how resources are identified. They have type id_type and therefore they can be created explicitly as in the following example:

    -
    constexpr auto identifier = "my/resource/identifier"_hs;
    -
    // this is equivalent to the following
    -
    constexpr entt::id_type hs = entt::hashed_string{"my/resource/identifier"};
    -
    entt::basic_hashed_string
    Zero overhead unique identifier.
    Definition: hashed_string.hpp:58
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    -

    The class hashed_string is described in a dedicated section, so I won't go in details here.

    -

    Resources are loaded and thus stored in a cache through the load member function. It accepts the loader to use as a template parameter, the resource identifier and the parameters used to construct the resource as arguments:

    -
    // uses the identifier declared above
    -
    cache.load<my_loader>(identifier, 0);
    +
    template<typename Args>
    +
    result_type operator()(from_disk_tag, Args&&... args) {
    +
    // ...
    +
    return std::make_shared<my_resource>(std::forward<Args>(args)...);
    +
    }
    -
    // uses a hashed string directly
    -
    cache.load<my_loader>("another/identifier"_hs, 42);
    -

    The function returns a handle to the resource, whether it already exists or is loaded. In case the loader returns an invalid pointer, the handle is invalid as well and therefore it can be easily used with an if statement:

    -
    if(entt::resource_handle handle = cache.load<my_loader>("another/identifier"_hs, 42); handle) {
    +
    template<typename Args>
    +
    result_type operator()(from_network_tag, Args&&... args) {
    +
    // ...
    +
    return std::make_shared<my_resource>(std::forward<Args>(args)...);
    +
    }
    +
    }
    +

    This makes the whole loading logic quite flexible and easy to extend over time.

    +

    +The cache class

    +

    The cache is the class that is asked to connect the dots.
    + It loads the resources, store them aside and returns handles as needed:

    +
    entt::resource_cache<my_resource, my_loader> cache{};
    +

    Under the hood, a cache is nothing more than a map where the key value has type entt::id_type while the mapped value is whatever type its loader returns.
    + For this reason, it offers most of the functionality a user would expect from a map, such as empty or size and so on. Similarly, it's an iterable type that also supports indexing by resource id:

    +
    for(entt::resource<my_resource> curr: cache) {
    // ...
    }
    -
    entt::resource_handle
    Shared resource handle.
    Definition: handle.hpp:25
    -

    Before trying to load a resource, the contains member function can be used to know if a cache already contains a specific resource:

    -
    auto exists = cache.contains("my/identifier"_hs);
    -

    There exists also a member function to use to force a reload of an already existing resource if needed:

    -
    auto handle = cache.reload<my_loader>("another/identifier"_hs, 42);
    -
    entt::handle
    basic_handle< entity > handle
    Alias declaration for the most common use case.
    Definition: fwd.hpp:69
    -

    As above, the function returns a handle to the resource that is invalid in case of errors. The reload member function is a kind of alias of the following snippet:

    -
    cache.discard(identifier);
    -
    cache.load<my_loader>(identifier, 42);
    -

    Where the discard member function is used to get rid of a resource if loaded. In case the cache doesn't contain a resource for the given identifier, discard does nothing and returns immediately.

    -

    So far, so good. Resources are finally loaded and stored within the cache.
    - They are returned to users in the form of handles. To get one of them later on:

    -
    auto handle = cache.handle("my/identifier"_hs);
    -

    The idea behind a handle is the same of the flyweight pattern. In other terms, resources aren't copied around. Instead, instances are shared between handles. Users of a resource own a handle that guarantees that a resource isn't destroyed until all the handles are destroyed, even if the resource itself is removed from the cache.
    - Handles are tiny objects both movable and copyable. They return the contained resource as a (possibly const) reference on request:

    -
      -
    • By means of the get member function:
      • -
    -
    auto &resource = handle.get();
    -
      -
    • Using the proper cast operator:
      • -
    -
    auto &resource = handle;
    -
      -
    • Through the dereference operator:
      • -
    -
    auto &resource = *handle;
    -

    The resource can also be accessed directly using the arrow operator if required:

    -
    auto value = handle->value;
    -

    To test if a handle is still valid, the cast operator to bool allows users to use it in a guard:

    -
    if(handle) {
    +
    +
    if(entt::resource<my_resource> res = cache["resource/id"_hs]; res) {
    // ...
    }
    -

    Finally, in case there is the need to load a resource and thus to get a handle without storing the resource itself in the cache, users can rely on the temp member function template.
    - The declaration is similar to that of load, a (possibly invalid) handle for the resource is returned also in this case:

    -
    if(auto handle = cache.temp<my_loader>(42); handle) {
    -
    // ...
    -
    }
    -

    Do not forget to test the handle for validity. Otherwise, getting a reference to the resource it points may result in undefined behavior.

    +
    entt::resource
    Basic resource handle.
    Definition: resource.hpp:23
    +

    Please, refer to the inline documentation for all the details about the other functions (for example contains or erase).

    +

    Set aside the part of the API that this class shares with a map, it also adds something on top of it in order to address the most common requirements of a resource cache.
    + In particular, it doesn't have an emplace member function which is replaced by load and force_load instead (where the former loads a new resource only if not present while the second triggers a forced loading in any case):

    +
    auto ret = cache.load("resource/id"_hs);
    +
    +
    // true only if the resource was not already present
    +
    const bool loaded = ret.second;
    +
    +
    // takes the resource handle pointed to by the returned iterator
    +
    entt::resource<my_resource> res = *ret.first;
    +

    Note that the hashed string is used for convenience in the example above.
    + Resource identifiers are nothing more than integral values. Therefore, plain numbers as well as non-class enum value are accepted.

    +

    Moreover, it's worth mentioning that both the iterators of a cache and its indexing operators return resource handles rather than instances of the mapped type.
    + Since the cache has no control over the loader and a resource isn't required to also be convertible to bool, these handles can be invalid. This usually means an error in the user logic but it may also be an expected event.
    + It's therefore recommended to verify handles validity with a check in debug (for example, when loading) or an appropriate logic in retail.

    diff --git a/md_docs_md_signal.html b/md_docs_md_signal.html index a1506f893..e3ccd79d5 100644 --- a/md_docs_md_signal.html +++ b/md_docs_md_signal.html @@ -22,7 +22,7 @@     @@ -66,20 +66,20 @@ $(function() {
    Crash Course: events, signals and everything in between
    -

    +

    Introduction

    Signals are usually a core part of games and software architectures in general.
    Roughly speaking, they help to decouple the various parts of a system while allowing them to communicate with each other somehow.

    The so called modern C++ comes with a tool that can be useful in these terms, the std::function. As an example, it can be used to create delegates.
    However, there is no guarantee that an std::function does not perform allocations under the hood and this could be problematic sometimes. Furthermore, it solves a problem but may not adapt well to other requirements that may arise from time to time.

    In case that the flexibility and power of an std::function isn't required or if the price to pay for them is too high,EnTT offers a complete set of lightweight classes to solve the same and many other problems.

    -

    +

    Delegate

    A delegate can be used as a general purpose invoker with no memory overhead for free functions and members provided along with an instance on which to invoke them.
    It doesn't claim to be a drop-in replacement for an std::function, so don't expect to use it whenever an std::function fits well. That said, it's most likely even a better fit than an std::function in a lot of cases, so expect to use it quite a lot anyway.

    The interface is trivial. It offers a default constructor to create empty delegates:

    entt::delegate<int(int)> delegate{};
    -
    entt::delegate
    Basic delegate implementation.
    Definition: delegate.hpp:66
    +
    entt::delegate
    Basic delegate implementation.
    Definition: delegate.hpp:67
    entt::delegate
    delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>
    Deduction guide.

    All what is needed to create an instance is to specify the type of the function the delegate will contain, that is the signature of the free function or the member one wants to assign to it.

    Attempting to use an empty delegate by invoking its function call operator results in undefined behavior or most likely a crash. Before to use a delegate, it must be initialized.
    @@ -129,7 +129,7 @@ Delegate

    delegate(instance, 42);

    In this case, it's not possible to deduce the function type since the first argument doesn't necessarily have to be a reference (for example, it can be a pointer, as well as a const reference).
    Therefore, the function type must be declared explicitly for unbound members.

    -

    +

    Runtime arguments

    The delegate class is meant to be used primarily with template arguments. However, as a consequence of its design, it can also offer minimal support for runtime arguments.
    When used in this modality, some feature aren't supported though. In particular:

    @@ -151,7 +151,7 @@ Runtime arguments
    delegate.connect(&func, &value);

    The type of the delegate is deduced from the function if possible. In this case, since the first argument is an implementation detail, the deduced function type is int(int).
    Invoking a delegate built in this way follows the same rules as previously explained.

    -

    +

    Lambda support

    In general, the delegate class doesn't fully support lambda functions in all their nuances. The reason is pretty simple: a delegate isn't a drop-in replacement for an std::function. Instead, it tries to overcome the problems with the latter.
    That being said, non-capturing lambda functions are supported, even though some feature aren't available in this case.

    @@ -169,7 +169,7 @@ Lambda support
    return static_cast<const my_struct *>(ptr)->f(value);
    }, &instance);

    As above, the first parameter (const void *) isn't part of the function type of the delegate and is used to dispatch arbitrary user data back and forth. In other terms, the function type of the delegate above is int(int).

    -

    +

    Signals

    Signal handlers work with references to classes, function pointers and pointers to members. Listeners can be any kind of objects and users are in charge of connecting and disconnecting them from a signal to avoid crashes due to different lifetimes. On the other side, performance shouldn't be affected that much by the presence of such a signal handler.
    Signals make use of delegates internally and therefore they undergo the same rules and offer similar functionalities. It may be a good idea to consult the documentation of the delegate class for further information.

    @@ -177,7 +177,7 @@ Signals

    The API of a signal handler is straightforward. If a collector is supplied to the signal when something is published, all the values returned by the listeners can be literally collected and used later by the caller. Otherwise, the class works just like a plain signal that emits events from time to time.
    To create instances of signal handlers it is sufficient to provide the type of function to which they refer:

    entt::sigh<void(int, char)> signal;
    -
    entt::sigh
    Unmanaged signal handler.
    Definition: fwd.hpp:24
    +
    entt::sigh
    Unmanaged signal handler.
    Definition: fwd.hpp:25

    Signals offer all the basic functionalities required to know how many listeners they contain (size) or if they contain at least a listener (empty), as well as a function to use to swap handlers (swap).

    Besides them, there are member functions to use both to connect and disconnect listeners in all their forms by means of a sink:

    void foo(int, char) { /* ... */ }
    @@ -207,7 +207,7 @@ Signals
    // discards all listeners at once
    sink.disconnect();
    -
    entt::sink
    Sink class.
    Definition: fwd.hpp:21
    +
    entt::sink
    Sink class.
    Definition: fwd.hpp:22
    entt::sink
    sink(sigh< Ret(Args...), Allocator > &) -> sink< sigh< Ret(Args...), Allocator >>
    Deduction guide.

    As shown above, the listeners don't have to strictly follow the signature of the signal. As long as a listener can be invoked with the given arguments to yield a result that is convertible to the given return type, everything works just fine.
    It's also possible to connect a listener before other listeners already contained by the signal. The before function returns a sink object correctly initialized for the purpose that can be used to connect one or more listeners in order and in the desired position:

    @@ -237,7 +237,7 @@ Signals
    struct my_collector {
    std::vector<int> vec{};
    -
    bool operator()(int v) noexcept {
    +
    bool operator()(int v) {
    vec.push_back(v);
    return true;
    }
    @@ -248,15 +248,16 @@ Signals
    my_collector collector;
    signal.collect(std::ref(collector));
    entt::collector
    constexpr basic_collector collector
    Variable template used to ease the definition of collectors.
    Definition: observer.hpp:113
    -

    +

    Event dispatcher

    -

    The event dispatcher class is designed so as to be used in a loop. It allows users both to trigger immediate events or to queue events to be published all together once per tick.
    - This class shares part of its API with the one of the signal handler, but it doesn't require that all the types of events are specified when declared:

    +

    The event dispatcher class allows users to trigger immediate events or to queue and publish them all together later.
    + This class lazily instantiates its queues. Therefore, it's not necessary to announce the event types in advance:

    // define a general purpose dispatcher
    -
    entt::dispatcher dispatcher{};
    -
    entt::dispatcher
    Basic dispatcher implementation.
    Definition: dispatcher.hpp:30
    -

    In order to register an instance of a class to a dispatcher, its type must expose one or more member functions the arguments of which are such that E & can be converted to them for each type of event E, no matter what the return value is.
    - The name of the member function aimed to receive the event must be provided to the connect member function of the sink in charge for the specific event:

    +
    entt::dispatcher dispatcher{};
    +
    entt::basic_dispatcher
    Basic dispatcher implementation.
    Definition: dispatcher.hpp:118
    +
    entt::dispatcher
    basic_dispatcher<> dispatcher
    Alias declaration for the most common use case.
    Definition: fwd.hpp:28
    +

    A listener registered with a dispatcher is such that its type offers one or more member functions that take arguments of type Event & for any type of event, regardless of the return value.
    + These functions are linked directly via connect to a sink:

    struct an_event { int value; };
    struct another_event {};
    @@ -268,27 +269,35 @@ Event dispatcher
    // ...
    listener listener;
    -
    dispatcher.sink<an_event>().connect<&listener::receive>(listener);
    -
    dispatcher.sink<another_event>().connect<&listener::method>(listener);
    -

    The disconnect member function follows the same pattern and can be used to remove one listener at a time or all of them at once:

    -
    dispatcher.sink<an_event>().disconnect<&listener::receive>(listener);
    -
    dispatcher.sink<another_event>().disconnect(listener);
    -

    The trigger member function serves the purpose of sending an immediate event to all the listeners registered so far. It offers a convenient approach that relieves users from having to create the event itself. Instead, it's enough to specify the type of event and provide all the parameters required to construct it.
    - As an example:

    -
    dispatcher.trigger<an_event>(42);
    -
    dispatcher.trigger<another_event>();
    +
    dispatcher.sink<an_event>().connect<&listener::receive>(listener);
    +
    dispatcher.sink<another_event>().connect<&listener::method>(listener);
    +

    The disconnect member function is used to remove one listener at a time or all of them at once:

    +
    dispatcher.sink<an_event>().disconnect<&listener::receive>(listener);
    +
    dispatcher.sink<another_event>().disconnect(listener);
    +

    The trigger member function serves the purpose of sending an immediate event to all the listeners registered so far:

    +
    dispatcher.trigger(an_event{42});
    +
    dispatcher.trigger<another_event>();

    Listeners are invoked immediately, order of execution isn't guaranteed. This method can be used to push around urgent messages like an is terminating notification on a mobile app.

    -

    On the other hand, the enqueue member function queues messages together and allows to maintain control over the moment they are sent to listeners. The signature of this method is more or less the same of trigger:

    -
    dispatcher.enqueue<an_event>(42);
    -
    dispatcher.enqueue<another_event>();
    -

    Events are stored aside until the update member function is invoked, then all the messages that are still pending are sent to the listeners at once:

    +

    On the other hand, the enqueue member function queues messages together and helps to maintain control over the moment they are sent to listeners:

    +
    dispatcher.enqueue<an_event>(42);
    +
    dispatcher.enqueue(another_event{});
    +

    Events are stored aside until the update member function is invoked:

    // emits all the events of the given type at once
    -
    dispatcher.update<an_event>();
    +
    dispatcher.update<an_event>();
    // emits all the events queued so far at once
    -
    dispatcher.update();
    +
    dispatcher.update();

    This way users can embed the dispatcher in a loop and literally dispatch events once per tick to their systems.

    -

    +

    +Named queues

    +

    All queues within a dispatcher are associated by default with an event type and then retrieved from it.
    + However, it's possible to create queues with different names (and therefore also multiple queues for a single type). In fact, more or less all functions also take an additional parameter. As an example:

    +
    dispatcher.sink<an_event>("custom"_hs).connect<&listener::receive>(listener);
    +

    In this case, the term name is misused as these are actual numeric identifiers of type id_type.
    + An exception to this rule is the enqueue function. There is no additional parameter for it but rather a different function:

    +
    dispatcher.enqueue_hint<an_event>("custom"_hs, 42);
    +

    This is mainly due to the template argument deduction rules and unfortunately there is no real (elegant) way to avoid it.

    +

    Event emitter

    A general purpose event emitter thought mainly for those cases where it comes to working with asynchronous stuff.
    Originally designed to fit the requirements of uvw (a wrapper for libuv written in modern C++), it was adapted later to be included in this library.

    diff --git a/md_docs_md_unreal.html b/md_docs_md_unreal.html index eccacb159..0d783e32c 100644 --- a/md_docs_md_unreal.html +++ b/md_docs_md_unreal.html @@ -22,7 +22,7 @@     @@ -66,7 +66,7 @@ $(function() {
    EnTT and Unreal Engine
    -

    +

    Enable Cpp17

    As of writing (Unreal Engine v4.25), the default C++ standard of Unreal Engine is C++14.
    On the other hand, note that EnTT requires C++17 to compile. To enable it, in the main module of the project there should be a <Game Name>.Build.cs file, the constructor of which must contain the following lines:

    @@ -81,7 +81,7 @@ Enable Cpp17

    Try to compile the project to ensure it works as expected before following further steps.

    Note that updating a project to C++17 doesn't necessarily mean that the IDE in use will also start to recognize its syntax.
    If the plan is to use C++17 in the project too, check the specific instructions for the IDE in use.

    -

    +

    EnTT as a third party module

    Once this point is reached, the Source directory should look like this:

    Source
    @@ -115,7 +115,7 @@ EnTT as a third party module
    "Core", "CoreUObject", "Engine", "InputCore", [...], "EnTT"
    });

    Note that some IDEs might require a restart to start recognizing the new module for code-highlighting features and such.

    -

    +

    Include EnTT

    In any source file of the project, add #include "entt.hpp" or any other path to the file from EnTT to use it.
    Try to create a registry as entt::registry registry; to make sure everything compiles fine.

    diff --git a/memory_8hpp_source.html b/memory_8hpp_source.html index df4480519..701571552 100644 --- a/memory_8hpp_source.html +++ b/memory_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -76,77 +76,194 @@ $(function() {
    4 #include <cstddef>
    5 #include <limits>
    6 #include <memory>
    -
    7 #include <type_traits>
    -
    8 #include <utility>
    -
    9 #include "../config/config.h"
    -
    10 
    -
    11 namespace entt {
    -
    12 
    -
    19 template<typename Type>
    -
    20 [[nodiscard]] constexpr auto to_address(Type &&ptr) ENTT_NOEXCEPT {
    -
    21  if constexpr(std::is_pointer_v<std::remove_const_t<std::remove_reference_t<Type>>>) {
    -
    22  return ptr;
    -
    23  } else {
    -
    24  return to_address(std::forward<Type>(ptr).operator->());
    -
    25  }
    -
    26 }
    -
    27 
    -
    34 template<typename Allocator>
    -
    35 constexpr void propagate_on_container_copy_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs) ENTT_NOEXCEPT {
    -
    36  if constexpr(std::allocator_traits<Allocator>::propagate_on_container_copy_assignment::value) {
    -
    37  lhs = rhs;
    -
    38  }
    -
    39 }
    -
    40 
    -
    47 template<typename Allocator>
    -
    48 constexpr void propagate_on_container_move_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs) ENTT_NOEXCEPT {
    -
    49  if constexpr(std::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) {
    -
    50  lhs = std::move(rhs);
    -
    51  }
    -
    52 }
    -
    53 
    -
    60 template<typename Allocator>
    -
    61 constexpr void propagate_on_container_swap([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs) ENTT_NOEXCEPT {
    -
    62  ENTT_ASSERT(std::allocator_traits<Allocator>::propagate_on_container_swap::value || lhs == rhs, "Cannot swap the containers");
    -
    63 
    -
    64  if constexpr(std::allocator_traits<Allocator>::propagate_on_container_swap::value) {
    -
    65  using std::swap;
    -
    66  swap(lhs, rhs);
    -
    67  }
    -
    68 }
    -
    69 
    -
    75 [[nodiscard]] inline constexpr bool is_power_of_two(const std::size_t value) ENTT_NOEXCEPT {
    -
    76  return value && ((value & (value - 1)) == 0);
    -
    77 }
    -
    78 
    -
    84 [[nodiscard]] inline constexpr std::size_t next_power_of_two(const std::size_t value) ENTT_NOEXCEPT {
    -
    85  ENTT_ASSERT(value < (std::size_t{1u} << (std::numeric_limits<std::size_t>::digits - 1)), "Numeric limits exceeded");
    -
    86  std::size_t curr = value - (value != 0u);
    -
    87 
    -
    88  for(int next = 1; next < std::numeric_limits<std::size_t>::digits; next = next * 2) {
    -
    89  curr |= curr >> next;
    -
    90  }
    -
    91 
    -
    92  return ++curr;
    -
    93 }
    -
    94 
    -
    101 [[nodiscard]] inline constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod) ENTT_NOEXCEPT {
    -
    102  ENTT_ASSERT(is_power_of_two(mod), "Value must be a power of two");
    -
    103  return value & (mod - 1u);
    -
    104 }
    -
    105 
    -
    106 } // namespace entt
    -
    107 
    -
    108 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::propagate_on_container_move_assignment
    constexpr void propagate_on_container_move_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
    Utility function to design allocation-aware containers.
    Definition: memory.hpp:48
    -
    entt::propagate_on_container_swap
    constexpr void propagate_on_container_swap([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
    Utility function to design allocation-aware containers.
    Definition: memory.hpp:61
    -
    entt::fast_mod
    constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
    Fast module utility function (powers of two only).
    Definition: memory.hpp:101
    -
    entt::is_power_of_two
    constexpr bool is_power_of_two(const std::size_t value)
    Checks whether a value is a power of two or not.
    Definition: memory.hpp:75
    -
    entt::next_power_of_two
    constexpr std::size_t next_power_of_two(const std::size_t value)
    Computes the smallest power of two greater than or equal to a value.
    Definition: memory.hpp:84
    -
    entt::to_address
    constexpr auto to_address(Type &&ptr)
    Unwraps fancy pointers, does nothing otherwise (waiting for C++20).
    Definition: memory.hpp:20
    -
    entt::propagate_on_container_copy_assignment
    constexpr void propagate_on_container_copy_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
    Utility function to design allocation-aware containers.
    Definition: memory.hpp:35
    +
    7 #include <tuple>
    +
    8 #include <type_traits>
    +
    9 #include <utility>
    +
    10 #include "../config/config.h"
    +
    11 
    +
    12 namespace entt {
    +
    13 
    +
    20 template<typename Type>
    +
    21 [[nodiscard]] constexpr auto to_address(Type &&ptr) ENTT_NOEXCEPT {
    +
    22  if constexpr(std::is_pointer_v<std::remove_cv_t<std::remove_reference_t<Type>>>) {
    +
    23  return ptr;
    +
    24  } else {
    +
    25  return to_address(std::forward<Type>(ptr).operator->());
    +
    26  }
    +
    27 }
    +
    28 
    +
    35 template<typename Allocator>
    +
    36 constexpr void propagate_on_container_copy_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs) ENTT_NOEXCEPT {
    +
    37  if constexpr(std::allocator_traits<Allocator>::propagate_on_container_copy_assignment::value) {
    +
    38  lhs = rhs;
    +
    39  }
    +
    40 }
    +
    41 
    +
    48 template<typename Allocator>
    +
    49 constexpr void propagate_on_container_move_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs) ENTT_NOEXCEPT {
    +
    50  if constexpr(std::allocator_traits<Allocator>::propagate_on_container_move_assignment::value) {
    +
    51  lhs = std::move(rhs);
    +
    52  }
    +
    53 }
    +
    54 
    +
    61 template<typename Allocator>
    +
    62 constexpr void propagate_on_container_swap([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs) ENTT_NOEXCEPT {
    +
    63  ENTT_ASSERT(std::allocator_traits<Allocator>::propagate_on_container_swap::value || lhs == rhs, "Cannot swap the containers");
    +
    64 
    +
    65  if constexpr(std::allocator_traits<Allocator>::propagate_on_container_swap::value) {
    +
    66  using std::swap;
    +
    67  swap(lhs, rhs);
    +
    68  }
    +
    69 }
    +
    70 
    +
    76 [[nodiscard]] inline constexpr bool is_power_of_two(const std::size_t value) ENTT_NOEXCEPT {
    +
    77  return value && ((value & (value - 1)) == 0);
    +
    78 }
    +
    79 
    +
    85 [[nodiscard]] inline constexpr std::size_t next_power_of_two(const std::size_t value) ENTT_NOEXCEPT {
    +
    86  ENTT_ASSERT(value < (std::size_t{1u} << (std::numeric_limits<std::size_t>::digits - 1)), "Numeric limits exceeded");
    +
    87  std::size_t curr = value - (value != 0u);
    +
    88 
    +
    89  for(int next = 1; next < std::numeric_limits<std::size_t>::digits; next = next * 2) {
    +
    90  curr |= curr >> next;
    +
    91  }
    +
    92 
    +
    93  return ++curr;
    +
    94 }
    +
    95 
    +
    102 [[nodiscard]] inline constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod) ENTT_NOEXCEPT {
    +
    103  ENTT_ASSERT(is_power_of_two(mod), "Value must be a power of two");
    +
    104  return value & (mod - 1u);
    +
    105 }
    +
    106 
    +
    111 template<typename Allocator>
    +
    112 struct allocation_deleter: private Allocator {
    +
    114  using allocator_type = Allocator;
    +
    116  using pointer = typename std::allocator_traits<Allocator>::pointer;
    +
    117 
    +
    122  allocation_deleter(const allocator_type &alloc)
    +
    123  : Allocator{alloc} {}
    +
    124 
    +
    129  void operator()(pointer ptr) {
    +
    130  using alloc_traits = typename std::allocator_traits<Allocator>;
    +
    131  alloc_traits::destroy(*this, to_address(ptr));
    +
    132  alloc_traits::deallocate(*this, ptr, 1u);
    +
    133  }
    +
    134 };
    +
    135 
    +
    145 template<typename Type, typename Allocator, typename... Args>
    +
    146 auto allocate_unique(Allocator &allocator, Args &&...args) {
    +
    147  static_assert(!std::is_array_v<Type>, "Array types are not supported");
    +
    148 
    +
    149  using alloc_traits = typename std::allocator_traits<Allocator>::template rebind_traits<Type>;
    +
    150  using allocator_type = typename alloc_traits::allocator_type;
    +
    151 
    +
    152  allocator_type alloc{allocator};
    +
    153  auto ptr = alloc_traits::allocate(alloc, 1u);
    +
    154 
    +
    155  ENTT_TRY {
    +
    156  alloc_traits::construct(alloc, to_address(ptr), std::forward<Args>(args)...);
    +
    157  }
    +
    158  ENTT_CATCH {
    +
    159  alloc_traits::deallocate(alloc, ptr, 1u);
    +
    160  ENTT_THROW;
    +
    161  }
    +
    162 
    +
    163  return std::unique_ptr<Type, allocation_deleter<allocator_type>>{ptr, alloc};
    +
    164 }
    +
    165 
    +
    171 namespace internal {
    +
    172 
    +
    173 template<typename Type>
    +
    174 struct uses_allocator_construction {
    +
    175  template<typename Allocator, typename... Params>
    +
    176  static constexpr auto args([[maybe_unused]] const Allocator &allocator, Params &&...params) ENTT_NOEXCEPT {
    +
    177  if constexpr(!std::uses_allocator_v<Type, Allocator> && std::is_constructible_v<Type, Params...>) {
    +
    178  return std::forward_as_tuple(std::forward<Params>(params)...);
    +
    179  } else {
    +
    180  static_assert(std::uses_allocator_v<Type, Allocator>, "Ill-formed request");
    +
    181 
    +
    182  if constexpr(std::is_constructible_v<Type, std::allocator_arg_t, const Allocator &, Params...>) {
    +
    183  return std::tuple<std::allocator_arg_t, const Allocator &, Params &&...>(std::allocator_arg, allocator, std::forward<Params>(params)...);
    +
    184  } else {
    +
    185  static_assert(std::is_constructible_v<Type, Params..., const Allocator &>, "Ill-formed request");
    +
    186  return std::forward_as_tuple(std::forward<Params>(params)..., allocator);
    +
    187  }
    +
    188  }
    +
    189  }
    +
    190 };
    +
    191 
    +
    192 template<typename Type, typename Other>
    +
    193 struct uses_allocator_construction<std::pair<Type, Other>> {
    +
    194  using type = std::pair<Type, Other>;
    +
    195 
    +
    196  template<typename Allocator, typename First, typename Second>
    +
    197  static constexpr auto args(const Allocator &allocator, std::piecewise_construct_t, First &&first, Second &&second) ENTT_NOEXCEPT {
    +
    198  return std::make_tuple(
    +
    199  std::piecewise_construct,
    +
    200  std::apply([&allocator](auto &&...curr) { return uses_allocator_construction<Type>::args(allocator, std::forward<decltype(curr)>(curr)...); }, std::forward<First>(first)),
    +
    201  std::apply([&allocator](auto &&...curr) { return uses_allocator_construction<Other>::args(allocator, std::forward<decltype(curr)>(curr)...); }, std::forward<Second>(second)));
    +
    202  }
    +
    203 
    +
    204  template<typename Allocator>
    +
    205  static constexpr auto args(const Allocator &allocator) ENTT_NOEXCEPT {
    +
    206  return uses_allocator_construction<type>::args(allocator, std::piecewise_construct, std::tuple<>{}, std::tuple<>{});
    +
    207  }
    +
    208 
    +
    209  template<typename Allocator, typename First, typename Second>
    +
    210  static constexpr auto args(const Allocator &allocator, First &&first, Second &&second) ENTT_NOEXCEPT {
    +
    211  return uses_allocator_construction<type>::args(allocator, std::piecewise_construct, std::forward_as_tuple(std::forward<First>(first)), std::forward_as_tuple(std::forward<Second>(second)));
    +
    212  }
    +
    213 
    +
    214  template<typename Allocator, typename First, typename Second>
    +
    215  static constexpr auto args(const Allocator &allocator, const std::pair<First, Second> &value) ENTT_NOEXCEPT {
    +
    216  return uses_allocator_construction<type>::args(allocator, std::piecewise_construct, std::forward_as_tuple(value.first), std::forward_as_tuple(value.second));
    +
    217  }
    +
    218 
    +
    219  template<typename Allocator, typename First, typename Second>
    +
    220  static constexpr auto args(const Allocator &allocator, std::pair<First, Second> &&value) ENTT_NOEXCEPT {
    +
    221  return uses_allocator_construction<type>::args(allocator, std::piecewise_construct, std::forward_as_tuple(std::move(value.first)), std::forward_as_tuple(std::move(value.second)));
    +
    222  }
    +
    223 };
    +
    224 
    +
    225 } // namespace internal
    +
    226 
    +
    245 template<typename Type, typename Allocator, typename... Args>
    +
    246 constexpr auto uses_allocator_construction_args(const Allocator &allocator, Args &&...args) ENTT_NOEXCEPT {
    +
    247  return internal::uses_allocator_construction<Type>::args(allocator, std::forward<Args>(args)...);
    +
    248 }
    +
    249 
    +
    263 template<typename Type, typename Allocator, typename... Args>
    +
    264 constexpr Type make_obj_using_allocator(const Allocator &allocator, Args &&...args) {
    +
    265  return std::make_from_tuple<Type>(internal::uses_allocator_construction<Type>::args(allocator, std::forward<Args>(args)...));
    +
    266 }
    +
    267 
    +
    282 template<typename Type, typename Allocator, typename... Args>
    +
    283 constexpr Type *uninitialized_construct_using_allocator(Type *value, const Allocator &allocator, Args &&...args) {
    +
    284  return std::apply([&](auto &&...curr) { return new(value) Type(std::forward<decltype(curr)>(curr)...); }, internal::uses_allocator_construction<Type>::args(allocator, std::forward<Args>(args)...));
    +
    285 }
    +
    286 
    +
    287 } // namespace entt
    +
    288 
    +
    289 #endif
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::propagate_on_container_move_assignment
    constexpr void propagate_on_container_move_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
    Utility function to design allocation-aware containers.
    Definition: memory.hpp:49
    +
    entt::make_obj_using_allocator
    constexpr Type make_obj_using_allocator(const Allocator &allocator, Args &&...args)
    Uses-allocator construction utility (waiting for C++20).
    Definition: memory.hpp:264
    +
    entt::propagate_on_container_swap
    constexpr void propagate_on_container_swap([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
    Utility function to design allocation-aware containers.
    Definition: memory.hpp:62
    +
    entt::fast_mod
    constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
    Fast module utility function (powers of two only).
    Definition: memory.hpp:102
    +
    entt::allocate_unique
    auto allocate_unique(Allocator &allocator, Args &&...args)
    Allows std::unique_ptr to use allocators (waiting for C++20).
    Definition: memory.hpp:146
    +
    entt::is_power_of_two
    constexpr bool is_power_of_two(const std::size_t value)
    Checks whether a value is a power of two or not.
    Definition: memory.hpp:76
    +
    entt::next_power_of_two
    constexpr std::size_t next_power_of_two(const std::size_t value)
    Computes the smallest power of two greater than or equal to a value.
    Definition: memory.hpp:85
    +
    entt::uninitialized_construct_using_allocator
    constexpr Type * uninitialized_construct_using_allocator(Type *value, const Allocator &allocator, Args &&...args)
    Uses-allocator construction utility (waiting for C++20).
    Definition: memory.hpp:283
    +
    entt::to_address
    constexpr auto to_address(Type &&ptr)
    Unwraps fancy pointers, does nothing otherwise (waiting for C++20).
    Definition: memory.hpp:21
    +
    entt::propagate_on_container_copy_assignment
    constexpr void propagate_on_container_copy_assignment([[maybe_unused]] Allocator &lhs, [[maybe_unused]] Allocator &rhs)
    Utility function to design allocation-aware containers.
    Definition: memory.hpp:36
    +
    entt::uses_allocator_construction_args
    constexpr auto uses_allocator_construction_args(const Allocator &allocator, Args &&...args)
    Uses-allocator construction utility (waiting for C++20).
    Definition: memory.hpp:246
    entt::swap
    void swap(compressed_pair< First, Second > &lhs, compressed_pair< First, Second > &rhs)
    Swaps two compressed pair objects.
    Definition: compressed_pair.hpp:248
    +
    entt::allocation_deleter
    Deleter for allocator-aware unique pointers (waiting for C++20).
    Definition: memory.hpp:112
    +
    entt::allocation_deleter::allocation_deleter
    allocation_deleter(const allocator_type &alloc)
    Inherited constructors.
    Definition: memory.hpp:122
    +
    entt::allocation_deleter::pointer
    typename std::allocator_traits< Allocator >::pointer pointer
    Pointer type.
    Definition: memory.hpp:116
    +
    entt::allocation_deleter::allocator_type
    Allocator allocator_type
    Allocator type.
    Definition: memory.hpp:114
    +
    entt::allocation_deleter::operator()
    void operator()(pointer ptr)
    Destroys the pointed object and deallocates its memory.
    Definition: memory.hpp:129
    diff --git a/menudata.js b/menudata.js index 5983e709d..31cce1e0a 100644 --- a/menudata.js +++ b/menudata.js @@ -66,6 +66,7 @@ var menudata={children:[ {text:"Typedefs",url:"namespacemembers_type.html",children:[ {text:"a",url:"namespacemembers_type.html#index_a"}, {text:"c",url:"namespacemembers_type.html#index_c"}, +{text:"d",url:"namespacemembers_type.html#index_d"}, {text:"g",url:"namespacemembers_type.html#index_g"}, {text:"h",url:"namespacemembers_type.html#index_h"}, {text:"i",url:"namespacemembers_type.html#index_i"}, diff --git a/meta_2fwd_8hpp_source.html b/meta_2fwd_8hpp_source.html index 6244ca2ab..f3a82a903 100644 --- a/meta_2fwd_8hpp_source.html +++ b/meta_2fwd_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -94,7 +94,7 @@ $(function() {
    22 } // namespace entt
    23 
    24 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    diff --git a/meta_2type__traits_8hpp_source.html b/meta_2type__traits_8hpp_source.html index ec8d5fd06..afddfdf00 100644 --- a/meta_2type__traits_8hpp_source.html +++ b/meta_2type__traits_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -99,7 +99,7 @@ $(function() {
    53 } // namespace entt
    54 
    55 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::is_meta_pointer_like_v
    constexpr auto is_meta_pointer_like_v
    Helper variable template.
    Definition: type_traits.hpp:51
    entt::is_meta_pointer_like
    Provides the member constant value to true if a given type is a pointer-like type from the point of v...
    Definition: type_traits.hpp:36
    entt::meta_associative_container_traits
    Traits class template to be specialized to enable support for meta associative containers.
    Definition: type_traits.hpp:28
    diff --git a/meta_2utility_8hpp_source.html b/meta_2utility_8hpp_source.html index 15dbcf48e..7f1c7c268 100644 --- a/meta_2utility_8hpp_source.html +++ b/meta_2utility_8hpp_source.html @@ -22,7 +22,7 @@     @@ -118,10 +118,10 @@ $(function() {
    86 template<typename Type, typename Ret, typename MaybeType, typename... Args>
    87 struct meta_function_descriptor<Type, Ret (*)(MaybeType, Args...)> {
    89  using return_type = Ret;
    -
    91  using args_type = std::conditional_t<std::is_base_of_v<std::remove_const_t<std::remove_reference_t<MaybeType>>, Type>, type_list<Args...>, type_list<MaybeType, Args...>>;
    +
    91  using args_type = std::conditional_t<std::is_base_of_v<std::remove_cv_t<std::remove_reference_t<MaybeType>>, Type>, type_list<Args...>, type_list<MaybeType, Args...>>;
    92 
    -
    94  static constexpr auto is_const = std::is_base_of_v<std::remove_const_t<std::remove_reference_t<MaybeType>>, Type> && std::is_const_v<std::remove_reference_t<MaybeType>>;
    -
    96  static constexpr auto is_static = !std::is_base_of_v<std::remove_const_t<std::remove_reference_t<MaybeType>>, Type>;
    +
    94  static constexpr auto is_const = std::is_base_of_v<std::remove_cv_t<std::remove_reference_t<MaybeType>>, Type> && std::is_const_v<std::remove_reference_t<MaybeType>>;
    +
    96  static constexpr auto is_static = !std::is_base_of_v<std::remove_cv_t<std::remove_reference_t<MaybeType>>, Type>;
    97 };
    98 
    104 template<typename Type, typename Ret>
    @@ -317,10 +317,10 @@ $(function() {
    394 } // namespace entt
    395 
    396 #endif
    -
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:148
    +
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:141
    entt::meta_function_helper
    Meta function helper.
    Definition: utility.hpp:127
    entt::meta_function_helper::type
    decltype(get_rid_of_noexcept(std::declval< Candidate >())) type
    The meta function descriptor of the given function.
    Definition: utility.hpp:145
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::meta_invoke
    meta_any meta_invoke([[maybe_unused]] meta_handle instance, Candidate &&candidate, [[maybe_unused]] meta_any *const args)
    Tries to invoke an object given a list of erased parameters.
    Definition: utility.hpp:333
    entt::meta_construct
    meta_any meta_construct(meta_any *const args)
    Tries to construct an instance given a list of erased parameters.
    Definition: utility.hpp:359
    entt::meta_getter
    meta_any meta_getter([[maybe_unused]] meta_handle instance)
    Gets the value of a given variable.
    Definition: utility.hpp:240
    @@ -335,11 +335,11 @@ $(function() {
    entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >::return_type
    Ret return_type
    Meta function return type.
    Definition: utility.hpp:30
    entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::return_type
    Ret return_type
    Meta function return type.
    Definition: utility.hpp:50
    entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>::args_type
    std::conditional_t< std::is_base_of_v< Class, Type >, type_list< Args... >, type_list< Class &, Args... > > args_type
    Meta function arguments.
    Definition: utility.hpp:52
    -
    entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::args_type
    std::conditional_t< std::is_base_of_v< std::remove_const_t< std::remove_reference_t< MaybeType > >, Type >, type_list< Args... >, type_list< MaybeType, Args... > > args_type
    Meta function arguments.
    Definition: utility.hpp:91
    entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::return_type
    Ret return_type
    Meta function return type.
    Definition: utility.hpp:89
    +
    entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>::args_type
    std::conditional_t< std::is_base_of_v< std::remove_cv_t< std::remove_reference_t< MaybeType > >, Type >, type_list< Args... >, type_list< MaybeType, Args... > > args_type
    Meta function arguments.
    Definition: utility.hpp:91
    entt::meta_function_descriptor< Type, Ret(*)()>::return_type
    Ret return_type
    Meta function return type.
    Definition: utility.hpp:107
    entt::meta_function_descriptor
    Primary template isn't defined on purpose.
    Definition: utility.hpp:18
    -
    entt::meta_handle
    Opaque pointers to instances of any type.
    Definition: meta.hpp:640
    +
    entt::meta_handle
    Opaque pointers to instances of any type.
    Definition: meta.hpp:611
    entt::type_list
    A class to use to push around lists of types, nothing more.
    Definition: type_traits.hpp:110
    diff --git a/meta_8hpp_source.html b/meta_8hpp_source.html index 0c73399e5..510f9b79e 100644 --- a/meta_8hpp_source.html +++ b/meta_8hpp_source.html @@ -22,7 +22,7 @@     @@ -87,139 +87,139 @@ $(function() {
    15 #include "../core/utility.hpp"
    16 #include "adl_pointer.hpp"
    17 #include "ctx.hpp"
    -
    18 #include "node.hpp"
    -
    19 #include "range.hpp"
    -
    20 #include "type_traits.hpp"
    -
    21 
    -
    22 namespace entt {
    -
    23 
    -
    24 class meta_any;
    -
    25 class meta_type;
    -
    26 
    -
    28 class meta_sequence_container {
    -
    29  class meta_iterator;
    -
    30 
    -
    31 public:
    -
    33  using size_type = std::size_t;
    -
    35  using iterator = meta_iterator;
    -
    36 
    -
    38  meta_sequence_container() ENTT_NOEXCEPT = default;
    -
    39 
    -
    45  template<typename Type>
    -
    46  meta_sequence_container(std::in_place_type_t<Type>, any instance) ENTT_NOEXCEPT
    -
    47  : value_type_node{internal::meta_node<std::remove_const_t<std::remove_reference_t<typename Type::value_type>>>::resolve()},
    -
    48  size_fn{&meta_sequence_container_traits<Type>::size},
    -
    49  resize_fn{&meta_sequence_container_traits<Type>::resize},
    -
    50  clear_fn{&meta_sequence_container_traits<Type>::clear},
    -
    51  begin_fn{&meta_sequence_container_traits<Type>::begin},
    -
    52  end_fn{&meta_sequence_container_traits<Type>::end},
    -
    53  insert_fn{&meta_sequence_container_traits<Type>::insert},
    -
    54  erase_fn{&meta_sequence_container_traits<Type>::erase},
    -
    55  get_fn{&meta_sequence_container_traits<Type>::get},
    -
    56  storage{std::move(instance)} {}
    -
    57 
    -
    58  [[nodiscard]] inline meta_type value_type() const ENTT_NOEXCEPT;
    -
    59  [[nodiscard]] inline size_type size() const ENTT_NOEXCEPT;
    -
    60  inline bool resize(const size_type);
    -
    61  inline bool clear();
    -
    62  [[nodiscard]] inline iterator begin();
    -
    63  [[nodiscard]] inline iterator end();
    -
    64  inline iterator insert(iterator, meta_any);
    -
    65  inline iterator erase(iterator);
    -
    66  [[nodiscard]] inline meta_any operator[](const size_type);
    -
    67  [[nodiscard]] inline explicit operator bool() const ENTT_NOEXCEPT;
    -
    68 
    -
    69 private:
    -
    70  internal::meta_type_node *value_type_node = nullptr;
    -
    71  size_type (*size_fn)(const any &) ENTT_NOEXCEPT = nullptr;
    -
    72  bool (*resize_fn)(any &, size_type) = nullptr;
    -
    73  bool (*clear_fn)(any &) = nullptr;
    -
    74  iterator (*begin_fn)(any &) = nullptr;
    -
    75  iterator (*end_fn)(any &) = nullptr;
    -
    76  iterator (*insert_fn)(any &, iterator, meta_any &) = nullptr;
    -
    77  iterator (*erase_fn)(any &, iterator) = nullptr;
    -
    78  meta_any (*get_fn)(any &, size_type) = nullptr;
    -
    79  any storage{};
    -
    80 };
    -
    81 
    -
    83 class meta_associative_container {
    -
    84  class meta_iterator;
    -
    85 
    -
    86 public:
    -
    88  using size_type = std::size_t;
    -
    90  using iterator = meta_iterator;
    -
    91 
    -
    93  meta_associative_container() ENTT_NOEXCEPT = default;
    -
    94 
    -
    100  template<typename Type>
    -
    101  meta_associative_container(std::in_place_type_t<Type>, any instance) ENTT_NOEXCEPT
    -
    102  : key_only_container{meta_associative_container_traits<Type>::key_only},
    -
    103  key_type_node{internal::meta_node<std::remove_const_t<std::remove_reference_t<typename Type::key_type>>>::resolve()},
    -
    104  mapped_type_node{nullptr},
    -
    105  value_type_node{internal::meta_node<std::remove_const_t<std::remove_reference_t<typename Type::value_type>>>::resolve()},
    -
    106  size_fn{&meta_associative_container_traits<Type>::size},
    -
    107  clear_fn{&meta_associative_container_traits<Type>::clear},
    -
    108  begin_fn{&meta_associative_container_traits<Type>::begin},
    -
    109  end_fn{&meta_associative_container_traits<Type>::end},
    -
    110  insert_fn{&meta_associative_container_traits<Type>::insert},
    -
    111  erase_fn{&meta_associative_container_traits<Type>::erase},
    -
    112  find_fn{&meta_associative_container_traits<Type>::find},
    -
    113  storage{std::move(instance)} {
    -
    114  if constexpr(!meta_associative_container_traits<Type>::key_only) {
    -
    115  mapped_type_node = internal::meta_node<std::remove_const_t<std::remove_reference_t<typename Type::mapped_type>>>::resolve();
    -
    116  }
    -
    117  }
    -
    118 
    -
    119  [[nodiscard]] inline bool key_only() const ENTT_NOEXCEPT;
    -
    120  [[nodiscard]] inline meta_type key_type() const ENTT_NOEXCEPT;
    -
    121  [[nodiscard]] inline meta_type mapped_type() const ENTT_NOEXCEPT;
    -
    122  [[nodiscard]] inline meta_type value_type() const ENTT_NOEXCEPT;
    -
    123  [[nodiscard]] inline size_type size() const ENTT_NOEXCEPT;
    -
    124  inline bool clear();
    -
    125  [[nodiscard]] inline iterator begin();
    -
    126  [[nodiscard]] inline iterator end();
    -
    127  inline bool insert(meta_any, meta_any);
    -
    128  inline bool erase(meta_any);
    -
    129  [[nodiscard]] inline iterator find(meta_any);
    -
    130  [[nodiscard]] inline explicit operator bool() const ENTT_NOEXCEPT;
    -
    131 
    -
    132 private:
    -
    133  bool key_only_container{};
    -
    134  internal::meta_type_node *key_type_node = nullptr;
    -
    135  internal::meta_type_node *mapped_type_node = nullptr;
    -
    136  internal::meta_type_node *value_type_node = nullptr;
    -
    137  size_type (*size_fn)(const any &) ENTT_NOEXCEPT = nullptr;
    -
    138  bool (*clear_fn)(any &) = nullptr;
    -
    139  iterator (*begin_fn)(any &) = nullptr;
    -
    140  iterator (*end_fn)(any &) = nullptr;
    -
    141  bool (*insert_fn)(any &, meta_any &, meta_any &) = nullptr;
    -
    142  bool (*erase_fn)(any &, meta_any &) = nullptr;
    -
    143  iterator (*find_fn)(any &, meta_any &) = nullptr;
    -
    144  any storage{};
    -
    145 };
    -
    146 
    -
    148 class meta_any {
    -
    149  enum class operation : std::uint8_t {
    -
    150  deref,
    -
    151  seq,
    -
    152  assoc
    -
    153  };
    -
    154 
    -
    155  using vtable_type = void(const operation, const any &, void *);
    -
    156 
    -
    157  template<typename Type>
    -
    158  static void basic_vtable([[maybe_unused]] const operation op, [[maybe_unused]] const any &value, [[maybe_unused]] void *other) {
    -
    159  static_assert(std::is_same_v<std::remove_reference_t<std::remove_const_t<Type>>, Type>, "Invalid type");
    -
    160 
    -
    161  if constexpr(!std::is_void_v<Type>) {
    -
    162  switch(op) {
    -
    163  case operation::deref:
    -
    164  if constexpr(is_meta_pointer_like_v<Type>) {
    -
    165  if constexpr(std::is_function_v<std::remove_const_t<typename std::pointer_traits<Type>::element_type>>) {
    -
    166  *static_cast<meta_any *>(other) = any_cast<Type>(value);
    -
    167  } else if constexpr(!std::is_same_v<std::remove_const_t<typename std::pointer_traits<Type>::element_type>, void>) {
    -
    168  using in_place_type = decltype(adl_meta_pointer_like<Type>::dereference(any_cast<const Type &>(value)));
    -
    169  static_cast<meta_any *>(other)->emplace<in_place_type>(adl_meta_pointer_like<Type>::dereference(any_cast<const Type &>(value)));
    +
    18 #include "fwd.hpp"
    +
    19 #include "node.hpp"
    +
    20 #include "range.hpp"
    +
    21 #include "type_traits.hpp"
    +
    22 
    +
    23 namespace entt {
    +
    24 
    +
    25 class meta_any;
    +
    26 class meta_type;
    +
    27 
    +
    29 class meta_sequence_container {
    +
    30  class meta_iterator;
    +
    31 
    +
    32 public:
    +
    34  using size_type = std::size_t;
    +
    36  using iterator = meta_iterator;
    +
    37 
    +
    39  meta_sequence_container() ENTT_NOEXCEPT = default;
    +
    40 
    +
    46  template<typename Type>
    +
    47  meta_sequence_container(std::in_place_type_t<Type>, any instance) ENTT_NOEXCEPT
    +
    48  : value_type_node{internal::meta_node<std::remove_cv_t<std::remove_reference_t<typename Type::value_type>>>::resolve()},
    +
    49  size_fn{&meta_sequence_container_traits<Type>::size},
    +
    50  resize_fn{&meta_sequence_container_traits<Type>::resize},
    +
    51  iter_fn{&meta_sequence_container_traits<Type>::iter},
    +
    52  insert_fn{&meta_sequence_container_traits<Type>::insert},
    +
    53  erase_fn{&meta_sequence_container_traits<Type>::erase},
    +
    54  storage{std::move(instance)} {}
    +
    55 
    +
    56  [[nodiscard]] inline meta_type value_type() const ENTT_NOEXCEPT;
    +
    57  [[nodiscard]] inline size_type size() const ENTT_NOEXCEPT;
    +
    58  inline bool resize(const size_type);
    +
    59  inline bool clear();
    +
    60  [[nodiscard]] inline iterator begin();
    +
    61  [[nodiscard]] inline iterator end();
    +
    62  inline iterator insert(iterator, meta_any);
    +
    63  inline iterator erase(iterator);
    +
    64  [[nodiscard]] inline meta_any operator[](const size_type);
    +
    65  [[nodiscard]] inline explicit operator bool() const ENTT_NOEXCEPT;
    +
    66 
    +
    67 private:
    +
    68  internal::meta_type_node *value_type_node = nullptr;
    +
    69  size_type (*size_fn)(const any &) ENTT_NOEXCEPT = nullptr;
    +
    70  bool (*resize_fn)(any &, size_type) = nullptr;
    +
    71  iterator (*iter_fn)(any &, const bool) = nullptr;
    +
    72  iterator (*insert_fn)(any &, const std::ptrdiff_t, meta_any &) = nullptr;
    +
    73  iterator (*erase_fn)(any &, const std::ptrdiff_t) = nullptr;
    +
    74  any storage{};
    +
    75 };
    +
    76 
    +
    78 class meta_associative_container {
    +
    79  class meta_iterator;
    +
    80 
    +
    81 public:
    +
    83  using size_type = std::size_t;
    +
    85  using iterator = meta_iterator;
    +
    86 
    +
    88  meta_associative_container() ENTT_NOEXCEPT = default;
    +
    89 
    +
    95  template<typename Type>
    +
    96  meta_associative_container(std::in_place_type_t<Type>, any instance) ENTT_NOEXCEPT
    +
    97  : key_only_container{meta_associative_container_traits<Type>::key_only},
    +
    98  key_type_node{internal::meta_node<std::remove_cv_t<std::remove_reference_t<typename Type::key_type>>>::resolve()},
    +
    99  mapped_type_node{nullptr},
    +
    100  value_type_node{internal::meta_node<std::remove_cv_t<std::remove_reference_t<typename Type::value_type>>>::resolve()},
    +
    101  size_fn{&meta_associative_container_traits<Type>::size},
    +
    102  clear_fn{&meta_associative_container_traits<Type>::clear},
    +
    103  iter_fn{&meta_associative_container_traits<Type>::iter},
    +
    104  insert_fn{&meta_associative_container_traits<Type>::insert},
    +
    105  erase_fn{&meta_associative_container_traits<Type>::erase},
    +
    106  find_fn{&meta_associative_container_traits<Type>::find},
    +
    107  storage{std::move(instance)} {
    +
    108  if constexpr(!meta_associative_container_traits<Type>::key_only) {
    +
    109  mapped_type_node = internal::meta_node<std::remove_cv_t<std::remove_reference_t<typename Type::mapped_type>>>::resolve();
    +
    110  }
    +
    111  }
    +
    112 
    +
    113  [[nodiscard]] inline bool key_only() const ENTT_NOEXCEPT;
    +
    114  [[nodiscard]] inline meta_type key_type() const ENTT_NOEXCEPT;
    +
    115  [[nodiscard]] inline meta_type mapped_type() const ENTT_NOEXCEPT;
    +
    116  [[nodiscard]] inline meta_type value_type() const ENTT_NOEXCEPT;
    +
    117  [[nodiscard]] inline size_type size() const ENTT_NOEXCEPT;
    +
    118  inline bool clear();
    +
    119  [[nodiscard]] inline iterator begin();
    +
    120  [[nodiscard]] inline iterator end();
    +
    121  inline bool insert(meta_any, meta_any);
    +
    122  inline bool erase(meta_any);
    +
    123  [[nodiscard]] inline iterator find(meta_any);
    +
    124  [[nodiscard]] inline explicit operator bool() const ENTT_NOEXCEPT;
    +
    125 
    +
    126 private:
    +
    127  bool key_only_container{};
    +
    128  internal::meta_type_node *key_type_node = nullptr;
    +
    129  internal::meta_type_node *mapped_type_node = nullptr;
    +
    130  internal::meta_type_node *value_type_node = nullptr;
    +
    131  size_type (*size_fn)(const any &) ENTT_NOEXCEPT = nullptr;
    +
    132  bool (*clear_fn)(any &) = nullptr;
    +
    133  iterator (*iter_fn)(any &, const bool) = nullptr;
    +
    134  bool (*insert_fn)(any &, meta_any &, meta_any &) = nullptr;
    +
    135  bool (*erase_fn)(any &, meta_any &) = nullptr;
    +
    136  iterator (*find_fn)(any &, meta_any &) = nullptr;
    +
    137  any storage{};
    +
    138 };
    +
    139 
    +
    141 class meta_any {
    +
    142  enum class operation : std::uint8_t {
    +
    143  deref,
    +
    144  seq,
    +
    145  assoc
    +
    146  };
    +
    147 
    +
    148  using vtable_type = void(const operation, const any &, void *);
    +
    149 
    +
    150  template<typename Type>
    +
    151  static void basic_vtable([[maybe_unused]] const operation op, [[maybe_unused]] const any &value, [[maybe_unused]] void *other) {
    +
    152  static_assert(std::is_same_v<std::remove_cv_t<std::remove_reference_t<Type>>, Type>, "Invalid type");
    +
    153 
    +
    154  if constexpr(!std::is_void_v<Type>) {
    +
    155  switch(op) {
    +
    156  case operation::deref:
    +
    157  if constexpr(is_meta_pointer_like_v<Type>) {
    +
    158  if constexpr(std::is_function_v<std::remove_const_t<typename std::pointer_traits<Type>::element_type>>) {
    +
    159  *static_cast<meta_any *>(other) = any_cast<Type>(value);
    +
    160  } else if constexpr(!std::is_same_v<std::remove_const_t<typename std::pointer_traits<Type>::element_type>, void>) {
    +
    161  using in_place_type = decltype(adl_meta_pointer_like<Type>::dereference(any_cast<const Type &>(value)));
    +
    162 
    +
    163  if constexpr(std::is_constructible_v<bool, Type>) {
    +
    164  if(const auto &pointer_like = any_cast<const Type &>(value); pointer_like) {
    +
    165  static_cast<meta_any *>(other)->emplace<in_place_type>(adl_meta_pointer_like<Type>::dereference(pointer_like));
    +
    166  }
    +
    167  } else {
    +
    168  static_cast<meta_any *>(other)->emplace<in_place_type>(adl_meta_pointer_like<Type>::dereference(any_cast<const Type &>(value)));
    +
    169  }
    170  }
    171  }
    172  break;
    @@ -257,12 +257,12 @@ $(function() {
    211  template<typename Type, typename... Args>
    212  explicit meta_any(std::in_place_type_t<Type>, Args &&...args)
    213  : storage{std::in_place_type<Type>, std::forward<Args>(args)...},
    -
    214  node{internal::meta_node<std::remove_const_t<std::remove_reference_t<Type>>>::resolve()},
    -
    215  vtable{&basic_vtable<std::remove_const_t<std::remove_reference_t<Type>>>} {}
    +
    214  node{internal::meta_node<std::remove_cv_t<std::remove_reference_t<Type>>>::resolve()},
    +
    215  vtable{&basic_vtable<std::remove_cv_t<std::remove_reference_t<Type>>>} {}
    216 
    222  template<typename Type, typename = std::enable_if_t<!std::is_same_v<std::decay_t<Type>, meta_any>>>
    223  meta_any(Type &&value)
    -
    224  : meta_any{std::in_place_type<std::remove_const_t<std::remove_reference_t<Type>>>, std::forward<Type>(value)} {}
    +
    224  : meta_any{std::in_place_type<std::remove_cv_t<std::remove_reference_t<Type>>>, std::forward<Type>(value)} {}
    225 
    230  meta_any(const meta_any &other) = default;
    231 
    @@ -298,1093 +298,1078 @@ $(function() {
    282  return *this;
    283  }
    284 
    -
    289  [[nodiscard]] inline meta_type type() const ENTT_NOEXCEPT;
    -
    290 
    -
    295  [[nodiscard]] const void *data() const ENTT_NOEXCEPT {
    -
    296  return storage.data();
    -
    297  }
    -
    298 
    -
    300  [[nodiscard]] void *data() ENTT_NOEXCEPT {
    -
    301  return storage.data();
    -
    302  }
    -
    303 
    -
    314  template<typename... Args>
    -
    315  meta_any invoke(const id_type id, Args &&...args) const;
    -
    316 
    -
    318  template<typename... Args>
    -
    319  meta_any invoke(const id_type id, Args &&...args);
    -
    320 
    -
    332  template<typename Type>
    -
    333  bool set(const id_type id, Type &&value);
    -
    334 
    -
    340  [[nodiscard]] meta_any get(const id_type id) const;
    -
    341 
    -
    343  [[nodiscard]] meta_any get(const id_type id);
    -
    344 
    -
    350  template<typename Type>
    -
    351  [[nodiscard]] const Type *try_cast() const {
    -
    352  if(const auto &info = type_id<Type>(); node && *node->info == info) {
    -
    353  return any_cast<Type>(&storage);
    -
    354  } else if(node) {
    -
    355  for(auto *it = node->base; it; it = it->next) {
    -
    356  const auto as_const = it->cast(as_ref());
    +
    286  [[nodiscard]] inline meta_type type() const ENTT_NOEXCEPT;
    +
    287 
    +
    289  [[nodiscard]] const void *data() const ENTT_NOEXCEPT {
    +
    290  return storage.data();
    +
    291  }
    +
    292 
    +
    294  [[nodiscard]] void *data() ENTT_NOEXCEPT {
    +
    295  return storage.data();
    +
    296  }
    +
    297 
    +
    308  template<typename... Args>
    +
    309  meta_any invoke(const id_type id, Args &&...args) const;
    +
    310 
    +
    312  template<typename... Args>
    +
    313  meta_any invoke(const id_type id, Args &&...args);
    +
    314 
    +
    326  template<typename Type>
    +
    327  bool set(const id_type id, Type &&value);
    +
    328 
    +
    334  [[nodiscard]] meta_any get(const id_type id) const;
    +
    335 
    +
    337  [[nodiscard]] meta_any get(const id_type id);
    +
    338 
    +
    344  template<typename Type>
    +
    345  [[nodiscard]] const Type *try_cast() const {
    +
    346  if(const auto &info = type_id<Type>(); node && *node->info == info) {
    +
    347  return any_cast<Type>(&storage);
    +
    348  } else if(node) {
    +
    349  for(auto *it = node->base; it; it = it->next) {
    +
    350  const auto as_const = it->cast(as_ref());
    +
    351 
    +
    352  if(const Type *base = as_const.template try_cast<Type>(); base) {
    +
    353  return base;
    +
    354  }
    +
    355  }
    +
    356  }
    357 
    -
    358  if(const Type *base = as_const.template try_cast<Type>(); base) {
    -
    359  return base;
    -
    360  }
    -
    361  }
    -
    362  }
    -
    363 
    -
    364  return nullptr;
    -
    365  }
    -
    366 
    -
    368  template<typename Type>
    -
    369  [[nodiscard]] Type *try_cast() {
    -
    370  if(const auto &info = type_id<Type>(); node && *node->info == info) {
    -
    371  return any_cast<Type>(&storage);
    -
    372  } else if(node) {
    -
    373  for(auto *it = node->base; it; it = it->next) {
    -
    374  if(Type *base = it->cast(as_ref()).template try_cast<Type>(); base) {
    -
    375  return base;
    -
    376  }
    -
    377  }
    -
    378  }
    -
    379 
    -
    380  return nullptr;
    -
    381  }
    -
    382 
    -
    394  template<typename Type>
    -
    395  [[nodiscard]] Type cast() const {
    -
    396  auto *const instance = try_cast<std::remove_reference_t<Type>>();
    -
    397  ENTT_ASSERT(instance, "Invalid instance");
    -
    398  return static_cast<Type>(*instance);
    -
    399  }
    -
    400 
    -
    402  template<typename Type>
    -
    403  [[nodiscard]] Type cast() {
    -
    404  // forces const on non-reference types to make them work also with wrappers for const references
    -
    405  auto *const instance = try_cast<std::remove_reference_t<const Type>>();
    -
    406  ENTT_ASSERT(instance, "Invalid instance");
    -
    407  return static_cast<Type>(*instance);
    -
    408  }
    -
    409 
    -
    416  [[nodiscard]] meta_any allow_cast(const meta_type &type) const;
    -
    417 
    -
    423  [[nodiscard]] bool allow_cast(const meta_type &type) {
    -
    424  if(auto other = std::as_const(*this).allow_cast(type); other) {
    -
    425  if(other.storage.owner()) {
    -
    426  std::swap(*this, other);
    -
    427  }
    +
    358  return nullptr;
    +
    359  }
    +
    360 
    +
    362  template<typename Type>
    +
    363  [[nodiscard]] Type *try_cast() {
    +
    364  if(const auto &info = type_id<Type>(); node && *node->info == info) {
    +
    365  return any_cast<Type>(&storage);
    +
    366  } else if(node) {
    +
    367  for(auto *it = node->base; it; it = it->next) {
    +
    368  if(Type *base = it->cast(as_ref()).template try_cast<Type>(); base) {
    +
    369  return base;
    +
    370  }
    +
    371  }
    +
    372  }
    +
    373 
    +
    374  return nullptr;
    +
    375  }
    +
    376 
    +
    388  template<typename Type>
    +
    389  [[nodiscard]] Type cast() const {
    +
    390  auto *const instance = try_cast<std::remove_reference_t<Type>>();
    +
    391  ENTT_ASSERT(instance, "Invalid instance");
    +
    392  return static_cast<Type>(*instance);
    +
    393  }
    +
    394 
    +
    396  template<typename Type>
    +
    397  [[nodiscard]] Type cast() {
    +
    398  // forces const on non-reference types to make them work also with wrappers for const references
    +
    399  auto *const instance = try_cast<std::remove_reference_t<const Type>>();
    +
    400  ENTT_ASSERT(instance, "Invalid instance");
    +
    401  return static_cast<Type>(*instance);
    +
    402  }
    +
    403 
    +
    410  [[nodiscard]] meta_any allow_cast(const meta_type &type) const;
    +
    411 
    +
    417  [[nodiscard]] bool allow_cast(const meta_type &type) {
    +
    418  if(auto other = std::as_const(*this).allow_cast(type); other) {
    +
    419  if(other.storage.owner()) {
    +
    420  std::swap(*this, other);
    +
    421  }
    +
    422 
    +
    423  return true;
    +
    424  }
    +
    425 
    +
    426  return false;
    +
    427  }
    428 
    -
    429  return true;
    -
    430  }
    -
    431 
    -
    432  return false;
    -
    433  }
    -
    434 
    -
    441  template<typename Type>
    -
    442  [[nodiscard]] meta_any allow_cast() const {
    -
    443  const auto other = allow_cast(internal::meta_node<std::remove_const_t<std::remove_reference_t<Type>>>::resolve());
    -
    444 
    -
    445  if constexpr(std::is_reference_v<Type> && !std::is_const_v<std::remove_reference_t<Type>>) {
    -
    446  return other.storage.owner() ? other : meta_any{};
    -
    447  } else {
    -
    448  return other;
    -
    449  }
    -
    450  }
    -
    451 
    -
    457  template<typename Type>
    -
    458  bool allow_cast() {
    -
    459  if(auto other = std::as_const(*this).allow_cast(internal::meta_node<std::remove_const_t<std::remove_reference_t<Type>>>::resolve()); other) {
    -
    460  if(other.storage.owner()) {
    -
    461  std::swap(*this, other);
    -
    462  return true;
    -
    463  }
    +
    435  template<typename Type>
    +
    436  [[nodiscard]] meta_any allow_cast() const {
    +
    437  const auto other = allow_cast(internal::meta_node<std::remove_cv_t<std::remove_reference_t<Type>>>::resolve());
    +
    438 
    +
    439  if constexpr(std::is_reference_v<Type> && !std::is_const_v<std::remove_reference_t<Type>>) {
    +
    440  return other.storage.owner() ? other : meta_any{};
    +
    441  } else {
    +
    442  return other;
    +
    443  }
    +
    444  }
    +
    445 
    +
    451  template<typename Type>
    +
    452  bool allow_cast() {
    +
    453  if(auto other = std::as_const(*this).allow_cast(internal::meta_node<std::remove_cv_t<std::remove_reference_t<Type>>>::resolve()); other) {
    +
    454  if(other.storage.owner()) {
    +
    455  std::swap(*this, other);
    +
    456  return true;
    +
    457  }
    +
    458 
    +
    459  return (static_cast<constness_as_t<any, std::remove_reference_t<const Type>> &>(storage).data() != nullptr);
    +
    460  }
    +
    461 
    +
    462  return false;
    +
    463  }
    464 
    -
    465  return (static_cast<constness_as_t<any, std::remove_reference_t<const Type>> &>(storage).data() != nullptr);
    -
    466  }
    -
    467 
    -
    468  return false;
    -
    469  }
    -
    470 
    -
    477  template<typename Type, typename... Args>
    -
    478  void emplace(Args &&...args) {
    -
    479  release();
    -
    480  vtable = &basic_vtable<std::remove_const_t<std::remove_reference_t<Type>>>;
    -
    481  storage.emplace<Type>(std::forward<Args>(args)...);
    -
    482  node = internal::meta_node<std::remove_const_t<std::remove_reference_t<Type>>>::resolve();
    -
    483  }
    -
    484 
    -
    490  bool assign(const meta_any &other);
    -
    491 
    -
    497  bool assign(meta_any &&other);
    +
    466  template<typename Type, typename... Args>
    +
    467  void emplace(Args &&...args) {
    +
    468  release();
    +
    469  vtable = &basic_vtable<std::remove_cv_t<std::remove_reference_t<Type>>>;
    +
    470  storage.emplace<Type>(std::forward<Args>(args)...);
    +
    471  node = internal::meta_node<std::remove_cv_t<std::remove_reference_t<Type>>>::resolve();
    +
    472  }
    +
    473 
    +
    475  bool assign(const meta_any &other);
    +
    476 
    +
    478  bool assign(meta_any &&other);
    +
    479 
    +
    481  void reset() {
    +
    482  release();
    +
    483  vtable = &basic_vtable<void>;
    +
    484  storage.reset();
    +
    485  node = nullptr;
    +
    486  }
    +
    487 
    +
    492  [[nodiscard]] meta_sequence_container as_sequence_container() ENTT_NOEXCEPT {
    +
    493  any detached = storage.as_ref();
    +
    494  meta_sequence_container proxy;
    +
    495  vtable(operation::seq, detached, &proxy);
    +
    496  return proxy;
    +
    497  }
    498 
    -
    500  void reset() {
    -
    501  release();
    -
    502  vtable = &basic_vtable<void>;
    -
    503  storage.reset();
    -
    504  node = nullptr;
    +
    500  [[nodiscard]] meta_sequence_container as_sequence_container() const ENTT_NOEXCEPT {
    +
    501  any detached = storage.as_ref();
    +
    502  meta_sequence_container proxy;
    +
    503  vtable(operation::seq, detached, &proxy);
    +
    504  return proxy;
    505  }
    506 
    -
    511  [[nodiscard]] meta_sequence_container as_sequence_container() ENTT_NOEXCEPT {
    +
    511  [[nodiscard]] meta_associative_container as_associative_container() ENTT_NOEXCEPT {
    512  any detached = storage.as_ref();
    -
    513  meta_sequence_container proxy;
    -
    514  vtable(operation::seq, detached, &proxy);
    +
    513  meta_associative_container proxy;
    +
    514  vtable(operation::assoc, detached, &proxy);
    515  return proxy;
    516  }
    517 
    -
    519  [[nodiscard]] meta_sequence_container as_sequence_container() const ENTT_NOEXCEPT {
    +
    519  [[nodiscard]] meta_associative_container as_associative_container() const ENTT_NOEXCEPT {
    520  any detached = storage.as_ref();
    -
    521  meta_sequence_container proxy;
    -
    522  vtable(operation::seq, detached, &proxy);
    +
    521  meta_associative_container proxy;
    +
    522  vtable(operation::assoc, detached, &proxy);
    523  return proxy;
    524  }
    525 
    -
    530  [[nodiscard]] meta_associative_container as_associative_container() ENTT_NOEXCEPT {
    -
    531  any detached = storage.as_ref();
    -
    532  meta_associative_container proxy;
    -
    533  vtable(operation::assoc, detached, &proxy);
    -
    534  return proxy;
    +
    531  [[nodiscard]] meta_any operator*() const ENTT_NOEXCEPT {
    +
    532  meta_any ret{};
    +
    533  vtable(operation::deref, storage, &ret);
    +
    534  return ret;
    535  }
    536 
    -
    538  [[nodiscard]] meta_associative_container as_associative_container() const ENTT_NOEXCEPT {
    -
    539  any detached = storage.as_ref();
    -
    540  meta_associative_container proxy;
    -
    541  vtable(operation::assoc, detached, &proxy);
    -
    542  return proxy;
    +
    541  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    542  return !(node == nullptr);
    543  }
    544 
    -
    550  [[nodiscard]] meta_any operator*() const ENTT_NOEXCEPT {
    -
    551  meta_any ret{};
    -
    552  vtable(operation::deref, storage, &ret);
    -
    553  return ret;
    -
    554  }
    -
    555 
    -
    560  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    561  return !(node == nullptr);
    -
    562  }
    -
    563 
    -
    569  [[nodiscard]] bool operator==(const meta_any &other) const {
    -
    570  return (!node && !other.node) || (node && other.node && *node->info == *other.node->info && storage == other.storage);
    -
    571  }
    -
    572 
    -
    577  [[nodiscard]] meta_any as_ref() ENTT_NOEXCEPT {
    -
    578  return meta_any{*this, storage.as_ref()};
    -
    579  }
    +
    546  [[nodiscard]] bool operator==(const meta_any &other) const {
    +
    547  return (!node && !other.node) || (node && other.node && *node->info == *other.node->info && storage == other.storage);
    +
    548  }
    +
    549 
    +
    551  [[nodiscard]] meta_any as_ref() ENTT_NOEXCEPT {
    +
    552  return meta_any{*this, storage.as_ref()};
    +
    553  }
    +
    554 
    +
    556  [[nodiscard]] meta_any as_ref() const ENTT_NOEXCEPT {
    +
    557  return meta_any{*this, storage.as_ref()};
    +
    558  }
    +
    559 
    +
    561  [[nodiscard]] bool owner() const ENTT_NOEXCEPT {
    +
    562  return storage.owner();
    +
    563  }
    +
    564 
    +
    565 private:
    +
    566  any storage;
    +
    567  internal::meta_type_node *node;
    +
    568  vtable_type *vtable;
    +
    569 };
    +
    570 
    +
    577 [[nodiscard]] inline bool operator!=(const meta_any &lhs, const meta_any &rhs) ENTT_NOEXCEPT {
    +
    578  return !(lhs == rhs);
    +
    579 }
    580 
    -
    582  [[nodiscard]] meta_any as_ref() const ENTT_NOEXCEPT {
    -
    583  return meta_any{*this, storage.as_ref()};
    -
    584  }
    -
    585 
    -
    590  [[nodiscard]] bool owner() const ENTT_NOEXCEPT {
    -
    591  return storage.owner();
    -
    592  }
    -
    593 
    -
    594 private:
    -
    595  any storage;
    -
    596  internal::meta_type_node *node;
    -
    597  vtable_type *vtable;
    -
    598 };
    -
    599 
    -
    606 [[nodiscard]] inline bool operator!=(const meta_any &lhs, const meta_any &rhs) ENTT_NOEXCEPT {
    -
    607  return !(lhs == rhs);
    -
    608 }
    -
    609 
    -
    617 template<typename Type, typename... Args>
    -
    618 meta_any make_meta(Args &&...args) {
    -
    619  return meta_any{std::in_place_type<Type>, std::forward<Args>(args)...};
    -
    620 }
    -
    621 
    -
    628 template<typename Type>
    -
    629 meta_any forward_as_meta(Type &&value) {
    -
    630  return meta_any{std::in_place_type<std::conditional_t<std::is_rvalue_reference_v<Type>, std::decay_t<Type>, Type>>, std::forward<Type>(value)};
    -
    631 }
    +
    588 template<typename Type, typename... Args>
    +
    589 meta_any make_meta(Args &&...args) {
    +
    590  return meta_any{std::in_place_type<Type>, std::forward<Args>(args)...};
    +
    591 }
    +
    592 
    +
    599 template<typename Type>
    +
    600 meta_any forward_as_meta(Type &&value) {
    +
    601  return meta_any{std::in_place_type<std::conditional_t<std::is_rvalue_reference_v<Type>, std::decay_t<Type>, Type>>, std::forward<Type>(value)};
    +
    602 }
    +
    603 
    +
    611 struct meta_handle {
    +
    613  meta_handle() = default;
    +
    614 
    +
    616  meta_handle(const meta_handle &) = delete;
    +
    617 
    +
    619  meta_handle(meta_handle &&) = default;
    +
    620 
    +
    625  meta_handle &operator=(const meta_handle &) = delete;
    +
    626 
    +
    631  meta_handle &operator=(meta_handle &&) = default;
    632 
    -
    640 struct meta_handle {
    -
    642  meta_handle() = default;
    -
    643 
    -
    645  meta_handle(const meta_handle &) = delete;
    -
    646 
    -
    648  meta_handle(meta_handle &&) = default;
    -
    649 
    -
    654  meta_handle &operator=(const meta_handle &) = delete;
    +
    638  template<typename Type, typename = std::enable_if_t<!std::is_same_v<std::decay_t<Type>, meta_handle>>>
    +
    639  meta_handle(Type &value) ENTT_NOEXCEPT
    +
    640  : meta_handle{} {
    +
    641  if constexpr(std::is_same_v<std::decay_t<Type>, meta_any>) {
    +
    642  any = value.as_ref();
    +
    643  } else {
    +
    644  any.emplace<Type &>(value);
    +
    645  }
    +
    646  }
    +
    647 
    +
    652  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    653  return static_cast<bool>(any);
    +
    654  }
    655 
    -
    660  meta_handle &operator=(meta_handle &&) = default;
    -
    661 
    -
    667  template<typename Type, typename = std::enable_if_t<!std::is_same_v<std::decay_t<Type>, meta_handle>>>
    -
    668  meta_handle(Type &value) ENTT_NOEXCEPT
    -
    669  : meta_handle{} {
    -
    670  if constexpr(std::is_same_v<std::decay_t<Type>, meta_any>) {
    -
    671  any = value.as_ref();
    -
    672  } else {
    -
    673  any.emplace<Type &>(value);
    -
    674  }
    -
    675  }
    -
    676 
    -
    681  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    682  return static_cast<bool>(any);
    -
    683  }
    +
    660  [[nodiscard]] meta_any *operator->() {
    +
    661  return &any;
    +
    662  }
    +
    663 
    +
    665  [[nodiscard]] const meta_any *operator->() const {
    +
    666  return &any;
    +
    667  }
    +
    668 
    +
    669 private:
    +
    670  meta_any any;
    +
    671 };
    +
    672 
    +
    674 struct meta_prop {
    +
    676  using node_type = internal::meta_prop_node;
    +
    677 
    +
    682  meta_prop(const node_type *curr = nullptr) ENTT_NOEXCEPT
    +
    683  : node{curr} {}
    684 
    -
    689  [[nodiscard]] meta_any *operator->() {
    -
    690  return &any;
    +
    689  [[nodiscard]] meta_any key() const {
    +
    690  return node->id.as_ref();
    691  }
    692 
    -
    694  [[nodiscard]] const meta_any *operator->() const {
    -
    695  return &any;
    -
    696  }
    -
    697 
    -
    698 private:
    -
    699  meta_any any;
    -
    700 };
    -
    701 
    -
    703 struct meta_prop {
    -
    705  using node_type = internal::meta_prop_node;
    -
    706 
    -
    711  meta_prop(const node_type *curr = nullptr) ENTT_NOEXCEPT
    -
    712  : node{curr} {}
    -
    713 
    -
    718  [[nodiscard]] meta_any key() const {
    -
    719  return node->id.as_ref();
    -
    720  }
    -
    721 
    -
    726  [[nodiscard]] meta_any value() const {
    -
    727  return node->value;
    -
    728  }
    -
    729 
    -
    734  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    735  return !(node == nullptr);
    -
    736  }
    -
    737 
    -
    738 private:
    -
    739  const node_type *node;
    -
    740 };
    -
    741 
    -
    743 struct meta_data {
    -
    745  using node_type = internal::meta_data_node;
    -
    747  using size_type = typename node_type::size_type;
    -
    748 
    -
    750  meta_data(const node_type *curr = nullptr) ENTT_NOEXCEPT
    -
    751  : node{curr} {}
    +
    697  [[nodiscard]] meta_any value() const {
    +
    698  return node->value;
    +
    699  }
    +
    700 
    +
    705  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    706  return !(node == nullptr);
    +
    707  }
    +
    708 
    +
    709 private:
    +
    710  const node_type *node;
    +
    711 };
    +
    712 
    +
    714 struct meta_data {
    +
    716  using node_type = internal::meta_data_node;
    +
    718  using size_type = typename node_type::size_type;
    +
    719 
    +
    721  meta_data(const node_type *curr = nullptr) ENTT_NOEXCEPT
    +
    722  : node{curr} {}
    +
    723 
    +
    725  [[nodiscard]] id_type id() const ENTT_NOEXCEPT {
    +
    726  return node->id;
    +
    727  }
    +
    728 
    +
    733  [[nodiscard]] size_type arity() const ENTT_NOEXCEPT {
    +
    734  return node->arity;
    +
    735  }
    +
    736 
    +
    741  [[nodiscard]] bool is_const() const ENTT_NOEXCEPT {
    +
    742  return !!(node->traits & internal::meta_traits::is_const);
    +
    743  }
    +
    744 
    +
    749  [[nodiscard]] bool is_static() const ENTT_NOEXCEPT {
    +
    750  return !!(node->traits & internal::meta_traits::is_static);
    +
    751  }
    752 
    -
    754  [[nodiscard]] id_type id() const ENTT_NOEXCEPT {
    -
    755  return node->id;
    -
    756  }
    -
    757 
    -
    762  [[nodiscard]] size_type arity() const ENTT_NOEXCEPT {
    -
    763  return node->arity;
    -
    764  }
    -
    765 
    -
    770  [[nodiscard]] bool is_const() const ENTT_NOEXCEPT {
    -
    771  return !!(node->traits & internal::meta_traits::is_const);
    +
    754  [[nodiscard]] inline meta_type type() const ENTT_NOEXCEPT;
    +
    755 
    +
    769  template<typename Type>
    +
    770  bool set(meta_handle instance, Type &&value) const {
    +
    771  return node->set && node->set(std::move(instance), std::forward<Type>(value));
    772  }
    773 
    -
    778  [[nodiscard]] bool is_static() const ENTT_NOEXCEPT {
    -
    779  return !!(node->traits & internal::meta_traits::is_static);
    -
    780  }
    -
    781 
    -
    783  [[nodiscard]] inline meta_type type() const ENTT_NOEXCEPT;
    -
    784 
    -
    799  template<typename Type>
    -
    800  bool set(meta_handle instance, Type &&value) const {
    -
    801  return node->set && node->set(std::move(instance), std::forward<Type>(value));
    -
    802  }
    -
    803 
    -
    813  [[nodiscard]] meta_any get(meta_handle instance) const {
    -
    814  return node->get(std::move(instance));
    +
    783  [[nodiscard]] meta_any get(meta_handle instance) const {
    +
    784  return node->get(std::move(instance));
    +
    785  }
    +
    786 
    +
    792  [[nodiscard]] inline meta_type arg(const size_type index) const ENTT_NOEXCEPT;
    +
    793 
    +
    798  [[nodiscard]] meta_range<meta_prop> prop() const ENTT_NOEXCEPT {
    +
    799  return node->prop;
    +
    800  }
    +
    801 
    +
    807  [[nodiscard]] meta_prop prop(meta_any key) const {
    +
    808  for(auto curr: prop()) {
    +
    809  if(curr.key() == key) {
    +
    810  return curr;
    +
    811  }
    +
    812  }
    +
    813 
    +
    814  return nullptr;
    815  }
    816 
    -
    822  [[nodiscard]] inline meta_type arg(const size_type index) const ENTT_NOEXCEPT;
    -
    823 
    -
    828  [[nodiscard]] meta_range<meta_prop> prop() const ENTT_NOEXCEPT {
    -
    829  return node->prop;
    -
    830  }
    -
    831 
    -
    837  [[nodiscard]] meta_prop prop(meta_any key) const {
    -
    838  for(auto curr: prop()) {
    -
    839  if(curr.key() == key) {
    -
    840  return curr;
    -
    841  }
    -
    842  }
    -
    843 
    -
    844  return nullptr;
    -
    845  }
    -
    846 
    -
    851  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    852  return !(node == nullptr);
    -
    853  }
    -
    854 
    -
    855 private:
    -
    856  const node_type *node;
    -
    857 };
    -
    858 
    -
    860 struct meta_func {
    -
    862  using node_type = internal::meta_func_node;
    -
    864  using size_type = typename node_type::size_type;
    -
    865 
    -
    867  meta_func(const node_type *curr = nullptr) ENTT_NOEXCEPT
    -
    868  : node{curr} {}
    -
    869 
    -
    871  [[nodiscard]] id_type id() const ENTT_NOEXCEPT {
    -
    872  return node->id;
    -
    873  }
    +
    821  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    822  return !(node == nullptr);
    +
    823  }
    +
    824 
    +
    825 private:
    +
    826  const node_type *node;
    +
    827 };
    +
    828 
    +
    830 struct meta_func {
    +
    832  using node_type = internal::meta_func_node;
    +
    834  using size_type = typename node_type::size_type;
    +
    835 
    +
    837  meta_func(const node_type *curr = nullptr) ENTT_NOEXCEPT
    +
    838  : node{curr} {}
    +
    839 
    +
    841  [[nodiscard]] id_type id() const ENTT_NOEXCEPT {
    +
    842  return node->id;
    +
    843  }
    +
    844 
    +
    849  [[nodiscard]] size_type arity() const ENTT_NOEXCEPT {
    +
    850  return node->arity;
    +
    851  }
    +
    852 
    +
    857  [[nodiscard]] bool is_const() const ENTT_NOEXCEPT {
    +
    858  return !!(node->traits & internal::meta_traits::is_const);
    +
    859  }
    +
    860 
    +
    865  [[nodiscard]] bool is_static() const ENTT_NOEXCEPT {
    +
    866  return !!(node->traits & internal::meta_traits::is_static);
    +
    867  }
    +
    868 
    +
    873  [[nodiscard]] inline meta_type ret() const ENTT_NOEXCEPT;
    874 
    -
    879  [[nodiscard]] size_type arity() const ENTT_NOEXCEPT {
    -
    880  return node->arity;
    -
    881  }
    -
    882 
    -
    887  [[nodiscard]] bool is_const() const ENTT_NOEXCEPT {
    -
    888  return !!(node->traits & internal::meta_traits::is_const);
    -
    889  }
    -
    890 
    -
    895  [[nodiscard]] bool is_static() const ENTT_NOEXCEPT {
    -
    896  return !!(node->traits & internal::meta_traits::is_static);
    -
    897  }
    -
    898 
    -
    903  [[nodiscard]] inline meta_type ret() const ENTT_NOEXCEPT;
    -
    904 
    -
    910  [[nodiscard]] inline meta_type arg(const size_type index) const ENTT_NOEXCEPT;
    -
    911 
    -
    927  meta_any invoke(meta_handle instance, meta_any *const args, const size_type sz) const {
    -
    928  return sz == arity() ? node->invoke(std::move(instance), args) : meta_any{};
    -
    929  }
    -
    930 
    -
    941  template<typename... Args>
    -
    942  meta_any invoke(meta_handle instance, Args &&...args) const {
    -
    943  meta_any arguments[sizeof...(Args) + 1u]{std::forward<Args>(args)...};
    -
    944  return invoke(std::move(instance), arguments, sizeof...(Args));
    -
    945  }
    -
    946 
    -
    948  [[nodiscard]] meta_range<meta_prop> prop() const ENTT_NOEXCEPT {
    -
    949  return node->prop;
    -
    950  }
    -
    951 
    -
    957  [[nodiscard]] meta_prop prop(meta_any key) const {
    -
    958  for(auto curr: prop()) {
    -
    959  if(curr.key() == key) {
    -
    960  return curr;
    -
    961  }
    -
    962  }
    -
    963 
    -
    964  return nullptr;
    -
    965  }
    -
    966 
    -
    971  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    972  return !(node == nullptr);
    -
    973  }
    -
    974 
    -
    975 private:
    -
    976  const node_type *node;
    -
    977 };
    -
    978 
    -
    980 class meta_type {
    -
    981  template<auto Member, typename Pred>
    -
    982  [[nodiscard]] const auto *lookup(meta_any *const args, const typename internal::meta_type_node::size_type sz, Pred pred) const {
    -
    983  std::decay_t<decltype(node->*Member)> candidate{};
    -
    984  size_type extent{sz + 1u};
    -
    985  bool ambiguous{};
    -
    986 
    -
    987  for(auto *curr = (node->*Member); curr; curr = curr->next) {
    -
    988  if(pred(curr) && curr->arity == sz) {
    -
    989  size_type direct{};
    -
    990  size_type ext{};
    -
    991 
    -
    992  for(size_type next{}; next < sz && next == (direct + ext) && args[next]; ++next) {
    -
    993  const auto type = args[next].type();
    -
    994  const auto other = curr->arg(next);
    -
    995 
    -
    996  if(const auto &info = other.info(); info == type.info()) {
    -
    997  ++direct;
    -
    998  } else {
    -
    999  ext += internal::find_by<&node_type::base>(info, type.node)
    -
    1000  || internal::find_by<&node_type::conv>(info, type.node)
    -
    1001  || (type.node->conversion_helper && other.node->conversion_helper);
    -
    1002  }
    -
    1003  }
    -
    1004 
    -
    1005  if((direct + ext) == sz) {
    -
    1006  if(ext < extent) {
    -
    1007  candidate = curr;
    -
    1008  extent = ext;
    -
    1009  ambiguous = false;
    -
    1010  } else if(ext == extent) {
    -
    1011  ambiguous = true;
    -
    1012  }
    -
    1013  }
    -
    1014  }
    -
    1015  }
    -
    1016 
    -
    1017  return (candidate && !ambiguous) ? candidate : decltype(candidate){};
    -
    1018  }
    -
    1019 
    -
    1020 public:
    -
    1022  using node_type = internal::meta_type_node;
    -
    1024  using base_node_type = internal::meta_base_node;
    -
    1026  using size_type = typename node_type::size_type;
    -
    1027 
    -
    1029  meta_type(const node_type *curr = nullptr) ENTT_NOEXCEPT
    -
    1030  : node{curr} {}
    +
    880  [[nodiscard]] inline meta_type arg(const size_type index) const ENTT_NOEXCEPT;
    +
    881 
    +
    896  meta_any invoke(meta_handle instance, meta_any *const args, const size_type sz) const {
    +
    897  return sz == arity() ? node->invoke(std::move(instance), args) : meta_any{};
    +
    898  }
    +
    899 
    +
    910  template<typename... Args>
    +
    911  meta_any invoke(meta_handle instance, Args &&...args) const {
    +
    912  meta_any arguments[sizeof...(Args) + 1u]{std::forward<Args>(args)...};
    +
    913  return invoke(std::move(instance), arguments, sizeof...(Args));
    +
    914  }
    +
    915 
    +
    917  [[nodiscard]] meta_range<meta_prop> prop() const ENTT_NOEXCEPT {
    +
    918  return node->prop;
    +
    919  }
    +
    920 
    +
    926  [[nodiscard]] meta_prop prop(meta_any key) const {
    +
    927  for(auto curr: prop()) {
    +
    928  if(curr.key() == key) {
    +
    929  return curr;
    +
    930  }
    +
    931  }
    +
    932 
    +
    933  return nullptr;
    +
    934  }
    +
    935 
    +
    940  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    941  return !(node == nullptr);
    +
    942  }
    +
    943 
    +
    944 private:
    +
    945  const node_type *node;
    +
    946 };
    +
    947 
    +
    949 class meta_type {
    +
    950  template<auto Member, typename Pred>
    +
    951  [[nodiscard]] std::decay_t<decltype(std::declval<internal::meta_type_node>().*Member)> lookup(meta_any *const args, const typename internal::meta_type_node::size_type sz, Pred pred) const {
    +
    952  std::decay_t<decltype(node->*Member)> candidate{};
    +
    953  size_type extent{sz + 1u};
    +
    954  bool ambiguous{};
    +
    955 
    +
    956  for(auto *curr = (node->*Member); curr; curr = curr->next) {
    +
    957  if(pred(curr) && curr->arity == sz) {
    +
    958  size_type direct{};
    +
    959  size_type ext{};
    +
    960 
    +
    961  for(size_type next{}; next < sz && next == (direct + ext) && args[next]; ++next) {
    +
    962  const auto type = args[next].type();
    +
    963  const auto other = curr->arg(next);
    +
    964 
    +
    965  if(const auto &info = other.info(); info == type.info()) {
    +
    966  ++direct;
    +
    967  } else {
    +
    968  ext += internal::find_by<&node_type::base>(info, type.node)
    +
    969  || internal::find_by<&node_type::conv>(info, type.node)
    +
    970  || (type.node->conversion_helper && other.node->conversion_helper);
    +
    971  }
    +
    972  }
    +
    973 
    +
    974  if((direct + ext) == sz) {
    +
    975  if(ext < extent) {
    +
    976  candidate = curr;
    +
    977  extent = ext;
    +
    978  ambiguous = false;
    +
    979  } else if(ext == extent) {
    +
    980  ambiguous = true;
    +
    981  }
    +
    982  }
    +
    983  }
    +
    984  }
    +
    985 
    +
    986  return (candidate && !ambiguous) ? candidate : decltype(candidate){};
    +
    987  }
    +
    988 
    +
    989 public:
    +
    991  using node_type = internal::meta_type_node;
    +
    993  using base_node_type = internal::meta_base_node;
    +
    995  using size_type = typename node_type::size_type;
    +
    996 
    +
    998  meta_type(const node_type *curr = nullptr) ENTT_NOEXCEPT
    +
    999  : node{curr} {}
    +
    1000 
    +
    1005  meta_type(const base_node_type *curr) ENTT_NOEXCEPT
    +
    1006  : node{curr ? curr->type : nullptr} {}
    +
    1007 
    +
    1012  [[nodiscard]] const type_info &info() const ENTT_NOEXCEPT {
    +
    1013  return *node->info;
    +
    1014  }
    +
    1015 
    +
    1020  [[nodiscard]] id_type id() const ENTT_NOEXCEPT {
    +
    1021  return node->id;
    +
    1022  }
    +
    1023 
    +
    1028  [[nodiscard]] size_type size_of() const ENTT_NOEXCEPT {
    +
    1029  return node->size_of;
    +
    1030  }
    1031 
    -
    1036  meta_type(const base_node_type *curr) ENTT_NOEXCEPT
    -
    1037  : node{curr ? curr->type : nullptr} {}
    -
    1038 
    -
    1043  [[nodiscard]] const type_info &info() const ENTT_NOEXCEPT {
    -
    1044  return *node->info;
    -
    1045  }
    -
    1046 
    -
    1051  [[nodiscard]] id_type id() const ENTT_NOEXCEPT {
    -
    1052  return node->id;
    -
    1053  }
    -
    1054 
    -
    1059  [[nodiscard]] size_type size_of() const ENTT_NOEXCEPT {
    -
    1060  return node->size_of;
    -
    1061  }
    -
    1062 
    -
    1068  [[nodiscard]] bool is_arithmetic() const ENTT_NOEXCEPT {
    -
    1069  return !!(node->traits & internal::meta_traits::is_arithmetic);
    -
    1070  }
    -
    1071 
    -
    1076  [[nodiscard]] bool is_array() const ENTT_NOEXCEPT {
    -
    1077  return !!(node->traits & internal::meta_traits::is_array);
    -
    1078  }
    -
    1079 
    -
    1084  [[nodiscard]] bool is_enum() const ENTT_NOEXCEPT {
    -
    1085  return !!(node->traits & internal::meta_traits::is_enum);
    -
    1086  }
    -
    1087 
    -
    1092  [[nodiscard]] bool is_class() const ENTT_NOEXCEPT {
    -
    1093  return !!(node->traits & internal::meta_traits::is_class);
    -
    1094  }
    -
    1095 
    -
    1100  [[nodiscard]] bool is_pointer() const ENTT_NOEXCEPT {
    -
    1101  return !!(node->traits & internal::meta_traits::is_pointer);
    -
    1102  }
    -
    1103 
    -
    1109  [[nodiscard]] bool is_pointer_like() const ENTT_NOEXCEPT {
    -
    1110  return !!(node->traits & internal::meta_traits::is_meta_pointer_like);
    -
    1111  }
    -
    1112 
    -
    1117  [[nodiscard]] bool is_sequence_container() const ENTT_NOEXCEPT {
    -
    1118  return !!(node->traits & internal::meta_traits::is_meta_sequence_container);
    -
    1119  }
    -
    1120 
    -
    1125  [[nodiscard]] bool is_associative_container() const ENTT_NOEXCEPT {
    -
    1126  return !!(node->traits & internal::meta_traits::is_meta_associative_container);
    -
    1127  }
    -
    1128 
    -
    1135  [[nodiscard]] bool is_template_specialization() const ENTT_NOEXCEPT {
    -
    1136  return (node->templ != nullptr);
    -
    1137  }
    -
    1138 
    -
    1143  [[nodiscard]] size_type template_arity() const ENTT_NOEXCEPT {
    -
    1144  return node->templ ? node->templ->arity : size_type{};
    -
    1145  }
    -
    1146 
    -
    1154  [[nodiscard]] inline meta_type template_type() const ENTT_NOEXCEPT {
    -
    1155  return node->templ ? node->templ->type : meta_type{};
    -
    1156  }
    -
    1157 
    -
    1163  [[nodiscard]] inline meta_type template_arg(const size_type index) const ENTT_NOEXCEPT {
    -
    1164  return index < template_arity() ? node->templ->arg(index) : meta_type{};
    -
    1165  }
    -
    1166 
    -
    1171  [[nodiscard]] meta_range<meta_type, internal::meta_base_node> base() const ENTT_NOEXCEPT {
    -
    1172  return node->base;
    -
    1173  }
    -
    1174 
    -
    1180  [[nodiscard]] meta_type base(const id_type id) const {
    -
    1181  return internal::find_by<&node_type::base>(id, node);
    -
    1182  }
    -
    1183 
    -
    1188  [[nodiscard]] meta_range<meta_data> data() const ENTT_NOEXCEPT {
    -
    1189  return node->data;
    -
    1190  }
    -
    1191 
    -
    1200  [[nodiscard]] meta_data data(const id_type id) const {
    -
    1201  return internal::find_by<&node_type::data>(id, node);
    -
    1202  }
    -
    1203 
    -
    1208  [[nodiscard]] meta_range<meta_func> func() const ENTT_NOEXCEPT {
    -
    1209  return node->func;
    -
    1210  }
    -
    1211 
    -
    1222  [[nodiscard]] meta_func func(const id_type id) const {
    -
    1223  return internal::find_by<&node_type::func>(id, node);
    +
    1037  [[nodiscard]] bool is_arithmetic() const ENTT_NOEXCEPT {
    +
    1038  return !!(node->traits & internal::meta_traits::is_arithmetic);
    +
    1039  }
    +
    1040 
    +
    1045  [[nodiscard]] bool is_array() const ENTT_NOEXCEPT {
    +
    1046  return !!(node->traits & internal::meta_traits::is_array);
    +
    1047  }
    +
    1048 
    +
    1053  [[nodiscard]] bool is_enum() const ENTT_NOEXCEPT {
    +
    1054  return !!(node->traits & internal::meta_traits::is_enum);
    +
    1055  }
    +
    1056 
    +
    1061  [[nodiscard]] bool is_class() const ENTT_NOEXCEPT {
    +
    1062  return !!(node->traits & internal::meta_traits::is_class);
    +
    1063  }
    +
    1064 
    +
    1069  [[nodiscard]] bool is_pointer() const ENTT_NOEXCEPT {
    +
    1070  return !!(node->traits & internal::meta_traits::is_pointer);
    +
    1071  }
    +
    1072 
    +
    1078  [[nodiscard]] bool is_pointer_like() const ENTT_NOEXCEPT {
    +
    1079  return !!(node->traits & internal::meta_traits::is_meta_pointer_like);
    +
    1080  }
    +
    1081 
    +
    1086  [[nodiscard]] bool is_sequence_container() const ENTT_NOEXCEPT {
    +
    1087  return !!(node->traits & internal::meta_traits::is_meta_sequence_container);
    +
    1088  }
    +
    1089 
    +
    1094  [[nodiscard]] bool is_associative_container() const ENTT_NOEXCEPT {
    +
    1095  return !!(node->traits & internal::meta_traits::is_meta_associative_container);
    +
    1096  }
    +
    1097 
    +
    1104  [[nodiscard]] bool is_template_specialization() const ENTT_NOEXCEPT {
    +
    1105  return (node->templ != nullptr);
    +
    1106  }
    +
    1107 
    +
    1112  [[nodiscard]] size_type template_arity() const ENTT_NOEXCEPT {
    +
    1113  return node->templ ? node->templ->arity : size_type{};
    +
    1114  }
    +
    1115 
    +
    1123  [[nodiscard]] inline meta_type template_type() const ENTT_NOEXCEPT {
    +
    1124  return node->templ ? node->templ->type : meta_type{};
    +
    1125  }
    +
    1126 
    +
    1132  [[nodiscard]] inline meta_type template_arg(const size_type index) const ENTT_NOEXCEPT {
    +
    1133  return index < template_arity() ? node->templ->arg(index) : meta_type{};
    +
    1134  }
    +
    1135 
    +
    1140  [[nodiscard]] meta_range<meta_type, internal::meta_base_node> base() const ENTT_NOEXCEPT {
    +
    1141  return node->base;
    +
    1142  }
    +
    1143 
    +
    1149  [[nodiscard]] meta_type base(const id_type id) const {
    +
    1150  return internal::find_by<&node_type::base>(id, node);
    +
    1151  }
    +
    1152 
    +
    1157  [[nodiscard]] meta_range<meta_data> data() const ENTT_NOEXCEPT {
    +
    1158  return node->data;
    +
    1159  }
    +
    1160 
    +
    1169  [[nodiscard]] meta_data data(const id_type id) const {
    +
    1170  return internal::find_by<&node_type::data>(id, node);
    +
    1171  }
    +
    1172 
    +
    1177  [[nodiscard]] meta_range<meta_func> func() const ENTT_NOEXCEPT {
    +
    1178  return node->func;
    +
    1179  }
    +
    1180 
    +
    1191  [[nodiscard]] meta_func func(const id_type id) const {
    +
    1192  return internal::find_by<&node_type::func>(id, node);
    +
    1193  }
    +
    1194 
    +
    1206  [[nodiscard]] meta_any construct(meta_any *const args, const size_type sz) const {
    +
    1207  const auto *candidate = lookup<&node_type::ctor>(args, sz, [](const auto *) { return true; });
    +
    1208  return candidate ? candidate->invoke(args) : ((!sz && node->default_constructor) ? node->default_constructor() : meta_any{});
    +
    1209  }
    +
    1210 
    +
    1220  template<typename... Args>
    +
    1221  [[nodiscard]] meta_any construct(Args &&...args) const {
    +
    1222  meta_any arguments[sizeof...(Args) + 1u]{std::forward<Args>(args)...};
    +
    1223  return construct(arguments, sizeof...(Args));
    1224  }
    1225 
    -
    1237  [[nodiscard]] meta_any construct(meta_any *const args, const size_type sz) const {
    -
    1238  const auto *candidate = lookup<&node_type::ctor>(args, sz, [](const auto *) { return true; });
    -
    1239  return candidate ? candidate->invoke(args) : ((!sz && node->default_constructor) ? node->default_constructor() : meta_any{});
    -
    1240  }
    -
    1241 
    -
    1251  template<typename... Args>
    -
    1252  [[nodiscard]] meta_any construct(Args &&...args) const {
    -
    1253  meta_any arguments[sizeof...(Args) + 1u]{std::forward<Args>(args)...};
    -
    1254  return construct(arguments, sizeof...(Args));
    -
    1255  }
    -
    1256 
    -
    1272  meta_any invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const {
    -
    1273  const auto *candidate = lookup<&node_type::func>(args, sz, [id](const auto *curr) { return curr->id == id; });
    -
    1274  return candidate ? candidate->invoke(std::move(instance), args) : meta_any{};
    -
    1275  }
    -
    1276 
    -
    1288  template<typename... Args>
    -
    1289  meta_any invoke(const id_type id, meta_handle instance, Args &&...args) const {
    -
    1290  meta_any arguments[sizeof...(Args) + 1u]{std::forward<Args>(args)...};
    -
    1291  return invoke(id, std::move(instance), arguments, sizeof...(Args));
    -
    1292  }
    -
    1293 
    -
    1309  template<typename Type>
    -
    1310  bool set(const id_type id, meta_handle instance, Type &&value) const {
    -
    1311  const auto candidate = data(id);
    -
    1312  return candidate && candidate.set(std::move(instance), std::forward<Type>(value));
    -
    1313  }
    -
    1314 
    -
    1325  [[nodiscard]] meta_any get(const id_type id, meta_handle instance) const {
    -
    1326  const auto candidate = data(id);
    -
    1327  return candidate ? candidate.get(std::move(instance)) : meta_any{};
    +
    1240  meta_any invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const {
    +
    1241  const auto *candidate = lookup<&node_type::func>(args, sz, [id](const auto *curr) { return curr->id == id; });
    +
    1242 
    +
    1243  for(auto it = base().begin(), last = base().end(); it != last && !candidate; ++it) {
    +
    1244  candidate = it->lookup<&node_type::func>(args, sz, [id](const auto *curr) { return curr->id == id; });
    +
    1245  }
    +
    1246 
    +
    1247  return candidate ? candidate->invoke(std::move(instance), args) : meta_any{};
    +
    1248  }
    +
    1249 
    +
    1261  template<typename... Args>
    +
    1262  meta_any invoke(const id_type id, meta_handle instance, Args &&...args) const {
    +
    1263  meta_any arguments[sizeof...(Args) + 1u]{std::forward<Args>(args)...};
    +
    1264  return invoke(id, std::move(instance), arguments, sizeof...(Args));
    +
    1265  }
    +
    1266 
    +
    1281  template<typename Type>
    +
    1282  bool set(const id_type id, meta_handle instance, Type &&value) const {
    +
    1283  const auto candidate = data(id);
    +
    1284  return candidate && candidate.set(std::move(instance), std::forward<Type>(value));
    +
    1285  }
    +
    1286 
    +
    1297  [[nodiscard]] meta_any get(const id_type id, meta_handle instance) const {
    +
    1298  const auto candidate = data(id);
    +
    1299  return candidate ? candidate.get(std::move(instance)) : meta_any{};
    +
    1300  }
    +
    1301 
    +
    1306  [[nodiscard]] meta_range<meta_prop> prop() const ENTT_NOEXCEPT {
    +
    1307  return node->prop;
    +
    1308  }
    +
    1309 
    +
    1318  [[nodiscard]] meta_prop prop(meta_any key) const {
    +
    1319  return internal::find_by<&internal::meta_type_node::prop>(key, node);
    +
    1320  }
    +
    1321 
    +
    1326  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    1327  return !(node == nullptr);
    1328  }
    1329 
    -
    1334  [[nodiscard]] meta_range<meta_prop> prop() const ENTT_NOEXCEPT {
    -
    1335  return node->prop;
    -
    1336  }
    -
    1337 
    -
    1346  [[nodiscard]] meta_prop prop(meta_any key) const {
    -
    1347  return internal::find_by<&internal::meta_type_node::prop>(key, node);
    -
    1348  }
    -
    1349 
    -
    1354  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    1355  return !(node == nullptr);
    -
    1356  }
    -
    1357 
    -
    1363  [[nodiscard]] bool operator==(const meta_type &other) const ENTT_NOEXCEPT {
    -
    1364  return (!node && !other.node) || (node && other.node && *node->info == *other.node->info);
    -
    1365  }
    +
    1335  [[nodiscard]] bool operator==(const meta_type &other) const ENTT_NOEXCEPT {
    +
    1336  return (!node && !other.node) || (node && other.node && *node->info == *other.node->info);
    +
    1337  }
    +
    1338 
    +
    1339 private:
    +
    1340  const node_type *node;
    +
    1341 };
    +
    1342 
    +
    1349 [[nodiscard]] inline bool operator!=(const meta_type &lhs, const meta_type &rhs) ENTT_NOEXCEPT {
    +
    1350  return !(lhs == rhs);
    +
    1351 }
    +
    1352 
    +
    1353 [[nodiscard]] inline meta_type meta_any::type() const ENTT_NOEXCEPT {
    +
    1354  return node;
    +
    1355 }
    +
    1356 
    +
    1357 template<typename... Args>
    +
    1358 meta_any meta_any::invoke(const id_type id, Args &&...args) const {
    +
    1359  return type().invoke(id, *this, std::forward<Args>(args)...);
    +
    1360 }
    +
    1361 
    +
    1362 template<typename... Args>
    +
    1363 meta_any meta_any::invoke(const id_type id, Args &&...args) {
    +
    1364  return type().invoke(id, *this, std::forward<Args>(args)...);
    +
    1365 }
    1366 
    -
    1367 private:
    -
    1368  const node_type *node;
    -
    1369 };
    -
    1370 
    -
    1377 [[nodiscard]] inline bool operator!=(const meta_type &lhs, const meta_type &rhs) ENTT_NOEXCEPT {
    -
    1378  return !(lhs == rhs);
    -
    1379 }
    -
    1380 
    -
    1381 [[nodiscard]] inline meta_type meta_any::type() const ENTT_NOEXCEPT {
    -
    1382  return node;
    -
    1383 }
    -
    1384 
    -
    1385 template<typename... Args>
    -
    1386 meta_any meta_any::invoke(const id_type id, Args &&...args) const {
    -
    1387  return type().invoke(id, *this, std::forward<Args>(args)...);
    -
    1388 }
    +
    1367 template<typename Type>
    +
    1368 bool meta_any::set(const id_type id, Type &&value) {
    +
    1369  return type().set(id, *this, std::forward<Type>(value));
    +
    1370 }
    +
    1371 
    +
    1372 [[nodiscard]] inline meta_any meta_any::get(const id_type id) const {
    +
    1373  return type().get(id, *this);
    +
    1374 }
    +
    1375 
    +
    1376 [[nodiscard]] inline meta_any meta_any::get(const id_type id) {
    +
    1377  return type().get(id, *this);
    +
    1378 }
    +
    1379 
    +
    1380 [[nodiscard]] inline meta_any meta_any::allow_cast(const meta_type &type) const {
    +
    1381  if(const auto &info = type.info(); node && *node->info == info) {
    +
    1382  return as_ref();
    +
    1383  } else if(node) {
    +
    1384  for(auto *it = node->conv; it; it = it->next) {
    +
    1385  if(*it->type->info == info) {
    +
    1386  return it->conv(*this);
    +
    1387  }
    +
    1388  }
    1389 
    -
    1390 template<typename... Args>
    -
    1391 meta_any meta_any::invoke(const id_type id, Args &&...args) {
    -
    1392  return type().invoke(id, *this, std::forward<Args>(args)...);
    -
    1393 }
    -
    1394 
    -
    1395 template<typename Type>
    -
    1396 bool meta_any::set(const id_type id, Type &&value) {
    -
    1397  return type().set(id, *this, std::forward<Type>(value));
    -
    1398 }
    -
    1399 
    -
    1400 [[nodiscard]] inline meta_any meta_any::get(const id_type id) const {
    -
    1401  return type().get(id, *this);
    -
    1402 }
    -
    1403 
    -
    1404 [[nodiscard]] inline meta_any meta_any::get(const id_type id) {
    -
    1405  return type().get(id, *this);
    -
    1406 }
    +
    1390  if(node->conversion_helper && (type.is_arithmetic() || type.is_enum())) {
    +
    1391  // exploits the fact that arithmetic types and enums are also default constructible
    +
    1392  auto other = type.construct();
    +
    1393  ENTT_ASSERT(other.node->conversion_helper, "Conversion helper not found");
    +
    1394  const auto value = node->conversion_helper(nullptr, storage.data());
    +
    1395  other.node->conversion_helper(other.storage.data(), &value);
    +
    1396  return other;
    +
    1397  }
    +
    1398 
    +
    1399  for(auto *it = node->base; it; it = it->next) {
    +
    1400  const auto as_const = it->cast(as_ref());
    +
    1401 
    +
    1402  if(auto other = as_const.allow_cast(type); other) {
    +
    1403  return other;
    +
    1404  }
    +
    1405  }
    +
    1406  }
    1407 
    -
    1408 [[nodiscard]] inline meta_any meta_any::allow_cast(const meta_type &type) const {
    -
    1409  if(const auto &info = type.info(); node && *node->info == info) {
    -
    1410  return as_ref();
    -
    1411  } else if(node) {
    -
    1412  for(auto *it = node->conv; it; it = it->next) {
    -
    1413  if(*it->type->info == info) {
    -
    1414  return it->conv(*this);
    -
    1415  }
    -
    1416  }
    -
    1417 
    -
    1418  if(node->conversion_helper && (type.is_arithmetic() || type.is_enum())) {
    -
    1419  // exploits the fact that arithmetic types and enums are also default constructible
    -
    1420  auto other = type.construct();
    -
    1421  ENTT_ASSERT(other.node->conversion_helper, "Conversion helper not found");
    -
    1422  const auto value = node->conversion_helper(nullptr, storage.data());
    -
    1423  other.node->conversion_helper(other.storage.data(), &value);
    -
    1424  return other;
    -
    1425  }
    -
    1426 
    -
    1427  for(auto *it = node->base; it; it = it->next) {
    -
    1428  const auto as_const = it->cast(as_ref());
    -
    1429 
    -
    1430  if(auto other = as_const.allow_cast(type); other) {
    -
    1431  return other;
    -
    1432  }
    -
    1433  }
    -
    1434  }
    +
    1408  return {};
    +
    1409 }
    +
    1410 
    +
    1411 inline bool meta_any::assign(const meta_any &other) {
    +
    1412  auto value = other.allow_cast(node);
    +
    1413  return value && storage.assign(std::move(value.storage));
    +
    1414 }
    +
    1415 
    +
    1416 inline bool meta_any::assign(meta_any &&other) {
    +
    1417  if(*node->info == *other.node->info) {
    +
    1418  return storage.assign(std::move(other.storage));
    +
    1419  }
    +
    1420 
    +
    1421  return assign(std::as_const(other));
    +
    1422 }
    +
    1423 
    +
    1424 [[nodiscard]] inline meta_type meta_data::type() const ENTT_NOEXCEPT {
    +
    1425  return node->type;
    +
    1426 }
    +
    1427 
    +
    1428 [[nodiscard]] inline meta_type meta_func::ret() const ENTT_NOEXCEPT {
    +
    1429  return node->ret;
    +
    1430 }
    +
    1431 
    +
    1432 [[nodiscard]] inline meta_type meta_data::arg(const size_type index) const ENTT_NOEXCEPT {
    +
    1433  return index < arity() ? node->arg(index) : meta_type{};
    +
    1434 }
    1435 
    -
    1436  return {};
    -
    1437 }
    -
    1438 
    -
    1439 inline bool meta_any::assign(const meta_any &other) {
    -
    1440  auto value = other.allow_cast(node);
    -
    1441  return value && storage.assign(std::move(value.storage));
    -
    1442 }
    -
    1443 
    -
    1444 inline bool meta_any::assign(meta_any &&other) {
    -
    1445  if(*node->info == *other.node->info) {
    -
    1446  return storage.assign(std::move(other.storage));
    -
    1447  }
    -
    1448 
    -
    1449  return assign(std::as_const(other));
    -
    1450 }
    -
    1451 
    -
    1452 [[nodiscard]] inline meta_type meta_data::type() const ENTT_NOEXCEPT {
    -
    1453  return node->type;
    -
    1454 }
    -
    1455 
    -
    1456 [[nodiscard]] inline meta_type meta_func::ret() const ENTT_NOEXCEPT {
    -
    1457  return node->ret;
    -
    1458 }
    -
    1459 
    -
    1460 [[nodiscard]] inline meta_type meta_data::arg(const size_type index) const ENTT_NOEXCEPT {
    -
    1461  return index < arity() ? node->arg(index) : meta_type{};
    -
    1462 }
    -
    1463 
    -
    1464 [[nodiscard]] inline meta_type meta_func::arg(const size_type index) const ENTT_NOEXCEPT {
    -
    1465  return index < arity() ? node->arg(index) : meta_type{};
    -
    1466 }
    -
    1467 
    -
    1469 class meta_sequence_container::meta_iterator {
    -
    1470  enum class operation : std::uint8_t {
    -
    1471  incr,
    -
    1472  deref
    -
    1473  };
    -
    1474 
    -
    1475  using vtable_type = void(const operation, const any &, void *);
    +
    1436 [[nodiscard]] inline meta_type meta_func::arg(const size_type index) const ENTT_NOEXCEPT {
    +
    1437  return index < arity() ? node->arg(index) : meta_type{};
    +
    1438 }
    +
    1439 
    +
    1445 class meta_sequence_container::meta_iterator final {
    +
    1446  friend class meta_sequence_container;
    +
    1447 
    +
    1448  using deref_fn_type = meta_any(const any &, const std::ptrdiff_t);
    +
    1449 
    +
    1450  template<typename It>
    +
    1451  static meta_any deref_fn(const any &value, const std::ptrdiff_t pos) {
    +
    1452  return meta_any{std::in_place_type<typename std::iterator_traits<It>::reference>, any_cast<const It &>(value)[pos]};
    +
    1453  }
    +
    1454 
    +
    1455 public:
    +
    1456  using difference_type = std::ptrdiff_t;
    +
    1457  using value_type = meta_any;
    +
    1458  using pointer = input_iterator_pointer<value_type>;
    +
    1459  using reference = value_type;
    +
    1460  using iterator_category = std::input_iterator_tag;
    +
    1461 
    +
    1462  meta_iterator() ENTT_NOEXCEPT
    +
    1463  : deref{},
    +
    1464  offset{},
    +
    1465  handle{} {}
    +
    1466 
    +
    1467  template<typename It>
    +
    1468  explicit meta_iterator(It iter, const difference_type init) ENTT_NOEXCEPT
    +
    1469  : deref{&deref_fn<It>},
    +
    1470  offset{init},
    +
    1471  handle{std::move(iter)} {}
    +
    1472 
    +
    1473  meta_iterator &operator++() ENTT_NOEXCEPT {
    +
    1474  return ++offset, *this;
    +
    1475  }
    1476 
    -
    1477  template<typename It>
    -
    1478  static void basic_vtable(const operation op, const any &value, void *other) {
    -
    1479  switch(op) {
    -
    1480  case operation::incr:
    -
    1481  ++any_cast<It &>(const_cast<any &>(value));
    -
    1482  break;
    -
    1483  case operation::deref:
    -
    1484  static_cast<meta_any *>(other)->emplace<typename std::iterator_traits<It>::reference>(*any_cast<const It &>(value));
    -
    1485  break;
    -
    1486  }
    -
    1487  }
    -
    1488 
    -
    1489 public:
    -
    1491  using difference_type = std::ptrdiff_t;
    -
    1493  using value_type = meta_any;
    -
    1495  using pointer = input_iterator_pointer<value_type>;
    -
    1497  using reference = value_type;
    -
    1499  using iterator_category = std::input_iterator_tag;
    +
    1477  meta_iterator operator++(int value) ENTT_NOEXCEPT {
    +
    1478  meta_iterator orig = *this;
    +
    1479  offset += ++value;
    +
    1480  return orig;
    +
    1481  }
    +
    1482 
    +
    1483  meta_iterator &operator--() ENTT_NOEXCEPT {
    +
    1484  return --offset, *this;
    +
    1485  }
    +
    1486 
    +
    1487  meta_iterator operator--(int value) ENTT_NOEXCEPT {
    +
    1488  meta_iterator orig = *this;
    +
    1489  offset -= ++value;
    +
    1490  return orig;
    +
    1491  }
    +
    1492 
    +
    1493  [[nodiscard]] reference operator*() const {
    +
    1494  return deref(handle, offset);
    +
    1495  }
    +
    1496 
    +
    1497  [[nodiscard]] pointer operator->() const {
    +
    1498  return operator*();
    +
    1499  }
    1500 
    -
    1502  meta_iterator() ENTT_NOEXCEPT = default;
    -
    1503 
    -
    1509  template<typename It>
    -
    1510  explicit meta_iterator(It iter)
    -
    1511  : vtable{&basic_vtable<It>},
    -
    1512  handle{std::move(iter)} {}
    -
    1513 
    -
    1515  meta_iterator &operator++() ENTT_NOEXCEPT {
    -
    1516  return vtable(operation::incr, handle, nullptr), *this;
    -
    1517  }
    +
    1501  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    1502  return static_cast<bool>(handle);
    +
    1503  }
    +
    1504 
    +
    1505  [[nodiscard]] bool operator==(const meta_iterator &other) const ENTT_NOEXCEPT {
    +
    1506  return offset == other.offset;
    +
    1507  }
    +
    1508 
    +
    1509  [[nodiscard]] bool operator!=(const meta_iterator &other) const ENTT_NOEXCEPT {
    +
    1510  return !(*this == other);
    +
    1511  }
    +
    1512 
    +
    1513 private:
    +
    1514  deref_fn_type *deref;
    +
    1515  difference_type offset;
    +
    1516  any handle;
    +
    1517 };
    1518 
    -
    1520  meta_iterator operator++(int) ENTT_NOEXCEPT {
    -
    1521  meta_iterator orig = *this;
    -
    1522  return ++(*this), orig;
    -
    1523  }
    +
    1519 class meta_associative_container::meta_iterator final {
    +
    1520  enum class operation : std::uint8_t {
    +
    1521  incr,
    +
    1522  deref
    +
    1523  };
    1524 
    -
    1529  [[nodiscard]] reference operator*() const {
    -
    1530  meta_any other;
    -
    1531  vtable(operation::deref, handle, &other);
    -
    1532  return other;
    -
    1533  }
    -
    1534 
    -
    1539  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    -
    1540  return operator*();
    -
    1541  }
    -
    1542 
    -
    1547  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    1548  return static_cast<bool>(handle);
    -
    1549  }
    -
    1550 
    -
    1556  [[nodiscard]] bool operator==(const meta_iterator &other) const ENTT_NOEXCEPT {
    -
    1557  return handle == other.handle;
    -
    1558  }
    -
    1559 
    -
    1565  [[nodiscard]] bool operator!=(const meta_iterator &other) const ENTT_NOEXCEPT {
    -
    1566  return !(*this == other);
    -
    1567  }
    -
    1568 
    -
    1573  any base() const ENTT_NOEXCEPT {
    -
    1574  return handle.as_ref();
    +
    1525  using vtable_type = void(const operation, const any &, std::pair<meta_any, meta_any> *);
    +
    1526 
    +
    1527  template<bool KeyOnly, typename It>
    +
    1528  static void basic_vtable(const operation op, const any &value, std::pair<meta_any, meta_any> *other) {
    +
    1529  switch(op) {
    +
    1530  case operation::incr:
    +
    1531  ++any_cast<It &>(const_cast<any &>(value));
    +
    1532  break;
    +
    1533  case operation::deref:
    +
    1534  const auto &it = any_cast<const It &>(value);
    +
    1535  if constexpr(KeyOnly) {
    +
    1536  other->first.emplace<decltype(*it)>(*it);
    +
    1537  } else {
    +
    1538  other->first.emplace<decltype((it->first))>(it->first);
    +
    1539  other->second.emplace<decltype((it->second))>(it->second);
    +
    1540  }
    +
    1541  break;
    +
    1542  }
    +
    1543  }
    +
    1544 
    +
    1545 public:
    +
    1546  using difference_type = std::ptrdiff_t;
    +
    1547  using value_type = std::pair<meta_any, meta_any>;
    +
    1548  using pointer = input_iterator_pointer<value_type>;
    +
    1549  using reference = value_type;
    +
    1550  using iterator_category = std::input_iterator_tag;
    +
    1551 
    +
    1552  meta_iterator() ENTT_NOEXCEPT
    +
    1553  : vtable{},
    +
    1554  handle{} {}
    +
    1555 
    +
    1556  template<bool KeyOnly, typename It>
    +
    1557  meta_iterator(std::integral_constant<bool, KeyOnly>, It iter) ENTT_NOEXCEPT
    +
    1558  : vtable{&basic_vtable<KeyOnly, It>},
    +
    1559  handle{std::move(iter)} {}
    +
    1560 
    +
    1561  meta_iterator &operator++() ENTT_NOEXCEPT {
    +
    1562  vtable(operation::incr, handle, nullptr);
    +
    1563  return *this;
    +
    1564  }
    +
    1565 
    +
    1566  meta_iterator operator++(int) ENTT_NOEXCEPT {
    +
    1567  meta_iterator orig = *this;
    +
    1568  return ++(*this), orig;
    +
    1569  }
    +
    1570 
    +
    1571  [[nodiscard]] reference operator*() const {
    +
    1572  reference other;
    +
    1573  vtable(operation::deref, handle, &other);
    +
    1574  return other;
    1575  }
    1576 
    -
    1577 private:
    -
    1578  vtable_type *vtable{};
    -
    1579  any handle{};
    -
    1580 };
    -
    1581 
    -
    1586 [[nodiscard]] inline meta_type meta_sequence_container::value_type() const ENTT_NOEXCEPT {
    -
    1587  return value_type_node;
    -
    1588 }
    -
    1589 
    -
    1594 [[nodiscard]] inline meta_sequence_container::size_type meta_sequence_container::size() const ENTT_NOEXCEPT {
    -
    1595  return size_fn(storage);
    -
    1596 }
    +
    1577  [[nodiscard]] pointer operator->() const {
    +
    1578  return operator*();
    +
    1579  }
    +
    1580 
    +
    1581  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    1582  return static_cast<bool>(handle);
    +
    1583  }
    +
    1584 
    +
    1585  [[nodiscard]] bool operator==(const meta_iterator &other) const ENTT_NOEXCEPT {
    +
    1586  return handle == other.handle;
    +
    1587  }
    +
    1588 
    +
    1589  [[nodiscard]] bool operator!=(const meta_iterator &other) const ENTT_NOEXCEPT {
    +
    1590  return !(*this == other);
    +
    1591  }
    +
    1592 
    +
    1593 private:
    +
    1594  vtable_type *vtable;
    +
    1595  any handle;
    +
    1596 };
    1597 
    -
    1603 inline bool meta_sequence_container::resize(const size_type sz) {
    -
    1604  return resize_fn(storage, sz);
    -
    1605 }
    -
    1606 
    -
    1611 inline bool meta_sequence_container::clear() {
    -
    1612  return clear_fn(storage);
    -
    1613 }
    -
    1614 
    -
    1619 [[nodiscard]] inline meta_sequence_container::iterator meta_sequence_container::begin() {
    -
    1620  return begin_fn(storage);
    -
    1621 }
    -
    1622 
    -
    1627 [[nodiscard]] inline meta_sequence_container::iterator meta_sequence_container::end() {
    -
    1628  return end_fn(storage);
    -
    1629 }
    -
    1630 
    -
    1637 inline meta_sequence_container::iterator meta_sequence_container::insert(iterator it, meta_any value) {
    -
    1638  return insert_fn(storage, it, value);
    -
    1639 }
    -
    1640 
    -
    1646 inline meta_sequence_container::iterator meta_sequence_container::erase(iterator it) {
    -
    1647  return erase_fn(storage, it);
    -
    1648 }
    -
    1649 
    -
    1656 [[nodiscard]] inline meta_any meta_sequence_container::operator[](const size_type pos) {
    -
    1657  return get_fn(storage, pos);
    -
    1658 }
    -
    1659 
    -
    1664 [[nodiscard]] inline meta_sequence_container::operator bool() const ENTT_NOEXCEPT {
    -
    1665  return static_cast<bool>(storage);
    -
    1666 }
    -
    1667 
    -
    1669 class meta_associative_container::meta_iterator {
    -
    1670  enum class operation : std::uint8_t {
    -
    1671  incr,
    -
    1672  deref
    -
    1673  };
    -
    1674 
    -
    1675  using vtable_type = void(const operation, const any &, void *);
    -
    1676 
    -
    1677  template<bool KeyOnly, typename It>
    -
    1678  static void basic_vtable(const operation op, const any &value, void *other) {
    -
    1679  switch(op) {
    -
    1680  case operation::incr:
    -
    1681  ++any_cast<It &>(const_cast<any &>(value));
    -
    1682  break;
    -
    1683  case operation::deref:
    -
    1684  const auto &it = any_cast<const It &>(value);
    -
    1685  if constexpr(KeyOnly) {
    -
    1686  static_cast<std::pair<meta_any, meta_any> *>(other)->first.emplace<decltype(*it)>(*it);
    -
    1687  } else {
    -
    1688  static_cast<std::pair<meta_any, meta_any> *>(other)->first.emplace<decltype((it->first))>(it->first);
    -
    1689  static_cast<std::pair<meta_any, meta_any> *>(other)->second.emplace<decltype((it->second))>(it->second);
    -
    1690  }
    -
    1691  break;
    -
    1692  }
    -
    1693  }
    -
    1694 
    -
    1695 public:
    -
    1697  using difference_type = std::ptrdiff_t;
    -
    1699  using value_type = std::pair<meta_any, meta_any>;
    -
    1701  using pointer = input_iterator_pointer<value_type>;
    -
    1703  using reference = value_type;
    -
    1705  using iterator_category = std::input_iterator_tag;
    +
    1607 [[nodiscard]] inline meta_type meta_sequence_container::value_type() const ENTT_NOEXCEPT {
    +
    1608  return value_type_node;
    +
    1609 }
    +
    1610 
    +
    1615 [[nodiscard]] inline meta_sequence_container::size_type meta_sequence_container::size() const ENTT_NOEXCEPT {
    +
    1616  return size_fn(storage);
    +
    1617 }
    +
    1618 
    +
    1624 inline bool meta_sequence_container::resize(const size_type sz) {
    +
    1625  return resize_fn(storage, sz);
    +
    1626 }
    +
    1627 
    +
    1632 inline bool meta_sequence_container::clear() {
    +
    1633  return resize_fn(storage, 0u);
    +
    1634 }
    +
    1635 
    +
    1640 [[nodiscard]] inline meta_sequence_container::iterator meta_sequence_container::begin() {
    +
    1641  return iter_fn(storage, false);
    +
    1642 }
    +
    1643 
    +
    1648 [[nodiscard]] inline meta_sequence_container::iterator meta_sequence_container::end() {
    +
    1649  return iter_fn(storage, true);
    +
    1650 }
    +
    1651 
    +
    1658 inline meta_sequence_container::iterator meta_sequence_container::insert(iterator it, meta_any value) {
    +
    1659  return insert_fn(storage, it.offset, value);
    +
    1660 }
    +
    1661 
    +
    1667 inline meta_sequence_container::iterator meta_sequence_container::erase(iterator it) {
    +
    1668  return erase_fn(storage, it.offset);
    +
    1669 }
    +
    1670 
    +
    1677 [[nodiscard]] inline meta_any meta_sequence_container::operator[](const size_type pos) {
    +
    1678  auto it = begin();
    +
    1679  it.operator++(static_cast<int>(pos) - 1);
    +
    1680  return *it;
    +
    1681 }
    +
    1682 
    +
    1687 [[nodiscard]] inline meta_sequence_container::operator bool() const ENTT_NOEXCEPT {
    +
    1688  return static_cast<bool>(storage);
    +
    1689 }
    +
    1690 
    +
    1695 [[nodiscard]] inline bool meta_associative_container::key_only() const ENTT_NOEXCEPT {
    +
    1696  return key_only_container;
    +
    1697 }
    +
    1698 
    +
    1703 [[nodiscard]] inline meta_type meta_associative_container::key_type() const ENTT_NOEXCEPT {
    +
    1704  return key_type_node;
    +
    1705 }
    1706 
    -
    1708  meta_iterator() ENTT_NOEXCEPT = default;
    -
    1709 
    -
    1716  template<bool KeyOnly, typename It>
    -
    1717  meta_iterator(std::integral_constant<bool, KeyOnly>, It iter)
    -
    1718  : vtable{&basic_vtable<KeyOnly, It>},
    -
    1719  handle{std::move(iter)} {}
    -
    1720 
    -
    1722  meta_iterator &operator++() ENTT_NOEXCEPT {
    -
    1723  return vtable(operation::incr, handle, nullptr), *this;
    -
    1724  }
    -
    1725 
    -
    1727  meta_iterator operator++(int) ENTT_NOEXCEPT {
    -
    1728  meta_iterator orig = *this;
    -
    1729  return ++(*this), orig;
    -
    1730  }
    -
    1731 
    -
    1736  [[nodiscard]] reference operator*() const {
    -
    1737  reference other;
    -
    1738  vtable(operation::deref, handle, &other);
    -
    1739  return other;
    -
    1740  }
    -
    1741 
    -
    1746  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    -
    1747  return operator*();
    -
    1748  }
    +
    1711 [[nodiscard]] inline meta_type meta_associative_container::mapped_type() const ENTT_NOEXCEPT {
    +
    1712  return mapped_type_node;
    +
    1713 }
    +
    1714 
    +
    1716 [[nodiscard]] inline meta_type meta_associative_container::value_type() const ENTT_NOEXCEPT {
    +
    1717  return value_type_node;
    +
    1718 }
    +
    1719 
    +
    1721 [[nodiscard]] inline meta_associative_container::size_type meta_associative_container::size() const ENTT_NOEXCEPT {
    +
    1722  return size_fn(storage);
    +
    1723 }
    +
    1724 
    +
    1726 inline bool meta_associative_container::clear() {
    +
    1727  return clear_fn(storage);
    +
    1728 }
    +
    1729 
    +
    1731 [[nodiscard]] inline meta_associative_container::iterator meta_associative_container::begin() {
    +
    1732  return iter_fn(storage, false);
    +
    1733 }
    +
    1734 
    +
    1736 [[nodiscard]] inline meta_associative_container::iterator meta_associative_container::end() {
    +
    1737  return iter_fn(storage, true);
    +
    1738 }
    +
    1739 
    +
    1746 inline bool meta_associative_container::insert(meta_any key, meta_any value = {}) {
    +
    1747  return insert_fn(storage, key, value);
    +
    1748 }
    1749 
    -
    1754  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    1755  return static_cast<bool>(handle);
    -
    1756  }
    -
    1757 
    -
    1763  [[nodiscard]] bool operator==(const meta_iterator &other) const ENTT_NOEXCEPT {
    -
    1764  return handle == other.handle;
    -
    1765  }
    -
    1766 
    -
    1772  [[nodiscard]] bool operator!=(const meta_iterator &other) const ENTT_NOEXCEPT {
    -
    1773  return !(*this == other);
    -
    1774  }
    +
    1755 inline bool meta_associative_container::erase(meta_any key) {
    +
    1756  return erase_fn(storage, key);
    +
    1757 }
    +
    1758 
    +
    1764 [[nodiscard]] inline meta_associative_container::iterator meta_associative_container::find(meta_any key) {
    +
    1765  return find_fn(storage, key);
    +
    1766 }
    +
    1767 
    +
    1772 [[nodiscard]] inline meta_associative_container::operator bool() const ENTT_NOEXCEPT {
    +
    1773  return static_cast<bool>(storage);
    +
    1774 }
    1775 
    -
    1776 private:
    -
    1777  vtable_type *vtable{};
    -
    1778  any handle{};
    -
    1779 };
    -
    1780 
    -
    1785 [[nodiscard]] inline bool meta_associative_container::key_only() const ENTT_NOEXCEPT {
    -
    1786  return key_only_container;
    -
    1787 }
    -
    1788 
    -
    1793 [[nodiscard]] inline meta_type meta_associative_container::key_type() const ENTT_NOEXCEPT {
    -
    1794  return key_type_node;
    -
    1795 }
    -
    1796 
    -
    1801 [[nodiscard]] inline meta_type meta_associative_container::mapped_type() const ENTT_NOEXCEPT {
    -
    1802  return mapped_type_node;
    -
    1803 }
    -
    1804 
    -
    1806 [[nodiscard]] inline meta_type meta_associative_container::value_type() const ENTT_NOEXCEPT {
    -
    1807  return value_type_node;
    -
    1808 }
    -
    1809 
    -
    1811 [[nodiscard]] inline meta_associative_container::size_type meta_associative_container::size() const ENTT_NOEXCEPT {
    -
    1812  return size_fn(storage);
    -
    1813 }
    -
    1814 
    -
    1816 inline bool meta_associative_container::clear() {
    -
    1817  return clear_fn(storage);
    -
    1818 }
    -
    1819 
    -
    1821 [[nodiscard]] inline meta_associative_container::iterator meta_associative_container::begin() {
    -
    1822  return begin_fn(storage);
    -
    1823 }
    -
    1824 
    -
    1826 [[nodiscard]] inline meta_associative_container::iterator meta_associative_container::end() {
    -
    1827  return end_fn(storage);
    -
    1828 }
    -
    1829 
    -
    1836 inline bool meta_associative_container::insert(meta_any key, meta_any value = {}) {
    -
    1837  return insert_fn(storage, key, value);
    -
    1838 }
    -
    1839 
    -
    1845 inline bool meta_associative_container::erase(meta_any key) {
    -
    1846  return erase_fn(storage, key);
    -
    1847 }
    -
    1848 
    -
    1854 [[nodiscard]] inline meta_associative_container::iterator meta_associative_container::find(meta_any key) {
    -
    1855  return find_fn(storage, key);
    -
    1856 }
    -
    1857 
    -
    1862 [[nodiscard]] inline meta_associative_container::operator bool() const ENTT_NOEXCEPT {
    -
    1863  return static_cast<bool>(storage);
    -
    1864 }
    -
    1865 
    -
    1866 } // namespace entt
    -
    1867 
    -
    1868 #endif
    +
    1776 } // namespace entt
    +
    1777 
    +
    1778 #endif
    entt::basic_any<>
    -
    entt::basic_any::as_ref
    basic_any as_ref()
    Aliasing constructor.
    Definition: any.hpp:370
    -
    entt::basic_sparse_set::data
    pointer data() const
    Direct access to the internal packed array.
    Definition: sparse_set.hpp:487
    -
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:237
    -
    entt::basic_storage::emplace
    value_type & emplace(const entity_type entt, Args &&...args)
    Assigns an entity to a storage and constructs its object.
    Definition: storage.hpp:690
    -
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:148
    +
    entt::basic_any::as_ref
    basic_any as_ref()
    Aliasing constructor.
    Definition: any.hpp:366
    +
    entt::basic_sparse_set::data
    pointer data() const
    Direct access to the internal packed array.
    Definition: sparse_set.hpp:481
    +
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:234
    +
    entt::basic_storage::emplace
    value_type & emplace(const entity_type entt, Args &&...args)
    Assigns an entity to a storage and constructs its object.
    Definition: storage.hpp:661
    +
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:141
    entt::meta_any::meta_any
    meta_any()
    Default constructor.
    Definition: meta.hpp:200
    -
    entt::meta_any::assign
    bool assign(const meta_any &other)
    Copy assigns a value to the contained object without replacing it.
    Definition: meta.hpp:1439
    -
    entt::meta_any::operator*
    meta_any operator*() const
    Indirection operator for dereferencing opaque objects.
    Definition: meta.hpp:550
    -
    entt::meta_any::operator==
    bool operator==(const meta_any &other) const
    Checks if two wrappers differ in their content.
    Definition: meta.hpp:569
    +
    entt::meta_any::assign
    bool assign(const meta_any &other)
    Assigns a value to the contained object without replacing it.
    Definition: meta.hpp:1411
    +
    entt::meta_any::operator*
    meta_any operator*() const
    Indirection operator for dereferencing opaque objects.
    Definition: meta.hpp:531
    +
    entt::meta_any::operator==
    bool operator==(const meta_any &other) const
    Checks if two wrappers differ in their content.
    Definition: meta.hpp:546
    entt::meta_any::meta_any
    meta_any(std::in_place_type_t< Type >, Args &&...args)
    Constructs a wrapper by directly initializing the new object.
    Definition: meta.hpp:212
    -
    entt::meta_any::emplace
    void emplace(Args &&...args)
    Replaces the contained object by creating a new instance directly.
    Definition: meta.hpp:478
    -
    entt::meta_any::data
    const void * data() const
    Returns an opaque pointer to the contained instance.
    Definition: meta.hpp:295
    -
    entt::meta_any::cast
    Type cast()
    Tries to cast an instance to a given type.
    Definition: meta.hpp:403
    +
    entt::meta_any::emplace
    void emplace(Args &&...args)
    Replaces the contained object by creating a new instance directly.
    Definition: meta.hpp:467
    +
    entt::meta_any::data
    const void * data() const
    Returns an opaque pointer to the contained instance.
    Definition: meta.hpp:289
    +
    entt::meta_any::cast
    Type cast()
    Tries to cast an instance to a given type.
    Definition: meta.hpp:397
    entt::meta_any::meta_any
    meta_any(const meta_any &other)=default
    Copy constructor.
    -
    entt::meta_any::allow_cast
    meta_any allow_cast(const meta_type &type) const
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:1408
    -
    entt::meta_any::data
    void * data()
    Returns an opaque pointer to the contained instance.
    Definition: meta.hpp:300
    -
    entt::meta_any::get
    meta_any get(const id_type id) const
    Gets the value of a given variable.
    Definition: meta.hpp:1400
    -
    entt::meta_any::allow_cast
    meta_any allow_cast() const
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:442
    -
    entt::meta_any::as_sequence_container
    meta_sequence_container as_sequence_container()
    Returns a sequence container proxy.
    Definition: meta.hpp:511
    +
    entt::meta_any::allow_cast
    meta_any allow_cast(const meta_type &type) const
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:1380
    +
    entt::meta_any::data
    void * data()
    Returns an opaque pointer to the contained instance.
    Definition: meta.hpp:294
    +
    entt::meta_any::get
    meta_any get(const id_type id) const
    Gets the value of a given variable.
    Definition: meta.hpp:1372
    +
    entt::meta_any::allow_cast
    meta_any allow_cast() const
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:436
    +
    entt::meta_any::as_sequence_container
    meta_sequence_container as_sequence_container()
    Returns a sequence container proxy.
    Definition: meta.hpp:492
    entt::meta_any::meta_any
    meta_any(Type &&value)
    Constructs a wrapper from a given value.
    Definition: meta.hpp:223
    entt::meta_any::~meta_any
    ~meta_any()
    Frees the internal storage, whatever it means.
    Definition: meta.hpp:242
    entt::meta_any::operator=
    meta_any & operator=(meta_any &&other)
    Move assignment operator.
    Definition: meta.hpp:264
    -
    entt::meta_any::cast
    Type cast() const
    Tries to cast an instance to a given type.
    Definition: meta.hpp:395
    -
    entt::meta_any::as_sequence_container
    meta_sequence_container as_sequence_container() const
    Returns a sequence container proxy.
    Definition: meta.hpp:519
    -
    entt::meta_any::type
    meta_type type() const
    Returns the type of the underlying object.
    Definition: meta.hpp:1381
    -
    entt::meta_any::reset
    void reset()
    Destroys contained object.
    Definition: meta.hpp:500
    -
    entt::meta_any::try_cast
    Type * try_cast()
    Tries to cast an instance to a given type.
    Definition: meta.hpp:369
    +
    entt::meta_any::cast
    Type cast() const
    Tries to cast an instance to a given type.
    Definition: meta.hpp:389
    +
    entt::meta_any::as_sequence_container
    meta_sequence_container as_sequence_container() const
    Returns a sequence container proxy.
    Definition: meta.hpp:500
    +
    entt::meta_any::type
    meta_type type() const
    Returns the object type if any, type_id<void>() otherwise.
    Definition: meta.hpp:1353
    +
    entt::meta_any::reset
    void reset()
    Destroys contained object.
    Definition: meta.hpp:481
    +
    entt::meta_any::try_cast
    Type * try_cast()
    Tries to cast an instance to a given type.
    Definition: meta.hpp:363
    entt::meta_any::operator=
    meta_any & operator=(const meta_any &other)
    Copy assignment operator.
    Definition: meta.hpp:251
    -
    entt::meta_any::try_cast
    const Type * try_cast() const
    Tries to cast an instance to a given type.
    Definition: meta.hpp:351
    -
    entt::meta_any::set
    bool set(const id_type id, Type &&value)
    Sets the value of a given variable.
    Definition: meta.hpp:1396
    -
    entt::meta_any::as_ref
    meta_any as_ref() const
    Aliasing constructor.
    Definition: meta.hpp:582
    -
    entt::meta_any::owner
    bool owner() const
    Returns true if a wrapper owns its object, false otherwise.
    Definition: meta.hpp:590
    -
    entt::meta_any::invoke
    meta_any invoke(const id_type id, Args &&...args) const
    Invokes the underlying function, if possible.
    Definition: meta.hpp:1386
    -
    entt::meta_any::as_associative_container
    meta_associative_container as_associative_container() const
    Returns an associative container proxy.
    Definition: meta.hpp:538
    -
    entt::meta_any::as_ref
    meta_any as_ref()
    Aliasing constructor.
    Definition: meta.hpp:577
    +
    entt::meta_any::try_cast
    const Type * try_cast() const
    Tries to cast an instance to a given type.
    Definition: meta.hpp:345
    +
    entt::meta_any::set
    bool set(const id_type id, Type &&value)
    Sets the value of a given variable.
    Definition: meta.hpp:1368
    +
    entt::meta_any::as_ref
    meta_any as_ref() const
    Aliasing constructor.
    Definition: meta.hpp:556
    +
    entt::meta_any::owner
    bool owner() const
    Returns true if a wrapper owns its object, false otherwise.
    Definition: meta.hpp:561
    +
    entt::meta_any::invoke
    meta_any invoke(const id_type id, Args &&...args) const
    Invokes the underlying function, if possible.
    Definition: meta.hpp:1358
    +
    entt::meta_any::as_associative_container
    meta_associative_container as_associative_container() const
    Returns an associative container proxy.
    Definition: meta.hpp:519
    +
    entt::meta_any::as_ref
    meta_any as_ref()
    Aliasing constructor.
    Definition: meta.hpp:551
    entt::meta_any::operator=
    std::enable_if_t<!std::is_same_v< std::decay_t< Type >, meta_any >, meta_any & > operator=(Type &&value)
    Value assignment operator.
    Definition: meta.hpp:280
    -
    entt::meta_any::allow_cast
    bool allow_cast()
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:458
    -
    entt::meta_any::allow_cast
    bool allow_cast(const meta_type &type)
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:423
    +
    entt::meta_any::allow_cast
    bool allow_cast()
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:452
    +
    entt::meta_any::allow_cast
    bool allow_cast(const meta_type &type)
    Converts an object in such a way that a given cast becomes viable.
    Definition: meta.hpp:417
    entt::meta_any::meta_any
    meta_any(meta_any &&other)
    Move constructor.
    Definition: meta.hpp:236
    -
    entt::meta_any::as_associative_container
    meta_associative_container as_associative_container()
    Returns an associative container proxy.
    Definition: meta.hpp:530
    -
    entt::meta_associative_container::meta_iterator
    Opaque iterator for associative containers.
    Definition: meta.hpp:1669
    -
    entt::meta_associative_container::meta_iterator::operator!=
    bool operator!=(const meta_iterator &other) const
    Checks if two iterators refer to the same element.
    Definition: meta.hpp:1772
    -
    entt::meta_associative_container::meta_iterator::meta_iterator
    meta_iterator()=default
    Default constructor.
    -
    entt::meta_associative_container::meta_iterator::reference
    value_type reference
    Reference type, it's not an actual reference.
    Definition: meta.hpp:1703
    -
    entt::meta_associative_container::meta_iterator::operator==
    bool operator==(const meta_iterator &other) const
    Checks if two iterators refer to the same element.
    Definition: meta.hpp:1763
    -
    entt::meta_associative_container::meta_iterator::iterator_category
    std::input_iterator_tag iterator_category
    Iterator category.
    Definition: meta.hpp:1705
    -
    entt::meta_associative_container::meta_iterator::difference_type
    std::ptrdiff_t difference_type
    Signed integer type.
    Definition: meta.hpp:1697
    -
    entt::meta_associative_container::meta_iterator::operator*
    reference operator*() const
    Indirection operator for accessing the pointed opaque object.
    Definition: meta.hpp:1736
    -
    entt::meta_associative_container::meta_iterator::operator->
    pointer operator->() const
    Access operator for accessing the pointed opaque object.
    Definition: meta.hpp:1746
    -
    entt::meta_associative_container::meta_iterator::operator++
    meta_iterator operator++(int)
    Post-increment operator.
    Definition: meta.hpp:1727
    -
    entt::meta_associative_container::meta_iterator::operator++
    meta_iterator & operator++()
    Pre-increment operator.
    Definition: meta.hpp:1722
    -
    entt::meta_associative_container::meta_iterator::value_type
    std::pair< meta_any, meta_any > value_type
    Type of elements returned by the iterator.
    Definition: meta.hpp:1699
    -
    entt::meta_associative_container
    Proxy object for associative containers.
    Definition: meta.hpp:83
    -
    entt::meta_associative_container::key_only
    bool key_only() const
    Returns true if a container is also key-only, false otherwise.
    Definition: meta.hpp:1785
    +
    entt::meta_any::as_associative_container
    meta_associative_container as_associative_container()
    Returns an associative container proxy.
    Definition: meta.hpp:511
    +
    entt::meta_associative_container
    Proxy object for associative containers.
    Definition: meta.hpp:78
    +
    entt::meta_associative_container::key_only
    bool key_only() const
    Returns true if a container is also key-only, false otherwise.
    Definition: meta.hpp:1695
    entt::meta_associative_container::meta_associative_container
    meta_associative_container()=default
    Default constructor.
    -
    entt::meta_associative_container::value_type
    meta_type value_type() const
    Returns the meta value type of a container.
    Definition: meta.hpp:1806
    -
    entt::meta_associative_container::find
    iterator find(meta_any)
    Returns an iterator to the element with a given key, if any.
    Definition: meta.hpp:1854
    -
    entt::meta_associative_container::insert
    bool insert(meta_any, meta_any)
    Inserts an element (a key/value pair) into a container.
    Definition: meta.hpp:1836
    -
    entt::meta_associative_container::end
    iterator end()
    Returns an iterator that is past the last element of a container.
    Definition: meta.hpp:1826
    -
    entt::meta_associative_container::begin
    iterator begin()
    Returns an iterator to the first element of a container.
    Definition: meta.hpp:1821
    -
    entt::meta_associative_container::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: meta.hpp:88
    -
    entt::meta_associative_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:90
    -
    entt::meta_associative_container::erase
    bool erase(meta_any)
    Removes the specified element from a container.
    Definition: meta.hpp:1845
    -
    entt::meta_associative_container::key_type
    meta_type key_type() const
    Returns the meta key type of a container.
    Definition: meta.hpp:1793
    -
    entt::meta_associative_container::mapped_type
    meta_type mapped_type() const
    Returns the meta mapped type of a container.
    Definition: meta.hpp:1801
    -
    entt::meta_associative_container::size
    size_type size() const
    Returns the size of a container.
    Definition: meta.hpp:1811
    -
    entt::meta_associative_container::clear
    bool clear()
    Clears the content of a container.
    Definition: meta.hpp:1816
    -
    entt::meta_sequence_container::meta_iterator
    Opaque iterator for sequence containers.
    Definition: meta.hpp:1469
    -
    entt::meta_sequence_container::meta_iterator::base
    any base() const
    Returns the underlying iterator.
    Definition: meta.hpp:1573
    -
    entt::meta_sequence_container::meta_iterator::operator!=
    bool operator!=(const meta_iterator &other) const
    Checks if two iterators refer to the same element.
    Definition: meta.hpp:1565
    -
    entt::meta_sequence_container::meta_iterator::operator++
    meta_iterator operator++(int)
    Post-increment operator.
    Definition: meta.hpp:1520
    -
    entt::meta_sequence_container::meta_iterator::value_type
    meta_any value_type
    Type of elements returned by the iterator.
    Definition: meta.hpp:1493
    -
    entt::meta_sequence_container::meta_iterator::meta_iterator
    meta_iterator()=default
    Default constructor.
    -
    entt::meta_sequence_container::meta_iterator::operator++
    meta_iterator & operator++()
    Pre-increment operator.
    Definition: meta.hpp:1515
    -
    entt::meta_sequence_container::meta_iterator::iterator_category
    std::input_iterator_tag iterator_category
    Iterator category.
    Definition: meta.hpp:1499
    -
    entt::meta_sequence_container::meta_iterator::operator*
    reference operator*() const
    Indirection operator for accessing the pointed opaque object.
    Definition: meta.hpp:1529
    -
    entt::meta_sequence_container::meta_iterator::operator->
    pointer operator->() const
    Access operator for accessing the pointed opaque object.
    Definition: meta.hpp:1539
    -
    entt::meta_sequence_container::meta_iterator::operator==
    bool operator==(const meta_iterator &other) const
    Checks if two iterators refer to the same element.
    Definition: meta.hpp:1556
    -
    entt::meta_sequence_container::meta_iterator::difference_type
    std::ptrdiff_t difference_type
    Signed integer type.
    Definition: meta.hpp:1491
    -
    entt::meta_sequence_container
    Proxy object for sequence containers.
    Definition: meta.hpp:28
    +
    entt::meta_associative_container::value_type
    meta_type value_type() const
    Returns the meta value type of a container.
    Definition: meta.hpp:1716
    +
    entt::meta_associative_container::find
    iterator find(meta_any)
    Returns an iterator to the element with a given key, if any.
    Definition: meta.hpp:1764
    +
    entt::meta_associative_container::insert
    bool insert(meta_any, meta_any)
    Inserts an element (a key/value pair) into a container.
    Definition: meta.hpp:1746
    +
    entt::meta_associative_container::end
    iterator end()
    Returns an iterator that is past the last element of a container.
    Definition: meta.hpp:1736
    +
    entt::meta_associative_container::begin
    iterator begin()
    Returns an iterator to the first element of a container.
    Definition: meta.hpp:1731
    +
    entt::meta_associative_container::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: meta.hpp:83
    +
    entt::meta_associative_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:85
    +
    entt::meta_associative_container::erase
    bool erase(meta_any)
    Removes the specified element from a container.
    Definition: meta.hpp:1755
    +
    entt::meta_associative_container::key_type
    meta_type key_type() const
    Returns the meta key type of a container.
    Definition: meta.hpp:1703
    +
    entt::meta_associative_container::mapped_type
    meta_type mapped_type() const
    Returns the meta mapped type of a container.
    Definition: meta.hpp:1711
    +
    entt::meta_associative_container::size
    size_type size() const
    Returns the size of a container.
    Definition: meta.hpp:1721
    +
    entt::meta_associative_container::clear
    bool clear()
    Clears the content of a container.
    Definition: meta.hpp:1726
    +
    entt::meta_sequence_container
    Proxy object for sequence containers.
    Definition: meta.hpp:29
    entt::meta_sequence_container::meta_sequence_container
    meta_sequence_container()=default
    Default constructor.
    -
    entt::meta_sequence_container::end
    iterator end()
    Returns an iterator that is past the last element of a container.
    Definition: meta.hpp:1627
    -
    entt::meta_sequence_container::value_type
    meta_type value_type() const
    Returns the meta value type of a container.
    Definition: meta.hpp:1586
    -
    entt::meta_sequence_container::operator[]
    meta_any operator[](const size_type)
    Returns a reference to the element at a given location of a container (no bounds checking is performe...
    Definition: meta.hpp:1656
    -
    entt::meta_sequence_container::resize
    bool resize(const size_type)
    Resizes a container to contain a given number of elements.
    Definition: meta.hpp:1603
    -
    entt::meta_sequence_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:35
    -
    entt::meta_sequence_container::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: meta.hpp:33
    -
    entt::meta_sequence_container::erase
    iterator erase(iterator)
    Removes a given element from a container.
    Definition: meta.hpp:1646
    -
    entt::meta_sequence_container::insert
    iterator insert(iterator, meta_any)
    Inserts an element at a specified location of a container.
    Definition: meta.hpp:1637
    -
    entt::meta_sequence_container::size
    size_type size() const
    Returns the size of a container.
    Definition: meta.hpp:1594
    -
    entt::meta_sequence_container::begin
    iterator begin()
    Returns an iterator to the first element of a container.
    Definition: meta.hpp:1619
    -
    entt::meta_sequence_container::clear
    bool clear()
    Clears the content of a container.
    Definition: meta.hpp:1611
    -
    entt::meta_type
    Opaque wrapper for types.
    Definition: meta.hpp:980
    -
    entt::meta_type::info
    const type_info & info() const
    Returns the type info object of the underlying type.
    Definition: meta.hpp:1043
    -
    entt::meta_type::template_arg
    meta_type template_arg(const size_type index) const
    Returns the type of the i-th template argument of a type.
    Definition: meta.hpp:1163
    -
    entt::meta_type::is_associative_container
    bool is_associative_container() const
    Checks whether a type refers to an associative container or not.
    Definition: meta.hpp:1125
    -
    entt::meta_type::func
    meta_range< meta_func > func() const
    Returns a range to visit registered top-level functions.
    Definition: meta.hpp:1208
    -
    entt::meta_type::node_type
    internal::meta_type_node node_type
    Node type.
    Definition: meta.hpp:1022
    -
    entt::meta_type::base
    meta_range< meta_type, internal::meta_base_node > base() const
    Returns a range to visit registered top-level base meta types.
    Definition: meta.hpp:1171
    -
    entt::meta_type::operator==
    bool operator==(const meta_type &other) const
    Checks if two objects refer to the same type.
    Definition: meta.hpp:1363
    -
    entt::meta_type::is_arithmetic
    bool is_arithmetic() const
    Checks whether a type refers to an arithmetic type or not.
    Definition: meta.hpp:1068
    -
    entt::meta_type::base
    meta_type base(const id_type id) const
    Lookup function for registered base meta types.
    Definition: meta.hpp:1180
    -
    entt::meta_type::func
    meta_func func(const id_type id) const
    Lookup function for registered meta functions.
    Definition: meta.hpp:1222
    -
    entt::meta_type::construct
    meta_any construct(Args &&...args) const
    Creates an instance of the underlying type, if possible.
    Definition: meta.hpp:1252
    -
    entt::meta_type::prop
    meta_prop prop(meta_any key) const
    Lookup function for meta properties.
    Definition: meta.hpp:1346
    -
    entt::meta_type::size_of
    size_type size_of() const
    Returns the size of the underlying type if known.
    Definition: meta.hpp:1059
    -
    entt::meta_type::data
    meta_data data(const id_type id) const
    Lookup function for registered meta data.
    Definition: meta.hpp:1200
    -
    entt::meta_type::set
    bool set(const id_type id, meta_handle instance, Type &&value) const
    Sets the value of a given variable.
    Definition: meta.hpp:1310
    -
    entt::meta_type::is_pointer
    bool is_pointer() const
    Checks whether a type refers to a pointer or not.
    Definition: meta.hpp:1100
    -
    entt::meta_type::is_class
    bool is_class() const
    Checks whether a type refers to a class or not.
    Definition: meta.hpp:1092
    -
    entt::meta_type::invoke
    meta_any invoke(const id_type id, meta_handle instance, Args &&...args) const
    Invokes a function given an identifier, if possible.
    Definition: meta.hpp:1289
    -
    entt::meta_type::size_type
    typename node_type::size_type size_type
    Unsigned integer type.
    Definition: meta.hpp:1026
    -
    entt::meta_type::is_pointer_like
    bool is_pointer_like() const
    Checks whether a type is a pointer-like type or not.
    Definition: meta.hpp:1109
    -
    entt::meta_type::id
    id_type id() const
    Returns the identifier assigned to a type.
    Definition: meta.hpp:1051
    -
    entt::meta_type::is_array
    bool is_array() const
    Checks whether a type refers to an array type or not.
    Definition: meta.hpp:1076
    -
    entt::meta_type::is_sequence_container
    bool is_sequence_container() const
    Checks whether a type refers to a sequence container or not.
    Definition: meta.hpp:1117
    -
    entt::meta_type::get
    meta_any get(const id_type id, meta_handle instance) const
    Gets the value of a given variable.
    Definition: meta.hpp:1325
    -
    entt::meta_type::meta_type
    meta_type(const base_node_type *curr)
    Constructs an instance from a given base node.
    Definition: meta.hpp:1036
    -
    entt::meta_type::construct
    meta_any construct(meta_any *const args, const size_type sz) const
    Creates an instance of the underlying type, if possible.
    Definition: meta.hpp:1237
    -
    entt::meta_type::template_arity
    size_type template_arity() const
    Returns the number of template arguments.
    Definition: meta.hpp:1143
    -
    entt::meta_type::is_enum
    bool is_enum() const
    Checks whether a type refers to an enum or not.
    Definition: meta.hpp:1084
    -
    entt::meta_type::meta_type
    meta_type(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:1029
    -
    entt::meta_type::invoke
    meta_any invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const
    Invokes a function given an identifier, if possible.
    Definition: meta.hpp:1272
    -
    entt::meta_type::is_template_specialization
    bool is_template_specialization() const
    Checks whether a type refers to a recognized class template specialization or not.
    Definition: meta.hpp:1135
    -
    entt::meta_type::base_node_type
    internal::meta_base_node base_node_type
    Node type.
    Definition: meta.hpp:1024
    -
    entt::meta_type::template_type
    meta_type template_type() const
    Returns a tag for the class template of the underlying type.
    Definition: meta.hpp:1154
    -
    entt::meta_type::data
    meta_range< meta_data > data() const
    Returns a range to visit registered top-level meta data.
    Definition: meta.hpp:1188
    -
    entt::meta_type::prop
    meta_range< meta_prop > prop() const
    Returns a range to visit registered top-level meta properties.
    Definition: meta.hpp:1334
    -
    entt::type_info
    Implementation specific information about a type.
    Definition: type_info.hpp:141
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt::meta_sequence_container::end
    iterator end()
    Returns an iterator that is past the last element of a container.
    Definition: meta.hpp:1648
    +
    entt::meta_sequence_container::value_type
    meta_type value_type() const
    Returns the meta value type of a container.
    Definition: meta.hpp:1607
    +
    entt::meta_sequence_container::operator[]
    meta_any operator[](const size_type)
    Returns a reference to the element at a given location of a container (no bounds checking is performe...
    Definition: meta.hpp:1677
    +
    entt::meta_sequence_container::resize
    bool resize(const size_type)
    Resizes a container to contain a given number of elements.
    Definition: meta.hpp:1624
    +
    entt::meta_sequence_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:36
    +
    entt::meta_sequence_container::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: meta.hpp:34
    +
    entt::meta_sequence_container::erase
    iterator erase(iterator)
    Removes a given element from a container.
    Definition: meta.hpp:1667
    +
    entt::meta_sequence_container::insert
    iterator insert(iterator, meta_any)
    Inserts an element at a specified location of a container.
    Definition: meta.hpp:1658
    +
    entt::meta_sequence_container::size
    size_type size() const
    Returns the size of a container.
    Definition: meta.hpp:1615
    +
    entt::meta_sequence_container::begin
    iterator begin()
    Returns an iterator to the first element of a container.
    Definition: meta.hpp:1640
    +
    entt::meta_sequence_container::clear
    bool clear()
    Clears the content of a container.
    Definition: meta.hpp:1632
    +
    entt::meta_type
    Opaque wrapper for types.
    Definition: meta.hpp:949
    +
    entt::meta_type::info
    const type_info & info() const
    Returns the type info object of the underlying type.
    Definition: meta.hpp:1012
    +
    entt::meta_type::template_arg
    meta_type template_arg(const size_type index) const
    Returns the type of the i-th template argument of a type.
    Definition: meta.hpp:1132
    +
    entt::meta_type::is_associative_container
    bool is_associative_container() const
    Checks whether a type refers to an associative container or not.
    Definition: meta.hpp:1094
    +
    entt::meta_type::func
    meta_range< meta_func > func() const
    Returns a range to visit registered top-level functions.
    Definition: meta.hpp:1177
    +
    entt::meta_type::node_type
    internal::meta_type_node node_type
    Node type.
    Definition: meta.hpp:991
    +
    entt::meta_type::base
    meta_range< meta_type, internal::meta_base_node > base() const
    Returns a range to visit registered top-level base meta types.
    Definition: meta.hpp:1140
    +
    entt::meta_type::operator==
    bool operator==(const meta_type &other) const
    Checks if two objects refer to the same type.
    Definition: meta.hpp:1335
    +
    entt::meta_type::is_arithmetic
    bool is_arithmetic() const
    Checks whether a type refers to an arithmetic type or not.
    Definition: meta.hpp:1037
    +
    entt::meta_type::base
    meta_type base(const id_type id) const
    Lookup function for registered base meta types.
    Definition: meta.hpp:1149
    +
    entt::meta_type::func
    meta_func func(const id_type id) const
    Lookup function for registered meta functions.
    Definition: meta.hpp:1191
    +
    entt::meta_type::construct
    meta_any construct(Args &&...args) const
    Creates an instance of the underlying type, if possible.
    Definition: meta.hpp:1221
    +
    entt::meta_type::prop
    meta_prop prop(meta_any key) const
    Lookup function for meta properties.
    Definition: meta.hpp:1318
    +
    entt::meta_type::size_of
    size_type size_of() const
    Returns the size of the underlying type if known.
    Definition: meta.hpp:1028
    +
    entt::meta_type::data
    meta_data data(const id_type id) const
    Lookup function for registered meta data.
    Definition: meta.hpp:1169
    +
    entt::meta_type::set
    bool set(const id_type id, meta_handle instance, Type &&value) const
    Sets the value of a given variable.
    Definition: meta.hpp:1282
    +
    entt::meta_type::is_pointer
    bool is_pointer() const
    Checks whether a type refers to a pointer or not.
    Definition: meta.hpp:1069
    +
    entt::meta_type::is_class
    bool is_class() const
    Checks whether a type refers to a class or not.
    Definition: meta.hpp:1061
    +
    entt::meta_type::invoke
    meta_any invoke(const id_type id, meta_handle instance, Args &&...args) const
    Invokes a function given an identifier, if possible.
    Definition: meta.hpp:1262
    +
    entt::meta_type::size_type
    typename node_type::size_type size_type
    Unsigned integer type.
    Definition: meta.hpp:995
    +
    entt::meta_type::is_pointer_like
    bool is_pointer_like() const
    Checks whether a type is a pointer-like type or not.
    Definition: meta.hpp:1078
    +
    entt::meta_type::id
    id_type id() const
    Returns the identifier assigned to a type.
    Definition: meta.hpp:1020
    +
    entt::meta_type::is_array
    bool is_array() const
    Checks whether a type refers to an array type or not.
    Definition: meta.hpp:1045
    +
    entt::meta_type::is_sequence_container
    bool is_sequence_container() const
    Checks whether a type refers to a sequence container or not.
    Definition: meta.hpp:1086
    +
    entt::meta_type::get
    meta_any get(const id_type id, meta_handle instance) const
    Gets the value of a given variable.
    Definition: meta.hpp:1297
    +
    entt::meta_type::meta_type
    meta_type(const base_node_type *curr)
    Constructs an instance from a given base node.
    Definition: meta.hpp:1005
    +
    entt::meta_type::construct
    meta_any construct(meta_any *const args, const size_type sz) const
    Creates an instance of the underlying type, if possible.
    Definition: meta.hpp:1206
    +
    entt::meta_type::template_arity
    size_type template_arity() const
    Returns the number of template arguments.
    Definition: meta.hpp:1112
    +
    entt::meta_type::is_enum
    bool is_enum() const
    Checks whether a type refers to an enum or not.
    Definition: meta.hpp:1053
    +
    entt::meta_type::meta_type
    meta_type(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:998
    +
    entt::meta_type::invoke
    meta_any invoke(const id_type id, meta_handle instance, meta_any *const args, const size_type sz) const
    Invokes a function given an identifier, if possible.
    Definition: meta.hpp:1240
    +
    entt::meta_type::is_template_specialization
    bool is_template_specialization() const
    Checks whether a type refers to a recognized class template specialization or not.
    Definition: meta.hpp:1104
    +
    entt::meta_type::base_node_type
    internal::meta_base_node base_node_type
    Node type.
    Definition: meta.hpp:993
    +
    entt::meta_type::template_type
    meta_type template_type() const
    Returns a tag for the class template of the underlying type.
    Definition: meta.hpp:1123
    +
    entt::meta_type::data
    meta_range< meta_data > data() const
    Returns a range to visit registered top-level meta data.
    Definition: meta.hpp:1157
    +
    entt::meta_type::prop
    meta_range< meta_prop > prop() const
    Returns a range to visit registered top-level meta properties.
    Definition: meta.hpp:1306
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    entt::resolve
    meta_type resolve()
    Returns the meta type associated with a given type.
    Definition: resolve.hpp:19
    -
    entt::integral_constant
    std::integral_constant< decltype(Value), Value > integral_constant
    Wraps a static constant.
    Definition: type_traits.hpp:96
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    -
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:16
    -
    entt::forward_as_meta
    meta_any forward_as_meta(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: meta.hpp:629
    -
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:645
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    +
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:17
    +
    entt::handle
    basic_handle< entity > handle
    Alias declaration for the most common use case.
    Definition: fwd.hpp:69
    +
    entt::forward_as_meta
    meta_any forward_as_meta(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: meta.hpp:600
    +
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:618
    entt::is_complete_v
    constexpr bool is_complete_v
    Helper variable template.
    Definition: type_traits.hpp:447
    entt::storage
    basic_storage< entity, Args... > storage
    Alias declaration for the most common use case.
    Definition: fwd.hpp:57
    -
    entt::make_meta
    meta_any make_meta(Args &&...args)
    Constructs a wrapper from a given type, passing it all arguments.
    Definition: meta.hpp:618
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    +
    entt::make_meta
    meta_any make_meta(Args &&...args)
    Constructs a wrapper from a given type, passing it all arguments.
    Definition: meta.hpp:589
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    entt::adl_meta_pointer_like
    Fake ADL based lookup function for meta pointer-like types.
    Definition: adl_pointer.hpp:22
    -
    entt::basic_handle
    Non-owning handle to an entity.
    Definition: handle.hpp:23
    -
    entt::input_iterator_pointer
    Helper type to use as pointer with input iterators.
    Definition: iterator.hpp:16
    entt::meta_associative_container_traits
    Traits class template to be specialized to enable support for meta associative containers.
    Definition: type_traits.hpp:28
    -
    entt::meta_data
    Opaque wrapper for data members.
    Definition: meta.hpp:743
    -
    entt::meta_data::is_static
    bool is_static() const
    Indicates whether a data member is static or not.
    Definition: meta.hpp:778
    -
    entt::meta_data::node_type
    internal::meta_data_node node_type
    Node type.
    Definition: meta.hpp:745
    -
    entt::meta_data::prop
    meta_prop prop(meta_any key) const
    Lookup function for registered meta properties.
    Definition: meta.hpp:837
    -
    entt::meta_data::meta_data
    meta_data(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:750
    -
    entt::meta_data::id
    id_type id() const
    Returns the identifier assigned to a type.
    Definition: meta.hpp:754
    -
    entt::meta_data::get
    meta_any get(meta_handle instance) const
    Gets the value of a given variable.
    Definition: meta.hpp:813
    -
    entt::meta_data::arg
    meta_type arg(const size_type index) const
    Returns the type accepted by the i-th setter.
    Definition: meta.hpp:1460
    -
    entt::meta_data::is_const
    bool is_const() const
    Indicates whether a data member is constant or not.
    Definition: meta.hpp:770
    -
    entt::meta_data::set
    bool set(meta_handle instance, Type &&value) const
    Sets the value of a given variable.
    Definition: meta.hpp:800
    -
    entt::meta_data::size_type
    typename node_type::size_type size_type
    Unsigned integer type.
    Definition: meta.hpp:747
    -
    entt::meta_data::prop
    meta_range< meta_prop > prop() const
    Returns a range to visit registered meta properties.
    Definition: meta.hpp:828
    -
    entt::meta_data::type
    meta_type type() const
    Returns the type of the underlying object.
    Definition: meta.hpp:1452
    -
    entt::meta_data::arity
    size_type arity() const
    Returns the number of setters available.
    Definition: meta.hpp:762
    -
    entt::meta_func
    Opaque wrapper for member functions.
    Definition: meta.hpp:860
    -
    entt::meta_func::arg
    meta_type arg(const size_type index) const
    Returns the type of the i-th argument of a member function.
    Definition: meta.hpp:1464
    -
    entt::meta_func::prop
    meta_range< meta_prop > prop() const
    Returns a range to visit registered meta properties.
    Definition: meta.hpp:948
    -
    entt::meta_func::id
    id_type id() const
    Returns the identifier assigned to a type.
    Definition: meta.hpp:871
    -
    entt::meta_func::ret
    meta_type ret() const
    Returns the return type of a member function.
    Definition: meta.hpp:1456
    -
    entt::meta_func::prop
    meta_prop prop(meta_any key) const
    Lookup function for registered meta properties.
    Definition: meta.hpp:957
    -
    entt::meta_func::is_const
    bool is_const() const
    Indicates whether a member function is constant or not.
    Definition: meta.hpp:887
    -
    entt::meta_func::invoke
    meta_any invoke(meta_handle instance, meta_any *const args, const size_type sz) const
    Invokes the underlying function, if possible.
    Definition: meta.hpp:927
    -
    entt::meta_func::invoke
    meta_any invoke(meta_handle instance, Args &&...args) const
    Invokes the underlying function, if possible.
    Definition: meta.hpp:942
    -
    entt::meta_func::size_type
    typename node_type::size_type size_type
    Unsigned integer type.
    Definition: meta.hpp:864
    -
    entt::meta_func::is_static
    bool is_static() const
    Indicates whether a member function is static or not.
    Definition: meta.hpp:895
    -
    entt::meta_func::node_type
    internal::meta_func_node node_type
    Node type.
    Definition: meta.hpp:862
    -
    entt::meta_func::arity
    size_type arity() const
    Returns the number of arguments accepted by a member function.
    Definition: meta.hpp:879
    -
    entt::meta_func::meta_func
    meta_func(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:867
    -
    entt::meta_handle
    Opaque pointers to instances of any type.
    Definition: meta.hpp:640
    +
    entt::meta_data
    Opaque wrapper for data members.
    Definition: meta.hpp:714
    +
    entt::meta_data::is_static
    bool is_static() const
    Indicates whether a data member is static or not.
    Definition: meta.hpp:749
    +
    entt::meta_data::node_type
    internal::meta_data_node node_type
    Node type.
    Definition: meta.hpp:716
    +
    entt::meta_data::prop
    meta_prop prop(meta_any key) const
    Lookup function for registered meta properties.
    Definition: meta.hpp:807
    +
    entt::meta_data::meta_data
    meta_data(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:721
    +
    entt::meta_data::id
    id_type id() const
    Returns the identifier assigned to a type.
    Definition: meta.hpp:725
    +
    entt::meta_data::get
    meta_any get(meta_handle instance) const
    Gets the value of a given variable.
    Definition: meta.hpp:783
    +
    entt::meta_data::arg
    meta_type arg(const size_type index) const
    Returns the type accepted by the i-th setter.
    Definition: meta.hpp:1432
    +
    entt::meta_data::is_const
    bool is_const() const
    Indicates whether a data member is constant or not.
    Definition: meta.hpp:741
    +
    entt::meta_data::set
    bool set(meta_handle instance, Type &&value) const
    Sets the value of a given variable.
    Definition: meta.hpp:770
    +
    entt::meta_data::size_type
    typename node_type::size_type size_type
    Unsigned integer type.
    Definition: meta.hpp:718
    +
    entt::meta_data::prop
    meta_range< meta_prop > prop() const
    Returns a range to visit registered meta properties.
    Definition: meta.hpp:798
    +
    entt::meta_data::type
    meta_type type() const
    Returns the object type if any, type_id<void>() otherwise.
    Definition: meta.hpp:1424
    +
    entt::meta_data::arity
    size_type arity() const
    Returns the number of setters available.
    Definition: meta.hpp:733
    +
    entt::meta_func
    Opaque wrapper for member functions.
    Definition: meta.hpp:830
    +
    entt::meta_func::arg
    meta_type arg(const size_type index) const
    Returns the type of the i-th argument of a member function.
    Definition: meta.hpp:1436
    +
    entt::meta_func::prop
    meta_range< meta_prop > prop() const
    Returns a range to visit registered meta properties.
    Definition: meta.hpp:917
    +
    entt::meta_func::id
    id_type id() const
    Returns the identifier assigned to a type.
    Definition: meta.hpp:841
    +
    entt::meta_func::ret
    meta_type ret() const
    Returns the return type of a member function.
    Definition: meta.hpp:1428
    +
    entt::meta_func::prop
    meta_prop prop(meta_any key) const
    Lookup function for registered meta properties.
    Definition: meta.hpp:926
    +
    entt::meta_func::is_const
    bool is_const() const
    Indicates whether a member function is constant or not.
    Definition: meta.hpp:857
    +
    entt::meta_func::invoke
    meta_any invoke(meta_handle instance, meta_any *const args, const size_type sz) const
    Invokes the underlying function, if possible.
    Definition: meta.hpp:896
    +
    entt::meta_func::invoke
    meta_any invoke(meta_handle instance, Args &&...args) const
    Invokes the underlying function, if possible.
    Definition: meta.hpp:911
    +
    entt::meta_func::size_type
    typename node_type::size_type size_type
    Unsigned integer type.
    Definition: meta.hpp:834
    +
    entt::meta_func::is_static
    bool is_static() const
    Indicates whether a member function is static or not.
    Definition: meta.hpp:865
    +
    entt::meta_func::node_type
    internal::meta_func_node node_type
    Node type.
    Definition: meta.hpp:832
    +
    entt::meta_func::arity
    size_type arity() const
    Returns the number of arguments accepted by a member function.
    Definition: meta.hpp:849
    +
    entt::meta_func::meta_func
    meta_func(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:837
    +
    entt::meta_handle
    Opaque pointers to instances of any type.
    Definition: meta.hpp:611
    entt::meta_handle::operator=
    meta_handle & operator=(const meta_handle &)=delete
    Default copy assignment operator, deleted on purpose.
    entt::meta_handle::meta_handle
    meta_handle()=default
    Default constructor.
    entt::meta_handle::meta_handle
    meta_handle(meta_handle &&)=default
    Default move constructor.
    entt::meta_handle::operator=
    meta_handle & operator=(meta_handle &&)=default
    Default move assignment operator.
    entt::meta_handle::meta_handle
    meta_handle(const meta_handle &)=delete
    Default copy constructor, deleted on purpose.
    -
    entt::meta_handle::operator->
    meta_any * operator->()
    Access operator for accessing the contained opaque object.
    Definition: meta.hpp:689
    -
    entt::meta_handle::operator->
    const meta_any * operator->() const
    Access operator for accessing the contained opaque object.
    Definition: meta.hpp:694
    -
    entt::meta_handle::meta_handle
    meta_handle(Type &value)
    Creates a handle that points to an unmanaged object.
    Definition: meta.hpp:668
    -
    entt::meta_prop
    Opaque wrapper for properties of any type.
    Definition: meta.hpp:703
    -
    entt::meta_prop::meta_prop
    meta_prop(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:711
    -
    entt::meta_prop::value
    meta_any value() const
    Returns the stored value by copy.
    Definition: meta.hpp:726
    -
    entt::meta_prop::node_type
    internal::meta_prop_node node_type
    Node type.
    Definition: meta.hpp:705
    -
    entt::meta_prop::key
    meta_any key() const
    Returns the stored key as a const reference.
    Definition: meta.hpp:718
    -
    entt::meta_range
    Iterable range to use to iterate all types of meta objects.
    Definition: range.hpp:73
    +
    entt::meta_handle::operator->
    meta_any * operator->()
    Access operator for accessing the contained opaque object.
    Definition: meta.hpp:660
    +
    entt::meta_handle::operator->
    const meta_any * operator->() const
    Access operator for accessing the contained opaque object.
    Definition: meta.hpp:665
    +
    entt::meta_handle::meta_handle
    meta_handle(Type &value)
    Creates a handle that points to an unmanaged object.
    Definition: meta.hpp:639
    +
    entt::meta_prop
    Opaque wrapper for properties of any type.
    Definition: meta.hpp:674
    +
    entt::meta_prop::meta_prop
    meta_prop(const node_type *curr=nullptr)
    Constructs an instance from a given node.
    Definition: meta.hpp:682
    +
    entt::meta_prop::value
    meta_any value() const
    Returns the stored value by copy.
    Definition: meta.hpp:697
    +
    entt::meta_prop::node_type
    internal::meta_prop_node node_type
    Node type.
    Definition: meta.hpp:676
    +
    entt::meta_prop::key
    meta_any key() const
    Returns the stored key as a const reference.
    Definition: meta.hpp:689
    +
    entt::meta_range
    Iterable range to use to iterate all types of meta objects.
    Definition: range.hpp:74
    entt::meta_sequence_container_traits
    Traits class template to be specialized to enable support for meta sequence containers.
    Definition: type_traits.hpp:21
    +
    entt::type_info
    Implementation specific information about a type.
    Definition: type_info.hpp:141
    diff --git a/monostate_8hpp_source.html b/monostate_8hpp_source.html index b7fb3ed9e..718b888de 100644 --- a/monostate_8hpp_source.html +++ b/monostate_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -101,7 +101,7 @@ $(function() {
    54 } // namespace entt
    55 
    56 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::monostate_v
    monostate< Value > monostate_v
    Helper variable template.
    Definition: monostate.hpp:52
    entt::monostate
    Minimal implementation of the monostate pattern.
    Definition: monostate.hpp:21
    entt::monostate::operator=
    void operator=(Type val) const
    Assigns a value of a specific type to a given key.
    Definition: monostate.hpp:28
    diff --git a/namespaceentt.html b/namespaceentt.html index 63f1b37b7..11c77f09d 100644 --- a/namespaceentt.html +++ b/namespaceentt.html @@ -22,7 +22,7 @@     @@ -78,11 +78,11 @@ $(function() {
    + + + @@ -186,26 +427,126 @@ template<typename Resource >
    iterator entt::resource_cache< Type, Loader, Allocator >::begin ( )
    -

    Clears a cache and discards all its resources.

    -

    Handles are not invalidated and the memory used by a resource isn't freed as long as at least a handle keeps the resource itself alive.

    +

    Returns an iterator to the beginning.

    +

    The returned iterator points to the first instance of the cache. If the cache is empty, the returned iterator will be equal to end().

    +
    Returns
    An iterator to the first instance of the internal cache.
    -

    Definition at line 67 of file cache.hpp.

    +

    Definition at line 260 of file cache.hpp.

    - -

    ◆ contains()

    + +

    ◆ begin() [2/2]

    -template<typename Resource >
    +template<typename Type , typename Loader , typename Allocator >
    + + +
    - + + + + + +
    bool entt::resource_cache< Resource >::contains const_iterator entt::resource_cache< Type, Loader, Allocator >::begin () const
    +     		+inline
    +
    + +

    Returns an iterator to the beginning.

    +

    The returned iterator points to the first instance of the cache. If the cache is empty, the returned iterator will be equal to end().

    +
    Returns
    An iterator to the first instance of the internal cache.
    + +

    Definition at line 255 of file cache.hpp.

    + +
    + + +

    ◆ cbegin()

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + +
    const_iterator entt::resource_cache< Type, Loader, Allocator >::cbegin () const
    +     		+inline
    +
    + +

    Returns an iterator to the beginning.

    +

    The returned iterator points to the first instance of the cache. If the cache is empty, the returned iterator will be equal to end().

    +
    Returns
    An iterator to the first instance of the internal cache.
    + +

    Definition at line 250 of file cache.hpp.

    + +
    +
    + +

    ◆ cend()

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + +
    const_iterator entt::resource_cache< Type, Loader, Allocator >::cend () const
    +     		+inline
    +
    + +

    Returns an iterator to the end.

    +

    The returned iterator points to the element following the last instance of the cache. Attempting to dereference the returned iterator results in undefined behavior.

    +
    Returns
    An iterator to the element following the last instance of the internal cache.
    + +

    Definition at line 274 of file cache.hpp.

    + +
    +
    + +

    ◆ contains()

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + @@ -82,7 +82,7 @@ $(function() {
    10 
    15 template<typename Type>
    16 struct input_iterator_pointer final {
    -
    18  using pointer = decltype(std::addressof(std::declval<Type &>()));
    +
    18  using pointer = Type *;
    19 
    21  input_iterator_pointer(const input_iterator_pointer &) = delete;
    22 
    @@ -95,7 +95,7 @@ $(function() {
    38 
    43  input_iterator_pointer &operator=(input_iterator_pointer &&) = default;
    44 
    -
    49  [[nodiscard]] pointer operator->() ENTT_NOEXCEPT {
    +
    49  [[nodiscard]] pointer operator->() ENTT_NOEXCEPT {
    50  return std::addressof(value);
    51  }
    52 
    @@ -103,61 +103,61 @@ $(function() {
    54  Type value;
    55 };
    56 
    -
    61 template<typename It>
    -
    62 struct iterable_adaptor final {
    -
    64  using value_type = typename std::iterator_traits<It>::value_type;
    -
    66  using iterator = It;
    -
    68  using const_iterator = iterator;
    -
    69 
    -
    71  iterable_adaptor() = default;
    -
    72 
    -
    78  iterable_adaptor(It from, It to)
    -
    79  : first{from},
    -
    80  last{to} {}
    -
    81 
    -
    86  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
    -
    87  return first;
    -
    88  }
    -
    89 
    -
    95  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
    -
    96  return last;
    -
    97  }
    -
    98 
    -
    100  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
    -
    101  return begin();
    -
    102  }
    -
    103 
    -
    105  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
    -
    106  return end();
    -
    107  }
    -
    108 
    -
    109 private:
    -
    110  It first;
    -
    111  It last;
    -
    112 };
    -
    113 
    -
    114 } // namespace entt
    -
    115 
    -
    116 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    62 template<typename It, typename Sentinel = It>
    +
    63 struct iterable_adaptor final {
    +
    65  using value_type = typename std::iterator_traits<It>::value_type;
    +
    67  using iterator = It;
    +
    69  using sentinel = Sentinel;
    +
    70 
    +
    72  iterable_adaptor() = default;
    +
    73 
    +
    79  iterable_adaptor(iterator from, sentinel to)
    +
    80  : first{from},
    +
    81  last{to} {}
    +
    82 
    +
    87  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
    +
    88  return first;
    +
    89  }
    +
    90 
    +
    96  [[nodiscard]] sentinel end() const ENTT_NOEXCEPT {
    +
    97  return last;
    +
    98  }
    +
    99 
    +
    101  [[nodiscard]] iterator cbegin() const ENTT_NOEXCEPT {
    +
    102  return begin();
    +
    103  }
    +
    104 
    +
    106  [[nodiscard]] sentinel cend() const ENTT_NOEXCEPT {
    +
    107  return end();
    +
    108  }
    +
    109 
    +
    110 private:
    +
    111  It first;
    +
    112  Sentinel last;
    +
    113 };
    +
    114 
    +
    115 } // namespace entt
    +
    116 
    +
    117 #endif
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::input_iterator_pointer
    Helper type to use as pointer with input iterators.
    Definition: iterator.hpp:16
    entt::input_iterator_pointer::operator=
    input_iterator_pointer & operator=(input_iterator_pointer &&)=default
    Default move assignment operator.
    entt::input_iterator_pointer::input_iterator_pointer
    input_iterator_pointer(input_iterator_pointer &&)=default
    Default move constructor.
    entt::input_iterator_pointer::input_iterator_pointer
    input_iterator_pointer(const input_iterator_pointer &)=delete
    Default copy constructor, deleted on purpose.
    entt::input_iterator_pointer::operator->
    pointer operator->()
    Access operator for accessing wrapped values.
    Definition: iterator.hpp:49
    entt::input_iterator_pointer::operator=
    input_iterator_pointer & operator=(const input_iterator_pointer &)=delete
    Default copy assignment operator, deleted on purpose.
    -
    entt::input_iterator_pointer::pointer
    decltype(std::addressof(std::declval< Type & >())) pointer
    Pointer type.
    Definition: iterator.hpp:18
    +
    entt::input_iterator_pointer::pointer
    Type * pointer
    Pointer type.
    Definition: iterator.hpp:18
    entt::input_iterator_pointer::input_iterator_pointer
    input_iterator_pointer(Type &&val)
    Constructs a proxy object by move.
    Definition: iterator.hpp:30
    -
    entt::iterable_adaptor
    Utility class to create an iterable object from a pair of iterators.
    Definition: iterator.hpp:62
    -
    entt::iterable_adaptor::begin
    const_iterator begin() const
    Returns an iterator to the beginning.
    Definition: iterator.hpp:86
    -
    entt::iterable_adaptor::iterable_adaptor
    iterable_adaptor()=default
    Default constructor.
    -
    entt::iterable_adaptor::end
    const_iterator end() const
    Returns an iterator to the end.
    Definition: iterator.hpp:95
    -
    entt::iterable_adaptor::cbegin
    const_iterator cbegin() const
    Returns an iterator to the beginning.
    Definition: iterator.hpp:100
    -
    entt::iterable_adaptor::value_type
    typename std::iterator_traits< It >::value_type value_type
    Type of the objects returned during iteration.
    Definition: iterator.hpp:64
    -
    entt::iterable_adaptor::cend
    const_iterator cend() const
    Returns an iterator to the end.
    Definition: iterator.hpp:105
    -
    entt::iterable_adaptor::iterator
    It iterator
    Iterator type.
    Definition: iterator.hpp:66
    -
    entt::iterable_adaptor::const_iterator
    iterator const_iterator
    Const iterator type.
    Definition: iterator.hpp:68
    -
    entt::iterable_adaptor::iterable_adaptor
    iterable_adaptor(It from, It to)
    Creates an iterable object from a pair of iterators.
    Definition: iterator.hpp:78
    +
    entt::iterable_adaptor
    Utility class to create an iterable object from a pair of iterators.
    Definition: iterator.hpp:63
    +
    entt::iterable_adaptor::begin
    iterator begin() const
    Returns an iterator to the beginning.
    Definition: iterator.hpp:87
    +
    entt::iterable_adaptor::iterator
    It iterator
    Iterator type.
    Definition: iterator.hpp:67
    +
    entt::iterable_adaptor::iterable_adaptor
    iterable_adaptor()=default
    Default constructor.
    +
    entt::iterable_adaptor::sentinel
    Sentinel sentinel
    Sentinel type.
    Definition: iterator.hpp:69
    +
    entt::iterable_adaptor::end
    sentinel end() const
    Returns an iterator to the end.
    Definition: iterator.hpp:96
    +
    entt::iterable_adaptor::cbegin
    iterator cbegin() const
    Returns an iterator to the beginning.
    Definition: iterator.hpp:101
    +
    entt::iterable_adaptor::cend
    sentinel cend() const
    Returns an iterator to the end.
    Definition: iterator.hpp:106
    +
    entt::iterable_adaptor::iterable_adaptor
    iterable_adaptor(iterator from, sentinel to)
    Creates an iterable object from a pair of iterators.
    Definition: iterator.hpp:79
    +
    entt::iterable_adaptor::value_type
    typename std::iterator_traits< It >::value_type value_type
    Value type.
    Definition: iterator.hpp:65
    diff --git a/loader_8hpp_source.html b/loader_8hpp_source.html index 551a9389e..32ab35c92 100644 --- a/loader_8hpp_source.html +++ b/loader_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -70,32 +70,32 @@ $(function() {
    loader.hpp
    -
    1 #ifndef ENTT_RESOURCE_LOADER_HPP
    -
    2 #define ENTT_RESOURCE_LOADER_HPP
    +
    1 #ifndef ENTT_RESOURCE_LOADEr_HPP
    +
    2 #define ENTT_RESOURCE_LOADEr_HPP
    3 
    -
    4 #include "fwd.hpp"
    -
    5 #include "handle.hpp"
    -
    6 
    -
    7 namespace entt {
    -
    8 
    -
    41 template<typename Loader, typename Resource>
    -
    42 class resource_loader {
    -
    44  template<typename Other>
    -
    45  friend class resource_cache;
    -
    46 
    -
    53  template<typename... Args>
    -
    54  [[nodiscard]] resource_handle<Resource> get(Args &&...args) const {
    -
    55  return static_cast<const Loader *>(this)->load(std::forward<Args>(args)...);
    -
    56  }
    -
    57 };
    -
    58 
    -
    59 } // namespace entt
    -
    60 
    -
    61 #endif
    -
    entt::resource_cache
    Simple cache for resources of a given type.
    Definition: cache.hpp:27
    -
    entt::resource_handle
    Shared resource handle.
    Definition: handle.hpp:25
    -
    entt::resource_loader
    Base class for resource loaders.
    Definition: loader.hpp:42
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    4 #include <memory>
    +
    5 #include <utility>
    +
    6 #include "fwd.hpp"
    +
    7 
    +
    8 namespace entt {
    +
    9 
    +
    14 template<typename Type>
    +
    15 struct resource_loader {
    +
    17  using result_type = std::shared_ptr<Type>;
    +
    18 
    +
    25  template<typename... Args>
    +
    26  result_type operator()(Args &&...args) const {
    +
    27  return std::make_shared<Type>(std::forward<Args>(args)...);
    +
    28  }
    +
    29 };
    +
    30 
    +
    31 } // namespace entt
    +
    32 
    +
    33 #endif
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::resource_loader
    Transparent loader for shared resources.
    Definition: loader.hpp:15
    +
    entt::resource_loader::operator()
    result_type operator()(Args &&...args) const
    Constructs a shared pointer to a resource from its arguments.
    Definition: loader.hpp:26
    +
    entt::resource_loader::result_type
    std::shared_ptr< Type > result_type
    Result type.
    Definition: loader.hpp:17
    diff --git a/locator_8hpp_source.html b/locator_8hpp_source.html index 764c3cb38..6a17f8538 100644 --- a/locator_8hpp_source.html +++ b/locator_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -79,57 +79,62 @@ $(function() {
    7 
    8 namespace entt {
    9 
    -
    21 template<typename Service>
    -
    22 struct service_locator {
    -
    24  using service_type = Service;
    -
    25 
    -
    27  service_locator() = delete;
    -
    29  ~service_locator() = delete;
    +
    26 template<typename Service>
    +
    27 struct locator final {
    +
    29  using type = Service;
    30 
    -
    35  [[nodiscard]] static bool empty() ENTT_NOEXCEPT {
    -
    36  return !static_cast<bool>(service);
    -
    37  }
    -
    38 
    -
    49  [[nodiscard]] static std::weak_ptr<Service> get() ENTT_NOEXCEPT {
    -
    50  return service;
    -
    51  }
    -
    52 
    -
    67  [[nodiscard]] static Service &ref() ENTT_NOEXCEPT {
    -
    68  return *service;
    -
    69  }
    -
    70 
    -
    77  template<typename Impl = Service, typename... Args>
    -
    78  static void set(Args &&...args) {
    -
    79  service = std::make_shared<Impl>(std::forward<Args>(args)...);
    -
    80  }
    -
    81 
    -
    86  static void set(std::shared_ptr<Service> ptr) {
    -
    87  ENTT_ASSERT(static_cast<bool>(ptr), "Null service not allowed");
    -
    88  service = std::move(ptr);
    -
    89  }
    -
    90 
    -
    96  static void reset() {
    -
    97  service.reset();
    -
    98  }
    -
    99 
    -
    100 private:
    -
    101  inline static std::shared_ptr<Service> service = nullptr;
    -
    102 };
    -
    103 
    -
    104 } // namespace entt
    -
    105 
    -
    106 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::service_locator
    Service locator, nothing more.
    Definition: locator.hpp:22
    -
    entt::service_locator::service_locator
    service_locator()=delete
    Default constructor, deleted on purpose.
    -
    entt::service_locator::set
    static void set(Args &&...args)
    Sets or replaces a service.
    Definition: locator.hpp:78
    -
    entt::service_locator::~service_locator
    ~service_locator()=delete
    Default destructor, deleted on purpose.
    -
    entt::service_locator::reset
    static void reset()
    Resets a service.
    Definition: locator.hpp:96
    -
    entt::service_locator::ref
    static Service & ref()
    Returns a weak reference to a service implementation, if any.
    Definition: locator.hpp:67
    -
    entt::service_locator::set
    static void set(std::shared_ptr< Service > ptr)
    Sets or replaces a service.
    Definition: locator.hpp:86
    -
    entt::service_locator::get
    static std::weak_ptr< Service > get()
    Returns a weak pointer to a service implementation, if any.
    Definition: locator.hpp:49
    -
    entt::service_locator::empty
    static bool empty()
    Tests if a valid service implementation is set.
    Definition: locator.hpp:35
    -
    entt::service_locator::service_type
    Service service_type
    Type of service offered.
    Definition: locator.hpp:24
    +
    32  locator() = delete;
    +
    34  ~locator() = delete;
    +
    35 
    +
    40  [[nodiscard]] static bool has_value() ENTT_NOEXCEPT {
    +
    41  return (service != nullptr);
    +
    42  }
    +
    43 
    +
    53  [[nodiscard]] static Service &value() ENTT_NOEXCEPT {
    +
    54  ENTT_ASSERT(has_value(), "Service not available");
    +
    55  return *service;
    +
    56  }
    +
    57 
    +
    69  template<typename Impl = Service, typename... Args>
    +
    70  [[nodiscard]] static Service &value_or(Args &&...args) {
    +
    71  return service ? *service : emplace<Impl>(std::forward<Args>(args)...);
    +
    72  }
    +
    73 
    +
    81  template<typename Impl = Service, typename... Args>
    +
    82  static Service &emplace(Args &&...args) {
    +
    83  service = std::make_shared<Impl>(std::forward<Args>(args)...);
    +
    84  return *service;
    +
    85  }
    +
    86 
    +
    96  template<typename Impl = Service, typename Allocator, typename... Args>
    +
    97  static Service &allocate_emplace(Allocator alloc, Args &&...args) {
    +
    98  service = std::allocate_shared<Impl>(alloc, std::forward<Args>(args)...);
    +
    99  return *service;
    +
    100  }
    +
    101 
    +
    103  static void reset() ENTT_NOEXCEPT {
    +
    104  service.reset();
    +
    105  }
    +
    106 
    +
    107 private:
    +
    108  // std::shared_ptr because of its type erased allocator which is pretty useful here
    +
    109  inline static std::shared_ptr<Service> service = nullptr;
    +
    110 };
    +
    111 
    +
    112 } // namespace entt
    +
    113 
    +
    114 #endif
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::locator
    Service locator, nothing more.
    Definition: locator.hpp:27
    +
    entt::locator::value
    static Service & value()
    Returns a reference to a valid service, if any.
    Definition: locator.hpp:53
    +
    entt::locator::value_or
    static Service & value_or(Args &&...args)
    Returns a service if available or sets it from a fallback type.
    Definition: locator.hpp:70
    +
    entt::locator::has_value
    static bool has_value()
    Checks whether a service locator contains a value.
    Definition: locator.hpp:40
    +
    entt::locator::allocate_emplace
    static Service & allocate_emplace(Allocator alloc, Args &&...args)
    Sets or replaces a service using a given allocator.
    Definition: locator.hpp:97
    +
    entt::locator::~locator
    ~locator()=delete
    Default destructor, deleted on purpose.
    +
    entt::locator::type
    Service type
    Service type.
    Definition: locator.hpp:29
    +
    entt::locator::emplace
    static Service & emplace(Args &&...args)
    Sets or replaces a service.
    Definition: locator.hpp:82
    +
    entt::locator::reset
    static void reset()
    Resets a service.
    Definition: locator.hpp:103
    +
    entt::locator::locator
    locator()=delete
    Default constructor, deleted on purpose.
    diff --git a/macro_8h_source.html b/macro_8h_source.html new file mode 100644 index 000000000..80ce7ea50 --- /dev/null +++ b/macro_8h_source.html @@ -0,0 +1,86 @@ + + + + + + + +EnTT: src/entt/config/macro.h Source File + + + + + + + + + +
    +
    +
    + + + @@ -228,166 +569,23 @@ template<typename Resource >
    Returns
    True if the cache contains the resource, false otherwise.
    -

    Definition at line 186 of file cache.hpp.

    +

    Definition at line 376 of file cache.hpp.

    - -

    ◆ discard()

    + +

    ◆ empty()

    -template<typename Resource >
    +template<typename Type , typename Loader , typename Allocator >
    bool entt::resource_cache< Type, Loader, Allocator >::contains ( const id_type  id)
    - - -
    - - - - - - -
    void entt::resource_cache< Resource >::discard (const id_type id)
    -     		-inline
    -
    - -

    Discards the resource that corresponds to a given identifier.

    -

    Handles are not invalidated and the memory used by the resource isn't freed as long as at least a handle keeps the resource itself alive.

    -
    Parameters
    - - -
    idUnique resource identifier.
    -
    -
    - -

    Definition at line 198 of file cache.hpp.

    - -
    - - -

    ◆ each() [1/2]

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Func >
    - - - - - -
    - - - - - - - - -
    void entt::resource_cache< Resource >::each (Func func)
    -     		-inline
    -
    - -

    Iterates all resources.

    -

    The function object is invoked for each element. It is provided with either the resource identifier, the resource handle or both of them.
    - The signature of the function must be equivalent to one of the following forms:

    -
    void(const entt::id_type);
    -
    void(entt::resource_handle<resource_type>);
    -
    void(const entt::id_type, entt::resource_handle<resource_type>);
    -
    entt::resource_handle
    Shared resource handle.
    Definition: handle.hpp:25
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    -
    Template Parameters
    - - -
    FuncType of the function object to invoke.
    -
    -
    -
    Parameters
    - - -
    funcA valid function object.
    -
    -
    - -

    Definition at line 257 of file cache.hpp.

    - -
    -
    - -

    ◆ each() [2/2]

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Func >
    - - - - - -
    - - - - - - - - -
    void entt::resource_cache< Resource >::each (Func func) const
    -     		-inline
    -
    - -

    Iterates all resources.

    -

    The function object is invoked for each element. It is provided with either the resource identifier, the resource handle or both of them.
    - The signature of the function must be equivalent to one of the following forms:

    -
    void(const entt::id_type);
    -
    void(entt::resource_handle<const resource_type>);
    -
    void(const entt::id_type, entt::resource_handle<const resource_type>);
    -
    Template Parameters
    - - -
    FuncType of the function object to invoke.
    -
    -
    -
    Parameters
    - - -
    funcA valid function object.
    -
    -
    - -

    Definition at line 222 of file cache.hpp.

    - -
    -
    - -

    ◆ empty()

    - -
    -
    -
    -template<typename Resource >
    - - - @@ -85,8 +85,8 @@ $(function() {
    40 template<typename... Types>
    41 class identifier {
    42  template<typename Type, std::size_t... Index>
    -
    43  [[nodiscard]] static constexpr id_type get(std::index_sequence<Index...>) {
    -
    44  static_assert(std::disjunction_v<std::is_same<Type, Types>...>, "Invalid type");
    +
    43  [[nodiscard]] static constexpr id_type get(std::index_sequence<Index...>) ENTT_NOEXCEPT {
    +
    44  static_assert((std::is_same_v<Type, Types> || ...), "Invalid type");
    45  return (0 + ... + (std::is_same_v<Type, type_list_element_t<Index, type_list<std::decay_t<Types>...>>> ? id_type{Index} : id_type{}));
    46  }
    47 
    @@ -103,8 +103,8 @@ $(function() {
    entt::identifier
    Types identifiers.
    Definition: ident.hpp:41
    entt::identifier::identifier_type
    id_type identifier_type
    Unsigned integer type.
    Definition: ident.hpp:50
    entt::identifier::type
    static constexpr identifier_type type
    Statically generated unique identifier for the given type.
    Definition: ident.hpp:54
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    entt::type_list_element_t
    typename type_list_element< Index, List >::type type_list_element_t
    Helper type.
    Definition: type_traits.hpp:148
    entt::type_list
    A class to use to push around lists of types, nothing more.
    Definition: type_traits.hpp:110
    diff --git a/index.html b/index.html index efc461072..5b15060ce 100644 --- a/index.html +++ b/index.html @@ -22,7 +22,7 @@ @@ -67,7 +67,7 @@ $(function() {

    EnTT: Gaming meets modern C++

    -

    +

    Introduction

    The entity-component-system (also known as ECS) is an architectural pattern used mostly in game development. For further details:

      @@ -87,22 +87,18 @@ Introduction
    • The smallest and most basic implementation of a service locator ever seen.
    • A built-in, non-intrusive and macro-free runtime reflection system.
    • Static polymorphism made simple and within everyone's reach.
      • -
    • A few homemade containers, like a sparse set based dense hash map.
      • +
    • A few homemade containers, like a sparse set based hash map.
    • A cooperative scheduler for processes of any type.
    • All that is needed for resource management (cache, loaders, handles).
    • Delegates, signal handlers and a tiny event dispatcher.
    • A general purpose event emitter as a CRTP idiom based class template.
    • And much more! Check out the wiki.
    -

    Breaking news:

    -
      -
    • The ECS allows attaching multiple components of the same type to an entity.
      • -
    • All tools work perfectly across boundaries (DLL-friendly)!! :slightly_smiling_face:
      • -
    -

    Consider these lists a work in progress as well as the project. The whole API is fully documented in-code for those who are brave enough to read it.

    -

    It is also known that EnTT is used in Minecraft.
    +

    Consider these lists a work in progress as well as the project. The whole API is fully documented in-code for those who are brave enough to read it.
    + Please, do note that all tools are also DLL-friendly now and run smoothly across boundaries.

    +

    One thing known to most is that EnTT is also used in Minecraft.
    Given that the game is available literally everywhere, I can confidently say that the library has been sufficiently tested on every platform that can come to mind.

    -

    +

    Code Example

    #include <entt/entt.hpp>
    @@ -148,16 +144,16 @@ Code Example
    update(registry);
    }
    -
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:173
    +
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:221
    entt::entity
    entity
    Default entity identifier.
    Definition: fwd.hpp:47
    entt::registry
    basic_registry< entity > registry
    Alias declaration for the most common use case.
    Definition: fwd.hpp:60
    entt::view
    basic_view< entity, Get, Exclude > view
    Alias declaration for the most common use case.
    Definition: fwd.hpp:103
    -

    +

    Motivation

    -

    I started developing EnTT for the wrong reason: my goal was to design an entity-component system to beat another well known open source solution both in terms of performance and possibly memory usage.
    +

    I started developing EnTT for the wrong reason: my goal was to design an entity-component system to beat another well known open source library both in terms of performance and possibly memory usage.
    In the end, I did it, but it wasn't very satisfying. Actually it wasn't satisfying at all. The fastest and nothing more, fairly little indeed. When I realized it, I tried hard to keep intact the great performance of EnTT and to add all the features I wanted to see in my own library at the same time.

    Nowadays, EnTT is finally what I was looking for: still faster than its competitors, lower memory usage in the average case, a really good API and an amazing set of features. And even more, of course.

    -

    +

    Performance

    The proposed entity-component system is incredibly fast to iterate entities and components, this is a fact. Some compilers make a lot of optimizations because of how EnTT works, some others aren't that good. In general, if we consider real world cases, EnTT is somewhere between a bit and much faster than many of the other solutions around, although I couldn't check them all for obvious reasons.

    If you are interested, you can compile the benchmark test in release mode (to enable compiler optimizations, otherwise it would make little sense) by setting the ENTT_BUILD_BENCHMARK option of CMake to ON, then evaluate yourself whether you're satisfied with the results or not.

    @@ -166,7 +162,7 @@ Performance

    The choice to use EnTT should be based on its carefully designed API, its set of features and the general performance, not because some single benchmark shows it to be the fastest tool available.

    In the future I'll likely try to get even better performance while still adding new features, mainly for fun.
    If you want to contribute and/or have suggestions, feel free to make a PR or open an issue to discuss your idea.

    -

    +

    Integration

    EnTT is a header-only library. This means that including the entt.hpp header is enough to include the library as a whole and use it. For those who are interested only in the entity-component system, consider to include the sole entity/registry.hpp header instead.
    It's a matter of adding the following line to the top of a file:

    @@ -174,7 +170,7 @@ Integration

    Use the line below to include only the entity-component system instead:

    #include <entt/entity/registry.hpp>

    Then pass the proper -I argument to the compiler to add the src directory to the include paths.

    -

    +

    Requirements

    To be able to use EnTT, users must provide a full-featured compiler that supports at least C++17.
    The requirements below are mandatory to compile the tests and to extract the documentation:

    @@ -184,17 +180,17 @@ Requirements

    Alternatively, Bazel is also supported as a build system (credits to zaucy who offered to maintain it).
    In the documentation below I'll still refer to CMake, this being the official build system of the library.

    -

    +

    CMake

    To use EnTT from a CMake project, just link an existing target to the EnTT::EnTT alias.
    The library offers everything you need for locating (as in find_package), embedding (as in add_subdirectory), fetching (as in FetchContent) or using it in many of the ways that you can think of and that involve CMake.
    Covering all possible cases would require a treaty and not a simple README file, but I'm confident that anyone reading this section also knows what it's about and can use EnTT from a CMake project without problems.

    -

    +

    Natvis support

    When using CMake, just enable the option ENTT_INCLUDE_NATVIS and enjoy it.
    Otherwise, most of the tools are covered via Natvis and all files can be found in the natvis directory, divided by module.
    If you spot errors or have suggestions, any contribution is welcome!

    -

    +

    Packaging Tools

    EnTT is available for some of the most known packaging tools. In particular:

      @@ -228,18 +224,18 @@ Packaging Tools

    Both can be used with bpkg add-repo or added in a project repositories.manifest. See the official documentation for more details.

    Consider this list a work in progress and help me to make it longer if you like.

    -

    +

    pkg-config

    EnTT also supports pkg-config (for some definition of supports at least). A suitable file called entt.pc is generated and installed in a proper directory when running CMake.
    This should also make it easier to use with tools such as Meson or similar.

    -

    +

    Documentation

    The documentation is based on doxygen. To build it: 

    $ cd build
 $ cmake .. -DENTT_BUILD_DOCS=ON
 $ make

    The API reference will be created in HTML format within the directory build/docs/html. To navigate it with your favorite browser: 

    $ cd build
 $ your_favorite_browser docs/html/index.html
-

    +

    Tests

    To compile and run the tests, EnTT requires googletest.
    cmake will download and compile the library before compiling anything else. In order to build the tests, set the CMake option ENTT_BUILD_TESTING to ON.

    @@ -251,9 +247,9 @@ Tests
  • $ make test

    • Note that benchmarks are not part of this set.

    -

    +

    License

    -

    Code and documentation Copyright (c) 2017-2021 Michele Caini.
    +

    Code and documentation Copyright (c) 2017-2022 Michele Caini.
    Colorful logo Copyright (c) 2018-2021 Richard Caseres.

    Code released under the MIT license.
    Documentation released under CC BY 4.0.
    diff --git a/inherit_graph_1.map b/inherit_graph_1.map index adf98a6f4..d65e41e2b 100644 --- a/inherit_graph_1.map +++ b/inherit_graph_1.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_1.md5 b/inherit_graph_1.md5 index c4c565f14..14103d0a6 100644 --- a/inherit_graph_1.md5 +++ b/inherit_graph_1.md5 @@ -1 +1 @@ -cae2b99cec105ad39730b095e8a8002a \ No newline at end of file +5fd2184778e705ef4e218a15e4167605 \ No newline at end of file diff --git a/inherit_graph_1.png b/inherit_graph_1.png index e8a1ce796..5dc3e6be9 100644 Binary files a/inherit_graph_1.png and b/inherit_graph_1.png differ diff --git a/inherit_graph_10.map b/inherit_graph_10.map index 5738acfc1..3e9b3fc2a 100644 --- a/inherit_graph_10.map +++ b/inherit_graph_10.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_10.md5 b/inherit_graph_10.md5 index 5e4203a17..2d68a8791 100644 --- a/inherit_graph_10.md5 +++ b/inherit_graph_10.md5 @@ -1 +1 @@ -b2d71cad9fe9ef53110f77fcecfac992 \ No newline at end of file +4f7442d8a0535e7688e80200dd973abe \ No newline at end of file diff --git a/inherit_graph_10.png b/inherit_graph_10.png index 48d45f8fa..e7e9b642d 100644 Binary files a/inherit_graph_10.png and b/inherit_graph_10.png differ diff --git a/inherit_graph_105.md5 b/inherit_graph_105.md5 index d0f6dc107..422663d4a 100644 --- a/inherit_graph_105.md5 +++ b/inherit_graph_105.md5 @@ -1 +1 @@ -ea4ff20a6e15f650338b5a4c79ec664d \ No newline at end of file +050d18f75b02c29a725085b58a91f2cb \ No newline at end of file diff --git a/inherit_graph_107.map b/inherit_graph_107.map index b39dc15d9..a419ede94 100644 --- a/inherit_graph_107.map +++ b/inherit_graph_107.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_107.md5 b/inherit_graph_107.md5 index 39b26ac08..ebd57423a 100644 --- a/inherit_graph_107.md5 +++ b/inherit_graph_107.md5 @@ -1 +1 @@ -601b396b3eb50e44415535980526e062 \ No newline at end of file +9d646638198d5d488a271523106cda6e \ No newline at end of file diff --git a/inherit_graph_107.png b/inherit_graph_107.png index e6b728b0c..c4f8169ee 100644 Binary files a/inherit_graph_107.png and b/inherit_graph_107.png differ diff --git a/inherit_graph_108.map b/inherit_graph_108.map index f6e6dd424..f1676d3da 100644 --- a/inherit_graph_108.map +++ b/inherit_graph_108.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_108.md5 b/inherit_graph_108.md5 index 4bcd15e45..118442476 100644 --- a/inherit_graph_108.md5 +++ b/inherit_graph_108.md5 @@ -1 +1 @@ -23ea7b136d4c9cb4027ae69345bc7cb7 \ No newline at end of file +bbae22a0a65eb0dddd53f9057c935f9b \ No newline at end of file diff --git a/inherit_graph_108.png b/inherit_graph_108.png index 2799fa841..027b26817 100644 Binary files a/inherit_graph_108.png and b/inherit_graph_108.png differ diff --git a/inherit_graph_109.map b/inherit_graph_109.map index ea77e3089..a92dd65bd 100644 --- a/inherit_graph_109.map +++ b/inherit_graph_109.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_109.md5 b/inherit_graph_109.md5 index cfc2a4eab..60ada373a 100644 --- a/inherit_graph_109.md5 +++ b/inherit_graph_109.md5 @@ -1 +1 @@ -03ebd12327ce6965e8e76c33c386b46e \ No newline at end of file +96bb8a7b277f5ca7f62f3e41ff0656a2 \ No newline at end of file diff --git a/inherit_graph_109.png b/inherit_graph_109.png index f84e37a83..555b44722 100644 Binary files a/inherit_graph_109.png and b/inherit_graph_109.png differ diff --git a/inherit_graph_11.map b/inherit_graph_11.map index 305dbb2f3..5738acfc1 100644 --- a/inherit_graph_11.map +++ b/inherit_graph_11.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_11.md5 b/inherit_graph_11.md5 index 57468820b..5e4203a17 100644 --- a/inherit_graph_11.md5 +++ b/inherit_graph_11.md5 @@ -1 +1 @@ -4c9b522e5ebf766bc71c3504a73b8aa4 \ No newline at end of file +b2d71cad9fe9ef53110f77fcecfac992 \ No newline at end of file diff --git a/inherit_graph_11.png b/inherit_graph_11.png index 6460d430c..48d45f8fa 100644 Binary files a/inherit_graph_11.png and b/inherit_graph_11.png differ diff --git a/inherit_graph_112.map b/inherit_graph_112.map index b9afc9469..2cb86731e 100644 --- a/inherit_graph_112.map +++ b/inherit_graph_112.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_112.md5 b/inherit_graph_112.md5 index d7bba944e..a615db3ef 100644 --- a/inherit_graph_112.md5 +++ b/inherit_graph_112.md5 @@ -1 +1 @@ -a4790bc0bef0ac33539cb28531648039 \ No newline at end of file +b007dfafc6731dbbebb1e02d3c8302e1 \ No newline at end of file diff --git a/inherit_graph_112.png b/inherit_graph_112.png index d4a2c6477..237d65645 100644 Binary files a/inherit_graph_112.png and b/inherit_graph_112.png differ diff --git a/inherit_graph_113.map b/inherit_graph_113.map index 2cb86731e..9d77739bb 100644 --- a/inherit_graph_113.map +++ b/inherit_graph_113.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_113.md5 b/inherit_graph_113.md5 index a615db3ef..5be5f95a8 100644 --- a/inherit_graph_113.md5 +++ b/inherit_graph_113.md5 @@ -1 +1 @@ -b007dfafc6731dbbebb1e02d3c8302e1 \ No newline at end of file +8e0c7e2887cef52e0745919dab961d68 \ No newline at end of file diff --git a/inherit_graph_113.png b/inherit_graph_113.png index 237d65645..2b255b111 100644 Binary files a/inherit_graph_113.png and b/inherit_graph_113.png differ diff --git a/inherit_graph_114.map b/inherit_graph_114.map index 9d77739bb..7a4f51538 100644 --- a/inherit_graph_114.map +++ b/inherit_graph_114.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_114.md5 b/inherit_graph_114.md5 index 5be5f95a8..c0963501b 100644 --- a/inherit_graph_114.md5 +++ b/inherit_graph_114.md5 @@ -1 +1 @@ -8e0c7e2887cef52e0745919dab961d68 \ No newline at end of file +78d4ee258bef28a7d3180adfeda52259 \ No newline at end of file diff --git a/inherit_graph_114.png b/inherit_graph_114.png index 2b255b111..7f266a047 100644 Binary files a/inherit_graph_114.png and b/inherit_graph_114.png differ diff --git a/inherit_graph_115.map b/inherit_graph_115.map index 7a4f51538..d7fe23195 100644 --- a/inherit_graph_115.map +++ b/inherit_graph_115.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_115.md5 b/inherit_graph_115.md5 index c0963501b..545284f03 100644 --- a/inherit_graph_115.md5 +++ b/inherit_graph_115.md5 @@ -1 +1 @@ -78d4ee258bef28a7d3180adfeda52259 \ No newline at end of file +3b1af92344de201b8a4c1fc67f04daa7 \ No newline at end of file diff --git a/inherit_graph_115.png b/inherit_graph_115.png index 7f266a047..57e0c457d 100644 Binary files a/inherit_graph_115.png and b/inherit_graph_115.png differ diff --git a/inherit_graph_116.map b/inherit_graph_116.map index 254448e55..004a87717 100644 --- a/inherit_graph_116.map +++ b/inherit_graph_116.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_116.md5 b/inherit_graph_116.md5 index f8f23df78..823c7a844 100644 --- a/inherit_graph_116.md5 +++ b/inherit_graph_116.md5 @@ -1 +1 @@ -6f98549b7b49f03b804ea0c1a15b13cc \ No newline at end of file +7f3a7add1cad1e9656cdc47bb3c82546 \ No newline at end of file diff --git a/inherit_graph_116.png b/inherit_graph_116.png index b6ec12040..480c516ea 100644 Binary files a/inherit_graph_116.png and b/inherit_graph_116.png differ diff --git a/inherit_graph_117.map b/inherit_graph_117.map index d7fe23195..c337a1b3b 100644 --- a/inherit_graph_117.map +++ b/inherit_graph_117.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_117.md5 b/inherit_graph_117.md5 index 19e68dc01..663b261ac 100644 --- a/inherit_graph_117.md5 +++ b/inherit_graph_117.md5 @@ -1 +1 @@ -3a1e866da9e03b772388ea4cf93093c2 \ No newline at end of file +20012184e1a29a5286b21c1fe234ad38 \ No newline at end of file diff --git a/inherit_graph_117.png b/inherit_graph_117.png index 57e0c457d..f606c326b 100644 Binary files a/inherit_graph_117.png and b/inherit_graph_117.png differ diff --git a/inherit_graph_118.map b/inherit_graph_118.map index 004a87717..896fcb111 100644 --- a/inherit_graph_118.map +++ b/inherit_graph_118.map @@ -1,3 +1,6 @@ - + + + + diff --git a/inherit_graph_118.md5 b/inherit_graph_118.md5 index 823c7a844..aa1af5795 100644 --- a/inherit_graph_118.md5 +++ b/inherit_graph_118.md5 @@ -1 +1 @@ -7f3a7add1cad1e9656cdc47bb3c82546 \ No newline at end of file +676ce563ba4f0328c324eb6598d005f6 \ No newline at end of file diff --git a/inherit_graph_118.png b/inherit_graph_118.png index 480c516ea..67f69a38d 100644 Binary files a/inherit_graph_118.png and b/inherit_graph_118.png differ diff --git a/inherit_graph_119.map b/inherit_graph_119.map index c337a1b3b..94871c0aa 100644 --- a/inherit_graph_119.map +++ b/inherit_graph_119.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_119.md5 b/inherit_graph_119.md5 index 663b261ac..66a4bad20 100644 --- a/inherit_graph_119.md5 +++ b/inherit_graph_119.md5 @@ -1 +1 @@ -20012184e1a29a5286b21c1fe234ad38 \ No newline at end of file +c040e930da0640acfc225e0071fbffd6 \ No newline at end of file diff --git a/inherit_graph_119.png b/inherit_graph_119.png index f606c326b..99be9adb8 100644 Binary files a/inherit_graph_119.png and b/inherit_graph_119.png differ diff --git a/inherit_graph_12.map b/inherit_graph_12.map index 26425476b..305dbb2f3 100644 --- a/inherit_graph_12.map +++ b/inherit_graph_12.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_12.md5 b/inherit_graph_12.md5 index 47d538c72..57468820b 100644 --- a/inherit_graph_12.md5 +++ b/inherit_graph_12.md5 @@ -1 +1 @@ -79860f4e174e143ad5b258f7974b4eb4 \ No newline at end of file +4c9b522e5ebf766bc71c3504a73b8aa4 \ No newline at end of file diff --git a/inherit_graph_12.png b/inherit_graph_12.png index 4f23b5d7a..6460d430c 100644 Binary files a/inherit_graph_12.png and b/inherit_graph_12.png differ diff --git a/inherit_graph_120.map b/inherit_graph_120.map index 9d496cfdb..5304cb791 100644 --- a/inherit_graph_120.map +++ b/inherit_graph_120.map @@ -1,6 +1,3 @@ - - - - + diff --git a/inherit_graph_120.md5 b/inherit_graph_120.md5 index bb39ac58f..2babb9f30 100644 --- a/inherit_graph_120.md5 +++ b/inherit_graph_120.md5 @@ -1 +1 @@ -b8ffb5b059bbde981f321ca3ecffff2c \ No newline at end of file +75a734ea4cff33e468be7b6052e8c6cd \ No newline at end of file diff --git a/inherit_graph_120.png b/inherit_graph_120.png index 67f69a38d..bf3138f1e 100644 Binary files a/inherit_graph_120.png and b/inherit_graph_120.png differ diff --git a/inherit_graph_121.map b/inherit_graph_121.map index 94871c0aa..5d31fab3b 100644 --- a/inherit_graph_121.map +++ b/inherit_graph_121.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_121.md5 b/inherit_graph_121.md5 index 66a4bad20..7f07df0c8 100644 --- a/inherit_graph_121.md5 +++ b/inherit_graph_121.md5 @@ -1 +1 @@ -c040e930da0640acfc225e0071fbffd6 \ No newline at end of file +5244eefdc7707c9db3e11bc3dda559b1 \ No newline at end of file diff --git a/inherit_graph_121.png b/inherit_graph_121.png index 99be9adb8..122f79bca 100644 Binary files a/inherit_graph_121.png and b/inherit_graph_121.png differ diff --git a/inherit_graph_122.map b/inherit_graph_122.map index 5304cb791..f49d7e1f1 100644 --- a/inherit_graph_122.map +++ b/inherit_graph_122.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_122.md5 b/inherit_graph_122.md5 index 2babb9f30..ab5c1f381 100644 --- a/inherit_graph_122.md5 +++ b/inherit_graph_122.md5 @@ -1 +1 @@ -75a734ea4cff33e468be7b6052e8c6cd \ No newline at end of file +252ff7166a278d2d650acb6112729e72 \ No newline at end of file diff --git a/inherit_graph_122.png b/inherit_graph_122.png index bf3138f1e..8447c7042 100644 Binary files a/inherit_graph_122.png and b/inherit_graph_122.png differ diff --git a/inherit_graph_123.map b/inherit_graph_123.map index 5d31fab3b..539424c2f 100644 --- a/inherit_graph_123.map +++ b/inherit_graph_123.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_123.md5 b/inherit_graph_123.md5 index 7f07df0c8..2da21b27e 100644 --- a/inherit_graph_123.md5 +++ b/inherit_graph_123.md5 @@ -1 +1 @@ -5244eefdc7707c9db3e11bc3dda559b1 \ No newline at end of file +da30c9e3bb65e7222471ea30d6d2864e \ No newline at end of file diff --git a/inherit_graph_123.png b/inherit_graph_123.png index 122f79bca..175a618df 100644 Binary files a/inherit_graph_123.png and b/inherit_graph_123.png differ diff --git a/inherit_graph_124.map b/inherit_graph_124.map index f49d7e1f1..d8959c3cb 100644 --- a/inherit_graph_124.map +++ b/inherit_graph_124.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_124.md5 b/inherit_graph_124.md5 index ab5c1f381..3a5f9437b 100644 --- a/inherit_graph_124.md5 +++ b/inherit_graph_124.md5 @@ -1 +1 @@ -252ff7166a278d2d650acb6112729e72 \ No newline at end of file +6fbe435e176db855d00b70bfa0b983f4 \ No newline at end of file diff --git a/inherit_graph_124.png b/inherit_graph_124.png index 8447c7042..1c0c14fbf 100644 Binary files a/inherit_graph_124.png and b/inherit_graph_124.png differ diff --git a/inherit_graph_125.map b/inherit_graph_125.map index 539424c2f..e97341756 100644 --- a/inherit_graph_125.map +++ b/inherit_graph_125.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_125.md5 b/inherit_graph_125.md5 index 2da21b27e..37e1ee45c 100644 --- a/inherit_graph_125.md5 +++ b/inherit_graph_125.md5 @@ -1 +1 @@ -da30c9e3bb65e7222471ea30d6d2864e \ No newline at end of file +7f1326188e5c4947022241d975d92218 \ No newline at end of file diff --git a/inherit_graph_125.png b/inherit_graph_125.png index 175a618df..e1c1cd28b 100644 Binary files a/inherit_graph_125.png and b/inherit_graph_125.png differ diff --git a/inherit_graph_126.map b/inherit_graph_126.map index d8959c3cb..91fe99903 100644 --- a/inherit_graph_126.map +++ b/inherit_graph_126.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_126.md5 b/inherit_graph_126.md5 index 3a5f9437b..9013ee31b 100644 --- a/inherit_graph_126.md5 +++ b/inherit_graph_126.md5 @@ -1 +1 @@ -6fbe435e176db855d00b70bfa0b983f4 \ No newline at end of file +a7de9f7c45a9e15a4849b281eb13a42f \ No newline at end of file diff --git a/inherit_graph_126.png b/inherit_graph_126.png index 1c0c14fbf..71594ac17 100644 Binary files a/inherit_graph_126.png and b/inherit_graph_126.png differ diff --git a/inherit_graph_127.map b/inherit_graph_127.map index 9e034b10e..b0221d512 100644 --- a/inherit_graph_127.map +++ b/inherit_graph_127.map @@ -1,3 +1,6 @@ - + + + + diff --git a/inherit_graph_127.md5 b/inherit_graph_127.md5 index 4fcd34421..813bbafa7 100644 --- a/inherit_graph_127.md5 +++ b/inherit_graph_127.md5 @@ -1 +1 @@ -329ad928fb729c5506fa3fe0bef65eb3 \ No newline at end of file +5f6e0f63ae99e860bfadfdc2bf3e2ad3 \ No newline at end of file diff --git a/inherit_graph_127.png b/inherit_graph_127.png index e1c1cd28b..b625a7ae4 100644 Binary files a/inherit_graph_127.png and b/inherit_graph_127.png differ diff --git a/inherit_graph_128.map b/inherit_graph_128.map index 91fe99903..bb8a792d7 100644 --- a/inherit_graph_128.map +++ b/inherit_graph_128.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_128.md5 b/inherit_graph_128.md5 index 9013ee31b..0a9edcce4 100644 --- a/inherit_graph_128.md5 +++ b/inherit_graph_128.md5 @@ -1 +1 @@ -a7de9f7c45a9e15a4849b281eb13a42f \ No newline at end of file +dfc533d50ed6fb7966232d163ee704cf \ No newline at end of file diff --git a/inherit_graph_128.png b/inherit_graph_128.png index 71594ac17..c5d37cf35 100644 Binary files a/inherit_graph_128.png and b/inherit_graph_128.png differ diff --git a/inherit_graph_129.map b/inherit_graph_129.map index b0221d512..26a17376d 100644 --- a/inherit_graph_129.map +++ b/inherit_graph_129.map @@ -1,6 +1,3 @@ - - - - + diff --git a/inherit_graph_129.md5 b/inherit_graph_129.md5 index 813bbafa7..cf75ff325 100644 --- a/inherit_graph_129.md5 +++ b/inherit_graph_129.md5 @@ -1 +1 @@ -5f6e0f63ae99e860bfadfdc2bf3e2ad3 \ No newline at end of file +9c2e416d7878932b0a87489324431ab5 \ No newline at end of file diff --git a/inherit_graph_129.png b/inherit_graph_129.png index b625a7ae4..fb3ff6761 100644 Binary files a/inherit_graph_129.png and b/inherit_graph_129.png differ diff --git a/inherit_graph_130.map b/inherit_graph_130.map index bb8a792d7..cd12f6c5c 100644 --- a/inherit_graph_130.map +++ b/inherit_graph_130.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_130.md5 b/inherit_graph_130.md5 index 0a9edcce4..147341b07 100644 --- a/inherit_graph_130.md5 +++ b/inherit_graph_130.md5 @@ -1 +1 @@ -dfc533d50ed6fb7966232d163ee704cf \ No newline at end of file +fed123d41bb565808b0d7286c7db6b6b \ No newline at end of file diff --git a/inherit_graph_130.png b/inherit_graph_130.png index c5d37cf35..b49c2809b 100644 Binary files a/inherit_graph_130.png and b/inherit_graph_130.png differ diff --git a/inherit_graph_131.map b/inherit_graph_131.map index 26a17376d..94c6fcfee 100644 --- a/inherit_graph_131.map +++ b/inherit_graph_131.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_131.md5 b/inherit_graph_131.md5 index cf75ff325..76603d1de 100644 --- a/inherit_graph_131.md5 +++ b/inherit_graph_131.md5 @@ -1 +1 @@ -9c2e416d7878932b0a87489324431ab5 \ No newline at end of file +b93e72808f9061dd00a7b4f79431eab9 \ No newline at end of file diff --git a/inherit_graph_131.png b/inherit_graph_131.png index fb3ff6761..d3db68f86 100644 Binary files a/inherit_graph_131.png and b/inherit_graph_131.png differ diff --git a/inherit_graph_132.map b/inherit_graph_132.map index cd12f6c5c..6df3df22c 100644 --- a/inherit_graph_132.map +++ b/inherit_graph_132.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_132.md5 b/inherit_graph_132.md5 index 147341b07..83acc360f 100644 --- a/inherit_graph_132.md5 +++ b/inherit_graph_132.md5 @@ -1 +1 @@ -fed123d41bb565808b0d7286c7db6b6b \ No newline at end of file +85711c2ea4d73f45b039cce8be403e5d \ No newline at end of file diff --git a/inherit_graph_132.png b/inherit_graph_132.png index b49c2809b..7f80f01f6 100644 Binary files a/inherit_graph_132.png and b/inherit_graph_132.png differ diff --git a/inherit_graph_133.map b/inherit_graph_133.map index 94c6fcfee..556fbdb23 100644 --- a/inherit_graph_133.map +++ b/inherit_graph_133.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_133.md5 b/inherit_graph_133.md5 index 76603d1de..a1289ee52 100644 --- a/inherit_graph_133.md5 +++ b/inherit_graph_133.md5 @@ -1 +1 @@ -b93e72808f9061dd00a7b4f79431eab9 \ No newline at end of file +93ae47e361e45016abe1f51d8eda0bab \ No newline at end of file diff --git a/inherit_graph_133.png b/inherit_graph_133.png index d3db68f86..fc1099700 100644 Binary files a/inherit_graph_133.png and b/inherit_graph_133.png differ diff --git a/inherit_graph_134.map b/inherit_graph_134.map index 6df3df22c..b4d1596ba 100644 --- a/inherit_graph_134.map +++ b/inherit_graph_134.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_134.md5 b/inherit_graph_134.md5 index 83acc360f..af43cb999 100644 --- a/inherit_graph_134.md5 +++ b/inherit_graph_134.md5 @@ -1 +1 @@ -85711c2ea4d73f45b039cce8be403e5d \ No newline at end of file +eebfe65f7367917e47b5ccf355e3f48c \ No newline at end of file diff --git a/inherit_graph_134.png b/inherit_graph_134.png index 7f80f01f6..1b8365048 100644 Binary files a/inherit_graph_134.png and b/inherit_graph_134.png differ diff --git a/inherit_graph_135.map b/inherit_graph_135.map index 556fbdb23..0d1797ada 100644 --- a/inherit_graph_135.map +++ b/inherit_graph_135.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_135.md5 b/inherit_graph_135.md5 index f844bca3c..e121a31b1 100644 --- a/inherit_graph_135.md5 +++ b/inherit_graph_135.md5 @@ -1 +1 @@ -02ca6f04dffaa43a9674af4c9fcc32b5 \ No newline at end of file +a3e3cec815c015ac45520d49faa0e7d7 \ No newline at end of file diff --git a/inherit_graph_135.png b/inherit_graph_135.png index fc1099700..6a07b1b6c 100644 Binary files a/inherit_graph_135.png and b/inherit_graph_135.png differ diff --git a/inherit_graph_136.map b/inherit_graph_136.map index b4d1596ba..122e89ee7 100644 --- a/inherit_graph_136.map +++ b/inherit_graph_136.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_136.md5 b/inherit_graph_136.md5 index af43cb999..53c4997c3 100644 --- a/inherit_graph_136.md5 +++ b/inherit_graph_136.md5 @@ -1 +1 @@ -eebfe65f7367917e47b5ccf355e3f48c \ No newline at end of file +7ca2525f19cc25cbc3da01746c5b0211 \ No newline at end of file diff --git a/inherit_graph_136.png b/inherit_graph_136.png index 1b8365048..115999147 100644 Binary files a/inherit_graph_136.png and b/inherit_graph_136.png differ diff --git a/inherit_graph_137.map b/inherit_graph_137.map index 0d1797ada..f5536c0f3 100644 --- a/inherit_graph_137.map +++ b/inherit_graph_137.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_137.md5 b/inherit_graph_137.md5 index e121a31b1..533217e61 100644 --- a/inherit_graph_137.md5 +++ b/inherit_graph_137.md5 @@ -1 +1 @@ -a3e3cec815c015ac45520d49faa0e7d7 \ No newline at end of file +4b9780fb5164b8d66386b23fb87348d9 \ No newline at end of file diff --git a/inherit_graph_137.png b/inherit_graph_137.png index 6a07b1b6c..01b048784 100644 Binary files a/inherit_graph_137.png and b/inherit_graph_137.png differ diff --git a/inherit_graph_138.map b/inherit_graph_138.map index 122e89ee7..8998c3aa5 100644 --- a/inherit_graph_138.map +++ b/inherit_graph_138.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_138.md5 b/inherit_graph_138.md5 index 53c4997c3..0a7894b31 100644 --- a/inherit_graph_138.md5 +++ b/inherit_graph_138.md5 @@ -1 +1 @@ -7ca2525f19cc25cbc3da01746c5b0211 \ No newline at end of file +b0feda975d659e5ffc3cc18c02067bd4 \ No newline at end of file diff --git a/inherit_graph_138.png b/inherit_graph_138.png index 115999147..b55d1fa7f 100644 Binary files a/inherit_graph_138.png and b/inherit_graph_138.png differ diff --git a/inherit_graph_139.map b/inherit_graph_139.map index f5536c0f3..3b12bf2e8 100644 --- a/inherit_graph_139.map +++ b/inherit_graph_139.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_139.md5 b/inherit_graph_139.md5 index 533217e61..615e951d8 100644 --- a/inherit_graph_139.md5 +++ b/inherit_graph_139.md5 @@ -1 +1 @@ -4b9780fb5164b8d66386b23fb87348d9 \ No newline at end of file +939b5b7f8f8060572df76efae6044422 \ No newline at end of file diff --git a/inherit_graph_139.png b/inherit_graph_139.png index 01b048784..b68a1a414 100644 Binary files a/inherit_graph_139.png and b/inherit_graph_139.png differ diff --git a/inherit_graph_14.map b/inherit_graph_14.map index 7b3b86138..7cdc5de6f 100644 --- a/inherit_graph_14.map +++ b/inherit_graph_14.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_14.md5 b/inherit_graph_14.md5 index 192494cd0..f50eba5f0 100644 --- a/inherit_graph_14.md5 +++ b/inherit_graph_14.md5 @@ -1 +1 @@ -88e73636a5ba830c71cbdf849f5f280c \ No newline at end of file +52045b4f25df6f2831ccf12abbecf6ba \ No newline at end of file diff --git a/inherit_graph_14.png b/inherit_graph_14.png index cdd83efb1..1fec3bb06 100644 Binary files a/inherit_graph_14.png and b/inherit_graph_14.png differ diff --git a/inherit_graph_140.map b/inherit_graph_140.map index 8998c3aa5..426e2369b 100644 --- a/inherit_graph_140.map +++ b/inherit_graph_140.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_140.md5 b/inherit_graph_140.md5 index 0a7894b31..cda492144 100644 --- a/inherit_graph_140.md5 +++ b/inherit_graph_140.md5 @@ -1 +1 @@ -b0feda975d659e5ffc3cc18c02067bd4 \ No newline at end of file +6637fc54ad98fb83bd5e61dc883721a7 \ No newline at end of file diff --git a/inherit_graph_140.png b/inherit_graph_140.png index b55d1fa7f..20d20f98f 100644 Binary files a/inherit_graph_140.png and b/inherit_graph_140.png differ diff --git a/inherit_graph_141.map b/inherit_graph_141.map index 3b12bf2e8..472db544f 100644 --- a/inherit_graph_141.map +++ b/inherit_graph_141.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_141.md5 b/inherit_graph_141.md5 index 615e951d8..0006aa477 100644 --- a/inherit_graph_141.md5 +++ b/inherit_graph_141.md5 @@ -1 +1 @@ -939b5b7f8f8060572df76efae6044422 \ No newline at end of file +3e935539400960f11e58c02d1d3d4316 \ No newline at end of file diff --git a/inherit_graph_141.png b/inherit_graph_141.png index b68a1a414..ccff5150e 100644 Binary files a/inherit_graph_141.png and b/inherit_graph_141.png differ diff --git a/inherit_graph_142.map b/inherit_graph_142.map index 426e2369b..b2ec7d637 100644 --- a/inherit_graph_142.map +++ b/inherit_graph_142.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_142.md5 b/inherit_graph_142.md5 index cda492144..35d5e1f7b 100644 --- a/inherit_graph_142.md5 +++ b/inherit_graph_142.md5 @@ -1 +1 @@ -6637fc54ad98fb83bd5e61dc883721a7 \ No newline at end of file +b6d35762f588df57f961c525c8fa32bc \ No newline at end of file diff --git a/inherit_graph_142.png b/inherit_graph_142.png index 20d20f98f..71736eeb1 100644 Binary files a/inherit_graph_142.png and b/inherit_graph_142.png differ diff --git a/inherit_graph_143.map b/inherit_graph_143.map index 472db544f..86e403a48 100644 --- a/inherit_graph_143.map +++ b/inherit_graph_143.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_143.md5 b/inherit_graph_143.md5 index 0006aa477..eb6f9c62c 100644 --- a/inherit_graph_143.md5 +++ b/inherit_graph_143.md5 @@ -1 +1 @@ -3e935539400960f11e58c02d1d3d4316 \ No newline at end of file +63d82da6017b9624da3e45bccae5deea \ No newline at end of file diff --git a/inherit_graph_143.png b/inherit_graph_143.png index ccff5150e..053906c88 100644 Binary files a/inherit_graph_143.png and b/inherit_graph_143.png differ diff --git a/inherit_graph_144.map b/inherit_graph_144.map index b2ec7d637..3d361f662 100644 --- a/inherit_graph_144.map +++ b/inherit_graph_144.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_144.md5 b/inherit_graph_144.md5 index 35d5e1f7b..cb652c2fd 100644 --- a/inherit_graph_144.md5 +++ b/inherit_graph_144.md5 @@ -1 +1 @@ -b6d35762f588df57f961c525c8fa32bc \ No newline at end of file +1ec8d0b99e870a3119c62aa23208706e \ No newline at end of file diff --git a/inherit_graph_144.png b/inherit_graph_144.png index 71736eeb1..30760353e 100644 Binary files a/inherit_graph_144.png and b/inherit_graph_144.png differ diff --git a/inherit_graph_145.map b/inherit_graph_145.map index 86e403a48..62305b38b 100644 --- a/inherit_graph_145.map +++ b/inherit_graph_145.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_145.md5 b/inherit_graph_145.md5 index eb6f9c62c..20b5f1ec7 100644 --- a/inherit_graph_145.md5 +++ b/inherit_graph_145.md5 @@ -1 +1 @@ -63d82da6017b9624da3e45bccae5deea \ No newline at end of file +cb316b9fcf8f60d54fba94581949cf72 \ No newline at end of file diff --git a/inherit_graph_145.png b/inherit_graph_145.png index 053906c88..5e23a0d5f 100644 Binary files a/inherit_graph_145.png and b/inherit_graph_145.png differ diff --git a/inherit_graph_146.map b/inherit_graph_146.map index 3d361f662..5c73c219f 100644 --- a/inherit_graph_146.map +++ b/inherit_graph_146.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_146.md5 b/inherit_graph_146.md5 index cb652c2fd..c452e499c 100644 --- a/inherit_graph_146.md5 +++ b/inherit_graph_146.md5 @@ -1 +1 @@ -1ec8d0b99e870a3119c62aa23208706e \ No newline at end of file +ed9a3ce1f63eda76703114b8c5c02298 \ No newline at end of file diff --git a/inherit_graph_146.png b/inherit_graph_146.png index 30760353e..3df0c8761 100644 Binary files a/inherit_graph_146.png and b/inherit_graph_146.png differ diff --git a/inherit_graph_147.map b/inherit_graph_147.map index 62305b38b..d6e64ab7a 100644 --- a/inherit_graph_147.map +++ b/inherit_graph_147.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_147.md5 b/inherit_graph_147.md5 index 20b5f1ec7..82ac511ba 100644 --- a/inherit_graph_147.md5 +++ b/inherit_graph_147.md5 @@ -1 +1 @@ -cb316b9fcf8f60d54fba94581949cf72 \ No newline at end of file +7230d30a69e7c7c0f89bdc47355dcad0 \ No newline at end of file diff --git a/inherit_graph_147.png b/inherit_graph_147.png index 5e23a0d5f..833a4b72f 100644 Binary files a/inherit_graph_147.png and b/inherit_graph_147.png differ diff --git a/inherit_graph_148.map b/inherit_graph_148.map index 5c73c219f..cfc14554f 100644 --- a/inherit_graph_148.map +++ b/inherit_graph_148.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_148.md5 b/inherit_graph_148.md5 index c452e499c..44d3c936f 100644 --- a/inherit_graph_148.md5 +++ b/inherit_graph_148.md5 @@ -1 +1 @@ -ed9a3ce1f63eda76703114b8c5c02298 \ No newline at end of file +3929edc83bf36b777b24e2edcea446af \ No newline at end of file diff --git a/inherit_graph_148.png b/inherit_graph_148.png index 3df0c8761..dcd4005c7 100644 Binary files a/inherit_graph_148.png and b/inherit_graph_148.png differ diff --git a/inherit_graph_149.map b/inherit_graph_149.map index d6e64ab7a..1191a4135 100644 --- a/inherit_graph_149.map +++ b/inherit_graph_149.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_149.md5 b/inherit_graph_149.md5 index 82ac511ba..d77fb929f 100644 --- a/inherit_graph_149.md5 +++ b/inherit_graph_149.md5 @@ -1 +1 @@ -7230d30a69e7c7c0f89bdc47355dcad0 \ No newline at end of file +46eabb0dd66add72521acf013e876301 \ No newline at end of file diff --git a/inherit_graph_149.png b/inherit_graph_149.png index 833a4b72f..edbe33fca 100644 Binary files a/inherit_graph_149.png and b/inherit_graph_149.png differ diff --git a/inherit_graph_15.map b/inherit_graph_15.map index 1f323f792..7b3b86138 100644 --- a/inherit_graph_15.map +++ b/inherit_graph_15.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_15.md5 b/inherit_graph_15.md5 index eaaf59717..192494cd0 100644 --- a/inherit_graph_15.md5 +++ b/inherit_graph_15.md5 @@ -1 +1 @@ -007fecf3e379aa6071660d911a06b914 \ No newline at end of file +88e73636a5ba830c71cbdf849f5f280c \ No newline at end of file diff --git a/inherit_graph_15.png b/inherit_graph_15.png index 7d92942df..cdd83efb1 100644 Binary files a/inherit_graph_15.png and b/inherit_graph_15.png differ diff --git a/inherit_graph_150.map b/inherit_graph_150.map index cfc14554f..e15132b0f 100644 --- a/inherit_graph_150.map +++ b/inherit_graph_150.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_150.md5 b/inherit_graph_150.md5 index 44d3c936f..25043274f 100644 --- a/inherit_graph_150.md5 +++ b/inherit_graph_150.md5 @@ -1 +1 @@ -3929edc83bf36b777b24e2edcea446af \ No newline at end of file +c31a70cdb21c2f2a88515a58bf1c2347 \ No newline at end of file diff --git a/inherit_graph_150.png b/inherit_graph_150.png index dcd4005c7..e4e3675d4 100644 Binary files a/inherit_graph_150.png and b/inherit_graph_150.png differ diff --git a/inherit_graph_151.map b/inherit_graph_151.map index 1191a4135..f5556ca1a 100644 --- a/inherit_graph_151.map +++ b/inherit_graph_151.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_151.md5 b/inherit_graph_151.md5 index d77fb929f..0c88062fa 100644 --- a/inherit_graph_151.md5 +++ b/inherit_graph_151.md5 @@ -1 +1 @@ -46eabb0dd66add72521acf013e876301 \ No newline at end of file +60f25a3eae2e0dd4a0e6e4a670d8399e \ No newline at end of file diff --git a/inherit_graph_151.png b/inherit_graph_151.png index edbe33fca..ac2071684 100644 Binary files a/inherit_graph_151.png and b/inherit_graph_151.png differ diff --git a/inherit_graph_152.map b/inherit_graph_152.map index e15132b0f..c3b5b56a0 100644 --- a/inherit_graph_152.map +++ b/inherit_graph_152.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_152.md5 b/inherit_graph_152.md5 index 25043274f..0a08f7926 100644 --- a/inherit_graph_152.md5 +++ b/inherit_graph_152.md5 @@ -1 +1 @@ -c31a70cdb21c2f2a88515a58bf1c2347 \ No newline at end of file +570795ace056c8016a8838c696d2955f \ No newline at end of file diff --git a/inherit_graph_152.png b/inherit_graph_152.png index e4e3675d4..792503882 100644 Binary files a/inherit_graph_152.png and b/inherit_graph_152.png differ diff --git a/inherit_graph_153.map b/inherit_graph_153.map deleted file mode 100644 index f5556ca1a..000000000 --- a/inherit_graph_153.map +++ /dev/null @@ -1,3 +0,0 @@ - - - diff --git a/inherit_graph_153.md5 b/inherit_graph_153.md5 deleted file mode 100644 index 0c88062fa..000000000 --- a/inherit_graph_153.md5 +++ /dev/null @@ -1 +0,0 @@ -60f25a3eae2e0dd4a0e6e4a670d8399e \ No newline at end of file diff --git a/inherit_graph_153.png b/inherit_graph_153.png deleted file mode 100644 index ac2071684..000000000 Binary files a/inherit_graph_153.png and /dev/null differ diff --git a/inherit_graph_154.map b/inherit_graph_154.map deleted file mode 100644 index ff9646623..000000000 --- a/inherit_graph_154.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/inherit_graph_154.md5 b/inherit_graph_154.md5 deleted file mode 100644 index b69e16e84..000000000 --- a/inherit_graph_154.md5 +++ /dev/null @@ -1 +0,0 @@ -f0472c65cf9293241cfc7059771423a5 \ No newline at end of file diff --git a/inherit_graph_154.png b/inherit_graph_154.png deleted file mode 100644 index 792503882..000000000 Binary files a/inherit_graph_154.png and /dev/null differ diff --git a/inherit_graph_155.map b/inherit_graph_155.map deleted file mode 100644 index ff9646623..000000000 --- a/inherit_graph_155.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/inherit_graph_155.md5 b/inherit_graph_155.md5 deleted file mode 100644 index b69e16e84..000000000 --- a/inherit_graph_155.md5 +++ /dev/null @@ -1 +0,0 @@ -f0472c65cf9293241cfc7059771423a5 \ No newline at end of file diff --git a/inherit_graph_155.png b/inherit_graph_155.png deleted file mode 100644 index 792503882..000000000 Binary files a/inherit_graph_155.png and /dev/null differ diff --git a/inherit_graph_16.map b/inherit_graph_16.map index 872097970..1f323f792 100644 --- a/inherit_graph_16.map +++ b/inherit_graph_16.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_16.md5 b/inherit_graph_16.md5 index f51ac8802..eaaf59717 100644 --- a/inherit_graph_16.md5 +++ b/inherit_graph_16.md5 @@ -1 +1 @@ -8b32b020ecf344ca78ba3c78d6c2137a \ No newline at end of file +007fecf3e379aa6071660d911a06b914 \ No newline at end of file diff --git a/inherit_graph_16.png b/inherit_graph_16.png index a45c35044..7d92942df 100644 Binary files a/inherit_graph_16.png and b/inherit_graph_16.png differ diff --git a/inherit_graph_17.map b/inherit_graph_17.map index 0652c8bbc..872097970 100644 --- a/inherit_graph_17.map +++ b/inherit_graph_17.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_17.md5 b/inherit_graph_17.md5 index 129d0cd67..f51ac8802 100644 --- a/inherit_graph_17.md5 +++ b/inherit_graph_17.md5 @@ -1 +1 @@ -5db6c69e63ff4a66ab368d3af5cb1959 \ No newline at end of file +8b32b020ecf344ca78ba3c78d6c2137a \ No newline at end of file diff --git a/inherit_graph_17.png b/inherit_graph_17.png index 24e0a46fa..a45c35044 100644 Binary files a/inherit_graph_17.png and b/inherit_graph_17.png differ diff --git a/inherit_graph_18.map b/inherit_graph_18.map index cb6cf43c1..0652c8bbc 100644 --- a/inherit_graph_18.map +++ b/inherit_graph_18.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_18.md5 b/inherit_graph_18.md5 index 0abef8b16..129d0cd67 100644 --- a/inherit_graph_18.md5 +++ b/inherit_graph_18.md5 @@ -1 +1 @@ -3b0dc35a8039cbbd0653291da6421591 \ No newline at end of file +5db6c69e63ff4a66ab368d3af5cb1959 \ No newline at end of file diff --git a/inherit_graph_18.png b/inherit_graph_18.png index 0372ca3b1..24e0a46fa 100644 Binary files a/inherit_graph_18.png and b/inherit_graph_18.png differ diff --git a/inherit_graph_19.map b/inherit_graph_19.map index 07343e901..cefb8aa86 100644 --- a/inherit_graph_19.map +++ b/inherit_graph_19.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_19.md5 b/inherit_graph_19.md5 index d069ea964..5ad736888 100644 --- a/inherit_graph_19.md5 +++ b/inherit_graph_19.md5 @@ -1 +1 @@ -70dc47da1a0add5d49870b038bf5c2f0 \ No newline at end of file +0b41bb16967331fc3d719f4e4d1df3b3 \ No newline at end of file diff --git a/inherit_graph_19.png b/inherit_graph_19.png index 41bb693cf..19a476bfb 100644 Binary files a/inherit_graph_19.png and b/inherit_graph_19.png differ diff --git a/inherit_graph_2.map b/inherit_graph_2.map index 7d1fe47bd..adf98a6f4 100644 --- a/inherit_graph_2.map +++ b/inherit_graph_2.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_2.md5 b/inherit_graph_2.md5 index 864774f85..c4c565f14 100644 --- a/inherit_graph_2.md5 +++ b/inherit_graph_2.md5 @@ -1 +1 @@ -d6512fb9de5819ce291e0b692b3e989d \ No newline at end of file +cae2b99cec105ad39730b095e8a8002a \ No newline at end of file diff --git a/inherit_graph_2.png b/inherit_graph_2.png index 01cecc474..e8a1ce796 100644 Binary files a/inherit_graph_2.png and b/inherit_graph_2.png differ diff --git a/inherit_graph_20.map b/inherit_graph_20.map index 25ee7f819..07343e901 100644 --- a/inherit_graph_20.map +++ b/inherit_graph_20.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_20.md5 b/inherit_graph_20.md5 index e9709b06b..d069ea964 100644 --- a/inherit_graph_20.md5 +++ b/inherit_graph_20.md5 @@ -1 +1 @@ -7390fe7b7d926fd9da65d3fbdc01b648 \ No newline at end of file +70dc47da1a0add5d49870b038bf5c2f0 \ No newline at end of file diff --git a/inherit_graph_20.png b/inherit_graph_20.png index f7ef1bae5..41bb693cf 100644 Binary files a/inherit_graph_20.png and b/inherit_graph_20.png differ diff --git a/inherit_graph_21.map b/inherit_graph_21.map index 4e2ba8330..25ee7f819 100644 --- a/inherit_graph_21.map +++ b/inherit_graph_21.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_21.md5 b/inherit_graph_21.md5 index a7d2f2a39..e9709b06b 100644 --- a/inherit_graph_21.md5 +++ b/inherit_graph_21.md5 @@ -1 +1 @@ -df1dc7601445c6567f8c18d26dc3e8fc \ No newline at end of file +7390fe7b7d926fd9da65d3fbdc01b648 \ No newline at end of file diff --git a/inherit_graph_21.png b/inherit_graph_21.png index 5bac0fde3..f7ef1bae5 100644 Binary files a/inherit_graph_21.png and b/inherit_graph_21.png differ diff --git a/inherit_graph_22.map b/inherit_graph_22.map index ed4555a4e..4e2ba8330 100644 --- a/inherit_graph_22.map +++ b/inherit_graph_22.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_22.md5 b/inherit_graph_22.md5 index 9945c72fd..a7d2f2a39 100644 --- a/inherit_graph_22.md5 +++ b/inherit_graph_22.md5 @@ -1 +1 @@ -d9e6778d7759af3e8ddbea2c0f7c36f1 \ No newline at end of file +df1dc7601445c6567f8c18d26dc3e8fc \ No newline at end of file diff --git a/inherit_graph_22.png b/inherit_graph_22.png index 5034c0590..5bac0fde3 100644 Binary files a/inherit_graph_22.png and b/inherit_graph_22.png differ diff --git a/inherit_graph_23.map b/inherit_graph_23.map index 3e24dc794..ed4555a4e 100644 --- a/inherit_graph_23.map +++ b/inherit_graph_23.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_23.md5 b/inherit_graph_23.md5 index 55eed0d78..05c90c903 100644 --- a/inherit_graph_23.md5 +++ b/inherit_graph_23.md5 @@ -1 +1 @@ -9d30d0c7896e203585fe512d719115f9 \ No newline at end of file +931a558034a3d69a5d5f26247ffcf0b5 \ No newline at end of file diff --git a/inherit_graph_23.png b/inherit_graph_23.png index 57e74441b..5034c0590 100644 Binary files a/inherit_graph_23.png and b/inherit_graph_23.png differ diff --git a/inherit_graph_24.map b/inherit_graph_24.map index 3e722aeba..3e24dc794 100644 --- a/inherit_graph_24.map +++ b/inherit_graph_24.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_24.md5 b/inherit_graph_24.md5 index 54ec77305..55eed0d78 100644 --- a/inherit_graph_24.md5 +++ b/inherit_graph_24.md5 @@ -1 +1 @@ -74e3d3575f4ab7117008117499e89e23 \ No newline at end of file +9d30d0c7896e203585fe512d719115f9 \ No newline at end of file diff --git a/inherit_graph_24.png b/inherit_graph_24.png index 3a37b4aab..57e74441b 100644 Binary files a/inherit_graph_24.png and b/inherit_graph_24.png differ diff --git a/inherit_graph_25.map b/inherit_graph_25.map index d5eb57ba5..3e722aeba 100644 --- a/inherit_graph_25.map +++ b/inherit_graph_25.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_25.md5 b/inherit_graph_25.md5 index 04b667883..54ec77305 100644 --- a/inherit_graph_25.md5 +++ b/inherit_graph_25.md5 @@ -1 +1 @@ -850659062015bf402f1bfa310c7a38fa \ No newline at end of file +74e3d3575f4ab7117008117499e89e23 \ No newline at end of file diff --git a/inherit_graph_25.png b/inherit_graph_25.png index c1a9215a1..3a37b4aab 100644 Binary files a/inherit_graph_25.png and b/inherit_graph_25.png differ diff --git a/inherit_graph_26.map b/inherit_graph_26.map index 8a5225246..3ef5b147e 100644 --- a/inherit_graph_26.map +++ b/inherit_graph_26.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_26.md5 b/inherit_graph_26.md5 index 5ce090831..1551a04ad 100644 --- a/inherit_graph_26.md5 +++ b/inherit_graph_26.md5 @@ -1 +1 @@ -6986377c67085231043f117e4db98845 \ No newline at end of file +8ce832382b4392d4fa6138c0eb364522 \ No newline at end of file diff --git a/inherit_graph_26.png b/inherit_graph_26.png index 941d5a4e8..4990172af 100644 Binary files a/inherit_graph_26.png and b/inherit_graph_26.png differ diff --git a/inherit_graph_27.map b/inherit_graph_27.map index a0871422a..727c00cbb 100644 --- a/inherit_graph_27.map +++ b/inherit_graph_27.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_27.md5 b/inherit_graph_27.md5 index 75c6cdc01..640ea1369 100644 --- a/inherit_graph_27.md5 +++ b/inherit_graph_27.md5 @@ -1 +1 @@ -fc1a347d9fa74100769b2e1bca016a2b \ No newline at end of file +684ec5fe5e4382ad20d4633bc6fb4a88 \ No newline at end of file diff --git a/inherit_graph_27.png b/inherit_graph_27.png index 2daddbd72..f90bd1717 100644 Binary files a/inherit_graph_27.png and b/inherit_graph_27.png differ diff --git a/inherit_graph_28.map b/inherit_graph_28.map index b7956f440..8a5225246 100644 --- a/inherit_graph_28.map +++ b/inherit_graph_28.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_28.md5 b/inherit_graph_28.md5 index 6c1afcf98..5ce090831 100644 --- a/inherit_graph_28.md5 +++ b/inherit_graph_28.md5 @@ -1 +1 @@ -95042c408281d240557ca036ac7b9ad2 \ No newline at end of file +6986377c67085231043f117e4db98845 \ No newline at end of file diff --git a/inherit_graph_28.png b/inherit_graph_28.png index b34991349..941d5a4e8 100644 Binary files a/inherit_graph_28.png and b/inherit_graph_28.png differ diff --git a/inherit_graph_29.map b/inherit_graph_29.map index a542b6182..a0871422a 100644 --- a/inherit_graph_29.map +++ b/inherit_graph_29.map @@ -1,5 +1,3 @@ - - - + diff --git a/inherit_graph_29.md5 b/inherit_graph_29.md5 index f235a2b82..75c6cdc01 100644 --- a/inherit_graph_29.md5 +++ b/inherit_graph_29.md5 @@ -1 +1 @@ -dff4089c04131f48a96bd926bdcb0699 \ No newline at end of file +fc1a347d9fa74100769b2e1bca016a2b \ No newline at end of file diff --git a/inherit_graph_29.png b/inherit_graph_29.png index 1e546766a..2daddbd72 100644 Binary files a/inherit_graph_29.png and b/inherit_graph_29.png differ diff --git a/inherit_graph_3.map b/inherit_graph_3.map index 031aeffc8..7d1fe47bd 100644 --- a/inherit_graph_3.map +++ b/inherit_graph_3.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_3.md5 b/inherit_graph_3.md5 index 6c11c2c72..864774f85 100644 --- a/inherit_graph_3.md5 +++ b/inherit_graph_3.md5 @@ -1 +1 @@ -5807f00042d09c8d7d8b084223baa8e1 \ No newline at end of file +d6512fb9de5819ce291e0b692b3e989d \ No newline at end of file diff --git a/inherit_graph_3.png b/inherit_graph_3.png index 94a530d1d..01cecc474 100644 Binary files a/inherit_graph_3.png and b/inherit_graph_3.png differ diff --git a/inherit_graph_30.map b/inherit_graph_30.map index f9dc7da41..b7956f440 100644 --- a/inherit_graph_30.map +++ b/inherit_graph_30.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_30.md5 b/inherit_graph_30.md5 index c54d07ef4..6c1afcf98 100644 --- a/inherit_graph_30.md5 +++ b/inherit_graph_30.md5 @@ -1 +1 @@ -54093a4474d293e5f88aa0f82a34056d \ No newline at end of file +95042c408281d240557ca036ac7b9ad2 \ No newline at end of file diff --git a/inherit_graph_30.png b/inherit_graph_30.png index 5d59ee450..b34991349 100644 Binary files a/inherit_graph_30.png and b/inherit_graph_30.png differ diff --git a/inherit_graph_31.map b/inherit_graph_31.map index 9d7d81594..a542b6182 100644 --- a/inherit_graph_31.map +++ b/inherit_graph_31.map @@ -1,3 +1,5 @@ - + + + diff --git a/inherit_graph_31.md5 b/inherit_graph_31.md5 index aa7f8f4bd..f235a2b82 100644 --- a/inherit_graph_31.md5 +++ b/inherit_graph_31.md5 @@ -1 +1 @@ -5680b4d72a84232d57bb2b6769c8d0a5 \ No newline at end of file +dff4089c04131f48a96bd926bdcb0699 \ No newline at end of file diff --git a/inherit_graph_31.png b/inherit_graph_31.png index fef3d6d07..1e546766a 100644 Binary files a/inherit_graph_31.png and b/inherit_graph_31.png differ diff --git a/inherit_graph_32.map b/inherit_graph_32.map index ffc4c6e54..f9dc7da41 100644 --- a/inherit_graph_32.map +++ b/inherit_graph_32.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_32.md5 b/inherit_graph_32.md5 index 90465c757..c54d07ef4 100644 --- a/inherit_graph_32.md5 +++ b/inherit_graph_32.md5 @@ -1 +1 @@ -433c95f85dacacc744019cb5bb2fde2e \ No newline at end of file +54093a4474d293e5f88aa0f82a34056d \ No newline at end of file diff --git a/inherit_graph_32.png b/inherit_graph_32.png index 59f3874e4..5d59ee450 100644 Binary files a/inherit_graph_32.png and b/inherit_graph_32.png differ diff --git a/inherit_graph_33.map b/inherit_graph_33.map index 9e51841da..9d7d81594 100644 --- a/inherit_graph_33.map +++ b/inherit_graph_33.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_33.md5 b/inherit_graph_33.md5 index 38a837ba4..aa7f8f4bd 100644 --- a/inherit_graph_33.md5 +++ b/inherit_graph_33.md5 @@ -1 +1 @@ -c5901b19b636a1bfc079230d75c82021 \ No newline at end of file +5680b4d72a84232d57bb2b6769c8d0a5 \ No newline at end of file diff --git a/inherit_graph_33.png b/inherit_graph_33.png index 279eea2ee..fef3d6d07 100644 Binary files a/inherit_graph_33.png and b/inherit_graph_33.png differ diff --git a/inherit_graph_34.map b/inherit_graph_34.map index 887fd0cec..ffc4c6e54 100644 --- a/inherit_graph_34.map +++ b/inherit_graph_34.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_34.md5 b/inherit_graph_34.md5 index c66feed88..90465c757 100644 --- a/inherit_graph_34.md5 +++ b/inherit_graph_34.md5 @@ -1 +1 @@ -49e791c1edeb10b0b5043aa57360d7a3 \ No newline at end of file +433c95f85dacacc744019cb5bb2fde2e \ No newline at end of file diff --git a/inherit_graph_34.png b/inherit_graph_34.png index 03728da81..59f3874e4 100644 Binary files a/inherit_graph_34.png and b/inherit_graph_34.png differ diff --git a/inherit_graph_35.map b/inherit_graph_35.map index 5041805a5..9e51841da 100644 --- a/inherit_graph_35.map +++ b/inherit_graph_35.map @@ -1,7 +1,3 @@ - - - - - + diff --git a/inherit_graph_35.md5 b/inherit_graph_35.md5 index 5822390ff..38a837ba4 100644 --- a/inherit_graph_35.md5 +++ b/inherit_graph_35.md5 @@ -1 +1 @@ -f3686b05b8de525138c31d116cdf3152 \ No newline at end of file +c5901b19b636a1bfc079230d75c82021 \ No newline at end of file diff --git a/inherit_graph_35.png b/inherit_graph_35.png index dafa89daa..279eea2ee 100644 Binary files a/inherit_graph_35.png and b/inherit_graph_35.png differ diff --git a/inherit_graph_36.map b/inherit_graph_36.map index c317666f3..887fd0cec 100644 --- a/inherit_graph_36.map +++ b/inherit_graph_36.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_36.md5 b/inherit_graph_36.md5 index 16f443bc2..c66feed88 100644 --- a/inherit_graph_36.md5 +++ b/inherit_graph_36.md5 @@ -1 +1 @@ -ba02c371a07999b60a6a594e76432037 \ No newline at end of file +49e791c1edeb10b0b5043aa57360d7a3 \ No newline at end of file diff --git a/inherit_graph_36.png b/inherit_graph_36.png index d0e19e622..03728da81 100644 Binary files a/inherit_graph_36.png and b/inherit_graph_36.png differ diff --git a/inherit_graph_37.map b/inherit_graph_37.map index 1c53051a7..3790beeb7 100644 --- a/inherit_graph_37.map +++ b/inherit_graph_37.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_37.md5 b/inherit_graph_37.md5 index f0a729d9c..de9794ed6 100644 --- a/inherit_graph_37.md5 +++ b/inherit_graph_37.md5 @@ -1 +1 @@ -732814765e4e495016c727ede78a0d28 \ No newline at end of file +25973cf39355f8f545317fd2b4117365 \ No newline at end of file diff --git a/inherit_graph_37.png b/inherit_graph_37.png index 47c1990ff..eec635ea8 100644 Binary files a/inherit_graph_37.png and b/inherit_graph_37.png differ diff --git a/inherit_graph_38.map b/inherit_graph_38.map index 7da8d4aa1..05ff73e67 100644 --- a/inherit_graph_38.map +++ b/inherit_graph_38.map @@ -1,3 +1,9 @@ - + + + + + + + diff --git a/inherit_graph_38.md5 b/inherit_graph_38.md5 index 772865e8b..5263ade51 100644 --- a/inherit_graph_38.md5 +++ b/inherit_graph_38.md5 @@ -1 +1 @@ -69b26adc13fab23ce85e71dd1e0cd551 \ No newline at end of file +76800cee26ae92ba307a915863206882 \ No newline at end of file diff --git a/inherit_graph_38.png b/inherit_graph_38.png index 46a08aa09..f6fe7c3bc 100644 Binary files a/inherit_graph_38.png and b/inherit_graph_38.png differ diff --git a/inherit_graph_39.map b/inherit_graph_39.map index 30a816aa0..c317666f3 100644 --- a/inherit_graph_39.map +++ b/inherit_graph_39.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_39.md5 b/inherit_graph_39.md5 index 13acdea92..16f443bc2 100644 --- a/inherit_graph_39.md5 +++ b/inherit_graph_39.md5 @@ -1 +1 @@ -1b89d7c751ab55bb7684be33105e985c \ No newline at end of file +ba02c371a07999b60a6a594e76432037 \ No newline at end of file diff --git a/inherit_graph_39.png b/inherit_graph_39.png index 6d38f1c3f..d0e19e622 100644 Binary files a/inherit_graph_39.png and b/inherit_graph_39.png differ diff --git a/inherit_graph_4.map b/inherit_graph_4.map index b4ac4ad5a..031aeffc8 100644 --- a/inherit_graph_4.map +++ b/inherit_graph_4.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_4.md5 b/inherit_graph_4.md5 index a3e07c29d..6c11c2c72 100644 --- a/inherit_graph_4.md5 +++ b/inherit_graph_4.md5 @@ -1 +1 @@ -1a7b5e2a1ed76d7e179c073e7b40e7c9 \ No newline at end of file +5807f00042d09c8d7d8b084223baa8e1 \ No newline at end of file diff --git a/inherit_graph_4.png b/inherit_graph_4.png index ed8177bb7..94a530d1d 100644 Binary files a/inherit_graph_4.png and b/inherit_graph_4.png differ diff --git a/inherit_graph_40.map b/inherit_graph_40.map index e419c0f74..1c53051a7 100644 --- a/inherit_graph_40.map +++ b/inherit_graph_40.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_40.md5 b/inherit_graph_40.md5 index 61a7d990e..f0a729d9c 100644 --- a/inherit_graph_40.md5 +++ b/inherit_graph_40.md5 @@ -1 +1 @@ -6c7da3eee6c8abaf6d4d3d417b870b0a \ No newline at end of file +732814765e4e495016c727ede78a0d28 \ No newline at end of file diff --git a/inherit_graph_40.png b/inherit_graph_40.png index de6194bbe..47c1990ff 100644 Binary files a/inherit_graph_40.png and b/inherit_graph_40.png differ diff --git a/inherit_graph_41.map b/inherit_graph_41.map index d75f18d59..7da8d4aa1 100644 --- a/inherit_graph_41.map +++ b/inherit_graph_41.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_41.md5 b/inherit_graph_41.md5 index 5e3311cfa..772865e8b 100644 --- a/inherit_graph_41.md5 +++ b/inherit_graph_41.md5 @@ -1 +1 @@ -09922e1f687dbf59c4d49a553a055e3d \ No newline at end of file +69b26adc13fab23ce85e71dd1e0cd551 \ No newline at end of file diff --git a/inherit_graph_41.png b/inherit_graph_41.png index 8299d1f06..46a08aa09 100644 Binary files a/inherit_graph_41.png and b/inherit_graph_41.png differ diff --git a/inherit_graph_42.map b/inherit_graph_42.map index ddbf65464..30a816aa0 100644 --- a/inherit_graph_42.map +++ b/inherit_graph_42.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_42.md5 b/inherit_graph_42.md5 index cb2387151..13acdea92 100644 --- a/inherit_graph_42.md5 +++ b/inherit_graph_42.md5 @@ -1 +1 @@ -dc9eabf5e5e1c20f1032c2e935cf9897 \ No newline at end of file +1b89d7c751ab55bb7684be33105e985c \ No newline at end of file diff --git a/inherit_graph_42.png b/inherit_graph_42.png index 31ae6ec2e..6d38f1c3f 100644 Binary files a/inherit_graph_42.png and b/inherit_graph_42.png differ diff --git a/inherit_graph_43.map b/inherit_graph_43.map index 771502692..e419c0f74 100644 --- a/inherit_graph_43.map +++ b/inherit_graph_43.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_43.md5 b/inherit_graph_43.md5 index 3d55d6e9c..61a7d990e 100644 --- a/inherit_graph_43.md5 +++ b/inherit_graph_43.md5 @@ -1 +1 @@ -13a63cca5df4d47b4697db93b9fe2ed8 \ No newline at end of file +6c7da3eee6c8abaf6d4d3d417b870b0a \ No newline at end of file diff --git a/inherit_graph_43.png b/inherit_graph_43.png index 9b2049208..de6194bbe 100644 Binary files a/inherit_graph_43.png and b/inherit_graph_43.png differ diff --git a/inherit_graph_44.map b/inherit_graph_44.map index c91e80a00..d75f18d59 100644 --- a/inherit_graph_44.map +++ b/inherit_graph_44.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_44.md5 b/inherit_graph_44.md5 index 69054c763..5e3311cfa 100644 --- a/inherit_graph_44.md5 +++ b/inherit_graph_44.md5 @@ -1 +1 @@ -58757bbf2e741c22a9fd31f3c5600b4f \ No newline at end of file +09922e1f687dbf59c4d49a553a055e3d \ No newline at end of file diff --git a/inherit_graph_44.png b/inherit_graph_44.png index 7676c4073..8299d1f06 100644 Binary files a/inherit_graph_44.png and b/inherit_graph_44.png differ diff --git a/inherit_graph_45.map b/inherit_graph_45.map index 5cfe7d630..ddbf65464 100644 --- a/inherit_graph_45.map +++ b/inherit_graph_45.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_45.md5 b/inherit_graph_45.md5 index 58540e2e8..cb2387151 100644 --- a/inherit_graph_45.md5 +++ b/inherit_graph_45.md5 @@ -1 +1 @@ -e30565cf2ead012b808d7040f9cfe5b4 \ No newline at end of file +dc9eabf5e5e1c20f1032c2e935cf9897 \ No newline at end of file diff --git a/inherit_graph_45.png b/inherit_graph_45.png index c2ffcc791..31ae6ec2e 100644 Binary files a/inherit_graph_45.png and b/inherit_graph_45.png differ diff --git a/inherit_graph_46.map b/inherit_graph_46.map index f6c752ef7..771502692 100644 --- a/inherit_graph_46.map +++ b/inherit_graph_46.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_46.md5 b/inherit_graph_46.md5 index 629e91112..3d55d6e9c 100644 --- a/inherit_graph_46.md5 +++ b/inherit_graph_46.md5 @@ -1 +1 @@ -882561e03c546d27f6e7efe9f00737cb \ No newline at end of file +13a63cca5df4d47b4697db93b9fe2ed8 \ No newline at end of file diff --git a/inherit_graph_46.png b/inherit_graph_46.png index ffda34bec..9b2049208 100644 Binary files a/inherit_graph_46.png and b/inherit_graph_46.png differ diff --git a/inherit_graph_47.map b/inherit_graph_47.map index 597dea7ff..f09aef0a8 100644 --- a/inherit_graph_47.map +++ b/inherit_graph_47.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_47.md5 b/inherit_graph_47.md5 index 3bb878b23..cb6e280d8 100644 --- a/inherit_graph_47.md5 +++ b/inherit_graph_47.md5 @@ -1 +1 @@ -61e7c12f72393c8539ce76d79cfac33d \ No newline at end of file +04e8a263434536499e7379d1a439fe8e \ No newline at end of file diff --git a/inherit_graph_47.png b/inherit_graph_47.png index d51816b84..3ba0a7e0d 100644 Binary files a/inherit_graph_47.png and b/inherit_graph_47.png differ diff --git a/inherit_graph_48.map b/inherit_graph_48.map index 0c48f8c94..24cf9fb3b 100644 --- a/inherit_graph_48.map +++ b/inherit_graph_48.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_48.md5 b/inherit_graph_48.md5 index 330784abd..579b4c51f 100644 --- a/inherit_graph_48.md5 +++ b/inherit_graph_48.md5 @@ -1 +1 @@ -93ac7ec76ac25aafcc0e17b6358646b3 \ No newline at end of file +347bbdc273285a69a8e647b7b9dc9ca0 \ No newline at end of file diff --git a/inherit_graph_48.png b/inherit_graph_48.png index b1c93e292..010d4cf2f 100644 Binary files a/inherit_graph_48.png and b/inherit_graph_48.png differ diff --git a/inherit_graph_49.map b/inherit_graph_49.map index c26bc93c0..a5e2cd03c 100644 --- a/inherit_graph_49.map +++ b/inherit_graph_49.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_49.md5 b/inherit_graph_49.md5 index ad17238fb..a27a9204c 100644 --- a/inherit_graph_49.md5 +++ b/inherit_graph_49.md5 @@ -1 +1 @@ -06a5af425a960ba2a9d1f85fdf83adb3 \ No newline at end of file +8e14374e2ff710cd52331ce366c87868 \ No newline at end of file diff --git a/inherit_graph_49.png b/inherit_graph_49.png index 55378eea1..932938fcf 100644 Binary files a/inherit_graph_49.png and b/inherit_graph_49.png differ diff --git a/inherit_graph_5.map b/inherit_graph_5.map index 6a077ec92..b4ac4ad5a 100644 --- a/inherit_graph_5.map +++ b/inherit_graph_5.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_5.md5 b/inherit_graph_5.md5 index 559e65a8c..a3e07c29d 100644 --- a/inherit_graph_5.md5 +++ b/inherit_graph_5.md5 @@ -1 +1 @@ -c35733e145c7bf19c0acb13efa04ad09 \ No newline at end of file +1a7b5e2a1ed76d7e179c073e7b40e7c9 \ No newline at end of file diff --git a/inherit_graph_5.png b/inherit_graph_5.png index c9273bffa..ed8177bb7 100644 Binary files a/inherit_graph_5.png and b/inherit_graph_5.png differ diff --git a/inherit_graph_50.map b/inherit_graph_50.map index e85660611..b0c7bdcc4 100644 --- a/inherit_graph_50.map +++ b/inherit_graph_50.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_50.md5 b/inherit_graph_50.md5 index c057e341d..a7ea7f782 100644 --- a/inherit_graph_50.md5 +++ b/inherit_graph_50.md5 @@ -1 +1 @@ -eabe58766435c4ec73e35f213ee663bd \ No newline at end of file +4189adf279a64f943c61efad220e6124 \ No newline at end of file diff --git a/inherit_graph_50.png b/inherit_graph_50.png index 883246261..1d4a54a57 100644 Binary files a/inherit_graph_50.png and b/inherit_graph_50.png differ diff --git a/inherit_graph_51.map b/inherit_graph_51.map index 9cc524a1a..eda09c5a0 100644 --- a/inherit_graph_51.map +++ b/inherit_graph_51.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_51.md5 b/inherit_graph_51.md5 index 1df3a375e..8d549cccb 100644 --- a/inherit_graph_51.md5 +++ b/inherit_graph_51.md5 @@ -1 +1 @@ -462538e27fbc0116273a699952c9c857 \ No newline at end of file +28f0c05d6098a8ff63191474d2c7804d \ No newline at end of file diff --git a/inherit_graph_51.png b/inherit_graph_51.png index ae7975956..ce17355fd 100644 Binary files a/inherit_graph_51.png and b/inherit_graph_51.png differ diff --git a/inherit_graph_52.map b/inherit_graph_52.map index 15642222d..8bda71f58 100644 --- a/inherit_graph_52.map +++ b/inherit_graph_52.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_52.md5 b/inherit_graph_52.md5 index 2b467d204..471569c43 100644 --- a/inherit_graph_52.md5 +++ b/inherit_graph_52.md5 @@ -1 +1 @@ -45fb2d53b7ee74861389444cd3ea99ab \ No newline at end of file +95b9b23df8875eb6ba5ef47d0ebb5cd7 \ No newline at end of file diff --git a/inherit_graph_52.png b/inherit_graph_52.png index 9d7dde5d0..cbcc9f9a5 100644 Binary files a/inherit_graph_52.png and b/inherit_graph_52.png differ diff --git a/inherit_graph_54.md5 b/inherit_graph_54.md5 index d22c4ee44..3da4ca96f 100644 --- a/inherit_graph_54.md5 +++ b/inherit_graph_54.md5 @@ -1 +1 @@ -9f14548860bf94eb7dc43e4f07de0d49 \ No newline at end of file +8a61adce35254987e6e34c83980a3d08 \ No newline at end of file diff --git a/inherit_graph_55.md5 b/inherit_graph_55.md5 index 668bd756d..669935b1f 100644 --- a/inherit_graph_55.md5 +++ b/inherit_graph_55.md5 @@ -1 +1 @@ -760e5d56a1cec0bec0182539e85609e9 \ No newline at end of file +c6614b0ccee73a6961f6e3f12c71d278 \ No newline at end of file diff --git a/inherit_graph_56.map b/inherit_graph_56.map index 8447207be..0556a136f 100644 --- a/inherit_graph_56.map +++ b/inherit_graph_56.map @@ -1,10 +1,4 @@ - - - - - - - - + + diff --git a/inherit_graph_56.md5 b/inherit_graph_56.md5 index 87ee28f0a..7ed7fc106 100644 --- a/inherit_graph_56.md5 +++ b/inherit_graph_56.md5 @@ -1 +1 @@ -ef967d4d3f6ab32510c1c734a9fa29b0 \ No newline at end of file +51295e483e744437a8f05eff562554b9 \ No newline at end of file diff --git a/inherit_graph_56.png b/inherit_graph_56.png index 0a781f16f..95b69fefa 100644 Binary files a/inherit_graph_56.png and b/inherit_graph_56.png differ diff --git a/inherit_graph_6.map b/inherit_graph_6.map index 1caefe12c..6a077ec92 100644 --- a/inherit_graph_6.map +++ b/inherit_graph_6.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_6.md5 b/inherit_graph_6.md5 index ddc0ecead..559e65a8c 100644 --- a/inherit_graph_6.md5 +++ b/inherit_graph_6.md5 @@ -1 +1 @@ -aa17a3f609116e2da2ac6d1ecdbe7fc1 \ No newline at end of file +c35733e145c7bf19c0acb13efa04ad09 \ No newline at end of file diff --git a/inherit_graph_6.png b/inherit_graph_6.png index 466ad4236..c9273bffa 100644 Binary files a/inherit_graph_6.png and b/inherit_graph_6.png differ diff --git a/inherit_graph_62.md5 b/inherit_graph_62.md5 index c7682bb97..fdf3e1080 100644 --- a/inherit_graph_62.md5 +++ b/inherit_graph_62.md5 @@ -1 +1 @@ -d0994c51b08ae1d7a27d06d416c922c8 \ No newline at end of file +94fbbf0e4a386b5eaabcd04032454f67 \ No newline at end of file diff --git a/inherit_graph_63.md5 b/inherit_graph_63.md5 index 78360172e..d6f740844 100644 --- a/inherit_graph_63.md5 +++ b/inherit_graph_63.md5 @@ -1 +1 @@ -d3b48f4ed506c0502b7ac0441766a252 \ No newline at end of file +ab4403df24e23fe5e91455bc0f26e00f \ No newline at end of file diff --git a/inherit_graph_64.map b/inherit_graph_64.map index a6863a9cc..cf660e4f7 100644 --- a/inherit_graph_64.map +++ b/inherit_graph_64.map @@ -1,4 +1,8 @@ - - + + + + + + diff --git a/inherit_graph_64.md5 b/inherit_graph_64.md5 index b57d3bc1e..b8d4efab9 100644 --- a/inherit_graph_64.md5 +++ b/inherit_graph_64.md5 @@ -1 +1 @@ -3df46596596b6a6f35e80329c524dcc7 \ No newline at end of file +9bf03599477721cc253c4644a0868ad4 \ No newline at end of file diff --git a/inherit_graph_64.png b/inherit_graph_64.png index 0ba61fa7d..7653d3bc7 100644 Binary files a/inherit_graph_64.png and b/inherit_graph_64.png differ diff --git a/inherit_graph_65.map b/inherit_graph_65.map index 497335219..a6863a9cc 100644 --- a/inherit_graph_65.map +++ b/inherit_graph_65.map @@ -1,4 +1,4 @@ - - + + diff --git a/inherit_graph_65.md5 b/inherit_graph_65.md5 index e135bd2ec..699217e8d 100644 --- a/inherit_graph_65.md5 +++ b/inherit_graph_65.md5 @@ -1 +1 @@ -5f3ddf48a94431f39f28b40707dd6f75 \ No newline at end of file +ac5e26b5675bd9eb473612adc0218304 \ No newline at end of file diff --git a/inherit_graph_65.png b/inherit_graph_65.png index 1ee5b20b8..0ba61fa7d 100644 Binary files a/inherit_graph_65.png and b/inherit_graph_65.png differ diff --git a/inherit_graph_66.map b/inherit_graph_66.map index 2b70c1f62..497335219 100644 --- a/inherit_graph_66.map +++ b/inherit_graph_66.map @@ -1,4 +1,4 @@ - - + + diff --git a/inherit_graph_66.md5 b/inherit_graph_66.md5 index 9d017b2d8..2fb44a0de 100644 --- a/inherit_graph_66.md5 +++ b/inherit_graph_66.md5 @@ -1 +1 @@ -12845823e34719c2e2e70741e3d3570c \ No newline at end of file +c99acf1d065d57641c811a2d442db50f \ No newline at end of file diff --git a/inherit_graph_66.png b/inherit_graph_66.png index feaaec07e..1ee5b20b8 100644 Binary files a/inherit_graph_66.png and b/inherit_graph_66.png differ diff --git a/inherit_graph_67.map b/inherit_graph_67.map index 2491a6041..2b70c1f62 100644 --- a/inherit_graph_67.map +++ b/inherit_graph_67.map @@ -1,17 +1,4 @@ - - - - - - - - - - - - - - - + + diff --git a/inherit_graph_67.md5 b/inherit_graph_67.md5 index 4de434a90..9d017b2d8 100644 --- a/inherit_graph_67.md5 +++ b/inherit_graph_67.md5 @@ -1 +1 @@ -48c692169a00d427bb0a986478817565 \ No newline at end of file +12845823e34719c2e2e70741e3d3570c \ No newline at end of file diff --git a/inherit_graph_67.png b/inherit_graph_67.png index bfd9c3458..feaaec07e 100644 Binary files a/inherit_graph_67.png and b/inherit_graph_67.png differ diff --git a/inherit_graph_68.map b/inherit_graph_68.map index 843577591..387c47094 100644 --- a/inherit_graph_68.map +++ b/inherit_graph_68.map @@ -1,3 +1,14 @@ - + + + + + + + + + + + + diff --git a/inherit_graph_68.md5 b/inherit_graph_68.md5 index 37e7d3705..f7a496881 100644 --- a/inherit_graph_68.md5 +++ b/inherit_graph_68.md5 @@ -1 +1 @@ -34f03ca642128807e87b88fa74ee6d4b \ No newline at end of file +ea68e10c1de6521896c27c51d3544be3 \ No newline at end of file diff --git a/inherit_graph_68.png b/inherit_graph_68.png index 01a6cedac..8e43eb158 100644 Binary files a/inherit_graph_68.png and b/inherit_graph_68.png differ diff --git a/inherit_graph_69.map b/inherit_graph_69.map index 327b76e24..843577591 100644 --- a/inherit_graph_69.map +++ b/inherit_graph_69.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_69.md5 b/inherit_graph_69.md5 index eed5cf60a..40149c806 100644 --- a/inherit_graph_69.md5 +++ b/inherit_graph_69.md5 @@ -1 +1 @@ -eb3473fa898b4198781a94f7fe479d98 \ No newline at end of file +77a302fd3a9e6a28544b44ed6a077785 \ No newline at end of file diff --git a/inherit_graph_69.png b/inherit_graph_69.png index e9b1c6928..bdfbee9cd 100644 Binary files a/inherit_graph_69.png and b/inherit_graph_69.png differ diff --git a/inherit_graph_7.map b/inherit_graph_7.map index b92f5fbcb..1caefe12c 100644 --- a/inherit_graph_7.map +++ b/inherit_graph_7.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_7.md5 b/inherit_graph_7.md5 index 9c5365c54..ddc0ecead 100644 --- a/inherit_graph_7.md5 +++ b/inherit_graph_7.md5 @@ -1 +1 @@ -534b2d9c247c8888b3e148aef77cee39 \ No newline at end of file +aa17a3f609116e2da2ac6d1ecdbe7fc1 \ No newline at end of file diff --git a/inherit_graph_7.png b/inherit_graph_7.png index dfc46861c..466ad4236 100644 Binary files a/inherit_graph_7.png and b/inherit_graph_7.png differ diff --git a/inherit_graph_70.map b/inherit_graph_70.map index ec19cac2c..4945539d1 100644 --- a/inherit_graph_70.map +++ b/inherit_graph_70.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_70.md5 b/inherit_graph_70.md5 index 086d99a9f..635292e9c 100644 --- a/inherit_graph_70.md5 +++ b/inherit_graph_70.md5 @@ -1 +1 @@ -076fb0c0e11ef1896e2f71b8405f148e \ No newline at end of file +a8385e13162dfd3a7848b7df38b2bec6 \ No newline at end of file diff --git a/inherit_graph_70.png b/inherit_graph_70.png index 6fd200838..fedb09a72 100644 Binary files a/inherit_graph_70.png and b/inherit_graph_70.png differ diff --git a/inherit_graph_71.map b/inherit_graph_71.map index 22ad069bf..327b76e24 100644 --- a/inherit_graph_71.map +++ b/inherit_graph_71.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_71.md5 b/inherit_graph_71.md5 index c0c1568c9..eed5cf60a 100644 --- a/inherit_graph_71.md5 +++ b/inherit_graph_71.md5 @@ -1 +1 @@ -4c42764b88de6d9c061cd8b129182dc4 \ No newline at end of file +eb3473fa898b4198781a94f7fe479d98 \ No newline at end of file diff --git a/inherit_graph_71.png b/inherit_graph_71.png index 198594432..e9b1c6928 100644 Binary files a/inherit_graph_71.png and b/inherit_graph_71.png differ diff --git a/inherit_graph_72.map b/inherit_graph_72.map index a43071256..ec19cac2c 100644 --- a/inherit_graph_72.map +++ b/inherit_graph_72.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_72.md5 b/inherit_graph_72.md5 index af4271873..086d99a9f 100644 --- a/inherit_graph_72.md5 +++ b/inherit_graph_72.md5 @@ -1 +1 @@ -330b475a39e3bca506a5dc1f4d5964aa \ No newline at end of file +076fb0c0e11ef1896e2f71b8405f148e \ No newline at end of file diff --git a/inherit_graph_72.png b/inherit_graph_72.png index 2fc1ba3dc..6fd200838 100644 Binary files a/inherit_graph_72.png and b/inherit_graph_72.png differ diff --git a/inherit_graph_73.map b/inherit_graph_73.map index 855c45bae..22ad069bf 100644 --- a/inherit_graph_73.map +++ b/inherit_graph_73.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_73.md5 b/inherit_graph_73.md5 index f70f2fa33..c0c1568c9 100644 --- a/inherit_graph_73.md5 +++ b/inherit_graph_73.md5 @@ -1 +1 @@ -4027cff6f3712e6a72b6f936e5acb66c \ No newline at end of file +4c42764b88de6d9c061cd8b129182dc4 \ No newline at end of file diff --git a/inherit_graph_73.png b/inherit_graph_73.png index d98f154d2..198594432 100644 Binary files a/inherit_graph_73.png and b/inherit_graph_73.png differ diff --git a/inherit_graph_74.map b/inherit_graph_74.map index 09d02d90f..a43071256 100644 --- a/inherit_graph_74.map +++ b/inherit_graph_74.map @@ -1,9 +1,3 @@ - - - - - - - + diff --git a/inherit_graph_74.md5 b/inherit_graph_74.md5 index 38ee37943..af4271873 100644 --- a/inherit_graph_74.md5 +++ b/inherit_graph_74.md5 @@ -1 +1 @@ -87a374541952e6aa049cf539f8920590 \ No newline at end of file +330b475a39e3bca506a5dc1f4d5964aa \ No newline at end of file diff --git a/inherit_graph_74.png b/inherit_graph_74.png index 7c443587c..2fc1ba3dc 100644 Binary files a/inherit_graph_74.png and b/inherit_graph_74.png differ diff --git a/inherit_graph_75.map b/inherit_graph_75.map index 56ce580df..b5493cbf7 100644 --- a/inherit_graph_75.map +++ b/inherit_graph_75.map @@ -1,3 +1,9 @@ - + + + + + + + diff --git a/inherit_graph_75.md5 b/inherit_graph_75.md5 index 298c34047..67dd38b79 100644 --- a/inherit_graph_75.md5 +++ b/inherit_graph_75.md5 @@ -1 +1 @@ -a773c5305e18d45fc936d9050e26c065 \ No newline at end of file +c6fbd7fe18f1bc72764987b269817447 \ No newline at end of file diff --git a/inherit_graph_75.png b/inherit_graph_75.png index bdf133ce8..a164ffa6c 100644 Binary files a/inherit_graph_75.png and b/inherit_graph_75.png differ diff --git a/inherit_graph_76.map b/inherit_graph_76.map index 026c3e0fb..56ce580df 100644 --- a/inherit_graph_76.map +++ b/inherit_graph_76.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_76.md5 b/inherit_graph_76.md5 index c8597f68f..298c34047 100644 --- a/inherit_graph_76.md5 +++ b/inherit_graph_76.md5 @@ -1 +1 @@ -91c00f5ff5bc0b3f1beb39a8ec570958 \ No newline at end of file +a773c5305e18d45fc936d9050e26c065 \ No newline at end of file diff --git a/inherit_graph_76.png b/inherit_graph_76.png index 8e8e156c8..bdf133ce8 100644 Binary files a/inherit_graph_76.png and b/inherit_graph_76.png differ diff --git a/inherit_graph_77.map b/inherit_graph_77.map index 9455cfaf6..026c3e0fb 100644 --- a/inherit_graph_77.map +++ b/inherit_graph_77.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_77.md5 b/inherit_graph_77.md5 index f1b054da2..f25391b60 100644 --- a/inherit_graph_77.md5 +++ b/inherit_graph_77.md5 @@ -1 +1 @@ -14eafd15d4260bc687c15eb815d71d5c \ No newline at end of file +c166e945b89b6ea2a9ce7b8475e7c308 \ No newline at end of file diff --git a/inherit_graph_77.png b/inherit_graph_77.png index a3a8cb4ca..94132fe38 100644 Binary files a/inherit_graph_77.png and b/inherit_graph_77.png differ diff --git a/inherit_graph_78.map b/inherit_graph_78.map index 7ad733edc..9455cfaf6 100644 --- a/inherit_graph_78.map +++ b/inherit_graph_78.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_78.md5 b/inherit_graph_78.md5 index ee4ac9fba..f1b054da2 100644 --- a/inherit_graph_78.md5 +++ b/inherit_graph_78.md5 @@ -1 +1 @@ -4c0278ec3dcebe512a78fe4101be199f \ No newline at end of file +14eafd15d4260bc687c15eb815d71d5c \ No newline at end of file diff --git a/inherit_graph_78.png b/inherit_graph_78.png index 71bbe59d1..a3a8cb4ca 100644 Binary files a/inherit_graph_78.png and b/inherit_graph_78.png differ diff --git a/inherit_graph_79.map b/inherit_graph_79.map index 758e259c5..7ad733edc 100644 --- a/inherit_graph_79.map +++ b/inherit_graph_79.map @@ -1,4 +1,3 @@ - - + diff --git a/inherit_graph_79.md5 b/inherit_graph_79.md5 index 03dfd1d1a..ee4ac9fba 100644 --- a/inherit_graph_79.md5 +++ b/inherit_graph_79.md5 @@ -1 +1 @@ -9258796f2e47a02056e0ea88c66395a3 \ No newline at end of file +4c0278ec3dcebe512a78fe4101be199f \ No newline at end of file diff --git a/inherit_graph_79.png b/inherit_graph_79.png index 0f3058618..71bbe59d1 100644 Binary files a/inherit_graph_79.png and b/inherit_graph_79.png differ diff --git a/inherit_graph_8.map b/inherit_graph_8.map index fc56f81b5..b92f5fbcb 100644 --- a/inherit_graph_8.map +++ b/inherit_graph_8.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_8.md5 b/inherit_graph_8.md5 index 5567b1da5..9c5365c54 100644 --- a/inherit_graph_8.md5 +++ b/inherit_graph_8.md5 @@ -1 +1 @@ -248430afa887e20c880be19357ad0ddb \ No newline at end of file +534b2d9c247c8888b3e148aef77cee39 \ No newline at end of file diff --git a/inherit_graph_8.png b/inherit_graph_8.png index b86f31bef..dfc46861c 100644 Binary files a/inherit_graph_8.png and b/inherit_graph_8.png differ diff --git a/inherit_graph_80.map b/inherit_graph_80.map index 691375de3..758e259c5 100644 --- a/inherit_graph_80.map +++ b/inherit_graph_80.map @@ -1,3 +1,4 @@ - + + diff --git a/inherit_graph_80.md5 b/inherit_graph_80.md5 index a0817f6a9..03dfd1d1a 100644 --- a/inherit_graph_80.md5 +++ b/inherit_graph_80.md5 @@ -1 +1 @@ -802468cda2436f79cf9ae87cd3ca4e3e \ No newline at end of file +9258796f2e47a02056e0ea88c66395a3 \ No newline at end of file diff --git a/inherit_graph_80.png b/inherit_graph_80.png index 0dc6e0248..0f3058618 100644 Binary files a/inherit_graph_80.png and b/inherit_graph_80.png differ diff --git a/inherit_graph_81.map b/inherit_graph_81.map index 9b0be2fbe..691375de3 100644 --- a/inherit_graph_81.map +++ b/inherit_graph_81.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_81.md5 b/inherit_graph_81.md5 index e9e3d654f..a0817f6a9 100644 --- a/inherit_graph_81.md5 +++ b/inherit_graph_81.md5 @@ -1 +1 @@ -7a310eae57d02dd70cfdbcd2618417c6 \ No newline at end of file +802468cda2436f79cf9ae87cd3ca4e3e \ No newline at end of file diff --git a/inherit_graph_81.png b/inherit_graph_81.png index e045fb6ab..0dc6e0248 100644 Binary files a/inherit_graph_81.png and b/inherit_graph_81.png differ diff --git a/inherit_graph_82.map b/inherit_graph_82.map index 935adff28..9b0be2fbe 100644 --- a/inherit_graph_82.map +++ b/inherit_graph_82.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_82.md5 b/inherit_graph_82.md5 index 1d7f68ae6..e9e3d654f 100644 --- a/inherit_graph_82.md5 +++ b/inherit_graph_82.md5 @@ -1 +1 @@ -321e749b475fd233551334b5ca35f466 \ No newline at end of file +7a310eae57d02dd70cfdbcd2618417c6 \ No newline at end of file diff --git a/inherit_graph_82.png b/inherit_graph_82.png index 86aa5e4a8..e045fb6ab 100644 Binary files a/inherit_graph_82.png and b/inherit_graph_82.png differ diff --git a/inherit_graph_83.map b/inherit_graph_83.map index ecba2eb00..935adff28 100644 --- a/inherit_graph_83.map +++ b/inherit_graph_83.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_83.md5 b/inherit_graph_83.md5 index 41487e6db..1d7f68ae6 100644 --- a/inherit_graph_83.md5 +++ b/inherit_graph_83.md5 @@ -1 +1 @@ -b967a6d0c1480e3fb0fceb4483ff8371 \ No newline at end of file +321e749b475fd233551334b5ca35f466 \ No newline at end of file diff --git a/inherit_graph_83.png b/inherit_graph_83.png index 1bd2d0227..86aa5e4a8 100644 Binary files a/inherit_graph_83.png and b/inherit_graph_83.png differ diff --git a/inherit_graph_84.map b/inherit_graph_84.map index 7f74a0fa0..ecba2eb00 100644 --- a/inherit_graph_84.map +++ b/inherit_graph_84.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_84.md5 b/inherit_graph_84.md5 index 4e5d21733..41487e6db 100644 --- a/inherit_graph_84.md5 +++ b/inherit_graph_84.md5 @@ -1 +1 @@ -460dfd49ecae25452c208db66f3f2e65 \ No newline at end of file +b967a6d0c1480e3fb0fceb4483ff8371 \ No newline at end of file diff --git a/inherit_graph_84.png b/inherit_graph_84.png index ae6e0bb85..1bd2d0227 100644 Binary files a/inherit_graph_84.png and b/inherit_graph_84.png differ diff --git a/inherit_graph_85.map b/inherit_graph_85.map index d64d5fd69..7f74a0fa0 100644 --- a/inherit_graph_85.map +++ b/inherit_graph_85.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_85.md5 b/inherit_graph_85.md5 index 7e940a5f0..4e5d21733 100644 --- a/inherit_graph_85.md5 +++ b/inherit_graph_85.md5 @@ -1 +1 @@ -a2c142cf89b5f294b78887e28860527c \ No newline at end of file +460dfd49ecae25452c208db66f3f2e65 \ No newline at end of file diff --git a/inherit_graph_85.png b/inherit_graph_85.png index b37fccc60..ae6e0bb85 100644 Binary files a/inherit_graph_85.png and b/inherit_graph_85.png differ diff --git a/inherit_graph_86.map b/inherit_graph_86.map index c6e9ad19f..d64d5fd69 100644 --- a/inherit_graph_86.map +++ b/inherit_graph_86.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_86.md5 b/inherit_graph_86.md5 index f816ee32e..7e940a5f0 100644 --- a/inherit_graph_86.md5 +++ b/inherit_graph_86.md5 @@ -1 +1 @@ -562bfa5ed0ef166bf4e7150f04b729ac \ No newline at end of file +a2c142cf89b5f294b78887e28860527c \ No newline at end of file diff --git a/inherit_graph_86.png b/inherit_graph_86.png index 26c00a951..b37fccc60 100644 Binary files a/inherit_graph_86.png and b/inherit_graph_86.png differ diff --git a/inherit_graph_87.map b/inherit_graph_87.map index a768c9944..c6e9ad19f 100644 --- a/inherit_graph_87.map +++ b/inherit_graph_87.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_87.md5 b/inherit_graph_87.md5 index 5730b89b1..f816ee32e 100644 --- a/inherit_graph_87.md5 +++ b/inherit_graph_87.md5 @@ -1 +1 @@ -e633c46d6b42df0bff8845a8fa3469e4 \ No newline at end of file +562bfa5ed0ef166bf4e7150f04b729ac \ No newline at end of file diff --git a/inherit_graph_87.png b/inherit_graph_87.png index 8fc698c88..26c00a951 100644 Binary files a/inherit_graph_87.png and b/inherit_graph_87.png differ diff --git a/inherit_graph_88.map b/inherit_graph_88.map index 1e537ad79..a768c9944 100644 --- a/inherit_graph_88.map +++ b/inherit_graph_88.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_88.md5 b/inherit_graph_88.md5 index 2d4442a3d..5730b89b1 100644 --- a/inherit_graph_88.md5 +++ b/inherit_graph_88.md5 @@ -1 +1 @@ -c0a257d1d0687c7dd3d76e01c0c15373 \ No newline at end of file +e633c46d6b42df0bff8845a8fa3469e4 \ No newline at end of file diff --git a/inherit_graph_88.png b/inherit_graph_88.png index 3de245cd1..8fc698c88 100644 Binary files a/inherit_graph_88.png and b/inherit_graph_88.png differ diff --git a/inherit_graph_89.map b/inherit_graph_89.map index e0ea58a64..1e537ad79 100644 --- a/inherit_graph_89.map +++ b/inherit_graph_89.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_89.md5 b/inherit_graph_89.md5 index 3a77b696c..2d4442a3d 100644 --- a/inherit_graph_89.md5 +++ b/inherit_graph_89.md5 @@ -1 +1 @@ -cb64bd5dd769de4af5f35bf2037fa465 \ No newline at end of file +c0a257d1d0687c7dd3d76e01c0c15373 \ No newline at end of file diff --git a/inherit_graph_89.png b/inherit_graph_89.png index b2ae4bc9d..3de245cd1 100644 Binary files a/inherit_graph_89.png and b/inherit_graph_89.png differ diff --git a/inherit_graph_9.map b/inherit_graph_9.map index 3e9b3fc2a..fc56f81b5 100644 --- a/inherit_graph_9.map +++ b/inherit_graph_9.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_9.md5 b/inherit_graph_9.md5 index 2d68a8791..5567b1da5 100644 --- a/inherit_graph_9.md5 +++ b/inherit_graph_9.md5 @@ -1 +1 @@ -4f7442d8a0535e7688e80200dd973abe \ No newline at end of file +248430afa887e20c880be19357ad0ddb \ No newline at end of file diff --git a/inherit_graph_9.png b/inherit_graph_9.png index e7e9b642d..b86f31bef 100644 Binary files a/inherit_graph_9.png and b/inherit_graph_9.png differ diff --git a/inherit_graph_90.map b/inherit_graph_90.map index 968412cb4..e0ea58a64 100644 --- a/inherit_graph_90.map +++ b/inherit_graph_90.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_90.md5 b/inherit_graph_90.md5 index 099e2c7f0..3a77b696c 100644 --- a/inherit_graph_90.md5 +++ b/inherit_graph_90.md5 @@ -1 +1 @@ -4b9e511df85fee92610fb57bfa3fc68a \ No newline at end of file +cb64bd5dd769de4af5f35bf2037fa465 \ No newline at end of file diff --git a/inherit_graph_90.png b/inherit_graph_90.png index c8a6e0acb..b2ae4bc9d 100644 Binary files a/inherit_graph_90.png and b/inherit_graph_90.png differ diff --git a/inherit_graph_91.map b/inherit_graph_91.map index aa713e0fd..968412cb4 100644 --- a/inherit_graph_91.map +++ b/inherit_graph_91.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_91.md5 b/inherit_graph_91.md5 index a6dbc6bb7..099e2c7f0 100644 --- a/inherit_graph_91.md5 +++ b/inherit_graph_91.md5 @@ -1 +1 @@ -f9c21dce8c2d4c4546e3ac96c9c05a5e \ No newline at end of file +4b9e511df85fee92610fb57bfa3fc68a \ No newline at end of file diff --git a/inherit_graph_91.png b/inherit_graph_91.png index 3f0b65877..c8a6e0acb 100644 Binary files a/inherit_graph_91.png and b/inherit_graph_91.png differ diff --git a/inherit_graph_92.map b/inherit_graph_92.map index 887cb017f..aa713e0fd 100644 --- a/inherit_graph_92.map +++ b/inherit_graph_92.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_92.md5 b/inherit_graph_92.md5 index be843110c..a6dbc6bb7 100644 --- a/inherit_graph_92.md5 +++ b/inherit_graph_92.md5 @@ -1 +1 @@ -affe8fc5bca695444ac4b82bf8ece2da \ No newline at end of file +f9c21dce8c2d4c4546e3ac96c9c05a5e \ No newline at end of file diff --git a/inherit_graph_92.png b/inherit_graph_92.png index af5091854..3f0b65877 100644 Binary files a/inherit_graph_92.png and b/inherit_graph_92.png differ diff --git a/inherit_graph_93.map b/inherit_graph_93.map index 6bf2607f2..887cb017f 100644 --- a/inherit_graph_93.map +++ b/inherit_graph_93.map @@ -1,3 +1,3 @@ - + diff --git a/inherit_graph_93.md5 b/inherit_graph_93.md5 index 6a589e934..be843110c 100644 --- a/inherit_graph_93.md5 +++ b/inherit_graph_93.md5 @@ -1 +1 @@ -1525e363ea19b2abe0e337bd0fd95ea2 \ No newline at end of file +affe8fc5bca695444ac4b82bf8ece2da \ No newline at end of file diff --git a/inherit_graph_93.png b/inherit_graph_93.png index 10344b7ba..af5091854 100644 Binary files a/inherit_graph_93.png and b/inherit_graph_93.png differ diff --git a/inherit_graph_94.md5 b/inherit_graph_94.md5 index ad99d1fcd..3ca40b07c 100644 --- a/inherit_graph_94.md5 +++ b/inherit_graph_94.md5 @@ -1 +1 @@ -f94218b2f10e3d21b76e22198b7af37b \ No newline at end of file +f58329013933ffc7c6b8abcbea97479d \ No newline at end of file diff --git a/inherits.html b/inherits.html index bc88385f6..78cbd1739 100644 --- a/inherits.html +++ b/inherits.html @@ -22,7 +22,7 @@

    @@ -74,273 +74,276 @@ $(function() { - + - - - - - - - - - - - - + - - - - - - - - - - - - + - - - - - - - - - - + - - - - - - - - - - - - - - - - - + - - - - - + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    - - - + @@ -403,23 +601,89 @@ template<typename Resource >

    Returns true if a cache contains no resources, false otherwise.

    Returns
    True if the cache contains no resources, false otherwise.
    -

    Definition at line 57 of file cache.hpp.

    +

    Definition at line 292 of file cache.hpp.

    - -

    ◆ handle() [1/2]

    + +

    ◆ end() [1/2]

    -template<typename Resource >
    +template<typename Type , typename Loader , typename Allocator >
    bool entt::resource_cache< Resource >::empty bool entt::resource_cache< Type, Loader, Allocator >::empty ( ) const
    + + +
    - + + + + + +
    resource_handle<resource_type> entt::resource_cache< Resource >::handle iterator entt::resource_cache< Type, Loader, Allocator >::end ()
    +     		+inline
    +
    + +

    Returns an iterator to the end.

    +

    The returned iterator points to the element following the last instance of the cache. Attempting to dereference the returned iterator results in undefined behavior.

    +
    Returns
    An iterator to the element following the last instance of the internal cache.
    + +

    Definition at line 284 of file cache.hpp.

    + +
    + + +

    ◆ end() [2/2]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + +
    const_iterator entt::resource_cache< Type, Loader, Allocator >::end () const
    +     		+inline
    +
    + +

    Returns an iterator to the end.

    +

    The returned iterator points to the element following the last instance of the cache. Attempting to dereference the returned iterator results in undefined behavior.

    +
    Returns
    An iterator to the element following the last instance of the internal cache.
    + +

    Definition at line 279 of file cache.hpp.

    + +
    +
    + +

    ◆ erase() [1/3]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + diff --git a/dir_66e9674e8206a335795995fa32a03c91.html b/dir_66e9674e8206a335795995fa32a03c91.html index 4ff3557cb..ddc86e8f1 100644 --- a/dir_66e9674e8206a335795995fa32a03c91.html +++ b/dir_66e9674e8206a335795995fa32a03c91.html @@ -22,7 +22,7 @@ diff --git a/dir_68267d1309a1af8e8297ef4c3efbcdba.html b/dir_68267d1309a1af8e8297ef4c3efbcdba.html index 8b4404c6c..795b821c6 100644 --- a/dir_68267d1309a1af8e8297ef4c3efbcdba.html +++ b/dir_68267d1309a1af8e8297ef4c3efbcdba.html @@ -22,7 +22,7 @@ diff --git a/dir_721f6154dba3c88bcdead5f446bce319.html b/dir_721f6154dba3c88bcdead5f446bce319.html index bdd559630..ba819c5ec 100644 --- a/dir_721f6154dba3c88bcdead5f446bce319.html +++ b/dir_721f6154dba3c88bcdead5f446bce319.html @@ -22,7 +22,7 @@ diff --git a/dir_7929ab29d3f740cf727ccbd263321562.html b/dir_7929ab29d3f740cf727ccbd263321562.html index b66b56ddd..7451fdb99 100644 --- a/dir_7929ab29d3f740cf727ccbd263321562.html +++ b/dir_7929ab29d3f740cf727ccbd263321562.html @@ -22,7 +22,7 @@ diff --git a/dir_7ec033ccd3859ebe4fcfc7c04a4d1ca0.html b/dir_7ec033ccd3859ebe4fcfc7c04a4d1ca0.html index 6afa0cdc6..4c1b7673f 100644 --- a/dir_7ec033ccd3859ebe4fcfc7c04a4d1ca0.html +++ b/dir_7ec033ccd3859ebe4fcfc7c04a4d1ca0.html @@ -22,7 +22,7 @@ diff --git a/dir_84cd6c110d68697bc23812bee21a8ed6.html b/dir_84cd6c110d68697bc23812bee21a8ed6.html index 3b1804958..f22c739b2 100644 --- a/dir_84cd6c110d68697bc23812bee21a8ed6.html +++ b/dir_84cd6c110d68697bc23812bee21a8ed6.html @@ -22,7 +22,7 @@ diff --git a/dir_85dbee8884f1b3a817fa7eff8dff73ec.html b/dir_85dbee8884f1b3a817fa7eff8dff73ec.html index 1550b110d..5b5066f1f 100644 --- a/dir_85dbee8884f1b3a817fa7eff8dff73ec.html +++ b/dir_85dbee8884f1b3a817fa7eff8dff73ec.html @@ -22,7 +22,7 @@ diff --git a/dir_a53318306f6ac0f7fe657839abd543ab.html b/dir_a53318306f6ac0f7fe657839abd543ab.html index 7847b04eb..5e18f2630 100644 --- a/dir_a53318306f6ac0f7fe657839abd543ab.html +++ b/dir_a53318306f6ac0f7fe657839abd543ab.html @@ -22,7 +22,7 @@ diff --git a/dir_b64489a1e8130d5ebf6d86d282f500f0.html b/dir_b64489a1e8130d5ebf6d86d282f500f0.html index 44ce29206..886184235 100644 --- a/dir_b64489a1e8130d5ebf6d86d282f500f0.html +++ b/dir_b64489a1e8130d5ebf6d86d282f500f0.html @@ -22,7 +22,7 @@ diff --git a/dir_c183064df1291357db1d38c637c6e87c.html b/dir_c183064df1291357db1d38c637c6e87c.html index e0d34f358..f7fcf720a 100644 --- a/dir_c183064df1291357db1d38c637c6e87c.html +++ b/dir_c183064df1291357db1d38c637c6e87c.html @@ -22,7 +22,7 @@ diff --git a/dir_c5715f7ee899854a669b87bbaa642de0.html b/dir_c5715f7ee899854a669b87bbaa642de0.html index 2cc0002eb..c5014757b 100644 --- a/dir_c5715f7ee899854a669b87bbaa642de0.html +++ b/dir_c5715f7ee899854a669b87bbaa642de0.html @@ -22,7 +22,7 @@ diff --git a/dir_caf434cd0cc634da803ab3b40811fcd6.html b/dir_caf434cd0cc634da803ab3b40811fcd6.html index 63d29e5fb..1928616ef 100644 --- a/dir_caf434cd0cc634da803ab3b40811fcd6.html +++ b/dir_caf434cd0cc634da803ab3b40811fcd6.html @@ -22,7 +22,7 @@ diff --git a/dir_de8f4e6ba3f54a2a21309f742e93a373.html b/dir_de8f4e6ba3f54a2a21309f742e93a373.html index 82a1c1072..b70d5d25a 100644 --- a/dir_de8f4e6ba3f54a2a21309f742e93a373.html +++ b/dir_de8f4e6ba3f54a2a21309f742e93a373.html @@ -22,7 +22,7 @@ diff --git a/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html b/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html index 543af0390..4bbce4bbe 100644 --- a/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html +++ b/dir_e3a7bb56c55e5c2286e2fe96e197d4f5.html @@ -22,7 +22,7 @@ diff --git a/dir_fbf131c40613b6c97d74b601844612e4.html b/dir_fbf131c40613b6c97d74b601844612e4.html index 8fa0947f6..d6d17b2e9 100644 --- a/dir_fbf131c40613b6c97d74b601844612e4.html +++ b/dir_fbf131c40613b6c97d74b601844612e4.html @@ -22,7 +22,7 @@ diff --git a/dispatcher_8hpp_source.html b/dispatcher_8hpp_source.html index aa7af5260..495981d7e 100644 --- a/dispatcher_8hpp_source.html +++ b/dispatcher_8hpp_source.html @@ -22,7 +22,7 @@ @@ -73,179 +73,283 @@ $(function() {
    1 #ifndef ENTT_SIGNAL_DISPATCHER_HPP
    2 #define ENTT_SIGNAL_DISPATCHER_HPP
    3 
    -
    4 #include <cstddef>
    -
    5 #include <memory>
    -
    6 #include <type_traits>
    -
    7 #include <utility>
    -
    8 #include <vector>
    -
    9 #include "../config/config.h"
    -
    10 #include "../container/dense_hash_map.hpp"
    -
    11 #include "../core/fwd.hpp"
    -
    12 #include "../core/type_info.hpp"
    -
    13 #include "../core/utility.hpp"
    -
    14 #include "sigh.hpp"
    -
    15 
    -
    16 namespace entt {
    -
    17 
    -
    30 class dispatcher {
    -
    31  struct basic_pool {
    -
    32  virtual ~basic_pool() = default;
    -
    33  virtual void publish() = 0;
    -
    34  virtual void disconnect(void *) = 0;
    -
    35  virtual void clear() ENTT_NOEXCEPT = 0;
    -
    36  };
    -
    37 
    -
    38  template<typename Event>
    -
    39  struct pool_handler final: basic_pool {
    -
    40  static_assert(std::is_same_v<Event, std::decay_t<Event>>, "Invalid event type");
    -
    41 
    -
    42  using signal_type = sigh<void(Event &)>;
    -
    43  using sink_type = typename signal_type::sink_type;
    -
    44 
    -
    45  void publish() override {
    -
    46  const auto length = events.size();
    -
    47 
    -
    48  for(std::size_t pos{}; pos < length; ++pos) {
    -
    49  signal.publish(events[pos]);
    -
    50  }
    -
    51 
    -
    52  events.erase(events.cbegin(), events.cbegin() + length);
    -
    53  }
    -
    54 
    -
    55  void disconnect(void *instance) override {
    -
    56  bucket().disconnect(instance);
    -
    57  }
    -
    58 
    -
    59  void clear() ENTT_NOEXCEPT override {
    -
    60  events.clear();
    -
    61  }
    -
    62 
    -
    63  [[nodiscard]] sink_type bucket() ENTT_NOEXCEPT {
    -
    64  return sink_type{signal};
    -
    65  }
    -
    66 
    -
    67  template<typename... Args>
    -
    68  void trigger(Args &&...args) {
    -
    69  Event instance{std::forward<Args>(args)...};
    -
    70  signal.publish(instance);
    -
    71  }
    -
    72 
    -
    73  template<typename... Args>
    -
    74  void enqueue(Args &&...args) {
    -
    75  if constexpr(std::is_aggregate_v<Event>) {
    -
    76  events.push_back(Event{std::forward<Args>(args)...});
    -
    77  } else {
    -
    78  events.emplace_back(std::forward<Args>(args)...);
    -
    79  }
    -
    80  }
    -
    81 
    -
    82  private:
    -
    83  signal_type signal{};
    -
    84  std::vector<Event> events;
    -
    85  };
    +
    4 #include <algorithm>
    +
    5 #include <cstddef>
    +
    6 #include <memory>
    +
    7 #include <type_traits>
    +
    8 #include <utility>
    +
    9 #include <vector>
    +
    10 #include "../config/config.h"
    +
    11 #include "../container/dense_map.hpp"
    +
    12 #include "../core/compressed_pair.hpp"
    +
    13 #include "../core/fwd.hpp"
    +
    14 #include "../core/type_info.hpp"
    +
    15 #include "../core/utility.hpp"
    +
    16 #include "fwd.hpp"
    +
    17 #include "sigh.hpp"
    +
    18 
    +
    19 namespace entt {
    +
    20 
    +
    26 namespace internal {
    +
    27 
    +
    28 struct basic_dispatcher_handler {
    +
    29  virtual ~basic_dispatcher_handler() = default;
    +
    30  virtual void publish() = 0;
    +
    31  virtual void disconnect(void *) = 0;
    +
    32  virtual void clear() ENTT_NOEXCEPT = 0;
    +
    33  virtual std::size_t size() const ENTT_NOEXCEPT = 0;
    +
    34 };
    +
    35 
    +
    36 template<typename Event, typename Allocator>
    +
    37 class dispatcher_handler final: public basic_dispatcher_handler {
    +
    38  static_assert(std::is_same_v<Event, std::decay_t<Event>>, "Invalid event type");
    +
    39 
    +
    40  using alloc_traits = std::allocator_traits<Allocator>;
    +
    41  using signal_type = sigh<void(Event &), typename alloc_traits::template rebind_alloc<void (*)(Event &)>>;
    +
    42  using container_type = std::vector<Event, typename alloc_traits::template rebind_alloc<Event>>;
    +
    43 
    +
    44 public:
    +
    45  using allocator_type = Allocator;
    +
    46 
    +
    47  dispatcher_handler(const allocator_type &allocator)
    +
    48  : signal{allocator},
    +
    49  events{allocator} {}
    +
    50 
    +
    51  void publish() override {
    +
    52  const auto length = events.size();
    +
    53 
    +
    54  for(std::size_t pos{}; pos < length; ++pos) {
    +
    55  signal.publish(events[pos]);
    +
    56  }
    +
    57 
    +
    58  events.erase(events.cbegin(), events.cbegin() + length);
    +
    59  }
    +
    60 
    +
    61  void disconnect(void *instance) override {
    +
    62  bucket().disconnect(instance);
    +
    63  }
    +
    64 
    +
    65  void clear() ENTT_NOEXCEPT override {
    +
    66  events.clear();
    +
    67  }
    +
    68 
    +
    69  [[nodiscard]] auto bucket() ENTT_NOEXCEPT {
    +
    70  using sink_type = typename sigh<void(Event &)>::sink_type;
    +
    71  return sink_type{signal};
    +
    72  }
    +
    73 
    +
    74  void trigger(Event event) {
    +
    75  signal.publish(event);
    +
    76  }
    +
    77 
    +
    78  template<typename... Args>
    +
    79  void enqueue(Args &&...args) {
    +
    80  if constexpr(std::is_aggregate_v<Event>) {
    +
    81  events.push_back(Event{std::forward<Args>(args)...});
    +
    82  } else {
    +
    83  events.emplace_back(std::forward<Args>(args)...);
    +
    84  }
    +
    85  }
    86 
    -
    87  template<typename Event>
    -
    88  [[nodiscard]] pool_handler<Event> &assure() {
    -
    89  if(auto &&ptr = pools[type_hash<Event>::value()]; !ptr) {
    -
    90  auto *cpool = new pool_handler<Event>{};
    -
    91  ptr.reset(cpool);
    -
    92  return *cpool;
    -
    93  } else {
    -
    94  return static_cast<pool_handler<Event> &>(*ptr);
    -
    95  }
    -
    96  }
    +
    87  std::size_t size() const ENTT_NOEXCEPT override {
    +
    88  return events.size();
    +
    89  }
    +
    90 
    +
    91 private:
    +
    92  signal_type signal;
    +
    93  container_type events;
    +
    94 };
    +
    95 
    +
    96 } // namespace internal
    97 
    -
    98 public:
    -
    100  dispatcher() = default;
    -
    101 
    -
    103  dispatcher(dispatcher &&) = default;
    -
    104 
    -
    106  dispatcher &operator=(dispatcher &&) = default;
    -
    107 
    -
    125  template<typename Event>
    -
    126  [[nodiscard]] auto sink() {
    -
    127  return assure<Event>().bucket();
    -
    128  }
    +
    117 template<typename Allocator>
    +
    118 class basic_dispatcher {
    +
    119  template<typename Event>
    +
    120  using handler_type = internal::dispatcher_handler<Event, Allocator>;
    +
    121 
    +
    122  using key_type = id_type;
    +
    123  // std::shared_ptr because of its type erased allocator which is pretty useful here
    +
    124  using mapped_type = std::shared_ptr<internal::basic_dispatcher_handler>;
    +
    125 
    +
    126  using alloc_traits = std::allocator_traits<Allocator>;
    +
    127  using container_allocator = typename alloc_traits::template rebind_alloc<std::pair<const key_type, mapped_type>>;
    +
    128  using container_type = dense_map<id_type, mapped_type, identity, std::equal_to<id_type>, container_allocator>;
    129 
    -
    140  template<typename Event, typename... Args>
    -
    141  void trigger(Args &&...args) {
    -
    142  assure<Event>().trigger(std::forward<Args>(args)...);
    -
    143  }
    -
    144 
    -
    154  template<typename Event>
    -
    155  void trigger(Event &&event) {
    -
    156  assure<std::decay_t<Event>>().trigger(std::forward<Event>(event));
    -
    157  }
    +
    130  template<typename Event>
    +
    131  [[nodiscard]] handler_type<Event> &assure(const id_type id) {
    +
    132  auto &&ptr = pools.first()[id];
    +
    133 
    +
    134  if(!ptr) {
    +
    135  const auto &allocator = pools.second();
    +
    136  ptr = std::allocate_shared<handler_type<Event>>(allocator, allocator);
    +
    137  }
    +
    138 
    +
    139  return static_cast<handler_type<Event> &>(*ptr);
    +
    140  }
    +
    141 
    +
    142  template<typename Event>
    +
    143  [[nodiscard]] const handler_type<Event> *assure(const id_type id) const {
    +
    144  auto &container = pools.first();
    +
    145 
    +
    146  if(const auto it = container.find(id); it != container.end()) {
    +
    147  return static_cast<const handler_type<Event> *>(it->second.get());
    +
    148  }
    +
    149 
    +
    150  return nullptr;
    +
    151  }
    +
    152 
    +
    153 public:
    +
    155  using allocator_type = Allocator;
    +
    157  using size_type = std::size_t;
    158 
    -
    169  template<typename Event, typename... Args>
    -
    170  void enqueue(Args &&...args) {
    -
    171  assure<Event>().enqueue(std::forward<Args>(args)...);
    -
    172  }
    -
    173 
    -
    183  template<typename Event>
    -
    184  void enqueue(Event &&event) {
    -
    185  assure<std::decay_t<Event>>().enqueue(std::forward<Event>(event));
    -
    186  }
    -
    187 
    -
    194  template<typename Type>
    -
    195  void disconnect(Type &value_or_instance) {
    -
    196  disconnect(&value_or_instance);
    -
    197  }
    -
    198 
    -
    205  template<typename Type>
    -
    206  void disconnect(Type *value_or_instance) {
    -
    207  for(auto &&cpool: pools) {
    -
    208  cpool.second->disconnect(value_or_instance);
    -
    209  }
    +
    160  basic_dispatcher()
    +
    161  : basic_dispatcher{allocator_type{}} {}
    +
    162 
    +
    167  explicit basic_dispatcher(const allocator_type &allocator)
    +
    168  : pools{allocator, allocator} {}
    +
    169 
    +
    174  basic_dispatcher(basic_dispatcher &&other) ENTT_NOEXCEPT
    +
    175  : pools{std::move(other.pools)} {}
    +
    176 
    +
    182  basic_dispatcher(basic_dispatcher &&other, const allocator_type &allocator) ENTT_NOEXCEPT
    +
    183  : pools{container_type{std::move(other.pools.first()), allocator}, allocator} {}
    +
    184 
    +
    190  basic_dispatcher &operator=(basic_dispatcher &&other) ENTT_NOEXCEPT {
    +
    191  pools = std::move(other.pools);
    +
    192  return *this;
    +
    193  }
    +
    194 
    +
    199  void swap(basic_dispatcher &other) {
    +
    200  using std::swap;
    +
    201  swap(pools, other.pools);
    +
    202  }
    +
    203 
    +
    208  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
    +
    209  return pools.second();
    210  }
    211 
    -
    220  template<typename... Event>
    -
    221  void clear() {
    -
    222  if constexpr(sizeof...(Event) == 0) {
    -
    223  for(auto &&cpool: pools) {
    -
    224  cpool.second->clear();
    -
    225  }
    -
    226  } else {
    -
    227  (assure<Event>().clear(), ...);
    -
    228  }
    -
    229  }
    +
    218  template<typename Event>
    +
    219  size_type size(const id_type id = type_hash<Event>::value()) const ENTT_NOEXCEPT {
    +
    220  const auto *cpool = assure<Event>(id);
    +
    221  return cpool ? cpool->size() : 0u;
    +
    222  }
    +
    223 
    +
    228  size_type size() const ENTT_NOEXCEPT {
    +
    229  size_type count{};
    230 
    -
    240  template<typename Event>
    -
    241  void update() {
    -
    242  assure<Event>().publish();
    -
    243  }
    -
    244 
    -
    252  void update() const {
    -
    253  for(auto &&cpool: pools) {
    -
    254  cpool.second->publish();
    -
    255  }
    -
    256  }
    -
    257 
    -
    258 private:
    -
    259  dense_hash_map<id_type, std::unique_ptr<basic_pool>, identity> pools;
    -
    260 };
    -
    261 
    -
    262 } // namespace entt
    -
    263 
    -
    264 #endif
    -
    entt::dense_hash_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_hash_map.hpp:240
    -
    entt::dispatcher
    Basic dispatcher implementation.
    Definition: dispatcher.hpp:30
    -
    entt::dispatcher::dispatcher
    dispatcher(dispatcher &&)=default
    Default move constructor.
    -
    entt::dispatcher::sink
    auto sink()
    Returns a sink object for the given event.
    Definition: dispatcher.hpp:126
    -
    entt::dispatcher::trigger
    void trigger(Args &&...args)
    Triggers an immediate event of the given type.
    Definition: dispatcher.hpp:141
    -
    entt::dispatcher::disconnect
    void disconnect(Type *value_or_instance)
    Utility function to disconnect everything related to a given value or instance from a dispatcher.
    Definition: dispatcher.hpp:206
    -
    entt::dispatcher::trigger
    void trigger(Event &&event)
    Triggers an immediate event of the given type.
    Definition: dispatcher.hpp:155
    -
    entt::dispatcher::enqueue
    void enqueue(Event &&event)
    Enqueues an event of the given type.
    Definition: dispatcher.hpp:184
    -
    entt::dispatcher::enqueue
    void enqueue(Args &&...args)
    Enqueues an event of the given type.
    Definition: dispatcher.hpp:170
    -
    entt::dispatcher::clear
    void clear()
    Discards all the events queued so far.
    Definition: dispatcher.hpp:221
    -
    entt::dispatcher::disconnect
    void disconnect(Type &value_or_instance)
    Utility function to disconnect everything related to a given value or instance from a dispatcher.
    Definition: dispatcher.hpp:195
    -
    entt::dispatcher::dispatcher
    dispatcher()=default
    Default constructor.
    -
    entt::dispatcher::operator=
    dispatcher & operator=(dispatcher &&)=default
    Default move assignment operator.
    -
    entt::dispatcher::update
    void update()
    Delivers all the pending events of the given type.
    Definition: dispatcher.hpp:241
    -
    entt::dispatcher::update
    void update() const
    Delivers all the pending events.
    Definition: dispatcher.hpp:252
    -
    entt::sigh
    Unmanaged signal handler.
    Definition: fwd.hpp:24
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::identity
    Identity function object (waiting for C++20).
    Definition: utility.hpp:10
    +
    231  for(auto &&cpool: pools.first()) {
    +
    232  count += cpool.second->size();
    +
    233  }
    +
    234 
    +
    235  return count;
    +
    236  }
    +
    237 
    +
    256  template<typename Event>
    +
    257  [[nodiscard]] auto sink(const id_type id = type_hash<Event>::value()) {
    +
    258  return assure<Event>(id).bucket();
    +
    259  }
    +
    260 
    +
    266  template<typename Event>
    +
    267  void trigger(Event &&event = {}) {
    +
    268  trigger(type_hash<std::decay_t<Event>>::value(), std::forward<Event>(event));
    +
    269  }
    +
    270 
    +
    277  template<typename Event>
    +
    278  void trigger(const id_type id, Event &&event = {}) {
    +
    279  assure<std::decay_t<Event>>(id).trigger(std::forward<Event>(event));
    +
    280  }
    +
    281 
    +
    288  template<typename Event, typename... Args>
    +
    289  void enqueue(Args &&...args) {
    +
    290  enqueue_hint<Event>(type_hash<Event>::value(), std::forward<Args>(args)...);
    +
    291  }
    +
    292 
    +
    298  template<typename Event>
    +
    299  void enqueue(Event &&event) {
    +
    300  enqueue_hint(type_hash<std::decay_t<Event>>::value(), std::forward<Event>(event));
    +
    301  }
    +
    302 
    +
    310  template<typename Event, typename... Args>
    +
    311  void enqueue_hint(const id_type id, Args &&...args) {
    +
    312  assure<Event>(id).enqueue(std::forward<Args>(args)...);
    +
    313  }
    +
    314 
    +
    321  template<typename Event>
    +
    322  void enqueue_hint(const id_type id, Event &&event) {
    +
    323  assure<std::decay_t<Event>>(id).enqueue(std::forward<Event>(event));
    +
    324  }
    +
    325 
    +
    332  template<typename Type>
    +
    333  void disconnect(Type &value_or_instance) {
    +
    334  disconnect(&value_or_instance);
    +
    335  }
    +
    336 
    +
    343  template<typename Type>
    +
    344  void disconnect(Type *value_or_instance) {
    +
    345  for(auto &&cpool: pools.first()) {
    +
    346  cpool.second->disconnect(value_or_instance);
    +
    347  }
    +
    348  }
    +
    349 
    +
    355  template<typename Event>
    +
    356  void clear(const id_type id = type_hash<Event>::value()) {
    +
    357  assure<Event>(id).clear();
    +
    358  }
    +
    359 
    +
    361  void clear() ENTT_NOEXCEPT {
    +
    362  for(auto &&cpool: pools.first()) {
    +
    363  cpool.second->clear();
    +
    364  }
    +
    365  }
    +
    366 
    +
    372  template<typename Event>
    +
    373  void update(const id_type id = type_hash<Event>::value()) {
    +
    374  assure<Event>(id).publish();
    +
    375  }
    +
    376 
    +
    378  void update() const {
    +
    379  for(auto &&cpool: pools.first()) {
    +
    380  cpool.second->publish();
    +
    381  }
    +
    382  }
    +
    383 
    +
    384 private:
    +
    385  compressed_pair<container_type, allocator_type> pools;
    +
    386 };
    +
    387 
    +
    388 } // namespace entt
    +
    389 
    +
    390 #endif
    +
    entt::basic_dispatcher
    Basic dispatcher implementation.
    Definition: dispatcher.hpp:118
    +
    entt::basic_dispatcher::swap
    void swap(basic_dispatcher &other)
    Exchanges the contents with those of a given dispatcher.
    Definition: dispatcher.hpp:199
    +
    entt::basic_dispatcher::get_allocator
    constexpr allocator_type get_allocator() const
    Returns the associated allocator.
    Definition: dispatcher.hpp:208
    +
    entt::basic_dispatcher::size
    size_type size() const
    Returns the total number of pending events.
    Definition: dispatcher.hpp:228
    +
    entt::basic_dispatcher::enqueue
    void enqueue(Event &&event)
    Enqueues an event of the given type.
    Definition: dispatcher.hpp:299
    +
    entt::basic_dispatcher::allocator_type
    Allocator allocator_type
    Allocator type.
    Definition: dispatcher.hpp:155
    +
    entt::basic_dispatcher::basic_dispatcher
    basic_dispatcher(basic_dispatcher &&other, const allocator_type &allocator)
    Allocator-extended move constructor.
    Definition: dispatcher.hpp:182
    +
    entt::basic_dispatcher::update
    void update() const
    Delivers all the pending events.
    Definition: dispatcher.hpp:378
    +
    entt::basic_dispatcher::clear
    void clear(const id_type id=type_hash< Event >::value())
    Discards all the events stored so far in a given queue.
    Definition: dispatcher.hpp:356
    +
    entt::basic_dispatcher::enqueue_hint
    void enqueue_hint(const id_type id, Args &&...args)
    Enqueues an event of the given type.
    Definition: dispatcher.hpp:311
    +
    entt::basic_dispatcher::size
    size_type size(const id_type id=type_hash< Event >::value()) const
    Returns the number of pending events for a given type.
    Definition: dispatcher.hpp:219
    +
    entt::basic_dispatcher::sink
    auto sink(const id_type id=type_hash< Event >::value())
    Returns a sink object for the given event and queue.
    Definition: dispatcher.hpp:257
    +
    entt::basic_dispatcher::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: dispatcher.hpp:157
    +
    entt::basic_dispatcher::operator=
    basic_dispatcher & operator=(basic_dispatcher &&other)
    Move assignment operator.
    Definition: dispatcher.hpp:190
    +
    entt::basic_dispatcher::disconnect
    void disconnect(Type &value_or_instance)
    Utility function to disconnect everything related to a given value or instance from a dispatcher.
    Definition: dispatcher.hpp:333
    +
    entt::basic_dispatcher::trigger
    void trigger(Event &&event={})
    Triggers an immediate event of a given type.
    Definition: dispatcher.hpp:267
    +
    entt::basic_dispatcher::update
    void update(const id_type id=type_hash< Event >::value())
    Delivers all the pending events of a given queue.
    Definition: dispatcher.hpp:373
    +
    entt::basic_dispatcher::clear
    void clear()
    Discards all the events queued so far.
    Definition: dispatcher.hpp:361
    +
    entt::basic_dispatcher::enqueue_hint
    void enqueue_hint(const id_type id, Event &&event)
    Enqueues an event of the given type.
    Definition: dispatcher.hpp:322
    +
    entt::basic_dispatcher::basic_dispatcher
    basic_dispatcher()
    Default constructor.
    Definition: dispatcher.hpp:160
    +
    entt::basic_dispatcher::basic_dispatcher
    basic_dispatcher(basic_dispatcher &&other)
    Move constructor.
    Definition: dispatcher.hpp:174
    +
    entt::basic_dispatcher::basic_dispatcher
    basic_dispatcher(const allocator_type &allocator)
    Constructs a dispatcher with a given allocator.
    Definition: dispatcher.hpp:167
    +
    entt::basic_dispatcher::disconnect
    void disconnect(Type *value_or_instance)
    Utility function to disconnect everything related to a given value or instance from a dispatcher.
    Definition: dispatcher.hpp:344
    +
    entt::basic_dispatcher::enqueue
    void enqueue(Args &&...args)
    Enqueues an event of the given type.
    Definition: dispatcher.hpp:289
    +
    entt::basic_dispatcher::trigger
    void trigger(const id_type id, Event &&event={})
    Triggers an immediate event on a queue of a given type.
    Definition: dispatcher.hpp:278
    +
    entt::compressed_pair< container_type, allocator_type >
    +
    entt::dense_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_map.hpp:265
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    +
    entt::swap
    void swap(compressed_pair< First, Second > &lhs, compressed_pair< First, Second > &rhs)
    Swaps two compressed pair objects.
    Definition: compressed_pair.hpp:248
    entt::type_hash
    Type hash.
    Definition: type_info.hpp:100
    diff --git a/emitter_8hpp_source.html b/emitter_8hpp_source.html index 73b338010..f27da9cc6 100644 --- a/emitter_8hpp_source.html +++ b/emitter_8hpp_source.html @@ -22,7 +22,7 @@ @@ -81,205 +81,205 @@ $(function() {
    9 #include <type_traits>
    10 #include <utility>
    11 #include "../config/config.h"
    -
    12 #include "../container/dense_hash_map.hpp"
    +
    12 #include "../container/dense_map.hpp"
    13 #include "../core/fwd.hpp"
    14 #include "../core/type_info.hpp"
    15 #include "../core/utility.hpp"
    -
    16 
    -
    17 namespace entt {
    -
    18 
    -
    40 template<typename Derived>
    -
    41 class emitter {
    -
    42  struct basic_pool {
    -
    43  virtual ~basic_pool() = default;
    -
    44  virtual bool empty() const ENTT_NOEXCEPT = 0;
    -
    45  virtual void clear() ENTT_NOEXCEPT = 0;
    -
    46  };
    -
    47 
    -
    48  template<typename Event>
    -
    49  struct pool_handler final: basic_pool {
    -
    50  static_assert(std::is_same_v<Event, std::decay_t<Event>>, "Invalid event type");
    -
    51 
    -
    52  using listener_type = std::function<void(Event &, Derived &)>;
    -
    53  using element_type = std::pair<bool, listener_type>;
    -
    54  using container_type = std::list<element_type>;
    -
    55  using connection_type = typename container_type::iterator;
    -
    56 
    -
    57  [[nodiscard]] bool empty() const ENTT_NOEXCEPT override {
    -
    58  auto pred = [](auto &&element) { return element.first; };
    -
    59 
    -
    60  return std::all_of(once_list.cbegin(), once_list.cend(), pred)
    -
    61  && std::all_of(on_list.cbegin(), on_list.cend(), pred);
    -
    62  }
    -
    63 
    -
    64  void clear() ENTT_NOEXCEPT override {
    -
    65  if(publishing) {
    -
    66  for(auto &&element: once_list) {
    -
    67  element.first = true;
    -
    68  }
    -
    69 
    -
    70  for(auto &&element: on_list) {
    -
    71  element.first = true;
    -
    72  }
    -
    73  } else {
    -
    74  once_list.clear();
    -
    75  on_list.clear();
    -
    76  }
    -
    77  }
    -
    78 
    -
    79  connection_type once(listener_type listener) {
    -
    80  return once_list.emplace(once_list.cend(), false, std::move(listener));
    -
    81  }
    -
    82 
    -
    83  connection_type on(listener_type listener) {
    -
    84  return on_list.emplace(on_list.cend(), false, std::move(listener));
    -
    85  }
    -
    86 
    -
    87  void erase(connection_type conn) {
    -
    88  conn->first = true;
    -
    89 
    -
    90  if(!publishing) {
    -
    91  auto pred = [](auto &&element) { return element.first; };
    -
    92  once_list.remove_if(pred);
    -
    93  on_list.remove_if(pred);
    -
    94  }
    -
    95  }
    -
    96 
    -
    97  void publish(Event &event, Derived &ref) {
    -
    98  container_type swap_list;
    -
    99  once_list.swap(swap_list);
    -
    100 
    -
    101  publishing = true;
    -
    102 
    -
    103  for(auto &&element: on_list) {
    -
    104  element.first ? void() : element.second(event, ref);
    -
    105  }
    -
    106 
    -
    107  for(auto &&element: swap_list) {
    -
    108  element.first ? void() : element.second(event, ref);
    -
    109  }
    -
    110 
    -
    111  publishing = false;
    -
    112 
    -
    113  on_list.remove_if([](auto &&element) { return element.first; });
    -
    114  }
    -
    115 
    -
    116  private:
    -
    117  bool publishing{false};
    -
    118  container_type once_list{};
    -
    119  container_type on_list{};
    -
    120  };
    -
    121 
    -
    122  template<typename Event>
    -
    123  [[nodiscard]] pool_handler<Event> *assure() {
    -
    124  if(auto &&ptr = pools[type_hash<Event>::value()]; !ptr) {
    -
    125  auto *cpool = new pool_handler<Event>{};
    -
    126  ptr.reset(cpool);
    -
    127  return cpool;
    -
    128  } else {
    -
    129  return static_cast<pool_handler<Event> *>(ptr.get());
    -
    130  }
    -
    131  }
    -
    132 
    -
    133  template<typename Event>
    -
    134  [[nodiscard]] const pool_handler<Event> *assure() const {
    -
    135  const auto it = pools.find(type_hash<Event>::value());
    -
    136  return (it == pools.cend()) ? nullptr : static_cast<const pool_handler<Event> *>(it->second.get());
    -
    137  }
    -
    138 
    -
    139 public:
    -
    141  template<typename Event>
    -
    142  using listener = typename pool_handler<Event>::listener_type;
    -
    143 
    -
    153  template<typename Event>
    -
    154  struct connection: private pool_handler<Event>::connection_type {
    -
    156  friend class emitter;
    -
    157 
    -
    159  connection() = default;
    -
    160 
    -
    165  connection(typename pool_handler<Event>::connection_type conn)
    -
    166  : pool_handler<Event>::connection_type{std::move(conn)} {}
    -
    167  };
    -
    168 
    -
    170  emitter() = default;
    -
    171 
    -
    173  virtual ~emitter() {
    -
    174  static_assert(std::is_base_of_v<emitter<Derived>, Derived>, "Incorrect use of the class template");
    -
    175  }
    -
    176 
    -
    178  emitter(emitter &&) = default;
    -
    179 
    -
    181  emitter &operator=(emitter &&) = default;
    -
    182 
    -
    194  template<typename Event, typename... Args>
    -
    195  void publish(Args &&...args) {
    -
    196  Event instance{std::forward<Args>(args)...};
    -
    197  assure<Event>()->publish(instance, *static_cast<Derived *>(this));
    -
    198  }
    -
    199 
    -
    220  template<typename Event>
    -
    221  connection<Event> on(listener<Event> instance) {
    -
    222  return assure<Event>()->on(std::move(instance));
    -
    223  }
    -
    224 
    -
    245  template<typename Event>
    -
    246  connection<Event> once(listener<Event> instance) {
    -
    247  return assure<Event>()->once(std::move(instance));
    -
    248  }
    -
    249 
    -
    259  template<typename Event>
    -
    260  void erase(connection<Event> conn) {
    -
    261  assure<Event>()->erase(std::move(conn));
    -
    262  }
    -
    263 
    -
    272  template<typename Event>
    -
    273  void clear() {
    -
    274  assure<Event>()->clear();
    -
    275  }
    -
    276 
    -
    283  void clear() ENTT_NOEXCEPT {
    -
    284  for(auto &&cpool: pools) {
    -
    285  cpool.second->clear();
    -
    286  }
    -
    287  }
    -
    288 
    -
    294  template<typename Event>
    -
    295  [[nodiscard]] bool empty() const {
    -
    296  const auto *cpool = assure<Event>();
    -
    297  return !cpool || cpool->empty();
    -
    298  }
    -
    299 
    -
    304  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    -
    305  return std::all_of(pools.cbegin(), pools.cend(), [](auto &&cpool) {
    -
    306  return cpool.second->empty();
    -
    307  });
    -
    308  }
    -
    309 
    -
    310 private:
    -
    311  dense_hash_map<id_type, std::unique_ptr<basic_pool>, identity> pools{};
    -
    312 };
    -
    313 
    -
    314 } // namespace entt
    -
    315 
    -
    316 #endif
    -
    entt::dense_hash_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_hash_map.hpp:240
    -
    entt::emitter
    General purpose event emitter.
    Definition: emitter.hpp:41
    -
    entt::emitter::empty
    bool empty() const
    Checks if there are listeners registered for the specific event.
    Definition: emitter.hpp:295
    -
    entt::emitter::on
    connection< Event > on(listener< Event > instance)
    Registers a long-lived listener with the event emitter.
    Definition: emitter.hpp:221
    -
    entt::emitter::listener
    typename pool_handler< Event >::listener_type listener
    Type of listeners accepted for the given event.
    Definition: emitter.hpp:142
    -
    entt::emitter::clear
    void clear()
    Disconnects all the listeners for the given event type.
    Definition: emitter.hpp:273
    -
    entt::emitter::once
    connection< Event > once(listener< Event > instance)
    Registers a short-lived listener with the event emitter.
    Definition: emitter.hpp:246
    +
    16 #include "fwd.hpp"
    +
    17 
    +
    18 namespace entt {
    +
    19 
    +
    41 template<typename Derived>
    +
    42 class emitter {
    +
    43  struct basic_pool {
    +
    44  virtual ~basic_pool() = default;
    +
    45  virtual bool empty() const ENTT_NOEXCEPT = 0;
    +
    46  virtual void clear() ENTT_NOEXCEPT = 0;
    +
    47  };
    +
    48 
    +
    49  template<typename Event>
    +
    50  struct pool_handler final: basic_pool {
    +
    51  static_assert(std::is_same_v<Event, std::decay_t<Event>>, "Invalid event type");
    +
    52 
    +
    53  using listener_type = std::function<void(Event &, Derived &)>;
    +
    54  using element_type = std::pair<bool, listener_type>;
    +
    55  using container_type = std::list<element_type>;
    +
    56  using connection_type = typename container_type::iterator;
    +
    57 
    +
    58  [[nodiscard]] bool empty() const ENTT_NOEXCEPT override {
    +
    59  auto pred = [](auto &&element) { return element.first; };
    +
    60 
    +
    61  return std::all_of(once_list.cbegin(), once_list.cend(), pred)
    +
    62  && std::all_of(on_list.cbegin(), on_list.cend(), pred);
    +
    63  }
    +
    64 
    +
    65  void clear() ENTT_NOEXCEPT override {
    +
    66  if(publishing) {
    +
    67  for(auto &&element: once_list) {
    +
    68  element.first = true;
    +
    69  }
    +
    70 
    +
    71  for(auto &&element: on_list) {
    +
    72  element.first = true;
    +
    73  }
    +
    74  } else {
    +
    75  once_list.clear();
    +
    76  on_list.clear();
    +
    77  }
    +
    78  }
    +
    79 
    +
    80  connection_type once(listener_type listener) {
    +
    81  return once_list.emplace(once_list.cend(), false, std::move(listener));
    +
    82  }
    +
    83 
    +
    84  connection_type on(listener_type listener) {
    +
    85  return on_list.emplace(on_list.cend(), false, std::move(listener));
    +
    86  }
    +
    87 
    +
    88  void erase(connection_type conn) {
    +
    89  conn->first = true;
    +
    90 
    +
    91  if(!publishing) {
    +
    92  auto pred = [](auto &&element) { return element.first; };
    +
    93  once_list.remove_if(pred);
    +
    94  on_list.remove_if(pred);
    +
    95  }
    +
    96  }
    +
    97 
    +
    98  void publish(Event &event, Derived &ref) {
    +
    99  container_type swap_list;
    +
    100  once_list.swap(swap_list);
    +
    101 
    +
    102  publishing = true;
    +
    103 
    +
    104  for(auto &&element: on_list) {
    +
    105  element.first ? void() : element.second(event, ref);
    +
    106  }
    +
    107 
    +
    108  for(auto &&element: swap_list) {
    +
    109  element.first ? void() : element.second(event, ref);
    +
    110  }
    +
    111 
    +
    112  publishing = false;
    +
    113 
    +
    114  on_list.remove_if([](auto &&element) { return element.first; });
    +
    115  }
    +
    116 
    +
    117  private:
    +
    118  bool publishing{false};
    +
    119  container_type once_list{};
    +
    120  container_type on_list{};
    +
    121  };
    +
    122 
    +
    123  template<typename Event>
    +
    124  [[nodiscard]] pool_handler<Event> *assure() {
    +
    125  if(auto &&ptr = pools[type_hash<Event>::value()]; !ptr) {
    +
    126  auto *cpool = new pool_handler<Event>{};
    +
    127  ptr.reset(cpool);
    +
    128  return cpool;
    +
    129  } else {
    +
    130  return static_cast<pool_handler<Event> *>(ptr.get());
    +
    131  }
    +
    132  }
    +
    133 
    +
    134  template<typename Event>
    +
    135  [[nodiscard]] const pool_handler<Event> *assure() const {
    +
    136  const auto it = pools.find(type_hash<Event>::value());
    +
    137  return (it == pools.cend()) ? nullptr : static_cast<const pool_handler<Event> *>(it->second.get());
    +
    138  }
    +
    139 
    +
    140 public:
    +
    142  template<typename Event>
    +
    143  using listener = typename pool_handler<Event>::listener_type;
    +
    144 
    +
    154  template<typename Event>
    +
    155  struct connection: private pool_handler<Event>::connection_type {
    +
    157  friend class emitter;
    +
    158 
    +
    160  connection() ENTT_NOEXCEPT = default;
    +
    161 
    +
    166  connection(typename pool_handler<Event>::connection_type conn)
    +
    167  : pool_handler<Event>::connection_type{std::move(conn)} {}
    +
    168  };
    +
    169 
    +
    171  emitter() = default;
    +
    172 
    +
    174  virtual ~emitter() ENTT_NOEXCEPT {
    +
    175  static_assert(std::is_base_of_v<emitter<Derived>, Derived>, "Incorrect use of the class template");
    +
    176  }
    +
    177 
    +
    179  emitter(emitter &&) = default;
    +
    180 
    +
    182  emitter &operator=(emitter &&) = default;
    +
    183 
    +
    195  template<typename Event, typename... Args>
    +
    196  void publish(Args &&...args) {
    +
    197  Event instance{std::forward<Args>(args)...};
    +
    198  assure<Event>()->publish(instance, *static_cast<Derived *>(this));
    +
    199  }
    +
    200 
    +
    221  template<typename Event>
    +
    222  connection<Event> on(listener<Event> instance) {
    +
    223  return assure<Event>()->on(std::move(instance));
    +
    224  }
    +
    225 
    +
    246  template<typename Event>
    +
    247  connection<Event> once(listener<Event> instance) {
    +
    248  return assure<Event>()->once(std::move(instance));
    +
    249  }
    +
    250 
    +
    260  template<typename Event>
    +
    261  void erase(connection<Event> conn) {
    +
    262  assure<Event>()->erase(std::move(conn));
    +
    263  }
    +
    264 
    +
    273  template<typename Event>
    +
    274  void clear() {
    +
    275  assure<Event>()->clear();
    +
    276  }
    +
    277 
    +
    284  void clear() ENTT_NOEXCEPT {
    +
    285  for(auto &&cpool: pools) {
    +
    286  cpool.second->clear();
    +
    287  }
    +
    288  }
    +
    289 
    +
    295  template<typename Event>
    +
    296  [[nodiscard]] bool empty() const {
    +
    297  const auto *cpool = assure<Event>();
    +
    298  return !cpool || cpool->empty();
    +
    299  }
    +
    300 
    +
    305  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    +
    306  return std::all_of(pools.cbegin(), pools.cend(), [](auto &&cpool) {
    +
    307  return cpool.second->empty();
    +
    308  });
    +
    309  }
    +
    310 
    +
    311 private:
    +
    312  dense_map<id_type, std::unique_ptr<basic_pool>, identity> pools{};
    +
    313 };
    +
    314 
    +
    315 } // namespace entt
    +
    316 
    +
    317 #endif
    +
    entt::dense_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_map.hpp:265
    +
    entt::emitter
    General purpose event emitter.
    Definition: emitter.hpp:42
    +
    entt::emitter::empty
    bool empty() const
    Checks if there are listeners registered for the specific event.
    Definition: emitter.hpp:296
    +
    entt::emitter::on
    connection< Event > on(listener< Event > instance)
    Registers a long-lived listener with the event emitter.
    Definition: emitter.hpp:222
    +
    entt::emitter::listener
    typename pool_handler< Event >::listener_type listener
    Type of listeners accepted for the given event.
    Definition: emitter.hpp:143
    +
    entt::emitter::clear
    void clear()
    Disconnects all the listeners for the given event type.
    Definition: emitter.hpp:274
    +
    entt::emitter::once
    connection< Event > once(listener< Event > instance)
    Registers a short-lived listener with the event emitter.
    Definition: emitter.hpp:247
    entt::emitter::emitter
    emitter(emitter &&)=default
    Default move constructor.
    -
    entt::emitter::erase
    void erase(connection< Event > conn)
    Disconnects a listener from the event emitter.
    Definition: emitter.hpp:260
    +
    entt::emitter::erase
    void erase(connection< Event > conn)
    Disconnects a listener from the event emitter.
    Definition: emitter.hpp:261
    entt::emitter::operator=
    emitter & operator=(emitter &&)=default
    Default move assignment operator.
    -
    entt::emitter::publish
    void publish(Args &&...args)
    Emits the given event.
    Definition: emitter.hpp:195
    -
    entt::emitter::empty
    bool empty() const
    Checks if there are listeners registered with the event emitter.
    Definition: emitter.hpp:304
    +
    entt::emitter::publish
    void publish(Args &&...args)
    Emits the given event.
    Definition: emitter.hpp:196
    +
    entt::emitter::empty
    bool empty() const
    Checks if there are listeners registered with the event emitter.
    Definition: emitter.hpp:305
    entt::emitter::emitter
    emitter()=default
    Default constructor.
    -
    entt::emitter::~emitter
    virtual ~emitter()
    Default destructor.
    Definition: emitter.hpp:173
    -
    entt::emitter::clear
    void clear()
    Disconnects all the listeners.
    Definition: emitter.hpp:283
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::emitter::connection
    Generic connection type for events.
    Definition: emitter.hpp:154
    -
    entt::emitter::connection::connection
    connection(typename pool_handler< Event >::connection_type conn)
    Creates a connection that wraps its underlying instance.
    Definition: emitter.hpp:165
    +
    entt::emitter::~emitter
    virtual ~emitter()
    Default destructor.
    Definition: emitter.hpp:174
    +
    entt::emitter::clear
    void clear()
    Disconnects all the listeners.
    Definition: emitter.hpp:284
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::emitter::connection
    Generic connection type for events.
    Definition: emitter.hpp:155
    entt::emitter::connection::connection
    connection()=default
    Default constructor.
    entt::identity
    Identity function object (waiting for C++20).
    Definition: utility.hpp:10
    entt::type_hash
    Type hash.
    Definition: type_info.hpp:100
    diff --git a/entity_2fwd_8hpp_source.html b/entity_2fwd_8hpp_source.html index 6dd0a2cc2..96552af31 100644 --- a/entity_2fwd_8hpp_source.html +++ b/entity_2fwd_8hpp_source.html @@ -22,7 +22,7 @@ @@ -92,7 +92,7 @@ $(function() {
    20 class basic_view;
    21 
    22 template<typename>
    -
    23 class basic_runtime_view;
    +
    23 struct basic_runtime_view;
    24 
    25 template<typename, typename, typename, typename>
    26 class basic_group;
    @@ -147,7 +147,7 @@ $(function() {
    102 template<typename Get, typename Exclude = exclude_t<>>
    103 using view = basic_view<entity, Get, Exclude>;
    104 
    -
    106 using runtime_view = basic_runtime_view<entity>;
    +
    106 using runtime_view = basic_runtime_view<sparse_set>;
    107 
    112 template<typename... Args>
    113 using group = basic_group<entity, Args...>;
    @@ -158,19 +158,19 @@ $(function() {
    entt::basic_continuous_loader
    Utility class for continuous loading.
    Definition: snapshot.hpp:296
    entt::basic_group
    Group.
    Definition: fwd.hpp:26
    entt::basic_observer
    Observer.
    Definition: observer.hpp:165
    -
    entt::basic_organizer
    Utility class for creating a static task graph.
    Definition: organizer.hpp:111
    -
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:173
    -
    entt::basic_runtime_view
    Runtime view.
    Definition: runtime_view.hpp:137
    +
    entt::basic_organizer
    Utility class for creating a static task graph.
    Definition: organizer.hpp:108
    +
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:221
    entt::basic_snapshot_loader
    Utility class to restore a snapshot as a whole.
    Definition: snapshot.hpp:161
    entt::basic_snapshot
    Utility class to create snapshots from a registry.
    Definition: snapshot.hpp:32
    entt::basic_sparse_set
    Basic sparse set implementation.
    Definition: sparse_set.hpp:174
    -
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:237
    +
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:234
    entt::basic_view
    View implementation.
    Definition: fwd.hpp:20
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::entity
    entity
    Default entity identifier.
    Definition: fwd.hpp:47
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    entt::basic_handle
    basic_handle(basic_registry< Entity > &, Entity) -> basic_handle< Entity >
    Deduction guide.
    -
    entt::basic_handle
    Non-owning handle to an entity.
    Definition: handle.hpp:23
    +
    entt::basic_handle
    Non-owning handle to an entity.
    Definition: handle.hpp:23
    +
    entt::basic_runtime_view
    Runtime view implementation.
    Definition: fwd.hpp:23
    diff --git a/entity_2utility_8hpp_source.html b/entity_2utility_8hpp_source.html index 1bddf8cd9..81aeab121 100644 --- a/entity_2utility_8hpp_source.html +++ b/entity_2utility_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -98,7 +98,7 @@ $(function() {
    50 } // namespace entt
    51 
    52 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::exclude
    constexpr exclude_t< Type... > exclude
    Variable template for exclusion lists.
    Definition: utility.hpp:20
    entt::get
    constexpr get_t< Type... > get
    Variable template for lists of observed components.
    Definition: utility.hpp:34
    entt::owned
    constexpr owned_t< Type... > owned
    Variable template for lists of owned components.
    Definition: utility.hpp:48
    diff --git a/entity_8hpp_source.html b/entity_8hpp_source.html index b10f6cb0b..1bad51e85 100644 --- a/entity_8hpp_source.html +++ b/entity_8hpp_source.html @@ -22,7 +22,7 @@     @@ -256,13 +256,13 @@ $(function() {
    entt::entt_traits::combine
    static constexpr value_type combine(const entity_type lhs, const entity_type rhs)
    Combines two identifiers in a single one.
    Definition: entity.hpp:128
    entt::entt_traits::version_type
    typename base_type::version_type version_type
    Underlying version type.
    Definition: entity.hpp:71
    entt::entt_traits::to_version
    static constexpr version_type to_version(const value_type value)
    Returns the version part once converted to the underlying type.
    Definition: entity.hpp:100
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:217
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    entt::entity
    entity
    Default entity identifier.
    Definition: fwd.hpp:47
    entt::tombstone
    constexpr tombstone_t tombstone
    Compile-time constant for tombstone entities.
    Definition: entity.hpp:335
    entt::to_integral
    constexpr entt_traits< Entity >::entity_type to_integral(const Entity value)
    Converts an entity to its underlying type.
    Definition: entity.hpp:139
    entt::to_entity
    constexpr entt_traits< Entity >::entity_type to_entity(const Entity value)
    Returns the entity part once converted to the underlying type.
    Definition: entity.hpp:148
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    entt::to_version
    constexpr entt_traits< Entity >::version_type to_version(const Entity value)
    Returns the version part once converted to the underlying type.
    Definition: entity.hpp:157
    entt::null_t
    Null object for all identifiers.
    Definition: entity.hpp:162
    entt::null_t::operator!=
    constexpr bool operator!=([[maybe_unused]] const null_t other) const
    Compares two null objects.
    Definition: entity.hpp:188
    diff --git a/entt_8hpp_source.html b/entt_8hpp_source.html index a9c48a50c..d13b5f43c 100644 --- a/entt_8hpp_source.html +++ b/entt_8hpp_source.html @@ -22,7 +22,7 @@     @@ -70,63 +70,66 @@ $(function() {
    entt.hpp
    -
    1 #include "config/version.h"
    -
    2 #include "container/dense_hash_map.hpp"
    -
    3 #include "container/dense_hash_set.hpp"
    -
    4 #include "core/algorithm.hpp"
    -
    5 #include "core/any.hpp"
    -
    6 #include "core/attribute.h"
    -
    7 #include "core/compressed_pair.hpp"
    -
    8 #include "core/enum.hpp"
    -
    9 #include "core/family.hpp"
    -
    10 #include "core/hashed_string.hpp"
    -
    11 #include "core/ident.hpp"
    -
    12 #include "core/iterator.hpp"
    -
    13 #include "core/memory.hpp"
    -
    14 #include "core/monostate.hpp"
    -
    15 #include "core/tuple.hpp"
    -
    16 #include "core/type_info.hpp"
    -
    17 #include "core/type_traits.hpp"
    -
    18 #include "core/utility.hpp"
    -
    19 #include "entity/component.hpp"
    -
    20 #include "entity/entity.hpp"
    -
    21 #include "entity/group.hpp"
    -
    22 #include "entity/handle.hpp"
    -
    23 #include "entity/helper.hpp"
    -
    24 #include "entity/observer.hpp"
    -
    25 #include "entity/organizer.hpp"
    -
    26 #include "entity/registry.hpp"
    -
    27 #include "entity/runtime_view.hpp"
    -
    28 #include "entity/snapshot.hpp"
    -
    29 #include "entity/sparse_set.hpp"
    -
    30 #include "entity/storage.hpp"
    -
    31 #include "entity/utility.hpp"
    -
    32 #include "entity/view.hpp"
    -
    33 #include "locator/locator.hpp"
    -
    34 #include "meta/adl_pointer.hpp"
    -
    35 #include "meta/container.hpp"
    -
    36 #include "meta/ctx.hpp"
    -
    37 #include "meta/factory.hpp"
    -
    38 #include "meta/meta.hpp"
    -
    39 #include "meta/node.hpp"
    -
    40 #include "meta/pointer.hpp"
    -
    41 #include "meta/policy.hpp"
    -
    42 #include "meta/range.hpp"
    -
    43 #include "meta/resolve.hpp"
    -
    44 #include "meta/template.hpp"
    -
    45 #include "meta/type_traits.hpp"
    -
    46 #include "meta/utility.hpp"
    -
    47 #include "platform/android-ndk-r17.hpp"
    -
    48 #include "poly/poly.hpp"
    -
    49 #include "process/process.hpp"
    -
    50 #include "process/scheduler.hpp"
    -
    51 #include "resource/cache.hpp"
    -
    52 #include "resource/handle.hpp"
    -
    53 #include "resource/loader.hpp"
    -
    54 #include "signal/delegate.hpp"
    -
    55 #include "signal/dispatcher.hpp"
    -
    56 #include "signal/emitter.hpp"
    -
    57 #include "signal/sigh.hpp"
    +
    1 #include "config/config.h"
    +
    2 #include "config/macro.h"
    +
    3 #include "config/version.h"
    +
    4 #include "container/dense_map.hpp"
    +
    5 #include "container/dense_set.hpp"
    +
    6 #include "core/algorithm.hpp"
    +
    7 #include "core/any.hpp"
    +
    8 #include "core/attribute.h"
    +
    9 #include "core/compressed_pair.hpp"
    +
    10 #include "core/enum.hpp"
    +
    11 #include "core/family.hpp"
    +
    12 #include "core/hashed_string.hpp"
    +
    13 #include "core/ident.hpp"
    +
    14 #include "core/iterator.hpp"
    +
    15 #include "core/memory.hpp"
    +
    16 #include "core/monostate.hpp"
    +
    17 #include "core/tuple.hpp"
    +
    18 #include "core/type_info.hpp"
    +
    19 #include "core/type_traits.hpp"
    +
    20 #include "core/utility.hpp"
    +
    21 #include "entity/component.hpp"
    +
    22 #include "entity/entity.hpp"
    +
    23 #include "entity/group.hpp"
    +
    24 #include "entity/handle.hpp"
    +
    25 #include "entity/helper.hpp"
    +
    26 #include "entity/observer.hpp"
    +
    27 #include "entity/organizer.hpp"
    +
    28 #include "entity/registry.hpp"
    +
    29 #include "entity/runtime_view.hpp"
    +
    30 #include "entity/sigh_storage_mixin.hpp"
    +
    31 #include "entity/snapshot.hpp"
    +
    32 #include "entity/sparse_set.hpp"
    +
    33 #include "entity/storage.hpp"
    +
    34 #include "entity/utility.hpp"
    +
    35 #include "entity/view.hpp"
    +
    36 #include "locator/locator.hpp"
    +
    37 #include "meta/adl_pointer.hpp"
    +
    38 #include "meta/container.hpp"
    +
    39 #include "meta/ctx.hpp"
    +
    40 #include "meta/factory.hpp"
    +
    41 #include "meta/meta.hpp"
    +
    42 #include "meta/node.hpp"
    +
    43 #include "meta/pointer.hpp"
    +
    44 #include "meta/policy.hpp"
    +
    45 #include "meta/range.hpp"
    +
    46 #include "meta/resolve.hpp"
    +
    47 #include "meta/template.hpp"
    +
    48 #include "meta/type_traits.hpp"
    +
    49 #include "meta/utility.hpp"
    +
    50 #include "platform/android-ndk-r17.hpp"
    +
    51 #include "poly/poly.hpp"
    +
    52 #include "process/process.hpp"
    +
    53 #include "process/scheduler.hpp"
    +
    54 #include "resource/cache.hpp"
    +
    55 #include "resource/loader.hpp"
    +
    56 #include "resource/resource.hpp"
    +
    57 #include "signal/delegate.hpp"
    +
    58 #include "signal/dispatcher.hpp"
    +
    59 #include "signal/emitter.hpp"
    +
    60 #include "signal/sigh.hpp"
    diff --git a/enum_8hpp_source.html b/enum_8hpp_source.html index 9ae7e5e7c..d76abc6bf 100644 --- a/enum_8hpp_source.html +++ b/enum_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -70,8 +70,8 @@ $(function() {
    enum.hpp
    -
    1 #ifndef ENTT_CORE_FLAG_HPP
    -
    2 #define ENTT_CORE_FLAG_HPP
    +
    1 #ifndef ENTT_CORE_ENUM_HPP
    +
    2 #define ENTT_CORE_ENUM_HPP
    3 
    4 #include <type_traits>
    5 #include "../config/config.h"
    @@ -82,7 +82,7 @@ $(function() {
    14 struct enum_as_bitmask: std::false_type {};
    15 
    17 template<typename Type>
    -
    18 struct enum_as_bitmask<Type, std::void_t<decltype(Type::_entt_enum_as_bitmask)>>: std::true_type {};
    +
    18 struct enum_as_bitmask<Type, std::void_t<decltype(Type::_entt_enum_as_bitmask)>>: std::is_enum<Type> {};
    19 
    24 template<typename Type>
    25 inline constexpr bool enum_as_bitmask_v = enum_as_bitmask<Type>::value;
    @@ -90,69 +90,56 @@ $(function() {
    27 } // namespace entt
    28 
    37 template<typename Type>
    -
    38 [[nodiscard]] constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type>
    +
    38 [[nodiscard]] constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, Type>
    39 operator|(const Type lhs, const Type rhs) ENTT_NOEXCEPT {
    -
    40  return Type{static_cast<std::underlying_type_t<Type>>(lhs) | static_cast<std::underlying_type_t<Type>>(rhs)};
    +
    40  return static_cast<Type>(static_cast<std::underlying_type_t<Type>>(lhs) | static_cast<std::underlying_type_t<Type>>(rhs));
    41 }
    42 
    44 template<typename Type>
    -
    45 [[nodiscard]] constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type>
    +
    45 [[nodiscard]] constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, Type>
    46 operator&(const Type lhs, const Type rhs) ENTT_NOEXCEPT {
    -
    47  return Type{static_cast<std::underlying_type_t<Type>>(lhs) & static_cast<std::underlying_type_t<Type>>(rhs)};
    +
    47  return static_cast<Type>(static_cast<std::underlying_type_t<Type>>(lhs) & static_cast<std::underlying_type_t<Type>>(rhs));
    48 }
    49 
    51 template<typename Type>
    -
    52 [[nodiscard]] constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type>
    +
    52 [[nodiscard]] constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, Type>
    53 operator^(const Type lhs, const Type rhs) ENTT_NOEXCEPT {
    -
    54  return Type{static_cast<std::underlying_type_t<Type>>(lhs) ^ static_cast<std::underlying_type_t<Type>>(rhs)};
    +
    54  return static_cast<Type>(static_cast<std::underlying_type_t<Type>>(lhs) ^ static_cast<std::underlying_type_t<Type>>(rhs));
    55 }
    56 
    64 template<typename Type>
    -
    65 [[nodiscard]] constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type>
    +
    65 [[nodiscard]] constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, Type>
    66 operator~(const Type value) ENTT_NOEXCEPT {
    -
    67  return Type{~static_cast<std::underlying_type_t<Type>>(value)};
    +
    67  return static_cast<Type>(~static_cast<std::underlying_type_t<Type>>(value));
    68 }
    69 
    71 template<typename Type>
    -
    72 [[nodiscard]] constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, bool>
    +
    72 [[nodiscard]] constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, bool>
    73 operator!(const Type value) ENTT_NOEXCEPT {
    74  return !static_cast<std::underlying_type_t<Type>>(value);
    75 }
    76 
    78 template<typename Type>
    -
    79 constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type &>
    +
    79 constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, Type &>
    80 operator|=(Type &lhs, const Type rhs) ENTT_NOEXCEPT {
    81  return (lhs = (lhs | rhs));
    82 }
    83 
    85 template<typename Type>
    -
    86 constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type &>
    +
    86 constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, Type &>
    87 operator&=(Type &lhs, const Type rhs) ENTT_NOEXCEPT {
    88  return (lhs = (lhs & rhs));
    89 }
    90 
    92 template<typename Type>
    -
    93 constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type &>
    +
    93 constexpr std::enable_if_t<entt::enum_as_bitmask_v<Type>, Type &>
    94 operator^=(Type &lhs, const Type rhs) ENTT_NOEXCEPT {
    95  return (lhs = (lhs ^ rhs));
    96 }
    97 
    -
    99 template<typename Type>
    -
    100 [[nodiscard]] constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type>
    -
    101 operator==(const Type lhs, const Type rhs) ENTT_NOEXCEPT {
    -
    102  return (static_cast<std::underlying_type_t<Type>>(lhs) == static_cast<std::underlying_type_t<Type>>(rhs));
    -
    103 }
    -
    104 
    -
    106 template<typename Type>
    -
    107 [[nodiscard]] constexpr std::enable_if_t<std::is_enum_v<Type> && entt::enum_as_bitmask_v<Type>, Type>
    -
    108 operator!=(const Type lhs, const Type rhs) ENTT_NOEXCEPT {
    -
    109  return !(lhs == rhs);
    -
    110 }
    -
    111 
    -
    112 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    98 #endif
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::enum_as_bitmask_v
    constexpr bool enum_as_bitmask_v
    Helper variable template.
    Definition: enum.hpp:25
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    entt::enum_as_bitmask
    Enable bitmask support for enum classes.
    Definition: enum.hpp:14
    diff --git a/factory_8hpp_source.html b/factory_8hpp_source.html index ad1e11256..83a21b583 100644 --- a/factory_8hpp_source.html +++ b/factory_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -96,7 +96,7 @@ $(function() {
    32 
    38 template<typename Type, typename... Spec>
    39 class meta_factory<Type, Spec...>: public meta_factory<Type> {
    -
    40  void link_prop_if_required(internal::meta_prop_node &node) {
    +
    40  void link_prop_if_required(internal::meta_prop_node &node) ENTT_NOEXCEPT {
    41  if(meta_range<internal::meta_prop_node *, internal::meta_prop_node> range{*ref}; std::find(range.cbegin(), range.cend(), &node) == range.cend()) {
    42  ENTT_ASSERT(std::find_if(range.cbegin(), range.cend(), [&node](const auto *curr) { return curr->id == node.id; }) == range.cend(), "Duplicate identifier");
    43  node.next = *ref;
    @@ -105,25 +105,25 @@ $(function() {
    46  }
    47 
    48  template<std::size_t Step = 0, typename... Property, typename... Other>
    -
    49  void unroll(choice_t<2>, std::tuple<Property...> property, Other &&...other) {
    +
    49  void unroll(choice_t<2>, std::tuple<Property...> property, Other &&...other) ENTT_NOEXCEPT {
    50  std::apply([this](auto &&...curr) { (this->unroll<Step>(choice<2>, std::forward<Property>(curr)...)); }, property);
    51  unroll<Step + sizeof...(Property)>(choice<2>, std::forward<Other>(other)...);
    52  }
    53 
    54  template<std::size_t Step = 0, typename... Property, typename... Other>
    -
    55  void unroll(choice_t<1>, std::pair<Property...> property, Other &&...other) {
    +
    55  void unroll(choice_t<1>, std::pair<Property...> property, Other &&...other) ENTT_NOEXCEPT {
    56  assign<Step>(std::move(property.first), std::move(property.second));
    57  unroll<Step + 1>(choice<2>, std::forward<Other>(other)...);
    58  }
    59 
    60  template<std::size_t Step = 0, typename Property, typename... Other>
    -
    61  void unroll(choice_t<0>, Property &&property, Other &&...other) {
    +
    61  void unroll(choice_t<0>, Property &&property, Other &&...other) ENTT_NOEXCEPT {
    62  assign<Step>(std::forward<Property>(property));
    63  unroll<Step + 1>(choice<2>, std::forward<Other>(other)...);
    64  }
    65 
    66  template<std::size_t>
    -
    67  void unroll(choice_t<0>) {}
    +
    67  void unroll(choice_t<0>) ENTT_NOEXCEPT {}
    68 
    69  template<std::size_t = 0>
    70  void assign(meta_any key, meta_any value = {}) {
    @@ -169,28 +169,28 @@ $(function() {
    134 
    139 template<typename Type>
    140 class meta_factory<Type> {
    -
    141  void link_base_if_required(internal::meta_base_node &node) {
    +
    141  void link_base_if_required(internal::meta_base_node &node) ENTT_NOEXCEPT {
    142  if(meta_range<internal::meta_base_node *, internal::meta_base_node> range{owner->base}; std::find(range.cbegin(), range.cend(), &node) == range.cend()) {
    143  node.next = owner->base;
    144  owner->base = &node;
    145  }
    146  }
    147 
    -
    148  void link_conv_if_required(internal::meta_conv_node &node) {
    +
    148  void link_conv_if_required(internal::meta_conv_node &node) ENTT_NOEXCEPT {
    149  if(meta_range<internal::meta_conv_node *, internal::meta_conv_node> range{owner->conv}; std::find(range.cbegin(), range.cend(), &node) == range.cend()) {
    150  node.next = owner->conv;
    151  owner->conv = &node;
    152  }
    153  }
    154 
    -
    155  void link_ctor_if_required(internal::meta_ctor_node &node) {
    +
    155  void link_ctor_if_required(internal::meta_ctor_node &node) ENTT_NOEXCEPT {
    156  if(meta_range<internal::meta_ctor_node *, internal::meta_ctor_node> range{owner->ctor}; std::find(range.cbegin(), range.cend(), &node) == range.cend()) {
    157  node.next = owner->ctor;
    158  owner->ctor = &node;
    159  }
    160  }
    161 
    -
    162  void link_data_if_required(const id_type id, internal::meta_data_node &node) {
    +
    162  void link_data_if_required(const id_type id, internal::meta_data_node &node) ENTT_NOEXCEPT {
    163  meta_range<internal::meta_data_node *, internal::meta_data_node> range{owner->data};
    164  ENTT_ASSERT(std::find_if(range.cbegin(), range.cend(), [id, &node](const auto *curr) { return curr != &node && curr->id == id; }) == range.cend(), "Duplicate identifier");
    165  node.id = id;
    @@ -201,7 +201,7 @@ $(function() {
    170  }
    171  }
    172 
    -
    173  void link_func_if_required(const id_type id, internal::meta_func_node &node) {
    +
    173  void link_func_if_required(const id_type id, internal::meta_func_node &node) ENTT_NOEXCEPT {
    174  node.id = id;
    175 
    176  if(meta_range<internal::meta_func_node *, internal::meta_func_node> range{owner->func}; std::find(range.cbegin(), range.cend(), &node) == range.cend()) {
    @@ -218,12 +218,12 @@ $(function() {
    187 
    188  static internal::meta_data_node node{
    189  {},
    -
    190  nullptr,
    -
    191  nullptr,
    -
    192  Setter::size,
    -
    193  /* this is never static */
    -
    194  (std::is_member_object_pointer_v<decltype(value_list_element_v<Index, Setter>)> && ... && std::is_const_v<std::remove_reference_t<data_type>>) ? internal::meta_traits::is_const : internal::meta_traits::is_none,
    -
    195  internal::meta_node<std::remove_const_t<std::remove_reference_t<data_type>>>::resolve(),
    +
    190  /* this is never static */
    +
    191  (std::is_member_object_pointer_v<decltype(value_list_element_v<Index, Setter>)> && ... && std::is_const_v<std::remove_reference_t<data_type>>) ? internal::meta_traits::is_const : internal::meta_traits::is_none,
    +
    192  nullptr,
    +
    193  nullptr,
    +
    194  Setter::size,
    +
    195  internal::meta_node<std::remove_cv_t<std::remove_reference_t<data_type>>>::resolve(),
    196  &meta_arg<type_list<type_list_element_t<type_list_element_t<Index, args_type>::size != 1u, type_list_element_t<Index, args_type>>...>>,
    197  [](meta_handle instance, meta_any value) -> bool { return (meta_setter<Type, value_list_element_v<Index, Setter>>(*instance.operator->(), value.as_ref()) || ...); },
    198  &meta_getter<Type, Getter, Policy>
    @@ -235,10 +235,10 @@ $(function() {
    204  }
    205 
    206 public:
    -
    208  meta_factory()
    -
    209  : owner{internal::meta_node<Type>::resolve()} {}
    +
    208  meta_factory() ENTT_NOEXCEPT
    +
    209  : owner{internal::meta_node<Type>::resolve()} {}
    210 
    -
    216  auto type(const id_type id = type_hash<Type>::value()) {
    +
    216  auto type(const id_type id = type_hash<Type>::value()) ENTT_NOEXCEPT {
    217  meta_range<internal::meta_type_node *, internal::meta_type_node> range{*internal::meta_context::global()};
    218  ENTT_ASSERT(std::find_if(range.cbegin(), range.cend(), [id, this](const auto *curr) { return curr != owner && curr->id == id; }) == range.cend(), "Duplicate identifier");
    219  owner->id = id;
    @@ -253,7 +253,7 @@ $(function() {
    228 
    237  template<typename Base>
    238  auto base() ENTT_NOEXCEPT {
    -
    239  static_assert(std::is_base_of_v<Base, Type>, "Invalid base type");
    +
    239  static_assert(!std::is_same_v<Type, Base> && std::is_base_of_v<Base, Type>, "Invalid base type");
    240 
    241  static internal::meta_base_node node{
    242  nullptr,
    @@ -276,7 +276,7 @@ $(function() {
    271  auto conv() ENTT_NOEXCEPT {
    272  static internal::meta_conv_node node{
    273  nullptr,
    -
    274  internal::meta_node<std::remove_const_t<std::remove_reference_t<std::invoke_result_t<decltype(Candidate), Type &>>>>::resolve(),
    +
    274  internal::meta_node<std::remove_cv_t<std::remove_reference_t<std::invoke_result_t<decltype(Candidate), Type &>>>>::resolve(),
    275  [](const meta_any &instance) -> meta_any {
    276  return forward_as_meta(std::invoke(Candidate, *static_cast<const Type *>(instance.data())));
    277  }
    @@ -289,257 +289,255 @@ $(function() {
    284 
    294  template<typename To>
    295  auto conv() ENTT_NOEXCEPT {
    -
    296  static_assert(std::is_convertible_v<Type, To>, "Could not convert to the required type");
    -
    297 
    -
    298  static internal::meta_conv_node node{
    -
    299  nullptr,
    -
    300  internal::meta_node<std::remove_const_t<std::remove_reference_t<To>>>::resolve(),
    -
    301  [](const meta_any &instance) -> meta_any { return forward_as_meta(static_cast<To>(*static_cast<const Type *>(instance.data()))); }
    -
    302  // tricks clang-format
    -
    303  };
    -
    304 
    -
    305  link_conv_if_required(node);
    -
    306  return meta_factory<Type>{};
    -
    307  }
    -
    308 
    -
    322  template<auto Candidate, typename Policy = as_is_t>
    -
    323  auto ctor() ENTT_NOEXCEPT {
    -
    324  using descriptor = meta_function_helper_t<Type, decltype(Candidate)>;
    -
    325  static_assert(Policy::template value<typename descriptor::return_type>, "Invalid return type for the given policy");
    -
    326  static_assert(std::is_same_v<std::decay_t<typename descriptor::return_type>, Type>, "The function doesn't return an object of the required type");
    -
    327 
    -
    328  static internal::meta_ctor_node node{
    -
    329  nullptr,
    -
    330  descriptor::args_type::size,
    -
    331  &meta_arg<typename descriptor::args_type>,
    -
    332  &meta_construct<Type, Candidate, Policy>
    -
    333  // tricks clang-format
    -
    334  };
    -
    335 
    -
    336  link_ctor_if_required(node);
    -
    337  return meta_factory<Type>{};
    -
    338  }
    -
    339 
    -
    350  template<typename... Args>
    -
    351  auto ctor() ENTT_NOEXCEPT {
    -
    352  using descriptor = meta_function_helper_t<Type, Type (*)(Args...)>;
    -
    353 
    -
    354  static internal::meta_ctor_node node{
    -
    355  nullptr,
    -
    356  descriptor::args_type::size,
    -
    357  &meta_arg<typename descriptor::args_type>,
    -
    358  &meta_construct<Type, Args...>
    -
    359  // tricks clang-format
    -
    360  };
    -
    361 
    -
    362  link_ctor_if_required(node);
    -
    363  return meta_factory<Type>{};
    -
    364  }
    -
    365 
    -
    384  template<auto Func>
    -
    385  auto dtor() ENTT_NOEXCEPT {
    -
    386  static_assert(std::is_invocable_v<decltype(Func), Type &>, "The function doesn't accept an object of the type provided");
    -
    387  owner->dtor = [](void *instance) { std::invoke(Func, *static_cast<Type *>(instance)); };
    -
    388  return meta_factory<Type>{};
    -
    389  }
    -
    390 
    -
    404  template<auto Data, typename Policy = as_is_t>
    -
    405  auto data(const id_type id) ENTT_NOEXCEPT {
    -
    406  if constexpr(std::is_member_object_pointer_v<decltype(Data)>) {
    -
    407  using data_type = std::remove_reference_t<std::invoke_result_t<decltype(Data), Type &>>;
    -
    408 
    -
    409  static internal::meta_data_node node{
    -
    410  {},
    +
    296  static internal::meta_conv_node node{
    +
    297  nullptr,
    +
    298  internal::meta_node<std::remove_cv_t<std::remove_reference_t<To>>>::resolve(),
    +
    299  [](const meta_any &instance) -> meta_any { return forward_as_meta(static_cast<To>(*static_cast<const Type *>(instance.data()))); }
    +
    300  // tricks clang-format
    +
    301  };
    +
    302 
    +
    303  link_conv_if_required(node);
    +
    304  return meta_factory<Type>{};
    +
    305  }
    +
    306 
    +
    320  template<auto Candidate, typename Policy = as_is_t>
    +
    321  auto ctor() ENTT_NOEXCEPT {
    +
    322  using descriptor = meta_function_helper_t<Type, decltype(Candidate)>;
    +
    323  static_assert(Policy::template value<typename descriptor::return_type>, "Invalid return type for the given policy");
    +
    324  static_assert(std::is_same_v<std::remove_cv_t<std::remove_reference_t<typename descriptor::return_type>>, Type>, "The function doesn't return an object of the required type");
    +
    325 
    +
    326  static internal::meta_ctor_node node{
    +
    327  nullptr,
    +
    328  descriptor::args_type::size,
    +
    329  &meta_arg<typename descriptor::args_type>,
    +
    330  &meta_construct<Type, Candidate, Policy>
    +
    331  // tricks clang-format
    +
    332  };
    +
    333 
    +
    334  link_ctor_if_required(node);
    +
    335  return meta_factory<Type>{};
    +
    336  }
    +
    337 
    +
    348  template<typename... Args>
    +
    349  auto ctor() ENTT_NOEXCEPT {
    +
    350  using descriptor = meta_function_helper_t<Type, Type (*)(Args...)>;
    +
    351 
    +
    352  static internal::meta_ctor_node node{
    +
    353  nullptr,
    +
    354  descriptor::args_type::size,
    +
    355  &meta_arg<typename descriptor::args_type>,
    +
    356  &meta_construct<Type, Args...>
    +
    357  // tricks clang-format
    +
    358  };
    +
    359 
    +
    360  link_ctor_if_required(node);
    +
    361  return meta_factory<Type>{};
    +
    362  }
    +
    363 
    +
    382  template<auto Func>
    +
    383  auto dtor() ENTT_NOEXCEPT {
    +
    384  static_assert(std::is_invocable_v<decltype(Func), Type &>, "The function doesn't accept an object of the type provided");
    +
    385  owner->dtor = [](void *instance) { std::invoke(Func, *static_cast<Type *>(instance)); };
    +
    386  return meta_factory<Type>{};
    +
    387  }
    +
    388 
    +
    402  template<auto Data, typename Policy = as_is_t>
    +
    403  auto data(const id_type id) ENTT_NOEXCEPT {
    +
    404  if constexpr(std::is_member_object_pointer_v<decltype(Data)>) {
    +
    405  using data_type = std::remove_reference_t<std::invoke_result_t<decltype(Data), Type &>>;
    +
    406 
    +
    407  static internal::meta_data_node node{
    +
    408  {},
    +
    409  /* this is never static */
    +
    410  std::is_const_v<data_type> ? internal::meta_traits::is_const : internal::meta_traits::is_none,
    411  nullptr,
    412  nullptr,
    413  1u,
    -
    414  /* this is never static */
    -
    415  std::is_const_v<data_type> ? internal::meta_traits::is_const : internal::meta_traits::is_none,
    -
    416  internal::meta_node<std::remove_const_t<data_type>>::resolve(),
    -
    417  &meta_arg<type_list<std::remove_const_t<data_type>>>,
    -
    418  &meta_setter<Type, Data>,
    -
    419  &meta_getter<Type, Data, Policy>
    -
    420  // tricks clang-format
    -
    421  };
    -
    422 
    -
    423  link_data_if_required(id, node);
    -
    424  return meta_factory<Type, std::integral_constant<decltype(Data), Data>, std::integral_constant<decltype(Data), Data>>{&node.prop};
    -
    425  } else {
    -
    426  using data_type = std::remove_reference_t<std::remove_pointer_t<decltype(Data)>>;
    -
    427 
    -
    428  static internal::meta_data_node node{
    -
    429  {},
    +
    414  internal::meta_node<std::remove_const_t<data_type>>::resolve(),
    +
    415  &meta_arg<type_list<std::remove_const_t<data_type>>>,
    +
    416  &meta_setter<Type, Data>,
    +
    417  &meta_getter<Type, Data, Policy>
    +
    418  // tricks clang-format
    +
    419  };
    +
    420 
    +
    421  link_data_if_required(id, node);
    +
    422  return meta_factory<Type, std::integral_constant<decltype(Data), Data>, std::integral_constant<decltype(Data), Data>>{&node.prop};
    +
    423  } else {
    +
    424  using data_type = std::remove_reference_t<std::remove_pointer_t<decltype(Data)>>;
    +
    425 
    +
    426  static internal::meta_data_node node{
    +
    427  {},
    +
    428  ((std::is_same_v<Type, std::remove_const_t<data_type>> || std::is_const_v<data_type>) ? internal::meta_traits::is_const : internal::meta_traits::is_none) | internal::meta_traits::is_static,
    +
    429  nullptr,
    430  nullptr,
    -
    431  nullptr,
    -
    432  1u,
    -
    433  ((std::is_same_v<Type, std::remove_const_t<data_type>> || std::is_const_v<data_type>) ? internal::meta_traits::is_const : internal::meta_traits::is_none) | internal::meta_traits::is_static,
    -
    434  internal::meta_node<std::remove_const_t<data_type>>::resolve(),
    -
    435  &meta_arg<type_list<std::remove_const_t<data_type>>>,
    -
    436  &meta_setter<Type, Data>,
    -
    437  &meta_getter<Type, Data, Policy>
    -
    438  // tricks clang-format
    -
    439  };
    -
    440 
    -
    441  link_data_if_required(id, node);
    -
    442  return meta_factory<Type, std::integral_constant<decltype(Data), Data>>{&node.prop};
    -
    443  }
    -
    444  }
    -
    445 
    -
    466  template<auto Setter, auto Getter, typename Policy = as_is_t>
    -
    467  auto data(const id_type id) ENTT_NOEXCEPT {
    -
    468  using data_type = std::invoke_result_t<decltype(Getter), Type &>;
    -
    469  static_assert(Policy::template value<data_type>, "Invalid return type for the given policy");
    -
    470 
    -
    471  if constexpr(std::is_same_v<decltype(Setter), std::nullptr_t>) {
    -
    472  static internal::meta_data_node node{
    -
    473  {},
    +
    431  1u,
    +
    432  internal::meta_node<std::remove_const_t<data_type>>::resolve(),
    +
    433  &meta_arg<type_list<std::remove_const_t<data_type>>>,
    +
    434  &meta_setter<Type, Data>,
    +
    435  &meta_getter<Type, Data, Policy>
    +
    436  // tricks clang-format
    +
    437  };
    +
    438 
    +
    439  link_data_if_required(id, node);
    +
    440  return meta_factory<Type, std::integral_constant<decltype(Data), Data>>{&node.prop};
    +
    441  }
    +
    442  }
    +
    443 
    +
    464  template<auto Setter, auto Getter, typename Policy = as_is_t>
    +
    465  auto data(const id_type id) ENTT_NOEXCEPT {
    +
    466  using data_type = std::invoke_result_t<decltype(Getter), Type &>;
    +
    467  static_assert(Policy::template value<data_type>, "Invalid return type for the given policy");
    +
    468 
    +
    469  if constexpr(std::is_same_v<decltype(Setter), std::nullptr_t>) {
    +
    470  static internal::meta_data_node node{
    +
    471  {},
    +
    472  /* this is never static */
    +
    473  internal::meta_traits::is_const,
    474  nullptr,
    475  nullptr,
    476  0u,
    -
    477  /* this is never static */
    -
    478  internal::meta_traits::is_const,
    -
    479  internal::meta_node<std::remove_const_t<std::remove_reference_t<data_type>>>::resolve(),
    -
    480  &meta_arg<type_list<>>,
    -
    481  &meta_setter<Type, Setter>,
    -
    482  &meta_getter<Type, Getter, Policy>
    -
    483  // tricks clang-format
    -
    484  };
    -
    485 
    -
    486  link_data_if_required(id, node);
    -
    487  return meta_factory<Type, std::integral_constant<decltype(Setter), Setter>, std::integral_constant<decltype(Getter), Getter>>{&node.prop};
    -
    488  } else {
    -
    489  using args_type = typename meta_function_helper_t<Type, decltype(Setter)>::args_type;
    -
    490 
    -
    491  static internal::meta_data_node node{
    -
    492  {},
    +
    477  internal::meta_node<std::remove_cv_t<std::remove_reference_t<data_type>>>::resolve(),
    +
    478  &meta_arg<type_list<>>,
    +
    479  &meta_setter<Type, Setter>,
    +
    480  &meta_getter<Type, Getter, Policy>
    +
    481  // tricks clang-format
    +
    482  };
    +
    483 
    +
    484  link_data_if_required(id, node);
    +
    485  return meta_factory<Type, std::integral_constant<decltype(Setter), Setter>, std::integral_constant<decltype(Getter), Getter>>{&node.prop};
    +
    486  } else {
    +
    487  using args_type = typename meta_function_helper_t<Type, decltype(Setter)>::args_type;
    +
    488 
    +
    489  static internal::meta_data_node node{
    +
    490  {},
    +
    491  /* this is never static nor const */
    +
    492  internal::meta_traits::is_none,
    493  nullptr,
    494  nullptr,
    495  1u,
    -
    496  /* this is never static nor const */
    -
    497  internal::meta_traits::is_none,
    -
    498  internal::meta_node<std::remove_const_t<std::remove_reference_t<data_type>>>::resolve(),
    -
    499  &meta_arg<type_list<type_list_element_t<args_type::size != 1u, args_type>>>,
    -
    500  &meta_setter<Type, Setter>,
    -
    501  &meta_getter<Type, Getter, Policy>
    -
    502  // tricks clang-format
    -
    503  };
    -
    504 
    -
    505  link_data_if_required(id, node);
    -
    506  return meta_factory<Type, std::integral_constant<decltype(Setter), Setter>, std::integral_constant<decltype(Getter), Getter>>{&node.prop};
    -
    507  }
    -
    508  }
    -
    509 
    -
    527  template<typename Setter, auto Getter, typename Policy = as_is_t>
    -
    528  auto data(const id_type id) ENTT_NOEXCEPT {
    -
    529  return data<Setter, Getter, Policy>(id, std::make_index_sequence<Setter::size>{});
    -
    530  }
    -
    531 
    -
    545  template<auto Candidate, typename Policy = as_is_t>
    -
    546  auto func(const id_type id) ENTT_NOEXCEPT {
    -
    547  using descriptor = meta_function_helper_t<Type, decltype(Candidate)>;
    -
    548  static_assert(Policy::template value<typename descriptor::return_type>, "Invalid return type for the given policy");
    -
    549 
    -
    550  static internal::meta_func_node node{
    -
    551  {},
    +
    496  internal::meta_node<std::remove_cv_t<std::remove_reference_t<data_type>>>::resolve(),
    +
    497  &meta_arg<type_list<type_list_element_t<args_type::size != 1u, args_type>>>,
    +
    498  &meta_setter<Type, Setter>,
    +
    499  &meta_getter<Type, Getter, Policy>
    +
    500  // tricks clang-format
    +
    501  };
    +
    502 
    +
    503  link_data_if_required(id, node);
    +
    504  return meta_factory<Type, std::integral_constant<decltype(Setter), Setter>, std::integral_constant<decltype(Getter), Getter>>{&node.prop};
    +
    505  }
    +
    506  }
    +
    507 
    +
    525  template<typename Setter, auto Getter, typename Policy = as_is_t>
    +
    526  auto data(const id_type id) ENTT_NOEXCEPT {
    +
    527  return data<Setter, Getter, Policy>(id, std::make_index_sequence<Setter::size>{});
    +
    528  }
    +
    529 
    +
    543  template<auto Candidate, typename Policy = as_is_t>
    +
    544  auto func(const id_type id) ENTT_NOEXCEPT {
    +
    545  using descriptor = meta_function_helper_t<Type, decltype(Candidate)>;
    +
    546  static_assert(Policy::template value<typename descriptor::return_type>, "Invalid return type for the given policy");
    +
    547 
    +
    548  static internal::meta_func_node node{
    +
    549  {},
    +
    550  (descriptor::is_const ? internal::meta_traits::is_const : internal::meta_traits::is_none) | (descriptor::is_static ? internal::meta_traits::is_static : internal::meta_traits::is_none),
    +
    551  nullptr,
    552  nullptr,
    -
    553  nullptr,
    -
    554  descriptor::args_type::size,
    -
    555  (descriptor::is_const ? internal::meta_traits::is_const : internal::meta_traits::is_none) | (descriptor::is_static ? internal::meta_traits::is_static : internal::meta_traits::is_none),
    -
    556  internal::meta_node<std::conditional_t<std::is_same_v<Policy, as_void_t>, void, std::remove_const_t<std::remove_reference_t<typename descriptor::return_type>>>>::resolve(),
    -
    557  &meta_arg<typename descriptor::args_type>,
    -
    558  &meta_invoke<Type, Candidate, Policy>
    -
    559  // tricks clang-format
    -
    560  };
    -
    561 
    -
    562  link_func_if_required(id, node);
    -
    563  return meta_factory<Type, std::integral_constant<decltype(Candidate), Candidate>>{&node.prop};
    -
    564  }
    -
    565 
    -
    566 private:
    -
    567  internal::meta_type_node *owner;
    -
    568 };
    -
    569 
    -
    581 template<typename Type>
    -
    582 [[nodiscard]] auto meta() ENTT_NOEXCEPT {
    -
    583  auto *const node = internal::meta_node<Type>::resolve();
    -
    584  // extended meta factory to allow assigning properties to opaque meta types
    -
    585  return meta_factory<Type, Type>{&node->prop};
    -
    586 }
    -
    587 
    -
    599 inline void meta_reset(const id_type id) ENTT_NOEXCEPT {
    -
    600  auto clear_chain = [](auto **curr, auto... member) {
    -
    601  for(; *curr; *curr = std::exchange((*curr)->next, nullptr)) {
    -
    602  if constexpr(sizeof...(member) != 0u) {
    -
    603  static_assert(sizeof...(member) == 1u, "Assert in defense of the future me");
    -
    604  for(auto **sub = (&((*curr)->*member), ...); *sub; *sub = std::exchange((*sub)->next, nullptr)) {}
    -
    605  }
    -
    606  }
    -
    607  };
    -
    608 
    -
    609  for(auto **it = internal::meta_context::global(); *it; it = &(*it)->next) {
    -
    610  if(auto *node = *it; node->id == id) {
    -
    611  clear_chain(&node->prop);
    -
    612  clear_chain(&node->base);
    -
    613  clear_chain(&node->conv);
    -
    614  clear_chain(&node->ctor);
    -
    615  clear_chain(&node->data, &internal::meta_data_node::prop);
    -
    616  clear_chain(&node->func, &internal::meta_func_node::prop);
    -
    617 
    -
    618  node->id = {};
    -
    619  node->dtor = nullptr;
    -
    620  *it = std::exchange(node->next, nullptr);
    -
    621 
    -
    622  break;
    -
    623  }
    -
    624  }
    -
    625 }
    -
    626 
    -
    634 template<typename Type>
    -
    635 void meta_reset() ENTT_NOEXCEPT {
    -
    636  meta_reset(internal::meta_node<Type>::resolve()->id);
    -
    637 }
    -
    638 
    -
    644 inline void meta_reset() ENTT_NOEXCEPT {
    -
    645  while(*internal::meta_context::global()) {
    -
    646  meta_reset((*internal::meta_context::global())->id);
    -
    647  }
    -
    648 }
    +
    553  descriptor::args_type::size,
    +
    554  internal::meta_node<std::conditional_t<std::is_same_v<Policy, as_void_t>, void, std::remove_cv_t<std::remove_reference_t<typename descriptor::return_type>>>>::resolve(),
    +
    555  &meta_arg<typename descriptor::args_type>,
    +
    556  &meta_invoke<Type, Candidate, Policy>
    +
    557  // tricks clang-format
    +
    558  };
    +
    559 
    +
    560  link_func_if_required(id, node);
    +
    561  return meta_factory<Type, std::integral_constant<decltype(Candidate), Candidate>>{&node.prop};
    +
    562  }
    +
    563 
    +
    564 private:
    +
    565  internal::meta_type_node *owner;
    +
    566 };
    +
    567 
    +
    579 template<typename Type>
    +
    580 [[nodiscard]] auto meta() ENTT_NOEXCEPT {
    +
    581  auto *const node = internal::meta_node<Type>::resolve();
    +
    582  // extended meta factory to allow assigning properties to opaque meta types
    +
    583  return meta_factory<Type, Type>{&node->prop};
    +
    584 }
    +
    585 
    +
    597 inline void meta_reset(const id_type id) ENTT_NOEXCEPT {
    +
    598  auto clear_chain = [](auto **curr, auto... member) {
    +
    599  for(; *curr; *curr = std::exchange((*curr)->next, nullptr)) {
    +
    600  if constexpr(sizeof...(member) != 0u) {
    +
    601  static_assert(sizeof...(member) == 1u, "Assert in defense of the future me");
    +
    602  for(auto **sub = (&((*curr)->*member), ...); *sub; *sub = std::exchange((*sub)->next, nullptr)) {}
    +
    603  }
    +
    604  }
    +
    605  };
    +
    606 
    +
    607  for(auto **it = internal::meta_context::global(); *it; it = &(*it)->next) {
    +
    608  if(auto *node = *it; node->id == id) {
    +
    609  clear_chain(&node->prop);
    +
    610  clear_chain(&node->base);
    +
    611  clear_chain(&node->conv);
    +
    612  clear_chain(&node->ctor);
    +
    613  clear_chain(&node->data, &internal::meta_data_node::prop);
    +
    614  clear_chain(&node->func, &internal::meta_func_node::prop);
    +
    615 
    +
    616  node->id = {};
    +
    617  node->dtor = nullptr;
    +
    618  *it = std::exchange(node->next, nullptr);
    +
    619 
    +
    620  break;
    +
    621  }
    +
    622  }
    +
    623 }
    +
    624 
    +
    632 template<typename Type>
    +
    633 void meta_reset() ENTT_NOEXCEPT {
    +
    634  meta_reset(internal::meta_node<Type>::resolve()->id);
    +
    635 }
    +
    636 
    +
    642 inline void meta_reset() ENTT_NOEXCEPT {
    +
    643  while(*internal::meta_context::global()) {
    +
    644  meta_reset((*internal::meta_context::global())->id);
    +
    645  }
    +
    646 }
    +
    647 
    +
    648 } // namespace entt
    649 
    -
    650 } // namespace entt
    -
    651 
    -
    652 #endif
    -
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:148
    -
    entt::meta_any::as_ref
    meta_any as_ref()
    Aliasing constructor.
    Definition: meta.hpp:577
    +
    650 #endif
    +
    entt::meta_any
    Opaque wrapper for values of any type.
    Definition: meta.hpp:141
    +
    entt::meta_any::as_ref
    meta_any as_ref()
    Aliasing constructor.
    Definition: meta.hpp:551
    entt::meta_factory< Type, Spec... >::prop
    meta_factory< Type > prop(PropertyOrKey &&property_or_key, Value &&...value)
    Assigns a property to the last meta object created.
    Definition: factory.hpp:106
    entt::meta_factory< Type, Spec... >::props
    meta_factory< Type > props(Property... property)
    Assigns properties to the last meta object created.
    Definition: factory.hpp:126
    entt::meta_factory< Type, Spec... >::meta_factory
    meta_factory(internal::meta_prop_node **target)
    Constructs an extended factory from a given node.
    Definition: factory.hpp:91
    entt::meta_factory< Type >
    Basic meta factory to be used for reflection purposes.
    Definition: factory.hpp:140
    entt::meta_factory< Type >::type
    auto type(const id_type id=type_hash< Type >::value())
    Makes a meta type searchable.
    Definition: factory.hpp:216
    -
    entt::meta_factory< Type >::data
    auto data(const id_type id)
    Assigns a meta data to a meta type by means of its setter and getter.
    Definition: factory.hpp:467
    +
    entt::meta_factory< Type >::data
    auto data(const id_type id)
    Assigns a meta data to a meta type by means of its setter and getter.
    Definition: factory.hpp:465
    entt::meta_factory< Type >::base
    auto base()
    Assigns a meta base to a meta type.
    Definition: factory.hpp:238
    -
    entt::meta_factory< Type >::ctor
    auto ctor()
    Assigns a meta constructor to a meta type.
    Definition: factory.hpp:351
    +
    entt::meta_factory< Type >::ctor
    auto ctor()
    Assigns a meta constructor to a meta type.
    Definition: factory.hpp:349
    entt::meta_factory< Type >::conv
    auto conv()
    Assigns a meta conversion function to a meta type.
    Definition: factory.hpp:271
    -
    entt::meta_factory< Type >::ctor
    auto ctor()
    Assigns a meta constructor to a meta type.
    Definition: factory.hpp:323
    -
    entt::meta_factory< Type >::func
    auto func(const id_type id)
    Assigns a meta funcion to a meta type.
    Definition: factory.hpp:546
    +
    entt::meta_factory< Type >::ctor
    auto ctor()
    Assigns a meta constructor to a meta type.
    Definition: factory.hpp:321
    +
    entt::meta_factory< Type >::func
    auto func(const id_type id)
    Assigns a meta function to a meta type.
    Definition: factory.hpp:544
    entt::meta_factory< Type >::meta_factory
    meta_factory()
    Default constructor.
    Definition: factory.hpp:208
    -
    entt::meta_factory< Type >::data
    auto data(const id_type id)
    Assigns a meta data to a meta type.
    Definition: factory.hpp:405
    -
    entt::meta_factory< Type >::dtor
    auto dtor()
    Assigns a meta destructor to a meta type.
    Definition: factory.hpp:385
    +
    entt::meta_factory< Type >::data
    auto data(const id_type id)
    Assigns a meta data to a meta type.
    Definition: factory.hpp:403
    +
    entt::meta_factory< Type >::dtor
    auto dtor()
    Assigns a meta destructor to a meta type.
    Definition: factory.hpp:383
    entt::meta_factory
    Meta factory to be used for reflection purposes.
    Definition: factory.hpp:31
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::resolve
    meta_type resolve()
    Returns the meta type associated with a given type.
    Definition: resolve.hpp:19
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    -
    entt::meta
    auto meta()
    Utility function to use for reflection.
    Definition: factory.hpp:582
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    +
    entt::meta
    auto meta()
    Utility function to use for reflection.
    Definition: factory.hpp:580
    entt::meta_construct
    meta_any meta_construct(meta_any *const args)
    Tries to construct an instance given a list of erased parameters.
    Definition: utility.hpp:359
    -
    entt::meta_reset
    void meta_reset(const id_type id)
    Resets a type and all its parts.
    Definition: factory.hpp:599
    +
    entt::meta_reset
    void meta_reset(const id_type id)
    Resets a type and all its parts.
    Definition: factory.hpp:597
    entt::meta_function_helper_t
    typename meta_function_helper< Type, Candidate >::type meta_function_helper_t
    Helper type.
    Definition: utility.hpp:154
    -
    entt::forward_as_meta
    meta_any forward_as_meta(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: meta.hpp:629
    +
    entt::forward_as_meta
    meta_any forward_as_meta(Type &&value)
    Forwards its argument and avoids copies for lvalue references.
    Definition: meta.hpp:600
    entt::type_list_element_t
    typename type_list_element< Index, List >::type type_list_element_t
    Helper type.
    Definition: type_traits.hpp:148
    entt::meta_setter
    bool meta_setter([[maybe_unused]] meta_handle instance, [[maybe_unused]] meta_any value)
    Sets the value of a given variable.
    Definition: utility.hpp:197
    entt::choice_t< 0 >
    Utility class to disambiguate overloaded functions.
    Definition: type_traits.hpp:25
    entt::choice_t
    Utility class to disambiguate overloaded functions.
    Definition: type_traits.hpp:21
    -
    entt::meta_handle
    Opaque pointers to instances of any type.
    Definition: meta.hpp:640
    -
    entt::meta_range
    Iterable range to use to iterate all types of meta objects.
    Definition: range.hpp:73
    -
    entt::meta_range::cend
    const_iterator cend() const
    Returns an iterator to the end.
    Definition: range.hpp:109
    +
    entt::meta_handle
    Opaque pointers to instances of any type.
    Definition: meta.hpp:611
    +
    entt::meta_range
    Iterable range to use to iterate all types of meta objects.
    Definition: range.hpp:74
    +
    entt::meta_range::cend
    const_iterator cend() const
    Returns an iterator to the end.
    Definition: range.hpp:110
    entt::type_hash
    Type hash.
    Definition: type_info.hpp:100
    entt::type_list
    A class to use to push around lists of types, nothing more.
    Definition: type_traits.hpp:110
    diff --git a/family_8hpp_source.html b/family_8hpp_source.html index 308d08b50..a556b32e4 100644 --- a/family_8hpp_source.html +++ b/family_8hpp_source.html @@ -22,7 +22,7 @@     @@ -96,8 +96,8 @@ $(function() {
    entt::family
    Dynamic identifier generator.
    Definition: family.hpp:17
    entt::family::family_type
    id_type family_type
    Unsigned integer type.
    Definition: family.hpp:22
    entt::identifier
    Types identifiers.
    Definition: ident.hpp:41
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    diff --git a/files.html b/files.html index 8b6955901..e83d4e411 100644 --- a/files.html +++ b/files.html @@ -22,7 +22,7 @@
    @@ -72,44 +72,46 @@ $(function() { - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @@ -138,8 +140,8 @@ $(function() { - - + + diff --git a/functions.html b/functions.html index 121305c20..75c43098f 100644 --- a/functions.html +++ b/functions.html @@ -22,7 +22,7 @@ @@ -80,12 +80,21 @@ $(function() { : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > +
  • allocate_emplace() +: entt::locator< Service > +
    • +
  • allocation_deleter() +: entt::allocation_deleter< Allocator > +
  • allocator_type -: entt::basic_sparse_set< Entity, Allocator > +: entt::allocation_deleter< Allocator > +, entt::basic_dispatcher< Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::resource_cache< Type, Loader, Allocator > , entt::sigh< Ret(Args...), Allocator >
  • allow_cast() @@ -102,7 +111,7 @@ $(function() {
  • args_type : entt::meta_function_descriptor< Type, Ret Class::* > , entt::meta_function_descriptor< Type, Ret(*)()> -, entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)> +, entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)> , entt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const > , entt::meta_function_descriptor< Type, Ret(Class::*)(Args...)> , entt::meta_template_traits< Clazz< Args... > > @@ -135,7 +144,7 @@ $(function() {
  • at() : entt::basic_sparse_set< Entity, Allocator > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
  • attach() : entt::scheduler< Delta > diff --git a/functions_b.html b/functions_b.html index 4e20fab22..a47755d43 100644 --- a/functions_b.html +++ b/functions_b.html @@ -22,7 +22,7 @@
    • @@ -73,7 +73,6 @@ $(function() {
  • base() : entt::meta_factory< Type > -, entt::meta_sequence_container::meta_iterator , entt::meta_type
  • base_node_type @@ -83,17 +82,21 @@ $(function() { : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_registry< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > +, entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >
  • basic_any() -: entt::basic_any< Len, Align > +: entt::basic_any< Len, Align >
  • basic_continuous_loader() : entt::basic_continuous_loader< Entity >
    • +
  • basic_dispatcher() +: entt::basic_dispatcher< Allocator > +
  • basic_group() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > @@ -104,6 +107,9 @@ $(function() {
  • basic_hashed_string() : entt::basic_hashed_string< Char >
    • +
  • basic_iterator +: entt::basic_sparse_set< Entity, Allocator > +
  • basic_observer() : entt::basic_observer< Entity >
    • @@ -111,14 +117,14 @@ $(function() { : entt::basic_poly< Concept, Len, Align >
  • basic_registry() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • basic_registry< Entity > : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >
  • basic_runtime_view() -: entt::basic_runtime_view< Entity > +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
  • basic_snapshot() : entt::basic_snapshot< Entity > @@ -144,17 +150,18 @@ $(function() { : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_associative_container , entt::meta_range< Type, Node > , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator >
  • bind() : entt::basic_sparse_set< Entity, Allocator > @@ -162,16 +169,19 @@ $(function() { , entt::sigh_storage_mixin< Type >
  • bucket() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • bucket_count() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • bucket_size() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +
    • +
  • bump() +: entt::basic_sparse_set< Entity, Allocator >
    • diff --git a/functions_c.html b/functions_c.html index e4d066ea3..3024a82dd 100644 --- a/functions_c.html +++ b/functions_c.html @@ -22,7 +22,7 @@     @@ -80,18 +80,20 @@ $(function() {
  • cbegin() : entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_range< Type, Node > +, entt::resource_cache< Type, Loader, Allocator >
  • cend() : entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_range< Type, Node > +, entt::resource_cache< Type, Loader, Allocator >
  • children() : entt::basic_organizer< Entity >::vertex @@ -100,17 +102,17 @@ $(function() { : entt::meta_template_traits< Clazz< Args... > >
  • clear() -: entt::basic_observer< Entity > +: entt::basic_dispatcher< Allocator > +, entt::basic_observer< Entity > , entt::basic_organizer< Entity > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::dispatcher +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::emitter< Derived > , entt::meta_associative_container , entt::meta_sequence_container -, entt::resource_cache< Resource > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta >
  • collect() @@ -150,14 +152,14 @@ $(function() {
  • const_iterator : entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_range< Type, Node > +, entt::resource_cache< Type, Loader, Allocator >
  • const_local_iterator -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • const_pointer : entt::basic_storage< Entity, Type, Allocator, typename > @@ -174,13 +176,16 @@ $(function() { : entt::basic_continuous_loader< Entity > , entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::resource_cache< Resource > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::resource_cache< Type, Loader, Allocator > +
    • +
  • context +: entt::basic_registry< Entity >
  • conv() : entt::meta_factory< Type > @@ -200,10 +205,7 @@ $(function() { : entt::meta_factory< Type >
  • ctx() -: entt::basic_registry< Entity > -
    • -
  • ctx_or_set() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • current() : entt::basic_registry< Entity > diff --git a/functions_d.html b/functions_d.html index dbd4fcca2..fca7520df 100644 --- a/functions_d.html +++ b/functions_d.html @@ -22,7 +22,7 @@
    • @@ -73,6 +73,7 @@ $(function() { , entt::basic_poly< Concept, Len, Align > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > +, entt::delegate< Ret(Args...)> , entt::meta_any , entt::meta_factory< Type > , entt::meta_type @@ -83,11 +84,11 @@ $(function() {
  • delta_type : entt::process< Derived, Delta >
    • -
  • dense_hash_map() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +
  • dense_map() +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
    • -
  • dense_hash_set() -: entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +
  • dense_set() +: entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • dereference() : entt::adl_meta_pointer_like< Type > @@ -96,21 +97,11 @@ $(function() { : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity >
    • -
  • difference_type -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -
    • -
  • discard() -: entt::resource_cache< Resource > -
  • disconnect() -: entt::basic_observer< Entity > -, entt::dispatcher +: entt::basic_dispatcher< Allocator > +, entt::basic_observer< Entity > , entt::sink< sigh< Ret(Args...), Allocator > >
    • -
  • dispatcher() -: entt::dispatcher -
  • dtor() : entt::meta_factory< Type >
    • diff --git a/functions_e.html b/functions_e.html index 8f55046a1..1887335c8 100644 --- a/functions_e.html +++ b/functions_e.html @@ -22,7 +22,7 @@     @@ -70,12 +70,11 @@ $(function() { , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > , entt::basic_registry< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::resource_cache< Resource >
  • emitter : entt::emitter< Derived >::connection< Event > @@ -84,14 +83,15 @@ $(function() {
  • emplace() : entt::basic_any< Len, Align > , entt::basic_handle< Entity, Type > -, entt::basic_organizer< Entity > +, entt::basic_organizer< Entity > , entt::basic_poly< Concept, Len, Align > , entt::basic_registry< Entity > -, entt::basic_sparse_set< Entity, Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::locator< Service > , entt::meta_any , entt::sigh_storage_mixin< Type >
    • @@ -106,12 +106,11 @@ $(function() { , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::emitter< Derived > -, entt::resource_cache< Resource > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta > -, entt::service_locator< Service > , entt::sigh< Ret(Args...), Allocator > , entt::sink< sigh< Ret(Args...), Allocator > > @@ -119,20 +118,24 @@ $(function() { : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_associative_container , entt::meta_range< Type, Node > , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator >
  • enqueue() -: entt::dispatcher +: entt::basic_dispatcher< Allocator > +
    • +
  • enqueue_hint() +: entt::basic_dispatcher< Allocator >
  • entities() : entt::basic_continuous_loader< Entity > @@ -152,7 +155,7 @@ $(function() { , entt::basic_observer< Entity > , entt::basic_organizer< Entity > , entt::basic_registry< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_snapshot< Entity > , entt::basic_snapshot_loader< Entity > , entt::basic_sparse_set< Entity, Allocator > @@ -166,12 +169,16 @@ $(function() {
  • erase() : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > -, entt::basic_sparse_set< Entity, Allocator > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::basic_sparse_set< Entity, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::emitter< Derived > , entt::meta_associative_container , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator > +
    • +
  • exclude() +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
  • extent() : entt::basic_sparse_set< Entity, Allocator > diff --git a/functions_f.html b/functions_f.html index db9839389..05a773f97 100644 --- a/functions_f.html +++ b/functions_f.html @@ -22,7 +22,7 @@
    • @@ -77,8 +77,8 @@ $(function() { , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container
  • finished() @@ -90,6 +90,9 @@ $(function() {
  • first_type : entt::compressed_pair< First, Second >
    • +
  • force_load() +: entt::resource_cache< Type, Loader, Allocator > +
  • front() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > diff --git a/functions_func.html b/functions_func.html index 2501b38f3..4d6bf375e 100644 --- a/functions_func.html +++ b/functions_func.html @@ -22,7 +22,7 @@
    • @@ -77,6 +77,12 @@ $(function() { : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > +
  • allocate_emplace() +: entt::locator< Service > +
    • +
  • allocation_deleter() +: entt::allocation_deleter< Allocator > +
  • allow_cast() : entt::meta_any
    • @@ -116,7 +122,7 @@ $(function() {
  • at() : entt::basic_sparse_set< Entity, Allocator > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
  • attach() : entt::scheduler< Delta > diff --git a/functions_func_b.html b/functions_func_b.html index c0aeb4708..a7a739b69 100644 --- a/functions_func_b.html +++ b/functions_func_b.html @@ -22,7 +22,7 @@
    • @@ -73,15 +73,17 @@ $(function() {
  • base() : entt::meta_factory< Type > -, entt::meta_sequence_container::meta_iterator , entt::meta_type
  • basic_any() -: entt::basic_any< Len, Align > +: entt::basic_any< Len, Align >
  • basic_continuous_loader() : entt::basic_continuous_loader< Entity >
    • +
  • basic_dispatcher() +: entt::basic_dispatcher< Allocator > +
  • basic_group() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > @@ -99,10 +101,10 @@ $(function() { : entt::basic_poly< Concept, Len, Align >
  • basic_registry() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • basic_runtime_view() -: entt::basic_runtime_view< Entity > +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
  • basic_snapshot() : entt::basic_snapshot< Entity > @@ -128,17 +130,18 @@ $(function() { : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_associative_container , entt::meta_range< Type, Node > , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator >
  • bind() : entt::basic_sparse_set< Entity, Allocator > @@ -146,16 +149,19 @@ $(function() { , entt::sigh_storage_mixin< Type >
  • bucket() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • bucket_count() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • bucket_size() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +
    • +
  • bump() +: entt::basic_sparse_set< Entity, Allocator >
    • diff --git a/functions_func_c.html b/functions_func_c.html index 76444bbf3..08b81e906 100644 --- a/functions_func_c.html +++ b/functions_func_c.html @@ -22,7 +22,7 @@     @@ -80,34 +80,36 @@ $(function() {
  • cbegin() : entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_range< Type, Node > +, entt::resource_cache< Type, Loader, Allocator >
  • cend() : entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_range< Type, Node > +, entt::resource_cache< Type, Loader, Allocator >
  • children() : entt::basic_organizer< Entity >::vertex
  • clear() -: entt::basic_observer< Entity > +: entt::basic_dispatcher< Allocator > +, entt::basic_observer< Entity > , entt::basic_organizer< Entity > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::dispatcher +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::emitter< Derived > , entt::meta_associative_container , entt::meta_sequence_container -, entt::resource_cache< Resource > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta >
  • collect() @@ -145,13 +147,13 @@ $(function() { : entt::basic_continuous_loader< Entity > , entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::resource_cache< Resource > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::resource_cache< Type, Loader, Allocator >
  • conv() : entt::meta_factory< Type > @@ -171,10 +173,7 @@ $(function() { : entt::meta_factory< Type >
  • ctx() -: entt::basic_registry< Entity > -
    • -
  • ctx_or_set() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • current() : entt::basic_registry< Entity > diff --git a/functions_func_d.html b/functions_func_d.html index dcf9353d7..42e29ef9c 100644 --- a/functions_func_d.html +++ b/functions_func_d.html @@ -22,7 +22,7 @@
    • @@ -73,6 +73,7 @@ $(function() { , entt::basic_poly< Concept, Len, Align > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > +, entt::delegate< Ret(Args...)> , entt::meta_any , entt::meta_factory< Type > , entt::meta_type @@ -80,11 +81,11 @@ $(function() {
  • delegate() : entt::delegate< Ret(Args...)>
    • -
  • dense_hash_map() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +
  • dense_map() +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
    • -
  • dense_hash_set() -: entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +
  • dense_set() +: entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • dereference() : entt::adl_meta_pointer_like< Type > @@ -93,17 +94,11 @@ $(function() { : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity >
    • -
  • discard() -: entt::resource_cache< Resource > -
  • disconnect() -: entt::basic_observer< Entity > -, entt::dispatcher +: entt::basic_dispatcher< Allocator > +, entt::basic_observer< Entity > , entt::sink< sigh< Ret(Args...), Allocator > >
    • -
  • dispatcher() -: entt::dispatcher -
  • dtor() : entt::meta_factory< Type >
    • diff --git a/functions_func_e.html b/functions_func_e.html index defc3268b..ed0513b4e 100644 --- a/functions_func_e.html +++ b/functions_func_e.html @@ -22,7 +22,7 @@     @@ -70,12 +70,11 @@ $(function() { , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > , entt::basic_registry< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::resource_cache< Resource >
  • emitter() : entt::emitter< Derived > @@ -83,14 +82,15 @@ $(function() {
  • emplace() : entt::basic_any< Len, Align > , entt::basic_handle< Entity, Type > -, entt::basic_organizer< Entity > +, entt::basic_organizer< Entity > , entt::basic_poly< Concept, Len, Align > , entt::basic_registry< Entity > -, entt::basic_sparse_set< Entity, Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::locator< Service > , entt::meta_any , entt::sigh_storage_mixin< Type >
    • @@ -105,12 +105,11 @@ $(function() { , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::emitter< Derived > -, entt::resource_cache< Resource > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::emitter< Derived > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta > -, entt::service_locator< Service > , entt::sigh< Ret(Args...), Allocator > , entt::sink< sigh< Ret(Args...), Allocator > > @@ -118,20 +117,24 @@ $(function() { : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_associative_container , entt::meta_range< Type, Node > , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator >
  • enqueue() -: entt::dispatcher +: entt::basic_dispatcher< Allocator > +
    • +
  • enqueue_hint() +: entt::basic_dispatcher< Allocator >
  • entities() : entt::basic_continuous_loader< Entity > @@ -145,11 +148,15 @@ $(function() { : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::emitter< Derived > , entt::meta_associative_container , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator > +
    • +
  • exclude() +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
  • extent() : entt::basic_sparse_set< Entity, Allocator > diff --git a/functions_func_f.html b/functions_func_f.html index db2768c17..533c74008 100644 --- a/functions_func_f.html +++ b/functions_func_f.html @@ -22,7 +22,7 @@
    • @@ -74,8 +74,8 @@ $(function() { , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container
  • finished() @@ -84,6 +84,9 @@ $(function() {
  • first() : entt::compressed_pair< First, Second >
    • +
  • force_load() +: entt::resource_cache< Type, Loader, Allocator > +
  • front() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > diff --git a/functions_func_g.html b/functions_func_g.html index 8fd80b021..2b0e66c89 100644 --- a/functions_func_g.html +++ b/functions_func_g.html @@ -22,7 +22,7 @@
    • @@ -71,33 +71,29 @@ $(function() { , entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > +, entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::compressed_pair< First, Second > +, entt::compressed_pair< First, Second > , entt::meta_any , entt::meta_data , entt::meta_type -, entt::resource_handle< Resource > -, entt::service_locator< Service >
  • get_allocator() -: entt::basic_sparse_set< Entity, Allocator > +: entt::basic_dispatcher< Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::resource_cache< Type, Loader, Allocator > , entt::sigh< Ret(Args...), Allocator >
  • get_as_tuple() : entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
    • -
  • get_at() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > -
  • get_or_emplace() : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > @@ -108,10 +104,10 @@ $(function() {
  • group() : entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... > , entt::basic_collector<> -, entt::basic_registry< Entity > +, entt::basic_registry< Entity >
  • group_if_exists() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
    • diff --git a/functions_func_h.html b/functions_func_h.html index 4ed86950a..3116e1130 100644 --- a/functions_func_h.html +++ b/functions_func_h.html @@ -22,7 +22,7 @@     @@ -69,14 +69,16 @@ $(function() { : entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::resource_cache< Resource > + +
  • has_value() +: entt::locator< Service >
  • hash() -: entt::type_info +: entt::type_info
  • hash_function() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
    • diff --git a/functions_func_i.html b/functions_func_i.html index dbf064ad3..23123e950 100644 --- a/functions_func_i.html +++ b/functions_func_i.html @@ -22,7 +22,7 @@     @@ -71,12 +71,12 @@ $(function() { , entt::meta_type
  • in_place_pop() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > +: entt::basic_sparse_set< Entity, Allocator > +, entt::basic_storage< Entity, Type, Allocator, typename >
  • index() : entt::basic_sparse_set< Entity, Allocator > -, entt::type_info +, entt::type_info
  • info() : entt::basic_organizer< Entity >::vertex @@ -87,21 +87,20 @@ $(function() {
  • insert() : entt::basic_registry< Entity > -, entt::basic_sparse_set< Entity, Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container , entt::meta_sequence_container , entt::sigh_storage_mixin< Type >
  • insert_or_assign() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
  • instance() -: entt::delegate< Ret(Args...)> -, entt::poly_vtable< Concept, Len, Align > +: entt::poly_vtable< Concept, Len, Align >
  • invoke() : entt::meta_any @@ -146,7 +145,10 @@ $(function() { : entt::meta_type
  • iterable_adaptor() -: entt::iterable_adaptor< It > +: entt::iterable_adaptor< It, Sentinel > +
    • +
  • iterate() +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
    • diff --git a/functions_func_k.html b/functions_func_k.html index 3e2aa0632..51a24d58d 100644 --- a/functions_func_k.html +++ b/functions_func_k.html @@ -22,7 +22,7 @@     @@ -69,8 +69,8 @@ $(function() { : entt::meta_prop
  • key_eq() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • key_only() : entt::meta_associative_container diff --git a/functions_func_l.html b/functions_func_l.html index 2b449b001..0faf390c1 100644 --- a/functions_func_l.html +++ b/functions_func_l.html @@ -22,7 +22,7 @@
    • @@ -66,11 +66,17 @@ $(function() {

    - l -

    diff --git a/functions_func_m.html b/functions_func_m.html index d2962eead..cd233f5fd 100644 --- a/functions_func_m.html +++ b/functions_func_m.html @@ -22,7 +22,7 @@     @@ -72,12 +72,12 @@ $(function() { : entt::meta_associative_container
  • max_bucket_count() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • max_load_factor() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • meta_any() : entt::meta_any @@ -98,10 +98,6 @@ $(function() {
  • meta_handle() : entt::meta_handle
    • -
  • meta_iterator() -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -
  • meta_prop() : entt::meta_prop
    • @@ -114,10 +110,6 @@ $(function() {
  • meta_type() : entt::meta_type
    • -
  • move_and_pop() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > -
    • diff --git a/functions_func_n.html b/functions_func_n.html index fc2431352..c0c0b2b6d 100644 --- a/functions_func_n.html +++ b/functions_func_n.html @@ -22,7 +22,7 @@     @@ -67,7 +67,7 @@ $(function() {

    - n -

    diff --git a/functions_func_o.html b/functions_func_o.html index 7902e8172..4ea54a176 100644 --- a/functions_func_o.html +++ b/functions_func_o.html @@ -22,7 +22,7 @@     @@ -103,16 +103,14 @@ $(function() { , entt::connection , entt::delegate< Ret(Args...)> , entt::meta_any -, entt::meta_associative_container::meta_iterator , entt::meta_associative_container , entt::meta_data , entt::meta_func , entt::meta_handle , entt::meta_prop -, entt::meta_sequence_container::meta_iterator , entt::meta_sequence_container , entt::meta_type -, entt::resource_handle< Resource > +, entt::resource< Type > , entt::scoped_connection
  • operator const value_type *() @@ -132,53 +130,46 @@ $(function() { : entt::type_hash< Type, typename > , entt::type_index< Type, typename >
    • -
  • operator resource_type &() -: entt::resource_handle< Resource > -
  • operator std::string_view() : entt::type_name< Type, typename >
  • operator Type() : entt::monostate< id_type >
    • +
  • operator Type &() +: entt::resource< Type > +
  • operator Type &&() : entt::poly_inspector
  • operator!=() -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -, entt::null_t +: entt::null_t , entt::tombstone_t
  • operator()() -: entt::delegate< Ret(Args...)> +: entt::allocation_deleter< Allocator > +, entt::delegate< Ret(Args...)> , entt::identity , entt::insertion_sort , entt::radix_sort< Bit, N > +, entt::resource_loader< Type > , entt::std_sort , entt::y_combinator< Func >
  • operator*() : entt::meta_any -, entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -, entt::resource_handle< Resource > -
    • -
  • operator++() -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator +, entt::resource< Type >
  • operator->() -: entt::basic_poly< Concept, Len, Align > +: entt::basic_poly< Concept, Len, Align > , entt::input_iterator_pointer< Type > -, entt::meta_associative_container::meta_iterator , entt::meta_handle -, entt::meta_sequence_container::meta_iterator -, entt::resource_handle< Resource > +, entt::resource< Type >
  • operator=() -: entt::basic_any< Len, Align > +: entt::basic_any< Len, Align > , entt::basic_continuous_loader< Entity > +, entt::basic_dispatcher< Allocator > , entt::basic_observer< Entity > , entt::basic_registry< Entity > , entt::basic_snapshot< Entity > @@ -187,16 +178,15 @@ $(function() { , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::compressed_pair< First, Second > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::dispatcher +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::emitter< Derived > -, entt::input_iterator_pointer< Type > +, entt::input_iterator_pointer< Type > , entt::meta_any , entt::meta_handle , entt::monostate< id_type > -, entt::resource_cache< Resource > -, entt::resource_handle< Resource > +, entt::resource< Type > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta > , entt::scoped_connection , entt::sigh< Ret(Args...), Allocator > @@ -205,8 +195,6 @@ $(function() { : entt::basic_any< Len, Align > , entt::delegate< Ret(Args...)> , entt::meta_any -, entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator , entt::meta_type , entt::null_t , entt::tombstone_t @@ -217,8 +205,9 @@ $(function() { , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator >
  • operator|() : entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > @@ -232,6 +221,9 @@ $(function() { : entt::basic_continuous_loader< Entity > , entt::basic_snapshot_loader< Entity >
    • +
  • owned() +: entt::basic_registry< Entity > +
  • owner() : entt::basic_any< Len, Align > , entt::meta_any diff --git a/functions_func_p.html b/functions_func_p.html index 7f87de27d..2d0831327 100644 --- a/functions_func_p.html +++ b/functions_func_p.html @@ -22,7 +22,7 @@
    • diff --git a/functions_func_r.html b/functions_func_r.html index 391489af0..cec00552f 100644 --- a/functions_func_r.html +++ b/functions_func_r.html @@ -22,7 +22,7 @@ @@ -75,15 +75,12 @@ $(function() { , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > -
  • ref() -: entt::service_locator< Service > -
  • registry() : entt::basic_handle< Entity, Type >
  • rehash() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • rejected() : entt::process< Derived, Delta > @@ -96,9 +93,6 @@ $(function() {
  • released() : entt::basic_registry< Entity >
    • -
  • reload() -: entt::resource_cache< Resource > -
  • remove() : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > @@ -119,24 +113,24 @@ $(function() { : entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • reset() : entt::basic_any< Len, Align > , entt::basic_poly< Concept, Len, Align > , entt::delegate< Ret(Args...)> +, entt::locator< Service > , entt::meta_any -, entt::service_locator< Service >
  • resize() : entt::meta_sequence_container
    • -
  • resource_cache() -: entt::resource_cache< Resource > +
  • resource() +: entt::resource< Type >
    • -
  • resource_handle() -: entt::resource_handle< Resource > +
  • resource_cache() +: entt::resource_cache< Type, Loader, Allocator >
  • respect() : entt::basic_sparse_set< Entity, Allocator > @@ -150,9 +144,6 @@ $(function() {
  • ro_dependency() : entt::basic_organizer< Entity >::vertex
    • -
  • runtime_view() -: entt::basic_registry< Entity > -
  • rw_count() : entt::basic_organizer< Entity >::vertex
    • diff --git a/functions_func_s.html b/functions_func_s.html index 8ab2228ea..2cd880fd2 100644 --- a/functions_func_s.html +++ b/functions_func_s.html @@ -22,7 +22,7 @@     @@ -74,15 +74,10 @@ $(function() {
  • second() : entt::compressed_pair< First, Second >
    • -
  • service_locator() -: entt::service_locator< Service > -
  • set() -: entt::basic_registry< Entity > -, entt::meta_any +: entt::meta_any , entt::meta_data , entt::meta_type -, entt::service_locator< Service >
  • shrink() : entt::basic_continuous_loader< Entity > @@ -96,34 +91,33 @@ $(function() { : entt::sigh< Ret(Args...), Allocator >
  • sink() -: entt::dispatcher +: entt::basic_dispatcher< Allocator > , entt::sink< sigh< Ret(Args...), Allocator > >
  • size() -: entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > +: entt::basic_dispatcher< Allocator > +, entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > +, entt::basic_hashed_string< Char > , entt::basic_observer< Entity > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container , entt::meta_sequence_container -, entt::resource_cache< Resource > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta > , entt::sigh< Ret(Args...), Allocator >
  • size_hint() -: entt::basic_runtime_view< Entity > +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >
  • size_of() : entt::meta_type
    • -
  • slot() -: entt::basic_sparse_set< Entity, Allocator > -
  • sort() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > @@ -134,7 +128,7 @@ $(function() { : entt::basic_sparse_set< Entity, Allocator >
  • sortable() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • storage() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > @@ -147,20 +141,17 @@ $(function() { : entt::process< Derived, Delta >
  • swap() -: entt::basic_sparse_set< Entity, Allocator > +: entt::basic_dispatcher< Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::compressed_pair< First, Second > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::sigh< Ret(Args...), Allocator >
  • swap_and_pop() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > -
    • -
  • swap_at() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > +: entt::basic_sparse_set< Entity, Allocator > +, entt::basic_storage< Entity, Type, Allocator, typename >
  • swap_elements() : entt::basic_sparse_set< Entity, Allocator > diff --git a/functions_func_t.html b/functions_func_t.html index 12a58975d..12903f26e 100644 --- a/functions_func_t.html +++ b/functions_func_t.html @@ -22,7 +22,7 @@
    • @@ -65,9 +65,6 @@ $(function() {  

    - t -

    diff --git a/functions_func_u.html b/functions_func_u.html index 4c73eadda..7ca03d3e3 100644 --- a/functions_func_u.html +++ b/functions_func_u.html @@ -22,7 +22,7 @@     @@ -68,13 +68,10 @@ $(function() {
  • unpause() : entt::process< Derived, Delta >
    • -
  • unset() -: entt::basic_registry< Entity > -
  • update() : entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... > , entt::basic_collector<> -, entt::dispatcher +, entt::basic_dispatcher< Allocator > , entt::process_adaptor< Func, Delta > , entt::scheduler< Delta >
    • @@ -82,7 +79,7 @@ $(function() { : entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >
  • use_count() -: entt::resource_handle< Resource > +: entt::resource< Type >
    • diff --git a/functions_func_v.html b/functions_func_v.html index 764219af0..438c2a251 100644 --- a/functions_func_v.html +++ b/functions_func_v.html @@ -22,7 +22,7 @@     @@ -70,12 +70,16 @@ $(function() { , entt::basic_registry< Entity >
  • value() -: entt::basic_hashed_string< Char > +: entt::basic_hashed_string< Char > +, entt::locator< Service > , entt::meta_prop , entt::type_hash< Type, typename > , entt::type_index< Type, typename > , entt::type_name< Type, typename >
    • +
  • value_or() +: entt::locator< Service > +
  • value_type() : entt::meta_associative_container , entt::meta_sequence_container @@ -84,7 +88,7 @@ $(function() { : entt::basic_organizer< Entity >::vertex
  • view() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • visit() : entt::basic_handle< Entity, Type > diff --git a/functions_func_w.html b/functions_func_w.html index e8eee87e7..571c29c7f 100644 --- a/functions_func_w.html +++ b/functions_func_w.html @@ -22,7 +22,7 @@
    • diff --git a/functions_func_y.html b/functions_func_y.html index 689c4d3d7..162ce8da2 100644 --- a/functions_func_y.html +++ b/functions_func_y.html @@ -22,7 +22,7 @@ diff --git a/functions_func_~.html b/functions_func_~.html index b2561ad47..685fa2294 100644 --- a/functions_func_~.html +++ b/functions_func_~.html @@ -22,7 +22,7 @@ @@ -77,15 +77,12 @@ $(function() {
  • ~basic_storage() : entt::basic_storage< Entity, Type, Allocator, typename >
    • -
  • ~dense_hash_map() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -
    • -
  • ~dense_hash_set() -: entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -
  • ~emitter() : entt::emitter< Derived >
    • +
  • ~locator() +: entt::locator< Service > +
  • ~meta_any() : entt::meta_any
    • @@ -95,9 +92,6 @@ $(function() {
  • ~scoped_connection() : entt::scoped_connection
    • -
  • ~service_locator() -: entt::service_locator< Service > -
    • diff --git a/functions_g.html b/functions_g.html index da642484e..c0af99cf5 100644 --- a/functions_g.html +++ b/functions_g.html @@ -22,7 +22,7 @@     @@ -71,33 +71,29 @@ $(function() { , entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > +, entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::compressed_pair< First, Second > +, entt::compressed_pair< First, Second > , entt::meta_any , entt::meta_data , entt::meta_type -, entt::resource_handle< Resource > -, entt::service_locator< Service >
  • get_allocator() -: entt::basic_sparse_set< Entity, Allocator > +: entt::basic_dispatcher< Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::resource_cache< Type, Loader, Allocator > , entt::sigh< Ret(Args...), Allocator >
  • get_as_tuple() : entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
    • -
  • get_at() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > -
  • get_or_emplace() : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > @@ -108,10 +104,10 @@ $(function() {
  • group() : entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... > , entt::basic_collector<> -, entt::basic_registry< Entity > +, entt::basic_registry< Entity >
  • group_if_exists() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
    • diff --git a/functions_h.html b/functions_h.html index cde4b6d8b..7a47e7aaf 100644 --- a/functions_h.html +++ b/functions_h.html @@ -22,7 +22,7 @@     @@ -69,21 +69,23 @@ $(function() { : entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::resource_cache< Resource > + +
  • has_value() +: entt::locator< Service >
  • hash() -: entt::type_info +: entt::type_info
  • hash_function() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • hash_type -: entt::basic_hashed_string< Char > +: entt::basic_hashed_string< Char >
  • hasher -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
    • diff --git a/functions_i.html b/functions_i.html index 904aea350..0d319b07d 100644 --- a/functions_i.html +++ b/functions_i.html @@ -22,7 +22,7 @@     @@ -73,19 +73,16 @@ $(function() {
  • identifier_type : entt::identifier< Types >
    • -
  • ignore_if_empty -: entt::basic_component_traits -
  • in_place_delete -: entt::basic_component_traits +: entt::component_traits< Type, typename >
  • in_place_pop() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > +: entt::basic_sparse_set< Entity, Allocator > +, entt::basic_storage< Entity, Type, Allocator, typename >
  • index() : entt::basic_sparse_set< Entity, Allocator > -, entt::type_info +, entt::type_info
  • info() : entt::basic_organizer< Entity >::vertex @@ -96,21 +93,20 @@ $(function() {
  • insert() : entt::basic_registry< Entity > -, entt::basic_sparse_set< Entity, Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container , entt::meta_sequence_container , entt::sigh_storage_mixin< Type >
  • insert_or_assign() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator >
  • instance() -: entt::delegate< Ret(Args...)> -, entt::poly_vtable< Concept, Len, Align > +: entt::poly_vtable< Concept, Len, Align >
  • instance_type : entt::sigh< Ret(Args...), Allocator > @@ -171,7 +167,7 @@ $(function() { : entt::identity
  • iterable -: entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > +: entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > @@ -179,27 +175,27 @@ $(function() { , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >
  • iterable_adaptor() -: entt::iterable_adaptor< It > +: entt::iterable_adaptor< It, Sentinel > +
    • +
  • iterate() +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
  • iterator : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > -, entt::basic_runtime_view< Entity > -, entt::basic_sparse_set< Entity, Allocator > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_associative_container , entt::meta_range< Type, Node > , entt::meta_sequence_container -
    • -
  • iterator_category -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator +, entt::resource_cache< Type, Loader, Allocator >
    • diff --git a/functions_k.html b/functions_k.html index d2a41445d..f3afc6563 100644 --- a/functions_k.html +++ b/functions_k.html @@ -22,7 +22,7 @@     @@ -69,19 +69,19 @@ $(function() { : entt::meta_prop
  • key_eq() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • key_equal -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • key_only() : entt::meta_associative_container
  • key_type -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container
    • diff --git a/functions_l.html b/functions_l.html index 13401f1cb..f936c134b 100644 --- a/functions_l.html +++ b/functions_l.html @@ -22,7 +22,7 @@     @@ -72,15 +72,24 @@ $(function() { : entt::emitter< Derived >
  • load() -: entt::resource_cache< Resource > +: entt::resource_cache< Type, Loader, Allocator >
  • load_factor() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +
    • +
  • loader() +: entt::resource_cache< Type, Loader, Allocator > +
    • +
  • loader_type +: entt::resource_cache< Type, Loader, Allocator >
  • local_iterator -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +
    • +
  • locator() +: entt::locator< Service >
    • diff --git a/functions_m.html b/functions_m.html index 0af1e481a..e8c8f9f27 100644 --- a/functions_m.html +++ b/functions_m.html @@ -22,7 +22,7 @@     @@ -69,16 +69,16 @@ $(function() { : entt::basic_continuous_loader< Entity >
  • mapped_type -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container
  • max_bucket_count() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • max_load_factor() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • meta_any() : entt::meta_any @@ -99,10 +99,6 @@ $(function() {
  • meta_handle() : entt::meta_handle
    • -
  • meta_iterator() -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -
  • meta_prop() : entt::meta_prop
    • @@ -115,10 +111,6 @@ $(function() {
  • meta_type() : entt::meta_type
    • -
  • move_and_pop() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > -
    • diff --git a/functions_n.html b/functions_n.html index 4b62b28f8..738c4fd34 100644 --- a/functions_n.html +++ b/functions_n.html @@ -22,7 +22,7 @@     @@ -67,7 +67,7 @@ $(function() {

    - n -

     @@ -103,16 +103,14 @@ $(function() { , entt::connection , entt::delegate< Ret(Args...)> , entt::meta_any -, entt::meta_associative_container::meta_iterator , entt::meta_associative_container , entt::meta_data , entt::meta_func , entt::meta_handle , entt::meta_prop -, entt::meta_sequence_container::meta_iterator , entt::meta_sequence_container , entt::meta_type -, entt::resource_handle< Resource > +, entt::resource< Type > , entt::scoped_connection
  • operator const value_type *() @@ -132,53 +130,46 @@ $(function() { : entt::type_hash< Type, typename > , entt::type_index< Type, typename >
    • -
  • operator resource_type &() -: entt::resource_handle< Resource > -
  • operator std::string_view() : entt::type_name< Type, typename >
  • operator Type() : entt::monostate< id_type >
    • +
  • operator Type &() +: entt::resource< Type > +
  • operator Type &&() : entt::poly_inspector
  • operator!=() -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -, entt::null_t +: entt::null_t , entt::tombstone_t
  • operator()() -: entt::delegate< Ret(Args...)> +: entt::allocation_deleter< Allocator > +, entt::delegate< Ret(Args...)> , entt::identity , entt::insertion_sort , entt::radix_sort< Bit, N > +, entt::resource_loader< Type > , entt::std_sort , entt::y_combinator< Func >
  • operator*() : entt::meta_any -, entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -, entt::resource_handle< Resource > -
    • -
  • operator++() -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator +, entt::resource< Type >
  • operator->() -: entt::basic_poly< Concept, Len, Align > +: entt::basic_poly< Concept, Len, Align > , entt::input_iterator_pointer< Type > -, entt::meta_associative_container::meta_iterator , entt::meta_handle -, entt::meta_sequence_container::meta_iterator -, entt::resource_handle< Resource > +, entt::resource< Type >
  • operator=() -: entt::basic_any< Len, Align > +: entt::basic_any< Len, Align > , entt::basic_continuous_loader< Entity > +, entt::basic_dispatcher< Allocator > , entt::basic_observer< Entity > , entt::basic_registry< Entity > , entt::basic_snapshot< Entity > @@ -187,16 +178,15 @@ $(function() { , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::compressed_pair< First, Second > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::dispatcher +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::emitter< Derived > -, entt::input_iterator_pointer< Type > +, entt::input_iterator_pointer< Type > , entt::meta_any , entt::meta_handle , entt::monostate< id_type > -, entt::resource_cache< Resource > -, entt::resource_handle< Resource > +, entt::resource< Type > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta > , entt::scoped_connection , entt::sigh< Ret(Args...), Allocator > @@ -205,8 +195,6 @@ $(function() { : entt::basic_any< Len, Align > , entt::delegate< Ret(Args...)> , entt::meta_any -, entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator , entt::meta_type , entt::null_t , entt::tombstone_t @@ -217,8 +205,9 @@ $(function() { , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > , entt::meta_sequence_container +, entt::resource_cache< Type, Loader, Allocator >
  • operator|() : entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > @@ -232,6 +221,9 @@ $(function() { : entt::basic_continuous_loader< Entity > , entt::basic_snapshot_loader< Entity >
    • +
  • owned() +: entt::basic_registry< Entity > +
  • owner() : entt::basic_any< Len, Align > , entt::meta_any diff --git a/functions_p.html b/functions_p.html index 8463a24b2..672381727 100644 --- a/functions_p.html +++ b/functions_p.html @@ -22,7 +22,7 @@
    • @@ -66,7 +66,7 @@ $(function() {

    - p -

     @@ -75,13 +75,6 @@ $(function() { , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > -
  • ref() -: entt::service_locator< Service > -
    • -
  • reference -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -
  • registry() : entt::basic_handle< Entity, Type >
    • @@ -91,8 +84,8 @@ $(function() { , entt::basic_handle< Entity, Type >
  • rehash() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • rejected() : entt::process< Derived, Delta > @@ -105,9 +98,6 @@ $(function() {
  • released() : entt::basic_registry< Entity >
    • -
  • reload() -: entt::resource_cache< Resource > -
  • remove() : entt::basic_handle< Entity, Type > , entt::basic_registry< Entity > @@ -128,8 +118,8 @@ $(function() { : entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • reserved : entt::entt_traits< Type > @@ -138,28 +128,24 @@ $(function() { : entt::basic_any< Len, Align > , entt::basic_poly< Concept, Len, Align > , entt::delegate< Ret(Args...)> +, entt::locator< Service > , entt::meta_any -, entt::service_locator< Service >
  • resize() : entt::meta_sequence_container
    • +
  • resource +: entt::resource< Type > +
  • resource_cache() -: entt::resource_cache< Resource > -, entt::resource_loader< Loader, Resource > -
    • -
  • resource_handle -: entt::resource_handle< Resource > -
    • -
  • resource_type -: entt::resource_cache< Resource > -, entt::resource_handle< Resource > +: entt::resource_cache< Type, Loader, Allocator >
  • respect() : entt::basic_sparse_set< Entity, Allocator >
  • result_type : entt::delegate< Ret(Args...)> +, entt::resource_loader< Type >
  • ret() : entt::meta_func @@ -184,9 +170,6 @@ $(function() {
  • ro_dependency() : entt::basic_organizer< Entity >::vertex
    • -
  • runtime_view() -: entt::basic_registry< Entity > -
  • rw_count() : entt::basic_organizer< Entity >::vertex
    • diff --git a/functions_rela.html b/functions_rela.html index 3fbfb2562..d46b1a149 100644 --- a/functions_rela.html +++ b/functions_rela.html @@ -22,7 +22,7 @@     @@ -73,11 +73,8 @@ $(function() {
  • poly_base< basic_poly > : entt::basic_poly< Concept, Len, Align >
    • -
  • resource_cache -: entt::resource_loader< Loader, Resource > -
    • -
  • resource_handle -: entt::resource_handle< Resource > +
  • resource +: entt::resource< Type >
  • sink : entt::connection @@ -85,9 +82,6 @@ $(function() {
  • sink< sigh< Ret(Args...), Allocator > > : entt::sigh< Ret(Args...), Allocator >
    • -
  • type_id -: entt::type_info -
    • diff --git a/functions_s.html b/functions_s.html index 1657bade1..2354a0021 100644 --- a/functions_s.html +++ b/functions_s.html @@ -22,7 +22,7 @@     @@ -77,18 +77,13 @@ $(function() {
  • second_type : entt::compressed_pair< First, Second >
    • -
  • service_locator() -: entt::service_locator< Service > -
    • -
  • service_type -: entt::service_locator< Service > +
  • sentinel +: entt::iterable_adaptor< It, Sentinel >
  • set() -: entt::basic_registry< Entity > -, entt::meta_any +: entt::meta_any , entt::meta_data , entt::meta_type -, entt::service_locator< Service >
  • shrink() : entt::basic_continuous_loader< Entity > @@ -101,9 +96,9 @@ $(function() {
  • sigh() : entt::sigh< Ret(Args...), Allocator >
    • -
  • sink -: entt::connection -, entt::dispatcher +
  • sink() +: entt::basic_dispatcher< Allocator > +, entt::connection , entt::sink< sigh< Ret(Args...), Allocator > >
  • sink< sigh< Ret(Args...), Allocator > > @@ -113,57 +108,57 @@ $(function() { : entt::sigh< Ret(Args...), Allocator >
  • size() -: entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > +: entt::basic_dispatcher< Allocator > +, entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > +, entt::basic_hashed_string< Char > , entt::basic_observer< Entity > , entt::basic_registry< Entity > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container , entt::meta_sequence_container -, entt::resource_cache< Resource > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta > , entt::sigh< Ret(Args...), Allocator > , entt::type_list< Type > , entt::value_list< Value >
  • size_hint() -: entt::basic_runtime_view< Entity > +: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >
  • size_of() : entt::meta_type
  • size_type -: entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > +: entt::basic_dispatcher< Allocator > +, entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_handle< Entity, Type > +, entt::basic_hashed_string< Char > , entt::basic_observer< Entity > , entt::basic_organizer< Entity > , entt::basic_registry< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_associative_container , entt::meta_data , entt::meta_func , entt::meta_sequence_container , entt::meta_type -, entt::resource_cache< Resource > -, entt::resource_handle< Resource > +, entt::resource_cache< Type, Loader, Allocator > , entt::scheduler< Delta > , entt::sigh< Ret(Args...), Allocator >
    • -
  • slot() -: entt::basic_sparse_set< Entity, Allocator > -
  • sort() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > @@ -174,7 +169,7 @@ $(function() { : entt::basic_sparse_set< Entity, Allocator >
  • sortable() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • storage() : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > @@ -190,20 +185,17 @@ $(function() { : entt::process< Derived, Delta >
  • swap() -: entt::basic_sparse_set< Entity, Allocator > +: entt::basic_dispatcher< Allocator > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::compressed_pair< First, Second > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::sigh< Ret(Args...), Allocator >
  • swap_and_pop() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > -
    • -
  • swap_at() -: entt::basic_sparse_set< Entity, Allocator > -, entt::basic_storage< Entity, Type, Allocator, typename > +: entt::basic_sparse_set< Entity, Allocator > +, entt::basic_storage< Entity, Type, Allocator, typename >
  • swap_elements() : entt::basic_sparse_set< Entity, Allocator > diff --git a/functions_t.html b/functions_t.html index 6ebaa38c0..84c1bdb6b 100644 --- a/functions_t.html +++ b/functions_t.html @@ -22,7 +22,7 @@
    • @@ -65,9 +65,6 @@ $(function() {
    Here is a list of all documented class members with links to the class documentation for each member:

    - t -

    diff --git a/functions_type.html b/functions_type.html index a5f4b351f..969b6d876 100644 --- a/functions_type.html +++ b/functions_type.html @@ -22,7 +22,7 @@     @@ -66,17 +66,20 @@ $(function() {

    - a -

    @@ -114,14 +121,14 @@ $(function() {
  • const_iterator : entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::meta_range< Type, Node > +, entt::resource_cache< Type, Loader, Allocator >
  • const_local_iterator -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >
  • const_pointer : entt::basic_storage< Entity, Type, Allocator, typename > @@ -130,6 +137,9 @@ $(function() { : entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename >
    • +
  • context +: entt::basic_registry< Entity > +
  • current_type : entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >
    • @@ -140,10 +150,6 @@ $(function() {
  • delta_type : entt::process< Derived, Delta >
    • -
  • difference_type -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator -
    • @@ -158,7 +164,7 @@ $(function() { , entt::basic_observer< Entity > , entt::basic_organizer< Entity > , entt::basic_registry< Entity > -, entt::basic_runtime_view< Entity > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > , entt::basic_snapshot< Entity > , entt::basic_snapshot_loader< Entity > , entt::basic_sparse_set< Entity, Allocator > @@ -188,11 +194,11 @@ $(function() {

    - h -

    @@ -208,7 +214,7 @@ $(function() { : entt::identity
  • iterable -: entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > +: entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > @@ -219,33 +225,30 @@ $(function() { : entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > , entt::basic_observer< Entity > -, entt::basic_runtime_view< Entity > -, entt::basic_sparse_set< Entity, Allocator > +, entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > +, entt::basic_sparse_set< Entity, Allocator > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > , entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -, entt::iterable_adaptor< It > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > +, entt::iterable_adaptor< It, Sentinel > , entt::meta_associative_container , entt::meta_range< Type, Node > , entt::meta_sequence_container -
    • -
  • iterator_category -: entt::meta_associative_container::meta_iterator -, entt::meta_sequence_container::meta_iterator +, entt::resource_cache< Type, Loader, Allocator >

    • - k -

    @@ -254,16 +257,19 @@ $(function() {
  • listener : entt::emitter< Derived >
    • +
  • loader_type +: entt::resource_cache< Type, Loader, Allocator > +
  • local_iterator -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +: entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator >

    • - m -

    @@ -281,31 +287,23 @@ $(function() {

    - p -

    - r -

     @@ -68,13 +68,10 @@ $(function() {
  • unpause() : entt::process< Derived, Delta >
    • -
  • unset() -: entt::basic_registry< Entity > -
  • update() : entt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... > , entt::basic_collector<> -, entt::dispatcher +, entt::basic_dispatcher< Allocator > , entt::process_adaptor< Func, Delta > , entt::scheduler< Delta >
    • @@ -82,7 +79,7 @@ $(function() { : entt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >
  • use_count() -: entt::resource_handle< Resource > +: entt::resource< Type >
    • diff --git a/functions_v.html b/functions_v.html index 49d0ad7e8..5b0b7ded8 100644 --- a/functions_v.html +++ b/functions_v.html @@ -22,7 +22,7 @@     @@ -70,26 +70,28 @@ $(function() { , entt::basic_registry< Entity >
  • value() -: entt::basic_hashed_string< Char > +: entt::basic_hashed_string< Char > +, entt::locator< Service > , entt::meta_prop , entt::type_hash< Type, typename > , entt::type_index< Type, typename > , entt::type_name< Type, typename > , entt::value_list_element< 0u, value_list< Value, Other... > >
    • +
  • value_or() +: entt::locator< Service > +
  • value_type -: entt::basic_hashed_string< Char > +: entt::basic_hashed_string< Char > , entt::basic_storage< Entity, Type, Allocator, typename > , entt::basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > -, entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -, entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > +, entt::dense_map< Key, Type, Hash, KeyEqual, Allocator > +, entt::dense_set< Type, Hash, KeyEqual, Allocator > , entt::entt_traits< Type > -, entt::iterable_adaptor< It > -, entt::meta_associative_container::meta_iterator +, entt::iterable_adaptor< It, Sentinel > , entt::meta_associative_container -, entt::meta_sequence_container::meta_iterator , entt::meta_sequence_container -, entt::sigh_storage_mixin< Type > +, entt::resource_cache< Type, Loader, Allocator >
  • version_type : entt::basic_handle< Entity, Type > @@ -101,7 +103,7 @@ $(function() { : entt::basic_organizer< Entity >::vertex
  • view() -: entt::basic_registry< Entity > +: entt::basic_registry< Entity >
  • visit() : entt::basic_handle< Entity, Type > diff --git a/functions_vars.html b/functions_vars.html index 893b5fde8..c36403e9c 100644 --- a/functions_vars.html +++ b/functions_vars.html @@ -22,7 +22,7 @@
    • @@ -66,11 +66,8 @@ $(function() {
  • alignment : entt::basic_any< Len, Align >
    • -
  • ignore_if_empty -: entt::basic_component_traits -
  • in_place_delete -: entt::basic_component_traits +: entt::component_traits< Type, typename >
  • is_const : entt::meta_function_descriptor< Type, Ret Class::* > @@ -90,7 +87,7 @@ $(function() { : entt::basic_any< Len, Align >
  • page_size -: entt::basic_component_traits +: entt::component_traits< Type, typename > , entt::entt_traits< Type >
  • reserved diff --git a/functions_w.html b/functions_w.html index 6e7fb8e74..373d5023f 100644 --- a/functions_w.html +++ b/functions_w.html @@ -22,7 +22,7 @@
    • diff --git a/functions_y.html b/functions_y.html index be23a96aa..f9e0b221f 100644 --- a/functions_y.html +++ b/functions_y.html @@ -22,7 +22,7 @@ diff --git a/functions_~.html b/functions_~.html index f2fba613c..53a36e0cc 100644 --- a/functions_~.html +++ b/functions_~.html @@ -22,7 +22,7 @@ @@ -77,15 +77,12 @@ $(function() {
  • ~basic_storage() : entt::basic_storage< Entity, Type, Allocator, typename >
    • -
  • ~dense_hash_map() -: entt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator > -
    • -
  • ~dense_hash_set() -: entt::dense_hash_set< Type, Hash, KeyEqual, Allocator > -
  • ~emitter() : entt::emitter< Derived >
    • +
  • ~locator() +: entt::locator< Service > +
  • ~meta_any() : entt::meta_any
    • @@ -95,9 +92,6 @@ $(function() {
  • ~scoped_connection() : entt::scoped_connection
    • -
  • ~service_locator() -: entt::service_locator< Service > -
    • diff --git a/fwd_8hpp_source.html b/fwd_8hpp_source.html index e7debe9d8..ffa2a71d2 100644 --- a/fwd_8hpp_source.html +++ b/fwd_8hpp_source.html @@ -22,7 +22,7 @@     diff --git a/graph_legend.html b/graph_legend.html index 23d4603cf..5c69800f5 100644 --- a/graph_legend.html +++ b/graph_legend.html @@ -22,7 +22,7 @@ diff --git a/group_8hpp_source.html b/group_8hpp_source.html index 5796132a5..1d7463d94 100644 --- a/group_8hpp_source.html +++ b/group_8hpp_source.html @@ -22,7 +22,7 @@ @@ -92,7 +92,7 @@ $(function() {
    26 class basic_group;
    27 
    64 template<typename Entity, typename... Get, typename... Exclude>
    -
    65 class basic_group<Entity, owned_t<>, get_t<Get...>, exclude_t<Exclude...>> final {
    +
    65 class basic_group<Entity, owned_t<>, get_t<Get...>, exclude_t<Exclude...>> {
    67  friend class basic_registry<Entity>;
    68 
    69  template<typename Comp>
    @@ -109,7 +109,7 @@ $(function() {
    80 
    81  extended_group_iterator() = default;
    82 
    -
    83  extended_group_iterator(typename basic_common_type::iterator from, const std::tuple<storage_type<Get> *...> &args) ENTT_NOEXCEPT
    +
    83  extended_group_iterator(typename basic_common_type::iterator from, const std::tuple<storage_type<Get> *...> &args)
    84  : it{from},
    85  pools{args} {}
    86 
    @@ -207,17 +207,17 @@ $(function() {
    250  return *this ? handler->rend() : reverse_iterator{};
    251  }
    252 
    -
    258  [[nodiscard]] entity_type front() const {
    +
    258  [[nodiscard]] entity_type front() const ENTT_NOEXCEPT {
    259  const auto it = begin();
    260  return it != end() ? *it : null;
    261  }
    262 
    -
    268  [[nodiscard]] entity_type back() const {
    +
    268  [[nodiscard]] entity_type back() const ENTT_NOEXCEPT {
    269  const auto it = rbegin();
    270  return it != rend() ? *it : null;
    271  }
    272 
    -
    279  [[nodiscard]] iterator find(const entity_type entt) const {
    +
    279  [[nodiscard]] iterator find(const entity_type entt) const ENTT_NOEXCEPT {
    280  const auto it = *this ? handler->find(entt) : iterator{};
    281  return it != end() && *it == entt ? it : end();
    282  }
    @@ -230,7 +230,7 @@ $(function() {
    298  return handler != nullptr;
    299  }
    300 
    -
    306  [[nodiscard]] bool contains(const entity_type entt) const {
    +
    306  [[nodiscard]] bool contains(const entity_type entt) const ENTT_NOEXCEPT {
    307  return *this && handler->contains(entt);
    308  }
    309 
    @@ -259,7 +259,7 @@ $(function() {
    369  }
    370 
    384  [[nodiscard]] iterable each() const ENTT_NOEXCEPT {
    -
    385  return handler ? iterable{extended_group_iterator{handler->begin(), pools}, extended_group_iterator{handler->end(), pools}}
    +
    385  return handler ? iterable{extended_group_iterator{handler->begin(), pools}, extended_group_iterator{handler->end(), pools}}
    386  : iterable{extended_group_iterator{{}, pools}, extended_group_iterator{{}, pools}};
    387  }
    388 
    @@ -296,7 +296,7 @@ $(function() {
    471 };
    472 
    519 template<typename Entity, typename... Owned, typename... Get, typename... Exclude>
    -
    520 class basic_group<Entity, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...>> final {
    +
    520 class basic_group<Entity, owned_t<Owned...>, get_t<Get...>, exclude_t<Exclude...>> {
    522  friend class basic_registry<Entity>;
    523 
    524  template<typename Comp>
    @@ -304,223 +304,224 @@ $(function() {
    526 
    527  using basic_common_type = std::common_type_t<typename storage_type<Owned>::base_type..., typename storage_type<Get>::base_type...>;
    528 
    -
    529  template<typename>
    -
    530  struct extended_group_iterator;
    -
    531 
    -
    532  template<typename... OIt>
    -
    533  struct extended_group_iterator<type_list<OIt...>> final {
    -
    534  using difference_type = std::ptrdiff_t;
    -
    535  using value_type = decltype(std::tuple_cat(std::tuple<Entity>{}, std::declval<basic_group>().get({})));
    -
    536  using pointer = input_iterator_pointer<value_type>;
    -
    537  using reference = value_type;
    -
    538  using iterator_category = std::input_iterator_tag;
    -
    539 
    -
    540  extended_group_iterator() = default;
    -
    541 
    -
    542  template<typename... Other>
    -
    543  extended_group_iterator(typename basic_common_type::iterator from, const std::tuple<Other...> &other, const std::tuple<storage_type<Get> *...> &cpools) ENTT_NOEXCEPT
    -
    544  : it{from},
    -
    545  owned{std::get<OIt>(other)...},
    -
    546  get{cpools} {}
    +
    529  class extended_group_iterator final {
    +
    530  template<typename Type>
    +
    531  auto index_to_element(storage_type<Type> &cpool) const {
    +
    532  if constexpr(ignore_as_empty_v<std::remove_const_t<Type>>) {
    +
    533  return std::make_tuple();
    +
    534  } else {
    +
    535  return std::forward_as_tuple(cpool.rbegin()[it.index()]);
    +
    536  }
    +
    537  }
    +
    538 
    +
    539  public:
    +
    540  using difference_type = std::ptrdiff_t;
    +
    541  using value_type = decltype(std::tuple_cat(std::tuple<Entity>{}, std::declval<basic_group>().get({})));
    +
    542  using pointer = input_iterator_pointer<value_type>;
    +
    543  using reference = value_type;
    +
    544  using iterator_category = std::input_iterator_tag;
    +
    545 
    +
    546  extended_group_iterator() = default;
    547 
    -
    548  extended_group_iterator &operator++() ENTT_NOEXCEPT {
    -
    549  return ++it, (++std::get<OIt>(owned), ...), *this;
    -
    550  }
    -
    551 
    -
    552  extended_group_iterator operator++(int) ENTT_NOEXCEPT {
    -
    553  extended_group_iterator orig = *this;
    -
    554  return ++(*this), orig;
    +
    548  template<typename... Other>
    +
    549  extended_group_iterator(typename basic_common_type::iterator from, const std::tuple<storage_type<Owned> *..., storage_type<Get> *...> &cpools)
    +
    550  : it{from},
    +
    551  pools{cpools} {}
    +
    552 
    +
    553  extended_group_iterator &operator++() ENTT_NOEXCEPT {
    +
    554  return ++it, *this;
    555  }
    556 
    -
    557  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
    -
    558  return std::tuple_cat(
    -
    559  std::make_tuple(*it),
    -
    560  std::forward_as_tuple(*std::get<OIt>(owned)...),
    -
    561  std::get<storage_type<Get> *>(get)->get_as_tuple(*it)...);
    -
    562  }
    -
    563 
    -
    564  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    -
    565  return operator*();
    -
    566  }
    -
    567 
    -
    568  [[nodiscard]] bool operator==(const extended_group_iterator &other) const ENTT_NOEXCEPT {
    -
    569  return other.it == it;
    -
    570  }
    -
    571 
    -
    572  [[nodiscard]] bool operator!=(const extended_group_iterator &other) const ENTT_NOEXCEPT {
    -
    573  return !(*this == other);
    -
    574  }
    -
    575 
    -
    576  private:
    -
    577  typename basic_common_type::iterator it;
    -
    578  std::tuple<OIt...> owned;
    -
    579  std::tuple<storage_type<Get> *...> get;
    -
    580  };
    -
    581 
    -
    582  basic_group(const std::size_t &extent, storage_type<Owned> &...opool, storage_type<Get> &...gpool) ENTT_NOEXCEPT
    -
    583  : pools{&opool..., &gpool...},
    -
    584  length{&extent} {}
    +
    557  extended_group_iterator operator++(int) ENTT_NOEXCEPT {
    +
    558  extended_group_iterator orig = *this;
    +
    559  return ++(*this), orig;
    +
    560  }
    +
    561 
    +
    562  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
    +
    563  return std::tuple_cat(
    +
    564  std::make_tuple(*it),
    +
    565  index_to_element<Owned>(*std::get<storage_type<Owned> *>(pools))...,
    +
    566  std::get<storage_type<Get> *>(pools)->get_as_tuple(*it)...);
    +
    567  }
    +
    568 
    +
    569  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    +
    570  return operator*();
    +
    571  }
    +
    572 
    +
    573  [[nodiscard]] bool operator==(const extended_group_iterator &other) const ENTT_NOEXCEPT {
    +
    574  return other.it == it;
    +
    575  }
    +
    576 
    +
    577  [[nodiscard]] bool operator!=(const extended_group_iterator &other) const ENTT_NOEXCEPT {
    +
    578  return !(*this == other);
    +
    579  }
    +
    580 
    +
    581  private:
    +
    582  typename basic_common_type::iterator it;
    +
    583  std::tuple<storage_type<Owned> *..., storage_type<Get> *...> pools;
    +
    584  };
    585 
    -
    586 public:
    -
    588  using entity_type = Entity;
    -
    590  using size_type = std::size_t;
    -
    592  using base_type = basic_common_type;
    -
    594  using iterator = typename base_type::iterator;
    -
    596  using reverse_iterator = typename base_type::reverse_iterator;
    -
    598  using iterable = iterable_adaptor<extended_group_iterator<type_list_cat_t<std::conditional_t<ignore_as_empty_v<std::remove_const_t<Owned>>, type_list<>, type_list<decltype(std::declval<storage_type<Owned>>().end())>>...>>>;
    -
    599 
    -
    601  basic_group() ENTT_NOEXCEPT
    -
    602  : length{} {}
    +
    586  basic_group(const std::size_t &extent, storage_type<Owned> &...opool, storage_type<Get> &...gpool) ENTT_NOEXCEPT
    +
    587  : pools{&opool..., &gpool...},
    +
    588  length{&extent} {}
    +
    589 
    +
    590 public:
    +
    592  using entity_type = Entity;
    +
    594  using size_type = std::size_t;
    +
    596  using base_type = basic_common_type;
    +
    598  using iterator = typename base_type::iterator;
    +
    600  using reverse_iterator = typename base_type::reverse_iterator;
    +
    602  using iterable = iterable_adaptor<extended_group_iterator>;
    603 
    -
    609  template<typename Comp>
    -
    610  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
    -
    611  return *std::get<storage_type<Comp> *>(pools);
    -
    612  }
    -
    613 
    -
    619  template<std::size_t Comp>
    -
    620  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
    -
    621  return *std::get<Comp>(pools);
    -
    622  }
    -
    623 
    -
    628  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
    -
    629  return *this ? *length : size_type{};
    -
    630  }
    -
    631 
    -
    636  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    -
    637  return !*this || !*length;
    -
    638  }
    -
    639 
    -
    648  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
    -
    649  return *this ? (std::get<0>(pools)->base_type::end() - *length) : iterator{};
    -
    650  }
    -
    651 
    -
    662  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
    -
    663  return *this ? std::get<0>(pools)->base_type::end() : iterator{};
    -
    664  }
    -
    665 
    -
    674  [[nodiscard]] reverse_iterator rbegin() const ENTT_NOEXCEPT {
    -
    675  return *this ? std::get<0>(pools)->base_type::rbegin() : reverse_iterator{};
    -
    676  }
    -
    677 
    -
    689  [[nodiscard]] reverse_iterator rend() const ENTT_NOEXCEPT {
    -
    690  return *this ? (std::get<0>(pools)->base_type::rbegin() + *length) : reverse_iterator{};
    -
    691  }
    -
    692 
    -
    698  [[nodiscard]] entity_type front() const {
    -
    699  const auto it = begin();
    -
    700  return it != end() ? *it : null;
    -
    701  }
    -
    702 
    -
    708  [[nodiscard]] entity_type back() const {
    -
    709  const auto it = rbegin();
    -
    710  return it != rend() ? *it : null;
    -
    711  }
    -
    712 
    -
    719  [[nodiscard]] iterator find(const entity_type entt) const {
    -
    720  const auto it = *this ? std::get<0>(pools)->find(entt) : iterator{};
    -
    721  return it != end() && it >= begin() && *it == entt ? it : end();
    -
    722  }
    -
    723 
    -
    729  [[nodiscard]] entity_type operator[](const size_type pos) const {
    -
    730  return begin()[pos];
    -
    731  }
    -
    732 
    -
    737  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    738  return length != nullptr;
    -
    739  }
    -
    740 
    -
    746  [[nodiscard]] bool contains(const entity_type entt) const {
    -
    747  return *this && std::get<0>(pools)->contains(entt) && (std::get<0>(pools)->index(entt) < (*length));
    -
    748  }
    -
    749 
    -
    765  template<typename... Comp>
    -
    766  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
    -
    767  ENTT_ASSERT(contains(entt), "Group does not contain entity");
    -
    768 
    -
    769  if constexpr(sizeof...(Comp) == 0) {
    -
    770  return std::tuple_cat(std::get<storage_type<Owned> *>(pools)->get_as_tuple(entt)..., std::get<storage_type<Get> *>(pools)->get_as_tuple(entt)...);
    -
    771  } else if constexpr(sizeof...(Comp) == 1) {
    -
    772  return (std::get<storage_type<Comp> *>(pools)->get(entt), ...);
    -
    773  } else {
    -
    774  return std::tuple_cat(std::get<storage_type<Comp> *>(pools)->get_as_tuple(entt)...);
    -
    775  }
    -
    776  }
    -
    777 
    -
    800  template<typename Func>
    -
    801  void each(Func func) const {
    -
    802  for(auto args: each()) {
    -
    803  if constexpr(is_applicable_v<Func, decltype(std::tuple_cat(std::tuple<entity_type>{}, std::declval<basic_group>().get({})))>) {
    -
    804  std::apply(func, args);
    -
    805  } else {
    -
    806  std::apply([&func](auto, auto &&...less) { func(std::forward<decltype(less)>(less)...); }, args);
    -
    807  }
    -
    808  }
    -
    809  }
    -
    810 
    -
    824  [[nodiscard]] iterable each() const ENTT_NOEXCEPT {
    -
    825  using extended_iterator_type = typename iterable::iterator;
    -
    826  iterator last = length ? std::get<0>(pools)->basic_common_type::end() : iterator{};
    -
    827  auto from = extended_iterator_type{last - *length, std::make_tuple((std::get<storage_type<Owned> *>(pools)->end() - *length)...), std::make_tuple(std::get<storage_type<Get> *>(pools)...)};
    -
    828  auto to = extended_iterator_type{last, std::make_tuple((std::get<storage_type<Owned> *>(pools)->end())...), std::make_tuple(std::get<storage_type<Get> *>(pools)...)};
    -
    829  return {std::move(from), std::move(to)};
    -
    830  }
    -
    831 
    -
    869  template<typename... Comp, typename Compare, typename Sort = std_sort, typename... Args>
    -
    870  void sort(Compare compare, Sort algo = Sort{}, Args &&...args) const {
    -
    871  auto *cpool = std::get<0>(pools);
    -
    872 
    -
    873  if constexpr(sizeof...(Comp) == 0) {
    -
    874  static_assert(std::is_invocable_v<Compare, const entity_type, const entity_type>, "Invalid comparison function");
    -
    875  cpool->sort_n(*length, std::move(compare), std::move(algo), std::forward<Args>(args)...);
    -
    876  } else {
    -
    877  auto comp = [this, &compare](const entity_type lhs, const entity_type rhs) {
    -
    878  if constexpr(sizeof...(Comp) == 1) {
    -
    879  return compare((std::get<storage_type<Comp> *>(pools)->get(lhs), ...), (std::get<storage_type<Comp> *>(pools)->get(rhs), ...));
    -
    880  } else {
    -
    881  return compare(std::forward_as_tuple(std::get<storage_type<Comp> *>(pools)->get(lhs)...), std::forward_as_tuple(std::get<storage_type<Comp> *>(pools)->get(rhs)...));
    -
    882  }
    -
    883  };
    -
    884 
    -
    885  cpool->sort_n(*length, std::move(comp), std::move(algo), std::forward<Args>(args)...);
    -
    886  }
    -
    887 
    -
    888  [this](auto *head, auto *...other) {
    -
    889  for(auto next = *length; next; --next) {
    -
    890  const auto pos = next - 1;
    -
    891  [[maybe_unused]] const auto entt = head->data()[pos];
    -
    892  (other->swap_elements(other->data()[pos], entt), ...);
    -
    893  }
    -
    894  }(std::get<storage_type<Owned> *>(pools)...);
    -
    895  }
    -
    896 
    -
    897 private:
    -
    898  const std::tuple<storage_type<Owned> *..., storage_type<Get> *...> pools;
    -
    899  const size_type *const length;
    -
    900 };
    -
    901 
    -
    902 } // namespace entt
    -
    903 
    -
    904 #endif
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type
    Entity entity_type
    Underlying entity identifier.
    Definition: group.hpp:588
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::base_type
    basic_common_type base_type
    Common type among all storage types.
    Definition: group.hpp:592
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::front
    entity_type front() const
    Returns the first entity of the group, if any.
    Definition: group.hpp:698
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size
    size_type size() const
    Returns the number of entities that have the given components.
    Definition: group.hpp:628
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterator
    typename base_type::iterator iterator
    Random access iterator type.
    Definition: group.hpp:594
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::begin
    iterator begin() const
    Returns an iterator to the first entity of the group.
    Definition: group.hpp:648
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::end
    iterator end() const
    Returns an iterator that is past the last entity of the group.
    Definition: group.hpp:662
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each
    void each(Func func) const
    Iterates entities and components and applies the given function object to them.
    Definition: group.hpp:801
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each
    iterable each() const
    Returns an iterable object to use to visit a group.
    Definition: group.hpp:824
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::back
    entity_type back() const
    Returns the last entity of the group, if any.
    Definition: group.hpp:708
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator
    typename base_type::reverse_iterator reverse_iterator
    Reversed iterator type.
    Definition: group.hpp:596
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rbegin
    reverse_iterator rbegin() const
    Returns an iterator to the first entity of the reversed group.
    Definition: group.hpp:674
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: group.hpp:590
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::contains
    bool contains(const entity_type entt) const
    Checks if a group contains an entity.
    Definition: group.hpp:746
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rend
    reverse_iterator rend() const
    Returns an iterator that is past the last entity of the reversed group.
    Definition: group.hpp:689
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::sort
    void sort(Compare compare, Sort algo=Sort{}, Args &&...args) const
    Sort a group according to the given comparison function.
    Definition: group.hpp:870
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::find
    iterator find(const entity_type entt) const
    Finds an entity.
    Definition: group.hpp:719
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::empty
    bool empty() const
    Checks whether a group is empty.
    Definition: group.hpp:636
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_group
    basic_group()
    Default constructor to use to create empty, invalid groups.
    Definition: group.hpp:601
    -
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator[]
    entity_type operator[](const size_type pos) const
    Returns the identifier that occupies the given position.
    Definition: group.hpp:729
    +
    605  basic_group() ENTT_NOEXCEPT
    +
    606  : length{} {}
    +
    607 
    +
    613  template<typename Comp>
    +
    614  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
    +
    615  return *std::get<storage_type<Comp> *>(pools);
    +
    616  }
    +
    617 
    +
    623  template<std::size_t Comp>
    +
    624  [[nodiscard]] decltype(auto) storage() const ENTT_NOEXCEPT {
    +
    625  return *std::get<Comp>(pools);
    +
    626  }
    +
    627 
    +
    632  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
    +
    633  return *this ? *length : size_type{};
    +
    634  }
    +
    635 
    +
    640  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    +
    641  return !*this || !*length;
    +
    642  }
    +
    643 
    +
    652  [[nodiscard]] iterator begin() const ENTT_NOEXCEPT {
    +
    653  return *this ? (std::get<0>(pools)->base_type::end() - *length) : iterator{};
    +
    654  }
    +
    655 
    +
    666  [[nodiscard]] iterator end() const ENTT_NOEXCEPT {
    +
    667  return *this ? std::get<0>(pools)->base_type::end() : iterator{};
    +
    668  }
    +
    669 
    +
    678  [[nodiscard]] reverse_iterator rbegin() const ENTT_NOEXCEPT {
    +
    679  return *this ? std::get<0>(pools)->base_type::rbegin() : reverse_iterator{};
    +
    680  }
    +
    681 
    +
    693  [[nodiscard]] reverse_iterator rend() const ENTT_NOEXCEPT {
    +
    694  return *this ? (std::get<0>(pools)->base_type::rbegin() + *length) : reverse_iterator{};
    +
    695  }
    +
    696 
    +
    702  [[nodiscard]] entity_type front() const ENTT_NOEXCEPT {
    +
    703  const auto it = begin();
    +
    704  return it != end() ? *it : null;
    +
    705  }
    +
    706 
    +
    712  [[nodiscard]] entity_type back() const ENTT_NOEXCEPT {
    +
    713  const auto it = rbegin();
    +
    714  return it != rend() ? *it : null;
    +
    715  }
    +
    716 
    +
    723  [[nodiscard]] iterator find(const entity_type entt) const ENTT_NOEXCEPT {
    +
    724  const auto it = *this ? std::get<0>(pools)->find(entt) : iterator{};
    +
    725  return it != end() && it >= begin() && *it == entt ? it : end();
    +
    726  }
    +
    727 
    +
    733  [[nodiscard]] entity_type operator[](const size_type pos) const {
    +
    734  return begin()[pos];
    +
    735  }
    +
    736 
    +
    741  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    742  return length != nullptr;
    +
    743  }
    +
    744 
    +
    750  [[nodiscard]] bool contains(const entity_type entt) const ENTT_NOEXCEPT {
    +
    751  return *this && std::get<0>(pools)->contains(entt) && (std::get<0>(pools)->index(entt) < (*length));
    +
    752  }
    +
    753 
    +
    769  template<typename... Comp>
    +
    770  [[nodiscard]] decltype(auto) get(const entity_type entt) const {
    +
    771  ENTT_ASSERT(contains(entt), "Group does not contain entity");
    +
    772 
    +
    773  if constexpr(sizeof...(Comp) == 0) {
    +
    774  return std::tuple_cat(std::get<storage_type<Owned> *>(pools)->get_as_tuple(entt)..., std::get<storage_type<Get> *>(pools)->get_as_tuple(entt)...);
    +
    775  } else if constexpr(sizeof...(Comp) == 1) {
    +
    776  return (std::get<storage_type<Comp> *>(pools)->get(entt), ...);
    +
    777  } else {
    +
    778  return std::tuple_cat(std::get<storage_type<Comp> *>(pools)->get_as_tuple(entt)...);
    +
    779  }
    +
    780  }
    +
    781 
    +
    804  template<typename Func>
    +
    805  void each(Func func) const {
    +
    806  for(auto args: each()) {
    +
    807  if constexpr(is_applicable_v<Func, decltype(std::tuple_cat(std::tuple<entity_type>{}, std::declval<basic_group>().get({})))>) {
    +
    808  std::apply(func, args);
    +
    809  } else {
    +
    810  std::apply([&func](auto, auto &&...less) { func(std::forward<decltype(less)>(less)...); }, args);
    +
    811  }
    +
    812  }
    +
    813  }
    +
    814 
    +
    828  [[nodiscard]] iterable each() const ENTT_NOEXCEPT {
    +
    829  iterator last = length ? std::get<0>(pools)->basic_common_type::end() : iterator{};
    +
    830  return {extended_group_iterator{last - *length, pools}, extended_group_iterator{last, pools}};
    +
    831  }
    +
    832 
    +
    870  template<typename... Comp, typename Compare, typename Sort = std_sort, typename... Args>
    +
    871  void sort(Compare compare, Sort algo = Sort{}, Args &&...args) const {
    +
    872  auto *cpool = std::get<0>(pools);
    +
    873 
    +
    874  if constexpr(sizeof...(Comp) == 0) {
    +
    875  static_assert(std::is_invocable_v<Compare, const entity_type, const entity_type>, "Invalid comparison function");
    +
    876  cpool->sort_n(*length, std::move(compare), std::move(algo), std::forward<Args>(args)...);
    +
    877  } else {
    +
    878  auto comp = [this, &compare](const entity_type lhs, const entity_type rhs) {
    +
    879  if constexpr(sizeof...(Comp) == 1) {
    +
    880  return compare((std::get<storage_type<Comp> *>(pools)->get(lhs), ...), (std::get<storage_type<Comp> *>(pools)->get(rhs), ...));
    +
    881  } else {
    +
    882  return compare(std::forward_as_tuple(std::get<storage_type<Comp> *>(pools)->get(lhs)...), std::forward_as_tuple(std::get<storage_type<Comp> *>(pools)->get(rhs)...));
    +
    883  }
    +
    884  };
    +
    885 
    +
    886  cpool->sort_n(*length, std::move(comp), std::move(algo), std::forward<Args>(args)...);
    +
    887  }
    +
    888 
    +
    889  [this](auto *head, auto *...other) {
    +
    890  for(auto next = *length; next; --next) {
    +
    891  const auto pos = next - 1;
    +
    892  [[maybe_unused]] const auto entt = head->data()[pos];
    +
    893  (other->swap_elements(other->data()[pos], entt), ...);
    +
    894  }
    +
    895  }(std::get<storage_type<Owned> *>(pools)...);
    +
    896  }
    +
    897 
    +
    898 private:
    +
    899  const std::tuple<storage_type<Owned> *..., storage_type<Get> *...> pools;
    +
    900  const size_type *const length;
    +
    901 };
    +
    902 
    +
    903 } // namespace entt
    +
    904 
    +
    905 #endif
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::entity_type
    Entity entity_type
    Underlying entity identifier.
    Definition: group.hpp:592
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::base_type
    basic_common_type base_type
    Common type among all storage types.
    Definition: group.hpp:596
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::front
    entity_type front() const
    Returns the first entity of the group, if any.
    Definition: group.hpp:702
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size
    size_type size() const
    Returns the number of entities that have the given components.
    Definition: group.hpp:632
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::iterator
    typename base_type::iterator iterator
    Random access iterator type.
    Definition: group.hpp:598
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::begin
    iterator begin() const
    Returns an iterator to the first entity of the group.
    Definition: group.hpp:652
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::end
    iterator end() const
    Returns an iterator that is past the last entity of the group.
    Definition: group.hpp:666
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each
    void each(Func func) const
    Iterates entities and components and applies the given function object to them.
    Definition: group.hpp:805
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::each
    iterable each() const
    Returns an iterable object to use to visit a group.
    Definition: group.hpp:828
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::back
    entity_type back() const
    Returns the last entity of the group, if any.
    Definition: group.hpp:712
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator
    typename base_type::reverse_iterator reverse_iterator
    Reversed iterator type.
    Definition: group.hpp:600
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rbegin
    reverse_iterator rbegin() const
    Returns an iterator to the first entity of the reversed group.
    Definition: group.hpp:678
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: group.hpp:594
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::contains
    bool contains(const entity_type entt) const
    Checks if a group contains an entity.
    Definition: group.hpp:750
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::rend
    reverse_iterator rend() const
    Returns an iterator that is past the last entity of the reversed group.
    Definition: group.hpp:693
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::sort
    void sort(Compare compare, Sort algo=Sort{}, Args &&...args) const
    Sort a group according to the given comparison function.
    Definition: group.hpp:871
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::find
    iterator find(const entity_type entt) const
    Finds an entity.
    Definition: group.hpp:723
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::empty
    bool empty() const
    Checks whether a group is empty.
    Definition: group.hpp:640
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::basic_group
    basic_group()
    Default constructor to use to create empty, invalid groups.
    Definition: group.hpp:605
    +
    entt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >::operator[]
    entity_type operator[](const size_type pos) const
    Returns the identifier that occupies the given position.
    Definition: group.hpp:733
    entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::back
    entity_type back() const
    Returns the last entity of the group, if any.
    Definition: group.hpp:268
    entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each
    iterable each() const
    Returns an iterable object to use to visit a group.
    Definition: group.hpp:384
    entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::base_type
    basic_common_type base_type
    Common type among all storage types.
    Definition: group.hpp:128
    @@ -546,24 +547,22 @@ $(function() {
    entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::each
    void each(Func func) const
    Iterates entities and components and applies the given function object to them.
    Definition: group.hpp:361
    entt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >::reverse_iterator
    typename base_type::reverse_iterator reverse_iterator
    Reversed iterator type.
    Definition: group.hpp:132
    entt::basic_group
    Group.
    Definition: fwd.hpp:26
    -
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:173
    -
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:237
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:217
    +
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:221
    +
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:234
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    entt::is_applicable_v
    constexpr bool is_applicable_v
    Helper variable template.
    Definition: type_traits.hpp:404
    -
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:645
    +
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:618
    entt::get
    constexpr get_t< Type... > get
    Variable template for lists of observed components.
    Definition: utility.hpp:34
    -
    entt::owned
    constexpr owned_t< Type... > owned
    Variable template for lists of owned components.
    Definition: utility.hpp:48
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    +
    entt::ignore_as_empty_v
    constexpr bool ignore_as_empty_v
    Helper variable template.
    Definition: component.hpp:57
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    entt::exclude_t
    Alias for exclusion lists.
    Definition: utility.hpp:13
    entt::get_t
    Alias for lists of observed components.
    Definition: utility.hpp:27
    entt::input_iterator_pointer
    Helper type to use as pointer with input iterators.
    Definition: iterator.hpp:16
    -
    entt::iterable_adaptor
    Utility class to create an iterable object from a pair of iterators.
    Definition: iterator.hpp:62
    -
    entt::iterable_adaptor::begin
    const_iterator begin() const
    Returns an iterator to the beginning.
    Definition: iterator.hpp:86
    -
    entt::iterable_adaptor::iterator
    It iterator
    Iterator type.
    Definition: iterator.hpp:66
    +
    entt::iterable_adaptor
    Utility class to create an iterable object from a pair of iterators.
    Definition: iterator.hpp:63
    +
    entt::iterable_adaptor::begin
    iterator begin() const
    Returns an iterator to the beginning.
    Definition: iterator.hpp:87
    entt::owned_t
    Alias for lists of owned components.
    Definition: utility.hpp:41
    entt::std_sort
    Function object to wrap std::sort in a class type.
    Definition: algorithm.hpp:21
    -
    entt::type_list
    A class to use to push around lists of types, nothing more.
    Definition: type_traits.hpp:110
    diff --git a/entity_2handle_8hpp_source.html b/handle_8hpp_source.html similarity index 94% rename from entity_2handle_8hpp_source.html rename to handle_8hpp_source.html index fed8a9596..bc84becfe 100644 --- a/entity_2handle_8hpp_source.html +++ b/handle_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -235,40 +235,40 @@ $(function() {
    338 } // namespace entt
    339 
    340 #endif
    -
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:173
    -
    entt::basic_sparse_set::contains
    bool contains(const entity_type entt) const
    Checks if a sparse set contains an entity.
    Definition: sparse_set.hpp:582
    -
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:237
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:217
    +
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:221
    +
    entt::basic_sparse_set::contains
    bool contains(const entity_type entt) const
    Checks if a sparse set contains an entity.
    Definition: sparse_set.hpp:576
    +
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:234
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    entt::basic_handle
    basic_handle(basic_registry< Entity > &, Entity) -> basic_handle< Entity >
    Deduction guide.
    -
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:645
    +
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:618
    entt::type_list_contains_v
    constexpr bool type_list_contains_v
    Helper variable template.
    Definition: type_traits.hpp:256
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    -
    entt::basic_handle
    Non-owning handle to an entity.
    Definition: handle.hpp:23
    -
    entt::basic_handle::any_of
    decltype(auto) any_of() const
    Checks if a handle has at least one of the given components.
    Definition: handle.hpp:217
    -
    entt::basic_handle::orphan
    bool orphan() const
    Checks if a handle has components assigned.
    Definition: handle.hpp:263
    -
    entt::basic_handle::size_type
    typename registry_type::size_type size_type
    Unsigned integer type.
    Definition: handle.hpp:31
    -
    entt::basic_handle::get
    decltype(auto) get() const
    Returns references to the given components for a handle.
    Definition: handle.hpp:228
    -
    entt::basic_handle::visit
    void visit(Func &&func) const
    Visits a handle and returns the pools for its components.
    Definition: handle.hpp:283
    -
    entt::basic_handle::entity
    entity_type entity() const
    Returns the entity associated with a handle.
    Definition: handle.hpp:98
    -
    entt::basic_handle::all_of
    decltype(auto) all_of() const
    Checks if a handle has all the given components.
    Definition: handle.hpp:205
    -
    entt::basic_handle::registry
    registry_type * registry() const
    Returns a pointer to the underlying registry, if any.
    Definition: handle.hpp:90
    -
    entt::basic_handle::entity_type
    typename registry_type::entity_type entity_type
    Underlying entity identifier.
    Definition: handle.hpp:27
    -
    entt::basic_handle::replace
    decltype(auto) replace(Args &&...args) const
    Replaces the given component for a handle.
    Definition: handle.hpp:170
    -
    entt::basic_handle::try_get
    auto try_get() const
    Returns pointers to the given components for a handle.
    Definition: handle.hpp:254
    -
    entt::basic_handle::patch
    decltype(auto) patch(Func &&...func) const
    Patches the given component for a handle.
    Definition: handle.hpp:156
    -
    entt::basic_handle::emplace_or_replace
    decltype(auto) emplace_or_replace(Args &&...args) const
    Assigns or replaces the given component for a handle.
    Definition: handle.hpp:142
    -
    entt::basic_handle::emplace
    decltype(auto) emplace(Args &&...args) const
    Assigns the given component to a handle.
    Definition: handle.hpp:128
    -
    entt::basic_handle::basic_handle
    basic_handle(registry_type &ref, entity_type value)
    Constructs a handle from a given registry and entity.
    Definition: handle.hpp:43
    -
    entt::basic_handle::destroy
    void destroy()
    Destroys the entity associated with a handle.
    Definition: handle.hpp:106
    -
    entt::basic_handle::version_type
    typename registry_type::version_type version_type
    Underlying version type.
    Definition: handle.hpp:29
    -
    entt::basic_handle::valid
    bool valid() const
    Checks if a handle refers to a valid entity or not.
    Definition: handle.hpp:82
    -
    entt::basic_handle::remove
    size_type remove() const
    Removes the given components from a handle.
    Definition: handle.hpp:182
    -
    entt::basic_handle::erase
    void erase() const
    Erases the given components from a handle.
    Definition: handle.hpp:193
    -
    entt::basic_handle::get_or_emplace
    decltype(auto) get_or_emplace(Args &&...args) const
    Returns a reference to the given component for a handle.
    Definition: handle.hpp:242
    -
    entt::basic_handle::basic_handle
    basic_handle()
    Constructs an invalid handle.
    Definition: handle.hpp:34
    -
    entt::basic_handle::registry_type
    constness_as_t< basic_registry< std::remove_const_t< Entity > >, Entity > registry_type
    Type of registry accepted by the handle.
    Definition: handle.hpp:25
    -
    entt::basic_handle::destroy
    void destroy(const version_type version)
    Destroys the entity associated with a handle.
    Definition: handle.hpp:115
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    +
    entt::basic_handle
    Non-owning handle to an entity.
    Definition: handle.hpp:23
    +
    entt::basic_handle::any_of
    decltype(auto) any_of() const
    Checks if a handle has at least one of the given components.
    Definition: handle.hpp:217
    +
    entt::basic_handle::orphan
    bool orphan() const
    Checks if a handle has components assigned.
    Definition: handle.hpp:263
    +
    entt::basic_handle::size_type
    typename registry_type::size_type size_type
    Unsigned integer type.
    Definition: handle.hpp:31
    +
    entt::basic_handle::get
    decltype(auto) get() const
    Returns references to the given components for a handle.
    Definition: handle.hpp:228
    +
    entt::basic_handle::visit
    void visit(Func &&func) const
    Visits a handle and returns the pools for its components.
    Definition: handle.hpp:283
    +
    entt::basic_handle::entity
    entity_type entity() const
    Returns the entity associated with a handle.
    Definition: handle.hpp:98
    +
    entt::basic_handle::all_of
    decltype(auto) all_of() const
    Checks if a handle has all the given components.
    Definition: handle.hpp:205
    +
    entt::basic_handle::registry
    registry_type * registry() const
    Returns a pointer to the underlying registry, if any.
    Definition: handle.hpp:90
    +
    entt::basic_handle::entity_type
    typename registry_type::entity_type entity_type
    Underlying entity identifier.
    Definition: handle.hpp:27
    +
    entt::basic_handle::replace
    decltype(auto) replace(Args &&...args) const
    Replaces the given component for a handle.
    Definition: handle.hpp:170
    +
    entt::basic_handle::try_get
    auto try_get() const
    Returns pointers to the given components for a handle.
    Definition: handle.hpp:254
    +
    entt::basic_handle::patch
    decltype(auto) patch(Func &&...func) const
    Patches the given component for a handle.
    Definition: handle.hpp:156
    +
    entt::basic_handle::emplace_or_replace
    decltype(auto) emplace_or_replace(Args &&...args) const
    Assigns or replaces the given component for a handle.
    Definition: handle.hpp:142
    +
    entt::basic_handle::emplace
    decltype(auto) emplace(Args &&...args) const
    Assigns the given component to a handle.
    Definition: handle.hpp:128
    +
    entt::basic_handle::basic_handle
    basic_handle(registry_type &ref, entity_type value)
    Constructs a handle from a given registry and entity.
    Definition: handle.hpp:43
    +
    entt::basic_handle::destroy
    void destroy()
    Destroys the entity associated with a handle.
    Definition: handle.hpp:106
    +
    entt::basic_handle::version_type
    typename registry_type::version_type version_type
    Underlying version type.
    Definition: handle.hpp:29
    +
    entt::basic_handle::valid
    bool valid() const
    Checks if a handle refers to a valid entity or not.
    Definition: handle.hpp:82
    +
    entt::basic_handle::remove
    size_type remove() const
    Removes the given components from a handle.
    Definition: handle.hpp:182
    +
    entt::basic_handle::erase
    void erase() const
    Erases the given components from a handle.
    Definition: handle.hpp:193
    +
    entt::basic_handle::get_or_emplace
    decltype(auto) get_or_emplace(Args &&...args) const
    Returns a reference to the given component for a handle.
    Definition: handle.hpp:242
    +
    entt::basic_handle::basic_handle
    basic_handle()
    Constructs an invalid handle.
    Definition: handle.hpp:34
    +
    entt::basic_handle::registry_type
    constness_as_t< basic_registry< std::remove_const_t< Entity > >, Entity > registry_type
    Type of registry accepted by the handle.
    Definition: handle.hpp:25
    +
    entt::basic_handle::destroy
    void destroy(const version_type version)
    Destroys the entity associated with a handle.
    Definition: handle.hpp:115
    entt::type_list< Type... >
    diff --git a/hashed__string_8hpp_source.html b/hashed__string_8hpp_source.html index 5bb0840aa..3693446bf 100644 --- a/hashed__string_8hpp_source.html +++ b/hashed__string_8hpp_source.html @@ -22,7 +22,7 @@     @@ -99,154 +99,182 @@ $(function() {
    32  static constexpr std::uint64_t prime = 1099511628211ull;
    33 };
    34 
    -
    35 } // namespace internal
    -
    36 
    -
    57 template<typename Char>
    -
    58 class basic_hashed_string {
    -
    59  using hs_traits = internal::fnv1a_traits<id_type>;
    -
    60 
    -
    61  struct const_wrapper {
    -
    62  // non-explicit constructor on purpose
    -
    63  constexpr const_wrapper(const Char *curr) ENTT_NOEXCEPT: str{curr} {}
    -
    64  const Char *str;
    -
    65  };
    -
    66 
    -
    67  // Fowler–Noll–Vo hash function v. 1a - the good
    -
    68  [[nodiscard]] static constexpr id_type helper(const Char *curr) ENTT_NOEXCEPT {
    -
    69  auto value = hs_traits::offset;
    -
    70 
    -
    71  while(*curr != 0) {
    -
    72  value = (value ^ static_cast<hs_traits::type>(*(curr++))) * hs_traits::prime;
    -
    73  }
    -
    74 
    -
    75  return value;
    -
    76  }
    -
    77 
    -
    78 public:
    -
    80  using value_type = Char;
    -
    82  using hash_type = id_type;
    -
    83 
    -
    90  [[nodiscard]] static constexpr hash_type value(const value_type *str, std::size_t size) ENTT_NOEXCEPT {
    -
    91  id_type partial{hs_traits::offset};
    -
    92  while(size--) { partial = (partial ^ (str++)[0]) * hs_traits::prime; }
    -
    93  return partial;
    -
    94  }
    -
    95 
    -
    111  template<std::size_t N>
    -
    112  [[nodiscard]] static constexpr hash_type value(const value_type (&str)[N]) ENTT_NOEXCEPT {
    -
    113  return helper(str);
    -
    114  }
    -
    115 
    -
    121  [[nodiscard]] static hash_type value(const_wrapper wrapper) ENTT_NOEXCEPT {
    -
    122  return helper(wrapper.str);
    -
    123  }
    -
    124 
    -
    126  constexpr basic_hashed_string() ENTT_NOEXCEPT
    -
    127  : str{nullptr},
    -
    128  hash{} {}
    +
    35 template<typename Char>
    +
    36 struct basic_hashed_string {
    +
    37  using value_type = Char;
    +
    38  using size_type = std::size_t;
    +
    39  using hash_type = id_type;
    +
    40 
    +
    41  const value_type *repr;
    +
    42  size_type length;
    +
    43  hash_type hash;
    +
    44 };
    +
    45 
    +
    46 } // namespace internal
    +
    47 
    +
    68 template<typename Char>
    +
    69 class basic_hashed_string: internal::basic_hashed_string<Char> {
    +
    70  using base_type = internal::basic_hashed_string<Char>;
    +
    71  using hs_traits = internal::fnv1a_traits<id_type>;
    +
    72 
    +
    73  struct const_wrapper {
    +
    74  // non-explicit constructor on purpose
    +
    75  constexpr const_wrapper(const Char *str) ENTT_NOEXCEPT: repr{str} {}
    +
    76  const Char *repr;
    +
    77  };
    +
    78 
    +
    79  // Fowler–Noll–Vo hash function v. 1a - the good
    +
    80  [[nodiscard]] static constexpr auto helper(const Char *str) ENTT_NOEXCEPT {
    +
    81  base_type base{str, 0u, hs_traits::offset};
    +
    82 
    +
    83  for(; str[base.length]; ++base.length) {
    +
    84  base.hash = (base.hash ^ static_cast<hs_traits::type>(str[base.length])) * hs_traits::prime;
    +
    85  }
    +
    86 
    +
    87  return base;
    +
    88  }
    +
    89 
    +
    90  // Fowler–Noll–Vo hash function v. 1a - the good
    +
    91  [[nodiscard]] static constexpr auto helper(const Char *str, const std::size_t len) ENTT_NOEXCEPT {
    +
    92  base_type base{str, len, hs_traits::offset};
    +
    93 
    +
    94  for(size_type pos{}; pos < len; ++pos) {
    +
    95  base.hash = (base.hash ^ static_cast<hs_traits::type>(str[pos])) * hs_traits::prime;
    +
    96  }
    +
    97 
    +
    98  return base;
    +
    99  }
    +
    100 
    +
    101 public:
    +
    103  using value_type = typename base_type::value_type;
    +
    105  using size_type = typename base_type::size_type;
    +
    107  using hash_type = typename base_type::hash_type;
    +
    108 
    +
    115  [[nodiscard]] static constexpr hash_type value(const value_type *str, const size_type len) ENTT_NOEXCEPT {
    +
    116  return basic_hashed_string{str, len};
    +
    117  }
    +
    118 
    +
    125  template<std::size_t N>
    +
    126  [[nodiscard]] static constexpr hash_type value(const value_type (&str)[N]) ENTT_NOEXCEPT {
    +
    127  return basic_hashed_string{str};
    +
    128  }
    129 
    -
    144  template<std::size_t N>
    -
    145  constexpr basic_hashed_string(const value_type (&curr)[N]) ENTT_NOEXCEPT
    -
    146  : str{curr},
    -
    147  hash{helper(curr)} {}
    -
    148 
    -
    158  explicit constexpr basic_hashed_string(const_wrapper wrapper) ENTT_NOEXCEPT
    -
    159  : str{wrapper.str},
    -
    160  hash{helper(wrapper.str)} {}
    -
    161 
    -
    166  [[nodiscard]] constexpr const value_type *data() const ENTT_NOEXCEPT {
    -
    167  return str;
    -
    168  }
    -
    169 
    -
    174  [[nodiscard]] constexpr hash_type value() const ENTT_NOEXCEPT {
    -
    175  return hash;
    -
    176  }
    -
    177 
    -
    179  [[nodiscard]] constexpr operator const value_type *() const ENTT_NOEXCEPT {
    -
    180  return data();
    -
    181  }
    -
    182 
    -
    187  [[nodiscard]] constexpr operator hash_type() const ENTT_NOEXCEPT {
    -
    188  return value();
    -
    189  }
    -
    190 
    -
    191 private:
    -
    192  const value_type *str;
    -
    193  hash_type hash;
    -
    194 };
    +
    135  [[nodiscard]] static constexpr hash_type value(const_wrapper wrapper) ENTT_NOEXCEPT {
    +
    136  return basic_hashed_string{wrapper};
    +
    137  }
    +
    138 
    +
    140  constexpr basic_hashed_string() ENTT_NOEXCEPT
    +
    141  : base_type{} {}
    +
    142 
    +
    148  constexpr basic_hashed_string(const value_type *str, const size_type len) ENTT_NOEXCEPT
    +
    149  : base_type{helper(str, len)} {}
    +
    150 
    +
    156  template<std::size_t N>
    +
    157  constexpr basic_hashed_string(const value_type (&str)[N]) ENTT_NOEXCEPT
    +
    158  : base_type{helper(str)} {}
    +
    159 
    +
    169  explicit constexpr basic_hashed_string(const_wrapper wrapper) ENTT_NOEXCEPT
    +
    170  : base_type{helper(wrapper.repr)} {}
    +
    171 
    +
    176  [[nodiscard]] constexpr size_type size() const ENTT_NOEXCEPT {
    +
    177  return base_type::length;
    +
    178  }
    +
    179 
    +
    184  [[nodiscard]] constexpr const value_type *data() const ENTT_NOEXCEPT {
    +
    185  return base_type::repr;
    +
    186  }
    +
    187 
    +
    192  [[nodiscard]] constexpr hash_type value() const ENTT_NOEXCEPT {
    +
    193  return base_type::hash;
    +
    194  }
    195 
    -
    206 template<typename Char, std::size_t N>
    -
    207 basic_hashed_string(const Char (&str)[N]) -> basic_hashed_string<Char>;
    -
    208 
    +
    197  [[nodiscard]] constexpr operator const value_type *() const ENTT_NOEXCEPT {
    +
    198  return data();
    +
    199  }
    +
    200 
    +
    205  [[nodiscard]] constexpr operator hash_type() const ENTT_NOEXCEPT {
    +
    206  return value();
    +
    207  }
    +
    208 };
    +
    209 
    216 template<typename Char>
    -
    217 [[nodiscard]] constexpr bool operator==(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    -
    218  return lhs.value() == rhs.value();
    -
    219 }
    -
    220 
    -
    228 template<typename Char>
    -
    229 [[nodiscard]] constexpr bool operator!=(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    -
    230  return !(lhs == rhs);
    -
    231 }
    -
    232 
    -
    240 template<typename Char>
    -
    241 [[nodiscard]] constexpr bool operator<(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    -
    242  return lhs.value() < rhs.value();
    -
    243 }
    -
    244 
    -
    253 template<typename Char>
    -
    254 [[nodiscard]] constexpr bool operator<=(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    -
    255  return !(rhs < lhs);
    -
    256 }
    -
    257 
    -
    266 template<typename Char>
    -
    267 [[nodiscard]] constexpr bool operator>(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    -
    268  return rhs < lhs;
    -
    269 }
    -
    270 
    -
    279 template<typename Char>
    -
    280 [[nodiscard]] constexpr bool operator>=(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    -
    281  return !(lhs < rhs);
    -
    282 }
    -
    283 
    -
    285 using hashed_string = basic_hashed_string<char>;
    -
    286 
    -
    288 using hashed_wstring = basic_hashed_string<wchar_t>;
    +
    217 basic_hashed_string(const Char *str, const std::size_t len) -> basic_hashed_string<Char>;
    +
    218 
    +
    225 template<typename Char, std::size_t N>
    +
    226 basic_hashed_string(const Char (&str)[N]) -> basic_hashed_string<Char>;
    +
    227 
    +
    235 template<typename Char>
    +
    236 [[nodiscard]] constexpr bool operator==(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    +
    237  return lhs.value() == rhs.value();
    +
    238 }
    +
    239 
    +
    247 template<typename Char>
    +
    248 [[nodiscard]] constexpr bool operator!=(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    +
    249  return !(lhs == rhs);
    +
    250 }
    +
    251 
    +
    259 template<typename Char>
    +
    260 [[nodiscard]] constexpr bool operator<(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    +
    261  return lhs.value() < rhs.value();
    +
    262 }
    +
    263 
    +
    272 template<typename Char>
    +
    273 [[nodiscard]] constexpr bool operator<=(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    +
    274  return !(rhs < lhs);
    +
    275 }
    +
    276 
    +
    285 template<typename Char>
    +
    286 [[nodiscard]] constexpr bool operator>(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    +
    287  return rhs < lhs;
    +
    288 }
    289 
    -
    290 inline namespace literals {
    -
    291 
    -
    297 [[nodiscard]] constexpr entt::hashed_string operator"" _hs(const char *str, std::size_t) ENTT_NOEXCEPT {
    -
    298  return entt::hashed_string{str};
    -
    299 }
    -
    300 
    -
    306 [[nodiscard]] constexpr entt::hashed_wstring operator"" _hws(const wchar_t *str, std::size_t) ENTT_NOEXCEPT {
    -
    307  return entt::hashed_wstring{str};
    -
    308 }
    -
    309 
    -
    310 } // namespace literals
    -
    311 
    -
    312 } // namespace entt
    -
    313 
    -
    314 #endif
    -
    entt::basic_hashed_string
    Zero overhead unique identifier.
    Definition: hashed_string.hpp:58
    -
    entt::basic_hashed_string::basic_hashed_string
    constexpr basic_hashed_string(const value_type(&curr)[N])
    Constructs a hashed string from an array of const characters.
    Definition: hashed_string.hpp:145
    -
    entt::basic_hashed_string::hash_type
    id_type hash_type
    Unsigned integer type.
    Definition: hashed_string.hpp:82
    -
    entt::basic_hashed_string::data
    constexpr const value_type * data() const
    Returns the human-readable representation of a hashed string.
    Definition: hashed_string.hpp:166
    -
    entt::basic_hashed_string::value
    static hash_type value(const_wrapper wrapper)
    Returns directly the numeric representation of a string.
    Definition: hashed_string.hpp:121
    -
    entt::basic_hashed_string::value
    constexpr hash_type value() const
    Returns the numeric representation of a hashed string.
    Definition: hashed_string.hpp:174
    -
    entt::basic_hashed_string::basic_hashed_string
    constexpr basic_hashed_string(const_wrapper wrapper)
    Explicit constructor on purpose to avoid constructing a hashed string directly from a const value_typ...
    Definition: hashed_string.hpp:158
    -
    entt::basic_hashed_string::value
    static constexpr hash_type value(const value_type(&str)[N])
    Returns directly the numeric representation of a string.
    Definition: hashed_string.hpp:112
    -
    entt::basic_hashed_string::basic_hashed_string
    constexpr basic_hashed_string()
    Constructs an empty hashed string.
    Definition: hashed_string.hpp:126
    -
    entt::basic_hashed_string::value
    static constexpr hash_type value(const value_type *str, std::size_t size)
    Returns directly the numeric representation of a string view.
    Definition: hashed_string.hpp:90
    -
    entt::basic_hashed_string::value_type
    Char value_type
    Character type.
    Definition: hashed_string.hpp:80
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:217
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    -
    entt::operator<=
    constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:254
    -
    entt::operator>=
    constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:280
    -
    entt::operator<
    constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:241
    -
    entt::basic_hashed_string
    basic_hashed_string(const Char(&str)[N]) -> basic_hashed_string< Char >
    Deduction guide.
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    -
    entt::operator>
    constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:267
    +
    298 template<typename Char>
    +
    299 [[nodiscard]] constexpr bool operator>=(const basic_hashed_string<Char> &lhs, const basic_hashed_string<Char> &rhs) ENTT_NOEXCEPT {
    +
    300  return !(lhs < rhs);
    +
    301 }
    +
    302 
    +
    304 using hashed_string = basic_hashed_string<char>;
    +
    305 
    +
    307 using hashed_wstring = basic_hashed_string<wchar_t>;
    +
    308 
    +
    309 inline namespace literals {
    +
    310 
    +
    316 [[nodiscard]] constexpr hashed_string operator"" _hs(const char *str, std::size_t) ENTT_NOEXCEPT {
    +
    317  return hashed_string{str};
    +
    318 }
    +
    319 
    +
    325 [[nodiscard]] constexpr hashed_wstring operator"" _hws(const wchar_t *str, std::size_t) ENTT_NOEXCEPT {
    +
    326  return hashed_wstring{str};
    +
    327 }
    +
    328 
    +
    329 } // namespace literals
    +
    330 
    +
    331 } // namespace entt
    +
    332 
    +
    333 #endif
    +
    entt::basic_hashed_string
    Zero overhead unique identifier.
    Definition: hashed_string.hpp:69
    +
    entt::basic_hashed_string::value_type
    typename base_type::value_type value_type
    Character type.
    Definition: hashed_string.hpp:103
    +
    entt::basic_hashed_string::data
    constexpr const value_type * data() const
    Returns the human-readable representation of a hashed string.
    Definition: hashed_string.hpp:184
    +
    entt::basic_hashed_string::value
    static constexpr hash_type value(const_wrapper wrapper)
    Returns directly the numeric representation of a string.
    Definition: hashed_string.hpp:135
    +
    entt::basic_hashed_string::value
    constexpr hash_type value() const
    Returns the numeric representation of a hashed string.
    Definition: hashed_string.hpp:192
    +
    entt::basic_hashed_string::size_type
    typename base_type::size_type size_type
    Unsigned integer type.
    Definition: hashed_string.hpp:105
    +
    entt::basic_hashed_string::value
    static constexpr hash_type value(const value_type *str, const size_type len)
    Returns directly the numeric representation of a string view.
    Definition: hashed_string.hpp:115
    +
    entt::basic_hashed_string::basic_hashed_string
    constexpr basic_hashed_string(const_wrapper wrapper)
    Explicit constructor on purpose to avoid constructing a hashed string directly from a const value_typ...
    Definition: hashed_string.hpp:169
    +
    entt::basic_hashed_string::value
    static constexpr hash_type value(const value_type(&str)[N])
    Returns directly the numeric representation of a string.
    Definition: hashed_string.hpp:126
    +
    entt::basic_hashed_string::size
    constexpr size_type size() const
    Returns the size a hashed string.
    Definition: hashed_string.hpp:176
    +
    entt::basic_hashed_string::hash_type
    typename base_type::hash_type hash_type
    Unsigned integer type.
    Definition: hashed_string.hpp:107
    +
    entt::basic_hashed_string::basic_hashed_string
    constexpr basic_hashed_string(const value_type *str, const size_type len)
    Constructs a hashed string from a string view.
    Definition: hashed_string.hpp:148
    +
    entt::basic_hashed_string::basic_hashed_string
    constexpr basic_hashed_string()
    Constructs an empty hashed string.
    Definition: hashed_string.hpp:140
    +
    entt::basic_hashed_string::basic_hashed_string
    constexpr basic_hashed_string(const value_type(&str)[N])
    Constructs a hashed string from an array of const characters.
    Definition: hashed_string.hpp:157
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    +
    entt::basic_hashed_string
    basic_hashed_string(const Char *str, const std::size_t len) -> basic_hashed_string< Char >
    Deduction guide.
    +
    entt::operator<=
    constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:273
    +
    entt::operator>=
    constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:299
    +
    entt::operator<
    constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:260
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    +
    entt::operator>
    constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:286
    diff --git a/helper_8hpp_source.html b/helper_8hpp_source.html index 635560240..59d0f9320 100644 --- a/helper_8hpp_source.html +++ b/helper_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -158,18 +158,18 @@ $(function() {
    155 
    156 #endif
    entt::basic_group
    Group.
    Definition: fwd.hpp:26
    -
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:173
    +
    entt::basic_registry
    Fast and reliable entity-component system.
    Definition: registry.hpp:221
    entt::basic_sparse_set
    Basic sparse set implementation.
    Definition: sparse_set.hpp:174
    -
    entt::basic_sparse_set::rend
    reverse_iterator rend() const
    Returns a reverse iterator to the end.
    Definition: sparse_set.hpp:558
    -
    entt::basic_sparse_set::rbegin
    const_reverse_iterator rbegin() const
    Returns a reverse iterator to the beginning.
    Definition: sparse_set.hpp:539
    -
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:237
    -
    entt::basic_storage::get
    const value_type & get(const entity_type entt) const
    Returns the object assigned to an entity.
    Definition: storage.hpp:651
    +
    entt::basic_sparse_set::rend
    reverse_iterator rend() const
    Returns a reverse iterator to the end.
    Definition: sparse_set.hpp:552
    +
    entt::basic_sparse_set::rbegin
    const_reverse_iterator rbegin() const
    Returns a reverse iterator to the beginning.
    Definition: sparse_set.hpp:533
    +
    entt::basic_storage
    Basic storage implementation.
    Definition: storage.hpp:234
    +
    entt::basic_storage::get
    const value_type & get(const entity_type entt) const
    Returns the object assigned to an entity.
    Definition: storage.hpp:625
    entt::basic_view
    View implementation.
    Definition: fwd.hpp:20
    -
    entt::delegate
    Basic delegate implementation.
    Definition: delegate.hpp:66
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::member_class_t
    typename member_class< Member >::type member_class_t
    Helper type.
    Definition: type_traits.hpp:674
    +
    entt::delegate
    Basic delegate implementation.
    Definition: delegate.hpp:67
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::member_class_t
    typename member_class< Member >::type member_class_t
    Helper type.
    Definition: type_traits.hpp:647
    entt::as_group
    as_group(basic_registry< Entity > &) -> as_group< Entity >
    Deduction guide.
    -
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:645
    +
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:618
    entt::get
    constexpr get_t< Type... > get
    Variable template for lists of observed components.
    Definition: utility.hpp:34
    entt::invoke
    void invoke(basic_registry< Entity > &reg, const Entity entt)
    Helper to create a listener that directly invokes a member function.
    Definition: helper.hpp:119
    entt::storage
    basic_storage< entity, Args... > storage
    Alias declaration for the most common use case.
    Definition: fwd.hpp:57
    diff --git a/hierarchy.html b/hierarchy.html index 32fd56d89..53341c422 100644 --- a/hierarchy.html +++ b/hierarchy.html @@ -22,7 +22,7 @@     @@ -71,106 +71,108 @@ $(function() { This inheritance list is sorted roughly, but not completely, alphabetically:
    [detail level 123]
    + + + @@ -433,38 +697,46 @@ template<typename Resource >
    size_type entt::resource_cache< Type, Loader, Allocator >::erase ( const id_type  id)
    -

    Creates a handle for a given resource identifier.

    -

    A resource handle can be in a either valid or invalid state. In other terms, a resource handle is properly initialized with a resource if the cache contains the resource itself. Otherwise the returned handle is uninitialized and accessing it results in undefined behavior.

    -
    See also
    resource_handle
    +

    Removes the given elements from a cache.

    Parameters
    idUnique resource identifier.
    -
    Returns
    A handle for the given resource.
    +
    Returns
    Number of resources erased (either 0 or 1).
    -

    Definition at line 173 of file cache.hpp.

    +

    Definition at line 406 of file cache.hpp.

    - -

    ◆ handle() [2/2]

    + +

    ◆ erase() [2/3]

    -template<typename Resource >
    +template<typename Type , typename Loader , typename Allocator >
    @@ -474,36 +746,74 @@ template<typename Resource >
    - + - - - + + + + + + + + + + + + +
    resource_handle<const resource_type> entt::resource_cache< Resource >::handle iterator entt::resource_cache< Type, Loader, Allocator >::erase (const id_type id) constconst_iterator first,
    const_iterator last 
    )
    -

    Creates a handle for a given resource identifier.

    -

    A resource handle can be in a either valid or invalid state. In other terms, a resource handle is properly initialized with a resource if the cache contains the resource itself. Otherwise the returned handle is uninitialized and accessing it results in undefined behavior.

    -
    See also
    resource_handle
    +

    Removes the given elements from a cache.

    Parameters
    - + +
    idUnique resource identifier.
    firstAn iterator to the first element of the range of elements.
    lastAn iterator past the last element of the range of elements.
    -
    Returns
    A handle for the given resource.
    +
    Returns
    An iterator following the last removed element.
    -

    Definition at line 164 of file cache.hpp.

    +

    Definition at line 396 of file cache.hpp.

    - -

    ◆ load()

    + +

    ◆ erase() [3/3]

    -template<typename Resource >
    -
    -template<typename Loader , typename... Args>
    +template<typename Type , typename Loader , typename Allocator >
    + + +
    - + + + + + + +
    resource_handle<resource_type> entt::resource_cache< Resource >::load iterator entt::resource_cache< Type, Loader, Allocator >::erase (const_iterator pos)
    +     		+inline
    +
    + +

    Removes an element from a given position.

    +
    Parameters
    + + +
    posAn iterator to the element to remove.
    +
    +
    +
    Returns
    An iterator following the removed element.
    + +

    Definition at line 385 of file cache.hpp.

    + +
    + + +

    ◆ force_load()

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    +
    +template<typename... Args>
    + + +
    + + + @@ -527,13 +837,11 @@ template<typename Loader , typename... Args>
    std::pair<iterator, bool> entt::resource_cache< Type, Loader, Allocator >::force_load ( const id_type  id,
    -

    Loads the resource that corresponds to a given identifier.

    -

    In case an identifier isn't already present in the cache, it loads its resource and stores it aside for future uses. Arguments are forwarded directly to the loader in order to construct properly the requested resource.

    -
    Note
    If the identifier is already present in the cache, this function does nothing and the arguments are simply discarded.
    -
    Warning
    If the resource cannot be loaded correctly, the returned handle will be invalid and any use of it will result in undefined behavior.
    +

    Force loads a resource, if its identifier does not exist.

    +

    Arguments are forwarded directly to the loader and consumed only if the resource doesn't already exist.

    +
    Warning
    If the resource isn't loaded correctly, the returned handle could be invalid and any use of it will result in undefined behavior.
    Template Parameters
    -
    LoaderType of loader to use to load the resource if required.
    ArgsTypes of arguments to use to load the resource if required.
    @@ -545,27 +853,182 @@ template<typename Loader , typename... Args>
    -
    Returns
    A handle for the given resource.
    +
    Returns
    A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
    -

    Definition at line 94 of file cache.hpp.

    +

    Definition at line 340 of file cache.hpp.

    - -

    ◆ operator=()

    + +

    ◆ get_allocator()

    -template<typename Resource >
    +template<typename Type , typename Loader , typename Allocator >
    + + +
    - + - + + + +
    resource_cache& entt::resource_cache< Resource >::operator= constexpr allocator_type entt::resource_cache< Type, Loader, Allocator >::get_allocator (resource_cache< Resource > && ) const
    +     		+inlineconstexpr
    +
    + +

    Returns the associated allocator.

    +
    Returns
    The associated allocator.
    + +

    Definition at line 238 of file cache.hpp.

    + +
    + + +

    ◆ load()

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    +
    +template<typename... Args>
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    std::pair<iterator, bool> entt::resource_cache< Type, Loader, Allocator >::load (const id_type id,
    Args &&... args 
    )
    +     		+inline
    +
    + +

    Loads a resource, if its identifier does not exist.

    +

    Arguments are forwarded directly to the loader and consumed only if the resource doesn't already exist.

    +
    Warning
    If the resource isn't loaded correctly, the returned handle could be invalid and any use of it will result in undefined behavior.
    +
    Template Parameters
    + + +
    ArgsTypes of arguments to use to load the resource if required.
    +
    +
    +
    Parameters
    + + + +
    idUnique resource identifier.
    argsArguments to use to load the resource if required.
    +
    +
    +
    Returns
    A pair consisting of an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.
    + +

    Definition at line 327 of file cache.hpp.

    + +
    +
    + +

    ◆ loader()

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + +
    loader_type entt::resource_cache< Type, Loader, Allocator >::loader () const
    +     		+inline
    +
    + +

    Returns the loader used to create resources.

    +
    Returns
    The loader used to create resources.
    + +

    Definition at line 414 of file cache.hpp.

    + +
    +
    + +

    ◆ operator=() [1/2]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + + + +
    + + + + + + + + +
    resource_cache& entt::resource_cache< Type, Loader, Allocator >::operator= (const resource_cache< Type, Loader, Allocator > & )
    +     		+default
    +
    + +

    Default copy assignment operator.

    +
    Returns
    This cache.
    + +
    +
    + +

    ◆ operator=() [2/2]

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + @@ -78,7 +78,7 @@ $(function() {

    Mixin type used to add signal support to storage types. More...

    -

    #include <storage.hpp>

    +

    #include <sigh_storage_mixin.hpp>

    Inheritance diagram for entt::sigh_storage_mixin< Type >:
    @@ -100,10 +100,6 @@ Collaboration diagram for entt::sigh_storage_mixin< Type >:
    + + + + + @@ -582,35 +1045,23 @@ template<typename Resource > - -

    ◆ reload()

    + +

    ◆ operator[]() [1/2]

    -template<typename Resource >
    -
    -template<typename Loader , typename... Args>
    +template<typename Type , typename Loader , typename Allocator >
    resource_cache& entt::resource_cache< Type, Loader, Allocator >::operator= (resource_cache< Type, Loader, Allocator > &&  )
    @@ -620,45 +1071,75 @@ template<typename Loader , typename... Args>
    - + - - - - + - - - - - - -
    resource_handle<resource_type> entt::resource_cache< Resource >::reload resource<value_type> entt::resource_cache< Type, Loader, Allocator >::operator[] ( const id_type id,
    id) Args &&... args 
    )
    -

    Reloads a resource or loads it for the first time if not present.

    -

    Equivalent to the following snippet (pseudocode):

    -
    cache.discard(id);
    -
    cache.load(id, args...);
    -

    Arguments are forwarded directly to the loader in order to construct properly the requested resource.

    -
    Warning
    If the resource cannot be loaded correctly, the returned handle will be invalid and any use of it will result in undefined behavior.
    -
    Template Parameters
    - - - -
    LoaderType of loader to use to load the resource.
    ArgsTypes of arguments to use to load the resource.
    -
    -
    +

    Returns a handle for a given resource identifier.

    +
    Warning
    There is no guarantee that the returned handle is valid.
    + If it is not, any use will result in indefinite behavior.
    Parameters
    -
    idUnique resource identifier.
    argsArguments to use to load the resource.
    Returns
    A handle for the given resource.
    -

    Definition at line 130 of file cache.hpp.

    +

    Definition at line 363 of file cache.hpp.

    - -

    ◆ size()

    + +

    ◆ operator[]() [2/2]

    -template<typename Resource >
    +template<typename Type , typename Loader , typename Allocator >
    + + +
    - + + + + + + +
    size_type entt::resource_cache< Resource >::size resource<const value_type> entt::resource_cache< Type, Loader, Allocator >::operator[] (const id_type id) const
    +     		+inline
    +
    + +

    Returns a handle for a given resource identifier.

    +
    Warning
    There is no guarantee that the returned handle is valid.
    + If it is not, any use will result in indefinite behavior.
    +
    Parameters
    + + +
    idUnique resource identifier.
    +
    +
    +
    Returns
    A handle for the given resource.
    + +

    Definition at line 354 of file cache.hpp.

    + +
    + + +

    ◆ size()

    + +
    +
    +
    +template<typename Type , typename Loader , typename Allocator >
    + + + diff --git a/classentt_1_1scheduler.html b/classentt_1_1scheduler.html index 7d3c7fe41..5aaeed5d7 100644 --- a/classentt_1_1scheduler.html +++ b/classentt_1_1scheduler.html @@ -22,7 +22,7 @@ @@ -147,7 +147,7 @@ class entt::scheduler< Delta > -

    Definition at line 41 of file scheduler.hpp.

    +

    Definition at line 42 of file scheduler.hpp.

    Member Function Documentation

    ◆ abort()

    @@ -185,7 +185,7 @@ template<typename Delta > -

    Definition at line 272 of file scheduler.hpp.

    +

    Definition at line 270 of file scheduler.hpp.

    @@ -243,7 +243,7 @@ template<typename Proc , typename... Args>
    Returns
    An opaque object to use to concatenate processes.
    -

    Definition at line 171 of file scheduler.hpp.

    +

    Definition at line 172 of file scheduler.hpp.

    @@ -315,7 +315,7 @@ template<typename Func >
    Returns
    An opaque object to use to concatenate processes.
    -

    Definition at line 232 of file scheduler.hpp.

    +

    Definition at line 233 of file scheduler.hpp.

    @@ -347,7 +347,7 @@ template<typename Delta >

    Discards all scheduled processes.

    Processes aren't aborted. They are discarded along with their children and never executed again.

    -

    Definition at line 141 of file scheduler.hpp.

    +

    Definition at line 142 of file scheduler.hpp.

    @@ -379,7 +379,7 @@ template<typename Delta >

    Returns true if at least a process is currently scheduled.

    Returns
    True if there are scheduled processes, false otherwise.
    -

    Definition at line 131 of file scheduler.hpp.

    +

    Definition at line 132 of file scheduler.hpp.

    @@ -442,7 +442,7 @@ template<typename Delta >

    Number of processes currently scheduled.

    Returns
    Number of processes currently scheduled.
    -

    Definition at line 123 of file scheduler.hpp.

    +

    Definition at line 124 of file scheduler.hpp.

    @@ -493,7 +493,7 @@ template<typename Delta > -

    Definition at line 248 of file scheduler.hpp.

    +

    Definition at line 249 of file scheduler.hpp.

    diff --git a/classentt_1_1sigh.html b/classentt_1_1sigh.html index 32693d411..6e562a339 100644 --- a/classentt_1_1sigh.html +++ b/classentt_1_1sigh.html @@ -22,7 +22,7 @@ @@ -74,7 +74,7 @@ $(function() {

    Unmanaged signal handler. More...

    Detailed Description

    -

    template<typename Type, typename = std::allocator<delegate<Type>>>
    +

    template<typename Type, typename = std::allocator<Type *>>
    class entt::sigh< Type, typename >

    Unmanaged signal handler.

    @@ -87,7 +87,7 @@ class entt::sigh< Type, typename >

    -

    Definition at line 24 of file fwd.hpp.

    +

    Definition at line 25 of file fwd.hpp.

    The documentation for this class was generated from the following file: diff --git a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4-members.html b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4-members.html index 2b1b60852..fa7bf76b6 100644 --- a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4-members.html +++ b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html index 61a306293..411906afd 100644 --- a/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html +++ b/classentt_1_1sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4.html @@ -22,7 +22,7 @@ @@ -110,22 +110,22 @@ Public Member Functions - + - + - + - + @@ -174,7 +174,7 @@ class entt::sigh< Ret(Args...), Allocator > -

    Definition at line 56 of file sigh.hpp.

    +

    Definition at line 55 of file sigh.hpp.

    Member Typedef Documentation

    ◆ instance_type

    @@ -200,7 +200,7 @@ template<typename Class > -

    Definition at line 157 of file sigh.hpp.

    +

    Definition at line 154 of file sigh.hpp.

    @@ -239,7 +239,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 82 of file sigh.hpp.

    +

    Definition at line 79 of file sigh.hpp.

    @@ -269,7 +269,7 @@ template<typename Ret , typename... Args, typename Allocator >
    + + + @@ -674,56 +1155,7 @@ template<typename Resource >

    Number of resources managed by a cache.

    Returns
    Number of resources currently stored.
    -

    Definition at line 49 of file cache.hpp.

    - - - - -

    ◆ temp()

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Loader , typename... Args>
    -
    size_type entt::resource_cache< Type, Loader, Allocator >::size ( ) const
    - - - - -
    - - - - - - - - -
    resource_handle<resource_type> entt::resource_cache< Resource >::temp (Args &&... args) const
    -     		-inline
    -
    - -

    Creates a temporary handle for a resource.

    -

    Arguments are forwarded directly to the loader in order to construct properly the requested resource. The handle isn't stored aside and the cache isn't in charge of the lifetime of the resource itself.

    -
    Template Parameters
    - - - -
    LoaderType of loader to use to load the resource.
    ArgsTypes of arguments to use to load the resource.
    -
    -
    -
    Parameters
    - - -
    argsArguments to use to load the resource.
    -
    -
    -
    Returns
    A handle for the given resource.
    - -

    Definition at line 147 of file cache.hpp.

    +

    Definition at line 300 of file cache.hpp.

    diff --git a/classentt_1_1resource__handle-members.html b/classentt_1_1resource__handle-members.html deleted file mode 100644 index c597c3143..000000000 --- a/classentt_1_1resource__handle-members.html +++ /dev/null @@ -1,102 +0,0 @@ - - - - - - - -EnTT: Member List - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -
    entt::resource_handle< Resource > Member List
    -
    -
    - -

    This is the complete list of members for entt::resource_handle< Resource >, including all inherited members.

    - - - - - - - - - - - - - - - - - - - - - -
    get() constentt::resource_handle< Resource >inline
    operator bool() constentt::resource_handle< Resource >inlineexplicit
    operator resource_type &() constentt::resource_handle< Resource >inline
    operator*() constentt::resource_handle< Resource >inline
    operator->() constentt::resource_handle< Resource >inline
    operator=(const resource_handle &other)=defaultentt::resource_handle< Resource >
    operator=(resource_handle &&other)=defaultentt::resource_handle< Resource >
    operator=(const resource_handle< Other > &other)entt::resource_handle< Resource >inline
    operator=(resource_handle< Other > &&other)entt::resource_handle< Resource >inline
    resource_handle classentt::resource_handle< Resource >friend
    resource_handle()=defaultentt::resource_handle< Resource >
    resource_handle(std::shared_ptr< resource_type > res)entt::resource_handle< Resource >inline
    resource_handle(const resource_handle &other)=defaultentt::resource_handle< Resource >
    resource_handle(resource_handle &&other)=defaultentt::resource_handle< Resource >
    resource_handle(const resource_handle< Other > &other, resource_type &res) noexceptentt::resource_handle< Resource >inline
    resource_handle(const resource_handle< Other > &other)entt::resource_handle< Resource >inline
    resource_handle(resource_handle< Other > &&other)entt::resource_handle< Resource >inline
    resource_type typedefentt::resource_handle< Resource >
    size_type typedefentt::resource_handle< Resource >
    use_count() constentt::resource_handle< Resource >inline
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1resource__handle.html b/classentt_1_1resource__handle.html deleted file mode 100644 index 36710a2fa..000000000 --- a/classentt_1_1resource__handle.html +++ /dev/null @@ -1,813 +0,0 @@ - - - - - - - -EnTT: entt::resource_handle< Resource > Class Template Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -Public Types | -Public Member Functions | -Friends | -List of all members
    -
    -
    entt::resource_handle< Resource > Class Template Reference
    -
    -
    - -

    Shared resource handle. - More...

    - -

    #include <handle.hpp>

    - - - - - - - - -

    -Public Types

    -using size_type = long
     Unsigned integer type.
     
    -using resource_type = Resource
     Type of resources managed by a cache.
     
    - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -

    -Public Member Functions

    - resource_handle ()=default
     Default constructor.
     
     resource_handle (std::shared_ptr< resource_type > res)
     Creates a handle from a shared pointer, namely a resource. More...
     
     resource_handle (const resource_handle &other)=default
     Copy constructor. More...
     
     resource_handle (resource_handle &&other)=default
     Move constructor. More...
     
    template<typename Other >
     resource_handle (const resource_handle< Other > &other, resource_type &res) noexcept
     Aliasing constructor. More...
     
    template<typename Other , typename = std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>>>
     resource_handle (const resource_handle< Other > &other)
     Copy constructs a handle which shares ownership of the resource. More...
     
    template<typename Other , typename = std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>>>
     resource_handle (resource_handle< Other > &&other)
     Move constructs a handle which takes ownership of the resource. More...
     
    resource_handle & operator= (const resource_handle &other)=default
     Copy assignment operator. More...
     
    resource_handle & operator= (resource_handle &&other)=default
     Move assignment operator. More...
     
    template<typename Other >
    std::enable_if_t<!std::is_same_v< resource_type, Other > &&std::is_base_of_v< resource_type, Other >, resource_handle & > operator= (const resource_handle< Other > &other)
     Copy assignment operator from foreign handle. More...
     
    template<typename Other >
    std::enable_if_t<!std::is_same_v< resource_type, Other > &&std::is_base_of_v< resource_type, Other >, resource_handle & > operator= (resource_handle< Other > &&other)
     Move assignment operator from foreign handle. More...
     
    resource_type & get () const
     Gets a reference to the managed resource. More...
     
     operator resource_type & () const
     Gets a reference to the managed resource. More...
     
    resource_type & operator* () const
     Gets a reference to the managed resource. More...
     
    resource_type * operator-> () const
     Gets a pointer to the managed resource. More...
     
     operator bool () const
     Returns true if a handle contains a resource, false otherwise. More...
     
    size_type use_count () const
     Returns the number of handles pointing the same resource. More...
     
    - - - - - -

    -Friends

    -template<typename >
    class resource_handle
     Resource handles are friends with each other.
     
    -

    Detailed Description

    -

    template<typename Resource>
    -class entt::resource_handle< Resource >

    - -

    Shared resource handle.

    -

    A shared resource handle is a small class that wraps a resource and keeps it alive even if it's deleted from the cache. It can be either copied or moved. A handle shares a reference to the same resource with all the other handles constructed for the same identifier.
    - As a rule of thumb, resources should never be copied nor moved. Handles are the way to go to keep references to them.

    -
    Template Parameters
    - - -
    ResourceType of resource managed by a handle.
    -
    -
    - -

    Definition at line 25 of file handle.hpp.

    -

    Constructor & Destructor Documentation

    - -

    ◆ resource_handle() [1/6]

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - - -
    entt::resource_handle< Resource >::resource_handle (std::shared_ptr< resource_type > res)
    -     		-inline
    -
    - -

    Creates a handle from a shared pointer, namely a resource.

    -
    Parameters
    - - -
    resA pointer to a properly initialized resource.
    -
    -
    - -

    Definition at line 43 of file handle.hpp.

    - -
    -
    - -

    ◆ resource_handle() [2/6]

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - - -
    entt::resource_handle< Resource >::resource_handle (const resource_handle< Resource > & other)
    -     		-default
    -
    - -

    Copy constructor.

    -
    Parameters
    - - -
    otherThe instance to copy from.
    -
    -
    - -
    -
    - -

    ◆ resource_handle() [3/6]

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - - -
    entt::resource_handle< Resource >::resource_handle (resource_handle< Resource > && other)
    -     		-default
    -
    - -

    Move constructor.

    -
    Parameters
    - - -
    otherThe instance to move from.
    -
    -
    - -
    -
    - -

    ◆ resource_handle() [4/6]

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Other >
    - - - - - -
    - - - - - - - - - - - - - - - - - - -
    entt::resource_handle< Resource >::resource_handle (const resource_handle< Other > & other,
    resource_type & res 
    )
    -     		-inlinenoexcept
    -
    - -

    Aliasing constructor.

    -
    Template Parameters
    - - -
    OtherType of resource managed by the received handle.
    -
    -
    -
    Parameters
    - - - -
    otherThe handle with which to share ownership information.
    resUnrelated and unmanaged resources.
    -
    -
    - -

    Definition at line 65 of file handle.hpp.

    - -
    -
    - -

    ◆ resource_handle() [5/6]

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Other , typename = std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>>>
    - - - - - -
    - - - - - - - - -
    entt::resource_handle< Resource >::resource_handle (const resource_handle< Other > & other)
    -     		-inline
    -
    - -

    Copy constructs a handle which shares ownership of the resource.

    -
    Template Parameters
    - - -
    OtherType of resource managed by the received handle.
    -
    -
    -
    Parameters
    - - -
    otherThe handle to copy from.
    -
    -
    - -

    Definition at line 74 of file handle.hpp.

    - -
    -
    - -

    ◆ resource_handle() [6/6]

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Other , typename = std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>>>
    - - - - - -
    - - - - - - - - -
    entt::resource_handle< Resource >::resource_handle (resource_handle< Other > && other)
    -     		-inline
    -
    - -

    Move constructs a handle which takes ownership of the resource.

    -
    Template Parameters
    - - -
    OtherType of resource managed by the received handle.
    -
    -
    -
    Parameters
    - - -
    otherThe handle to move from.
    -
    -
    - -

    Definition at line 83 of file handle.hpp.

    - -
    -
    -

    Member Function Documentation

    - -

    ◆ get()

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - -
    resource_type& entt::resource_handle< Resource >::get () const
    -     		-inline
    -
    - -

    Gets a reference to the managed resource.

    -
    Warning
    The behavior is undefined if the handle doesn't contain a resource.
    -
    Returns
    A reference to the managed resource.
    - -

    Definition at line 134 of file handle.hpp.

    - -
    -
    - -

    ◆ operator bool()

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - -
    entt::resource_handle< Resource >::operator bool () const
    -     		-inlineexplicit
    -
    - -

    Returns true if a handle contains a resource, false otherwise.

    -
    Returns
    True if the handle contains a resource, false otherwise.
    - -

    Definition at line 165 of file handle.hpp.

    - -
    -
    - -

    ◆ operator resource_type &()

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - -
    entt::resource_handle< Resource >::operator resource_type & () const
    -     		-inline
    -
    - -

    Gets a reference to the managed resource.

    -
    Warning
    The behavior is undefined if the handle doesn't contain a resource.
    -
    Returns
    A reference to the managed resource.
    - -

    Definition at line 139 of file handle.hpp.

    - -
    -
    - -

    ◆ operator*()

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - -
    resource_type& entt::resource_handle< Resource >::operator* () const
    -     		-inline
    -
    - -

    Gets a reference to the managed resource.

    -
    Warning
    The behavior is undefined if the handle doesn't contain a resource.
    -
    Returns
    A reference to the managed resource.
    - -

    Definition at line 144 of file handle.hpp.

    - -
    -
    - -

    ◆ operator->()

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - -
    resource_type* entt::resource_handle< Resource >::operator-> () const
    -     		-inline
    -
    - -

    Gets a pointer to the managed resource.

    -
    Warning
    The behavior is undefined if the handle doesn't contain a resource.
    -
    Returns
    A pointer to the managed resource or nullptr if the handle contains no resource at all.
    - -

    Definition at line 157 of file handle.hpp.

    - -
    -
    - -

    ◆ operator=() [1/4]

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - - -
    resource_handle& entt::resource_handle< Resource >::operator= (const resource_handle< Resource > & other)
    -     		-default
    -
    - -

    Copy assignment operator.

    -
    Parameters
    - - -
    otherThe instance to copy from.
    -
    -
    -
    Returns
    This resource handle.
    - -
    -
    - -

    ◆ operator=() [2/4]

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Other >
    - - - - - -
    - - - - - - - - -
    std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>, resource_handle &> entt::resource_handle< Resource >::operator= (const resource_handle< Other > & other)
    -     		-inline
    -
    - -

    Copy assignment operator from foreign handle.

    -
    Template Parameters
    - - -
    OtherType of resource managed by the received handle.
    -
    -
    -
    Parameters
    - - -
    otherThe handle to copy from.
    -
    -
    -
    Returns
    This resource handle.
    - -

    Definition at line 108 of file handle.hpp.

    - -
    -
    - -

    ◆ operator=() [3/4]

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - - -
    resource_handle& entt::resource_handle< Resource >::operator= (resource_handle< Resource > && other)
    -     		-default
    -
    - -

    Move assignment operator.

    -
    Parameters
    - - -
    otherThe instance to move from.
    -
    -
    -
    Returns
    This resource handle.
    - -
    -
    - -

    ◆ operator=() [4/4]

    - -
    -
    -
    -template<typename Resource >
    -
    -template<typename Other >
    - - - - - -
    - - - - - - - - -
    std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>, resource_handle &> entt::resource_handle< Resource >::operator= (resource_handle< Other > && other)
    -     		-inline
    -
    - -

    Move assignment operator from foreign handle.

    -
    Template Parameters
    - - -
    OtherType of resource managed by the received handle.
    -
    -
    -
    Parameters
    - - -
    otherThe handle to move from.
    -
    -
    -
    Returns
    This resource handle.
    - -

    Definition at line 121 of file handle.hpp.

    - -
    -
    - -

    ◆ use_count()

    - -
    -
    -
    -template<typename Resource >
    - - - - - -
    - - - - - - - -
    size_type entt::resource_handle< Resource >::use_count () const
    -     		-inline
    -
    - -

    Returns the number of handles pointing the same resource.

    -
    Returns
    The number of handles pointing the same resource.
    - -

    Definition at line 173 of file handle.hpp.

    - -
    -
    -
    The documentation for this class was generated from the following files: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1resource__loader.html b/classentt_1_1resource__loader.html deleted file mode 100644 index ee8965e79..000000000 --- a/classentt_1_1resource__loader.html +++ /dev/null @@ -1,127 +0,0 @@ - - - - - - - -EnTT: entt::resource_loader< Loader, Resource > Class Template Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -Friends | -List of all members
    -
    -
    entt::resource_loader< Loader, Resource > Class Template Reference
    -
    -
    - -

    Base class for resource loaders. - More...

    - -

    #include <loader.hpp>

    - - - - - - -

    -Friends

    -template<typename Other >
    class resource_cache
     Resource loaders are friends of their caches.
     
    -

    Detailed Description

    -

    template<typename Loader, typename Resource>
    -class entt::resource_loader< Loader, Resource >

    - -

    Base class for resource loaders.

    -

    Resource loaders must inherit from this class and stay true to the CRTP idiom. Moreover, a resource loader must expose a public, const member function named load that accepts a variable number of arguments and returns a handle to the resource just created.
    - As an example:

    -
    struct my_resource {};
    -
    -
    struct my_loader: entt::resource_loader<my_loader, my_resource> {
    -
    resource_handle<my_resource> load(int value) const {
    -
    // use the integer value somehow
    -
    return std::make_shared<my_resource>();
    -
    }
    -
    };
    -
    entt::resource_loader
    Base class for resource loaders.
    Definition: loader.hpp:42
    -

    In general, resource loaders should not have a state or retain data of any type. They should let the cache manage their resources instead.

    -
    Note
    Base class and CRTP idiom aren't strictly required with the current implementation. One could argue that a cache can easily work with loaders of any type. However, future changes won't be breaking ones by forcing the use of a base class today and that's why the model is already in its place.
    -
    Template Parameters
    - - - -
    LoaderType of the derived class.
    ResourceType of resource for which to use the loader.
    -
    -
    - -

    Definition at line 42 of file loader.hpp.

    -
    The documentation for this class was generated from the following files: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/classentt_1_1scheduler-members.html b/classentt_1_1scheduler-members.html index f14df34d1..ef5b8fbd5 100644 --- a/classentt_1_1scheduler-members.html +++ b/classentt_1_1scheduler-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     Constructs a signal handler with a given allocator. More...
     
     sigh (const sigh &other)
     Default copy constructor. More...
     Copy constructor. More...
     
     sigh (const sigh &other, const allocator_type &allocator)
     Allocator-extended copy constructor. More...
     
     sigh (sigh &&other)
     Default move constructor. More...
     Move constructor. More...
     
     sigh (sigh &&other, const allocator_type &allocator)
     Allocator-extended move constructor. More...
     
    sigh & operator= (const sigh &other)
     Default copy assignment operator. More...
     Copy assignment operator. More...
     
    sigh & operator= (sigh &&other)
     Default move assignment operator. More...
     Move assignment operator. More...
     
    void swap (sigh &other)
     Exchanges the contents with those of a given signal handler. More...
    -

    Default copy constructor.

    +

    Copy constructor.

    Parameters
    @@ -277,7 +277,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 89 of file sigh.hpp.

    +

    Definition at line 86 of file sigh.hpp.

    @@ -326,7 +326,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 97 of file sigh.hpp.

    +

    Definition at line 94 of file sigh.hpp.

    @@ -356,7 +356,7 @@ template<typename Ret , typename... Args, typename Allocator >
    otherThe instance to copy from.
    -

    Default move constructor.

    +

    Move constructor.

    Parameters
    @@ -364,7 +364,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 104 of file sigh.hpp.

    +

    Definition at line 101 of file sigh.hpp.

    @@ -413,7 +413,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 112 of file sigh.hpp.

    +

    Definition at line 109 of file sigh.hpp.

    @@ -476,7 +476,7 @@ template<typename Func > -

    Definition at line 203 of file sigh.hpp.

    +

    Definition at line 200 of file sigh.hpp.

    @@ -508,7 +508,7 @@ template<typename Ret , typename... Args, typename Allocator >

    Returns false if at least a listener is connected to the signal.

    Returns
    True if the signal has no listeners connected, false otherwise.
    -

    Definition at line 171 of file sigh.hpp.

    +

    Definition at line 168 of file sigh.hpp.

    @@ -540,7 +540,7 @@ template<typename Ret , typename... Args, typename Allocator >

    Returns the associated allocator.

    Returns
    The associated allocator.
    -

    Definition at line 148 of file sigh.hpp.

    +

    Definition at line 145 of file sigh.hpp.

    @@ -570,7 +570,7 @@ template<typename Ret , typename... Args, typename Allocator >
    otherThe instance to move from.
    -

    Default copy assignment operator.

    +

    Copy assignment operator.

    Parameters
    @@ -579,7 +579,7 @@ template<typename Ret , typename... Args, typename Allocator >
    Returns
    This signal handler.
    -

    Definition at line 120 of file sigh.hpp.

    +

    Definition at line 117 of file sigh.hpp.

    @@ -609,7 +609,7 @@ template<typename Ret , typename... Args, typename Allocator >
    otherThe instance to copy from.
    -

    Default move assignment operator.

    +

    Move assignment operator.

    Parameters
    @@ -618,7 +618,7 @@ template<typename Ret , typename... Args, typename Allocator >
    Returns
    This signal handler.
    -

    Definition at line 130 of file sigh.hpp.

    +

    Definition at line 127 of file sigh.hpp.

    @@ -657,7 +657,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 182 of file sigh.hpp.

    +

    Definition at line 179 of file sigh.hpp.

    @@ -689,7 +689,7 @@ template<typename Ret , typename... Args, typename Allocator >

    Number of listeners connected to the signal.

    Returns
    Number of listeners currently connected.
    -

    Definition at line 163 of file sigh.hpp.

    +

    Definition at line 160 of file sigh.hpp.

    @@ -727,7 +727,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 139 of file sigh.hpp.

    +

    Definition at line 136 of file sigh.hpp.

    diff --git a/classentt_1_1sigh__storage__mixin-members.html b/classentt_1_1sigh__storage__mixin-members.html index 8f78652a4..1aebacacc 100644 --- a/classentt_1_1sigh__storage__mixin-members.html +++ b/classentt_1_1sigh__storage__mixin-members.html @@ -22,7 +22,7 @@ @@ -81,7 +81,6 @@ $(function() { -
    otherThe instance to move from.
    EnTT -  3.9.0 +  3.10.0
    on_destroy()entt::sigh_storage_mixin< Type >inline
    on_update()entt::sigh_storage_mixin< Type >inline
    patch(const entity_type entt, Func &&...func)entt::sigh_storage_mixin< Type >inline
    value_type typedefentt::sigh_storage_mixin< Type >
    diff --git a/classentt_1_1sigh__storage__mixin.html b/classentt_1_1sigh__storage__mixin.html index 6dcddeef5..401181fc1 100644 --- a/classentt_1_1sigh__storage__mixin.html +++ b/classentt_1_1sigh__storage__mixin.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - - @@ -143,7 +139,7 @@ class entt::sigh_storage_mixin< Type >

    Mixin type used to add signal support to storage types.

    The function type of a listener is equivalent to:

    void(basic_registry<entity_type> &, entity_type);
    -
    entt::sigh_storage_mixin::entity_type
    typename Type::entity_type entity_type
    Underlying entity identifier.
    Definition: storage.hpp:975
    +
    entt::sigh_storage_mixin::entity_type
    typename Type::entity_type entity_type
    Underlying entity identifier.
    Definition: sigh_storage_mixin.hpp:58

    This applies to all signals made available.

    Template Parameters

    Public Types

    -using value_type = typename Type::value_type
     Underlying value type.
     
    using entity_type = typename Type::entity_type
     Underlying entity identifier.
    @@ -152,7 +148,7 @@ class entt::sigh_storage_mixin< Type > -

    Definition at line 949 of file storage.hpp.

    +

    Definition at line 26 of file sigh_storage_mixin.hpp.

    Member Function Documentation

    ◆ bind()

    @@ -188,7 +184,7 @@ template<typename Type > -

    Definition at line 1078 of file storage.hpp.

    +

    Definition at line 162 of file sigh_storage_mixin.hpp.

    @@ -246,7 +242,7 @@ template<typename... Args>
    Returns
    A reference to the newly created object.
    -

    Definition at line 1033 of file storage.hpp.

    +

    Definition at line 116 of file sigh_storage_mixin.hpp.

    @@ -311,7 +307,7 @@ template<typename It , typename... Args> -

    Definition at line 1064 of file storage.hpp.

    +

    Definition at line 149 of file sigh_storage_mixin.hpp.

    @@ -346,7 +342,7 @@ template<typename Type >
    See also
    sink
    Returns
    A temporary sink object.
    -

    Definition at line 991 of file storage.hpp.

    +

    Definition at line 74 of file sigh_storage_mixin.hpp.

    @@ -381,7 +377,7 @@ template<typename Type >
    See also
    sink
    Returns
    A temporary sink object.
    -

    Definition at line 1021 of file storage.hpp.

    +

    Definition at line 104 of file sigh_storage_mixin.hpp.

    @@ -416,7 +412,7 @@ template<typename Type >
    See also
    sink
    Returns
    A temporary sink object.
    -

    Definition at line 1006 of file storage.hpp.

    +

    Definition at line 89 of file sigh_storage_mixin.hpp.

    @@ -474,12 +470,12 @@ template<typename... Func>
    Returns
    A reference to the patched instance.
    -

    Definition at line 1047 of file storage.hpp.

    +

    Definition at line 131 of file sigh_storage_mixin.hpp.

    The documentation for this class was generated from the following file: diff --git a/classentt_1_1sink.html b/classentt_1_1sink.html index 26b7af2c7..6d1d3d79e 100644 --- a/classentt_1_1sink.html +++ b/classentt_1_1sink.html @@ -22,7 +22,7 @@ @@ -86,7 +86,7 @@ class entt::sink< typename > -

    Definition at line 21 of file fwd.hpp.

    +

    Definition at line 22 of file fwd.hpp.

    The documentation for this class was generated from the following file: diff --git a/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4-members.html b/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4-members.html index 98c0425a7..7db8911ad 100644 --- a/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4-members.html +++ b/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html b/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html index 3fe1bf83a..62f727e83 100644 --- a/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html +++ b/classentt_1_1sink_3_01sigh_3_01Ret_07Args_8_8_8_08_00_01Allocator_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -153,7 +153,7 @@ class entt::sink< sigh< Ret(Args...), Allocator > > -

    Definition at line 365 of file sigh.hpp.

    +

    Definition at line 362 of file sigh.hpp.

    Constructor & Destructor Documentation

    ◆ sink()

    @@ -189,7 +189,7 @@ template<typename Ret , typename... Args, typename Allocator > -

    Definition at line 384 of file sigh.hpp.

    +

    Definition at line 381 of file sigh.hpp.

    @@ -230,7 +230,7 @@ template<auto Function>
    Returns
    A properly initialized sink object.
    -

    Definition at line 403 of file sigh.hpp.

    +

    Definition at line 400 of file sigh.hpp.

    @@ -262,7 +262,7 @@ template<typename Ret , typename... Args, typename Allocator >

    Returns a sink that connects before anything else.

    Returns
    A properly initialized sink object.
    -

    Definition at line 475 of file sigh.hpp.

    +

    Definition at line 472 of file sigh.hpp.

    @@ -310,7 +310,7 @@ template<auto Candidate, typename Type >
    Returns
    A properly initialized sink object.
    -

    Definition at line 424 of file sigh.hpp.

    +

    Definition at line 421 of file sigh.hpp.

    @@ -357,7 +357,7 @@ template<typename Type >
    Returns
    A properly initialized sink object.
    -

    Definition at line 444 of file sigh.hpp.

    +

    Definition at line 441 of file sigh.hpp.

    @@ -404,7 +404,7 @@ template<typename Type >
    Returns
    A properly initialized sink object.
    -

    Definition at line 456 of file sigh.hpp.

    +

    Definition at line 453 of file sigh.hpp.

    @@ -445,7 +445,7 @@ template<auto Candidate>
    Returns
    A properly initialized connection object.
    -

    Definition at line 491 of file sigh.hpp.

    +

    Definition at line 488 of file sigh.hpp.

    @@ -495,7 +495,7 @@ template<auto Candidate, typename Type >
    Returns
    A properly initialized connection object.
    -

    Definition at line 521 of file sigh.hpp.

    +

    Definition at line 518 of file sigh.hpp.

    @@ -534,7 +534,7 @@ template<auto Candidate> -

    Definition at line 538 of file sigh.hpp.

    +

    Definition at line 535 of file sigh.hpp.

    @@ -581,7 +581,7 @@ template<auto Candidate, typename Type > -

    Definition at line 553 of file sigh.hpp.

    +

    Definition at line 550 of file sigh.hpp.

    @@ -627,7 +627,7 @@ template<typename Type > -

    Definition at line 567 of file sigh.hpp.

    +

    Definition at line 564 of file sigh.hpp.

    @@ -673,7 +673,7 @@ template<typename Type > -

    Definition at line 578 of file sigh.hpp.

    +

    Definition at line 575 of file sigh.hpp.

    @@ -705,7 +705,7 @@ template<typename Ret , typename... Args, typename Allocator >

    Returns false if at least a listener is connected to the sink.

    Returns
    True if the sink has no listeners connected, false otherwise.
    -

    Definition at line 392 of file sigh.hpp.

    +

    Definition at line 389 of file sigh.hpp.

    diff --git a/classes.html b/classes.html index 22ed49621..74d52608d 100644 --- a/classes.html +++ b/classes.html @@ -22,7 +22,7 @@ @@ -66,20 +66,20 @@ $(function() {
    Class Index
    -
    A | B | C | D | E | F | G | I | M | N | O | P | R | S | T | V | Y
    +
    A | B | C | D | E | F | G | I | L | M | N | O | P | R | S | T | V | Y
    A
    -
    adl_meta_pointer_like (entt)
    as_cref_t (entt)
    as_group (entt)
    as_is_t (entt)
    as_ref_t (entt)
    as_view (entt)
    as_void_t (entt)
    +
    adl_meta_pointer_like (entt)
    allocation_deleter (entt)
    as_cref_t (entt)
    as_group (entt)
    as_is_t (entt)
    as_ref_t (entt)
    as_view (entt)
    as_void_t (entt)
    B
    -
    basic_any (entt)
    basic_collector (entt)
    basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... > (entt)
    basic_collector<> (entt)
    basic_component_traits (entt)
    basic_continuous_loader (entt)
    basic_group (entt)
    basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > (entt)
    basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > (entt)
    basic_handle (entt)
    basic_hashed_string (entt)
    basic_observer (entt)
    basic_organizer (entt)
    basic_poly (entt)
    basic_registry (entt)
    basic_runtime_view (entt)
    basic_snapshot (entt)
    basic_snapshot_loader (entt)
    basic_sparse_set (entt)
    basic_storage (entt)
    basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > (entt)
    basic_view (entt)
    basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > (entt)
    basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > (entt)
    +
    basic_any (entt)
    basic_collector (entt)
    basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... > (entt)
    basic_collector<> (entt)
    basic_continuous_loader (entt)
    basic_dispatcher (entt)
    basic_group (entt)
    basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > > (entt)
    basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > > (entt)
    basic_handle (entt)
    basic_hashed_string (entt)
    basic_observer (entt)
    basic_organizer (entt)
    basic_poly (entt)
    basic_registry (entt)
    basic_runtime_view (entt)
    basic_runtime_view< basic_sparse_set< Entity, Allocator > > (entt)
    basic_snapshot (entt)
    basic_snapshot_loader (entt)
    basic_sparse_set (entt)
    basic_storage (entt)
    basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > > (entt)
    basic_view (entt)
    basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > > (entt)
    basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > > (entt)
    C
    choice_t (entt)
    choice_t< 0 > (entt)
    component_traits (entt)
    compressed_pair (entt)
    connect_arg_t (entt)
    connection (entt)
    emitter::connection (entt)
    constness_as (entt)
    constness_as< To, const From > (entt)
    D
    -
    delegate (entt)
    delegate< Ret(Args...)> (entt)
    dense_hash_map (entt)
    dense_hash_set (entt)
    dispatcher (entt)
    +
    delegate (entt)
    delegate< Ret(Args...)> (entt)
    dense_map (entt)
    dense_set (entt)
    E
    emitter (entt)
    entt_traits (entt)
    enum_as_bitmask (entt)
    enum_as_bitmask< Type, std::void_t< decltype(Type::_entt_enum_as_bitmask)> > (entt)
    exclude_t (entt)
    @@ -91,32 +91,35 @@ $(function() {
    get_t (entt)
    I
    -
    identifier (entt)
    identity (entt)
    input_iterator_pointer (entt)
    insertion_sort (entt)
    is_applicable (entt)
    is_applicable< Func, const Tuple< Args... > > (entt)
    is_applicable< Func, Tuple< Args... > > (entt)
    is_applicable_r (entt)
    is_applicable_r< Ret, Func, std::tuple< Args... > > (entt)
    is_complete (entt)
    is_complete< Type, std::void_t< decltype(sizeof(Type))> > (entt)
    is_ebco_eligible (entt)
    is_equality_comparable (entt)
    is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> > (entt)
    is_iterator (entt)
    is_iterator< Type, std::enable_if_t<!std::is_same_v< std::remove_const_t< std::remove_pointer_t< Type > >, void > > > (entt)
    is_iterator_type (entt)
    is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > > (entt)
    is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > > (entt)
    is_meta_pointer_like (entt)
    is_meta_pointer_like< const Type > (entt)
    is_meta_pointer_like< std::shared_ptr< Type > > (entt)
    is_meta_pointer_like< std::unique_ptr< Type, Args... > > (entt)
    is_meta_pointer_like< Type * > (entt)
    is_meta_pointer_like< Type(*)[N]> (entt)
    is_transparent (entt)
    is_transparent< Type, std::void_t< typename Type::is_transparent > > (entt)
    iterable_adaptor (entt)
    +
    identifier (entt)
    identity (entt)
    input_iterator_pointer (entt)
    insertion_sort (entt)
    is_applicable (entt)
    is_applicable< Func, const Tuple< Args... > > (entt)
    is_applicable< Func, Tuple< Args... > > (entt)
    is_applicable_r (entt)
    is_applicable_r< Ret, Func, std::tuple< Args... > > (entt)
    is_complete (entt)
    is_complete< Type, std::void_t< decltype(sizeof(Type))> > (entt)
    is_ebco_eligible (entt)
    is_equality_comparable (entt)
    is_equality_comparable< Type, std::void_t< decltype(std::declval< Type >()==std::declval< Type >())> > (entt)
    is_iterator (entt)
    is_iterator< Type, std::enable_if_t<!std::is_same_v< std::remove_const_t< std::remove_pointer_t< Type > >, void > > > (entt)
    is_meta_pointer_like (entt)
    is_meta_pointer_like< const Type > (entt)
    is_meta_pointer_like< std::shared_ptr< Type > > (entt)
    is_meta_pointer_like< std::unique_ptr< Type, Args... > > (entt)
    is_meta_pointer_like< Type * > (entt)
    is_meta_pointer_like< Type(*)[N]> (entt)
    is_transparent (entt)
    is_transparent< Type, std::void_t< typename Type::is_transparent > > (entt)
    iterable_adaptor (entt)
    -
    M
    -
    matcher (entt)
    member_class (entt)
    meta_any (entt)
    meta_associative_container (entt)
    meta_associative_container_traits (entt)
    meta_associative_container_traits< dense_hash_map< Key, Type, Args... > > (entt)
    meta_associative_container_traits< dense_hash_set< Type, Args... > > (entt)
    meta_associative_container_traits< std::map< Key, Value, Args... > > (entt)
    meta_associative_container_traits< std::set< Key, Args... > > (entt)
    meta_associative_container_traits< std::unordered_map< Key, Value, Args... > > (entt)
    meta_associative_container_traits< std::unordered_set< Key, Args... > > (entt)
    meta_class_template_tag (entt)
    meta_ctx (entt)
    meta_data (entt)
    meta_factory (entt)
    meta_factory< Type > (entt)
    meta_factory< Type, Spec... > (entt)
    meta_func (entt)
    meta_function_descriptor (entt)
    meta_function_descriptor< Type, Ret Class::* > (entt)
    meta_function_descriptor< Type, Ret(*)()> (entt)
    meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)> (entt)
    meta_function_descriptor< Type, Ret(Class::*)(Args...) const > (entt)
    meta_function_descriptor< Type, Ret(Class::*)(Args...)> (entt)
    meta_function_helper (entt)
    meta_handle (entt)
    meta_associative_container::meta_iterator (entt)
    meta_sequence_container::meta_iterator (entt)
    meta_prop (entt)
    meta_range (entt)
    meta_sequence_container (entt)
    meta_sequence_container_traits (entt)
    meta_sequence_container_traits< std::array< Type, N > > (entt)
    meta_sequence_container_traits< std::vector< Type, Args... > > (entt)
    meta_template_traits (entt)
    meta_template_traits< Clazz< Args... > > (entt)
    meta_type (entt)
    monostate (entt)
    +
    L
    +
    locator (entt)
    +
    M
    +
    matcher (entt)
    member_class (entt)
    meta_any (entt)
    meta_associative_container (entt)
    meta_associative_container_traits (entt)
    meta_associative_container_traits< dense_map< Key, Type, Args... > > (entt)
    meta_associative_container_traits< dense_set< Type, Args... > > (entt)
    meta_associative_container_traits< std::map< Key, Value, Args... > > (entt)
    meta_associative_container_traits< std::set< Key, Args... > > (entt)
    meta_associative_container_traits< std::unordered_map< Key, Value, Args... > > (entt)
    meta_associative_container_traits< std::unordered_set< Key, Args... > > (entt)
    meta_class_template_tag (entt)
    meta_ctx (entt)
    meta_data (entt)
    meta_factory (entt)
    meta_factory< Type > (entt)
    meta_factory< Type, Spec... > (entt)
    meta_func (entt)
    meta_function_descriptor (entt)
    meta_function_descriptor< Type, Ret Class::* > (entt)
    meta_function_descriptor< Type, Ret(*)()> (entt)
    meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)> (entt)
    meta_function_descriptor< Type, Ret(Class::*)(Args...) const > (entt)
    meta_function_descriptor< Type, Ret(Class::*)(Args...)> (entt)
    meta_function_helper (entt)
    meta_handle (entt)
    meta_prop (entt)
    meta_range (entt)
    meta_sequence_container (entt)
    meta_sequence_container_traits (entt)
    meta_sequence_container_traits< std::array< Type, N > > (entt)
    meta_sequence_container_traits< std::vector< Type, Args... > > (entt)
    meta_template_traits (entt)
    meta_template_traits< Clazz< Args... > > (entt)
    meta_type (entt)
    monostate (entt)
    +
    N
    null_t (entt)
    -
    +
    O
    overloaded (entt)
    owned_t (entt)
    -
    +
    P
    poly_base (entt)
    poly_inspector (entt)
    poly_vtable (entt)
    process (entt)
    process_adaptor (entt)
    -
    +
    R
    -
    radix_sort (entt)
    resource_cache (entt)
    resource_handle (entt)
    resource_loader (entt)
    -
    -
    S
    -
    scheduler (entt)
    scoped_connection (entt)
    service_locator (entt)
    sigh (entt)
    sigh< Ret(Args...), Allocator > (entt)
    sigh_storage_mixin (entt)
    sink (entt)
    sink< sigh< Ret(Args...), Allocator > > (entt)
    size_of (entt)
    size_of< Type, std::void_t< decltype(sizeof(Type))> > (entt)
    std_sort (entt)
    storage_traits (entt)
    +
    radix_sort (entt)
    resource (entt)
    resource_cache (entt)
    resource_loader (entt)
    -
    T
    -
    tombstone_t (entt)
    tuple_element< Index, entt::compressed_pair< First, Second > > (std)
    tuple_size< entt::compressed_pair< First, Second > > (std)
    type_hash (entt)
    type_identity (entt)
    type_index (entt)
    type_info (entt)
    type_list (entt)
    type_list_cat (entt)
    type_list_cat< type_list< Type... > > (entt)
    type_list_cat< type_list< Type... >, type_list< Other... >, List... > (entt)
    type_list_cat<> (entt)
    type_list_contains (entt)
    type_list_contains< type_list< Type... >, Other > (entt)
    type_list_diff (entt)
    type_list_diff< type_list< Type... >, type_list< Other... > > (entt)
    type_list_element (entt)
    type_list_element< 0u, type_list< Type, Other... > > (entt)
    type_list_element< Index, type_list< Type, Other... > > (entt)
    type_list_unique (entt)
    type_list_unique< type_list< Type, Other... > > (entt)
    type_list_unique< type_list<> > (entt)
    type_name (entt)
    +
    S
    +
    scheduler (entt)
    scoped_connection (entt)
    sigh (entt)
    sigh< Ret(Args...), Allocator > (entt)
    sigh_storage_mixin (entt)
    sink (entt)
    sink< sigh< Ret(Args...), Allocator > > (entt)
    size_of (entt)
    size_of< Type, std::void_t< decltype(sizeof(Type))> > (entt)
    std_sort (entt)
    storage_traits (entt)
    +
    T
    +
    tombstone_t (entt)
    tuple_element< Index, entt::compressed_pair< First, Second > > (std)
    tuple_size< entt::compressed_pair< First, Second > > (std)
    type_hash (entt)
    type_identity (entt)
    type_index (entt)
    type_info (entt)
    type_list (entt)
    type_list_cat (entt)
    type_list_cat< type_list< Type... > > (entt)
    type_list_cat< type_list< Type... >, type_list< Other... >, List... > (entt)
    type_list_cat<> (entt)
    type_list_contains (entt)
    type_list_contains< type_list< Type... >, Other > (entt)
    type_list_diff (entt)
    type_list_diff< type_list< Type... >, type_list< Other... > > (entt)
    type_list_element (entt)
    type_list_element< 0u, type_list< Type, Other... > > (entt)
    type_list_element< Index, type_list< Type, Other... > > (entt)
    type_list_unique (entt)
    type_list_unique< type_list< Type, Other... > > (entt)
    type_list_unique< type_list<> > (entt)
    type_name (entt)
    +
    V
    value_list (entt)
    value_list_cat (entt)
    value_list_cat< value_list< Value... > > (entt)
    value_list_cat< value_list< Value... >, value_list< Other... >, List... > (entt)
    value_list_cat<> (entt)
    value_list_element (entt)
    value_list_element< 0u, value_list< Value, Other... > > (entt)
    value_list_element< Index, value_list< Value, Other... > > (entt)
    basic_organizer::vertex (entt)
    -
    +
    Y
    y_combinator (entt)
    diff --git a/component_8hpp_source.html b/component_8hpp_source.html index 0f12a5ec2..bd084e6b1 100644 --- a/component_8hpp_source.html +++ b/component_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -73,35 +73,49 @@ $(function() {
    1 #ifndef ENTT_ENTITY_COMPONENT_HPP
    2 #define ENTT_ENTITY_COMPONENT_HPP
    3 
    -
    4 #include <type_traits>
    -
    5 #include "../config/config.h"
    -
    6 
    -
    7 namespace entt {
    -
    8 
    -
    10 struct basic_component_traits {
    -
    12  static constexpr auto in_place_delete = false;
    -
    14  static constexpr auto ignore_if_empty = ENTT_IGNORE_IF_EMPTY;
    -
    16  static constexpr auto page_size = ENTT_PACKED_PAGE;
    -
    17 };
    -
    18 
    -
    23 template<typename Type, typename = void>
    -
    24 struct component_traits: basic_component_traits {
    -
    25  static_assert(std::is_same_v<std::decay_t<Type>, Type>, "Unsupported type");
    -
    26 };
    -
    27 
    -
    32 template<class Type>
    -
    33 inline constexpr bool ignore_as_empty_v = component_traits<Type>::ignore_if_empty &&std::is_empty_v<Type>;
    -
    34 
    -
    35 } // namespace entt
    -
    36 
    -
    37 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::ignore_as_empty_v
    constexpr bool ignore_as_empty_v
    Helper variable template.
    Definition: component.hpp:33
    -
    entt::basic_component_traits
    Commonly used default traits for all types.
    Definition: component.hpp:10
    -
    entt::basic_component_traits::ignore_if_empty
    static constexpr auto ignore_if_empty
    Empty type optimization, default is ENTT_IGNORE_IF_EMPTY.
    Definition: component.hpp:14
    -
    entt::basic_component_traits::page_size
    static constexpr auto page_size
    Page size, default is ENTT_PACKED_PAGE.
    Definition: component.hpp:16
    -
    entt::basic_component_traits::in_place_delete
    static constexpr auto in_place_delete
    Pointer stability, default is false.
    Definition: component.hpp:12
    -
    entt::component_traits
    Common way to access various properties of components.
    Definition: component.hpp:24
    +
    4 #include <cstddef>
    +
    5 #include <type_traits>
    +
    6 #include "../config/config.h"
    +
    7 
    +
    8 namespace entt {
    +
    9 
    +
    15 namespace internal {
    +
    16 
    +
    17 template<typename, typename = void>
    +
    18 struct in_place_delete: std::false_type {};
    +
    19 
    +
    20 template<typename Type>
    +
    21 struct in_place_delete<Type, std::enable_if_t<Type::in_place_delete>>
    +
    22  : std::true_type {};
    +
    23 
    +
    24 template<typename Type, typename = void>
    +
    25 struct page_size: std::integral_constant<std::size_t, (ENTT_IGNORE_IF_EMPTY && std::is_empty_v<Type>) ? 0u : ENTT_PACKED_PAGE> {};
    +
    26 
    +
    27 template<typename Type>
    +
    28 struct page_size<Type, std::enable_if_t<std::is_convertible_v<decltype(Type::page_size), std::size_t>>>
    +
    29  : std::integral_constant<std::size_t, Type::page_size> {};
    +
    30 
    +
    31 } // namespace internal
    +
    32 
    +
    42 template<typename Type, typename = void>
    +
    43 struct component_traits {
    +
    44  static_assert(std::is_same_v<std::decay_t<Type>, Type>, "Unsupported type");
    +
    45 
    +
    47  static constexpr bool in_place_delete = internal::in_place_delete<Type>::value;
    +
    49  static constexpr std::size_t page_size = internal::page_size<Type>::value;
    +
    50 };
    +
    51 
    +
    56 template<class Type>
    +
    57 inline constexpr bool ignore_as_empty_v = (component_traits<Type>::page_size == 0u);
    +
    58 
    +
    59 } // namespace entt
    +
    60 
    +
    61 #endif
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::ignore_as_empty_v
    constexpr bool ignore_as_empty_v
    Helper variable template.
    Definition: component.hpp:57
    +
    entt::component_traits
    Common way to access various properties of components.
    Definition: component.hpp:43
    +
    entt::component_traits::page_size
    static constexpr std::size_t page_size
    Page size, default is ENTT_PACKED_PAGE for non-empty types.
    Definition: component.hpp:49
    +
    entt::component_traits::in_place_delete
    static constexpr bool in_place_delete
    Pointer stability, default is false.
    Definition: component.hpp:47
    diff --git a/compressed__pair_8hpp_source.html b/compressed__pair_8hpp_source.html index a0f14b940..8aab0fa17 100644 --- a/compressed__pair_8hpp_source.html +++ b/compressed__pair_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -93,13 +93,13 @@ $(function() {
    26  compressed_pair_element()
    27  : value{} {}
    28 
    -
    29  template<typename Args, typename = std::enable_if_t<!std::is_same_v<std::remove_const_t<std::remove_reference_t<Args>>, compressed_pair_element>>>
    +
    29  template<typename Args, typename = std::enable_if_t<!std::is_same_v<std::remove_cv_t<std::remove_reference_t<Args>>, compressed_pair_element>>>
    30  compressed_pair_element(Args &&args)
    31  : value{std::forward<Args>(args)} {}
    32 
    33  template<typename... Args, std::size_t... Index>
    34  compressed_pair_element(std::tuple<Args...> args, std::index_sequence<Index...>)
    -
    35  : value{std::get<Index>(args)...} {}
    +
    35  : value{std::forward<Args>(std::get<Index>(args))...} {}
    36 
    37  [[nodiscard]] reference get() ENTT_NOEXCEPT {
    38  return value;
    @@ -123,13 +123,13 @@ $(function() {
    56  compressed_pair_element()
    57  : base_type{} {}
    58 
    -
    59  template<typename Args, typename = std::enable_if_t<!std::is_same_v<std::remove_const_t<std::remove_reference_t<Args>>, compressed_pair_element>>>
    +
    59  template<typename Args, typename = std::enable_if_t<!std::is_same_v<std::remove_cv_t<std::remove_reference_t<Args>>, compressed_pair_element>>>
    60  compressed_pair_element(Args &&args)
    61  : base_type{std::forward<Args>(args)} {}
    62 
    63  template<typename... Args, std::size_t... Index>
    64  compressed_pair_element(std::tuple<Args...> args, std::index_sequence<Index...>)
    -
    65  : base_type{std::get<Index>(args)...} {}
    +
    65  : base_type{std::forward<Args>(std::get<Index>(args))...} {}
    66 
    67  [[nodiscard]] reference get() ENTT_NOEXCEPT {
    68  return *this;
    @@ -160,7 +160,7 @@ $(function() {
    117 
    122  constexpr compressed_pair(const compressed_pair &other) = default;
    123 
    -
    128  constexpr compressed_pair(compressed_pair &&other) ENTT_NOEXCEPT = default;
    +
    128  constexpr compressed_pair(compressed_pair &&other) = default;
    129 
    137  template<typename Arg, typename Other>
    138  constexpr compressed_pair(Arg &&arg, Other &&other)
    @@ -174,7 +174,7 @@ $(function() {
    153 
    159  constexpr compressed_pair &operator=(const compressed_pair &other) = default;
    160 
    -
    166  constexpr compressed_pair &operator=(compressed_pair &&other) ENTT_NOEXCEPT = default;
    +
    166  constexpr compressed_pair &operator=(compressed_pair &&other) = default;
    167 
    172  [[nodiscard]] first_type &first() ENTT_NOEXCEPT {
    173  return static_cast<first_base &>(*this).get();
    @@ -233,18 +233,18 @@ $(function() {
    255 #if !defined __clang_major__ || __clang_major__ > 6
    256 namespace std {
    257 
    -
    258 template<typename First, typename Second>
    -
    259 struct tuple_size<entt::compressed_pair<First, Second>>: integral_constant<size_t, 2u> {};
    -
    260 
    -
    261 template<size_t Index, typename First, typename Second>
    -
    262 struct tuple_element<Index, entt::compressed_pair<First, Second>>: conditional<Index == 0u, First, Second> {
    -
    263  static_assert(Index < 2u, "Index out of bounds");
    -
    264 };
    +
    263 template<typename First, typename Second>
    +
    264 struct tuple_size<entt::compressed_pair<First, Second>>: integral_constant<size_t, 2u> {};
    265 
    -
    266 } // namespace std
    -
    267 #endif
    -
    268 
    -
    269 #endif
    +
    272 template<size_t Index, typename First, typename Second>
    +
    273 struct tuple_element<Index, entt::compressed_pair<First, Second>>: conditional<Index == 0u, First, Second> {
    +
    274  static_assert(Index < 2u, "Index out of bounds");
    +
    275 };
    +
    276 
    +
    277 } // namespace std
    +
    278 #endif
    +
    279 
    +
    280 #endif
    entt::compressed_pair
    A compressed pair.
    Definition: compressed_pair.hpp:95
    entt::compressed_pair::swap
    void swap(compressed_pair &other)
    Swaps two compressed pair objects.
    Definition: compressed_pair.hpp:198
    entt::compressed_pair::compressed_pair
    constexpr compressed_pair(const compressed_pair &other)=default
    Copy constructor.
    @@ -260,7 +260,7 @@ $(function() {
    entt::compressed_pair::operator=
    constexpr compressed_pair & operator=(compressed_pair &&other)=default
    Move assignment operator.
    entt::compressed_pair::second_type
    Second second_type
    The type of the second element that the pair stores.
    Definition: compressed_pair.hpp:103
    entt::compressed_pair::compressed_pair
    constexpr compressed_pair(std::piecewise_construct_t, std::tuple< Args... > args, std::tuple< Other... > other)
    Constructs a pair by forwarding the arguments to its parts.
    Definition: compressed_pair.hpp:150
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::get
    constexpr get_t< Type... > get
    Variable template for lists of observed components.
    Definition: utility.hpp:34
    entt::swap
    void swap(compressed_pair< First, Second > &lhs, compressed_pair< First, Second > &rhs)
    Swaps two compressed pair objects.
    Definition: compressed_pair.hpp:248
    diff --git a/config_8h_source.html b/config_8h_source.html index d7af08e77..82fd4801c 100644 --- a/config_8h_source.html +++ b/config_8h_source.html @@ -22,7 +22,7 @@     @@ -73,60 +73,60 @@ $(function() {
    1 #ifndef ENTT_CONFIG_CONFIG_H
    2 #define ENTT_CONFIG_CONFIG_H
    3 
    -
    4 #if defined(__cpp_exceptions) && !defined(ENTT_NOEXCEPTION)
    -
    5 # define ENTT_NOEXCEPT noexcept
    -
    6 # define ENTT_THROW throw
    -
    7 # define ENTT_TRY try
    -
    8 # define ENTT_CATCH catch(...)
    -
    9 #else
    -
    10 # define ENTT_NOEXCEPT
    -
    11 # define ENTT_THROW
    -
    12 # define ENTT_TRY if(true)
    -
    13 # define ENTT_CATCH if(false)
    -
    14 #endif
    -
    15 
    -
    16 #if defined(__cpp_lib_launder) && __cpp_lib_launder >= 201606L
    -
    17 # include <new>
    -
    18 # define ENTT_LAUNDER(expr) std::launder(expr)
    -
    19 #else
    -
    20 # define ENTT_LAUNDER(expr) expr
    -
    21 #endif
    -
    22 
    -
    23 #ifndef ENTT_USE_ATOMIC
    +
    4 #include "version.h"
    +
    5 
    +
    6 #if defined(__cpp_exceptions) && !defined(ENTT_NOEXCEPTION)
    +
    7 # define ENTT_NOEXCEPT noexcept
    +
    8 # define ENTT_NOEXCEPT_IF(expr) noexcept(expr)
    +
    9 # define ENTT_THROW throw
    +
    10 # define ENTT_TRY try
    +
    11 # define ENTT_CATCH catch(...)
    +
    12 #else
    +
    13 # define ENTT_NOEXCEPT
    +
    14 # define ENTT_NOEXCEPT_IF(...)
    +
    15 # define ENTT_THROW
    +
    16 # define ENTT_TRY if(true)
    +
    17 # define ENTT_CATCH if(false)
    +
    18 #endif
    +
    19 
    +
    20 #ifdef ENTT_USE_ATOMIC
    +
    21 # include <atomic>
    +
    22 # define ENTT_MAYBE_ATOMIC(Type) std::atomic<Type>
    +
    23 #else
    24 # define ENTT_MAYBE_ATOMIC(Type) Type
    -
    25 #else
    -
    26 # include <atomic>
    -
    27 # define ENTT_MAYBE_ATOMIC(Type) std::atomic<Type>
    -
    28 #endif
    -
    29 
    -
    30 #ifndef ENTT_ID_TYPE
    -
    31 # include <cstdint>
    -
    32 # define ENTT_ID_TYPE std::uint32_t
    -
    33 #endif
    -
    34 
    -
    35 #ifndef ENTT_SPARSE_PAGE
    -
    36 # define ENTT_SPARSE_PAGE 4096
    -
    37 #endif
    -
    38 
    -
    39 #ifndef ENTT_PACKED_PAGE
    -
    40 # define ENTT_PACKED_PAGE 1024
    -
    41 #endif
    -
    42 
    -
    43 #ifdef ENTT_DISABLE_ASSERT
    -
    44 # undef ENTT_ASSERT
    -
    45 # define ENTT_ASSERT(...) (void(0))
    -
    46 #elif !defined ENTT_ASSERT
    -
    47 # include <cassert>
    -
    48 # define ENTT_ASSERT(condition, ...) assert(condition)
    -
    49 #endif
    -
    50 
    -
    51 #ifdef ENTT_NO_ETO
    -
    52 # define ENTT_IGNORE_IF_EMPTY false
    -
    53 #else
    -
    54 # define ENTT_IGNORE_IF_EMPTY true
    -
    55 #endif
    -
    56 
    -
    57 #ifndef ENTT_STANDARD_CPP
    +
    25 #endif
    +
    26 
    +
    27 #ifndef ENTT_ID_TYPE
    +
    28 # include <cstdint>
    +
    29 # define ENTT_ID_TYPE std::uint32_t
    +
    30 #endif
    +
    31 
    +
    32 #ifndef ENTT_SPARSE_PAGE
    +
    33 # define ENTT_SPARSE_PAGE 4096
    +
    34 #endif
    +
    35 
    +
    36 #ifndef ENTT_PACKED_PAGE
    +
    37 # define ENTT_PACKED_PAGE 1024
    +
    38 #endif
    +
    39 
    +
    40 #ifdef ENTT_DISABLE_ASSERT
    +
    41 # undef ENTT_ASSERT
    +
    42 # define ENTT_ASSERT(...) (void(0))
    +
    43 #elif !defined ENTT_ASSERT
    +
    44 # include <cassert>
    +
    45 # define ENTT_ASSERT(condition, ...) assert(condition)
    +
    46 #endif
    +
    47 
    +
    48 #ifdef ENTT_NO_ETO
    +
    49 # define ENTT_IGNORE_IF_EMPTY false
    +
    50 #else
    +
    51 # define ENTT_IGNORE_IF_EMPTY true
    +
    52 #endif
    +
    53 
    +
    54 #ifdef ENTT_STANDARD_CPP
    +
    55 # define ENTT_NONSTD false
    +
    56 #else
    +
    57 # define ENTT_NONSTD true
    58 # if defined __clang__ || defined __GNUC__
    59 # define ENTT_PRETTY_FUNCTION __PRETTY_FUNCTION__
    60 # define ENTT_PRETTY_FUNCTION_PREFIX '='
    @@ -138,7 +138,14 @@ $(function() {
    66 # endif
    67 #endif
    68 
    -
    69 #endif
    +
    69 #if defined _MSC_VER
    +
    70 # pragma detect_mismatch("entt.version", ENTT_VERSION)
    +
    71 # pragma detect_mismatch("entt.noexcept", ENTT_XSTR(ENTT_TRY))
    +
    72 # pragma detect_mismatch("entt.id", ENTT_XSTR(ENTT_ID_TYPE))
    +
    73 # pragma detect_mismatch("entt.nonstd", ENTT_XSTR(ENTT_NONSTD))
    +
    74 #endif
    +
    75 
    +
    76 #endif
    diff --git a/container_2fwd_8hpp_source.html b/container_2fwd_8hpp_source.html index 175ce75f5..bc42c9c20 100644 --- a/container_2fwd_8hpp_source.html +++ b/container_2fwd_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -79,23 +79,24 @@ $(function() {
    7 namespace entt {
    8 
    9 template<
    -
    10  typename Key, typename Type,
    -
    11  typename = std::hash<Key>,
    -
    12  typename = std::equal_to<Key>,
    -
    13  typename = std::allocator<std::pair<const Key, Type>>>
    -
    14 class dense_hash_map;
    -
    15 
    -
    16 template<
    -
    17  typename Type,
    -
    18  typename = std::hash<Type>,
    -
    19  typename = std::equal_to<Type>,
    -
    20  typename = std::allocator<Type>>
    -
    21 class dense_hash_set;
    -
    22 
    -
    23 } // namespace entt
    -
    24 
    -
    25 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    10  typename Key,
    +
    11  typename Type,
    +
    12  typename = std::hash<Key>,
    +
    13  typename = std::equal_to<Key>,
    +
    14  typename = std::allocator<std::pair<const Key, Type>>>
    +
    15 class dense_map;
    +
    16 
    +
    17 template<
    +
    18  typename Type,
    +
    19  typename = std::hash<Type>,
    +
    20  typename = std::equal_to<Type>,
    +
    21  typename = std::allocator<Type>>
    +
    22 class dense_set;
    +
    23 
    +
    24 } // namespace entt
    +
    25 
    +
    26 #endif
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    diff --git a/container_8hpp_source.html b/container_8hpp_source.html index 132461b0b..066fe5ce6 100644 --- a/container_8hpp_source.html +++ b/container_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -80,8 +80,8 @@ $(function() {
    8 #include <unordered_map>
    9 #include <unordered_set>
    10 #include <vector>
    -
    11 #include "../container/dense_hash_map.hpp"
    -
    12 #include "../container/dense_hash_set.hpp"
    +
    11 #include "../container/dense_map.hpp"
    +
    12 #include "../container/dense_set.hpp"
    13 #include "meta.hpp"
    14 #include "type_traits.hpp"
    15 
    @@ -121,181 +121,152 @@ $(function() {
    54  return false;
    55  }
    56 
    -
    57  [[nodiscard]] static bool clear([[maybe_unused]] any &container) {
    -
    58  if constexpr(is_dynamic_sequence_container<Type>::value) {
    -
    59  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    60  cont->clear();
    -
    61  return true;
    -
    62  }
    -
    63  }
    -
    64 
    -
    65  return false;
    +
    57  [[nodiscard]] static iterator iter(any &container, const bool as_end) {
    +
    58  using std::begin;
    +
    59 
    +
    60  if(auto *const cont = any_cast<Type>(&container); cont) {
    +
    61  return iterator{begin(*cont), static_cast<typename iterator::difference_type>(as_end * cont->size())};
    +
    62  }
    +
    63 
    +
    64  const Type &as_const = any_cast<const Type &>(container);
    +
    65  return iterator{begin(as_const), static_cast<typename iterator::difference_type>(as_end * as_const.size())};
    66  }
    67 
    -
    68  [[nodiscard]] static iterator begin(any &container) {
    -
    69  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    70  return iterator{std::begin(*cont)};
    -
    71  }
    -
    72 
    -
    73  return iterator{std::begin(any_cast<const Type &>(container))};
    -
    74  }
    -
    75 
    -
    76  [[nodiscard]] static iterator end(any &container) {
    -
    77  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    78  return iterator{std::end(*cont)};
    +
    68  [[nodiscard]] static iterator insert([[maybe_unused]] any &container, [[maybe_unused]] const std::ptrdiff_t offset, [[maybe_unused]] meta_any &value) {
    +
    69  if constexpr(is_dynamic_sequence_container<Type>::value) {
    +
    70  if(auto *const cont = any_cast<Type>(&container); cont) {
    +
    71  // this abomination is necessary because only on macos value_type and const_reference are different types for std::vector<bool>
    +
    72  if(value.allow_cast<typename Type::const_reference>() || value.allow_cast<typename Type::value_type>()) {
    +
    73  using std::begin;
    +
    74  const auto *element = value.try_cast<std::remove_reference_t<typename Type::const_reference>>();
    +
    75  const auto curr = cont->insert(begin(*cont) + offset, element ? *element : value.cast<typename Type::value_type>());
    +
    76  return iterator{curr, curr - begin(*cont)};
    +
    77  }
    +
    78  }
    79  }
    80 
    -
    81  return iterator{std::end(any_cast<const Type &>(container))};
    +
    81  return {};
    82  }
    83 
    -
    84  [[nodiscard]] static iterator insert([[maybe_unused]] any &container, [[maybe_unused]] iterator it, [[maybe_unused]] meta_any &value) {
    +
    84  [[nodiscard]] static iterator erase([[maybe_unused]] any &container, [[maybe_unused]] const std::ptrdiff_t offset) {
    85  if constexpr(is_dynamic_sequence_container<Type>::value) {
    86  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    87  // this abomination is necessary because only on macos value_type and const_reference are different types for std::vector<bool>
    -
    88  if(value.allow_cast<typename Type::const_reference>() || value.allow_cast<typename Type::value_type>()) {
    -
    89  const auto *element = value.try_cast<std::remove_reference_t<typename Type::const_reference>>();
    -
    90  return iterator{cont->insert(any_cast<const typename Type::iterator &>(it.base()), element ? *element : value.cast<typename Type::value_type>())};
    -
    91  }
    -
    92  }
    -
    93  }
    -
    94 
    -
    95  return {};
    -
    96  }
    -
    97 
    -
    98  [[nodiscard]] static iterator erase([[maybe_unused]] any &container, [[maybe_unused]] iterator it) {
    -
    99  if constexpr(is_dynamic_sequence_container<Type>::value) {
    -
    100  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    101  return iterator{cont->erase(any_cast<const typename Type::iterator &>(it.base()))};
    -
    102  }
    -
    103  }
    -
    104 
    -
    105  return {};
    +
    87  using std::begin;
    +
    88  const auto curr = cont->erase(begin(*cont) + offset);
    +
    89  return iterator{curr, curr - begin(*cont)};
    +
    90  }
    +
    91  }
    +
    92 
    +
    93  return {};
    +
    94  }
    +
    95 };
    +
    96 
    +
    97 template<typename Type>
    +
    98 struct basic_meta_associative_container_traits {
    +
    99  using iterator = meta_associative_container::iterator;
    +
    100  using size_type = std::size_t;
    +
    101 
    +
    102  static constexpr auto key_only = is_key_only_meta_associative_container<Type>::value;
    +
    103 
    +
    104  [[nodiscard]] static size_type size(const any &container) ENTT_NOEXCEPT {
    +
    105  return any_cast<const Type &>(container).size();
    106  }
    107 
    -
    108  [[nodiscard]] static meta_any get(any &container, size_type pos) {
    +
    108  [[nodiscard]] static bool clear(any &container) {
    109  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    110  return meta_any{std::in_place_type<typename Type::reference>, (*cont)[pos]};
    -
    111  }
    -
    112 
    -
    113  return meta_any{std::in_place_type<typename Type::const_reference>, any_cast<const Type &>(container)[pos]};
    -
    114  }
    -
    115 };
    +
    110  cont->clear();
    +
    111  return true;
    +
    112  }
    +
    113 
    +
    114  return false;
    +
    115  }
    116 
    -
    117 template<typename Type>
    -
    118 struct basic_meta_associative_container_traits {
    -
    119  using iterator = meta_associative_container::iterator;
    -
    120  using size_type = std::size_t;
    -
    121 
    -
    122  static constexpr auto key_only = is_key_only_meta_associative_container<Type>::value;
    -
    123 
    -
    124  [[nodiscard]] static size_type size(const any &container) ENTT_NOEXCEPT {
    -
    125  return any_cast<const Type &>(container).size();
    -
    126  }
    -
    127 
    -
    128  [[nodiscard]] static bool clear(any &container) {
    -
    129  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    130  cont->clear();
    -
    131  return true;
    -
    132  }
    -
    133 
    -
    134  return false;
    -
    135  }
    -
    136 
    -
    137  [[nodiscard]] static iterator begin(any &container) {
    -
    138  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    139  return iterator{std::integral_constant<bool, key_only>{}, cont->begin()};
    -
    140  }
    -
    141 
    -
    142  return iterator{std::integral_constant<bool, key_only>{}, std::begin(any_cast<const Type &>(container))};
    -
    143  }
    -
    144 
    -
    145  [[nodiscard]] static iterator end(any &container) {
    -
    146  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    147  return iterator{std::integral_constant<bool, key_only>{}, cont->end()};
    -
    148  }
    -
    149 
    -
    150  return iterator{std::integral_constant<bool, key_only>{}, std::end(any_cast<const Type &>(container))};
    -
    151  }
    +
    117  [[nodiscard]] static iterator iter(any &container, const bool as_end) {
    +
    118  using std::begin;
    +
    119  using std::end;
    +
    120 
    +
    121  if(auto *const cont = any_cast<Type>(&container); cont) {
    +
    122  return iterator{std::integral_constant<bool, key_only>{}, as_end ? end(*cont) : begin(*cont)};
    +
    123  }
    +
    124 
    +
    125  const auto &as_const = any_cast<const Type &>(container);
    +
    126  return iterator{std::integral_constant<bool, key_only>{}, as_end ? end(as_const) : begin(as_const)};
    +
    127  }
    +
    128 
    +
    129  [[nodiscard]] static bool insert(any &container, meta_any &key, [[maybe_unused]] meta_any &value) {
    +
    130  auto *const cont = any_cast<Type>(&container);
    +
    131 
    +
    132  if constexpr(is_key_only_meta_associative_container<Type>::value) {
    +
    133  return cont && key.allow_cast<const typename Type::key_type &>()
    +
    134  && cont->insert(key.cast<const typename Type::key_type &>()).second;
    +
    135  } else {
    +
    136  return cont && key.allow_cast<const typename Type::key_type &>() && value.allow_cast<const typename Type::mapped_type &>()
    +
    137  && cont->emplace(key.cast<const typename Type::key_type &>(), value.cast<const typename Type::mapped_type &>()).second;
    +
    138  }
    +
    139  }
    +
    140 
    +
    141  [[nodiscard]] static bool erase(any &container, meta_any &key) {
    +
    142  auto *const cont = any_cast<Type>(&container);
    +
    143  return cont && key.allow_cast<const typename Type::key_type &>()
    +
    144  && (cont->erase(key.cast<const typename Type::key_type &>()) != cont->size());
    +
    145  }
    +
    146 
    +
    147  [[nodiscard]] static iterator find(any &container, meta_any &key) {
    +
    148  if(key.allow_cast<const typename Type::key_type &>()) {
    +
    149  if(auto *const cont = any_cast<Type>(&container); cont) {
    +
    150  return iterator{std::integral_constant<bool, key_only>{}, cont->find(key.cast<const typename Type::key_type &>())};
    +
    151  }
    152 
    -
    153  [[nodiscard]] static bool insert(any &container, meta_any &key, [[maybe_unused]] meta_any &value) {
    -
    154  if(auto *const cont = any_cast<Type>(&container); cont && key.allow_cast<const typename Type::key_type &>()) {
    -
    155  if constexpr(is_key_only_meta_associative_container<Type>::value) {
    -
    156  return cont->insert(key.cast<const typename Type::key_type &>()).second;
    -
    157  } else {
    -
    158  if(value.allow_cast<const typename Type::mapped_type &>()) {
    -
    159  return cont->emplace(key.cast<const typename Type::key_type &>(), value.cast<const typename Type::mapped_type &>()).second;
    -
    160  }
    -
    161  }
    -
    162  }
    -
    163 
    -
    164  return false;
    -
    165  }
    -
    166 
    -
    167  [[nodiscard]] static bool erase(any &container, meta_any &key) {
    -
    168  if(auto *const cont = any_cast<Type>(&container); cont && key.allow_cast<const typename Type::key_type &>()) {
    -
    169  return (cont->erase(key.cast<const typename Type::key_type &>()) != cont->size());
    -
    170  }
    -
    171 
    -
    172  return false;
    -
    173  }
    -
    174 
    -
    175  [[nodiscard]] static iterator find(any &container, meta_any &key) {
    -
    176  if(key.allow_cast<const typename Type::key_type &>()) {
    -
    177  if(auto *const cont = any_cast<Type>(&container); cont) {
    -
    178  return iterator{std::integral_constant<bool, key_only>{}, cont->find(key.cast<const typename Type::key_type &>())};
    -
    179  }
    -
    180 
    -
    181  return iterator{std::integral_constant<bool, key_only>{}, any_cast<const Type &>(container).find(key.cast<const typename Type::key_type &>())};
    -
    182  }
    -
    183 
    -
    184  return {};
    -
    185  }
    -
    186 };
    -
    187 
    -
    188 } // namespace internal
    -
    189 
    -
    200 template<typename Type, typename... Args>
    -
    201 struct meta_sequence_container_traits<std::vector<Type, Args...>>
    -
    202  : internal::basic_meta_sequence_container_traits<std::vector<Type, Args...>> {};
    -
    203 
    -
    209 template<typename Type, auto N>
    -
    210 struct meta_sequence_container_traits<std::array<Type, N>>
    -
    211  : internal::basic_meta_sequence_container_traits<std::array<Type, N>> {};
    -
    212 
    -
    219 template<typename Key, typename Value, typename... Args>
    -
    220 struct meta_associative_container_traits<std::map<Key, Value, Args...>>
    -
    221  : internal::basic_meta_associative_container_traits<std::map<Key, Value, Args...>> {};
    -
    222 
    -
    230 template<typename Key, typename Value, typename... Args>
    -
    231 struct meta_associative_container_traits<std::unordered_map<Key, Value, Args...>>
    -
    232  : internal::basic_meta_associative_container_traits<std::unordered_map<Key, Value, Args...>> {};
    -
    233 
    -
    239 template<typename Key, typename... Args>
    -
    240 struct meta_associative_container_traits<std::set<Key, Args...>>
    -
    241  : internal::basic_meta_associative_container_traits<std::set<Key, Args...>> {};
    -
    242 
    -
    249 template<typename Key, typename... Args>
    -
    250 struct meta_associative_container_traits<std::unordered_set<Key, Args...>>
    -
    251  : internal::basic_meta_associative_container_traits<std::unordered_set<Key, Args...>> {};
    -
    252 
    -
    259 template<typename Key, typename Type, typename... Args>
    -
    260 struct meta_associative_container_traits<dense_hash_map<Key, Type, Args...>>
    -
    261  : internal::basic_meta_associative_container_traits<dense_hash_map<Key, Type, Args...>> {};
    -
    262 
    -
    268 template<typename Type, typename... Args>
    -
    269 struct meta_associative_container_traits<dense_hash_set<Type, Args...>>
    -
    270  : internal::basic_meta_associative_container_traits<dense_hash_set<Type, Args...>> {};
    -
    271 
    -
    272 } // namespace entt
    -
    273 
    -
    274 #endif
    -
    entt::dense_hash_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_hash_map.hpp:240
    -
    entt::dense_hash_set
    Associative container for unique objects of a given type.
    Definition: dense_hash_set.hpp:239
    -
    entt::meta_associative_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:90
    -
    entt::meta_sequence_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:35
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:16
    -
    entt::get
    constexpr get_t< Type... > get
    Variable template for lists of observed components.
    Definition: utility.hpp:34
    +
    153  return iterator{std::integral_constant<bool, key_only>{}, any_cast<const Type &>(container).find(key.cast<const typename Type::key_type &>())};
    +
    154  }
    +
    155 
    +
    156  return {};
    +
    157  }
    +
    158 };
    +
    159 
    +
    160 } // namespace internal
    +
    161 
    +
    172 template<typename Type, typename... Args>
    +
    173 struct meta_sequence_container_traits<std::vector<Type, Args...>>
    +
    174  : internal::basic_meta_sequence_container_traits<std::vector<Type, Args...>> {};
    +
    175 
    +
    181 template<typename Type, auto N>
    +
    182 struct meta_sequence_container_traits<std::array<Type, N>>
    +
    183  : internal::basic_meta_sequence_container_traits<std::array<Type, N>> {};
    +
    184 
    +
    191 template<typename Key, typename Value, typename... Args>
    +
    192 struct meta_associative_container_traits<std::map<Key, Value, Args...>>
    +
    193  : internal::basic_meta_associative_container_traits<std::map<Key, Value, Args...>> {};
    +
    194 
    +
    202 template<typename Key, typename Value, typename... Args>
    +
    203 struct meta_associative_container_traits<std::unordered_map<Key, Value, Args...>>
    +
    204  : internal::basic_meta_associative_container_traits<std::unordered_map<Key, Value, Args...>> {};
    +
    205 
    +
    211 template<typename Key, typename... Args>
    +
    212 struct meta_associative_container_traits<std::set<Key, Args...>>
    +
    213  : internal::basic_meta_associative_container_traits<std::set<Key, Args...>> {};
    +
    214 
    +
    221 template<typename Key, typename... Args>
    +
    222 struct meta_associative_container_traits<std::unordered_set<Key, Args...>>
    +
    223  : internal::basic_meta_associative_container_traits<std::unordered_set<Key, Args...>> {};
    +
    224 
    +
    231 template<typename Key, typename Type, typename... Args>
    +
    232 struct meta_associative_container_traits<dense_map<Key, Type, Args...>>
    +
    233  : internal::basic_meta_associative_container_traits<dense_map<Key, Type, Args...>> {};
    +
    234 
    +
    240 template<typename Type, typename... Args>
    +
    241 struct meta_associative_container_traits<dense_set<Type, Args...>>
    +
    242  : internal::basic_meta_associative_container_traits<dense_set<Type, Args...>> {};
    +
    243 
    +
    244 } // namespace entt
    +
    245 
    +
    246 #endif
    +
    entt::dense_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_map.hpp:265
    +
    entt::dense_set
    Associative container for unique objects of a given type.
    Definition: dense_set.hpp:229
    +
    entt::meta_associative_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:85
    +
    entt::meta_sequence_container::iterator
    meta_iterator iterator
    Meta iterator type.
    Definition: meta.hpp:36
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::any
    basic_any<> any
    Alias declaration for the most common use case.
    Definition: fwd.hpp:17
    entt::meta_associative_container_traits
    Traits class template to be specialized to enable support for meta associative containers.
    Definition: type_traits.hpp:28
    entt::meta_sequence_container_traits
    Traits class template to be specialized to enable support for meta sequence containers.
    Definition: type_traits.hpp:21
    diff --git a/core_2fwd_8hpp_source.html b/core_2fwd_8hpp_source.html index 5d5ea1093..0259791d0 100644 --- a/core_2fwd_8hpp_source.html +++ b/core_2fwd_8hpp_source.html @@ -22,7 +22,7 @@     @@ -73,24 +73,25 @@ $(function() {
    1 #ifndef ENTT_CORE_FWD_HPP
    2 #define ENTT_CORE_FWD_HPP
    3 
    -
    4 #include <type_traits>
    -
    5 #include "../config/config.h"
    -
    6 
    -
    7 namespace entt {
    -
    8 
    -
    9 template<std::size_t Len = sizeof(double[2]), std::size_t = alignof(typename std::aligned_storage_t<Len + !Len>)>
    -
    10 class basic_any;
    -
    11 
    -
    13 using id_type = ENTT_ID_TYPE;
    -
    14 
    -
    16 using any = basic_any<>;
    -
    17 
    -
    18 } // namespace entt
    -
    19 
    -
    20 #endif
    +
    4 #include <cstdint>
    +
    5 #include <type_traits>
    +
    6 #include "../config/config.h"
    +
    7 
    +
    8 namespace entt {
    +
    9 
    +
    10 template<std::size_t Len = sizeof(double[2]), std::size_t = alignof(typename std::aligned_storage_t<Len + !Len>)>
    +
    11 class basic_any;
    +
    12 
    +
    14 using id_type = ENTT_ID_TYPE;
    +
    15 
    +
    17 using any = basic_any<>;
    +
    18 
    +
    19 } // namespace entt
    +
    20 
    +
    21 #endif
    entt::basic_any<>
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14
    diff --git a/core_2type__traits_8hpp_source.html b/core_2type__traits_8hpp_source.html index f5d97075e..7d2ee025c 100644 --- a/core_2type__traits_8hpp_source.html +++ b/core_2type__traits_8hpp_source.html @@ -22,7 +22,7 @@
    @@ -176,10 +176,10 @@ $(function() {
    204 
    210 template<typename Type, typename... Other>
    211 struct type_list_unique<type_list<Type, Other...>> {
    -
    213  using type = std::conditional_t<
    -
    214  std::disjunction_v<std::is_same<Type, Other>...>,
    -
    215  typename type_list_unique<type_list<Other...>>::type,
    -
    216  type_list_cat_t<type_list<Type>, typename type_list_unique<type_list<Other...>>::type>>;
    +
    213  using type = std::conditional_t<
    +
    214  (std::is_same_v<Type, Other> || ...),
    +
    215  typename type_list_unique<type_list<Other...>>::type,
    +
    216  type_list_cat_t<type_list<Type>, typename type_list_unique<type_list<Other...>>::type>>;
    217 };
    218 
    220 template<>
    @@ -307,162 +307,146 @@ $(function() {
    486 template<typename Type>
    487 inline constexpr bool is_iterator_v = is_iterator<Type>::value;
    488 
    -
    495 template<typename Type, typename It, typename = void>
    -
    496 struct is_iterator_type: std::false_type {};
    +
    494 template<typename Type>
    +
    495 struct is_ebco_eligible
    +
    496  : std::conjunction<std::is_empty<Type>, std::negation<std::is_final<Type>>> {};
    497 
    -
    499 template<typename Type, typename It>
    -
    500 struct is_iterator_type<Type, It, std::enable_if_t<is_iterator_v<Type> && std::is_same_v<Type, It>>>
    -
    501  : std::true_type {};
    -
    502 
    -
    504 template<typename Type, typename It>
    -
    505 struct is_iterator_type<Type, It, std::enable_if_t<!std::is_same_v<Type, It>, std::void_t<typename It::iterator_type>>>
    -
    506  : is_iterator_type<Type, typename It::iterator_type> {};
    -
    507 
    -
    513 template<typename Type, typename It>
    -
    514 inline constexpr bool is_iterator_type_v = is_iterator_type<Type, It>::value;
    -
    515 
    +
    502 template<typename Type>
    +
    503 inline constexpr bool is_ebco_eligible_v = is_ebco_eligible<Type>::value;
    +
    504 
    +
    510 template<typename Type, typename = void>
    +
    511 struct is_transparent: std::false_type {};
    +
    512 
    +
    514 template<typename Type>
    +
    515 struct is_transparent<Type, std::void_t<typename Type::is_transparent>>: std::true_type {};
    +
    516 
    521 template<typename Type>
    -
    522 struct is_ebco_eligible
    -
    523  : std::conjunction<std::is_empty<Type>, std::negation<std::is_final<Type>>> {};
    -
    524 
    -
    529 template<typename Type>
    -
    530 inline constexpr bool is_ebco_eligible_v = is_ebco_eligible<Type>::value;
    +
    522 inline constexpr bool is_transparent_v = is_transparent<Type>::value;
    +
    523 
    +
    529 template<typename Type, typename = void>
    +
    530 struct is_equality_comparable: std::false_type {};
    531 
    -
    537 template<typename Type, typename = void>
    -
    538 struct is_transparent: std::false_type {};
    -
    539 
    -
    541 template<typename Type>
    -
    542 struct is_transparent<Type, std::void_t<typename Type::is_transparent>>: std::true_type {};
    -
    543 
    -
    548 template<typename Type>
    -
    549 inline constexpr bool is_transparent_v = is_transparent<Type>::value;
    -
    550 
    -
    556 template<typename Type, typename = void>
    -
    557 struct is_equality_comparable: std::false_type {};
    -
    558 
    -
    564 namespace internal {
    +
    537 namespace internal {
    +
    538 
    +
    539 template<typename, typename = void>
    +
    540 struct has_tuple_size_value: std::false_type {};
    +
    541 
    +
    542 template<typename Type>
    +
    543 struct has_tuple_size_value<Type, std::void_t<decltype(std::tuple_size<const Type>::value)>>: std::true_type {};
    +
    544 
    +
    545 template<typename Type, std::size_t... Index>
    +
    546 [[nodiscard]] constexpr bool unpack_maybe_equality_comparable(std::index_sequence<Index...>) {
    +
    547  return (is_equality_comparable<std::tuple_element_t<Index, Type>>::value && ...);
    +
    548 }
    +
    549 
    +
    550 template<typename>
    +
    551 [[nodiscard]] constexpr bool maybe_equality_comparable(choice_t<0>) {
    +
    552  return true;
    +
    553 }
    +
    554 
    +
    555 template<typename Type>
    +
    556 [[nodiscard]] constexpr auto maybe_equality_comparable(choice_t<1>) -> decltype(std::declval<typename Type::value_type>(), bool{}) {
    +
    557  if constexpr(is_iterator_v<Type>) {
    +
    558  return true;
    +
    559  } else if constexpr(std::is_same_v<typename Type::value_type, Type>) {
    +
    560  return maybe_equality_comparable<Type>(choice<0>);
    +
    561  } else {
    +
    562  return is_equality_comparable<typename Type::value_type>::value;
    +
    563  }
    +
    564 }
    565 
    -
    566 template<typename, typename = void>
    -
    567 struct has_tuple_size_value: std::false_type {};
    -
    568 
    -
    569 template<typename Type>
    -
    570 struct has_tuple_size_value<Type, std::void_t<decltype(std::tuple_size<const Type>::value)>>: std::true_type {};
    -
    571 
    -
    572 template<typename Type, std::size_t... Index>
    -
    573 [[nodiscard]] constexpr bool unpack_maybe_equality_comparable(std::index_sequence<Index...>) {
    -
    574  return (is_equality_comparable<std::tuple_element_t<Index, Type>>::value && ...);
    -
    575 }
    +
    566 template<typename Type>
    +
    567 [[nodiscard]] constexpr std::enable_if_t<is_complete_v<std::tuple_size<std::remove_const_t<Type>>>, bool> maybe_equality_comparable(choice_t<2>) {
    +
    568  if constexpr(has_tuple_size_value<Type>::value) {
    +
    569  return unpack_maybe_equality_comparable<Type>(std::make_index_sequence<std::tuple_size<Type>::value>{});
    +
    570  } else {
    +
    571  return maybe_equality_comparable<Type>(choice<1>);
    +
    572  }
    +
    573 }
    +
    574 
    +
    575 } // namespace internal
    576 
    -
    577 template<typename>
    -
    578 [[nodiscard]] constexpr bool maybe_equality_comparable(choice_t<0>) {
    -
    579  return true;
    -
    580 }
    -
    581 
    -
    582 template<typename Type>
    -
    583 [[nodiscard]] constexpr auto maybe_equality_comparable(choice_t<1>) -> decltype(std::declval<typename Type::value_type>(), bool{}) {
    -
    584  if constexpr(is_iterator_v<Type>) {
    -
    585  return true;
    -
    586  } else if constexpr(std::is_same_v<typename Type::value_type, Type>) {
    -
    587  return maybe_equality_comparable<Type>(choice<0>);
    -
    588  } else {
    -
    589  return is_equality_comparable<typename Type::value_type>::value;
    -
    590  }
    -
    591 }
    -
    592 
    -
    593 template<typename Type>
    -
    594 [[nodiscard]] constexpr std::enable_if_t<is_complete_v<std::tuple_size<std::remove_const_t<Type>>>, bool> maybe_equality_comparable(choice_t<2>) {
    -
    595  if constexpr(has_tuple_size_value<Type>::value) {
    -
    596  return unpack_maybe_equality_comparable<Type>(std::make_index_sequence<std::tuple_size<Type>::value>{});
    -
    597  } else {
    -
    598  return maybe_equality_comparable<Type>(choice<1>);
    -
    599  }
    -
    600 }
    -
    601 
    -
    602 } // namespace internal
    -
    603 
    -
    610 template<typename Type>
    -
    611 struct is_equality_comparable<Type, std::void_t<decltype(std::declval<Type>() == std::declval<Type>())>>
    -
    612  : std::bool_constant<internal::maybe_equality_comparable<Type>(choice<2>)> {};
    -
    613 
    -
    618 template<typename Type>
    -
    619 inline constexpr bool is_equality_comparable_v = is_equality_comparable<Type>::value;
    -
    620 
    -
    626 template<typename To, typename From>
    -
    627 struct constness_as {
    -
    629  using type = std::remove_const_t<To>;
    -
    630 };
    -
    631 
    -
    633 template<typename To, typename From>
    -
    634 struct constness_as<To, const From> {
    -
    636  using type = std::add_const_t<To>;
    -
    637 };
    -
    638 
    -
    644 template<typename To, typename From>
    -
    645 using constness_as_t = typename constness_as<To, From>::type;
    -
    646 
    -
    651 template<typename Member>
    -
    652 class member_class {
    -
    653  static_assert(std::is_member_pointer_v<Member>, "Invalid pointer type to non-static member object or function");
    -
    654 
    -
    655  template<typename Class, typename Ret, typename... Args>
    -
    656  static Class *clazz(Ret (Class::*)(Args...));
    -
    657 
    -
    658  template<typename Class, typename Ret, typename... Args>
    -
    659  static Class *clazz(Ret (Class::*)(Args...) const);
    -
    660 
    -
    661  template<typename Class, typename Type>
    -
    662  static Class *clazz(Type Class::*);
    -
    663 
    -
    664 public:
    -
    666  using type = std::remove_pointer_t<decltype(clazz(std::declval<Member>()))>;
    -
    667 };
    -
    668 
    -
    673 template<typename Member>
    -
    674 using member_class_t = typename member_class<Member>::type;
    -
    675 
    -
    676 } // namespace entt
    -
    677 
    -
    678 #endif
    -
    entt::member_class
    Extracts the class of a non-static member object or function.
    Definition: type_traits.hpp:652
    -
    entt::member_class::type
    std::remove_pointer_t< decltype(clazz(std::declval< Member >()))> type
    The class of the given non-static member object or function.
    Definition: type_traits.hpp:666
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::is_equality_comparable_v
    constexpr bool is_equality_comparable_v
    Helper variable template.
    Definition: type_traits.hpp:619
    +
    583 template<typename Type>
    +
    584 struct is_equality_comparable<Type, std::void_t<decltype(std::declval<Type>() == std::declval<Type>())>>
    +
    585  : std::bool_constant<internal::maybe_equality_comparable<Type>(choice<2>)> {};
    +
    586 
    +
    591 template<typename Type>
    +
    592 inline constexpr bool is_equality_comparable_v = is_equality_comparable<Type>::value;
    +
    593 
    +
    599 template<typename To, typename From>
    +
    600 struct constness_as {
    +
    602  using type = std::remove_const_t<To>;
    +
    603 };
    +
    604 
    +
    606 template<typename To, typename From>
    +
    607 struct constness_as<To, const From> {
    +
    609  using type = std::add_const_t<To>;
    +
    610 };
    +
    611 
    +
    617 template<typename To, typename From>
    +
    618 using constness_as_t = typename constness_as<To, From>::type;
    +
    619 
    +
    624 template<typename Member>
    +
    625 class member_class {
    +
    626  static_assert(std::is_member_pointer_v<Member>, "Invalid pointer type to non-static member object or function");
    +
    627 
    +
    628  template<typename Class, typename Ret, typename... Args>
    +
    629  static Class *clazz(Ret (Class::*)(Args...));
    +
    630 
    +
    631  template<typename Class, typename Ret, typename... Args>
    +
    632  static Class *clazz(Ret (Class::*)(Args...) const);
    +
    633 
    +
    634  template<typename Class, typename Type>
    +
    635  static Class *clazz(Type Class::*);
    +
    636 
    +
    637 public:
    +
    639  using type = std::remove_pointer_t<decltype(clazz(std::declval<Member>()))>;
    +
    640 };
    +
    641 
    +
    646 template<typename Member>
    +
    647 using member_class_t = typename member_class<Member>::type;
    +
    648 
    +
    649 } // namespace entt
    +
    650 
    +
    651 #endif
    +
    entt::member_class
    Extracts the class of a non-static member object or function.
    Definition: type_traits.hpp:625
    +
    entt::member_class::type
    std::remove_pointer_t< decltype(clazz(std::declval< Member >()))> type
    The class of the given non-static member object or function.
    Definition: type_traits.hpp:639
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::is_equality_comparable_v
    constexpr bool is_equality_comparable_v
    Helper variable template.
    Definition: type_traits.hpp:592
    entt::choice
    constexpr choice_t< N > choice
    Variable template for the choice trick.
    Definition: type_traits.hpp:32
    entt::type_identity_t
    typename type_identity< Type >::type type_identity_t
    Helper type.
    Definition: type_traits.hpp:53
    entt::integral_constant
    std::integral_constant< decltype(Value), Value > integral_constant
    Wraps a static constant.
    Definition: type_traits.hpp:96
    entt::value_list_cat_t
    typename value_list_cat< List... >::type value_list_cat_t
    Helper type.
    Definition: type_traits.hpp:374
    entt::size_of_v
    constexpr std::size_t size_of_v
    Helper variable template.
    Definition: type_traits.hpp:73
    entt::is_iterator_v
    constexpr bool is_iterator_v
    Helper variable template.
    Definition: type_traits.hpp:487
    -
    entt::member_class_t
    typename member_class< Member >::type member_class_t
    Helper type.
    Definition: type_traits.hpp:674
    +
    entt::member_class_t
    typename member_class< Member >::type member_class_t
    Helper type.
    Definition: type_traits.hpp:647
    entt::value_list_element_v
    constexpr auto value_list_element_v
    Helper type.
    Definition: type_traits.hpp:323
    entt::is_applicable_v
    constexpr bool is_applicable_v
    Helper variable template.
    Definition: type_traits.hpp:404
    entt::type_list_cat_t
    typename type_list_cat< List... >::type type_list_cat_t
    Helper type.
    Definition: type_traits.hpp:199
    -
    entt::is_transparent_v
    constexpr bool is_transparent_v
    Helper variable template.
    Definition: type_traits.hpp:549
    +
    entt::is_transparent_v
    constexpr bool is_transparent_v
    Helper variable template.
    Definition: type_traits.hpp:522
    entt::operator+
    constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
    Concatenates multiple type lists.
    Definition: type_traits.hpp:157
    entt::type_list_unique_t
    typename type_list_unique< Type >::type type_list_unique_t
    Helper type.
    Definition: type_traits.hpp:231
    -
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:645
    +
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:618
    entt::is_complete_v
    constexpr bool is_complete_v
    Helper variable template.
    Definition: type_traits.hpp:447
    entt::type_list_contains_v
    constexpr bool type_list_contains_v
    Helper variable template.
    Definition: type_traits.hpp:256
    entt::tag
    integral_constant< Value > tag
    Alias template to facilitate the creation of named values.
    Definition: type_traits.hpp:103
    -
    entt::is_iterator_type_v
    constexpr bool is_iterator_type_v
    Helper variable template.
    Definition: type_traits.hpp:514
    entt::type_list_element_t
    typename type_list_element< Index, List >::type type_list_element_t
    Helper type.
    Definition: type_traits.hpp:148
    entt::unpack_as_type
    Type unpack_as_type
    Using declaration to be used to repeat the same type a number of times equal to the size of a given p...
    Definition: type_traits.hpp:81
    entt::is_applicable_r_v
    constexpr bool is_applicable_r_v
    Helper variable template.
    Definition: type_traits.hpp:428
    entt::unpack_as_value
    constexpr auto unpack_as_value
    Helper variable template to be used to repeat the same value a number of times equal to the size of a...
    Definition: type_traits.hpp:89
    entt::type_list_diff_t
    typename type_list_diff< List... >::type type_list_diff_t
    Helper type.
    Definition: type_traits.hpp:278
    -
    entt::is_ebco_eligible_v
    constexpr bool is_ebco_eligible_v
    Helper variable template.
    Definition: type_traits.hpp:530
    +
    entt::is_ebco_eligible_v
    constexpr bool is_ebco_eligible_v
    Helper variable template.
    Definition: type_traits.hpp:503
    entt::choice_t
    Utility class to disambiguate overloaded functions.
    Definition: type_traits.hpp:21
    -
    entt::constness_as< To, const From >::type
    std::add_const_t< To > type
    The type resulting from the transcription of the constness.
    Definition: type_traits.hpp:636
    -
    entt::constness_as
    Transcribes the constness of a type to another type.
    Definition: type_traits.hpp:627
    -
    entt::constness_as::type
    std::remove_const_t< To > type
    The type resulting from the transcription of the constness.
    Definition: type_traits.hpp:629
    +
    entt::constness_as< To, const From >::type
    std::add_const_t< To > type
    The type resulting from the transcription of the constness.
    Definition: type_traits.hpp:609
    +
    entt::constness_as
    Transcribes the constness of a type to another type.
    Definition: type_traits.hpp:600
    +
    entt::constness_as::type
    std::remove_const_t< To > type
    The type resulting from the transcription of the constness.
    Definition: type_traits.hpp:602
    entt::is_applicable_r
    Same as std::is_invocable_r, but with tuples for arguments.
    Definition: type_traits.hpp:408
    entt::is_applicable
    Same as std::is_invocable, but with tuples.
    Definition: type_traits.hpp:378
    entt::is_complete
    Provides the member constant value to true if a given type is complete, false otherwise.
    Definition: type_traits.hpp:436
    -
    entt::is_ebco_eligible
    Provides the member constant value to true if a given type is both an empty and non-final class,...
    Definition: type_traits.hpp:523
    -
    entt::is_equality_comparable
    Provides the member constant value to true if a given type is equality comparable,...
    Definition: type_traits.hpp:557
    -
    entt::is_iterator_type
    Provides the member constant value to true if a given type is of the required iterator type,...
    Definition: type_traits.hpp:496
    +
    entt::is_ebco_eligible
    Provides the member constant value to true if a given type is both an empty and non-final class,...
    Definition: type_traits.hpp:496
    +
    entt::is_equality_comparable
    Provides the member constant value to true if a given type is equality comparable,...
    Definition: type_traits.hpp:530
    entt::is_iterator
    Provides the member constant value to true if a given type is an iterator, false otherwise.
    Definition: type_traits.hpp:455
    -
    entt::is_transparent
    Provides the member constant value to true if Type::is_transparent is valid and denotes a type,...
    Definition: type_traits.hpp:538
    +
    entt::is_transparent
    Provides the member constant value to true if Type::is_transparent is valid and denotes a type,...
    Definition: type_traits.hpp:511
    entt::size_of
    A type-only sizeof wrapper that returns 0 where sizeof complains.
    Definition: type_traits.hpp:61
    entt::type_identity
    Identity type trait.
    Definition: type_traits.hpp:43
    entt::type_identity::type
    Type type
    Identity type.
    Definition: type_traits.hpp:45
    @@ -474,7 +458,7 @@ $(function() {
    entt::type_list_diff
    Primary template isn't defined on purpose.
    Definition: type_traits.hpp:260
    entt::type_list_element< 0u, type_list< Type, Other... > >::type
    Type type
    Searched type.
    Definition: type_traits.hpp:139
    entt::type_list_element
    Primary template isn't defined on purpose.
    Definition: type_traits.hpp:119
    -
    entt::type_list_unique< type_list< Type, Other... > >::type
    std::conditional_t< std::disjunction_v< std::is_same< Type, Other >... >, typename type_list_unique< type_list< Other... > >::type, type_list_cat_t< type_list< Type >, typename type_list_unique< type_list< Other... > >::type > > type
    A type list without duplicate types.
    Definition: type_traits.hpp:216
    +
    entt::type_list_unique< type_list< Type, Other... > >::type
    std::conditional_t<(std::is_same_v< Type, Other >||...), typename type_list_unique< type_list< Other... > >::type, type_list_cat_t< type_list< Type >, typename type_list_unique< type_list< Other... > >::type > > type
    A type list without duplicate types.
    Definition: type_traits.hpp:216
    entt::type_list_unique
    Primary template isn't defined on purpose.
    Definition: type_traits.hpp:203
    entt::type_list
    A class to use to push around lists of types, nothing more.
    Definition: type_traits.hpp:110
    entt::type_list::size
    static constexpr auto size
    Compile-time number of elements in the type list.
    Definition: type_traits.hpp:114
    diff --git a/core_2utility_8hpp_source.html b/core_2utility_8hpp_source.html index 56832bdfe..4a2a3fc4b 100644 --- a/core_2utility_8hpp_source.html +++ b/core_2utility_8hpp_source.html @@ -22,7 +22,7 @@     @@ -127,7 +127,7 @@ $(function() {
    99 } // namespace entt
    100 
    101 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::overloaded
    overloaded(Func...) -> overloaded< Func... >
    Deduction guide.
    entt::overload
    constexpr auto overload(Type Class::*member)
    Constant utility to disambiguate overloaded members of a class.
    Definition: utility.hpp:34
    entt::identity
    Identity function object (waiting for C++20).
    Definition: utility.hpp:10
    diff --git a/ctx_8hpp_source.html b/ctx_8hpp_source.html index 52350480c..14d121aa8 100644 --- a/ctx_8hpp_source.html +++ b/ctx_8hpp_source.html @@ -22,7 +22,7 @@     @@ -112,7 +112,7 @@ $(function() {
    55 } // namespace entt
    56 
    57 #endif
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    entt::meta_ctx
    Opaque container for a meta context.
    Definition: ctx.hpp:42
    entt::meta_ctx::bind
    static void bind(meta_ctx other)
    Binds the meta system to a given context.
    Definition: ctx.hpp:47
    diff --git a/delegate_8hpp_source.html b/delegate_8hpp_source.html index 0e703a596..3b5f1bbe2 100644 --- a/delegate_8hpp_source.html +++ b/delegate_8hpp_source.html @@ -22,7 +22,7 @@     @@ -80,212 +80,213 @@ $(function() {
    8 #include <utility>
    9 #include "../config/config.h"
    10 #include "../core/type_traits.hpp"
    -
    11 
    -
    12 namespace entt {
    -
    13 
    -
    19 namespace internal {
    -
    20 
    -
    21 template<typename Ret, typename... Args>
    -
    22 auto function_pointer(Ret (*)(Args...)) -> Ret (*)(Args...);
    -
    23 
    -
    24 template<typename Ret, typename Type, typename... Args, typename Other>
    -
    25 auto function_pointer(Ret (*)(Type, Args...), Other &&) -> Ret (*)(Args...);
    -
    26 
    -
    27 template<typename Class, typename Ret, typename... Args, typename... Other>
    -
    28 auto function_pointer(Ret (Class::*)(Args...), Other &&...) -> Ret (*)(Args...);
    -
    29 
    -
    30 template<typename Class, typename Ret, typename... Args, typename... Other>
    -
    31 auto function_pointer(Ret (Class::*)(Args...) const, Other &&...) -> Ret (*)(Args...);
    -
    32 
    -
    33 template<typename Class, typename Type, typename... Other>
    -
    34 auto function_pointer(Type Class::*, Other &&...) -> Type (*)();
    -
    35 
    -
    36 template<typename... Type>
    -
    37 using function_pointer_t = decltype(internal::function_pointer(std::declval<Type>()...));
    -
    38 
    -
    39 template<typename... Class, typename Ret, typename... Args>
    -
    40 [[nodiscard]] constexpr auto index_sequence_for(Ret (*)(Args...)) {
    -
    41  return std::index_sequence_for<Class..., Args...>{};
    -
    42 }
    -
    43 
    -
    44 } // namespace internal
    -
    45 
    -
    52 template<auto>
    -
    53 struct connect_arg_t {};
    -
    54 
    -
    56 template<auto Func>
    -
    57 inline constexpr connect_arg_t<Func> connect_arg{};
    -
    58 
    -
    65 template<typename>
    -
    66 class delegate;
    -
    67 
    -
    80 template<typename Ret, typename... Args>
    -
    81 class delegate<Ret(Args...)> {
    -
    82  template<auto Candidate, std::size_t... Index>
    -
    83  [[nodiscard]] auto wrap(std::index_sequence<Index...>) ENTT_NOEXCEPT {
    -
    84  return [](const void *, Args... args) -> Ret {
    -
    85  [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);
    -
    86  return static_cast<Ret>(std::invoke(Candidate, std::forward<type_list_element_t<Index, type_list<Args...>>>(std::get<Index>(arguments))...));
    -
    87  };
    -
    88  }
    -
    89 
    -
    90  template<auto Candidate, typename Type, std::size_t... Index>
    -
    91  [[nodiscard]] auto wrap(Type &, std::index_sequence<Index...>) ENTT_NOEXCEPT {
    -
    92  return [](const void *payload, Args... args) -> Ret {
    -
    93  [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);
    -
    94  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    -
    95  return static_cast<Ret>(std::invoke(Candidate, *curr, std::forward<type_list_element_t<Index, type_list<Args...>>>(std::get<Index>(arguments))...));
    -
    96  };
    -
    97  }
    -
    98 
    -
    99  template<auto Candidate, typename Type, std::size_t... Index>
    -
    100  [[nodiscard]] auto wrap(Type *, std::index_sequence<Index...>) ENTT_NOEXCEPT {
    -
    101  return [](const void *payload, Args... args) -> Ret {
    -
    102  [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);
    -
    103  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    -
    104  return static_cast<Ret>(std::invoke(Candidate, curr, std::forward<type_list_element_t<Index, type_list<Args...>>>(std::get<Index>(arguments))...));
    -
    105  };
    -
    106  }
    -
    107 
    -
    108 public:
    -
    110  using function_type = Ret(const void *, Args...);
    -
    112  using type = Ret(Args...);
    -
    114  using result_type = Ret;
    -
    115 
    -
    117  delegate() ENTT_NOEXCEPT
    -
    118  : fn{nullptr},
    -
    119  data{nullptr} {}
    -
    120 
    -
    126  template<auto Candidate>
    -
    127  delegate(connect_arg_t<Candidate>) ENTT_NOEXCEPT {
    -
    128  connect<Candidate>();
    -
    129  }
    -
    130 
    -
    138  template<auto Candidate, typename Type>
    -
    139  delegate(connect_arg_t<Candidate>, Type &&value_or_instance) ENTT_NOEXCEPT {
    -
    140  connect<Candidate>(std::forward<Type>(value_or_instance));
    -
    141  }
    -
    142 
    -
    149  delegate(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {
    -
    150  connect(function, payload);
    -
    151  }
    -
    152 
    -
    157  template<auto Candidate>
    -
    158  void connect() ENTT_NOEXCEPT {
    -
    159  data = nullptr;
    -
    160 
    -
    161  if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Args...>) {
    -
    162  fn = [](const void *, Args... args) -> Ret {
    -
    163  return Ret(std::invoke(Candidate, std::forward<Args>(args)...));
    -
    164  };
    -
    165  } else if constexpr(std::is_member_pointer_v<decltype(Candidate)>) {
    -
    166  fn = wrap<Candidate>(internal::index_sequence_for<type_list_element_t<0, type_list<Args...>>>(internal::function_pointer_t<decltype(Candidate)>{}));
    -
    167  } else {
    -
    168  fn = wrap<Candidate>(internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate)>{}));
    -
    169  }
    -
    170  }
    -
    171 
    -
    187  template<auto Candidate, typename Type>
    -
    188  void connect(Type &value_or_instance) ENTT_NOEXCEPT {
    -
    189  data = &value_or_instance;
    -
    190 
    -
    191  if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type &, Args...>) {
    -
    192  fn = [](const void *payload, Args... args) -> Ret {
    -
    193  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    -
    194  return Ret(std::invoke(Candidate, *curr, std::forward<Args>(args)...));
    -
    195  };
    -
    196  } else {
    -
    197  fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));
    -
    198  }
    -
    199  }
    -
    200 
    -
    211  template<auto Candidate, typename Type>
    -
    212  void connect(Type *value_or_instance) ENTT_NOEXCEPT {
    -
    213  data = value_or_instance;
    -
    214 
    -
    215  if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type *, Args...>) {
    -
    216  fn = [](const void *payload, Args... args) -> Ret {
    -
    217  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    -
    218  return Ret(std::invoke(Candidate, curr, std::forward<Args>(args)...));
    -
    219  };
    -
    220  } else {
    -
    221  fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));
    -
    222  }
    -
    223  }
    -
    224 
    -
    238  void connect(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {
    -
    239  fn = function;
    -
    240  data = payload;
    -
    241  }
    -
    242 
    -
    248  void reset() ENTT_NOEXCEPT {
    -
    249  fn = nullptr;
    -
    250  data = nullptr;
    -
    251  }
    -
    252 
    -
    257  [[nodiscard]] const void *instance() const ENTT_NOEXCEPT {
    -
    258  return data;
    -
    259  }
    -
    260 
    -
    273  Ret operator()(Args... args) const {
    -
    274  ENTT_ASSERT(static_cast<bool>(*this), "Uninitialized delegate");
    -
    275  return fn(data, std::forward<Args>(args)...);
    -
    276  }
    -
    277 
    -
    282  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    283  // no need to test also data
    -
    284  return !(fn == nullptr);
    -
    285  }
    -
    286 
    -
    292  [[nodiscard]] bool operator==(const delegate<Ret(Args...)> &other) const ENTT_NOEXCEPT {
    -
    293  return fn == other.fn && data == other.data;
    -
    294  }
    -
    295 
    -
    296 private:
    -
    297  function_type *fn;
    -
    298  const void *data;
    -
    299 };
    -
    300 
    -
    309 template<typename Ret, typename... Args>
    -
    310 [[nodiscard]] bool operator!=(const delegate<Ret(Args...)> &lhs, const delegate<Ret(Args...)> &rhs) ENTT_NOEXCEPT {
    -
    311  return !(lhs == rhs);
    -
    312 }
    -
    313 
    -
    318 template<auto Candidate>
    -
    319 delegate(connect_arg_t<Candidate>) -> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate)>>>;
    -
    320 
    -
    326 template<auto Candidate, typename Type>
    -
    327 delegate(connect_arg_t<Candidate>, Type &&) -> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate), Type>>>;
    -
    328 
    -
    334 template<typename Ret, typename... Args>
    -
    335 delegate(Ret (*)(const void *, Args...), const void * = nullptr) -> delegate<Ret(Args...)>;
    -
    336 
    -
    337 } // namespace entt
    -
    338 
    -
    339 #endif
    -
    entt::delegate< Ret(Args...)>::operator()
    Ret operator()(Args... args) const
    Triggers a delegate.
    Definition: delegate.hpp:273
    -
    entt::delegate< Ret(Args...)>::instance
    const void * instance() const
    Returns the instance or the payload linked to a delegate, if any.
    Definition: delegate.hpp:257
    -
    entt::delegate< Ret(Args...)>::function_type
    Ret(const void *, Args...) function_type
    Function type of the contained target.
    Definition: delegate.hpp:110
    -
    entt::delegate< Ret(Args...)>::reset
    void reset()
    Resets a delegate.
    Definition: delegate.hpp:248
    -
    entt::delegate< Ret(Args...)>::delegate
    delegate()
    Default constructor.
    Definition: delegate.hpp:117
    -
    entt::delegate< Ret(Args...)>::delegate
    delegate(connect_arg_t< Candidate >)
    Constructs a delegate and connects a free function or an unbound member.
    Definition: delegate.hpp:127
    -
    entt::delegate< Ret(Args...)>::connect
    void connect(function_type *function, const void *payload=nullptr)
    Connects an user defined function with optional payload to a delegate.
    Definition: delegate.hpp:238
    -
    entt::delegate< Ret(Args...)>::delegate
    delegate(connect_arg_t< Candidate >, Type &&value_or_instance)
    Constructs a delegate and connects a free function with payload or a bound member.
    Definition: delegate.hpp:139
    -
    entt::delegate< Ret(Args...)>::result_type
    Ret result_type
    Return type of the delegate.
    Definition: delegate.hpp:114
    -
    entt::delegate< Ret(Args...)>::connect
    void connect(Type *value_or_instance)
    Connects a free function with payload or a bound member to a delegate.
    Definition: delegate.hpp:212
    -
    entt::delegate< Ret(Args...)>::operator==
    bool operator==(const delegate< Ret(Args...)> &other) const
    Compares the contents of two delegates.
    Definition: delegate.hpp:292
    -
    entt::delegate< Ret(Args...)>::connect
    void connect()
    Connects a free function or an unbound member to a delegate.
    Definition: delegate.hpp:158
    -
    entt::delegate< Ret(Args...)>::type
    Ret(Args...) type
    Function type of the delegate.
    Definition: delegate.hpp:112
    -
    entt::delegate< Ret(Args...)>::delegate
    delegate(function_type *function, const void *payload=nullptr)
    Constructs a delegate and connects an user defined function with optional payload.
    Definition: delegate.hpp:149
    -
    entt::delegate< Ret(Args...)>::connect
    void connect(Type &value_or_instance)
    Connects a free function with payload or a bound member to a delegate.
    Definition: delegate.hpp:188
    -
    entt::delegate
    Basic delegate implementation.
    Definition: delegate.hpp:66
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:645
    +
    11 #include "fwd.hpp"
    +
    12 
    +
    13 namespace entt {
    +
    14 
    +
    20 namespace internal {
    +
    21 
    +
    22 template<typename Ret, typename... Args>
    +
    23 auto function_pointer(Ret (*)(Args...)) -> Ret (*)(Args...);
    +
    24 
    +
    25 template<typename Ret, typename Type, typename... Args, typename Other>
    +
    26 auto function_pointer(Ret (*)(Type, Args...), Other &&) -> Ret (*)(Args...);
    +
    27 
    +
    28 template<typename Class, typename Ret, typename... Args, typename... Other>
    +
    29 auto function_pointer(Ret (Class::*)(Args...), Other &&...) -> Ret (*)(Args...);
    +
    30 
    +
    31 template<typename Class, typename Ret, typename... Args, typename... Other>
    +
    32 auto function_pointer(Ret (Class::*)(Args...) const, Other &&...) -> Ret (*)(Args...);
    +
    33 
    +
    34 template<typename Class, typename Type, typename... Other>
    +
    35 auto function_pointer(Type Class::*, Other &&...) -> Type (*)();
    +
    36 
    +
    37 template<typename... Type>
    +
    38 using function_pointer_t = decltype(internal::function_pointer(std::declval<Type>()...));
    +
    39 
    +
    40 template<typename... Class, typename Ret, typename... Args>
    +
    41 [[nodiscard]] constexpr auto index_sequence_for(Ret (*)(Args...)) {
    +
    42  return std::index_sequence_for<Class..., Args...>{};
    +
    43 }
    +
    44 
    +
    45 } // namespace internal
    +
    46 
    +
    53 template<auto>
    +
    54 struct connect_arg_t {};
    +
    55 
    +
    57 template<auto Func>
    +
    58 inline constexpr connect_arg_t<Func> connect_arg{};
    +
    59 
    +
    66 template<typename>
    +
    67 class delegate;
    +
    68 
    +
    81 template<typename Ret, typename... Args>
    +
    82 class delegate<Ret(Args...)> {
    +
    83  template<auto Candidate, std::size_t... Index>
    +
    84  [[nodiscard]] auto wrap(std::index_sequence<Index...>) ENTT_NOEXCEPT {
    +
    85  return [](const void *, Args... args) -> Ret {
    +
    86  [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);
    +
    87  return static_cast<Ret>(std::invoke(Candidate, std::forward<type_list_element_t<Index, type_list<Args...>>>(std::get<Index>(arguments))...));
    +
    88  };
    +
    89  }
    +
    90 
    +
    91  template<auto Candidate, typename Type, std::size_t... Index>
    +
    92  [[nodiscard]] auto wrap(Type &, std::index_sequence<Index...>) ENTT_NOEXCEPT {
    +
    93  return [](const void *payload, Args... args) -> Ret {
    +
    94  [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);
    +
    95  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    +
    96  return static_cast<Ret>(std::invoke(Candidate, *curr, std::forward<type_list_element_t<Index, type_list<Args...>>>(std::get<Index>(arguments))...));
    +
    97  };
    +
    98  }
    +
    99 
    +
    100  template<auto Candidate, typename Type, std::size_t... Index>
    +
    101  [[nodiscard]] auto wrap(Type *, std::index_sequence<Index...>) ENTT_NOEXCEPT {
    +
    102  return [](const void *payload, Args... args) -> Ret {
    +
    103  [[maybe_unused]] const auto arguments = std::forward_as_tuple(std::forward<Args>(args)...);
    +
    104  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    +
    105  return static_cast<Ret>(std::invoke(Candidate, curr, std::forward<type_list_element_t<Index, type_list<Args...>>>(std::get<Index>(arguments))...));
    +
    106  };
    +
    107  }
    +
    108 
    +
    109 public:
    +
    111  using function_type = Ret(const void *, Args...);
    +
    113  using type = Ret(Args...);
    +
    115  using result_type = Ret;
    +
    116 
    +
    118  delegate() ENTT_NOEXCEPT
    +
    119  : instance{nullptr},
    +
    120  fn{nullptr} {}
    +
    121 
    +
    127  template<auto Candidate>
    +
    128  delegate(connect_arg_t<Candidate>) ENTT_NOEXCEPT {
    +
    129  connect<Candidate>();
    +
    130  }
    +
    131 
    +
    139  template<auto Candidate, typename Type>
    +
    140  delegate(connect_arg_t<Candidate>, Type &&value_or_instance) ENTT_NOEXCEPT {
    +
    141  connect<Candidate>(std::forward<Type>(value_or_instance));
    +
    142  }
    +
    143 
    +
    150  delegate(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {
    +
    151  connect(function, payload);
    +
    152  }
    +
    153 
    +
    158  template<auto Candidate>
    +
    159  void connect() ENTT_NOEXCEPT {
    +
    160  instance = nullptr;
    +
    161 
    +
    162  if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Args...>) {
    +
    163  fn = [](const void *, Args... args) -> Ret {
    +
    164  return Ret(std::invoke(Candidate, std::forward<Args>(args)...));
    +
    165  };
    +
    166  } else if constexpr(std::is_member_pointer_v<decltype(Candidate)>) {
    +
    167  fn = wrap<Candidate>(internal::index_sequence_for<type_list_element_t<0, type_list<Args...>>>(internal::function_pointer_t<decltype(Candidate)>{}));
    +
    168  } else {
    +
    169  fn = wrap<Candidate>(internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate)>{}));
    +
    170  }
    +
    171  }
    +
    172 
    +
    188  template<auto Candidate, typename Type>
    +
    189  void connect(Type &value_or_instance) ENTT_NOEXCEPT {
    +
    190  instance = &value_or_instance;
    +
    191 
    +
    192  if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type &, Args...>) {
    +
    193  fn = [](const void *payload, Args... args) -> Ret {
    +
    194  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    +
    195  return Ret(std::invoke(Candidate, *curr, std::forward<Args>(args)...));
    +
    196  };
    +
    197  } else {
    +
    198  fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));
    +
    199  }
    +
    200  }
    +
    201 
    +
    212  template<auto Candidate, typename Type>
    +
    213  void connect(Type *value_or_instance) ENTT_NOEXCEPT {
    +
    214  instance = value_or_instance;
    +
    215 
    +
    216  if constexpr(std::is_invocable_r_v<Ret, decltype(Candidate), Type *, Args...>) {
    +
    217  fn = [](const void *payload, Args... args) -> Ret {
    +
    218  Type *curr = static_cast<Type *>(const_cast<constness_as_t<void, Type> *>(payload));
    +
    219  return Ret(std::invoke(Candidate, curr, std::forward<Args>(args)...));
    +
    220  };
    +
    221  } else {
    +
    222  fn = wrap<Candidate>(value_or_instance, internal::index_sequence_for(internal::function_pointer_t<decltype(Candidate), Type>{}));
    +
    223  }
    +
    224  }
    +
    225 
    +
    239  void connect(function_type *function, const void *payload = nullptr) ENTT_NOEXCEPT {
    +
    240  instance = payload;
    +
    241  fn = function;
    +
    242  }
    +
    243 
    +
    249  void reset() ENTT_NOEXCEPT {
    +
    250  instance = nullptr;
    +
    251  fn = nullptr;
    +
    252  }
    +
    253 
    +
    258  [[nodiscard]] const void *data() const ENTT_NOEXCEPT {
    +
    259  return instance;
    +
    260  }
    +
    261 
    +
    274  Ret operator()(Args... args) const {
    +
    275  ENTT_ASSERT(static_cast<bool>(*this), "Uninitialized delegate");
    +
    276  return fn(instance, std::forward<Args>(args)...);
    +
    277  }
    +
    278 
    +
    283  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    284  // no need to also test instance
    +
    285  return !(fn == nullptr);
    +
    286  }
    +
    287 
    +
    293  [[nodiscard]] bool operator==(const delegate<Ret(Args...)> &other) const ENTT_NOEXCEPT {
    +
    294  return fn == other.fn && instance == other.instance;
    +
    295  }
    +
    296 
    +
    297 private:
    +
    298  const void *instance;
    +
    299  function_type *fn;
    +
    300 };
    +
    301 
    +
    310 template<typename Ret, typename... Args>
    +
    311 [[nodiscard]] bool operator!=(const delegate<Ret(Args...)> &lhs, const delegate<Ret(Args...)> &rhs) ENTT_NOEXCEPT {
    +
    312  return !(lhs == rhs);
    +
    313 }
    +
    314 
    +
    319 template<auto Candidate>
    +
    320 delegate(connect_arg_t<Candidate>) -> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate)>>>;
    +
    321 
    +
    327 template<auto Candidate, typename Type>
    +
    328 delegate(connect_arg_t<Candidate>, Type &&) -> delegate<std::remove_pointer_t<internal::function_pointer_t<decltype(Candidate), Type>>>;
    +
    329 
    +
    335 template<typename Ret, typename... Args>
    +
    336 delegate(Ret (*)(const void *, Args...), const void * = nullptr) -> delegate<Ret(Args...)>;
    +
    337 
    +
    338 } // namespace entt
    +
    339 
    +
    340 #endif
    +
    entt::delegate< Ret(Args...)>::operator()
    Ret operator()(Args... args) const
    Triggers a delegate.
    Definition: delegate.hpp:274
    +
    entt::delegate< Ret(Args...)>::function_type
    Ret(const void *, Args...) function_type
    Function type of the contained target.
    Definition: delegate.hpp:111
    +
    entt::delegate< Ret(Args...)>::reset
    void reset()
    Resets a delegate.
    Definition: delegate.hpp:249
    +
    entt::delegate< Ret(Args...)>::delegate
    delegate()
    Default constructor.
    Definition: delegate.hpp:118
    +
    entt::delegate< Ret(Args...)>::delegate
    delegate(connect_arg_t< Candidate >)
    Constructs a delegate and connects a free function or an unbound member.
    Definition: delegate.hpp:128
    +
    entt::delegate< Ret(Args...)>::connect
    void connect(function_type *function, const void *payload=nullptr)
    Connects an user defined function with optional payload to a delegate.
    Definition: delegate.hpp:239
    +
    entt::delegate< Ret(Args...)>::delegate
    delegate(connect_arg_t< Candidate >, Type &&value_or_instance)
    Constructs a delegate and connects a free function with payload or a bound member.
    Definition: delegate.hpp:140
    +
    entt::delegate< Ret(Args...)>::result_type
    Ret result_type
    Return type of the delegate.
    Definition: delegate.hpp:115
    +
    entt::delegate< Ret(Args...)>::connect
    void connect(Type *value_or_instance)
    Connects a free function with payload or a bound member to a delegate.
    Definition: delegate.hpp:213
    +
    entt::delegate< Ret(Args...)>::operator==
    bool operator==(const delegate< Ret(Args...)> &other) const
    Compares the contents of two delegates.
    Definition: delegate.hpp:293
    +
    entt::delegate< Ret(Args...)>::data
    const void * data() const
    Returns the instance or the payload linked to a delegate, if any.
    Definition: delegate.hpp:258
    +
    entt::delegate< Ret(Args...)>::connect
    void connect()
    Connects a free function or an unbound member to a delegate.
    Definition: delegate.hpp:159
    +
    entt::delegate< Ret(Args...)>::type
    Ret(Args...) type
    Function type of the delegate.
    Definition: delegate.hpp:113
    +
    entt::delegate< Ret(Args...)>::delegate
    delegate(function_type *function, const void *payload=nullptr)
    Constructs a delegate and connects an user defined function with optional payload.
    Definition: delegate.hpp:150
    +
    entt::delegate< Ret(Args...)>::connect
    void connect(Type &value_or_instance)
    Connects a free function with payload or a bound member to a delegate.
    Definition: delegate.hpp:189
    +
    entt::delegate
    Basic delegate implementation.
    Definition: delegate.hpp:67
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::constness_as_t
    typename constness_as< To, From >::type constness_as_t
    Alias template to facilitate the transcription of the constness.
    Definition: type_traits.hpp:618
    entt::delegate
    delegate(connect_arg_t< Candidate >) -> delegate< std::remove_pointer_t< internal::function_pointer_t< decltype(Candidate)>>>
    Deduction guide.
    entt::type_list_element_t
    typename type_list_element< Index, List >::type type_list_element_t
    Helper type.
    Definition: type_traits.hpp:148
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    -
    entt::connect_arg
    constexpr connect_arg_t< Func > connect_arg
    Constant of type connect_arg_t used to disambiguate calls.
    Definition: delegate.hpp:57
    -
    entt::connect_arg_t
    Used to wrap a function or a member of a specified type.
    Definition: delegate.hpp:53
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    +
    entt::connect_arg
    constexpr connect_arg_t< Func > connect_arg
    Constant of type connect_arg_t used to disambiguate calls.
    Definition: delegate.hpp:58
    +
    entt::connect_arg_t
    Used to wrap a function or a member of a specified type.
    Definition: delegate.hpp:54
    entt::type_list
    A class to use to push around lists of types, nothing more.
    Definition: type_traits.hpp:110
    diff --git a/dense__hash__map_8hpp_source.html b/dense__hash__map_8hpp_source.html deleted file mode 100644 index 7e1ce4b0d..000000000 --- a/dense__hash__map_8hpp_source.html +++ /dev/null @@ -1,810 +0,0 @@ - - - - - - - -EnTT: src/entt/container/dense_hash_map.hpp Source File - - - - - - - - - -
    -
    -
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -
    dense_hash_map.hpp
    -
    -
    -
    1 #ifndef ENTT_CONTAINER_DENSE_HASH_MAP_HPP
    -
    2 #define ENTT_CONTAINER_DENSE_HASH_MAP_HPP
    -
    3 
    -
    4 #include <algorithm>
    -
    5 #include <cmath>
    -
    6 #include <cstddef>
    -
    7 #include <functional>
    -
    8 #include <iterator>
    -
    9 #include <limits>
    -
    10 #include <memory>
    -
    11 #include <tuple>
    -
    12 #include <type_traits>
    -
    13 #include <utility>
    -
    14 #include <vector>
    -
    15 #include "../config/config.h"
    -
    16 #include "../core/compressed_pair.hpp"
    -
    17 #include "../core/memory.hpp"
    -
    18 #include "../core/type_traits.hpp"
    -
    19 #include "fwd.hpp"
    -
    20 
    -
    21 namespace entt {
    -
    22 
    -
    28 namespace internal {
    -
    29 
    -
    30 template<typename Key, typename Type>
    -
    31 struct dense_hash_map_node final {
    -
    32  template<typename... Args>
    -
    33  dense_hash_map_node(const std::size_t pos, Args &&...args)
    -
    34  : next{pos},
    -
    35  element{std::forward<Args>(args)...} {}
    -
    36 
    -
    37  std::size_t next;
    -
    38  std::pair<Key, Type> element;
    -
    39 };
    -
    40 
    -
    41 template<typename It>
    -
    42 class dense_hash_map_iterator {
    -
    43  friend dense_hash_map_iterator<const std::remove_pointer_t<It> *>;
    -
    44 
    -
    45  using iterator_traits = std::iterator_traits<decltype(std::addressof(std::declval<It>()->element))>;
    -
    46 
    -
    47 public:
    -
    48  using value_type = typename iterator_traits::value_type;
    -
    49  using pointer = typename iterator_traits::pointer;
    -
    50  using reference = typename iterator_traits::reference;
    -
    51  using difference_type = typename iterator_traits::difference_type;
    -
    52  using iterator_category = std::random_access_iterator_tag;
    -
    53 
    -
    54  dense_hash_map_iterator() ENTT_NOEXCEPT = default;
    -
    55 
    -
    56  dense_hash_map_iterator(const It iter) ENTT_NOEXCEPT
    -
    57  : it{iter} {}
    -
    58 
    -
    59  template<bool Const = std::is_const_v<std::remove_pointer_t<It>>, typename = std::enable_if_t<Const>>
    -
    60  dense_hash_map_iterator(const dense_hash_map_iterator<std::remove_const_t<std::remove_pointer_t<It>> *> &other)
    -
    61  : it{other.it} {}
    -
    62 
    -
    63  dense_hash_map_iterator &operator++() ENTT_NOEXCEPT {
    -
    64  return ++it, *this;
    -
    65  }
    -
    66 
    -
    67  dense_hash_map_iterator operator++(int) ENTT_NOEXCEPT {
    -
    68  dense_hash_map_iterator orig = *this;
    -
    69  return ++(*this), orig;
    -
    70  }
    -
    71 
    -
    72  dense_hash_map_iterator &operator--() ENTT_NOEXCEPT {
    -
    73  return --it, *this;
    -
    74  }
    -
    75 
    -
    76  dense_hash_map_iterator operator--(int) ENTT_NOEXCEPT {
    -
    77  dense_hash_map_iterator orig = *this;
    -
    78  return operator--(), orig;
    -
    79  }
    -
    80 
    -
    81  dense_hash_map_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
    -
    82  it += value;
    -
    83  return *this;
    -
    84  }
    -
    85 
    -
    86  dense_hash_map_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
    -
    87  dense_hash_map_iterator copy = *this;
    -
    88  return (copy += value);
    -
    89  }
    -
    90 
    -
    91  dense_hash_map_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
    -
    92  return (*this += -value);
    -
    93  }
    -
    94 
    -
    95  dense_hash_map_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
    -
    96  return (*this + -value);
    -
    97  }
    -
    98 
    -
    99  [[nodiscard]] reference operator[](const difference_type value) const {
    -
    100  return it[value].element;
    -
    101  }
    -
    102 
    -
    103  [[nodiscard]] pointer operator->() const {
    -
    104  return std::addressof(it->element);
    -
    105  }
    -
    106 
    -
    107  [[nodiscard]] reference operator*() const {
    -
    108  return *operator->();
    -
    109  }
    -
    110 
    -
    111  template<typename ILhs, typename IRhs>
    -
    112  friend auto operator-(const dense_hash_map_iterator<ILhs> &, const dense_hash_map_iterator<IRhs> &) ENTT_NOEXCEPT;
    -
    113 
    -
    114  template<typename ILhs, typename IRhs>
    -
    115  friend bool operator==(const dense_hash_map_iterator<ILhs> &, const dense_hash_map_iterator<IRhs> &) ENTT_NOEXCEPT;
    -
    116 
    -
    117  template<typename ILhs, typename IRhs>
    -
    118  friend bool operator<(const dense_hash_map_iterator<ILhs> &, const dense_hash_map_iterator<IRhs> &) ENTT_NOEXCEPT;
    -
    119 
    -
    120 private:
    -
    121  It it;
    -
    122 };
    -
    123 
    -
    124 template<typename ILhs, typename IRhs>
    -
    125 [[nodiscard]] auto operator-(const dense_hash_map_iterator<ILhs> &lhs, const dense_hash_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    126  return lhs.it - rhs.it;
    -
    127 }
    -
    128 
    -
    129 template<typename ILhs, typename IRhs>
    -
    130 [[nodiscard]] bool operator==(const dense_hash_map_iterator<ILhs> &lhs, const dense_hash_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    131  return lhs.it == rhs.it;
    -
    132 }
    -
    133 
    -
    134 template<typename ILhs, typename IRhs>
    -
    135 [[nodiscard]] bool operator!=(const dense_hash_map_iterator<ILhs> &lhs, const dense_hash_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    136  return !(lhs == rhs);
    -
    137 }
    -
    138 
    -
    139 template<typename ILhs, typename IRhs>
    -
    140 [[nodiscard]] bool operator<(const dense_hash_map_iterator<ILhs> &lhs, const dense_hash_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    141  return lhs.it < rhs.it;
    -
    142 }
    -
    143 
    -
    144 template<typename ILhs, typename IRhs>
    -
    145 [[nodiscard]] bool operator>(const dense_hash_map_iterator<ILhs> &lhs, const dense_hash_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    146  return rhs < lhs;
    -
    147 }
    -
    148 
    -
    149 template<typename ILhs, typename IRhs>
    -
    150 [[nodiscard]] bool operator<=(const dense_hash_map_iterator<ILhs> &lhs, const dense_hash_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    151  return !(lhs > rhs);
    -
    152 }
    -
    153 
    -
    154 template<typename ILhs, typename IRhs>
    -
    155 [[nodiscard]] bool operator>=(const dense_hash_map_iterator<ILhs> &lhs, const dense_hash_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    156  return !(lhs < rhs);
    -
    157 }
    -
    158 
    -
    159 template<typename It>
    -
    160 class dense_hash_map_local_iterator {
    -
    161  friend dense_hash_map_local_iterator<const std::remove_pointer_t<It> *>;
    -
    162 
    -
    163  using iterator_traits = std::iterator_traits<decltype(std::addressof(std::declval<It>()->element))>;
    -
    164 
    -
    165 public:
    -
    166  using value_type = typename iterator_traits::value_type;
    -
    167  using pointer = typename iterator_traits::pointer;
    -
    168  using reference = typename iterator_traits::reference;
    -
    169  using difference_type = typename iterator_traits::difference_type;
    -
    170  using iterator_category = std::forward_iterator_tag;
    -
    171 
    -
    172  dense_hash_map_local_iterator() ENTT_NOEXCEPT = default;
    -
    173 
    -
    174  dense_hash_map_local_iterator(It iter, const std::size_t pos) ENTT_NOEXCEPT
    -
    175  : it{iter},
    -
    176  offset{pos} {}
    -
    177 
    -
    178  template<bool Const = std::is_const_v<std::remove_pointer_t<It>>, typename = std::enable_if_t<Const>>
    -
    179  dense_hash_map_local_iterator(const dense_hash_map_local_iterator<std::remove_const_t<std::remove_pointer_t<It>> *> &other)
    -
    180  : it{other.it},
    -
    181  offset{other.offset} {}
    -
    182 
    -
    183  dense_hash_map_local_iterator &operator++() ENTT_NOEXCEPT {
    -
    184  return offset = it[offset].next, *this;
    -
    185  }
    -
    186 
    -
    187  dense_hash_map_local_iterator operator++(int) ENTT_NOEXCEPT {
    -
    188  dense_hash_map_local_iterator orig = *this;
    -
    189  return ++(*this), orig;
    -
    190  }
    -
    191 
    -
    192  [[nodiscard]] pointer operator->() const {
    -
    193  return std::addressof(it[offset].element);
    -
    194  }
    -
    195 
    -
    196  [[nodiscard]] reference operator*() const {
    -
    197  return *operator->();
    -
    198  }
    -
    199 
    -
    200  [[nodiscard]] std::size_t index() const ENTT_NOEXCEPT {
    -
    201  return offset;
    -
    202  }
    -
    203 
    -
    204 private:
    -
    205  It it;
    -
    206  std::size_t offset;
    -
    207 };
    -
    208 
    -
    209 template<typename ILhs, typename IRhs>
    -
    210 [[nodiscard]] bool operator==(const dense_hash_map_local_iterator<ILhs> &lhs, const dense_hash_map_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    211  return lhs.index() == rhs.index();
    -
    212 }
    -
    213 
    -
    214 template<typename ILhs, typename IRhs>
    -
    215 [[nodiscard]] bool operator!=(const dense_hash_map_local_iterator<ILhs> &lhs, const dense_hash_map_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    216  return !(lhs == rhs);
    -
    217 }
    -
    218 
    -
    219 } // namespace internal
    -
    220 
    -
    239 template<typename Key, typename Type, typename Hash, typename KeyEqual, typename Allocator>
    -
    240 class dense_hash_map final {
    -
    241  static constexpr float default_threshold = 0.875f;
    -
    242  static constexpr std::size_t minimum_capacity = 8u;
    -
    243 
    -
    244  using allocator_traits = std::allocator_traits<Allocator>;
    -
    245  using alloc = typename allocator_traits::template rebind_alloc<std::pair<const Key, Type>>;
    -
    246  using alloc_traits = typename std::allocator_traits<alloc>;
    -
    247 
    -
    248  using node_type = internal::dense_hash_map_node<const Key, Type>;
    -
    249  using sparse_container_type = std::vector<std::size_t, typename alloc_traits::template rebind_alloc<std::size_t>>;
    -
    250  using packed_container_type = std::vector<node_type, typename alloc_traits::template rebind_alloc<node_type>>;
    -
    251 
    -
    252  [[nodiscard]] std::size_t hash_to_bucket(const std::size_t hash) const ENTT_NOEXCEPT {
    -
    253  return fast_mod(hash, bucket_count());
    -
    254  }
    -
    255 
    -
    256  template<typename Other>
    -
    257  [[nodiscard]] auto constrained_find(const Other &key, std::size_t bucket) {
    -
    258  for(auto it = begin(bucket), last = end(bucket); it != last; ++it) {
    -
    259  if(packed.second()(it->first, key)) {
    -
    260  return begin() + it.index();
    -
    261  }
    -
    262  }
    -
    263 
    -
    264  return end();
    -
    265  }
    -
    266 
    -
    267  template<typename Other>
    -
    268  [[nodiscard]] auto constrained_find(const Other &key, std::size_t bucket) const {
    -
    269  for(auto it = cbegin(bucket), last = cend(bucket); it != last; ++it) {
    -
    270  if(packed.second()(it->first, key)) {
    -
    271  return cbegin() + it.index();
    -
    272  }
    -
    273  }
    -
    274 
    -
    275  return cend();
    -
    276  }
    -
    277 
    -
    278  template<typename... Args>
    -
    279  [[nodiscard]] auto get_or_emplace(const Key &key, Args &&...args) {
    -
    280  const auto hash = sparse.second()(key);
    -
    281  auto index = hash_to_bucket(hash);
    -
    282 
    -
    283  if(auto it = constrained_find(key, index); it != end()) {
    -
    284  return std::make_pair(it, false);
    -
    285  }
    -
    286 
    -
    287  if(const auto count = size() + 1u; count > (bucket_count() * max_load_factor())) {
    -
    288  rehash(bucket_count() * 2u);
    -
    289  index = hash_to_bucket(hash);
    -
    290  }
    -
    291 
    -
    292  packed.first().emplace_back(sparse.first()[index], std::forward<Args>(args)...);
    -
    293  // update goes after emplace to enforce exception guarantees
    -
    294  sparse.first()[index] = size() - 1u;
    -
    295 
    -
    296  return std::make_pair(--end(), true);
    -
    297  }
    -
    298 
    -
    299  void move_and_pop(const std::size_t pos) {
    -
    300  if(const auto last = size() - 1u; pos != last) {
    -
    301  size_type *curr = sparse.first().data() + bucket(packed.first().back().element.first);
    -
    302  for(; *curr != last; curr = &packed.first()[*curr].next) {}
    -
    303  *curr = pos;
    -
    304 
    -
    305  using node_allocator_traits = typename alloc_traits::template rebind_traits<decltype(node_type::element)>;
    -
    306  typename node_allocator_traits::allocator_type allocator = packed.first().get_allocator();
    -
    307  auto *ptr = std::addressof(packed.first()[pos].element);
    -
    308 
    -
    309  std::destroy_at(ptr);
    -
    310  packed.first()[pos].next = packed.first().back().next;
    -
    311  // no exception guarantees when mapped type has a throwing move constructor (we're technically doomed)
    -
    312  node_allocator_traits::construct(allocator, ptr, std::move(packed.first().back().element));
    -
    313  }
    -
    314 
    -
    315  packed.first().pop_back();
    -
    316  }
    -
    317 
    -
    318 public:
    -
    320  using key_type = Key;
    -
    322  using mapped_type = Type;
    -
    324  using value_type = std::pair<const Key, Type>;
    -
    326  using size_type = std::size_t;
    -
    328  using hasher = Hash;
    -
    330  using key_equal = KeyEqual;
    -
    332  using allocator_type = Allocator;
    -
    334  using iterator = internal::dense_hash_map_iterator<typename packed_container_type::pointer>;
    -
    336  using const_iterator = internal::dense_hash_map_iterator<typename packed_container_type::const_pointer>;
    -
    338  using local_iterator = internal::dense_hash_map_local_iterator<typename packed_container_type::pointer>;
    -
    340  using const_local_iterator = internal::dense_hash_map_local_iterator<typename packed_container_type::const_pointer>;
    -
    341 
    -
    343  dense_hash_map()
    -
    344  : dense_hash_map(minimum_capacity) {}
    -
    345 
    -
    350  explicit dense_hash_map(const allocator_type &allocator)
    -
    351  : dense_hash_map{minimum_capacity, hasher{}, key_equal{}, allocator} {}
    -
    352 
    -
    359  dense_hash_map(const size_type bucket_count, const allocator_type &allocator)
    -
    360  : dense_hash_map{bucket_count, hasher{}, key_equal{}, allocator} {}
    -
    361 
    -
    369  dense_hash_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    -
    370  : dense_hash_map{bucket_count, hash, key_equal{}, allocator} {}
    -
    371 
    -
    380  explicit dense_hash_map(const size_type bucket_count, const hasher &hash = hasher{}, const key_equal &equal = key_equal{}, const allocator_type &allocator = allocator_type())
    -
    381  : sparse{allocator, hash},
    -
    382  packed{allocator, equal},
    -
    383  threshold{default_threshold} {
    -
    384  rehash(bucket_count);
    -
    385  }
    -
    386 
    -
    391  dense_hash_map(const dense_hash_map &other)
    -
    392  : dense_hash_map{other, alloc_traits::select_on_container_copy_construction(other.get_allocator())} {}
    -
    393 
    -
    399  dense_hash_map(const dense_hash_map &other, const allocator_type &allocator)
    -
    400  : sparse{sparse_container_type{other.sparse.first(), allocator}, other.sparse.second()},
    -
    401  // cannot copy the container directly due to a nasty issue of apple clang :(
    -
    402  packed{packed_container_type{other.packed.first().begin(), other.packed.first().end(), allocator}, other.packed.second()},
    -
    403  threshold{other.threshold} {
    -
    404  }
    -
    405 
    -
    410  dense_hash_map(dense_hash_map &&other) ENTT_NOEXCEPT = default;
    -
    411 
    -
    417  dense_hash_map(dense_hash_map &&other, const allocator_type &allocator) ENTT_NOEXCEPT
    -
    418  : sparse{sparse_container_type{std::move(other.sparse.first()), allocator}, std::move(other.sparse.second())},
    -
    419  // cannot move the container directly due to a nasty issue of apple clang :(
    -
    420  packed{packed_container_type{std::make_move_iterator(other.packed.first().begin()), std::make_move_iterator(other.packed.first().end()), allocator}, std::move(other.packed.second())},
    -
    421  threshold{other.threshold} {}
    -
    422 
    -
    424  ~dense_hash_map() = default;
    -
    425 
    -
    431  dense_hash_map &operator=(const dense_hash_map &other) {
    -
    432  threshold = other.threshold;
    -
    433  sparse.first().clear();
    -
    434  packed.first().clear();
    -
    435  rehash(other.bucket_count());
    -
    436  packed.first().reserve(other.packed.first().size());
    -
    437  insert(other.cbegin(), other.cend());
    -
    438  return *this;
    -
    439  }
    -
    440 
    -
    446  dense_hash_map &operator=(dense_hash_map &&other) ENTT_NOEXCEPT = default;
    -
    447 
    -
    452  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
    -
    453  return sparse.first().get_allocator();
    -
    454  }
    -
    455 
    -
    464  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
    -
    465  return packed.first().data();
    -
    466  }
    -
    467 
    -
    469  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
    -
    470  return cbegin();
    -
    471  }
    -
    472 
    -
    474  [[nodiscard]] iterator begin() ENTT_NOEXCEPT {
    -
    475  return packed.first().data();
    -
    476  }
    -
    477 
    -
    488  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
    -
    489  return packed.first().data() + size();
    -
    490  }
    -
    491 
    -
    493  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
    -
    494  return cend();
    -
    495  }
    -
    496 
    -
    498  [[nodiscard]] iterator end() ENTT_NOEXCEPT {
    -
    499  return packed.first().data() + size();
    -
    500  }
    -
    501 
    -
    506  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    -
    507  return packed.first().empty();
    -
    508  }
    -
    509 
    -
    514  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
    -
    515  return packed.first().size();
    -
    516  }
    -
    517 
    -
    519  void clear() ENTT_NOEXCEPT {
    -
    520  sparse.first().clear();
    -
    521  packed.first().clear();
    -
    522  rehash(0u);
    -
    523  }
    -
    524 
    -
    532  std::pair<iterator, bool> insert(const value_type &value) {
    -
    533  return emplace(value);
    -
    534  }
    -
    535 
    -
    537  std::pair<iterator, bool> insert(value_type &&value) {
    -
    538  return emplace(std::move(value));
    -
    539  }
    -
    540 
    -
    545  template<typename Arg>
    -
    546  std::enable_if_t<std::is_constructible_v<value_type, Arg &&>, std::pair<iterator, bool>>
    -
    547  insert(Arg &&value) {
    -
    548  return emplace(std::forward<Arg>(value));
    -
    549  }
    -
    550 
    -
    557  template<typename It>
    -
    558  void insert(It first, It last) {
    -
    559  for(; first != last; ++first) {
    -
    560  emplace(*first);
    -
    561  }
    -
    562  }
    -
    563 
    -
    573  template<typename Arg>
    -
    574  std::pair<iterator, bool> insert_or_assign(const key_type &key, Arg &&value) {
    -
    575  auto result = try_emplace(key, std::forward<Arg>(value));
    -
    576 
    -
    577  if(!result.second) {
    -
    578  result.first->second = std::forward<Arg>(value);
    -
    579  }
    -
    580 
    -
    581  return result;
    -
    582  }
    -
    583 
    -
    585  template<typename Arg>
    -
    586  std::pair<iterator, bool> insert_or_assign(key_type &&key, Arg &&value) {
    -
    587  auto result = try_emplace(std::move(key), std::forward<Arg>(value));
    -
    588 
    -
    589  if(!result.second) {
    -
    590  result.first->second = std::forward<Arg>(value);
    -
    591  }
    -
    592 
    -
    593  return result;
    -
    594  }
    -
    595 
    -
    605  template<typename... Args>
    -
    606  std::pair<iterator, bool> emplace(Args &&...args) {
    -
    607  if constexpr(sizeof...(Args) == 0u) {
    -
    608  return get_or_emplace(key_type{});
    -
    609  } else if constexpr(sizeof...(Args) == 1u) {
    -
    610  return get_or_emplace(args.first..., std::forward<Args>(args)...);
    -
    611  } else if constexpr(sizeof...(Args) == 2u) {
    -
    612  return get_or_emplace(std::get<0u>(std::tie(args...)), std::forward<Args>(args)...);
    -
    613  } else {
    -
    614  static_assert(sizeof...(Args) == 3u, "Invalid arguments");
    -
    615  return emplace(std::pair<key_type, mapped_type>{std::forward<Args>(args)...});
    -
    616  }
    -
    617  }
    -
    618 
    -
    630  template<typename... Args>
    -
    631  std::pair<iterator, bool> try_emplace(const key_type &key, Args &&...args) {
    -
    632  return get_or_emplace(key, std::piecewise_construct, std::forward_as_tuple(key), std::forward_as_tuple(std::forward<Args>(args)...));
    -
    633  }
    -
    634 
    -
    636  template<typename... Args>
    -
    637  std::pair<iterator, bool> try_emplace(key_type &&key, Args &&...args) {
    -
    638  return get_or_emplace(key, std::piecewise_construct, std::forward_as_tuple(std::move(key)), std::forward_as_tuple(std::forward<Args>(args)...));
    -
    639  }
    -
    640 
    -
    646  iterator erase(const_iterator pos) {
    -
    647  const auto dist = std::distance(cbegin(), pos);
    -
    648  erase(pos->first);
    -
    649  return begin() + dist;
    -
    650  }
    -
    651 
    -
    658  iterator erase(const_iterator first, const_iterator last) {
    -
    659  const auto dist = std::distance(cbegin(), first);
    -
    660 
    -
    661  for(auto rfirst = std::make_reverse_iterator(last), rlast = std::make_reverse_iterator(first); rfirst != rlast; ++rfirst) {
    -
    662  erase(rfirst->first);
    -
    663  }
    -
    664 
    -
    665  return dist > static_cast<decltype(dist)>(size()) ? end() : (begin() + dist);
    -
    666  }
    -
    667 
    -
    673  size_type erase(const key_type &key) {
    -
    674  for(size_type *curr = sparse.first().data() + bucket(key); *curr != std::numeric_limits<size_type>::max(); curr = &packed.first()[*curr].next) {
    -
    675  if(packed.second()(packed.first()[*curr].element.first, key)) {
    -
    676  const auto index = *curr;
    -
    677  *curr = packed.first()[*curr].next;
    -
    678  move_and_pop(index);
    -
    679  return true;
    -
    680  }
    -
    681  }
    -
    682 
    -
    683  return false;
    -
    684  }
    -
    685 
    -
    690  void swap(dense_hash_map &other) {
    -
    691  using std::swap;
    -
    692  swap(sparse, other.sparse);
    -
    693  swap(packed, other.packed);
    -
    694  swap(threshold, other.threshold);
    -
    695  }
    -
    696 
    -
    702  [[nodiscard]] Type &at(const key_type &key) {
    -
    703  auto it = find(key);
    -
    704  ENTT_ASSERT(it != end(), "Invalid key");
    -
    705  return it->second;
    -
    706  }
    -
    707 
    -
    709  [[nodiscard]] const Type &at(const key_type &key) const {
    -
    710  auto it = find(key);
    -
    711  ENTT_ASSERT(it != cend(), "Invalid key");
    -
    712  return it->second;
    -
    713  }
    -
    714 
    -
    720  [[nodiscard]] Type &operator[](const key_type &key) {
    -
    721  return try_emplace(key).first->second;
    -
    722  }
    -
    723 
    -
    729  [[nodiscard]] Type &operator[](key_type &&key) {
    -
    730  return try_emplace(std::move(key)).first->second;
    -
    731  }
    -
    732 
    -
    739  [[nodiscard]] iterator find(const key_type &key) {
    -
    740  return constrained_find(key, bucket(key));
    -
    741  }
    -
    742 
    -
    744  [[nodiscard]] const_iterator find(const key_type &key) const {
    -
    745  return constrained_find(key, bucket(key));
    -
    746  }
    -
    747 
    -
    756  template<typename Other>
    -
    757  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator>>
    -
    758  find(const Other &key) {
    -
    759  return constrained_find(key, bucket(key));
    -
    760  }
    -
    761 
    -
    763  template<typename Other>
    -
    764  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator>>
    -
    765  find(const Other &key) const {
    -
    766  return constrained_find(key, bucket(key));
    -
    767  }
    -
    768 
    -
    774  [[nodiscard]] bool contains(const key_type &key) const {
    -
    775  return (find(key) != cend());
    -
    776  }
    -
    777 
    -
    785  template<typename Other>
    -
    786  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool>>
    -
    787  contains(const Other &key) const {
    -
    788  return (find(key) != cend());
    -
    789  }
    -
    790 
    -
    796  [[nodiscard]] const_local_iterator cbegin(const size_type index) const {
    -
    797  return {packed.first().data(), sparse.first()[index]};
    -
    798  }
    -
    799 
    -
    805  [[nodiscard]] const_local_iterator begin(const size_type index) const {
    -
    806  return cbegin(index);
    -
    807  }
    -
    808 
    -
    814  [[nodiscard]] local_iterator begin(const size_type index) {
    -
    815  return {packed.first().data(), sparse.first()[index]};
    -
    816  }
    -
    817 
    -
    823  [[nodiscard]] const_local_iterator cend([[maybe_unused]] const size_type index) const {
    -
    824  return {packed.first().data(), std::numeric_limits<size_type>::max()};
    -
    825  }
    -
    826 
    -
    832  [[nodiscard]] const_local_iterator end([[maybe_unused]] const size_type index) const {
    -
    833  return cend(index);
    -
    834  }
    -
    835 
    -
    841  [[nodiscard]] local_iterator end([[maybe_unused]] const size_type index) {
    -
    842  return {packed.first().data(), std::numeric_limits<size_type>::max()};
    -
    843  }
    -
    844 
    -
    849  [[nodiscard]] size_type bucket_count() const {
    -
    850  return sparse.first().size();
    -
    851  }
    -
    852 
    -
    857  [[nodiscard]] size_type max_bucket_count() const {
    -
    858  return sparse.first().max_size();
    -
    859  }
    -
    860 
    -
    866  [[nodiscard]] size_type bucket_size(const size_type index) const {
    -
    867  return static_cast<size_type>(std::distance(begin(index), end(index)));
    -
    868  }
    -
    869 
    -
    875  [[nodiscard]] size_type bucket(const key_type &key) const {
    -
    876  return hash_to_bucket(sparse.second()(key));
    -
    877  }
    -
    878 
    -
    883  [[nodiscard]] float load_factor() const {
    -
    884  return size() / static_cast<float>(bucket_count());
    -
    885  }
    -
    886 
    -
    891  [[nodiscard]] float max_load_factor() const {
    -
    892  return threshold;
    -
    893  }
    -
    894 
    -
    899  void max_load_factor(const float value) {
    -
    900  ENTT_ASSERT(value > 0.f, "Invalid load factor");
    -
    901  threshold = value;
    -
    902  rehash(0u);
    -
    903  }
    -
    904 
    -
    910  void rehash(const size_type count) {
    -
    911  auto value = (std::max)(count, minimum_capacity);
    -
    912  value = (std::max)(value, static_cast<size_type>(size() / max_load_factor()));
    -
    913 
    -
    914  if(const auto sz = next_power_of_two(value); sz != bucket_count()) {
    -
    915  sparse.first().resize(sz);
    -
    916  std::fill(sparse.first().begin(), sparse.first().end(), std::numeric_limits<size_type>::max());
    -
    917 
    -
    918  for(size_type pos{}, last = size(); pos < last; ++pos) {
    -
    919  const auto index = bucket(packed.first()[pos].element.first);
    -
    920  packed.first()[pos].next = std::exchange(sparse.first()[index], pos);
    -
    921  }
    -
    922  }
    -
    923  }
    -
    924 
    -
    930  void reserve(const size_type count) {
    -
    931  packed.first().reserve(count);
    -
    932  rehash(static_cast<size_type>(std::ceil(count / max_load_factor())));
    -
    933  }
    -
    934 
    -
    939  [[nodiscard]] hasher hash_function() const {
    -
    940  return sparse.second();
    -
    941  }
    -
    942 
    -
    947  [[nodiscard]] key_equal key_eq() const {
    -
    948  return packed.second();
    -
    949  }
    -
    950 
    -
    951 private:
    -
    952  compressed_pair<sparse_container_type, hasher> sparse;
    -
    953  compressed_pair<packed_container_type, key_equal> packed;
    -
    954  float threshold;
    -
    955 };
    -
    956 
    -
    957 } // namespace entt
    -
    958 
    -
    959 #endif
    -
    entt::compressed_pair< sparse_container_type, hasher >
    -
    entt::compressed_pair::second
    second_type & second()
    Returns the second element that a pair stores.
    Definition: compressed_pair.hpp:185
    -
    entt::compressed_pair::first
    first_type & first()
    Returns the first element that a pair stores.
    Definition: compressed_pair.hpp:172
    -
    entt::dense_hash_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_hash_map.hpp:240
    -
    entt::dense_hash_map::insert
    void insert(It first, It last)
    Inserts elements into the container, if their keys do not exist.
    Definition: dense_hash_map.hpp:558
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map()
    Default constructor.
    Definition: dense_hash_map.hpp:343
    -
    entt::dense_hash_map::operator=
    dense_hash_map & operator=(const dense_hash_map &other)
    Copy assignment operator.
    Definition: dense_hash_map.hpp:431
    -
    entt::dense_hash_map::empty
    bool empty() const
    Checks whether a container is empty.
    Definition: dense_hash_map.hpp:506
    -
    entt::dense_hash_map::insert
    std::pair< iterator, bool > insert(const value_type &value)
    Inserts an element into the container, if the key does not exist.
    Definition: dense_hash_map.hpp:532
    -
    entt::dense_hash_map::load_factor
    float load_factor() const
    Returns the average number of elements per bucket.
    Definition: dense_hash_map.hpp:883
    -
    entt::dense_hash_map::max_bucket_count
    size_type max_bucket_count() const
    Returns the maximum number of buckets.
    Definition: dense_hash_map.hpp:857
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(dense_hash_map &&other)=default
    Default move constructor.
    -
    entt::dense_hash_map::end
    const_iterator end() const
    Returns an iterator to the end.
    Definition: dense_hash_map.hpp:493
    -
    entt::dense_hash_map::erase
    size_type erase(const key_type &key)
    Removes the element associated with a given key.
    Definition: dense_hash_map.hpp:673
    -
    entt::dense_hash_map::at
    Type & at(const key_type &key)
    Accesses a given element with bounds checking.
    Definition: dense_hash_map.hpp:702
    -
    entt::dense_hash_map::hasher
    Hash hasher
    Type of function to use to hash the keys.
    Definition: dense_hash_map.hpp:328
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(const size_type bucket_count, const allocator_type &allocator)
    Constructs an empty container with a given allocator and user supplied minimal number of buckets.
    Definition: dense_hash_map.hpp:359
    -
    entt::dense_hash_map::find
    const_iterator find(const key_type &key) const
    Finds an element with a given key.
    Definition: dense_hash_map.hpp:744
    -
    entt::dense_hash_map::contains
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains(const Other &key) const
    Checks if the container contains an element with a key that compares equivalent to a given value.
    Definition: dense_hash_map.hpp:787
    -
    entt::dense_hash_map::find
    iterator find(const key_type &key)
    Finds an element with a given key.
    Definition: dense_hash_map.hpp:739
    -
    entt::dense_hash_map::emplace
    std::pair< iterator, bool > emplace(Args &&...args)
    Constructs an element in-place, if the key does not exist.
    Definition: dense_hash_map.hpp:606
    -
    entt::dense_hash_map::cbegin
    const_local_iterator cbegin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_hash_map.hpp:796
    -
    entt::dense_hash_map::insert_or_assign
    std::pair< iterator, bool > insert_or_assign(const key_type &key, Arg &&value)
    Inserts an element into the container or assigns to the current element if the key already exists.
    Definition: dense_hash_map.hpp:574
    -
    entt::dense_hash_map::max_load_factor
    float max_load_factor() const
    Returns the maximum average number of elements per bucket.
    Definition: dense_hash_map.hpp:891
    -
    entt::dense_hash_map::bucket_size
    size_type bucket_size(const size_type index) const
    Returns the number of elements in a given bucket.
    Definition: dense_hash_map.hpp:866
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(const dense_hash_map &other)
    Copy constructor.
    Definition: dense_hash_map.hpp:391
    -
    entt::dense_hash_map::const_iterator
    internal::dense_hash_map_iterator< typename packed_container_type::const_pointer > const_iterator
    Constant random access iterator type.
    Definition: dense_hash_map.hpp:336
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())
    Constructs an empty container with a given allocator, hash function, compare function and user suppli...
    Definition: dense_hash_map.hpp:380
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(const allocator_type &allocator)
    Constructs an empty container with a given allocator.
    Definition: dense_hash_map.hpp:350
    -
    entt::dense_hash_map::try_emplace
    std::pair< iterator, bool > try_emplace(key_type &&key, Args &&...args)
    Inserts in-place if the key does not exist, does nothing if the key exists.
    Definition: dense_hash_map.hpp:637
    -
    entt::dense_hash_map::erase
    iterator erase(const_iterator first, const_iterator last)
    Removes the given elements from a container.
    Definition: dense_hash_map.hpp:658
    -
    entt::dense_hash_map::get_allocator
    constexpr allocator_type get_allocator() const
    Returns the associated allocator.
    Definition: dense_hash_map.hpp:452
    -
    entt::dense_hash_map::value_type
    std::pair< const Key, Type > value_type
    Key-value type of the container.
    Definition: dense_hash_map.hpp:324
    -
    entt::dense_hash_map::operator[]
    Type & operator[](const key_type &key)
    Accesses or inserts a given element.
    Definition: dense_hash_map.hpp:720
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(const dense_hash_map &other, const allocator_type &allocator)
    Allocator-extended copy constructor.
    Definition: dense_hash_map.hpp:399
    -
    entt::dense_hash_map::size
    size_type size() const
    Returns the number of elements in a container.
    Definition: dense_hash_map.hpp:514
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(dense_hash_map &&other, const allocator_type &allocator)
    Allocator-extended move constructor.
    Definition: dense_hash_map.hpp:417
    -
    entt::dense_hash_map::end
    local_iterator end([[maybe_unused]] const size_type index)
    Returns an iterator to the end of a given bucket.
    Definition: dense_hash_map.hpp:841
    -
    entt::dense_hash_map::insert
    std::enable_if_t< std::is_constructible_v< value_type, Arg && >, std::pair< iterator, bool > > insert(Arg &&value)
    Inserts an element into the container, if the key does not exist.
    Definition: dense_hash_map.hpp:547
    -
    entt::dense_hash_map::operator=
    dense_hash_map & operator=(dense_hash_map &&other)=default
    Default move assignment operator.
    -
    entt::dense_hash_map::swap
    void swap(dense_hash_map &other)
    Exchanges the contents with those of a given container.
    Definition: dense_hash_map.hpp:690
    -
    entt::dense_hash_map::iterator
    internal::dense_hash_map_iterator< typename packed_container_type::pointer > iterator
    Random access iterator type.
    Definition: dense_hash_map.hpp:334
    -
    entt::dense_hash_map::cend
    const_iterator cend() const
    Returns an iterator to the end.
    Definition: dense_hash_map.hpp:488
    -
    entt::dense_hash_map::end
    iterator end()
    Returns an iterator to the end.
    Definition: dense_hash_map.hpp:498
    -
    entt::dense_hash_map::hash_function
    hasher hash_function() const
    Returns the function used to hash the keys.
    Definition: dense_hash_map.hpp:939
    -
    entt::dense_hash_map::bucket
    size_type bucket(const key_type &key) const
    Returns the bucket for a given key.
    Definition: dense_hash_map.hpp:875
    -
    entt::dense_hash_map::cend
    const_local_iterator cend([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_hash_map.hpp:823
    -
    entt::dense_hash_map::begin
    const_local_iterator begin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_hash_map.hpp:805
    -
    entt::dense_hash_map::clear
    void clear()
    Clears the container.
    Definition: dense_hash_map.hpp:519
    -
    entt::dense_hash_map::erase
    iterator erase(const_iterator pos)
    Removes an element from a given position.
    Definition: dense_hash_map.hpp:646
    -
    entt::dense_hash_map::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find(const Other &key) const
    Finds an element with a given key.
    Definition: dense_hash_map.hpp:765
    -
    entt::dense_hash_map::cbegin
    const_iterator cbegin() const
    Returns an iterator to the beginning.
    Definition: dense_hash_map.hpp:464
    -
    entt::dense_hash_map::begin
    iterator begin()
    Returns an iterator to the beginning.
    Definition: dense_hash_map.hpp:474
    -
    entt::dense_hash_map::rehash
    void rehash(const size_type count)
    Reserves at least the specified number of buckets and regenerates the hash table.
    Definition: dense_hash_map.hpp:910
    -
    entt::dense_hash_map::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: dense_hash_map.hpp:326
    -
    entt::dense_hash_map::contains
    bool contains(const key_type &key) const
    Checks if the container contains an element with a given key.
    Definition: dense_hash_map.hpp:774
    -
    entt::dense_hash_map::bucket_count
    size_type bucket_count() const
    Returns the number of buckets.
    Definition: dense_hash_map.hpp:849
    -
    entt::dense_hash_map::max_load_factor
    void max_load_factor(const float value)
    Sets the desired maximum average number of elements per bucket.
    Definition: dense_hash_map.hpp:899
    -
    entt::dense_hash_map::dense_hash_map
    dense_hash_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    Constructs an empty container with a given allocator, hash function and user supplied minimal number ...
    Definition: dense_hash_map.hpp:369
    -
    entt::dense_hash_map::key_equal
    KeyEqual key_equal
    Type of function to use to compare the keys for equality.
    Definition: dense_hash_map.hpp:330
    -
    entt::dense_hash_map::insert_or_assign
    std::pair< iterator, bool > insert_or_assign(key_type &&key, Arg &&value)
    Inserts an element into the container or assigns to the current element if the key already exists.
    Definition: dense_hash_map.hpp:586
    -
    entt::dense_hash_map::begin
    local_iterator begin(const size_type index)
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_hash_map.hpp:814
    -
    entt::dense_hash_map::key_type
    Key key_type
    Key type of the container.
    Definition: dense_hash_map.hpp:320
    -
    entt::dense_hash_map::reserve
    void reserve(const size_type count)
    Reserves space for at least the specified number of elements and regenerates the hash table.
    Definition: dense_hash_map.hpp:930
    -
    entt::dense_hash_map::const_local_iterator
    internal::dense_hash_map_local_iterator< typename packed_container_type::const_pointer > const_local_iterator
    Constant forward iterator type.
    Definition: dense_hash_map.hpp:340
    -
    entt::dense_hash_map::allocator_type
    Allocator allocator_type
    Allocator type.
    Definition: dense_hash_map.hpp:332
    -
    entt::dense_hash_map::begin
    const_iterator begin() const
    Returns an iterator to the beginning.
    Definition: dense_hash_map.hpp:469
    -
    entt::dense_hash_map::local_iterator
    internal::dense_hash_map_local_iterator< typename packed_container_type::pointer > local_iterator
    Forward iterator type.
    Definition: dense_hash_map.hpp:338
    -
    entt::dense_hash_map::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find(const Other &key)
    Finds an element with a key that compares equivalent to a given value.
    Definition: dense_hash_map.hpp:758
    -
    entt::dense_hash_map::try_emplace
    std::pair< iterator, bool > try_emplace(const key_type &key, Args &&...args)
    Inserts in-place if the key does not exist, does nothing if the key exists.
    Definition: dense_hash_map.hpp:631
    -
    entt::dense_hash_map::operator[]
    Type & operator[](key_type &&key)
    Accesses or inserts a given element.
    Definition: dense_hash_map.hpp:729
    -
    entt::dense_hash_map::insert
    std::pair< iterator, bool > insert(value_type &&value)
    Inserts an element into the container, if the key does not exist.
    Definition: dense_hash_map.hpp:537
    -
    entt::dense_hash_map::key_eq
    key_equal key_eq() const
    Returns the function used to compare keys for equality.
    Definition: dense_hash_map.hpp:947
    -
    entt::dense_hash_map::at
    const Type & at(const key_type &key) const
    Accesses a given element with bounds checking.
    Definition: dense_hash_map.hpp:709
    -
    entt::dense_hash_map::end
    const_local_iterator end([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_hash_map.hpp:832
    -
    entt::dense_hash_map::mapped_type
    Type mapped_type
    Mapped type of the container.
    Definition: dense_hash_map.hpp:322
    -
    entt::dense_hash_map::~dense_hash_map
    ~dense_hash_map()=default
    Default destructor.
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:217
    -
    entt::fast_mod
    constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
    Fast module utility function (powers of two only).
    Definition: memory.hpp:101
    -
    entt::operator<=
    constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:254
    -
    entt::next_power_of_two
    constexpr std::size_t next_power_of_two(const std::size_t value)
    Computes the smallest power of two greater than or equal to a value.
    Definition: memory.hpp:84
    -
    entt::operator>=
    constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:280
    -
    entt::operator+
    constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
    Concatenates multiple type lists.
    Definition: type_traits.hpp:157
    -
    entt::operator<
    constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:241
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    -
    entt::operator>
    constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:267
    -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/dense__hash__set_8hpp_source.html b/dense__hash__set_8hpp_source.html deleted file mode 100644 index f082cfc8e..000000000 --- a/dense__hash__set_8hpp_source.html +++ /dev/null @@ -1,735 +0,0 @@ - - - - - - - -EnTT: src/entt/container/dense_hash_set.hpp Source File - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -
    dense_hash_set.hpp
    -
    -
    -
    1 #ifndef ENTT_CONTAINER_DENSE_HASH_SET_HPP
    -
    2 #define ENTT_CONTAINER_DENSE_HASH_SET_HPP
    -
    3 
    -
    4 #include <algorithm>
    -
    5 #include <cmath>
    -
    6 #include <cstddef>
    -
    7 #include <functional>
    -
    8 #include <iterator>
    -
    9 #include <limits>
    -
    10 #include <memory>
    -
    11 #include <tuple>
    -
    12 #include <type_traits>
    -
    13 #include <utility>
    -
    14 #include <vector>
    -
    15 #include "../config/config.h"
    -
    16 #include "../core/compressed_pair.hpp"
    -
    17 #include "../core/memory.hpp"
    -
    18 #include "../core/type_traits.hpp"
    -
    19 #include "fwd.hpp"
    -
    20 
    -
    21 namespace entt {
    -
    22 
    -
    28 namespace internal {
    -
    29 
    -
    30 template<typename Type>
    -
    31 struct dense_hash_set_node final {
    -
    32  template<typename... Args>
    -
    33  dense_hash_set_node(const std::size_t pos, Args &&...args)
    -
    34  : next{pos},
    -
    35  element{std::forward<Args>(args)...} {}
    -
    36 
    -
    37  std::size_t next;
    -
    38  Type element;
    -
    39 };
    -
    40 
    -
    41 template<typename It>
    -
    42 class dense_hash_set_iterator {
    -
    43  friend dense_hash_set_iterator<const std::remove_pointer_t<It> *>;
    -
    44 
    -
    45  using iterator_traits = std::iterator_traits<decltype(std::addressof(std::as_const(std::declval<It>()->element)))>;
    -
    46 
    -
    47 public:
    -
    48  using value_type = typename iterator_traits::value_type;
    -
    49  using pointer = typename iterator_traits::pointer;
    -
    50  using reference = typename iterator_traits::reference;
    -
    51  using difference_type = typename iterator_traits::difference_type;
    -
    52  using iterator_category = std::random_access_iterator_tag;
    -
    53 
    -
    54  dense_hash_set_iterator() ENTT_NOEXCEPT = default;
    -
    55 
    -
    56  dense_hash_set_iterator(const It iter) ENTT_NOEXCEPT
    -
    57  : it{iter} {}
    -
    58 
    -
    59  template<bool Const = std::is_const_v<std::remove_pointer_t<It>>, typename = std::enable_if_t<Const>>
    -
    60  dense_hash_set_iterator(const dense_hash_set_iterator<std::remove_const_t<std::remove_pointer_t<It>> *> &other)
    -
    61  : it{other.it} {}
    -
    62 
    -
    63  dense_hash_set_iterator &operator++() ENTT_NOEXCEPT {
    -
    64  return ++it, *this;
    -
    65  }
    -
    66 
    -
    67  dense_hash_set_iterator operator++(int) ENTT_NOEXCEPT {
    -
    68  dense_hash_set_iterator orig = *this;
    -
    69  return ++(*this), orig;
    -
    70  }
    -
    71 
    -
    72  dense_hash_set_iterator &operator--() ENTT_NOEXCEPT {
    -
    73  return --it, *this;
    -
    74  }
    -
    75 
    -
    76  dense_hash_set_iterator operator--(int) ENTT_NOEXCEPT {
    -
    77  dense_hash_set_iterator orig = *this;
    -
    78  return operator--(), orig;
    -
    79  }
    -
    80 
    -
    81  dense_hash_set_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
    -
    82  it += value;
    -
    83  return *this;
    -
    84  }
    -
    85 
    -
    86  dense_hash_set_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
    -
    87  dense_hash_set_iterator copy = *this;
    -
    88  return (copy += value);
    -
    89  }
    -
    90 
    -
    91  dense_hash_set_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
    -
    92  return (*this += -value);
    -
    93  }
    -
    94 
    -
    95  dense_hash_set_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
    -
    96  return (*this + -value);
    -
    97  }
    -
    98 
    -
    99  [[nodiscard]] reference operator[](const difference_type value) const {
    -
    100  return it[value].element;
    -
    101  }
    -
    102 
    -
    103  [[nodiscard]] pointer operator->() const {
    -
    104  return std::addressof(it->element);
    -
    105  }
    -
    106 
    -
    107  [[nodiscard]] reference operator*() const {
    -
    108  return *operator->();
    -
    109  }
    -
    110 
    -
    111  template<typename ILhs, typename IRhs>
    -
    112  friend auto operator-(const dense_hash_set_iterator<ILhs> &, const dense_hash_set_iterator<IRhs> &) ENTT_NOEXCEPT;
    -
    113 
    -
    114  template<typename ILhs, typename IRhs>
    -
    115  friend bool operator==(const dense_hash_set_iterator<ILhs> &, const dense_hash_set_iterator<IRhs> &) ENTT_NOEXCEPT;
    -
    116 
    -
    117  template<typename ILhs, typename IRhs>
    -
    118  friend bool operator<(const dense_hash_set_iterator<ILhs> &, const dense_hash_set_iterator<IRhs> &) ENTT_NOEXCEPT;
    -
    119 
    -
    120 private:
    -
    121  It it;
    -
    122 };
    -
    123 
    -
    124 template<typename ILhs, typename IRhs>
    -
    125 [[nodiscard]] auto operator-(const dense_hash_set_iterator<ILhs> &lhs, const dense_hash_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    126  return lhs.it - rhs.it;
    -
    127 }
    -
    128 
    -
    129 template<typename ILhs, typename IRhs>
    -
    130 [[nodiscard]] bool operator==(const dense_hash_set_iterator<ILhs> &lhs, const dense_hash_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    131  return lhs.it == rhs.it;
    -
    132 }
    -
    133 
    -
    134 template<typename ILhs, typename IRhs>
    -
    135 [[nodiscard]] bool operator!=(const dense_hash_set_iterator<ILhs> &lhs, const dense_hash_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    136  return !(lhs == rhs);
    -
    137 }
    -
    138 
    -
    139 template<typename ILhs, typename IRhs>
    -
    140 [[nodiscard]] bool operator<(const dense_hash_set_iterator<ILhs> &lhs, const dense_hash_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    141  return lhs.it < rhs.it;
    -
    142 }
    -
    143 
    -
    144 template<typename ILhs, typename IRhs>
    -
    145 [[nodiscard]] bool operator>(const dense_hash_set_iterator<ILhs> &lhs, const dense_hash_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    146  return rhs < lhs;
    -
    147 }
    -
    148 
    -
    149 template<typename ILhs, typename IRhs>
    -
    150 [[nodiscard]] bool operator<=(const dense_hash_set_iterator<ILhs> &lhs, const dense_hash_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    151  return !(lhs > rhs);
    -
    152 }
    -
    153 
    -
    154 template<typename ILhs, typename IRhs>
    -
    155 [[nodiscard]] bool operator>=(const dense_hash_set_iterator<ILhs> &lhs, const dense_hash_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    156  return !(lhs < rhs);
    -
    157 }
    -
    158 
    -
    159 template<typename It>
    -
    160 class dense_hash_set_local_iterator {
    -
    161  friend dense_hash_set_local_iterator<const std::remove_pointer_t<It> *>;
    -
    162 
    -
    163  using iterator_traits = std::iterator_traits<decltype(std::addressof(std::as_const(std::declval<It>()->element)))>;
    -
    164 
    -
    165 public:
    -
    166  using value_type = typename iterator_traits::value_type;
    -
    167  using pointer = typename iterator_traits::pointer;
    -
    168  using reference = typename iterator_traits::reference;
    -
    169  using difference_type = typename iterator_traits::difference_type;
    -
    170  using iterator_category = std::forward_iterator_tag;
    -
    171 
    -
    172  dense_hash_set_local_iterator() ENTT_NOEXCEPT = default;
    -
    173 
    -
    174  dense_hash_set_local_iterator(It iter, const std::size_t pos) ENTT_NOEXCEPT
    -
    175  : it{iter},
    -
    176  offset{pos} {}
    -
    177 
    -
    178  template<bool Const = std::is_const_v<std::remove_pointer_t<It>>, typename = std::enable_if_t<Const>>
    -
    179  dense_hash_set_local_iterator(const dense_hash_set_local_iterator<std::remove_const_t<std::remove_pointer_t<It>> *> &other)
    -
    180  : it{other.it},
    -
    181  offset{other.offset} {}
    -
    182 
    -
    183  dense_hash_set_local_iterator &operator++() ENTT_NOEXCEPT {
    -
    184  return offset = it[offset].next, *this;
    -
    185  }
    -
    186 
    -
    187  dense_hash_set_local_iterator operator++(int) ENTT_NOEXCEPT {
    -
    188  dense_hash_set_local_iterator orig = *this;
    -
    189  return ++(*this), orig;
    -
    190  }
    -
    191 
    -
    192  [[nodiscard]] pointer operator->() const {
    -
    193  return std::addressof(it[offset].element);
    -
    194  }
    -
    195 
    -
    196  [[nodiscard]] reference operator*() const {
    -
    197  return *operator->();
    -
    198  }
    -
    199 
    -
    200  [[nodiscard]] std::size_t index() const ENTT_NOEXCEPT {
    -
    201  return offset;
    -
    202  }
    -
    203 
    -
    204 private:
    -
    205  It it;
    -
    206  std::size_t offset;
    -
    207 };
    -
    208 
    -
    209 template<typename ILhs, typename IRhs>
    -
    210 [[nodiscard]] bool operator==(const dense_hash_set_local_iterator<ILhs> &lhs, const dense_hash_set_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    211  return lhs.index() == rhs.index();
    -
    212 }
    -
    213 
    -
    214 template<typename ILhs, typename IRhs>
    -
    215 [[nodiscard]] bool operator!=(const dense_hash_set_local_iterator<ILhs> &lhs, const dense_hash_set_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    -
    216  return !(lhs == rhs);
    -
    217 }
    -
    218 
    -
    219 } // namespace internal
    -
    220 
    -
    238 template<typename Type, typename Hash, typename KeyEqual, typename Allocator>
    -
    239 class dense_hash_set final {
    -
    240  static constexpr float default_threshold = 0.875f;
    -
    241  static constexpr std::size_t minimum_capacity = 8u;
    -
    242 
    -
    243  using allocator_traits = std::allocator_traits<Allocator>;
    -
    244  using alloc = typename allocator_traits::template rebind_alloc<Type>;
    -
    245  using alloc_traits = typename std::allocator_traits<alloc>;
    -
    246 
    -
    247  using node_type = internal::dense_hash_set_node<Type>;
    -
    248  using sparse_container_type = std::vector<std::size_t, typename alloc_traits::template rebind_alloc<std::size_t>>;
    -
    249  using packed_container_type = std::vector<node_type, typename alloc_traits::template rebind_alloc<node_type>>;
    -
    250 
    -
    251  [[nodiscard]] std::size_t hash_to_bucket(const std::size_t hash) const ENTT_NOEXCEPT {
    -
    252  return fast_mod(hash, bucket_count());
    -
    253  }
    -
    254 
    -
    255  template<typename Other>
    -
    256  [[nodiscard]] auto constrained_find(const Other &value, std::size_t bucket) {
    -
    257  for(auto it = begin(bucket), last = end(bucket); it != last; ++it) {
    -
    258  if(packed.second()(*it, value)) {
    -
    259  return begin() + it.index();
    -
    260  }
    -
    261  }
    -
    262 
    -
    263  return end();
    -
    264  }
    -
    265 
    -
    266  template<typename Other>
    -
    267  [[nodiscard]] auto constrained_find(const Other &value, std::size_t bucket) const {
    -
    268  for(auto it = cbegin(bucket), last = cend(bucket); it != last; ++it) {
    -
    269  if(packed.second()(*it, value)) {
    -
    270  return cbegin() + it.index();
    -
    271  }
    -
    272  }
    -
    273 
    -
    274  return cend();
    -
    275  }
    -
    276 
    -
    277  template<typename Arg>
    -
    278  [[nodiscard]] auto get_or_emplace(Arg &&arg) {
    -
    279  const auto hash = sparse.second()(arg);
    -
    280  auto index = hash_to_bucket(hash);
    -
    281 
    -
    282  if(auto it = constrained_find(arg, index); it != end()) {
    -
    283  return std::make_pair(it, false);
    -
    284  }
    -
    285 
    -
    286  if(const auto count = size() + 1u; count > (bucket_count() * max_load_factor())) {
    -
    287  rehash(bucket_count() * 2u);
    -
    288  index = hash_to_bucket(hash);
    -
    289  }
    -
    290 
    -
    291  packed.first().emplace_back(sparse.first()[index], std::forward<Arg>(arg));
    -
    292  // update goes after emplace to enforce exception guarantees
    -
    293  sparse.first()[index] = size() - 1u;
    -
    294 
    -
    295  return std::make_pair(--end(), true);
    -
    296  }
    -
    297 
    -
    298  template<typename Other>
    -
    299  bool do_erase(const Other &value) {
    -
    300  for(size_type *curr = sparse.first().data() + bucket(value); *curr != std::numeric_limits<size_type>::max(); curr = &packed.first()[*curr].next) {
    -
    301  if(packed.second()(packed.first()[*curr].element, value)) {
    -
    302  const auto index = *curr;
    -
    303  *curr = packed.first()[*curr].next;
    -
    304  move_and_pop(index);
    -
    305  return true;
    -
    306  }
    -
    307  }
    -
    308 
    -
    309  return false;
    -
    310  }
    -
    311 
    -
    312  void move_and_pop(const std::size_t pos) {
    -
    313  if(const auto last = size() - 1u; pos != last) {
    -
    314  size_type *curr = sparse.first().data() + bucket(packed.first().back().element);
    -
    315  for(; *curr != last; curr = &packed.first()[*curr].next) {}
    -
    316  *curr = pos;
    -
    317 
    -
    318  // basic exception guarantees when value type has a throwing move constructor
    -
    319  packed.first()[pos] = std::move(packed.first().back());
    -
    320  }
    -
    321 
    -
    322  packed.first().pop_back();
    -
    323  }
    -
    324 
    -
    325 public:
    -
    327  using key_type = Type;
    -
    329  using value_type = Type;
    -
    331  using size_type = std::size_t;
    -
    333  using hasher = Hash;
    -
    335  using key_equal = KeyEqual;
    -
    337  using allocator_type = Allocator;
    -
    339  using iterator = internal::dense_hash_set_iterator<typename packed_container_type::pointer>;
    -
    341  using const_iterator = internal::dense_hash_set_iterator<typename packed_container_type::const_pointer>;
    -
    343  using local_iterator = internal::dense_hash_set_local_iterator<typename packed_container_type::pointer>;
    -
    345  using const_local_iterator = internal::dense_hash_set_local_iterator<typename packed_container_type::const_pointer>;
    -
    346 
    -
    348  dense_hash_set()
    -
    349  : dense_hash_set(minimum_capacity) {}
    -
    350 
    -
    355  explicit dense_hash_set(const allocator_type &allocator)
    -
    356  : dense_hash_set{minimum_capacity, hasher{}, key_equal{}, allocator} {}
    -
    357 
    -
    364  dense_hash_set(const size_type bucket_count, const allocator_type &allocator)
    -
    365  : dense_hash_set{bucket_count, hasher{}, key_equal{}, allocator} {}
    -
    366 
    -
    374  dense_hash_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    -
    375  : dense_hash_set{bucket_count, hash, key_equal{}, allocator} {}
    -
    376 
    -
    385  explicit dense_hash_set(const size_type bucket_count, const hasher &hash = hasher{}, const key_equal &equal = key_equal{}, const allocator_type &allocator = allocator_type())
    -
    386  : sparse{allocator, hash},
    -
    387  packed{allocator, equal},
    -
    388  threshold{default_threshold} {
    -
    389  rehash(bucket_count);
    -
    390  }
    -
    391 
    -
    396  dense_hash_set(const dense_hash_set &other)
    -
    397  : dense_hash_set{other, alloc_traits::select_on_container_copy_construction(other.get_allocator())} {}
    -
    398 
    -
    404  dense_hash_set(const dense_hash_set &other, const allocator_type &allocator)
    -
    405  : sparse{sparse_container_type{other.sparse.first(), allocator}, other.sparse.second()},
    -
    406  // cannot copy the container directly due to a nasty issue of apple clang :(
    -
    407  packed{packed_container_type{other.packed.first().begin(), other.packed.first().end(), allocator}, other.packed.second()},
    -
    408  threshold{other.threshold} {
    -
    409  }
    -
    410 
    -
    415  dense_hash_set(dense_hash_set &&other) ENTT_NOEXCEPT = default;
    -
    416 
    -
    422  dense_hash_set(dense_hash_set &&other, const allocator_type &allocator) ENTT_NOEXCEPT
    -
    423  : sparse{sparse_container_type{std::move(other.sparse.first()), allocator}, std::move(other.sparse.second())},
    -
    424  // cannot move the container directly due to a nasty issue of apple clang :(
    -
    425  packed{packed_container_type{std::make_move_iterator(other.packed.first().begin()), std::make_move_iterator(other.packed.first().end()), allocator}, std::move(other.packed.second())},
    -
    426  threshold{other.threshold} {}
    -
    427 
    -
    429  ~dense_hash_set() = default;
    -
    430 
    -
    436  dense_hash_set &operator=(const dense_hash_set &other) {
    -
    437  threshold = other.threshold;
    -
    438  sparse.first().clear();
    -
    439  packed.first().clear();
    -
    440  rehash(other.bucket_count());
    -
    441  packed.first().reserve(other.packed.first().size());
    -
    442  insert(other.cbegin(), other.cend());
    -
    443  return *this;
    -
    444  }
    -
    445 
    -
    451  dense_hash_set &operator=(dense_hash_set &&other) ENTT_NOEXCEPT = default;
    -
    452 
    -
    457  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
    -
    458  return sparse.first().get_allocator();
    -
    459  }
    -
    460 
    -
    469  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
    -
    470  return packed.first().data();
    -
    471  }
    -
    472 
    -
    474  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
    -
    475  return cbegin();
    -
    476  }
    -
    477 
    -
    479  [[nodiscard]] iterator begin() ENTT_NOEXCEPT {
    -
    480  return packed.first().data();
    -
    481  }
    -
    482 
    -
    493  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
    -
    494  return packed.first().data() + size();
    -
    495  }
    -
    496 
    -
    498  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
    -
    499  return cend();
    -
    500  }
    -
    501 
    -
    503  [[nodiscard]] iterator end() ENTT_NOEXCEPT {
    -
    504  return packed.first().data() + size();
    -
    505  }
    -
    506 
    -
    511  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    -
    512  return packed.first().empty();
    -
    513  }
    -
    514 
    -
    519  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
    -
    520  return packed.first().size();
    -
    521  }
    -
    522 
    -
    524  void clear() ENTT_NOEXCEPT {
    -
    525  sparse.first().clear();
    -
    526  packed.first().clear();
    -
    527  rehash(0u);
    -
    528  }
    -
    529 
    -
    537  std::pair<iterator, bool> insert(const value_type &value) {
    -
    538  return emplace(value);
    -
    539  }
    -
    540 
    -
    542  std::pair<iterator, bool> insert(value_type &&value) {
    -
    543  return emplace(std::move(value));
    -
    544  }
    -
    545 
    -
    552  template<typename It>
    -
    553  void insert(It first, It last) {
    -
    554  for(; first != last; ++first) {
    -
    555  emplace(*first);
    -
    556  }
    -
    557  }
    -
    558 
    -
    568  template<typename... Args>
    -
    569  std::pair<iterator, bool> emplace(Args &&...args) {
    -
    570  if constexpr(((sizeof...(Args) == 1u) && ... && std::is_same_v<std::remove_const_t<std::remove_reference_t<Args>>, value_type>)) {
    -
    571  return get_or_emplace(std::forward<Args>(args)...);
    -
    572  } else {
    -
    573  return get_or_emplace(value_type{std::forward<Args>(args)...});
    -
    574  }
    -
    575  }
    -
    576 
    -
    582  iterator erase(const_iterator pos) {
    -
    583  const auto dist = std::distance(cbegin(), pos);
    -
    584  erase(*pos);
    -
    585  return begin() + dist;
    -
    586  }
    -
    587 
    -
    594  iterator erase(const_iterator first, const_iterator last) {
    -
    595  const auto dist = std::distance(cbegin(), first);
    -
    596 
    -
    597  for(auto rfirst = std::make_reverse_iterator(last), rlast = std::make_reverse_iterator(first); rfirst != rlast; ++rfirst) {
    -
    598  erase(*rfirst);
    -
    599  }
    -
    600 
    -
    601  return dist > static_cast<decltype(dist)>(size()) ? end() : (begin() + dist);
    -
    602  }
    -
    603 
    -
    609  size_type erase(const value_type &value) {
    -
    610  return do_erase(value);
    -
    611  }
    -
    612 
    -
    617  void swap(dense_hash_set &other) {
    -
    618  using std::swap;
    -
    619  swap(sparse, other.sparse);
    -
    620  swap(packed, other.packed);
    -
    621  swap(threshold, other.threshold);
    -
    622  }
    -
    623 
    -
    630  [[nodiscard]] iterator find(const value_type &value) {
    -
    631  return constrained_find(value, bucket(value));
    -
    632  }
    -
    633 
    -
    635  [[nodiscard]] const_iterator find(const value_type &value) const {
    -
    636  return constrained_find(value, bucket(value));
    -
    637  }
    -
    638 
    -
    646  template<typename Other>
    -
    647  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator>>
    -
    648  find(const Other &value) {
    -
    649  return constrained_find(value, bucket(value));
    -
    650  }
    -
    651 
    -
    653  template<typename Other>
    -
    654  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator>>
    -
    655  find(const Other &value) const {
    -
    656  return constrained_find(value, bucket(value));
    -
    657  }
    -
    658 
    -
    664  [[nodiscard]] bool contains(const value_type &value) const {
    -
    665  return (find(value) != cend());
    -
    666  }
    -
    667 
    -
    675  template<typename Other>
    -
    676  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool>>
    -
    677  contains(const Other &value) const {
    -
    678  return (find(value) != cend());
    -
    679  }
    -
    680 
    -
    686  [[nodiscard]] const_local_iterator cbegin(const size_type index) const {
    -
    687  return {packed.first().data(), sparse.first()[index]};
    -
    688  }
    -
    689 
    -
    695  [[nodiscard]] const_local_iterator begin(const size_type index) const {
    -
    696  return cbegin(index);
    -
    697  }
    -
    698 
    -
    704  [[nodiscard]] local_iterator begin(const size_type index) {
    -
    705  return {packed.first().data(), sparse.first()[index]};
    -
    706  }
    -
    707 
    -
    713  [[nodiscard]] const_local_iterator cend([[maybe_unused]] const size_type index) const {
    -
    714  return {packed.first().data(), std::numeric_limits<size_type>::max()};
    -
    715  }
    -
    716 
    -
    722  [[nodiscard]] const_local_iterator end([[maybe_unused]] const size_type index) const {
    -
    723  return cend(index);
    -
    724  }
    -
    725 
    -
    731  [[nodiscard]] local_iterator end([[maybe_unused]] const size_type index) {
    -
    732  return {packed.first().data(), std::numeric_limits<size_type>::max()};
    -
    733  }
    -
    734 
    -
    739  [[nodiscard]] size_type bucket_count() const {
    -
    740  return sparse.first().size();
    -
    741  }
    -
    742 
    -
    747  [[nodiscard]] size_type max_bucket_count() const {
    -
    748  return sparse.first().max_size();
    -
    749  }
    -
    750 
    -
    756  [[nodiscard]] size_type bucket_size(const size_type index) const {
    -
    757  return static_cast<size_type>(std::distance(begin(index), end(index)));
    -
    758  }
    -
    759 
    -
    765  [[nodiscard]] size_type bucket(const value_type &value) const {
    -
    766  return hash_to_bucket(sparse.second()(value));
    -
    767  }
    -
    768 
    -
    773  [[nodiscard]] float load_factor() const {
    -
    774  return size() / static_cast<float>(bucket_count());
    -
    775  }
    -
    776 
    -
    781  [[nodiscard]] float max_load_factor() const {
    -
    782  return threshold;
    -
    783  }
    -
    784 
    -
    789  void max_load_factor(const float value) {
    -
    790  ENTT_ASSERT(value > 0.f, "Invalid load factor");
    -
    791  threshold = value;
    -
    792  rehash(0u);
    -
    793  }
    -
    794 
    -
    800  void rehash(const size_type count) {
    -
    801  auto value = (std::max)(count, minimum_capacity);
    -
    802  value = (std::max)(value, static_cast<size_type>(size() / max_load_factor()));
    -
    803 
    -
    804  if(const auto sz = next_power_of_two(value); sz != bucket_count()) {
    -
    805  sparse.first().resize(sz);
    -
    806  std::fill(sparse.first().begin(), sparse.first().end(), std::numeric_limits<size_type>::max());
    -
    807 
    -
    808  for(size_type pos{}, last = size(); pos < last; ++pos) {
    -
    809  const auto index = bucket(packed.first()[pos].element);
    -
    810  packed.first()[pos].next = std::exchange(sparse.first()[index], pos);
    -
    811  }
    -
    812  }
    -
    813  }
    -
    814 
    -
    820  void reserve(const size_type count) {
    -
    821  packed.first().reserve(count);
    -
    822  rehash(static_cast<size_type>(std::ceil(count / max_load_factor())));
    -
    823  }
    -
    824 
    -
    829  [[nodiscard]] hasher hash_function() const {
    -
    830  return sparse.second();
    -
    831  }
    -
    832 
    -
    837  [[nodiscard]] key_equal key_eq() const {
    -
    838  return packed.second();
    -
    839  }
    -
    840 
    -
    841 private:
    -
    842  compressed_pair<sparse_container_type, hasher> sparse;
    -
    843  compressed_pair<packed_container_type, key_equal> packed;
    -
    844  float threshold;
    -
    845 };
    -
    846 
    -
    847 } // namespace entt
    -
    848 
    -
    849 #endif
    -
    entt::compressed_pair< sparse_container_type, hasher >
    -
    entt::compressed_pair::second
    second_type & second()
    Returns the second element that a pair stores.
    Definition: compressed_pair.hpp:185
    -
    entt::compressed_pair::first
    first_type & first()
    Returns the first element that a pair stores.
    Definition: compressed_pair.hpp:172
    -
    entt::dense_hash_set
    Associative container for unique objects of a given type.
    Definition: dense_hash_set.hpp:239
    -
    entt::dense_hash_set::reserve
    void reserve(const size_type count)
    Reserves space for at least the specified number of elements and regenerates the hash table.
    Definition: dense_hash_set.hpp:820
    -
    entt::dense_hash_set::contains
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains(const Other &value) const
    Checks if the container contains an element that compares equivalent to a given value.
    Definition: dense_hash_set.hpp:677
    -
    entt::dense_hash_set::swap
    void swap(dense_hash_set &other)
    Exchanges the contents with those of a given container.
    Definition: dense_hash_set.hpp:617
    -
    entt::dense_hash_set::value_type
    Type value_type
    Value type of the container.
    Definition: dense_hash_set.hpp:329
    -
    entt::dense_hash_set::emplace
    std::pair< iterator, bool > emplace(Args &&...args)
    Constructs an element in-place, if it does not exist.
    Definition: dense_hash_set.hpp:569
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(dense_hash_set &&other, const allocator_type &allocator)
    Allocator-extended move constructor.
    Definition: dense_hash_set.hpp:422
    -
    entt::dense_hash_set::cend
    const_local_iterator cend([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_hash_set.hpp:713
    -
    entt::dense_hash_set::bucket
    size_type bucket(const value_type &value) const
    Returns the bucket for a given element.
    Definition: dense_hash_set.hpp:765
    -
    entt::dense_hash_set::find
    iterator find(const value_type &value)
    Finds an element with a given value.
    Definition: dense_hash_set.hpp:630
    -
    entt::dense_hash_set::const_local_iterator
    internal::dense_hash_set_local_iterator< typename packed_container_type::const_pointer > const_local_iterator
    Constant forward iterator type.
    Definition: dense_hash_set.hpp:345
    -
    entt::dense_hash_set::~dense_hash_set
    ~dense_hash_set()=default
    Default destructor.
    -
    entt::dense_hash_set::hash_function
    hasher hash_function() const
    Returns the function used to hash the elements.
    Definition: dense_hash_set.hpp:829
    -
    entt::dense_hash_set::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find(const Other &value) const
    Finds an element with a given value.
    Definition: dense_hash_set.hpp:655
    -
    entt::dense_hash_set::operator=
    dense_hash_set & operator=(const dense_hash_set &other)
    Copy assignment operator.
    Definition: dense_hash_set.hpp:436
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(const dense_hash_set &other, const allocator_type &allocator)
    Allocator-extended copy constructor.
    Definition: dense_hash_set.hpp:404
    -
    entt::dense_hash_set::max_load_factor
    float max_load_factor() const
    Returns the maximum average number of elements per bucket.
    Definition: dense_hash_set.hpp:781
    -
    entt::dense_hash_set::cbegin
    const_local_iterator cbegin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_hash_set.hpp:686
    -
    entt::dense_hash_set::erase
    iterator erase(const_iterator pos)
    Removes an element from a given position.
    Definition: dense_hash_set.hpp:582
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(const size_type bucket_count, const allocator_type &allocator)
    Constructs an empty container with a given allocator and user supplied minimal number of buckets.
    Definition: dense_hash_set.hpp:364
    -
    entt::dense_hash_set::const_iterator
    internal::dense_hash_set_iterator< typename packed_container_type::const_pointer > const_iterator
    Constant random access iterator type.
    Definition: dense_hash_set.hpp:341
    -
    entt::dense_hash_set::max_bucket_count
    size_type max_bucket_count() const
    Returns the maximum number of buckets.
    Definition: dense_hash_set.hpp:747
    -
    entt::dense_hash_set::clear
    void clear()
    Clears the container.
    Definition: dense_hash_set.hpp:524
    -
    entt::dense_hash_set::begin
    const_iterator begin() const
    Returns an iterator to the beginning.
    Definition: dense_hash_set.hpp:474
    -
    entt::dense_hash_set::key_equal
    KeyEqual key_equal
    Type of function to use to compare the elements for equality.
    Definition: dense_hash_set.hpp:335
    -
    entt::dense_hash_set::empty
    bool empty() const
    Checks whether a container is empty.
    Definition: dense_hash_set.hpp:511
    -
    entt::dense_hash_set::bucket_count
    size_type bucket_count() const
    Returns the number of buckets.
    Definition: dense_hash_set.hpp:739
    -
    entt::dense_hash_set::begin
    iterator begin()
    Returns an iterator to the beginning.
    Definition: dense_hash_set.hpp:479
    -
    entt::dense_hash_set::cbegin
    const_iterator cbegin() const
    Returns an iterator to the beginning.
    Definition: dense_hash_set.hpp:469
    -
    entt::dense_hash_set::get_allocator
    constexpr allocator_type get_allocator() const
    Returns the associated allocator.
    Definition: dense_hash_set.hpp:457
    -
    entt::dense_hash_set::key_type
    Type key_type
    Key type of the container.
    Definition: dense_hash_set.hpp:327
    -
    entt::dense_hash_set::begin
    const_local_iterator begin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_hash_set.hpp:695
    -
    entt::dense_hash_set::local_iterator
    internal::dense_hash_set_local_iterator< typename packed_container_type::pointer > local_iterator
    Forward iterator type.
    Definition: dense_hash_set.hpp:343
    -
    entt::dense_hash_set::erase
    size_type erase(const value_type &value)
    Removes the element associated with a given value.
    Definition: dense_hash_set.hpp:609
    -
    entt::dense_hash_set::begin
    local_iterator begin(const size_type index)
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_hash_set.hpp:704
    -
    entt::dense_hash_set::end
    local_iterator end([[maybe_unused]] const size_type index)
    Returns an iterator to the end of a given bucket.
    Definition: dense_hash_set.hpp:731
    -
    entt::dense_hash_set::insert
    std::pair< iterator, bool > insert(const value_type &value)
    Inserts an element into the container, if it does not exist.
    Definition: dense_hash_set.hpp:537
    -
    entt::dense_hash_set::end
    const_iterator end() const
    Returns an iterator to the end.
    Definition: dense_hash_set.hpp:498
    -
    entt::dense_hash_set::max_load_factor
    void max_load_factor(const float value)
    Sets the desired maximum average number of elements per bucket.
    Definition: dense_hash_set.hpp:789
    -
    entt::dense_hash_set::size
    size_type size() const
    Returns the number of elements in a container.
    Definition: dense_hash_set.hpp:519
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(dense_hash_set &&other)=default
    Default move constructor.
    -
    entt::dense_hash_set::iterator
    internal::dense_hash_set_iterator< typename packed_container_type::pointer > iterator
    Random access iterator type.
    Definition: dense_hash_set.hpp:339
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    Constructs an empty container with a given allocator, hash function and user supplied minimal number ...
    Definition: dense_hash_set.hpp:374
    -
    entt::dense_hash_set::bucket_size
    size_type bucket_size(const size_type index) const
    Returns the number of elements in a given bucket.
    Definition: dense_hash_set.hpp:756
    -
    entt::dense_hash_set::end
    const_local_iterator end([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_hash_set.hpp:722
    -
    entt::dense_hash_set::cend
    const_iterator cend() const
    Returns an iterator to the end.
    Definition: dense_hash_set.hpp:493
    -
    entt::dense_hash_set::end
    iterator end()
    Returns an iterator to the end.
    Definition: dense_hash_set.hpp:503
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type())
    Constructs an empty container with a given allocator, hash function, compare function and user suppli...
    Definition: dense_hash_set.hpp:385
    -
    entt::dense_hash_set::rehash
    void rehash(const size_type count)
    Reserves at least the specified number of buckets and regenerates the hash table.
    Definition: dense_hash_set.hpp:800
    -
    entt::dense_hash_set::operator=
    dense_hash_set & operator=(dense_hash_set &&other)=default
    Default move assignment operator.
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set()
    Default constructor.
    Definition: dense_hash_set.hpp:348
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(const allocator_type &allocator)
    Constructs an empty container with a given allocator.
    Definition: dense_hash_set.hpp:355
    -
    entt::dense_hash_set::dense_hash_set
    dense_hash_set(const dense_hash_set &other)
    Copy constructor.
    Definition: dense_hash_set.hpp:396
    -
    entt::dense_hash_set::insert
    void insert(It first, It last)
    Inserts elements into the container, if they do not exist.
    Definition: dense_hash_set.hpp:553
    -
    entt::dense_hash_set::key_eq
    key_equal key_eq() const
    Returns the function used to compare elements for equality.
    Definition: dense_hash_set.hpp:837
    -
    entt::dense_hash_set::erase
    iterator erase(const_iterator first, const_iterator last)
    Removes the given elements from a container.
    Definition: dense_hash_set.hpp:594
    -
    entt::dense_hash_set::load_factor
    float load_factor() const
    Returns the average number of elements per bucket.
    Definition: dense_hash_set.hpp:773
    -
    entt::dense_hash_set::allocator_type
    Allocator allocator_type
    Allocator type.
    Definition: dense_hash_set.hpp:337
    -
    entt::dense_hash_set::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: dense_hash_set.hpp:331
    -
    entt::dense_hash_set::insert
    std::pair< iterator, bool > insert(value_type &&value)
    Inserts an element into the container, if it does not exist.
    Definition: dense_hash_set.hpp:542
    -
    entt::dense_hash_set::hasher
    Hash hasher
    Type of function to use to hash the elements.
    Definition: dense_hash_set.hpp:333
    -
    entt::dense_hash_set::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find(const Other &value)
    Finds an element that compares equivalent to a given value.
    Definition: dense_hash_set.hpp:648
    -
    entt::dense_hash_set::contains
    bool contains(const value_type &value) const
    Checks if the container contains an element with a given value.
    Definition: dense_hash_set.hpp:664
    -
    entt::dense_hash_set::find
    const_iterator find(const value_type &value) const
    Finds an element with a given value.
    Definition: dense_hash_set.hpp:635
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:217
    -
    entt::fast_mod
    constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
    Fast module utility function (powers of two only).
    Definition: memory.hpp:101
    -
    entt::operator<=
    constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:254
    -
    entt::next_power_of_two
    constexpr std::size_t next_power_of_two(const std::size_t value)
    Computes the smallest power of two greater than or equal to a value.
    Definition: memory.hpp:84
    -
    entt::operator>=
    constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:280
    -
    entt::operator+
    constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
    Concatenates multiple type lists.
    Definition: type_traits.hpp:157
    -
    entt::operator<
    constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:241
    -
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:406
    -
    entt::operator>
    constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:267
    -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/dense__map_8hpp_source.html b/dense__map_8hpp_source.html new file mode 100644 index 000000000..b6622c497 --- /dev/null +++ b/dense__map_8hpp_source.html @@ -0,0 +1,834 @@ + + + + + + + +EnTT: src/entt/container/dense_map.hpp Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    dense_map.hpp
    +
    +
    +
    1 #ifndef ENTT_CONTAINER_DENSE_MAP_HPP
    +
    2 #define ENTT_CONTAINER_DENSE_MAP_HPP
    +
    3 
    +
    4 #include <algorithm>
    +
    5 #include <cmath>
    +
    6 #include <cstddef>
    +
    7 #include <functional>
    +
    8 #include <iterator>
    +
    9 #include <limits>
    +
    10 #include <memory>
    +
    11 #include <tuple>
    +
    12 #include <type_traits>
    +
    13 #include <utility>
    +
    14 #include <vector>
    +
    15 #include "../config/config.h"
    +
    16 #include "../core/compressed_pair.hpp"
    +
    17 #include "../core/iterator.hpp"
    +
    18 #include "../core/memory.hpp"
    +
    19 #include "../core/type_traits.hpp"
    +
    20 #include "fwd.hpp"
    +
    21 
    +
    22 namespace entt {
    +
    23 
    +
    29 namespace internal {
    +
    30 
    +
    31 template<typename Key, typename Type>
    +
    32 struct dense_map_node final {
    +
    33  using value_type = std::pair<Key, Type>;
    +
    34 
    +
    35  template<typename... Args>
    +
    36  dense_map_node(const std::size_t pos, Args &&...args)
    +
    37  : next{pos},
    +
    38  element{std::forward<Args>(args)...} {}
    +
    39 
    +
    40  template<typename Allocator, typename... Args>
    +
    41  dense_map_node(std::allocator_arg_t, const Allocator &allocator, const std::size_t pos, Args &&...args)
    +
    42  : next{pos},
    +
    43  element{entt::make_obj_using_allocator<value_type>(allocator, std::forward<Args>(args)...)} {}
    +
    44 
    +
    45  template<typename Allocator>
    +
    46  dense_map_node(std::allocator_arg_t, const Allocator &allocator, const dense_map_node &other)
    +
    47  : next{other.next},
    +
    48  element{entt::make_obj_using_allocator<value_type>(allocator, other.element)} {}
    +
    49 
    +
    50  template<typename Allocator>
    +
    51  dense_map_node(std::allocator_arg_t, const Allocator &allocator, dense_map_node &&other)
    +
    52  : next{other.next},
    +
    53  element{entt::make_obj_using_allocator<value_type>(allocator, std::move(other.element))} {}
    +
    54 
    +
    55  std::size_t next;
    +
    56  value_type element;
    +
    57 };
    +
    58 
    +
    59 template<typename It>
    +
    60 class dense_map_iterator final {
    +
    61  template<typename>
    +
    62  friend class dense_map_iterator;
    +
    63 
    +
    64  using first_type = decltype(std::as_const(std::declval<It>()->element.first));
    +
    65  using second_type = decltype((std::declval<It>()->element.second));
    +
    66 
    +
    67 public:
    +
    68  using value_type = std::pair<first_type, second_type>;
    +
    69  using pointer = input_iterator_pointer<value_type>;
    +
    70  using reference = value_type;
    +
    71  using difference_type = std::ptrdiff_t;
    +
    72  using iterator_category = std::input_iterator_tag;
    +
    73 
    +
    74  dense_map_iterator() ENTT_NOEXCEPT
    +
    75  : it{} {}
    +
    76 
    +
    77  dense_map_iterator(const It iter) ENTT_NOEXCEPT
    +
    78  : it{iter} {}
    +
    79 
    +
    80  template<typename Other, typename = std::enable_if_t<!std::is_same_v<It, Other> && std::is_constructible_v<It, Other>>>
    +
    81  dense_map_iterator(const dense_map_iterator<Other> &other) ENTT_NOEXCEPT
    +
    82  : it{other.it} {}
    +
    83 
    +
    84  dense_map_iterator &operator++() ENTT_NOEXCEPT {
    +
    85  return ++it, *this;
    +
    86  }
    +
    87 
    +
    88  dense_map_iterator operator++(int) ENTT_NOEXCEPT {
    +
    89  dense_map_iterator orig = *this;
    +
    90  return ++(*this), orig;
    +
    91  }
    +
    92 
    +
    93  dense_map_iterator &operator--() ENTT_NOEXCEPT {
    +
    94  return --it, *this;
    +
    95  }
    +
    96 
    +
    97  dense_map_iterator operator--(int) ENTT_NOEXCEPT {
    +
    98  dense_map_iterator orig = *this;
    +
    99  return operator--(), orig;
    +
    100  }
    +
    101 
    +
    102  dense_map_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
    +
    103  it += value;
    +
    104  return *this;
    +
    105  }
    +
    106 
    +
    107  dense_map_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
    +
    108  dense_map_iterator copy = *this;
    +
    109  return (copy += value);
    +
    110  }
    +
    111 
    +
    112  dense_map_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
    +
    113  return (*this += -value);
    +
    114  }
    +
    115 
    +
    116  dense_map_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
    +
    117  return (*this + -value);
    +
    118  }
    +
    119 
    +
    120  [[nodiscard]] reference operator[](const difference_type value) const ENTT_NOEXCEPT {
    +
    121  return {it[value].element.first, it[value].element.second};
    +
    122  }
    +
    123 
    +
    124  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    +
    125  return operator*();
    +
    126  }
    +
    127 
    +
    128  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
    +
    129  return {it->element.first, it->element.second};
    +
    130  }
    +
    131 
    +
    132  template<typename ILhs, typename IRhs>
    +
    133  friend std::ptrdiff_t operator-(const dense_map_iterator<ILhs> &, const dense_map_iterator<IRhs> &) ENTT_NOEXCEPT;
    +
    134 
    +
    135  template<typename ILhs, typename IRhs>
    +
    136  friend bool operator==(const dense_map_iterator<ILhs> &, const dense_map_iterator<IRhs> &) ENTT_NOEXCEPT;
    +
    137 
    +
    138  template<typename ILhs, typename IRhs>
    +
    139  friend bool operator<(const dense_map_iterator<ILhs> &, const dense_map_iterator<IRhs> &) ENTT_NOEXCEPT;
    +
    140 
    +
    141 private:
    +
    142  It it;
    +
    143 };
    +
    144 
    +
    145 template<typename ILhs, typename IRhs>
    +
    146 [[nodiscard]] std::ptrdiff_t operator-(const dense_map_iterator<ILhs> &lhs, const dense_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    147  return lhs.it - rhs.it;
    +
    148 }
    +
    149 
    +
    150 template<typename ILhs, typename IRhs>
    +
    151 [[nodiscard]] bool operator==(const dense_map_iterator<ILhs> &lhs, const dense_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    152  return lhs.it == rhs.it;
    +
    153 }
    +
    154 
    +
    155 template<typename ILhs, typename IRhs>
    +
    156 [[nodiscard]] bool operator!=(const dense_map_iterator<ILhs> &lhs, const dense_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    157  return !(lhs == rhs);
    +
    158 }
    +
    159 
    +
    160 template<typename ILhs, typename IRhs>
    +
    161 [[nodiscard]] bool operator<(const dense_map_iterator<ILhs> &lhs, const dense_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    162  return lhs.it < rhs.it;
    +
    163 }
    +
    164 
    +
    165 template<typename ILhs, typename IRhs>
    +
    166 [[nodiscard]] bool operator>(const dense_map_iterator<ILhs> &lhs, const dense_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    167  return rhs < lhs;
    +
    168 }
    +
    169 
    +
    170 template<typename ILhs, typename IRhs>
    +
    171 [[nodiscard]] bool operator<=(const dense_map_iterator<ILhs> &lhs, const dense_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    172  return !(lhs > rhs);
    +
    173 }
    +
    174 
    +
    175 template<typename ILhs, typename IRhs>
    +
    176 [[nodiscard]] bool operator>=(const dense_map_iterator<ILhs> &lhs, const dense_map_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    177  return !(lhs < rhs);
    +
    178 }
    +
    179 
    +
    180 template<typename It>
    +
    181 class dense_map_local_iterator final {
    +
    182  template<typename>
    +
    183  friend class dense_map_local_iterator;
    +
    184 
    +
    185  using first_type = decltype(std::as_const(std::declval<It>()->element.first));
    +
    186  using second_type = decltype((std::declval<It>()->element.second));
    +
    187 
    +
    188 public:
    +
    189  using value_type = std::pair<first_type, second_type>;
    +
    190  using pointer = input_iterator_pointer<value_type>;
    +
    191  using reference = value_type;
    +
    192  using difference_type = std::ptrdiff_t;
    +
    193  using iterator_category = std::input_iterator_tag;
    +
    194 
    +
    195  dense_map_local_iterator() ENTT_NOEXCEPT
    +
    196  : it{},
    +
    197  offset{} {}
    +
    198 
    +
    199  dense_map_local_iterator(It iter, const std::size_t pos) ENTT_NOEXCEPT
    +
    200  : it{iter},
    +
    201  offset{pos} {}
    +
    202 
    +
    203  template<typename Other, typename = std::enable_if_t<!std::is_same_v<It, Other> && std::is_constructible_v<It, Other>>>
    +
    204  dense_map_local_iterator(const dense_map_local_iterator<Other> &other) ENTT_NOEXCEPT
    +
    205  : it{other.it},
    +
    206  offset{other.offset} {}
    +
    207 
    +
    208  dense_map_local_iterator &operator++() ENTT_NOEXCEPT {
    +
    209  return offset = it[offset].next, *this;
    +
    210  }
    +
    211 
    +
    212  dense_map_local_iterator operator++(int) ENTT_NOEXCEPT {
    +
    213  dense_map_local_iterator orig = *this;
    +
    214  return ++(*this), orig;
    +
    215  }
    +
    216 
    +
    217  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    +
    218  return operator*();
    +
    219  }
    +
    220 
    +
    221  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
    +
    222  return {it[offset].element.first, it[offset].element.second};
    +
    223  }
    +
    224 
    +
    225  [[nodiscard]] std::size_t index() const ENTT_NOEXCEPT {
    +
    226  return offset;
    +
    227  }
    +
    228 
    +
    229 private:
    +
    230  It it;
    +
    231  std::size_t offset;
    +
    232 };
    +
    233 
    +
    234 template<typename ILhs, typename IRhs>
    +
    235 [[nodiscard]] bool operator==(const dense_map_local_iterator<ILhs> &lhs, const dense_map_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    236  return lhs.index() == rhs.index();
    +
    237 }
    +
    238 
    +
    239 template<typename ILhs, typename IRhs>
    +
    240 [[nodiscard]] bool operator!=(const dense_map_local_iterator<ILhs> &lhs, const dense_map_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    241  return !(lhs == rhs);
    +
    242 }
    +
    243 
    +
    244 } // namespace internal
    +
    245 
    +
    264 template<typename Key, typename Type, typename Hash, typename KeyEqual, typename Allocator>
    +
    265 class dense_map {
    +
    266  static constexpr float default_threshold = 0.875f;
    +
    267  static constexpr std::size_t minimum_capacity = 8u;
    +
    268 
    +
    269  using node_type = internal::dense_map_node<Key, Type>;
    +
    270  using alloc_traits = typename std::allocator_traits<Allocator>;
    +
    271  static_assert(std::is_same_v<typename alloc_traits::value_type, std::pair<const Key, Type>>, "Invalid value type");
    +
    272  using sparse_container_type = std::vector<std::size_t, typename alloc_traits::template rebind_alloc<std::size_t>>;
    +
    273  using packed_container_type = std::vector<node_type, typename alloc_traits::template rebind_alloc<node_type>>;
    +
    274 
    +
    275  template<typename Other>
    +
    276  [[nodiscard]] std::size_t key_to_bucket(const Other &key) const ENTT_NOEXCEPT {
    +
    277  return fast_mod(sparse.second()(key), bucket_count());
    +
    278  }
    +
    279 
    +
    280  template<typename Other>
    +
    281  [[nodiscard]] auto constrained_find(const Other &key, std::size_t bucket) {
    +
    282  for(auto it = begin(bucket), last = end(bucket); it != last; ++it) {
    +
    283  if(packed.second()(it->first, key)) {
    +
    284  return begin() + static_cast<typename iterator::difference_type>(it.index());
    +
    285  }
    +
    286  }
    +
    287 
    +
    288  return end();
    +
    289  }
    +
    290 
    +
    291  template<typename Other>
    +
    292  [[nodiscard]] auto constrained_find(const Other &key, std::size_t bucket) const {
    +
    293  for(auto it = cbegin(bucket), last = cend(bucket); it != last; ++it) {
    +
    294  if(packed.second()(it->first, key)) {
    +
    295  return cbegin() + static_cast<typename iterator::difference_type>(it.index());
    +
    296  }
    +
    297  }
    +
    298 
    +
    299  return cend();
    +
    300  }
    +
    301 
    +
    302  template<typename Other, typename... Args>
    +
    303  [[nodiscard]] auto insert_or_do_nothing(Other &&key, Args &&...args) {
    +
    304  const auto index = key_to_bucket(key);
    +
    305 
    +
    306  if(auto it = constrained_find(key, index); it != end()) {
    +
    307  return std::make_pair(it, false);
    +
    308  }
    +
    309 
    +
    310  packed.first().emplace_back(sparse.first()[index], std::piecewise_construct, std::forward_as_tuple(std::forward<Other>(key)), std::forward_as_tuple(std::forward<Args>(args)...));
    +
    311  sparse.first()[index] = packed.first().size() - 1u;
    +
    312  rehash_if_required();
    +
    313 
    +
    314  return std::make_pair(--end(), true);
    +
    315  }
    +
    316 
    +
    317  template<typename Other, typename Arg>
    +
    318  [[nodiscard]] auto insert_or_overwrite(Other &&key, Arg &&value) {
    +
    319  const auto index = key_to_bucket(key);
    +
    320 
    +
    321  if(auto it = constrained_find(key, index); it != end()) {
    +
    322  it->second = std::forward<Arg>(value);
    +
    323  return std::make_pair(it, false);
    +
    324  }
    +
    325 
    +
    326  packed.first().emplace_back(sparse.first()[index], std::forward<Other>(key), std::forward<Arg>(value));
    +
    327  sparse.first()[index] = packed.first().size() - 1u;
    +
    328  rehash_if_required();
    +
    329 
    +
    330  return std::make_pair(--end(), true);
    +
    331  }
    +
    332 
    +
    333  void move_and_pop(const std::size_t pos) {
    +
    334  if(const auto last = size() - 1u; pos != last) {
    +
    335  packed.first()[pos] = std::move(packed.first().back());
    +
    336  size_type *curr = sparse.first().data() + key_to_bucket(packed.first().back().element.first);
    +
    337  for(; *curr != last; curr = &packed.first()[*curr].next) {}
    +
    338  *curr = pos;
    +
    339  }
    +
    340 
    +
    341  packed.first().pop_back();
    +
    342  }
    +
    343 
    +
    344  void rehash_if_required() {
    +
    345  if(size() > (bucket_count() * max_load_factor())) {
    +
    346  rehash(bucket_count() * 2u);
    +
    347  }
    +
    348  }
    +
    349 
    +
    350 public:
    +
    352  using key_type = Key;
    +
    354  using mapped_type = Type;
    +
    356  using value_type = std::pair<const Key, Type>;
    +
    358  using size_type = std::size_t;
    +
    360  using hasher = Hash;
    +
    362  using key_equal = KeyEqual;
    +
    364  using allocator_type = Allocator;
    +
    366  using iterator = internal::dense_map_iterator<typename packed_container_type::iterator>;
    +
    368  using const_iterator = internal::dense_map_iterator<typename packed_container_type::const_iterator>;
    +
    370  using local_iterator = internal::dense_map_local_iterator<typename packed_container_type::iterator>;
    +
    372  using const_local_iterator = internal::dense_map_local_iterator<typename packed_container_type::const_iterator>;
    +
    373 
    +
    375  dense_map()
    +
    376  : dense_map(minimum_capacity) {}
    +
    377 
    +
    382  explicit dense_map(const allocator_type &allocator)
    +
    383  : dense_map{minimum_capacity, hasher{}, key_equal{}, allocator} {}
    +
    384 
    +
    391  dense_map(const size_type bucket_count, const allocator_type &allocator)
    +
    392  : dense_map{bucket_count, hasher{}, key_equal{}, allocator} {}
    +
    393 
    +
    401  dense_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    +
    402  : dense_map{bucket_count, hash, key_equal{}, allocator} {}
    +
    403 
    +
    412  explicit dense_map(const size_type bucket_count, const hasher &hash = hasher{}, const key_equal &equal = key_equal{}, const allocator_type &allocator = allocator_type{})
    +
    413  : sparse{allocator, hash},
    +
    414  packed{allocator, equal},
    +
    415  threshold{default_threshold} {
    +
    416  rehash(bucket_count);
    +
    417  }
    +
    418 
    +
    420  dense_map(const dense_map &) = default;
    +
    421 
    +
    427  dense_map(const dense_map &other, const allocator_type &allocator)
    +
    428  : sparse{std::piecewise_construct, std::forward_as_tuple(other.sparse.first(), allocator), std::forward_as_tuple(other.sparse.second())},
    +
    429  packed{std::piecewise_construct, std::forward_as_tuple(other.packed.first(), allocator), std::forward_as_tuple(other.packed.second())},
    +
    430  threshold{other.threshold} {}
    +
    431 
    +
    433  dense_map(dense_map &&) = default;
    +
    434 
    +
    440  dense_map(dense_map &&other, const allocator_type &allocator)
    +
    441  : sparse{std::piecewise_construct, std::forward_as_tuple(std::move(other.sparse.first()), allocator), std::forward_as_tuple(std::move(other.sparse.second()))},
    +
    442  packed{std::piecewise_construct, std::forward_as_tuple(std::move(other.packed.first()), allocator), std::forward_as_tuple(std::move(other.packed.second()))},
    +
    443  threshold{other.threshold} {}
    +
    444 
    +
    449  dense_map &operator=(const dense_map &) = default;
    +
    450 
    +
    455  dense_map &operator=(dense_map &&) = default;
    +
    456 
    +
    461  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
    +
    462  return sparse.first().get_allocator();
    +
    463  }
    +
    464 
    +
    473  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
    +
    474  return packed.first().begin();
    +
    475  }
    +
    476 
    +
    478  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
    +
    479  return cbegin();
    +
    480  }
    +
    481 
    +
    483  [[nodiscard]] iterator begin() ENTT_NOEXCEPT {
    +
    484  return packed.first().begin();
    +
    485  }
    +
    486 
    +
    497  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
    +
    498  return packed.first().end();
    +
    499  }
    +
    500 
    +
    502  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
    +
    503  return cend();
    +
    504  }
    +
    505 
    +
    507  [[nodiscard]] iterator end() ENTT_NOEXCEPT {
    +
    508  return packed.first().end();
    +
    509  }
    +
    510 
    +
    515  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    +
    516  return packed.first().empty();
    +
    517  }
    +
    518 
    +
    523  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
    +
    524  return packed.first().size();
    +
    525  }
    +
    526 
    +
    528  void clear() ENTT_NOEXCEPT {
    +
    529  sparse.first().clear();
    +
    530  packed.first().clear();
    +
    531  rehash(0u);
    +
    532  }
    +
    533 
    +
    541  std::pair<iterator, bool> insert(const value_type &value) {
    +
    542  return insert_or_do_nothing(value.first, value.second);
    +
    543  }
    +
    544 
    +
    546  std::pair<iterator, bool> insert(value_type &&value) {
    +
    547  return insert_or_do_nothing(std::move(value.first), std::move(value.second));
    +
    548  }
    +
    549 
    +
    554  template<typename Arg>
    +
    555  std::enable_if_t<std::is_constructible_v<value_type, Arg &&>, std::pair<iterator, bool>>
    +
    556  insert(Arg &&value) {
    +
    557  return insert_or_do_nothing(std::forward<Arg>(value).first, std::forward<Arg>(value).second);
    +
    558  }
    +
    559 
    +
    566  template<typename It>
    +
    567  void insert(It first, It last) {
    +
    568  for(; first != last; ++first) {
    +
    569  insert(*first);
    +
    570  }
    +
    571  }
    +
    572 
    +
    582  template<typename Arg>
    +
    583  std::pair<iterator, bool> insert_or_assign(const key_type &key, Arg &&value) {
    +
    584  return insert_or_overwrite(key, std::forward<Arg>(value));
    +
    585  }
    +
    586 
    +
    588  template<typename Arg>
    +
    589  std::pair<iterator, bool> insert_or_assign(key_type &&key, Arg &&value) {
    +
    590  return insert_or_overwrite(std::move(key), std::forward<Arg>(value));
    +
    591  }
    +
    592 
    +
    606  template<typename... Args>
    +
    607  std::pair<iterator, bool> emplace([[maybe_unused]] Args &&...args) {
    +
    608  if constexpr(sizeof...(Args) == 0u) {
    +
    609  return insert_or_do_nothing(key_type{});
    +
    610  } else if constexpr(sizeof...(Args) == 1u) {
    +
    611  return insert_or_do_nothing(std::forward<Args>(args).first..., std::forward<Args>(args).second...);
    +
    612  } else if constexpr(sizeof...(Args) == 2u) {
    +
    613  return insert_or_do_nothing(std::forward<Args>(args)...);
    +
    614  } else {
    +
    615  auto &node = packed.first().emplace_back(packed.first().size(), std::forward<Args>(args)...);
    +
    616  const auto index = key_to_bucket(node.element.first);
    +
    617 
    +
    618  if(auto it = constrained_find(node.element.first, index); it != end()) {
    +
    619  packed.first().pop_back();
    +
    620  return std::make_pair(it, false);
    +
    621  }
    +
    622 
    +
    623  std::swap(node.next, sparse.first()[index]);
    +
    624  rehash_if_required();
    +
    625 
    +
    626  return std::make_pair(--end(), true);
    +
    627  }
    +
    628  }
    +
    629 
    +
    641  template<typename... Args>
    +
    642  std::pair<iterator, bool> try_emplace(const key_type &key, Args &&...args) {
    +
    643  return insert_or_do_nothing(key, std::forward<Args>(args)...);
    +
    644  }
    +
    645 
    +
    647  template<typename... Args>
    +
    648  std::pair<iterator, bool> try_emplace(key_type &&key, Args &&...args) {
    +
    649  return insert_or_do_nothing(std::move(key), std::forward<Args>(args)...);
    +
    650  }
    +
    651 
    +
    657  iterator erase(const_iterator pos) {
    +
    658  const auto diff = pos - cbegin();
    +
    659  erase(pos->first);
    +
    660  return begin() + diff;
    +
    661  }
    +
    662 
    +
    669  iterator erase(const_iterator first, const_iterator last) {
    +
    670  const auto dist = first - cbegin();
    +
    671 
    +
    672  for(auto from = last - cbegin(); from != dist; --from) {
    +
    673  erase(packed.first()[from - 1u].element.first);
    +
    674  }
    +
    675 
    +
    676  return (begin() + dist);
    +
    677  }
    +
    678 
    +
    684  size_type erase(const key_type &key) {
    +
    685  for(size_type *curr = sparse.first().data() + key_to_bucket(key); *curr != (std::numeric_limits<size_type>::max)(); curr = &packed.first()[*curr].next) {
    +
    686  if(packed.second()(packed.first()[*curr].element.first, key)) {
    +
    687  const auto index = *curr;
    +
    688  *curr = packed.first()[*curr].next;
    +
    689  move_and_pop(index);
    +
    690  return 1u;
    +
    691  }
    +
    692  }
    +
    693 
    +
    694  return 0u;
    +
    695  }
    +
    696 
    +
    701  void swap(dense_map &other) {
    +
    702  using std::swap;
    +
    703  swap(sparse, other.sparse);
    +
    704  swap(packed, other.packed);
    +
    705  swap(threshold, other.threshold);
    +
    706  }
    +
    707 
    +
    713  [[nodiscard]] mapped_type &at(const key_type &key) {
    +
    714  auto it = find(key);
    +
    715  ENTT_ASSERT(it != end(), "Invalid key");
    +
    716  return it->second;
    +
    717  }
    +
    718 
    +
    720  [[nodiscard]] const mapped_type &at(const key_type &key) const {
    +
    721  auto it = find(key);
    +
    722  ENTT_ASSERT(it != cend(), "Invalid key");
    +
    723  return it->second;
    +
    724  }
    +
    725 
    +
    731  [[nodiscard]] mapped_type &operator[](const key_type &key) {
    +
    732  return insert_or_do_nothing(key).first->second;
    +
    733  }
    +
    734 
    +
    740  [[nodiscard]] mapped_type &operator[](key_type &&key) {
    +
    741  return insert_or_do_nothing(std::move(key)).first->second;
    +
    742  }
    +
    743 
    +
    750  [[nodiscard]] iterator find(const key_type &key) {
    +
    751  return constrained_find(key, key_to_bucket(key));
    +
    752  }
    +
    753 
    +
    755  [[nodiscard]] const_iterator find(const key_type &key) const {
    +
    756  return constrained_find(key, key_to_bucket(key));
    +
    757  }
    +
    758 
    +
    767  template<typename Other>
    +
    768  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator>>
    +
    769  find(const Other &key) {
    +
    770  return constrained_find(key, key_to_bucket(key));
    +
    771  }
    +
    772 
    +
    774  template<typename Other>
    +
    775  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator>>
    +
    776  find(const Other &key) const {
    +
    777  return constrained_find(key, key_to_bucket(key));
    +
    778  }
    +
    779 
    +
    785  [[nodiscard]] bool contains(const key_type &key) const {
    +
    786  return (find(key) != cend());
    +
    787  }
    +
    788 
    +
    796  template<typename Other>
    +
    797  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool>>
    +
    798  contains(const Other &key) const {
    +
    799  return (find(key) != cend());
    +
    800  }
    +
    801 
    +
    807  [[nodiscard]] const_local_iterator cbegin(const size_type index) const {
    +
    808  return {packed.first().begin(), sparse.first()[index]};
    +
    809  }
    +
    810 
    +
    816  [[nodiscard]] const_local_iterator begin(const size_type index) const {
    +
    817  return cbegin(index);
    +
    818  }
    +
    819 
    +
    825  [[nodiscard]] local_iterator begin(const size_type index) {
    +
    826  return {packed.first().begin(), sparse.first()[index]};
    +
    827  }
    +
    828 
    +
    834  [[nodiscard]] const_local_iterator cend([[maybe_unused]] const size_type index) const {
    +
    835  return {packed.first().begin(), (std::numeric_limits<size_type>::max)()};
    +
    836  }
    +
    837 
    +
    843  [[nodiscard]] const_local_iterator end([[maybe_unused]] const size_type index) const {
    +
    844  return cend(index);
    +
    845  }
    +
    846 
    +
    852  [[nodiscard]] local_iterator end([[maybe_unused]] const size_type index) {
    +
    853  return {packed.first().begin(), (std::numeric_limits<size_type>::max)()};
    +
    854  }
    +
    855 
    +
    860  [[nodiscard]] size_type bucket_count() const {
    +
    861  return sparse.first().size();
    +
    862  }
    +
    863 
    +
    868  [[nodiscard]] size_type max_bucket_count() const {
    +
    869  return sparse.first().max_size();
    +
    870  }
    +
    871 
    +
    877  [[nodiscard]] size_type bucket_size(const size_type index) const {
    +
    878  return static_cast<size_type>(std::distance(begin(index), end(index)));
    +
    879  }
    +
    880 
    +
    886  [[nodiscard]] size_type bucket(const key_type &key) const {
    +
    887  return key_to_bucket(key);
    +
    888  }
    +
    889 
    +
    894  [[nodiscard]] float load_factor() const {
    +
    895  return size() / static_cast<float>(bucket_count());
    +
    896  }
    +
    897 
    +
    902  [[nodiscard]] float max_load_factor() const {
    +
    903  return threshold;
    +
    904  }
    +
    905 
    +
    910  void max_load_factor(const float value) {
    +
    911  ENTT_ASSERT(value > 0.f, "Invalid load factor");
    +
    912  threshold = value;
    +
    913  rehash(0u);
    +
    914  }
    +
    915 
    +
    921  void rehash(const size_type count) {
    +
    922  auto value = (std::max)(count, minimum_capacity);
    +
    923  value = (std::max)(value, static_cast<size_type>(size() / max_load_factor()));
    +
    924 
    +
    925  if(const auto sz = next_power_of_two(value); sz != bucket_count()) {
    +
    926  sparse.first().resize(sz);
    +
    927  std::fill(sparse.first().begin(), sparse.first().end(), (std::numeric_limits<size_type>::max)());
    +
    928 
    +
    929  for(size_type pos{}, last = size(); pos < last; ++pos) {
    +
    930  const auto index = key_to_bucket(packed.first()[pos].element.first);
    +
    931  packed.first()[pos].next = std::exchange(sparse.first()[index], pos);
    +
    932  }
    +
    933  }
    +
    934  }
    +
    935 
    +
    941  void reserve(const size_type count) {
    +
    942  packed.first().reserve(count);
    +
    943  rehash(static_cast<size_type>(std::ceil(count / max_load_factor())));
    +
    944  }
    +
    945 
    +
    950  [[nodiscard]] hasher hash_function() const {
    +
    951  return sparse.second();
    +
    952  }
    +
    953 
    +
    958  [[nodiscard]] key_equal key_eq() const {
    +
    959  return packed.second();
    +
    960  }
    +
    961 
    +
    962 private:
    +
    963  compressed_pair<sparse_container_type, hasher> sparse;
    +
    964  compressed_pair<packed_container_type, key_equal> packed;
    +
    965  float threshold;
    +
    966 };
    +
    967 
    +
    968 } // namespace entt
    +
    969 
    +
    975 namespace std {
    +
    976 
    +
    977 template<typename Key, typename Value, typename Allocator>
    +
    978 struct uses_allocator<entt::internal::dense_map_node<Key, Value>, Allocator>
    +
    979  : std::true_type {};
    +
    980 
    +
    981 } // namespace std
    +
    982 
    +
    988 #endif
    +
    entt::compressed_pair< sparse_container_type, hasher >
    +
    entt::compressed_pair::second
    second_type & second()
    Returns the second element that a pair stores.
    Definition: compressed_pair.hpp:185
    +
    entt::compressed_pair::first
    first_type & first()
    Returns the first element that a pair stores.
    Definition: compressed_pair.hpp:172
    +
    entt::dense_map
    Associative container for key-value pairs with unique keys.
    Definition: dense_map.hpp:265
    +
    entt::dense_map::at
    mapped_type & at(const key_type &key)
    Accesses a given element with bounds checking.
    Definition: dense_map.hpp:713
    +
    entt::dense_map::dense_map
    dense_map(const allocator_type &allocator)
    Constructs an empty container with a given allocator.
    Definition: dense_map.hpp:382
    +
    entt::dense_map::operator=
    dense_map & operator=(dense_map &&)=default
    Default move assignment operator.
    +
    entt::dense_map::load_factor
    float load_factor() const
    Returns the average number of elements per bucket.
    Definition: dense_map.hpp:894
    +
    entt::dense_map::cend
    const_iterator cend() const
    Returns an iterator to the end.
    Definition: dense_map.hpp:497
    +
    entt::dense_map::erase
    size_type erase(const key_type &key)
    Removes the element associated with a given key.
    Definition: dense_map.hpp:684
    +
    entt::dense_map::operator[]
    mapped_type & operator[](const key_type &key)
    Accesses or inserts a given element.
    Definition: dense_map.hpp:731
    +
    entt::dense_map::begin
    const_iterator begin() const
    Returns an iterator to the beginning.
    Definition: dense_map.hpp:478
    +
    entt::dense_map::dense_map
    dense_map(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})
    Constructs an empty container with a given allocator, hash function, compare function and user suppli...
    Definition: dense_map.hpp:412
    +
    entt::dense_map::begin
    const_local_iterator begin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_map.hpp:816
    +
    entt::dense_map::dense_map
    dense_map(dense_map &&other, const allocator_type &allocator)
    Allocator-extended move constructor.
    Definition: dense_map.hpp:440
    +
    entt::dense_map::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: dense_map.hpp:358
    +
    entt::dense_map::insert
    void insert(It first, It last)
    Inserts elements into the container, if their keys do not exist.
    Definition: dense_map.hpp:567
    +
    entt::dense_map::key_equal
    KeyEqual key_equal
    Type of function to use to compare the keys for equality.
    Definition: dense_map.hpp:362
    +
    entt::dense_map::try_emplace
    std::pair< iterator, bool > try_emplace(key_type &&key, Args &&...args)
    Inserts in-place if the key does not exist, does nothing if the key exists.
    Definition: dense_map.hpp:648
    +
    entt::dense_map::end
    iterator end()
    Returns an iterator to the end.
    Definition: dense_map.hpp:507
    +
    entt::dense_map::max_bucket_count
    size_type max_bucket_count() const
    Returns the maximum number of buckets.
    Definition: dense_map.hpp:868
    +
    entt::dense_map::erase
    iterator erase(const_iterator first, const_iterator last)
    Removes the given elements from a container.
    Definition: dense_map.hpp:669
    +
    entt::dense_map::begin
    local_iterator begin(const size_type index)
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_map.hpp:825
    +
    entt::dense_map::contains
    bool contains(const key_type &key) const
    Checks if the container contains an element with a given key.
    Definition: dense_map.hpp:785
    +
    entt::dense_map::begin
    iterator begin()
    Returns an iterator to the beginning.
    Definition: dense_map.hpp:483
    +
    entt::dense_map::insert
    std::pair< iterator, bool > insert(const value_type &value)
    Inserts an element into the container, if the key does not exist.
    Definition: dense_map.hpp:541
    +
    entt::dense_map::max_load_factor
    float max_load_factor() const
    Returns the maximum average number of elements per bucket.
    Definition: dense_map.hpp:902
    +
    entt::dense_map::find
    const_iterator find(const key_type &key) const
    Finds an element with a given key.
    Definition: dense_map.hpp:755
    +
    entt::dense_map::const_iterator
    internal::dense_map_iterator< typename packed_container_type::const_iterator > const_iterator
    Constant input iterator type.
    Definition: dense_map.hpp:368
    +
    entt::dense_map::insert_or_assign
    std::pair< iterator, bool > insert_or_assign(key_type &&key, Arg &&value)
    Inserts an element into the container or assigns to the current element if the key already exists.
    Definition: dense_map.hpp:589
    +
    entt::dense_map::max_load_factor
    void max_load_factor(const float value)
    Sets the desired maximum average number of elements per bucket.
    Definition: dense_map.hpp:910
    +
    entt::dense_map::insert
    std::pair< iterator, bool > insert(value_type &&value)
    Inserts an element into the container, if the key does not exist.
    Definition: dense_map.hpp:546
    +
    entt::dense_map::find
    iterator find(const key_type &key)
    Finds an element with a given key.
    Definition: dense_map.hpp:750
    +
    entt::dense_map::mapped_type
    Type mapped_type
    Mapped type of the container.
    Definition: dense_map.hpp:354
    +
    entt::dense_map::cbegin
    const_iterator cbegin() const
    Returns an iterator to the beginning.
    Definition: dense_map.hpp:473
    +
    entt::dense_map::insert
    std::enable_if_t< std::is_constructible_v< value_type, Arg && >, std::pair< iterator, bool > > insert(Arg &&value)
    Inserts an element into the container, if the key does not exist.
    Definition: dense_map.hpp:556
    +
    entt::dense_map::erase
    iterator erase(const_iterator pos)
    Removes an element from a given position.
    Definition: dense_map.hpp:657
    +
    entt::dense_map::clear
    void clear()
    Clears the container.
    Definition: dense_map.hpp:528
    +
    entt::dense_map::dense_map
    dense_map(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    Constructs an empty container with a given allocator, hash function and user supplied minimal number ...
    Definition: dense_map.hpp:401
    +
    entt::dense_map::dense_map
    dense_map(const dense_map &other, const allocator_type &allocator)
    Allocator-extended copy constructor.
    Definition: dense_map.hpp:427
    +
    entt::dense_map::insert_or_assign
    std::pair< iterator, bool > insert_or_assign(const key_type &key, Arg &&value)
    Inserts an element into the container or assigns to the current element if the key already exists.
    Definition: dense_map.hpp:583
    +
    entt::dense_map::end
    const_local_iterator end([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_map.hpp:843
    +
    entt::dense_map::at
    const mapped_type & at(const key_type &key) const
    Accesses a given element with bounds checking.
    Definition: dense_map.hpp:720
    +
    entt::dense_map::end
    local_iterator end([[maybe_unused]] const size_type index)
    Returns an iterator to the end of a given bucket.
    Definition: dense_map.hpp:852
    +
    entt::dense_map::end
    const_iterator end() const
    Returns an iterator to the end.
    Definition: dense_map.hpp:502
    +
    entt::dense_map::bucket
    size_type bucket(const key_type &key) const
    Returns the bucket for a given key.
    Definition: dense_map.hpp:886
    +
    entt::dense_map::cbegin
    const_local_iterator cbegin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_map.hpp:807
    +
    entt::dense_map::operator=
    dense_map & operator=(const dense_map &)=default
    Default copy assignment operator.
    +
    entt::dense_map::value_type
    std::pair< const Key, Type > value_type
    Key-value type of the container.
    Definition: dense_map.hpp:356
    +
    entt::dense_map::dense_map
    dense_map(const dense_map &)=default
    Default copy constructor.
    +
    entt::dense_map::emplace
    std::pair< iterator, bool > emplace([[maybe_unused]] Args &&...args)
    Constructs an element in-place, if the key does not exist.
    Definition: dense_map.hpp:607
    +
    entt::dense_map::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find(const Other &key)
    Finds an element with a key that compares equivalent to a given value.
    Definition: dense_map.hpp:769
    +
    entt::dense_map::swap
    void swap(dense_map &other)
    Exchanges the contents with those of a given container.
    Definition: dense_map.hpp:701
    +
    entt::dense_map::contains
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains(const Other &key) const
    Checks if the container contains an element with a key that compares equivalent to a given value.
    Definition: dense_map.hpp:798
    +
    entt::dense_map::try_emplace
    std::pair< iterator, bool > try_emplace(const key_type &key, Args &&...args)
    Inserts in-place if the key does not exist, does nothing if the key exists.
    Definition: dense_map.hpp:642
    +
    entt::dense_map::key_eq
    key_equal key_eq() const
    Returns the function used to compare keys for equality.
    Definition: dense_map.hpp:958
    +
    entt::dense_map::iterator
    internal::dense_map_iterator< typename packed_container_type::iterator > iterator
    Input iterator type.
    Definition: dense_map.hpp:366
    +
    entt::dense_map::rehash
    void rehash(const size_type count)
    Reserves at least the specified number of buckets and regenerates the hash table.
    Definition: dense_map.hpp:921
    +
    entt::dense_map::local_iterator
    internal::dense_map_local_iterator< typename packed_container_type::iterator > local_iterator
    Input iterator type.
    Definition: dense_map.hpp:370
    +
    entt::dense_map::const_local_iterator
    internal::dense_map_local_iterator< typename packed_container_type::const_iterator > const_local_iterator
    Constant input iterator type.
    Definition: dense_map.hpp:372
    +
    entt::dense_map::operator[]
    mapped_type & operator[](key_type &&key)
    Accesses or inserts a given element.
    Definition: dense_map.hpp:740
    +
    entt::dense_map::allocator_type
    Allocator allocator_type
    Allocator type.
    Definition: dense_map.hpp:364
    +
    entt::dense_map::get_allocator
    constexpr allocator_type get_allocator() const
    Returns the associated allocator.
    Definition: dense_map.hpp:461
    +
    entt::dense_map::bucket_size
    size_type bucket_size(const size_type index) const
    Returns the number of elements in a given bucket.
    Definition: dense_map.hpp:877
    +
    entt::dense_map::dense_map
    dense_map(dense_map &&)=default
    Default move constructor.
    +
    entt::dense_map::hasher
    Hash hasher
    Type of function to use to hash the keys.
    Definition: dense_map.hpp:360
    +
    entt::dense_map::empty
    bool empty() const
    Checks whether a container is empty.
    Definition: dense_map.hpp:515
    +
    entt::dense_map::key_type
    Key key_type
    Key type of the container.
    Definition: dense_map.hpp:352
    +
    entt::dense_map::bucket_count
    size_type bucket_count() const
    Returns the number of buckets.
    Definition: dense_map.hpp:860
    +
    entt::dense_map::reserve
    void reserve(const size_type count)
    Reserves space for at least the specified number of elements and regenerates the hash table.
    Definition: dense_map.hpp:941
    +
    entt::dense_map::dense_map
    dense_map()
    Default constructor.
    Definition: dense_map.hpp:375
    +
    entt::dense_map::cend
    const_local_iterator cend([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_map.hpp:834
    +
    entt::dense_map::dense_map
    dense_map(const size_type bucket_count, const allocator_type &allocator)
    Constructs an empty container with a given allocator and user supplied minimal number of buckets.
    Definition: dense_map.hpp:391
    +
    entt::dense_map::hash_function
    hasher hash_function() const
    Returns the function used to hash the keys.
    Definition: dense_map.hpp:950
    +
    entt::dense_map::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find(const Other &key) const
    Finds an element with a given key.
    Definition: dense_map.hpp:776
    +
    entt::dense_map::size
    size_type size() const
    Returns the number of elements in a container.
    Definition: dense_map.hpp:523
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    +
    entt::fast_mod
    constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
    Fast module utility function (powers of two only).
    Definition: memory.hpp:102
    +
    entt::operator<=
    constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:273
    +
    entt::next_power_of_two
    constexpr std::size_t next_power_of_two(const std::size_t value)
    Computes the smallest power of two greater than or equal to a value.
    Definition: memory.hpp:85
    +
    entt::operator>=
    constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:299
    +
    entt::operator+
    constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
    Concatenates multiple type lists.
    Definition: type_traits.hpp:157
    +
    entt::operator<
    constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:260
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    +
    entt::operator>
    constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:286
    +
    entt::input_iterator_pointer
    Helper type to use as pointer with input iterators.
    Definition: iterator.hpp:16
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/dense__set_8hpp_source.html b/dense__set_8hpp_source.html new file mode 100644 index 000000000..01e6f3b1e --- /dev/null +++ b/dense__set_8hpp_source.html @@ -0,0 +1,713 @@ + + + + + + + +EnTT: src/entt/container/dense_set.hpp Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    dense_set.hpp
    +
    +
    +
    1 #ifndef ENTT_CONTAINER_DENSE_SET_HPP
    +
    2 #define ENTT_CONTAINER_DENSE_SET_HPP
    +
    3 
    +
    4 #include <algorithm>
    +
    5 #include <cmath>
    +
    6 #include <cstddef>
    +
    7 #include <functional>
    +
    8 #include <iterator>
    +
    9 #include <limits>
    +
    10 #include <memory>
    +
    11 #include <tuple>
    +
    12 #include <type_traits>
    +
    13 #include <utility>
    +
    14 #include <vector>
    +
    15 #include "../config/config.h"
    +
    16 #include "../core/compressed_pair.hpp"
    +
    17 #include "../core/memory.hpp"
    +
    18 #include "../core/type_traits.hpp"
    +
    19 #include "fwd.hpp"
    +
    20 
    +
    21 namespace entt {
    +
    22 
    +
    28 namespace internal {
    +
    29 
    +
    30 template<typename It>
    +
    31 class dense_set_iterator final {
    +
    32  template<typename>
    +
    33  friend class dense_set_iterator;
    +
    34 
    +
    35 public:
    +
    36  using value_type = typename It::value_type::second_type;
    +
    37  using pointer = const value_type *;
    +
    38  using reference = const value_type &;
    +
    39  using difference_type = std::ptrdiff_t;
    +
    40  using iterator_category = std::random_access_iterator_tag;
    +
    41 
    +
    42  dense_set_iterator() ENTT_NOEXCEPT
    +
    43  : it{} {}
    +
    44 
    +
    45  dense_set_iterator(const It iter) ENTT_NOEXCEPT
    +
    46  : it{iter} {}
    +
    47 
    +
    48  template<typename Other, typename = std::enable_if_t<!std::is_same_v<It, Other> && std::is_constructible_v<It, Other>>>
    +
    49  dense_set_iterator(const dense_set_iterator<Other> &other) ENTT_NOEXCEPT
    +
    50  : it{other.it} {}
    +
    51 
    +
    52  dense_set_iterator &operator++() ENTT_NOEXCEPT {
    +
    53  return ++it, *this;
    +
    54  }
    +
    55 
    +
    56  dense_set_iterator operator++(int) ENTT_NOEXCEPT {
    +
    57  dense_set_iterator orig = *this;
    +
    58  return ++(*this), orig;
    +
    59  }
    +
    60 
    +
    61  dense_set_iterator &operator--() ENTT_NOEXCEPT {
    +
    62  return --it, *this;
    +
    63  }
    +
    64 
    +
    65  dense_set_iterator operator--(int) ENTT_NOEXCEPT {
    +
    66  dense_set_iterator orig = *this;
    +
    67  return operator--(), orig;
    +
    68  }
    +
    69 
    +
    70  dense_set_iterator &operator+=(const difference_type value) ENTT_NOEXCEPT {
    +
    71  it += value;
    +
    72  return *this;
    +
    73  }
    +
    74 
    +
    75  dense_set_iterator operator+(const difference_type value) const ENTT_NOEXCEPT {
    +
    76  dense_set_iterator copy = *this;
    +
    77  return (copy += value);
    +
    78  }
    +
    79 
    +
    80  dense_set_iterator &operator-=(const difference_type value) ENTT_NOEXCEPT {
    +
    81  return (*this += -value);
    +
    82  }
    +
    83 
    +
    84  dense_set_iterator operator-(const difference_type value) const ENTT_NOEXCEPT {
    +
    85  return (*this + -value);
    +
    86  }
    +
    87 
    +
    88  [[nodiscard]] reference operator[](const difference_type value) const ENTT_NOEXCEPT {
    +
    89  return it[value].second;
    +
    90  }
    +
    91 
    +
    92  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    +
    93  return std::addressof(it->second);
    +
    94  }
    +
    95 
    +
    96  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
    +
    97  return *operator->();
    +
    98  }
    +
    99 
    +
    100  template<typename ILhs, typename IRhs>
    +
    101  friend std::ptrdiff_t operator-(const dense_set_iterator<ILhs> &, const dense_set_iterator<IRhs> &) ENTT_NOEXCEPT;
    +
    102 
    +
    103  template<typename ILhs, typename IRhs>
    +
    104  friend bool operator==(const dense_set_iterator<ILhs> &, const dense_set_iterator<IRhs> &) ENTT_NOEXCEPT;
    +
    105 
    +
    106  template<typename ILhs, typename IRhs>
    +
    107  friend bool operator<(const dense_set_iterator<ILhs> &, const dense_set_iterator<IRhs> &) ENTT_NOEXCEPT;
    +
    108 
    +
    109 private:
    +
    110  It it;
    +
    111 };
    +
    112 
    +
    113 template<typename ILhs, typename IRhs>
    +
    114 [[nodiscard]] std::ptrdiff_t operator-(const dense_set_iterator<ILhs> &lhs, const dense_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    115  return lhs.it - rhs.it;
    +
    116 }
    +
    117 
    +
    118 template<typename ILhs, typename IRhs>
    +
    119 [[nodiscard]] bool operator==(const dense_set_iterator<ILhs> &lhs, const dense_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    120  return lhs.it == rhs.it;
    +
    121 }
    +
    122 
    +
    123 template<typename ILhs, typename IRhs>
    +
    124 [[nodiscard]] bool operator!=(const dense_set_iterator<ILhs> &lhs, const dense_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    125  return !(lhs == rhs);
    +
    126 }
    +
    127 
    +
    128 template<typename ILhs, typename IRhs>
    +
    129 [[nodiscard]] bool operator<(const dense_set_iterator<ILhs> &lhs, const dense_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    130  return lhs.it < rhs.it;
    +
    131 }
    +
    132 
    +
    133 template<typename ILhs, typename IRhs>
    +
    134 [[nodiscard]] bool operator>(const dense_set_iterator<ILhs> &lhs, const dense_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    135  return rhs < lhs;
    +
    136 }
    +
    137 
    +
    138 template<typename ILhs, typename IRhs>
    +
    139 [[nodiscard]] bool operator<=(const dense_set_iterator<ILhs> &lhs, const dense_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    140  return !(lhs > rhs);
    +
    141 }
    +
    142 
    +
    143 template<typename ILhs, typename IRhs>
    +
    144 [[nodiscard]] bool operator>=(const dense_set_iterator<ILhs> &lhs, const dense_set_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    145  return !(lhs < rhs);
    +
    146 }
    +
    147 
    +
    148 template<typename It>
    +
    149 class dense_set_local_iterator final {
    +
    150  template<typename>
    +
    151  friend class dense_set_local_iterator;
    +
    152 
    +
    153 public:
    +
    154  using value_type = typename It::value_type::second_type;
    +
    155  using pointer = const value_type *;
    +
    156  using reference = const value_type &;
    +
    157  using difference_type = std::ptrdiff_t;
    +
    158  using iterator_category = std::forward_iterator_tag;
    +
    159 
    +
    160  dense_set_local_iterator() ENTT_NOEXCEPT
    +
    161  : it{},
    +
    162  offset{} {}
    +
    163 
    +
    164  dense_set_local_iterator(It iter, const std::size_t pos) ENTT_NOEXCEPT
    +
    165  : it{iter},
    +
    166  offset{pos} {}
    +
    167 
    +
    168  template<typename Other, typename = std::enable_if_t<!std::is_same_v<It, Other> && std::is_constructible_v<It, Other>>>
    +
    169  dense_set_local_iterator(const dense_set_local_iterator<Other> &other) ENTT_NOEXCEPT
    +
    170  : it{other.it},
    +
    171  offset{other.offset} {}
    +
    172 
    +
    173  dense_set_local_iterator &operator++() ENTT_NOEXCEPT {
    +
    174  return offset = it[offset].first, *this;
    +
    175  }
    +
    176 
    +
    177  dense_set_local_iterator operator++(int) ENTT_NOEXCEPT {
    +
    178  dense_set_local_iterator orig = *this;
    +
    179  return ++(*this), orig;
    +
    180  }
    +
    181 
    +
    182  [[nodiscard]] pointer operator->() const ENTT_NOEXCEPT {
    +
    183  return std::addressof(it[offset].second);
    +
    184  }
    +
    185 
    +
    186  [[nodiscard]] reference operator*() const ENTT_NOEXCEPT {
    +
    187  return *operator->();
    +
    188  }
    +
    189 
    +
    190  [[nodiscard]] std::size_t index() const ENTT_NOEXCEPT {
    +
    191  return offset;
    +
    192  }
    +
    193 
    +
    194 private:
    +
    195  It it;
    +
    196  std::size_t offset;
    +
    197 };
    +
    198 
    +
    199 template<typename ILhs, typename IRhs>
    +
    200 [[nodiscard]] bool operator==(const dense_set_local_iterator<ILhs> &lhs, const dense_set_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    201  return lhs.index() == rhs.index();
    +
    202 }
    +
    203 
    +
    204 template<typename ILhs, typename IRhs>
    +
    205 [[nodiscard]] bool operator!=(const dense_set_local_iterator<ILhs> &lhs, const dense_set_local_iterator<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    206  return !(lhs == rhs);
    +
    207 }
    +
    208 
    +
    209 } // namespace internal
    +
    210 
    +
    228 template<typename Type, typename Hash, typename KeyEqual, typename Allocator>
    +
    229 class dense_set {
    +
    230  static constexpr float default_threshold = 0.875f;
    +
    231  static constexpr std::size_t minimum_capacity = 8u;
    +
    232 
    +
    233  using node_type = std::pair<std::size_t, Type>;
    +
    234  using alloc_traits = std::allocator_traits<Allocator>;
    +
    235  static_assert(std::is_same_v<typename alloc_traits::value_type, Type>, "Invalid value type");
    +
    236  using sparse_container_type = std::vector<std::size_t, typename alloc_traits::template rebind_alloc<std::size_t>>;
    +
    237  using packed_container_type = std::vector<node_type, typename alloc_traits::template rebind_alloc<node_type>>;
    +
    238 
    +
    239  template<typename Other>
    +
    240  [[nodiscard]] std::size_t value_to_bucket(const Other &value) const ENTT_NOEXCEPT {
    +
    241  return fast_mod(sparse.second()(value), bucket_count());
    +
    242  }
    +
    243 
    +
    244  template<typename Other>
    +
    245  [[nodiscard]] auto constrained_find(const Other &value, std::size_t bucket) {
    +
    246  for(auto it = begin(bucket), last = end(bucket); it != last; ++it) {
    +
    247  if(packed.second()(*it, value)) {
    +
    248  return begin() + static_cast<typename iterator::difference_type>(it.index());
    +
    249  }
    +
    250  }
    +
    251 
    +
    252  return end();
    +
    253  }
    +
    254 
    +
    255  template<typename Other>
    +
    256  [[nodiscard]] auto constrained_find(const Other &value, std::size_t bucket) const {
    +
    257  for(auto it = cbegin(bucket), last = cend(bucket); it != last; ++it) {
    +
    258  if(packed.second()(*it, value)) {
    +
    259  return cbegin() + static_cast<typename iterator::difference_type>(it.index());
    +
    260  }
    +
    261  }
    +
    262 
    +
    263  return cend();
    +
    264  }
    +
    265 
    +
    266  template<typename Other>
    +
    267  [[nodiscard]] auto insert_or_do_nothing(Other &&value) {
    +
    268  const auto index = value_to_bucket(value);
    +
    269 
    +
    270  if(auto it = constrained_find(value, index); it != end()) {
    +
    271  return std::make_pair(it, false);
    +
    272  }
    +
    273 
    +
    274  packed.first().emplace_back(sparse.first()[index], std::forward<Other>(value));
    +
    275  sparse.first()[index] = packed.first().size() - 1u;
    +
    276  rehash_if_required();
    +
    277 
    +
    278  return std::make_pair(--end(), true);
    +
    279  }
    +
    280 
    +
    281  void move_and_pop(const std::size_t pos) {
    +
    282  if(const auto last = size() - 1u; pos != last) {
    +
    283  packed.first()[pos] = std::move(packed.first().back());
    +
    284  size_type *curr = sparse.first().data() + value_to_bucket(packed.first().back().second);
    +
    285  for(; *curr != last; curr = &packed.first()[*curr].first) {}
    +
    286  *curr = pos;
    +
    287  }
    +
    288 
    +
    289  packed.first().pop_back();
    +
    290  }
    +
    291 
    +
    292  void rehash_if_required() {
    +
    293  if(size() > (bucket_count() * max_load_factor())) {
    +
    294  rehash(bucket_count() * 2u);
    +
    295  }
    +
    296  }
    +
    297 
    +
    298 public:
    +
    300  using key_type = Type;
    +
    302  using value_type = Type;
    +
    304  using size_type = std::size_t;
    +
    306  using hasher = Hash;
    +
    308  using key_equal = KeyEqual;
    +
    310  using allocator_type = Allocator;
    +
    312  using iterator = internal::dense_set_iterator<typename packed_container_type::iterator>;
    +
    314  using const_iterator = internal::dense_set_iterator<typename packed_container_type::const_iterator>;
    +
    316  using local_iterator = internal::dense_set_local_iterator<typename packed_container_type::iterator>;
    +
    318  using const_local_iterator = internal::dense_set_local_iterator<typename packed_container_type::const_iterator>;
    +
    319 
    +
    321  dense_set()
    +
    322  : dense_set(minimum_capacity) {}
    +
    323 
    +
    328  explicit dense_set(const allocator_type &allocator)
    +
    329  : dense_set{minimum_capacity, hasher{}, key_equal{}, allocator} {}
    +
    330 
    +
    337  dense_set(const size_type bucket_count, const allocator_type &allocator)
    +
    338  : dense_set{bucket_count, hasher{}, key_equal{}, allocator} {}
    +
    339 
    +
    347  dense_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    +
    348  : dense_set{bucket_count, hash, key_equal{}, allocator} {}
    +
    349 
    +
    358  explicit dense_set(const size_type bucket_count, const hasher &hash = hasher{}, const key_equal &equal = key_equal{}, const allocator_type &allocator = allocator_type{})
    +
    359  : sparse{allocator, hash},
    +
    360  packed{allocator, equal},
    +
    361  threshold{default_threshold} {
    +
    362  rehash(bucket_count);
    +
    363  }
    +
    364 
    +
    366  dense_set(const dense_set &) = default;
    +
    367 
    +
    373  dense_set(const dense_set &other, const allocator_type &allocator)
    +
    374  : sparse{std::piecewise_construct, std::forward_as_tuple(other.sparse.first(), allocator), std::forward_as_tuple(other.sparse.second())},
    +
    375  packed{std::piecewise_construct, std::forward_as_tuple(other.packed.first(), allocator), std::forward_as_tuple(other.packed.second())},
    +
    376  threshold{other.threshold} {}
    +
    377 
    +
    379  dense_set(dense_set &&) = default;
    +
    380 
    +
    386  dense_set(dense_set &&other, const allocator_type &allocator)
    +
    387  : sparse{std::piecewise_construct, std::forward_as_tuple(std::move(other.sparse.first()), allocator), std::forward_as_tuple(std::move(other.sparse.second()))},
    +
    388  packed{std::piecewise_construct, std::forward_as_tuple(std::move(other.packed.first()), allocator), std::forward_as_tuple(std::move(other.packed.second()))},
    +
    389  threshold{other.threshold} {}
    +
    390 
    +
    395  dense_set &operator=(const dense_set &) = default;
    +
    396 
    +
    401  dense_set &operator=(dense_set &&) = default;
    +
    402 
    +
    407  [[nodiscard]] constexpr allocator_type get_allocator() const ENTT_NOEXCEPT {
    +
    408  return sparse.first().get_allocator();
    +
    409  }
    +
    410 
    +
    419  [[nodiscard]] const_iterator cbegin() const ENTT_NOEXCEPT {
    +
    420  return packed.first().begin();
    +
    421  }
    +
    422 
    +
    424  [[nodiscard]] const_iterator begin() const ENTT_NOEXCEPT {
    +
    425  return cbegin();
    +
    426  }
    +
    427 
    +
    429  [[nodiscard]] iterator begin() ENTT_NOEXCEPT {
    +
    430  return packed.first().begin();
    +
    431  }
    +
    432 
    +
    443  [[nodiscard]] const_iterator cend() const ENTT_NOEXCEPT {
    +
    444  return packed.first().end();
    +
    445  }
    +
    446 
    +
    448  [[nodiscard]] const_iterator end() const ENTT_NOEXCEPT {
    +
    449  return cend();
    +
    450  }
    +
    451 
    +
    453  [[nodiscard]] iterator end() ENTT_NOEXCEPT {
    +
    454  return packed.first().end();
    +
    455  }
    +
    456 
    +
    461  [[nodiscard]] bool empty() const ENTT_NOEXCEPT {
    +
    462  return packed.first().empty();
    +
    463  }
    +
    464 
    +
    469  [[nodiscard]] size_type size() const ENTT_NOEXCEPT {
    +
    470  return packed.first().size();
    +
    471  }
    +
    472 
    +
    474  void clear() ENTT_NOEXCEPT {
    +
    475  sparse.first().clear();
    +
    476  packed.first().clear();
    +
    477  rehash(0u);
    +
    478  }
    +
    479 
    +
    487  std::pair<iterator, bool> insert(const value_type &value) {
    +
    488  return insert_or_do_nothing(value);
    +
    489  }
    +
    490 
    +
    492  std::pair<iterator, bool> insert(value_type &&value) {
    +
    493  return insert_or_do_nothing(std::move(value));
    +
    494  }
    +
    495 
    +
    502  template<typename It>
    +
    503  void insert(It first, It last) {
    +
    504  for(; first != last; ++first) {
    +
    505  insert(*first);
    +
    506  }
    +
    507  }
    +
    508 
    +
    522  template<typename... Args>
    +
    523  std::pair<iterator, bool> emplace(Args &&...args) {
    +
    524  if constexpr(((sizeof...(Args) == 1u) && ... && std::is_same_v<std::remove_cv_t<std::remove_reference_t<Args>>, value_type>)) {
    +
    525  return insert_or_do_nothing(std::forward<Args>(args)...);
    +
    526  } else {
    +
    527  auto &node = packed.first().emplace_back(std::piecewise_construct, std::make_tuple(packed.first().size()), std::forward_as_tuple(std::forward<Args>(args)...));
    +
    528  const auto index = value_to_bucket(node.second);
    +
    529 
    +
    530  if(auto it = constrained_find(node.second, index); it != end()) {
    +
    531  packed.first().pop_back();
    +
    532  return std::make_pair(it, false);
    +
    533  }
    +
    534 
    +
    535  std::swap(node.first, sparse.first()[index]);
    +
    536  rehash_if_required();
    +
    537 
    +
    538  return std::make_pair(--end(), true);
    +
    539  }
    +
    540  }
    +
    541 
    +
    547  iterator erase(const_iterator pos) {
    +
    548  const auto diff = pos - cbegin();
    +
    549  erase(*pos);
    +
    550  return begin() + diff;
    +
    551  }
    +
    552 
    +
    559  iterator erase(const_iterator first, const_iterator last) {
    +
    560  const auto dist = first - cbegin();
    +
    561 
    +
    562  for(auto from = last - cbegin(); from != dist; --from) {
    +
    563  erase(packed.first()[from - 1u].second);
    +
    564  }
    +
    565 
    +
    566  return (begin() + dist);
    +
    567  }
    +
    568 
    +
    574  size_type erase(const value_type &value) {
    +
    575  for(size_type *curr = sparse.first().data() + value_to_bucket(value); *curr != (std::numeric_limits<size_type>::max)(); curr = &packed.first()[*curr].first) {
    +
    576  if(packed.second()(packed.first()[*curr].second, value)) {
    +
    577  const auto index = *curr;
    +
    578  *curr = packed.first()[*curr].first;
    +
    579  move_and_pop(index);
    +
    580  return 1u;
    +
    581  }
    +
    582  }
    +
    583 
    +
    584  return 0u;
    +
    585  }
    +
    586 
    +
    591  void swap(dense_set &other) {
    +
    592  using std::swap;
    +
    593  swap(sparse, other.sparse);
    +
    594  swap(packed, other.packed);
    +
    595  swap(threshold, other.threshold);
    +
    596  }
    +
    597 
    +
    604  [[nodiscard]] iterator find(const value_type &value) {
    +
    605  return constrained_find(value, value_to_bucket(value));
    +
    606  }
    +
    607 
    +
    609  [[nodiscard]] const_iterator find(const value_type &value) const {
    +
    610  return constrained_find(value, value_to_bucket(value));
    +
    611  }
    +
    612 
    +
    620  template<typename Other>
    +
    621  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, iterator>>
    +
    622  find(const Other &value) {
    +
    623  return constrained_find(value, value_to_bucket(value));
    +
    624  }
    +
    625 
    +
    627  template<typename Other>
    +
    628  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, const_iterator>>
    +
    629  find(const Other &value) const {
    +
    630  return constrained_find(value, value_to_bucket(value));
    +
    631  }
    +
    632 
    +
    638  [[nodiscard]] bool contains(const value_type &value) const {
    +
    639  return (find(value) != cend());
    +
    640  }
    +
    641 
    +
    649  template<typename Other>
    +
    650  [[nodiscard]] std::enable_if_t<is_transparent_v<hasher> && is_transparent_v<key_equal>, std::conditional_t<false, Other, bool>>
    +
    651  contains(const Other &value) const {
    +
    652  return (find(value) != cend());
    +
    653  }
    +
    654 
    +
    660  [[nodiscard]] const_local_iterator cbegin(const size_type index) const {
    +
    661  return {packed.first().begin(), sparse.first()[index]};
    +
    662  }
    +
    663 
    +
    669  [[nodiscard]] const_local_iterator begin(const size_type index) const {
    +
    670  return cbegin(index);
    +
    671  }
    +
    672 
    +
    678  [[nodiscard]] local_iterator begin(const size_type index) {
    +
    679  return {packed.first().begin(), sparse.first()[index]};
    +
    680  }
    +
    681 
    +
    687  [[nodiscard]] const_local_iterator cend([[maybe_unused]] const size_type index) const {
    +
    688  return {packed.first().begin(), (std::numeric_limits<size_type>::max)()};
    +
    689  }
    +
    690 
    +
    696  [[nodiscard]] const_local_iterator end([[maybe_unused]] const size_type index) const {
    +
    697  return cend(index);
    +
    698  }
    +
    699 
    +
    705  [[nodiscard]] local_iterator end([[maybe_unused]] const size_type index) {
    +
    706  return {packed.first().begin(), (std::numeric_limits<size_type>::max)()};
    +
    707  }
    +
    708 
    +
    713  [[nodiscard]] size_type bucket_count() const {
    +
    714  return sparse.first().size();
    +
    715  }
    +
    716 
    +
    721  [[nodiscard]] size_type max_bucket_count() const {
    +
    722  return sparse.first().max_size();
    +
    723  }
    +
    724 
    +
    730  [[nodiscard]] size_type bucket_size(const size_type index) const {
    +
    731  return static_cast<size_type>(std::distance(begin(index), end(index)));
    +
    732  }
    +
    733 
    +
    739  [[nodiscard]] size_type bucket(const value_type &value) const {
    +
    740  return value_to_bucket(value);
    +
    741  }
    +
    742 
    +
    747  [[nodiscard]] float load_factor() const {
    +
    748  return size() / static_cast<float>(bucket_count());
    +
    749  }
    +
    750 
    +
    755  [[nodiscard]] float max_load_factor() const {
    +
    756  return threshold;
    +
    757  }
    +
    758 
    +
    763  void max_load_factor(const float value) {
    +
    764  ENTT_ASSERT(value > 0.f, "Invalid load factor");
    +
    765  threshold = value;
    +
    766  rehash(0u);
    +
    767  }
    +
    768 
    +
    774  void rehash(const size_type count) {
    +
    775  auto value = (std::max)(count, minimum_capacity);
    +
    776  value = (std::max)(value, static_cast<size_type>(size() / max_load_factor()));
    +
    777 
    +
    778  if(const auto sz = next_power_of_two(value); sz != bucket_count()) {
    +
    779  sparse.first().resize(sz);
    +
    780  std::fill(sparse.first().begin(), sparse.first().end(), (std::numeric_limits<size_type>::max)());
    +
    781 
    +
    782  for(size_type pos{}, last = size(); pos < last; ++pos) {
    +
    783  const auto index = value_to_bucket(packed.first()[pos].second);
    +
    784  packed.first()[pos].first = std::exchange(sparse.first()[index], pos);
    +
    785  }
    +
    786  }
    +
    787  }
    +
    788 
    +
    794  void reserve(const size_type count) {
    +
    795  packed.first().reserve(count);
    +
    796  rehash(static_cast<size_type>(std::ceil(count / max_load_factor())));
    +
    797  }
    +
    798 
    +
    803  [[nodiscard]] hasher hash_function() const {
    +
    804  return sparse.second();
    +
    805  }
    +
    806 
    +
    811  [[nodiscard]] key_equal key_eq() const {
    +
    812  return packed.second();
    +
    813  }
    +
    814 
    +
    815 private:
    +
    816  compressed_pair<sparse_container_type, hasher> sparse;
    +
    817  compressed_pair<packed_container_type, key_equal> packed;
    +
    818  float threshold;
    +
    819 };
    +
    820 
    +
    821 } // namespace entt
    +
    822 
    +
    823 #endif
    +
    entt::compressed_pair< sparse_container_type, hasher >
    +
    entt::compressed_pair::second
    second_type & second()
    Returns the second element that a pair stores.
    Definition: compressed_pair.hpp:185
    +
    entt::compressed_pair::first
    first_type & first()
    Returns the first element that a pair stores.
    Definition: compressed_pair.hpp:172
    +
    entt::dense_set
    Associative container for unique objects of a given type.
    Definition: dense_set.hpp:229
    +
    entt::dense_set::bucket_size
    size_type bucket_size(const size_type index) const
    Returns the number of elements in a given bucket.
    Definition: dense_set.hpp:730
    +
    entt::dense_set::size
    size_type size() const
    Returns the number of elements in a container.
    Definition: dense_set.hpp:469
    +
    entt::dense_set::dense_set
    dense_set(dense_set &&)=default
    Default move constructor.
    +
    entt::dense_set::cend
    const_iterator cend() const
    Returns an iterator to the end.
    Definition: dense_set.hpp:443
    +
    entt::dense_set::empty
    bool empty() const
    Checks whether a container is empty.
    Definition: dense_set.hpp:461
    +
    entt::dense_set::const_local_iterator
    internal::dense_set_local_iterator< typename packed_container_type::const_iterator > const_local_iterator
    Constant forward iterator type.
    Definition: dense_set.hpp:318
    +
    entt::dense_set::insert
    std::pair< iterator, bool > insert(value_type &&value)
    Inserts an element into the container, if it does not exist.
    Definition: dense_set.hpp:492
    +
    entt::dense_set::key_eq
    key_equal key_eq() const
    Returns the function used to compare elements for equality.
    Definition: dense_set.hpp:811
    +
    entt::dense_set::key_equal
    KeyEqual key_equal
    Type of function to use to compare the elements for equality.
    Definition: dense_set.hpp:308
    +
    entt::dense_set::const_iterator
    internal::dense_set_iterator< typename packed_container_type::const_iterator > const_iterator
    Constant random access iterator type.
    Definition: dense_set.hpp:314
    +
    entt::dense_set::erase
    iterator erase(const_iterator first, const_iterator last)
    Removes the given elements from a container.
    Definition: dense_set.hpp:559
    +
    entt::dense_set::emplace
    std::pair< iterator, bool > emplace(Args &&...args)
    Constructs an element in-place, if it does not exist.
    Definition: dense_set.hpp:523
    +
    entt::dense_set::hasher
    Hash hasher
    Type of function to use to hash the elements.
    Definition: dense_set.hpp:306
    +
    entt::dense_set::size_type
    std::size_t size_type
    Unsigned integer type.
    Definition: dense_set.hpp:304
    +
    entt::dense_set::bucket
    size_type bucket(const value_type &value) const
    Returns the bucket for a given element.
    Definition: dense_set.hpp:739
    +
    entt::dense_set::find
    iterator find(const value_type &value)
    Finds an element with a given value.
    Definition: dense_set.hpp:604
    +
    entt::dense_set::get_allocator
    constexpr allocator_type get_allocator() const
    Returns the associated allocator.
    Definition: dense_set.hpp:407
    +
    entt::dense_set::swap
    void swap(dense_set &other)
    Exchanges the contents with those of a given container.
    Definition: dense_set.hpp:591
    +
    entt::dense_set::dense_set
    dense_set(const size_type bucket_count, const allocator_type &allocator)
    Constructs an empty container with a given allocator and user supplied minimal number of buckets.
    Definition: dense_set.hpp:337
    +
    entt::dense_set::key_type
    Type key_type
    Key type of the container.
    Definition: dense_set.hpp:300
    +
    entt::dense_set::end
    const_iterator end() const
    Returns an iterator to the end.
    Definition: dense_set.hpp:448
    +
    entt::dense_set::rehash
    void rehash(const size_type count)
    Reserves at least the specified number of buckets and regenerates the hash table.
    Definition: dense_set.hpp:774
    +
    entt::dense_set::value_type
    Type value_type
    Value type of the container.
    Definition: dense_set.hpp:302
    +
    entt::dense_set::operator=
    dense_set & operator=(const dense_set &)=default
    Default copy assignment operator.
    +
    entt::dense_set::iterator
    internal::dense_set_iterator< typename packed_container_type::iterator > iterator
    Random access iterator type.
    Definition: dense_set.hpp:312
    +
    entt::dense_set::bucket_count
    size_type bucket_count() const
    Returns the number of buckets.
    Definition: dense_set.hpp:713
    +
    entt::dense_set::cend
    const_local_iterator cend([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_set.hpp:687
    +
    entt::dense_set::end
    local_iterator end([[maybe_unused]] const size_type index)
    Returns an iterator to the end of a given bucket.
    Definition: dense_set.hpp:705
    +
    entt::dense_set::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, iterator > > find(const Other &value)
    Finds an element that compares equivalent to a given value.
    Definition: dense_set.hpp:622
    +
    entt::dense_set::dense_set
    dense_set(const dense_set &other, const allocator_type &allocator)
    Allocator-extended copy constructor.
    Definition: dense_set.hpp:373
    +
    entt::dense_set::find
    const_iterator find(const value_type &value) const
    Finds an element with a given value.
    Definition: dense_set.hpp:609
    +
    entt::dense_set::cbegin
    const_iterator cbegin() const
    Returns an iterator to the beginning.
    Definition: dense_set.hpp:419
    +
    entt::dense_set::hash_function
    hasher hash_function() const
    Returns the function used to hash the elements.
    Definition: dense_set.hpp:803
    +
    entt::dense_set::local_iterator
    internal::dense_set_local_iterator< typename packed_container_type::iterator > local_iterator
    Forward iterator type.
    Definition: dense_set.hpp:316
    +
    entt::dense_set::allocator_type
    Allocator allocator_type
    Allocator type.
    Definition: dense_set.hpp:310
    +
    entt::dense_set::end
    const_local_iterator end([[maybe_unused]] const size_type index) const
    Returns an iterator to the end of a given bucket.
    Definition: dense_set.hpp:696
    +
    entt::dense_set::contains
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, bool > > contains(const Other &value) const
    Checks if the container contains an element that compares equivalent to a given value.
    Definition: dense_set.hpp:651
    +
    entt::dense_set::dense_set
    dense_set(const dense_set &)=default
    Default copy constructor.
    +
    entt::dense_set::dense_set
    dense_set(const size_type bucket_count, const hasher &hash, const allocator_type &allocator)
    Constructs an empty container with a given allocator, hash function and user supplied minimal number ...
    Definition: dense_set.hpp:347
    +
    entt::dense_set::find
    std::enable_if_t< is_transparent_v< hasher > &&is_transparent_v< key_equal >, std::conditional_t< false, Other, const_iterator > > find(const Other &value) const
    Finds an element with a given value.
    Definition: dense_set.hpp:629
    +
    entt::dense_set::max_load_factor
    void max_load_factor(const float value)
    Sets the desired maximum average number of elements per bucket.
    Definition: dense_set.hpp:763
    +
    entt::dense_set::end
    iterator end()
    Returns an iterator to the end.
    Definition: dense_set.hpp:453
    +
    entt::dense_set::load_factor
    float load_factor() const
    Returns the average number of elements per bucket.
    Definition: dense_set.hpp:747
    +
    entt::dense_set::erase
    size_type erase(const value_type &value)
    Removes the element associated with a given value.
    Definition: dense_set.hpp:574
    +
    entt::dense_set::dense_set
    dense_set(const size_type bucket_count, const hasher &hash=hasher{}, const key_equal &equal=key_equal{}, const allocator_type &allocator=allocator_type{})
    Constructs an empty container with a given allocator, hash function, compare function and user suppli...
    Definition: dense_set.hpp:358
    +
    entt::dense_set::max_bucket_count
    size_type max_bucket_count() const
    Returns the maximum number of buckets.
    Definition: dense_set.hpp:721
    +
    entt::dense_set::operator=
    dense_set & operator=(dense_set &&)=default
    Default move assignment operator.
    +
    entt::dense_set::begin
    const_iterator begin() const
    Returns an iterator to the beginning.
    Definition: dense_set.hpp:424
    +
    entt::dense_set::dense_set
    dense_set(const allocator_type &allocator)
    Constructs an empty container with a given allocator.
    Definition: dense_set.hpp:328
    +
    entt::dense_set::dense_set
    dense_set()
    Default constructor.
    Definition: dense_set.hpp:321
    +
    entt::dense_set::insert
    std::pair< iterator, bool > insert(const value_type &value)
    Inserts an element into the container, if it does not exist.
    Definition: dense_set.hpp:487
    +
    entt::dense_set::reserve
    void reserve(const size_type count)
    Reserves space for at least the specified number of elements and regenerates the hash table.
    Definition: dense_set.hpp:794
    +
    entt::dense_set::erase
    iterator erase(const_iterator pos)
    Removes an element from a given position.
    Definition: dense_set.hpp:547
    +
    entt::dense_set::dense_set
    dense_set(dense_set &&other, const allocator_type &allocator)
    Allocator-extended move constructor.
    Definition: dense_set.hpp:386
    +
    entt::dense_set::clear
    void clear()
    Clears the container.
    Definition: dense_set.hpp:474
    +
    entt::dense_set::insert
    void insert(It first, It last)
    Inserts elements into the container, if they do not exist.
    Definition: dense_set.hpp:503
    +
    entt::dense_set::max_load_factor
    float max_load_factor() const
    Returns the maximum average number of elements per bucket.
    Definition: dense_set.hpp:755
    +
    entt::dense_set::begin
    const_local_iterator begin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_set.hpp:669
    +
    entt::dense_set::begin
    local_iterator begin(const size_type index)
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_set.hpp:678
    +
    entt::dense_set::cbegin
    const_local_iterator cbegin(const size_type index) const
    Returns an iterator to the beginning of a given bucket.
    Definition: dense_set.hpp:660
    +
    entt::dense_set::contains
    bool contains(const value_type &value) const
    Checks if the container contains an element with a given value.
    Definition: dense_set.hpp:638
    +
    entt::dense_set::begin
    iterator begin()
    Returns an iterator to the beginning.
    Definition: dense_set.hpp:429
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    +
    entt::fast_mod
    constexpr std::size_t fast_mod(const std::size_t value, const std::size_t mod)
    Fast module utility function (powers of two only).
    Definition: memory.hpp:102
    +
    entt::operator<=
    constexpr bool operator<=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:273
    +
    entt::next_power_of_two
    constexpr std::size_t next_power_of_two(const std::size_t value)
    Computes the smallest power of two greater than or equal to a value.
    Definition: memory.hpp:85
    +
    entt::operator>=
    constexpr bool operator>=(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:299
    +
    entt::operator+
    constexpr type_list< Type..., Other... > operator+(type_list< Type... >, type_list< Other... >)
    Concatenates multiple type lists.
    Definition: type_traits.hpp:157
    +
    entt::operator<
    constexpr bool operator<(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:260
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    +
    entt::operator>
    constexpr bool operator>(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:286
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/dir_49e56c817e5e54854c35e136979f97ca.html b/dir_49e56c817e5e54854c35e136979f97ca.html index 7ec8fb65f..df56afe6a 100644 --- a/dir_49e56c817e5e54854c35e136979f97ca.html +++ b/dir_49e56c817e5e54854c35e136979f97ca.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     ▼ entt
     ▼ config
     config.h
     version.h
     ▼ container
     dense_hash_map.hpp
     dense_hash_set.hpp
     fwd.hpp
     ▼ core
     algorithm.hpp
     any.hpp
     attribute.h
     compressed_pair.hpp
     enum.hpp
     family.hpp
     fwd.hpp
     hashed_string.hpp
     ident.hpp
     iterator.hpp
     memory.hpp
     monostate.hpp
     tuple.hpp
     type_info.hpp
     type_traits.hpp
     utility.hpp
     ▼ entity
     component.hpp
     entity.hpp
     fwd.hpp
     group.hpp
     handle.hpp
     helper.hpp
     observer.hpp
     organizer.hpp
     registry.hpp
     runtime_view.hpp
     snapshot.hpp
     sparse_set.hpp
     storage.hpp
     utility.hpp
     view.hpp
     macro.h
     version.h
     ▼ container
     dense_map.hpp
     dense_set.hpp
     fwd.hpp
     ▼ core
     algorithm.hpp
     any.hpp
     attribute.h
     compressed_pair.hpp
     enum.hpp
     family.hpp
     fwd.hpp
     hashed_string.hpp
     ident.hpp
     iterator.hpp
     memory.hpp
     monostate.hpp
     tuple.hpp
     type_info.hpp
     type_traits.hpp
     utility.hpp
     ▼ entity
     component.hpp
     entity.hpp
     fwd.hpp
     group.hpp
     handle.hpp
     helper.hpp
     observer.hpp
     organizer.hpp
     registry.hpp
     runtime_view.hpp
     sigh_storage_mixin.hpp
     snapshot.hpp
     sparse_set.hpp
     storage.hpp
     utility.hpp
     view.hpp
     ▼ locator
     locator.hpp
     ▼ meta
     ▼ resource
     cache.hpp
     fwd.hpp
     handle.hpp
     loader.hpp
     loader.hpp
     resource.hpp
     ▼ signal
     delegate.hpp
     dispatcher.hpp
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - - - - - - - - - - + + + + + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - - - - - - + + + + + + + + + + + @@ -181,35 +183,36 @@ This inheritance list is sorted roughly, but not completely, alphabetically: - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + @@ -227,72 +230,68 @@ This inheritance list is sorted roughly, but not completely, alphabetically: - - - + + + - - - - - - - - - - - - + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
     Centt::adl_meta_pointer_like< Type >Fake ADL based lookup function for meta pointer-like types
     Centt::as_cref_tEmpty class type used to request the as cref policy
     Centt::as_group< Entity >Converts a registry to a group
     Centt::as_is_tEmpty class type used to request the as-is policy
     Centt::as_ref_tEmpty class type used to request the as ref policy
     Centt::as_view< Entity >Converts a registry to a view
     Centt::as_void_tEmpty class type used to request the as void policy
     Centt::basic_any< Len, Align >A SBO friendly, type-safe container for single values of any type
     Centt::basic_any<>
     Centt::basic_collector<... >Collector
     Centt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >Collector
     Centt::basic_collector<>Collector
     ►Centt::basic_component_traitsCommonly used default traits for all types
     ►CAllocator
     Centt::as_cref_tEmpty class type used to request the as cref policy
     Centt::as_group< Entity >Converts a registry to a group
     Centt::as_is_tEmpty class type used to request the as-is policy
     Centt::as_ref_tEmpty class type used to request the as ref policy
     Centt::as_view< Entity >Converts a registry to a view
     Centt::as_void_tEmpty class type used to request the as void policy
     Centt::basic_any< Len, Align >A SBO friendly, type-safe container for single values of any type
     Centt::basic_any<>
     Centt::basic_collector<... >Collector
     Centt::basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >Collector
     Centt::basic_collector<>Collector
     Centt::basic_continuous_loader< Entity >Utility class for continuous loading
     Centt::basic_group< typename, typename, typename, typename >Group
     Centt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >Owning group
     Centt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >Non-owning group
     Centt::basic_handle< Entity, Type >Non-owning handle to an entity
     Centt::basic_hashed_string< Char >Zero overhead unique identifier
     ►Cinternal::basic_meta_associative_container_traits
     ►Cinternal::basic_meta_sequence_container_traits
     Centt::basic_observer< Entity >Observer
     Centt::basic_organizer< Entity >Utility class for creating a static task graph
     Centt::basic_registry< Entity >Fast and reliable entity-component system
     Centt::basic_registry< entity_type >
     Centt::basic_runtime_view< Entity >Runtime view
     Centt::basic_snapshot< Entity >Utility class to create snapshots from a registry
     Centt::basic_snapshot_loader< Entity >Utility class to restore a snapshot as a whole
     ►Centt::basic_sparse_set< Entity, Allocator >Basic sparse set implementation
     ►Centt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
     Centt::basic_view< typename, typename, typename, typename >View implementation
     Centt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >Single component view specialization
     Centt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >Multi component view
     ►Cstd::bool_constant
     Centt::choice_t< N >Utility class to disambiguate overloaded functions
     Centt::choice_t< 0 >Utility class to disambiguate overloaded functions.
     ►Cinternal::compressed_pair_element
     ►Cconditional
     ►Cstd::conjunction
     Centt::connect_arg_t< auto >Used to wrap a function or a member of a specified type
     Centt::connectionConnection class
     ►Cpool_handler::connection_type
     Centt::constness_as< To, From >Transcribes the constness of a type to another type
     Centt::constness_as< To, const From >Transcribes the constness of a type to another type.
     Centt::delegate< typename >Basic delegate implementation
     Centt::delegate< Ret(Args...)>Utility class to use to send around functions and members
     Centt::delegate< void(entt::basic_observer &)>
     Centt::delegate< void(void *)>
     Centt::dense_hash_map< Key, Type, Hash, KeyEqual, Allocator >Associative container for key-value pairs with unique keys
     Centt::dense_hash_map< entity_type, std::pair< entity_type, bool > >
     Centt::dense_hash_map< id_type, entt::basic_any< 0u >, entt::identity >
     Centt::dense_hash_map< id_type, entt::resource_handle< resource_type >, entt::identity >
     Centt::dense_hash_map< id_type, std::unique_ptr< basic_pool >, entt::identity >
     Centt::dense_hash_map< id_type, std::unique_ptr< entt::basic_sparse_set >, entt::identity >
     Centt::dense_hash_map< id_type, std::vector< std::pair< std::size_t, bool > >, entt::identity >
     Centt::dense_hash_set< Type, Hash, KeyEqual, Allocator >Associative container for unique objects of a given type
     ►Cstd::disjunction
     Centt::dispatcherBasic dispatcher implementation
     Centt::basic_dispatcher< Allocator >Basic dispatcher implementation
     Centt::basic_group< typename, typename, typename, typename >Group
     Centt::basic_group< Entity, owned_t< Owned... >, get_t< Get... >, exclude_t< Exclude... > >Owning group
     Centt::basic_group< Entity, owned_t<>, get_t< Get... >, exclude_t< Exclude... > >Non-owning group
     Centt::basic_handle< Entity, Type >Non-owning handle to an entity
     ►Cinternal::basic_hashed_string
     ►Cinternal::basic_meta_associative_container_traits
     ►Cinternal::basic_meta_sequence_container_traits
     Centt::basic_observer< Entity >Observer
     Centt::basic_organizer< Entity >Utility class for creating a static task graph
     Centt::basic_registry< Entity >Fast and reliable entity-component system
     Centt::basic_registry< entity_type >
     Centt::basic_runtime_view< typename >Runtime view implementation
     Centt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >Generic runtime view
     Centt::basic_snapshot< Entity >Utility class to create snapshots from a registry
     Centt::basic_snapshot_loader< Entity >Utility class to restore a snapshot as a whole
     ►Centt::basic_sparse_set< Entity, Allocator >Basic sparse set implementation
     ►Centt::basic_sparse_set< Entity, std::allocator_traits< Allocator >::template rebind_alloc< Entity > >
     Centt::basic_view< typename, typename, typename, typename >View implementation
     Centt::basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >Single component view specialization
     Centt::basic_view< Entity, get_t< Component... >, exclude_t< Exclude... > >Multi component view
     ►Cstd::bool_constant
     Centt::choice_t< N >Utility class to disambiguate overloaded functions
     Centt::choice_t< 0 >Utility class to disambiguate overloaded functions.
     Centt::component_traits< Type, typename >Common way to access various properties of components
     ►Cinternal::compressed_pair_element
     ►Cconditional
     ►Cstd::conjunction
     Centt::connect_arg_t< auto >Used to wrap a function or a member of a specified type
     Centt::connectionConnection class
     ►Cpool_handler::connection_type
     Centt::constness_as< To, From >Transcribes the constness of a type to another type
     Centt::constness_as< To, const From >Transcribes the constness of a type to another type.
     Centt::delegate< typename >Basic delegate implementation
     Centt::delegate< Ret(Args...)>Utility class to use to send around functions and members
     Centt::delegate< void(entt::basic_observer &)>
     Centt::delegate< void(void *)>
     Centt::dense_map< Key, Type, Hash, KeyEqual, Allocator >Associative container for key-value pairs with unique keys
     Centt::dense_map< entity_type, std::pair< entity_type, bool > >
     Centt::dense_map< id_type, std::unique_ptr< basic_pool >, entt::identity >
     Centt::dense_map< id_type, std::unique_ptr< entt::basic_sparse_set >, entt::identity >
     Centt::dense_map< id_type, std::vector< std::pair< std::size_t, bool > >, entt::identity >
     Centt::dense_set< Type, Hash, KeyEqual, Allocator >Associative container for unique objects of a given type
     ►Cstd::disjunction
     Centt::emitter< Derived >General purpose event emitter
     ►Cinternal::entt_traits
     ►Cstd::false_type
     Centt::family<... >Dynamic identifier generator
     ►Cinternal::has_iterator_category
     ►Cstd::integral_constant
     ►Cstd::is_invocable
     ►Cstd::is_invocable_r
     Centt::iterable_adaptor< It >Utility class to create an iterable object from a pair of iterators
     Centt::matcher<... >Grouping matcher
     Centt::member_class< Member >Extracts the class of a non-static member object or function
     Centt::meta_anyOpaque wrapper for values of any type
     Centt::meta_associative_containerProxy object for associative containers
     Centt::meta_associative_container_traits< typename >Traits class template to be specialized to enable support for meta associative containers
     Centt::meta_class_template_tag< typename >Utility class to disambiguate class templates
     Centt::meta_ctxOpaque container for a meta context
     Centt::meta_dataOpaque wrapper for data members
     Centt::meta_factory<... >Meta factory to be used for reflection purposes
     ►Centt::meta_factory< Type >Basic meta factory to be used for reflection purposes
     Centt::meta_funcOpaque wrapper for member functions
     Centt::meta_function_descriptor< typename, typename >Primary template isn't defined on purpose
     Centt::meta_function_descriptor< Type, Ret Class::* >Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(*)()>Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>Meta function descriptor
     Centt::meta_function_helper< Type, Candidate >Meta function helper
     Centt::meta_handleOpaque pointers to instances of any type
     Centt::meta_associative_container::meta_iteratorOpaque iterator for associative containers
     Centt::meta_sequence_container::meta_iteratorOpaque iterator for sequence containers
     ►Cstd::is_enum
     ►Cstd::is_invocable
     ►Cstd::is_invocable_r
     Centt::iterable_adaptor< It, Sentinel >Utility class to create an iterable object from a pair of iterators
     Centt::locator< Service >Service locator, nothing more
     Centt::matcher<... >Grouping matcher
     Centt::member_class< Member >Extracts the class of a non-static member object or function
     Centt::meta_anyOpaque wrapper for values of any type
     Centt::meta_associative_containerProxy object for associative containers
     Centt::meta_associative_container_traits< typename >Traits class template to be specialized to enable support for meta associative containers
     Centt::meta_class_template_tag< class >Utility class to disambiguate class templates
     Centt::meta_ctxOpaque container for a meta context
     Centt::meta_dataOpaque wrapper for data members
     Centt::meta_factory<... >Meta factory to be used for reflection purposes
     ►Centt::meta_factory< Type >Basic meta factory to be used for reflection purposes
     Centt::meta_funcOpaque wrapper for member functions
     Centt::meta_function_descriptor< typename, typename >Primary template isn't defined on purpose
     Centt::meta_function_descriptor< Type, Ret Class::* >Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(*)()>Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(Class::*)(Args...) const >Meta function descriptor
     Centt::meta_function_descriptor< Type, Ret(Class::*)(Args...)>Meta function descriptor
     Centt::meta_function_helper< Type, Candidate >Meta function helper
     Centt::meta_handleOpaque pointers to instances of any type
     Centt::meta_propOpaque wrapper for properties of any type
     Centt::meta_range< Type, Node >Iterable range to use to iterate all types of meta objects
     Centt::meta_sequence_containerProxy object for sequence containers
     ►Centt::process< process_adaptor< Func, Delta >, Delta >
     Centt::radix_sort< Bit, N >Function object for performing LSD radix sort
     Centt::resource_cache< Resource >Simple cache for resources of a given type
     Centt::resource_handle< Resource >Shared resource handle
     Centt::resource_loader< Loader, Resource >Base class for resource loaders
     Centt::resource< Type >Basic resource handle
     Centt::resource_cache< Type, Loader, Allocator >Basic cache for resources of any type
     Centt::resource_loader< Type >Transparent loader for shared resources
     Centt::scheduler< Delta >Cooperative scheduler for processes
     Centt::scoped_connectionScoped connection class
     Centt::service_locator< Service >Service locator, nothing more
     Centt::sigh< Type, typename >Unmanaged signal handler
     Centt::sigh< Ret(Args...), Allocator >Unmanaged signal handler
     Centt::sigh< void(entt::basic_registry< entity_type > &, const entity_type)>
     Centt::sigh< void(Event &)>
     Centt::sink< typename >Sink class
     Centt::sink< sigh< Ret(Args...), Allocator > >Sink class
     Centt::std_sortFunction object to wrap std::sort in a class type
     Centt::storage_traits< Entity, Type, typename >Provides a common way to access certain properties of storage types
     ►CConcept::template type
     Centt::tombstone_tTombstone object for all identifiers.
    +
     Centt::sigh< Type, typename >Unmanaged signal handler
     Centt::sigh< Ret(Args...), Allocator >Unmanaged signal handler
     Centt::sigh< void(entt::basic_registry< entity_type > &, const entity_type)>
     Centt::sink< typename >Sink class
     Centt::sink< sigh< Ret(Args...), Allocator > >Sink class
     Centt::std_sortFunction object to wrap std::sort in a class type
     Centt::storage_traits< Entity, Type, typename >Provides a common way to access certain properties of storage types
     ►CConcept::template type
     Centt::tombstone_tTombstone object for all identifiers.
     ►Cstd::true_type
     ►CType
     Centt::type_hash< Type, typename >Type hash
     Centt::type_identity< Type >Identity type trait
     Centt::type_index< Type, typename >Type sequential identifier
     Centt::type_infoImplementation specific information about a type
     Centt::type_list< Type >A class to use to push around lists of types, nothing more
     ►Centt::type_list< Type... >
     Centt::type_list_cat<... >Primary template isn't defined on purpose
     Centt::type_list_cat< type_list< Type... > >Concatenates multiple type lists
     Centt::type_list_cat< type_list< Type... >, type_list< Other... >, List... >Concatenates multiple type lists
     Centt::type_list_cat<>Concatenates multiple type lists
     Centt::type_list_contains< List, Type >Provides the member constant value to true if a type list contains a given type, false otherwise
     Centt::type_list_diff<... >Primary template isn't defined on purpose
     Centt::type_list_diff< type_list< Type... >, type_list< Other... > >Computes the difference between two type lists
     Centt::type_list_element< size_t, typename >Primary template isn't defined on purpose
     Centt::type_list_element< 0u, type_list< Type, Other... > >Provides compile-time indexed access to the types of a type list
     ►Centt::type_list_element< Index - 1u, type_list< Other... > >
     Centt::type_list_unique< typename >Primary template isn't defined on purpose
     Centt::type_list_unique< type_list< Type, Other... > >Removes duplicates types from a type list
     Centt::type_list_unique< type_list<> >Removes duplicates types from a type list
     Centt::type_name< Type, typename >Type name
     Centt::value_list< Value >A class to use to push around lists of constant values, nothing more
     Centt::value_list_cat<... >Primary template isn't defined on purpose
     Centt::value_list_cat< value_list< Value... > >Concatenates multiple value lists
     Centt::value_list_cat< value_list< Value... >, value_list< Other... >, List... >Concatenates multiple value lists
     Centt::value_list_cat<>Concatenates multiple value lists
     Centt::value_list_element< size_t, typename >Primary template isn't defined on purpose
     Centt::value_list_element< 0u, value_list< Value, Other... > >Provides compile-time indexed access to the types of a type list
     ►Centt::value_list_element< Index - 1u, value_list< Other... > >
     Centt::basic_organizer< Entity >::vertexVertex type of a task graph defined as an adjacency list
     Centt::y_combinator< Func >Basic implementation of a y-combinator
     ►Centt::Func
     ►Cstd::true_type
     ►CType
     Centt::type_hash< Type, typename >Type hash
     Centt::type_identity< Type >Identity type trait
     Centt::type_index< Type, typename >Type sequential identifier
     Centt::type_infoImplementation specific information about a type
     Centt::type_list< Type >A class to use to push around lists of types, nothing more
     ►Centt::type_list< Type... >
     Centt::type_list_cat<... >Primary template isn't defined on purpose
     Centt::type_list_cat< type_list< Type... > >Concatenates multiple type lists
     Centt::type_list_cat< type_list< Type... >, type_list< Other... >, List... >Concatenates multiple type lists
     Centt::type_list_cat<>Concatenates multiple type lists
     Centt::type_list_contains< List, Type >Provides the member constant value to true if a type list contains a given type, false otherwise
     Centt::type_list_diff<... >Primary template isn't defined on purpose
     Centt::type_list_diff< type_list< Type... >, type_list< Other... > >Computes the difference between two type lists
     Centt::type_list_element< size_t, typename >Primary template isn't defined on purpose
     Centt::type_list_element< 0u, type_list< Type, Other... > >Provides compile-time indexed access to the types of a type list
     ►Centt::type_list_element< Index - 1u, type_list< Other... > >
     Centt::type_list_unique< typename >Primary template isn't defined on purpose
     Centt::type_list_unique< type_list< Type, Other... > >Removes duplicates types from a type list
     Centt::type_list_unique< type_list<> >Removes duplicates types from a type list
     Centt::type_name< Type, typename >Type name
     Centt::value_list< Value >A class to use to push around lists of constant values, nothing more
     Centt::value_list_cat<... >Primary template isn't defined on purpose
     Centt::value_list_cat< value_list< Value... > >Concatenates multiple value lists
     Centt::value_list_cat< value_list< Value... >, value_list< Other... >, List... >Concatenates multiple value lists
     Centt::value_list_cat<>Concatenates multiple value lists
     Centt::value_list_element< size_t, typename >Primary template isn't defined on purpose
     Centt::value_list_element< 0u, value_list< Value, Other... > >Provides compile-time indexed access to the types of a type list
     ►Centt::value_list_element< Index - 1u, value_list< Other... > >
     Centt::basic_organizer< Entity >::vertexVertex type of a task graph defined as an adjacency list
     Centt::y_combinator< Func >Basic implementation of a y-combinator
     ►Centt::Func
    diff --git a/ident_8hpp_source.html b/ident_8hpp_source.html index 0c8898dcd..c3d62eb02 100644 --- a/ident_8hpp_source.html +++ b/ident_8hpp_source.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    +
    + + + + +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    - - - - -
    +
    + + + +
    +
    +
    +
    +
    - + +
    +
    +
    +
    +
    +
    +
    - - +
    + +
    +
    + + + +
    +
    +
    +
    +
    +
    +
    +
    +
    - - - - - - +
    + +
    +
    + + + + + + + + + +
    +
    +
    +
    +
    +
    +
    +
    - - +
    + +
    - - +
    + +
    - - +
    + +
    - - +
    + +
    - - +
    + +
    - - - -
    - - - -
    - - - -
    - - +
    + +
    @@ -362,14 +365,8 @@ $(function() {
    - - - - - - - - + +
    @@ -410,180 +407,182 @@ $(function() {
    +
    + + + + + + + + +
    +
    +
    - - - - - - - - - - - - - - - - +
    + + + + + + + + + + + + +
    - +
    +
    +
    + + + +
    +
    +
    +
    - - - -
    - +
    + - - - - - - + + + + + +
    +
    - +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    - - - -
    @@ -654,19 +653,19 @@ $(function() {
    - - +
    + +
    - - +
    + +
    - - +
    + +
    @@ -679,96 +678,86 @@ $(function() {
    - - - -
    +
    +
    +
    - - - -
    +
    +
    +
    +
    - +
    +
    +
    +
    +
    +
    +
    +
    - +
    +
    +
    @@ -776,133 +765,133 @@ $(function() {
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    +
    - +
    diff --git a/iterator_8hpp_source.html b/iterator_8hpp_source.html index bc90a5134..6c6ed9f04 100644 --- a/iterator_8hpp_source.html +++ b/iterator_8hpp_source.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    macro.h
    +
    +
    +
    1 #ifndef ENTT_CONFIG_MACRO_H
    +
    2 #define ENTT_CONFIG_MACRO_H
    +
    3 
    +
    4 #define ENTT_STR(arg) #arg
    +
    5 #define ENTT_XSTR(arg) ENTT_STR(arg)
    +
    6 
    +
    7 #endif
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/md_docs_md_config.html b/md_docs_md_config.html index 260aba398..9cf7094cc 100644 --- a/md_docs_md_config.html +++ b/md_docs_md_config.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - + + - - + + @@ -120,6 +120,9 @@ Classes + + + @@ -132,8 +135,8 @@ Classes - - + + @@ -246,15 +249,6 @@ Classes - - - - - - - - - @@ -288,9 +282,6 @@ Classes - - - @@ -317,8 +308,8 @@ Classes - - + + @@ -365,12 +356,15 @@ Classes - - + + + + + @@ -389,8 +383,8 @@ Classes - - + + @@ -413,11 +407,11 @@ Classes - - + + - - + + @@ -546,13 +540,13 @@ Classes - + - - + + - - + + @@ -563,8 +557,8 @@ Classes - - + + @@ -702,10 +696,10 @@ using  - - - + + + @@ -714,10 +708,14 @@ using  - - - - + + + + + + +

    Classes

    class  dense_hash_map
     Associative container for key-value pairs with unique keys. More...
    class  dense_map
     Associative container for key-value pairs with unique keys. More...
     
    class  dense_hash_set
     Associative container for unique objects of a given type. More...
    class  dense_set
     Associative container for unique objects of a given type. More...
     
    struct  std_sort
     Function object to wrap std::sort in a class type. More...
    struct  iterable_adaptor
     Utility class to create an iterable object from a pair of iterators. More...
     
    struct  allocation_deleter
     Deleter for allocator-aware unique pointers (waiting for C++20). More...
     
    struct  monostate
     Minimal implementation of the monostate pattern. More...
     
    struct  type_name
     Type name. More...
     
    class  type_info
     Implementation specific information about a type. More...
    struct  type_info
     Implementation specific information about a type. More...
     
    struct  choice_t
     Utility class to disambiguate overloaded functions. More...
    struct  is_iterator< Type, std::enable_if_t<!std::is_same_v< std::remove_const_t< std::remove_pointer_t< Type > >, void > > >
     Provides the member constant value to true if a given type is an iterator, false otherwise. More...
     
    struct  is_iterator_type
     Provides the member constant value to true if a given type is of the required iterator type, false otherwise. More...
     
    struct  is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > >
     Provides the member constant value to true if a given type is of the required iterator type, false otherwise. More...
     
    struct  is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > >
     Provides the member constant value to true if a given type is of the required iterator type, false otherwise. More...
     
    struct  is_ebco_eligible
     Provides the member constant value to true if a given type is both an empty and non-final class, false otherwise. More...
     
    struct  y_combinator
     Basic implementation of a y-combinator. More...
     
    struct  basic_component_traits
     Commonly used default traits for all types. More...
     
    struct  component_traits
     Common way to access various properties of components. More...
     
    class  basic_view
     View implementation. More...
     
    class  basic_runtime_view
     Runtime view. More...
    struct  basic_runtime_view
     Runtime view implementation. More...
     
    class  basic_group
     Group. More...
    struct  basic_collector< matcher< type_list< Reject... >, type_list< Require... >, Rule... >, Other... >
     Collector. More...
     
    class  basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
     Default constructor. More...
    struct  basic_runtime_view< basic_sparse_set< Entity, Allocator > >
     Generic runtime view. More...
     
    class  sigh_storage_mixin
     Mixin type used to add signal support to storage types. More...
     
    class  basic_storage< Entity, Type, Allocator, std::enable_if_t< ignore_as_empty_v< Type > > >
     Default constructor. More...
     
    struct  storage_traits
     Provides a common way to access certain properties of storage types. More...
     
    class  basic_view< Entity, get_t< Component >, exclude_t<>, std::void_t< std::enable_if_t<!component_traits< std::remove_const_t< Component > >::in_place_delete > > >
     Single component view specialization. More...
     
    struct  service_locator
     Service locator, nothing more. More...
    struct  locator
     Service locator, nothing more. More...
     
    struct  adl_meta_pointer_like
     Fake ADL based lookup function for meta pointer-like types. More...
    struct  meta_associative_container_traits< std::unordered_set< Key, Args... > >
     Meta associative container traits for std::unordered_sets of any type. More...
     
    struct  meta_associative_container_traits< dense_hash_map< Key, Type, Args... > >
     Meta associative container traits for dense_hash_maps of any type. More...
    struct  meta_associative_container_traits< dense_map< Key, Type, Args... > >
     Meta associative container traits for dense_maps of any type. More...
     
    struct  meta_associative_container_traits< dense_hash_set< Type, Args... > >
     Meta associative container traits for dense_hash_sets of any type. More...
    struct  meta_associative_container_traits< dense_set< Type, Args... > >
     Meta associative container traits for dense_sets of any type. More...
     
    struct  meta_ctx
     Opaque container for a meta context. More...
     Cooperative scheduler for processes. More...
     
    class  resource_cache
     Simple cache for resources of a given type. More...
     Basic cache for resources of any type. More...
     
    class  resource_handle
     Shared resource handle. More...
    struct  resource_loader
     Transparent loader for shared resources. More...
     
    class  resource_loader
     Base class for resource loaders. More...
    class  resource
     Basic resource handle. More...
     
    struct  connect_arg_t
     Used to wrap a function or a member of a specified type. More...
    class  delegate< Ret(Args...)>
     Utility class to use to send around functions and members. More...
     
    class  dispatcher
     Basic dispatcher implementation. More...
    class  basic_dispatcher
     Basic dispatcher implementation. More...
     
    class  emitter
     General purpose event emitter. More...
    using view = basic_view< entity, Get, Exclude >
     Alias declaration for the most common use case. More...
     
    -using runtime_view = basic_runtime_view< entity >
     Alias declaration for the most common use case.
     
    +using runtime_view = basic_runtime_view< sparse_set >
     Alias declaration for the most common use case.
     
    template<typename... Args>
    using group = basic_group< entity, Args... >
     Alias declaration for the most common use case. More...
    using meta_function_helper_t = typename meta_function_helper< Type, Candidate >::type
     Helper type. More...
     
    template<typename Concept >
    using poly = basic_poly< Concept, sizeof(double[2])>
     Alias declaration for the most common use case. More...
     
    template<typename Concept >
    using poly = basic_poly< Concept >
     Alias declaration for the most common use case. More...
     
    +using dispatcher = basic_dispatcher<>
     Alias declaration for the most common use case.
     
    @@ -772,6 +770,10 @@ Functions + + + + @@ -800,12 +802,12 @@ Functions - - - - - - + + + + + + @@ -831,32 +833,52 @@ Functions + + + + + + + + + + + + + + + + - + - + - + - + - + - + - + + + + + @@ -985,7 +1007,7 @@ Functions - + @@ -1020,10 +1042,18 @@ Functions - + + + + + + + + + @@ -1091,10 +1121,6 @@ Variables - - - - @@ -1108,7 +1134,7 @@ Variables - + @@ -1195,7 +1221,7 @@ template<typename To , typename From > -

    Definition at line 645 of file type_traits.hpp.

    +

    Definition at line 618 of file type_traits.hpp.

    @@ -1299,7 +1325,7 @@ template<typename Member > -

    Definition at line 674 of file type_traits.hpp.

    +

    Definition at line 647 of file type_traits.hpp.

    @@ -1330,8 +1356,8 @@ template<typename Type , typename Candidate > - -

    ◆ poly

    + +

    ◆ poly

    @@ -1339,7 +1365,7 @@ template<typename Type , typename Candidate >
    template<typename Concept >

    Enumerations

    void swap (compressed_pair< First, Second > &lhs, compressed_pair< First, Second > &rhs)
     Swaps two compressed pair objects. More...
     
    template<typename Char >
     basic_hashed_string (const Char *str, const std::size_t len) -> basic_hashed_string< Char >
     Deduction guide. More...
     
    template<typename Char , std::size_t N>
     basic_hashed_string (const Char(&str)[N]) -> basic_hashed_string< Char >
     Deduction guide. More...
    constexpr bool operator>= (const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
     Compares two hashed strings. More...
     
    constexpr entt::hashed_string operator""_hs (const char *str, std::size_t)
     User defined literal for hashed strings. More...
     
    constexpr entt::hashed_wstring operator""_hws (const wchar_t *str, std::size_t)
     User defined literal for hashed wstrings. More...
     
    constexpr hashed_string operator""_hs (const char *str, std::size_t)
     User defined literal for hashed strings. More...
     
    constexpr hashed_wstring operator""_hws (const wchar_t *str, std::size_t)
     User defined literal for hashed wstrings. More...
     
    template<typename Type >
    constexpr auto to_address (Type &&ptr)
     Unwraps fancy pointers, does nothing otherwise (waiting for C++20). More...
    constexpr std::size_t fast_mod (const std::size_t value, const std::size_t mod)
     Fast module utility function (powers of two only). More...
     
    template<typename Type , typename Allocator , typename... Args>
    auto allocate_unique (Allocator &allocator, Args &&...args)
     Allows std::unique_ptr to use allocators (waiting for C++20). More...
     
    template<typename Type , typename Allocator , typename... Args>
    constexpr auto uses_allocator_construction_args (const Allocator &allocator, Args &&...args)
     Uses-allocator construction utility (waiting for C++20). More...
     
    template<typename Type , typename Allocator , typename... Args>
    constexpr Type make_obj_using_allocator (const Allocator &allocator, Args &&...args)
     Uses-allocator construction utility (waiting for C++20). More...
     
    template<typename Type , typename Allocator , typename... Args>
    constexpr Type * uninitialized_construct_using_allocator (Type *value, const Allocator &allocator, Args &&...args)
     Uses-allocator construction utility (waiting for C++20). More...
     
    template<typename Type >
    constexpr decltype(auto) unwrap_tuple (Type &&value)
     Utility function to unwrap tuples of a single element. More...
     
    constexpr bool operator== (const type_info &lhs, const type_info &rhs)
    constexpr bool operator== (const type_info &lhs, const type_info &rhs)
     Compares the contents of two type info objects. More...
     
    constexpr bool operator!= (const type_info &lhs, const type_info &rhs)
    constexpr bool operator!= (const type_info &lhs, const type_info &rhs)
     Compares the contents of two type info objects. More...
     
    constexpr bool operator< (const type_info &lhs, const type_info &rhs)
    constexpr bool operator< (const type_info &lhs, const type_info &rhs)
     Compares two type info objects. More...
     
    constexpr bool operator<= (const type_info &lhs, const type_info &rhs)
    constexpr bool operator<= (const type_info &lhs, const type_info &rhs)
     Compares two type info objects. More...
     
    constexpr bool operator> (const type_info &lhs, const type_info &rhs)
    constexpr bool operator> (const type_info &lhs, const type_info &rhs)
     Compares two type info objects. More...
     
    constexpr bool operator>= (const type_info &lhs, const type_info &rhs)
    constexpr bool operator>= (const type_info &lhs, const type_info &rhs)
     Compares two type info objects. More...
     
    template<typename Type >
    const type_info & type_id ()
    const type_info & type_id ()
     Returns the type info object associated to a given type. More...
     
    template<typename Type >
    const type_info & type_id (Type &&)
     Returns the type info object associated to a given type. More...
     
    template<typename... Type, typename... Other>
    constexpr type_list< Type..., Other... > operator+ (type_list< Type... >, type_list< Other... >)
     Concatenates multiple type lists. More...
    meta_type resolve (const id_type id)
     Returns the meta type associated with a given identifier, if any. More...
     
    meta_type resolve (const type_info &info)
    meta_type resolve (const type_info &info)
     Returns the meta type associated with a given type info object. More...
     
    template<typename Policy = as_is_t, typename Type >
    meta_any meta_construct (meta_any *const args)
     Tries to construct an instance given a list of erased parameters. More...
     
    template<auto Member, typename Poly , typename... Args>
    template<std::size_t Member, typename Poly , typename... Args>
    decltype(auto) poly_call (Poly &&self, Args &&...args)
     Shortcut for calling poly_base<Type>invoke. More...
     
    template<typename Res , typename Other >
    bool operator== (const resource< Res > &lhs, const resource< Other > &rhs)
     Compares two handles. More...
     
    template<typename ILhs , typename IRhs >
    bool operator!= (const resource< ILhs > &lhs, const resource< IRhs > &rhs)
     Compares two handles. More...
     
    template<typename Ret , typename... Args>
    bool operator!= (const delegate< Ret(Args...)> &lhs, const delegate< Ret(Args...)> &rhs)
     Compares the contents of two delegates. More...
    constexpr bool is_iterator_v = is_iterator<Type>::value
     Helper variable template. More...
     
    template<typename Type , typename It >
    constexpr bool is_iterator_type_v = is_iterator_type<Type, It>::value
     Helper variable template. More...
     
    template<typename Type >
    constexpr bool is_ebco_eligible_v = is_ebco_eligible<Type>::value
     Helper variable template. More...
     Helper variable template. More...
     
    template<class Type >
    constexpr bool ignore_as_empty_v = component_traits<Type>::ignore_if_empty &&std::is_empty_v<Type>
    constexpr bool ignore_as_empty_v = (component_traits<Type>::page_size == 0u)
     Helper variable template. More...
     
    constexpr null_t null {}
    - +
    using entt::poly = typedef basic_poly<Concept, sizeof(double[2])>using entt::poly = typedef basic_poly<Concept>
    @@ -1352,7 +1378,7 @@ template<typename Concept >
    -

    Definition at line 16 of file fwd.hpp.

    +

    Definition at line 17 of file fwd.hpp.

    @@ -1652,6 +1678,56 @@ template<typename Get , typename Exclude = exclude_t<>>

    Function Documentation

    + +

    ◆ allocate_unique()

    + +
    +
    +
    +template<typename Type , typename Allocator , typename... Args>
    + + + + + + + + + + + + + + + + + + +
    auto entt::allocate_unique (Allocator & allocator,
    Args &&... args 
    )
    +
    + +

    Allows std::unique_ptr to use allocators (waiting for C++20).

    +
    Template Parameters
    + + + + +
    TypeType of object to allocate for and to construct.
    AllocatorType of allocator used to manage memory and elements.
    ArgsTypes of arguments to use to construct the object.
    +
    +
    +
    Parameters
    + + + +
    allocatorThe allocator to use.
    argsParameters to use to construct the object.
    +
    +
    +
    Returns
    A properly initialized unique pointer with a custom deleter.
    + +

    Definition at line 146 of file memory.hpp.

    + +
    +

    ◆ any_cast() [1/5]

    @@ -1687,7 +1763,7 @@ template<typename Type , std::size_t Len, std::size_t Align>
    Returns
    The element converted to the requested type.
    -

    Definition at line 436 of file any.hpp.

    +

    Definition at line 432 of file any.hpp.

    @@ -1726,7 +1802,7 @@ template<typename Type , std::size_t Len, std::size_t Align>
    Returns
    The element converted to the requested type.
    -

    Definition at line 427 of file any.hpp.

    +

    Definition at line 423 of file any.hpp.

    @@ -1765,7 +1841,7 @@ template<typename Type , std::size_t Len, std::size_t Align>
    Returns
    The element converted to the requested type.
    -

    Definition at line 459 of file any.hpp.

    +

    Definition at line 455 of file any.hpp.

    @@ -1804,7 +1880,7 @@ template<typename Type , std::size_t Len, std::size_t Align>
    Returns
    The element converted to the requested type.
    -

    Definition at line 419 of file any.hpp.

    +

    Definition at line 415 of file any.hpp.

    @@ -1843,7 +1919,7 @@ template<typename Type , std::size_t Len, std::size_t Align>
    Returns
    The element converted to the requested type.
    -

    Definition at line 452 of file any.hpp.

    +

    Definition at line 448 of file any.hpp.

    @@ -2033,10 +2109,55 @@ template<typename Entity > + + + +

    ◆ basic_hashed_string() [1/2]

    + +
    +
    +
    +template<typename Char >
    + + + + + + + + + + + + + + + + + + +
    entt::basic_hashed_string (const Char * str,
    const std::size_t len 
    ) -> basic_hashed_string< Char >
    +
    + +

    Deduction guide.

    +
    Template Parameters
    + + +
    CharCharacter type.
    +
    +
    +
    Parameters
    + + + +
    strHuman-readable identifier.
    lenLength of the string to hash.
    +
    +
    +
    -

    ◆ basic_hashed_string()

    +

    ◆ basic_hashed_string() [2/2]

    @@ -2054,7 +2175,6 @@ template<typename Char , std::size_t N>

    Deduction guide.

    -

    It allows to deduce the character type of the hashed string directly from a human-readable identifer provided to the constructor.

    Template Parameters
    @@ -2064,7 +2184,7 @@ template<typename Char , std::size_t N>
    Parameters
    CharCharacter type.
    - +
    strHuman-readable identifer.
    strHuman-readable identifier.
    @@ -2331,7 +2451,7 @@ template<typename Type >
    Returns
    The common remainder.
    -

    Definition at line 101 of file memory.hpp.

    +

    Definition at line 102 of file memory.hpp.

    @@ -2370,7 +2490,7 @@ template<std::size_t Len = basic_any<>::length, std::size_t Align = bas
    Returns
    A properly initialized and not necessarily owning wrapper.
    -

    Definition at line 488 of file any.hpp.

    +

    Definition at line 484 of file any.hpp.

    @@ -2407,7 +2527,7 @@ template<typename Type >
    Returns
    A properly initialized and not necessarily owning wrapper.
    -

    Definition at line 629 of file meta.hpp.

    +

    Definition at line 600 of file meta.hpp.

    @@ -2492,7 +2612,7 @@ template<auto Member, typename Entity = entity>
    Returns
    True if the value is a power of two, false otherwise.
    -

    Definition at line 75 of file memory.hpp.

    +

    Definition at line 76 of file memory.hpp.

    @@ -2532,7 +2652,7 @@ template<typename Type , std::size_t Len = basic_any<>::length, std::si
    Returns
    A properly initialized wrapper for an object of the given type.
    -

    Definition at line 475 of file any.hpp.

    +

    Definition at line 471 of file any.hpp.

    @@ -2570,7 +2690,66 @@ template<typename Type , typename... Args>
    Returns
    A properly initialized wrapper for an object of the given type.
    -

    Definition at line 618 of file meta.hpp.

    +

    Definition at line 589 of file meta.hpp.

    + + + + +

    ◆ make_obj_using_allocator()

    + +
    +
    +
    +template<typename Type , typename Allocator , typename... Args>
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    constexpr Type entt::make_obj_using_allocator (const Allocator & allocator,
    Args &&... args 
    )
    +     		+constexpr
    +
    + +

    Uses-allocator construction utility (waiting for C++20).

    +

    Primarily intended for internal use. Creates an object of a given type by means of uses-allocator construction.

    +
    Template Parameters
    + + + + +
    TypeType of object to create.
    AllocatorType of allocator used to manage memory and elements.
    ArgsTypes of arguments to use to construct the object.
    +
    +
    +
    Parameters
    + + + +
    allocatorThe allocator to use.
    argsParameters to use to construct the object.
    +
    +
    +
    Returns
    A newly created object of the given type.
    + +

    Definition at line 264 of file memory.hpp.

    @@ -2602,7 +2781,7 @@ template<typename Type >
    Returns
    A meta factory for the given type.
    -

    Definition at line 582 of file factory.hpp.

    +

    Definition at line 580 of file factory.hpp.

    @@ -2953,7 +3132,7 @@ template<typename Type >
    See also
    meta_reset
    -

    Definition at line 635 of file factory.hpp.

    +

    Definition at line 633 of file factory.hpp.

    @@ -2992,7 +3171,7 @@ template<typename Type > -

    Definition at line 599 of file factory.hpp.

    +

    Definition at line 597 of file factory.hpp.

    @@ -3078,12 +3257,12 @@ template<typename Type , auto Data>
    Returns
    The smallest power of two greater than or equal to the given value.
    -

    Definition at line 84 of file memory.hpp.

    +

    Definition at line 85 of file memory.hpp.

    -

    ◆ operator!=() [1/9]

    +

    ◆ operator!=() [1/10]

    @@ -3135,12 +3314,12 @@ template<std::size_t Len, std::size_t Align>
    Returns
    True if the two wrappers differ in their content, false otherwise.
    -

    Definition at line 406 of file any.hpp.

    +

    Definition at line 402 of file any.hpp.

    -

    ◆ operator!=() [2/9]

    +

    ◆ operator!=() [2/10]

    @@ -3184,12 +3363,12 @@ template<typename... Args, typename... Other>
    Returns
    False if both handles refer to the same registry and the same entity, true otherwise.
    -

    Definition at line 320 of file handle.hpp.

    +

    Definition at line 320 of file handle.hpp.

    -

    ◆ operator!=() [3/9]

    +

    ◆ operator!=() [3/10]

    @@ -3240,12 +3419,12 @@ template<typename Char >
    Returns
    True if the two hashed strings differ, false otherwise.
    -

    Definition at line 229 of file hashed_string.hpp.

    +

    Definition at line 248 of file hashed_string.hpp.

    -

    ◆ operator!=() [4/9]

    +

    ◆ operator!=() [4/10]

    @@ -3289,12 +3468,12 @@ template<typename Ret , typename... Args>
    Returns
    True if the two contents differ, false otherwise.
    -

    Definition at line 310 of file delegate.hpp.

    +

    Definition at line 311 of file delegate.hpp.

    -

    ◆ operator!=() [5/9]

    +

    ◆ operator!=() [5/10]

    @@ -3350,7 +3529,7 @@ template<typename Entity >
    -

    ◆ operator!=() [6/9]

    +

    ◆ operator!=() [6/10]

    @@ -3406,7 +3585,7 @@ template<typename Entity >
    -

    ◆ operator!=() [7/9]

    +

    ◆ operator!=() [7/10]

    @@ -3449,12 +3628,12 @@ template<typename Entity >
    Returns
    True if the two wrappers differ in their content, false otherwise.
    -

    Definition at line 606 of file meta.hpp.

    +

    Definition at line 577 of file meta.hpp.

    -

    ◆ operator!=() [8/9]

    +

    ◆ operator!=() [8/10]

    @@ -3497,12 +3676,61 @@ template<typename Entity >
    Returns
    False if the objects refer to the same node, true otherwise.
    -

    Definition at line 1377 of file meta.hpp.

    +

    Definition at line 1349 of file meta.hpp.

    + +
    + + +

    ◆ operator!=() [9/10]

    + +
    +
    +
    +template<typename ILhs , typename IRhs >
    + + + + + + + + + + + + + + + + + + +
    bool entt::operator!= (const resource< ILhs > & lhs,
    const resource< IRhs > & rhs 
    )
    +
    + +

    Compares two handles.

    +
    Template Parameters
    + + + +
    ResType of resource managed by the first handle.
    OtherType of resource managed by the second handle.
    +
    +
    +
    Parameters
    + + + +
    lhsA valid handle.
    rhsA valid handle.
    +
    +
    +
    Returns
    False if both handles refer to the same registry, true otherwise.
    + +

    Definition at line 182 of file resource.hpp.

    -

    ◆ operator!=() [9/9]

    +

    ◆ operator!=() [10/10]

    @@ -3513,13 +3741,13 @@ template<typename Entity >
    constexpr bool entt::operator!= (const type_info & const type_info &  lhs,
    const type_info & const type_info &  rhs 
    - + @@ -3592,12 +3820,12 @@ template<typename Entity >
    Returns
    A properly initialized hashed string.
    -

    Definition at line 297 of file hashed_string.hpp.

    +

    Definition at line 316 of file hashed_string.hpp.

    - -

    ◆ operator""_hws()

    + +

    ◆ operator""_hws()

    @@ -3606,7 +3834,7 @@ template<typename Entity >
    - + - + @@ -4268,7 +4545,7 @@ template<typename Char >
    Returns
    True if the first element is greater than the second, false otherwise.
    -

    Definition at line 267 of file hashed_string.hpp.

    +

    Definition at line 286 of file hashed_string.hpp.

    @@ -4284,13 +4561,13 @@ template<typename Char > - + - + @@ -4372,7 +4649,7 @@ template<typename Char >
    Returns
    True if the first element is greater than or equal to the second, false otherwise.
    -

    Definition at line 280 of file hashed_string.hpp.

    +

    Definition at line 299 of file hashed_string.hpp.

    @@ -4388,13 +4665,13 @@ template<typename Char > - + - + @@ -4549,7 +4826,7 @@ template<class... Func>
    -template<auto Member, typename Poly , typename... Args>
    +template<std::size_t Member, typename Poly , typename... Args>
    constexpr entt::hashed_string entt::literals::operator""_hs constexpr hashed_string entt::literals::operator""_hs ( const char *  str, - + @@ -3639,7 +3867,7 @@ template<typename Entity >
    Returns
    A properly initialized hashed wstring.
    -

    Definition at line 306 of file hashed_string.hpp.

    +

    Definition at line 325 of file hashed_string.hpp.

    @@ -3795,7 +4023,7 @@ template<typename Char >
    Returns
    True if the first element is less than the second, false otherwise.
    -

    Definition at line 241 of file hashed_string.hpp.

    +

    Definition at line 260 of file hashed_string.hpp.

    @@ -3811,13 +4039,13 @@ template<typename Char > - + - + @@ -3899,7 +4127,7 @@ template<typename Char >
    Returns
    True if the first element is less than or equal to the second, false otherwise.
    -

    Definition at line 254 of file hashed_string.hpp.

    +

    Definition at line 273 of file hashed_string.hpp.

    @@ -3915,13 +4143,13 @@ template<typename Char > - + - + @@ -3952,7 +4180,7 @@ template<typename Char > -

    ◆ operator==() [1/5]

    +

    ◆ operator==() [1/6]

    @@ -3996,12 +4224,12 @@ template<typename... Args, typename... Other>
    Returns
    True if both handles refer to the same registry and the same entity, false otherwise.
    -

    Definition at line 306 of file handle.hpp.

    +

    Definition at line 306 of file handle.hpp.

    -

    ◆ operator==() [2/5]

    +

    ◆ operator==() [2/6]

    @@ -4052,12 +4280,12 @@ template<typename Char >
    Returns
    True if the two hashed strings are identical, false otherwise.
    -

    Definition at line 217 of file hashed_string.hpp.

    +

    Definition at line 236 of file hashed_string.hpp.

    -

    ◆ operator==() [3/5]

    +

    ◆ operator==() [3/6]

    @@ -4113,7 +4341,7 @@ template<typename Entity >
    -

    ◆ operator==() [4/5]

    +

    ◆ operator==() [4/6]

    @@ -4166,10 +4394,59 @@ template<typename Entity >

    Definition at line 303 of file entity.hpp.

    +
    + + +

    ◆ operator==() [5/6]

    + +
    +
    +
    +template<typename Res , typename Other >
    +
    constexpr entt::hashed_wstring entt::literals::operator""_hws constexpr hashed_wstring entt::literals::operator""_hws ( const wchar_t *  str,
    constexpr bool entt::operator< (const type_info & const type_info &  lhs,
    const type_info & const type_info &  rhs 
    constexpr bool entt::operator<= (const type_info & const type_info &  lhs,
    const type_info & const type_info &  rhs 
    + + + + + + + + + + + + + + + + + +
    bool entt::operator== (const resource< Res > & lhs,
    const resource< Other > & rhs 
    )
    +
    + +

    Compares two handles.

    +
    Template Parameters
    + + + +
    ResType of resource managed by the first handle.
    OtherType of resource managed by the second handle.
    +
    +
    +
    Parameters
    + + + +
    lhsA valid handle.
    rhsA valid handle.
    +
    +
    +
    Returns
    True if both handles refer to the same resource, false otherwise.
    + +

    Definition at line 169 of file resource.hpp.

    +
    -

    ◆ operator==() [5/5]

    +

    ◆ operator==() [6/6]

    @@ -4180,13 +4457,13 @@ template<typename Entity >
    constexpr bool entt::operator== (const type_info & const type_info &  lhs,
    const type_info & const type_info &  rhs 
    constexpr bool entt::operator> (const type_info & const type_info &  lhs,
    const type_info & const type_info &  rhs 
    constexpr bool entt::operator>= (const type_info & const type_info &  lhs,
    const type_info & const type_info &  rhs 
    @@ -4589,7 +4866,7 @@ template<auto Member, typename Poly , typename... Args>
    Returns
    The return value of the invoked function, if any.
    -

    Definition at line 172 of file poly.hpp.

    +

    Definition at line 173 of file poly.hpp.

    @@ -4644,7 +4921,7 @@ template<typename Allocator > -

    Definition at line 35 of file memory.hpp.

    +

    Definition at line 36 of file memory.hpp.

    @@ -4699,7 +4976,7 @@ template<typename Allocator > -

    Definition at line 48 of file memory.hpp.

    +

    Definition at line 49 of file memory.hpp.

    @@ -4754,7 +5031,7 @@ template<typename Allocator > -

    Definition at line 61 of file memory.hpp.

    +

    Definition at line 62 of file memory.hpp.

    @@ -4848,7 +5125,7 @@ An iterable range to use to visit all meta types. - + @@ -5001,7 +5278,7 @@ template<typename Type >
    Returns
    A raw pointer that represents the address of the original pointer.
    -

    Definition at line 20 of file memory.hpp.

    +

    Definition at line 21 of file memory.hpp.

    @@ -5191,7 +5468,7 @@ template<typename Entity > -

    ◆ type_id()

    +

    ◆ type_id() [1/2]

    @@ -5199,7 +5476,7 @@ template<typename Entity >
    template<typename Type >
    decltype(auto) entt::poly_call
    meta_type entt::resolve (const type_info & const type_info &  info)
    - + @@ -5208,16 +5485,116 @@ template<typename Type >

    Returns the type info object associated to a given type.

    -

    The type doesn't need to be a complete type. If the type is a reference, the result refers to the referenced type. In all cases, top-level cv-qualifiers are ignored.

    +

    The returned element refers to an object with static storage duration.
    + The type doesn't need to be a complete type. If the type is a reference, the result refers to the referenced type. In all cases, top-level cv-qualifiers are ignored.

    Template Parameters
    const type_info& entt::type_id const type_info& entt::type_id ( )
    TypeType for which to generate a type info object.
    -
    Returns
    A properly initialized type info object.
    +
    Returns
    A reference to a properly initialized type info object.
    -

    Definition at line 256 of file type_info.hpp.

    +

    Definition at line 257 of file type_info.hpp.

    + + + + +

    ◆ type_id() [2/2]

    + +
    +
    +
    +template<typename Type >
    + + + + + + + + +
    const type_info& entt::type_id (Type && )
    +
    + +

    Returns the type info object associated to a given type.

    +

    The returned element refers to an object with static storage duration.
    + The type doesn't need to be a complete type. If the type is a reference, the result refers to the referenced type. In all cases, top-level cv-qualifiers are ignored.

    +
    Template Parameters
    + + +
    TypeType for which to generate a type info object.
    +
    +
    +
    Returns
    A reference to a properly initialized type info object.
    + +

    Definition at line 268 of file type_info.hpp.

    + +
    +
    + +

    ◆ uninitialized_construct_using_allocator()

    + +
    +
    +
    +template<typename Type , typename Allocator , typename... Args>
    + + + + + +
    + + + + + + + + + + + + + + + + + + + + + + + + +
    constexpr Type* entt::uninitialized_construct_using_allocator (Type * value,
    const Allocator & allocator,
    Args &&... args 
    )
    +     		+constexpr
    +
    + +

    Uses-allocator construction utility (waiting for C++20).

    +

    Primarily intended for internal use. Creates an object of a given type by means of uses-allocator construction at an uninitialized memory location.

    +
    Template Parameters
    + + + + +
    TypeType of object to create.
    AllocatorType of allocator used to manage memory and elements.
    ArgsTypes of arguments to use to construct the object.
    +
    +
    +
    Parameters
    + + + + +
    valueMemory location in which to place the object.
    allocatorThe allocator to use.
    argsParameters to use to construct the object.
    +
    +
    +
    Returns
    A pointer to the newly created object of the given type.
    + +

    Definition at line 283 of file memory.hpp.

    @@ -5264,6 +5641,65 @@ template<typename Type >

    Definition at line 19 of file tuple.hpp.

    + + + +

    ◆ uses_allocator_construction_args()

    + +
    +
    +
    +template<typename Type , typename Allocator , typename... Args>
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    constexpr auto entt::uses_allocator_construction_args (const Allocator & allocator,
    Args &&... args 
    )
    +     		+constexpr
    +
    + +

    Uses-allocator construction utility (waiting for C++20).

    +

    Primarily intended for internal use. Prepares the argument list needed to create an object of a given type by means of uses-allocator construction.

    +
    Template Parameters
    + + + + +
    TypeType to return arguments for.
    AllocatorType of allocator used to manage memory and elements.
    ArgsTypes of arguments to use to construct the object.
    +
    +
    +
    Parameters
    + + + +
    allocatorThe allocator to use.
    argsParameters to use to construct the object.
    +
    +
    +
    Returns
    The arguments needed to create an object of the given type.
    + +

    Definition at line 246 of file memory.hpp.

    +

    Variable Documentation

    @@ -5415,7 +5851,7 @@ template<class Type >     		- +
    constexpr bool entt::ignore_as_empty_v = component_traits<Type>::ignore_if_empty &&std::is_empty_v<Type>constexpr bool entt::ignore_as_empty_v = (component_traits<Type>::page_size == 0u)
    - - - - -
    - - - - -
    constexpr bool entt::is_iterator_type_v = is_iterator_type<Type, It>::value
    -     		-inlineconstexpr
    -
    - -

    Helper variable template.

    -
    Template Parameters
    - - - -
    TypeThe type to test.
    ItRequired iterator type.
    -
    -
    - -

    Definition at line 514 of file type_traits.hpp.

    +

    Definition at line 592 of file type_traits.hpp.

    @@ -5743,7 +6144,7 @@ template<typename Type > -

    Definition at line 549 of file type_traits.hpp.

    +

    Definition at line 522 of file type_traits.hpp.

    @@ -5802,7 +6203,7 @@ template<id_type Value>

    Compile-time constant for null entities.

    -

    There exist implicit conversions from this variable to identifiers of any allowed type. Similarly, there exist comparision operators between the null entity and any other identifier.

    +

    There exist implicit conversions from this variable to identifiers of any allowed type. Similarly, there exist comparison operators between the null entity and any other identifier.

    Definition at line 326 of file entity.hpp.

    @@ -5897,7 +6298,7 @@ template<typename Type >

    Compile-time constant for tombstone entities.

    -

    There exist implicit conversions from this variable to identifiers of any allowed type. Similarly, there exist comparision operators between the tombstone entity and any other identifier.

    +

    There exist implicit conversions from this variable to identifiers of any allowed type. Similarly, there exist comparison operators between the tombstone entity and any other identifier.

    Definition at line 335 of file entity.hpp.

    diff --git a/namespacemembers.html b/namespacemembers.html index 4c2fa5164..abbffde58 100644 --- a/namespacemembers.html +++ b/namespacemembers.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - + + @@ -83,170 +83,166 @@ $(function() { - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + - - + +
     ►NenttEnTT default namespace
     ►Nstd
    diff --git a/node_8hpp_source.html b/node_8hpp_source.html index 092b4e5ec..52363d67c 100644 --- a/node_8hpp_source.html +++ b/node_8hpp_source.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - - -
    -
    EnTT -  3.9.0 -
    -
    - - - - - - - - - -
    -
    - - -
    - -
    - - - -
    -
    -
    handle.hpp
    -
    -
    -
    1 #ifndef ENTT_RESOURCE_HANDLE_HPP
    -
    2 #define ENTT_RESOURCE_HANDLE_HPP
    -
    3 
    -
    4 #include <memory>
    -
    5 #include <type_traits>
    -
    6 #include <utility>
    -
    7 #include "../config/config.h"
    -
    8 #include "fwd.hpp"
    -
    9 
    -
    10 namespace entt {
    -
    11 
    -
    24 template<typename Resource>
    -
    25 class resource_handle {
    -
    27  template<typename>
    -
    28  friend class resource_handle;
    -
    29 
    -
    30 public:
    -
    32  using size_type = long;
    -
    34  using resource_type = Resource;
    -
    35 
    -
    37  resource_handle() ENTT_NOEXCEPT = default;
    -
    38 
    -
    43  resource_handle(std::shared_ptr<resource_type> res) ENTT_NOEXCEPT
    -
    44  : resource{std::move(res)} {}
    -
    45 
    -
    50  resource_handle(const resource_handle &other) ENTT_NOEXCEPT = default;
    -
    51 
    -
    56  resource_handle(resource_handle &&other) ENTT_NOEXCEPT = default;
    -
    57 
    -
    64  template<typename Other>
    -
    65  resource_handle(const resource_handle<Other> &other, resource_type &res) noexcept
    -
    66  : resource{other.resource, std::addressof(res)} {}
    -
    67 
    -
    73  template<typename Other, typename = std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>>>
    -
    74  resource_handle(const resource_handle<Other> &other) ENTT_NOEXCEPT
    -
    75  : resource{other.resource} {}
    -
    76 
    -
    82  template<typename Other, typename = std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>>>
    -
    83  resource_handle(resource_handle<Other> &&other) ENTT_NOEXCEPT
    -
    84  : resource{std::move(other.resource)} {}
    -
    85 
    -
    91  resource_handle &operator=(const resource_handle &other) ENTT_NOEXCEPT = default;
    -
    92 
    -
    98  resource_handle &operator=(resource_handle &&other) ENTT_NOEXCEPT = default;
    -
    99 
    -
    106  template<typename Other>
    -
    107  std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>, resource_handle &>
    -
    108  operator=(const resource_handle<Other> &other) ENTT_NOEXCEPT {
    -
    109  resource = other.resource;
    -
    110  return *this;
    -
    111  }
    -
    112 
    -
    119  template<typename Other>
    -
    120  std::enable_if_t<!std::is_same_v<resource_type, Other> && std::is_base_of_v<resource_type, Other>, resource_handle &>
    -
    121  operator=(resource_handle<Other> &&other) ENTT_NOEXCEPT {
    -
    122  resource = std::move(other.resource);
    -
    123  return *this;
    -
    124  }
    -
    125 
    -
    134  [[nodiscard]] resource_type &get() const ENTT_NOEXCEPT {
    -
    135  return *resource;
    -
    136  }
    -
    137 
    -
    139  [[nodiscard]] operator resource_type &() const ENTT_NOEXCEPT {
    -
    140  return get();
    -
    141  }
    -
    142 
    -
    144  [[nodiscard]] resource_type &operator*() const ENTT_NOEXCEPT {
    -
    145  return get();
    -
    146  }
    -
    147 
    -
    157  [[nodiscard]] resource_type *operator->() const ENTT_NOEXCEPT {
    -
    158  return resource.get();
    -
    159  }
    -
    160 
    -
    165  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    -
    166  return static_cast<bool>(resource);
    -
    167  }
    -
    168 
    -
    173  [[nodiscard]] size_type use_count() const ENTT_NOEXCEPT {
    -
    174  return resource.use_count();
    -
    175  }
    -
    176 
    -
    177 private:
    -
    178  std::shared_ptr<resource_type> resource;
    -
    179 };
    -
    180 
    -
    181 } // namespace entt
    -
    182 
    -
    183 #endif
    -
    entt::resource_handle
    Shared resource handle.
    Definition: handle.hpp:25
    -
    entt::resource_handle::resource_handle
    resource_handle(resource_handle &&other)=default
    Move constructor.
    -
    entt::resource_handle::get
    resource_type & get() const
    Gets a reference to the managed resource.
    Definition: handle.hpp:134
    -
    entt::resource_handle::operator=
    resource_handle & operator=(const resource_handle &other)=default
    Copy assignment operator.
    -
    entt::resource_handle::use_count
    size_type use_count() const
    Returns the number of handles pointing the same resource.
    Definition: handle.hpp:173
    -
    entt::resource_handle::operator*
    resource_type & operator*() const
    Gets a reference to the managed resource.
    Definition: handle.hpp:144
    -
    entt::resource_handle::resource_handle
    resource_handle(resource_handle< Other > &&other)
    Move constructs a handle which takes ownership of the resource.
    Definition: handle.hpp:83
    -
    entt::resource_handle::operator=
    std::enable_if_t<!std::is_same_v< resource_type, Other > &&std::is_base_of_v< resource_type, Other >, resource_handle & > operator=(const resource_handle< Other > &other)
    Copy assignment operator from foreign handle.
    Definition: handle.hpp:108
    -
    entt::resource_handle::resource_handle
    resource_handle(const resource_handle< Other > &other, resource_type &res) noexcept
    Aliasing constructor.
    Definition: handle.hpp:65
    -
    entt::resource_handle::operator=
    std::enable_if_t<!std::is_same_v< resource_type, Other > &&std::is_base_of_v< resource_type, Other >, resource_handle & > operator=(resource_handle< Other > &&other)
    Move assignment operator from foreign handle.
    Definition: handle.hpp:121
    -
    entt::resource_handle::resource_type
    Resource resource_type
    Type of resources managed by a cache.
    Definition: handle.hpp:34
    -
    entt::resource_handle::operator=
    resource_handle & operator=(resource_handle &&other)=default
    Move assignment operator.
    -
    entt::resource_handle::resource_handle
    resource_handle(const resource_handle< Other > &other)
    Copy constructs a handle which shares ownership of the resource.
    Definition: handle.hpp:74
    -
    entt::resource_handle::size_type
    long size_type
    Unsigned integer type.
    Definition: handle.hpp:32
    -
    entt::resource_handle::resource_handle
    resource_handle(const resource_handle &other)=default
    Copy constructor.
    -
    entt::resource_handle::operator->
    resource_type * operator->() const
    Gets a pointer to the managed resource.
    Definition: handle.hpp:157
    -
    entt::resource_handle::resource_handle
    resource_handle()=default
    Default constructor.
    -
    entt
    EnTT default namespace.
    Definition: dense_hash_map.hpp:21
    -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/resource_8hpp_source.html b/resource_8hpp_source.html new file mode 100644 index 000000000..84b590694 --- /dev/null +++ b/resource_8hpp_source.html @@ -0,0 +1,192 @@ + + + + + + + +EnTT: src/entt/resource/resource.hpp Source File + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    resource.hpp
    +
    +
    +
    1 #ifndef ENTT_RESOURCE_RESOURCE_HPP
    +
    2 #define ENTT_RESOURCE_RESOURCE_HPP
    +
    3 
    +
    4 #include <memory>
    +
    5 #include <type_traits>
    +
    6 #include <utility>
    +
    7 #include "../config/config.h"
    +
    8 #include "fwd.hpp"
    +
    9 
    +
    10 namespace entt {
    +
    11 
    +
    22 template<typename Type>
    +
    23 class resource {
    +
    25  template<typename>
    +
    26  friend class resource;
    +
    27 
    +
    28  template<typename Other>
    +
    29  static constexpr bool is_acceptable_v = !std::is_same_v<Type, Other> && std::is_constructible_v<Type &, Other &>;
    +
    30 
    +
    31 public:
    +
    33  resource() ENTT_NOEXCEPT
    +
    34  : value{} {}
    +
    35 
    +
    40  explicit resource(std::shared_ptr<Type> res) ENTT_NOEXCEPT
    +
    41  : value{std::move(res)} {}
    +
    42 
    +
    44  resource(const resource &) ENTT_NOEXCEPT = default;
    +
    45 
    +
    47  resource(resource &&) ENTT_NOEXCEPT = default;
    +
    48 
    +
    55  template<typename Other>
    +
    56  resource(const resource<Other> &other, Type &res) ENTT_NOEXCEPT
    +
    57  : value{other.value, std::addressof(res)} {}
    +
    58 
    +
    64  template<typename Other, typename = std::enable_if_t<is_acceptable_v<Other>>>
    +
    65  resource(const resource<Other> &other) ENTT_NOEXCEPT
    +
    66  : value{other.value} {}
    +
    67 
    +
    73  template<typename Other, typename = std::enable_if_t<is_acceptable_v<Other>>>
    +
    74  resource(resource<Other> &&other) ENTT_NOEXCEPT
    +
    75  : value{std::move(other.value)} {}
    +
    76 
    +
    81  resource &operator=(const resource &) ENTT_NOEXCEPT = default;
    +
    82 
    +
    87  resource &operator=(resource &&) ENTT_NOEXCEPT = default;
    +
    88 
    +
    95  template<typename Other>
    +
    96  std::enable_if_t<is_acceptable_v<Other>, resource &>
    +
    97  operator=(const resource<Other> &other) ENTT_NOEXCEPT {
    +
    98  value = other.value;
    +
    99  return *this;
    +
    100  }
    +
    101 
    +
    108  template<typename Other>
    +
    109  std::enable_if_t<is_acceptable_v<Other>, resource &>
    +
    110  operator=(resource<Other> &&other) ENTT_NOEXCEPT {
    +
    111  value = std::move(other.value);
    +
    112  return *this;
    +
    113  }
    +
    114 
    +
    123  [[nodiscard]] Type &operator*() const ENTT_NOEXCEPT {
    +
    124  return *value;
    +
    125  }
    +
    126 
    +
    128  [[nodiscard]] operator Type &() const ENTT_NOEXCEPT {
    +
    129  return *value;
    +
    130  }
    +
    131 
    +
    136  [[nodiscard]] Type *operator->() const ENTT_NOEXCEPT {
    +
    137  return value.get();
    +
    138  }
    +
    139 
    +
    144  [[nodiscard]] explicit operator bool() const ENTT_NOEXCEPT {
    +
    145  return static_cast<bool>(value);
    +
    146  }
    +
    147 
    +
    152  [[nodiscard]] long use_count() const ENTT_NOEXCEPT {
    +
    153  return value.use_count();
    +
    154  }
    +
    155 
    +
    156 private:
    +
    157  std::shared_ptr<Type> value;
    +
    158 };
    +
    159 
    +
    168 template<typename Res, typename Other>
    +
    169 [[nodiscard]] bool operator==(const resource<Res> &lhs, const resource<Other> &rhs) ENTT_NOEXCEPT {
    +
    170  return (std::addressof(*lhs) == std::addressof(*rhs));
    +
    171 }
    +
    172 
    +
    181 template<typename ILhs, typename IRhs>
    +
    182 [[nodiscard]] bool operator!=(const resource<ILhs> &lhs, const resource<IRhs> &rhs) ENTT_NOEXCEPT {
    +
    183  return !(lhs == rhs);
    +
    184 }
    +
    185 
    +
    186 } // namespace entt
    +
    187 
    +
    188 #endif
    +
    entt::resource
    Basic resource handle.
    Definition: resource.hpp:23
    +
    entt::resource::operator=
    std::enable_if_t< is_acceptable_v< Other >, resource & > operator=(resource< Other > &&other)
    Move assignment operator from foreign handle.
    Definition: resource.hpp:110
    +
    entt::resource::use_count
    long use_count() const
    Returns the number of handles pointing the same resource.
    Definition: resource.hpp:152
    +
    entt::resource::resource
    resource()
    Default constructor.
    Definition: resource.hpp:33
    +
    entt::resource::operator*
    Type & operator*() const
    Returns a reference to the managed resource.
    Definition: resource.hpp:123
    +
    entt::resource::resource
    resource(std::shared_ptr< Type > res)
    Creates a handle from a weak pointer, namely a resource.
    Definition: resource.hpp:40
    +
    entt::resource::operator->
    Type * operator->() const
    Returns a pointer to the managed resource.
    Definition: resource.hpp:136
    +
    entt::resource::resource
    resource(resource< Other > &&other)
    Move constructs a handle which takes ownership of the resource.
    Definition: resource.hpp:74
    +
    entt::resource::operator=
    resource & operator=(resource &&)=default
    Default move assignment operator.
    +
    entt::resource::resource
    resource(const resource &)=default
    Default copy constructor.
    +
    entt::resource::resource
    resource(const resource< Other > &other)
    Copy constructs a handle which shares ownership of the resource.
    Definition: resource.hpp:65
    +
    entt::resource::resource
    resource(resource &&)=default
    Default move constructor.
    +
    entt::resource::operator=
    resource & operator=(const resource &)=default
    Default copy assignment operator.
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::operator==
    constexpr bool operator==(const basic_hashed_string< Char > &lhs, const basic_hashed_string< Char > &rhs)
    Compares two hashed strings.
    Definition: hashed_string.hpp:236
    +
    entt::operator!=
    bool operator!=(const basic_any< Len, Align > &lhs, const basic_any< Len, Align > &rhs)
    Checks if two wrappers differ in their content.
    Definition: any.hpp:402
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/runtime__view_8hpp_source.html b/runtime__view_8hpp_source.html index 531dd4e74..362bfd944 100644 --- a/runtime__view_8hpp_source.html +++ b/runtime__view_8hpp_source.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    + + + + + +
    +
    EnTT +  3.10.0 +
    +
    + + + + + + + + + +
    +
    + + +
    + +
    + + + +
    +
    +
    sigh_storage_mixin.hpp
    +
    +
    +
    1 #ifndef ENTT_ENTITY_SIGH_STORAGE_MIXIN_HPP
    +
    2 #define ENTT_ENTITY_SIGH_STORAGE_MIXIN_HPP
    +
    3 
    +
    4 #include <utility>
    +
    5 #include "../config/config.h"
    +
    6 #include "../core/any.hpp"
    +
    7 #include "../signal/sigh.hpp"
    +
    8 #include "fwd.hpp"
    +
    9 
    +
    10 namespace entt {
    +
    11 
    +
    25 template<typename Type>
    +
    26 class sigh_storage_mixin final: public Type {
    +
    27  using basic_iterator = typename Type::basic_iterator;
    +
    28 
    +
    29  template<typename Func>
    +
    30  void notify_destruction(basic_iterator first, basic_iterator last, Func func) {
    +
    31  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
    +
    32 
    +
    33  for(; first != last; ++first) {
    +
    34  const auto entt = *first;
    +
    35  destruction.publish(*owner, entt);
    +
    36  const auto it = Type::find(entt);
    +
    37  func(it, it + 1u);
    +
    38  }
    +
    39  }
    +
    40 
    +
    41  void swap_and_pop(basic_iterator first, basic_iterator last) final {
    +
    42  notify_destruction(std::move(first), std::move(last), [this](auto... args) { Type::swap_and_pop(args...); });
    +
    43  }
    +
    44 
    +
    45  void in_place_pop(basic_iterator first, basic_iterator last) final {
    +
    46  notify_destruction(std::move(first), std::move(last), [this](auto... args) { Type::in_place_pop(args...); });
    +
    47  }
    +
    48 
    +
    49  basic_iterator try_emplace(const typename Type::entity_type entt, const bool force_back, const void *value) final {
    +
    50  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
    +
    51  Type::try_emplace(entt, force_back, value);
    +
    52  construction.publish(*owner, entt);
    +
    53  return Type::find(entt);
    +
    54  }
    +
    55 
    +
    56 public:
    +
    58  using entity_type = typename Type::entity_type;
    +
    59 
    +
    61  using Type::Type;
    +
    62 
    +
    74  [[nodiscard]] auto on_construct() ENTT_NOEXCEPT {
    +
    75  return sink{construction};
    +
    76  }
    +
    77 
    +
    89  [[nodiscard]] auto on_update() ENTT_NOEXCEPT {
    +
    90  return sink{update};
    +
    91  }
    +
    92 
    +
    104  [[nodiscard]] auto on_destroy() ENTT_NOEXCEPT {
    +
    105  return sink{destruction};
    +
    106  }
    +
    107 
    +
    115  template<typename... Args>
    +
    116  decltype(auto) emplace(const entity_type entt, Args &&...args) {
    +
    117  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
    +
    118  Type::emplace(entt, std::forward<Args>(args)...);
    +
    119  construction.publish(*owner, entt);
    +
    120  return this->get(entt);
    +
    121  }
    +
    122 
    +
    130  template<typename... Func>
    +
    131  decltype(auto) patch(const entity_type entt, Func &&...func) {
    +
    132  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
    +
    133  Type::patch(entt, std::forward<Func>(func)...);
    +
    134  update.publish(*owner, entt);
    +
    135  return this->get(entt);
    +
    136  }
    +
    137 
    +
    148  template<typename It, typename... Args>
    +
    149  void insert(It first, It last, Args &&...args) {
    +
    150  ENTT_ASSERT(owner != nullptr, "Invalid pointer to registry");
    +
    151  Type::insert(first, last, std::forward<Args>(args)...);
    +
    152 
    +
    153  for(auto it = construction.empty() ? last : first; it != last; ++it) {
    +
    154  construction.publish(*owner, *it);
    +
    155  }
    +
    156  }
    +
    157 
    +
    162  void bind(any value) ENTT_NOEXCEPT final {
    +
    163  auto *reg = any_cast<basic_registry<entity_type>>(&value);
    +
    164  owner = reg ? reg : owner;
    +
    165  Type::bind(std::move(value));
    +
    166  }
    +
    167 
    +
    168 private:
    +
    169  sigh<void(basic_registry<entity_type> &, const entity_type)> construction{};
    +
    170  sigh<void(basic_registry<entity_type> &, const entity_type)> destruction{};
    +
    171  sigh<void(basic_registry<entity_type> &, const entity_type)> update{};
    +
    172  basic_registry<entity_type> *owner{};
    +
    173 };
    +
    174 
    +
    175 } // namespace entt
    +
    176 
    +
    177 #endif
    +
    entt::basic_any<>
    +
    entt::basic_registry< entity_type >
    +
    entt::sigh_storage_mixin
    Mixin type used to add signal support to storage types.
    Definition: sigh_storage_mixin.hpp:26
    +
    entt::sigh_storage_mixin::bind
    void bind(any value) final
    Forwards variables to mixins, if any.
    Definition: sigh_storage_mixin.hpp:162
    +
    entt::sigh_storage_mixin::entity_type
    typename Type::entity_type entity_type
    Underlying entity identifier.
    Definition: sigh_storage_mixin.hpp:58
    +
    entt::sigh_storage_mixin::on_destroy
    auto on_destroy()
    Returns a sink object.
    Definition: sigh_storage_mixin.hpp:104
    +
    entt::sigh_storage_mixin::on_construct
    auto on_construct()
    Returns a sink object.
    Definition: sigh_storage_mixin.hpp:74
    +
    entt::sigh_storage_mixin::insert
    void insert(It first, It last, Args &&...args)
    Assigns entities to a storage.
    Definition: sigh_storage_mixin.hpp:149
    +
    entt::sigh_storage_mixin::on_update
    auto on_update()
    Returns a sink object.
    Definition: sigh_storage_mixin.hpp:89
    +
    entt::sigh_storage_mixin::patch
    decltype(auto) patch(const entity_type entt, Func &&...func)
    Patches the given instance for an entity.
    Definition: sigh_storage_mixin.hpp:131
    +
    entt::sigh_storage_mixin::emplace
    decltype(auto) emplace(const entity_type entt, Args &&...args)
    Assigns entities to a storage.
    Definition: sigh_storage_mixin.hpp:116
    +
    entt::sigh
    Unmanaged signal handler.
    Definition: fwd.hpp:25
    +
    entt::sink
    Sink class.
    Definition: fwd.hpp:22
    +
    entt
    EnTT default namespace.
    Definition: dense_map.hpp:22
    +
    entt::get
    constexpr get_t< Type... > get
    Variable template for lists of observed components.
    Definition: utility.hpp:34
    +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/signal_2fwd_8hpp_source.html b/signal_2fwd_8hpp_source.html index f9c4ac208..ee6cb8b24 100644 --- a/signal_2fwd_8hpp_source.html +++ b/signal_2fwd_8hpp_source.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    + + + + + +
    +
    EnTT +  3.10.0 +
    +
    + + + + + + + + + +
    +
    + + +
    + +
    + + + +
    +
    +
    entt::allocation_deleter< Allocator > Member List
    +
    +
    + +

    This is the complete list of members for entt::allocation_deleter< Allocator >, including all inherited members.

    + + + + + +
    allocation_deleter(const allocator_type &alloc)entt::allocation_deleter< Allocator >inline
    allocator_type typedefentt::allocation_deleter< Allocator >
    operator()(pointer ptr)entt::allocation_deleter< Allocator >inline
    pointer typedefentt::allocation_deleter< Allocator >
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/structentt_1_1allocation__deleter.html b/structentt_1_1allocation__deleter.html new file mode 100644 index 000000000..6127b3e79 --- /dev/null +++ b/structentt_1_1allocation__deleter.html @@ -0,0 +1,221 @@ + + + + + + + +EnTT: entt::allocation_deleter< Allocator > Struct Template Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Public Types | +Public Member Functions | +List of all members
    +
    +
    entt::allocation_deleter< Allocator > Struct Template Reference
    +
    +
    + +

    Deleter for allocator-aware unique pointers (waiting for C++20). + More...

    + +

    #include <memory.hpp>

    +
    +Inheritance diagram for entt::allocation_deleter< Allocator >:
    +
    +
    Inheritance graph
    + + + + +
    [legend]
    +
    +Collaboration diagram for entt::allocation_deleter< Allocator >:
    +
    +
    Collaboration graph
    + + + + +
    [legend]
    + + + + + + + + +

    +Public Types

    +using allocator_type = Allocator
     Allocator type.
     
    +using pointer = typename std::allocator_traits< Allocator >::pointer
     Pointer type.
     
    + + + + + + + +

    +Public Member Functions

     allocation_deleter (const allocator_type &alloc)
     Inherited constructors. More...
     
    void operator() (pointer ptr)
     Destroys the pointed object and deallocates its memory. More...
     
    +

    Detailed Description

    +

    template<typename Allocator>
    +struct entt::allocation_deleter< Allocator >

    + +

    Deleter for allocator-aware unique pointers (waiting for C++20).

    +
    Template Parameters
    + + +
    ArgsTypes of arguments to use to construct the object.
    +
    +
    + +

    Definition at line 112 of file memory.hpp.

    +

    Constructor & Destructor Documentation

    + +

    ◆ allocation_deleter()

    + +
    +
    +
    +template<typename Allocator >
    + + + + + +
    + + + + + + + + +
    entt::allocation_deleter< Allocator >::allocation_deleter (const allocator_type & alloc)
    +     		+inline
    +
    + +

    Inherited constructors.

    +
    Parameters
    + + +
    allocThe allocator to use.
    +
    +
    + +

    Definition at line 122 of file memory.hpp.

    + +
    +
    +

    Member Function Documentation

    + +

    ◆ operator()()

    + +
    +
    +
    +template<typename Allocator >
    + + + + + +
    + + + + + + + + +
    void entt::allocation_deleter< Allocator >::operator() (pointer ptr)
    +     		+inline
    +
    + +

    Destroys the pointed object and deallocates its memory.

    +
    Parameters
    + + +
    ptrA valid pointer to an object of the given type.
    +
    +
    + +

    Definition at line 129 of file memory.hpp.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/structentt_1_1allocation__deleter__coll__graph.map b/structentt_1_1allocation__deleter__coll__graph.map new file mode 100644 index 000000000..95422eadd --- /dev/null +++ b/structentt_1_1allocation__deleter__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/structentt_1_1allocation__deleter__coll__graph.md5 b/structentt_1_1allocation__deleter__coll__graph.md5 new file mode 100644 index 000000000..55be115a8 --- /dev/null +++ b/structentt_1_1allocation__deleter__coll__graph.md5 @@ -0,0 +1 @@ +22d32f07db3240e7c8c950772e9547f3 \ No newline at end of file diff --git a/structentt_1_1allocation__deleter__coll__graph.png b/structentt_1_1allocation__deleter__coll__graph.png new file mode 100644 index 000000000..6b27c7968 Binary files /dev/null and b/structentt_1_1allocation__deleter__coll__graph.png differ diff --git a/structentt_1_1allocation__deleter__inherit__graph.map b/structentt_1_1allocation__deleter__inherit__graph.map new file mode 100644 index 000000000..95422eadd --- /dev/null +++ b/structentt_1_1allocation__deleter__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/structentt_1_1allocation__deleter__inherit__graph.md5 b/structentt_1_1allocation__deleter__inherit__graph.md5 new file mode 100644 index 000000000..55be115a8 --- /dev/null +++ b/structentt_1_1allocation__deleter__inherit__graph.md5 @@ -0,0 +1 @@ +22d32f07db3240e7c8c950772e9547f3 \ No newline at end of file diff --git a/structentt_1_1allocation__deleter__inherit__graph.png b/structentt_1_1allocation__deleter__inherit__graph.png new file mode 100644 index 000000000..6b27c7968 Binary files /dev/null and b/structentt_1_1allocation__deleter__inherit__graph.png differ diff --git a/structentt_1_1as__cref__t.html b/structentt_1_1as__cref__t.html index 3d346529a..9a6d3d168 100644 --- a/structentt_1_1as__cref__t.html +++ b/structentt_1_1as__cref__t.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - - -
    -
    EnTT -  3.9.0 -
    -
    - - - - - - - - - -
    -
    - - -
    - -
    - - - -
    -
    -Static Public Attributes | -List of all members
    -
    -
    entt::basic_component_traits Struct Reference
    -
    -
    - -

    Commonly used default traits for all types. - More...

    - -

    #include <component.hpp>

    -
    -Inheritance diagram for entt::basic_component_traits:
    -
    -
    Inheritance graph
    - - - - -
    [legend]
    - - - - - - - - - - - -

    -Static Public Attributes

    -static constexpr auto in_place_delete = false
     Pointer stability, default is false.
     
    -static constexpr auto ignore_if_empty = true
     Empty type optimization, default is ENTT_IGNORE_IF_EMPTY.
     
    -static constexpr auto page_size = 1024
     Page size, default is ENTT_PACKED_PAGE.
     
    -

    Detailed Description

    -

    Commonly used default traits for all types.

    - -

    Definition at line 10 of file component.hpp.

    -
    The documentation for this struct was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/structentt_1_1basic__component__traits__inherit__graph.map b/structentt_1_1basic__component__traits__inherit__graph.map deleted file mode 100644 index 6fe22c8ba..000000000 --- a/structentt_1_1basic__component__traits__inherit__graph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1basic__component__traits__inherit__graph.md5 b/structentt_1_1basic__component__traits__inherit__graph.md5 deleted file mode 100644 index c44d8c136..000000000 --- a/structentt_1_1basic__component__traits__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -e56daf3c6fbdc73207efdce070afca85 \ No newline at end of file diff --git a/structentt_1_1basic__component__traits__inherit__graph.png b/structentt_1_1basic__component__traits__inherit__graph.png deleted file mode 100644 index 35ac15504..000000000 Binary files a/structentt_1_1basic__component__traits__inherit__graph.png and /dev/null differ diff --git a/structentt_1_1basic__handle-members.html b/structentt_1_1basic__handle-members.html index 7c039395f..a9191c827 100644 --- a/structentt_1_1basic__handle-members.html +++ b/structentt_1_1basic__handle-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    @@ -199,7 +199,7 @@ struct entt::basic_handle< Entity, Type > -

    Definition at line 23 of file handle.hpp.

    +

    Definition at line 23 of file handle.hpp.

    Constructor & Destructor Documentation

    ◆ basic_handle()

    @@ -246,7 +246,7 @@ template<typename Entity , typename... Type> -

    Definition at line 43 of file handle.hpp.

    +

    Definition at line 43 of file handle.hpp.

    @@ -288,7 +288,7 @@ template<typename... Component>
    Returns
    True if the handle has all the components, false otherwise.
    -

    Definition at line 205 of file handle.hpp.

    +

    Definition at line 205 of file handle.hpp.

    @@ -329,7 +329,7 @@ template<typename... Component>
    Returns
    True if the handle has at least one of the given components, false otherwise.
    -

    Definition at line 217 of file handle.hpp.

    +

    Definition at line 217 of file handle.hpp.

    @@ -361,7 +361,7 @@ template<typename Entity , typename... Type>

    Destroys the entity associated with a handle.

    See also
    basic_registry::destroy
    -

    Definition at line 106 of file handle.hpp.

    +

    Definition at line 106 of file handle.hpp.

    @@ -400,7 +400,7 @@ template<typename Entity , typename... Type> -

    Definition at line 115 of file handle.hpp.

    +

    Definition at line 115 of file handle.hpp.

    @@ -449,7 +449,7 @@ template<typename Component , typename... Args>
    Returns
    A reference to the newly created component.
    -

    Definition at line 128 of file handle.hpp.

    +

    Definition at line 128 of file handle.hpp.

    @@ -498,7 +498,7 @@ template<typename Component , typename... Args>
    Returns
    A reference to the newly created component.
    -

    Definition at line 142 of file handle.hpp.

    +

    Definition at line 142 of file handle.hpp.

    @@ -530,7 +530,7 @@ template<typename Entity , typename... Type>

    Returns the entity associated with a handle.

    Returns
    The entity associated with the handle.
    -

    Definition at line 98 of file handle.hpp.

    +

    Definition at line 98 of file handle.hpp.

    @@ -570,7 +570,7 @@ template<typename... Component> -

    Definition at line 193 of file handle.hpp.

    +

    Definition at line 193 of file handle.hpp.

    @@ -611,7 +611,7 @@ template<typename... Component>
    Returns
    References to the components owned by the handle.
    -

    Definition at line 228 of file handle.hpp.

    +

    Definition at line 228 of file handle.hpp.

    @@ -660,7 +660,7 @@ template<typename Component , typename... Args>
    Returns
    Reference to the component owned by the handle.
    -

    Definition at line 242 of file handle.hpp.

    +

    Definition at line 242 of file handle.hpp.

    @@ -701,7 +701,7 @@ template<typename Other , typename... Args>
    Returns
    A const handle referring to the same registry and the same entity.
    -

    Definition at line 55 of file handle.hpp.

    +

    Definition at line 55 of file handle.hpp.

    @@ -733,7 +733,7 @@ template<typename Entity , typename... Type>

    Checks if a handle refers to non-null registry pointer and entity.

    Returns
    True if the handle refers to non-null registry and entity, false otherwise.
    -

    Definition at line 74 of file handle.hpp.

    +

    Definition at line 74 of file handle.hpp.

    @@ -765,7 +765,7 @@ template<typename Entity , typename... Type>

    Converts a handle to its underlying entity.

    Returns
    The contained identifier.
    -

    Definition at line 66 of file handle.hpp.

    +

    Definition at line 66 of file handle.hpp.

    @@ -797,7 +797,7 @@ template<typename Entity , typename... Type>

    Checks if a handle has components assigned.

    Returns
    True if the handle has no components assigned, false otherwise.
    -

    Definition at line 263 of file handle.hpp.

    +

    Definition at line 263 of file handle.hpp.

    @@ -846,7 +846,7 @@ template<typename Component , typename... Func>
    Returns
    A reference to the patched component.
    -

    Definition at line 156 of file handle.hpp.

    +

    Definition at line 156 of file handle.hpp.

    @@ -878,7 +878,7 @@ template<typename Entity , typename... Type>

    Returns a pointer to the underlying registry, if any.

    Returns
    A pointer to the underlying registry, if any.
    -

    Definition at line 90 of file handle.hpp.

    +

    Definition at line 90 of file handle.hpp.

    @@ -919,7 +919,7 @@ template<typename... Component>
    Returns
    The number of components actually removed.
    -

    Definition at line 182 of file handle.hpp.

    +

    Definition at line 182 of file handle.hpp.

    @@ -968,7 +968,7 @@ template<typename Component , typename... Args>
    Returns
    A reference to the component being replaced.
    -

    Definition at line 170 of file handle.hpp.

    +

    Definition at line 170 of file handle.hpp.

    @@ -1009,7 +1009,7 @@ template<typename... Component>
    Returns
    Pointers to the components owned by the handle.
    -

    Definition at line 254 of file handle.hpp.

    +

    Definition at line 254 of file handle.hpp.

    @@ -1041,7 +1041,7 @@ template<typename Entity , typename... Type>

    Checks if a handle refers to a valid entity or not.

    Returns
    True if the handle refers to a valid entity, false otherwise.
    -

    Definition at line 82 of file handle.hpp.

    +

    Definition at line 82 of file handle.hpp.

    @@ -1076,7 +1076,7 @@ template<typename Func >

    Visits a handle and returns the pools for its components.

    The signature of the function should be equivalent to the following:

    void(id_type, const basic_sparse_set<entity_type> &);
    -
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:13
    +
    entt::id_type
    std::uint32_t id_type
    Alias declaration for type identifiers.
    Definition: fwd.hpp:14

    Returned pools are those that contain the entity associated with the handle.

    Template Parameters

    Public Types

    @@ -1091,13 +1091,13 @@ template<typename Func > -

    Definition at line 283 of file handle.hpp.

    +

    Definition at line 283 of file handle.hpp.

    The documentation for this struct was generated from the following files: diff --git a/structentt_1_1basic__organizer_1_1vertex-members.html b/structentt_1_1basic__organizer_1_1vertex-members.html index 78f0c5b5c..2e2b701e3 100644 --- a/structentt_1_1basic__organizer_1_1vertex-members.html +++ b/structentt_1_1basic__organizer_1_1vertex-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__organizer_1_1vertex.html b/structentt_1_1basic__organizer_1_1vertex.html index 1a4bb124a..50a938eaf 100644 --- a/structentt_1_1basic__organizer_1_1vertex.html +++ b/structentt_1_1basic__organizer_1_1vertex.html @@ -22,7 +22,7 @@ @@ -84,10 +84,10 @@ Public Member Functions - + - + @@ -99,7 +99,7 @@ Public Member Functions - + @@ -124,7 +124,7 @@ struct entt::basic_organizer< Entity >::vertex

    Vertex type of a task graph defined as an adjacency list.

    -

    Definition at line 241 of file organizer.hpp.

    +

    Definition at line 238 of file organizer.hpp.

    Constructor & Destructor Documentation

    ◆ vertex()

    @@ -178,7 +178,7 @@ template<typename Entity > -

    Definition at line 248 of file organizer.hpp.

    +

    Definition at line 245 of file organizer.hpp.

    @@ -211,7 +211,7 @@ template<typename Entity >

    Returns the function associated with a vertex.

    Returns
    The function associated with the vertex.
    -

    Definition at line 319 of file organizer.hpp.

    +

    Definition at line 316 of file organizer.hpp.

    @@ -243,7 +243,7 @@ template<typename Entity >

    Returns the list of nodes reachable from a given vertex.

    Returns
    The list of nodes reachable from the vertex.
    -

    Definition at line 335 of file organizer.hpp.

    +

    Definition at line 332 of file organizer.hpp.

    @@ -275,7 +275,7 @@ template<typename Entity >

    Returns the payload associated with a vertex, if any.

    Returns
    The payload associated with the vertex, if any.
    -

    Definition at line 327 of file organizer.hpp.

    +

    Definition at line 324 of file organizer.hpp.

    @@ -291,7 +291,7 @@ template<typename Entity > diff --git a/structentt_1_1choice__t_3_010_01_4.html b/structentt_1_1choice__t_3_010_01_4.html index 9604cef4f..b799df0be 100644 --- a/structentt_1_1choice__t_3_010_01_4.html +++ b/structentt_1_1choice__t_3_010_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1component__traits-members.html b/structentt_1_1component__traits-members.html index 5fdffd5ce..91e3b23ec 100644 --- a/structentt_1_1component__traits-members.html +++ b/structentt_1_1component__traits-members.html @@ -22,7 +22,7 @@ @@ -73,9 +73,8 @@ $(function() {

    This is the complete list of members for entt::component_traits< Type, typename >, including all inherited members.

    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     vertex (const bool vtype, vertex_data data, std::vector< std::size_t > edges)
     Constructs a vertex of the task graph. More...
     
    size_type ro_dependency (const type_info **buffer, const std::size_t length) const
    size_type ro_dependency (const type_info **buffer, const std::size_t length) const
     Fills a buffer with the type info objects for the writable resources of a vertex. More...
     
    size_type rw_dependency (const type_info **buffer, const std::size_t length) const
    size_type rw_dependency (const type_info **buffer, const std::size_t length) const
     Fills a buffer with the type info objects for the read-only resources of a vertex. More...
     
    size_type ro_count () const
    bool top_level () const
     Checks if a vertex is also a top-level one. More...
     
    const type_info & info () const
    const type_info & info () const
     Returns a type info object associated with a vertex. More...
     
    const char * name () const
    - + @@ -307,7 +307,7 @@ template<typename Entity >

    Returns a type info object associated with a vertex.

    Returns
    A properly initialized type info object.
    -

    Definition at line 303 of file organizer.hpp.

    +

    Definition at line 300 of file organizer.hpp.

    @@ -339,7 +339,7 @@ template<typename Entity >

    Returns a user defined name associated with a vertex, if any.

    Returns
    The user defined name associated with the vertex, if any.
    -

    Definition at line 311 of file organizer.hpp.

    +

    Definition at line 308 of file organizer.hpp.

    @@ -377,7 +377,7 @@ template<typename Entity > -

    Definition at line 344 of file organizer.hpp.

    +

    Definition at line 341 of file organizer.hpp.

    @@ -409,7 +409,7 @@ template<typename Entity >

    Returns the number of read-only resources of a vertex.

    Returns
    The number of read-only resources of the vertex.
    -

    Definition at line 279 of file organizer.hpp.

    +

    Definition at line 276 of file organizer.hpp.

    @@ -427,7 +427,7 @@ template<typename Entity > - + @@ -459,7 +459,7 @@ template<typename Entity >
    Returns
    The number of type info objects written to the buffer.
    -

    Definition at line 260 of file organizer.hpp.

    +

    Definition at line 257 of file organizer.hpp.

    @@ -491,7 +491,7 @@ template<typename Entity >

    Returns the number of writable resources of a vertex.

    Returns
    The number of writable resources of the vertex.
    -

    Definition at line 287 of file organizer.hpp.

    +

    Definition at line 284 of file organizer.hpp.

    @@ -509,7 +509,7 @@ template<typename Entity > - + @@ -541,7 +541,7 @@ template<typename Entity >
    Returns
    The number of type info objects written to the buffer.
    -

    Definition at line 271 of file organizer.hpp.

    +

    Definition at line 268 of file organizer.hpp.

    @@ -573,7 +573,7 @@ template<typename Entity >

    Checks if a vertex is also a top-level one.

    Returns
    True if the vertex is a top-level one, false otherwise.
    -

    Definition at line 295 of file organizer.hpp.

    +

    Definition at line 292 of file organizer.hpp.

    diff --git a/classentt_1_1type__info-members.html b/structentt_1_1basic__runtime__view.html similarity index 63% rename from classentt_1_1type__info-members.html rename to structentt_1_1basic__runtime__view.html index eb2b9f8ee..a10a9675c 100644 --- a/classentt_1_1type__info-members.html +++ b/structentt_1_1basic__runtime__view.html @@ -5,7 +5,7 @@ -EnTT: Member List +EnTT: entt::basic_runtime_view< typename > Struct Template Reference @@ -22,7 +22,7 @@ @@ -62,22 +62,29 @@ $(function() {
    -
    entt::type_info Member List
    +
    entt::basic_runtime_view< typename > Struct Template Reference
    -

    This is the complete list of members for entt::type_info, including all inherited members.

    -
    const type_info& entt::basic_organizer< Entity >::vertex::info const type_info& entt::basic_organizer< Entity >::vertex::info ( ) const
    size_type entt::basic_organizer< Entity >::vertex::ro_dependency (const type_info ** const type_info **  buffer,
    size_type entt::basic_organizer< Entity >::vertex::rw_dependency (const type_info ** const type_info **  buffer,
    EnTT -  3.9.0 +  3.10.0
    - - - - -
    hash() constentt::type_infoinline
    index() constentt::type_infoinline
    name() constentt::type_infoinline
    type_id()entt::type_infofriend
    +

    Runtime view implementation. + More...

    +

    Detailed Description

    +

    template<typename>
    +struct entt::basic_runtime_view< typename >

    + +

    Runtime view implementation.

    +

    Primary template isn't defined on purpose. All the specializations give a compile-time error, but for a few reasonable cases.

    + +

    Definition at line 23 of file fwd.hpp.

    +
    The documentation for this struct was generated from the following file: +
    Generated by doxygen 1.9.1 diff --git a/structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4-members.html b/structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4-members.html new file mode 100644 index 000000000..d3358d244 --- /dev/null +++ b/structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4-members.html @@ -0,0 +1,94 @@ + + + + + + + +EnTT: Member List + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +
    entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > Member List
    +
    +
    + +

    This is the complete list of members for entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >, including all inherited members.

    + + + + + + + + + + + + + +
    base_type typedefentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
    basic_runtime_view()entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    begin() constentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    contains(const entity_type entt) constentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    each(Func func) constentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    end() constentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    entity_type typedefentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
    exclude(const base_type &base)entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    iterate(const base_type &base)entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    iterator typedefentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
    size_hint() constentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >inline
    size_type typedefentt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html b/structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html new file mode 100644 index 000000000..662e185a9 --- /dev/null +++ b/structentt_1_1basic__runtime__view_3_01basic__sparse__set_3_01Entity_00_01Allocator_01_4_01_4.html @@ -0,0 +1,432 @@ + + + + + + + +EnTT: entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > Struct Template Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Public Types | +Public Member Functions | +List of all members
    +
    +
    entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > > Struct Template Reference
    +
    +
    + +

    Generic runtime view. + More...

    + +

    #include <runtime_view.hpp>

    + + + + + + + + + + + + + + +

    +Public Types

    +using entity_type = Entity
     Underlying entity identifier.
     
    +using size_type = std::size_t
     Unsigned integer type.
     
    +using base_type = basic_sparse_set< Entity, Allocator >
     Common type among all storage types.
     
    +using iterator = internal::runtime_view_iterator< base_type >
     Bidirectional iterator type.
     
    + + + + + + + + + + + + + + + + + + + + + + + + + + +

    +Public Member Functions

    + basic_runtime_view ()
     Default constructor to use to create empty, invalid views.
     
    basic_runtime_view & iterate (const base_type &base)
     Appends an opaque storage object to a runtime view. More...
     
    basic_runtime_view & exclude (const base_type &base)
     Adds an opaque storage object as a filter of a runtime view. More...
     
    size_type size_hint () const
     Estimates the number of entities iterated by the view. More...
     
    iterator begin () const
     Returns an iterator to the first entity that has the given components. More...
     
    iterator end () const
     Returns an iterator that is past the last entity that has the given components. More...
     
    bool contains (const entity_type entt) const
     Checks if a view contains an entity. More...
     
    template<typename Func >
    void each (Func func) const
     Iterates entities and applies the given function object to them. More...
     
    +

    Detailed Description

    +

    template<typename Entity, typename Allocator>
    +struct entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >

    + +

    Generic runtime view.

    +

    Runtime views iterate over those entities that have at least all the given components in their bags. During initialization, a runtime view looks at the number of entities available for each component and picks up a reference to the smallest set of candidate entities in order to get a performance boost when iterate.
    + Order of elements during iterations are highly dependent on the order of the underlying data structures. See sparse_set and its specializations for more details.

    +

    Important

    +

    Iterators aren't invalidated if:

    +
      +
    • New instances of the given components are created and assigned to entities.
      • +
    • The entity currently pointed is modified (as an example, if one of the given components is removed from the entity to which the iterator points).
      • +
    • The entity currently pointed is destroyed.
      • +
    +

    In all the other cases, modifying the pools of the given components in any way invalidates all the iterators and using them results in undefined behavior.

    +
    Note
    Views share references to the underlying data structures of the registry that generated them. Therefore any change to the entities and to the components made by means of the registry are immediately reflected by the views, unless a pool was missing when the view was built (in this case, the view won't have a valid reference and won't be updated accordingly).
    +
    Warning
    Lifetime of a view must not overcome that of the registry that generated it. In any other case, attempting to use a view results in undefined behavior.
    +
    Template Parameters
    + + + +
    EntityA valid entity type (see entt_traits for more details).
    AllocatorType of allocator used to manage memory and elements.
    +
    +
    + +

    Definition at line 155 of file runtime_view.hpp.

    +

    Member Function Documentation

    + +

    ◆ begin()

    + +
    +
    +
    +template<typename Entity , typename Allocator >
    + + + + + +
    + + + + + + + +
    iterator entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::begin () const
    +     		+inline
    +
    + +

    Returns an iterator to the first entity that has the given components.

    +

    The returned iterator points to the first entity that has the given components. If the view is empty, the returned iterator will be equal to end().

    +
    Returns
    An iterator to the first entity that has the given components.
    + +

    Definition at line 213 of file runtime_view.hpp.

    + +
    +
    + +

    ◆ contains()

    + +
    +
    +
    +template<typename Entity , typename Allocator >
    + + + + + +
    + + + + + + + + +
    bool entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::contains (const entity_type entt) const
    +     		+inline
    +
    + +

    Checks if a view contains an entity.

    +
    Parameters
    + + +
    enttA valid identifier.
    +
    +
    +
    Returns
    True if the view contains the given entity, false otherwise.
    + +

    Definition at line 237 of file runtime_view.hpp.

    + +
    +
    + +

    ◆ each()

    + +
    +
    +
    +template<typename Entity , typename Allocator >
    +
    +template<typename Func >
    + + + + + +
    + + + + + + + + +
    void entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::each (Func func) const
    +     		+inline
    +
    + +

    Iterates entities and applies the given function object to them.

    +

    The function object is invoked for each entity. It is provided only with the entity itself. To get the components, users can use the registry with which the view was built.
    + The signature of the function should be equivalent to the following:

    +
    void(const entity_type);
    +
    entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::entity_type
    Entity entity_type
    Underlying entity identifier.
    Definition: runtime_view.hpp:157
    +
    Template Parameters
    + + +
    FuncType of the function object to invoke.
    +
    +
    +
    Parameters
    + + +
    funcA valid function object.
    +
    +
    + +

    Definition at line 259 of file runtime_view.hpp.

    + +
    +
    + +

    ◆ end()

    + +
    +
    +
    +template<typename Entity , typename Allocator >
    + + + + + +
    + + + + + + + +
    iterator entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::end () const
    +     		+inline
    +
    + +

    Returns an iterator that is past the last entity that has the given components.

    +

    The returned iterator points to the entity following the last entity that has the given components. Attempting to dereference the returned iterator results in undefined behavior.

    +
    Returns
    An iterator to the entity following the last entity that has the given components.
    + +

    Definition at line 228 of file runtime_view.hpp.

    + +
    +
    + +

    ◆ exclude()

    + +
    +
    +
    +template<typename Entity , typename Allocator >
    + + + + + +
    + + + + + + + + +
    basic_runtime_view& entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::exclude (const base_type & base)
    +     		+inline
    +
    + +

    Adds an opaque storage object as a filter of a runtime view.

    +
    Parameters
    + + +
    baseAn opaque reference to a storage object.
    +
    +
    +
    Returns
    This runtime view.
    + +

    Definition at line 190 of file runtime_view.hpp.

    + +
    +
    + +

    ◆ iterate()

    + +
    +
    +
    +template<typename Entity , typename Allocator >
    + + + + + +
    + + + + + + + + +
    basic_runtime_view& entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::iterate (const base_type & base)
    +     		+inline
    +
    + +

    Appends an opaque storage object to a runtime view.

    +
    Parameters
    + + +
    baseAn opaque reference to a storage object.
    +
    +
    +
    Returns
    This runtime view.
    + +

    Definition at line 175 of file runtime_view.hpp.

    + +
    +
    + +

    ◆ size_hint()

    + +
    +
    +
    +template<typename Entity , typename Allocator >
    + + + + + +
    + + + + + + + +
    size_type entt::basic_runtime_view< basic_sparse_set< Entity, Allocator > >::size_hint () const
    +     		+inline
    +
    + +

    Estimates the number of entities iterated by the view.

    +
    Returns
    Estimated number of entities iterated by the view.
    + +

    Definition at line 199 of file runtime_view.hpp.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/structentt_1_1choice__t.html b/structentt_1_1choice__t.html index 0e0cae6ef..a47cf4588 100644 --- a/structentt_1_1choice__t.html +++ b/structentt_1_1choice__t.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - + +
    ignore_if_emptyentt::basic_component_traitsstatic
    in_place_deleteentt::basic_component_traitsstatic
    page_sizeentt::basic_component_traitsstatic
    in_place_deleteentt::component_traits< Type, typename >static
    page_sizeentt::component_traits< Type, typename >static
    diff --git a/structentt_1_1component__traits.html b/structentt_1_1component__traits.html index 7d4e464d1..de7303720 100644 --- a/structentt_1_1component__traits.html +++ b/structentt_1_1component__traits.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - - - - - - - - - - + + + + + + +

    -Additional Inherited Members

    - Static Public Attributes inherited from entt::basic_component_traits
    -static constexpr auto in_place_delete = false
     Pointer stability, default is false.
     
    -static constexpr auto ignore_if_empty = true
     Empty type optimization, default is ENTT_IGNORE_IF_EMPTY.
     
    -static constexpr auto page_size = 1024
     Page size, default is ENTT_PACKED_PAGE.
     

    +Static Public Attributes

    +static constexpr bool in_place_delete = internal::in_place_delete<Type>::value
     Pointer stability, default is false.
     
    +static constexpr std::size_t page_size = internal::page_size<Type>::value
     Page size, default is ENTT_PACKED_PAGE for non-empty types.
     

    Detailed Description

    template<typename Type, typename = void>
    @@ -124,7 +102,7 @@ struct entt::component_traits< Type, typename >

    -

    Definition at line 24 of file component.hpp.

    +

    Definition at line 43 of file component.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1component__traits__coll__graph.map b/structentt_1_1component__traits__coll__graph.map deleted file mode 100644 index 261ce2ef6..000000000 --- a/structentt_1_1component__traits__coll__graph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1component__traits__coll__graph.md5 b/structentt_1_1component__traits__coll__graph.md5 deleted file mode 100644 index 276845270..000000000 --- a/structentt_1_1component__traits__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -45c4d11b0a52b355c2e3a9c20904463f \ No newline at end of file diff --git a/structentt_1_1component__traits__coll__graph.png b/structentt_1_1component__traits__coll__graph.png deleted file mode 100644 index 4bdd9f7b6..000000000 Binary files a/structentt_1_1component__traits__coll__graph.png and /dev/null differ diff --git a/structentt_1_1component__traits__inherit__graph.map b/structentt_1_1component__traits__inherit__graph.map deleted file mode 100644 index 261ce2ef6..000000000 --- a/structentt_1_1component__traits__inherit__graph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1component__traits__inherit__graph.md5 b/structentt_1_1component__traits__inherit__graph.md5 deleted file mode 100644 index 276845270..000000000 --- a/structentt_1_1component__traits__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -45c4d11b0a52b355c2e3a9c20904463f \ No newline at end of file diff --git a/structentt_1_1component__traits__inherit__graph.png b/structentt_1_1component__traits__inherit__graph.png deleted file mode 100644 index 4bdd9f7b6..000000000 Binary files a/structentt_1_1component__traits__inherit__graph.png and /dev/null differ diff --git a/structentt_1_1connect__arg__t.html b/structentt_1_1connect__arg__t.html index 604964cd1..e7571b898 100644 --- a/structentt_1_1connect__arg__t.html +++ b/structentt_1_1connect__arg__t.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    operator->()entt::input_iterator_pointer< Type >inline
    operator=(const input_iterator_pointer &)=deleteentt::input_iterator_pointer< Type >
    operator=(input_iterator_pointer &&)=defaultentt::input_iterator_pointer< Type >
    pointer typedefentt::input_iterator_pointer< Type >
    pointer typedefentt::input_iterator_pointer< Type >
    diff --git a/structentt_1_1input__iterator__pointer.html b/structentt_1_1input__iterator__pointer.html index 757d9c4ef..f2ae31f22 100644 --- a/structentt_1_1input__iterator__pointer.html +++ b/structentt_1_1input__iterator__pointer.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - - + + +

    Public Types

    -using pointer = decltype(std::addressof(std::declval< Type & >()))
     Pointer type.
     
    +using pointer = Type *
     Pointer type.
     
    @@ -106,7 +106,7 @@ Public Member Functions - +

    Public Member Functions

    input_iterator_pointer & operator= (input_iterator_pointer &&)=default
     Default move assignment operator. More...
     
    pointer operator-> ()
    pointer operator-> ()
     Access operator for accessing wrapped values. More...
     
    @@ -175,7 +175,7 @@ template<typename Type >     		- + diff --git a/structentt_1_1insertion__sort-members.html b/structentt_1_1insertion__sort-members.html index 0b800f93e..15068c7a6 100644 --- a/structentt_1_1insertion__sort-members.html +++ b/structentt_1_1insertion__sort-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1insertion__sort.html b/structentt_1_1insertion__sort.html index f79dbfea5..171dff607 100644 --- a/structentt_1_1insertion__sort.html +++ b/structentt_1_1insertion__sort.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__applicable.html b/structentt_1_1is__applicable.html index 7b821d2c2..94313a0bc 100644 --- a/structentt_1_1is__applicable.html +++ b/structentt_1_1is__applicable.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html b/structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html index 03f7a71af..007d17cec 100644 --- a/structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1is__applicable_3_01Func_00_01Tuple_3_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html b/structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html index a9ea5e426..51e91d34d 100644 --- a/structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1is__applicable_3_01Func_00_01const_01Tuple_3_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__applicable__r.html b/structentt_1_1is__applicable__r.html index 6df7772c7..f83909695 100644 --- a/structentt_1_1is__applicable__r.html +++ b/structentt_1_1is__applicable__r.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html b/structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html index 4355d599b..93a1e0e24 100644 --- a/structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1is__applicable__r_3_01Ret_00_01Func_00_01std_1_1tuple_3_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__complete.html b/structentt_1_1is__complete.html index 076167ae6..5123c3dc6 100644 --- a/structentt_1_1is__complete.html +++ b/structentt_1_1is__complete.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html b/structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html index e47c45e43..ee0cae8e9 100644 --- a/structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html +++ b/structentt_1_1is__complete_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__ebco__eligible.html b/structentt_1_1is__ebco__eligible.html index 87f3b15d7..8b1d8be12 100644 --- a/structentt_1_1is__ebco__eligible.html +++ b/structentt_1_1is__ebco__eligible.html @@ -22,7 +22,7 @@ @@ -105,7 +105,7 @@ struct entt::is_ebco_eligible< Type > -

    Definition at line 522 of file type_traits.hpp.

    +

    Definition at line 495 of file type_traits.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1is__equality__comparable.html b/structentt_1_1is__equality__comparable.html index 6930236b6..4b2b22b71 100644 --- a/structentt_1_1is__equality__comparable.html +++ b/structentt_1_1is__equality__comparable.html @@ -22,7 +22,7 @@ @@ -105,7 +105,7 @@ struct entt::is_equality_comparable< Type, typename > -

    Definition at line 557 of file type_traits.hpp.

    +

    Definition at line 530 of file type_traits.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html index 0550f1b15..569505e5f 100644 --- a/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html +++ b/structentt_1_1is__equality__comparable_3_01Type_00_01std_1_1void__t_3_01decltype_07std_1_1declva46aebf4c20f38cbd0108d1e297595736.html @@ -22,7 +22,7 @@ @@ -105,7 +105,7 @@ struct entt::is_equality_comparable< Type, std::void_t< decltype(std::decl -

    Definition at line 611 of file type_traits.hpp.

    +

    Definition at line 584 of file type_traits.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1is__iterator.html b/structentt_1_1is__iterator.html index a9c933d7e..ba498e3a3 100644 --- a/structentt_1_1is__iterator.html +++ b/structentt_1_1is__iterator.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html b/structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html index d713e2f00..ee512da6b 100644 --- a/structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html +++ b/structentt_1_1is__iterator_3_01Type_00_01std_1_1enable__if__t_3_9std_1_1is__same__v_3_01std_1_1rd42721e751eff098894616f5c9eb2c37.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1is__iterator__type.html b/structentt_1_1is__iterator__type.html deleted file mode 100644 index d1803967d..000000000 --- a/structentt_1_1is__iterator__type.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - -EnTT: entt::is_iterator_type< Type, It, typename > Struct Template Reference - - - - - - - - - -
    -
    -
    pointer entt::input_iterator_pointer< Type >::operator-> pointer entt::input_iterator_pointer< Type >::operator-> ( )
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - - -
    -
    EnTT -  3.9.0 -
    -
    - - - - - - - - - -
    -
    - - -
    - -
    - - - -
    -
    -
    entt::is_iterator_type< Type, It, typename > Struct Template Reference
    -
    -
    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise. - More...

    - -

    #include <type_traits.hpp>

    -
    -Inheritance diagram for entt::is_iterator_type< Type, It, typename >:
    -
    -
    Inheritance graph
    - - - - -
    [legend]
    -
    -Collaboration diagram for entt::is_iterator_type< Type, It, typename >:
    -
    -
    Collaboration graph
    - - - - -
    [legend]
    -

    Detailed Description

    -

    template<typename Type, typename It, typename = void>
    -struct entt::is_iterator_type< Type, It, typename >

    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise.

    -
    Template Parameters
    - - - -
    TypeThe type to test.
    ItRequired iterator type.
    -
    -
    - -

    Definition at line 496 of file type_traits.hpp.

    -
    The documentation for this struct was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.map b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.map deleted file mode 100644 index 5fa57b45a..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.md5 b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.md5 deleted file mode 100644 index a2376b805..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.md5 +++ /dev/null @@ -1 +0,0 @@ -822008e03c303de22da3b5b12dad7117 \ No newline at end of file diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.png b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.png deleted file mode 100644 index 420b0cbcd..000000000 Binary files a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_031f69181d810960d2d524985ac73e57.png and /dev/null differ diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_1c6d668122d93a8a6f6186aab47dc295.html b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_1c6d668122d93a8a6f6186aab47dc295.html deleted file mode 100644 index d029fc48e..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_1c6d668122d93a8a6f6186aab47dc295.html +++ /dev/null @@ -1,119 +0,0 @@ - - - - - - - -EnTT: entt::is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > > Struct Template Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -
    entt::is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > > Struct Template Reference
    -
    -
    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise. - More...

    - -

    #include <type_traits.hpp>

    -
    -Inheritance diagram for entt::is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > >:
    -
    -
    Inheritance graph
    - - - - -
    [legend]
    -
    -Collaboration diagram for entt::is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > >:
    -
    -
    Collaboration graph
    - - - - -
    [legend]
    -

    Detailed Description

    -

    template<typename Type, typename It>
    -struct entt::is_iterator_type< Type, It, std::enable_if_t< is_iterator_v< Type > &&std::is_same_v< Type, It > > >

    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise.

    -
    Template Parameters
    - - - -
    TypeThe type to test.
    ItRequired iterator type.
    -
    -
    - -

    Definition at line 500 of file type_traits.hpp.

    -
    The documentation for this struct was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.map b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.map deleted file mode 100644 index 5fa57b45a..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.md5 b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.md5 deleted file mode 100644 index a2376b805..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.md5 +++ /dev/null @@ -1 +0,0 @@ -822008e03c303de22da3b5b12dad7117 \ No newline at end of file diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.png b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.png deleted file mode 100644 index 420b0cbcd..000000000 Binary files a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_01is__iterator__v_7e5694cadd672ca70748d20baeea7192.png and /dev/null differ diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.map b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.map deleted file mode 100644 index cbb203ba6..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.md5 b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.md5 deleted file mode 100644 index 83eb7e06e..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.md5 +++ /dev/null @@ -1 +0,0 @@ -f7e531f0be03cac432db079e67dcba01 \ No newline at end of file diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.png b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.png deleted file mode 100644 index b2a0e62a7..000000000 Binary files a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__048f541c43b7c84f850c92e9a26a306d.png and /dev/null differ diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.map b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.map deleted file mode 100644 index cbb203ba6..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.md5 b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.md5 deleted file mode 100644 index 83eb7e06e..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.md5 +++ /dev/null @@ -1 +0,0 @@ -f7e531f0be03cac432db079e67dcba01 \ No newline at end of file diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.png b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.png deleted file mode 100644 index b2a0e62a7..000000000 Binary files a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__bee9daa326b73037a1a2303bda5e8f9e.png and /dev/null differ diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__d827a14c04f195b53a7b353d4f3d2a15.html b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__d827a14c04f195b53a7b353d4f3d2a15.html deleted file mode 100644 index c23f1383a..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1enable__if__t_3_9std_1_1is__same__d827a14c04f195b53a7b353d4f3d2a15.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - -EnTT: entt::is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > > Struct Template Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -
    entt::is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > > Struct Template Reference
    -
    -
    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise. - More...

    - -

    #include <type_traits.hpp>

    -
    -Inheritance diagram for entt::is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > >:
    -
    -
    Inheritance graph
    - - - - - -
    [legend]
    -
    -Collaboration diagram for entt::is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > >:
    -
    -
    Collaboration graph
    - - - - - -
    [legend]
    -

    Detailed Description

    -

    template<typename Type, typename It>
    -struct entt::is_iterator_type< Type, It, std::enable_if_t<!std::is_same_v< Type, It >, std::void_t< typename It::iterator_type > > >

    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise.

    -
    Template Parameters
    - - - -
    TypeThe type to test.
    ItRequired iterator type.
    -
    -
    - -

    Definition at line 505 of file type_traits.hpp.

    -
    The documentation for this struct was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.map b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.map deleted file mode 100644 index b263356f2..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.md5 b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.md5 deleted file mode 100644 index cf9bafc0c..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.md5 +++ /dev/null @@ -1 +0,0 @@ -864cf1dce99be4fb96127a94bf89b707 \ No newline at end of file diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.png b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.png deleted file mode 100644 index a7d0e0e09..000000000 Binary files a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1itera3347c6291662314dfd4c0a25102f32db.png and /dev/null differ diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.map b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.map deleted file mode 100644 index b263356f2..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.map +++ /dev/null @@ -1,5 +0,0 @@ - - - - - diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.md5 b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.md5 deleted file mode 100644 index cf9bafc0c..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.md5 +++ /dev/null @@ -1 +0,0 @@ -864cf1dce99be4fb96127a94bf89b707 \ No newline at end of file diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.png b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.png deleted file mode 100644 index a7d0e0e09..000000000 Binary files a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iteraf0b2f247d9bcceeaa9bc1221cb3701f9.png and /dev/null differ diff --git a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iterator__type_01_4_01_4.html b/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iterator__type_01_4_01_4.html deleted file mode 100644 index 8d99abbd9..000000000 --- a/structentt_1_1is__iterator__type_3_01Type_00_01It_00_01std_1_1void__t_3_01typename_01It_1_1iterator__type_01_4_01_4.html +++ /dev/null @@ -1,121 +0,0 @@ - - - - - - - -EnTT: entt::is_iterator_type< Type, It, std::void_t< typename It::iterator_type > > Struct Template Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -
    entt::is_iterator_type< Type, It, std::void_t< typename It::iterator_type > > Struct Template Reference
    -
    -
    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise. - More...

    - -

    #include <type_traits.hpp>

    -
    -Inheritance diagram for entt::is_iterator_type< Type, It, std::void_t< typename It::iterator_type > >:
    -
    -
    Inheritance graph
    - - - - - -
    [legend]
    -
    -Collaboration diagram for entt::is_iterator_type< Type, It, std::void_t< typename It::iterator_type > >:
    -
    -
    Collaboration graph
    - - - - - -
    [legend]
    -

    Detailed Description

    -

    template<typename Type, typename It>
    -struct entt::is_iterator_type< Type, It, std::void_t< typename It::iterator_type > >

    - -

    Provides the member constant value to true if a given type is of the required iterator type, false otherwise.

    -
    Template Parameters
    - - - -
    TypeThe type to test.
    ItRequired iterator type.
    -
    -
    - -

    Definition at line 500 of file type_traits.hpp.

    -
    The documentation for this struct was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/structentt_1_1is__iterator__type__coll__graph.map b/structentt_1_1is__iterator__type__coll__graph.map deleted file mode 100644 index e365b8ce0..000000000 --- a/structentt_1_1is__iterator__type__coll__graph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1is__iterator__type__coll__graph.md5 b/structentt_1_1is__iterator__type__coll__graph.md5 deleted file mode 100644 index 455b6c517..000000000 --- a/structentt_1_1is__iterator__type__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -443295e889e0d31e1145341a68be220c \ No newline at end of file diff --git a/structentt_1_1is__iterator__type__coll__graph.png b/structentt_1_1is__iterator__type__coll__graph.png deleted file mode 100644 index b781cc310..000000000 Binary files a/structentt_1_1is__iterator__type__coll__graph.png and /dev/null differ diff --git a/structentt_1_1is__iterator__type__inherit__graph.map b/structentt_1_1is__iterator__type__inherit__graph.map deleted file mode 100644 index e365b8ce0..000000000 --- a/structentt_1_1is__iterator__type__inherit__graph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1is__iterator__type__inherit__graph.md5 b/structentt_1_1is__iterator__type__inherit__graph.md5 deleted file mode 100644 index 455b6c517..000000000 --- a/structentt_1_1is__iterator__type__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -443295e889e0d31e1145341a68be220c \ No newline at end of file diff --git a/structentt_1_1is__iterator__type__inherit__graph.png b/structentt_1_1is__iterator__type__inherit__graph.png deleted file mode 100644 index b781cc310..000000000 Binary files a/structentt_1_1is__iterator__type__inherit__graph.png and /dev/null differ diff --git a/structentt_1_1is__meta__pointer__like.html b/structentt_1_1is__meta__pointer__like.html index f12a6eae3..7ebbf9dbe 100644 --- a/structentt_1_1is__meta__pointer__like.html +++ b/structentt_1_1is__meta__pointer__like.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - - - - - - - + + + + + + + + +
    begin() constentt::iterable_adaptor< It >inline
    cbegin() constentt::iterable_adaptor< It >inline
    cend() constentt::iterable_adaptor< It >inline
    const_iterator typedefentt::iterable_adaptor< It >
    end() constentt::iterable_adaptor< It >inline
    iterable_adaptor()=defaultentt::iterable_adaptor< It >
    iterable_adaptor(It from, It to)entt::iterable_adaptor< It >inline
    iterator typedefentt::iterable_adaptor< It >
    value_type typedefentt::iterable_adaptor< It >
    begin() constentt::iterable_adaptor< It, Sentinel >inline
    cbegin() constentt::iterable_adaptor< It, Sentinel >inline
    cend() constentt::iterable_adaptor< It, Sentinel >inline
    end() constentt::iterable_adaptor< It, Sentinel >inline
    iterable_adaptor()=defaultentt::iterable_adaptor< It, Sentinel >
    iterable_adaptor(iterator from, sentinel to)entt::iterable_adaptor< It, Sentinel >inline
    iterator typedefentt::iterable_adaptor< It, Sentinel >
    sentinel typedefentt::iterable_adaptor< It, Sentinel >
    value_type typedefentt::iterable_adaptor< It, Sentinel >
    diff --git a/structentt_1_1iterable__adaptor.html b/structentt_1_1iterable__adaptor.html index 39f0c6c66..f4a66968d 100644 --- a/structentt_1_1iterable__adaptor.html +++ b/structentt_1_1iterable__adaptor.html @@ -5,7 +5,7 @@ -EnTT: entt::iterable_adaptor< It > Struct Template Reference +EnTT: entt::iterable_adaptor< It, Sentinel > Struct Template Reference @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - - - - - - - - + + + + + + + + +

    Public Types

    -using value_type = typename std::iterator_traits< It >::value_type
     Type of the objects returned during iteration.
     
    -using iterator = It
     Iterator type.
     
    -using const_iterator = iterator
     Const iterator type.
     
    +using value_type = typename std::iterator_traits< It >::value_type
     Value type.
     
    +using iterator = It
     Iterator type.
     
    +using sentinel = Sentinel
     Sentinel type.
     
    - - - - - - - - - - - - - - - - - - + + + + + + + + + + + + + + + + + +

    Public Member Functions

    - iterable_adaptor ()=default
     Default constructor.
     
     iterable_adaptor (It from, It to)
     Creates an iterable object from a pair of iterators. More...
     
    const_iterator begin () const
     Returns an iterator to the beginning. More...
     
    const_iterator end () const
     Returns an iterator to the end. More...
     
    const_iterator cbegin () const
     Returns an iterator to the beginning. More...
     
    const_iterator cend () const
     Returns an iterator to the end. More...
     
    + iterable_adaptor ()=default
     Default constructor.
     
     iterable_adaptor (iterator from, sentinel to)
     Creates an iterable object from a pair of iterators. More...
     
    iterator begin () const
     Returns an iterator to the beginning. More...
     
    sentinel end () const
     Returns an iterator to the end. More...
     
    iterator cbegin () const
     Returns an iterator to the beginning. More...
     
    sentinel cend () const
     Returns an iterator to the end. More...
     

    Detailed Description

    -

    template<typename It>
    -struct entt::iterable_adaptor< It >

    +

    template<typename It, typename Sentinel = It>
    +struct entt::iterable_adaptor< It, Sentinel >

    Utility class to create an iterable object from a pair of iterators.

    Template Parameters
    - + +
    ItType of iterators.
    ItType of iterator.
    SentinelType of sentinel.
    -

    Definition at line 62 of file iterator.hpp.

    +

    Definition at line 63 of file iterator.hpp.

    Constructor & Destructor Documentation

    - -

    ◆ iterable_adaptor()

    + +

    ◆ iterable_adaptor()

    -template<typename It >
    +template<typename It , typename Sentinel = It>
    @@ -62,48 +62,83 @@ $(function() {
    Public Member Functions | -Friends | -List of all members
    +List of all members
    -
    entt::type_info Class Referencefinal
    +
    entt::type_info Struct Referencefinal

    Implementation specific information about a type. - More...

    + More...

    #include <type_info.hpp>

    - + - + - + @@ -176,24 +177,24 @@ template<typename It > -

    Definition at line 78 of file iterator.hpp.

    +

    Definition at line 79 of file iterator.hpp.

    Member Function Documentation

    - -

    ◆ begin()

    + +

    ◆ begin()

    -template<typename It >
    +template<typename It , typename Sentinel = It>
    entt::iterable_adaptor< It >::iterable_adaptor entt::iterable_adaptor< It, Sentinel >::iterable_adaptor (It iterator  from,
    It sentinel  to 
    diff --git a/structentt_1_1monostate.html b/structentt_1_1monostate.html index 69c5170a8..39e28737f 100644 --- a/structentt_1_1monostate.html +++ b/structentt_1_1monostate.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1null__t-members.html b/structentt_1_1null__t-members.html index 93afe5f7a..f94d62a85 100644 --- a/structentt_1_1null__t-members.html +++ b/structentt_1_1null__t-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1null__t.html b/structentt_1_1null__t.html index 43e6c7efe..657913432 100644 --- a/structentt_1_1null__t.html +++ b/structentt_1_1null__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1overloaded.html b/structentt_1_1overloaded.html index 9e2b88407..8ae775816 100644 --- a/structentt_1_1overloaded.html +++ b/structentt_1_1overloaded.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1owned__t-members.html b/structentt_1_1owned__t-members.html index f4b1cc53d..098ededef 100644 --- a/structentt_1_1owned__t-members.html +++ b/structentt_1_1owned__t-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1owned__t.html b/structentt_1_1owned__t.html index a932c1db5..7104f2730 100644 --- a/structentt_1_1owned__t.html +++ b/structentt_1_1owned__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1poly__base-members.html b/structentt_1_1poly__base-members.html index 39d627e42..fa76e9033 100644 --- a/structentt_1_1poly__base-members.html +++ b/structentt_1_1poly__base-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1poly__base.html b/structentt_1_1poly__base.html index 2e58fba96..af3a1d946 100644 --- a/structentt_1_1poly__base.html +++ b/structentt_1_1poly__base.html @@ -22,7 +22,7 @@ @@ -81,11 +81,11 @@ $(function() {
    - + @@ -209,23 +210,23 @@ template<typename It >

    Returns an iterator to the beginning.

    Returns
    An iterator to the first element of the range.
    -

    Definition at line 86 of file iterator.hpp.

    +

    Definition at line 87 of file iterator.hpp.

    - -

    ◆ cbegin()

    + +

    ◆ cbegin()

    -template<typename It >
    +template<typename It , typename Sentinel = It>
    const_iterator entt::iterable_adaptor< It >::begin iterator entt::iterable_adaptor< It, Sentinel >::begin ( ) const
    diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html index 9c90684ab..da348a7a1 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__handle-members.html b/structentt_1_1meta__handle-members.html index f50e97eca..db8c43a97 100644 --- a/structentt_1_1meta__handle-members.html +++ b/structentt_1_1meta__handle-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__handle.html b/structentt_1_1meta__handle.html index b62efb533..dcb7dafe2 100644 --- a/structentt_1_1meta__handle.html +++ b/structentt_1_1meta__handle.html @@ -22,7 +22,7 @@ @@ -118,7 +118,7 @@ Public Member Functions

    A handle doesn't perform copies and isn't responsible for the contained object. It doesn't prolong the lifetime of the pointed instance.
    Handles are used to generate references to actual objects when needed.

    -

    Definition at line 640 of file meta.hpp.

    +

    Definition at line 611 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_handle()

    @@ -160,7 +160,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s -

    Definition at line 668 of file meta.hpp.

    +

    Definition at line 639 of file meta.hpp.

    @@ -191,7 +191,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s

    Returns false if a handle is invalid, true otherwise.

    Returns
    False if the handle is invalid, true otherwise.
    -

    Definition at line 681 of file meta.hpp.

    +

    Definition at line 652 of file meta.hpp.

    @@ -221,7 +221,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s

    Access operator for accessing the contained opaque object.

    Returns
    A wrapper that shares a reference to an unmanaged object.
    -

    Definition at line 689 of file meta.hpp.

    +

    Definition at line 660 of file meta.hpp.

    @@ -251,7 +251,7 @@ template<typename Type , typename = std::enable_if_t<!std::is_same_v<s

    Access operator for accessing the contained opaque object.

    Returns
    A wrapper that shares a reference to an unmanaged object.
    -

    Definition at line 694 of file meta.hpp.

    +

    Definition at line 665 of file meta.hpp.

    diff --git a/structentt_1_1meta__prop-members.html b/structentt_1_1meta__prop-members.html index 1c857a921..71f0e7692 100644 --- a/structentt_1_1meta__prop-members.html +++ b/structentt_1_1meta__prop-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__prop.html b/structentt_1_1meta__prop.html index 830b476d2..9868181fc 100644 --- a/structentt_1_1meta__prop.html +++ b/structentt_1_1meta__prop.html @@ -22,7 +22,7 @@ @@ -105,7 +105,7 @@ Public Member Functions

    Detailed Description

    Opaque wrapper for properties of any type.

    -

    Definition at line 703 of file meta.hpp.

    +

    Definition at line 674 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_prop()

    @@ -139,7 +139,7 @@ Public Member Functions -

    Definition at line 711 of file meta.hpp.

    +

    Definition at line 682 of file meta.hpp.

    @@ -170,7 +170,7 @@ Public Member Functions

    Returns the stored key as a const reference.

    Returns
    A wrapper containing the key stored with the property.
    -

    Definition at line 718 of file meta.hpp.

    +

    Definition at line 689 of file meta.hpp.

    @@ -200,7 +200,7 @@ Public Member Functions

    Returns true if an object is valid, false otherwise.

    Returns
    True if the object is valid, false otherwise.
    -

    Definition at line 734 of file meta.hpp.

    +

    Definition at line 705 of file meta.hpp.

    @@ -230,7 +230,7 @@ Public Member Functions

    Returns the stored value by copy.

    Returns
    A wrapper containing the value stored with the property.
    -

    Definition at line 726 of file meta.hpp.

    +

    Definition at line 697 of file meta.hpp.

    diff --git a/structentt_1_1meta__range-members.html b/structentt_1_1meta__range-members.html index b9dca1eab..576442544 100644 --- a/structentt_1_1meta__range-members.html +++ b/structentt_1_1meta__range-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__range.html b/structentt_1_1meta__range.html index 2e5282b19..e37f65cd7 100644 --- a/structentt_1_1meta__range.html +++ b/structentt_1_1meta__range.html @@ -22,7 +22,7 @@ @@ -71,7 +71,7 @@ $(function() { Public Member Functions | List of all members
    -
    entt::meta_range< Type, Node > Struct Template Reference
    +
    entt::meta_range< Type, Node > Struct Template Referencefinal
    @@ -130,7 +130,7 @@ struct entt::meta_range< Type, Node > -

    Definition at line 73 of file range.hpp.

    +

    Definition at line 74 of file range.hpp.

    Constructor & Destructor Documentation

    ◆ meta_range()

    @@ -166,7 +166,7 @@ template<typename Type , typename Node = typename Type::node_type> -

    Definition at line 88 of file range.hpp.

    +

    Definition at line 89 of file range.hpp.

    @@ -199,7 +199,7 @@ template<typename Type , typename Node = typename Type::node_type>

    Returns an iterator to the beginning.

    Returns
    An iterator to the first meta object of the range.
    -

    Definition at line 100 of file range.hpp.

    +

    Definition at line 101 of file range.hpp.

    @@ -231,7 +231,7 @@ template<typename Type , typename Node = typename Type::node_type>

    Returns an iterator to the beginning.

    Returns
    An iterator to the first meta object of the range.
    -

    Definition at line 95 of file range.hpp.

    +

    Definition at line 96 of file range.hpp.

    @@ -263,7 +263,7 @@ template<typename Type , typename Node = typename Type::node_type>

    Returns an iterator to the end.

    Returns
    An iterator to the element following the last meta object of the range.
    -

    Definition at line 109 of file range.hpp.

    +

    Definition at line 110 of file range.hpp.

    @@ -295,7 +295,7 @@ template<typename Type , typename Node = typename Type::node_type>

    Returns an iterator to the end.

    Returns
    An iterator to the element following the last meta object of the range.
    -

    Definition at line 114 of file range.hpp.

    +

    Definition at line 115 of file range.hpp.

    diff --git a/structentt_1_1meta__sequence__container__traits.html b/structentt_1_1meta__sequence__container__traits.html index fd1e8e32f..f2c3b5e17 100644 --- a/structentt_1_1meta__sequence__container__traits.html +++ b/structentt_1_1meta__sequence__container__traits.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html b/structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html index a7de49d0c..c233ac5fa 100644 --- a/structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html +++ b/structentt_1_1meta__sequence__container__traits_3_01std_1_1array_3_01Type_00_01N_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -106,7 +106,7 @@ struct entt::meta_sequence_container_traits< std::array< Type, N > > -

    Definition at line 210 of file container.hpp.

    +

    Definition at line 182 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html index acc2e2f4c..07d3945e4 100644 --- a/structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__sequence__container__traits_3_01std_1_1vector_3_01Type_00_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -106,7 +106,7 @@ struct entt::meta_sequence_container_traits< std::vector< Type, Args... &g -

    Definition at line 201 of file container.hpp.

    +

    Definition at line 173 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__template__traits.html b/structentt_1_1meta__template__traits.html index 571ab8a82..964cefb40 100644 --- a/structentt_1_1meta__template__traits.html +++ b/structentt_1_1meta__template__traits.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4-members.html b/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4-members.html index 87073e270..c08ca61db 100644 --- a/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4-members.html +++ b/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html index 7bb713fbb..4b8365c4e 100644 --- a/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__template__traits_3_01Clazz_3_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -91,7 +91,7 @@ using 
    - + @@ -241,23 +242,23 @@ template<typename It >

    Returns an iterator to the beginning.

    Returns
    An iterator to the first element of the range.
    -

    Definition at line 100 of file iterator.hpp.

    +

    Definition at line 101 of file iterator.hpp.

    - -

    ◆ cend()

    + +

    ◆ cend()

    -template<typename It >
    +template<typename It , typename Sentinel = It>
    const_iterator entt::iterable_adaptor< It >::cbegin iterator entt::iterable_adaptor< It, Sentinel >::cbegin ( ) const
    diff --git a/structentt_1_1meta__func.html b/structentt_1_1meta__func.html index 8caa5632a..b0dc354df 100644 --- a/structentt_1_1meta__func.html +++ b/structentt_1_1meta__func.html @@ -22,7 +22,7 @@ @@ -134,7 +134,7 @@ Public Member Functions

    Detailed Description

    Opaque wrapper for member functions.

    -

    Definition at line 860 of file meta.hpp.

    +

    Definition at line 830 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_func()

    @@ -168,7 +168,7 @@ Public Member Functions -

    Definition at line 867 of file meta.hpp.

    +

    Definition at line 837 of file meta.hpp.

    @@ -206,7 +206,7 @@ Public Member Functions
    Returns
    The type of the i-th argument of a member function.
    -

    Definition at line 1464 of file meta.hpp.

    +

    Definition at line 1436 of file meta.hpp.

    @@ -236,7 +236,7 @@ Public Member Functions

    Returns the number of arguments accepted by a member function.

    Returns
    The number of arguments accepted by the member function.
    -

    Definition at line 879 of file meta.hpp.

    +

    Definition at line 849 of file meta.hpp.

    @@ -266,7 +266,7 @@ Public Member Functions

    Returns the identifier assigned to a type.

    Returns
    The identifier assigned to the type.
    -

    Definition at line 871 of file meta.hpp.

    +

    Definition at line 841 of file meta.hpp.

    @@ -323,7 +323,7 @@ template<typename... Args>
    Returns
    A wrapper containing the new instance, if any.
    -

    Definition at line 942 of file meta.hpp.

    +

    Definition at line 911 of file meta.hpp.

    @@ -369,7 +369,7 @@ template<typename... Args>

    Invokes the underlying function, if possible.

    To invoke a member function, the parameters must be such that a cast or conversion to the required types is possible. Otherwise, an empty and thus invalid wrapper is returned.
    - It must be possible to cast the instance to the parent type of the member function. Otherwise, invoking the underlying function results in an undefined behavior.

    + It must be possible to cast the instance to the parent type of the member function.

    Parameters
    - + @@ -273,23 +274,23 @@ template<typename It >

    Returns an iterator to the end.

    Returns
    An iterator to the element following the last element of the range.
    -

    Definition at line 105 of file iterator.hpp.

    +

    Definition at line 106 of file iterator.hpp.

    - -

    ◆ end()

    + +

    ◆ end()

    -template<typename It >
    +template<typename It , typename Sentinel = It>
    const_iterator entt::iterable_adaptor< It >::cend sentinel entt::iterable_adaptor< It, Sentinel >::cend ( ) const
    diff --git a/structentt_1_1meta__associative__container__traits.html b/structentt_1_1meta__associative__container__traits.html index 915c73b6e..c741ff02c 100644 --- a/structentt_1_1meta__associative__container__traits.html +++ b/structentt_1_1meta__associative__container__traits.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.map b/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.map deleted file mode 100644 index 44cce337f..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.md5 deleted file mode 100644 index 1f89f20a9..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.md5 +++ /dev/null @@ -1 +0,0 @@ -571055d62b5b8bf66630057618497451 \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.png b/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.png deleted file mode 100644 index 0f75d69ef..000000000 Binary files a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A21a1bd27380dd83afbe8ae8ce90596d2.png and /dev/null differ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.map b/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.map deleted file mode 100644 index 44cce337f..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.md5 deleted file mode 100644 index 1f89f20a9..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.md5 +++ /dev/null @@ -1 +0,0 @@ -571055d62b5b8bf66630057618497451 \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.png b/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.png deleted file mode 100644 index 0f75d69ef..000000000 Binary files a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01A9ae44e90be34d57a1f3d93a20dbed049.png and /dev/null differ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map b/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map deleted file mode 100644 index c555959f7..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 deleted file mode 100644 index f884028db..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -f7d6006b13ec3f99927c823c8ec17cbc \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png b/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png deleted file mode 100644 index 51887309f..000000000 Binary files a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png and /dev/null differ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map b/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map deleted file mode 100644 index c555959f7..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map +++ /dev/null @@ -1,4 +0,0 @@ - - - - diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 deleted file mode 100644 index f884028db..000000000 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 +++ /dev/null @@ -1 +0,0 @@ -f7d6006b13ec3f99927c823c8ec17cbc \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png b/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png deleted file mode 100644 index 51887309f..000000000 Binary files a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png and /dev/null differ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html similarity index 67% rename from structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html rename to structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html index a243f0107..a3048e089 100644 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4.html @@ -5,7 +5,7 @@ -EnTT: entt::meta_associative_container_traits< dense_hash_map< Key, Type, Args... > > Struct Template Reference +EnTT: entt::meta_associative_container_traits< dense_map< Key, Type, Args... > > Struct Template Reference @@ -22,7 +22,7 @@ @@ -62,42 +62,42 @@ $(function() {
    -
    entt::meta_associative_container_traits< dense_hash_map< Key, Type, Args... > > Struct Template Reference
    +
    entt::meta_associative_container_traits< dense_map< Key, Type, Args... > > Struct Template Reference
    -

    Meta associative container traits for dense_hash_maps of any type. - More...

    +

    Meta associative container traits for dense_maps of any type. + More...

    #include <container.hpp>

    -Inheritance diagram for entt::meta_associative_container_traits< dense_hash_map< Key, Type, Args... > >:
    +Inheritance diagram for entt::meta_associative_container_traits< dense_map< Key, Type, Args... > >:
    -
    Inheritance graph
    - - - +
    Inheritance graph
    + + +
    [legend]
    -Collaboration diagram for entt::meta_associative_container_traits< dense_hash_map< Key, Type, Args... > >:
    +Collaboration diagram for entt::meta_associative_container_traits< dense_map< Key, Type, Args... > >:
    -
    Collaboration graph
    - - - +
    Collaboration graph
    + + +
    [legend]

    Detailed Description

    template<typename Key, typename Type, typename... Args>
    -struct entt::meta_associative_container_traits< dense_hash_map< Key, Type, Args... > >

    +struct entt::meta_associative_container_traits< dense_map< Key, Type, Args... > > -

    Meta associative container traits for dense_hash_maps of any type.

    +

    Meta associative container traits for dense_maps of any type.

    Template Parameters
    - + @@ -305,7 +306,7 @@ template<typename It >

    Returns an iterator to the end.

    Returns
    An iterator to the element following the last element of the range.
    -

    Definition at line 95 of file iterator.hpp.

    +

    Definition at line 96 of file iterator.hpp.

    diff --git a/structentt_1_1service__locator-members.html b/structentt_1_1locator-members.html similarity index 52% rename from structentt_1_1service__locator-members.html rename to structentt_1_1locator-members.html index dc9971c51..004e696e5 100644 --- a/structentt_1_1service__locator-members.html +++ b/structentt_1_1locator-members.html @@ -22,7 +22,7 @@ @@ -62,26 +62,26 @@ $(function() {
    -
    entt::service_locator< Service > Member List
    +
    entt::locator< Service > Member List
    -

    This is the complete list of members for entt::service_locator< Service >, including all inherited members.

    +

    This is the complete list of members for entt::locator< Service >, including all inherited members.

    const_iterator entt::iterable_adaptor< It >::end sentinel entt::iterable_adaptor< It, Sentinel >::end ( ) const
    EnTT -  3.9.0 +  3.10.0
    - - - - - - - - - + + + + + + + + +
    empty()entt::service_locator< Service >inlinestatic
    get()entt::service_locator< Service >inlinestatic
    ref()entt::service_locator< Service >inlinestatic
    reset()entt::service_locator< Service >inlinestatic
    service_locator()=deleteentt::service_locator< Service >
    service_type typedefentt::service_locator< Service >
    set(Args &&...args)entt::service_locator< Service >inlinestatic
    set(std::shared_ptr< Service > ptr)entt::service_locator< Service >inlinestatic
    ~service_locator()=deleteentt::service_locator< Service >
    allocate_emplace(Allocator alloc, Args &&...args)entt::locator< Service >inlinestatic
    emplace(Args &&...args)entt::locator< Service >inlinestatic
    has_value()entt::locator< Service >inlinestatic
    locator()=deleteentt::locator< Service >
    reset()entt::locator< Service >inlinestatic
    type typedefentt::locator< Service >
    value()entt::locator< Service >inlinestatic
    value_or(Args &&...args)entt::locator< Service >inlinestatic
    ~locator()=deleteentt::locator< Service >
    diff --git a/structentt_1_1locator.html b/structentt_1_1locator.html new file mode 100644 index 000000000..461a35676 --- /dev/null +++ b/structentt_1_1locator.html @@ -0,0 +1,375 @@ + + + + + + + +EnTT: entt::locator< Service > Struct Template Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Public Types | +Public Member Functions | +Static Public Member Functions | +List of all members
    +
    +
    entt::locator< Service > Struct Template Referencefinal
    +
    +
    + +

    Service locator, nothing more. + More...

    + +

    #include <locator.hpp>

    + + + + + +

    +Public Types

    +using type = Service
     Service type.
     
    + + + + + + + +

    +Public Member Functions

    + locator ()=delete
     Default constructor, deleted on purpose.
     
    + ~locator ()=delete
     Default destructor, deleted on purpose.
     
    + + + + + + + + + + + + + + + + + + + + + + +

    +Static Public Member Functions

    static bool has_value ()
     Checks whether a service locator contains a value. More...
     
    static Service & value ()
     Returns a reference to a valid service, if any. More...
     
    template<typename Impl = Service, typename... Args>
    static Service & value_or (Args &&...args)
     Returns a service if available or sets it from a fallback type. More...
     
    template<typename Impl = Service, typename... Args>
    static Service & emplace (Args &&...args)
     Sets or replaces a service. More...
     
    template<typename Impl = Service, typename Allocator , typename... Args>
    static Service & allocate_emplace (Allocator alloc, Args &&...args)
     Sets or replaces a service using a given allocator. More...
     
    +static void reset ()
     Resets a service.
     
    +

    Detailed Description

    +

    template<typename Service>
    +struct entt::locator< Service >

    + +

    Service locator, nothing more.

    +

    A service locator is used to do what it promises: locate services.
    + Usually service locators are tightly bound to the services they expose and thus it's hard to define a general purpose class to do that. This tiny class tries to fill the gap and to get rid of the burden of defining a different specific locator for each application.

    +
    Note
    Users shouldn't retain references to a service. The recommended way is to retrieve the service implementation currently set each and every time the need for it arises. The risk is to incur in unexpected behaviors otherwise.
    +
    Template Parameters
    + + +
    ServiceService type.
    +
    +
    + +

    Definition at line 27 of file locator.hpp.

    +

    Member Function Documentation

    + +

    ◆ allocate_emplace()

    + +
    +
    +
    +template<typename Service >
    +
    +template<typename Impl = Service, typename Allocator , typename... Args>
    + + + + + +
    + + + + + + + + + + + + + + + + + + +
    static Service& entt::locator< Service >::allocate_emplace (Allocator< Service > alloc,
    Args &&... args 
    )
    +     		+inlinestatic
    +
    + +

    Sets or replaces a service using a given allocator.

    +
    Template Parameters
    + + + + +
    ImplService type.
    AllocatorType of allocator used to manage memory and elements.
    ArgsTypes of arguments to use to construct the service.
    +
    +
    +
    Parameters
    + + + +
    allocThe allocator to use.
    argsParameters to use to construct the service.
    +
    +
    +
    Returns
    A reference to a valid service.
    + +

    Definition at line 97 of file locator.hpp.

    + +
    +
    + +

    ◆ emplace()

    + +
    +
    +
    +template<typename Service >
    +
    +template<typename Impl = Service, typename... Args>
    + + + + + +
    + + + + + + + + +
    static Service& entt::locator< Service >::emplace (Args &&... args)
    +     		+inlinestatic
    +
    + +

    Sets or replaces a service.

    +
    Template Parameters
    + + + +
    ImplService type.
    ArgsTypes of arguments to use to construct the service.
    +
    +
    +
    Parameters
    + + +
    argsParameters to use to construct the service.
    +
    +
    +
    Returns
    A reference to a valid service.
    + +

    Definition at line 82 of file locator.hpp.

    + +
    +
    + +

    ◆ has_value()

    + +
    +
    +
    +template<typename Service >
    + + + + + +
    + + + + + + + +
    static bool entt::locator< Service >::has_value ()
    +     		+inlinestatic
    +
    + +

    Checks whether a service locator contains a value.

    +
    Returns
    True if the service locator contains a value, false otherwise.
    + +

    Definition at line 40 of file locator.hpp.

    + +
    +
    + +

    ◆ value()

    + +
    +
    +
    +template<typename Service >
    + + + + + +
    + + + + + + + +
    static Service& entt::locator< Service >::value ()
    +     		+inlinestatic
    +
    + +

    Returns a reference to a valid service, if any.

    +
    Warning
    Invoking this function can result in undefined behavior if the service hasn't been set yet.
    +
    Returns
    A reference to the service currently set, if any.
    + +

    Definition at line 53 of file locator.hpp.

    + +
    +
    + +

    ◆ value_or()

    + +
    +
    +
    +template<typename Service >
    +
    +template<typename Impl = Service, typename... Args>
    + + + + + +
    + + + + + + + + +
    static Service& entt::locator< Service >::value_or (Args &&... args)
    +     		+inlinestatic
    +
    + +

    Returns a service if available or sets it from a fallback type.

    +

    Arguments are used only if a service doesn't already exist. In all other cases, they are discarded.

    +
    Template Parameters
    + + + +
    ArgsTypes of arguments to use to construct the fallback service.
    ImplFallback service type.
    +
    +
    +
    Parameters
    + + +
    argsParameters to use to construct the fallback service.
    +
    +
    +
    Returns
    A reference to a valid service.
    + +

    Definition at line 70 of file locator.hpp.

    + +
    +
    +
    The documentation for this struct was generated from the following file: +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/structentt_1_1matcher.html b/structentt_1_1matcher.html index fe18ea95a..edfd3282b 100644 --- a/structentt_1_1matcher.html +++ b/structentt_1_1matcher.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    @@ -107,7 +107,7 @@ struct entt::meta_associative_container_traits< dense_hash_map< Key, Type, -

    Definition at line 260 of file container.hpp.

    +

    Definition at line 232 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map new file mode 100644 index 000000000..ab4091e1f --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 new file mode 100644 index 000000000..922b5aeab --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 @@ -0,0 +1 @@ +76f20af42677393d2d59c8fadb03230e \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png new file mode 100644 index 000000000..2bd355a79 Binary files /dev/null and b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png differ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map new file mode 100644 index 000000000..ab4091e1f --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 new file mode 100644 index 000000000..922b5aeab --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 @@ -0,0 +1 @@ +76f20af42677393d2d59c8fadb03230e \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png new file mode 100644 index 000000000..2bd355a79 Binary files /dev/null and b/structentt_1_1meta__associative__container__traits_3_01dense__map_3_01Key_00_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png differ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html similarity index 68% rename from structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html rename to structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html index 8e935f5fd..ec1918893 100644 --- a/structentt_1_1meta__associative__container__traits_3_01dense__hash__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4.html @@ -5,7 +5,7 @@ -EnTT: entt::meta_associative_container_traits< dense_hash_set< Type, Args... > > Struct Template Reference +EnTT: entt::meta_associative_container_traits< dense_set< Type, Args... > > Struct Template Reference @@ -22,7 +22,7 @@ @@ -62,42 +62,42 @@ $(function() {
    -
    entt::meta_associative_container_traits< dense_hash_set< Type, Args... > > Struct Template Reference
    +
    entt::meta_associative_container_traits< dense_set< Type, Args... > > Struct Template Reference
    -

    Meta associative container traits for dense_hash_sets of any type. - More...

    +

    Meta associative container traits for dense_sets of any type. + More...

    #include <container.hpp>

    -Inheritance diagram for entt::meta_associative_container_traits< dense_hash_set< Type, Args... > >:
    +Inheritance diagram for entt::meta_associative_container_traits< dense_set< Type, Args... > >:
    -
    Inheritance graph
    - - - +
    Inheritance graph
    + + +
    [legend]
    -Collaboration diagram for entt::meta_associative_container_traits< dense_hash_set< Type, Args... > >:
    +Collaboration diagram for entt::meta_associative_container_traits< dense_set< Type, Args... > >:
    -
    Collaboration graph
    - - - +
    Collaboration graph
    + + +
    [legend]

    Detailed Description

    template<typename Type, typename... Args>
    -struct entt::meta_associative_container_traits< dense_hash_set< Type, Args... > >

    +struct entt::meta_associative_container_traits< dense_set< Type, Args... > > -

    Meta associative container traits for dense_hash_sets of any type.

    +

    Meta associative container traits for dense_sets of any type.

    Template Parameters
    KeyThe key type of the elements.
    EnTT -  3.9.0 +  3.10.0
    @@ -106,7 +106,7 @@ struct entt::meta_associative_container_traits< dense_hash_set< Type, Args -

    Definition at line 269 of file container.hpp.

    +

    Definition at line 241 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map new file mode 100644 index 000000000..a7b34957d --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 new file mode 100644 index 000000000..c555b9b45 --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.md5 @@ -0,0 +1 @@ +449b9583d6fe7e906b088afc2027c23e \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png new file mode 100644 index 000000000..b63cad68e Binary files /dev/null and b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__coll__graph.png differ diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map new file mode 100644 index 000000000..a7b34957d --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.map @@ -0,0 +1,4 @@ + + + + diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 new file mode 100644 index 000000000..c555b9b45 --- /dev/null +++ b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.md5 @@ -0,0 +1 @@ +449b9583d6fe7e906b088afc2027c23e \ No newline at end of file diff --git a/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png new file mode 100644 index 000000000..b63cad68e Binary files /dev/null and b/structentt_1_1meta__associative__container__traits_3_01dense__set_3_01Type_00_01Args_8_8_8_01_4_01_4__inherit__graph.png differ diff --git a/structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html index e800e4d69..26941014d 100644 --- a/structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__associative__container__traits_3_01std_1_1map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -107,7 +107,7 @@ struct entt::meta_associative_container_traits< std::map< Key, Value, Args -

    Definition at line 220 of file container.hpp.

    +

    Definition at line 192 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html index e9743163d..110e693cb 100644 --- a/structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__associative__container__traits_3_01std_1_1set_3_01Key_00_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -106,7 +106,7 @@ struct entt::meta_associative_container_traits< std::set< Key, Args... > -

    Definition at line 240 of file container.hpp.

    +

    Definition at line 212 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html index 5a0adcd26..b9e1fc630 100644 --- a/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__map_3_01Key_00_01Value_00_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -107,7 +107,7 @@ struct entt::meta_associative_container_traits< std::unordered_map< Key, V -

    Definition at line 231 of file container.hpp.

    +

    Definition at line 203 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html b/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html index f2feb17a4..220e84c63 100644 --- a/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html +++ b/structentt_1_1meta__associative__container__traits_3_01std_1_1unordered__set_3_01Key_00_01Args_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@ @@ -106,7 +106,7 @@ struct entt::meta_associative_container_traits< std::unordered_set< Key, A -

    Definition at line 250 of file container.hpp.

    +

    Definition at line 222 of file container.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1meta__class__template__tag.html b/structentt_1_1meta__class__template__tag.html index c988d5b5e..c8d77095d 100644 --- a/structentt_1_1meta__class__template__tag.html +++ b/structentt_1_1meta__class__template__tag.html @@ -5,7 +5,7 @@ -EnTT: entt::meta_class_template_tag< typename > Struct Template Reference +EnTT: entt::meta_class_template_tag< class > Struct Template Reference @@ -22,7 +22,7 @@ @@ -67,7 +67,7 @@ $(function() {
    -
    entt::meta_class_template_tag< typename > Struct Template Reference
    +
    entt::meta_class_template_tag< class > Struct Template Reference
    @@ -76,8 +76,8 @@ $(function() {

    #include <template.hpp>

    Detailed Description

    -

    template<template< typename... > typename>
    -struct entt::meta_class_template_tag< typename >

    +

    template<template< typename... > class>
    +struct entt::meta_class_template_tag< class >

    Utility class to disambiguate class templates.

    diff --git a/structentt_1_1meta__ctx-members.html b/structentt_1_1meta__ctx-members.html index 8d816e110..d8c9db366 100644 --- a/structentt_1_1meta__ctx-members.html +++ b/structentt_1_1meta__ctx-members.html @@ -22,7 +22,7 @@
    diff --git a/structentt_1_1meta__ctx.html b/structentt_1_1meta__ctx.html index fc19e7acf..9afb49038 100644 --- a/structentt_1_1meta__ctx.html +++ b/structentt_1_1meta__ctx.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__data-members.html b/structentt_1_1meta__data-members.html index c229629c9..3d61a2b8d 100644 --- a/structentt_1_1meta__data-members.html +++ b/structentt_1_1meta__data-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__data.html b/structentt_1_1meta__data.html index f9d63b339..b7de4dbcd 100644 --- a/structentt_1_1meta__data.html +++ b/structentt_1_1meta__data.html @@ -22,7 +22,7 @@ @@ -109,7 +109,7 @@ Public Member Functions - + @@ -134,7 +134,7 @@ Public Member Functions

    Detailed Description

    Opaque wrapper for data members.

    -

    Definition at line 743 of file meta.hpp.

    +

    Definition at line 714 of file meta.hpp.

    Constructor & Destructor Documentation

    ◆ meta_data()

    @@ -168,7 +168,7 @@ Public Member Functions -

    Definition at line 750 of file meta.hpp.

    +

    Definition at line 721 of file meta.hpp.

    @@ -206,7 +206,7 @@ Public Member Functions
    Returns
    The type accepted by the i-th setter.
    -

    Definition at line 1460 of file meta.hpp.

    +

    Definition at line 1432 of file meta.hpp.

    @@ -236,7 +236,7 @@ Public Member Functions

    Returns the number of setters available.

    Returns
    The number of setters available.
    -

    Definition at line 762 of file meta.hpp.

    +

    Definition at line 733 of file meta.hpp.

    @@ -265,7 +265,7 @@ Public Member Functions

    Gets the value of a given variable.

    -

    It must be possible to cast the instance to the parent type of the data member. Otherwise, invoking the getter results in an undefined behavior.

    +

    It must be possible to cast the instance to the parent type of the data member.

    Parameters
    TypeThe value type of the elements.
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     Indicates whether a data member is static or not. More...
     
    meta_type type () const
     Returns the type of the underlying object. More...
     Returns the object type if any, type_id<void>() otherwise. More...
     
    template<typename Type >
    bool set (meta_handle instance, Type &&value) const
    @@ -274,7 +274,7 @@ Public Member Functions
    Returns
    A wrapper containing the value of the underlying variable.
    -

    Definition at line 813 of file meta.hpp.

    +

    Definition at line 783 of file meta.hpp.

    @@ -304,7 +304,7 @@ Public Member Functions

    Returns the identifier assigned to a type.

    Returns
    The identifier assigned to the type.
    -

    Definition at line 754 of file meta.hpp.

    +

    Definition at line 725 of file meta.hpp.

    @@ -334,7 +334,7 @@ Public Member Functions

    Indicates whether a data member is constant or not.

    Returns
    True if the data member is constant, false otherwise.
    -

    Definition at line 770 of file meta.hpp.

    +

    Definition at line 741 of file meta.hpp.

    @@ -364,7 +364,7 @@ Public Member Functions

    Indicates whether a data member is static or not.

    Returns
    True if the data member is static, false otherwise.
    -

    Definition at line 778 of file meta.hpp.

    +

    Definition at line 749 of file meta.hpp.

    @@ -394,7 +394,7 @@ Public Member Functions

    Returns true if an object is valid, false otherwise.

    Returns
    True if the object is valid, false otherwise.
    -

    Definition at line 851 of file meta.hpp.

    +

    Definition at line 821 of file meta.hpp.

    @@ -424,7 +424,7 @@ Public Member Functions

    Returns a range to visit registered meta properties.

    Returns
    An iterable range to visit registered meta properties.
    -

    Definition at line 828 of file meta.hpp.

    +

    Definition at line 798 of file meta.hpp.

    @@ -461,7 +461,7 @@ Public Member Functions
    Returns
    The registered meta property for the given key, if any.
    -

    Definition at line 837 of file meta.hpp.

    +

    Definition at line 807 of file meta.hpp.

    @@ -502,7 +502,7 @@ template<typename Type >

    Sets the value of a given variable.

    -

    It must be possible to cast the instance to the parent type of the data member. Otherwise, invoking the setter results in an undefined behavior.
    +

    It must be possible to cast the instance to the parent type of the data member.
    The type of the value is such that a cast or conversion to the type of the variable is possible. Otherwise, invoking the setter does nothing.

    Template Parameters
    instanceAn opaque instance of the underlying type.
    @@ -519,7 +519,7 @@ template<typename Type >
    Returns
    True in case of success, false otherwise.
    -

    Definition at line 800 of file meta.hpp.

    +

    Definition at line 770 of file meta.hpp.

    @@ -546,10 +546,10 @@ template<typename Type >
    -

    Returns the type of the underlying object.

    -
    Returns
    The type of the underlying object, if any.
    +

    Returns the object type if any, type_id<void>() otherwise.

    +
    Returns
    The object type if any, type_id<void>() otherwise.
    -

    Definition at line 1452 of file meta.hpp.

    +

    Definition at line 1424 of file meta.hpp.

    diff --git a/structentt_1_1meta__func-members.html b/structentt_1_1meta__func-members.html index c31ec63a1..d98a24cda 100644 --- a/structentt_1_1meta__func-members.html +++ b/structentt_1_1meta__func-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    @@ -380,7 +380,7 @@ template<typename... Args>
    Returns
    A wrapper containing the returned value, if any.
    -

    Definition at line 927 of file meta.hpp.

    +

    Definition at line 896 of file meta.hpp.

    @@ -410,7 +410,7 @@ template<typename... Args>

    Indicates whether a member function is constant or not.

    Returns
    True if the member function is constant, false otherwise.
    -

    Definition at line 887 of file meta.hpp.

    +

    Definition at line 857 of file meta.hpp.

    @@ -440,7 +440,7 @@ template<typename... Args>

    Indicates whether a member function is static or not.

    Returns
    True if the member function is static, false otherwise.
    -

    Definition at line 895 of file meta.hpp.

    +

    Definition at line 865 of file meta.hpp.

    @@ -470,7 +470,7 @@ template<typename... Args>

    Returns true if an object is valid, false otherwise.

    Returns
    True if the object is valid, false otherwise.
    -

    Definition at line 971 of file meta.hpp.

    +

    Definition at line 940 of file meta.hpp.

    @@ -500,7 +500,7 @@ template<typename... Args>

    Returns a range to visit registered meta properties.

    Returns
    An iterable range to visit registered meta properties.
    -

    Definition at line 948 of file meta.hpp.

    +

    Definition at line 917 of file meta.hpp.

    @@ -537,7 +537,7 @@ template<typename... Args>
    Returns
    The registered meta property for the given key, if any.
    -

    Definition at line 957 of file meta.hpp.

    +

    Definition at line 926 of file meta.hpp.

    @@ -567,7 +567,7 @@ template<typename... Args>

    Returns the return type of a member function.

    Returns
    The return type of the member function.
    -

    Definition at line 1456 of file meta.hpp.

    +

    Definition at line 1428 of file meta.hpp.

    diff --git a/structentt_1_1meta__function__descriptor.html b/structentt_1_1meta__function__descriptor.html index 21de32d83..777e5db5a 100644 --- a/structentt_1_1meta__function__descriptor.html +++ b/structentt_1_1meta__function__descriptor.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4-members.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4-members.html index 5d7366443..27bb159f9 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4-members.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html index 0c5eaeb9f..f59956170 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_01Class_1_1_5_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4-members.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4-members.html index ccfbab948..18f87e102 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4-members.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html index c35a9ee5e..b72f2b407 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_01const_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4-members.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4-members.html index 74541e4b4..93bf12fce 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4-members.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html index 6cef78fd7..504d3aef1 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07Class_1_1_5_08_07Args_8_8_8_08_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4-members.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4-members.html index bec293e09..8b2545eff 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4-members.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4-members.html @@ -22,7 +22,7 @@ @@ -73,7 +73,7 @@ $(function() {

    This is the complete list of members for entt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>, including all inherited members.

    instanceAn opaque instance of the underlying type.
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - + diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html index 233d68496..58d48d8e3 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07MaybeType_00_01Args_8_8_8_08_4.html @@ -22,7 +22,7 @@ @@ -86,19 +86,19 @@ Public Types using  - - - + + +
    args_type typedefentt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>
    args_type typedefentt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>
    is_constentt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>static
    is_staticentt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>static
    return_type typedefentt::meta_function_descriptor< Type, Ret(*)(MaybeType, Args...)>
    EnTT -  3.9.0 +  3.10.0
    return_type = Ret
     Meta function return type.
     
    -using args_type = std::conditional_t< std::is_base_of_v< std::remove_const_t< std::remove_reference_t< MaybeType > >, Type >, type_list< Args... >, type_list< MaybeType, Args... > >
     Meta function arguments.
     
    +using args_type = std::conditional_t< std::is_base_of_v< std::remove_cv_t< std::remove_reference_t< MaybeType > >, Type >, type_list< Args... >, type_list< MaybeType, Args... > >
     Meta function arguments.
     
    +static constexpr auto  +static constexpr auto 

    Static Public Attributes

    -static constexpr auto is_const = std::is_base_of_v<std::remove_const_t<std::remove_reference_t<MaybeType>>, Type> && std::is_const_v<std::remove_reference_t<MaybeType>>
    is_const = std::is_base_of_v<std::remove_cv_t<std::remove_reference_t<MaybeType>>, Type> && std::is_const_v<std::remove_reference_t<MaybeType>>
     True if the meta function is const, false otherwise.
     
    -static constexpr auto is_static = !std::is_base_of_v<std::remove_const_t<std::remove_reference_t<MaybeType>>, Type>
    is_static = !std::is_base_of_v<std::remove_cv_t<std::remove_reference_t<MaybeType>>, Type>
     True if the meta function is static, false otherwise.
     
    diff --git a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4-members.html b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4-members.html index 619bc7020..bf2fb4a37 100644 --- a/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4-members.html +++ b/structentt_1_1meta__function__descriptor_3_01Type_00_01Ret_07_5_08_07_08_4-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     

    Detailed Description

    -

    template<template< typename... > typename Clazz, typename... Args>
    +

    template<template< typename... > class Clazz, typename... Args>
    struct entt::meta_template_traits< Clazz< Args... > >

    General purpose traits class for generating meta template information.

    diff --git a/structentt_1_1monostate-members.html b/structentt_1_1monostate-members.html index 42632286e..d946af800 100644 --- a/structentt_1_1monostate-members.html +++ b/structentt_1_1monostate-members.html @@ -22,7 +22,7 @@

    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - + - + @@ -112,7 +112,7 @@ struct entt::poly_base< Poly >
    template<typename Poly >
    -template<auto Member, typename... Args>
    +template<std::size_t Member, typename... Args>

    Public Member Functions

    template<auto Member, typename... Args>
    template<std::size_t Member, typename... Args>
    decltype(auto) invoke (const poly_base &self, Args &&...args) const
     Invokes a function from the static virtual table. More...
     
    template<auto Member, typename... Args>
    template<std::size_t Member, typename... Args>
    decltype(auto) invoke (poly_base &self, Args &&...args)
     Invokes a function from the static virtual table. More...
     
    diff --git a/structentt_1_1scoped__connection.html b/structentt_1_1scoped__connection.html index e90ef691d..14b4296ff 100644 --- a/structentt_1_1scoped__connection.html +++ b/structentt_1_1scoped__connection.html @@ -22,7 +22,7 @@ @@ -121,7 +121,7 @@ void  diff --git a/structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html b/structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html index 80125a92d..95e341ec1 100644 --- a/structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html +++ b/structentt_1_1size__of_3_01Type_00_01std_1_1void__t_3_01decltype_07sizeof_07Type_08_08_4_01_4.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1std__sort-members.html b/structentt_1_1std__sort-members.html index 05d90606c..92d6da04d 100644 --- a/structentt_1_1std__sort-members.html +++ b/structentt_1_1std__sort-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1std__sort.html b/structentt_1_1std__sort.html index 65bde0c5e..53154a937 100644 --- a/structentt_1_1std__sort.html +++ b/structentt_1_1std__sort.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1storage__traits-members.html b/structentt_1_1storage__traits-members.html index 0f19ddac4..8879bf3a4 100644 --- a/structentt_1_1storage__traits-members.html +++ b/structentt_1_1storage__traits-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1storage__traits.html b/structentt_1_1storage__traits.html index f917a42c1..e060e16e2 100644 --- a/structentt_1_1storage__traits.html +++ b/structentt_1_1storage__traits.html @@ -22,7 +22,7 @@ @@ -99,7 +99,7 @@ struct entt::storage_traits< Entity, Type, typename > -

    Definition at line 1097 of file storage.hpp.

    +

    Definition at line 903 of file storage.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structentt_1_1tombstone__t-members.html b/structentt_1_1tombstone__t-members.html index 54a75b407..b86b2e85e 100644 --- a/structentt_1_1tombstone__t-members.html +++ b/structentt_1_1tombstone__t-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1tombstone__t.html b/structentt_1_1tombstone__t.html index bc117a6a9..69d6a18d8 100644 --- a/structentt_1_1tombstone__t.html +++ b/structentt_1_1tombstone__t.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__hash-members.html b/structentt_1_1type__hash-members.html index f86854a1e..21e7c11de 100644 --- a/structentt_1_1type__hash-members.html +++ b/structentt_1_1type__hash-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__hash.html b/structentt_1_1type__hash.html index fce50b19d..35c19d020 100644 --- a/structentt_1_1type__hash.html +++ b/structentt_1_1type__hash.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__identity-members.html b/structentt_1_1type__identity-members.html index 87059e3ee..74cb6ca92 100644 --- a/structentt_1_1type__identity-members.html +++ b/structentt_1_1type__identity-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__identity.html b/structentt_1_1type__identity.html index 39cb33fd5..99f964971 100644 --- a/structentt_1_1type__identity.html +++ b/structentt_1_1type__identity.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__index-members.html b/structentt_1_1type__index-members.html index a30123350..d5523ef25 100644 --- a/structentt_1_1type__index-members.html +++ b/structentt_1_1type__index-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1type__index.html b/structentt_1_1type__index.html index 373c60f9f..680396405 100644 --- a/structentt_1_1type__index.html +++ b/structentt_1_1type__index.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1basic__component__traits-members.html b/structentt_1_1type__info-members.html similarity index 69% rename from structentt_1_1basic__component__traits-members.html rename to structentt_1_1type__info-members.html index 9c6abef83..07d9c0241 100644 --- a/structentt_1_1basic__component__traits-members.html +++ b/structentt_1_1type__info-members.html @@ -22,7 +22,7 @@ @@ -62,20 +62,21 @@ $(function() {
    -
    entt::basic_component_traits Member List
    +
    entt::type_info Member List
    -

    This is the complete list of members for entt::basic_component_traits, including all inherited members.

    +

    This is the complete list of members for entt::type_info, including all inherited members.

    @@ -171,7 +171,7 @@ template<auto Member, typename... Args>
    template<typename Poly >
    -template<auto Member, typename... Args>
    +template<std::size_t Member, typename... Args> diff --git a/structentt_1_1poly__inspector.html b/structentt_1_1poly__inspector.html index 0f0108dd7..b4ba4ae26 100644 --- a/structentt_1_1poly__inspector.html +++ b/structentt_1_1poly__inspector.html @@ -22,7 +22,7 @@ @@ -85,11 +85,11 @@ Public Member Functions - + - + @@ -105,7 +105,7 @@ Public Member Functions
    -template<auto Member, typename... Args>
    +template<std::size_t Member, typename... Args>
    diff --git a/structentt_1_1poly__inspector-members.html b/structentt_1_1poly__inspector-members.html index 816e92fe1..56a4be50b 100644 --- a/structentt_1_1poly__inspector-members.html +++ b/structentt_1_1poly__inspector-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
     operator Type && () const
     Generic conversion operator (definition only). More...
     
    template<auto Member, typename... Args>
    template<std::size_t Member, typename... Args>
    poly_inspector invoke (Args &&...args) const
     Dummy invocation function (definition only). More...
     
    template<auto Member, typename... Args>
    template<std::size_t Member, typename... Args>
    poly_inspector invoke (Args &&...args)
     Dummy invocation function (definition only). More...
     
    @@ -141,7 +141,7 @@ template<auto Member, typename... Args>
    -template<auto Member, typename... Args>
    +template<std::size_t Member, typename... Args>
    poly_inspector entt::poly_inspector::invoke
    diff --git a/structentt_1_1process__adaptor-members.html b/structentt_1_1process__adaptor-members.html index 925061025..fdf00688d 100644 --- a/structentt_1_1process__adaptor-members.html +++ b/structentt_1_1process__adaptor-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1process__adaptor.html b/structentt_1_1process__adaptor.html index a5fcea7c4..4f75ed5f0 100644 --- a/structentt_1_1process__adaptor.html +++ b/structentt_1_1process__adaptor.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1radix__sort-members.html b/structentt_1_1radix__sort-members.html index ff3bc6499..a012df98f 100644 --- a/structentt_1_1radix__sort-members.html +++ b/structentt_1_1radix__sort-members.html @@ -22,7 +22,7 @@ diff --git a/structentt_1_1radix__sort.html b/structentt_1_1radix__sort.html index ccfd6a6dc..01b26866f 100644 --- a/structentt_1_1radix__sort.html +++ b/structentt_1_1radix__sort.html @@ -22,7 +22,7 @@ diff --git a/classentt_1_1resource__loader-members.html b/structentt_1_1resource__loader-members.html similarity index 74% rename from classentt_1_1resource__loader-members.html rename to structentt_1_1resource__loader-members.html index f881c96dc..3c2b46e48 100644 --- a/classentt_1_1resource__loader-members.html +++ b/structentt_1_1resource__loader-members.html @@ -22,7 +22,7 @@ @@ -62,18 +62,19 @@ $(function() {
    -
    entt::resource_loader< Loader, Resource > Member List
    +
    entt::resource_loader< Type > Member List
    -

    This is the complete list of members for entt::resource_loader< Loader, Resource >, including all inherited members.

    +

    This is the complete list of members for entt::resource_loader< Type >, including all inherited members.

    poly_inspector entt::poly_inspector::invoke
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - + +
    resource_cache classentt::resource_loader< Loader, Resource >friend
    operator()(Args &&...args) constentt::resource_loader< Type >inline
    result_type typedefentt::resource_loader< Type >
    diff --git a/structentt_1_1resource__loader.html b/structentt_1_1resource__loader.html new file mode 100644 index 000000000..911f5b72c --- /dev/null +++ b/structentt_1_1resource__loader.html @@ -0,0 +1,168 @@ + + + + + + + +EnTT: entt::resource_loader< Type > Struct Template Reference + + + + + + + + + +
    +
    + + + + + + +
    +
    EnTT +  3.10.0 +
    +
    +
    + + + + + + + + +
    +
    + + +
    + +
    + + +
    +
    +
    +Public Types | +Public Member Functions | +List of all members
    +
    +
    entt::resource_loader< Type > Struct Template Reference
    +
    +
    + +

    Transparent loader for shared resources. + More...

    + +

    #include <loader.hpp>

    + + + + + +

    +Public Types

    +using result_type = std::shared_ptr< Type >
     Result type.
     
    + + + + + +

    +Public Member Functions

    template<typename... Args>
    result_type operator() (Args &&...args) const
     Constructs a shared pointer to a resource from its arguments. More...
     
    +

    Detailed Description

    +

    template<typename Type>
    +struct entt::resource_loader< Type >

    + +

    Transparent loader for shared resources.

    +
    Template Parameters
    + + +
    TypeType of resources created by the loader.
    +
    +
    + +

    Definition at line 15 of file loader.hpp.

    +

    Member Function Documentation

    + +

    ◆ operator()()

    + +
    +
    +
    +template<typename Type >
    +
    +template<typename... Args>
    + + + + + +
    + + + + + + + + +
    result_type entt::resource_loader< Type >::operator() (Args &&... args) const
    +     		+inline
    +
    + +

    Constructs a shared pointer to a resource from its arguments.

    +
    Template Parameters
    + + +
    ArgsTypes of arguments to use to construct the resource.
    +
    +
    +
    Parameters
    + + +
    argsParameters to use to construct the resource.
    +
    +
    +
    Returns
    A shared pointer to a resource of the given type.
    + +

    Definition at line 26 of file loader.hpp.

    + +
    +
    +
    The documentation for this struct was generated from the following files: +
    + +
    +Generated by doxygen 1.9.1 +
    + + diff --git a/structentt_1_1scoped__connection-members.html b/structentt_1_1scoped__connection-members.html index 405d64ed9..10e7a7540 100644 --- a/structentt_1_1scoped__connection-members.html +++ b/structentt_1_1scoped__connection-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    Definition at line 276 of file sigh.hpp.

    +

    Definition at line 273 of file sigh.hpp.

    Constructor & Destructor Documentation

    ◆ scoped_connection() [1/2]

    @@ -155,7 +155,7 @@ void     		Definition at line 284 of file sigh.hpp.

    +

    Definition at line 281 of file sigh.hpp.

    @@ -191,7 +191,7 @@ void     		Definition at line 294 of file sigh.hpp.

    +

    Definition at line 291 of file sigh.hpp.

    @@ -222,7 +222,7 @@ void 
    Returns
    True if the connection is properly initialized, false otherwise.
    -

    Definition at line 332 of file sigh.hpp.

    +

    Definition at line 329 of file sigh.hpp.

    @@ -259,7 +259,7 @@ void 
    Returns
    This scoped connection.
    -

    Definition at line 323 of file sigh.hpp.

    +

    Definition at line 320 of file sigh.hpp.

    @@ -325,7 +325,7 @@ void 
    Returns
    This scoped connection.
    -

    Definition at line 313 of file sigh.hpp.

    +

    Definition at line 310 of file sigh.hpp.

    diff --git a/structentt_1_1service__locator.html b/structentt_1_1service__locator.html deleted file mode 100644 index 6e649dd05..000000000 --- a/structentt_1_1service__locator.html +++ /dev/null @@ -1,365 +0,0 @@ - - - - - - - -EnTT: entt::service_locator< Service > Struct Template Reference - - - - - - - - - -
    -
    - - - - - - -
    -
    EnTT -  3.9.0 -
    -
    -
    - - - - - - - - -
    -
    - - -
    - -
    - - -
    -
    -
    -Public Types | -Public Member Functions | -Static Public Member Functions | -List of all members
    -
    -
    entt::service_locator< Service > Struct Template Reference
    -
    -
    - -

    Service locator, nothing more. - More...

    - -

    #include <locator.hpp>

    - - - - - -

    -Public Types

    -using service_type = Service
     Type of service offered.
     
    - - - - - - - -

    -Public Member Functions

    - service_locator ()=delete
     Default constructor, deleted on purpose.
     
    - ~service_locator ()=delete
     Default destructor, deleted on purpose.
     
    - - - - - - - - - - - - - - - - - - - - -

    -Static Public Member Functions

    static bool empty ()
     Tests if a valid service implementation is set. More...
     
    static std::weak_ptr< Service > get ()
     Returns a weak pointer to a service implementation, if any. More...
     
    static Service & ref ()
     Returns a weak reference to a service implementation, if any. More...
     
    template<typename Impl = Service, typename... Args>
    static void set (Args &&...args)
     Sets or replaces a service. More...
     
    static void set (std::shared_ptr< Service > ptr)
     Sets or replaces a service. More...
     
    static void reset ()
     Resets a service. More...
     
    -

    Detailed Description

    -

    template<typename Service>
    -struct entt::service_locator< Service >

    - -

    Service locator, nothing more.

    -

    A service locator can be used to do what it promises: locate services.
    - Usually service locators are tightly bound to the services they expose and thus it's hard to define a general purpose class to do that. This template based implementation tries to fill the gap and to get rid of the burden of defining a different specific locator for each application.

    -
    Template Parameters
    - - -
    ServiceType of service managed by the locator.
    -
    -
    - -

    Definition at line 22 of file locator.hpp.

    -

    Member Function Documentation

    - -

    ◆ empty()

    - -
    -
    -
    -template<typename Service >
    - - - - - -
    - - - - - - - -
    static bool entt::service_locator< Service >::empty ()
    -     		-inlinestatic
    -
    - -

    Tests if a valid service implementation is set.

    -
    Returns
    True if the service is set, false otherwise.
    - -

    Definition at line 35 of file locator.hpp.

    - -
    -
    - -

    ◆ get()

    - -
    -
    -
    -template<typename Service >
    - - - - - -
    - - - - - - - -
    static std::weak_ptr<Service> entt::service_locator< Service >::get ()
    -     		-inlinestatic
    -
    - -

    Returns a weak pointer to a service implementation, if any.

    -

    Clients of a service shouldn't retain references to it. The recommended way is to retrieve the service implementation currently set each and every time the need of using it arises. Otherwise users can incur in unexpected behaviors.

    -
    Returns
    A reference to the service implementation currently set, if any.
    - -

    Definition at line 49 of file locator.hpp.

    - -
    -
    - -

    ◆ ref()

    - -
    -
    -
    -template<typename Service >
    - - - - - -
    - - - - - - - -
    static Service& entt::service_locator< Service >::ref ()
    -     		-inlinestatic
    -
    - -

    Returns a weak reference to a service implementation, if any.

    -

    Clients of a service shouldn't retain references to it. The recommended way is to retrieve the service implementation currently set each and every time the need of using it arises. Otherwise users can incur in unexpected behaviors.

    -
    Warning
    In case no service implementation has been set, a call to this function results in undefined behavior.
    -
    Returns
    A reference to the service implementation currently set, if any.
    - -

    Definition at line 67 of file locator.hpp.

    - -
    -
    - -

    ◆ reset()

    - -
    -
    -
    -template<typename Service >
    - - - - - -
    - - - - - - - -
    static void entt::service_locator< Service >::reset ()
    -     		-inlinestatic
    -
    - -

    Resets a service.

    -

    The service is no longer valid after a reset.

    - -

    Definition at line 96 of file locator.hpp.

    - -
    -
    - -

    ◆ set() [1/2]

    - -
    -
    -
    -template<typename Service >
    -
    -template<typename Impl = Service, typename... Args>
    - - - - - -
    - - - - - - - - -
    static void entt::service_locator< Service >::set (Args &&... args)
    -     		-inlinestatic
    -
    - -

    Sets or replaces a service.

    -
    Template Parameters
    - - - -
    ImplType of the new service to use.
    ArgsTypes of arguments to use to construct the service.
    -
    -
    -
    Parameters
    - - -
    argsParameters to use to construct the service.
    -
    -
    - -

    Definition at line 78 of file locator.hpp.

    - -
    -
    - -

    ◆ set() [2/2]

    - -
    -
    -
    -template<typename Service >
    - - - - - -
    - - - - - - - - -
    static void entt::service_locator< Service >::set (std::shared_ptr< Service > ptr)
    -     		-inlinestatic
    -
    - -

    Sets or replaces a service.

    -
    Parameters
    - - -
    ptrService to use to replace the current one.
    -
    -
    - -

    Definition at line 86 of file locator.hpp.

    - -
    -
    -
    The documentation for this struct was generated from the following file: -
    - -
    -Generated by doxygen 1.9.1 -
    - - diff --git a/structentt_1_1size__of.html b/structentt_1_1size__of.html index f66c9ada1..e55224c9c 100644 --- a/structentt_1_1size__of.html +++ b/structentt_1_1size__of.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - - - + + + +
    ignore_if_emptyentt::basic_component_traitsstatic
    in_place_deleteentt::basic_component_traitsstatic
    page_sizeentt::basic_component_traitsstatic
    hash() constentt::type_infoinline
    index() constentt::type_infoinline
    name() constentt::type_infoinline
    type_info(std::in_place_type_t< Type >)entt::type_infoinline
    diff --git a/classentt_1_1type__info.html b/structentt_1_1type__info.html similarity index 74% rename from classentt_1_1type__info.html rename to structentt_1_1type__info.html index 3026c32df..4ed46765d 100644 --- a/classentt_1_1type__info.html +++ b/structentt_1_1type__info.html @@ -5,7 +5,7 @@ -EnTT: entt::type_info Class Reference +EnTT: entt::type_info Struct Reference @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - + + + + + + - - + + - - + + -

    Public Member Functions

    constexpr id_type index () const
     Type index. More...
    template<typename Type >
    constexpr type_info (std::in_place_type_t< Type >)
     Constructs a type info object for a given type. More...
     
    constexpr id_type index () const
     Type index. More...
     
    constexpr id_type hash () const
     Type hash. More...
    constexpr id_type hash () const
     Type hash. More...
     
    constexpr std::string_view name () const
     Type name. More...
    constexpr std::string_view name () const
     Type name. More...
     
    - - - - -

    -Friends

    template<typename Type >
    const type_info & type_id ()
     Returns the type info object associated to a given type. More...
     

    Detailed Description

    Implementation specific information about a type.

    Definition at line 141 of file type_info.hpp.

    -

    Member Function Documentation

    +

    Constructor & Destructor Documentation

    + +

    ◆ type_info()

    + +
    +
    +
    +template<typename Type >
    + + + + + +
    + + + + + + + + +
    constexpr entt::type_info::type_info (std::in_place_type_t< Type > )
    +     		+inlineconstexpr
    +
    + +

    Constructs a type info object for a given type.

    +
    Template Parameters
    + + +
    TypeType for which to construct a type info object.
    +
    +
    + +

    Definition at line 147 of file type_info.hpp.

    + +
    +
    +

    Member Function Documentation

    ◆ hash()

    @@ -194,47 +229,7 @@ Friends
    - - - - -
    - - - - - - - -
    const type_info& type_id ()
    -     		-friend
    -
    - -

    Returns the type info object associated to a given type.

    -

    The type doesn't need to be a complete type. If the type is a reference, the result refers to the referenced type. In all cases, top-level cv-qualifiers are ignored.

    -
    Template Parameters
    - - -
    TypeType for which to generate a type info object.
    -
    -
    -
    Returns
    A properly initialized type info object.
    - -

    Definition at line 256 of file type_info.hpp.

    - -
    - -
    The documentation for this class was generated from the following file:
      +
      The documentation for this struct was generated from the following file: diff --git a/structentt_1_1type__list-members.html b/structentt_1_1type__list-members.html index aed435fa6..3a89f06b4 100644 --- a/structentt_1_1type__list-members.html +++ b/structentt_1_1type__list-members.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    - +
    type typedefentt::type_list_unique< type_list< Type, Other... > >
    type typedefentt::type_list_unique< type_list< Type, Other... > >
    diff --git a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html index 9e6561917..414a3f732 100644 --- a/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html +++ b/structentt_1_1type__list__unique_3_01type__list_3_01Type_00_01Other_8_8_8_01_4_01_4.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    - - - + + +

    Public Types

    -using type = std::conditional_t< std::disjunction_v< std::is_same< Type, Other >... >, typename type_list_unique< type_list< Other... > >::type, type_list_cat_t< type_list< Type >, typename type_list_unique< type_list< Other... > >::type > >
     A type list without duplicate types.
     
    +using type = std::conditional_t<(std::is_same_v< Type, Other >||...), typename type_list_unique< type_list< Other... > >::type, type_list_cat_t< type_list< Type >, typename type_list_unique< type_list< Other... > >::type > >
     A type list without duplicate types.
     

    Detailed Description

    template<typename Type, typename... Other>
    diff --git a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html index 6ea1848b7..caa97b8a1 100644 --- a/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html +++ b/structentt_1_1type__list__unique_3_01type__list_3_4_01_4-members.html @@ -22,7 +22,7 @@

    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    + + + +
    IndexThe index of the type to return.
    FirstThe type of the first element that the pair stores.
    SecondThe type of the second element that the pair stores.
    + + -

    Definition at line 262 of file compressed_pair.hpp.

    +

    Definition at line 273 of file compressed_pair.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map index 5b5bf156c..470ab9454 100644 --- a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map +++ b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map @@ -1,4 +1,4 @@ - + diff --git a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 index 9af338dc7..a49a30ab1 100644 --- a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 +++ b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 @@ -1 +1 @@ -14b3f1721a58ad7faf728080cf7bce73 \ No newline at end of file +20d142d0e61fb98cdf36214b59586308 \ No newline at end of file diff --git a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map index 5b5bf156c..470ab9454 100644 --- a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map +++ b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map @@ -1,4 +1,4 @@ - + diff --git a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 index 9af338dc7..a49a30ab1 100644 --- a/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 +++ b/structstd_1_1tuple__element_3_01Index_00_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 @@ -1 +1 @@ -14b3f1721a58ad7faf728080cf7bce73 \ No newline at end of file +20d142d0e61fb98cdf36214b59586308 \ No newline at end of file diff --git a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html index d4ab03d50..4b760e813 100644 --- a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html +++ b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    + + +
    FirstThe type of the first element that the pair stores.
    SecondThe type of the second element that the pair stores.
    + + -

    Definition at line 259 of file compressed_pair.hpp.

    +

    Definition at line 264 of file compressed_pair.hpp.

    The documentation for this struct was generated from the following file: diff --git a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map index 941188973..46ab638e2 100644 --- a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map +++ b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.map @@ -1,4 +1,4 @@ - + diff --git a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 index b74af9eac..641799e2f 100644 --- a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 +++ b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__coll__graph.md5 @@ -1 +1 @@ -057482c7c323afa44a05ce40104506c3 \ No newline at end of file +33c5b31d3d1b7adae648fef6e943f1ff \ No newline at end of file diff --git a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map index 941188973..46ab638e2 100644 --- a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map +++ b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.map @@ -1,4 +1,4 @@ - + diff --git a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 index b74af9eac..641799e2f 100644 --- a/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 +++ b/structstd_1_1tuple__size_3_01entt_1_1compressed__pair_3_01First_00_01Second_01_4_01_4__inherit__graph.md5 @@ -1 +1 @@ -057482c7c323afa44a05ce40104506c3 \ No newline at end of file +33c5b31d3d1b7adae648fef6e943f1ff \ No newline at end of file diff --git a/template_8hpp_source.html b/template_8hpp_source.html index 19b58becd..10226c217 100644 --- a/template_8hpp_source.html +++ b/template_8hpp_source.html @@ -22,7 +22,7 @@
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0
    EnTT -  3.9.0 +  3.10.0