A Simple Entity Component System (ECS) [C++]

Jun 25, 2019

Ever since first hearing about Entity Component Systems and their implications in game development, I’ve wanted to build one for my own usage and knowledge. There are a few examples that people have built and posted online (1, 2), and there are a few full-fledged ones that can be used to build real games (3 , 4).

I liked different aspects of each of them that I studied, but I wanted to build my own and put my own spin on the problem, incorporating different elements from different examples. This is the result.

It is, admittedly and by design, simple. It’s intended as a jumping off point for the curious.

What is an ECS?

Traditionally in game development, you would follow an inheritance approach to problems. A Goblin inherits from a Monster which inherits from an Actor. A Shopkeeper inherits from a Human which also inherits from an Actor. The Actor class contains a function called Render() which knows how to render an Actor, so for every Goblin you can call Goblin.Render() and for every Shopkeeper you can call Shoperkeeper.Render().

There are two main problems with this approach. The first is the problem of flexibility. If you decide that you want to visit a town of friendly goblins in the game, and you have Goblin Shopkeepers, your inheritance tree gets messed up. You have all of the shopkeeping functionality in the Shopkeeper class (selling, bartering, whatever), but your Goblin Shopkeeper can’t inherit from Shopkeeper because that would make the Goblin Shopkeeper a Human. Without a doubt, inheritance has its place in software development, but in gameplay programming it can cause problems.

The second problem is a misuse of the cache. In games, you commonly iterate over a set of objects multiple times per second, running methods on them every frame. For example, your physics system might iterate over all objects that are subject to physics and call Object.Integrate(dt), updating their position, velocity, and acceleration. So traditionally you’d have your big object that contains all of its state, including those needed for physics, and you’d call the integrate function on every object that needs to be updated. In each object’s Integrate() method, you access the object’s position, velocity, and acceleration member variables. When you access position, it’s pulled into a cache line along with nearby member variables. Some of those nearby member variables will be useful (velocity and the acceleration), while others will not be. This is a huge waste of the cache and in an age where the performance bottleneck is the time it takes for data to get from main memory to the CPU’s memory, it’s a big deal.

The tides have been shifting into component-based design to solve the first problem. Looking at Unity, for example, all of the game objects are component-based. You start with a blank object that has only the default required Transform component, and you add more components to give the object functionality. But that hasn’t solved the second problem.

The second problem is solved by keeping all of the data that will be iterated upon regularly packed tightly into memory so that an entire cache line’s worth of data can be loaded at once, and when the next item is iterated upon, its data is already in the cache. This is solved by defining components as Plain Old Data (POD), essentially a simple struct with only the relevant data included. To continue the physics example, you might have Transform with position, Rigidody with velocity and acceleration, and Gravity with the gravitational constant g.

The physics system would then iterate over all “objects” that “contain” these three components, pulling in only the data it cares about into the cache.

Unity is moving in this direction with the introduction of its own ECS implementation, as well as its Jobs system and the Burst compiler. In fact, watching a talk by Mike Acton (Principal Programmer at Unity leading ECS development) is what got me interested in this stuff in the first place.

In reality, the traditional concept of the “object” is gone. Instead we have an Entity which is simply an ID. It doesn’t “contain” anything. Instead the ID is used as an index into an array of components. An array is contiguous in memory which lends itself well to being the data structure of choice. So the physics system might have a list of all entities that have a Transform, RigidBody, and Gravity component, and use the entity’s ID as an index into the Transform array, into the RigidBody array, and into the Gravity array.

So conceptually it’s all pretty simple. An Entity is an ID. A Component is a struct of data. A System is the logic that operates on the components. The meat of this post will be on how to implement those three elements in a way that is simple, easy to understand, and easy to use.

I set out to design mine with the following goals:

Relatively simple and understandable

Modern C++

Minimal amount of if conditions (to avoid branch mispredictions)

Minimal virtual inheritance (to avoid virtual function lookup and branch mispredictions)

The Entity

As promised, an Entity is very simple:

// A simple type alias using Entity = std :: uint32_t ; // Used to define the size of arrays later on const Entity MAX_ENTITIES = 5000 ;

