#include <list>
#include <vector>
#include "boost/graph/adjacency_list.hpp"
#include "gsl/pointers"
#include "Allocator.hpp"
Go to the source code of this file.
|
template<typename T > |
using | Si::NotNull = gsl::strict_not_null< T > |
|
template<typename T > |
using | Si::Vector = std::vector< T, Allocator< T > > |
|
template<typename T > |
using | Si::List = std::list< T, Allocator< T > > |
|
template<typename Key , typename Value , typename Compare = std::less<Key>> |
using | Si::Map = std::map< Key, Value, Compare, Allocator< std::pair< const Key, Value > > > |
| A STL map with a Silicon allocator. More...
|
|
template<typename Key , typename Value , typename Hash = std::hash<Key>, typename KeyEqual = std::equal_to<Key>> |
using | Si::HashMap = std::unordered_map< Key, Value, Hash, KeyEqual, Allocator< std::pair< const Key, Value > > > |
| A STL unordered map with a Silicon allocator. More...
|
|
template<typename T , typename ContainerT = GraphVector> |
using | Si::Graph = boost::adjacency_list< ContainerT, ContainerT, boost::bidirectionalS, T > |
| Container for representing relationships between objects. More...
|
|