/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
set_intersection_comp.pass.cpp | 32 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 33 const int sa = sizeof(ia)/sizeof(ia[0]); 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), 44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
set_symmetric_difference.pass.cpp | 31 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 32 const int sa = sizeof(ia)/sizeof(ia[0]); 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), 43 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
set_symmetric_difference_comp.pass.cpp | 33 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 34 const int sa = sizeof(ia)/sizeof(ia[0]); 40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), 46 Iter2(ia), Iter2(ia+sa),
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
set_union.pass.cpp | 30 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 31 const int sa = sizeof(ia)/sizeof(ia[0]); 37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), 42 Iter2(ia), Iter2(ia+sa), OutIter(ic));
|
set_union_comp.pass.cpp | 32 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 33 const int sa = sizeof(ia)/sizeof(ia[0]); 39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), 44 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_keeprefs.py | 71 ia = INTARR() 72 self.assertEqual(ia._objects, None) 73 ia[0] = 1 74 ia[1] = 2 75 ia[2] = 3 76 self.assertEqual(ia._objects, None) 87 x.a = ia
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/ |
test_keeprefs.py | 71 ia = INTARR() 72 self.assertEqual(ia._objects, None) 73 ia[0] = 1 74 ia[1] = 2 75 ia[2] = 3 76 self.assertEqual(ia._objects, None) 87 x.a = ia
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/net/ |
InetAddressThreadTest.java | 85 InetAddress ia = InetAddress.getByName(lookupName); local 86 String hostName = ia.getHostName(); 87 String hostAddress = ia.getHostAddress();
|
/external/clang/test/CodeGenCXX/ |
vtable-layout-abi-examples.cpp | 32 int ia; member in struct:Test1::A
|
/external/clang/test/Sema/ |
ms_class_layout.cpp | 100 class IA { 102 virtual ~IA(){} 103 virtual void ia() = 0; 106 class ICh : public virtual IA { 109 virtual void ia(){} function in class:ICh 396 // CHECK: 0 | class IA 397 // CHECK-NEXT: 0 | (IA vftable pointer) 404 // CHECK-NEXT: 8 | (vtordisp for vbase IA) 405 // CHECK-NEXT: 12 | class IA (virtual base) 406 // CHECK-NEXT: 12 | (IA vftable pointer [all...] |
/external/qemu/slirp/ |
ip_input.c | 506 register struct in_ifaddr *ia; local 550 ia = (struct in_ifaddr *) 552 if (ia == 0) { 580 if ((ia = (INA)ifa_ifwithdstaddr((SA)&ipaddr)) == 0) 581 ia = (INA)ifa_ifwithnet((SA)&ipaddr); 583 ia = ip_rtaddr(ipaddr.sin_addr); 584 if (ia == 0) { 590 bcopy((caddr_t)&(IA_SIN(ia)->sin_addr), 616 if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == 0 && 617 (ia = ip_rtaddr(ipaddr.sin_addr)) == 0) [all...] |
/external/qemu/slirp-android/ |
ip_input.c | 506 register struct in_ifaddr *ia; local 550 ia = (struct in_ifaddr *) 552 if (ia == 0) { 580 if ((ia = (INA)ifa_ifwithdstaddr((SA)&ipaddr)) == 0) 581 ia = (INA)ifa_ifwithnet((SA)&ipaddr); 583 ia = ip_rtaddr(ipaddr.sin_addr); 584 if (ia == 0) { 590 bcopy((caddr_t)&(IA_SIN(ia)->sin_addr), 616 if ((ia = (INA)ifa_ifwithaddr((SA)&ipaddr)) == 0 && 617 (ia = ip_rtaddr(ipaddr.sin_addr)) == 0) [all...] |
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
set_difference_comp.pass.cpp | 32 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 33 const int sa = sizeof(ia)/sizeof(ia[0]); 39 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), 46 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
set_difference_comp.pass.cpp | 32 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local 33 const int sa = sizeof(ia)/sizeof(ia[0]); 39 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), 46 Iter2(ia), Iter2(ia+sa), OutIter(ic), std::less<int>());
|
/external/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
unique_copy_pred.pass.cpp | 40 const int ia[] = {0}; local 41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 44 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja), count_equal());
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
unique_copy_pred.pass.cpp | 40 const int ia[] = {0}; local 41 const unsigned sa = sizeof(ia)/sizeof(ia[0]); 44 OutIter r = std::unique_copy(InIter(ia), InIter(ia+sa), OutIter(ja), count_equal());
|
/external/libcxx/test/algorithms/alg.sorting/alg.sort/sort/ |
sort.pass.cpp | 67 int ia[sa]; local 70 test_sort_driver(ia, ia+sa, i);
|
/external/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/ |
stable_sort.pass.cpp | 67 int ia[sa]; local 70 test_sort_driver(ia, ia+sa, i);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/sort/ |
sort.pass.cpp | 67 int ia[sa]; local 70 test_sort_driver(ia, ia+sa, i);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.sort/stable.sort/ |
stable_sort.pass.cpp | 67 int ia[sa]; local 70 test_sort_driver(ia, ia+sa, i);
|
/external/qemu/util/ |
oslib-win32.c | 153 int inet_aton(const char *cp, struct in_addr *ia) 159 ia->s_addr = addr;
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/ |
date-format-tofte.js | 272 var ia = input.split(""); 274 while (ia[ij]) { 275 if (ia[ij] == "\\") { 277 ia.splice(ij,1); 279 if (arrayExists(switches,ia[ij])) { 280 ia[ij] = eval(ia[ij] + "()"); 289 return ia.join("");
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/ |
date-format-tofte.js | 272 var ia = input.split(""); 274 while (ia[ij]) { 275 if (ia[ij] == "\\") { 277 ia.splice(ij,1); 279 if (arrayExists(switches,ia[ij])) { 280 ia[ij] = eval(ia[ij] + "()"); 289 return ia.join("");
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/ |
date-format-tofte.js | 272 var ia = input.split(""); 274 while (ia[ij]) { 275 if (ia[ij] == "\\") { 277 ia.splice(ij,1); 279 if (arrayExists(switches,ia[ij])) { 280 ia[ij] = eval(ia[ij] + "()"); 289 return ia.join("");
|
/external/srec/srec/include/ |
swicms.h | 102 #define swicms_compare(swicms,ia)
|