| /external/freetype/src/cache/ |
| ftcmru.c | 37 FTC_MruNode last = first->prev; local
59 last->next = node;
61 node->prev = last;
83 FTC_MruNode prev, next, last; local
108 last = first->prev;
110 last->next = node;
114 node->prev = last;
|
| /external/marisa-trie/lib/marisa/ |
| tail.cc | 169 const KeyIdPair *last = &dummy_key; local
173 while ((match < cur.first.length()) && (match < last->first.length()) &&
174 last->first[match] == cur.first[match]) {
177 if ((match == cur.first.length()) && (last->first.length() != 0)) {
178 temp_offsets[cur.second] = (UInt32)(temp_offsets[last->second]
179 + (last->first.length() - match));
187 last = &cur;
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| tail.cc | 169 const KeyIdPair *last = &dummy_key; local
173 while ((match < cur.first.length()) && (match < last->first.length()) &&
174 last->first[match] == cur.first[match]) {
177 if ((match == cur.first.length()) && (last->first.length() != 0)) {
178 temp_offsets[cur.second] = (UInt32)(temp_offsets[last->second]
179 + (last->first.length() - match));
187 last = &cur;
|
| /frameworks/native/include/utils/ |
| List.h | 189 * Return the first element or one past the last element. The
222 void insert(iterator posn, const_iterator first, const_iterator last) {
223 for ( ; first != last; ++first)
238 iterator erase(iterator first, iterator last) {
239 while (first != last)
241 return iterator(last);
260 * will be equal to "last". The iterators must refer to the same
274 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const
277 while (first != last) {
|
| /system/core/include/sysutils/ |
| List.h | 190 * Return the first element or one past the last element. The
223 void insert(iterator posn, const_iterator first, const_iterator last) {
224 for ( ; first != last; ++first)
239 iterator erase(iterator first, iterator last) {
240 while (first != last)
242 return iterator(last);
261 * will be equal to "last". The iterators must refer to the same
275 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const
278 while (first != last) {
|
| /system/netd/ |
| List.h | 190 * Return the first element or one past the last element. The
223 void insert(iterator posn, const_iterator first, const_iterator last) {
224 for ( ; first != last; ++first)
239 iterator erase(iterator first, iterator last) {
240 while (first != last)
242 return iterator(last);
261 * will be equal to "last". The iterators must refer to the same
275 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const
278 while (first != last) {
|
| /development/tools/axl/ |
| chewperf.py | 33 last = 0
39 out.append("%s %d" % (line, (tm - last)))
40 last = tm
|
| /external/chromium/third_party/libjingle/source/talk/base/ |
| stringutils.cc | 136 std::string::size_type last = s.find_last_not_of(kWhitespace);
138 if (first == std::string::npos || last == std::string::npos) {
142 return s.substr(first, last - first + 1);
|
| /external/e2fsprogs/lib/blkid/ |
| list.h | 134 struct list_head *last = list->prev; local
140 last->next = at;
141 at->prev = last;
|
| /external/kernel-headers/original/asm-mips/ |
| system.h | 30 extern asmlinkage void *resume(void *last, void *next, void *next_ti);
65 #define switch_to(prev, next, last) \
70 (last) = resume(prev, next, task_thread_info(next)); \
|
| /external/llvm/lib/IR/ |
| SymbolTableListTraitsImpl.h | 89 ilist_iterator<ValueSubClass> last) {
99 for (; first != last; ++first) {
111 for (; first != last; ++first)
|
| /external/oprofile/libutil/ |
| op_list.h | 135 struct list_head * last = list->prev; local
141 last->next = at;
142 at->prev = last;
|
| /external/regex-re2/util/ |
| stringpiece.cc | 22 // Test last byte in case strings share large common prefix
65 const char* last = ptr_ + min(ulen - s.length_, pos) + s.length_; local
66 const char* result = std::find_end(ptr_, last, s.ptr_, s.ptr_ + s.length_);
67 return result != last ? result - ptr_ : npos;
|
| /external/v8/test/cctest/ |
| cctest.cc | 79 PrintTestList(CcTest::last());
91 CcTest* test = CcTest::last();
105 CcTest* test = CcTest::last();
|
| /external/webkit/Source/JavaScriptCore/parser/ |
| ParserArena.h | 54 return m_identifiers.last();
60 return m_identifiers.last();
101 ParserArenaRefCounted* last() const;
|
| /external/webkit/Source/WebCore/platform/graphics/android/rendering/ |
| TilesProfiler.cpp | 83 ALOGD("completed tile profiling frame, observed %d tiles. %f ms since last",
91 m_records.last().append(TileProfileRecord(
113 m_records.last().append(TileProfileRecord(
124 m_records.last().append(TileProfileRecord(
|
| /external/webkit/Tools/Scripts/ |
| parse-malloc-history | 129 last if $rindexResult == -1;
141 last;
157 last if ($byteMinimum && $byteCount < $byteMinimum);
|
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| AttributedCharacterIteratorTest.java | 38 assertEquals("Wrong last", 'g', it.current());
94 assertEquals("Wrong last", 10, it.getIndex());
100 * @tests java.text.AttributedCharacterIterator#last()
106 assertEquals("Wrong last1", 'g', it.last());
108 assertEquals("Wrong last2", 's', it.last());
110 assertEquals("Wrong last3", 'r', it.last());
112 assertTrue("Wrong last4", it.last() == CharacterIterator.DONE);
125 assertEquals("Wrong last", 'g', it.next());
|
| /external/chromium/third_party/libevent/ |
| min_heap.h | 89 struct event *last = s->p[--s->n]; local
91 /* we replace e with the last element in the heap. We might need to
96 if (e->min_heap_idx > 0 && min_heap_elem_greater(s->p[parent], last))
97 min_heap_shift_up_(s, e->min_heap_idx, last);
99 min_heap_shift_down_(s, e->min_heap_idx, last);
|
| /external/chromium-trace/trace-viewer/examples/stream_server/handlers/ |
| stream_wsh.py | 12 def make_slice(start_time, elapsed_time, label, last):
19 if last == False:
48 def make_count(start_time, value, last):
54 if last == False:
|
| /external/dhcpcd/ |
| control.c | 55 struct fd_list *l, *last = NULL; local
61 if (last == NULL)
64 last->next = l->next;
68 last = l;
|
| /external/eigen/Eigen/src/StlSupport/ |
| StdDeque.h | 44 deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : deque_base(first, last, a) {} \
69 deque(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
70 : deque_base(first, last, a) {} \
|
| StdList.h | 43 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \
69 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
70 : list_base(first, last, a) {} \
|
| StdVector.h | 36 vector(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : vector_base(first, last, a) {} \
58 vector(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) \
59 : vector_base(first, last, a) {} \
|
| /external/harfbuzz_ng/src/ |
| hb-ot-shape-complex-myanmar-machine.hh | 272 if (0) fprintf (stderr, "syllable %d..%d %s\n", last, p+1, #syllable_type); \
273 for (unsigned int i = last; i < p+1; i++) \
275 last = p+1; \
301 unsigned int last = 0; local
|
