boost_mirror/intrusive
1
0
Fork 0
mirror of https://github.com/boostorg/intrusive.git synced 2025-05-11 13:13:57 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fixes for Boost 1.47

Browse Source 
[SVN r70839]
This commit is contained in:
Ion Gaztañaga 2011-04-01 22:04:17 +00:00
parent 7b1f0e0e53
commit 85e5b6bc34
2 changed files with 10 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
doc/intrusive.qbk
View File

@ -3833,8 +3833,11 @@ all the objects to be inserted in intrusive containers in containers like `std::
[section:release_notes_boost_1_47_00 Boost 1.47 Release] [section:release_notes_boost_1_47_00 Boost 1.47 Release]
* Fixed bug * Fixed bugs
[@https://svn.boost.org/trac/boost/ticket/4797 #4797],
[@https://svn.boost.org/trac/boost/ticket/5165 #5165],
[@https://svn.boost.org/trac/boost/ticket/5183 #5183], [@https://svn.boost.org/trac/boost/ticket/5183 #5183],
[@https://svn.boost.org/trac/boost/ticket/5191 #5191].
[endsect] [endsect]

10
example/doc_offset_ptr.cpp
View File

@ -1,6 +1,6 @@
///////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////////////////////////////
// //
// (C) Copyright Ion Gaztanaga 2006-2009 // (C) Copyright Ion Gaztanaga 2006-2011
// //
// Distributed under the Boost Software License, Version 1.0. // Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at // (See accompanying file LICENSE_1_0.txt or copy at
@ -51,7 +51,7 @@ class shared_memory_data
#include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/allocators/allocator.hpp>
//Definition of the shared memory friendly intrusive list //Definition of the shared memory friendly intrusive list
typedef ip::list<shared_memory_data> shm_list_t; typedef list<shared_memory_data> intrusive_list_t;
int main() int main()
{ {
@ -80,12 +80,14 @@ int main()
for(int i = 0; i < MaxElem; ++i) (*pshm_vect)[i].set(i); for(int i = 0; i < MaxElem; ++i) (*pshm_vect)[i].set(i);
//Now create the shared memory intrusive list //Now create the shared memory intrusive list
shm_list_t *plist = shm.construct<shm_list_t>(ip::anonymous_instance)(); intrusive_list_t *plist = shm.construct<intrusive_list_t>(ip::anonymous_instance)();
//Insert objects stored in shared memory vector in the intrusive list
plist->insert(plist->end(), pshm_vect->begin(), pshm_vect->end()); plist->insert(plist->end(), pshm_vect->begin(), pshm_vect->end());
//Check all the inserted nodes //Check all the inserted nodes
int checker = 0; int checker = 0;
for( shm_list_t::const_iterator it = plist->begin(), itend(plist->end()) for( intrusive_list_t::const_iterator it = plist->begin(), itend(plist->end())
; it != itend; ++it, ++checker){ ; it != itend; ++it, ++checker){
if(it->get() != checker) return false; if(it->get() != checker) return false;
} }