/libcore/luni/src/test/java/libcore/java/util/ |
ServiceLoaderTest.java | 33 Iterator<ServiceLoaderTestInterface> it = loader.iterator(); local 34 assertTrue(it.hasNext()); 35 assertTrue(it.next() instanceof Impl1); 36 assertTrue(it.hasNext()); 37 assertTrue(it.next() instanceof Impl2); 38 assertFalse(it.hasNext());
|
/packages/apps/QuickSearchBox/src/com/android/quicksearchbox/ |
JsonBackedSuggestionExtras.java | 39 Iterator<String> it = mExtras.keys(); local 40 while (it.hasNext()) { 41 mColumns.add(it.next());
|
/libcore/ojluni/src/main/java/java/util/ |
AbstractCollection.java | 5 * This code is free software; you can redistribute it and/or modify it 11 * This code is distributed in the hope that it will be useful, but WITHOUT 99 Iterator<E> it = iterator(); local 101 while (it.hasNext()) 102 if (it.next()==null) 105 while (it.hasNext()) 106 if (o.equals(it.next())) 137 Iterator<E> it = iterator(); local 139 if (! it.hasNext()) // fewer elements than expecte 179 Iterator<E> it = iterator(); local 280 Iterator<E> it = iterator(); local 370 Iterator<?> it = iterator(); local 403 Iterator<E> it = iterator(); local 429 Iterator<E> it = iterator(); local 450 Iterator<E> it = iterator(); local [all...] |
/libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
SpinedBufferTest.java | 5 * This code is free software; you can redistribute it and/or modify it 9 * This code is distributed in the hope that it will be useful, but WITHOUT 126 Iterator<Integer> it = sb.iterator(); local 128 list2.add(it.next()); 129 assertFalse(it.hasNext()); 201 PrimitiveIterator.OfInt it = sb.iterator(); local 203 list2.add(it.nextInt()); 204 assertFalse(it.hasNext()); 276 PrimitiveIterator.OfLong it = sb.iterator() local 352 PrimitiveIterator.OfDouble it = sb.iterator(); local [all...] |
/cts/apps/CtsVerifier/src/com/android/cts/verifier/camera/fov/ |
CtsTestHelper.java | 30 Intent it = new Intent(); local 31 it.putExtra(REPORTED_FOV_EXTRA, reportedFOV); 32 it.putExtra(MEASURED_FOV_EXTRA, measuredFOV); 33 activity.setResult(Activity.RESULT_OK, it);
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
TestTreeIterator.java | 44 TreeIterator it = new TreeIterator(t); local 45 StringBuffer buf = toString(it); 55 TreeIterator it = new TreeIterator(t); local 56 StringBuffer buf = toString(it); 66 TreeIterator it = new TreeIterator(t); local 67 StringBuffer buf = toString(it); 77 TreeIterator it = new TreeIterator(t); local 78 StringBuffer buf = toString(it); 88 TreeIterator it = new TreeIterator(t); local 89 StringBuffer buf = toString(it); 99 TreeIterator it = new TreeIterator(t); local 110 TreeIterator it = new TreeIterator(t); local [all...] |
/external/smali/util/src/main/java/org/jf/util/ |
AbstractForwardSequentialList.java | 48 Iterator<T> it = iterator(); local 50 it.next(); 52 return it;
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
AttributedCharacterIteratorTest.java | 32 AttributedCharacterIterator it = attrString.getIterator(); local 33 assertEquals("Wrong first", 'T', it.current()); 34 it.next(); 35 assertEquals("Wrong second", 'e', it.current()); 37 it.next(); 38 assertEquals("Wrong last", 'g', it.current()); 39 it.next(); 40 assertTrue("Wrong final", it.current() == CharacterIterator.DONE); 42 it = attrString.getIterator(null, 2, 8); 43 assertEquals("Wrong first2", 's', it.current()) 52 AttributedCharacterIterator it = attrString.getIterator(); local 68 AttributedCharacterIterator it = attrString.getIterator(null, 2, 6); local 78 AttributedCharacterIterator it = attrString.getIterator(null, 2, 6); local 88 AttributedCharacterIterator it = attrString.getIterator(); local 105 AttributedCharacterIterator it = attrString.getIterator(); local 121 AttributedCharacterIterator it = attrString.getIterator(); local 138 AttributedCharacterIterator it = attrString.getIterator(); local 149 AttributedCharacterIterator it = attrString.getIterator(); local 161 AttributedCharacterIterator it = as.getIterator(); local [all...] |
/art/compiler/debug/dwarf/ |
debug_abbrev_writer.h | 38 // It is possible to think of them as type definitions. 69 auto it = abbrev_codes_.insert(std::make_pair(std::move(current_abbrev_), NextAbbrevCode())); local 70 uint32_t abbrev_code = it.first->second; 71 if (UNLIKELY(it.second)) { // Inserted new entry. 72 const Vector& abbrev = it.first->first;
|
/art/compiler/dex/ |
verification_results.cc | 58 auto it = verified_methods_.find(ref); local 59 if (it != verified_methods_.end()) { 60 // TODO: Investigate why are we doing the work again for this method and try to avoid it. 64 DCHECK_EQ(it->second->GetDevirtMap().size(), verified_method->GetDevirtMap().size()); 65 DCHECK_EQ(it->second->GetSafeCastSet().size(), verified_method->GetSafeCastSet().size()); 67 // Delete the new verified method since there was already an existing one registered. It 68 // is unsafe to replace the existing one since the JIT may be using it to generate a 79 auto it = verified_methods_.find(ref); local 80 return (it != verified_methods_.end()) ? it->second : nullptr [all...] |
/art/runtime/gc/accounting/ |
heap_bitmap.cc | 28 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), local 30 CHECK(it != continuous_space_bitmaps_.end()) << " continuous space bitmap " << old_bitmap 32 *it = new_bitmap; 37 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), old_bitmap); local 38 CHECK(it != large_object_bitmaps_.end()) << " large object bitmap " << old_bitmap 40 *it = new_bitmap; 57 auto it = std::find(continuous_space_bitmaps_.begin(), continuous_space_bitmaps_.end(), bitmap); local 58 DCHECK(it != continuous_space_bitmaps_.end()); 59 continuous_space_bitmaps_.erase(it); 69 auto it = std::find(large_object_bitmaps_.begin(), large_object_bitmaps_.end(), bitmap) local [all...] |
/cts/suite/audio_quality/lib/src/ |
Report.cpp | 93 std::list<StringPair>::const_iterator it; local 94 for (it = begin; it != end; it++) { 96 printf(" <test title=\"%s\" result=\"pass\" >", it->first.string()); 98 printf(" <test title=\"%s\" result=\"fail\" >", it->first.string()); 100 printf(" <details>\n%s", it->second.string());
|
/cts/suite/audio_quality/lib/src/task/ |
TaskSequential.cpp | 94 std::list<TaskAsync*>::iterator it; local 95 it = std::find(mAsyncTasks.begin(), mAsyncTasks.end(), task); 96 if (it != mAsyncTasks.end()) { // already queued
|
/external/androidplot/AndroidPlot-Core/src/test/java/com/androidplot/mock/ |
MockRectF.java | 31 public RectF it;
field in class:MockRectF 40 it.left = rhs.left;
41 it.top = rhs.top;
42 it.right = rhs.right;
43 it.bottom = rhs.bottom;
48 it.left = left;
49 it.top = top;
50 it.right = right;
51 it.bottom = bottom;
61 it.left = it.left + dx; [all...] |
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/x509/ |
CertificatePoliciesTest.java | 60 Iterator it = policyInformations.iterator(); local 61 ((PolicyInformation) it.next()).getPolicyIdentifier();
|
/external/apache-harmony/support/src/test/java/tests/support/ |
Support_UnmodifiableMapTest.java | 130 Iterator<?> it = keySet.iterator(); local 131 while (it.hasNext()) { 134 keySet.contains(it.next())); 145 for (int counter = 0; it.hasNext(); counter++) { 148 objArray[counter] == it.next()); 154 for (int counter = 0; it.hasNext(); counter++) { 157 objArray[counter] == it.next());
|
/external/apache-http/src/org/apache/http/impl/client/ |
DefaultConnectionKeepAliveStrategy.java | 65 HeaderElementIterator it = new BasicHeaderElementIterator( local 67 while (it.hasNext()) { 68 HeaderElement he = it.nextElement();
|
/external/avahi/avahi-compat-howl/samples/ |
browse.c | 48 sw_text_record_iterator it; local 62 err = sw_text_record_iterator_init(&it, text_record, text_record_len); 65 while (sw_text_record_iterator_next(it, key, oval, &oval_len) == SW_OKAY) 70 err = sw_text_record_iterator_fina(it);
|
resolve.c | 48 sw_text_record_iterator it; local 62 err = sw_text_record_iterator_init(&it, text_record, text_record_len); 65 while (sw_text_record_iterator_next(it, key, oval, &oval_len) == SW_OKAY) 70 err = sw_text_record_iterator_fina(it);
|
/external/avahi/avahi-compat-howl/ |
text-test.c | 4 avahi is free software; you can redistribute it and/or modify it 9 avahi is distributed in the hope that it will be useful, but WITHOUT 69 sw_text_record_iterator it; local 82 ASSERT_SW_OKAY(sw_text_record_iterator_init(&it, sw_text_record_bytes(r), sw_text_record_len(r))); 84 while (sw_text_record_iterator_next(it, key, val, &val_len) == SW_OKAY) { 89 ASSERT_SW_OKAY(sw_text_record_iterator_fina(it));
|
/external/ceres-solver/internal/ceres/ |
compressed_col_sparse_matrix_utils.cc | 59 // It does so by iterating over the columns, but only considering 69 vector<int>::const_iterator it = lower_bound(row_block_starts.begin(), local 72 // Since we are using lower_bound, it will return the row id 81 if (it == row_block_starts.end() || *it != scalar_rows[idx]) { 85 block_rows->push_back(it - row_block_starts.begin());
|
map_util.h | 43 // Crash if it does not. 49 // * It has a side-effect of inserting missing keys 50 // * It is not thread-safe (even when it is not inserting, it can still 52 // * It invalidates iterators (when it chooses to resize) 53 // * It default constructs a value object even if it doesn't need to 55 // This version assumes the key is printable, and includes it in the fatal lo 61 typename Collection::const_iterator it = collection.find(key); local 74 typename Collection::const_iterator it = collection.find(key); local 102 typename Collection::iterator it = collection.find(key); local 113 typename Collection::const_iterator it = collection.find(key); local [all...] |
/external/clang/lib/Analysis/ |
CocoaConventions.cpp | 98 StringRef::iterator it = functionName.begin(); local 99 StringRef::iterator start = it; 104 for ( ; it != endI ; ++it) { 105 // Search for the first character. It can either be 'C' or 'c'. 106 char ch = *it; 109 if (ch == 'c' && it != start && isLetter(*(it - 1))) 112 ++it; 118 if (it == endI [all...] |
/external/deqp/framework/delibs/decpp/ |
deSTLUtil.hpp | 44 const typename C::const_iterator it = container.find(item); local 45 return (it != container.end()); 51 const I it = std::find(begin, end, item); local 52 return (it != end); 80 typename M::const_iterator it = map.find(key); local 81 if (it == map.end()) 83 return &it->second;
|
/external/google-breakpad/src/processor/ |
simple_symbol_supplier.cc | 132 map<string, char *>::iterator it = memory_buffers_.find(module->code_file()); local 133 if (it == memory_buffers_.end()) { 138 delete [] it->second; 139 memory_buffers_.erase(it);
|