{
typedef std::unordered_map<int, std::string> C;
C c;
- C::size_type i = c.bucket(3);
+ (void) c.bucket(3);
assert(false);
}
#endif
{
typedef std::unordered_map<int, std::string> C;
C c;
- C::size_type i = c.bucket_size(3);
+ (void) c.bucket_size(3);
assert(false);
}
#endif
{
typedef std::unordered_multimap<int, std::string> C;
C c;
- C::size_type i = c.bucket(3);
+ (void) c.bucket(3);
assert(false);
}
#endif
{
typedef std::unordered_multimap<int, std::string> C;
C c;
- C::size_type i = c.bucket_size(3);
+ (void) c.bucket_size(3);
assert(false);
}
#endif
{
typedef std::unordered_multiset<int> C;
C c;
- C::size_type i = c.bucket(3);
+ (void) c.bucket(3);
assert(false);
}
#endif
{
typedef std::unordered_multiset<int> C;
C c;
- C::size_type i = c.bucket_size(3);
+ (void) c.bucket_size(3);
assert(false);
}
#endif
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_multiset<T, min_allocator<T>> C;
+ typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
C c(1);
C::iterator i = c.begin();
++i;
typedef std::unordered_multiset<T> C;
C c(1);
C::iterator i = c.end();
- T j = *i;
+ (void) *i;
assert(false);
}
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_multiset<T, min_allocator<T>> C;
+ typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
C c(1);
C::iterator i = c.end();
- T j = *i;
+ (void) *i;
assert(false);
}
#endif
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_multiset<T, min_allocator<T>> C;
+ 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);
++i;
typedef std::unordered_multiset<T> C;
C c(1);
C::local_iterator i = c.end(0);
- T j = *i;
+ (void) *i;
assert(false);
}
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_multiset<T, min_allocator<T>> C;
+ typedef std::unordered_multiset<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
C c(1);
C::local_iterator i = c.end(0);
- T j = *i;
+ (void) *i;
assert(false);
}
#endif
{
typedef std::unordered_set<int> C;
C c;
- C::size_type i = c.bucket(3);
+ (void) c.bucket(3);
assert(false);
}
#endif
{
typedef std::unordered_set<int> C;
C c;
- C::size_type i = c.bucket_size(3);
+ (void) c.bucket_size(3);
assert(false);
}
#endif
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_set<T, min_allocator<T>> C;
+ typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
C c(1);
C::iterator i = c.begin();
++i;
typedef std::unordered_set<T> C;
C c(1);
C::iterator i = c.end();
- T j = *i;
+ (void) *i;
assert(false);
}
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_set<T, min_allocator<T>> C;
+ typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
C c(1);
C::iterator i = c.end();
- T j = *i;
+ (void) *i;
assert(false);
}
#endif
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_set<T, min_allocator<T>> C;
+ 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);
++i;
typedef std::unordered_set<T> C;
C c(1);
C::local_iterator i = c.end(0);
- T j = *i;
+ (void) *i;
+
assert(false);
}
#if TEST_STD_VER >= 11
{
typedef int T;
- typedef std::unordered_set<T, min_allocator<T>> C;
+ typedef std::unordered_set<T, std::hash<T>, std::equal_to<T>, min_allocator<T>> C;
C c(1);
C::local_iterator i = c.end(0);
- T j = *i;
+ (void) *i;
assert(false);
}
#endif
typedef std::unordered_set<Emplaceable> C;
typedef C::iterator R;
C c;
- C::const_iterator e = c.end();
- R r = c.emplace_hint(e);
+ R r = c.emplace_hint(c.end());
assert(c.size() == 1);
assert(*r == Emplaceable());
- r = c.emplace_hint(e, Emplaceable(5, 6));
+ r = c.emplace_hint(c.end(), Emplaceable(5, 6));
assert(c.size() == 2);
assert(*r == Emplaceable(5, 6));
std::equal_to<Emplaceable>, min_allocator<Emplaceable>> C;
typedef C::iterator R;
C c;
- C::const_iterator e = c.end();
- R r = c.emplace_hint(e);
+ R r = c.emplace_hint(c.end());
assert(c.size() == 1);
assert(*r == Emplaceable());
- r = c.emplace_hint(e, Emplaceable(5, 6));
+ r = c.emplace_hint(c.end(), Emplaceable(5, 6));
assert(c.size() == 2);
assert(*r == Emplaceable(5, 6));
typedef C::iterator R;
typedef double P;
C c;
- C::const_iterator e = c.end();
- R r = c.insert(e, P(3.5));
+ R r = c.insert(c.end(), P(3.5));
assert(c.size() == 1);
assert(*r == 3.5);
assert(c.size() == 1);
assert(*r == 3.5);
- r = c.insert(e, P(4.5));
+ r = c.insert(c.end(), P(4.5));
assert(c.size() == 2);
assert(*r == 4.5);
- r = c.insert(e, P(5.5));
+ r = c.insert(c.end(), P(5.5));
assert(c.size() == 3);
assert(*r == 5.5);
}
typedef C::iterator R;
typedef MoveOnly P;
C c;
- C::const_iterator e = c.end();
- R r = c.insert(e, P(3));
+ R r = c.insert(c.end(), P(3));
assert(c.size() == 1);
assert(*r == 3);
assert(c.size() == 1);
assert(*r == 3);
- r = c.insert(e, P(4));
+ r = c.insert(c.end(), P(4));
assert(c.size() == 2);
assert(*r == 4);
- r = c.insert(e, P(5));
+ r = c.insert(c.end(), P(5));
assert(c.size() == 3);
assert(*r == 5);
}
typedef C::iterator R;
typedef double P;
C c;
- C::const_iterator e = c.end();
- R r = c.insert(e, P(3.5));
+ R r = c.insert(c.end(), P(3.5));
assert(c.size() == 1);
assert(*r == 3.5);
assert(c.size() == 1);
assert(*r == 3.5);
- r = c.insert(e, P(4.5));
+ r = c.insert(c.end(), P(4.5));
assert(c.size() == 2);
assert(*r == 4.5);
- r = c.insert(e, P(5.5));
+ r = c.insert(c.end(), P(5.5));
assert(c.size() == 3);
assert(*r == 5.5);
}
typedef C::iterator R;
typedef MoveOnly P;
C c;
- C::const_iterator e = c.end();
- R r = c.insert(e, P(3));
+ R r = c.insert(c.end(), P(3));
assert(c.size() == 1);
assert(*r == 3);
assert(c.size() == 1);
assert(*r == 3);
- r = c.insert(e, P(4));
+ r = c.insert(c.end(), P(4));
assert(c.size() == 2);
assert(*r == 4);
- r = c.insert(e, P(5));
+ r = c.insert(c.end(), P(5));
assert(c.size() == 3);
assert(*r == 5);
}