int main(int, char**) {
typedef std::unordered_map<int, std::string> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c;
+ c.insert(std::make_pair(42, std::string()));
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);
int main(int, char**) {
typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
min_allocator<std::pair<const int, std::string>>> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c({{42, std::string()}});
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);
int main(int, char**) {
typedef std::unordered_multimap<int, std::string> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c;
+ c.insert(std::make_pair(42, std::string()));
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);
int main(int, char**) {
typedef std::unordered_multimap<int, std::string, std::hash<int>, std::equal_to<int>,
min_allocator<std::pair<const int, std::string>>> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c({{1, std::string()}});
+ c.insert(std::make_pair(42, std::string()));
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);
int main(int, char**) {
typedef int T;
typedef std::unordered_multiset<T> C;
- C c(1);
+ C c;
+ c.insert(42);
C::iterator i = c.begin();
+ assert(i != c.end());
++i;
assert(i == c.end());
++i;
int main(int, char**) {
typedef int T;
typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
- C c(1);
+ C c({42});
C::iterator i = c.begin();
+ assert(i != c.end());
++i;
assert(i == c.end());
++i;
int main(int, char**) {
typedef int T;
typedef std::unordered_multiset<T> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c;
+ c.insert(42);
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);
int main(int, char**) {
typedef int T;
typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c({42});
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);
int main(int, char**) {
typedef int T;
typedef std::unordered_set<T> C;
- C c(1);
+ C c;
+ c.insert(42);
C::iterator i = c.begin();
+ assert(i != c.end());
++i;
assert(i == c.end());
++i;
int main(int, char**) {
typedef int T;
typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
- C c(1);
+ C c({42});
C::iterator i = c.begin();
+ assert(i != c.end());
++i;
assert(i == c.end());
++i;
int main(int, char**) {
typedef int T;
typedef std::unordered_set<T> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c;
+ c.insert(42);
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);
int main(int, char**) {
typedef int T;
typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
- C c(1);
- C::local_iterator i = c.begin(0);
+ C c({42});
+ C::size_type b = c.bucket(42);
+ C::local_iterator i = c.begin(b);
+ assert(i != c.end(b));
++i;
+ assert(i == c.end(b));
++i;
assert(false);