f5256e16df
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@103516 91177308-0d34-0410-b5e6-96231b3b80d8
48 lines
1.1 KiB
C++
48 lines
1.1 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <set>
|
|
|
|
// class set
|
|
|
|
// template <class InputIterator>
|
|
// set(InputIterator first, InputIterator last, const value_compare& comp);
|
|
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "../../../iterators.h"
|
|
#include "../../../test_compare.h"
|
|
|
|
int main()
|
|
{
|
|
typedef int V;
|
|
V ar[] =
|
|
{
|
|
1,
|
|
1,
|
|
1,
|
|
2,
|
|
2,
|
|
2,
|
|
3,
|
|
3,
|
|
3
|
|
};
|
|
typedef test_compare<std::less<V> > C;
|
|
std::set<V, C> m(input_iterator<const V*>(ar),
|
|
input_iterator<const V*>(ar+sizeof(ar)/sizeof(ar[0])), C(5));
|
|
assert(m.value_comp() == C(5));
|
|
assert(m.size() == 3);
|
|
assert(distance(m.begin(), m.end()) == 3);
|
|
assert(*m.begin() == 1);
|
|
assert(*next(m.begin()) == 2);
|
|
assert(*next(m.begin(), 2) == 3);
|
|
}
|