| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
| D | next_permutation.pass.cpp | 39 int prev[sa]; in test() local
46 std::copy(ia, ia+e, prev); in test()
51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); in test()
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); in test()
|
| D | prev_permutation.pass.cpp | 39 int prev[sa]; in test() local
46 std::copy(ia, ia+e, prev); in test()
51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); in test()
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); in test()
|
| D | next_permutation_comp.pass.cpp | 41 int prev[sa]; in test() local
48 std::copy(ia, ia+e, prev); in test()
53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); in test()
55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); in test()
|
| D | prev_permutation_comp.pass.cpp | 41 int prev[sa]; in test() local
48 std::copy(ia, ia+e, prev); in test()
53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); in test()
55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); in test()
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
| D | lazy_ostream.hpp | 66 lazy_ostream_impl( lazy_ostream const& prev, T value ) in lazy_ostream_impl() argument
68 , m_prev( prev ) in lazy_ostream_impl()
86 operator<<( lazy_ostream const& prev, T const& v ) in operator <<() argument
88 return lazy_ostream_impl<T const&>( prev, v ); in operator <<()
97 operator<<( lazy_ostream const& prev, R& (BOOST_TEST_CALL_DECL *man)(S&) ) in operator <<() argument
99 return lazy_ostream_impl<R& (BOOST_TEST_CALL_DECL *)(S&)>( prev, man ); in operator <<()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multimap/multimap.modifiers/ |
| D | insert_iter_cv.pass.cpp | 40 assert(r == prev(m.end())); in main()
45 r = m.insert(prev(m.end()), M::value_type(3, 4.5)); in main()
46 assert(r == prev(m.end(), 2)); in main()
69 assert(r == prev(m.end())); in main()
74 r = m.insert(prev(m.end()), M::value_type(3, 4.5)); in main()
75 assert(r == prev(m.end(), 2)); in main()
|
| D | insert_rv.pass.cpp | 43 assert(r == prev(m.end())); in main()
49 assert(r == prev(m.end())); in main()
72 assert(r == prev(m.end())); in main()
78 assert(r == prev(m.end())); in main()
|
| D | insert_cv.pass.cpp | 40 assert(r == prev(m.end())); in main()
46 assert(r == prev(m.end())); in main()
69 assert(r == prev(m.end())); in main()
75 assert(r == prev(m.end())); in main()
|
| D | insert_iter_rv.pass.cpp | 44 assert(r == prev(m.end())); in main()
50 assert(r == prev(m.end())); in main()
74 assert(r == prev(m.end())); in main()
80 assert(r == prev(m.end())); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/src/ |
| D | fallback_malloc.ipp | 87 heap_node *p, *prev;
95 for (p = freelist, prev = 0;
96 p && p != list_end; prev = p, p = node_from_offset ( p->next_node)) {
109 if (prev == 0)
112 prev->next_node = p->next_node;
125 struct heap_node *p, *prev;
133 for (p = freelist, prev = 0;
134 p && p != list_end; prev = p, p = node_from_offset (p->next_node)) {
154 if ( prev == 0 ) {
159 prev->next_node = offset_from_node(cp);
[all …]
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/numeric/conversion/ |
| D | converter_policies.hpp | 105 S prev = floor(s); in nearbyint() local
108 S rt = (s - prev) - (next - s); // remainder type in nearbyint()
114 return prev; in nearbyint()
119 bool is_prev_even = two * floor(prev / two) == prev ; in nearbyint()
120 return ( is_prev_even ? prev : next ) ; in nearbyint()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/multiset/ |
| D | insert_cv.pass.cpp | 38 assert(r == prev(m.end())); in main()
43 assert(r == prev(m.end())); in main()
63 assert(r == prev(m.end())); in main()
68 assert(r == prev(m.end())); in main()
|
| D | insert_rv.pass.cpp | 40 assert(r == prev(m.end())); in main()
45 assert(r == prev(m.end())); in main()
66 assert(r == prev(m.end())); in main()
71 assert(r == prev(m.end())); in main()
|
| D | insert_iter_cv.pass.cpp | 38 assert(r == prev(m.end())); in main()
43 assert(r == prev(m.end())); in main()
63 assert(r == prev(m.end())); in main()
68 assert(r == prev(m.end())); in main()
|
| D | insert_iter_rv.pass.cpp | 40 assert(r == prev(m.end())); in main()
45 assert(r == prev(m.end())); in main()
66 assert(r == prev(m.end())); in main()
71 assert(r == prev(m.end())); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/set/ |
| D | insert_iter_rv.pass.cpp | 40 assert(r == prev(m.end())); in main()
45 assert(r == prev(m.end())); in main()
65 assert(r == prev(m.end())); in main()
70 assert(r == prev(m.end())); in main()
|
| D | insert_iter_cv.pass.cpp | 38 assert(r == prev(m.end())); in main()
43 assert(r == prev(m.end())); in main()
63 assert(r == prev(m.end())); in main()
68 assert(r == prev(m.end())); in main()
|
| D | insert_cv.pass.cpp | 41 assert(r.first == prev(m.end())); in main()
47 assert(r.first == prev(m.end())); in main()
70 assert(r.first == prev(m.end())); in main()
76 assert(r.first == prev(m.end())); in main()
|
| D | insert_rv.pass.cpp | 43 assert(r.first == prev(m.end())); in main()
49 assert(r.first == prev(m.end())); in main()
72 assert(r.first == prev(m.end())); in main()
78 assert(r.first == prev(m.end())); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/map/map.modifiers/ |
| D | insert_iter_rv.pass.cpp | 44 assert(r == prev(m.end())); in main()
50 assert(r == prev(m.end())); in main()
74 assert(r == prev(m.end())); in main()
80 assert(r == prev(m.end())); in main()
|
| D | insert_iter_cv.pass.cpp | 40 assert(r == prev(m.end())); in main()
46 assert(r == prev(m.end())); in main()
69 assert(r == prev(m.end())); in main()
75 assert(r == prev(m.end())); in main()
|
| D | insert_rv.pass.cpp | 46 assert(r.first == prev(m.end())); in main()
53 assert(r.first == prev(m.end())); in main()
79 assert(r.first == prev(m.end())); in main()
86 assert(r.first == prev(m.end())); in main()
|
| D | insert_cv.pass.cpp | 43 assert(r.first == prev(m.end())); in main()
50 assert(r.first == prev(m.end())); in main()
76 assert(r.first == prev(m.end())); in main()
83 assert(r.first == prev(m.end())); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/iterator.primitives/iterator.operations/ |
| D | prev.pass.cpp | 24 assert(std::prev(i, n) == x); in test()
31 assert(std::prev(i) == x); in test()
|
| /ndk/sources/host-tools/make-3.81/ |
| D | file.c | 193 f->last->prev = new; in enter_file()
211 from_file = from_file->prev; in rename_file()
249 for (f = from_file->double_colon; f != 0; f = f->prev) in rehash_file()
643 for (f = lookup_file (".SUFFIXES"); f != 0; f = f->prev) in snap_deps()
652 for (f = *file_slot; f != 0; f = f->prev) in snap_deps()
659 for (f = lookup_file (".PRECIOUS"); f != 0; f = f->prev) in snap_deps()
661 for (f2 = d->file; f2 != 0; f2 = f2->prev) in snap_deps()
664 for (f = lookup_file (".LOW_RESOLUTION_TIME"); f != 0; f = f->prev) in snap_deps()
666 for (f2 = d->file; f2 != 0; f2 = f2->prev) in snap_deps()
669 for (f = lookup_file (".PHONY"); f != 0; f = f->prev) in snap_deps()
[all …]
|