/external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
ctor_iter_iter.pass.cpp | 22 int* an = a + sizeof(a)/sizeof(a[0]); local 23 std::priority_queue<int> q(a, an); 24 assert(q.size() == static_cast<std::size_t>(an - a));
|
ctor_iter_iter_comp.pass.cpp | 23 int* an = a + sizeof(a)/sizeof(a[0]); local 25 q(a, an, std::greater<int>()); 26 assert(q.size() == static_cast<std::size_t>(an - a));
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), 39 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), 46 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()),
|
move_alloc.pass.cpp | 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 30 for (int* p = ab; p < an; ++p) 33 for (int* p = ab; p < an; ++p) 42 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 45 for (int* p = ab; p < an; ++p) 48 for (int* p = ab; p < an; ++p) 57 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 60 for (int* p = ab; p < an; ++p) 63 for (int* p = ab; p < an; ++p) 72 int* an = ab + sizeof(ab)/sizeof(ab[0]) local [all...] |
move_assign.pass.cpp | 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 30 for (int* p = ab; p < an; ++p) 33 for (int* p = ab; p < an; ++p) 43 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 46 for (int* p = ab; p < an; ++p) 49 for (int* p = ab; p < an; ++p) 59 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 62 for (int* p = ab; p < an; ++p) 65 for (int* p = ab; p < an; ++p) 75 int* an = ab + sizeof(ab)/sizeof(ab[0]) local [all...] |
copy.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 34 test(std::deque<int>(ab, an)); 51 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 52 test(std::deque<int, min_allocator<int>>(ab, an));
|
op_equal.pass.cpp | 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 33 test(std::deque<int>(ab, an)); 52 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 53 test(std::deque<int, min_allocator<int>>(ab, an));
|
move.pass.cpp | 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 30 for (int* p = ab; p < an; ++p) 33 for (int* p = ab; p < an; ++p) 44 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 47 for (int* p = ab; p < an; ++p) 50 for (int* p = ab; p < an; ++p) 59 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 62 for (int* p = ab; p < an; ++p) 65 for (int* p = ab; p < an; ++p)
|
iter_iter.pass.cpp | 58 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 59 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); 60 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); 61 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); 62 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); 63 test<limited_allocator<int, 4096> >(ab, an); 65 test<min_allocator<int> >(ab, an);
|
iter_iter_alloc.pass.cpp | 45 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); 47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); 48 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5)); 49 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6)); 51 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); 52 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); 53 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator<int>()); 54 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator<int>());
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
construct_iter_iter.pass.cpp | 37 bool* an = a + sizeof(a)/sizeof(a[0]); local 38 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); 39 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); 40 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); 41 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); 42 test<std::vector<bool> >(a, an); 44 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); 45 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); 46 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); 47 test<std::vector<bool, min_allocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); [all...] |
construct_iter_iter_alloc.pass.cpp | 38 bool* an = a + sizeof(a)/sizeof(a[0]); local 41 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); 42 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); 43 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); 44 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); 45 test<std::vector<bool> >(a, an, alloc); 50 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); 51 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); 52 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); 53 test<std::vector<bool, min_allocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc) [all...] |
copy_alloc.pass.cpp | 36 bool* an = a + sizeof(a)/sizeof(a[0]); local 37 test(std::vector<bool>(a, an), std::allocator<bool>()); 54 bool* an = a + sizeof(a)/sizeof(a[0]); local 55 test(std::vector<bool, min_allocator<bool>>(a, an), min_allocator<bool>());
|
reference.swap.pass.cpp | 24 bool* an = a + sizeof(a)/sizeof(a[0]); local 26 std::vector<bool> v(a, an);
|
copy.pass.cpp | 37 bool* an = a + sizeof(a)/sizeof(a[0]); local 38 test(std::vector<bool>(a, an)); 55 bool* an = a + sizeof(a)/sizeof(a[0]); local 56 test(std::vector<bool, min_allocator<bool>>(a, an));
|
/external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
copy_alloc.pass.cpp | 38 int* an = a + sizeof(a)/sizeof(a[0]); local 39 test(std::vector<int>(a, an), std::allocator<int>()); 56 int* an = a + sizeof(a)/sizeof(a[0]); local 57 test(std::vector<int, min_allocator<int>>(a, an), min_allocator<int>());
|
copy.pass.cpp | 38 int* an = a + sizeof(a)/sizeof(a[0]); local 39 test(std::vector<int>(a, an)); 64 int* an = a + sizeof(a)/sizeof(a[0]); local 65 test(std::vector<int, min_allocator<int>>(a, an));
|
construct_iter_iter_alloc.pass.cpp | 56 int* an = a + sizeof(a) / sizeof(a[0]); local 59 input_iterator<const int*>(an), alloc); 61 forward_iterator<const int*>(an), alloc); 63 bidirectional_iterator<const int*>(an), alloc); 65 random_access_iterator<const int*>(an), alloc); 66 test<std::vector<int> >(a, an, alloc); 71 int* an = a + sizeof(a) / sizeof(a[0]); local 74 input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); 76 forward_iterator<const int*>(a), forward_iterator<const int*>(an), 80 bidirectional_iterator<const int*>(an), alloc) [all...] |
construct_iter_iter.pass.cpp | 41 int* an = a + sizeof(a) / sizeof(a[0]); local 43 input_iterator<const int*>(an)); 45 forward_iterator<const int*>(an)); 47 bidirectional_iterator<const int*>(an)); 49 random_access_iterator<const int*>(an)); 50 test<std::vector<int> >(a, an); 53 input_iterator<const int*>(a), input_iterator<const int*>(an)); 56 forward_iterator<const int*>(a), forward_iterator<const int*>(an)); 59 bidirectional_iterator<const int*>(an)); 62 random_access_iterator<const int*>(an)); [all...] |
/development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
AnimateDrawables.java | 11 * distributed under the License is distributed on an "AS IS" BASIS, 49 Animation an = new TranslateAnimation(0, 100, 0, 200); local 50 an.setDuration(2000); 51 an.setRepeatCount(-1); 52 an.initialize(10, 10, 10, 10); 54 mDrawable = new AnimateDrawable(dr, an); 55 an.startNow();
|
/development/tools/mkstubs/tests/com/android/mkstubs/sourcer/ |
TestHelper.java | 11 * distributed under the License is distributed on an "AS IS" BASIS, 31 String an = actual.replaceAll( "[\\s]+", " ").trim(); local 35 en, an);
|
/external/skia/src/core/ |
SkCoverageDelta.cpp | 127 SkNi an = isConvex ? ConvexCoverageToAlpha(cn, isInverse) local 129 SkNx_cast<SkAlpha>(an).store(maskRow + ix);
|
/external/skqp/src/core/ |
SkCoverageDelta.cpp | 127 SkNi an = isConvex ? ConvexCoverageToAlpha(cn, isInverse) local 129 SkNx_cast<SkAlpha>(an).store(maskRow + ix);
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/special/ |
Gamma.java | 12 * distributed under the License is distributed on an "AS IS" BASIS, 177 double an = 1.0 / a; // n-th element in the series local 178 double sum = an; // partial sum 179 while (FastMath.abs(an/sum) > epsilon && n < maxIterations && sum < Double.POSITIVE_INFINITY) { 182 an = an * (x / (a + n)); 185 sum = sum + an; 277 * <p>This is an independently written implementation of the algorithm described in
|
/external/clang/test/CodeGenCXX/ |
sanitize-dtor-bit-field.cpp | 49 Anon an; variable
|