HomeSort by relevance Sort by last modified time
    Searched full:begin (Results 51 - 75 of 10864) sorted by null

1 23 4 5 6 7 8 91011>>

  /frameworks/opt/vcard/tests/res/raw/
v21_org_before_title.vcf 0 BEGIN:VCARD
v21_sip.vcf 0 BEGIN:VCARD
v21_title_before_org.vcf 0 BEGIN:VCARD
v30_pager.vcf 0 BEGIN:VCARD
v30_sip.vcf 0 BEGIN:VCARD
v40_sort_as.vcf 0 BEGIN:VCARD
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.modifiers/
erase_iter_iter.pass.cpp 40 assert(i == m.begin());
41 assert(m.begin()->first == 1);
42 assert(m.begin()->second == 1.5);
43 assert(next(m.begin())->first == 2);
44 assert(next(m.begin())->second == 2.5);
45 assert(next(m.begin(), 2)->first == 3);
46 assert(next(m.begin(), 2)->second == 3.5);
47 assert(next(m.begin(), 3)->first == 4);
48 assert(next(m.begin(), 3)->second == 4.5);
49 assert(next(m.begin(), 4)->first == 5)
    [all...]
emplace_hint.pass.cpp 32 assert(r == m.begin());
34 assert(m.begin()->first == 0);
35 assert(m.begin()->second == DefaultOnly());
38 assert(r == next(m.begin()));
40 assert(next(m.begin())->first == 1);
41 assert(next(m.begin())->second == DefaultOnly());
44 assert(r == next(m.begin()));
46 assert(next(m.begin())->first == 1);
47 assert(next(m.begin())->second == DefaultOnly());
56 assert(r == m.begin());
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multimap/multimap.modifiers/
erase_iter_iter.pass.cpp 40 assert(i == m.begin());
41 assert(m.begin()->first == 1);
42 assert(m.begin()->second == 1.5);
43 assert(next(m.begin())->first == 2);
44 assert(next(m.begin())->second == 2.5);
45 assert(next(m.begin(), 2)->first == 3);
46 assert(next(m.begin(), 2)->second == 3.5);
47 assert(next(m.begin(), 3)->first == 4);
48 assert(next(m.begin(), 3)->second == 4.5);
49 assert(next(m.begin(), 4)->first == 5)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/set/
erase_key.pass.cpp 41 assert(*next(m.begin(), 0) == 1);
42 assert(*next(m.begin(), 1) == 2);
43 assert(*next(m.begin(), 2) == 3);
44 assert(*next(m.begin(), 3) == 4);
45 assert(*next(m.begin(), 4) == 5);
46 assert(*next(m.begin(), 5) == 6);
47 assert(*next(m.begin(), 6) == 7);
48 assert(*next(m.begin(), 7) == 8);
53 assert(*next(m.begin(), 0) == 1);
54 assert(*next(m.begin(), 1) == 2)
    [all...]
erase_iter.pass.cpp 40 assert(i == next(m.begin(), 3));
41 assert(*next(m.begin(), 0) == 1);
42 assert(*next(m.begin(), 1) == 2);
43 assert(*next(m.begin(), 2) == 3);
44 assert(*next(m.begin(), 3) == 5);
45 assert(*next(m.begin(), 4) == 6);
46 assert(*next(m.begin(), 5) == 7);
47 assert(*next(m.begin(), 6) == 8);
51 assert(i == m.begin());
52 assert(*next(m.begin(), 0) == 2)
    [all...]
lower_bound.pass.cpp 39 assert(r == m.begin());
41 assert(r == next(m.begin()));
43 assert(r == next(m.begin(), 2));
45 assert(r == next(m.begin(), 3));
47 assert(r == next(m.begin(), 4));
49 assert(r == next(m.begin(), 5));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 7));
55 assert(r == next(m.begin(), 0));
57 assert(r == next(m.begin(), 1))
    [all...]
