entt/docs/md/container.md

Crash Course: containers

Table of Contents

• Introduction
• Containers
  • Dense hash map
  • Dense hash set

Introduction

The standard C++ library offers a wide range of containers and it's really difficult to do better (although it's very easy to do worse, as many examples available online demonstrate).
EnTT doesn't try in any way to replace what is offered by the standard. Quite the opposite, given the widespread use that is made of standard containers.
However, the library also tries to fill a gap in features and functionality by making available some containers initially developed for internal use.

This section of the library is likely to grow larger over time. However, for the moment it's quite small and mainly aimed at satisfying some internal needs.
For all containers made available, full test coverage and stability over time is guaranteed as usual.

Containers

Dense hash map

The dense hash map made available in EnTT is a map that aims to return a packed array of elements, so as to reduce the number of jumps in memory during the iteration.
The implementation is based on sparse sets and each bucket is identified by an implicit list within the packed array itself.

The interface is in all respects similar to its counterpart in the standard library, that is, std::unordered_map.
Therefore, there is no need to go into the API description.

Dense hash set

The dense hash set made available in EnTT is a set that aims to return a packed array of elements, so as to reduce the number of jumps in memory during the iteration.
The implementation is based on sparse sets and each bucket is identified by an implicit list within the packed array itself.

The interface is in all respects similar to its counterpart in the standard library, that is, std::unordered_set.
Therefore, there is no need to go into the API description.