#pragma once #include #include "ComponentManager.h" namespace crepe { template T & ComponentManager::add_component(uint32_t id, Args &&... args) { using namespace std; static_assert(is_base_of::value, "add_component must recieve a derivative class of Component"); // Determine the type of T (this is used as the key of the unordered_map<>) type_index type = typeid(T); // Check if this component type is already in the unordered_map<> if (components.find(type) == components.end()) { //If not, create a new (empty) vector<> of vector> components[type] = vector>>(); } // Resize the vector<> if the id is greater than the current size if (id >= components[type].size()) { // Initialize new slots to nullptr (resize does automatically init to nullptr) components[type].resize(id + 1); } // Create a new component of type T (arguments directly forwarded). The // constructor must be called by ComponentManager. T * instance_pointer = new T(id, forward(args)...); unique_ptr instance = unique_ptr(instance_pointer); // Check if the vector size is not greater than get_instances_max if (instance->get_instances_max() != -1 && components[type][id].size() >= instance->get_instances_max()) { // TODO: Exception throw std::runtime_error( "Exceeded maximum number of instances for this component type"); } // store its unique_ptr in the vector<> components[type][id].push_back(std::move(instance)); return *instance; } template void ComponentManager::delete_components_by_id(uint32_t id) { using namespace std; // Determine the type of T (this is used as the key of the unordered_map<>) type_index type = typeid(T); // Find the type (in the unordered_map<>) if (components.find(type) != components.end()) { // Get the correct vector<> vector>> & component_array = components[type]; // Make sure that the id (that we are looking for) is within the boundaries of the vector<> if (id < component_array.size()) { // Clear the whole vector<> of this specific type and id component_array[id].clear(); } } } template void ComponentManager::delete_components() { // Determine the type of T (this is used as the key of the unordered_map<>) std::type_index type = typeid(T); if (components.find(type) == components.end()) return; components[type].clear(); } template std::vector> ComponentManager::get_components_by_id(uint32_t id) const { using namespace std; // Determine the type of T (this is used as the key of the unordered_map<>) type_index type = typeid(T); // Create an empty vector<> vector> component_vector; if (components.find(type) == components.end()) return component_vector; // Get the correct vector<> const vector>> & component_array = components.at(type); // Make sure that the id (that we are looking for) is within the boundaries of the vector<> if (id >= component_array.size()) return component_vector; // Loop trough the whole vector<> for (const unique_ptr & component_ptr : component_array[id]) { // Cast the unique_ptr to a raw pointer T * casted_component = static_cast(component_ptr.get()); if (casted_component == nullptr) continue; // Add the dereferenced raw pointer to the vector<> component_vector.push_back(*casted_component); } return component_vector; } template std::vector> ComponentManager::get_components_by_type() const { using namespace std; // Determine the type of T (this is used as the key of the unordered_map<>) type_index type = typeid(T); // Create an empty vector<> vector> component_vector; // Find the type (in the unordered_map<>) if (components.find(type) == components.end()) return component_vector; // Get the correct vector<> const vector>> & component_array = components.at(type); // Loop through the whole vector<> for (const vector> & component : component_array) { // Loop trough the whole vector<> for (const unique_ptr & component_ptr : component) { // Cast the unique_ptr to a raw pointer T * casted_component = static_cast(component_ptr.get()); // Ensure that the cast was successful if (casted_component == nullptr) continue; // Add the dereferenced raw pointer to the vector<> component_vector.emplace_back(ref(*casted_component)); } } // Return the vector<> return component_vector; } } // namespace crepe