annotate DEPENDENCIES/generic/include/boost/ptr_container/ptr_set_adapter.hpp @ 125:34e428693f5d vext

Vext -> Repoint
author Chris Cannam
date Thu, 14 Jun 2018 11:15:39 +0100
parents 2665513ce2d3
children
rev   line source
Chris@16 1 //
Chris@16 2 // Boost.Pointer Container
Chris@16 3 //
Chris@16 4 // Copyright Thorsten Ottosen 2003-2005. Use, modification and
Chris@16 5 // distribution is subject to the Boost Software License, Version
Chris@16 6 // 1.0. (See accompanying file LICENSE_1_0.txt or copy at
Chris@16 7 // http://www.boost.org/LICENSE_1_0.txt)
Chris@16 8 //
Chris@16 9 // For more information, see http://www.boost.org/libs/ptr_container/
Chris@16 10 //
Chris@16 11
Chris@16 12 #ifndef BOOST_PTR_CONTAINER_PTR_SET_ADAPTER_HPP
Chris@16 13 #define BOOST_PTR_CONTAINER_PTR_SET_ADAPTER_HPP
Chris@16 14
Chris@16 15 #if defined(_MSC_VER) && (_MSC_VER >= 1200)
Chris@16 16 # pragma once
Chris@16 17 #endif
Chris@16 18
Chris@16 19 #include <boost/ptr_container/detail/associative_ptr_container.hpp>
Chris@16 20 #include <boost/ptr_container/detail/meta_functions.hpp>
Chris@16 21 #include <boost/ptr_container/detail/void_ptr_iterator.hpp>
Chris@16 22 #include <boost/range/iterator_range.hpp>
Chris@16 23
Chris@16 24 namespace boost
Chris@16 25 {
Chris@16 26 namespace ptr_container_detail
Chris@16 27 {
Chris@16 28 template
Chris@16 29 <
Chris@16 30 class Key,
Chris@16 31 class VoidPtrSet,
Chris@16 32 bool Ordered
Chris@16 33 >
Chris@16 34 struct set_config
Chris@16 35 {
Chris@16 36 typedef VoidPtrSet
Chris@16 37 void_container_type;
Chris@16 38
Chris@16 39 typedef BOOST_DEDUCED_TYPENAME VoidPtrSet::allocator_type
Chris@16 40 allocator_type;
Chris@16 41
Chris@16 42 typedef Key value_type;
Chris@16 43
Chris@16 44 typedef value_type
Chris@16 45 key_type;
Chris@16 46
Chris@16 47 typedef BOOST_DEDUCED_TYPENAME
Chris@16 48 mpl::eval_if_c<Ordered,
Chris@16 49 select_value_compare<VoidPtrSet>,
Chris@16 50 mpl::identity<void> >::type
Chris@16 51 value_compare;
Chris@16 52
Chris@16 53 typedef value_compare
Chris@16 54 key_compare;
Chris@16 55
Chris@16 56 typedef BOOST_DEDUCED_TYPENAME
Chris@16 57 mpl::eval_if_c<Ordered,
Chris@16 58 mpl::identity<void>,
Chris@16 59 select_hasher<VoidPtrSet> >::type
Chris@16 60 hasher;
Chris@16 61
Chris@16 62 typedef BOOST_DEDUCED_TYPENAME
Chris@16 63 mpl::eval_if_c<Ordered,
Chris@16 64 mpl::identity<void>,
Chris@16 65 select_key_equal<VoidPtrSet> >::type
Chris@16 66 key_equal;
Chris@16 67
Chris@16 68 typedef BOOST_DEDUCED_TYPENAME
Chris@16 69 mpl::if_c<Ordered,
Chris@16 70 ordered_associative_container_tag,
Chris@16 71 unordered_associative_container_tag>::type
Chris@16 72 container_type;
Chris@16 73
Chris@16 74 typedef void_ptr_iterator<
Chris@16 75 BOOST_DEDUCED_TYPENAME VoidPtrSet::iterator, Key >
Chris@16 76 iterator;
Chris@16 77
Chris@16 78 typedef void_ptr_iterator<
Chris@16 79 BOOST_DEDUCED_TYPENAME VoidPtrSet::const_iterator, const Key >
Chris@16 80 const_iterator;
Chris@16 81
Chris@16 82 typedef void_ptr_iterator<
Chris@16 83 BOOST_DEDUCED_TYPENAME
Chris@16 84 mpl::eval_if_c<Ordered,
Chris@16 85 select_iterator<VoidPtrSet>,
Chris@16 86 select_local_iterator<VoidPtrSet> >::type,
Chris@16 87 Key >
Chris@16 88 local_iterator;
Chris@16 89
Chris@16 90 typedef void_ptr_iterator<
Chris@16 91 BOOST_DEDUCED_TYPENAME
Chris@16 92 mpl::eval_if_c<Ordered,
Chris@16 93 select_iterator<VoidPtrSet>,
Chris@16 94 select_const_local_iterator<VoidPtrSet> >::type,
Chris@16 95 const Key >
Chris@16 96 const_local_iterator;
Chris@16 97
Chris@16 98 template< class Iter >
Chris@16 99 static Key* get_pointer( Iter i )
Chris@16 100 {
Chris@16 101 return static_cast<Key*>( *i.base() );
Chris@16 102 }
Chris@16 103
Chris@16 104 template< class Iter >
Chris@16 105 static const Key* get_const_pointer( Iter i )
Chris@16 106 {
Chris@16 107 return static_cast<const Key*>( *i.base() );
Chris@16 108 }
Chris@16 109
Chris@16 110 BOOST_STATIC_CONSTANT(bool, allow_null = false );
Chris@16 111 };
Chris@16 112
Chris@16 113
Chris@16 114
Chris@16 115 template
Chris@16 116 <
Chris@16 117 class Key,
Chris@16 118 class VoidPtrSet,
Chris@16 119 class CloneAllocator = heap_clone_allocator,
Chris@16 120 bool Ordered = true
Chris@16 121 >
Chris@16 122 class ptr_set_adapter_base
Chris@16 123 : public ptr_container_detail::associative_ptr_container< set_config<Key,VoidPtrSet,Ordered>,
Chris@16 124 CloneAllocator >
Chris@16 125 {
Chris@16 126 typedef ptr_container_detail::associative_ptr_container< set_config<Key,VoidPtrSet,Ordered>,
Chris@16 127 CloneAllocator >
Chris@16 128 base_type;
Chris@16 129 public:
Chris@16 130 typedef BOOST_DEDUCED_TYPENAME base_type::iterator
Chris@16 131 iterator;
Chris@16 132 typedef BOOST_DEDUCED_TYPENAME base_type::const_iterator
Chris@16 133 const_iterator;
Chris@16 134 typedef Key key_type;
Chris@16 135 typedef BOOST_DEDUCED_TYPENAME base_type::size_type
Chris@16 136 size_type;
Chris@16 137
Chris@16 138 public:
Chris@16 139 ptr_set_adapter_base()
Chris@16 140 { }
Chris@16 141
Chris@16 142 template< class SizeType >
Chris@16 143 ptr_set_adapter_base( SizeType n,
Chris@16 144 ptr_container_detail::unordered_associative_container_tag tag )
Chris@16 145 : base_type( n, tag )
Chris@16 146 { }
Chris@16 147
Chris@16 148 template< class Compare, class Allocator >
Chris@16 149 ptr_set_adapter_base( const Compare& comp,
Chris@16 150 const Allocator& a )
Chris@16 151 : base_type( comp, a )
Chris@16 152 { }
Chris@16 153
Chris@16 154 template< class Hash, class Pred, class Allocator >
Chris@16 155 ptr_set_adapter_base( const Hash& hash,
Chris@16 156 const Pred& pred,
Chris@16 157 const Allocator& a )
Chris@16 158 : base_type( hash, pred, a )
Chris@16 159 { }
Chris@16 160
Chris@16 161 template< class InputIterator, class Compare, class Allocator >
Chris@16 162 ptr_set_adapter_base( InputIterator first, InputIterator last,
Chris@16 163 const Compare& comp,
Chris@16 164 const Allocator& a )
Chris@16 165 : base_type( first, last, comp, a )
Chris@16 166 { }
Chris@16 167
Chris@16 168 template< class InputIterator, class Hash, class Pred, class Allocator >
Chris@16 169 ptr_set_adapter_base( InputIterator first, InputIterator last,
Chris@16 170 const Hash& hash,
Chris@16 171 const Pred& pred,
Chris@16 172 const Allocator& a )
Chris@16 173 : base_type( first, last, hash, pred, a )
Chris@16 174 { }
Chris@16 175
Chris@16 176 template< class U, class Set, class CA, bool b >
Chris@16 177 ptr_set_adapter_base( const ptr_set_adapter_base<U,Set,CA,b>& r )
Chris@16 178 : base_type( r )
Chris@16 179 { }
Chris@16 180
Chris@16 181 ptr_set_adapter_base( const ptr_set_adapter_base& r )
Chris@16 182 : base_type( r )
Chris@16 183 { }
Chris@16 184
Chris@16 185 template< class PtrContainer >
Chris@16 186 explicit ptr_set_adapter_base( std::auto_ptr<PtrContainer> clone )
Chris@16 187 : base_type( clone )
Chris@16 188 { }
Chris@16 189
Chris@16 190 ptr_set_adapter_base& operator=( ptr_set_adapter_base r )
Chris@16 191 {
Chris@16 192 this->swap( r );
Chris@16 193 return *this;
Chris@16 194 }
Chris@16 195
Chris@16 196 template< typename PtrContainer >
Chris@16 197 ptr_set_adapter_base& operator=( std::auto_ptr<PtrContainer> clone )
Chris@16 198 {
Chris@16 199 base_type::operator=( clone );
Chris@16 200 return *this;
Chris@16 201 }
Chris@16 202
Chris@16 203 using base_type::erase;
Chris@16 204
Chris@16 205 size_type erase( const key_type& x ) // nothrow
Chris@16 206 {
Chris@16 207 key_type* key = const_cast<key_type*>(&x);
Chris@16 208 iterator i( this->base().find( key ) );
Chris@16 209 if( i == this->end() ) // nothrow
Chris@16 210 return 0u; // nothrow
Chris@16 211 key = static_cast<key_type*>(*i.base()); // nothrow
Chris@16 212 size_type res = this->base().erase( key ); // nothrow
Chris@16 213 this->remove( key ); // nothrow
Chris@16 214 return res;
Chris@16 215 }
Chris@16 216
Chris@16 217
Chris@16 218 iterator find( const key_type& x )
Chris@16 219 {
Chris@16 220 return iterator( this->base().
Chris@16 221 find( const_cast<key_type*>(&x) ) );
Chris@16 222 }
Chris@16 223
Chris@16 224 const_iterator find( const key_type& x ) const
Chris@16 225 {
Chris@16 226 return const_iterator( this->base().
Chris@16 227 find( const_cast<key_type*>(&x) ) );
Chris@16 228 }
Chris@16 229
Chris@16 230 size_type count( const key_type& x ) const
Chris@16 231 {
Chris@16 232 return this->base().count( const_cast<key_type*>(&x) );
Chris@16 233 }
Chris@16 234
Chris@16 235 iterator lower_bound( const key_type& x )
Chris@16 236 {
Chris@16 237 return iterator( this->base().
Chris@16 238 lower_bound( const_cast<key_type*>(&x) ) );
Chris@16 239 }
Chris@16 240
Chris@16 241 const_iterator lower_bound( const key_type& x ) const
Chris@16 242 {
Chris@16 243 return const_iterator( this->base().
Chris@16 244 lower_bound( const_cast<key_type*>(&x) ) );
Chris@16 245 }
Chris@16 246
Chris@16 247 iterator upper_bound( const key_type& x )
Chris@16 248 {
Chris@16 249 return iterator( this->base().
Chris@16 250 upper_bound( const_cast<key_type*>(&x) ) );
Chris@16 251 }
Chris@16 252
Chris@16 253 const_iterator upper_bound( const key_type& x ) const
Chris@16 254 {
Chris@16 255 return const_iterator( this->base().
Chris@16 256 upper_bound( const_cast<key_type*>(&x) ) );
Chris@16 257 }
Chris@16 258
Chris@16 259 iterator_range<iterator> equal_range( const key_type& x )
Chris@16 260 {
Chris@16 261 std::pair<BOOST_DEDUCED_TYPENAME base_type::ptr_iterator,
Chris@16 262 BOOST_DEDUCED_TYPENAME base_type::ptr_iterator>
Chris@16 263 p = this->base().
Chris@16 264 equal_range( const_cast<key_type*>(&x) );
Chris@16 265 return make_iterator_range( iterator( p.first ),
Chris@16 266 iterator( p.second ) );
Chris@16 267 }
Chris@16 268
Chris@16 269 iterator_range<const_iterator> equal_range( const key_type& x ) const
Chris@16 270 {
Chris@16 271 std::pair<BOOST_DEDUCED_TYPENAME base_type::ptr_const_iterator,
Chris@16 272 BOOST_DEDUCED_TYPENAME base_type::ptr_const_iterator>
Chris@16 273 p = this->base().
Chris@16 274 equal_range( const_cast<key_type*>(&x) );
Chris@16 275 return make_iterator_range( const_iterator( p.first ),
Chris@16 276 const_iterator( p.second ) );
Chris@16 277 }
Chris@16 278
Chris@16 279 protected:
Chris@16 280 size_type bucket( const key_type& key ) const
Chris@16 281 {
Chris@16 282 return this->base().bucket( const_cast<key_type*>(&key) );
Chris@16 283 }
Chris@16 284 };
Chris@16 285
Chris@16 286 } // ptr_container_detail
Chris@16 287
Chris@16 288 /////////////////////////////////////////////////////////////////////////
Chris@16 289 // ptr_set_adapter
Chris@16 290 /////////////////////////////////////////////////////////////////////////
Chris@16 291
Chris@16 292 template
Chris@16 293 <
Chris@16 294 class Key,
Chris@16 295 class VoidPtrSet,
Chris@16 296 class CloneAllocator = heap_clone_allocator,
Chris@16 297 bool Ordered = true
Chris@16 298 >
Chris@16 299 class ptr_set_adapter :
Chris@16 300 public ptr_container_detail::ptr_set_adapter_base<Key,VoidPtrSet,CloneAllocator,Ordered>
Chris@16 301 {
Chris@16 302 typedef ptr_container_detail::ptr_set_adapter_base<Key,VoidPtrSet,CloneAllocator,Ordered>
Chris@16 303 base_type;
Chris@16 304
Chris@16 305 public: // typedefs
Chris@16 306
Chris@16 307 typedef BOOST_DEDUCED_TYPENAME base_type::iterator
Chris@16 308 iterator;
Chris@16 309 typedef BOOST_DEDUCED_TYPENAME base_type::const_iterator
Chris@16 310 const_iterator;
Chris@16 311 typedef BOOST_DEDUCED_TYPENAME base_type::size_type
Chris@16 312 size_type;
Chris@16 313 typedef Key key_type;
Chris@16 314 typedef BOOST_DEDUCED_TYPENAME base_type::auto_type
Chris@16 315 auto_type;
Chris@16 316 typedef BOOST_DEDUCED_TYPENAME VoidPtrSet::allocator_type
Chris@16 317 allocator_type;
Chris@16 318 private:
Chris@16 319
Chris@16 320 template< typename II >
Chris@16 321 void set_basic_clone_and_insert( II first, II last ) // basic
Chris@16 322 {
Chris@16 323 while( first != last )
Chris@16 324 {
Chris@16 325 if( this->find( *first ) == this->end() )
Chris@16 326 insert( CloneAllocator::allocate_clone( *first ) ); // strong, commit
Chris@16 327 ++first;
Chris@16 328 }
Chris@16 329 }
Chris@16 330
Chris@16 331 public:
Chris@16 332 ptr_set_adapter()
Chris@16 333 { }
Chris@16 334
Chris@16 335 template< class SizeType >
Chris@16 336 ptr_set_adapter( SizeType n,
Chris@16 337 ptr_container_detail::unordered_associative_container_tag tag )
Chris@16 338 : base_type( n, tag )
Chris@16 339 { }
Chris@16 340
Chris@16 341 template< class Comp >
Chris@16 342 explicit ptr_set_adapter( const Comp& comp,
Chris@16 343 const allocator_type& a )
Chris@16 344 : base_type( comp, a )
Chris@16 345 {
Chris@16 346 BOOST_ASSERT( this->empty() );
Chris@16 347 }
Chris@16 348
Chris@16 349 template< class Hash, class Pred, class Allocator >
Chris@16 350 ptr_set_adapter( const Hash& hash,
Chris@16 351 const Pred& pred,
Chris@16 352 const Allocator& a )
Chris@16 353 : base_type( hash, pred, a )
Chris@16 354 { }
Chris@16 355
Chris@16 356 template< class InputIterator >
Chris@16 357 ptr_set_adapter( InputIterator first, InputIterator last )
Chris@16 358 : base_type( first, last )
Chris@16 359 { }
Chris@16 360
Chris@16 361 template< class InputIterator, class Compare, class Allocator >
Chris@16 362 ptr_set_adapter( InputIterator first, InputIterator last,
Chris@16 363 const Compare& comp,
Chris@16 364 const Allocator a = Allocator() )
Chris@16 365 : base_type( comp, a )
Chris@16 366 {
Chris@16 367 BOOST_ASSERT( this->empty() );
Chris@16 368 set_basic_clone_and_insert( first, last );
Chris@16 369 }
Chris@16 370
Chris@16 371 template< class InputIterator, class Hash, class Pred, class Allocator >
Chris@16 372 ptr_set_adapter( InputIterator first, InputIterator last,
Chris@16 373 const Hash& hash,
Chris@16 374 const Pred& pred,
Chris@16 375 const Allocator& a )
Chris@16 376 : base_type( first, last, hash, pred, a )
Chris@16 377 { }
Chris@16 378
Chris@16 379 explicit ptr_set_adapter( const ptr_set_adapter& r )
Chris@16 380 : base_type( r )
Chris@16 381 { }
Chris@16 382
Chris@16 383 template< class U, class Set, class CA, bool b >
Chris@16 384 explicit ptr_set_adapter( const ptr_set_adapter<U,Set,CA,b>& r )
Chris@16 385 : base_type( r )
Chris@16 386 { }
Chris@16 387
Chris@16 388 template< class PtrContainer >
Chris@16 389 explicit ptr_set_adapter( std::auto_ptr<PtrContainer> clone )
Chris@16 390 : base_type( clone )
Chris@16 391 { }
Chris@16 392
Chris@16 393 template< class U, class Set, class CA, bool b >
Chris@16 394 ptr_set_adapter& operator=( const ptr_set_adapter<U,Set,CA,b>& r )
Chris@16 395 {
Chris@16 396 base_type::operator=( r );
Chris@16 397 return *this;
Chris@16 398 }
Chris@16 399
Chris@16 400 template< class T >
Chris@16 401 void operator=( std::auto_ptr<T> r )
Chris@16 402 {
Chris@16 403 base_type::operator=( r );
Chris@16 404 }
Chris@16 405
Chris@16 406 std::pair<iterator,bool> insert( key_type* x ) // strong
Chris@16 407 {
Chris@16 408 this->enforce_null_policy( x, "Null pointer in 'ptr_set::insert()'" );
Chris@16 409
Chris@16 410 auto_type ptr( x );
Chris@16 411 std::pair<BOOST_DEDUCED_TYPENAME base_type::ptr_iterator,bool>
Chris@16 412 res = this->base().insert( x );
Chris@16 413 if( res.second )
Chris@16 414 ptr.release();
Chris@16 415 return std::make_pair( iterator( res.first ), res.second );
Chris@16 416 }
Chris@16 417
Chris@16 418 template< class U >
Chris@16 419 std::pair<iterator,bool> insert( std::auto_ptr<U> x )
Chris@16 420 {
Chris@16 421 return insert( x.release() );
Chris@16 422 }
Chris@16 423
Chris@16 424
Chris@16 425 iterator insert( iterator where, key_type* x ) // strong
Chris@16 426 {
Chris@16 427 this->enforce_null_policy( x, "Null pointer in 'ptr_set::insert()'" );
Chris@16 428
Chris@16 429 auto_type ptr( x );
Chris@16 430 BOOST_DEDUCED_TYPENAME base_type::ptr_iterator
Chris@16 431 res = this->base().insert( where.base(), x );
Chris@16 432 if( *res == x )
Chris@16 433 ptr.release();
Chris@16 434 return iterator( res);
Chris@16 435 }
Chris@16 436
Chris@16 437 template< class U >
Chris@16 438 iterator insert( iterator where, std::auto_ptr<U> x )
Chris@16 439 {
Chris@16 440 return insert( where, x.release() );
Chris@16 441 }
Chris@16 442
Chris@16 443 template< typename InputIterator >
Chris@16 444 void insert( InputIterator first, InputIterator last ) // basic
Chris@16 445 {
Chris@16 446 set_basic_clone_and_insert( first, last );
Chris@16 447 }
Chris@16 448
Chris@16 449 #if defined(BOOST_NO_SFINAE) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
Chris@16 450 #else
Chris@16 451
Chris@16 452 template< class Range >
Chris@16 453 BOOST_DEDUCED_TYPENAME
Chris@16 454 boost::disable_if< ptr_container_detail::is_pointer_or_integral<Range> >::type
Chris@16 455 insert( const Range& r )
Chris@16 456 {
Chris@16 457 insert( boost::begin(r), boost::end(r) );
Chris@16 458 }
Chris@16 459
Chris@16 460 #endif
Chris@16 461
Chris@16 462 template< class PtrSetAdapter >
Chris@16 463 bool transfer( BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator object,
Chris@16 464 PtrSetAdapter& from ) // strong
Chris@16 465 {
Chris@16 466 return this->single_transfer( object, from );
Chris@16 467 }
Chris@16 468
Chris@16 469 template< class PtrSetAdapter >
Chris@16 470 size_type
Chris@16 471 transfer( BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator first,
Chris@16 472 BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator last,
Chris@16 473 PtrSetAdapter& from ) // basic
Chris@16 474 {
Chris@16 475 return this->single_transfer( first, last, from );
Chris@16 476 }
Chris@16 477
Chris@16 478 #if defined(BOOST_NO_SFINAE) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
Chris@16 479 #else
Chris@16 480
Chris@16 481 template< class PtrSetAdapter, class Range >
Chris@16 482 BOOST_DEDUCED_TYPENAME boost::disable_if< boost::is_same< Range,
Chris@16 483 BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator >,
Chris@16 484 size_type >::type
Chris@16 485 transfer( const Range& r, PtrSetAdapter& from ) // basic
Chris@16 486 {
Chris@16 487 return transfer( boost::begin(r), boost::end(r), from );
Chris@16 488 }
Chris@16 489
Chris@16 490 #endif
Chris@16 491
Chris@16 492 template< class PtrSetAdapter >
Chris@16 493 size_type transfer( PtrSetAdapter& from ) // basic
Chris@16 494 {
Chris@16 495 return transfer( from.begin(), from.end(), from );
Chris@16 496 }
Chris@16 497
Chris@16 498 };
Chris@16 499
Chris@16 500 /////////////////////////////////////////////////////////////////////////
Chris@16 501 // ptr_multiset_adapter
Chris@16 502 /////////////////////////////////////////////////////////////////////////
Chris@16 503
Chris@16 504 template
Chris@16 505 <
Chris@16 506 class Key,
Chris@16 507 class VoidPtrMultiSet,
Chris@16 508 class CloneAllocator = heap_clone_allocator,
Chris@16 509 bool Ordered = true
Chris@16 510 >
Chris@16 511 class ptr_multiset_adapter :
Chris@16 512 public ptr_container_detail::ptr_set_adapter_base<Key,VoidPtrMultiSet,CloneAllocator,Ordered>
Chris@16 513 {
Chris@16 514 typedef ptr_container_detail::ptr_set_adapter_base<Key,VoidPtrMultiSet,CloneAllocator,Ordered> base_type;
Chris@16 515
Chris@16 516 public: // typedefs
Chris@16 517
Chris@16 518 typedef BOOST_DEDUCED_TYPENAME base_type::iterator
Chris@16 519 iterator;
Chris@16 520 typedef BOOST_DEDUCED_TYPENAME base_type::size_type
Chris@16 521 size_type;
Chris@16 522 typedef Key key_type;
Chris@16 523 typedef BOOST_DEDUCED_TYPENAME base_type::auto_type
Chris@16 524 auto_type;
Chris@16 525 typedef BOOST_DEDUCED_TYPENAME VoidPtrMultiSet::allocator_type
Chris@16 526 allocator_type;
Chris@16 527 private:
Chris@16 528 template< typename II >
Chris@16 529 void set_basic_clone_and_insert( II first, II last ) // basic
Chris@16 530 {
Chris@16 531 while( first != last )
Chris@16 532 {
Chris@16 533 insert( CloneAllocator::allocate_clone( *first ) ); // strong, commit
Chris@16 534 ++first;
Chris@16 535 }
Chris@16 536 }
Chris@16 537
Chris@16 538 public:
Chris@16 539 ptr_multiset_adapter()
Chris@16 540 { }
Chris@16 541
Chris@16 542 template< class SizeType >
Chris@16 543 ptr_multiset_adapter( SizeType n,
Chris@16 544 ptr_container_detail::unordered_associative_container_tag tag )
Chris@16 545 : base_type( n, tag )
Chris@16 546 { }
Chris@16 547
Chris@16 548 template< class Comp >
Chris@16 549 explicit ptr_multiset_adapter( const Comp& comp,
Chris@16 550 const allocator_type& a )
Chris@16 551 : base_type( comp, a )
Chris@16 552 { }
Chris@16 553
Chris@16 554 template< class Hash, class Pred, class Allocator >
Chris@16 555 ptr_multiset_adapter( const Hash& hash,
Chris@16 556 const Pred& pred,
Chris@16 557 const Allocator& a )
Chris@16 558 : base_type( hash, pred, a )
Chris@16 559 { }
Chris@16 560
Chris@16 561 template< class InputIterator >
Chris@16 562 ptr_multiset_adapter( InputIterator first, InputIterator last )
Chris@16 563 : base_type( first, last )
Chris@16 564 { }
Chris@16 565
Chris@16 566 template< class InputIterator, class Comp >
Chris@16 567 ptr_multiset_adapter( InputIterator first, InputIterator last,
Chris@16 568 const Comp& comp,
Chris@16 569 const allocator_type& a = allocator_type() )
Chris@16 570 : base_type( comp, a )
Chris@16 571 {
Chris@16 572 set_basic_clone_and_insert( first, last );
Chris@16 573 }
Chris@16 574
Chris@16 575 template< class InputIterator, class Hash, class Pred, class Allocator >
Chris@16 576 ptr_multiset_adapter( InputIterator first, InputIterator last,
Chris@16 577 const Hash& hash,
Chris@16 578 const Pred& pred,
Chris@16 579 const Allocator& a )
Chris@16 580 : base_type( first, last, hash, pred, a )
Chris@16 581 { }
Chris@16 582
Chris@16 583 template< class U, class Set, class CA, bool b >
Chris@16 584 explicit ptr_multiset_adapter( const ptr_multiset_adapter<U,Set,CA,b>& r )
Chris@16 585 : base_type( r )
Chris@16 586 { }
Chris@16 587
Chris@16 588 template< class PtrContainer >
Chris@16 589 explicit ptr_multiset_adapter( std::auto_ptr<PtrContainer> clone )
Chris@16 590 : base_type( clone )
Chris@16 591 { }
Chris@16 592
Chris@16 593 template< class U, class Set, class CA, bool b >
Chris@16 594 ptr_multiset_adapter& operator=( const ptr_multiset_adapter<U,Set,CA,b>& r )
Chris@16 595 {
Chris@16 596 base_type::operator=( r );
Chris@16 597 return *this;
Chris@16 598 }
Chris@16 599
Chris@16 600 template< class T >
Chris@16 601 void operator=( std::auto_ptr<T> r )
Chris@16 602 {
Chris@16 603 base_type::operator=( r );
Chris@16 604 }
Chris@16 605
Chris@16 606 iterator insert( iterator before, key_type* x ) // strong
Chris@16 607 {
Chris@16 608 return base_type::insert( before, x );
Chris@16 609 }
Chris@16 610
Chris@16 611 template< class U >
Chris@16 612 iterator insert( iterator before, std::auto_ptr<U> x )
Chris@16 613 {
Chris@16 614 return insert( before, x.release() );
Chris@16 615 }
Chris@16 616
Chris@16 617 iterator insert( key_type* x ) // strong
Chris@16 618 {
Chris@16 619 this->enforce_null_policy( x, "Null pointer in 'ptr_multiset::insert()'" );
Chris@16 620
Chris@16 621 auto_type ptr( x );
Chris@16 622 BOOST_DEDUCED_TYPENAME base_type::ptr_iterator
Chris@16 623 res = this->base().insert( x );
Chris@16 624 ptr.release();
Chris@16 625 return iterator( res );
Chris@16 626 }
Chris@16 627
Chris@16 628 template< class U >
Chris@16 629 iterator insert( std::auto_ptr<U> x )
Chris@16 630 {
Chris@16 631 return insert( x.release() );
Chris@16 632 }
Chris@16 633
Chris@16 634 template< typename InputIterator >
Chris@16 635 void insert( InputIterator first, InputIterator last ) // basic
Chris@16 636 {
Chris@16 637 set_basic_clone_and_insert( first, last );
Chris@16 638 }
Chris@16 639
Chris@16 640 #if defined(BOOST_NO_SFINAE) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
Chris@16 641 #else
Chris@16 642
Chris@16 643 template< class Range >
Chris@16 644 BOOST_DEDUCED_TYPENAME
Chris@16 645 boost::disable_if< ptr_container_detail::is_pointer_or_integral<Range> >::type
Chris@16 646 insert( const Range& r )
Chris@16 647 {
Chris@16 648 insert( boost::begin(r), boost::end(r) );
Chris@16 649 }
Chris@16 650
Chris@16 651 #endif
Chris@16 652
Chris@16 653 template< class PtrSetAdapter >
Chris@16 654 void transfer( BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator object,
Chris@16 655 PtrSetAdapter& from ) // strong
Chris@16 656 {
Chris@16 657 this->multi_transfer( object, from );
Chris@16 658 }
Chris@16 659
Chris@16 660 template< class PtrSetAdapter >
Chris@16 661 size_type transfer( BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator first,
Chris@16 662 BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator last,
Chris@16 663 PtrSetAdapter& from ) // basic
Chris@16 664 {
Chris@16 665 return this->multi_transfer( first, last, from );
Chris@16 666 }
Chris@16 667
Chris@16 668 #if defined(BOOST_NO_SFINAE) || defined(BOOST_NO_FUNCTION_TEMPLATE_ORDERING)
Chris@16 669 #else
Chris@16 670
Chris@16 671 template< class PtrSetAdapter, class Range >
Chris@16 672 BOOST_DEDUCED_TYPENAME boost::disable_if< boost::is_same< Range,
Chris@16 673 BOOST_DEDUCED_TYPENAME PtrSetAdapter::iterator >, size_type >::type
Chris@16 674 transfer( const Range& r, PtrSetAdapter& from ) // basic
Chris@16 675 {
Chris@16 676 return transfer( boost::begin(r), boost::end(r), from );
Chris@16 677 }
Chris@16 678
Chris@16 679 #endif
Chris@16 680
Chris@16 681 template< class PtrSetAdapter >
Chris@16 682 void transfer( PtrSetAdapter& from ) // basic
Chris@16 683 {
Chris@16 684 transfer( from.begin(), from.end(), from );
Chris@16 685 BOOST_ASSERT( from.empty() );
Chris@16 686 }
Chris@16 687
Chris@16 688 };
Chris@16 689
Chris@16 690 } // namespace 'boost'
Chris@16 691
Chris@16 692 #endif