HomeSort by relevance Sort by last modified time
    Searched refs:items (Results 26 - 50 of 1725) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/dexmaker/src/dx/java/com/android/dx/dex/file/
MemberIdsSection.java 44 if (items().size() > MAX_MEMBERS) {
46 throw new DexException("Too many " + memberType + ": " + items().size()
50 for (Object i : items()) {
UniformItemSection.java 26 * {@link Item} objects. Each of the items must have the same size in
46 Collection<? extends Item> items = items(); local
47 int sz = items.size();
54 return sz * items.iterator().next().writeSize();
75 for (Item one : items()) {
86 for (Item one : items()) {
96 * Since all items must be the same size, we can use the size
106 * Alters or picks the order for items in this instance if desired,
107 * so that subsequent calls to {@link #items} will yield
    [all...]
AnnotationSetItem.java 38 * {@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[i]
    [all...]
  /external/qemu/android/utils/
vector.c 5 _avector_ensure( void** items, size_t itemSize, unsigned* pMaxItems, unsigned newCount )
14 AASSERT_FAIL("trying to reallocate array of 0-size items (count=%d)\n", newCount);
18 AASSERT_FAIL("trying to reallocate over-sized array of %d-bytes items (%d > %d)\n",
29 *items = _android_array_realloc( *items, itemSize, newMax );
  /external/smack/src/org/jivesoftware/smack/
PrivacyList.java 33 * {@link PrivacyItem Privacy Items} can handle different kind of blocking communications based on JID, group,
47 private List<PrivacyItem> items; field in class:PrivacyList
55 this.items = privacyItems;
67 return items;
  /external/chromium_org/chrome/common/
instant_restricted_id_cache.h 21 // use a cache of N items as against just the last set of results is that there
27 // 1. To store items and assign restricted IDs to them. The cache will store
28 // a max of |max_cache_size_| items and assign them unique IDs.
30 // 2. To store items that already have restricted IDs assigned to them (e.g.
33 // items are inserted with the same ID, the cache will return the last
47 // Adds items to the cache, assigning restricted IDs in the process. May
48 // delete older items from the cache. |items.size()| has to be less than max
50 void AddItems(const ItemVector& items);
52 // Adds items to the cache using the supplied restricted IDs. May delet
    [all...]
  /external/chromium_org/chrome/utility/importer/
bookmarks_file_importer.h 18 uint16 items,
  /external/chromium_org/native_client_sdk/src/build_tools/
generate_index.py 23 items = self.section_map[section_name]
24 items = sorted(items, cmp=CmpByName)
25 sec_map[section_name] = items
  /external/elfutils/libebl/
eblcorenote.c 65 regs_offset, nregloc, reglocs, nitems, items)
73 const Ebl_Core_Item **items;
76 nitems, items);
86 #define ITEMS(type, table) \
88 *items = table; \
100 ITEMS (NT_PLATFORM, platform);
102 #undef ITEMS
  /external/smack/src/org/jivesoftware/smackx/pubsub/listener/
ItemDeleteListener.java 29 * Called when items are deleted from a node the listener is
32 * @param items The event with item deletion details
34 void handleDeletedItems(ItemDeleteEvent items);
37 * Called when <b>all</b> items are deleted from a node the listener is
  /external/smali/dexlib/src/main/java/org/jf/dexlib/
OffsettedSection.java 40 for (int i = 0; i < items.size(); i++) {
41 assert items.get(i) == null;
47 items.set(i, item);
51 readContext.setItemsForSection(ItemType, items);
  /external/smali/dexlib/src/main/java/org/jf/dexlib/Util/
ReadOnlyArrayList.java 49 public static <T> ReadOnlyArrayList<T> of(T... items) {
50 return new ReadOnlyArrayList<T>(items);
  /dalvik/dexgen/src/com/android/dexgen/dex/file/
UniformItemSection.java 26 * {@link Item} objects. Each of the items must have the same size in
46 Collection<? extends Item> items = items(); local
47 int sz = items.size();
54 return sz * items.iterator().next().writeSize();
75 for (Item one : items()) {
86 for (Item one : items()) {
96 * Since all items must be the same size, we can use the size
106 * Alters or picks the order for items in this instance if desired,
107 * so that subsequent calls to {@link #items} will yield
    [all...]
AnnotationSetItem.java 38 * {@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[i]
    [all...]
  /dalvik/dx/src/com/android/dx/dex/file/
UniformItemSection.java 25 * {@link Item} objects. Each of the items must have the same size in
45 Collection<? extends Item> items = items(); local
46 int sz = items.size();
53 return sz * items.iterator().next().writeSize();
74 for (Item one : items()) {
85 for (Item one : items()) {
95 * Since all items must be the same size, we can use the size
105 * Alters or picks the order for items in this instance if desired,
106 * so that subsequent calls to {@link #items} will yield
    [all...]
AnnotationSetItem.java 38 * {@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[i]
    [all...]
  /external/oprofile/libutil++/
comma_list.h 3 * Container holding items from a list of comma separated items
31 * setup items array according to str parameters. Implement PP:3.17
45 * return true if value match one the stored value in items
54 container_type items; member in class:comma_list
68 items.clear();
76 items.clear();
79 items.push_back(op_lexical_cast<T>(result[i]));
90 const_iterator cit = items.begin();
91 const_iterator const end = items.end()
    [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/pqueue/
pqueue.c 66 pitem *items; member in struct:_pqueue
115 if (pq->items == NULL)
117 pq->items = item;
121 for(curr = NULL, next = pq->items;
133 pq->items = item;
153 return pq->items;
159 pitem *item = pq->items;
161 if (pq->items != NULL)
162 pq->items = pq->items->next
    [all...]
  /external/openssl/crypto/pqueue/
pqueue.c 66 pitem *items; member in struct:_pqueue
115 if (pq->items == NULL)
117 pq->items = item;
121 for(curr = NULL, next = pq->items;
133 pq->items = item;
153 return pq->items;
159 pitem *item = pq->items;
161 if (pq->items != NULL)
162 pq->items = pq->items->next
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
prog_cache.c 47 struct cache_item **items; member in struct:gl_program_cache
84 struct cache_item **items; local
91 items = (struct cache_item**) malloc(size * sizeof(*items));
92 memset(items, 0, size * sizeof(*items));
95 for (c = cache->items[i]; c; c = next) {
97 c->next = items[c->hash % size];
98 items[c->hash % size] = c;
101 free(cache->items);
    [all...]
  /external/mesa3d/src/mesa/program/
prog_cache.c 47 struct cache_item **items; member in struct:gl_program_cache
84 struct cache_item **items; local
91 items = (struct cache_item**) malloc(size * sizeof(*items));
92 memset(items, 0, size * sizeof(*items));
95 for (c = cache->items[i]; c; c = next) {
97 c->next = items[c->hash % size];
98 items[c->hash % size] = c;
101 free(cache->items);
    [all...]
  /external/chromium_org/chrome/common/extensions/docs/server2/
sidenav_data_source.py 15 def _AddLevels(items, level):
16 '''Add a 'level' key to each item in |items|. 'level' corresponds to how deep
17 in |items| an item is. |level| sets the starting depth.
19 for item in items:
21 if 'items' in item:
22 _AddLevels(item['items'], level + 1)
25 def _AddSelected(items, path):
26 '''Add 'selected' and 'child_selected' properties to |items| so that the
30 for item in items:
34 if 'items' in item
    [all...]
  /frameworks/base/core/java/com/android/internal/view/menu/
ActionMenu.java 129 final ArrayList<ActionMenuItem> items = mItems; local
130 final int itemCount = items.size();
132 if (items.get(i).getItemId() == id) {
149 final ArrayList<ActionMenuItem> items = mItems; local
150 final int itemCount = items.size();
153 if (items.get(i).isVisible()) {
164 final ArrayList<ActionMenuItem> items = mItems; local
165 final int itemCount = items.size();
168 ActionMenuItem item = items.get(i);
201 final ArrayList<ActionMenuItem> items = mItems local
220 final ArrayList<ActionMenuItem> items = mItems; local
233 final ArrayList<ActionMenuItem> items = mItems; local
245 final ArrayList<ActionMenuItem> items = mItems; local
    [all...]
  /system/core/toolbox/
dynarray.c 9 a->items = NULL;
37 new_items = realloc(a->items, new_cap*sizeof(void*));
41 a->items = new_items;
51 a->items[a->count++] = item;
57 free(a->items);
58 a->items = NULL;
98 qsort(list->items,
  /external/smack/src/org/jivesoftware/smackx/pubsub/
LeafNode.java 30 * All items are published to a node, and typically subscribed to by other
43 * Get information on the items in the node in standard
53 DiscoverItems items = new DiscoverItems(); local
54 items.setTo(to);
55 items.setNode(getId());
56 return (DiscoverItems)SyncPacketSend.getReply(con, items);
60 * Get the current items stored in the node.
72 ItemsExtension itemsElem = (ItemsExtension)result.getExtension(PubSubElementType.ITEMS);
77 * Get the current items stored in the node based
93 ItemsExtension itemsElem = (ItemsExtension)result.getExtension(PubSubElementType.ITEMS);
203 Collection<T> items = new ArrayList<T>(1); local
274 Collection<T> items = new ArrayList<T>(1); local
328 Collection<String> items = new ArrayList<String>(1); local
343 List<Item> items = new ArrayList<Item>(itemIds.size()); local
    [all...]

Completed in 1036 milliseconds

12 3 4 5 6 7 8 91011>>