| /external/harfbuzz_ng/src/ |
| hb-set.h | 94 hb_codepoint_t last);
103 hb_codepoint_t last);
148 /* Pass -1 for first and last to get started. */
152 hb_codepoint_t *last);
|
| /external/icu/icu4c/source/data/xml/rbnf/ |
| be.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| bg.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| ca.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| da.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| de.xml | 15 <rbnfrule value="0">&ue=ü&ae=ä&oe=ö&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| fo.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| is.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| mk.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| nb.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| nn.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| ru.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| sr.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| uk.xml | 14 <rbnfrule value="0">&[last primary ignorable ] ?? ' ' ?? ',' ?? '-' ?? '';</rbnfrule>
|
| /external/iproute2/include/linux/ |
| tcp_metrics.h | 23 /* Always last. */
|
| /external/iptables/extensions/ |
| libxt_NFQUEUE.c | 35 " --queue-balance first:last Balance flows between queues <value> to <value>.\n");
131 unsigned int last = tinfo->queues_total; local
133 if (last > 1) {
134 last += tinfo->queuenum - 1;
135 printf(" NFQUEUE balance %u:%u", tinfo->queuenum, last);
172 unsigned int last = tinfo->queues_total; local
174 if (last > 1) {
175 last += tinfo->queuenum - 1;
176 printf(" --queue-balance %u:%u", tinfo->queuenum, last);
|
| /external/junit/src/org/junit/runner/manipulation/ |
| Sortable.java | 4 * Interface for runners that allow sorting of tests. By sorting tests based on when they last failed, most recently
|
| /external/kernel-headers/original/uapi/linux/ |
| cn_proc.h | 59 /* "last" is the last process event: exit,
60 * while "next to last" is coredumping event */
67 union { /* must be last field of proc_event struct */
|
| shm.h | 29 __kernel_time_t shm_atime; /* last attach time */
30 __kernel_time_t shm_dtime; /* last detach time */
31 __kernel_time_t shm_ctime; /* last change time */
33 __kernel_ipc_pid_t shm_lpid; /* pid of last operator */
|
| tcp_metrics.h | 23 /* Always last. */
|
| /external/libchrome/base/memory/ |
| scoped_vector.h | 117 // Lets the ScopedVector take ownership of elements in [first,last).
119 void insert(iterator position, InputIterator first, InputIterator last) {
120 v_.insert(position, first, last);
128 iterator erase(iterator first, iterator last) {
129 STLDeleteContainerPointers(first, last);
130 return v_.erase(first, last);
138 // Like |erase()|, but doesn't delete the elements in [first, last).
139 iterator weak_erase(iterator first, iterator last) {
140 return v_.erase(first, last);
|
| /external/libchrome/sandbox/linux/system_headers/ |
| arm64_linux_ucontext.h | 22 /* last for future expansion */
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.binary.search/lower.bound/ |
| lower_bound.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value);
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::lower_bound(first, last, value);
30 for (Iter j = i; j != last; ++j)
|
| lower_bound_comp.pass.cpp | 15 // lower_bound(Iter first, Iter last, const T& value);
26 test(Iter first, Iter last, const T& value)
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/ |
| upper_bound.pass.cpp | 15 // upper_bound(Iter first, Iter last, const T& value);
25 test(Iter first, Iter last, const T& value)
27 Iter i = std::upper_bound(first, last, value);
30 for (Iter j = i; j != last; ++j)
|
