HomeSort by relevance Sort by last modified time
    Searched refs:newEntry (Results 1 - 25 of 722) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /libcore/luni/src/test/java/libcore/java/util/zip/
OldAndroidZipStreamTest.java 97 ZipEntry newEntry = new ZipEntry("file-" + i);
100 newEntry.setComment("this is file " + i);
101 out.putNextEntry(newEntry);
120 ZipEntry newEntry = new ZipEntry("file-" + i);
123 newEntry.setComment("this is file " + i);
124 newEntry.setMethod(ZipEntry.STORED);
125 newEntry.setSize(128 * 1024);
126 newEntry.setCrc(crcs[i]);
127 out.putNextEntry(newEntry);
OldAndroidZipFileTest.java 84 ZipEntry newEntry = new ZipEntry("file-" + i);
87 newEntry.setComment("this is file " + i);
89 out.putNextEntry(newEntry);
  /external/skia/src/core/
SkTInternalLList.h 122 void addBefore(T* newEntry, T* existingEntry) {
123 SkASSERT(newEntry);
126 this->addToTail(newEntry);
131 newEntry->fNext = existingEntry;
133 existingEntry->fPrev = newEntry;
134 newEntry->fPrev = prev;
137 fHead = newEntry;
139 prev->fNext = newEntry;
142 newEntry->fList = this;
151 void addAfter(T* newEntry, T* existingEntry)
    [all...]
SkTDynamicHash.h 107 // Add an entry with this key. We require that no entry with newEntry's key is already present.
108 void add(T* newEntry) {
109 SkASSERT(nullptr == this->find(GetKey(*newEntry)));
111 this->innerAdd(newEntry);
207 void innerAdd(T* newEntry) {
208 const Key& key = GetKey(*newEntry);
218 fArray[index] = newEntry;
SkTMultiMap.h 49 ValueList* newEntry = new ValueList(list->fValue);
50 newEntry->fNext = list->fNext;
53 list->fNext = newEntry;
  /external/skqp/src/core/
SkTInternalLList.h 122 void addBefore(T* newEntry, T* existingEntry) {
123 SkASSERT(newEntry);
126 this->addToTail(newEntry);
131 newEntry->fNext = existingEntry;
133 existingEntry->fPrev = newEntry;
134 newEntry->fPrev = prev;
137 fHead = newEntry;
139 prev->fNext = newEntry;
142 newEntry->fList = this;
151 void addAfter(T* newEntry, T* existingEntry)
    [all...]
SkTDynamicHash.h 107 // Add an entry with this key. We require that no entry with newEntry's key is already present.
108 void add(T* newEntry) {
109 SkASSERT(nullptr == this->find(GetKey(*newEntry)));
111 this->innerAdd(newEntry);
207 void innerAdd(T* newEntry) {
208 const Key& key = GetKey(*newEntry);
218 fArray[index] = newEntry;
SkTMultiMap.h 49 ValueList* newEntry = new ValueList(list->fValue);
50 newEntry->fNext = list->fNext;
53 list->fNext = newEntry;
  /libcore/ojluni/src/main/java/java/text/
MergeCollation.java 235 private final void fixEntry(PatternEntry newEntry) throws ParseException
242 if (lastEntry != null && newEntry.chars.equals(lastEntry.chars)
243 && newEntry.extension.equals(lastEntry.extension)) {
244 if (newEntry.strength != Collator.IDENTICAL
245 && newEntry.strength != PatternEntry.RESET) {
247 + newEntry + " are adjacent in the rules, but have conflicting "
256 if (newEntry.strength != PatternEntry.RESET) {
259 if ((newEntry.chars.length() == 1)) {
261 char c = newEntry.chars.charAt(0);
267 oldIndex = patterns.lastIndexOf(newEntry);
    [all...]
  /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/
CachingIconLoader.java 60 Entry newEntry = null;
65 newEntry = new Entry();
66 storeInIconCache(drawableId, newEntry);
77 newEntry.set(drawable);
78 storeInIconCache(drawableId, newEntry);
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
generic.h 187 #define newTermEntry(s) (TermEntry *) newEntry(s, sizeof(TermEntry))
188 #define newRuleEntry(s) (RuleEntry *) newEntry(s, sizeof(RuleEntry))
189 #define newCacheEntry(s) (CacheEntry *) newEntry(s, sizeof(CacheEntry))
190 #define newLabelEntry(s) (LabelEntry *) newEntry(s, sizeof(LabelEntry))
191 #define newSignalEntry(s) (SignalEntry *) newEntry(s, sizeof(SignalEntry))
192 #define newPredEntry(s) (PredEntry *) newEntry(s,sizeof(PredEntry))
  /external/guava/guava/src/com/google/common/collect/
RegularImmutableMap.java 65 ImmutableMapEntry<K, V> newEntry = (existing == null)
68 table[tableIndex] = newEntry;
69 entries[entryIndex] = newEntry;
70 checkNoConflictInBucket(key, newEntry, existing);
92 ImmutableMapEntry<K, V> newEntry = (existing == null)
95 table[tableIndex] = newEntry;
96 entries[entryIndex] = newEntry;
97 checkNoConflictInBucket(key, newEntry, existing);
RegularImmutableBiMap.java 84 ImmutableMapEntry<K, V> newEntry =
88 keyTable[keyBucket] = newEntry;
89 valueTable[valueBucket] = newEntry;
90 entries[i] = newEntry;
133 ImmutableMapEntry<K, V> newEntry =
137 keyTable[keyBucket] = newEntry;
138 valueTable[valueBucket] = newEntry;
139 entries[i] = newEntry;
  /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/phone/
HeadsUpAppearanceController.java 178 NotificationData.Entry newEntry = null;
180 newEntry = mHeadsUpManager.getTopEntry();
183 mHeadsUpStatusBarView.setEntry(newEntry);
184 if (newEntry != previousEntry) {
186 if (newEntry == null) {
198 mNotificationIconAreaController.showIconIsolated(newEntry == null ? null
199 : newEntry.icon, animateIsolation);
  /libcore/ojluni/src/main/java/sun/util/locale/
LocaleObjectCache.java 69 CacheEntry<K, V> newEntry = new CacheEntry<>(key, newVal, queue);
71 entry = map.putIfAbsent(key, newEntry);
77 map.put(key, newEntry);
  /external/icu/android_icu4j/src/main/java/android/icu/impl/locale/
LocaleObjectCache.java 47 CacheEntry<K, V> newEntry = new CacheEntry<K, V>(key, newVal, _queue);
51 entry = _map.putIfAbsent(key, newEntry);
  /external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/impl/locale/
LocaleObjectCache.java 43 CacheEntry<K, V> newEntry = new CacheEntry<K, V>(key, newVal, _queue);
47 entry = _map.putIfAbsent(key, newEntry);
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/
LocaleObjectCache.java 43 CacheEntry<K, V> newEntry = new CacheEntry<K, V>(key, newVal, _queue);
47 entry = _map.putIfAbsent(key, newEntry);
  /external/guava/guava-gwt/test-super/com/google/common/collect/testing/super/com/google/common/collect/testing/testers/
MapPutTester.java 146 Entry<K, V> newEntry = entry(null, samples.e3.getValue());
149 getValueForNullKey(), put(newEntry));
152 expected[getNullLocation()] = newEntry;
219 Entry<K, V> newEntry = entry(getKeyForNullValue(), samples.e3.getValue());
222 put(newEntry));
225 expected[getNullLocation()] = newEntry;
  /external/guava/guava-testlib/src/com/google/common/collect/testing/
AbstractMapTester.java 200 protected final void expectReplacement(Entry<K, V> newEntry) {
202 replaceValue(expected, newEntry);
206 private void replaceValue(List<Entry<K, V>> expected, Entry<K, V> newEntry) {
208 if (Helpers.equal(i.next().getKey(), newEntry.getKey())) {
209 i.set(newEntry);
215 "key %s not found in entries %s", newEntry.getKey(), expected));
  /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
MapPutTester.java 149 Entry<K, V> newEntry = entry(null, samples.e3.getValue());
152 getValueForNullKey(), put(newEntry));
155 expected[getNullLocation()] = newEntry;
222 Entry<K, V> newEntry = entry(getKeyForNullValue(), samples.e3.getValue());
225 put(newEntry));
228 expected[getNullLocation()] = newEntry;
  /frameworks/support/app-toolkit/common/src/main/java/androidx/arch/core/internal/
SafeIterableMap.java 74 Entry<K, V> newEntry = new Entry<>(key, v);
77 mStart = newEntry;
79 return newEntry;
82 mEnd.mNext = newEntry;
83 newEntry.mPrevious = mEnd;
84 mEnd = newEntry;
85 return newEntry;
  /frameworks/base/tools/locked_region_code_injection/src/lockedregioncodeinjection/
Main.java 76 ZipEntry newEntry = new ZipEntry(entry.getName());
77 zos.putNextEntry(newEntry);
  /external/guava/guava-tests/benchmark/com/google/common/cache/
ChainBenchmark.java 47 chain = segment.newEntry(key, cache.hash(key), chain);
  /external/skia/src/fonts/
SkFontMgr_indirect.cpp 129 DataEntry& newEntry = fDataCache.push_back();
131 newEntry.fDataId = id.fDataId;
132 newEntry.fTtcIndex = id.fTtcIndex;
133 newEntry.fTypeface = typeface.get(); // weak reference passed to new entry.

Completed in 462 milliseconds

1 2 3 4 5 6 7 8 91011>>