Searched refs:entries (Results 151 - 175 of 606) sorted by relevance

1234567891011>>

/external/guava/guava/src/com/google/common/collect/
H A DImmutableBiMap.java61 * Returns an immutable map containing the given entries, in order.
70 * Returns an immutable map containing the given entries, in order.
80 * Returns an immutable map containing the given entries, in order.
91 * Returns an immutable map containing the given entries, in order.
101 // looking for of() with > 5 entries? Use the builder instead.
170 return of(entries[0].getKey(), entries[0].getValue());
172 return new RegularImmutableBiMap<K, V>(size, entries);
178 * Returns an immutable bimap containing the same entries as {@code map}. If
179 * {@code map} somehow contains entries wit
[all...]
H A DRegularImmutableMap.java27 * Implementation of {@link ImmutableMap} with two or more entries.
36 // entries in insertion order
37 private final transient ImmutableMapEntry<K, V>[] entries; field in class:RegularImmutableMap
38 // array of linked lists of entries
49 * entries. Assumes that these entries have already been checked for null.
54 entries = createEntryArray(size);
64 // prepend, not append, so the entries can be immutable
69 entries[entryIndex] = newEntry;
75 * Constructor for RegularImmutableMap that makes no assumptions about the input entries
[all...]
H A DRegularImmutableBiMap.java41 private final transient ImmutableMapEntry<K, V>[] entries; field in class:RegularImmutableBiMap
51 * entries. Assumes that these entries have already been checked for null.
60 ImmutableMapEntry<K, V>[] entries = createEntryArray(n);
90 entries[i] = newEntry;
96 this.entries = entries;
101 * Constructor for RegularImmutableBiMap that makes no assumptions about the input entries.
109 ImmutableMapEntry<K, V>[] entries = createEntryArray(n);
139 entries[
[all...]
H A DSetMultimap.java33 * each return a {@link Set} of values, while {@link #entries} returns a {@code
34 * Set} of map entries. Though the method signature doesn't say so explicitly,
96 Set<Map.Entry<K, V>> entries(); method in interface:SetMultimap
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DAbstractMapTester.java96 Iterator<Entry<K, V>> entries = getSampleElements().iterator();
98 entries.next();
100 return entries.next();
172 @Override protected void expectMissing(Entry<K, V>... entries) { argument
173 for (Entry<K, V> entry : entries) {
215 "key %s not found in entries %s", newEntry.getKey(), expected));
228 protected void resetMap(Entry<K, V>[] entries) { argument
229 resetContainer(getSubjectGenerator().create((Object[]) entries));
/external/v8/test/mjsunit/es6/
H A Dcollection-iterator.js21 assertEquals(new Set().entries().__proto__, SetIteratorPrototype);
50 var iter = s.entries();
84 Set.prototype.entries.call({});
122 assertEquals(new Map().entries().__proto__, MapIteratorPrototype);
161 var iter = m.entries();
179 Map.prototype.entries.call({});
193 assertEquals(Map.prototype[Symbol.iterator], Map.prototype.entries);
/external/fio/engines/
H A Dlibaio.c28 * 'head' == 'tail'. 'entries' is the ring size, and
33 unsigned int entries; member in struct:libaio_data
63 *val = (*val + add) & (ld->entries - 1);
65 *val = (*val + add) % ld->entries;
251 nr = min((unsigned int) nr, ld->entries - ld->tail);
351 ld->entries = td->o.iodepth;
352 ld->is_pow2 = is_power_of_2(ld->entries);
353 ld->aio_events = calloc(ld->entries, sizeof(struct io_event));
354 ld->iocbs = calloc(ld->entries, sizeof(struct iocb *));
355 ld->io_us = calloc(ld->entries, sizeo
[all...]
/external/proguard/src/proguard/gui/
H A DClassPathPanel.java101 ClassPathEntry[] entries = classPathEntries(selectedFiles, isOutput);
104 addElements(entries);
151 ClassPathEntry[] entries = classPathEntries(selectedFiles, isOutput);
158 setElementsAt(entries, selectedIndices);
166 addElements(entries);
193 // Apply the entered filters to all selected entries.
252 ClassPathEntry[] entries = new ClassPathEntry[files.length];
253 for (int index = 0; index < entries.length; index++)
255 entries[index] = new ClassPathEntry(files[index], isOutput);
257 return entries;
[all...]
/external/boringssl/src/crypto/err/
H A Derr_data_generate.go69 // entries is an array of keys and offsets into |stringData|. The
72 entries []uint32
87 // uint32 in entries.
105 for _, existing := range st.entries {
110 st.entries = append(st.entries, key|offset)
114 // keySlice is a type that implements sorting of entries values.
130 sort.Sort(keySlice(st.entries))
131 return st.entries
/external/deqp/scripts/egl/
H A Dproc_address_tests.py63 entries = []
65 entries.append("\t{ \"%s\",\tDE_LENGTH_OF_ARRAY(s_%s),\ts_%s\t}," % (name, name, name))
67 for line in indentLines(entries):
/external/fio/lib/
H A Dbloom.c65 struct bloom *bloom_new(uint64_t entries) argument
73 b->nentries = entries;
74 no_uints = (entries + BITS_PER_INDEX - 1) / BITS_PER_INDEX;
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/
H A DAbstractBiMapTester.java61 protected void expectMissing(Entry<K, V>... entries) { argument
62 super.expectMissing(entries);
63 for (Entry<K, V> entry : entries) {
H A DListMultimapPutTester.java60 List<Entry<K, V>> entries = copyToList(multimap().entries());
62 for (Entry<K, V> entry : entries) {
H A DSetMultimapPutTester.java51 List<Entry<K, V>> entries = copyToList(multimap().entries());
53 for (Entry<K, V> entry : entries) {
/external/iproute2/include/linux/netfilter_ipv4/
H A Dip_tables.h63 #define IPT_ENTRY_ITERATE(entries, size, fn, args...) \
64 XT_ENTRY_ITERATE(struct ipt_entry, entries, size, fn, ## args)
167 /* Number of entries */
170 /* Size of entries. */
183 /* Number of entries */
186 /* Total size of new entries */
195 /* Information about old entries: */
196 /* Number of counters (must be equal to current number of entries). */
198 /* The old entries' counters. */
201 /* The entries (han
202 struct ipt_entry entries[0]; member in struct:ipt_replace
[all...]
/external/iptables/include/linux/netfilter_ipv4/
H A Dip_tables.h63 #define IPT_ENTRY_ITERATE(entries, size, fn, args...) \
64 XT_ENTRY_ITERATE(struct ipt_entry, entries, size, fn, ## args)
167 /* Number of entries */
170 /* Size of entries. */
183 /* Number of entries */
186 /* Total size of new entries */
195 /* Information about old entries: */
196 /* Number of counters (must be equal to current number of entries). */
198 /* The old entries' counters. */
201 /* The entries (han
202 struct ipt_entry entries[0]; member in struct:ipt_replace
[all...]
/external/jetty/src/java/org/eclipse/jetty/webapp/
H A DClasspathPattern.java30 * against an internal array of classpath pattern entries.
35 * When class is initialized from a classpath pattern string, entries
153 StringTokenizer entries = new StringTokenizer(pattern, ":,");
154 while (entries.hasMoreTokens())
156 patterns.add(entries.nextToken());
/external/kernel-headers/original/uapi/linux/netfilter_arp/
H A Darp_tables.h30 #define ARPT_ENTRY_ITERATE(entries, size, fn, args...) \
31 XT_ENTRY_ITERATE(struct arpt_entry, entries, size, fn, ## args)
147 /* Number of entries */
150 /* Size of entries. */
163 /* Number of entries */
166 /* Total size of new entries */
175 /* Information about old entries: */
176 /* Number of counters (must be equal to current number of entries). */
178 /* The old entries' counters. */
181 /* The entries (han
182 struct arpt_entry entries[0]; member in struct:arpt_replace
[all...]
/external/kernel-headers/original/uapi/linux/netfilter_ipv4/
H A Dip_tables.h64 #define IPT_ENTRY_ITERATE(entries, size, fn, args...) \
65 XT_ENTRY_ITERATE(struct ipt_entry, entries, size, fn, ## args)
169 /* Number of entries */
172 /* Size of entries. */
185 /* Number of entries */
188 /* Total size of new entries */
197 /* Information about old entries: */
198 /* Number of counters (must be equal to current number of entries). */
200 /* The old entries' counters. */
203 /* The entries (han
204 struct ipt_entry entries[0]; member in struct:ipt_replace
[all...]
/external/linux-tools-perf/src/tools/perf/util/
H A Dcgroup.c84 list_for_each_entry(counter, &evlist->entries, node) {
113 list_for_each_entry(counter, &evlist->entries, node) {
149 if (list_empty(&evlist->entries)) {
/external/f2fs-tools/mkfs/
H A Df2fs_format.c559 sum->nat_j.entries[0].nid = sb.root_ino;
560 sum->nat_j.entries[0].ne.version = 0;
561 sum->nat_j.entries[0].ne.ino = sb.root_ino;
562 sum->nat_j.entries[0].ne.block_addr = cpu_to_le32(
572 sum->sit_j.entries[0].segno = cp->cur_node_segno[0];
573 sum->sit_j.entries[0].se.vblocks = cpu_to_le16((CURSEG_HOT_NODE << 10) | 1);
574 f2fs_set_bit(0, (char *)sum->sit_j.entries[0].se.valid_map);
575 sum->sit_j.entries[1].segno = cp->cur_node_segno[1];
576 sum->sit_j.entries[1].se.vblocks = cpu_to_le16((CURSEG_WARM_NODE << 10));
577 sum->sit_j.entries[
[all...]
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DMapConstraintsTest.java231 ASSERT.that(ImmutableList.copyOf(multimap.entries()))
232 .is(ImmutableList.copyOf(constrained.entries()));
241 ASSERT.that(multimap.entries()).has().exactly(
271 assertFalse(multimap.entries() instanceof Set);
284 assertFalse(multimap.entries() instanceof Set);
383 constrained.entries().add(Maps.immutableEntry(TEST_KEY, 1));
387 constrained.entries().addAll(Arrays.asList(
408 ASSERT.that(ImmutableList.copyOf(multimap.entries()))
409 .is(ImmutableList.copyOf(constrained.entries()));
475 Set<Map.Entry<String, Integer>> entries
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DMapConstraintsTest.java233 ASSERT.that(ImmutableList.copyOf(multimap.entries()))
234 .is(ImmutableList.copyOf(constrained.entries()));
243 ASSERT.that(multimap.entries()).has().exactly(
273 assertFalse(multimap.entries() instanceof Set);
286 assertFalse(multimap.entries() instanceof Set);
385 constrained.entries().add(Maps.immutableEntry(TEST_KEY, 1));
389 constrained.entries().addAll(Arrays.asList(
410 ASSERT.that(ImmutableList.copyOf(multimap.entries()))
411 .is(ImmutableList.copyOf(constrained.entries()));
477 Set<Map.Entry<String, Integer>> entries
[all...]
/external/deqp/framework/common/
H A DtcuFunctionLibrary.hpp60 StaticFunctionLibrary (const Entry* entries, int numEntries);
/external/google-breakpad/src/common/
H A Dmodule_unittest.cc345 vector<Module::StackFrameEntry *> entries; local
346 m.GetStackFrameEntries(&entries);
347 ASSERT_EQ(3U, entries.size());
349 EXPECT_EQ(0xddb5f41285aa7757ULL, entries[0]->address);
350 EXPECT_EQ(0x1486493370dc5073ULL, entries[0]->size);
351 ASSERT_EQ(0U, entries[0]->initial_rules.size());
352 ASSERT_EQ(0U, entries[0]->rule_changes.size());
354 EXPECT_EQ(0x8064f3af5e067e38ULL, entries[1]->address);
355 EXPECT_EQ(0x0de2a5ee55509407ULL, entries[1]->size);
356 ASSERT_EQ(3U, entries[
[all...]

Completed in 605 milliseconds

1234567891011>>