HomeSort by relevance Sort by last modified time
    Searched refs:items (Results 1 - 25 of 1677) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/chromium_org/ash/launcher/
launcher_util.cc 14 for (size_t i = 0; i < launcher_model.items().size(); i++) {
15 if (launcher_model.items()[i].type == ash::TYPE_BROWSER_SHORTCUT)
  /ndk/tests/device/test-stlport_shared-exception/jni/
p11667.cpp 11 LIST() { nitems = 16; items = new T[nitems]; };
13 LIST(int u) { nitems = u; items = new T[nitems]; };
16 return items[i];
21 T* src = items;
32 if (items) delete[] items;
34 items = newlist;
39 T *items; member in class:LIST
  /ndk/tests/device/test-stlport_static-exception/jni/
p11667.cpp 11 LIST() { nitems = 16; items = new T[nitems]; };
13 LIST(int u) { nitems = u; items = new T[nitems]; };
16 return items[i];
21 T* src = items;
32 if (items) delete[] items;
34 items = newlist;
39 T *items; member in class:LIST
  /developers/samples/android/common/src/com/example/android/common/dummydata/
Cheeses.java 159 ArrayList<String> items = new ArrayList<String>(); local
161 items.add(CHEESES[i]);
163 return items;
  /external/qemu/android/utils/
reflist.c 23 return l->u.items;
30 AFREE(l->u.items);
40 /* deferred empty, set all items to NULL
42 void** items = _areflist_items(l); local
43 AARRAY_ZERO(items, l->count);
57 void** items = _areflist_items(l); local
58 void** end = items + l->count;
59 void** ii = items;
63 return (ii - items);
75 void** items; local
102 void** items; local
126 void** items = _areflist_items(l); local
161 void** items = _areflist_items(l); local
192 void** items = _areflist_items(l); local
229 void** items = _areflist_items(l); local
281 void** items; local
    [all...]
  /dalvik/dexgen/src/com/android/dexgen/dex/file/
UniformListItem.java 26 * 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) {
56 super(getAlignment(items), writeSize(items));
62 this.items = items
    [all...]
  /dalvik/dx/src/com/android/dx/dex/file/
UniformListItem.java 24 * Class that represents a contiguous list of uniform items. Each
28 * <p>This class inherits its alignment from its items, bumped up to
29 * {@code 4} if the items have a looser alignment requirement. If
44 private final List<T> items; field in class:UniformListItem
51 * @param items {@code non-null and non-empty;} list of items to represent
53 public UniformListItem(ItemType itemType, List<T> items) {
54 super(getAlignment(items), writeSize(items));
60 this.items = items
    [all...]
  /external/dexmaker/src/dx/java/com/android/dx/dex/file/
UniformListItem.java 26 * 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) {
56 super(getAlignment(items), writeSize(items));
62 this.items = items
    [all...]
  /external/chromium_org/sandbox/win/src/
shared_handles.cc 14 shared_.items = NULL;
19 if (size_bytes < sizeof(shared_.items[0])) {
23 shared_.items = static_cast<SharedItem*>(raw_mem);
24 shared_.max_items = size_bytes / sizeof(shared_.items[0]);
60 if (tag == shared_.items[ix].tag) {
61 return &shared_.items[ix];
  /external/chromium_org/third_party/WebKit/Source/core/platform/
ContextMenu.cpp 31 static const ContextMenuItem* findItemWithAction(unsigned action, const Vector<ContextMenuItem>& items)
33 for (size_t i = 0; i < items.size(); ++i) {
34 const ContextMenuItem& item = items[i];
  /external/elfutils/backends/
x86_corenote.c 28 return ioperm_info (descsz, regs_offset, nregloc, reglocs, nitems, items);
33 size_t *nitems, const Ebl_Core_Item **items)
45 *items = &ioperm_item;
  /external/smack/src/org/jivesoftware/smackx/pubsub/
ItemsExtension.java 22 * <li>It can represent an event containing a list of items that have been published
23 * <li>It can represent an event containing a list of retracted (deleted) items.
24 * <li>It can represent a request to delete a list of items.
25 * <li>It can represent a request to get existing items.
36 protected List<? extends PacketExtension> items; field in class:ItemsExtension
40 /** An items element, which has an optional <b>max_items</b> attribute when requesting items */
41 items(PubSubElementType.ITEMS, "max_items"), enum constant in enum:ItemsExtension.ItemsElementType
67 * Construct an instance with a list representing items that have been published or deleted.
    [all...]
EventElementType.java 33 /** Items have been published to a node */
34 items, enum constant in enum:EventElementType
36 /** All items have been purged from a node */
PublishItem.java 26 protected Collection<T> items; field in class:PublishItem
37 items = new ArrayList<T>(1);
38 items.add(toPublish);
42 * Construct a request to publish multiple items to a node.
50 items = toPublish;
62 for (Item item : items)
AffiliationsExtension.java 27 protected List<Affiliation> items = Collections.EMPTY_LIST; field in class:AffiliationsExtension
39 items = affiliationList;
53 items = affiliationList;
58 return items;
64 if ((items == null) || (items.size() == 0))
80 for (Affiliation item : items)
SubscriptionsExtension.java 26 protected List<Subscription> items = Collections.EMPTY_LIST; field in class:SubscriptionsExtension
38 items = subList;
52 items = subList;
62 return items;
68 if ((items == null) || (items.size() == 0))
85 for (Subscription item : items)
  /external/bison/src/
closure.h 34 ITEMS, of length N), set up RULESET and ITEMSET to indicate what
35 rules could be run and which items could be accepted when those
36 items are the active ones.
44 significant). CLOSURE places there the indices of all items which
47 void closure (item_number *items, size_t n);
  /external/chromium_org/third_party/WebKit/public/web/
