| /external/icu/icu4c/source/data/zone/ |
| D | ceb.txt | 7 ec{"Siyudad sa Ho Chi Minh"}
16 ld{"Tamdanang Oras sa Irish"}
19 ld{"Oras sa Tag-init sa British"}
22 ls{"Oras sa Afghanistan"}
25 ls{"Oras sa Central Africa"}
28 ls{"Oras sa East Africa"}
31 ls{"Tamdanang Oras sa South Africa"}
34 ld{"Oras sa Tag-init sa West Africa"}
35 lg{"Oras sa West Africa"}
36 ls{"Tamdanang Oras sa West Africa"}
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 43 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
54 forward_iterator<const int*>(ia + sa), in main()
58 forward_iterator<const int*>(ia + sa), in main()
60 forward_iterator<const int*>(ib + sa)) == true); in main()
62 forward_iterator<const int*>(ia + sa), in main()
64 forward_iterator<const int*>(ib + sa - 1)) == false); in main()
70 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
72 forward_iterator<const int*>(ia + sa), in main()
76 forward_iterator<const int*>(ia + sa), in main()
78 forward_iterator<const int*>(ib + sa)) == false); in main()
[all …]
|
| D | is_permutation_pred.pass.cpp | 63 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
69 forward_iterator<const int*>(ia + sa), in main()
74 forward_iterator<const int*>(ia + sa), in main()
76 forward_iterator<const int*>(ib + sa), in main()
79 forward_iterator<const int*>(ia + sa), in main()
81 forward_iterator<const int*>(ib + sa - 1), in main()
88 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
90 forward_iterator<const int*>(ia + sa), in main()
95 forward_iterator<const int*>(ia + sa), in main()
97 forward_iterator<const int*>(ib + sa), in main()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 44 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
55 forward_iterator<const int*>(ia + sa), in main()
59 forward_iterator<const int*>(ia + sa), in main()
61 forward_iterator<const int*>(ib + sa)) == true); in main()
63 forward_iterator<const int*>(ia + sa), in main()
65 forward_iterator<const int*>(ib + sa - 1)) == false); in main()
71 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
73 forward_iterator<const int*>(ia + sa), in main()
77 forward_iterator<const int*>(ia + sa), in main()
79 forward_iterator<const int*>(ib + sa)) == false); in main()
[all …]
|
| D | is_permutation_pred.pass.cpp | 64 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
70 forward_iterator<const int*>(ia + sa), in main()
75 forward_iterator<const int*>(ia + sa), in main()
77 forward_iterator<const int*>(ib + sa), in main()
80 forward_iterator<const int*>(ia + sa), in main()
82 forward_iterator<const int*>(ib + sa - 1), in main()
89 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
91 forward_iterator<const int*>(ia + sa), in main()
96 forward_iterator<const int*>(ia + sa), in main()
98 forward_iterator<const int*>(ib + sa), in main()
[all …]
|
| /external/llvm-project/clang/test/Analysis/ |
| D | fuchsia_handle.cpp | 49 zx_handle_t sa, sb; in checkInvalidHandle01() local
50 zx_channel_create(0, &sa, &sb); in checkInvalidHandle01()
51 if (sa == ZX_HANDLE_INVALID) in checkInvalidHandle01()
55 use2(sa); // TODOexpected-warning {{Use of an invalid handle}} in checkInvalidHandle01()
57 zx_handle_close(sa); in checkInvalidHandle01()
61 zx_handle_t sa, sb; in checkInvalidHandle2() local
62 zx_channel_create(0, &sa, &sb); in checkInvalidHandle2()
65 if (sa != ZX_HANDLE_INVALID) in checkInvalidHandle2()
66 zx_handle_close(sa); in checkInvalidHandle2()
70 zx_handle_t sa, sb; in handleDieBeforeErrorSymbol01() local
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 37 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
39 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
44 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
45 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
49 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
50 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
54 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
55 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
59 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
60 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted_until_comp.pass.cpp | 38 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
40 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
55 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
56 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
60 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
61 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted.pass.cpp | 37 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
39 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
44 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
45 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
49 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
50 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
54 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
55 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
59 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
60 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
|
| D | is_sorted_comp.pass.cpp | 38 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
40 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
55 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
56 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
60 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
61 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 37 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
39 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
44 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
45 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
49 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
50 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
54 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
55 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
59 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
60 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted_until_comp.pass.cpp | 38 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
40 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
55 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
56 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
60 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
61 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted.pass.cpp | 37 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
39 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
44 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
45 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
49 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
50 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
54 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
55 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
59 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
60 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
|
| D | is_sorted_comp.pass.cpp | 38 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
40 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
55 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
56 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
60 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
61 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
|
| /external/libnl/lib/xfrm/ |
| D | sa.c | 88 struct xfrmnl_sa* sa = nl_object_priv (c); in xfrm_sa_alloc_data() local
90 if ((sa->sel = xfrmnl_sel_alloc ()) == NULL) in xfrm_sa_alloc_data()
93 if ((sa->lft = xfrmnl_ltime_cfg_alloc ()) == NULL) in xfrm_sa_alloc_data()
99 struct xfrmnl_sa* sa = nl_object_priv (c); in xfrm_sa_free_data() local
101 if (sa == NULL) in xfrm_sa_free_data()
104 xfrmnl_sel_put (sa->sel); in xfrm_sa_free_data()
105 xfrmnl_ltime_cfg_put (sa->lft); in xfrm_sa_free_data()
106 nl_addr_put (sa->id.daddr); in xfrm_sa_free_data()
107 nl_addr_put (sa->saddr); in xfrm_sa_free_data()
109 if (sa->aead) in xfrm_sa_free_data()
[all …]
|
| /external/icu/icu4c/source/data/curr/ |
| D | rof.txt | 8 "heleri sa Falme za Kiarabu",
12 "heleri sa Angola",
16 "heleri sa Australia",
20 "heleri sa Bahareni",
24 "heleri sa Burundi",
28 "heleri sa Botswana",
32 "heleri sa Kanada",
36 "heleri sa Kongo",
40 "heleri sa Uswisi",
44 "heleri sa China",
[all …]
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
| D | pred.pass.cpp | 66 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
70 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| D | hash.pred.pass.cpp | 72 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
77 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
78 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
80 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
81 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
82 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| D | hash.pred.pass.cpp | 71 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
77 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
79 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
80 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
81 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| D | hash.pass.cpp | 58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
64 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| /external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| D | hash.pass.cpp | 58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
64 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| D | hash.pred.pass.cpp | 71 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
77 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
79 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
80 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
81 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| /external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
| D | hash.pred.pass.cpp | 71 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
77 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
79 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
80 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
81 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| D | hash.pass.cpp | 57 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
62 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
63 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| /external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
| D | hash.pred.pass.cpp | 70 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
74 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
75 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
76 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
78 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
79 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
80 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|