Searched defs:sa (Results 1 - 25 of 421) sorted by relevance

1234567891011>>

/external/libcxx/test/algorithms/alg.modifying.operations/alg.replace/
H A D	replace.pass.cpp	29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 30 std::replace(Iter(ia), Iter(ia+sa), 2, 5);
H A D	replace_if.pass.cpp	30 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 31 std::replace_if(Iter(ia), Iter(ia+sa), std::bind2nd(std::equal_to<int>(), 2), 5);
/external/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/
H A D	adjacent_find.pass.cpp	25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 forward_iterator<const int*>(ia + sa)) == 33 forward_iterator<const int*>(ia + sa)) == 34 forward_iterator<const int*>(ia+sa));
H A D	adjacent_find_pred.pass.cpp	26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 forward_iterator<const int*>(ia + sa), 36 forward_iterator<const int*>(ia + sa), 38 forward_iterator<const int*>(ia+sa));
/external/libcxx/test/algorithms/alg.nonmodifying/alg.count/
H A D	count.pass.cpp	25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 input_iterator<const int*>(ia + sa), 2) == 3); 29 input_iterator<const int*>(ia + sa), 7) == 0);
H A D	count_if.pass.cpp	26 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 input_iterator<const int*>(ia + sa), 31 input_iterator<const int*>(ia + sa),
/external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/
H A D	is_sorted.pass.cpp	28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted(Iter(a), Iter(a+sa))); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted(Iter(a), Iter(a+sa))); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted(Iter(a), Iter(a+sa))); 45 unsigned sa = sizeof(a) / sizeof(a[0]); local 46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 51 assert(std::is_sorted(Iter(a), Iter(a+sa))); 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...]
H A D	is_sorted_comp.pass.cpp	29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 52 assert(std::is_sorted(Iter(a), Iter(a+sa), st 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...]
H A D	is_sorted_until.pass.cpp	28 unsigned sa = sizeof(a) / sizeof(a[0]); local 30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 35 unsigned sa = sizeof(a) / sizeof(a[0]); local 36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 40 unsigned sa = sizeof(a) / sizeof(a[0]); local 41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); 45 unsigned sa local 50 unsigned sa = sizeof(a) / sizeof(a[0]); local 56 unsigned sa = sizeof(a) / sizeof(a[0]); local 61 unsigned sa = sizeof(a) / sizeof(a[0]); local 66 unsigned sa = sizeof(a) / sizeof(a[0]); local 71 unsigned sa = sizeof(a) / sizeof(a[0]); local 76 unsigned sa = sizeof(a) / sizeof(a[0]); local 81 unsigned sa = sizeof(a) / sizeof(a[0]); local 86 unsigned sa = sizeof(a) / sizeof(a[0]); local 91 unsigned sa = sizeof(a) / sizeof(a[0]); local 97 unsigned sa = sizeof(a) / sizeof(a[0]); local 102 unsigned sa = sizeof(a) / sizeof(a[0]); local 107 unsigned sa = sizeof(a) / sizeof(a[0]); local 112 unsigned sa = sizeof(a) / sizeof(a[0]); local 117 unsigned sa = sizeof(a) / sizeof(a[0]); local 122 unsigned sa = sizeof(a) / sizeof(a[0]); local 127 unsigned sa = sizeof(a) / sizeof(a[0]); local 132 unsigned sa = sizeof(a) / sizeof(a[0]); local 137 unsigned sa = sizeof(a) / sizeof(a[0]); local 142 unsigned sa = sizeof(a) / sizeof(a[0]); local 147 unsigned sa = sizeof(a) / sizeof(a[0]); local 152 unsigned sa = sizeof(a) / sizeof(a[0]); local 157 unsigned sa = sizeof(a) / sizeof(a[0]); local 162 unsigned sa = sizeof(a) / sizeof(a[0]); local 167 unsigned sa = sizeof(a) / sizeof(a[0]); local 172 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...]
H A D	is_sorted_until_comp.pass.cpp	29 unsigned sa = sizeof(a) / sizeof(a[0]); local 31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 36 unsigned sa = sizeof(a) / sizeof(a[0]); local 37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); 41 unsigned sa = sizeof(a) / sizeof(a[0]); local 42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); 46 unsigned sa = sizeof(a) / sizeof(a[0]); local 47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), st 51 unsigned sa = sizeof(a) / sizeof(a[0]); local 57 unsigned sa = sizeof(a) / sizeof(a[0]); local 62 unsigned sa = sizeof(a) / sizeof(a[0]); local 67 unsigned sa = sizeof(a) / sizeof(a[0]); local 72 unsigned sa = sizeof(a) / sizeof(a[0]); local 77 unsigned sa = sizeof(a) / sizeof(a[0]); local 82 unsigned sa = sizeof(a) / sizeof(a[0]); local 87 unsigned sa = sizeof(a) / sizeof(a[0]); local 92 unsigned sa = sizeof(a) / sizeof(a[0]); local 98 unsigned sa = sizeof(a) / sizeof(a[0]); local 103 unsigned sa = sizeof(a) / sizeof(a[0]); local 108 unsigned sa = sizeof(a) / sizeof(a[0]); local 113 unsigned sa = sizeof(a) / sizeof(a[0]); local 118 unsigned sa = sizeof(a) / sizeof(a[0]); local 123 unsigned sa = sizeof(a) / sizeof(a[0]); local 128 unsigned sa = sizeof(a) / sizeof(a[0]); local 133 unsigned sa = sizeof(a) / sizeof(a[0]); local 138 unsigned sa = sizeof(a) / sizeof(a[0]); local 143 unsigned sa = sizeof(a) / sizeof(a[0]); local 148 unsigned sa = sizeof(a) / sizeof(a[0]); local 153 unsigned sa = sizeof(a) / sizeof(a[0]); local 158 unsigned sa = sizeof(a) / sizeof(a[0]); local 163 unsigned sa = sizeof(a) / sizeof(a[0]); local 168 unsigned sa = sizeof(a) / sizeof(a[0]); local 173 unsigned sa = sizeof(a) / sizeof(a[0]); local [all...]
/external/clang/test/SemaCXX/
H A D	primary-base.cpp	12 int sa[sizeof(F) == sizeof(A) ? 1 : -1]; variable
/external/libcxx/test/algorithms/alg.modifying.operations/alg.random.shuffle/
H A D	random_shuffle.pass.cpp	25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 26 std::random_shuffle(ia, ia+sa); 27 assert(std::equal(ia, ia+sa, ia1)); 28 std::random_shuffle(ia, ia+sa); 29 assert(std::equal(ia, ia+sa, ia2));
H A D	random_shuffle_urng.pass.cpp	25 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 27 std::shuffle(ia, ia+sa, g); 28 assert(std::equal(ia, ia+sa, ia1)); 29 std::shuffle(ia, ia+sa, g); 30 assert(std::equal(ia, ia+sa, ia2));
/external/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/
H A D	is_permutation.pass.cpp	31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 42 forward_iterator<const int*>(ia + sa), 46 forward_iterator<const int*>(ia + sa), 48 forward_iterator<const int*>(ib + sa)) == true); 50 forward_iterator<const int*>(ia + sa), 52 forward_iterator<const int*>(ib + sa - 1)) == false); 58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 60 forward_iterator<const int*>(ia + sa), 64 forward_iterator<const int*>(ia + sa), 66 forward_iterator<const int*>(ib + sa)) 73 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 91 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 105 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 119 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 133 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 147 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 165 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 179 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 193 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 207 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 221 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 235 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 249 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 263 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 277 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 291 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 306 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 320 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 334 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 348 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 362 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 376 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 390 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 404 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 418 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 432 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 450 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 464 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 482 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 500 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 518 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 536 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 550 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 572 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 594 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local [all...]
/external/libcxx/test/algorithms/alg.nonmodifying/mismatch/
H A D	mismatch.pass.cpp	29 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 32 input_iterator<const int*>(ia + sa), 41 input_iterator<const int*>(ia + sa), 43 input_iterator<const int*>(ib + sa)) == 50 input_iterator<const int*>(ia + sa),
H A D	mismatch_pred.pass.cpp	32 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 35 input_iterator<const int*>(ia + sa), 44 input_iterator<const int*>(ia + sa), 46 input_iterator<const int*>(ib + sa), 54 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) == 57 assert(std::mismatch(ia, ia + sa, ib, ib + sa, std::equal_to<int>()) == 59 assert(std::mismatch(ia, ia + sa, ib, ib + 2, std::equal_to<int>()) ==
/external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/
H A D	lexicographical_compare.pass.cpp	28 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2)); 31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa)); 32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3)); 33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa)); 34 assert(std::lexicographical_compare(ia, ia+sa, ib+1, ib+3)); 35 assert(!std::lexicographical_compare(ib+1, ib+3, ia, ia+sa));
/external/strace/tests/
H A D	sigaction.c	14 struct sigaction sa, sa0; local 16 sa.sa_handler = SIG_IGN; 17 sigemptyset(&sa.sa_mask); 18 sigaddset(&sa.sa_mask, SIGHUP); 19 sigaddset(&sa.sa_mask, SIGINT); 20 sa.sa_flags = SA_RESTART; 21 assert(!sigaction(SIGUSR2, &sa, &sa0)); 23 sa.sa_handler = handle_signal; 24 sigemptyset(&sa.sa_mask); 25 sigaddset(&sa [all...]
/external/valgrind/main/none/tests/s390x/
H A D	op_exception.c	17 struct sigaction sa; local 19 memset(&sa, 0, sizeof(sa)); 20 sa.sa_handler = handle_ill; 21 sigaction(SIGILL, &sa, NULL);
/external/chromium_org/third_party/icu/source/common/
H A D	ucnv_set.c	50 USetAdder sa={ local 58 sa.set=setFillIn; 64 cnv->sharedData->impl->getUnicodeSet(cnv, &sa, whichSet, pErrorCode);
/external/clang/test/Index/
H A D	complete-hiding.c	16 struct StructA sa = { }; local
/external/icu/icu4c/source/common/
H A D	ucnv_set.c	50 USetAdder sa={ local 58 sa.set=setFillIn; 64 cnv->sharedData->impl->getUnicodeSet(cnv, &sa, whichSet, pErrorCode);
/external/ipsec-tools/src/racoon/
H A D	sockmisc.h	39 struct sockaddr sa; member in union:netaddr::__anon22455 42 } sa; member in struct:netaddr
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/
H A D	remove.pass.cpp	31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 32 Iter r = std::remove(Iter(ia), Iter(ia+sa), 2); 33 assert(base(r) == ia + sa-3); 48 const unsigned sa = 9; local 49 std::unique_ptr<int> ia[sa]; 56 Iter r = std::remove(Iter(ia), Iter(ia+sa), std::unique_ptr<int>()); 57 assert(base(r) == ia + sa-3);
H A D	remove_copy.pass.cpp	27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); local 28 int ib[sa]; 29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2); 30 assert(base(r) == ib + sa-3);

Completed in 296 milliseconds

1234567891011>>

Indexes created Fri Jul 03 11:02:00 CEST 2015