| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| 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)));
|
| 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]))));
|
| /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...] |
| /external/chromium_org/sync/js/ |
| js_arg_list_unittest.cc | 22 scoped_ptr<base::ListValue> list(new base::ListValue());
23 list->Append(new base::FundamentalValue(false));
24 list->Append(new base::FundamentalValue(5));
26 list->Append(dict);
30 scoped_ptr<base::ListValue> list_copy(list->DeepCopy());
32 JsArgList arg_list(list.get());
34 // |arg_list| should take over |list|'s data.
35 EXPECT_TRUE(list->empty());
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
| GraphicsContextAnnotation.cpp | 9 * notice, this list of conditions and the following disclaimer.
11 * copyright notice, this list of conditions and the following disclaimer
57 void GraphicsContextAnnotation::asAnnotationList(AnnotationList &list) const
59 list.clear();
62 list.append(std::make_pair(AnnotationKeyRendererName, m_rendererName));
65 list.append(std::make_pair(AnnotationKeyPaintPhase, m_paintPhase));
68 list.append(std::make_pair(AnnotationKeyElementId, m_elementId));
71 list.append(std::make_pair(AnnotationKeyElementClass, m_elementClass));
74 list.append(std::make_pair(AnnotationKeyElementTag, m_elementTag));
|
| /external/chromium_org/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...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| 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) {
52 SLL_SetNext(element, *list);
53 *list = element;
56 inline void *SLL_Pop(void **list) {
57 void *result = *list;
58 *list = SLL_Next(*list);
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| 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) {
52 SLL_SetNext(element, *list);
53 *list = element;
56 inline void *SLL_Pop(void **list) {
57 void *result = *list;
58 *list = SLL_Next(*list);
[all...] |
| /external/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/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)));
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/ |
| list.hpp | 13 // $Id: list.hpp 49267 2008-10-11 06:19:02Z agurtovoy $
18 # include <boost/mpl/limits/list.hpp>
28 BOOST_PP_CAT(list,BOOST_MPL_LIMIT_LIST_SIZE).hpp \
32 BOOST_PP_CAT(list,BOOST_MPL_LIMIT_LIST_SIZE)##.hpp \
36 # include BOOST_PP_STRINGIZE(boost/mpl/list/AUX778076_LIST_HEADER)
45 # define BOOST_MPL_PREPROCESSED_HEADER list.hpp
50 # include <boost/mpl/limits/list.hpp>
52 # define AUX778076_SEQUENCE_NAME list
|
| /system/core/toolbox/ |
| getprop.c | 11 strlist_t* list = opaque; local
14 strlist_append_dup(list, temp);
19 strlist_t list[1] = { STRLIST_INITIALIZER }; local
21 /* Record properties in the string list */
22 (void)property_list(record_prop, list);
25 strlist_sort(list);
28 STRLIST_FOREACH(list, str, printf("%s\n", str));
31 strlist_done(list);
|
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_ListTest.java | 21 import java.util.List;
27 List<Integer> list; // must contain the Integers 0 to 99 in order field in class:Support_ListTest
33 public Support_ListTest(String p1, List<Integer> l) {
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)))
[all...] |
| /libcore/support/src/test/java/tests/support/ |
| Support_ListTest.java | 21 import java.util.List;
27 List<Integer> list; // must contain the Integers 0 to 99 in order field in class:Support_ListTest
33 public Support_ListTest(String p1, List<Integer> l) {
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)))
[all...] |
| /hardware/ti/omap3/omx/system/src/openmax_il/common/inc/ |
| OMX_TI_Debug.h | 285 * format, list - debug message
290 #define OMX_DBG_PRINT(file, domain, level, mask, format, list...) \
294 format OMX_DBG_FN OMX_DBG_LINE, ##list); \
297 #define OMX_DBG_PRINT(file, domain, level, mask, format, list...) \
302 format OMX_DBG_FN OMX_DBG_LINE, ##list); \
306 format OMX_DBG_FN OMX_DBG_LINE, ##list); \
312 #define OMX_DBG_PRINT(file, domain, level, mask, format, list...) \
317 format OMX_DBG_FN OMX_DBG_LINE, ##list); \
324 #define OMX_DBG_PRINT(file, domain, level, mask, format, list...) \
329 format, OMX_DBG_FN OMX_DBG_LINE ##list); \
[all...] |
