mirror of
https://github.com/boostorg/interprocess.git
synced 2026-01-19 16:22:19 +00:00
Intrusive:
* Added `linear<>` and `cache_last<>` options to singly linked lists. * Added `optimize_multikey<>` option to unordered container hooks. * Optimized unordered containers when `store_hash` option is used in the hook. * Implementation changed to be exception agnostic so that it can be used in environments without exceptions. * Added `container_from_iterator` function to tree-based containers. Interprocess: * Added anonymous shared memory for UNIX systems. * Fixed file lock compilation errors [SVN r44819]
This commit is contained in:
66
example/doc_unordered_map.cpp
Normal file
66
example/doc_unordered_map.cpp
Normal file
@@ -0,0 +1,66 @@
|
||||
//////////////////////////////////////////////////////////////////////////////
|
||||
//
|
||||
// (C) Copyright Ion Gaztanaga 2006-2007. Distributed under the Boost
|
||||
// Software License, Version 1.0. (See accompanying file
|
||||
// LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
||||
//
|
||||
// See http://www.boost.org/libs/interprocess for documentation.
|
||||
//
|
||||
//////////////////////////////////////////////////////////////////////////////
|
||||
#include <boost/interprocess/detail/config_begin.hpp>
|
||||
#include <boost/interprocess/detail/workaround.hpp>
|
||||
//[doc_unordered_map
|
||||
#include <boost/interprocess/managed_shared_memory.hpp>
|
||||
#include <boost/interprocess/allocators/allocator.hpp>
|
||||
|
||||
#include <boost/unordered_map.hpp> //boost::unordered_map
|
||||
#include <functional> //std::equal_to
|
||||
#include <boost/functional/hash.hpp> //boost::hash
|
||||
|
||||
int main ()
|
||||
{
|
||||
using namespace boost::interprocess;
|
||||
//Erase previous shared memory with the name
|
||||
shared_memory_object::remove("MySharedMemory");
|
||||
|
||||
try{
|
||||
//Create shared memory
|
||||
managed_shared_memory segment(create_only ,"MySharedMemory" ,65536);
|
||||
|
||||
//Note that unordered_map<Key, MappedType>'s value_type is std::pair<const Key, MappedType>,
|
||||
//so the allocator must allocate that pair.
|
||||
typedef int KeyType;
|
||||
typedef float MappedType;
|
||||
typedef std::pair<const int, float> ValueType;
|
||||
|
||||
//Typedef the allocator
|
||||
typedef allocator<ValueType, managed_shared_memory::segment_manager> ShmemAllocator;
|
||||
|
||||
//Alias an unordered_map of ints that uses the previous STL-like allocator.
|
||||
typedef boost::unordered_map
|
||||
< KeyType , MappedType
|
||||
, boost::hash<KeyType> ,std::equal_to<KeyType>
|
||||
, ShmemAllocator>
|
||||
MyHashMap;
|
||||
|
||||
//Construct a shared memory hash map.
|
||||
//Note that the first parameter is the initial bucket count and
|
||||
//after that, the hash function, the equality function and the allocator
|
||||
MyHashMap *myhashmap = segment.construct<MyHashMap>("MyHashMap") //object name
|
||||
( 3, boost::hash<int>(), std::equal_to<int>() //
|
||||
, segment.get_allocator<ValueType>()); //allocator instance
|
||||
|
||||
//Insert data in the hash map
|
||||
for(int i = 0; i < 100; ++i){
|
||||
myhashmap->insert(ValueType(i, (float)i));
|
||||
}
|
||||
}
|
||||
catch(...){
|
||||
shared_memory_object::remove("MySharedMemory");
|
||||
throw;
|
||||
}
|
||||
shared_memory_object::remove("MySharedMemory");
|
||||
return 0;
|
||||
}
|
||||
//]
|
||||
#include <boost/interprocess/detail/config_end.hpp>
|
||||
Reference in New Issue
Block a user