#include <broom-unordered-multiset.h>
Inheritance diagram for broom::unordered_multiset< T, Hash, KeyEqual, Allocator >:
Collaboration diagram for broom::unordered_multiset< T, Hash, KeyEqual, Allocator >:
Additional Inherited Members | |
 Public Member Functions inherited from broom::BroomValue | |
| virtual | ~BroomValue () |
| virtual void | Visit (Visitor *visitor) const =0 |
| Protected Member Functions inherited from broom::BroomValue | |
| BroomValue (GarbageCollector *gc) | |
| BroomValue () | |
| BroomValue (const BroomValue &other) | |
| BroomValue & | operator= (const BroomValue &other) |
| BroomValue & | operator= (BroomValue &&other) noexcept |
Detailed Description
template<typename T, typename Hash = std::hash<T>, typename KeyEqual = std::equal_to<T>, typename Allocator = std::allocator<T>>
class broom::unordered_multiset< T, Hash, KeyEqual, Allocator >
class broom::unordered_multiset< T, Hash, KeyEqual, Allocator >
A Broom wrapper for std::unordered_multiset. broom::unordered_multiset aims to cover all the cases where one might want to use a std::unordered_multiset, while still remaining safe in the context of garbage collection. Since std::unordered_multiset is not on the stack and won't be scanned automatically, any managed pointer in it will be garbage collected prematurely. broom::unordered_multiset aims to alleviate this concern by implementing it as a precise root. broom::unordered_multiset is only available as an interface and you should never rely on its implementation details, as they may change.
Definition at line 31 of file broom-unordered-multiset.h.
The documentation for this class was generated from the following file:
- include/broom-unordered-multiset.h
