| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
| erase_iter_db1.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int>::const_iterator i = l1.end();
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
36 std::list<int, min_allocator<int>> l1(a1, a1+3);
37 std::list<int, min_allocator<int>>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/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/python/cpython2/Demo/tkinter/guido/ |
| listtree.py | 0 # List a remote app's widget tree (names and classes only)
9 list = Listbox(master, name='list')
10 list.pack(expand=1, fill=BOTH)
11 listnodes(list, app, '.', 0)
12 return list
14 def listnodes(list, app, widget, level):
15 klass = list.send(app, 'winfo', 'class', widget)
17 ## list.insert(END, '%s%s (%s)' % ((level-1)*'. ', widget[i:], klass))
18 list.insert(END, '%s (%s)' % (widget, klass)
[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...] |
| /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...] |
| /prebuilts/ndk/r11/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/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/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/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/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/ |
| pop_back.pass.cpp | 10 // <list>
14 #include <list>
24 std::list<int> c(a, a+3);
26 assert(c == std::list<int>(a, a+2));
28 assert(c == std::list<int>(a, a+1));
35 std::list<int, min_allocator<int>> c(a, a+3);
37 assert((c == std::list<int, min_allocator<int>>(a, a+2)));
39 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/mockito/src/test/java/org/mockitousage/junitrunner/ |
| JUnit45RunnerTest.java | 13 import java.util.List;
23 @Mock private List<String> list; field in class:JUnit45RunnerTest
27 list.add("test");
28 verify(list).add("test");
33 assertNotNull(list);
34 assertSame(list, listDependent.getList());
47 private List<?> list; field in class:JUnit45RunnerTest.ListDependent
49 public List<?> getList()
[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...] |
| /external/syslinux/core/thread/ |
| timeout.c | 24 for (tp = curr->list.next; tp != &curr->list; tp = tp->next) {
25 t = container_of(tp, struct thread, list);
30 block->list.next->prev = block->list.prev;
31 block->list.prev->next = block->list.next;
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/volume/ |
| Events.java | 110 public static void writeEvent(Context context, int tag, Object... list) {
113 if (list != null && list.length > 0) {
119 (Boolean) list[1] ? 1 : 0);
120 sb.append(SHOW_REASONS[(Integer) list[0]]).append(" keyguard=").append(list[1]);
124 (Boolean) list[0]);
125 sb.append(list[0]);
129 sb.append(DISMISS_REASONS[(Integer) list[0]]);
133 (Integer) list[0])
[all...] |
| /prebuilts/misc/darwin-x86_64/freetype/include/freetype2/ |
| 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...] |
| /prebuilts/ndk/r11/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...] |
