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

1 2 3 4 5 6 7 8 91011>>

  /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/build/prebuilts/gradle/SwipeRefreshLayoutBasic/Application/src/main/java/com/example/android/common/dummydata/
Cheeses.java 161 ArrayList<String> items = new ArrayList<String>(); local
163 items.add(CHEESES[i]);
165 return items;
175 HashSet<String> items = new HashSet<String>(); local
180 while (items.size() < count) {
181 items.add(CHEESES[random.nextInt(CHEESES.length)]);
184 return new ArrayList<String>(items);
  /developers/build/prebuilts/gradle/SwipeRefreshListFragment/Application/src/main/java/com/example/android/common/dummydata/
Cheeses.java 161 ArrayList<String> items = new ArrayList<String>(); local
163 items.add(CHEESES[i]);
165 return items;
175 HashSet<String> items = new HashSet<String>(); local
180 while (items.size() < count) {
181 items.add(CHEESES[random.nextInt(CHEESES.length)]);
184 return new ArrayList<String>(items);
  /developers/build/prebuilts/gradle/SwipeRefreshMultipleViews/Application/src/main/java/com/example/android/common/dummydata/
Cheeses.java 161 ArrayList<String> items = new ArrayList<String>(); local
163 items.add(CHEESES[i]);
165 return items;
175 HashSet<String> items = new HashSet<String>(); local
180 while (items.size() < count) {
181 items.add(CHEESES[random.nextInt(CHEESES.length)]);
184 return new ArrayList<String>(items);
  /developers/samples/android/common/src/java/com/example/android/common/dummydata/
Cheeses.java 161 ArrayList<String> items = new ArrayList<String>(); local
163 items.add(CHEESES[i]);
165 return items;
175 HashSet<String> items = new HashSet<String>(); local
180 while (items.size() < count) {
181 items.add(CHEESES[random.nextInt(CHEESES.length)]);
184 return new ArrayList<String>(items);
  /development/samples/browseable/SwipeRefreshLayoutBasic/src/com.example.android.common/dummydata/
Cheeses.java 161 ArrayList<String> items = new ArrayList<String>(); local
163 items.add(CHEESES[i]);
165 return items;
175 HashSet<String> items = new HashSet<String>(); local
180 while (items.size() < count) {
181 items.add(CHEESES[random.nextInt(CHEESES.length)]);
184 return new ArrayList<String>(items);
  /development/samples/browseable/SwipeRefreshListFragment/src/com.example.android.common/dummydata/
Cheeses.java 161 ArrayList<String> items = new ArrayList<String>(); local
163 items.add(CHEESES[i]);
165 return items;
175 HashSet<String> items = new HashSet<String>(); local
180 while (items.size() < count) {
181 items.add(CHEESES[random.nextInt(CHEESES.length)]);
184 return new ArrayList<String>(items);
  /development/samples/browseable/SwipeRefreshMultipleViews/src/com.example.android.common/dummydata/
Cheeses.java 161 ArrayList<String> items = new ArrayList<String>(); local
163 items.add(CHEESES[i]);
165 return items;
175 HashSet<String> items = new HashSet<String>(); local
180 while (items.size() < count) {
181 items.add(CHEESES[random.nextInt(CHEESES.length)]);
184 return new ArrayList<String>(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/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].value = 1.f;
75 test_data.items[0].buttons[0].pressed = true;
76 test_data.items[0].axes[0] = -1.f;
77 test_data.items[0].axes[1] = .5f;
105 EXPECT_EQ(1u, output.items[0].buttonsLength);
106 EXPECT_EQ(1.f, output.items[0].buttons[0].value)
    [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/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/0.153/backends/
x86_corenote.c 29 regs_offset, nregloc, reglocs, nitems, items);
34 size_t *nitems, const Ebl_Core_Item **items)
46 *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 */
  /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/Source/platform/clipboard/
ClipboardUtilities.cpp 48 Vector<String> items; local
51 uriList.split('\n', items);
54 for (size_t i = 0; i < items.size(); ++i) {
55 String& line = items[i];
  /external/chromium_org/third_party/WebKit/public/web/
WebPopupMenuInfo.h 44 WebVector<WebMenuItemInfo> items; member in struct:blink::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/ui/base/models/
simple_combobox_model.cc 10 const std::vector<base::string16>& items)
11 : items_(items) {
  /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...]

Completed in 1111 milliseconds

1 2 3 4 5 6 7 8 91011>>