| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| 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]))));
|
| 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/chromium_org/third_party/libjingle/source/talk/media/base/ |
| codec_unittest.cc | 45 AudioCodec c1(95, "A", 44100, 20000, 2, 3);
51 EXPECT_TRUE(c0 != c1);
96 AudioCodec c1(96, "A", 44100, 20000, 1, 3);
97 EXPECT_TRUE(c1.Matches(AudioCodec(96, "A", 0, 0, 0, 0)));
98 EXPECT_TRUE(c1.Matches(AudioCodec(97, "A", 0, 0, 0, 0)));
99 EXPECT_TRUE(c1.Matches(AudioCodec(96, "a", 0, 0, 0, 0)));
100 EXPECT_TRUE(c1.Matches(AudioCodec(97, "a", 0, 0, 0, 0)));
101 EXPECT_FALSE(c1.Matches(AudioCodec(95, "A", 0, 0, 0, 0)));
102 EXPECT_FALSE(c1.Matches(AudioCodec(96, "", 44100, 20000, 2, 0)));
103 EXPECT_FALSE(c1.Matches(AudioCodec(96, "A", 55100, 30000, 1, 0)))
282 Codec c1; local
[all...] |
| /external/chromium_org/third_party/sqlite/src/test/ |
| wal_common.tcl | 28 upvar $ckv1 c1
31 set c1 [expr {($c1 + $v1 + $c2)&0xFFFFFFFF}]
32 set c2 [expr {($c2 + $v2 + $c1)&0xFFFFFFFF}]
43 upvar $ckv1 c1
53 wal_cksum_intlist c1 c2 $values
61 set c1 0
63 wal_cksum $endian c1 c2 $blob
64 append blob [binary format II $c1 $c2]
86 set c1
[all...] |
| /external/clang/test/Parser/ |
| c1x-alignas.c | 4 _Alignas(4) char c1; variable
|
| /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...] |
| 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...] |
| insert_iter_iter.pass.cpp | 47 test(int P, C& c1, const C& c2)
52 std::size_t c1_osize = c1.size();
53 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end()));
54 assert(i == c1.begin() + P);
55 assert(c1.size() == c1_osize + c2.size());
56 assert(distance(c1.begin(), c1.end()) == c1.size());
57 i = c1.begin()
76 C c1 = make<C>(N, start); local
85 C c1 = make<C>(N, start); local
94 C c1 = make<C>(N, start); local
103 C c1 = make<C>(N, start); local
112 C c1 = make<C>(N, start); local
121 C c1 = make<C>(N, start); local
159 C c1 = make<C>(N, start); local
168 C c1 = make<C>(N, start); local
177 C c1 = make<C>(N, start); local
186 C c1 = make<C>(N, start); local
195 C c1 = make<C>(N, start); local
[all...] |
| erase_iter_iter.pass.cpp | 43 test(int P, C& c1, int size)
46 assert(P + size <= c1.size());
47 std::size_t c1_osize = c1.size();
48 I i = c1.erase(c1.cbegin() + P, c1.cbegin() + (P + size));
49 assert(i == c1.begin() + P);
50 assert(c1.size() == c1_osize - size);
51 assert(distance(c1.begin(), c1.end()) == c1.size())
70 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/list/ |
| db_iterators_1.pass.cpp | 31 C c1; local
33 bool b = c1.begin() != c2.begin();
40 C c1; local
42 bool b = c1.begin() != c2.begin();
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/ |
| db_iterators_1.pass.cpp | 31 C c1; local
33 bool b = c1.begin() != c2.begin();
40 C c1; local
42 bool b = c1.begin() != c2.begin();
|
| 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/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...] |
| assign_size_value.pass.cpp | 44 test(C& c1, int size, int v)
47 std::size_t c1_osize = c1.size();
48 c1.assign(size, v);
49 assert(c1.size() == size);
50 assert(distance(c1.begin(), c1.end()) == c1.size());
51 for (CI i = c1.begin(); i != c1.end(); ++i)
61 C c1 = make<C>(N, start) local
[all...] |
| /external/eigen/test/ |
| block.cpp | 37 Index c1 = internal::random<Index>(0,cols-1); local
38 Index c2 = internal::random<Index>(c1,cols-1);
41 VERIFY_IS_EQUAL(m1.col(c1).transpose(), m1.transpose().row(c1));
50 m1.col(c1) += s1 * m1_copy.col(c2);
51 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + s1 * m1_copy.col(c2));
52 m1.col(c1).col(0) += s1 * m1_copy.col(c2);
53 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + Scalar(2) * s1 * m1_copy.col(c2))
193 Index c1 = internal::random<Index>(0,cols-1); local
[all...] |
| /external/libsepol/include/sepol/policydb/ |
| context.h | 52 static inline int mls_context_cmp(context_struct_t * c1, context_struct_t * c2)
54 return (mls_level_eq(&c1->range.level[0], &c2->range.level[0]) &&
55 mls_level_eq(&c1->range.level[1], &c2->range.level[1]));
90 static inline int context_cmp(context_struct_t * c1, context_struct_t * c2)
92 return ((c1->user == c2->user) &&
93 (c1->role == c2->role) &&
94 (c1->type == c2->type) && mls_context_cmp(c1, c2));
|
| /external/valgrind/main/massif/tests/ |
| new-cpp.cpp | 21 char* c1 = new char[2000]; local
25 delete [] c1;
|
| /packages/apps/DeskClock/src/com/android/deskclock/worldclock/ |
| CityNameComparator.java | 30 public int compare(CityObj c1, CityObj c2) {
31 return mCollator.compare(c1.mCityName, c2.mCityName);
|
| /external/libvpx/libvpx/vp8/encoder/ |
| dct.c | 17 int a1, b1, c1, d1; local
25 c1 = ((ip[1] - ip[2])<<3);
31 op[1] = (c1 * 2217 + d1 * 5352 + 14500)>>12;
32 op[3] = (d1 * 2217 - c1 * 5352 + 7500)>>12;
44 c1 = ip[4] - ip[8];
50 op[4] =((c1 * 2217 + d1 * 5352 + 12000)>>16) + (d1!=0);
51 op[12] = (d1 * 2217 - c1 * 5352 + 51000)>>16;
67 int a1, b1, c1, d1; local
77 c1 = ((ip[1] - ip[3])<<2);
81 op[1] = b1 + c1;
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_incomplete.py | 19 c1 = cell()
20 c1.name = "foo"
24 c1.next = pointer(c2)
25 c2.next = pointer(c1)
27 p = c1
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_incomplete.py | 19 c1 = cell()
20 c1.name = "foo"
24 c1.next = pointer(c2)
25 c2.next = pointer(c1)
27 p = c1
|