upper_bound.pass.cpp 39 assert(r == next(m.begin(), 1));
41 assert(r == next(m.begin(), 2));
43 assert(r == next(m.begin(), 3));
45 assert(r == next(m.begin(), 4));
47 assert(r == next(m.begin(), 5));
49 assert(r == next(m.begin(), 6));
51 assert(r == next(m.begin(), 7));
53 assert(r == next(m.begin(), 8));
55 assert(r == next(m.begin(), 0));
57 assert(r == next(m.begin(), 1))
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_relops_cont.h 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_relops_cont.h 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_relops_cont.h 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_relops_cont.h 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_relops_cont.h 10 equal(__x.begin(), __x.end(), __y.begin());
17 return lexicographical_compare(__x.begin(), __x.end(),
18 __y.begin(), __y.end());
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/
splice_pos_list.pass.cpp 26 assert(distance(l1.begin(), l1.end()) == 0);
28 assert(distance(l2.begin(), l2.end()) == 0);
35 assert(distance(l1.begin(), l1.end()) == 1);
37 assert(distance(l2.begin(), l2.end()) == 0);
38 std::list<int>::const_iterator i = l1.begin();
46 assert(distance(l1.begin(), l1.end()) == 2);
48 assert(distance(l2.begin(), l2.end()) == 0);
49 std::list<int>::const_iterator i = l1.begin();
59 assert(distance(l1.begin(), l1.end()) == 3);
61 assert(distance(l2.begin(), l2.end()) == 0)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/multiset/
erase_iter.pass.cpp 40 assert(i == next(m.begin(), 3));
41 assert(*next(m.begin(), 0) == 1);
42 assert(*next(m.begin(), 1) == 2);
43 assert(*next(m.begin(), 2) == 3);
44 assert(*next(m.begin(), 3) == 5);
45 assert(*next(m.begin(), 4) == 6);
46 assert(*next(m.begin(), 5) == 7);
47 assert(*next(m.begin(), 6) == 8);
51 assert(i == m.begin());
52 assert(*next(m.begin(), 0) == 2)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/map/map.ops/
lower_bound.pass.cpp 39 assert(r == m.begin());
41 assert(r == next(m.begin()));
43 assert(r == next(m.begin(), 2));
45 assert(r == next(m.begin(), 3));
47 assert(r == next(m.begin(), 4));
49 assert(r == next(m.begin(), 5));
51 assert(r == next(m.begin(), 6));
53 assert(r == next(m.begin(), 7));
55 assert(r == next(m.begin(), 0));
57 assert(r == next(m.begin(), 1))
    [all...]
upper_bound.pass.cpp 39 assert(r == next(m.begin(), 1));
41 assert(r == next(m.begin(), 2));
43 assert(r == next(m.begin(), 3));
45 assert(r == next(m.begin(), 4));
47 assert(r == next(m.begin(), 5));
49 assert(r == next(m.begin(), 6));
51 assert(r == next(m.begin(), 7));
53 assert(r == next(m.begin(), 8));
55 assert(r == next(m.begin(), 0));
57 assert(r == next(m.begin(), 1))
    [all...]
  /external/libpng/contrib/visupng/
VisualPng.rc 31 BEGIN
36 BEGIN
42 BEGIN
56 BEGIN
58 BEGIN
68 BEGIN
72 BEGIN
84 BEGIN
110 BEGIN
127 BEGIN
    [all...]
  /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin10/4.2.1/include/
emmintrin.h 53 /* APPLE LOCAL begin nodebug inline 4152603 */
57 /* APPLE LOCAL begin radar 5618945 */
66 /* APPLE LOCAL begin radar 4152603 */
68 /* APPLE LOCAL begin radar 5618945 */
77 /* APPLE LOCAL begin radar 5618945 */
85 /* APPLE LOCAL begin radar 5618945 */
94 /* APPLE LOCAL begin radar 5618945 */
103 /* APPLE LOCAL begin radar 5618945 */
112 /* APPLE LOCAL begin radar 5618945 */
121 /* APPLE LOCAL begin radar 5618945 *
    [all...]
  /prebuilts/gcc/darwin-x86/host/i686-apple-darwin-4.2.1/lib/gcc/i686-apple-darwin11/4.2.1/include/
emmintrin.h 53 /* APPLE LOCAL begin nodebug inline 4152603 */
57 /* APPLE LOCAL begin radar 5618945 */
66 /* APPLE LOCAL begin radar 4152603 */
68 /* APPLE LOCAL begin radar 5618945 */
77 /* APPLE LOCAL begin radar 5618945 */
85 /* APPLE LOCAL begin radar 5618945 */
94 /* APPLE LOCAL begin radar 5618945 */
103 /* APPLE LOCAL begin radar 5618945 */
112 /* APPLE LOCAL begin radar 5618945 */
121 /* APPLE LOCAL begin radar 5618945 *
    [all...]

Completed in 676 milliseconds

1 23 4 5 6 7 8 91011>>