| /external/clang/test/Parser/ |
| c1x-alignas.c | 4 _Alignas(4) char c1; variable
|
| /external/google-breakpad/src/common/android/testing/include/ |
| 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/std/containers/sequences/deque/deque.cons/ |
| assign_iter_iter.pass.cpp | 46 test(C& c1, const C& c2)
48 c1.assign(c2.begin(), c2.end());
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 assert(c1 == c2);
57 C c1 = make<C>(N, start); local
59 test(c1, c2);
64 testI(C& c1, const C& c2)
68 c1.assign(ICI(c2.begin()), ICI(c2.end()))
77 C c1 = make<C>(N, start); local
[all...] |
| 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.get_allocator())
[all...] |
| /external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| insert_rvalue.pass.cpp | 47 test(int P, C& c1, int x)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.insert(c1.begin() + P, MoveOnly(x));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
55 i = c1.begin()
72 C c1 = make<C>(N, start); local
80 C c1 = make<C>(N, start); local
88 C c1 = make<C>(N, start); local
[all...] |
| insert_iter_iter.pass.cpp | 55 C c1 = c0; local
56 std::size_t c1_osize = c1.size();
57 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end()));
58 assert(i == c1.begin() + P);
59 assert(c1.size() == c1_osize + c2.size());
60 assert(distance(c1.begin(), c1.end()) == c1.size());
61 i = c1.begin()
72 C c1 = c0; local
89 C c1 = c0; local
113 C c1 = make<C>(N, start); local
122 C c1 = make<C>(N, start); local
131 C c1 = make<C>(N, start); local
140 C c1 = make<C>(N, start); local
149 C c1 = make<C>(N, start); local
158 C c1 = make<C>(N, start); local
193 C c1 = make<C>(N, start); local
202 C c1 = make<C>(N, start); local
211 C c1 = make<C>(N, start); local
220 C c1 = make<C>(N, start); local
229 C c1 = make<C>(N, start); local
[all...] |
| emplace.pass.cpp | 47 test(int P, C& c1)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
66 C c1 = make<C>(N, start) local
74 C c1 = make<C>(N, start); local
82 C c1 = make<C>(N, start); local
[all...] |
| pop_back.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_back();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 0; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| pop_front.pass.cpp | 43 test(C& c1)
46 std::size_t c1_osize = c1.size();
47 c1.pop_front();
48 assert(c1.size() == c1_osize - 1);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 I i = c1.begin();
51 for (int j = 1; j < c1.size(); ++j, ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| 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.cbefore_begin(), l))
[all...] |
| 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/containers/sequences/vector/ |
| 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();
|
| 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/numerics/complex.number/complex.literals/ |
| 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/libcxx/test/std/strings/basic.string/string.nonmembers/string.special/ |
| swap_noexcept.pass.cpp | 57 C c1, c2; local
58 static_assert(noexcept(swap(c1, c2)), "");
62 C c1, c2; local
63 static_assert(noexcept(swap(c1, c2)), "");
67 C c1, c2; local
70 static_assert( noexcept(swap(c1, c2)), "");
72 static_assert(!noexcept(swap(c1, c2)), "");
78 C c1, c2; local
80 static_assert( noexcept(swap(c1, c2)), "");
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_rvalue.pass.cpp | 46 test(int P, C& c1, int x)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.insert(c1.begin() + P, MoveOnly(x));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
55 i = c1.begin()
74 C c1 = make<C>(N, start); local
82 C c1 = make<C>(N, start); local
90 C c1 = make<C>(N, start); local
[all...] |
| emplace.pass.cpp | 46 test(int P, C& c1)
50 std::size_t c1_osize = c1.size();
51 CI i = c1.emplace(c1.begin() + P, Emplaceable(1, 2.5));
52 assert(i == c1.begin() + P);
53 assert(c1.size() == c1_osize + 1);
54 assert(distance(c1.begin(), c1.end()) == c1.size());
68 C c1 = make<C>(N, start) local
76 C c1 = make<C>(N, start); local
84 C c1 = make<C>(N, start); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| 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.cbefore_begin(), l))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/ |
| 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();
|
| 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();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/complex.number/complex.literals/ |
| 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 );
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/sparc/ |
| ld_st_fsr.d | 10 0: c1 08 c0 00 ld \[ %g3 \], %fsr
11 4: c1 28 c0 00 st %fsr, \[ %g3 \]
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-powerpc/ |
| aix-weak-2c.s | 4 .long c1
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/pyasn1/test/type/ |
| test_constraint.py | 15 self.c1 = constraint.SingleValueConstraint(1,2)
18 def testCmp(self): assert self.c1 == self.c1, 'comparation fails'
19 def testHash(self): assert hash(self.c1) != hash(self.c2), 'hash() fails'
22 self.c1(1)
27 self.c1(4)
35 self.c1 = constraint.ContainedSubtypeConstraint(
41 self.c1(12)
46 self.c1(4)
54 self.c1 = constraint.ValueRangeConstraint(1,4
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| 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.get_allocator())
[all...] |
