/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
reverse.pass.cpp | 10 // <list> 14 #include <list> 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
sort.pass.cpp | 10 // <list> 14 #include <list> 24 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 32 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
sort_comp.pass.cpp | 10 // <list> 14 #include <list> 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 27 assert(c1 == std::list<int>(a2, a2+sizeof(a2)/sizeof(a2[0]))); 33 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 35 assert((c1 == std::list<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
unique_pred.pass.cpp | 10 // <list> 14 #include <list> 29 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 31 assert(c == std::list<int>(a2, a2+4)); 37 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 39 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
/toolchain/binutils/binutils-2.25/gprof/ |
search_list.c | 1 /* search-list.c 29 search_list_append (Search_List *list, const char *paths) 50 /* Append new path at end of list. */ 53 if (list->tail) 54 list->tail->next = new_el; 56 list->head = new_el; 58 list->tail = new_el;
|
/external/icu/icu4c/source/common/ |
ulist.c | 33 static void ulist_addFirstItem(UList *list, UListNode *newItem); 58 * Function called by addItemEndList or addItemBeginList when the first item is added to the list. 61 static void ulist_addFirstItem(UList *list, UListNode *newItem) { 64 list->head = newItem; 65 list->tail = newItem; 66 list->currentIndex = 0; 69 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) { 72 if (U_FAILURE(*status) || list == NULL || data == NULL) { 84 if (list->size == 0) { 85 ulist_addFirstItem(list, newItem) [all...] |
/external/dbus/dbus/ |
dbus-list.c | 2 /* dbus-list.c Generic linked list utility (internal to D-Bus implementation) 26 #include "dbus-list.h" 31 * @defgroup DBusList Linked list 39 _DBUS_DEFINE_GLOBAL_LOCK (list); variable 42 * @defgroup DBusListInternals Linked list implementation details 59 _DBUS_LOCK (list); 67 _DBUS_UNLOCK (list); 76 _DBUS_UNLOCK (list); 88 _DBUS_UNLOCK (list); [all...] |
/external/libcxx/test/std/containers/sequences/list/list.special/ |
db_swap_1.pass.cpp | 10 // <list> 13 // void swap(list<T,Alloc>& x, list<T,Alloc>& y); 19 #include <list> 31 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 32 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 33 std::list<int>::iterator i1 = c1.begin(); 34 std::list<int>::iterator i2 = c2.begin(); 38 std::list<int>::iterator j = i1; 46 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])) [all...] |
/external/selinux/libsepol/cil/src/ |
cil_list.h | 8 * this list of conditions and the following disclaimer. 11 * this list of conditions and the following disclaimer in the documentation 47 #define cil_list_for_each(item, list) \ 48 for (item = (list)->head; item != NULL; item = item->next) 51 void cil_list_init(struct cil_list **list, enum cil_flavor flavor); 52 void cil_list_destroy (struct cil_list **list, unsigned destroy_data); 55 void cil_list_append(struct cil_list *list, enum cil_flavor flavor, void *data); 56 void cil_list_prepend(struct cil_list *list, enum cil_flavor flavor, void *data); 57 void cil_list_remove(struct cil_list *list, enum cil_flavor flavor, void *data, unsigned destroy_data); 58 struct cil_list_item *cil_list_insert(struct cil_list *list, struct cil_list_item *curr, enum cil_flavor flavor, void *data) [all...] |
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.special/ |
db_swap_1.pass.cpp | 10 // <list> 13 // void swap(list<T,Alloc>& x, list<T,Alloc>& y); 19 #include <list> 31 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 32 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 33 std::list<int>::iterator i1 = c1.begin(); 34 std::list<int>::iterator i2 = c2.begin(); 38 std::list<int>::iterator j = i1; 46 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])) [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
ipa-ref-inline.h | 52 /* Return reference list REF is in. */ 60 /* Return reference list REF is in. */ 68 /* Return first reference in LIST or NULL if empty. */ 71 ipa_ref_list_first_reference (struct ipa_ref_list *list) 73 if (!vec_safe_length (list->references)) 75 return &(*list->references)[0]; 78 /* Return first referring ref in LIST or NULL if empty. */ 81 ipa_ref_list_first_referring (struct ipa_ref_list *list) 83 if (!list->referring.length ()) 85 return list->referring[0] [all...] |
/external/freetype/include/ |
ftlist.h | 5 /* Generic list support for FreeType (specification). */ 21 /* This file implements functions relative to list processing. Its */ 50 /* List Processing */ 56 /* This section contains various definitions related to list */ 84 /* Find the list node for a given listed object. */ 87 /* list :: A pointer to the parent list. */ 91 /* List node. NULL if it wasn't found. */ 94 FT_List_Find( FT_List list, 104 /* Append an element to the end of a list. * [all...] |
/external/libcxx/test/std/containers/sequences/list/list.cons/ |
assign_copy.pass.cpp | 10 // <list> 12 // list& operator=(const list& c); 14 #include <list> 22 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); 23 std::list<int, test_allocator<int> > l2(l, test_allocator<int>(3)); 29 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); 30 std::list<int, other_allocator<int> > l2(l, other_allocator<int>(3)); 37 std::list<int, min_allocator<int> > l(3, 2, min_allocator<int>()); 38 std::list<int, min_allocator<int> > l2(l, min_allocator<int>()) [all...] |
copy_alloc.pass.cpp | 10 // <list> 12 // list(const list& c, const allocator_type& a); 14 #include <list> 23 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); 24 std::list<int, test_allocator<int> > l2(l, test_allocator<int>(3)); 29 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); 30 std::list<int, other_allocator<int> > l2(l, other_allocator<int>(3)); 36 std::list<int, min_allocator<int> > l(3, 2, min_allocator<int>()); 37 std::list<int, min_allocator<int> > l2(l, min_allocator<int>()) [all...] |
/external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
erase_iter_db2.pass.cpp | 10 // <list> 18 #include <list> 29 std::list<int> l1(a1, a1+3); 30 std::list<int> l2(a1, a1+3); 31 std::list<int>::const_iterator i = l2.begin(); 38 std::list<int, min_allocator<int>> l1(a1, a1+3); 39 std::list<int, min_allocator<int>> l2(a1, a1+3); 40 std::list<int, min_allocator<int>>::const_iterator i = l2.begin();
|
erase_iter_iter_db1.pass.cpp | 10 // <list> 18 #include <list> 29 std::list<int> l1(a1, a1+3); 30 std::list<int> l2(a1, a1+3); 31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin())); 37 std::list<int, min_allocator<int>> l1(a1, a1+3); 38 std::list<int, min_allocator<int>> l2(a1, a1+3); 39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
erase_iter_iter_db2.pass.cpp | 10 // <list> 18 #include <list> 29 std::list<int> l1(a1, a1+3); 30 std::list<int> l2(a1, a1+3); 31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin())); 37 std::list<int, min_allocator<int>> l1(a1, a1+3); 38 std::list<int, min_allocator<int>> l2(a1, a1+3); 39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
erase_iter_iter_db3.pass.cpp | 10 // <list> 18 #include <list> 29 std::list<int> l1(a1, a1+3); 30 std::list<int> l2(a1, a1+3); 31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); 37 std::list<int, min_allocator<int>> l1(a1, a1+3); 38 std::list<int, min_allocator<int>> l2(a1, a1+3); 39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
pop_back.pass.cpp | 10 // <list> 18 #include <list> 27 std::list<int> c(a, a+3); 29 assert(c == std::list<int>(a, a+2)); 31 assert(c == std::list<int>(a, a+1)); 42 std::list<int, min_allocator<int>> c(a, a+3); 44 assert((c == std::list<int, min_allocator<int>>(a, a+2))); 46 assert((c == std::list<int, min_allocator<int>>(a, a+1)));
|
pop_front.pass.cpp | 10 // <list> 14 #include <list> 23 std::list<int> c(a, a+3); 25 assert(c == std::list<int>(a+1, a+3)); 27 assert(c == std::list<int>(a+2, a+3)); 34 std::list<int, min_allocator<int>> c(a, a+3); 36 assert((c == std::list<int, min_allocator<int>>(a+1, a+3))); 38 assert((c == std::list<int, min_allocator<int>>(a+2, a+3)));
|
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
merge.pass.cpp | 10 // <list> 12 // void merge(list& x); 14 #include <list> 25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0]))); 35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
merge_comp.pass.cpp | 10 // <list> 12 // template <class Compare> void merge(list& x, Compare comp); 14 #include <list> 26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0]))); 36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); 37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); 39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/include/freetype/ |
ftlist.h | 5 /* Generic list support for FreeType (specification). */ 21 /* This file implements functions relative to list processing. Its */ 50 /* List Processing */ 56 /* This section contains various definitions related to list */ 84 /* Find the list node for a given listed object. */ 87 /* list :: A pointer to the parent list. */ 91 /* List node. NULL if it wasn't found. */ 94 FT_List_Find( FT_List list, 104 /* Append an element to the end of a list. * [all...] |
/external/pdfium/third_party/freetype/include/freetype/ |
ftlist.h | 5 /* Generic list support for FreeType (specification). */ 21 /* This file implements functions relative to list processing. Its */ 50 /* List Processing */ 56 /* This section contains various definitions related to list */ 84 /* Find the list node for a given listed object. */ 87 /* list :: A pointer to the parent list. */ 91 /* List node. NULL if it wasn't found. */ 94 FT_List_Find( FT_List list, 104 /* Append an element to the end of a list. * [all...] |
/frameworks/base/packages/SystemUI/src/com/android/systemui/volume/ |
Events.java | 108 public static void writeEvent(Context context, int tag, Object... list) { 111 if (list != null && list.length > 0) { 117 (Boolean) list[1] ? 1 : 0); 118 sb.append(SHOW_REASONS[(Integer) list[0]]).append(" keyguard=").append(list[1]); 122 (Boolean) list[0]); 123 sb.append(list[0]); 127 sb.append(DISMISS_REASONS[(Integer) list[0]]); 131 (Integer) list[0]) [all...] |