128 lines
3.4 KiB
C++
128 lines
3.4 KiB
C++
#include "Core/World.h"
|
|
|
|
World::~World()
|
|
{
|
|
for (auto& pool : m_ComponentPools) {
|
|
delete pool.second;
|
|
}
|
|
}
|
|
|
|
EntityID World::CreateEntity(EntityID parent /*= 0*/)
|
|
{
|
|
EntityID newEntity = generateEntityID();
|
|
if (newEntity == parent) {
|
|
LOG_WARNING("Invalid parent #%i of Entity#%i", newEntity, parent);
|
|
parent = EntityID_Invalid;
|
|
}
|
|
m_EntityParents[newEntity] = parent;
|
|
m_EntityChildren.insert(std::make_pair(parent, newEntity));
|
|
return newEntity;
|
|
}
|
|
|
|
void World::DeleteEntity(EntityID entity)
|
|
{
|
|
// Delete components
|
|
for (auto& pair : m_ComponentPools) {
|
|
auto& pool = pair.second;
|
|
if (pool->KnowsEntity(entity)) {
|
|
auto& c = pool->GetByEntity(entity);
|
|
pool->Delete(c);
|
|
}
|
|
}
|
|
|
|
// Loop through children
|
|
std::vector<EntityID> childrenToDelete;
|
|
auto children = m_EntityChildren.equal_range(entity);
|
|
for (auto it = children.first; it != children.second; ++it) {
|
|
childrenToDelete.push_back(it->second);
|
|
}
|
|
for (auto& child : childrenToDelete) {
|
|
DeleteEntity(child);
|
|
}
|
|
|
|
EntityID parent = m_EntityParents.at(entity);
|
|
m_EntityParents.erase(entity);
|
|
auto parentChildren = m_EntityChildren.equal_range(parent);
|
|
for (auto it = parentChildren.first; it != parentChildren.second; ++it) {
|
|
if (it->second == entity) {
|
|
m_EntityChildren.erase(it);
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
void World::RegisterComponent(ComponentInfo& ci)
|
|
{
|
|
m_ComponentPools[ci.Name] = new ComponentPool(ci);
|
|
}
|
|
|
|
ComponentWrapper World::AttachComponent(EntityID entity, std::string componentType)
|
|
{
|
|
// TODO: Allocate dynamic pool if component isn't registered
|
|
ComponentPool* pool = m_ComponentPools.at(componentType);
|
|
const ComponentInfo& ci = pool->ComponentInfo();
|
|
|
|
// Allocate space for the component
|
|
ComponentWrapper c = pool->Allocate(entity);
|
|
// Write default values
|
|
memcpy(c.Data, ci.Defaults.get(), ci.Meta.Stride);
|
|
|
|
return c;
|
|
}
|
|
|
|
|
|
bool World::HasComponent(EntityID entity, std::string componentType) const
|
|
{
|
|
ComponentPool* pool = m_ComponentPools.at(componentType);
|
|
return pool->KnowsEntity(entity);
|
|
}
|
|
|
|
ComponentWrapper World::GetComponent(EntityID entity, std::string componentType)
|
|
{
|
|
ComponentPool* pool = m_ComponentPools.at(componentType);
|
|
return pool->GetByEntity(entity);
|
|
}
|
|
|
|
|
|
void World::DeleteComponent(EntityID entity, std::string componentType)
|
|
{
|
|
ComponentPool* pool = m_ComponentPools.at(componentType);
|
|
ComponentWrapper c = pool->GetByEntity(entity);
|
|
return pool->Delete(c);
|
|
}
|
|
|
|
const ComponentPool* World::GetComponents(std::string componentType)
|
|
{
|
|
auto it = m_ComponentPools.find(componentType);
|
|
return (it != m_ComponentPools.end()) ? it->second : nullptr;
|
|
}
|
|
|
|
|
|
EntityID World::GetParent(EntityID entity)
|
|
{
|
|
return m_EntityParents.at(entity);
|
|
}
|
|
|
|
|
|
void World::SetParent(EntityID entity, EntityID parent)
|
|
{
|
|
EntityID lastParent = m_EntityParents.at(entity);
|
|
auto parentChildren = m_EntityChildren.equal_range(lastParent);
|
|
for (auto it = parentChildren.first; it != parentChildren.second; it++) {
|
|
if (it->second == entity) {
|
|
m_EntityChildren.erase(it);
|
|
break;
|
|
}
|
|
}
|
|
|
|
m_EntityParents[entity] = parent;
|
|
m_EntityChildren.insert(std::make_pair(parent, entity));
|
|
}
|
|
|
|
EntityID World::generateEntityID()
|
|
{
|
|
// TODO: Make EntityID generation smarter
|
|
return m_CurrentEntityID++;
|
|
}
|
|
|