| /external/emma/core/java12/com/vladium/util/ |
| D | IntIntMap.java | 61 m_buckets = new Entry [initialCapacity]; in IntIntMap()
87 final Entry [] buckets = m_buckets; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
111 final Entry [] buckets = m_buckets; in get()
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
130 final Entry [] buckets = m_buckets; in get()
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
153 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
170 Entry currentKeyEntry = null; in put()
178 Entry [] buckets = m_buckets; in put()
[all …]
|
| D | IntObjectMap.java | 61 m_buckets = new Entry [initialCapacity]; in IntObjectMap()
87 final Entry [] buckets = m_buckets; in contains()
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
112 final Entry [] buckets = m_buckets; in get()
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
136 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
156 Entry currentKeyEntry = null; in put()
164 Entry [] buckets = m_buckets; in put()
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
191 final Entry bucketListHead = buckets [bucketIndex]; in put()
[all …]
|
| D | ObjectIntMap.java | 63 m_buckets = new Entry [initialCapacity]; in ObjectIntMap()
91 final Entry [] buckets = m_buckets; in contains()
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
119 final Entry [] buckets = m_buckets; in get()
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in get()
143 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in keys()
162 Entry currentKeyEntry = null; in put()
171 Entry [] buckets = m_buckets; in put()
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in put()
195 final Entry bucketListHead = buckets [bucketIndex]; in put()
[all …]
|
| D | IntSet.java | 59 m_buckets = new Entry [initialCapacity]; in IntSet()
85 final Entry [] buckets = m_buckets; in contains()
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in contains()
109 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
127 for (Entry entry = m_buckets [b]; entry != null; entry = entry.m_next) in values()
137 Entry currentKeyEntry = null; in add()
145 Entry [] buckets = m_buckets; in add()
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next) in add()
163 final Entry bucketListHead = buckets [bucketIndex]; in add()
164 final Entry newEntry = new Entry (key, bucketListHead); in add()
[all …]
|
| /external/e2fsprogs/tests/f_bad_inode_csum/ |
| D | expect.1 | 47 Entry '86' in / (2) has deleted/unused inode 97. Clear? yes
49 Entry '87' in / (2) has deleted/unused inode 98. Clear? yes
51 Entry '88' in / (2) has deleted/unused inode 99. Clear? yes
53 Entry '89' in / (2) has deleted/unused inode 100. Clear? yes
55 Entry '90' in / (2) has deleted/unused inode 101. Clear? yes
57 Entry '91' in / (2) has deleted/unused inode 102. Clear? yes
59 Entry '92' in / (2) has deleted/unused inode 103. Clear? yes
61 Entry '93' in / (2) has deleted/unused inode 104. Clear? yes
63 Entry '94' in / (2) has deleted/unused inode 105. Clear? yes
65 Entry '95' in / (2) has deleted/unused inode 106. Clear? yes
[all …]
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| D | AbstractMapTester.java | 26 import java.util.Map.Entry;
41 AbstractContainerTester<Map<K, V>, Map.Entry<K, V>> {
52 @Override protected Collection<Map.Entry<K, V>> actualContents() { in actualContents()
79 protected Map.Entry<K, V>[] createArrayWithNullKey() { in createArrayWithNullKey()
80 Map.Entry<K, V>[] array = createSamplesArray(); in createArrayWithNullKey()
82 final Map.Entry<K, V> oldEntry = array[nullKeyLocation]; in createArrayWithNullKey()
95 private Entry<K, V> getEntryNullReplaces() { in getEntryNullReplaces()
96 Iterator<Entry<K, V>> entries = getSampleElements().iterator(); in getEntryNullReplaces()
107 protected Map.Entry<K, V>[] createArrayWithNullValue() { in createArrayWithNullValue()
108 Map.Entry<K, V>[] array = createSamplesArray(); in createArrayWithNullValue()
[all …]
|
| D | DerivedCollectionGenerators.java | 33 import java.util.Map.Entry;
46 implements TestSetGenerator<Map.Entry<K, V>>, DerivedGenerator {
47 private final OneSizeTestContainerGenerator<Map<K, V>, Map.Entry<K, V>>
52 Map<K, V>, Map.Entry<K, V>> mapGenerator) { in MapEntrySetGenerator()
57 public SampleElements<Map.Entry<K, V>> samples() { in samples()
62 public Set<Map.Entry<K, V>> create(Object... elements) { in create()
67 public Map.Entry<K, V>[] createArray(int length) { in createArray()
72 public Iterable<Map.Entry<K, V>> order( in order()
73 List<Map.Entry<K, V>> insertionOrder) { in order()
78 public OneSizeTestContainerGenerator<Map<K, V>, Map.Entry<K, V>> getInnerGenerator() { in getInnerGenerator()
[all …]
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| D | DerivedGoogleCollectionGenerators.java | 33 import java.util.Map.Entry;
46 private final OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> generator;
49 OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> oneSizeTestContainerGenerator) { in MapGenerator()
54 public SampleElements<Map.Entry<K, V>> samples() { in samples()
64 public Map.Entry<K, V>[] createArray(int length) { in createArray()
69 public Iterable<Map.Entry<K, V>> order(List<Map.Entry<K, V>> insertionOrder) { in order()
93 private final OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> generator;
96 OneSizeTestContainerGenerator<BiMap<K, V>, Entry<K, V>> oneSizeTestContainerGenerator) { in InverseBiMapGenerator()
101 public SampleElements<Map.Entry<V, K>> samples() { in samples()
102 SampleElements<Entry<K, V>> samples = generator.samples(); in samples()
[all …]
|
| D | MapGenerators.java | 38 import java.util.Map.Entry;
50 @Override protected Map<String, String> create(Entry<String, String>[] entries) { in create()
52 for (Entry<String, String> entry : entries) { in create()
61 @Override protected Map<String, String> create(Entry<String, String>[] entries) { in create()
63 for (Entry<String, String> entry : entries) { in create()
107 implements TestListGenerator<Entry<String, Integer>> {
110 public SampleElements<Entry<String, Integer>> samples() { in samples()
111 return new SampleElements<Entry<String, Integer>>( in samples()
121 public Entry<String, Integer>[] createArray(int length) { in createArray()
122 return new Entry[length]; in createArray()
[all …]
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | MapsCollectionTest.java | 50 import java.util.Map.Entry;
71 protected SortedMap<String, String> create(Entry<String, String>[] entries) { in suite()
85 protected BiMap<String, String> create(Entry<String, String>[] entries) { in suite()
87 for (Entry<String, String> entry : entries) { in suite()
106 public SampleElements<Entry<String, Integer>> samples() { in suite()
107 return new SampleElements<Entry<String, Integer>>( in suite()
119 Entry<?, ?> entry = (Entry<?, ?>) e; in suite()
133 public Entry<String, Integer>[] createArray(int length) { in suite()
134 return new Entry[length]; in suite()
138 public Iterable<Entry<String, Integer>> order( in suite()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | Multisets.java | 29 import com.google.common.collect.Multiset.Entry;
121 transient Set<Multiset.Entry<E>> entrySet;
124 @Override public Set<Multiset.Entry<E>> entrySet() { in entrySet()
125 Set<Multiset.Entry<E>> es = entrySet; in entrySet()
211 public static <E> Multiset.Entry<E> immutableEntry(@Nullable E e, int n) { in immutableEntry()
298 Set<Entry<E>> createEntrySet() { in createEntrySet()
299 return Sets.filter(unfiltered.entrySet(), new Predicate<Entry<E>>() { in createEntrySet()
301 public boolean apply(Entry<E> entry) { in createEntrySet()
308 Iterator<Entry<E>> entryIterator() { in entryIterator()
407 Iterator<Entry<E>> entryIterator() {
[all …]
|
| D | ForwardingNavigableMap.java | 62 public Entry<K, V> lowerEntry(K key) { in lowerEntry()
71 protected Entry<K, V> standardLowerEntry(K key) { in standardLowerEntry()
90 public Entry<K, V> floorEntry(K key) { in floorEntry()
99 protected Entry<K, V> standardFloorEntry(K key) { in standardFloorEntry()
118 public Entry<K, V> ceilingEntry(K key) { in ceilingEntry()
127 protected Entry<K, V> standardCeilingEntry(K key) { in standardCeilingEntry()
146 public Entry<K, V> higherEntry(K key) { in higherEntry()
155 protected Entry<K, V> standardHigherEntry(K key) { in standardHigherEntry()
174 public Entry<K, V> firstEntry() { in firstEntry()
183 protected Entry<K, V> standardFirstEntry() { in standardFirstEntry()
[all …]
|
| /external/skqp/tests/ |
| D | DynamicHashTest.cpp | 16 struct Entry { struct
20 static const int& GetKey(const Entry& entry) { return entry.key; } in GetKey() argument
25 class Hash : public SkTDynamicHash<Entry, int> {
34 typedef SkTDynamicHash<Entry, int> INHERITED;
42 Entry a = { 1, 2.0 }; in DEF_TEST()
43 Entry b = { 2, 3.0 }; in DEF_TEST()
44 Entry c = { 3, 4.0 }; in DEF_TEST()
45 Entry d = { 4, 5.0 }; in DEF_TEST()
46 Entry e = { 5, 6.0 }; in DEF_TEST()
70 Entry a = { 1, 2.0 }; in DEF_TEST()
[all …]
|
| /external/skia/tests/ |
| D | DynamicHashTest.cpp | 16 struct Entry { struct
20 static const int& GetKey(const Entry& entry) { return entry.key; } in GetKey() argument
25 class Hash : public SkTDynamicHash<Entry, int> {
34 typedef SkTDynamicHash<Entry, int> INHERITED;
42 Entry a = { 1, 2.0 }; in DEF_TEST()
43 Entry b = { 2, 3.0 }; in DEF_TEST()
44 Entry c = { 3, 4.0 }; in DEF_TEST()
45 Entry d = { 4, 5.0 }; in DEF_TEST()
46 Entry e = { 5, 6.0 }; in DEF_TEST()
70 Entry a = { 1, 2.0 }; in DEF_TEST()
[all …]
|
| /external/grpc-grpc/src/csharp/Grpc.Core/ |
| D | Metadata.cs | 37 public sealed class Metadata : IList<Metadata.Entry>
56 readonly List<Entry> entries;
64 this.entries = new List<Entry>(); in Metadata()
85 public int IndexOf(Metadata.Entry item) in IndexOf()
93 public void Insert(int index, Metadata.Entry item) in Insert()
112 public Metadata.Entry this[int index]
130 public void Add(Metadata.Entry item) in Add()
142 Add(new Entry(key, value)); in Add()
150 Add(new Entry(key, valueBytes)); in Add()
165 public bool Contains(Metadata.Entry item) in Contains()
[all …]
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
| D | ChangeTimeScaleTrack.java | 37 List<CompositionTimeToSample.Entry> ctts;
38 List<TimeToSampleBox.Entry> tts;
59 …Queue<TimeToSampleBox.Entry> timeQueue = new LinkedList<TimeToSampleBox.Entry>(track.getDecodingTi… in getTimes()
73 TimeToSampleBox.Entry entry = timeQueue.poll(); in getTimes()
87 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() { in getDecodingTimeEntries()
91 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() { in getCompositionTimeEntries()
99 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() { in getSampleDependencies()
142 …static List<CompositionTimeToSample.Entry> adjustCtts(List<CompositionTimeToSample.Entry> source, … in adjustCtts()
144 …List<CompositionTimeToSample.Entry> entries2 = new ArrayList<CompositionTimeToSample.Entry>(source… in adjustCtts()
145 for (CompositionTimeToSample.Entry entry : source) { in adjustCtts()
[all …]
|
| D | DivideTimeScaleTrack.java | 43 public List<TimeToSampleBox.Entry> getDecodingTimeEntries() { in getDecodingTimeEntries()
47 public List<CompositionTimeToSample.Entry> getCompositionTimeEntries() { in getCompositionTimeEntries()
55 public List<SampleDependencyTypeBox.Entry> getSampleDependencies() { in getSampleDependencies()
90 List<CompositionTimeToSample.Entry> adjustCtts() { in adjustCtts()
91 List<CompositionTimeToSample.Entry> origCtts = this.source.getCompositionTimeEntries(); in adjustCtts()
93 …List<CompositionTimeToSample.Entry> entries2 = new ArrayList<CompositionTimeToSample.Entry>(origCt… in adjustCtts()
94 for (CompositionTimeToSample.Entry entry : origCtts) { in adjustCtts()
95 …entries2.add(new CompositionTimeToSample.Entry(entry.getCount(), entry.getOffset() / timeScaleDivi… in adjustCtts()
103 List<TimeToSampleBox.Entry> adjustTts() { in adjustTts()
104 List<TimeToSampleBox.Entry> origTts = source.getDecodingTimeEntries(); in adjustTts()
[all …]
|
| /external/skqp/src/core/ |
| D | SkLRUCache.h | 21 struct Entry { struct
22 Entry(const K& key, V&& value) in Entry() argument
29 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Entry); argument
37 Entry* node = fLRU.head(); in ~SkLRUCache()
46 Entry** value = fMap.find(key); in find()
50 Entry* entry = *value; in find()
59 Entry* entry = new Entry(key, std::move(value)); in insert()
74 typename SkTInternalLList<Entry>::Iter iter; in foreach()
75 for (Entry* e = iter.init(fLRU, SkTInternalLList<Entry>::Iter::kHead_IterStart); e; in foreach()
83 for (Entry* e = fLRU.head(); e; e = fLRU.head()) { in reset()
[all …]
|
| /external/skia/src/core/ |
| D | SkLRUCache.h | 21 struct Entry { struct
22 Entry(const K& key, V&& value) in Entry() function
29 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Entry); argument
37 Entry* node = fLRU.head(); in ~SkLRUCache()
46 Entry** value = fMap.find(key); in find()
50 Entry* entry = *value; in find()
59 Entry* entry = new Entry(key, std::move(value)); in insert()
74 typename SkTInternalLList<Entry>::Iter iter; in foreach()
75 for (Entry* e = iter.init(fLRU, SkTInternalLList<Entry>::Iter::kHead_IterStart); e; in foreach()
83 for (Entry* e = fLRU.head(); e; e = fLRU.head()) { in reset()
[all …]
|
| /external/grpc-grpc/src/csharp/Grpc.Core.Tests/ |
| D | MetadataTest.cs | 36 var entry = new Metadata.Entry("ABC", "XYZ"); in AsciiEntry()
42 Assert.Throws(typeof(ArgumentException), () => new Metadata.Entry("abc-bin", "xyz")); in AsciiEntry()
51 var entry = new Metadata.Entry("ABC-BIN", bytes); in BinaryEntry()
57 Assert.Throws(typeof(ArgumentException), () => new Metadata.Entry("abc", bytes)); in BinaryEntry()
65 new Metadata.Entry("ABC", "XYZ"); in AsciiEntry_KeyValidity()
66 new Metadata.Entry("0123456789abc", "XYZ"); in AsciiEntry_KeyValidity()
67 new Metadata.Entry("-abc", "XYZ"); in AsciiEntry_KeyValidity()
68 new Metadata.Entry("a_bc_", "XYZ"); in AsciiEntry_KeyValidity()
69 new Metadata.Entry("abc.xyz", "XYZ"); in AsciiEntry_KeyValidity()
70 new Metadata.Entry("abc.xyz-bin", new byte[] {1, 2, 3}); in AsciiEntry_KeyValidity()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-mca/ |
| D | TimelineView.cpp | 77 const WaitTimeEntry &Entry, in printWaitTimeEntry() argument
82 if (Entry.Executions == 0) { in printWaitTimeEntry()
86 unsigned Executions = Entry.Executions; in printWaitTimeEntry()
87 AverageTime1 = (double)Entry.CyclesSpentInSchedulerQueue / Executions; in printWaitTimeEntry()
88 AverageTime2 = (double)Entry.CyclesSpentInSQWhileReady / Executions; in printWaitTimeEntry()
89 AverageTime3 = (double)Entry.CyclesSpentAfterWBAndBeforeRetire / Executions; in printWaitTimeEntry()
143 const TimelineViewEntry &Entry, in printTimelineViewEntry() argument
150 for (unsigned I = 0, E = Entry.CycleDispatched; I < E; ++I) in printTimelineViewEntry()
153 if (Entry.CycleDispatched != Entry.CycleExecuted) { in printTimelineViewEntry()
156 for (unsigned I = Entry.CycleDispatched + 1, E = Entry.CycleIssued; I < E; in printTimelineViewEntry()
[all …]
|
| /external/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | SmallSortedMap.java | 106 final Map.Entry<FieldDescriptorType, Object> entry = in newFieldMap()
113 for (Map.Entry<FieldDescriptorType, Object> entry : in newFieldMap()
141 private List<Entry> entryList;
184 public Map.Entry<K, V> getArrayEntryAt(int index) {
194 public Iterable<Map.Entry<K, V>> getOverflowEntries() {
196 EmptySet.<Map.Entry<K, V>>iterable() :
252 final Entry lastEntryInArray = entryList.remove(maxArraySize - 1); in put()
256 entryList.add(insertionPoint, new Entry(key, value)); in put()
301 final Iterator<Map.Entry<K, V>> iterator = in removeArrayEntryAt()
303 entryList.add(new Entry(iterator.next())); in removeArrayEntryAt()
[all …]
|
| /external/v8/src/base/ |
| D | hashmap.h | 30 typedef TemplateHashMapEntry<Key, Value> Entry; typedef
52 Entry* Lookup(const Key& key, uint32_t hash) const;
57 Entry* LookupOrInsert(const Key& key, uint32_t hash,
64 Entry* LookupOrInsert(const Key& key, uint32_t hash, const Func& value_func,
67 Entry* InsertNew(const Key& key, uint32_t hash,
102 Entry* Start() const;
103 Entry* Next(Entry* entry) const;
114 Entry* map_;
121 Entry* map_end() const { return map_ + capacity_; } in map_end()
122 Entry* Probe(const Key& key, uint32_t hash) const;
[all …]
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| D | DwarfStringPool.cpp | 26 auto &Entry = I.first->second; in getEntry() local
27 Entry.Index = Pool.size() - 1; in getEntry()
28 Entry.Offset = NumBytes; in getEntry()
29 Entry.Symbol = ShouldCreateSymbols ? Asm.createTempSymbol(Prefix) : nullptr; in getEntry()
32 assert(NumBytes > Entry.Offset && "Unexpected overflow"); in getEntry()
52 for (const auto &Entry : Entries) { in emit() local
53 assert(ShouldCreateSymbols == static_cast<bool>(Entry->getValue().Symbol) && in emit()
58 Asm.OutStreamer->EmitLabel(Entry->getValue().Symbol); in emit()
62 Twine(Entry->getValue().Offset)); in emit()
64 StringRef(Entry->getKeyData(), Entry->getKeyLength() + 1)); in emit()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Mips/ |
| D | MicroMipsSizeReduction.cpp | 124 const ReduceEntry &Entry; // Entry field member
130 : MI(argMI), Entry(argEntry), NextMII(argNextMII) {} in ReduceEntryFunArgs()
192 static bool ReplaceInstruction(MachineInstr *MI, const ReduceEntry &Entry,
331 static bool ImmInRange(MachineInstr *MI, const ReduceEntry &Entry) { in ImmInRange() argument
335 if (!GetImm(MI, Entry.ImmField(), offset)) in ImmInRange()
338 if (!InRange(offset, Entry.Shift(), Entry.LBound(), Entry.HBound())) in ImmInRange()
346 const ReduceEntry &Entry) { in CheckXWPInstr() argument
362 if (!ImmInRange(MI, Entry)) in CheckXWPInstr()
425 for (ReduceEntryVector::const_iterator Entry = Range.first; in ReduceMI() local
426 Entry != Range.second; ++Entry) { in ReduceMI()
[all …]
|