/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.cons/ |
H A D | assign_copy.pass.cpp | 30 C c1(std::begin(t1), std::end(t1), A(10)); 31 c1 = c0; 32 assert(c1 == c0); 33 assert(c1.get_allocator() == A(10)); 42 C c1(std::begin(t1), std::end(t1), A(11)); 43 c1 = c0; 44 assert(c1 == c0); 45 assert(c1.get_allocator() == A(11)); 54 C c1(std::begin(t1), std::end(t1), A(10)); 55 c1 [all...] |
/external/llvm/test/MC/ARM/ |
H A D | thumb-only-conditionals.s | 22 cdpgt p7, #1, c1, c1, c1, #4 23 cdp2gt p7, #1, c1, c1, c1, #4 25 @ CHECK-NEXT: cdpgt p7, #1, c1, c1, c1, #4 26 @ CHECK-NEXT: cdp2gt p7, #1, c1, c [all...] |
/external/clang/test/Sema/ |
H A D | attr-cleanup.c | 3 void c1(int *a); 5 extern int g1 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}} 6 int g2 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}} 7 static int g3 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}} 14 static int v3 __attribute((cleanup(c1))); // expected-warning {{'cleanup' attribute ignored}} 18 int v5 __attribute((cleanup(c1)));
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.spec/ |
H A D | relational.pass.cpp | 39 C c1; local 41 c1.push_front(i); 46 assert(c1 < c2); 48 assert(c1 <= c2); 50 assert(c1 >= c2); 52 assert(c1 > c2);
|
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
H A D | merge.pass.cpp | 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 27 c1.merge(c2); 28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0]))); 35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 37 c1.merge(c2); 38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
H A D | merge_comp.pass.cpp | 26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 28 c1.merge(c2, std::greater<int>()); 29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0]))); 36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 38 c1.merge(c2, std::greater<int>()); 39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
/external/selinux/mcstrans/share/examples/default/ |
H A D | setrans.conf | 29 s2:c1=B 39 s0-s2:c1=SystemLow-Secret:B 40 s0-s2:c0,c1=SystemLow-Secret:AB 42 s1-s2:c1=Unclassified-Secret:B 43 s1-s2:c0,c1=Unclassified-Secret:AB 45 s2-s2:c1=Secret-Secret:B 46 s2-s2:c0,c1=Secret-Secret:AB 48 s2:c0-s2:c0,c1=Secret:A-Secret:AB 50 s2:c1-s2:c0,c1 [all...] |
/external/selinux/mcstrans/share/examples/include/setrans.d/ |
H A D | include-example | 29 s2:c1=B 39 s0-s2:c1=SystemLow-Secret:B 40 s0-s2:c0,c1=SystemLow-Secret:AB 42 s1-s2:c1=Unclassified-Secret:B 43 s1-s2:c0,c1=Unclassified-Secret:AB 45 s2-s2:c1=Secret-Secret:B 46 s2-s2:c0,c1=Secret-Secret:AB 48 s2:c0-s2:c0,c1=Secret:A-Secret:AB 50 s2:c1-s2:c0,c1 [all...] |
/external/clang/test/Parser/ |
H A D | c1x-alignas.c | 4 _Alignas(4) char c1; variable
|
/external/google-breakpad/src/common/android/testing/include/ |
H A D | wchar.h | 58 wchar_t c1 = wcstolower(*s1); local 60 if (c1 < c2) 62 if (c1 > c2) 64 if (c1 == L'0')
|
/external/libcxx/test/libcxx/containers/sequences/vector/ |
H A D | db_iterators_2.pass.cpp | 31 C c1; local 33 bool b = c1.begin() < c2.begin(); 40 C c1; 42 bool b = c1.begin() < c2.begin();
|
H A D | db_iterators_3.pass.cpp | 31 C c1; local 33 int i = c1.begin() - c2.begin(); 40 C c1; local 42 int i = c1.begin() - c2.begin();
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
H A D | assign_iter_iter.pass.cpp | 47 test(C& c1, const C& c2) argument 49 c1.assign(c2.begin(), c2.end()); 50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); 51 assert(c1 == c2); 58 C c1 = make<C>(N, start); local 60 test(c1, c2); 65 testI(C& c1, const C& c2) argument 69 c1 78 C c1 = make<C>(N, start); local [all...] |
H A D | move.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(1)); 30 c1.push_back(MoveOnly(*p)); 34 std::deque<MoveOnly, A> c3 = std::move(c1); 36 assert(c1.size() == 0); 37 assert(c3.get_allocator() == c1.get_allocator()); 43 std::deque<MoveOnly, A> c1(A(1)); 45 c1.push_back(MoveOnly(*p)); 49 std::deque<MoveOnly, A> c3 = std::move(c1); 51 assert(c1.size() == 0); 52 assert(c3.get_allocator() == c1 [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | insert_rvalue.pass.cpp | 48 test(int P, C& c1, int x) argument 51 std::size_t c1_osize = c1.size(); 52 CI i = c1.insert(c1.begin() + P, MoveOnly(x)); 53 assert(i == c1.begin() + P); 54 assert(c1.size() == c1_osize + 1); 55 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); 56 i = c1 73 C c1 = make<C>(N, start); local 81 C c1 = make<C>(N, start); local 89 C c1 = make<C>(N, start); local [all...] |
H A D | insert_iter_iter.pass.cpp | 56 C c1 = c0; local 57 std::size_t c1_osize = c1.size(); 58 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end())); 59 assert(i == c1.begin() + P); 60 assert(c1.size() == c1_osize + c2.size()); 61 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); 62 i = c1 73 C c1 = c0; local 90 C c1 = c0; local 114 C c1 = make<C>(N, start); local 123 C c1 = make<C>(N, start); local 132 C c1 = make<C>(N, start); local 141 C c1 = make<C>(N, start); local 150 C c1 = make<C>(N, start); local 159 C c1 = make<C>(N, start); local 168 testI(int P, C& c1, const C& c2) argument 194 C c1 = make<C>(N, start); local 203 C c1 = make<C>(N, start); local 212 C c1 = make<C>(N, start); local 221 C c1 = make<C>(N, start); local 230 C c1 = make<C>(N, start); local [all...] |
H A D | emplace.pass.cpp | 48 test(int P, C& c1) argument 51 std::size_t c1_osize = c1.size(); 52 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5)); 53 assert(i == c1.begin() + P); 54 assert(c1.size() == c1_osize + 1); 55 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); 67 C c1 local 75 C c1 = make<C>(N, start); local 83 C c1 = make<C>(N, start); local [all...] |
H A D | pop_back.pass.cpp | 44 test(C& c1) argument 47 std::size_t c1_osize = c1.size(); 48 c1.pop_back(); 49 assert(c1.size() == c1_osize - 1); 50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); 51 I i = c1.begin(); 52 for (int j = 0; static_cast<std::size_t>(j) < c1.size(); ++j, ++i) 62 C c1 local [all...] |
H A D | pop_front.pass.cpp | 44 test(C& c1) argument 47 std::size_t c1_osize = c1.size(); 48 c1.pop_front(); 49 assert(c1.size() == c1_osize - 1); 50 assert(static_cast<std::size_t>(distance(c1.begin(), c1.end())) == c1.size()); 51 I i = c1.begin(); 52 for (int j = 1; static_cast<std::size_t>(j) < c1.size(); ++j, ++i) 62 C c1 local [all...] |
/external/libcxx/test/std/containers/sequences/array/array.special/ |
H A D | swap.pass.cpp | 44 C c1 = {1, 2, 3.5}; local 46 swap(c1, c2); 47 assert(c1.size() == 3); 48 assert(c1[0] == 4); 49 assert(c1[1] == 5); 50 assert(c1[2] == 6.5); 59 C c1 = {}; local 61 swap(c1, c2); 62 assert(c1.size() == 0);
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
H A D | splice_after_range.pass.cpp | 90 C c1(std::begin(t1), std::end(t1)); 93 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c2), 95 testd(c1, p, f, l); 107 C c1(std::begin(t1), std::end(t1)); 109 c1.splice_after(next(c1.cbefore_begin(), p), std::move(c1), 110 next(c1.cbefore_begin(), f), next(c1 [all...] |
H A D | remove.pass.cpp | 38 C c1(std::begin(t1), std::end(t1)); 40 c1.remove(0); 41 assert(c1 == c2); 47 C c1(std::begin(t1), std::end(t1)); 49 c1.remove(0); 50 assert(c1 == c2); 57 C c1(std::begin(t1), std::end(t1)); 59 c1.remove(0); 60 assert(c1 == c2); 65 C c1; local 139 C c1; local [all...] |
/external/libcxx/test/std/numerics/complex.number/complex.literals/ |
H A D | literals.pass.cpp | 30 std::complex<long double> c1 = 3.0il; local 31 assert ( c1 == std::complex<long double>(0, 3.0)); 33 assert ( c1 == c2 ); 37 std::complex<double> c1 = 3.0i; local 38 assert ( c1 == std::complex<double>(0, 3.0)); 40 assert ( c1 == c2 ); 44 std::complex<float> c1 = 3.0if; local 45 assert ( c1 == std::complex<float>(0, 3.0)); 47 assert ( c1 == c2 );
|
/external/libdivsufsort/lib/ |
H A D | divsufsort.c | 47 saint_t c0, c1; local 62 do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1)); 65 ++BUCKET_BSTAR(c0, c1); 68 for(--i, c1 = c0; (0 <= i) && ((c0 = T[i]) <= c1); --i, c1 = c0) { 69 ++BUCKET_B(c0, c1); 85 for(c1 = c0 + 1; c1 < ALPHABET_SIZ 200 saint_t c0, c1, c2; local 264 saint_t c0, c1, c2; local [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/genetics/ |
H A D | ChromosomePair.java | 35 * @param c1 the first chromosome. 38 public ChromosomePair(final Chromosome c1, final Chromosome c2) { argument 40 first = c1;
|