| /external/e2fsprogs/tests/f_baddir2/ |
| name | 1 salvage last directory entry
|
| /external/e2fsprogs/tests/f_full_bg/ |
| name | 1 inode table in last block of first bg
|
| /external/elfcopy/ |
| debug.c | 11 int i, last; local
14 for (i = last = 0; i < len; i++) {
23 while (last < i) {
24 if (isprint(pchr[last]))
25 fputc(pchr[last], s);
28 if(pchr[last])
31 last++;
|
| /build/tools/apriori/ |
| debug.c | 9 int i, last; local
13 for (i = last = 0; i < len; i++) {
22 while (last < i) {
23 if (isprint(pchr[last]))
24 fputc(pchr[last], s);
29 last++;
|
| /build/tools/isprelinked/ |
| debug.c | 9 int i, last; local
12 for (i = last = 0; i < len; i++) {
21 while (last < i) {
22 if (isprint(pchr[last]))
23 fputc(pchr[last], s);
28 last++;
|
| /build/tools/lsd/ |
| debug.c | 10 int i, last; local
13 for (i = last = 0; i < len; i++) {
23 while (last < i) {
24 if (isprint(pchr[last]))
25 fputc(pchr[last], s);
30 last++;
|
| /build/tools/soslim/ |
| debug.c | 11 int i, last;
14 for (i = last = 0; i < len; i++) {
23 while (last < i) {
24 if (isprint(pchr[last]))
25 fputc(pchr[last], s);
30 last++;
|
| /development/tools/yuv420sp2rgb/ |
| debug.c | 9 int i, last; local
13 for (i = last = 0; i < len; i++) {
22 while (last < i) {
23 if (isprint(pchr[last]))
24 fputc(pchr[last], s);
29 last++;
|
| /external/apache-http/src/org/apache/http/ |
| svn.info | 6 Last Changed Author: olegk
7 Last Changed Rev: 677250
8 Last Changed Date: 2008-07-16 04:45:47 -0700 (Wed, 16 Jul 2008)
|
| /external/e2fsprogs/tests/ |
| filter_dumpe2fs | 5 /^Last write time:/d
6 /^Last mount time:/d
7 /^Last checked:/d
|
| /dalvik/tests/015-switch/ |
| expected.txt | 10 CORRECT big sparse / last
|
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| unumeric.h | 16 /// Returns the sum of all elements in [first, last) added to \p init.
20 inline T accumulate (InputIterator first, InputIterator last, T init)
22 while (first < last)
27 /// Returns the sum of all elements in [first, last) via \p op, added to \p init.
31 inline T accumulate (InputIterator first, InputIterator last, T init, BinaryFunction binary_op)
33 while (first < last)
38 /// Assigns range [value, value + (last - first)) to [first, last)
42 inline void iota (ForwardIterator first, ForwardIterator last, T value)
44 while (first < last)
[all...] |
| ualgo.h | 27 /// Swaps corresponding elements of [first, last) and [result,)
31 inline ForwardIterator2 swap_ranges (ForwardIterator1 first, ForwardIterator2 last, ForwardIterator2 result)
33 for (; first != last; ++first, ++result)
38 /// Returns the first iterator i in the range [first, last) such that
39 /// *i == value. Returns last if no such iterator exists.
43 inline InputIterator find (InputIterator first, InputIterator last, const EqualityComparable& value)
45 while (first != last && !(*first == value))
54 ForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last)
56 if (first != last)
57 for (ForwardIterator prev = first; ++first != last; ++ prev
[all...] |
| uheap.h | 30 bool is_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
33 for (; ++iChild < last; ++first)
34 if (comp (*first, *iChild) || (++iChild < last && comp (*first, *iChild)))
39 /// \brief make_heap turns the range [first, last) into a heap
40 /// At completion, is_heap (first, last, comp) is true.
46 void make_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
50 uoff_t iChild, iHole = 0, iEnd (distance (first, last));
63 /// \brief Inserts the *--last into the preceeding range assumed to be a heap.
67 void push_heap (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
69 if (last <= first
[all...] |
| upredalgo.h | 20 /// Copy_if copies elements from the range [first, last) to the range
21 /// [result, result + (last - first)) if pred(*i) returns true.
26 inline OutputIterator copy_if (InputIterator first, InputIterator last, OutputIterator result, Predicate pred)
28 for (; first != last; ++first) {
37 /// Returns the first iterator i in the range [first, last) such that
38 /// pred(*i) is true. Returns last if no such iterator exists.
43 inline InputIterator find_if (InputIterator first, InputIterator last, Predicate pred)
45 while (first != last && !pred (*first))
55 inline ForwardIterator adjacent_find (ForwardIterator first, ForwardIterator last, BinaryPredicate p)
57 if (first != last)
[all...] |
| /external/kernel-headers/original/asm-arm/ |
| msgbuf.h | 16 __kernel_time_t msg_stime; /* last msgsnd time */
18 __kernel_time_t msg_rtime; /* last msgrcv time */
20 __kernel_time_t msg_ctime; /* last change time */
25 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
26 __kernel_pid_t msg_lrpid; /* last receive pid */
|
| shmbuf.h | 17 __kernel_time_t shm_atime; /* last attach time */
19 __kernel_time_t shm_dtime; /* last detach time */
21 __kernel_time_t shm_ctime; /* last change time */
24 __kernel_pid_t shm_lpid; /* pid of last operator */
|
| /external/kernel-headers/original/asm-x86/ |
| msgbuf.h | 18 __kernel_time_t msg_stime; /* last msgsnd time */
22 __kernel_time_t msg_rtime; /* last msgrcv time */
26 __kernel_time_t msg_ctime; /* last change time */
33 __kernel_pid_t msg_lspid; /* pid of last msgsnd */
34 __kernel_pid_t msg_lrpid; /* last receive pid */
|
| /external/clearsilver/cs/ |
| test_first_last.cs | 5 is_last: <?cs var:last(num) ?>
12 is_last: <?cs var:last(day) ?>
13 is_last: <?cs var:last(day.Abbr) ?> -> never
16 Only one, so should be first and last
19 is_last: <?cs var:last(test) ?>
27 is_last: <?cs var:last(x) ?>
28 is_last: <?cs var:last(x.foo) ?> -> never
|
| /external/skia/src/core/ |
| SkDeque.cpp | 148 Head* last = fBack; local
151 if (NULL == last->fBegin) {
153 last->fBegin = last->start();
154 end = last->fBegin + fElemSize;
156 end = last->fEnd + fElemSize;
157 if (end > last->fStop) { // no more room in this chunk
161 last = (Head*)sk_malloc_throw(size);
162 last->init(size);
163 last->fPrev = fBack
204 Head* last = fBack; local
[all...] |
| /external/v8/test/mjsunit/ |
| cyrillic.js | 35 LAST: "\u042f", // YA
36 last: "\u044f", // ya
50 LAST: "\u03a9", // OMEGA
51 last: "\u03c9", // omega
71 var last = lc ? chars.last : chars.LAST;
74 var last_other_case = lc ? chars.LAST : chars.last;
76 assertTrue(Range(first, last).test(first), 1)
[all...] |
| /external/kernel-headers/original/linux/ |
| msg.h | 18 struct msg *msg_last; /* last message in queue,unused */
19 __kernel_time_t msg_stime; /* last msgsnd time */
20 __kernel_time_t msg_rtime; /* last msgrcv time */
21 __kernel_time_t msg_ctime; /* last change time */
27 __kernel_ipc_pid_t msg_lspid; /* pid of last msgsnd */
28 __kernel_ipc_pid_t msg_lrpid; /* last receive pid */
81 time_t q_stime; /* last msgsnd time */
82 time_t q_rtime; /* last msgrcv time */
83 time_t q_ctime; /* last change time */
87 pid_t q_lspid; /* pid of last msgsnd *
[all...] |
| /external/webkit/SunSpider/tests/sunspider-0.9/ |
| string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable
9 last = (last * A + C) % M;
10 return max * last / M;
37 var last = null;
39 if (last) table[c] += table[last];
40 last = c;
|
| /external/webkit/SunSpider/tests/sunspider-0.9.1/ |
| string-fasta.js | 6 var last = 42, A = 3877, C = 29573, M = 139968; variable
9 last = (last * A + C) % M;
10 return max * last / M;
37 var last = null;
39 if (last) table[c] += table[last];
40 last = c;
|
| /frameworks/base/core/java/android/content/ |
| ContentUris.java | 28 * Converts the last path segment to a long.
31 * stored in the last segment.
34 * @throws NumberFormatException if the last segment isn't a number
36 * @return the long conversion of the last segment or -1 if the path is
40 String last = contentUri.getLastPathSegment(); local
41 return last == null ? -1 : Long.parseLong(last);
|
