HomeSort by relevance Sort by last modified time
    Searched defs:last (Results 26 - 50 of 1933) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/libcap-ng/libcap-ng-0.7/bindings/python/test/
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/
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/containers/sequences/deque/deque.modifiers/
erase_iter_iter.invalidation.pass.cpp 26 typename C::iterator last = first + num; local
27 typename C::iterator it1 = last;
30 c.erase (first, last);
45 typename C::iterator last = c.end(); local
46 typename C::iterator first = last - num;
50 c.erase (first, last);
  /external/mesa3d/src/gallium/state_trackers/clover/core/
queue.cpp 52 auto last = std::find_if(queued_events.begin(), queued_events.end(), local
57 std::for_each(first, last, [&](event_ptr &ev) { ev->fence(fence); });
59 queued_events.erase(first, last);
  /external/mesa3d/src/glsl/
ir_basic_block.cpp 54 ir_instruction *last,
59 ir_instruction *last = NULL; local
101 last = ir;
104 callback(leader, last, data);
  /external/minijail/
syscall_filter.h 22 struct filter_block *last; member in struct:filter_block
  /external/pdfium/third_party/agg23/
agg_shorten_path.h 43 vertex_type& last = vs[n]; local
45 FX_FLOAT x = prev.x + (last.x - prev.x) * d;
46 FX_FLOAT y = prev.y + (last.y - prev.y) * d;
47 last.x = x;
48 last.y = y;
49 if(!prev(last)) {
  /frameworks/base/tools/aapt2/link/
PrivateAttributeMover.cpp 28 const auto last = inputContainer.end(); local
30 if (newEnd == last) {
39 for (; first != last; ++first) {
52 inputContainer.erase(newEnd, last);
  /libcore/ojluni/src/main/java/java/util/
SortedSet.java 216 * Returns the last (highest) element currently in this set.
218 * @return the last (highest) element currently in this set
221 E last(); method in interface:SortedSet
  /art/runtime/base/
stringpiece.cc 74 const char* last = ptr_ + std::min(ulen - s.length_, pos) + s.length_; local
75 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
76 return result != last ? result - ptr_ : npos;
  /art/runtime/
monitor_pool.cc 71 Monitor* last = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(chunk) + local
73 last->next_free_ = nullptr;
75 last->monitor_id_ = OffsetToMonitorId(current_chunk_list_index_* (kMaxListSize * kChunkSize)
78 Monitor* before = reinterpret_cast<Monitor*>(reinterpret_cast<uintptr_t>(last) -
80 before->next_free_ = last;
81 // Derive monitor_id from last.
82 before->monitor_id_ = OffsetToMonitorId(MonitorIdToOffset(last->monitor_id_) -
85 last = before;
87 DCHECK(last == reinterpret_cast<Monitor*>(chunk));
88 first_free_ = last;
    [all...]
  /external/apache-http/src/org/apache/commons/codec/language/
RefinedSoundex.java 173 char last, current; local
174 last = '*';
179 if (current == last) {
185 last = current;
  /external/bison/examples/calc++/
location.hh 163 position last = loc.end - 1; local
165 if (last.filename
167 || *loc.begin.filename != *last.filename))
168 ostr << '-' << last; local
169 else if (loc.begin.line != last.line)
170 ostr << '-' << last.line << '.' << last.column;
171 else if (loc.begin.column != last.column)
172 ostr << '-' << last.column;
  /external/bison/src/
Sbitset.c 55 Sbitset last = self + Sbitset__nbytes (nbits) - 1; local
56 for (; self < last; ++self)
59 return ((*last) & Sbitset__last_byte_mask (nbits)) == 0;
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_procmaps_freebsd.cc 54 char *last = proc_self_maps_.data + proc_self_maps_.len; local
55 if (current_ >= last) return false;
  /external/curl/lib/
slist.c 27 /* The last #include files should be: */
31 /* returns last node in linked list */
40 /* loop through to find the last item */
59 struct curl_slist *last; local
75 last = slist_get_last(list);
76 last->next = new_item;
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
SortedMultisets.java 77 @Override public E last() { method in class:SortedMultisets.ElementSet
  /external/harfbuzz_ng/test/api/
test-set.c 164 hb_codepoint_t next, first, last; local
191 first = last = HB_SET_VALUE_INVALID;
192 g_assert (hb_set_next_range (s, &first, &last));
194 g_assert_cmpint (last, ==, 6);
195 g_assert (hb_set_next_range (s, &first, &last));
197 g_assert_cmpint (last, ==, 15);
198 g_assert (hb_set_next_range (s, &first, &last));
200 g_assert_cmpint (last, ==, 20005);
201 g_assert (!hb_set_next_range (s, &first, &last));
203 g_assert_cmpint (last, ==, HB_SET_VALUE_INVALID)
    [all...]
  /external/icu/icu4c/source/i18n/
nfrlist.h 76 NFRule* last() const { return (fCount > 0 && fStuff != NULL) ? fStuff[fCount-1] : NULL; } function in class:NFRuleList
  /external/libchrome/sandbox/linux/bpf_dsl/
syscall_set.cc 29 uint32_t last; member in struct:sandbox::__anon15361::SyscallRange
57 if (num >= range.first && num <= range.last) {
107 if (want_valid && num_ < range.last) {
110 if (want_invalid && num_ <= range.last) {
111 return range.last + 1;
  /external/libcxx/test/std/experimental/string.view/string.view.iterators/
rbegin.pass.cpp 27 const size_t last = s.size() - 1; local
28 assert( *b == s[last]);
29 assert( &*b == &s[last]);
30 assert( *cb1 == s[last]);
31 assert(&*cb1 == &s[last]);
32 assert( *cb2 == s[last]);
33 assert(&*cb2 == &s[last]);
  /external/libcxx/test/std/strings/basic.string/string.modifiers/string_replace/
iter_iter_pointer.pass.cpp 29 typename S::const_iterator last = s.begin() + pos1 + n1; local
30 typename S::size_type xlen = last - first;
31 s.replace(first, last, str);
iter_iter_size_char.pass.cpp 30 typename S::const_iterator last = s.begin() + pos1 + n1; local
31 typename S::size_type xlen = last - first;
32 s.replace(first, last, n2, c);
iter_iter_string.pass.cpp 29 typename S::const_iterator last = s.begin() + pos1 + n1; local
30 typename S::size_type xlen = last - first;
31 s.replace(first, last, str);
  /external/libcxxabi/test/
test_fallback_malloc.pass.cpp 44 const size_t *last = first + len; local
47 for ( const size_t *iter = first; iter != last; ++iter ) {

Completed in 711 milliseconds

12 3 4 5 6 7 8 91011>>