/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
H A D | shrink_to_fit.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 52 testN(int start, int N) argument 55 C c1 = make<C>(N, start);
|
H A D | resize_size.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 59 testN(int start, int N, int M) argument 62 C c1 = make<C>(N, start);
|
H A D | access.pass.cpp | 31 make(int size, int start = 0 ) 35 if (start > 0) 37 init = (start+1) / b + ((start+1) % b != 0); 42 for (int i = 0; i < init-start; ++i) 46 for (int i = 0; i < start; ++i)
|
H A D | resize_size_value.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 59 testN(int start, int N, int M) argument 62 C c1 = make<C>(N, start);
|
/ndk/tests/build/test-gnustl-chrono/jni/ |
H A D | main.cpp | 14 high_resolution_clock::time_point start = high_resolution_clock::now(); local 19 static_cast<long long>(duration_cast<nanoseconds>(end - start).count()));
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/class.gslice/gslice.cons/ |
H A D | default.pass.cpp | 22 assert(gs.start() == 0);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/class.slice/cons.slice/ |
H A D | default.pass.cpp | 22 assert(s.start() == 0);
|
H A D | start_size_stride.pass.cpp | 14 // slice(size_t start, size_t size, size_t stride); 22 assert(s.start() == 1);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
H A D | assign_size_value.pass.cpp | 22 make(int size, int start = 0 ) 26 if (start > 0) 28 init = (start+1) / b + ((start+1) % b != 0); 33 for (int i = 0; i < init-start; ++i) 37 for (int i = 0; i < start; ++i) 57 testN(int start, int N, int M) argument 61 C c1 = make<C>(N, start);
|
H A D | assign_iter_iter.pass.cpp | 23 make(int size, int start = 0 ) 27 if (start > 0) 29 init = (start+1) / b + ((start+1) % b != 0); 34 for (int i = 0; i < init-start; ++i) 38 for (int i = 0; i < start; ++i) 55 testN(int start, int N, int M) argument 59 C c1 = make<C>(N, start); 78 testNI(int start, int N, int M) argument 82 C c1 = make<C>(N, start); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
H A D | emplace_back.pass.cpp | 24 make(int size, int start = 0 ) 28 if (start > 0) 30 init = (start+1) / b + ((start+1) % b != 0); 35 for (int i = 0; i < init-start; ++i) 39 for (int i = 0; i < start; ++i) 59 testN(int start, int N) argument 61 C c1 = make<C>(N, start);
|
H A D | emplace_front.pass.cpp | 24 make(int size, int start = 0 ) 28 if (start > 0) 30 init = (start+1) / b + ((start+1) % b != 0); 35 for (int i = 0; i < init-start; ++i) 39 for (int i = 0; i < start; ++i) 59 testN(int start, int N) argument 61 C c1 = make<C>(N, start);
|
H A D | pop_back.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 57 testN(int start, int N) argument 61 C c1 = make<C>(N, start);
|
H A D | pop_front.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 57 testN(int start, int N) argument 61 C c1 = make<C>(N, start);
|
H A D | push_front.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 59 testN(int start, int N) argument 61 C c1 = make<C>(N, start);
|
H A D | push_front_rvalue.pass.cpp | 24 make(int size, int start = 0 ) 28 if (start > 0) 30 init = (start+1) / b + ((start+1) % b != 0); 35 for (int i = 0; i < init-start; ++i) 39 for (int i = 0; i < start; ++i) 62 testN(int start, int N) argument 64 C c1 = make<C>(N, start);
|
H A D | push_back.pass.cpp | 23 make(int size, int start = 0 ) 27 if (start > 0) 29 init = (start+1) / b + ((start+1) % b != 0); 34 for (int i = 0; i < init-start; ++i) 38 for (int i = 0; i < start; ++i)
|
H A D | push_back_rvalue.pass.cpp | 26 make(int size, int start = 0 ) 30 if (start > 0) 32 init = (start+1) / b + ((start+1) % b != 0); 37 for (int i = 0; i < init-start; ++i) 41 for (int i = 0; i < start; ++i)
|
H A D | emplace.pass.cpp | 24 make(int size, int start = 0 ) 28 if (start > 0) 30 init = (start+1) / b + ((start+1) % b != 0); 35 for (int i = 0; i < init-start; ++i) 39 for (int i = 0; i < start; ++i) 60 testN(int start, int N) argument 68 C c1 = make<C>(N, start); 76 C c1 = make<C>(N, start); 84 C c1 = make<C>(N, start); [all...] |
H A D | insert_rvalue.pass.cpp | 24 make(int size, int start = 0 ) 28 if (start > 0) 30 init = (start+1) / b + ((start+1) % b != 0); 35 for (int i = 0; i < init-start; ++i) 39 for (int i = 0; i < start; ++i) 66 testN(int start, int N) argument 74 C c1 = make<C>(N, start); 82 C c1 = make<C>(N, start); 90 C c1 = make<C>(N, start); [all...] |
H A D | erase_iter.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 62 testN(int start, int N) 67 C c1 = make<C>(N, start);
|
H A D | erase_iter_iter.pass.cpp | 21 make(int size, int start = 0 ) 25 if (start > 0) 27 init = (start+1) / b + ((start+1) % b != 0); 32 for (int i = 0; i < init-start; ++i) 36 for (int i = 0; i < start; ++i) 62 testN(int start, int N) argument 70 C c1 = make<C>(N, start);
|
/ndk/sources/host-tools/sed-4.2.1/testsuite/ |
H A D | bug-regex13.c | 39 int start; member in struct:__anon220 86 int start; local 98 start = re_search (®buf, tests[i].string, strlen (tests[i].string), 100 if (start != tests[i].start) 102 printf ("re_search failed %d\n", start);
|
H A D | runptests.c | 33 int start; member in struct:test 72 if (tests[cnt].start == -2) 84 else if (tests[cnt].start == -2) 96 if (tests[cnt].start == -1) 106 if (match[0].rm_so == 0 && tests[cnt].start == 0 109 else if (match[0].rm_so + 1 == tests[cnt].start
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
H A D | copy.pass.cpp | 26 make(int size, int start = 0 ) 30 if (start > 0) 32 init = (start+1) / b + ((start+1) % b != 0); 37 for (int i = 0; i < init-start; ++i) 41 for (int i = 0; i < start; ++i) 47 void testN(int start, int N) argument 54 C c1 = make<C>(N, start);
|