| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/boxes/mp4/samplegrouping/ |
| SampleToGroupBox.java | 31 * sample group. The table is compactly coded with each entry giving the index of the first sample of a run of
49 List<Entry> entries = new LinkedList<Entry>();
69 for (Entry entry : entries) {
70 IsoTypeWriter.writeUInt32(byteBuffer, entry.getSampleCount());
71 IsoTypeWriter.writeUInt32(byteBuffer, entry.getGroupDescriptionIndex());
85 entries.add(new Entry(l2i(IsoTypeReader.readUInt32(content)), l2i(IsoTypeReader.readUInt32(content))));
89 public static class Entry {
93 public Entry(long sampleCount, int groupDescriptionIndex)
131 Entry entry = (Entry) o; local
[all...] |
| /external/v8/src/base/ |
| hashmap.h | 47 struct Entry {
54 // If an entry with matching key is found, returns that entry.
56 Entry* Lookup(void* key, uint32_t hash) const;
58 // If an entry with matching key is found, returns that entry.
59 // If no matching entry is found, a new entry is inserted with
61 Entry* LookupOrInsert(void* key, uint32_t hash,
64 // Removes the entry with matching key
287 Entry* entry = LookupOrInsert(p->key, p->hash, allocator); local
[all...] |
| /external/v8/src/compiler/ |
| liveness-analyzer.h | 84 void Lookup(int var) { entries_.push_back(Entry(Entry::kLookup, var)); }
85 void Bind(int var) { entries_.push_back(Entry(Entry::kBind, var)); }
86 void Checkpoint(Node* node) { entries_.push_back(Entry(node)); }
94 class Entry {
108 explicit Entry(Node* node) : kind_(kCheckpoint), var_(-1), node_(node) {}
109 Entry(Kind kind, int var) : kind_(kind), var_(var), node_(nullptr) {
136 ZoneDeque<Entry> entries_;
|
| /external/v8/src/ |
| counters.cc | 207 for (Entry& entry : entries) {
208 entry.SetTotal(total_time, total_call_count);
209 entry.Print(os);
212 Entry("Total", total_time, total_call_count).Print(os);
217 entries.push_back(Entry(counter->name, counter->time, counter->count));
223 class Entry {
225 Entry(const char* name, base::TimeDelta time, uint64_t count)
232 bool operator<(const Entry& other) const {
268 std::vector<Entry> entries
[all...] |
| /frameworks/base/core/java/android/os/ |
| DropBoxManager.java | 50 /** Flag value: Entry's content was deleted to save space. */
63 * Broadcast Action: This is broadcast when a new entry is added in the dropbox.
82 * when the entry was created.
87 * A single entry retrieved from the drop box.
91 public static class Entry implements Parcelable, Closeable {
99 /** Create a new empty Entry with no contents. */
100 public Entry(String tag, long millis) {
110 /** Create a new Entry with plain text contents. */
111 public Entry(String tag, long millis, String text) {
123 * Create a new Entry with byte array contents
325 Entry entry = new Entry(tag, 0, file, flags); local
[all...] |
| /frameworks/base/libs/hwui/ |
| Matrix.h | 51 enum Entry {
|
| /frameworks/base/services/core/java/com/android/server/wm/ |
| DisplaySettings.java | 50 private final HashMap<String, Entry> mEntries = new HashMap<String, Entry>();
52 public static class Entry {
59 public Entry(String _name) {
71 // Try to get the entry with the unique if possible.
73 Entry entry; local
74 if (uniqueId == null || (entry = mEntries.get(uniqueId)) == null) {
75 entry = mEntries.get(name);
77 if (entry != null)
97 Entry entry = mEntries.get(uniqueId); local
184 Entry entry = new Entry(name); local
[all...] |
| /frameworks/base/tools/aapt2/ |
| ResourceValues.h | 285 struct Entry {
298 std::vector<Entry> entries;
349 out << s.symbol.name.value().entry;
|
| /frameworks/compile/slang/BitWriter_2_9/ |
| ValueEnumerator.cpp | 438 unsigned &Entry = AttributeMap[PAL];
439 if (Entry == 0) {
442 Entry = Attribute.size();
448 unsigned &Entry = AttributeGroupMap[AS];
449 if (Entry == 0) {
451 Entry = AttributeGroups.size();
|
| /frameworks/compile/slang/BitWriter_2_9_func/ |
| ValueEnumerator.cpp | 438 unsigned &Entry = AttributeMap[PAL];
439 if (Entry == 0) {
442 Entry = Attribute.size();
448 unsigned &Entry = AttributeGroupMap[AS];
449 if (Entry == 0) {
451 Entry = AttributeGroups.size();
|
| /frameworks/compile/slang/BitWriter_3_2/ |
| ValueEnumerator.cpp | 438 unsigned &Entry = AttributeMap[PAL];
439 if (Entry == 0) {
442 Entry = Attribute.size();
448 unsigned &Entry = AttributeGroupMap[AS];
449 if (Entry == 0) {
451 Entry = AttributeGroups.size();
|
| /libcore/ojluni/src/main/java/java/lang/ |
| ThreadLocal.java | 146 ThreadLocalMap.Entry e = map.getEntry(this);
221 * @param firstValue value for the initial entry of the map
266 * ThreadLocal object). Note that null keys (i.e. entry.get()
268 * entry can be expunged from table. Such entries are referred to
271 static class Entry extends WeakReference<ThreadLocal> {
275 Entry(ThreadLocal k, Object v) {
290 private Entry[] table;
326 * one when we have at least one entry to put in it.
329 table = new Entry[INITIAL_CAPACITY];
331 table[i] = new Entry(firstKey, firstValue)
[all...] |
| /libcore/ojluni/src/main/java/sun/misc/ |
| SoftCache.java | 46 * <code>SoftCache</code> entry is no longer strongly reachable, then it may
47 * remove that entry in order to release the memory occupied by the value
95 * key set, the value set, and the entry set to yield successively smaller
250 * invoked by the <code>get</code> method when there is no entry for
351 private class Entry implements Map.Entry {
352 private Map.Entry ent;
354 from flushing the value while this Entry
357 Entry(Map.Entry ent, Object value)
[all...] |
| /libcore/ojluni/src/main/java/sun/security/util/ |
| ManifestDigester.java | 43 private HashMap<String, Entry> entries; // key is a UTF-8 string
111 entries = new HashMap<String, Entry>();
120 // create an entry for main attributes
122 new Entry(0, pos.endOfSection + 1, pos.startOfNext, rawBytes));
169 new Entry(start, sectionLen, sectionLenWithBlank,
192 public static class Entry {
199 public Entry(int offset, int length,
255 public Entry get(String name, boolean oldStyle) {
256 Entry e = entries.get(name);
|
| /packages/apps/Bluetooth/src/com/android/bluetooth/gatt/ |
| HandleMap.java | 35 class Entry {
47 Entry(int serverIf, int handle, UUID uuid, int serviceType, int instance) {
56 Entry(int serverIf, int handle, UUID uuid, int serviceType, int instance,
67 Entry(int serverIf, int type, int handle, UUID uuid, int serviceHandle) {
75 Entry(int serverIf, int type, int handle, UUID uuid, int serviceHandle, int charHandle) {
85 List<Entry> mEntries = null;
90 mEntries = new ArrayList<Entry>();
101 mEntries.add(new Entry(serverIf, handle, uuid, serviceType, instance, advertisePreferred));
106 mEntries.add(new Entry(serverIf, TYPE_CHARACTERISTIC, handle, uuid, serviceHandle));
110 mEntries.add(new Entry(serverIf, TYPE_DESCRIPTOR, handle, uuid, serviceHandle, mLastCharacteristic))
163 Entry entry = it.next(); local
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| PhotoFallbackEffect.java | 37 public static class Entry {
44 public Entry(Path path, Rect source, RawTexture texture) {
61 private ArrayList<Entry> mList = new ArrayList<Entry>();
69 mList.add(new Entry(path, rect, texture));
72 public Entry getEntry(Path path) {
74 Entry entry = mList.get(i); local
75 if (entry.path == path) return entry;
83 Entry entry = mList.get(i); local
165 Entry entry = mList.get(i); local
174 Entry entry = mList.get(i); local
[all...] |
| /packages/experimental/LoaderApp/src/com/android/loaderapp/fragments/ |
| ContactEntryAdapter.java | 29 public abstract class ContactEntryAdapter<E extends ContactEntryAdapter.Entry>
40 public static class Entry {
97 * Resets the section data and returns the position of the given entry.
100 * @param entry the entry to return the position for
101 * @return the position of entry, or -1 if it isn't found
103 public final int setSections(ArrayList<ArrayList<E>> sections, E entry) {
114 if (e.equals(entry)) {
173 * Get the entry for the given position.
176 * @param position the position for the desired entry
223 Entry entry = getEntry(mSections, position, mSeparators); local
[all...] |
| /packages/providers/ContactsProvider/src/com/android/providers/contacts/ |
| PhotoStore.java | 50 private final Map<Long, Entry> mEntries;
80 mEntries = new HashMap<Long, Entry>();
108 * Returns the entry with the specified key if it exists, null otherwise.
110 public Entry get(long key) {
125 Entry entry = new Entry(file); local
126 putEntry(entry.id, entry);
128 // Not a valid photo store entry - delete the file
213 Entry entry = new Entry(target); local
272 Entry entry = mEntries.get(id); local
[all...] |
| /system/core/include/utils/ |
| LruCache.h | 59 struct Entry {
62 Entry* parent;
63 Entry* child;
65 Entry(TKey key_, TValue value_) : key(key_), value(value_), parent(NULL), child(NULL) {
70 struct HashForEntry : public std::unary_function<Entry*, hash_t> {
71 size_t operator() (const Entry* entry) const {
72 return hash_type(entry->key);
76 struct EqualityForHashedEntries : public std::unary_function<Entry*, hash_t> {
77 bool operator() (const Entry* lhs, const Entry* rhs) const
174 Entry *entry = *find_result; local
202 Entry* entry = *find_result; local
[all...] |
| /system/core/libcutils/ |
| hashmap.c | 26 typedef struct Entry Entry;
27 struct Entry {
31 Entry* next;
35 Entry** buckets;
61 map->buckets = calloc(map->bucketCount, sizeof(Entry*));
109 Entry** newBuckets = calloc(newBucketCount, sizeof(Entry*));
118 Entry* entry = map->buckets[i] local
146 Entry* entry = map->buckets[i]; local
174 Entry* entry = malloc(sizeof(Entry)); local
232 Entry* entry = map->buckets[index]; local
247 Entry* entry = map->buckets[index]; local
318 Entry* entry = map->buckets[i]; local
338 Entry* entry = map->buckets[i]; local
[all...] |
| /frameworks/base/tools/aapt/ |
| ResourceTable.h | 104 class Entry;
330 class Entry : public RefBase {
332 Entry(const String16& name, const SourcePos& pos)
337 Entry(const Entry& entry);
338 Entry& operator=(const Entry& entry);
340 virtual ~Entry() { }
[all...] |
| /art/compiler/utils/ |
| assembler.h | 71 Label* Entry() { return &entry_; }
76 // Entry branched to by fast path
478 // that can be used to avoid loading the handle scope entry to see if the value is
488 // src holds a handle scope entry (Object**) load this into dst
|
| /build/kati/ |
| dep.cc | 74 struct Entry {
75 Entry(const Rule* r, StringPiece s)
91 rules_.push_back(Entry(rule, name));
103 for (const Entry& ent : rules_) {
125 vector<Entry> rules_;
|
| /external/autotest/frontend/shared/ |
| resource_lib.py | 264 class Entry(Resource):
308 class InstanceEntry(Entry):
356 not_prepared = [entry for entry in entries
357 if not entry._is_prepared_for_full_representation]
358 cls._do_prepare_for_full_representation([entry.instance
359 for entry in not_prepared])
360 for entry in not_prepared:
361 entry._is_prepared_for_full_representation = True
426 for entry in entries
[all...] |
| /external/clang/lib/Lex/ |
| PPMacroExpansion.cpp | 394 IncludeStackInfo &Entry = IncludeMacroStack[i-1];
395 if (Entry.TheLexer)
396 Val = Entry.TheLexer->isNextPPTokenLParen();
397 else if (Entry.ThePTHLexer)
398 Val = Entry.ThePTHLexer->isNextPPTokenLParen();
400 Val = Entry.TheTokenLexer->isNextTokenLParen();
406 if (Entry.ThePPLexer)
[all...] |
