Components.hpp 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141
  1. #ifndef CORE_COMPONENTS_HPP
  2. #define CORE_COMPONENTS_HPP
  3. #include "core/data/HashMap.hpp"
  4. #include "core/utils/Error.hpp"
  5. namespace Core {
  6. using Entity = int;
  7. template<typename T>
  8. class Components final {
  9. HashMap<Entity, size_t> entityToIndex{};
  10. List<Entity> indexToEntity{};
  11. List<T> components{};
  12. public:
  13. template<typename R>
  14. struct Node final {
  15. const Entity& entity;
  16. R& component;
  17. };
  18. template<typename C, typename R>
  19. class EntityIterator final {
  20. C& components;
  21. size_t index;
  22. public:
  23. EntityIterator(C& components_, size_t index_)
  24. : components(components_), index(index_) {
  25. }
  26. EntityIterator& operator++() {
  27. index++;
  28. return *this;
  29. }
  30. bool operator!=(const EntityIterator& other) const {
  31. return index != other.index;
  32. }
  33. Node<R> operator*() const {
  34. return {components.indexToEntity[index],
  35. components.components[index]};
  36. }
  37. };
  38. template<typename C, typename R>
  39. struct EntityIteratorAdapter final {
  40. C& components;
  41. EntityIterator<C, R> begin() {
  42. return EntityIterator<C, R>(components, 0);
  43. }
  44. EntityIterator<C, R> end() {
  45. return EntityIterator<C, R>(components,
  46. components.components.getLength());
  47. }
  48. };
  49. template<typename... Args>
  50. bool put(T*& t, Entity ent, Args&&... args) {
  51. size_t index = components.getLength();
  52. size_t* indexP = nullptr;
  53. if(!entityToIndex.tryEmplace(indexP, ent, index)) {
  54. return false;
  55. }
  56. indexToEntity.add(ent);
  57. t = &components.put(Core::forward<Args>(args)...);
  58. return true;
  59. }
  60. template<typename... Args>
  61. bool add(Entity e, Args&&... args) {
  62. T* t = nullptr;
  63. return put(t, e, Core::forward<Args>(args)...);
  64. }
  65. bool remove(Entity ent) {
  66. size_t* indexP = entityToIndex.search(ent);
  67. if(indexP == nullptr) {
  68. return false;
  69. }
  70. size_t lastIndex = components.getLength() - 1;
  71. size_t index = *indexP;
  72. entityToIndex.remove(ent);
  73. components.removeBySwap(index);
  74. if(index == lastIndex) {
  75. indexToEntity.removeBySwap(index);
  76. return true;
  77. }
  78. Entity other = indexToEntity[lastIndex];
  79. indexToEntity.removeBySwap(index);
  80. entityToIndex.add(other, index);
  81. return true;
  82. }
  83. T* search(Entity e) {
  84. size_t* index = entityToIndex.search(e);
  85. if(index == nullptr) {
  86. return nullptr;
  87. }
  88. return &(components[*index]);
  89. }
  90. const T* search(Entity e) const {
  91. const size_t* index = entityToIndex.search(e);
  92. if(index == nullptr) {
  93. return nullptr;
  94. }
  95. return &(components[*index]);
  96. }
  97. auto begin() {
  98. return components.begin();
  99. }
  100. auto begin() const {
  101. return components.begin();
  102. }
  103. auto end() {
  104. return components.end();
  105. }
  106. auto end() const {
  107. return components.end();
  108. }
  109. EntityIteratorAdapter<Components, T> entities() {
  110. return {*this};
  111. }
  112. EntityIteratorAdapter<const Components, const T> entities() const {
  113. return {*this};
  114. }
  115. };
  116. }
  117. #endif