OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:count_equal
(Results
1 - 4
of
4
) sorted by null
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.search/
search_pred.pass.cpp
22
struct
count_equal
struct
30
unsigned
count_equal
::count = 0;
38
count_equal
::count = 0;
39
assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia),
count_equal
()) == Iter1(ia));
40
assert(
count_equal
::count <= 0);
41
count_equal
::count = 0;
42
assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1),
count_equal
()) == Iter1(ia));
43
assert(
count_equal
::count <= sa);
44
count_equal
::count = 0;
45
assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2),
count_equal
()) == Iter1(ia+1))
[
all
...]
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find.end/
find_end_pred.pass.cpp
23
struct
count_equal
struct
31
unsigned
count_equal
::count = 0;
40
count_equal
::count = 0;
41
assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1),
count_equal
()) == Iter1(ia+sa-1));
42
assert(
count_equal
::count <= 1*(sa-1+1));
44
count_equal
::count = 0;
45
assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2),
count_equal
()) == Iter1(ia+18));
46
assert(
count_equal
::count <= 2*(sa-2+1));
48
count_equal
::count = 0;
49
assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3),
count_equal
()) == Iter1(ia+15))
[
all
...]
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.unique/
unique_pred.pass.cpp
26
struct
count_equal
struct
34
unsigned
count_equal
::count = 0;
42
count_equal
::count = 0;
43
Iter r = std::unique(Iter(ia), Iter(ia+sa),
count_equal
());
46
assert(
count_equal
::count == sa-1);
50
count_equal
::count = 0;
51
r = std::unique(Iter(ib), Iter(ib+sb),
count_equal
());
55
assert(
count_equal
::count == sb-1);
59
count_equal
::count = 0;
60
r = std::unique(Iter(ic), Iter(ic+sc),
count_equal
());
[
all
...]