/external/libcxx/test/std/iterators/iterator.range/ |
begin-end.pass.cpp | 34 assert ( std::cbegin(c) != c.cend()); 35 assert ( std::cend(c) == c.cend()); 52 // initializer_list doesn't have cbegin/cend/rbegin/rend 55 // assert ( std::cbegin(c) != c.cend()); 56 // assert ( std::cend(c) == c.cend()); 74 assert ( std::cbegin(c) != c.cend()); 75 assert ( std::cend(c) == c.cend()); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/iterator.range/ |
begin-end.pass.cpp | 36 assert ( std::cbegin(c) != c.cend()); 37 assert ( std::cend(c) == c.cend()); 54 // initializer_list doesn't have cbegin/cend/rbegin/rend 57 // assert ( std::cbegin(c) != c.cend()); 58 // assert ( std::cend(c) == c.cend()); 76 assert ( std::cbegin(c) != c.cend()); 77 assert ( std::cend(c) == c.cend()); [all...] |
/external/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
insert_iter_rv.pass.cpp | 31 R r = m.insert(m.cend(), P(2, 2)); 37 r = m.insert(m.cend(), P(1, 1)); 43 r = m.insert(m.cend(), P(3, 3)); 49 r = m.insert(m.cend(), P(3, 2)); 61 R r = m.insert(m.cend(), P(2, 2)); 67 r = m.insert(m.cend(), P(1, 1)); 73 r = m.insert(m.cend(), P(3, 3)); 79 r = m.insert(m.cend(), P(3, 2));
|
/external/libcxx/test/std/containers/associative/multiset/ |
insert_iter_cv.pass.cpp | 27 R r = m.insert(m.cend(), M::value_type(2)); 32 r = m.insert(m.cend(), M::value_type(1)); 37 r = m.insert(m.cend(), M::value_type(3)); 42 r = m.insert(m.cend(), M::value_type(3)); 52 R r = m.insert(m.cend(), M::value_type(2)); 57 r = m.insert(m.cend(), M::value_type(1)); 62 r = m.insert(m.cend(), M::value_type(3)); 67 r = m.insert(m.cend(), M::value_type(3));
|
insert_iter_rv.pass.cpp | 29 R r = m.insert(m.cend(), M::value_type(2)); 34 r = m.insert(m.cend(), M::value_type(1)); 39 r = m.insert(m.cend(), M::value_type(3)); 44 r = m.insert(m.cend(), M::value_type(3)); 55 R r = m.insert(m.cend(), M::value_type(2)); 60 r = m.insert(m.cend(), M::value_type(1)); 65 r = m.insert(m.cend(), M::value_type(3)); 70 r = m.insert(m.cend(), M::value_type(3));
|
/external/libcxx/test/std/containers/associative/set/ |
insert_iter_cv.pass.cpp | 27 R r = m.insert(m.cend(), M::value_type(2)); 32 r = m.insert(m.cend(), M::value_type(1)); 37 r = m.insert(m.cend(), M::value_type(3)); 42 r = m.insert(m.cend(), M::value_type(3)); 52 R r = m.insert(m.cend(), M::value_type(2)); 57 r = m.insert(m.cend(), M::value_type(1)); 62 r = m.insert(m.cend(), M::value_type(3)); 67 r = m.insert(m.cend(), M::value_type(3));
|
insert_iter_rv.pass.cpp | 29 R r = m.insert(m.cend(), M::value_type(2)); 34 r = m.insert(m.cend(), M::value_type(1)); 39 r = m.insert(m.cend(), M::value_type(3)); 44 r = m.insert(m.cend(), M::value_type(3)); 54 R r = m.insert(m.cend(), M::value_type(2)); 59 r = m.insert(m.cend(), M::value_type(1)); 64 r = m.insert(m.cend(), M::value_type(3)); 69 r = m.insert(m.cend(), M::value_type(3));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
insert_iter_rv.pass.cpp | 31 R r = m.insert(m.cend(), P(2, 2)); 37 r = m.insert(m.cend(), P(1, 1)); 43 r = m.insert(m.cend(), P(3, 3)); 49 r = m.insert(m.cend(), P(3, 2)); 61 R r = m.insert(m.cend(), P(2, 2)); 67 r = m.insert(m.cend(), P(1, 1)); 73 r = m.insert(m.cend(), P(3, 3)); 79 r = m.insert(m.cend(), P(3, 2));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
insert_iter_cv.pass.cpp | 27 R r = m.insert(m.cend(), M::value_type(2)); 32 r = m.insert(m.cend(), M::value_type(1)); 37 r = m.insert(m.cend(), M::value_type(3)); 42 r = m.insert(m.cend(), M::value_type(3)); 52 R r = m.insert(m.cend(), M::value_type(2)); 57 r = m.insert(m.cend(), M::value_type(1)); 62 r = m.insert(m.cend(), M::value_type(3)); 67 r = m.insert(m.cend(), M::value_type(3));
|
insert_iter_rv.pass.cpp | 29 R r = m.insert(m.cend(), M::value_type(2)); 34 r = m.insert(m.cend(), M::value_type(1)); 39 r = m.insert(m.cend(), M::value_type(3)); 44 r = m.insert(m.cend(), M::value_type(3)); 55 R r = m.insert(m.cend(), M::value_type(2)); 60 r = m.insert(m.cend(), M::value_type(1)); 65 r = m.insert(m.cend(), M::value_type(3)); 70 r = m.insert(m.cend(), M::value_type(3));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
insert_iter_cv.pass.cpp | 27 R r = m.insert(m.cend(), M::value_type(2)); 32 r = m.insert(m.cend(), M::value_type(1)); 37 r = m.insert(m.cend(), M::value_type(3)); 42 r = m.insert(m.cend(), M::value_type(3)); 52 R r = m.insert(m.cend(), M::value_type(2)); 57 r = m.insert(m.cend(), M::value_type(1)); 62 r = m.insert(m.cend(), M::value_type(3)); 67 r = m.insert(m.cend(), M::value_type(3));
|
insert_iter_rv.pass.cpp | 29 R r = m.insert(m.cend(), M::value_type(2)); 34 r = m.insert(m.cend(), M::value_type(1)); 39 r = m.insert(m.cend(), M::value_type(3)); 44 r = m.insert(m.cend(), M::value_type(3)); 54 R r = m.insert(m.cend(), M::value_type(2)); 59 r = m.insert(m.cend(), M::value_type(1)); 64 r = m.insert(m.cend(), M::value_type(3)); 69 r = m.insert(m.cend(), M::value_type(3));
|
/external/v8/src/base/ |
iterator.h | 40 const_iterator cend() const { return end_; } function in class:v8::base::iterator_range 42 bool empty() const { return cbegin() == cend(); } 46 difference_type size() const { return cend() - cbegin(); }
|
/external/libcxx/test/std/containers/unord/unord.multiset/ |
local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const; 163 I j = c.cend(b); 168 j = c.cend(b); 176 j = c.cend(b); 184 j = c.cend(b); 190 j = c.cend(b); 196 j = c.cend(b); 201 j = c.cend(b); 221 I j = c.cend(b); 226 j = c.cend(b) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
local_iterators.pass.cpp | 21 // const_local_iterator cend (size_type n) const; 163 I j = c.cend(b); 168 j = c.cend(b); 176 j = c.cend(b); 184 j = c.cend(b); 190 j = c.cend(b); 196 j = c.cend(b); 201 j = c.cend(b); 221 I j = c.cend(b); 226 j = c.cend(b) [all...] |
/toolchain/binutils/binutils-2.25/libiberty/ |
fnmatch.c | 143 register unsigned char cstart = c, cend = c; local 146 cstart = cend = *p++; 148 cstart = cend = FOLD (cstart); 163 cend = *p++; 164 if (!(flags & FNM_NOESCAPE) && cend == '\\') 165 cend = *p++; 166 if (cend == '\0') 168 cend = FOLD (cend); 174 && FOLD ((unsigned char)*n) <= cend) [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.special/ |
copy.pass.cpp | 56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); 58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); 60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); 64 assert(std::copy(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end()); 66 assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end());
|
copy_backward.pass.cpp | 55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); 57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); 59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); 63 assert(std::copy_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin()); 65 assert(std::copy_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin());
|
move.pass.cpp | 55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); 57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); 59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); 63 assert(std::move(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end()); 65 assert(std::move(RACI(c2.cbegin()), RACI(c2.cend()), c1.begin()) == c1.end());
|
move_backward.pass.cpp | 55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); 57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); 59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); 63 assert(std::move_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin()); 65 assert(std::move_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
copy.pass.cpp | 56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); 58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); 60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); 64 assert(std::copy(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end()); 66 assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end());
|
copy_backward.pass.cpp | 55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); 57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); 59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::copy_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); 63 assert(std::copy_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin()); 65 assert(std::copy_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin());
|
move.pass.cpp | 55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); 57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); 59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); 63 assert(std::move(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end()); 65 assert(std::move(RACI(c2.cbegin()), RACI(c2.cend()), c1.begin()) == c1.end());
|
move_backward.pass.cpp | 55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); 57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); 59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 61 assert(std::move_backward(c2.cbegin(), c2.cend(), RAI(c1.end())) == RAI(c1.begin())); 63 assert(std::move_backward(RACI(c1.cbegin()), RACI(c1.cend()), c2.end()) == c2.begin()); 65 assert(std::move_backward(RACI(c2.cbegin()), RACI(c2.cend()), c1.end()) == c1.begin());
|
/external/libcxx/test/std/containers/unord/unord.multimap/ |
local_iterators.fail.cpp | 21 // const_local_iterator cend (size_type n) const; 175 I j = c.cend(b); 180 j = c.cend(b); 190 j = c.cend(b); 200 j = c.cend(b); 207 j = c.cend(b); 214 j = c.cend(b); 219 j = c.cend(b); 239 I j = c.cend(b); 244 j = c.cend(b) [all...] |