/external/libcxx/test/containers/sequences/deque/deque.special/ |
move_backward.pass.cpp | 54 C c2 = make<C>(N); local 55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); 56 assert(c1 == c2); 57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); 58 assert(c1 == c2); 59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 60 assert(c1 == c2); [all...] |
swap.pass.cpp | 46 C c2 = make<C>(M); local 48 C c2_save = c2; 49 swap(c1, c2); 51 assert(c2 == c1_save); 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); 70 swap(c1, c2); 73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); 74 assert(c2.get_allocator() == A(2)); 81 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); 82 swap(c1, c2); [all...] |
/external/libcxx/test/containers/sequences/list/list.modifiers/ |
emplace.pass.cpp | 57 std::list<A> c2; local 58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5); 81 std::list<A, min_allocator<A>> c2; local 82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
insert_iter_size_value.pass.cpp | 68 std::list<int> c2; local 69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 98 std::list<int, min_allocator<int>> c2; local 99 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
/external/libcxx/test/containers/sequences/vector/vector.modifiers/ |
emplace.pass.cpp | 113 std::vector<A> c2; local 114 std::vector<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5); 146 std::vector<A, min_allocator<A>> c2; local 147 std::vector<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
/external/libvpx/libvpx/vp8/encoder/ |
dct.c | 68 int a2, b2, c2, d2; local 100 c2 = b1 - c1; 105 c2 += c2<0; 110 op[8] = (c2+3) >> 3;
|
/external/lzma/CPP/Common/ |
MyString.cpp | 141 wchar_t c2 = *s2++;
143 wchar_t u2 = MyCharUpper(c2);
159 unsigned char c2 = (unsigned char)*s2++;
local 160 if (c1 < c2) return -1;
161 if (c1 > c2) return 1;
171 wchar_t c2 = *s2++;
local 172 if (c1 < c2) return -1;
173 if (c1 > c2) return 1;
183 wchar_t c2 = *s2++;
local 184 if (c1 != c2)
[all...] |
UTFConvert.cpp | 40 Byte c2;
local 43 c2 = (Byte)src[srcPos++];
44 if (c2 < 0x80 || c2 >= 0xC0)
47 value |= (c2 - 0x80);
96 UInt32 c2;
local 99 c2 = src[srcPos++];
100 if (c2 < 0xDC00 || c2 >= 0xE000)
102 value = (((value - 0xD800) << 10) | (c2 - 0xDC00)) + 0x10000; [all...] |
/external/mockito/src/org/mockito/internal/creation/ |
SerializableMockitoMethodProxy.java | 16 private final Class<?> c2;
field in class:SerializableMockitoMethodProxy 25 c2 = (Class<?>) Whitebox.getInternalState(info, "c2");
34 methodProxy = MethodProxy.create(c1, c2, desc, name, superName);
|
/external/valgrind/main/massif/tests/ |
overloaded-new.cpp | 52 char* c2 = new (std::nothrow) char[2000]; local 56 delete [] c2;
|
/external/valgrind/main/memcheck/tests/ |
leak-cycle.c | 39 struct n *volatile c1, *volatile c2; local 45 c2 = mkcycle(); 47 c1 = c2 = 0; 51 c2 = mkcycle(); 55 if (c1 < c2) 56 c2->r = c1; 58 c1->r = c2; 60 c1 = c2 = 0; 64 c2 = mkcycle(); 66 c1->r = c2; [all...] |
varinfo4.c | 36 typedef struct { short c1; char* c2[3]; } XX; member in struct:__anon36788 49 croak( 1 + (char*)(&a[3].xyzzy[x*y].c2[2]) );
|
/external/valgrind/main/memcheck/tests/linux/ |
stack_changes.c | 58 int c2 = init_context(&ctx2); local 67 VALGRIND_STACK_DEREGISTER(c2);
|
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
omxVCM4P10_TransformDequantLumaDCFromPair.c | 74 int c2 = pData[i+2]; local 76 pData[i+0] = (OMX_S16)(c0+c1+c2+c3); 77 pData[i+1] = (OMX_S16)(c0+c1-c2-c3); 78 pData[i+2] = (OMX_S16)(c0-c1-c2+c3); 79 pData[i+3] = (OMX_S16)(c0-c1+c2-c3); 87 int c2 = pData[i+8]; local 89 pData[i+0] = (OMX_S16)(c0+c1+c2+c3); 90 pData[i+4] = (OMX_S16)(c0+c1-c2-c3); 91 pData[i+8] = (OMX_S16)(c0-c1-c2+c3); 92 pData[i+12] = (OMX_S16)(c0-c1+c2-c3) [all...] |
/frameworks/base/core/tests/coretests/src/android/widget/ |
TextViewTest.java | 49 char[] c2 = new char[7]; local 50 ((GetChars) newText).getChars(1, 4, c2, 2); 51 assertEquals('\0', c2[1]); 52 assertEquals(' ', c2[2]); 53 assertEquals('W', c2[3]); 54 assertEquals('o', c2[4]); 55 assertEquals('\0', c2[5]);
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/encoder/ |
dct.c | 68 int a2, b2, c2, d2; local 100 c2 = b1 - c1; 105 c2 += c2<0; 110 op[8] = (c2+3) >> 3;
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
assign_iter_iter.pass.cpp | 45 test(C& c1, const C& c2) 48 c1.assign(c2.begin(), c2.end()); 50 assert(c1 == c2); 60 C c2 = make<C>(M); local 61 test(c1, c2); 66 testI(C& c1, const C& c2) 71 c1.assign(ICI(c2.begin()), ICI(c2.end())); 73 assert(c1 == c2); 83 C c2 = make<C>(M); local [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
copy.pass.cpp | 55 C c2 = make<C>(N); local 56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); 57 assert(c1 == c2); 58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); 59 assert(c1 == c2); 60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 61 assert(c1 == c2); [all...] |
copy_backward.pass.cpp | 54 C c2 = make<C>(N); local 55 assert(std::copy_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); 56 assert(c1 == c2); 57 assert(std::copy_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); 58 assert(c1 == c2); 59 assert(std::copy_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 60 assert(c1 == c2); [all...] |
move.pass.cpp | 54 C c2 = make<C>(N); local 55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); 56 assert(c1 == c2); 57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); 58 assert(c1 == c2); 59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); 60 assert(c1 == c2); [all...] |
move_backward.pass.cpp | 54 C c2 = make<C>(N); local 55 assert(std::move_backward(c1.cbegin(), c1.cend(), c2.end()) == c2.begin()); 56 assert(c1 == c2); 57 assert(std::move_backward(c2.cbegin(), c2.cend(), c1.end()) == c1.begin()); 58 assert(c1 == c2); 59 assert(std::move_backward(c1.cbegin(), c1.cend(), RAI(c2.end())) == RAI(c2.begin())); 60 assert(c1 == c2); [all...] |
swap.pass.cpp | 46 C c2 = make<C>(M); local 48 C c2_save = c2; 49 swap(c1, c2); 51 assert(c2 == c1_save); 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); 70 swap(c1, c2); 73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); 74 assert(c2.get_allocator() == A(2)); 81 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); 82 swap(c1, c2); [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
emplace.pass.cpp | 57 std::list<A> c2; local 58 std::list<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5); 81 std::list<A, min_allocator<A>> c2; local 82 std::list<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|
insert_iter_size_value.pass.cpp | 68 std::list<int> c2; local 69 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1); 98 std::list<int, min_allocator<int>> c2; local 99 std::list<int, min_allocator<int>>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.modifiers/ |
emplace.pass.cpp | 120 std::vector<A> c2; local 121 std::vector<A>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5); 153 std::vector<A, min_allocator<A>> c2; local 154 std::vector<A, min_allocator<A>>::iterator i = c1.emplace(c2.cbegin(), 2, 3.5);
|