/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
H A D | SparseFieldVector.java | 43 private final OpenIntToFieldHashMap<T> entries; field in class:SparseFieldVector 70 entries = new OpenIntToFieldHashMap<T>(field); 81 entries = new OpenIntToFieldHashMap<T>(v.entries); 89 * @param expectedSize The expected number of non-zero entries 94 entries = new OpenIntToFieldHashMap<T>(field,expectedSize); 99 * Only non-zero entries will be stored 106 entries = new OpenIntToFieldHashMap<T>(field); 109 entries.put(key, value); 122 entries [all...] |
/external/ltrace/ |
H A D | lens_enum.c | 54 VECT_DESTROY(&self->entries, struct enum_entry, 108 for (i = 0; i < vect_size(&lens->entries); ++i) { 109 struct enum_entry *entry = VECT_ELEMENT(&lens->entries, 143 VECT_INIT(&lens->entries, struct enum_entry); 152 return VECT_PUSHBACK(&lens->entries, &entry); 158 return vect_size(&lens->entries);
|
/external/libvorbis/vq/ |
H A D | vqgen.c | 78 for(i=0;i<v->entries;i++) 96 float spacings[v->entries]; 104 for(j=0;j<v->entries;j++){ 107 for(k=0;k<v->entries;k++){ 121 if(k<v->entries)continue; 177 for(j=0;j<v->entries;j++){ 199 for(j=0;j<v->entries;j++){ 229 for(j=0;j<v->entries;j++){ 240 void vqgen_init(vqgen *v,int elements,int aux,int entries,float mindist, argument 252 v->entries [all...] |
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/fragment/ |
H A D | TrackRunBox.java | 51 private List<Entry> entries = new ArrayList<Entry>(); field in class:TrackRunBox 55 return entries; 128 long[] result = new long[entries.size()]; 131 result[i] = entries.get(i).getSampleCompositionTimeOffset(); 183 size += entrySize * entries.size(); 189 IsoTypeWriter.writeUInt32(byteBuffer, entries.size()); 199 for (Entry entry : entries) { 243 entries.add(entry); 249 return entries.size(); 340 sb.append("{sampleCount=").append(entries 352 setEntries(List<Entry> entries) argument [all...] |
/external/libvorbis/lib/ |
H A D | codebook.c | 37 oggpack_write(opb,c->entries,24); 42 for(i=1;i<c->entries;i++) 44 if(i==c->entries)ordered=1; 55 for(i=1;i<c->entries;i++){ 60 oggpack_write(opb,i-count,_ilog(c->entries-count)); 65 oggpack_write(opb,i-count,_ilog(c->entries-count)); 72 /* algortihmic mapping has use for 'unused entries', which we tag 75 for(i=0;i<c->entries;i++) 78 if(i==c->entries){ 79 oggpack_write(opb,0,1); /* no unused entries */ [all...] |
/external/elfutils/src/tests/ |
H A D | run-readelf-test4.sh | 24 Index of archive 'testfile19.index' has 4 entries:
|
H A D | run-test-archive64.sh | 31 Index of archive 'testarchive64.a' has 7 entries:
|
H A D | run-readelf-gdb_index.sh | 78 CU list at offset 0x18 contains 2 entries: 82 TU list at offset 0x38 contains 1 entries: 85 Address list at offset 0x50 contains 2 entries: 109 CU list at offset 0x18 contains 2 entries: 113 TU list at offset 0x38 contains 1 entries: 116 Address list at offset 0x50 contains 2 entries:
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingSetMultimap.java | 41 @Override public Set<Entry<K, V>> entries() { method in class:ForwardingSetMultimap 42 return delegate().entries();
|
H A D | FilteredEntrySetMultimap.java | 60 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();
|
/external/kernel-headers/original/uapi/linux/ |
H A D | net_dropmon.h | 30 __u32 entries; member in struct:net_dm_config_msg 35 __u32 entries; member in struct:net_dm_alert_msg
|
/external/ltrace/sysdeps/linux-gnu/ia64/ |
H A D | plt.c | 58 int entries = (lte->plt_size - 4 * BUNDLE_SIZE) / (3 * BUNDLE_SIZE); local 63 lte->plt_addr + (4 * BUNDLE_SIZE) + (BUNDLE_SIZE * entries) +
|
/external/vboot_reference/firmware/lib/cgptlib/ |
H A D | cgptlib.c | 36 GptEntry *entries = (GptEntry *)gpt->primary_entries; local 50 e = entries + i; 74 for (i = 0, e = entries; i < header->number_of_entries; i++, e++) { 109 e = entries + new_kernel; 200 GptEntry *entries = (GptEntry *)gpt->primary_entries; local 201 GptEntry *e = entries + gpt->current_kernel; 218 GptEntry *entries = (GptEntry *)gpt->primary_entries; local 222 for (i = 0, e = entries; i < header->number_of_entries; i++, e++) {
|
/external/doclava/src/com/google/doclava/ |
H A D | JarUtils.java | 59 for (Enumeration<JarEntry> entries = fromJar.entries(); entries.hasMoreElements();) { 60 JarEntry entry = entries.nextElement();
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | TestEnumMapGenerator.java | 48 public final Map<AnEnum, String> create(Object... entries) { argument 50 Entry<AnEnum, String>[] array = new Entry[entries.length]; 52 for (Object o : entries) { 61 Entry<AnEnum, String>[] entries); 60 create( Entry<AnEnum, String>[] entries) argument
|
H A D | TestStringSortedMapGenerator.java | 61 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 D | TestStringBiMapGenerator.java | 53 public final BiMap<String, String> create(Object... entries) { argument 55 Entry<String, String>[] array = new Entry[entries.length]; 57 for (Object o : entries) { 66 Entry<String, String>[] entries); 65 create( Entry<String, String>[] entries) argument
|
H A D | TestStringListMultimapGenerator.java | 64 public final ListMultimap<String, String> create(Object... entries) { argument 66 Entry<String, String>[] array = new Entry[entries.length]; 68 for (Object o : entries) { 77 Entry<String, String>[] entries); 76 create( Entry<String, String>[] entries) argument
|
H A D | TestStringSetMultimapGenerator.java | 63 public final SetMultimap<String, String> create(Object... entries) { argument 65 Entry<String, String>[] array = new Entry[entries.length]; 67 for (Object o : entries) { 76 Entry<String, String>[] entries); 75 create( Entry<String, String>[] entries) argument
|
H A D | MultisetNavigationTester.java | 50 private List<E> entries; field in class:MultisetNavigationTester 66 entries = 69 Collections.sort(entries, sortedMultiset.comparator()); 72 if (entries.size() >= 1) { 73 a = Multisets.immutableEntry(entries.get(0), sortedMultiset.count(entries.get(0))); 74 if (entries.size() >= 3) { 75 b = Multisets.immutableEntry(entries.get(1), sortedMultiset.count(entries.get(1))); 76 c = Multisets.immutableEntry(entries 456 totalSize(Iterable<? extends Entry<?>> entries) argument 513 expectedEntries(int targetEntry, List<Entry<E>> entries) argument 515 subMultiset(SortedMultiset<E> multiset, List<Entry<E>> entries, int targetEntry) argument [all...] |
/external/deqp/framework/common/ |
H A D | tcuFunctionLibrary.cpp | 41 StaticFunctionLibrary::StaticFunctionLibrary (const Entry* entries, int numEntries) argument 44 m_functions.insert(std::make_pair(std::string(entries[entryNdx].name), entries[entryNdx].ptr));
|
/external/guava/guava-gwt/src/com/google/common/collect/ |
H A D | ImmutableSortedMap_CustomFieldSerializerBase.java | 44 SortedMap<Object, Object> entries = new TreeMap<Object, Object>(comparator); 45 Map_CustomFieldSerializerBase.deserialize(reader, entries); 47 return ImmutableSortedMap.orderedBy(comparator).putAll(entries).build();
|
/external/icu/icu4c/source/layout/ |
H A D | LookupTables.h | 60 const LookupSingle *lookupSingle(const LETableReference &base, const LookupSingle *entries, LEGlyphID glyph, LEErrorCode &success) const; 83 LookupSingle entries[ANY_NUMBER]; member in struct:SingleTableLookupTable 85 LE_VAR_ARRAY(SingleTableLookupTable, entries)
|
/external/jarjar/src/main/com/tonicsystems/jarjar/util/ |
H A D | StandaloneJarProcessor.java | 34 Set<String> entries = new HashSet<String>(); 37 Enumeration<JarEntry> e = in.entries(); 46 if (entries.add(struct.name)) { 55 throw new IllegalArgumentException("Duplicate jar entries: " + struct.name);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | LinkedListMultimapTest.java | 67 protected ListMultimap<String, String> create(Entry<String, String>[] entries) { 69 for (Entry<String, String> entry : entries) { 139 ASSERT.that(copy.entries()).has().exactlyAs(multimap.entries()).inOrder(); 168 map.entries().toString()); 181 map.entries().toString()); 190 assertEquals("[foo=1, bar=2, bar=3]", map.entries().toString()); 199 assertEquals("[bar=1, foo=2, bar=3]", map.entries().toString()); 210 assertEquals("[bar=1, foo=2, bar=3]", src.entries().toString()); 221 assertEquals("[bar=1, foo=2, bar=2]", map.entries() [all...] |