/external/libcxx/test/containers/sequences/list/list.ops/ |
H A D | remove_if.pass.cpp | 10 // <list> 14 #include <list> 30 std::list<int> c(a1, a1+4); 32 assert(c == std::list<int>(a2, a2+2)); 38 std::list<int, min_allocator<int>> c(a1, a1+4); 40 assert((c == std::list<int, min_allocator<int>>(a2, a2+2)));
|
H A D | 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]))));
|
H A D | 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]))));
|
H A D | 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]))));
|
H A D | 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)));
|
H A D | 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]))));
|
H A D | 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/libcxx/test/containers/sequences/list/list.special/ |
H A D | 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<in [all...] |
/external/chromium_org/third_party/freetype/include/freetype/ |
H A D | ftlist.h | 5 /* Generic list support for FreeType (specification). */ 21 /* This file implements functions relative to list processing. Its */ 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. */ 94 FT_List_Find( FT_List list, 104 /* Append an element to the end of a list. */ 107 /* list :: A pointer to the parent list [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | linked_list.h | 9 // notice, this list of conditions and the following disclaimer. 11 // copyright notice, this list of conditions and the following disclaimer 33 // Some very basic linked list functions for dealing with using void * as 51 inline void SLL_Push(void **list, void *element) { argument 52 SLL_SetNext(element, *list); 53 *list = element; 56 inline void *SLL_Pop(void **list) { argument 57 void *result = *list; 58 *list = SLL_Next(*list); [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | linked_list.h | 9 // notice, this list of conditions and the following disclaimer. 11 // copyright notice, this list of conditions and the following disclaimer 33 // Some very basic linked list functions for dealing with using void * as 51 inline void SLL_Push(void **list, void *element) { argument 52 SLL_SetNext(element, *list); 53 *list = element; 56 inline void *SLL_Pop(void **list) { argument 57 void *result = *list; 58 *list = SLL_Next(*list); [all...] |
/external/freetype/include/ |
H A D | ftlist.h | 5 /* Generic list support for FreeType (specification). */ 21 /* This file implements functions relative to list processing. Its */ 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. */ 94 FT_List_Find( FT_List list, 104 /* Append an element to the end of a list. */ 107 /* list :: A pointer to the parent list [all...] |
/external/libcxx/test/containers/sequences/list/list.cons/ |
H A D | 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<in [all...] |
H A D | 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<in [all...] |
/external/libcxx/test/containers/sequences/list/list.modifiers/ |
H A D | 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();
|
H A D | 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()));
|
H A D | 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()));
|
H A D | 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()));
|
H A D | 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)));
|
H A D | 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/pdfium/core/include/thirdparties/freetype/freetype/ |
H A D | ftlist.h | 5 /* Generic list support for FreeType (specification). */ 21 /* This file implements functions relative to list processing. Its */ 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. */ 94 FT_List_Find( FT_List list, 104 /* Append an element to the end of a list. */ 107 /* list :: A pointer to the parent list [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/ |
H A D | ftlist.h | 5 /* Generic list support for FreeType (specification). */ 21 /* This file implements functions relative to list processing. Its */ 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. */ 94 FT_List_Find( FT_List list, 104 /* Append an element to the end of a list. */ 107 /* list :: A pointer to the parent list [all...] |
/external/apache-harmony/support/src/test/java/tests/support/ |
H A D | Support_ListTest.java | 27 List<Integer> list; // must contain the Integers 0 to 99 in order field in class:Support_ListTest 35 list = l; 43 elem = list.get(counter); 48 assertTrue("ListTest - hashCode failed", hashCode == list.hashCode()); 50 list.add(50, new Integer(1000)); 51 assertTrue("ListTest - a) add with index failed--did not insert", list 55 list.get(51).equals(new Integer(50))); 58 list.get(49).equals(new Integer(49))); 60 list.set(50, new Integer(2000)); 61 assertTrue("ListTest - a) set failed--did not set", list 128 t_listIterator(List<Integer> list) argument [all...] |
/external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | TypeListItem.java | 27 * Representation of a list of class references. 39 /** {@code non-null;} the actual list */ 40 private final TypeList list; field in class:TypeListItem 45 * @param list {@code non-null;} the actual list 47 public TypeListItem(TypeList list) { argument 48 super(ALIGNMENT, (list.size() * ELEMENT_SIZE) + HEADER_SIZE); 50 this.list = list; 56 return StdTypeList.hashContents(list); [all...] |
/external/dexmaker/src/dx/java/com/android/dx/rop/cst/ |
H A D | CstArray.java | 26 /** {@code non-null;} the actual list of contents */ 27 private final List list; field in class:CstArray 32 * @param list {@code non-null;} the actual list of contents 34 public CstArray(List list) { argument 35 if (list == null) { 36 throw new NullPointerException("list == null"); 39 list.throwIfMutable(); 41 this.list = list; [all...] |