You could of course choose for an Entity to be of any size, and same with MAX_ENTITIES.

The Component

A component is almost as simple as an entity. It’s just a struct with a small chunk of functionally related data. As an example, Transform might look like this:

struct Transform { Vec3 position ; Quat rotation ; Vec3 scale ; }

Each component type (Transform, RigidBody, etc) also has a unique ID given to it (for reasons explained later).

// A simple type alias using ComponentType = std :: uint8_t ; // Used to define the size of arrays later on const ComponentType MAX_COMPONENTS = 32 ;

Again, you could choose any size for ComponentType and MAX_COMPONENTS.

The Signature

Since an entity is simply an ID, we need a way to track which components an entity “has”, and we also need a way to track which components a system cares about.

I chose the very simple approach of using a std::bitset (modern C++ equivalent of a bitfield), called a Signature. Each component type has a unique ID (starting from 0), which is used to represent a bit in the signature.

As an example, if Transform has type 0, RigidBody has type 1, and Gravity has type 2, an entity that “has” those three components would have a signature of 0b111 (bits 0, 1, and 2 are set).

A system would also register its interest in certain components as another signature. Then it’s a simple bitwise comparison to ensure that an entity’s signature contains the system’s signature (an entity might have more components than a system requires, which is fine, as long as it has all of the components a system requires).

// A simple type alias using Signature = std :: bitset < MAX_COMPONENTS > ;

The Entity Manager

The Entity Manager is in charge of distributing entity IDs and keeping record of which IDs are in use and which are not.

I chose to use a simple std::queue, where on startup the queue is initialized to contain every valid entity ID up to MAX_ENTITIES. When an entity is created it takes an ID from the front of the queue, and when an entity is destroyed it puts the destroyed ID at the back of the queue.

