/external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/tracks/ |
H A D | EC3TrackImpl.java | 33 List<BitStreamInfo> entries = new LinkedList<BitStreamInfo>(); field in class:EC3TrackImpl 59 for (BitStreamInfo entry : entries) { 65 entries.add(bsi); 73 if (entries.size() == 0) { 76 samplerate = entries.get(0).samplerate; 86 int[] deps = new int[entries.size()]; 87 int[] chan_locs = new int[entries.size()]; 88 for (BitStreamInfo bsi : entries) { 94 for (BitStreamInfo bsi : entries) { 433 ", 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 | 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...] |
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...] |
/external/sfntly/cpp/src/test/ |
H A D | cmap_iterator_test.cc | 90 BitSet* entries = new BitSet(count); local 94 (*entries)[c] = true; 96 return entries;
|
/external/skia/src/animator/ |
H A D | SkAnimateBase.h | 32 int entries() { return fValues.count() / components(); } function in class:SkAnimateBase
|
/external/skia/tests/ |
H A D | RandomTest.cpp | 108 unsigned int entries[kNumEntries]; local 111 memset(entries, 0, sizeof(unsigned int)*kNumEntries); 129 entries[index] |= (0x1 << entry_shift); 132 // count entries 135 unsigned int entry = entries[i];
|
/external/squashfs-tools/kernel/fs/squashfs/ |
H A D | cache.c | 75 for (i = 0; i < cache->entries; i++) 79 if (i == cache->entries) { 81 * Block not in cache, if all cache entries are used 99 for (n = 0; n < cache->entries; n++) { 102 i = (i + 1) % cache->entries; 105 cache->next_blk = (i + 1) % cache->entries; 215 for (i = 0; i < cache->entries; i++) { 229 * Initialise cache allocating the specified number of entries, each of 233 struct squashfs_cache *squashfs_cache_init(char *name, int entries, argument 244 cache->entry = kcalloc(entries, sizeo [all...] |
/external/zlib/src/contrib/minizip/ |
H A D | mztools.c | 42 int entries = 0; local 214 entries++; 223 int entriesZip = entries; 278 /* Number of recovered entries */ 281 *nRecovered = entries;
|
/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/chromium-trace/catapult/third_party/gsutil/third_party/apitools/apitools/base/py/ |
H A D | extra_types.py | 62 entries = [(f, json_value.get_assigned_value(f.name)) 65 for f, value in entries if value is not None] 77 entries = [(f, json_value.get_assigned_value(f.name)) 80 for f, value in entries if value is not None] 98 return [_JsonValueToPythonValue(e) for e in json_value.entries] 135 return JsonArray(entries=list(map(_PythonValueToJsonValue, py_value))) 184 entries = messages.MessageField(JsonValue, 1, repeated=True) variable in class:JsonArray
|
/external/dbus/dbus/ |
H A D | dbus-address.c | 184 * Frees a #NULL-terminated array of address entries. 186 * @param entries the array. 189 dbus_address_entries_free (DBusAddressEntry **entries) argument 193 for (i = 0; entries[i] != NULL; i++) 194 dbus_address_entry_free (entries[i]); 195 dbus_free (entries); 353 * When connecting to an address, the first address entries 357 * @param entry return location to an array of entries. 370 DBusList *entries, *link; local 377 entries 700 DBusAddressEntry **entries; local [all...] |
/external/dbus/tools/ |
H A D | dbus-cleanup-sockets.c | 154 free_socket_entries (SocketEntry** entries, argument 159 if (entries) 162 free_socket_entry (entries[i]); 163 free (entries); 174 SocketEntry **entries; local 180 entries = xmalloc (sizeof (SocketEntry*) * allocated); 202 entries = xrealloc (entries, sizeof (SocketEntry*) * allocated); 205 entries[n_entries] = se; 211 *entries_p = entries; 277 handle_sockets(SocketEntry **entries, int n_entries) argument 352 SocketEntry **entries; local [all...] |
/external/deqp/framework/randomshaders/ |
H A D | rsgShaderGenerator.cpp | 95 vector<const ValueEntry*> entries; local 96 std::copy(state.getVariableManager().getBegin<AnyEntry>(), state.getVariableManager().getEnd<AnyEntry>(), std::inserter(entries, entries.begin())); 98 for (vector<const ValueEntry*>::const_iterator i = entries.begin(); i != entries.end(); i++) 281 // Create input entries (store value range) if necessary
|
/external/dnsmasq/src/ |
H A D | log.c | 53 static struct log_entry *entries = NULL; variable in typeref:struct:log_entry 141 struct log_entry *tmp = entries; 142 entries = tmp->next; 151 while (entries) 154 if (entries->pid != getpid()) 162 if ((rc = write(log_fd, entries->payload + entries->offset, entries->length)) != -1) 164 entries->length -= rc; 165 entries [all...] |
/external/e2fsprogs/intl/ |
H A D | l10nflist.c | 183 size_t entries; local 321 entries = 0; 346 retval->successor[entries++] 353 retval->successor[entries++] 359 retval->successor[entries] = NULL;
|
/external/e2fsprogs/lib/quota/ |
H A D | quotaio_tree.c | 132 /* Remove given block from the list of blocks with free entries */ 165 /* Insert given block to the beginning of list with free entries */ 551 int entries, i; local 560 entries = ext2fs_le16_to_cpu(dh->dqdh_entries); 573 return entries; 591 int entries = 0, i; local 604 entries += report_block(dquot, blk, bitmap, 612 entries += report_tree(dquot, blk, depth + 1, 619 return entries;
|
/external/fio/engines/ |
H A D | libaio.c | 28 * '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/google-breakpad/src/client/windows/common/ |
H A D | ipc_protocol.h | 98 const CustomInfoEntry* entries; member in struct:google_breakpad::CustomClientInfo
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | AbstractMultimap.java | 89 for (Map.Entry<? extends K, ? extends V> entry : multimap.entries()) { 103 private transient Collection<Entry<K, V>> entries; field in class:AbstractMultimap 106 public Collection<Entry<K, V>> entries() { method in class:AbstractMultimap 107 Collection<Entry<K, V>> result = entries; 108 return (result == null) ? entries = createEntries() : result; 200 return Maps.valueIterator(entries().iterator());
|
H A D | ImmutableMultiset.java | 199 Collection<? extends Entry<? extends E>> entries) { 202 for (Entry<? extends E> entry : entries) { 198 copyFromEntries( Collection<? extends Entry<? extends E>> entries) argument
|
H A D | ImmutableSetMultimap.java | 86 * Returns an immutable multimap containing the given entries, in order. 98 * Returns an immutable multimap containing the given entries, in order. 112 * Returns an immutable multimap containing the given entries, in order. 127 * Returns an immutable multimap containing the given entries, in order. 142 // looking for of() with > 5 entries? Use the builder instead. 269 List<Map.Entry<K, Collection<V>>> entries = Lists.newArrayList( 272 entries, 274 for (Map.Entry<K, Collection<V>> entry : entries) { 382 for (Entry<K, V> entry : entries()) { 411 private transient ImmutableSet<Entry<K, V>> entries; field in class:ImmutableSetMultimap 418 @Override public ImmutableSet<Entry<K, V>> entries() { method in class:ImmutableSetMultimap [all...] |
H A D | ImmutableSortedMultiset.java | 291 Comparator<? super E> comparator, Collection<Entry<E>> entries) { 292 if (entries.isEmpty()) { 295 ImmutableList.Builder<E> elementsBuilder = new ImmutableList.Builder<E>(entries.size()); 296 int[] counts = new int[entries.size()]; 297 long[] cumulativeCounts = new long[entries.size() + 1]; 299 for (Entry<E> entry : entries) { 307 counts, cumulativeCounts, 0, entries.size()); 290 copyOfSortedEntries( Comparator<? super E> comparator, Collection<Entry<E>> entries) argument
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ImmutableMap.java | 77 // looking for of() with > 5 entries? Use the builder instead. 89 final List<Entry<K, V>> entries = Lists.newArrayList(); field in class:ImmutableMap.Builder 94 entries.add(entryOf(key, value)); 104 entries.add(immutableEntry); 106 entries.add(entryOf((K) entry.getKey(), (V) entry.getValue())); 119 return fromEntryList(entries); 123 List<Entry<K, V>> entries) { 124 int size = entries.size(); 129 Entry<K, V> entry = getOnlyElement(entries); 134 = entries 122 fromEntryList( List<Entry<K, V>> entries) argument [all...] |
H A D | ImmutableMultiset.java | 198 Collection<? extends Entry<? extends E>> entries) { 201 for (Entry<? extends E> entry : entries) { 197 copyFromEntries( Collection<? extends Entry<? extends E>> entries) argument
|