Searched defs:entries (Results 1 - 25 of 439) sorted by relevance

1234567891011>>

/external/ltrace/
H A Dlens_enum.h29 struct vect entries; member in struct:enum_lens
/external/clang/test/CodeGen/
H A DPR4611-bitfield-layout.c7 } entries; variable in typeref:struct:object_entry
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DRegularImmutableMap.java32 RegularImmutableMap(Entry<? extends K, ? extends V>... entries) { argument
33 super(entries);
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
H A DImmutableEnumMapTest.java40 protected Map<AnEnum, String> create(Entry<AnEnum, String>[] entries) { argument
42 for (Entry<AnEnum, String> entry : entries) {
H A DHashBiMapTest.java39 protected BiMap<String, String> create(Entry<String, String>[] entries) { argument
41 for (Entry<String, String> entry : entries) {
84 Set<Entry<Integer, Integer>> entries = bimap.entrySet();
85 for (Entry<Integer, Integer> entry : entries) {
96 Set<Map.Entry<Integer, String>> entries = map.entrySet();
97 Iterator<Map.Entry<Integer, String>> iterator = entries.iterator();
/external/libexif/libexif/canon/
H A Dexif-mnote-data-canon.h37 MnoteCanonEntry *entries; member in struct:_ExifMnoteDataCanon
/external/libexif/libexif/
H A Dexif-content.h42 ExifEntry **entries; member in struct:_ExifContent
86 * each entry in this IFD to fix existing entries, create any new entries
88 * entries that are not allowed in this IFD.
/external/libexif/libexif/fuji/
H A Dexif-mnote-data-fuji.h34 MnoteFujiEntry *entries; member in struct:_ExifMnoteDataFuji
/external/skia/src/ports/
H A DSkFontMgr_custom_embedded_factory.cpp11 struct SkEmbeddedResourceHeader { const SkEmbeddedResource* entries; int count; }; member in struct:SkEmbeddedResourceHeader
/external/valgrind/none/tests/darwin/
H A Daccess_extended.c20 struct accessx_descriptor* entries = malloc(entries_szB); local
21 char* string1 = (char*)&entries[3];
26 entries[0].ad_name_offset = string1 - (char*)entries;
27 entries[1].ad_name_offset = 0; // reuse the previous entry's string
28 entries[2].ad_name_offset = string2 - (char*)entries;
29 entries[0].ad_flags = F_OK; // succeeds
30 entries[1].ad_flags = X_OK; // fails
31 entries[
[all...]
/external/dexmaker/src/dx/java/com/android/dx/rop/cst/
H A DStdConstantPool.java29 /** {@code non-null;} array of entries */
30 private final Constant[] entries; field in class:StdConstantPool
47 entries = new Constant[size];
52 return entries.length;
58 return entries[n];
77 Constant result = entries[n];
107 if (n == (entries.length - 1)) {
111 entries[n + 1] = null;
114 if ((cst != null) && (entries[n] == null)) {
119 Constant prev = entries[
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DFilteredEntrySetMultimap.java60 return Sets.filter(unfiltered().entries(), entryPredicate());
64 public Set<Entry<K, V>> entries() { method in class:FilteredEntrySetMultimap
65 return (Set<Entry<K, V>>) super.entries();
H A DForwardingSetMultimap.java41 @Override public Set<Entry<K, V>> entries() { method in class:ForwardingSetMultimap
42 return delegate().entries();
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 DTestStringSortedMapGenerator.java61 protected abstract SortedMap<String, String> create(Entry<String, String>[] entries); argument
64 public SortedMap<String, String> create(Object... entries) { argument
65 return (SortedMap<String, String>) super.create(entries);
/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 DBiMapGenerators.java37 @Override protected BiMap<String, String> create(Entry<String, String>[] entries) { argument
39 for (Entry<String, String> entry : entries) {
47 @Override protected BiMap<String, String> create(Entry<String, String>[] entries) { argument
49 for (Entry<String, String> entry : entries) {
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
H A DMapToStringTester.java75 private String expectedToString(Set<Entry<K, V>> entries) { argument
77 for (Map.Entry<K, V> entry : entries) {
/external/guava/guava-tests/test/com/google/common/collect/
H A DHashBiMapTest.java46 protected BiMap<String, String> create(Entry<String, String>[] entries) { argument
48 for (Entry<String, String> entry : entries) {
108 Set<Entry<Integer, Integer>> entries = bimap.entrySet();
109 for (Entry<Integer, Integer> entry : entries) {
120 Set<Map.Entry<Integer, String>> entries = map.entrySet();
121 Iterator<Map.Entry<Integer, String>> iterator = entries.iterator();
H A DImmutableEnumMapTest.java46 protected Map<AnEnum, String> create(Entry<AnEnum, String>[] entries) { argument
48 for (Entry<AnEnum, String> entry : entries) {
/external/icu/icu4c/source/layout/
H A DLookupTables.cpp60 const LookupSingle *BinarySearchLookupTable::lookupSingle(const LETableReference &base, const LookupSingle *entries, LEGlyphID glyph, LEErrorCode &success) const argument
66 LEReferenceTo<LookupSingle> entry(base, success, entries);
H A DSingleTableProcessor.cpp37 const LookupSingle *entries = singleTableLookupTable->entries; local
42 const LookupSingle *lookupSingle = singleTableLookupTable->lookupSingle(singleTableLookupTable, entries, glyphStorage[glyph], success);
H A DSingleTableProcessor2.cpp39 const LookupSingle *entries = singleTableLookupTable->entries; local
44 const LookupSingle *lookupSingle = singleTableLookupTable->lookupSingle(singleTableLookupTable, entries, glyphStorage[glyph], success);
/external/jemalloc/test/unit/
H A Dqr.c3 /* Number of ring entries, in [2..26]. */
16 init_entries(ring_t *entries) argument
21 qr_new(&entries[i], link);
22 entries[i].id = 'a' + i;
27 test_independent_entries(ring_t *entries) argument
34 qr_foreach(t, &entries[i], link) {
43 qr_reverse_foreach(t, &entries[i], link) {
51 t = qr_next(&entries[i], link);
52 assert_ptr_eq(t, &entries[i],
57 t = qr_prev(&entries[
66 ring_t entries[NENTRIES]; local
74 test_entries_ring(ring_t *entries) argument
109 ring_t entries[NENTRIES]; local
121 ring_t entries[NENTRIES]; local
150 ring_t entries[NENTRIES]; local
187 test_split_entries(ring_t *entries) argument
211 ring_t entries[NENTRIES]; local
[all...]
/external/libdrm/
H A Dxf86drmHash.h27 #define HASH_SIZE 512 /* Good for about 100 entries */
40 unsigned long entries; member in struct:HashTable

Completed in 8976 milliseconds

1234567891011>>