/external/valgrind/memcheck/tests/ |
H A D | long_namespace_xml.stdout.exp | 1 I'm in an asininely long namespace!
|
/external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
H A D | ctor_iter_iter.pass.cpp | 22 int* an = a + sizeof(a)/sizeof(a[0]); local 23 std::priority_queue<int> q(a, an); 24 assert(q.size() == static_cast<std::size_t>(an - a));
|
H A D | ctor_iter_iter_comp.pass.cpp | 23 int* an = a + sizeof(a)/sizeof(a[0]); local 25 q(a, an, std::greater<int>()); 26 assert(q.size() == static_cast<std::size_t>(an - a));
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
H A D | construct_iter_iter.pass.cpp | 37 bool* an = a + sizeof(a)/sizeof(a[0]); local 38 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); 39 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); 40 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); 41 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); 42 test<std::vector<bool> >(a, an); 44 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); 45 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); 46 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); 47 test<std::vector<bool, min_allocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); [all...] |
H A D | construct_iter_iter_alloc.pass.cpp | 38 bool* an = a + sizeof(a)/sizeof(a[0]); local 41 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); 42 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); 43 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); 44 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); 45 test<std::vector<bool> >(a, an, alloc); 50 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); 51 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); 52 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); 53 test<std::vector<bool, min_allocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), allo [all...] |
H A D | reference.swap.pass.cpp | 24 bool* an = a + sizeof(a)/sizeof(a[0]); local 26 std::vector<bool> v(a, an);
|
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
H A D | copy_alloc.pass.cpp | 33 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), 39 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), 46 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()),
|
H A D | iter_iter_alloc.pass.cpp | 45 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); 47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); 48 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5)); 49 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6)); 51 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); 52 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); 53 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator<int>()); 54 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator<int>());
|
H A D | move.pass.cpp | 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 30 for (int* p = ab; p < an; ++p) 33 for (int* p = ab; p < an; ++p) 42 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 45 for (int* p = ab; p < an; ++p) 48 for (int* p = ab; p < an; ++p) 57 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 60 for (int* p = ab; p < an; ++p) 63 for (int* p = ab; p < an; ++p)
|
H A D | move_alloc.pass.cpp | 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 30 for (int* p = ab; p < an; ++p) 33 for (int* p = ab; p < an; ++p) 42 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 45 for (int* p = ab; p < an; ++p) 48 for (int* p = ab; p < an; ++p) 57 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 60 for (int* p = ab; p < an; ++p) 63 for (int* p = ab; p < an; ++p) 72 int* an local [all...] |
H A D | move_assign.pass.cpp | 27 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 30 for (int* p = ab; p < an; ++p) 33 for (int* p = ab; p < an; ++p) 43 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 46 for (int* p = ab; p < an; ++p) 49 for (int* p = ab; p < an; ++p) 59 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 62 for (int* p = ab; p < an; ++p) 65 for (int* p = ab; p < an; ++p) 75 int* an local [all...] |
/external/annotation-tools/asmx/src/org/objectweb/asm/tree/ |
H A D | MemberNode.java | 78 * Visits an annotation of this class, field or method. 88 AnnotationNode an = new AnnotationNode(desc); 93 visibleAnnotations.add(an); 98 invisibleAnnotations.add(an); 100 return an; 106 * @param attr an attribute.
|
H A D | FieldNode.java | 76 * the field does not have an initial value, must be an {@link Integer}, a 91 * <tt>null</tt> if the field does not have an initial value, must 92 * be an {@link Integer}, a {@link Float}, a {@link Long}, a 119 AnnotationNode an = (AnnotationNode) visibleAnnotations.get(i); 120 an.accept(fv.visitAnnotation(an.desc, true)); 124 AnnotationNode an = (AnnotationNode) invisibleAnnotations.get(i); 125 an.accept(fv.visitAnnotation(an [all...] |
/external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
H A D | construct_iter_iter.pass.cpp | 41 int* an = a + sizeof(a) / sizeof(a[0]); local 43 input_iterator<const int*>(an)); 45 forward_iterator<const int*>(an)); 47 bidirectional_iterator<const int*>(an)); 49 random_access_iterator<const int*>(an)); 50 test<std::vector<int> >(a, an); 53 input_iterator<const int*>(a), input_iterator<const int*>(an)); 56 forward_iterator<const int*>(a), forward_iterator<const int*>(an)); 59 bidirectional_iterator<const int*>(an)); 62 random_access_iterator<const int*>(an)); [all...] |
/external/curl/docs/cmdline-opts/ |
H A D | data-ascii.d | 6 This is just an alias for --data.
|
H A D | show-error.d | 5 When used with --silent, it makes curl show an error message if it fails.
|
/external/python/cpython2/Lib/plat-aix3/ |
H A D | regen | 4 *) echo Probably not on an AIX 3 system 1>&2
|
/external/python/cpython2/Lib/plat-aix4/ |
H A D | regen | 4 *) echo Probably not on an AIX 4 system 1>&2
|
/external/llvm/test/MC/AsmParser/ |
H A D | defsym_error2.s | 2 # CHECK: error: Value is not an integer: a
|
/external/llvm/test/MC/MachO/AArch64/ |
H A D | classrefs.s | 3 ; Test that we produce an external relocation with Lbar. We could also produce 4 ; an internal relocation. We just have to be careful to not use another symbol.
|
/external/python/cpython2/Lib/plat-irix5/ |
H A D | regen | 4 *) echo Probably not on an IRIX system 1>&2
|
/external/python/cpython2/Lib/plat-irix6/ |
H A D | regen | 5 *) echo Probably not on an IRIX system 1>&2
|
/external/testng/src/main/java/org/testng/junit/ |
H A D | JUnit4TestRecognizer.java | 17 for (Annotation an: c.getAnnotations()) { 18 if (RunWith.class.isAssignableFrom(an.annotationType())) {
|
/external/syslinux/core/lwip/src/core/snmp/ |
H A D | mib_structs.c | 463 struct mib_array_node *an; local 469 an = (struct mib_array_node *)node; 471 while ((i < an->maxlength) && (an->objid[i] != *ident)) 475 if (i < an->maxlength) 478 LWIP_DEBUGF(SNMP_MIB_DEBUG,("an->objid[%"U16_F"]==%"S32_F" *ident==%"S32_F"\n",i,an->objid[i],*ident)); 479 if (an->nptr[i] == NULL) 485 return (struct mib_node*)an; 492 node = an 659 struct mib_array_node *an; local 696 struct mib_array_node *an; local [all...] |
/external/clang/test/Parser/ |
H A D | nullability.c | 15 # error Nullability should always be supported as an extension
|