| /external/jemalloc_new/test/unit/ |
| D | qr.c | 18 init_entries(ring_t *entries) { in init_entries() argument
22 qr_new(&entries[i], link); in init_entries()
23 entries[i].id = 'a' + i; in init_entries()
28 test_independent_entries(ring_t *entries) { in test_independent_entries() argument
34 qr_foreach(t, &entries[i], link) { in test_independent_entries()
43 qr_reverse_foreach(t, &entries[i], link) { in test_independent_entries()
51 t = qr_next(&entries[i], link); in test_independent_entries()
52 assert_ptr_eq(t, &entries[i], in test_independent_entries()
57 t = qr_prev(&entries[i], link); in test_independent_entries()
58 assert_ptr_eq(t, &entries[i], in test_independent_entries()
[all …]
|
| D | ql.c | 47 init_entries(list_t *entries, unsigned nentries) { in init_entries() argument
51 entries[i].id = 'a' + i; in init_entries()
52 ql_elm_new(&entries[i], link); in init_entries()
57 test_entries_list(list_head_t *head, list_t *entries, unsigned nentries) { in test_entries_list() argument
61 assert_c_eq(ql_first(head)->id, entries[0].id, "Element id mismatch"); in test_entries_list()
62 assert_c_eq(ql_last(head, link)->id, entries[nentries-1].id, in test_entries_list()
67 assert_c_eq(t->id, entries[i].id, "Element id mismatch"); in test_entries_list()
73 assert_c_eq(t->id, entries[nentries-i-1].id, in test_entries_list()
79 t = ql_next(head, &entries[i], link); in test_entries_list()
80 assert_c_eq(t->id, entries[i+1].id, "Element id mismatch"); in test_entries_list()
[all …]
|
| /external/llvm-project/llvm/test/DebugInfo/PDB/ |
| D | module-stats.test | 7 ALL-NEXT: Total: 6 entries ( 204 bytes)
9 ALL-NEXT: S_COMPILE3: 1 entries ( 60 bytes)
10 ALL-NEXT: S_OBJNAME: 1 entries ( 56 bytes)
11 ALL-NEXT: S_GPROC32: 1 entries ( 44 bytes)
12 ALL-NEXT: S_FRAMEPROC: 1 entries ( 32 bytes)
13 ALL-NEXT: S_BUILDINFO: 1 entries ( 8 bytes)
14 ALL-NEXT: S_END: 1 entries ( 4 bytes)
16 ALL-NEXT: Total: 2 entries ( 88 bytes)
18 ALL-NEXT: DEBUG_S_LINES: 1 entries ( 56 bytes)
19 ALL-NEXT: DEBUG_S_FILECHKSMS: 1 entries ( 32 bytes)
[all …]
|
| /external/webrtc/api/ |
| D | rtp_packet_infos.h | 51 explicit RtpPacketInfos(const vector_type& entries) in RtpPacketInfos() argument
52 : data_(Data::Create(entries)) {} in RtpPacketInfos()
54 explicit RtpPacketInfos(vector_type&& entries) in RtpPacketInfos() argument
55 : data_(Data::Create(std::move(entries))) {} in RtpPacketInfos()
62 const_reference operator[](size_type pos) const { return entries()[pos]; }
64 const_reference at(size_type pos) const { return entries().at(pos); } in at()
65 const_reference front() const { return entries().front(); } in front()
66 const_reference back() const { return entries().back(); } in back()
68 const_iterator begin() const { return entries().begin(); } in begin()
69 const_iterator end() const { return entries().end(); } in end()
[all …]
|
| /external/icing/icing/result/ |
| D | snippet-retriever_test.cc | 73 for (const SnippetProto::EntryProto& entry : snippet.entries()) { in GetPropertyPaths()
184 EXPECT_THAT(snippet.entries(), SizeIs(1)); in TEST_F()
185 EXPECT_THAT(snippet.entries(0).property_name(), Eq("body")); in TEST_F()
187 GetString(&document, snippet.entries(0).property_name()); in TEST_F()
188 EXPECT_THAT(GetWindows(content, snippet.entries(0)), ElementsAre("")); in TEST_F()
210 EXPECT_THAT(snippet.entries(), SizeIs(1)); in TEST_F()
211 EXPECT_THAT(snippet.entries(0).property_name(), Eq("body")); in TEST_F()
213 GetString(&document, snippet.entries(0).property_name()); in TEST_F()
214 EXPECT_THAT(GetWindows(content, snippet.entries(0)), ElementsAre("three")); in TEST_F()
236 EXPECT_THAT(snippet.entries(), SizeIs(1)); in TEST_F()
[all …]
|
| /external/exoplayer/tree/library/common/src/main/java/com/google/android/exoplayer2/metadata/ |
| D | Metadata.java | 53 private final Entry[] entries; field in Metadata
58 public Metadata(Entry... entries) { in Metadata() argument
59 this.entries = entries; in Metadata()
65 public Metadata(List<? extends Entry> entries) { in Metadata() argument
66 this.entries = new Entry[entries.size()]; in Metadata()
67 entries.toArray(this.entries); in Metadata()
71 entries = new Metadata.Entry[in.readInt()]; in Metadata()
72 for (int i = 0; i < entries.length; i++) { in Metadata()
73 entries[i] = in.readParcelable(Entry.class.getClassLoader()); in Metadata()
81 return entries.length; in length()
[all …]
|
| /external/google-breakpad/src/common/ |
| D | dwarf_cfi_to_module_unittest.cc | 83 vector<Module::StackFrameEntry *> entries; member
92 module.GetStackFrameEntries(&entries); in TEST_F()
93 EXPECT_EQ(1U, entries.size()); in TEST_F()
94 EXPECT_EQ(0xa21069698096fc98ULL, entries[0]->address); in TEST_F()
95 EXPECT_EQ(0xb440ce248169c8d6ULL, entries[0]->size); in TEST_F()
96 EXPECT_EQ(0U, entries[0]->initial_rules.size()); in TEST_F()
97 EXPECT_EQ(0U, entries[0]->rule_changes.size()); in TEST_F()
104 module.GetStackFrameEntries(&entries); in TEST_F()
105 EXPECT_EQ(1U, entries.size()); in TEST_F()
106 EXPECT_EQ(0x75b8806bb09eab78ULL, entries[0]->address); in TEST_F()
[all …]
|
| /external/llvm-project/polly/lib/External/isl/ |
| D | isl_hash.c | 56 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, in isl_hash_table_init()
58 if (!table->entries) in isl_hash_table_init()
82 struct isl_hash_table_entry *entries; in grow_table() local
85 entries = table->entries; in grow_table()
88 table->entries = isl_calloc_array(ctx, struct isl_hash_table_entry, in grow_table()
90 if (!table->entries) { in grow_table()
91 table->entries = entries; in grow_table()
102 if (!entries[h].data) in grow_table()
105 entry = isl_hash_table_find(ctx, table, entries[h].hash, in grow_table()
109 free(table->entries); in grow_table()
[all …]
|
| /external/google-fruit/include/fruit/impl/component_storage/ |
| D | partial_component_storage.defn.h | 34 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
35 (void)entries; in addBindings()
52 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
53 previous_storage.addBindings(entries); in addBindings()
70 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
71 previous_storage.addBindings(entries); in addBindings()
89 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
90 entries.push_back(InjectorStorage::createComponentStorageEntryForBindInstance<C, C>(instance)); in addBindings()
91 previous_storage.addBindings(entries); in addBindings()
109 void addBindings(FixedSizeVector<ComponentStorageEntry>& entries) const { in addBindings() argument
[all …]
|
| D | component_storage.defn.h | 26 inline ComponentStorage::ComponentStorage(FixedSizeVector<ComponentStorageEntry>&& entries) noexcept in ComponentStorage() argument
27 : entries(std::move(entries)) {} in ComponentStorage()
38 for (ComponentStorageEntry& entry : entries) { in destroy()
41 entries.clear(); in destroy()
49 return std::move(entries); in release()
53 return entries.size(); in numEntries()
59 entries = FixedSizeVector<ComponentStorageEntry>(other.entries.size());
60 for (const ComponentStorageEntry& entry : other.entries) {
61 entries.push_back(entry.copy());
68 entries = std::move(other.entries);
[all …]
|
| /external/starlark-go/starlarkstruct/ |
| D | struct.go | 58 entries: make(entries, 0, len(kwargs)),
63 s.entries = append(s.entries, entry{k, v})
65 sort.Sort(s.entries)
77 entries: make(entries, 0, len(d)),
80 s.entries = append(s.entries, entry{k, v})
82 sort.Sort(s.entries)
103 entries entries // sorted by name member
110 type entries []entry type
112 func (a entries) Len() int { return len(a) }
113 func (a entries) Less(i, j int) bool { return a[i].name < a[j].name }
[all …]
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/stmt/ |
| D | SwitchStmt.java | 77 private NodeList<SwitchEntry> entries; field in SwitchStmt
84 public SwitchStmt(final Expression selector, final NodeList<SwitchEntry> entries) { in SwitchStmt() argument
85 this(null, selector, entries); in SwitchStmt()
92 public SwitchStmt(TokenRange tokenRange, Expression selector, NodeList<SwitchEntry> entries) { in SwitchStmt() argument
95 setEntries(entries); in SwitchStmt()
113 return entries; in getEntries()
126 public SwitchStmt setEntries(final NodeList<SwitchEntry> entries) { in setEntries() argument
127 assertNotNull(entries); in setEntries()
128 if (entries == this.entries) { in setEntries()
131 notifyPropertyChange(ObservableProperty.ENTRIES, this.entries, entries); in setEntries()
[all …]
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/expr/ |
| D | SwitchExpr.java | 60 private NodeList<SwitchEntry> entries; field in SwitchExpr
67 public SwitchExpr(final Expression selector, final NodeList<SwitchEntry> entries) { in SwitchExpr() argument
68 this(null, selector, entries); in SwitchExpr()
75 public SwitchExpr(TokenRange tokenRange, Expression selector, NodeList<SwitchEntry> entries) { in SwitchExpr() argument
78 setEntries(entries); in SwitchExpr()
96 return entries; in getEntries()
109 public SwitchExpr setEntries(final NodeList<SwitchEntry> entries) { in setEntries() argument
110 assertNotNull(entries); in setEntries()
111 if (entries == this.entries) { in setEntries()
114 notifyPropertyChange(ObservableProperty.ENTRIES, this.entries, entries); in setEntries()
[all …]
|
| /external/wayland/src/ |
| D | wayland-util.c | 196 struct wl_array *entries; in wl_map_insert_new() local
200 entries = &map->client_entries; in wl_map_insert_new()
203 entries = &map->server_entries; in wl_map_insert_new()
208 start = entries->data; in wl_map_insert_new()
212 entry = wl_array_add(entries, sizeof *entry); in wl_map_insert_new()
215 start = entries->data; in wl_map_insert_new()
229 struct wl_array *entries; in wl_map_insert_at() local
232 entries = &map->client_entries; in wl_map_insert_at()
234 entries = &map->server_entries; in wl_map_insert_at()
238 count = entries->size / sizeof *start; in wl_map_insert_at()
[all …]
|
| /external/rust/crates/slab/src/ |
| D | lib.rs | 118 entries: Vec<Entry<T>>, field
164 entries: std::slice::Iter<'a, Entry<T>>, field
170 entries: std::slice::IterMut<'a, Entry<T>>, field
228 entries: Vec::with_capacity(capacity), in with_capacity()
244 self.entries.capacity() in capacity()
277 let need_add = self.len + additional - self.entries.len(); in reserve()
278 self.entries.reserve(need_add); in reserve()
311 let need_add = self.len + additional - self.entries.len(); in reserve_exact()
312 self.entries.reserve_exact(need_add); in reserve_exact()
356 self.entries.shrink_to_fit(); in shrink_to_fit()
[all …]
|
| /external/marisa-trie/tests/ |
| D | trie-test.cc | 234 marisa::grimoire::Vector<marisa::grimoire::trie::Entry> entries; in TestTextTail() local
236 tail.build(entries, &offsets, MARISA_TEXT_TAIL); in TestTextTail()
248 entries.push_back(entry); in TestTextTail()
250 tail.build(entries, &offsets, MARISA_TEXT_TAIL); in TestTextTail()
258 ASSERT(offsets.size() == entries.size()); in TestTextTail()
263 entries.clear(); in TestTextTail()
265 entries.push_back(entry); in TestTextTail()
267 entries.push_back(entry); in TestTextTail()
269 entries.push_back(entry); in TestTextTail()
271 entries.push_back(entry); in TestTextTail()
[all …]
|
| /external/mtools/ |
| D | hash.c | 31 T_HashTableEl *entries; member
67 H->entries = NewArray(size, T_HashTableEl); in alloc_ht()
68 if (H->entries == NULL) in alloc_ht()
72 H->entries[ii] = &unallocated; in alloc_ht()
98 if (H->entries[i] != &unallocated && in free_ht()
99 H->entries[i] != &deleted) in free_ht()
100 entry_free(H->entries[i]); in free_ht()
101 Free(H->entries); in free_ht()
115 while(H->entries[pos] != &unallocated && in _hash_add()
116 H->entries[pos] != &deleted){ in _hash_add()
[all …]
|
| /external/autotest/utils/ |
| D | summarize_loadtest.py | 64 def summarize_entries(entries, skip=set()): argument
74 'COUNT': len(entries),
76 summary.update({key: summarize_tags(entries, key) for key in TAG_KEYS
78 summary.update({key: summarize_values(entries, key) for key in VALUE_KEYS
82 def summarize_tags(entries, key): argument
84 tags = {str(entry[key]) for entry in entries}
87 def summarize_values(entries, key): argument
89 if entries is None or len(entries) == 0:
92 values = [entry[key] for entry in entries if key in entry]
99 num_skipped = len(entries) - num_values
[all …]
|
| /external/rust/crates/tokio-stream/src/ |
| D | stream_map.rs | 176 entries: Vec<(K, V)>, field
200 self.entries.iter() in iter()
223 self.entries.iter_mut() in iter_mut()
239 StreamMap { entries: vec![] } in new()
256 entries: Vec::with_capacity(capacity), in with_capacity()
343 self.entries.capacity() in capacity()
359 self.entries.len() in len()
375 self.entries.is_empty() in is_empty()
392 self.entries.clear(); in clear()
420 self.entries.push((k, stream)); in insert()
[all …]
|
| /external/javassist/src/main/javassist/bytecode/ |
| D | ExceptionTable.java | 45 private List<ExceptionTableEntry> entries; field in ExceptionTable
54 entries = new ArrayList<ExceptionTableEntry>(); in ExceptionTable()
69 entries = list; in ExceptionTable()
80 r.entries = new ArrayList<ExceptionTableEntry>(entries); in clone()
89 return entries.size(); in size()
98 return entries.get(nth).startPc; in startPc()
108 entries.get(nth).startPc = value; in setStartPc()
117 return entries.get(nth).endPc; in endPc()
127 entries.get(nth).endPc = value; in setEndPc()
136 return entries.get(nth).handlerPc; in handlerPc()
[all …]
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| D | SortedMapNavigationTester.java | 56 List<Entry<K, V>> entries = in setUp() local
60 Collections.sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator())); in setUp()
63 if (entries.size() >= 1) { in setUp()
64 a = entries.get(0); in setUp()
65 if (entries.size() >= 3) { in setUp()
66 c = entries.get(2); in setUp()
120 List<Entry<K, V>> entries = in testHeadMap() local
124 Collections.sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator())); in testHeadMap()
125 for (int i = 0; i < entries.size(); i++) { in testHeadMap()
127 entries.subList(0, i), navigableMap.headMap(entries.get(i).getKey()).entrySet()); in testHeadMap()
[all …]
|
| /external/guava/android/guava-testlib/src/com/google/common/collect/testing/testers/ |
| D | SortedMapNavigationTester.java | 56 List<Entry<K, V>> entries = in setUp() local
60 Collections.sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator())); in setUp()
63 if (entries.size() >= 1) { in setUp()
64 a = entries.get(0); in setUp()
65 if (entries.size() >= 3) { in setUp()
66 c = entries.get(2); in setUp()
120 List<Entry<K, V>> entries = in testHeadMap() local
124 Collections.sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator())); in testHeadMap()
125 for (int i = 0; i < entries.size(); i++) { in testHeadMap()
127 entries.subList(0, i), navigableMap.headMap(entries.get(i).getKey()).entrySet()); in testHeadMap()
[all …]
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | ObjectCountHashMap.java | 103 @VisibleForTesting transient long[] entries; field in ObjectCountHashMap
146 this.entries = newEntries(expectedSize); in init()
264 if (minCapacity > entries.length) { in ensureCapacity()
276 long[] entries = this.entries; in put() local
291 entry = entries[next]; in put()
300 entries[last] = swapNext(entry, newEntryIndex); in put()
320 this.entries[entryIndex] = ((long) hash << 32) | (NEXT_MASK & UNSET); in insertEntry()
327 int entriesSize = entries.length; in resizeMeMaybe()
346 long[] entries = this.entries; in resizeEntries() local
347 int oldCapacity = entries.length; in resizeEntries()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| D | OpenMapRealVector.java | 41 private final OpenIntToDoubleHashMap entries; field in OpenMapRealVector
77 entries = new OpenIntToDoubleHashMap(0.0); in OpenMapRealVector()
88 entries = new OpenIntToDoubleHashMap(v.entries); in OpenMapRealVector()
109 entries = new OpenIntToDoubleHashMap(expectedSize, 0.0); in OpenMapRealVector()
130 entries = new OpenIntToDoubleHashMap(0.0); in OpenMapRealVector()
135 entries.put(key, value); in OpenMapRealVector()
157 entries = new OpenIntToDoubleHashMap(0.0); in OpenMapRealVector()
162 entries.put(key, value); in OpenMapRealVector()
173 entries = new OpenIntToDoubleHashMap(v.getEntries()); in OpenMapRealVector()
183 entries = new OpenIntToDoubleHashMap(0.0); in OpenMapRealVector()
[all …]
|
| /external/opencensus-java/api/src/main/java/io/opencensus/trace/ |
| D | Tracestate.java | 105 @javax.annotation.Nullable private ArrayList<Entry> entries; field in Tracestate.Builder
114 this.entries = null; in Builder()
130 if (entries == null) { in set()
132 entries = new ArrayList<Entry>(parent.getEntries()); in set()
134 for (int i = 0; i < entries.size(); i++) { in set()
135 if (entries.get(i).getKey().equals(entry.getKey())) { in set()
136 entries.remove(i); in set()
142 entries.add(0, entry); in set()
156 if (entries == null) { in remove()
158 entries = new ArrayList<Entry>(parent.getEntries()); in remove()
[all …]
|