class EntityManager { public : EntityManager () { // Initialize the queue with all possible entity IDs for ( Entity entity = 0 ; entity < MAX_ENTITIES ; ++ entity ) { mAvailableEntities . push ( entity ); } } Entity CreateEntity () { assert ( mLivingEntityCount < MAX_ENTITIES && "Too many entities in existence." ); // Take an ID from the front of the queue Entity id = mAvailableEntities . front (); mAvailableEntities . pop (); ++ mLivingEntityCount ; return id ; } void DestroyEntity ( Entity entity ) { assert ( entity < MAX_ENTITIES && "Entity out of range." ); // Invalidate the destroyed entity's signature mSignatures [ entity ]. reset (); // Put the destroyed ID at the back of the queue mAvailableEntities . push ( entity ); -- mLivingEntityCount ; } void SetSignature ( Entity entity , Signature signature ) { assert ( entity < MAX_ENTITIES && "Entity out of range." ); // Put this entity's signature into the array mSignatures [ entity ] = signature ; } Signature GetSignature ( Entity entity ) { assert ( entity < MAX_ENTITIES && "Entity out of range." ); // Get this entity's signature from the array return mSignatures [ entity ]; } private : // Queue of unused entity IDs std :: queue < Entity > mAvailableEntities {}; // Array of signatures where the index corresponds to the entity ID std :: array < Signature , MAX_ENTITIES > mSignatures {}; // Total living entities - used to keep limits on how many exist uint32_t mLivingEntityCount {}; };

The Component Array

We need to create a data structure that is essentially a simple array, but is always a packed array, meaning it has no holes. If an entity is just an index into an array of components, then it’s simple to grab the relevant component for an entity, but what happens when an entity is destroyed? That index into the array is no longer valid.

Remember that the entire point of the ECS is to keep the data packed in memory, meaning that you should be able to iterate over all of the indices in the array without needing any sort of “if(valid)” checks. When an entity is destroyed, the component data it “had” still exists in the arrays. If a system were to then try to iterate over the array, it would encounter stale data with no entity attached. For this reason we need to keep the array packed with valid data at all times.

I chose to solve this problem by keeping a mapping from entity IDs to array indices. When accessing the array, you use the entity ID to look up the actual array index. Then, when an entity is destroyed, you take the last valid element in the array and move it into the deleted entity’s spot and update the map so that the entity ID now points to the correct position. There is also a map from the array index to an entity ID so that, when moving the last array element, you know which entity was using that index and can update its map.

Before showing the code, let me demonstrate the process visually because try as I might to make the code understandable, it’s still clearer in picture form.

In the following diagrams, there is no relationship between the positioning of the elements in each of the rows (Array, Entity->Index, Index->Entity).



They're drawn on top of each other, but in no way are the items in a single column at all related.



The only relationship in this system is the mapping from Array Index to Entity ID.

Let’s assume that MAX_ENTITIES is set to 5. The array starts out empty, there is nothing in the maps, and the size is 0.

We then add a component with value A to Entity 0.

Entity 0 maps to Index 0, and Index 0 maps to Entity 0.

We then add a component with value B to Entity 1.

Entity 1 maps to Index 1, and Index 1 maps to Entity 1.

We then add a component with value C to Entity 2.

Entity 2 maps to Index 2, and Index 2 maps to Entity 2.

We then add a component with value D to Entity 3.

Entity 3 maps to Index 3, and Index 3 maps to Entity 3.

So far so good. Everything is packed into memory. But then we delete the value B from Entity 1. To keep it packed, we move the last element D into the spot occupied by B, and update the maps.

Entity 3 maps to Index 1, and Index 1 maps to Entity 3.

We then delete the value D from Entity 3, moving the last element C into the spot occupied by D.

Entity 2 maps to Index 1, and Index 1 maps to Entity 2.

Finally we add value E to Entity 4.

Entity 4 maps to Index 2, and Index 2 maps to Entity 4.

Voila, components removed and added while maintaining density.

// The one instance of virtual inheritance in the entire implementation. // An interface is needed so that the ComponentManager (seen later) // can tell a generic ComponentArray that an entity has been destroyed // and that it needs to update its array mappings. class IComponentArray { public : virtual ~ IComponentArray () = default ; virtual void EntityDestroyed ( Entity entity ) = 0 ; }; template < typename T > class ComponentArray : public IComponentArray { public : void InsertData ( Entity entity , T component ) { assert ( mEntityToIndexMap . find ( entity ) == mEntityToIndexMap . end () && "Component added to same entity more than once." ); // Put new entry at end and update the maps size_t newIndex = mSize ; mEntityToIndexMap [ entity ] = newIndex ; mIndexToEntityMap [ newIndex ] = entity ; mComponentArray [ newIndex ] = component ; ++ mSize ; } void RemoveData ( Entity entity ) { assert ( mEntityToIndexMap . find ( entity ) != mEntityToIndexMap . end () && "Removing non-existent component." ); // Copy element at end into deleted element's place to maintain density size_t indexOfRemovedEntity = mEntityToIndexMap [ entity ]; size_t indexOfLastElement = mSize - 1 ; mComponentArray [ indexOfRemovedEntity ] = mComponentArray [ indexOfLastElement ]; // Update map to point to moved spot Entity entityOfLastElement = mIndexToEntityMap [ indexOfLastElement ]; mEntityToIndexMap [ entityOfLastElement ] = indexOfRemovedEntity ; mIndexToEntityMap [ indexOfRemovedEntity ] = entityOfLastElement ; mEntityToIndexMap . erase ( entity ); mIndexToEntityMap . erase ( indexOfLastElement ); -- mSize ; } T & GetData ( Entity entity ) { assert ( mEntityToIndexMap . find ( entity ) != mEntityToIndexMap . end () && "Retrieving non-existent component." ); // Return a reference to the entity's component return mComponentArray [ mEntityToIndexMap [ entity ]]; } void EntityDestroyed ( Entity entity ) override { if ( mEntityToIndexMap . find ( entity ) != mEntityToIndexMap . end ()) { // Remove the entity's component if it existed RemoveData ( entity ); } } private : // The packed array of components (of generic type T), // set to a specified maximum amount, matching the maximum number // of entities allowed to exist simultaneously, so that each entity // has a unique spot. std :: array < T , MAX_ENTITIES > mComponentArray ; // Map from an entity ID to an array index. std :: unordered_map < Entity , size_t > mEntityToIndexMap ; // Map from an array index to an entity ID. std :: unordered_map < size_t , Entity > mIndexToEntityMap ; // Total size of valid entries in the array. size_t mSize ; };

The unordered_map does have a performance penalty because when you want to get the ID of a component to grab it from the contiguous array, you have to request it from the unordered_map which is not contiguous. An alternative would be to use arrays instead.



But the unordered_maps have the nice property of supporting find(), insert(), and delete(), which allow for asserting validity without "if(valid)" checks and it's a bit clearer then setting array elements to some "INVALID" value.

The virtual inheritance of IComponentArray is unfortunate but, as far as I can tell, unavoidable. As seen later, we'll have a list of every ComponentArray (one per component type), and we need to notify all of them when an entity is destroyed so that it can remove the entity's data if it exists. The only way to keep a list of multiple templated types is to keep a list of their common interface so that we can call EntityDestroyed() on all of them.



Another method is to use events, so that every ComponentArray can subscribe to an Entity Destroyed event and then respond accordingly. This was my original approach but I decided to keep ComponentArrays relatively stupid.



Yet another method would be to use some fancy template magic and reflection, but I wanted to keep it as simple as possibe for my own sanity. The cost of calling the virtual function EntityDestroyed() should be minimal because it isn't something that happens every single frame.

The Component Manager

Now we can implement the Component Manager, which is in charge of talking to all of the different ComponentArrays when a component needs to be added or removed.

As mentioned earlier, we need to have a unique ID for every type of component so that it can have a bit in a signature. To accomplish that without pain, I have the Component Manager have a ComponentType variable that increments by one with every component type that is registered. I’ve seen implementations that don’t require any sort of RegisterComponent functionality, but I’ve found it to be the simplest method. The downside is that any time you add a new type of component to your game and want to use it, you will first need to call RegisterComponent.

C++ offers a convenient function that will return a pointer to a const char array representation of a type T. That pointer (which is just an integer) can be used as a unique key into a map of ComponentTypes.

That same key is also used as a unique key into a map of IComponentArray pointers, so there is one ComponentArray instantiation per ComponentType.

class ComponentManager { public : template < typename T > void RegisterComponent () { const char * typeName = typeid ( T ). name (); assert ( mComponentTypes . find ( typeName ) == mComponentTypes . end () && "Registering component type more than once." ); // Add this component type to the component type map mComponentTypes . insert ({ typeName , mNextComponentType }); // Create a ComponentArray pointer and add it to the component arrays map mComponentArrays . insert ({ typeName , std :: make_shared < ComponentArray < T >> ()}); // Increment the value so that the next component registered will be different ++ mNextComponentType ; } template < typename T > ComponentType GetComponentType () { const char * typeName = typeid ( T ). name (); assert ( mComponentTypes . find ( typeName ) != mComponentTypes . end () && "Component not registered before use." ); // Return this component's type - used for creating signatures return mComponentTypes [ typeName ]; } template < typename T > void AddComponent ( Entity entity , T component ) { // Add a component to the array for an entity GetComponentArray < T > () -> InsertData ( entity , component ); } template < typename T > void RemoveComponent ( Entity entity ) { // Remove a component from the array for an entity GetComponentArray < T > () -> RemoveData ( entity ); } template < typename T > T & GetComponent ( Entity entity ) { // Get a reference to a component from the array for an entity return GetComponentArray < T > () -> GetData ( entity ); } void EntityDestroyed ( Entity entity ) { // Notify each component array that an entity has been destroyed // If it has a component for that entity, it will remove it for ( auto const & pair : mComponentArrays ) { auto const & component = pair . second ; component -> EntityDestroyed ( entity ); } } private : // Map from type string pointer to a component type std :: unordered_map < const char * , ComponentType > mComponentTypes {}; // Map from type string pointer to a component array std :: unordered_map < const char * , std :: shared_ptr < IComponentArray >> mComponentArrays {}; // The component type to be assigned to the next registered component - starting at 0 ComponentType mNextComponentType {}; // Convenience function to get the statically casted pointer to the ComponentArray of type T. template < typename T > std :: shared_ptr < ComponentArray < T >> GetComponentArray () { const char * typeName = typeid ( T ). name (); assert ( mComponentTypes . find ( typeName ) != mComponentTypes . end () && "Component not registered before use." ); return std :: static_pointer_cast < ComponentArray < T >> ( mComponentArrays [ typeName ]); } };

The System

A system is any functionality that iterates upon a list of entities with a certain signature of components.

Every system needs a list of entities, and we want some logic outside of the system (in the form of a manager to maintain that list), so I use a System base class that has only a std::set of entities.

I chose a std::set rather than a std::list for a few reasons.

First, each entity is unique, and a set is defined as having every element be unique, so it maps well logically.

Second, each entity is an integer which makes for easy compares when inserting/removing from the set. Removing a specific entity from a list is O(n) because you have to start at the beginning and possibly go to the end, while removing from a set is O(log n) because it’s a binary tree. However, inserting into a list is only O(1) while inserting into a set is O(log n) as well.

Third, it makes the code easier to understand and read. With a list, you have to use std::find to check if an entity is in the list, but with std::set you can just call insert() and erase() directly without any checks. If trying to insert when it’s already in, it does nothing. If trying to erase when it doesn’t exist, it does nothing.

Fourth, I tested using a list and using a set, and a set was faster.

class System { public : std :: set < Entity > mEntities ; };

Each system can then inherit from this class which allows the System Manager (see next section) to keep a list of pointers to systems. Inheritance, but not virtual.

A system could then do something like this:

for ( auto const & entity : mEntities ) { auto & rigidBody = GetComponent < RigidBody > ( entity ); auto & transform = GetComponent < Transform > ( entity ); auto const & gravity = GetComponent < Gravity > ( entity ); transform . position += rigidBody . velocity * dt ; rigidBody . velocity += gravity . force * dt ; }

A RigidBody, a Transform, and a Gravity will be pulled into the cache for this entity as well as for all of the entities near it in the component array, which are likely to be needed with the next entity in the list of entities.

The System Manager

The System Manager is in charge of maintaining a record of registered systems and their signatures. When a system is registered, it’s added to a map with the same typeid(T).name() trick used for the components. That same key is used for a map of system pointers as well.

As with components, this approach requires a call to RegisterSystem() for every additional system type added to the game.

Each system needs to have a signature set for it so that the manager can add appropriate entities to each systems’s list of entities. When an entity’s signature has changed (due to components being added or removed), then the system’s list of entities that it’s tracking needs to be updated.

If an entity that the system is tracking is destroyed, then it also needs to update its list.

class SystemManager { public : template < typename T > std :: shared_ptr < T > RegisterSystem () { const char * typeName = typeid ( T ). name (); assert ( mSystems . find ( typeName ) == mSystems . end () && "Registering system more than once." ); // Create a pointer to the system and return it so it can be used externally auto system = std :: make_shared < T > (); mSystems . insert ({ typeName , system }); return system ; } template < typename T > void SetSignature ( Signature signature ) { const char * typeName = typeid ( T ). name (); assert ( mSystems . find ( typeName ) != mSystems . end () && "System used before registered." ); // Set the signature for this system mSignatures . insert ({ typeName , signature }); } void EntityDestroyed ( Entity entity ) { // Erase a destroyed entity from all system lists // mEntities is a set so no check needed for ( auto const & pair : mSystems ) { auto const & system = pair . second ; system -> mEntities . erase ( entity ); } } void EntitySignatureChanged ( Entity entity , Signature entitySignature ) { // Notify each system that an entity's signature changed for ( auto const & pair : mSystems ) { auto const & type = pair . first ; auto const & system = pair . second ; auto const & systemSignature = mSignatures [ type ]; // Entity signature matches system signature - insert into set if (( entitySignature & systemSignature ) == systemSignature ) { system -> mEntities . insert ( entity ); } // Entity signature does not match system signature - erase from set else { system -> mEntities . erase ( entity ); } } } private : // Map from system type string pointer to a signature std :: unordered_map < const char * , Signature > mSignatures {}; // Map from system type string pointer to a system pointer std :: unordered_map < const char * , std :: shared_ptr < System >> mSystems {}; };

The Coordinator

We now have quite a lot of functionality built up. We have entities which are managed by an Entity Manager. We have components which are managed by a Component Manager. And we have systems which are managed by a System Manager. These three managers also need to talk to each other.

There are a few ways of accomplishing that, such as having them all be globals, or using an event system, but I opted to instead bundle them into a single class called Coordinator (alternative name suggestions welcome) that acts as a mediator. This allows us to have a single instance of the coordinator (as a global or whatever you want), and we can use it to interface with all of the managers. It also makes usage easier because you can replace this:

Entity player = entityManager . CreateEntity (); componentManager . AddComponent < Transform > ( player ); RenderSystem renderSystem = systemManager . RegisterSystem < RenderSystem > ();

With this:

Entity player = coordinator . CreateEntity (); coordinator . AddComponent < Transform > ( player ); RenderSystem renderSystem = coordinator . RegisterSystem < RenderSystem > ();

The coordinator has pointers to each manager and does some meta-managing between them.

class Coordinator { public : void Init () { // Create pointers to each manager mComponentManager = std :: make_unique < ComponentManager > (); mEntityManager = std :: make_unique < EntityManager > (); mSystemManager = std :: make_unique < SystemManager > (); } // Entity methods Entity CreateEntity () { return mEntityManager -> CreateEntity (); } void DestroyEntity ( Entity entity ) { mEntityManager -> DestroyEntity ( entity ); mComponentManager -> EntityDestroyed ( entity ); mSystemManager -> EntityDestroyed ( entity ); } // Component methods template < typename T > void RegisterComponent () { mComponentManager -> RegisterComponent < T > (); } template < typename T > void AddComponent ( Entity entity , T component ) { mComponentManager -> AddComponent < T > ( entity , component ); auto signature = mEntityManager -> GetSignature ( entity ); signature . set ( mComponentManager -> GetComponentType < T > (), true ); mEntityManager -> SetSignature ( entity , signature ); mSystemManager -> EntitySignatureChanged ( entity , signature ); } template < typename T > void RemoveComponent ( Entity entity ) { mComponentManager -> RemoveComponent < T > ( entity ); auto signature = mEntityManager -> GetSignature ( entity ); signature . set ( mComponentManager -> GetComponentType < T > (), false ); mEntityManager -> SetSignature ( entity , signature ); mSystemManager -> EntitySignatureChanged ( entity , signature ); } template < typename T > T & GetComponent ( Entity entity ) { return mComponentManager -> GetComponent < T > ( entity ); } template < typename T > ComponentType GetComponentType () { return mComponentManager -> GetComponentType < T > (); } // System methods template < typename T > std :: shared_ptr < T > RegisterSystem () { return mSystemManager -> RegisterSystem < T > (); } template < typename T > void SetSystemSignature ( Signature signature ) { mSystemManager -> SetSignature < T > ( signature ); } private : std :: unique_ptr < ComponentManager > mComponentManager ; std :: unique_ptr < EntityManager > mEntityManager ; std :: unique_ptr < SystemManager > mSystemManager ; };

I've seen implementations that create an entity class that acts as a wrapper to an ID with methods that call into the EntityManager and ComponentManager directly (e.g., entity.RemoveComponent () ), which makes for more intuitive usage, but I found it to cause the code to be more complicated and hard to understand. I tried to do it that way multiple times but each time came upon recursive header issues. In the end I opted for the cleaner but less intuitive Coordinator.

Demo

Now let’s see how all of this might be used in a demo that instantiates 10,000 cubes and then has them fall under the influence of gravity. We’ll ignore the rendering and the math classes because that isn’t what this post is about, but keep in mind there is also a rendering system and a Vec3 class.

We have the following components:

struct Gravity { Vec3 force ; }; struct RigidBody { Vec3 velocity ; Vec3 acceleration ; }; struct Transform { Vec3 position ; Vec3 rotation ; Vec3 scale ; };

A system for rudimentary physics integration:

extern Coordinator gCoordinator ; void PhysicsSystem :: Update ( float dt ) { for ( auto const & entity : mEntities ) { auto & rigidBody = gCoordinator . GetComponent < RigidBody > ( entity ); auto & transform = gCoordinator . GetComponent < Transform > ( entity ); auto const & gravity = gCoordinator . GetComponent < Gravity > ( entity ); transform . position += rigidBody . velocity * dt ; rigidBody . velocity += gravity . force * dt ; } }

Then the main loop:

Coordinator gCoordinator ; int main () { gCoordinator . Init (); gCoordinator . RegisterComponent < Gravity > (); gCoordinator . RegisterComponent < RigidBody > (); gCoordinator . RegisterComponent < Transform > (); auto physicsSystem = gCoordinator . RegisterSystem < PhysicsSystem > (); Signature signature ; signature . set ( gCoordinator . GetComponentType < Gravity > ()); signature . set ( gCoordinator . GetComponentType < RigidBody > ()); signature . set ( gCoordinator . GetComponentType < Transform > ()); gCoordinator . SetSystemSignature < PhysicsSystem > ( signature ); std :: vector < Entity > entities ( MAX_ENTITIES ); std :: default_random_engine generator ; std :: uniform_real_distribution < float > randPosition ( - 100.0f , 100.0f ); std :: uniform_real_distribution < float > randRotation ( 0.0f , 3.0f ); std :: uniform_real_distribution < float > randScale ( 3.0f , 5.0f ); std :: uniform_real_distribution < float > randGravity ( - 10.0f , - 1.0f ); float scale = randScale ( generator ); for ( auto & entity : entities ) { entity = gCoordinator . CreateEntity (); gCoordinator . AddComponent ( entity , Gravity { Vec3 ( 0.0f , randGravity ( generator ), 0.0f )}); gCoordinator . AddComponent ( entity , RigidBody { . velocity = Vec3 ( 0.0f , 0.0f , 0.0f ), . acceleration = Vec3 ( 0.0f , 0.0f , 0.0f ) }); gCoordinator . AddComponent ( entity , Transform { . position = Vec3 ( randPosition ( generator ), randPosition ( generator ), randPosition ( generator )), . rotation = Vec3 ( randRotation ( generator ), randRotation ( generator ), randRotation ( generator )), . scale = Vec3 ( scale , scale , scale ) }); } float dt = 0.0f ; while ( ! quit ) { auto startTime = std :: chrono :: high_resolution_clock :: now (); physicsSystem -> Update ( dt ); auto stopTime = std :: chrono :: high_resolution_clock :: now (); dt = std :: chrono :: duration < float , std :: chrono :: seconds :: period > ( stopTime - startTime ). count (); } }

Here is the result:

Here is the output from Valgrind’s cachegrind tool if you’re curious:

==15445== I refs: 3,632,270,619 ==15445== I1 misses: 87,147,982 ==15445== LLi misses: 26,599 ==15445== I1 miss rate: 2.40% ==15445== LLi miss rate: 0.00% ==15445== ==15445== D refs: 1,583,125,924 (1,045,689,190 rd + 537,436,734 wr) ==15445== D1 misses: 11,968,989 ( 7,776,523 rd + 4,192,466 wr) ==15445== LLd misses: 505,598 ( 270,649 rd + 234,949 wr) ==15445== D1 miss rate: 0.8% ( 0.7% + 0.8% ) ==15445== LLd miss rate: 0.0% ( 0.0% + 0.0% ) ==15445== ==15445== LL refs: 99,116,971 ( 94,924,505 rd + 4,192,466 wr) ==15445== LL misses: 532,197 ( 297,248 rd + 234,949 wr) ==15445== LL miss rate: 0.0% ( 0.0% + 0.0% )

This is a very simple example of course, but it’s still fun.

Circling back to the beginning about components also making complex behavior easier, we could easily flip our demo by not adding a RigidBody or a Gravity to the cubes, and instead adding them to the camera.

That is the camera falling down while the cubes remain still.

Conclusion

If you were skeptical about the idea of an ECS, I hope I’ve convinced you it has its merits. And if you were confused about how to implement one (like I was for a long time), I hope I’ve helped you find a way.

Source Code

You can find all of the source code here.

All of the ECS-related source code exists only in headers for two reasons. First, there are a lot of templates which must be in headers anyway. Second, it may possibly increase the odds that the compiler will inline.

References

Discussion