| CACHE | The cache simulator main class |
| CACHE_LINE | Represents a single cache line |
| CACHE_SET_COLLECTION | Represents a single cache set collection, i.e., the line C(i,:) |
| CS_ARRAY< T > | Denotes the base simulated datatype |
| CS_CRS< T > | The compressed row storage sparse matrix data structure |
| CS_ELEMENT< T > | Denotes the base simulated datatype |
| CS_ICRS< T > | The *incremental* compressed row storage sparse matrix data structure |
| CS_MATRIX< T > | Denotes the base simulated datatype |
| CS_Triplet< T > | Cache-simulated triplet (i,j,v), where i and j are indices and v as a value of template type T |
| CS_TS< T > | Cache-simulated version of the Triplet Scheme method to store sparse matrices |
| CS_ZZ_ICRS< T > | The zig-zag incremental compressed row storage sparse matrix data structure |
| DIRECT_MAPPED_CACHE | Direct Mapped cache using simple modulo as mapping function |
| LRU_STACK | A stack-like structure which always has the least recently used item at the bottom, and the most recently used at the top |
| onlyPublic | Class providing means to strip all private and protected data members of .h-files, leaving only public members |
| STATUS | Class (struct) to simplify keeping cache statistics |
