libcxx initial import
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103490 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
64
test/containers/unord/unord.set/iterators.pass.cpp
Normal file
64
test/containers/unord/unord.set/iterators.pass.cpp
Normal file
@@ -0,0 +1,64 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// <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_set>
|
||||
|
||||
// template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
|
||||
// class Alloc = allocator<Value>>
|
||||
// class unordered_set
|
||||
|
||||
// iterator begin() {return __table_.begin();}
|
||||
// iterator end() {return __table_.end();}
|
||||
// const_iterator begin() const {return __table_.begin();}
|
||||
// const_iterator end() const {return __table_.end();}
|
||||
// const_iterator cbegin() const {return __table_.begin();}
|
||||
// const_iterator cend() const {return __table_.end();}
|
||||
|
||||
#include <unordered_set>
|
||||
#include <cassert>
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
typedef std::unordered_set<int> C;
|
||||
typedef int P;
|
||||
P a[] =
|
||||
{
|
||||
P(1),
|
||||
P(2),
|
||||
P(3),
|
||||
P(4),
|
||||
P(1),
|
||||
P(2)
|
||||
};
|
||||
C c(a, a + sizeof(a)/sizeof(a[0]));
|
||||
assert(c.bucket_count() >= 5);
|
||||
assert(c.size() == 4);
|
||||
assert(std::distance(c.begin(), c.end()) == c.size());
|
||||
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
||||
}
|
||||
{
|
||||
typedef std::unordered_set<int> C;
|
||||
typedef int P;
|
||||
P a[] =
|
||||
{
|
||||
P(1),
|
||||
P(2),
|
||||
P(3),
|
||||
P(4),
|
||||
P(1),
|
||||
P(2)
|
||||
};
|
||||
const C c(a, a + sizeof(a)/sizeof(a[0]));
|
||||
assert(c.bucket_count() >= 5);
|
||||
assert(c.size() == 4);
|
||||
assert(std::distance(c.begin(), c.end()) == c.size());
|
||||
assert(std::distance(c.cbegin(), c.cend()) == c.size());
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user