/external/curl/src/ |
H A D | slist_wc.h | 28 /* linked-list structure with last node cache for easysrc */ 31 struct curl_slist *last; member in struct:slist_wc
|
H A D | tool_cfgable.c | 150 struct OperationConfig *last = config; local 153 while(last) { 154 struct OperationConfig *prev = last->prev; 156 free_config_fields(last); 157 free(last); 159 last = prev;
|
/external/valgrind/none/tests/amd64-linux/ |
H A D | map_32bits.c | 10 void *last; local 26 fprintf(stderr, "last mmap ok: %p\n", last); 29 last = res;
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/equal.range/ |
H A D | equal_range.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value) argument 28 std::pair<Iter, Iter> i = std::equal_range(first, last, value); 31 for (Iter j = i.first; j != last; ++j) 35 for (Iter j = i.second; j != last; ++j)
|
H A D | equal_range_comp.pass.cpp | 16 // equal_range(Iter first, Iter last, const T& value, Compare comp); 27 test(Iter first, Iter last, const T& value) argument 29 std::pair<Iter, Iter> i = std::equal_range(first, last, value, std::greater<int>()); 32 for (Iter j = i.first; j != last; ++j) 36 for (Iter j = i.second; j != last; ++j)
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
H A D | lower_bound.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) argument 27 Iter i = std::lower_bound(first, last, value); 30 for (Iter j = i; j != last; ++j)
|
H A D | lower_bound_comp.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value); 26 test(Iter first, Iter last, const T& value) argument 28 Iter i = std::lower_bound(first, last, value, std::greater<int>()); 31 for (Iter j = i; j != last; ++j)
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/upper.bound/ |
H A D | upper_bound.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value); 25 test(Iter first, Iter last, const T& value) argument 27 Iter i = std::upper_bound(first, last, value); 30 for (Iter j = i; j != last; ++j)
|
H A D | upper_bound_comp.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value, Compare comp); 26 test(Iter first, Iter last, const T& value) argument 28 Iter i = std::upper_bound(first, last, value, std::greater<int>()); 31 for (Iter j = i; j != last; ++j)
|
/external/libcxx/test/std/containers/sequences/vector/vector.cons/ |
H A D | construct_iter_iter.pass.cpp | 12 // template <class InputIter> vector(InputIter first, InputIter last); 24 test(Iterator first, Iterator last) argument 26 C c(first, last); 28 assert(c.size() == std::distance(first, last));
|
/external/libcxx/test/std/containers/sequences/vector.bool/ |
H A D | construct_iter_iter.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last); 23 test(Iterator first, Iterator last) argument 25 C c(first, last); 27 assert(c.size() == std::distance(first, last));
|
H A D | construct_iter_iter_alloc.pass.cpp | 13 // template <class InputIter> vector(InputIter first, InputIter last, 24 test(Iterator first, Iterator last, const typename C::allocator_type& a) argument 26 C c(first, last, a); 28 assert(c.size() == std::distance(first, last));
|
/external/libcxx/test/std/iterators/iterator.primitives/iterator.operations/ |
H A D | distance.pass.cpp | 14 // distance(Iter first, Iter last); 18 // distance(Iter first, Iter last); 27 test(It first, It last, typename std::iterator_traits<It>::difference_type x) argument 29 assert(std::distance(first, last) == x);
|
/external/libcxx/test/std/re/re.regex/re.regex.construct/ |
H A D | iter_iter.pass.cpp | 15 // basic_regex(ForwardIterator first, ForwardIterator last); 24 test(Iter first, Iter last, unsigned mc) argument 26 std::basic_regex<typename std::iterator_traits<Iter>::value_type> r(first, last);
|
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_append/ |
H A D | iterator.pass.cpp | 13 // basic_string& append(InputIterator first, InputIterator last); 23 test(S s, It first, It last, S expected) argument 25 s.append(first, last);
|
/external/libcxx/test/std/strings/basic.string/string.modifiers/string_assign/ |
H A D | iterator.pass.cpp | 13 // basic_string& assign(InputIterator first, InputIterator last); 23 test(S s, It first, It last, S expected) argument 25 s.assign(first, last);
|
/external/libexif/test/ |
H A D | test-sorted.c | 33 ExifTag last = 0, current; local 34 num = exif_tag_table_count() - 1; /* last entry is a NULL terminator */ 37 if (current < last) { 46 last = current;
|
/external/parameter-framework/upstream/utility/ |
H A D | Utility.h | 42 /** Join all elements in [first, last[ with op. 49 * let [first, last[ = list<string>{"1", "2", "3"} 50 * then join(first, last, op) == "1|2|3" 54 T join(InputIt first, InputIt last, BinaryOperation op, T empty = T{}) argument 56 if (first == last) { 61 return std::accumulate(first, last, init, op);
|
/external/v8/test/mjsunit/ |
H A D | substr.js | 141 var last = x; variable 144 var z = last.substring(i); 145 last = z;
|
/external/google-breakpad/src/common/linux/ |
H A D | linux_libc_support_unittest.cc | 171 const char* last; local 173 last = my_read_hex_ptr(&result, ""); 175 ASSERT_EQ(*last, 0); 177 last = my_read_hex_ptr(&result, "0"); 179 ASSERT_EQ(*last, 0); 181 last = my_read_hex_ptr(&result, "0123"); 183 ASSERT_EQ(*last, 0); 185 last = my_read_hex_ptr(&result, "0123a"); 187 ASSERT_EQ(*last, 0); 189 last 196 const char* last; local [all...] |
/external/libcap-ng/libcap-ng-0.7/bindings/python/test/ |
H A D | capng-test.py | 11 last = capng.CAP_LAST_CAP variable 26 if len < 80 and last > 30: 27 last = 30 variable 29 print("Doing advanced bit tests for %d capabilities...\n" % (last)) 30 for i in range(last+1):
|
/external/libcap-ng/libcap-ng-0.7/src/test/ |
H A D | lib_test.c | 32 int rc, i, len, last = CAP_LAST_CAP; local 52 if (len < 80 && last > 30) // The kernel & headers are mismatched 53 last = 30; 60 printf("Doing advanced bit tests for %d capabilities...\n", last); 61 for (i=0; i<=last; i++) {
|
/external/libcxx/test/std/algorithms/alg.sorting/alg.min.max/ |
H A D | max_element.pass.cpp | 15 // max_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 Iter i = std::max_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j) 33 assert(i == last);
|
H A D | min_element.pass.cpp | 15 // min_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 Iter i = std::min_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j) 33 assert(i == last);
|
H A D | minmax_element.pass.cpp | 15 // minmax_element(Iter first, Iter last); 24 test(Iter first, Iter last) argument 26 std::pair<Iter, Iter> p = std::minmax_element(first, last); 27 if (first != last) 29 for (Iter j = first; j != last; ++j) 37 assert(p.first == last); 38 assert(p.second == last);
|