/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/threegpp26245/ |
H A D | FontTableBox.java | 17 List<FontRecord> entries = new LinkedList<FontRecord>(); field in class:FontTableBox 26 for (FontRecord fontRecord : entries) { 39 entries.add(fr); 45 IsoTypeWriter.writeUInt16(byteBuffer, entries.size()); 46 for (FontRecord record : entries) { 52 return entries; 55 public void setEntries(List<FontRecord> entries) { argument 56 this.entries = entries;
|
/external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/ |
H A D | SampleToChunkBox.java | 38 List<Entry> entries = Collections.emptyList(); field in class:SampleToChunkBox 47 return entries; 50 public void setEntries(List<Entry> entries) { argument 51 this.entries = entries; 55 return entries.size() * 12 + 8; 63 entries = new ArrayList<Entry>(entryCount); 65 entries.add(new Entry( 75 IsoTypeWriter.writeUInt32(byteBuffer, entries.size()); 76 for (Entry entry : entries) { [all...] |
H A D | SubSampleInformationBox.java | 43 private List<SampleEntry> entries = new ArrayList<SampleEntry>();
field in class:SubSampleInformationBox 50 return entries;
53 public void setEntries(List<SampleEntry> entries) {
argument 54 this.entries = entries;
55 entryCount = entries.size();
60 long entries = 8 + ((4 + 2) * entryCount);
62 for (SampleEntry sampleEntry : this.entries) {
65 return entries + subsampleEntries;
86 entries [all...] |
/external/fio/lib/ |
H A D | bloom.h | 8 struct bloom *bloom_new(uint64_t entries);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | MapEqualsTester.java | 43 "A Map should equal any other Map containing the same entries.", 53 "A Map should not equal another Map containing different entries.", 61 Collection<Map.Entry<K, V>> entries = getSampleEntries(getNumEntries() - 1); 62 entries.add(entry(null, samples.e3.getValue())); 64 resetContainer(getSubjectGenerator().create(entries.toArray())); 65 assertTrue("A Map should equal any other Map containing the same entries," 67 getMap().equals(newHashMap(entries))); 72 Collection<Map.Entry<K, V>> entries = getSampleEntries(getNumEntries() - 1); 73 entries.add(entry(null, samples.e3.getValue())); 74 Map<K, V> other = newHashMap(entries); 126 newHashMap( Collection<? extends Map.Entry<? extends K, ? extends V>> entries) argument [all...] |
H A D | SortedMapNavigationTester.java | 54 List<Entry<K, V>> entries = Helpers.copyToList(getSubjectGenerator().getSampleElements( 56 Collections.sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator())); 59 if (entries.size() >= 1) { 60 a = entries.get(0); 61 if (entries.size() >= 3) { 62 c = entries.get(2); 116 List<Entry<K, V>> entries = Helpers.copyToList(getSubjectGenerator().getSampleElements( 118 Collections.sort(entries, Helpers.<K, V>entryComparator(navigableMap.comparator())); 119 for (int i = 0; i < entries.size(); i++) { 120 ASSERT.that(navigableMap.headMap(entries [all...] |
/external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
H A D | SparseFieldMatrix.java | 36 private final OpenIntToFieldHashMap<T> entries; field in class:SparseFieldMatrix 55 entries = new OpenIntToFieldHashMap<T>(field); 72 entries = new OpenIntToFieldHashMap<T>(field); 83 entries = new OpenIntToFieldHashMap<T>(other.entries); 94 entries = new OpenIntToFieldHashMap<T>(getField()); 109 final T value = entries.get(key).add(increment); 111 entries.remove(key); 113 entries.put(key, value); 142 return entries [all...] |
H A D | OpenMapRealMatrix.java | 42 private final OpenIntToDoubleHashMap entries; field in class:OpenMapRealMatrix 53 this.entries = new OpenIntToDoubleHashMap(0.0); 63 this.entries = new OpenIntToDoubleHashMap(matrix.entries); 109 for (OpenIntToDoubleHashMap.Iterator iterator = m.entries.iterator(); iterator.hasNext();) { 144 for (OpenIntToDoubleHashMap.Iterator iterator = m.entries.iterator(); iterator.hasNext();) { 168 for (OpenIntToDoubleHashMap.Iterator iterator = entries.iterator(); iterator.hasNext();) { 199 for (OpenIntToDoubleHashMap.Iterator iterator = entries.iterator(); iterator.hasNext();) { 207 if (m.entries.containsKey(rightKey)) { 210 out.entries [all...] |
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/ |
H A D | EC3SpecificBox.java | 15 List<Entry> entries = new LinkedList<Entry>(); field in class:EC3SpecificBox 26 for (Entry entry : entries) { 59 entries.add(e); 67 bwb.writeBits(entries.size() - 1, 3); 68 for (Entry e : entries) { 86 return entries; 89 public void setEntries(List<Entry> entries) { argument 90 this.entries = entries; 94 this.entries [all...] |
/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/samplegrouping/ |
H A D | SampleToGroupBox.java | 33 * SampleGroupDescription box, which contains entries describing the characteristics of each sample group. 49 List<Entry> entries = new LinkedList<Entry>(); field in class:SampleToGroupBox 58 return this.getVersion() == 1 ? entries.size() * 8 + 16 : entries.size() * 8 + 12; 68 IsoTypeWriter.writeUInt32(byteBuffer, entries.size()); 69 for (Entry entry : entries) { 85 entries.add(new Entry(l2i(IsoTypeReader.readUInt32(content)), l2i(IsoTypeReader.readUInt32(content)))); 168 return entries; 171 public void setEntries(List<Entry> entries) { argument 172 this.entries [all...] |
H A D | RateShareEntry.java | 52 private List<Entry> entries = new LinkedList<Entry>(); field in class:RateShareEntry 66 entries.add(new Entry(l2i(IsoTypeReader.readUInt32(byteBuffer)), byteBuffer.getShort())); 81 for (Entry entry : entries) { 181 if (entries != null ? !entries.equals(that.entries) : that.entries != null) { 192 result = 31 * result + (entries != null ? entries.hashCode() : 0); 216 return entries; 219 setEntries(List<Entry> entries) argument [all...] |
/external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/test/fixtures/ |
H A D | formatting_element_list_test.js | 16 assert.strictEqual(list.entries[0].type, FormattingElementList.MARKER_ENTRY); 20 assert.strictEqual(list.entries[1].type, FormattingElementList.MARKER_ENTRY); 32 assert.strictEqual(list.entries[0].type, FormattingElementList.ELEMENT_ENTRY); 33 assert.strictEqual(list.entries[0].element, element1); 34 assert.strictEqual(list.entries[0].token, element1Token); 38 assert.strictEqual(list.entries[1].type, FormattingElementList.ELEMENT_ENTRY); 39 assert.strictEqual(list.entries[1].element, element2); 40 assert.strictEqual(list.entries[1].token, element2Token); 52 list.bookmark = list.entries[0]; 60 assert.strictEqual(list.entries[ [all...] |
/external/linux-tools-perf/src/tools/perf/util/ |
H A D | rblist.c | 16 struct rb_node **p = &rblist->entries.rb_node; 38 rb_insert_color(new_node, &rblist->entries); 46 rb_erase(rb_node, &rblist->entries); 53 struct rb_node **p = &rblist->entries.rb_node; 76 rblist->entries = RB_ROOT; 86 struct rb_node *pos, *next = rb_first(&rblist->entries); 101 for (node = rb_first(&rblist->entries); node; node = rb_next(node)) {
|
/external/libexif/libexif/canon/ |
H A D | exif-mnote-data-canon.c | 43 if (n->entries) { 45 if (n->entries[i].data) { 46 exif_mem_free (d->mem, n->entries[i].data); 47 n->entries[i].data = NULL; 49 exif_mem_free (d->mem, n->entries); 50 n->entries = NULL; 71 to = from + mnote_canon_entry_count_values (&dc->entries[*m]); 89 return mnote_canon_entry_get_value (&dc->entries[m], s, val, maxlen); 104 n->entries[i].order = o; 105 exif_array_set_byte_order (n->entries[ [all...] |
/external/javassist/src/main/javassist/bytecode/ |
H A D | ExceptionTable.java | 43 private ArrayList entries; field in class:ExceptionTable 52 entries = new ArrayList(); 67 entries = list; 77 r.entries = new ArrayList(entries); 83 * of entries in the <code>exception_table[]</code>. 86 return entries.size(); 95 ExceptionTableEntry e = (ExceptionTableEntry)entries.get(nth); 106 ExceptionTableEntry e = (ExceptionTableEntry)entries.get(nth); 116 ExceptionTableEntry e = (ExceptionTableEntry)entries [all...] |
/external/libexif/libexif/pentax/ |
H A D | exif-mnote-data-pentax.c | 39 if (n->entries) { 41 if (n->entries[i].data) { 42 exif_mem_free (d->mem, n->entries[i].data); 43 n->entries[i].data = NULL; 45 exif_mem_free (d->mem, n->entries); 46 n->entries = NULL; 66 return mnote_pentax_entry_get_value (&n->entries[i], val, maxlen); 90 * Allocate enough memory for header, the number of entries, entries, 139 * such, just has a fixed number of entries equa [all...] |
/external/skia/src/core/ |
H A D | SkFlattenable.cpp | 83 SkDebugf("%s has no registered name/factory/type entries." 95 const Entry* entries = gEntries; 97 if (strcmp(entries[i].fName, name) == 0) { 98 return entries[i].fFactory; 110 const Entry* entries = gEntries; local 112 if (strcmp(entries[i].fName, name) == 0) { 113 *type = entries[i].fType; 125 const Entry* entries = gEntries; local 127 if (entries[i].fFactory == fact) { 128 return entries[ [all...] |
/external/speex/libspeex/ |
H A D | vq.c | 51 int scal_quant(spx_word16_t in, const spx_word16_t *boundary, int entries) argument 54 while (i<entries-1 && in>boundary[0]) 62 int scal_quant32(spx_word32_t in, const spx_word32_t *boundary, int entries) argument 65 while (i<entries-1 && in>boundary[0]) 75 /*Finds the indices of the n-best entries in a codebook*/ 76 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 80 for (i=0;i<entries;i++) 109 /*Finds the indices of the n-best entries in a codebook with sign*/ 110 void vq_nbest_sign(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack) argument 114 for (i=0;i<entries; [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimapTest.java | 92 ASSERT.that(copy.entries()).has().exactlyAs(multimap.entries()).inOrder(); 121 map.entries().toString()); 134 map.entries().toString()); 143 assertEquals("[foo=1, bar=2, bar=3]", map.entries().toString()); 152 assertEquals("[bar=1, foo=2, bar=3]", map.entries().toString()); 163 assertEquals("[bar=1, foo=2, bar=3]", src.entries().toString()); 174 assertEquals("[bar=1, foo=2, bar=2]", map.entries().toString()); 190 assertEquals("[]", map.entries().toString()); 212 map.entries() [all...] |
/external/libexif/libexif/ |
H A D | exif-content.c | 101 exif_entry_unref (content->entries[i]); 102 exif_mem_free (mem, content->entries); 126 printf ("%sDumping exif content (%u entries)...\n", buf, 129 exif_entry_dump (content->entries[i], indent + 1); 135 ExifEntry **entries; local 147 entries = exif_mem_realloc (c->priv->mem, 148 c->entries, sizeof (ExifEntry*) * (c->count + 1)); 149 if (!entries) return; 151 entries[c->count++] = entry; 152 c->entries [all...] |
/external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/lib/tree_construction/ |
H A D | formatting_element_list.js | 9 this.entries = [];
30 var entry = this.entries[i];
81 this.entries.splice(candidates[i].idx, 1);
89 this.entries.push({type: FormattingElementList.MARKER_ENTRY});
96 this.entries.push({
109 if (this.entries[bookmarkIdx] === this.bookmark)
113 this.entries.splice(bookmarkIdx + 1, 0, {
124 if (this.entries[i] === entry) {
125 this.entries.splice(i, 1);
134 var entry = this.entries [all...] |
/external/guava/guava-gwt/src/com/google/common/collect/ |
H A D | RegularImmutableBiMap_CustomFieldSerializer.java | 40 Map<Object, Object> entries = new LinkedHashMap<Object, Object>(); 41 Map_CustomFieldSerializerBase.deserialize(reader, entries); 49 (RegularImmutableBiMap<Object, Object>) ImmutableBiMap.copyOf(entries);
|
H A D | RegularImmutableMap_CustomFieldSerializer.java | 40 Map<Object, Object> entries = new LinkedHashMap<Object, Object>(); 41 Map_CustomFieldSerializerBase.deserialize(reader, entries); 48 return (RegularImmutableMap<Object, Object>) ImmutableMap.copyOf(entries);
|
/external/icu/icu4c/source/layout/ |
H A D | SingleTableProcessor.cpp | 37 const LookupSingle *entries = singleTableLookupTable->entries; local 42 const LookupSingle *lookupSingle = singleTableLookupTable->lookupSingle(singleTableLookupTable, entries, glyphStorage[glyph], success);
|
H A D | SingleTableProcessor2.cpp | 39 const LookupSingle *entries = singleTableLookupTable->entries; local 44 const LookupSingle *lookupSingle = singleTableLookupTable->lookupSingle(singleTableLookupTable, entries, glyphStorage[glyph], success);
|