| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.cons/ |
| default_stack_alloc.pass.cpp | 10 // <list>
12 // explicit list(const Alloc& = Alloc());
14 #include <list>
23 std::list<int> l;
28 std::list<int> l((std::allocator<int>()));
33 std::list<int, stack_allocator<int, 4> > l;
|
| /packages/apps/Contacts/src/com/android/contacts/list/ |
| OnEmailAddressPickerActionListener.java | 16 package com.android.contacts.list;
|
| OnMultiplePhoneNumberPickerActionListener.java | 16 package com.android.contacts.list;
|
| OnPostalAddressPickerActionListener.java | 16 package com.android.contacts.list;
|
| /external/dropbear/libtomcrypt/src/pk/asn1/der/choice/ |
| der_decode_choice.c | 24 @param list The list of items to decode
25 @param outlen The number of items in the list
29 ltc_asn1_list *list, unsigned long outlen)
36 LTC_ARGCHK(list != NULL);
45 list[x].used = 0;
50 size = list[x].size;
51 data = list[x].data;
53 switch (list[x].type) {
57 list[x].used = 1
[all...] |
| /external/eigen/Eigen/src/StlSupport/ |
| StdList.h | 17 #define EIGEN_EXPLICIT_STL_LIST_INSTANTIATION(...) template class std::list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >;
24 * std::list such that for data types with alignment issues the correct allocator
32 class list<__VA_ARGS__, _Ay> \
33 : public list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \
35 typedef list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > list_base; \
41 explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \
43 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \
44 list(const list& c) : list_base(c) {} \
45 explicit list(size_type num, const value_type& val = value_type()) : list_base(num, val) {}
80 class list<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/light/ |
| LightList.java | 10 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
49 private Light[] list, tlist; field in class:LightList
83 list = new Light[DEFAULT_SIZE];
98 Light[] temp = new Light[list.length * 2];
99 float[] temp2 = new float[list.length * 2];
100 System.arraycopy(list, 0, temp, 0, list.length);
101 System.arraycopy(distToOwner, 0, temp2, 0, list.length);
102 list = temp
[all...] |
| /external/v8/src/ |
| small-pointer-list.h | 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
38 // SmallPointerList is a list optimized for storing no or just a
41 // The interface tries to be as close to List from list.h as possible.
54 if (list()->capacity() >= capacity) return;
55 int old_length = list()->length();
56 list()->AddBlock(NULL, capacity - list()->capacity());
57 list()->Rewind(old_length)
60 PointerList* list = new PointerList(capacity); local
87 PointerList* list = new PointerList(2); local
176 PointerList* list() const { function in class:v8::internal::SmallPointerList
[all...] |
| /sdk/emulator/opengl/host/libs/Translator/GLcommon/ |
| RangeManip.cpp | 44 list.push_back(r);
49 addRange(rl.list[i]);
55 delRange(rl.list[i],deleted);
60 return list.empty();
64 return list.size();
67 return list.clear();
71 if(i > list.size()) return;
72 list.erase(list.begin() +i);
80 // compare new rect to each and any of the rects on the list
[all...] |
| /external/proguard/src/proguard/util/ |
| ListUtil.java | 28 * <code>java.util.List</code> objects.
35 * Creates a comma-separated String from the given List of String objects.
37 public static String commaSeparatedString(List list)
39 if (list == null)
46 for (int index = 0; index < list.size(); index++)
53 buffer.append(quotedString((String)list.get(index)));
61 * Creates a List of String objects from the given comma-separated String.
63 public static List commaSeparatedList(String string)
70 List list = new ArrayList() local
150 List list = commaSeparatedList(args[0]); local
160 List list = Arrays.asList(args); local
[all...] |
| /external/qemu/ |
| qemu-option.h | 62 * The following functions take a parameter list as input. This is a pointer to
67 QEMUOptionParameter *get_option_parameter(QEMUOptionParameter *list,
69 int set_option_parameter(QEMUOptionParameter *list, const char *name,
71 int set_option_parameter_int(QEMUOptionParameter *list, const char *name,
74 QEMUOptionParameter *list);
76 QEMUOptionParameter *list, QEMUOptionParameter *dest);
77 void free_option_parameters(QEMUOptionParameter *list);
78 void print_option_parameters(QEMUOptionParameter *list);
79 void print_option_help(QEMUOptionParameter *list);
116 QemuOpts *qemu_opts_find(QemuOptsList *list, const char *id)
[all...] |
| qemu-option.c | 156 * Searches an option list for an option with the given name
158 QEMUOptionParameter *get_option_parameter(QEMUOptionParameter *list,
161 while (list && list->name) {
162 if (!strcmp(list->name, name)) {
163 return list;
165 list++;
242 * Sets the value of a parameter in a given option list. The parsing of the
258 int set_option_parameter(QEMUOptionParameter *list, const char *name,
264 list = get_option_parameter(list, name)
521 QemuOptsList *list; member in struct:QemuOpts
[all...] |
| /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/ |
| SignerInformationStore.java | 7 import java.util.List;
25 List list = (ArrayList)table.get(sid); local
26 if (list == null)
28 list = new ArrayList(1);
29 table.put(sid, list);
32 list.add(signer);
48 Collection list = getSigners(selector); local
50 return list.size() == 0 ? null : (SignerInformation) list.iterator().next()
104 List list = (ArrayList)table.get(selector); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.modifiers/ |
| erase_iter_iter.pass.cpp | 10 // <list>
14 #include <list>
21 std::list<int> l1(a1, a1+3);
22 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin());
28 std::list<int> l1(a1, a1+3);
29 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin()));
33 assert(l1 == std::list<int>(a1+1, a1+3));
36 std::list<int> l1(a1, a1+3);
37 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2));
41 assert(l1 == std::list<int>(a1+2, a1+3))
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| ipa-ref-inline.h | 57 /* Return reference list REF is in. */
68 /* Return reference list REF is in. */
79 /* Return first reference in LIST or NULL if empty. */
82 ipa_ref_list_first_reference (struct ipa_ref_list *list)
84 if (!VEC_length (ipa_ref_t, list->references))
86 return VEC_index (ipa_ref_t, list->references, 0);
89 /* Return first refering ref in LIST or NULL if empty. */
92 ipa_ref_list_first_refering (struct ipa_ref_list *list)
94 if (!VEC_length (ipa_ref_ptr, list->refering))
96 return VEC_index (ipa_ref_ptr, list->refering, 0)
[all...] |
| /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| ipa-ref-inline.h | 57 /* Return reference list REF is in. */
68 /* Return reference list REF is in. */
79 /* Return first reference in LIST or NULL if empty. */
82 ipa_ref_list_first_reference (struct ipa_ref_list *list)
84 if (!VEC_length (ipa_ref_t, list->references))
86 return VEC_index (ipa_ref_t, list->references, 0);
89 /* Return first refering ref in LIST or NULL if empty. */
92 ipa_ref_list_first_refering (struct ipa_ref_list *list)
94 if (!VEC_length (ipa_ref_ptr, list->refering))
96 return VEC_index (ipa_ref_ptr, list->refering, 0)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/ |
| ipa-ref-inline.h | 57 /* Return reference list REF is in. */
68 /* Return reference list REF is in. */
79 /* Return first reference in LIST or NULL if empty. */
82 ipa_ref_list_first_reference (struct ipa_ref_list *list)
84 if (!VEC_length (ipa_ref_t, list->references))
86 return VEC_index (ipa_ref_t, list->references, 0);
89 /* Return first refering ref in LIST or NULL if empty. */
92 ipa_ref_list_first_refering (struct ipa_ref_list *list)
94 if (!VEC_length (ipa_ref_ptr, list->refering))
96 return VEC_index (ipa_ref_ptr, list->refering, 0)
[all...] |
| /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/ |
| ipa-ref-inline.h | 57 /* Return reference list REF is in. */
68 /* Return reference list REF is in. */
79 /* Return first reference in LIST or NULL if empty. */
82 ipa_ref_list_first_reference (struct ipa_ref_list *list)
84 if (!VEC_length (ipa_ref_t, list->references))
86 return VEC_index (ipa_ref_t, list->references, 0);
89 /* Return first refering ref in LIST or NULL if empty. */
92 ipa_ref_list_first_refering (struct ipa_ref_list *list)
94 if (!VEC_length (ipa_ref_ptr, list->refering))
96 return VEC_index (ipa_ref_ptr, list->refering, 0)
[all...] |
| /external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
| ListSubListTester.java | 33 import java.util.List;
37 * A generic JUnit test which tests {@code subList()} operations on a list.
84 assertEquals("subList(0, size) should be equal to the original list",
91 List<E> subList = getList().subList(0, 1);
93 List<E> expected =
100 List<E> subList = getList().subList(0, 0);
108 List<E> subList = getList().subList(0, 1);
110 List<E> expected = Helpers.copyToList(createSamplesArray());
118 List<E> subList = getList().subList(0, 1);
120 assertEquals("A set() call to a list after a sublist has been created
179 List<E> list = getList(); local
195 List<E> list = getList(); local
209 List<E> list = getList(); local
233 List<E> list = getList(); local
251 List<E> list = getList(); local
277 List<E> list = getList(); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.special/ |
| swap.pass.cpp | 10 // <list>
13 // void swap(list<T,Alloc>& x, list<T,Alloc>& y);
15 #include <list>
24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
25 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
28 assert(c2 == std::list<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
33 std::list<int> c1(a1, a1);
34 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]))
[all...] |
| /system/core/libcutils/ |
| dir_hash.c | 117 struct list { struct
119 struct list *next;
123 struct list *const *ra = a;
124 struct list *const *rb = b;
130 struct list **out) {
131 struct list *list = NULL; local
132 struct list *f;
150 struct list *node = malloc(sizeof(struct list));
269 struct list **list; local
[all...] |
| /cts/tests/tests/webkit/src/android/webkit/cts/ |
| WebHistoryItemTest.java | 49 WebBackForwardList list = mOnUiThread.copyBackForwardList(); local
50 assertEquals(0, list.getSize());
54 list = mOnUiThread.copyBackForwardList();
55 assertEquals(1, list.getSize());
56 WebHistoryItem item = list.getCurrentItem();
66 list = mOnUiThread.copyBackForwardList();
67 assertEquals(2, list.getSize());
68 item = list.getCurrentItem();
|
| /external/chromium/chrome/common/extensions/docs/js/ |
| sidebar.js | 18 function toggleList(list) {
19 if (typeof list.length != 'number') {
20 list = Array(list);
23 for (var i = 0; i < list.length; i++) {
24 var toggle = list[i].parentNode &&
25 list[i].parentNode.firstChild;
28 list[i].style.display = visible ? 'block' : 'none';
50 * Adds toggle controls to the sidebar list.
52 * Controls are inserted as the first children of list items in the sideba
[all...] |
| /external/linux-tools-perf/util/ |
| generate-cmdlist.sh | 14 sed -n -e 's/^perf-\([^ ]*\)[ ].* common.*/\1/p' ${PREFIX}/command-list.txt |
|
| /external/srec/seti/sltsEngine/include/ |
| linklist.h | 46 For now, dynamically allocate a new list node with the data
48 LListResult Insert(LList *list, void *data);
55 For now, dynamically free a new list node
58 LListResult Delete(LList *list);
|
