#include <list>
#include <set>
#include "generic/static.h"
Go to the source code of this file.
Data Structures | |
class | Single< Type > |
A single-value container, which can either be empty or full. More... | |
class | UnsortedSet< Value > |
An adaptor to make std::list into a Unique Sequence - which cannot contain the same value more than once. More... | |
class | UnsortedMap< Key, Value > |
class | UniqueSet< Value > |
An adaptor to assert when duplicate values are added, or non-existent values removed from a std::set. More... | |
class | ReferencePair< Type > |
Namespaces | |
namespace | std |
Defines | |
#define | INCLUDED_CONTAINER_CONTAINER_H |
Functions | |
template<typename Value > | |
void | std::swap (UnsortedSet< Value > &self, UnsortedSet< Value > &other) |
Swaps the values of self and other . Overloads std::swap. | |
template<typename Value > | |
void | std::swap (UniqueSet< Value > &self, UniqueSet< Value > &other) |
Swaps the values of self and other . Overloads std::swap. |
#define INCLUDED_CONTAINER_CONTAINER_H |
Definition at line 23 of file container.h.