/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.modifiers/ |
H A D | pop_front.pass.cpp | 30 assert(distance(c.begin(), c.end()) == 1); 33 assert(distance(c.begin(), c.end()) == 0); 43 assert(distance(c.begin(), c.end()) == 1); 46 assert(distance(c.begin(), c.end()) == 0); 56 assert(distance(c.begin(), c.end()) == 1); 59 assert(distance(c.begin(), c.end()) == 0); 68 assert(distance(c.begin(), c.end()) == 1); 71 assert(distance(c.begin(), c.end()) == 0);
|
/external/libcxx/test/std/containers/sequences/list/list.capacity/ |
H A D | resize_size.pass.cpp | 25 assert(std::distance(l.begin(), l.end()) == 2); 32 assert(std::distance(l.begin(), l.end()) == 10); 41 assert(std::distance(l.begin(), l.end()) == 5); 47 assert(std::distance(l.begin(), l.end()) == 20); 55 assert(std::distance(l.begin(), l.end()) == 2); 62 assert(std::distance(l.begin(), l.end()) == 10); 71 assert(std::distance(l.begin(), l.end()) == 5); 77 assert(std::distance(l.begin(), l.end()) == 20);
|
/external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
H A D | insert_iter_iter_iter.pass.cpp | 28 typename List::iterator i = l1.insert(l1.begin(), a1, a1+3); 29 assert(i == l1.begin()); 31 assert(distance(l1.begin(), l1.end()) == 3); 32 i = l1.begin(); 42 assert(distance(l1.begin(), l1.end()) == 6); 43 i = l1.begin(); 69 assert(distance(l1.begin(), l1.end()) == 6); 70 i = l1.begin();
|
/external/pdfium/fpdfsdk/ |
H A D | cpdfsdk_annotiteration.h | 24 const_iterator begin() const { return m_List.begin(); } function in class:CPDFSDK_AnnotIteration
|
/external/ply/ply/test/ |
H A D | lex_state1.py | 25 t.lexer.begin('comment') 31 t.lexer.begin('INITIAL')
|
H A D | lex_state2.py | 25 t.lexer.begin('comment') 31 t.lexer.begin('INITIAL')
|
H A D | lex_state3.py | 27 t.lexer.begin('comment') 33 t.lexer.begin('INITIAL')
|
H A D | lex_state4.py | 26 t.lexer.begin('comment') 32 t.lexer.begin('INITIAL')
|
H A D | lex_state5.py | 26 t.lexer.begin('comment') 32 t.lexer.begin('INITIAL')
|
H A D | lex_state_noerror.py | 25 t.lexer.begin('comment') 31 t.lexer.begin('INITIAL')
|
H A D | lex_state_norule.py | 26 t.lexer.begin('comment') 32 t.lexer.begin('INITIAL')
|
/external/skia/experimental/sksg/ |
H A D | SkSGInvalidationController.h | 31 const SkRect* begin() const { return fRects.begin(); } function in class:sksg::InvalidationController
|
/external/skqp/experimental/sksg/ |
H A D | SkSGInvalidationController.h | 31 const SkRect* begin() const { return fRects.begin(); } function in class:sksg::InvalidationController
|
/external/tensorflow/tensorflow/core/lib/strings/ |
H A D | strcat.cc | 94 char *const begin = &*result.begin(); local 95 char *out = Append2(begin, a, b); 96 DCHECK_EQ(out, begin + result.size()); 103 char *const begin = &*result.begin(); local 104 char *out = Append2(begin, a, b); 106 DCHECK_EQ(out, begin + result.size()); 115 char *const begin = &*result.begin(); local 130 char *const begin = &*result.begin(); local 157 char *const begin = &*result->begin(); local 179 char *const begin = &*result->begin(); local 192 char *const begin = &*result->begin(); local 207 char *const begin = &*result->begin(); local [all...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
H A D | partition_copy.pass.cpp | 36 auto p = std::partition_copy(std::begin(ia), std::end(ia), 37 std::begin(r1), std::begin(r2), is_odd()); 39 return std::all_of(std::begin(r1), p.first, is_odd()) 41 && std::none_of(std::begin(r2), p.second, is_odd()) 54 P p = std::partition_copy(input_iterator<const int*>(std::begin(ia)),
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
H A D | stable_sort_comp.pass.cpp | 64 std::shuffle(v.begin() + i, v.begin() + i + M, randomness); 66 std::stable_sort(v.begin(), v.end(), first_only()); 67 assert(std::is_sorted(v.begin(), v.end())); 79 std::stable_sort(v.begin(), v.end(), indirect_less()); 80 assert(std::is_sorted(v.begin(), v.end(), indirect_less()));
|
/external/libcxx/test/std/containers/associative/map/map.access/ |
H A D | size.pass.cpp | 33 m.erase(m.begin()); 35 m.erase(m.begin()); 37 m.erase(m.begin()); 51 m.erase(m.begin()); 53 m.erase(m.begin()); 55 m.erase(m.begin());
|
/external/libcxx/test/std/containers/associative/multimap/ |
H A D | size.pass.cpp | 33 m.erase(m.begin()); 35 m.erase(m.begin()); 37 m.erase(m.begin()); 51 m.erase(m.begin()); 53 m.erase(m.begin()); 55 m.erase(m.begin());
|
/external/libcxx/test/std/containers/associative/multiset/ |
H A D | size.pass.cpp | 33 m.erase(m.begin()); 35 m.erase(m.begin()); 37 m.erase(m.begin()); 51 m.erase(m.begin()); 53 m.erase(m.begin()); 55 m.erase(m.begin());
|
/external/libcxx/test/std/containers/associative/set/ |
H A D | size.pass.cpp | 33 m.erase(m.begin()); 35 m.erase(m.begin()); 37 m.erase(m.begin()); 51 m.erase(m.begin()); 53 m.erase(m.begin()); 55 m.erase(m.begin());
|
/external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
H A D | size.pass.cpp | 35 c.erase(c.begin()); 37 c.erase(c.begin()); 39 c.erase(c.begin()); 54 c.erase(c.begin()); 56 c.erase(c.begin()); 58 c.erase(c.begin());
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
H A D | range.pass.cpp | 29 C c(I(std::begin(t)), I(std::end(t))); 31 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 33 assert(n == std::end(t) - std::begin(t)); 41 C c(I(std::begin(t)), I(std::end(t))); 43 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 45 assert(n == std::end(t) - std::begin(t));
|
H A D | range_alloc.pass.cpp | 32 C c(I(std::begin(t)), I(std::end(t)), A(13)); 34 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 36 assert(n == std::end(t) - std::begin(t)); 46 C c(I(std::begin(t)), I(std::end(t)), A()); 48 for (C::const_iterator i = c.begin(), e = c.end(); i != e; ++i, ++n) 50 assert(n == std::end(t) - std::begin(t));
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | merge.pass.cpp | 28 C c1(std::begin(t1), std::end(t1)); 29 C c2(std::begin(t2), std::end(t2)); 31 C c3(std::begin(t3), std::end(t3)); 41 C c1(std::begin(t1), std::end(t1)); 42 C c2(std::begin(t2), std::end(t2)); 44 C c3(std::begin(t3), std::end(t3));
|
H A D | merge_pred.pass.cpp | 29 C c1(std::begin(t1), std::end(t1)); 30 C c2(std::begin(t2), std::end(t2)); 32 C c3(std::begin(t3), std::end(t3)); 42 C c1(std::begin(t1), std::end(t1)); 43 C c2(std::begin(t2), std::end(t2)); 45 C c3(std::begin(t3), std::end(t3));
|