| /external/libcxx/test/std/containers/sequences/deque/deque.special/ |
| swap.pass.cpp | 45 C c1 = make<C>(N, start); local
47 C c1_save = c1;
49 swap(c1, c2);
50 assert(c1 == c2_save);
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
70 swap(c1, c2);
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
72 assert(c1.get_allocator() == A(1));
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
82 swap(c1, c2)
[all...] |
| /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
| 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/list/list.modifiers/ |
| emplace.pass.cpp | 56 std::list<A> c1; local
58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
80 std::list<A, min_allocator<A>> c1; local
82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| emplace.pass.cpp | 119 std::vector<A> c1; local
121 std::vector<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
152 std::vector<A, min_allocator<A>> c1; local
154 std::vector<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| swap_noexcept.pass.cpp | 123 C c1, c2; local
124 static_assert(noexcept(swap(c1, c2)), "");
129 C c1, c2; local
130 static_assert(noexcept(swap(c1, c2)), "");
135 C c1, c2; local
136 static_assert(noexcept(swap(c1, c2)), "");
140 C c1, c2; local
141 static_assert(!noexcept(swap(c1, c2)), "");
146 C c1, c2; local
147 static_assert(!noexcept(swap(c1, c2)), "")
153 C c1, c2; local
158 C c1, c2; local
163 C c1, c2; local
168 C c1, c2; local
173 C c1, c2; local
178 C c1, c2; local
183 C c1, c2; local
188 C c1, c2; local
194 C c1, c2; local
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.swap/ |
| swap_noexcept.pass.cpp | 122 C c1, c2; local
123 static_assert(noexcept(swap(c1, c2)), "");
128 C c1, c2; local
129 static_assert(noexcept(swap(c1, c2)), "");
134 C c1, c2; local
135 static_assert(noexcept(swap(c1, c2)), "");
139 C c1, c2; local
140 static_assert(!noexcept(swap(c1, c2)), "");
145 C c1, c2; local
146 static_assert(!noexcept(swap(c1, c2)), "")
152 C c1, c2; local
157 C c1, c2; local
162 C c1, c2; local
167 C c1, c2; local
172 C c1, c2; local
177 C c1, c2; local
182 C c1, c2; local
187 C c1, c2; local
192 C c1, c2; local
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/unord.multiset.swap/ |
| swap_noexcept.pass.cpp | 121 C c1, c2; local
122 static_assert(noexcept(swap(c1, c2)), "");
127 C c1, c2; local
128 static_assert(noexcept(swap(c1, c2)), "");
133 C c1, c2; local
134 static_assert(noexcept(swap(c1, c2)), "");
138 C c1, c2; local
139 static_assert(!noexcept(swap(c1, c2)), "");
144 C c1, c2; local
145 static_assert(!noexcept(swap(c1, c2)), "")
151 C c1, c2; local
156 C c1, c2; local
161 C c1, c2; local
166 C c1, c2; local
171 C c1, c2; local
176 C c1, c2; local
181 C c1, c2; local
186 C c1, c2; local
192 C c1, c2; local
[all...] |
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
| swap_noexcept.pass.cpp | 121 C c1, c2; local
122 static_assert(noexcept(swap(c1, c2)), "");
127 C c1, c2; local
128 static_assert(noexcept(swap(c1, c2)), "");
133 C c1, c2; local
134 static_assert(noexcept(swap(c1, c2)), "");
138 C c1, c2; local
139 static_assert(!noexcept(swap(c1, c2)), "");
144 C c1, c2; local
145 static_assert(!noexcept(swap(c1, c2)), "")
151 C c1, c2; local
156 C c1, c2; local
161 C c1, c2; local
166 C c1, c2; local
171 C c1, c2; local
176 C c1, c2; local
181 C c1, c2; local
186 C c1, c2; local
192 C c1, c2; local
[all...] |
| /external/libvpx/libvpx/vp8/encoder/ |
| dct.c | 19 int a1, b1, c1, d1; local
27 c1 = ((ip[1] - ip[2]) * 8);
33 op[1] = (c1 * 2217 + d1 * 5352 + 14500)>>12;
34 op[3] = (d1 * 2217 - c1 * 5352 + 7500)>>12;
46 c1 = ip[4] - ip[8];
52 op[4] =((c1 * 2217 + d1 * 5352 + 12000)>>16) + (d1!=0);
53 op[12] = (d1 * 2217 - c1 * 5352 + 51000)>>16;
69 int a1, b1, c1, d1; local
79 c1 = ((ip[1] - ip[3]) * 4);
83 op[1] = b1 + c1;
[all...] |
| /external/mockito/src/org/mockito/internal/creation/ |
| SerializableMockitoMethodProxy.java | 15 private final Class<?> c1;
field in class:SerializableMockitoMethodProxy
24 c1 = (Class<?>) Whitebox.getInternalState(info, "c1");
34 methodProxy = MethodProxy.create(c1, c2, desc, name, superName);
|
| /external/pcre/dist/ |
| pcre_string_utils.c | 70 pcre_uchar c1; local
75 c1 = *str1++;
77 if (c1 != c2)
78 return ((c1 > c2) << 1) - 1;
89 pcre_uchar c1; local
94 c1 = UCHAR21INC(str1);
96 if (c1 != c2)
97 return ((c1 > c2) << 1) - 1;
109 pcre_uchar c1; local
114 c1 = *str1++
129 pcre_uchar c1; local
159 pcre_uchar c1; local
177 pcre_uchar c1; local
[all...] |
| /external/skia/gm/ |
| displacement.cpp | 30 SkColor c1 = sk_tool_utils::color_to_565(0xFF244484); variable
34 sk_tool_utils::create_checkerboard_bitmap(80, 80, c1, c2, 8)));
36 sk_tool_utils::create_checkerboard_bitmap(64, 64, c1, c2, 8)));
38 sk_tool_utils::create_checkerboard_bitmap(96, 96, c1, c2, 8)));
40 SkImage::NewFromBitmap(sk_tool_utils::create_checkerboard_bitmap(96, 64, c1, c2, 8)));
42 sk_tool_utils::create_checkerboard_bitmap(64, 96, c1, c2, 8)));
|
| /external/skia/samplecode/ |
| Sample2PtRadial.cpp | 34 SkPoint c1 = { 100, 100 }; local
36 SkShader* s = SkGradientShader::CreateTwoPointConical(c0, r0, c1, r1, colors,
|
| /external/testng/src/test/java/test/testng249/ |
| VerifyTest.java | 25 XmlClass c1 = new XmlClass(B.class); local
26 c1.setIncludedMethods(Arrays.asList(new XmlInclude[] { new XmlInclude("b")}));
29 test.setXmlClasses(Arrays.asList(new XmlClass[] { c1, c2 }));
|
| /external/valgrind/massif/tests/ |
| overloaded-new.cpp | 51 char* c1 = new char[2000]; local
55 delete [] c1;
|
| /external/valgrind/memcheck/tests/ |
| leak-cycle.c | 39 struct n *volatile c1, *volatile c2; local
44 c1 = mkcycle();
47 c1 = c2 = 0;
50 c1 = mkcycle();
55 if (c1 < c2)
56 c2->r = c1;
58 c1->r = c2;
60 c1 = c2 = 0;
63 c1 = mkcycle();
66 c1->r = c2
[all...] |
| varinfo4.c | 36 typedef struct { short c1; char* c2[3]; } XX; member in struct:__anon26190
47 croak(1 + (char*)(&a[3].xyzzy[x*y].c1));
51 return a[3].xyzzy[x*y].c1;
|
| /external/valgrind/memcheck/tests/linux/ |
| stack_changes.c | 57 int c1 = init_context(&ctx1); local
65 VALGRIND_STACK_DEREGISTER(c1);
|
| /external/vulkan-validation-layers/loader/ |
| murmurhash.c | 36 uint32_t c1 = 0xcc9e2d51; local
61 k *= c1;
82 k *= c1;
|
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_TransformDequantLumaDCFromPair.c | 88 int c1 = pData[i+1]; local
91 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
92 pData[i+1] = (OMX_S16)(c0+c1-c2-c3);
93 pData[i+2] = (OMX_S16)(c0-c1-c2+c3);
94 pData[i+3] = (OMX_S16)(c0-c1+c2-c3);
101 int c1 = pData[i+4]; local
104 pData[i+0] = (OMX_S16)(c0+c1+c2+c3);
105 pData[i+4] = (OMX_S16)(c0+c1-c2-c3);
106 pData[i+8] = (OMX_S16)(c0-c1-c2+c3);
107 pData[i+12] = (OMX_S16)(c0-c1+c2-c3)
[all...] |
| /frameworks/minikin/libs/minikin/ |
| GraphemeBreak.cpp | 84 uint32_t c1 = 0; local
87 U16_PREV(buf, start, offset_back, c1);
89 int32_t p1 = tailoredGraphemeClusterBreak(c1);
124 U16_PREV(buf, start, offset_back, c1);
125 if (tailoredGraphemeClusterBreak(c1) != U_GCB_REGIONAL_INDICATOR) {
126 offset_back += U16_LENGTH(c1);
147 if (u_getIntPropertyValue(c1, UCHAR_CANONICAL_COMBINING_CLASS) == 9 // virama
148 && !isPureKiller(c1)
153 if (c1 == 0x200D && isEmoji(c2) && offset_back > start) {
168 if (c1 == 0xFE0F && offset_back > start)
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
| dct.c | 17 int a1, b1, c1, d1; local
25 c1 = ((ip[1] - ip[2]) * 8);
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]) * 4);
81 op[1] = b1 + c1;
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| resize_size.pass.cpp | 43 test(C& c1, int size)
46 std::size_t c1_osize = c1.size();
47 c1.resize(size);
48 assert(c1.size() == size);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 CI i = c1.begin();
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| resize_size_value.pass.cpp | 43 test(C& c1, int size, int x)
46 std::size_t c1_osize = c1.size();
47 c1.resize(size, x);
48 assert(c1.size() == size);
49 assert(distance(c1.begin(), c1.end()) == c1.size());
50 CI i = c1.begin();
51 for (int j = 0; j < std::min(c1_osize, c1.size()); ++j, ++i)
53 for (int j = c1_osize; j < c1.size(); ++j, ++i
62 C c1 = make<C>(N, start); local
[all...] |
| shrink_to_fit.pass.cpp | 43 test(C& c1)
45 C s = c1;
46 c1.shrink_to_fit();
47 assert(c1 == s);
55 C c1 = make<C>(N, start); local
56 test(c1);
|
