/external/valgrind/main/memcheck/tests/ |
H A D | long_namespace_xml.stdout.exp | 1 I'm in an asininely long namespace!
|
/external/chromium_org/third_party/WebKit/ManualTests/inspector/resources/ |
H A D | script-error.js | 2 this.will.be.an.error = 1;
|
/external/libcxx/test/containers/sequences/vector/vector.cons/ |
H A D | construct_iter_iter.pass.cpp | 35 int* an = a + sizeof(a)/sizeof(a[0]); local 36 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an)); 37 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an)); 38 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an)); 39 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an)); 40 test<std::vector<int> >(a, an); 42 test<std::vector<int, stack_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an)); 43 test<std::vector<int, stack_allocator<int, 18> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an)); 44 test<std::vector<int, stack_allocator<int, 18> > >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an)); 45 test<std::vector<int, stack_allocator<int, 18> > >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an)); [all...] |
H A D | construct_iter_iter_alloc.pass.cpp | 48 int* an = a + sizeof(a)/sizeof(a[0]); local 50 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); 51 test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); 52 test<std::vector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc); 53 test<std::vector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an), alloc); 54 test<std::vector<int> >(a, an, alloc); 59 int* an = a + sizeof(a)/sizeof(a[0]); local 61 test<std::vector<int, min_allocator<int>> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); 62 test<std::vector<int, min_allocator<int>> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); 63 test<std::vector<int, min_allocator<int>> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), allo [all...] |
H A D | copy.pass.cpp | 34 int* an = a + sizeof(a)/sizeof(a[0]); local 35 test(std::vector<int>(a, an)); 54 int* an = a + sizeof(a)/sizeof(a[0]); local 55 test(std::vector<int, min_allocator<int>>(a, an));
|
H A D | copy_alloc.pass.cpp | 34 int* an = a + sizeof(a)/sizeof(a[0]); local 35 test(std::vector<int>(a, an), std::allocator<int>()); 52 int* an = a + sizeof(a)/sizeof(a[0]); local 53 test(std::vector<int, min_allocator<int>>(a, an), min_allocator<int>());
|
/external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
H A D | ctor_iter_iter.pass.cpp | 21 int* an = a + sizeof(a)/sizeof(a[0]); local 22 std::priority_queue<int> q(a, an); 23 assert(q.size() == an - a);
|
H A D | ctor_iter_iter_comp.pass.cpp | 22 int* an = a + sizeof(a)/sizeof(a[0]); local 24 q(a, an, std::greater<int>()); 25 assert(q.size() == an - a);
|
/external/libcxx/test/containers/sequences/vector.bool/ |
H A D | construct_iter_iter.pass.cpp | 35 bool* an = a + sizeof(a)/sizeof(a[0]); local 36 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); 37 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); 38 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); 39 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an)); 40 test<std::vector<bool> >(a, an); 42 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an)); 43 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an)); 44 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an)); 45 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 | 36 bool* an = a + sizeof(a)/sizeof(a[0]); local 39 test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); 40 test<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); 41 test<std::vector<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); 42 test<std::vector<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); 43 test<std::vector<bool> >(a, an, alloc); 48 test<std::vector<bool, min_allocator<bool>> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); 49 test<std::vector<bool, min_allocator<bool>> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); 50 test<std::vector<bool, min_allocator<bool>> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); 51 test<std::vector<bool, min_allocator<bool>> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), allo [all...] |
H A D | copy.pass.cpp | 35 bool* an = a + sizeof(a)/sizeof(a[0]); local 36 test(std::vector<bool>(a, an)); 55 bool* an = a + sizeof(a)/sizeof(a[0]); local 56 test(std::vector<bool, min_allocator<bool>>(a, an));
|
H A D | copy_alloc.pass.cpp | 34 int* an = a + sizeof(a)/sizeof(a[0]); local 35 test(std::vector<bool>(a, an), std::allocator<bool>()); 52 int* an = a + sizeof(a)/sizeof(a[0]); local 53 test(std::vector<bool, min_allocator<bool>>(a, an), min_allocator<bool>());
|
/external/libcxx/test/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 | 40 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); 42 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); 43 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocator<int>(5)); 44 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocator<int>(6)); 46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); 47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); 48 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator<int>()); 49 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator<int>());
|
H A D | iter_iter.pass.cpp | 53 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); 55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); 56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); 57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); 58 test<stack_allocator<int, 4096> >(ab, an); 60 test<min_allocator<int> >(ab, an);
|
H A D | move.pass.cpp | 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 41 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 44 for (int* p = ab; p < an; ++p) 47 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 | 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 29 for (int* p = ab; p < an; ++p) 32 for (int* p = ab; p < an; ++p) 41 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 44 for (int* p = ab; p < an; ++p) 47 for (int* p = ab; p < an; ++p) 56 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 59 for (int* p = ab; p < an; ++p) 62 for (int* p = ab; p < an; ++p) 72 int* an local [all...] |
H A D | move_assign.pass.cpp | 26 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 29 for (int* p = ab; p < an; ++p) 32 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) 58 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 61 for (int* p = ab; p < an; ++p) 64 for (int* p = ab; p < an; ++p) 75 int* an local [all...] |
H A D | copy.pass.cpp | 31 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 32 test(std::deque<int>(ab, an)); 51 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 52 test(std::deque<int, min_allocator<int>>(ab, an));
|
H A D | op_equal.pass.cpp | 32 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 33 test(std::deque<int>(ab, an)); 52 int* an = ab + sizeof(ab)/sizeof(ab[0]); local 53 test(std::deque<int, min_allocator<int>>(ab, an));
|
/external/mockito/cglib-and-asm/src/org/mockito/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 | 66 * the field does not have an initial value, must be an {@link Integer}, a
82 * <tt>null</tt> if the field does not have an initial value, must
83 * be an {@link Integer}, a {@link Float}, a {@link Long}, a
113 AnnotationNode an = (AnnotationNode) visibleAnnotations.get(i);
114 an.accept(fv.visitAnnotation(an.desc, true));
118 AnnotationNode an = (AnnotationNode) invisibleAnnotations.get(i);
119 an.accept(fv.visitAnnotation(an [all...] |
/external/clang/test/Sema/ |
H A D | predef.c | 9 expected-warning {{initializing 'char *' with an expression of type 'const char [1]' discards qualifiers}}
|
/external/llvm/test/MC/Mips/ |
H A D | mips-register-names-invalid.s | 4 # $32 used to trigger an assertion instead of the usual error message due to 5 # an off-by-one bug.
|
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | wpas_kay.c | 67 u8 an, u32 *lowest_pn) 69 return wpa_drv_get_receive_lowest_pn(wpa_s, channel, an, lowest_pn); 74 u8 an, u32 *next_pn) 76 return wpa_drv_get_transmit_next_pn(wpa_s, channel, an, next_pn); 81 u8 an, u32 next_pn) 83 return wpa_drv_set_transmit_next_pn(wpa_s, channel, an, next_pn); 123 static int wpas_create_receive_sa(void *wpa_s, u32 channel, u8 an, argument 126 return wpa_drv_create_receive_sa(wpa_s, channel, an, lowest_pn, sak); 130 static int wpas_enable_receive_sa(void *wpa_s, u32 channel, u8 an) argument 132 return wpa_drv_enable_receive_sa(wpa_s, channel, an); 66 wpas_get_receive_lowest_pn(void *wpa_s, u32 channel, u8 an, u32 *lowest_pn) argument 73 wpas_get_transmit_next_pn(void *wpa_s, u32 channel, u8 an, u32 *next_pn) argument 80 wpas_set_transmit_next_pn(void *wpa_s, u32 channel, u8 an, u32 next_pn) argument 136 wpas_disable_receive_sa(void *wpa_s, u32 channel, u8 an) argument 164 wpas_create_transmit_sa(void *wpa_s, u32 channel, u8 an, u32 next_pn, Boolean confidentiality, const u8 *sak) argument 173 wpas_enable_transmit_sa(void *wpa_s, u32 channel, u8 an) argument 179 wpas_disable_transmit_sa(void *wpa_s, u32 channel, u8 an) argument [all...] |