Searched defs:items (Results 1 - 16 of 16) sorted by relevance

/dalvik/libcore/archive/src/main/native/
H A Dzipalloc.c27 void *zalloc PROTOTYPE ((void *opaque, U_32 items, U_32 size));
38 zalloc (void *opaque, U_32 items, U_32 size) argument
42 return hymem_allocate_memory (items * size);
H A Dzipsup.c85 void *zdataalloc PROTOTYPE ((void *opaque, U_32 items, U_32 size));
2252 zdataalloc (void *opaque, U_32 items, U_32 size) argument
2255 U_32 byteSize = items * size;
/dalvik/dx/src/com/android/dx/dex/file/
H A DHeaderSection.java54 public Collection<? extends Item> items() { method in class:HeaderSection
H A DFieldIdsSection.java50 public Collection<? extends Item> items() { method in class:FieldIdsSection
H A DMethodIdsSection.java50 public Collection<? extends Item> items() { method in class:MethodIdsSection
H A DProtoIdsSection.java50 public Collection<? extends Item> items() { method in class:ProtoIdsSection
135 for (Object i : items()) {
H A DStringIdsSection.java53 public Collection<? extends Item> items() { method in class:StringIdsSection
H A DTypeIdsSection.java50 public Collection<? extends Item> items() { method in class:TypeIdsSection
187 for (Object i : items()) {
H A DAnnotationSetItem.java38 * {@code non-null;} set of annotations as individual items in an array.
42 private final AnnotationItem[] items; field in class:AnnotationSetItem
53 this.items = new AnnotationItem[annotations.size()];
57 items[at] = new AnnotationItem(a);
117 int size = items.length;
120 items[i] = byteData.intern(items[i]);
128 AnnotationItem.sortByTypeIdIndex(items);
135 int size = items.length;
145 AnnotationItem item = items[
[all...]
H A DClassDefsSection.java57 public Collection<? extends Item> items() { method in class:ClassDefsSection
H A DUniformListItem.java26 * Class that represents a contiguous list of uniform items. Each
30 * <p>This class inherits its alignment from its items, bumped up to
31 * {@code 4} if the items have a looser alignment requirement. If
46 private final List<T> items; field in class:UniformListItem
53 * @param items {@code non-null and non-empty;} list of items to represent
55 public UniformListItem(ItemType itemType, List<T> items) { argument
56 super(getAlignment(items), writeSize(items));
62 this.items
74 getAlignment(List<? extends OffsettedItem> items) argument
93 writeSize(List<? extends OffsettedItem> items) argument
[all...]
H A DMixedItemSection.java63 /** {@code non-null;} the items in this part */
64 private final ArrayList<OffsettedItem> items; field in class:MixedItemSection
66 /** {@code non-null;} items that have been explicitly interned */
69 /** {@code non-null;} how to sort the items */
86 * @param sort how the items should be sorted in the final output
92 this.items = new ArrayList<OffsettedItem>(100);
100 public Collection<? extends Item> items() { method in class:MixedItemSection
101 return items;
119 * Gets the size of this instance, in items.
124 return items
[all...]
H A DSection.java25 * of items of some sort or other.
219 * Gets the collection of all the items in this section.
222 * @return {@code non-null;} the items
224 public abstract Collection<? extends Item> items(); method in class:Section
/dalvik/libcore/security/src/main/java/java/security/
H A DBasicPermissionCollection.java51 private transient Map<String, Permission> items = new HashMap<String, Permission>(); field in class:BasicPermissionCollection
95 items.put(name, permission);
104 return Collections.enumeration(items.values());
126 if (items.containsKey(checkName)) {
142 if (items.containsKey(new String(name, 0, pos + 2))) {
173 fields.put("permissions", new Hashtable<String, Permission>(items)); //$NON-NLS-1$
186 items = new HashMap<String, Permission>();
189 items.putAll((Hashtable<String, Permission>) fields.get(
191 for (Iterator<Permission> iter = items.values().iterator(); iter.hasNext();) {
197 if (allEnabled && !items
[all...]
/dalvik/libcore/concurrent/src/main/java/java/util/concurrent/
H A DArrayBlockingQueue.java51 * even for the items array, which is default-serialized, even if
57 /** The queued items */
58 private final E[] items; field in class:ArrayBlockingQueue
59 /** items index for next take, poll or remove */
61 /** items index for next put, offer, or add. */
63 /** Number of items in the queue */
84 return (++i == items.length)? 0 : i;
92 items[putIndex] = x;
103 final E[] items = this.items;
[all...]
/dalvik/libcore/luni/src/test/java/com/google/coretests/
H A DPerfStatCollector.java158 ArrayList<Item> items; field in class:PerfStatCollector
166 items = new ArrayList();
176 Iterator<Item> r = items.iterator();
234 items.add(current);

Completed in 148 milliseconds