#include <assert.h>#include <stdlib.h>#include <vector>#include "common/h/Types.h"#include "common/h/Vector.h"#include "common/h/std_namesp.h"Go to the source code of this file.
Data Structures | |
| class | addrRange |
| class | addrRangeTree< T > |
| struct | addrRangeTree< T >::entry |
Enumerations | |
| enum | color_t { TREE_RED, TREE_BLACK } |
| enum color_t |
template class for addrRangeTree. The implementation is based on red black tree implementation for efficiency concerns and for getting sorted elements easier. There are two template types, K (key) and V (value).
Definition at line 54 of file addrRange.h.
1.6.1