| /frameworks/base/tests/CoreTests/android/core/ |
| TreeSetTest.java | 97 * Tests performance for the java.util.TreeSet method - last()
105 value = set.last();
106 value = set.last();
107 value = set.last();
108 value = set.last();
109 value = set.last();
110 value = set.last();
111 value = set.last();
112 value = set.last();
113 value = set.last();
[all...] |
| /external/astl/include/ |
| iterator | 253 distance(_InputIterator first, _InputIterator last,
257 while (first != last) {
267 distance(_RandomAccessIterator first, _RandomAccessIterator last,
270 return last - first;
276 * @param last An input iterator.
281 distance(_InputIterator first, _InputIterator last)
285 return distance(first, last, android::iterator_category(first));
|
| /external/qemu/distrib/sdl-1.2.12/src/video/ |
| SDL_stretch.c | 64 } last; local
72 if ( (src_w == last.src_w) &&
73 (dst_w == last.dst_w) && (bpp == last.bpp) ) {
76 last.bpp = bpp;
77 last.src_w = src_w;
78 last.dst_w = dst_w;
|
| /external/webkit/JavaScriptCore/runtime/ |
| JSONObject.cpp | 434 while (m_holderStack.last().appendNextProperty(*this, builder)) {
445 m_holderCycleDetector.remove(m_holderStack.last().object());
513 // Last time through, finish up and return false.
695 JSArray* array = arrayStack.last();
696 uint32_t index = indexStack.last();
721 JSArray* array = arrayStack.last();
722 JSValue filteredValue = callReviver(array, jsString(m_exec, UString::from(indexStack.last())), outValue);
724 array->deleteProperty(m_exec, indexStack.last());
726 if (isJSArray(&m_exec->globalData(), array) && array->canSetIndex(indexStack.last()))
727 array->setIndex(indexStack.last(), filteredValue)
[all...] |
| /external/zlib/examples/ |
| gzappend.c | 52 block boundary to facilitate locating and modifying the last block bit at
55 number of unusued bits in the last input byte used. gzappend will not work
59 the last 32K of uncompressed data, and noting the location of the last block
60 bit and the number of unused bits in the last byte of the compressed data.
64 Then the last block bit is cleared by seeking back in the file and rewriting
65 the byte that contains it. Seeking forward, the last byte of the compressed
68 A deflate process is initialized, using the last 32K of the uncompressed
72 last bits from the original deflate stream. From here on, the data to
125 unsigned char *start, *last, *to, *from local
[all...] |
| /dalvik/libcore/text/src/main/java/java/text/ |
| SimpleDateFormat.java | 397 int next, last = -1, count = 0; local
404 validateFormat((char) last);
407 if (last == next) {
408 last = -1;
410 last = next;
416 && (last == next || (next >= 'a' && next <= 'z') || (next >= 'A' && next <= 'Z'))) {
417 if (last == next) {
421 validateFormat((char) last);
423 last = next;
428 validateFormat((char) last);
729 int next, last = -1, count = 0; local
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| devname.c | 473 int which = 0, last = 0; local
499 last = which;
537 * If last was not checked because it looked like a whole-disk
539 * check last as well.
541 if (lens[last] && strncmp(ptnames[last], ptname, lens[last])) {
544 ptnames[last], (unsigned int) devs[last]));
545 probe_one(cache, ptnames[last], devs[last], 0
[all...] |
| /system/wlan/ti/sta_dk_4_0_4_32/common/src/core/data_ctrl/Tx/ |
| MsduList.c | 80 msduList->last = NULL;
255 this->last = NULL;
279 is inserted to be the last in the list. If the
298 this->last = *pMsdu;
333 this->last->nextMSDUinList = *pMsdu;
334 (*pMsdu)->prevMSDUinList = this->last;
336 this->last = *pMsdu;
358 { /* insert the MSDU to be the last. */
359 this->last->nextMSDUinList = *pMsdu;
360 (*pMsdu)->prevMSDUinList = this->last;
[all...] |
| /dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| AttributedCharacterIteratorTest.java | 56 assertEquals("Wrong last", 'g', it.current());
136 assertEquals("Wrong last", 10, it.getIndex());
142 * @tests java.text.AttributedCharacterIterator#last()
147 method = "last",
154 assertEquals("Wrong last1", 'g', it.last());
156 assertEquals("Wrong last2", 's', it.last());
158 assertEquals("Wrong last3", 'r', it.last());
160 assertTrue("Wrong last4", it.last() == CharacterIterator.DONE);
179 assertEquals("Wrong last", 'g', it.next());
|
| /external/kernel-headers/original/linux/ |
| tcp.h | 180 __u16 saw_tstamp : 1, /* Saw TIMESTAMP on last packet */
225 __u32 snd_sml; /* Last byte of the most recently transmitted small packet */
226 __u32 rcv_tstamp; /* timestamp of last received ACK (for keepalives) */
227 __u32 lsndtime; /* timestamp of last sent data packet (for restart window) */
264 __u32 mdev_max; /* maximal mdev for the last rtt period */
272 * Options received (usually on last packet, some only on SYN packets).
289 __u32 rcv_wup; /* rcv_nxt on last window update sent */
291 __u32 pushed_seq; /* Last pushed seq, required to talk to windows */
320 __u32 retrans_stamp; /* Timestamp of the last retransmit,
|
| /external/webkit/WebCore/rendering/ |
| RenderLineBoxList.cpp | 102 InlineFlowBox* last = box; local
105 last = curr;
107 m_lastLineBox = last;
161 // We can check the first box and last box and avoid painting if we don't
164 // if some line in the middle has a huge overflow, it might actually extend below the last line.
177 // based off positions of our first line box or our last line box.
229 // We can check the first box and last box and avoid hit testing if we don't
232 // if some line in the middle has a huge overflow, it might actually extend below the last line.
238 // based off positions of our first line box or our last line box.
|
| /frameworks/base/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) {
|
| /bionic/libc/unistd/ |
| popen.c | 141 struct pid *cur, *last; local
146 for (last = NULL, cur = pidlist; cur; last = cur, cur = cur->next)
160 if (last == NULL)
163 last->next = cur->next;
|
| /dalvik/dx/src/com/android/dx/ssa/back/ |
| RegisterAllocator.java | 128 * last insn in a block.
131 * be last insn in block
149 * adding before the last insn, and the last insn must have no
185 // Everything that's a source in the last insn interferes.
|
| /dalvik/libcore/archive/src/main/java/java/util/jar/ |
| InitManifest.java | 118 // if the last line break is missed, the line
163 int last = pos; local
187 decode(mark, last, false);
198 last = pos;
201 decode(mark, last, true);
|
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/atomic/ |
| AtomicLongArray.java | 63 int last = length-1; local
64 for (int i = 0; i < last; ++i)
66 // Do the last write as volatile
67 unsafe.putLongVolatile(this.array, rawIndex(last), array[last]);
|
| AtomicReferenceArray.java | 63 int last = length-1; local
64 for (int i = 0; i < last; ++i)
66 // Do the last write as volatile
67 E e = array[last];
68 unsafe.putObjectVolatile(this.array, rawIndex(last), e);
|
| /dalvik/vm/compiler/ |
| Compiler.h | 115 kJitHintTaken = 1, // Last inst in run was taken branch
116 kJitHintNotTaken = 2, // Last inst in run was not taken branch
117 kJitHintNoBias = 3, // Last inst in run was unbiased branch
122 * sequence of Dalvik byte codes, the last of which can be
129 unsigned runEnd:1; // Run ends with last byte code
|
| /external/bluetooth/glib/glib/ |
| gslist.c | 115 GSList *last; local
123 last = g_slist_last (list);
124 /* g_assert (last != NULL); */
125 last->next = new_list;
148 * list = g_slist_prepend (list, "last");
251 GSList *node, *last = NULL; local
253 for (node = slist; node; last = node, node = last->next)
256 if (!last)
268 node->next = last->next
472 GSList *last; local
[all...] |
| /external/easymock/src/org/easymock/ |
| IExpectationSetters.java | 111 * Expect the last invocation <code>count</code> times.
120 * Expect the last invocation between <code>min</code> and
132 * Expect the last invocation once. This is default in EasyMock.
139 * Expect the last invocation at least once.
146 * Expect the last invocation any times.
|
| /external/icu4c/test/intltest/ |
| tstnrapi.cpp | 127 // test last()/previous() with an internal buffer overflow
130 if(copy.last()!=0x308) {
131 errln("error in Normalizer(1000*U+0308).last()");
136 if(norm.first()!=0x61 || norm.next()!=0x308 || norm.last()!=0x2f800) {
137 errln("error in Normalizer(UNORM_NONE).first()/next()/last()");
|
| /external/opencore/codecs_v2/video/m4v_h263/enc/src/ |
| vlc_enc_tab.h | 182 /* MCBPC Indexing by cbpc in first two bits, mode in last two.
225 /* DCT coefficients. Four tables, two for last = 0, two for last = 1.
228 /* first part of coeffs for last = 0. Indexed by [run][level-1] */
246 /* rest of coeffs for last = 0. indexing by [run-2][level-1] */
330 /* first coeffs of last = 1. indexing by [run][level-1] */
344 /* rest of coeffs for last = 1. indexing by [run-2] */
364 /* Coeffs for last = 0, run = 0. Indexed by [level-1] */
378 /* Coeffs for last = 0, run = 1. Indexed by [level-1] */
387 /* Coeffs for last = 0, run = 2 -> 9. Indexed by [run-2][level-1] *
[all...] |
| /external/opencore/fileformats/mp4/composer/src/ |
| mediaheaderatom.cpp | 58 * last sample as well, which in our case fp same as the last but one.
78 // last sample
140 * last sample as well, which in our case fp same as the last but one.
|
| trackheaderatom.cpp | 103 * last sample as well, which in our case fp same as the last but one.
135 // last sample
204 * last sample as well, which in our case is same as the last but one.
|
| /external/webkit/WebCore/bindings/js/ |
| SerializedScriptValue.cpp | 302 InputArray array = inputArrayStack.last();
303 uint32_t index = indexStack.last();
304 if (index == lengthStack.last()) {
305 InputArray inArray = inputArrayStack.last();
306 OutputArray outArray = outputArrayStack.last();
321 indexStack.last()++;
335 OutputArray outArray = outputArrayStack.last();
336 context.putProperty(outArray, indexStack.last(), outValue);
337 indexStack.last()++;
367 InputObject object = inputObjectStack.last();
[all...] |
