Home
last modified time | relevance | path

Searched refs:ab (Results 1 – 16 of 16) sorted by relevance

/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/
Dcopy_alloc.pass.cpp32 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
33 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
34 test(std::deque<int, test_allocator<int> >(ab, an, test_allocator<int>(3)), in main()
38 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
39 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
40 test(std::deque<int, other_allocator<int> >(ab, an, other_allocator<int>(3)), in main()
45 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
46 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
47 test(std::deque<int, min_allocator<int> >(ab, an, min_allocator<int>()), in main()
Dmove_alloc.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
55 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
56 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
Dmove_assign.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
41 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
42 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
45 for (int* p = ab; p < an; ++p) in main()
48 for (int* p = ab; p < an; ++p) in main()
57 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
58 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
Dmove.pass.cpp25 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
26 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
29 for (int* p = ab; p < an; ++p) in main()
32 for (int* p = ab; p < an; ++p) in main()
40 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
41 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
44 for (int* p = ab; p < an; ++p) in main()
47 for (int* p = ab; p < an; ++p) in main()
56 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
57 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
[all …]
Diter_iter_alloc.pass.cpp39 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
40 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
41 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), test_allocator<int>(3)); in main()
42 … test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), test_allocator<int>(4)); in main()
43 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), test_allocato… in main()
44 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), test_allocato… in main()
46 test(input_iterator<const int*>(ab), input_iterator<const int*>(an), min_allocator<int>()); in main()
47 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an), min_allocator<int>()); in main()
48 …test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an), min_allocator… in main()
49 …test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an), min_allocator… in main()
Dcopy.pass.cpp30 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
31 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
32 test(std::deque<int>(ab, an)); in main()
50 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
51 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
52 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
Dop_equal.pass.cpp31 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
32 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
33 test(std::deque<int>(ab, an)); in main()
51 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
52 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
53 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
Diter_iter.pass.cpp52 int ab[] = {3, 4, 2, 8, 0, 1, 44, 34, 45, 96, 80, 1, 13, 31, 45}; in main() local
53 int* an = ab + sizeof(ab)/sizeof(ab[0]); in main()
54 test(input_iterator<const int*>(ab), input_iterator<const int*>(an)); in main()
55 test(forward_iterator<const int*>(ab), forward_iterator<const int*>(an)); in main()
56 test(bidirectional_iterator<const int*>(ab), bidirectional_iterator<const int*>(an)); in main()
57 test(random_access_iterator<const int*>(ab), random_access_iterator<const int*>(an)); in main()
58 test<stack_allocator<int, 4096> >(ab, an); in main()
60 test<min_allocator<int> >(ab, an); in main()
/ndk/sources/host-tools/make-3.81/tests/scripts/features/
Dpatspecific_vars30 .PHONY: ab
31 ab: ; @echo $(AAA); echo $(BBB)
60 &run_make_with_options($makefile, "ab", &get_logfile);
/ndk/sources/host-tools/make-3.81/tests/scripts/options/
Ddash-t10 # make 3.79.1 touches only interm-[ab] but reports final-[a] as
/ndk/docs/Additional_library_docs/renderscript/
Djquery.js20ab,ac){ab=ab||[];U=U||document;if(U.nodeType!==1&&U.nodeType!==9){return[]}if(!Y||typeof Y!=="stri… argument
/ndk/build/gmsl/
Dgmsl-tests443 $(call test_assert,$(call uniq,a b ba ab b a a ba a),a b ba ab)
/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dfstream504 __mdstr = "ab";
Dlocale425 // If the input is "abc", no match is found and "ab" are consumed.
/ndk/sources/host-tools/make-3.81/
Dconfigure3176 [ab].out )
/ndk/sources/host-tools/make-3.81/autom4te.cache/
Doutput.03176 [ab].out )