WebPopupMenuInfo.h 44 WebVector<WebMenuItemInfo> items; member in struct:WebKit::WebPopupMenuInfo
  /external/chromium_org/third_party/WebKit/Tools/Scripts/
sampstat 41 def sum(items):
42 return reduce(lambda x,y: x+y, items)
44 def arithmeticMean(items):
45 return sum(items) / len(items)
47 def standardDeviation(mean, items):
48 deltaSquares = [(item - mean) ** 2 for item in items]
49 return math.sqrt(sum(deltaSquares) / (len(items) - 1))
51 def standardError(stdDev, items):
52 return stdDev / math.sqrt(len(items))
    [all...]
  /external/chromium_org/net/third_party/nss/ssl/bodge/
secitem_array.c 22 SECItem *items; member in struct:SECItemArrayStr
47 PORT_Assert(array->items == NULL);
54 result->items = PORT_ArenaZNewArray(arena, SECItem, len);
56 result->items = PORT_ZNewArray(SECItem, len);
58 if (result->items == NULL) {
62 result->items = NULL;
76 array->items = NULL;
96 if (!array || !array->len || !array->items)
100 SECItem *item = &array->items[i];
110 PORT_Free(array->items);
    [all...]
  /external/libsepol/src/
write.c 60 size_t items; local
70 items = put_entry(buf, sizeof(uint32_t), 3, fp);
71 if (items != 3)
76 items = put_entry(&bit, sizeof(uint32_t), 1, fp);
77 if (items != 1)
80 items = put_entry(&map, sizeof(uint64_t), 1, fp);
81 if (items != 1)
106 size_t items, items2; local
120 items = 1; /* item 0 is used for the item count */
122 buf32[items++] = cpu_to_le32(val)
247 size_t items; local
319 size_t items; local
367 size_t items; local
387 size_t items, items2; local
415 size_t items, items2, len; local
443 size_t items, items2, len; local
470 size_t nel, items; local
514 size_t nel, items; local
537 size_t nel, items, len; local
571 size_t items; local
587 size_t items; local
607 unsigned int items, items2; local
652 uint32_t len, items; local
702 uint32_t items, items2, len; local
755 uint32_t len, items; local
781 size_t items, items2; local
810 size_t items, items2, len; local
835 size_t items, items2, len; local
868 int items; local
918 size_t items, items2, len, len2; local
1011 size_t items, items2, len; local
1073 size_t items, items2, len; local
1151 size_t items, items2, len; local
1214 size_t nel, items; local
1283 size_t nel, items, len; local
1390 size_t nel = 0, items, len; local
1437 size_t nel, items; local
1486 size_t items, items2; local
1571 size_t items; local
1612 size_t items; local
1634 size_t items; local
1676 size_t items; local
1810 unsigned int items = 2 + scope->decl_ids_len, i; local
1880 size_t items, items2, len; local
    [all...]
  /external/chromium_org/content/browser/gamepad/
gamepad_provider_unittest.cc 70 test_data.items[0].connected = true;
71 test_data.items[0].timestamp = 0;
72 test_data.items[0].buttonsLength = 1;
73 test_data.items[0].axesLength = 2;
74 test_data.items[0].buttons[0] = 1.f;
75 test_data.items[0].axes[0] = -1.f;
76 test_data.items[0].axes[1] = .5f;
104 EXPECT_EQ(1u, output.items[0].buttonsLength);
105 EXPECT_EQ(1.f, output.items[0].buttons[0]);
106 EXPECT_EQ(2u, output.items[0].axesLength)
    [all...]
  /external/smali/dexlib/src/main/java/org/jf/dexlib/
Section.java 42 * A list of the items that this section contains.
43 * If the section has been placed, this list should be in the order that the items
46 protected final ArrayList<T> items; field in class:Section
49 * A HashMap of the items in this section. This is used when interning items, to determine
77 items = new ArrayList<T>();
82 * Finalize the location of all items, and place them starting at the given offset
87 if (items.size() > 0) {
92 for (int i=0; i < items.size(); i++) {
93 T item = items.get(i)
    [all...]
  /external/harfbuzz_ng/src/
gen-arabic-table.py 90 items = fields[5].split (' ')
91 shape, items = items[0][1:-1], tuple (int (x, 16) for x in items[1:])
97 if len (items) != 1:
99 if len (items) != 2 or items[0] != 0x0644 or items[1] not in [0x0622, 0x0623, 0x0625, 0x0627]:
104 if items not in ligatures:
105 ligatures[items] = {
    [all...]
  /external/linux-tools-perf/util/
thread_map.c 19 int items; local
24 items = scandir(name, &namelist, filter, NULL);
25 if (items <= 0)
28 threads = malloc(sizeof(*threads) + sizeof(pid_t) * items);
30 for (i = 0; i < items; i++)
32 threads->nr = items;
35 for (i=0; i<items; i++)

Completed in 1282 milliseconds

1 2 3 4 5 6 7 8 91011>>