template void ComponentManager::AddComponent(std::uint32_t id, Args &&... args) { std::type_index type = typeid( T); //Determine the type of T (this is used as the key of the unordered_map<>) if (mComponents.find(type) == mComponents .end()) { //Check if this component type is already in the unordered_map<> mComponents[type] = std::vector>>(); //If not, create a new (empty) vector<> of vector> } if (id >= mComponents[type] .size()) { //Resize the vector<> if the id is greater than the current size mComponents[type].resize( id + 1); //Initialize new slots to nullptr (resize does automatically init to nullptr) } mComponents[type][id].push_back(std::make_unique(std::forward( args)...)); //Create a new component of type T using perfect forwarding and store its unique_ptr in the vector<> } template void ComponentManager::DeleteComponentsById(std::uint32_t id) { std::type_index type = typeid( T); //Determine the type of T (this is used as the key of the unordered_map<>) if (mComponents.find(type) != mComponents.end()) { //Find the type (in the unordered_map<>) std::vector>> & componentArray = mComponents[type]; //Get the correct vector<> if (id < componentArray .size()) { //Make sure that the id (that we are looking for) is within the boundaries of the vector<> componentArray[id] .clear(); //Clear the whole vector<> of this specific type and id } } } template void ComponentManager::DeleteComponents() { std::type_index type = typeid( T); //Determine the type of T (this is used as the key of the unordered_map<>) if (mComponents.find(type) != mComponents.end()) { //Find the type (in the unordered_map<>) mComponents[type] .clear(); //Clear the whole vector<> of this specific type } } template std::vector> ComponentManager::GetComponentsByID(std::uint32_t id) const { std::type_index type = typeid( T); //Determine the type of T (this is used as the key of the unordered_map<>) std::vector> componentVector; //Create an empty vector<> if (mComponents.find(type) != mComponents.end()) { //Find the type (in the unordered_map<>) const std::vector>> & componentArray = mComponents.at(type); //Get the correct vector<> if (id < componentArray .size()) { //Make sure that the id (that we are looking for) is within the boundaries of the vector<> for (const std::unique_ptr & componentPtr : componentArray[id]) { //Loop trough the whole vector<> T * castedComponent = static_cast( componentPtr.get()); //Cast the unique_ptr to a raw pointer if (castedComponent) { //Ensure that the cast was successful componentVector.push_back( *castedComponent); //Add the dereferenced raw pointer to the vector<> } } } } return componentVector; //Return the vector<> } template std::vector> ComponentManager::GetComponentsByType() const { std::type_index type = typeid( T); //Determine the type of T (this is used as the key of the unordered_map<>) std::vector> componentVector; //Create an empty vector<> //std::uint32_t id = 0; //Set the id to 0 (the id will also be stored in the returned vector<>) if (mComponents.find(type) != mComponents.end()) { //Find the type (in the unordered_map<>) const std::vector>> & componentArray = mComponents.at(type); //Get the correct vector<> for (const std::vector> & component : componentArray) { //Loop through the whole vector<> for (const std::unique_ptr & componentPtr : component) { //Loop trough the whole vector<> T * castedComponent = static_cast( componentPtr.get()); //Cast the unique_ptr to a raw pointer if (castedComponent) { //Ensure that the cast was successful componentVector.emplace_back(std::ref( *castedComponent)); //Pair the dereferenced raw pointer and the id and add it to the vector<> } } //++id; //Increase the id (the id will also be stored in the returned vector<>) } } return componentVector; //Return the vector<> }