boost/unordered/unordered_map.hpp

   1
   2 // Copyright (C) 2003-2004 Jeremy B. Maitin-Shepard.
   3 // Copyright (C) 2005-2009 Daniel James.
   4 // Distributed under the Boost Software License, Version 1.0. (See accompanying
   5 // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
   6
   7 //  See http://www.boost.org/libs/unordered for documentation
   8
   9 #ifndef BOOST_UNORDERED_UNORDERED_MAP_HPP_INCLUDED
  10 #define BOOST_UNORDERED_UNORDERED_MAP_HPP_INCLUDED
  11
  12 #if defined(_MSC_VER) && (_MSC_VER >= 1020)
  13 # pragma once
  14 #endif
  15
  16 #include <boost/unordered/unordered_map_fwd.hpp>
  17 #include <boost/functional/hash.hpp>
  18 #include <boost/unordered/detail/hash_table.hpp>
  19
  20 #if !defined(BOOST_HAS_RVALUE_REFS)
  21 #include <boost/unordered/detail/move.hpp>
  22 #endif
  23
  24 #if defined(BOOST_MSVC)
  25 #pragma warning(push)
  26 #if BOOST_MSVC >= 1400
  27 #pragma warning(disable:4396) //the inline specifier cannot be used when a
  28                               // friend declaration refers to a specialization
  29                               // of a function template
  30 #endif
  31 #endif
  32
  33 namespace boost
  34 {
  35     template <class Key, class T, class Hash, class Pred, class Alloc>
  36     class unordered_map
  37     {
  38         typedef boost::unordered_detail::hash_types_unique_keys<
  39             std::pair<const Key, T>, Key, Hash, Pred, Alloc
  40         > implementation;
  41
  42         BOOST_DEDUCED_TYPENAME implementation::hash_table base;
  43
  44     public:
  45
  46         // types
  47
  48         typedef Key key_type;
  49         typedef std::pair<const Key, T> value_type;
  50         typedef T mapped_type;
  51         typedef Hash hasher;
  52         typedef Pred key_equal;
  53
  54         typedef Alloc allocator_type;
  55         typedef BOOST_DEDUCED_TYPENAME allocator_type::pointer pointer;
  56         typedef BOOST_DEDUCED_TYPENAME allocator_type::const_pointer const_pointer;
  57         typedef BOOST_DEDUCED_TYPENAME allocator_type::reference reference;
  58         typedef BOOST_DEDUCED_TYPENAME allocator_type::const_reference const_reference;
  59
  60         typedef BOOST_DEDUCED_TYPENAME implementation::size_type size_type;
  61         typedef BOOST_DEDUCED_TYPENAME implementation::difference_type difference_type;
  62
  63         typedef BOOST_DEDUCED_TYPENAME implementation::iterator iterator;
  64         typedef BOOST_DEDUCED_TYPENAME implementation::const_iterator const_iterator;
  65         typedef BOOST_DEDUCED_TYPENAME implementation::local_iterator local_iterator;
  66         typedef BOOST_DEDUCED_TYPENAME implementation::const_local_iterator const_local_iterator;
  67
  68         // construct/destroy/copy
  69
  70         explicit unordered_map(
  71                 size_type n = boost::unordered_detail::default_initial_bucket_count,
  72                 const hasher &hf = hasher(),
  73                 const key_equal &eql = key_equal(),
  74                 const allocator_type &a = allocator_type())
  75             : base(n, hf, eql, a)
  76         {
  77         }
  78
  79         explicit unordered_map(allocator_type const& a)
  80             : base(boost::unordered_detail::default_initial_bucket_count,
  81                 hasher(), key_equal(), a)
  82         {
  83         }
  84
  85         unordered_map(unordered_map const& other, allocator_type const& a)
  86             : base(other.base, a)
  87         {
  88         }
  89
  90         template <class InputIterator>
  91         unordered_map(InputIterator f, InputIterator l)
  92             : base(f, l, boost::unordered_detail::default_initial_bucket_count,
  93                 hasher(), key_equal(), allocator_type())
  94         {
  95         }
  96
  97         template <class InputIterator>
  98         unordered_map(InputIterator f, InputIterator l,
  99                 size_type n,
 100                 const hasher &hf = hasher(),
 101                 const key_equal &eql = key_equal(),
 102                 const allocator_type &a = allocator_type())
 103             : base(f, l, n, hf, eql, a)
 104         {
 105         }
 106
 107 #if defined(BOOST_HAS_RVALUE_REFS)
 108         unordered_map(unordered_map&& other)
 109             : base(other.base, boost::unordered_detail::move_tag())
 110         {
 111         }
 112
 113         unordered_map(unordered_map&& other, allocator_type const& a)
 114             : base(other.base, a, boost::unordered_detail::move_tag())
 115         {
 116         }
 117
 118         unordered_map& operator=(unordered_map&& x)
 119         {
 120             base.move(x.base);
 121             return *this;
 122         }
 123 #else
 124         unordered_map(boost::unordered_detail::move_from<unordered_map<Key, T, Hash, Pred, Alloc> > other)
 125             : base(other.source.base, boost::unordered_detail::move_tag())
 126         {
 127         }
 128
 129 #if !BOOST_WORKAROUND(__BORLANDC__, < 0x0593)
 130         unordered_map& operator=(unordered_map x)
 131         {
 132             base.move(x.base);
 133             return *this;
 134         }
 135 #endif
 136 #endif
 137
 138 #if !defined(BOOST_NO_INITIALIZER_LISTS)
 139         unordered_map(std::initializer_list<value_type> list,
 140                 size_type n = boost::unordered_detail::default_initial_bucket_count,
 141                 const hasher &hf = hasher(),
 142                 const key_equal &eql = key_equal(),
 143                 const allocator_type &a = allocator_type())
 144             : base(list.begin(), list.end(), n, hf, eql, a)
 145         {
 146         }
 147
 148         unordered_map& operator=(std::initializer_list<value_type> list)
 149         {
 150             base.data_.clear();
 151             base.insert_range(list.begin(), list.end());
 152             return *this;
 153         }
 154 #endif
 155
 156     private:
 157
 158         BOOST_DEDUCED_TYPENAME implementation::iterator_base const&
 159             get(const_iterator const& it)
 160         {
 161             return boost::unordered_detail::iterator_access::get(it);
 162         }
 163
 164     public:
 165
 166         allocator_type get_allocator() const
 167         {
 168             return base.get_allocator();
 169         }
 170
 171         // size and capacity
 172
 173         bool empty() const
 174         {
 175             return base.empty();
 176         }
 177
 178         size_type size() const
 179         {
 180             return base.size();
 181         }
 182
 183         size_type max_size() const
 184         {
 185             return base.max_size();
 186         }
 187
 188         // iterators
 189
 190         iterator begin()
 191         {
 192             return iterator(base.data_.begin());
 193         }
 194
 195         const_iterator begin() const
 196         {
 197             return const_iterator(base.data_.begin());
 198         }
 199
 200         iterator end()
 201         {
 202             return iterator(base.data_.end());
 203         }
 204
 205         const_iterator end() const
 206         {
 207             return const_iterator(base.data_.end());
 208         }
 209
 210         const_iterator cbegin() const
 211         {
 212             return const_iterator(base.data_.begin());
 213         }
 214
 215         const_iterator cend() const
 216         {
 217             return const_iterator(base.data_.end());
 218         }
 219
 220         // modifiers
 221
 222 #if defined(BOOST_HAS_RVALUE_REFS) && defined(BOOST_HAS_VARIADIC_TMPL)
 223         template <class... Args>
 224         std::pair<iterator, bool> emplace(Args&&... args)
 225         {
 226             return boost::unordered_detail::pair_cast<iterator, bool>(
 227                 base.emplace(std::forward<Args>(args)...));
 228         }
 229
 230         template <class... Args>
 231         iterator emplace_hint(const_iterator hint, Args&&... args)
 232         {
 233             return iterator(base.emplace_hint(get(hint), std::forward<Args>(args)...));
 234         }
 235 #else
 236
 237         std::pair<iterator, bool> emplace(value_type const& v = value_type())
 238         {
 239             return boost::unordered_detail::pair_cast<iterator, bool>(
 240                 base.emplace(v));
 241         }
 242
 243         iterator emplace_hint(const_iterator hint, value_type const& v = value_type())
 244         {
 245             return iterator(base.emplace_hint(get(hint), v));
 246         }
 247
 248 #define BOOST_UNORDERED_EMPLACE(z, n, _)                                        \
 249             template <                                                          \
 250                 BOOST_UNORDERED_TEMPLATE_ARGS(z, n)                             \
 251             >                                                                   \
 252             std::pair<iterator, bool> emplace(                                  \
 253                 BOOST_UNORDERED_FUNCTION_PARAMS(z, n)                           \
 254             )                                                                   \
 255             {                                                                   \
 256                 return boost::unordered_detail::pair_cast<iterator, bool>(      \
 257                     base.emplace(                                               \
 258                         BOOST_UNORDERED_CALL_PARAMS(z, n)                       \
 259                     ));                                                         \
 260             }                                                                   \
 261                                                                                 \
 262             template <                                                          \
 263                 BOOST_UNORDERED_TEMPLATE_ARGS(z, n)                             \
 264             >                                                                   \
 265             iterator emplace_hint(const_iterator hint,                          \
 266                 BOOST_UNORDERED_FUNCTION_PARAMS(z, n)                           \
 267             )                                                                   \
 268             {                                                                   \
 269                 return iterator(base.emplace_hint(get(hint),                    \
 270                         BOOST_UNORDERED_CALL_PARAMS(z, n)                       \
 271                 ));                                                             \
 272             }
 273
 274         BOOST_PP_REPEAT_FROM_TO(1, BOOST_UNORDERED_EMPLACE_LIMIT,
 275             BOOST_UNORDERED_EMPLACE, _)
 276
 277 #undef BOOST_UNORDERED_EMPLACE
 278
 279 #endif
 280
 281         std::pair<iterator, bool> insert(const value_type& obj)
 282         {
 283             return boost::unordered_detail::pair_cast<iterator, bool>(
 284                     base.emplace(obj));
 285         }
 286
 287         iterator insert(const_iterator hint, const value_type& obj)
 288         {
 289             return iterator(base.emplace_hint(get(hint), obj));
 290         }
 291
 292         template <class InputIterator>
 293             void insert(InputIterator first, InputIterator last)
 294         {
 295             base.insert_range(first, last);
 296         }
 297
 298         iterator erase(const_iterator position)
 299         {
 300             return iterator(base.data_.erase(get(position)));
 301         }
 302
 303         size_type erase(const key_type& k)
 304         {
 305             return base.erase_key(k);
 306         }
 307
 308         iterator erase(const_iterator first, const_iterator last)
 309         {
 310             return iterator(base.data_.erase_range(get(first), get(last)));
 311         }
 312
 313         void clear()
 314         {
 315             base.data_.clear();
 316         }
 317
 318         void swap(unordered_map& other)
 319         {
 320             base.swap(other.base);
 321         }
 322
 323         // observers
 324
 325         hasher hash_function() const
 326         {
 327             return base.hash_function();
 328         }
 329
 330         key_equal key_eq() const
 331         {
 332             return base.key_eq();
 333         }
 334
 335         mapped_type& operator[](const key_type &k)
 336         {
 337             return base[k].second;
 338         }
 339
 340         mapped_type& at(const key_type& k)
 341         {
 342             return base.at(k).second;
 343         }
 344
 345         mapped_type const& at(const key_type& k) const
 346         {
 347             return base.at(k).second;
 348         }
 349
 350         // lookup
 351
 352         iterator find(const key_type& k)
 353         {
 354             return iterator(base.find(k));
 355         }
 356
 357         const_iterator find(const key_type& k) const
 358         {
 359             return const_iterator(base.find(k));
 360         }
 361
 362         size_type count(const key_type& k) const
 363         {
 364             return base.count(k);
 365         }
 366
 367         std::pair<iterator, iterator>
 368             equal_range(const key_type& k)
 369         {
 370             return boost::unordered_detail::pair_cast<iterator, iterator>(
 371                     base.equal_range(k));
 372         }
 373
 374         std::pair<const_iterator, const_iterator>
 375             equal_range(const key_type& k) const
 376         {
 377             return boost::unordered_detail::pair_cast<const_iterator, const_iterator>(
 378                     base.equal_range(k));
 379         }
 380
 381         // bucket interface
 382
 383         size_type bucket_count() const
 384         {
 385             return base.bucket_count();
 386         }
 387
 388         size_type max_bucket_count() const
 389         {
 390             return base.max_bucket_count();
 391         }
 392
 393         size_type bucket_size(size_type n) const
 394         {
 395             return base.data_.bucket_size(n);
 396         }
 397
 398         size_type bucket(const key_type& k) const
 399         {
 400             return base.bucket(k);
 401         }
 402
 403         local_iterator begin(size_type n)
 404         {
 405             return local_iterator(base.data_.begin(n));
 406         }
 407
 408         const_local_iterator begin(size_type n) const
 409         {
 410             return const_local_iterator(base.data_.begin(n));
 411         }
 412
 413         local_iterator end(size_type n)
 414         {
 415             return local_iterator(base.data_.end(n));
 416         }
 417
 418         const_local_iterator end(size_type n) const
 419         {
 420             return const_local_iterator(base.data_.end(n));
 421         }
 422
 423         const_local_iterator cbegin(size_type n) const
 424         {
 425             return const_local_iterator(base.data_.begin(n));
 426         }
 427
 428         const_local_iterator cend(size_type n) const
 429         {
 430             return const_local_iterator(base.data_.end(n));
 431         }
 432
 433         // hash policy
 434
 435         float load_factor() const
 436         {
 437             return base.load_factor();
 438         }
 439
 440         float max_load_factor() const
 441         {
 442             return base.max_load_factor();
 443         }
 444
 445         void max_load_factor(float m)
 446         {
 447             base.max_load_factor(m);
 448         }
 449
 450         void rehash(size_type n)
 451         {
 452             base.rehash(n);
 453         }
 454
 455 #if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
 456         friend bool operator==(unordered_map const&, unordered_map const&);
 457         friend bool operator!=(unordered_map const&, unordered_map const&);
 458 #else
 459         friend bool operator==<Key, T, Hash, Pred, Alloc>(unordered_map const&, unordered_map const&);
 460         friend bool operator!=<Key, T, Hash, Pred, Alloc>(unordered_map const&, unordered_map const&);
 461 #endif
 462     }; // class template unordered_map
 463
 464     template <class K, class T, class H, class P, class A>
 465     inline bool operator==(unordered_map<K, T, H, P, A> const& m1,
 466         unordered_map<K, T, H, P, A> const& m2)
 467     {
 468         return boost::unordered_detail::equals(m1.base, m2.base);
 469     }
 470
 471     template <class K, class T, class H, class P, class A>
 472     inline bool operator!=(unordered_map<K, T, H, P, A> const& m1,
 473         unordered_map<K, T, H, P, A> const& m2)
 474     {
 475         return !boost::unordered_detail::equals(m1.base, m2.base);
 476     }
 477
 478     template <class K, class T, class H, class P, class A>
 479     inline void swap(unordered_map<K, T, H, P, A> &m1,
 480             unordered_map<K, T, H, P, A> &m2)
 481     {
 482         m1.swap(m2);
 483     }
 484
 485     template <class Key, class T, class Hash, class Pred, class Alloc>
 486     class unordered_multimap
 487     {
 488         typedef boost::unordered_detail::hash_types_equivalent_keys<
 489             std::pair<const Key, T>, Key, Hash, Pred, Alloc
 490         > implementation;
 491
 492         BOOST_DEDUCED_TYPENAME implementation::hash_table base;
 493
 494         public:
 495
 496         // types
 497
 498         typedef Key key_type;
 499         typedef std::pair<const Key, T> value_type;
 500         typedef T mapped_type;
 501         typedef Hash hasher;
 502         typedef Pred key_equal;
 503
 504         typedef Alloc allocator_type;
 505         typedef BOOST_DEDUCED_TYPENAME allocator_type::pointer pointer;
 506         typedef BOOST_DEDUCED_TYPENAME allocator_type::const_pointer const_pointer;
 507         typedef BOOST_DEDUCED_TYPENAME allocator_type::reference reference;
 508         typedef BOOST_DEDUCED_TYPENAME allocator_type::const_reference const_reference;
 509
 510         typedef BOOST_DEDUCED_TYPENAME implementation::size_type size_type;
 511         typedef BOOST_DEDUCED_TYPENAME implementation::difference_type difference_type;
 512
 513         typedef BOOST_DEDUCED_TYPENAME implementation::iterator iterator;
 514         typedef BOOST_DEDUCED_TYPENAME implementation::const_iterator const_iterator;
 515         typedef BOOST_DEDUCED_TYPENAME implementation::local_iterator local_iterator;
 516         typedef BOOST_DEDUCED_TYPENAME implementation::const_local_iterator const_local_iterator;
 517
 518         // construct/destroy/copy
 519
 520         explicit unordered_multimap(
 521                 size_type n = boost::unordered_detail::default_initial_bucket_count,
 522                 const hasher &hf = hasher(),
 523                 const key_equal &eql = key_equal(),
 524                 const allocator_type &a = allocator_type())
 525           : base(n, hf, eql, a)
 526         {
 527         }
 528
 529         explicit unordered_multimap(allocator_type const& a)
 530             : base(boost::unordered_detail::default_initial_bucket_count,
 531                 hasher(), key_equal(), a)
 532         {
 533         }
 534
 535         unordered_multimap(unordered_multimap const& other, allocator_type const& a)
 536             : base(other.base, a)
 537         {
 538         }
 539
 540         template <class InputIterator>
 541         unordered_multimap(InputIterator f, InputIterator l)
 542             : base(f, l, boost::unordered_detail::default_initial_bucket_count,
 543                 hasher(), key_equal(), allocator_type())
 544         {
 545         }
 546
 547         template <class InputIterator>
 548         unordered_multimap(InputIterator f, InputIterator l,
 549                 size_type n,
 550                 const hasher &hf = hasher(),
 551                 const key_equal &eql = key_equal(),
 552                 const allocator_type &a = allocator_type())
 553           : base(f, l, n, hf, eql, a)
 554         {
 555         }
 556
 557 #if defined(BOOST_HAS_RVALUE_REFS)
 558         unordered_multimap(unordered_multimap&& other)
 559             : base(other.base, boost::unordered_detail::move_tag())
 560         {
 561         }
 562
 563         unordered_multimap(unordered_multimap&& other, allocator_type const& a)
 564             : base(other.base, a, boost::unordered_detail::move_tag())
 565         {
 566         }
 567
 568         unordered_multimap& operator=(unordered_multimap&& x)
 569         {
 570             base.move(x.base);
 571             return *this;
 572         }
 573 #else
 574         unordered_multimap(boost::unordered_detail::move_from<unordered_multimap<Key, T, Hash, Pred, Alloc> > other)
 575             : base(other.source.base, boost::unordered_detail::move_tag())
 576         {
 577         }
 578
 579 #if !BOOST_WORKAROUND(__BORLANDC__, < 0x0593)
 580         unordered_multimap& operator=(unordered_multimap x)
 581         {
 582             base.move(x.base);
 583             return *this;
 584         }
 585 #endif
 586 #endif
 587
 588 #if !defined(BOOST_NO_INITIALIZER_LISTS)
 589         unordered_multimap(std::initializer_list<value_type> list,
 590                 size_type n = boost::unordered_detail::default_initial_bucket_count,
 591                 const hasher &hf = hasher(),
 592                 const key_equal &eql = key_equal(),
 593                 const allocator_type &a = allocator_type())
 594             : base(list.begin(), list.end(), n, hf, eql, a)
 595         {
 596         }
 597
 598         unordered_multimap& operator=(std::initializer_list<value_type> list)
 599         {
 600             base.data_.clear();
 601             base.insert_range(list.begin(), list.end());
 602             return *this;
 603         }
 604 #endif
 605
 606
 607     private:
 608
 609         BOOST_DEDUCED_TYPENAME implementation::iterator_base const&
 610             get(const_iterator const& it)
 611         {
 612             return boost::unordered_detail::iterator_access::get(it);
 613         }
 614
 615     public:
 616
 617         allocator_type get_allocator() const
 618         {
 619             return base.get_allocator();
 620         }
 621
 622         // size and capacity
 623
 624         bool empty() const
 625         {
 626             return base.empty();
 627         }
 628
 629         size_type size() const
 630         {
 631             return base.size();
 632         }
 633
 634         size_type max_size() const
 635         {
 636             return base.max_size();
 637         }
 638
 639         // iterators
 640
 641         iterator begin()
 642         {
 643             return iterator(base.data_.begin());
 644         }
 645
 646         const_iterator begin() const
 647         {
 648             return const_iterator(base.data_.begin());
 649         }
 650
 651         iterator end()
 652         {
 653             return iterator(base.data_.end());
 654         }
 655
 656         const_iterator end() const
 657         {
 658             return const_iterator(base.data_.end());
 659         }
 660
 661         const_iterator cbegin() const
 662         {
 663             return const_iterator(base.data_.begin());
 664         }
 665
 666         const_iterator cend() const
 667         {
 668             return const_iterator(base.data_.end());
 669         }
 670
 671         // modifiers
 672
 673 #if defined(BOOST_HAS_RVALUE_REFS) && defined(BOOST_HAS_VARIADIC_TMPL)
 674         template <class... Args>
 675         iterator emplace(Args&&... args)
 676         {
 677             return iterator(base.emplace(std::forward<Args>(args)...));
 678         }
 679
 680         template <class... Args>
 681         iterator emplace_hint(const_iterator hint, Args&&... args)
 682         {
 683             return iterator(base.emplace_hint(get(hint), std::forward<Args>(args)...));
 684         }
 685 #else
 686
 687         iterator emplace(value_type const& v = value_type())
 688         {
 689             return iterator(base.emplace(v));
 690         }
 691
 692         iterator emplace_hint(const_iterator hint, value_type const& v = value_type())
 693         {
 694             return iterator(base.emplace_hint(get(hint), v));
 695         }
 696
 697
 698 #define BOOST_UNORDERED_EMPLACE(z, n, _)                                        \
 699             template <                                                          \
 700                 BOOST_UNORDERED_TEMPLATE_ARGS(z, n)                             \
 701             >                                                                   \
 702             iterator emplace(                                                   \
 703                 BOOST_UNORDERED_FUNCTION_PARAMS(z, n)                           \
 704             )                                                                   \
 705             {                                                                   \
 706                 return iterator(                                                \
 707                     base.emplace(                                               \
 708                         BOOST_UNORDERED_CALL_PARAMS(z, n)                       \
 709                     ));                                                         \
 710             }                                                                   \
 711                                                                                 \
 712             template <                                                          \
 713                 BOOST_UNORDERED_TEMPLATE_ARGS(z, n)                             \
 714             >                                                                   \
 715             iterator emplace_hint(const_iterator hint,                          \
 716                 BOOST_UNORDERED_FUNCTION_PARAMS(z, n)                           \
 717             )                                                                   \
 718             {                                                                   \
 719                 return iterator(base.emplace_hint(get(hint),                    \
 720                         BOOST_UNORDERED_CALL_PARAMS(z, n)                       \
 721                 ));                                                             \
 722             }
 723
 724         BOOST_PP_REPEAT_FROM_TO(1, BOOST_UNORDERED_EMPLACE_LIMIT,
 725             BOOST_UNORDERED_EMPLACE, _)
 726
 727 #undef BOOST_UNORDERED_EMPLACE
 728
 729 #endif
 730
 731         iterator insert(const value_type& obj)
 732         {
 733             return iterator(base.emplace(obj));
 734         }
 735
 736         iterator insert(const_iterator hint, const value_type& obj)
 737         {
 738             return iterator(base.emplace_hint(get(hint), obj));
 739         }
 740
 741         template <class InputIterator>
 742             void insert(InputIterator first, InputIterator last)
 743         {
 744             base.insert_range(first, last);
 745         }
 746
 747         iterator erase(const_iterator position)
 748         {
 749             return iterator(base.data_.erase(get(position)));
 750         }
 751
 752         size_type erase(const key_type& k)
 753         {
 754             return base.erase_key(k);
 755         }
 756
 757         iterator erase(const_iterator first, const_iterator last)
 758         {
 759             return iterator(base.data_.erase_range(get(first), get(last)));
 760         }
 761
 762         void clear()
 763         {
 764             base.data_.clear();
 765         }
 766
 767         void swap(unordered_multimap& other)
 768         {
 769             base.swap(other.base);
 770         }
 771
 772         // observers
 773
 774         hasher hash_function() const
 775         {
 776             return base.hash_function();
 777         }
 778
 779         key_equal key_eq() const
 780         {
 781             return base.key_eq();
 782         }
 783
 784         // lookup
 785
 786         iterator find(const key_type& k)
 787         {
 788             return iterator(base.find(k));
 789         }
 790
 791         const_iterator find(const key_type& k) const
 792         {
 793             return const_iterator(base.find(k));
 794         }
 795
 796         size_type count(const key_type& k) const
 797         {
 798             return base.count(k);
 799         }
 800
 801         std::pair<iterator, iterator>
 802             equal_range(const key_type& k)
 803         {
 804             return boost::unordered_detail::pair_cast<iterator, iterator>(
 805                     base.equal_range(k));
 806         }
 807
 808         std::pair<const_iterator, const_iterator>
 809             equal_range(const key_type& k) const
 810         {
 811             return boost::unordered_detail::pair_cast<const_iterator, const_iterator>(
 812                     base.equal_range(k));
 813         }
 814
 815         // bucket interface
 816
 817         size_type bucket_count() const
 818         {
 819             return base.bucket_count();
 820         }
 821
 822         size_type max_bucket_count() const
 823         {
 824             return base.max_bucket_count();
 825         }
 826
 827         size_type bucket_size(size_type n) const
 828         {
 829             return base.data_.bucket_size(n);
 830         }
 831
 832         size_type bucket(const key_type& k) const
 833         {
 834             return base.bucket(k);
 835         }
 836
 837         local_iterator begin(size_type n)
 838         {
 839             return local_iterator(base.data_.begin(n));
 840         }
 841
 842         const_local_iterator begin(size_type n) const
 843         {
 844             return const_local_iterator(base.data_.begin(n));
 845         }
 846
 847         local_iterator end(size_type n)
 848         {
 849             return local_iterator(base.data_.end(n));
 850         }
 851
 852         const_local_iterator end(size_type n) const
 853         {
 854             return const_local_iterator(base.data_.end(n));
 855         }
 856
 857         const_local_iterator cbegin(size_type n) const
 858         {
 859             return const_local_iterator(base.data_.begin(n));
 860         }
 861
 862         const_local_iterator cend(size_type n) const
 863         {
 864             return const_local_iterator(base.data_.end(n));
 865         }
 866
 867         // hash policy
 868
 869         float load_factor() const
 870         {
 871             return base.load_factor();
 872         }
 873
 874         float max_load_factor() const
 875         {
 876             return base.max_load_factor();
 877         }
 878
 879         void max_load_factor(float m)
 880         {
 881             base.max_load_factor(m);
 882         }
 883
 884         void rehash(size_type n)
 885         {
 886             base.rehash(n);
 887         }
 888
 889 #if BOOST_WORKAROUND(BOOST_MSVC, < 1300)
 890         friend bool operator==(unordered_multimap const&, unordered_multimap const&);
 891         friend bool operator!=(unordered_multimap const&, unordered_multimap const&);
 892 #else
 893         friend bool operator==<Key, T, Hash, Pred, Alloc>(unordered_multimap const&, unordered_multimap const&);
 894         friend bool operator!=<Key, T, Hash, Pred, Alloc>(unordered_multimap const&, unordered_multimap const&);
 895 #endif
 896     }; // class template unordered_multimap
 897
 898     template <class K, class T, class H, class P, class A>
 899     inline bool operator==(unordered_multimap<K, T, H, P, A> const& m1,
 900         unordered_multimap<K, T, H, P, A> const& m2)
 901     {
 902         return boost::unordered_detail::equals(m1.base, m2.base);
 903     }
 904
 905     template <class K, class T, class H, class P, class A>
 906     inline bool operator!=(unordered_multimap<K, T, H, P, A> const& m1,
 907         unordered_multimap<K, T, H, P, A> const& m2)
 908     {
 909         return !boost::unordered_detail::equals(m1.base, m2.base);
 910     }
 911
 912     template <class K, class T, class H, class P, class A>
 913     inline void swap(unordered_multimap<K, T, H, P, A> &m1,
 914             unordered_multimap<K, T, H, P, A> &m2)
 915     {
 916         m1.swap(m2);
 917     }
 918
 919 } // namespace boost
 920
 921 #if defined(BOOST_MSVC)
 922 #pragma warning(pop)
 923 #endif
 924
 925 #endif // BOOST_UNORDERED_UNORDERED_MAP_HPP_INCLUDED