Lines Matching refs:std
25 // A wrapper subclass for std::vector to make it easy to construct one
28 class ZoneVector : public std::vector<T, ZoneAllocator<T>> {
32 : std::vector<T, ZoneAllocator<T>>(ZoneAllocator<T>(zone)) {}
37 : std::vector<T, ZoneAllocator<T>>(size, T(), ZoneAllocator<T>(zone)) {}
42 : std::vector<T, ZoneAllocator<T>>(size, def, ZoneAllocator<T>(zone)) {}
46 ZoneVector(std::initializer_list<T> list, Zone* zone)
47 : std::vector<T, ZoneAllocator<T>>(list, ZoneAllocator<T>(zone)) {}
53 : std::vector<T, ZoneAllocator<T>>(first, last, ZoneAllocator<T>(zone)) {}
56 // A wrapper subclass for std::deque to make it easy to construct one
59 class ZoneDeque : public std::deque<T, RecyclingZoneAllocator<T>> {
63 : std::deque<T, RecyclingZoneAllocator<T>>(
67 // A wrapper subclass for std::list to make it easy to construct one
72 class ZoneLinkedList : public std::list<T, ZoneAllocator<T>> {
76 : std::list<T, ZoneAllocator<T>>(ZoneAllocator<T>(zone)) {}
79 // A wrapper subclass for std::forward_list to make it easy to construct one
82 class ZoneForwardList : public std::forward_list<T, ZoneAllocator<T>> {
86 : std::forward_list<T, ZoneAllocator<T>>(ZoneAllocator<T>(zone)) {}
89 // A wrapper subclass for std::priority_queue to make it easy to construct one
91 template <typename T, typename Compare = std::less<T>>
93 : public std::priority_queue<T, ZoneVector<T>, Compare> {
97 : std::priority_queue<T, ZoneVector<T>, Compare>(Compare(),
101 // A wrapper subclass for std::queue to make it easy to construct one
104 class ZoneQueue : public std::queue<T, ZoneDeque<T>> {
108 : std::queue<T, ZoneDeque<T>>(ZoneDeque<T>(zone)) {}
111 // A wrapper subclass for std::stack to make it easy to construct one that uses
114 class ZoneStack : public std::stack<T, ZoneDeque<T>> {
118 : std::stack<T, ZoneDeque<T>>(ZoneDeque<T>(zone)) {}
121 // A wrapper subclass for std::set to make it easy to construct one that uses
123 template <typename K, typename Compare = std::less<K>>
124 class ZoneSet : public std::set<K, Compare, ZoneAllocator<K>> {
128 : std::set<K, Compare, ZoneAllocator<K>>(Compare(),
132 // A wrapper subclass for std::multiset to make it easy to construct one that
134 template <typename K, typename Compare = std::less<K>>
135 class ZoneMultiset : public std::multiset<K, Compare, ZoneAllocator<K>> {
139 : std::multiset<K, Compare, ZoneAllocator<K>>(Compare(),
143 // A wrapper subclass for std::map to make it easy to construct one that uses
145 template <typename K, typename V, typename Compare = std::less<K>>
147 : public std::map<K, V, Compare, ZoneAllocator<std::pair<const K, V>>> {
151 : std::map<K, V, Compare, ZoneAllocator<std::pair<const K, V>>>(
152 Compare(), ZoneAllocator<std::pair<const K, V>>(zone)) {}
155 // A wrapper subclass for std::unordered_map to make it easy to construct one
158 typename KeyEqual = std::equal_to<K>>
160 : public std::unordered_map<K, V, Hash, KeyEqual,
161 ZoneAllocator<std::pair<const K, V>>> {
165 : std::unordered_map<K, V, Hash, KeyEqual,
166 ZoneAllocator<std::pair<const K, V>>>(
168 ZoneAllocator<std::pair<const K, V>>(zone)) {}
171 // A wrapper subclass for std::unordered_set to make it easy to construct one
174 typename KeyEqual = std::equal_to<K>>
176 : public std::unordered_set<K, Hash, KeyEqual, ZoneAllocator<K>> {
180 : std::unordered_set<K, Hash, KeyEqual, ZoneAllocator<K>>(
184 // A wrapper subclass for std::multimap to make it easy to construct one that
186 template <typename K, typename V, typename Compare = std::less<K>>
188 : public std::multimap<K, V, Compare,
189 ZoneAllocator<std::pair<const K, V>>> {
193 : std::multimap<K, V, Compare, ZoneAllocator<std::pair<const K, V>>>(
194 Compare(), ZoneAllocator<std::pair<const K, V>>(zone)) {}