diff --git a/doc/intro.qbk b/doc/intro.qbk
index 6e4b4ce1..ea06bfb7 100644
--- a/doc/intro.qbk
+++ b/doc/intro.qbk
@@ -9,7 +9,7 @@
[@http://www.boost.org/doc/html/boost_tr1.html
Boost.TR1]]
[def __draft__
- [@http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2008/n2691.pdf
+ [@http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2009/n2960.pdf
Working Draft of the C++ Standard]]
[def __hash-table__ [@http://en.wikipedia.org/wiki/Hash_table
hash table]]
diff --git a/doc/rationale.qbk b/doc/rationale.qbk
index 62774a66..ff371386 100644
--- a/doc/rationale.qbk
+++ b/doc/rationale.qbk
@@ -5,12 +5,6 @@
[def __wang__
[@http://www.concentric.net/~Ttwang/tech/inthash.htm
Thomas Wang's article on integer hash functions]]
-[def __n2345__
- [@http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2007/n2345.pdf
- N2345, 'Placement Insert for Containers']]
-[def __n2369__
- [@http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2007/n2369.pdf
- the August 2007 version of the working draft standard]]
[section:rationale Implementation Rationale]
@@ -99,105 +93,49 @@ So, this implementation uses a prime number for the hash table size.
[h2 Equality operators]
`operator==` and `operator!=` are not included in the standard, but I've
-added them as I think they could be useful and can be efficiently
-implemented. They are specified
-differently to the standard associative containers, comparing keys
-using the equality predicate rather than `operator==`. This is inconsistent
-with the other containers but it is probably closer to user's expectations.
+added them as I think they could be useful and can be implemented
+fairly efficiently. They are specified differently to the other standard
+containers, comparing keys using the equality predicate rather than
+`operator==`.
+
+It's also different to the proposal
+[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2944.pdf n2944].
+which uses the equality operators for the whole of `value_type`. This
+implementation just uses the key equality function for the key,
+and `mapped_type`'s equality operator in `unordered_map` and
+`unordered_multimap` for the mapped part of the element.
+
+Also, in `unordered_multimap`, the mapped values for a group of elements with
+equivalent keys are only considered equal if they are in the same order,
+in n2944 they just need to be a permutation of each other. Since the
+order of elements with equal keys is now defined to be stable, it seems to me
+that their order can be considered part of the container's value.
[h2 Active Issues and Proposals]
-[h3 Removing unused allocator functions]
+[h3 C++0x allocators]
-In
-[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2257.html
-N2257, removing unused allocator functions],
-Matt Austern suggests removing the `construct`, `destroy` and `address` member
-functions - all of which Boost.Unordered calls. Changing this will simplify the
-implementation, as well as make supporting `emplace` easier, but means that the
-containers won't support allocators which require these methods to be called.
-Detlef Vollmann opposed this change in
-[@http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2007/n2339.htm N2339].
+Recent drafts have included an overhaul of the allocators, but this was
+dependent on concepts which are no longer in the standard.
+[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2009/n2946.pdf n2946]
+attempts to respecify them without concepts. I'll try to implement this (or
+an appropriate later version) in a future version of boost, possibly changed
+a little to accomodate non-C++0x compilers.
[h3 Swapping containers with unequal allocators]
It isn't clear how to swap containers when their allocators aren't equal.
This is
[@http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#431
-Issue 431: Swapping containers with unequal allocators].
-
-Howard Hinnant wrote about this in
-[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2004/n1599.html N1599]
-and suggested swapping both the allocators and the containers' contents.
-But the committee have now decided that `swap` should do a fast swap if the
-allocator is Swappable and a slow swap using copy construction otherwise. To
-make this distinction requires concepts.
-
-In
-[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2387.pdf
-N2387, Omnibus Allocator Fix-up Proposals],
-Pablo Halpern suggests that there are actually two distinct allocator models,
-"Moves with Value" and "Scoped" which behave differently:
-
-[:
-When allocators are allowed to have state, it is necessary to have a model for
-determining from where an object obtains its allocator. We’ve identified two such
-models: the “Moves with Value” allocator model and the “Scoped” allocator model.
-
-In the “Moves with Value” allocator model, the copy constructor of an allocator-aware
-class will copy both the value and the allocator from its argument. This is the model
-specified in the C++03 standard. With this model, inserting an object into a container
-usually causes the new container item to copy the allocator from the object that was
-inserted. This model can be useful in special circumstances, e.g., if the items within a
-container use an allocator that is specially tuned to the item’s type.
-
-In the “Scoped” allocator model, the allocator used to construct an object is determined
-by the context of that object, much like a storage class. With this model, inserting an
-object into a container causes the new container item to use the same allocator as the
-container. To avoid allocators being used in the wrong context, the allocator is never
-copied during copy or move construction. Thus, it is possible using this model to use
-allocators based on short-lived resources without fear that an object will transfer its
-allocator to a copy that might outlive the (shared) allocator resource. This model is
-reasonably safe and generally useful on a large scale. There was strong support in the
-2005 Tremblant meeting for pursuing an allocator model that propagates allocators
-from container to contained objects.
-]
-
-With these models the choice becomes clearer:
-
-[:
-I introduced the “Moves with Value” allocator model and the
-“Scoped” allocator model. In the former case, the allocator is copied when the container
-is copy-constructed. In the latter case it is not. Swapping the allocators is the right thing
-to do if the containers conform to the “Moves with Value” allocator model and
-absolutely the wrong thing to do if the containers conform to the “Scoped” allocator
-model. With the two allocator models well-defined, the desired behavior becomes clear.
-]
-
-The proposal is that allocators are swapped if the allocator follows the
-"Moves with Value" model and the allocator is swappable. Otherwise a slow swap
-is used. Since containers currently only support the "Moves with Value" model
-this is consistent with the committee's current recommendation (although it
-suggests using a trait to detect if the allocator is swappable rather than a
-concept).
-
-Since there is currently neither have a swappable trait or concept for
-allocators this implementation always performs a slow swap.
+Issue 431: Swapping containers with unequal allocators]. This has been resolved
+with the new allocator specification, so this should be fixed when
+support is added.
[h3 Are insert and erase stable for unordered_multiset and unordered_multimap?]
-It is not specified if `unordered_multiset` and `unordered_multimap` preserve the order
+It wan't specified if `unordered_multiset` and `unordered_multimap` preserve the order
of elements with equivalent keys (i.e. if they're stable under `insert` and `erase`).
-This is [@http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-active.html#518 issue 581].
-The current proposal is that insert, erase and rehash are stable - so they are here.
-(Update: during the release of this version, this requirement was added to
-[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf
-the lastest working draft]).
-
-[h3 const_local_iterator cbegin, cend missing from TR1]
-
-[@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2684.html#691
-Issue 691] is that `cbegin` and `cend` are missing for local iterators.
-The current resolution is that they'll be added, so I've added them.
+Since [@http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2691.pdf
+n2691] it's been specified that they do and this implementation follows that.
[endsect]
diff --git a/doc/ref.xml b/doc/ref.xml
index 67a2179b..4ca51abf 100644
--- a/doc/ref.xml
+++ b/doc/ref.xml
@@ -23,8 +23,10 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
An unordered associative container that stores unique values.
- For the normative reference see chapter 23 of
- the working draft of the C++ standard [n2691].
+ Based on chapter 23 of
+ the working draft of the C++ standard [n2960].
+ But without the updated rules for allocators.
+
Template Parameters
@@ -93,7 +95,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A constant iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
Convertible to const_iterator.
@@ -101,7 +103,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A constant iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
@@ -180,6 +182,26 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
+
+ value_type is copy constructible
+
+
+
+
+ unordered_set &&
+
+
+ The move constructor.
+
+
+ This is emulated on compilers without rvalue references.
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
@@ -201,6 +223,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
+ The destructor is applied to every element, and all memory is deallocated
+
@@ -210,6 +235,38 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_set)
+ in order to emulate move semantics.
+
+
+
+ value_type is copy constructible
+
+
+
+
+ unordered_set &&
+
+ unordered_set&
+
+ The move assignment operator.
+
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_set)
+ in order to emulate move semantics.
+
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
allocator_type
@@ -761,8 +818,10 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
An unordered associative container that stores values. The same key can be stored multiple times.
- For the normative reference see chapter 23 of
- the working draft of the C++ standard [n2691].
+ Based on chapter 23 of
+ the working draft of the C++ standard [n2960].
+ But without the updated rules for allocators.
+
Template Parameters
@@ -831,7 +890,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A constant iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
Convertible to const_iterator.
@@ -839,7 +898,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A constant iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
@@ -918,6 +977,26 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
+
+ value_type is copy constructible
+
+
+
+
+ unordered_multiset &&
+
+
+ The move constructor.
+
+
+ This is emulated on compilers without rvalue references.
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
@@ -939,6 +1018,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
+ The destructor is applied to every element, and all memory is deallocated
+
@@ -948,6 +1030,38 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_multiset)
+ in order to emulate move semantics.
+
+
+
+ value_type is copy constructible
+
+
+
+
+ unordered_multiset &&
+
+ unordered_multiset&
+
+ The move assignment operator.
+
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_multiset)
+ in order to emulate move semantics.
+
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
allocator_type
@@ -1503,8 +1617,10 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
An unordered associative container that associates unique keys with another value.
- For the normative reference see chapter 23 of
- the working draft of the C++ standard [n2691].
+ Based on chapter 23 of
+ the working draft of the C++ standard [n2960].
+ But without the updated rules for allocators.
+
Template Parameters
@@ -1579,7 +1695,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
Convertible to const_iterator.
@@ -1587,7 +1703,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A constant iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
@@ -1666,6 +1782,26 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
+
+ value_type is copy constructible
+
+
+
+
+ unordered_map &&
+
+
+ The move constructor.
+
+
+ This is emulated on compilers without rvalue references.
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
@@ -1687,6 +1823,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
+ The destructor is applied to every element, and all memory is deallocated
+
@@ -1696,6 +1835,38 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_map)
+ in order to emulate move semantics.
+
+
+
+ value_type is copy constructible
+
+
+
+
+ unordered_map &&
+
+ unordered_map&
+
+ The move assignment operator.
+
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_map)
+ in order to emulate move semantics.
+
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
allocator_type
@@ -2290,8 +2461,10 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
An unordered associative container that associates keys with another value. The same key can be stored multiple times.
- For the normative reference see chapter 23 of
- the working draft of the C++ standard [n2691].
+ Based on chapter 23 of
+ the working draft of the C++ standard [n2960].
+ But without the updated rules for allocators.
+
Template Parameters
@@ -2366,7 +2539,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
Convertible to const_iterator.
@@ -2374,7 +2547,7 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
implementation-defined
A constant iterator whose value type is value_type.
- Any iterator category except output iterator.
+ The iterator category is at least a forward iterator.
@@ -2453,6 +2626,26 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.
+
+ value_type is copy constructible
+
+
+
+
+ unordered_multimap &&
+
+
+ The move constructor.
+
+
+ This is emulated on compilers without rvalue references.
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
@@ -2474,6 +2667,9 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+
+ The destructor is applied to every element, and all memory is deallocated
+
@@ -2483,6 +2679,38 @@ file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_multimap)
+ in order to emulate move semantics.
+
+
+
+ value_type is copy constructible
+
+
+
+
+ unordered_multimap &&
+
+ unordered_multimap&
+
+ The move assignment operator.
+
+
+
+ On compilers without rvalue references, there is a single assignment
+ operator with the signature operator=(unordered_multimap)
+ in order to emulate move semantics.
+
+
+
+
+ value_type is move constructible.
+ (TODO: This is not actually required in this implementation).
+
+
allocator_type
diff --git a/include/boost/unordered/detail/extract_key.hpp b/include/boost/unordered/detail/extract_key.hpp
index cba889eb..d415d935 100644
--- a/include/boost/unordered/detail/extract_key.hpp
+++ b/include/boost/unordered/detail/extract_key.hpp
@@ -106,21 +106,6 @@ namespace unordered_detail {
{
return v.first;
}
-/*
- template
- static key_type const& extract(
- std::pair const& v)
- {
- return v.first;
- }
-
- template
- static key_type const& extract(
- std::pair const& v)
- {
- return v.first;
- }
-*/
#if defined(BOOST_UNORDERED_STD_FORWARD)
template
diff --git a/include/boost/unordered/detail/unique.hpp b/include/boost/unordered/detail/unique.hpp
index b4a5157c..552a1d51 100644
--- a/include/boost/unordered/detail/unique.hpp
+++ b/include/boost/unordered/detail/unique.hpp
@@ -324,10 +324,9 @@ namespace boost { namespace unordered_detail {
do {
// No side effects in this initial code
- // Note: can't use get_key as '*i' might not be value_type.
- // TODO: Check if std::pair has an appropriate constructor. If not
- // that might not be true.
- // TODO: Test this line better.
+ // Note: can't use get_key as '*i' might not be value_type - it could
+ // be a pair with first_types as key_type without const or a
+ // different second_type.
key_type const& k = extractor::extract(*i);
std::size_t hash_value = this->hash_function()(k);
bucket_ptr bucket = this->bucket_ptr_from_hash(hash_value);
diff --git a/include/boost/unordered/unordered_map.hpp b/include/boost/unordered/unordered_map.hpp
index f4c052f5..36b17f78 100644
--- a/include/boost/unordered/unordered_map.hpp
+++ b/include/boost/unordered/unordered_map.hpp
@@ -343,6 +343,13 @@ namespace boost
table_.insert_range(first, last);
}
+#if !defined(BOOST_NO_0X_HDR_INITIALIZER_LIST)
+ void insert(std::initializer_list list)
+ {
+ table_.insert_range(list.begin(), list.end());
+ }
+#endif
+
iterator erase(const_iterator position)
{
return iterator(table_.erase(get(position)));
@@ -837,6 +844,13 @@ namespace boost
table_.insert_range(first, last);
}
+#if !defined(BOOST_NO_0X_HDR_INITIALIZER_LIST)
+ void insert(std::initializer_list list)
+ {
+ table_.insert_range(list.begin(), list.end());
+ }
+#endif
+
iterator erase(const_iterator position)
{
return iterator(table_.erase(get(position)));
diff --git a/include/boost/unordered/unordered_set.hpp b/include/boost/unordered/unordered_set.hpp
index 2b147b28..82446025 100644
--- a/include/boost/unordered/unordered_set.hpp
+++ b/include/boost/unordered/unordered_set.hpp
@@ -337,6 +337,13 @@ namespace boost
table_.insert_range(first, last);
}
+#if !defined(BOOST_NO_0X_HDR_INITIALIZER_LIST)
+ void insert(std::initializer_list list)
+ {
+ table_.insert_range(list.begin(), list.end());
+ }
+#endif
+
iterator erase(const_iterator position)
{
return iterator(table_.erase(get(position)));
@@ -793,6 +800,13 @@ namespace boost
table_.insert_range(first, last);
}
+#if !defined(BOOST_NO_0X_HDR_INITIALIZER_LIST)
+ void insert(std::initializer_list list)
+ {
+ table_.insert_range(list.begin(), list.end());
+ }
+#endif
+
iterator erase(const_iterator position)
{
return iterator(table_.erase(get(position)));
diff --git a/test/exception/insert_exception_tests.cpp b/test/exception/insert_exception_tests.cpp
index acb47b48..cf7d04e0 100644
--- a/test/exception/insert_exception_tests.cpp
+++ b/test/exception/insert_exception_tests.cpp
@@ -31,7 +31,7 @@ struct insert_test_base : public test::exception_base
std::string scope(test::scope);
if(scope.find("hash::operator()") == std::string::npos)
- strong.test(x);
+ strong.test(x, test::exception::detail::tracker.count_allocations);
test::check_equivalent_keys(x);
}
};
@@ -47,7 +47,7 @@ struct emplace_test1 : public insert_test_base
for(BOOST_DEDUCED_TYPENAME test::random_values::const_iterator
it = this->values.begin(), end = this->values.end(); it != end; ++it)
{
- strong.store(x);
+ strong.store(x, test::exception::detail::tracker.count_allocations);
x.emplace(*it);
}
}
@@ -64,7 +64,7 @@ struct insert_test1 : public insert_test_base
for(BOOST_DEDUCED_TYPENAME test::random_values::const_iterator
it = this->values.begin(), end = this->values.end(); it != end; ++it)
{
- strong.store(x);
+ strong.store(x, test::exception::detail::tracker.count_allocations);
x.insert(*it);
}
}
@@ -79,7 +79,7 @@ struct insert_test2 : public insert_test_base
for(BOOST_DEDUCED_TYPENAME test::random_values::const_iterator
it = this->values.begin(), end = this->values.end(); it != end; ++it)
{
- strong.store(x);
+ strong.store(x, test::exception::detail::tracker.count_allocations);
x.insert(x.begin(), *it);
}
}
@@ -106,7 +106,7 @@ struct insert_test4 : public insert_test_base
for(BOOST_DEDUCED_TYPENAME test::random_values::const_iterator
it = this->values.begin(), end = this->values.end(); it != end; ++it)
{
- strong.store(x);
+ strong.store(x, test::exception::detail::tracker.count_allocations);
x.insert(it, boost::next(it));
}
}
@@ -144,7 +144,7 @@ struct insert_test_rehash1 : public insert_test_base
it = boost::next(this->values.begin(), x.size()), end = this->values.end();
it != end && count < 10; ++it, ++count)
{
- strong.store(x);
+ strong.store(x, test::exception::detail::tracker.count_allocations);
pos = x.insert(pos, *it);
}
@@ -167,7 +167,7 @@ struct insert_test_rehash2 : public insert_test_rehash1
it = boost::next(this->values.begin(), x.size()), end = this->values.end();
it != end && count < 10; ++it, ++count)
{
- strong.store(x);
+ strong.store(x, test::exception::detail::tracker.count_allocations);
x.insert(*it);
}
diff --git a/test/helpers/strong.hpp b/test/helpers/strong.hpp
index 4ffcca2b..a297fe07 100644
--- a/test/helpers/strong.hpp
+++ b/test/helpers/strong.hpp
@@ -20,18 +20,22 @@ namespace test
{
typedef test::list values_type;
values_type values_;
+ unsigned int allocations_;
public:
- void store(X const& x) {
+ void store(X const& x, unsigned int allocations = 0) {
DISABLE_EXCEPTIONS;
values_.clear();
values_.insert(x.cbegin(), x.cend());
+ allocations_ = allocations;
}
- void test(X const& x) const {
+ void test(X const& x, unsigned int allocations = 0) const {
if(!(x.size() == values_.size() &&
std::equal(x.cbegin(), x.cend(), values_.begin(),
test::equivalent)))
BOOST_ERROR("Strong exception safety failure.");
+ if(allocations != allocations_)
+ BOOST_ERROR("Strong exception failure: extra allocations.");
}
};
}
diff --git a/test/objects/test.hpp b/test/objects/test.hpp
index 63f7c91b..767dbb4a 100644
--- a/test/objects/test.hpp
+++ b/test/objects/test.hpp
@@ -93,6 +93,10 @@ namespace test
return x1.type_ != x2.type_;
}
};
+
+ std::size_t hash_value(test::object const& x) {
+ return hash()(x);
+ }
class less
{
diff --git a/test/unordered/insert_tests.cpp b/test/unordered/insert_tests.cpp
index 6a4f4d86..a277cbb7 100644
--- a/test/unordered/insert_tests.cpp
+++ b/test/unordered/insert_tests.cpp
@@ -313,10 +313,12 @@ void map_tests(X*, test::random_generator generator = test::default_generator)
test::check_equivalent_keys(x);
}
+// Some tests for when the range's value type doesn't match the container's value type.
+
template
-void associative_insert_range_test(X*, test::random_generator generator = test::default_generator)
+void map_insert_range_test1(X*, test::random_generator generator = test::default_generator)
{
- std::cerr<<"associative_insert_range_test\n";
+ std::cerr<<"map_insert_range_test1\n";
typedef test::list > list;
test::random_values v(1000, generator);
@@ -327,6 +329,20 @@ void associative_insert_range_test(X*, test::random_generator generator = test::
test::check_equivalent_keys(x);
}
+template
+void map_insert_range_test2(X*, test::random_generator generator = test::default_generator)
+{
+ std::cerr<<"map_insert_range_test2\n";
+
+ typedef test::list > list;
+ test::random_values > v(1000, generator);
+ list l(v.begin(), v.end());
+
+ X x; x.insert(l.begin(), l.end());
+
+ test::check_equivalent_keys(x);
+}
+
boost::unordered_set >* test_set;
boost::unordered_multiset >* test_multiset;
boost::unordered_map >* test_map;
@@ -367,11 +383,64 @@ UNORDERED_TEST(map_tests,
((default_generator)(generate_collisions))
)
-UNORDERED_TEST(associative_insert_range_test,
+UNORDERED_TEST(map_insert_range_test1,
((test_map)(test_multimap))
((default_generator)(generate_collisions))
)
+UNORDERED_TEST(map_insert_range_test2,
+ ((test_map)(test_multimap))
+ ((default_generator)(generate_collisions))
+)
+
+#if !defined(BOOST_NO_0X_HDR_INITIALIZER_LIST)
+
+UNORDERED_AUTO_TEST(insert_initializer_list_set)
+{
+ boost::unordered_set set;
+ set.insert({1,2,3,1});
+ BOOST_TEST_EQ(set.size(), 3u);
+ BOOST_TEST(set.find(1) != set.end());
+ BOOST_TEST(set.find(4) == set.end());
+}
+
+UNORDERED_AUTO_TEST(insert_initializer_list_multiset)
+{
+ boost::unordered_multiset multiset;
+ multiset.insert({});
+ BOOST_TEST(multiset.empty());
+ multiset.insert({"a"});
+ BOOST_TEST_EQ(multiset.size(), 1u);
+ BOOST_TEST(multiset.find("a") != multiset.end());
+ BOOST_TEST(multiset.find("b") == multiset.end());
+ multiset.insert({"a","b"});
+ BOOST_TEST(multiset.size() == 3);
+ BOOST_TEST_EQ(multiset.count("a"), 2u);
+ BOOST_TEST_EQ(multiset.count("b"), 1u);
+ BOOST_TEST_EQ(multiset.count("c"), 0u);
+}
+
+UNORDERED_AUTO_TEST(insert_initializer_list_map)
+{
+ boost::unordered_map map;
+ map.insert({});
+ BOOST_TEST(map.empty());
+ map.insert({{"a", "b"},{"a", "b"},{"d", ""}});
+ BOOST_TEST_EQ(map.size(), 2u);
+}
+
+UNORDERED_AUTO_TEST(insert_initializer_list_multimap)
+{
+ boost::unordered_multimap multimap;
+ multimap.insert({});
+ BOOST_TEST(multimap.empty());
+ multimap.insert({{"a", "b"},{"a", "b"},{"d", ""}});
+ BOOST_TEST_EQ(multimap.size(), 3u);
+ BOOST_TEST_EQ(multimap.count("a"), 2u);
+}
+
+#endif
+
}
RUN_TESTS()