Index type based in unordered_map. More...
#include <interprocess_fwd.hpp>
Public Types | |
typedef K | key_type |
typedef std::pair< const K, T > | value_type |
typedef T | mapped_type |
typedef H | hasher |
typedef P | key_equal |
typedef A | allocator_type |
typedef allocator_traits::pointer | pointer |
typedef allocator_traits::const_pointer | const_pointer |
typedef value_type & | reference |
typedef value_type const & | const_reference |
typedef std::size_t | size_type |
typedef std::ptrdiff_t | difference_type |
typedef table::cl_iterator | const_local_iterator |
typedef table::l_iterator | local_iterator |
typedef table::c_iterator | const_iterator |
typedef table::iterator | iterator |
Index type based in unordered_map.
Just derives from unordered_map and defines the interface needed by managed memory segments
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inline |
Constructor.
Takes a pointer to the segment manager. Can throw
|
inherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inherited |
|
inlineinherited |
Referenced by boost::unordered::unordered_map< sync_id, void * >::insert().
|
inlineinherited |
Referenced by boost::unordered::unordered_map< sync_id, void * >::insert().
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inherited |
|
inherited |
Referenced by boost::interprocess::ipcdetail::sync_handles::destroy_handle(), boost::interprocess::ipcdetail::sync_handles::destroy_syncs_in_range(), boost::unordered::unordered_map< sync_id, void * >::erase_return_void(), boost::unordered::unordered_map< sync_id, void * >::quick_erase(), and boost::spirit::qi::tst_map< Char, T >::remove().
|
inherited |
|
inherited |
|
inlineinherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inherited |
|
inline |
This reserves memory to optimize the insertion of n elements in the index.
References boost::unordered::unordered_map< K, T, H, P, A >::rehash().
|
inherited |
|
inline |
This tries to free previously allocate unused memory.
References boost::unordered::unordered_map< K, T, H, P, A >::rehash(), and boost::unordered::unordered_map< K, T, H, P, A >::size().
|
inlineinherited |
|
inherited |
Referenced by boost::unordered::swap().