Searched refs:ab (Results 1 - 25 of 106) sorted by relevance

12345

/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/
H A Dcopy_alloc.pass.cpp32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, a
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Diter_iter_alloc.pass.cpp39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]);
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_iterato
[all...]
H A Dmove.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Dcopy.pass.cpp30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]);
32 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, a
[all...]
H A Dop_equal.pass.cpp31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, a
[all...]
H A Dmove_alloc.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[
55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Dmove_assign.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[
57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Diter_iter.pass.cpp52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
53 int* an = ab + sizeof(ab)/sizeof(ab[0]);
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, a
[all...]
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/
H A Dcopy_alloc.pass.cpp32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, a
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Diter_iter_alloc.pass.cpp39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]);
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_iterato
[all...]
H A Dmove.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Dcopy.pass.cpp30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]);
32 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, a
[all...]
H A Dop_equal.pass.cpp31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, a
[all...]
H A Dmove_alloc.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[
55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Dmove_assign.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[
57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Diter_iter.pass.cpp52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
53 int* an = ab + sizeof(ab)/sizeof(ab[0]);
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, a
[all...]
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/
H A Dcopy_alloc.pass.cpp32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]);
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)),
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]);
40 test(std::deque<int, other_allocator<int> >(ab, a
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Diter_iter_alloc.pass.cpp39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]);
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_iterato
[all...]
H A Dmove.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Dcopy.pass.cpp30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]);
32 test(std::deque<int>(ab, an));
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]);
52 test(std::deque<int, min_allocator<int>>(ab, a
[all...]
H A Dop_equal.pass.cpp31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]);
33 test(std::deque<int>(ab, an));
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]);
53 test(std::deque<int, min_allocator<int>>(ab, a
[all...]
H A Dmove_alloc.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
41 int* an = ab + sizeof(ab)/sizeof(ab[
55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
71 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Dmove_assign.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]);
29 for (int* p = ab; p < an; ++p)
32 for (int* p = ab; p < an; ++p)
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
42 int* an = ab + sizeof(ab)/sizeof(ab[
57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
74 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
[all...]
H A Diter_iter.pass.cpp52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; local
53 int* an = ab + sizeof(ab)/sizeof(ab[0]);
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, a
[all...]
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/mingw/include/
H A Dwabnot.h23 BYTE ab[MAPI_DIM]; member in struct:__anon8204
26 #define CbNewNOTIFKEY(_cb) (offsetof(NOTIFKEY,ab) + (_cb))
27 #define CbNOTIFKEY(_lpkey) (offsetof(NOTIFKEY,ab) + (_lpkey)->cb)
28 #define SizedNOTIFKEY(_cb,_name) struct _NOTIFKEY_ ## _name { ULONG cb; BYTE ab[_cb]; } _name

Completed in 590 milliseconds

12345