| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/vector/vector.special/ |
| db_swap_1.pass.cpp | 31 std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 std::vector<int>::iterator i2 = c2.begin();
34 swap(c1, c2);
36 c2.erase(i1);
45 std::vector<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
47 std::vector<int, min_allocator<int>>::iterator i2 = c2.begin();
48 swap(c1, c2);
50 c2.erase(i1);
|
| /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);
|
| CityGmtOffsetComparator.java | 26 public int compare(CityObj c1, CityObj c2) {
29 int offset2 = TimeZone.getTimeZone(c2.mTimeZone).getOffset(currentTime);
31 getCityNameComparator().compare(c1, c2);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
| remove.pass.cpp | 28 C c2(std::begin(t2), std::end(t2));
30 assert(c1 == c2);
37 C c2; local
39 assert(c1 == c2);
47 C c2(std::begin(t2), std::end(t2));
49 assert(c1 == c2);
55 C c2; local
57 assert(c1 == c2);
65 C c2(std::begin(t2), std::end(t2));
67 assert(c1 == c2);
85 C c2; local
103 C c2; local
[all...] |
| remove_if.pass.cpp | 33 C c2(std::begin(t2), std::end(t2));
35 assert(c1 == c2);
42 C c2; local
44 assert(c1 == c2);
52 C c2(std::begin(t2), std::end(t2));
54 assert(c1 == c2);
60 C c2; local
62 assert(c1 == c2);
70 C c2(std::begin(t2), std::end(t2));
72 assert(c1 == c2);
90 C c2; local
108 C c2; local
[all...] |
| unique.pass.cpp | 28 C c2(std::begin(t2), std::end(t2));
30 assert(c1 == c2);
38 C c2(std::begin(t2), std::end(t2));
40 assert(c1 == c2);
48 C c2(std::begin(t2), std::end(t2));
50 assert(c1 == c2);
56 C c2; local
58 assert(c1 == c2);
66 C c2(std::begin(t2), std::end(t2));
68 assert(c1 == c2);
105 C c2; local
[all...] |
| unique_pred.pass.cpp | 33 C c2(std::begin(t2), std::end(t2));
35 assert(c1 == c2);
43 C c2(std::begin(t2), std::end(t2));
45 assert(c1 == c2);
53 C c2(std::begin(t2), std::end(t2));
55 assert(c1 == c2);
61 C c2; local
63 assert(c1 == c2);
71 C c2(std::begin(t2), std::end(t2));
73 assert(c1 == c2);
110 C c2; local
[all...] |
| /external/apache-http/src/org/apache/http/cookie/ |
| CookieIdentityComparator.java | 51 public int compare(final Cookie c1, final Cookie c2) {
52 int res = c1.getName().compareTo(c2.getName());
59 String d2 = c2.getDomain();
|
| /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...] |
| /external/chromium/chrome/browser/ui/views/ |
| theme_helpers.h | 24 SkColor* c1, SkColor* c2);
|
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.list/ |
| p7-0x-fixits.cpp | 10 struct {char c;} c2 = {x}; local
|
| /external/clang/test/CodeGen/ |
| constant-comparison.c | 6 int *c2 = 3 != 3LL ? &b : &a; variable
|
| /external/clang/test/Parser/ |
| c11-noreturn.c | 10 char _Noreturn c2; // expected-error {{'_Noreturn' can only appear on functions}} variable
|
| /external/clang/test/SemaCXX/ |
| vtable-instantiation.cc | 10 template<class T2> struct C2 {
11 void c2() { function in struct:PR8640::C2
17 C2<int*> c2; local
18 c2.c2(); // expected-note {{in instantiation of member function}}
|
| /external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/ |
| TriangleAxisComparator.java | 49 Vector3f c2 = o2.getCenter(); local
51 case 0: v1 = c1.x; v2 = c2.x; break;
52 case 1: v1 = c1.y; v2 = c2.y; break;
53 case 2: v1 = c1.z; v2 = c2.z; break;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| 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.ops/ |
| merge.pass.cpp | 26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
27 c1.merge(c2);
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
37 c1.merge(c2);
|
| merge_comp.pass.cpp | 27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 c1.merge(c2, std::greater<int>());
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
38 c1.merge(c2, std::greater<int>());
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_incomplete.py | 21 c2 = cell()
22 c2.name = "bar"
24 c1.next = pointer(c2)
25 c2.next = pointer(c1)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
| test_incomplete.py | 21 c2 = cell()
22 c2.name = "bar"
24 c1.next = pointer(c2)
25 c2.next = pointer(c1)
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| insert_iter_iter.pass.cpp | 47 test(int P, C& c1, const C& c2)
53 CI i = c1.insert(c1.begin() + P, BCI(c2.begin()), BCI(c2.end()));
55 assert(c1.size() == c1_osize + c2.size());
60 for (int j = 0; j < c2.size(); ++j, ++i)
77 C c2 = make<C>(M); local
78 test(i, c1, c2);
86 C c2 = make<C>(M); local
87 test(i, c1, c2);
95 C c2 = make<C>(M) local
104 C c2 = make<C>(M); local
113 C c2 = make<C>(M); local
122 C c2 = make<C>(M); local
160 C c2 = make<C>(M); local
169 C c2 = make<C>(M); local
178 C c2 = make<C>(M); local
187 C c2 = make<C>(M); local
196 C c2 = make<C>(M); local
[all...] |
| /external/libffi/testsuite/libffi.call/ |
| struct5.c | 12 char c2; member in struct:__anon22168
18 ts1.c2 -= ts2.c2;
53 ts5_arg1.c2 = 6;
55 ts5_arg2.c2 = 3;
60 CHECK(ts5_result->c2 == 3);
|
| /external/chromium_org/third_party/icu/source/common/ |
| utrie.h | 183 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) { \
192 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
220 /** Internal next-post-increment: get the next code point (c, c2) and its data */
221 #define _UTRIE_NEXT(trie, data, src, limit, c, c2, result, resultType) { \
224 (c2)=0; \
226 } else if((src)!=(limit) && UTF_IS_TRAIL((c2)=*(src))) { \
228 _UTRIE_GET_FROM_PAIR((trie), data, (c), (c2), (result), resultType); \
231 (c2)=0; \
236 /** Internal previous: get the previous code point (c, c2) and its data */
237 #define _UTRIE_PREVIOUS(trie, data, start, src, c, c2, result, resultType) {
[all...] |
| /external/icu4c/common/ |
| utrie.h | 184 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) { \
193 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
221 /** Internal next-post-increment: get the next code point (c, c2) and its data */
222 #define _UTRIE_NEXT(trie, data, src, limit, c, c2, result, resultType) { \
225 (c2)=0; \
227 } else if((src)!=(limit) && U16_IS_TRAIL((c2)=*(src))) { \
229 _UTRIE_GET_FROM_PAIR((trie), data, (c), (c2), (result), resultType); \
232 (c2)=0; \
237 /** Internal previous: get the previous code point (c, c2) and its data */
238 #define _UTRIE_PREVIOUS(trie, data, start, src, c, c2, result, resultType) {
[all...] |
| /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...] |
