|
DDD 1.9.0.20250910094029
|
This class implements a unicity table mechanism, based on an STL hash_set. More...
#include <UniqueTable.h>

Public Types | |
| typedef d3::hash_set< constT * >::type | Table |
| Typedef helps hide implementation type (currently gnu gcc's hash_set). | |
Public Member Functions | |
| UniqueTable () | |
| Constructor, builds a default table. | |
| UniqueTable (size_t s) | |
| const T * | operator() (const T &_g) |
| The application operator, returns the address of the value already in the table if it exists, or inserts and returns the address of the value inserted. | |
| size_t | size () const |
| Returns the current number of filled entries in the table. | |
Public Attributes | |
| Table | table |
| The actual table, operations on the UniqueTable are delegated on this. | |
This class implements a unicity table mechanism, based on an STL hash_set.
Requirements on the contained type are thus those of hash_set.
| typedef d3::hash_set<constT*>::type UniqueTable< T >::Table |
Typedef helps hide implementation type (currently gnu gcc's hash_set).
|
inline |
Constructor, builds a default table.
References UniqueTable< T >::table.
|
inline |
References UniqueTable< T >::table.
|
inline |
The application operator, returns the address of the value already in the table if it exists, or inserts and returns the address of the value inserted.
| _g | the pointer to the value we want to find in the table. |
References UniqueTable< T >::table.
|
inline |
Returns the current number of filled entries in the table.
References UniqueTable< T >::table.
Referenced by DED::garbage(), SDED::garbage(), SDED::peak(), DED::pstats(), and SDED::statistics().
| Table UniqueTable< T >::table |
The actual table, operations on the UniqueTable are delegated on this.
Referenced by DED::garbage(), IntDataSet::garbage(), SDED::garbage(), UniqueTable< T >::operator()(), DED::peak(), UniqueTable< T >::size(), DED::statistics(), UniqueTable< T >::UniqueTable(), and UniqueTable< T >::UniqueTable().
1.9.8