mirror of
https://github.com/Gericom/teak-llvm.git
synced 2025-06-19 11:35:51 -04:00
cc89063bff
LLVM uses .h as its extension for header files.
Files renamed using:
for f in libcxx/test/support/*.hpp; do git mv $f ${f%.hpp}.h; done
References to the files updated using:
for f in $(git diff master | grep 'rename from' | cut -f 3 -d ' '); do
a=$(basename $f);
echo $a;
rg -l $a libcxx | xargs sed -i '' "s/$a/${a%.hpp}.h/";
done
HPP include guards updated manually using:
for f in $(git diff master | grep 'rename from' | cut -f 3 -d ' '); do
echo ${f%.hpp}.h ;
done | xargs mvim
Differential Revision: https://reviews.llvm.org/D66104
llvm-svn: 369481
173 lines
3.6 KiB
C++
173 lines
3.6 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <set>
|
|
|
|
// class set
|
|
|
|
// size_type count(const key_type& k) const;
|
|
|
|
#include <set>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
#include "min_allocator.h"
|
|
#include "private_constructor.h"
|
|
|
|
int main(int, char**)
|
|
{
|
|
{
|
|
typedef int V;
|
|
typedef std::set<int> M;
|
|
typedef M::size_type R;
|
|
V ar[] =
|
|
{
|
|
5,
|
|
6,
|
|
7,
|
|
8,
|
|
9,
|
|
10,
|
|
11,
|
|
12
|
|
};
|
|
const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.count(5);
|
|
assert(r == 1);
|
|
r = m.count(6);
|
|
assert(r == 1);
|
|
r = m.count(7);
|
|
assert(r == 1);
|
|
r = m.count(8);
|
|
assert(r == 1);
|
|
r = m.count(9);
|
|
assert(r == 1);
|
|
r = m.count(10);
|
|
assert(r == 1);
|
|
r = m.count(11);
|
|
assert(r == 1);
|
|
r = m.count(12);
|
|
assert(r == 1);
|
|
r = m.count(4);
|
|
assert(r == 0);
|
|
}
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
typedef int V;
|
|
typedef std::set<int, std::less<int>, min_allocator<int>> M;
|
|
typedef M::size_type R;
|
|
V ar[] =
|
|
{
|
|
5,
|
|
6,
|
|
7,
|
|
8,
|
|
9,
|
|
10,
|
|
11,
|
|
12
|
|
};
|
|
const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.count(5);
|
|
assert(r == 1);
|
|
r = m.count(6);
|
|
assert(r == 1);
|
|
r = m.count(7);
|
|
assert(r == 1);
|
|
r = m.count(8);
|
|
assert(r == 1);
|
|
r = m.count(9);
|
|
assert(r == 1);
|
|
r = m.count(10);
|
|
assert(r == 1);
|
|
r = m.count(11);
|
|
assert(r == 1);
|
|
r = m.count(12);
|
|
assert(r == 1);
|
|
r = m.count(4);
|
|
assert(r == 0);
|
|
}
|
|
#endif
|
|
#if TEST_STD_VER > 11
|
|
{
|
|
typedef int V;
|
|
typedef std::set<int, std::less<>> M;
|
|
typedef M::size_type R;
|
|
V ar[] =
|
|
{
|
|
5,
|
|
6,
|
|
7,
|
|
8,
|
|
9,
|
|
10,
|
|
11,
|
|
12
|
|
};
|
|
const M m(ar, ar+sizeof(ar)/sizeof(ar[0]));
|
|
R r = m.count(5);
|
|
assert(r == 1);
|
|
r = m.count(6);
|
|
assert(r == 1);
|
|
r = m.count(7);
|
|
assert(r == 1);
|
|
r = m.count(8);
|
|
assert(r == 1);
|
|
r = m.count(9);
|
|
assert(r == 1);
|
|
r = m.count(10);
|
|
assert(r == 1);
|
|
r = m.count(11);
|
|
assert(r == 1);
|
|
r = m.count(12);
|
|
assert(r == 1);
|
|
r = m.count(4);
|
|
assert(r == 0);
|
|
}
|
|
{
|
|
typedef PrivateConstructor V;
|
|
typedef std::set<V, std::less<>> M;
|
|
typedef M::size_type R;
|
|
|
|
M m;
|
|
m.insert ( V::make ( 5 ));
|
|
m.insert ( V::make ( 6 ));
|
|
m.insert ( V::make ( 7 ));
|
|
m.insert ( V::make ( 8 ));
|
|
m.insert ( V::make ( 9 ));
|
|
m.insert ( V::make ( 10 ));
|
|
m.insert ( V::make ( 11 ));
|
|
m.insert ( V::make ( 12 ));
|
|
|
|
const M& mc = m;
|
|
|
|
R r = mc.count(5);
|
|
assert(r == 1);
|
|
r = mc.count(6);
|
|
assert(r == 1);
|
|
r = mc.count(7);
|
|
assert(r == 1);
|
|
r = mc.count(8);
|
|
assert(r == 1);
|
|
r = mc.count(9);
|
|
assert(r == 1);
|
|
r = mc.count(10);
|
|
assert(r == 1);
|
|
r = mc.count(11);
|
|
assert(r == 1);
|
|
r = mc.count(12);
|
|
assert(r == 1);
|
|
r = mc.count(4);
|
|
assert(r == 0);
|
|
}
|
|
#endif
|
|
|
|
|
|
return 0;
|
|
}
|