41 lines
1.0 KiB
C++
41 lines
1.0 KiB
C++
|
//===----------------------------------------------------------------------===//
|
|||
|
//
|
|||
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>The LLVM Compiler Infrastructure
|
|||
|
//
|
|||
|
// This file is distributed under the University of Illinois Open Source
|
|||
|
// License. See LICENSE.TXT for details.
|
|||
|
//
|
|||
|
//===----------------------------------------------------------------------===//
|
|||
|
|
|||
|
// <unordered_map>
|
|||
|
|
|||
|
// template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
|
|||
|
// class Alloc = allocator<pair<const Key, T>>>
|
|||
|
// class unordered_map
|
|||
|
|
|||
|
// void clear()
|
|||
|
|
|||
|
#include <unordered_map>
|
|||
|
#include <string>
|
|||
|
#include <cassert>
|
|||
|
|
|||
|
int main()
|
|||
|
{
|
|||
|
{
|
|||
|
typedef std::unordered_map<int, std::string> C;
|
|||
|
typedef std::pair<int, std::string> P;
|
|||
|
P a[] =
|
|||
|
{
|
|||
|
P(1, "one"),
|
|||
|
P(2, "two"),
|
|||
|
P(3, "three"),
|
|||
|
P(4, "four"),
|
|||
|
P(1, "four"),
|
|||
|
P(2, "four"),
|
|||
|
};
|
|||
|
C c(a, a + sizeof(a)/sizeof(a[0]));
|
|||
|
c.clear();
|
|||
|
assert(c.size() == 0);
|
|||
|
}
|
|||
|
}
|