feedc0de/boost_unordered
1
0
Fork 0
forked from boostorg/unordered
Code Pull Requests Activity

New version of the unordered containers. Includes workarounds for older

Browse Source 
compilers. Also follows the exception requirements closer.


[SVN r2875]
This commit is contained in:
Daniel James
2006-02-26 18:33:49 +00:00
parent 4c3417468b
commit ee93aad35a
4 changed files with 137 additions and 43 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
include/boost/unordered_set.hpp
View File

@@ -81,8 +81,14 @@ namespace boost
}
template <class InputIterator>
unordered_set(InputIterator f, InputIterator l,
size_type n = boost::unordered_detail::default_initial_bucket_count,
unordered_set(InputIterator f, InputIterator l)
: base(f, l, boost::unordered_detail::default_initial_bucket_count,
hasher(), key_equal(), allocator_type())
{
}
template <class InputIterator>
unordered_set(InputIterator f, InputIterator l, size_type n,
const hasher &hf = hasher(),
const key_equal &eql = key_equal(),
const allocator_type &a = allocator_type())
@@ -355,8 +361,14 @@ namespace boost
}
template <class InputIterator>
unordered_multiset(InputIterator f, InputIterator l,
size_type n = boost::unordered_detail::default_initial_bucket_count,
unordered_multiset(InputIterator f, InputIterator l)
: base(f, l, boost::unordered_detail::default_initial_bucket_count,
hasher(), key_equal(), allocator_type())
{
}
template <class InputIterator>
unordered_multiset(InputIterator f, InputIterator l, size_type n,
const hasher &hf = hasher(),
const key_equal &eql = key_equal(),
const allocator_type &a = allocator_type())