| /external/stlport/test/unit/ |
| list_header_test.cpp | 8 #include <list>
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| list_header_test.cpp | 8 #include <list>
|
| /ndk/tests/device/test-stlport/unit/ |
| list_header_test.cpp | 8 #include <list>
|
| /external/clang/test/CodeGen/ |
| 2002-08-19-RecursiveLocals.c | 5 struct list { struct
7 struct list *Next;
10 static struct list B; /* Forward declare static */
11 static struct list A = { 7, &B };
12 static struct list B = { 8, &A };
14 extern struct list D; /* forward declare normal var */
16 struct list C = { 7, &D };
17 struct list D = { 8, &C };
|
| 2002-07-14-MiscListTests.c | 3 // Test list stuff
7 // Test opaque structure support. the list type is defined later
8 struct list;
10 struct list *PassThroughList(struct list *L) {
17 typedef struct list { struct
19 struct list *Next;
20 } list; typedef in typeref:struct:list
22 list *Data;
28 Data = (list*)malloc(12); // This is not a proper list allocatio
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
| container.fail.cpp | 19 #include <list>
23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
|
| /external/v8/test/cctest/ |
| test-list.cc | 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
54 // Check that we can add (a reference to) an element of the list
57 // Add elements to the list to grow it to its capacity.
58 List<int, ZeroingAllocationPolicy> list(4);
59 list.Add(1);
60 list.Add(2);
61 list.Add(3);
62 list.Add(4)
145 List<int>* list = new List<int>(0); local
[all...] |
| test-ast.cc | 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
37 TEST(List) {
39 List<AstNode*>* list = new List<AstNode*>(0); local
40 CHECK_EQ(0, list->length());
45 list->Add(node);
46 CHECK_EQ(1, list->length());
47 CHECK_EQ(node, list->at(0))
[all...] |
| /external/qemu/ |
| notify.c | 17 void notifier_list_init(NotifierList *list)
19 QTAILQ_INIT(&list->notifiers);
22 void notifier_list_add(NotifierList *list, Notifier *notifier)
24 QTAILQ_INSERT_HEAD(&list->notifiers, notifier, node);
27 void notifier_list_remove(NotifierList *list, Notifier *notifier)
29 QTAILQ_REMOVE(&list->notifiers, notifier, node);
32 void notifier_list_notify(NotifierList *list)
36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
| /system/core/include/cutils/ |
| list.h | 41 #define list_for_each(node, list) \
42 for (node = (list)->next; node != (list); node = node->next)
44 #define list_for_each_reverse(node, list) \
45 for (node = (list)->prev; node != (list); node = node->prev)
47 void list_init(struct listnode *list);
48 void list_add_tail(struct listnode *list, struct listnode *item);
51 #define list_empty(list) ((list) == (list)->next
[all...] |
| /external/libppp/src/ |
| iplist.c | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
56 iplist_first(struct iplist *list)
58 list->cur.pos = -1;
62 iplist_setrange(struct iplist *list, char *range)
67 if (!inet_aton(range, &list->cur.ip))
69 list->cur.lstart = ntohl(list->cur.ip.s_addr);
70 list->cur.nItems = 1;
72 if (!do_inet_aton(range, ptr, &list->cur.ip)
[all...] |
| /external/chromium/base/ |
| linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from
37 void ExpectListContentsForDirection(const LinkedList<Node>& list,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
41 node != list.end();
51 void ExpectListContents(const LinkedList<Node>& list,
56 ExpectListContentsForDirection(list, num_nodes, node_ids, true);
60 ExpectListContentsForDirection(list, num_nodes, node_ids, false);
65 LinkedList<Node> list; local
66 EXPECT_EQ(list.end(), list.head())
72 LinkedList<Node> list; local
107 LinkedList<Node> list; local
182 LinkedList<Node> list; local
219 LinkedList<Node> list; local
[all...] |
| /packages/apps/Email/tests/src/com/android/email/mail/store/imap/ |
| ImapListTest.java | 37 ImapList list = new ImapList(); local
39 assertTrue(list.isList());
40 assertFalse(list.isString());
42 assertTrue(list.isEmpty());
43 assertEquals(0, list.size());
45 list.add(STRING_1);
46 assertFalse(list.isEmpty());
47 assertEquals(1, list.size());
49 list.add(STRING_2);
50 assertEquals(2, list.size())
65 ImapList list = buildList(ImapList.EMPTY, ABC, LIST_1, ImapString.EMPTY); local
96 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
109 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
122 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
139 ImapList list = buildList( local
166 ImapList list = buildList(K1, LIST_1); local
179 ImapList list = buildList(K1, STRING_1); local
195 ImapList list = buildList(K1, K2, K3); local
[all...] |
| /external/qemu/android/utils/ |
| list.h | 17 /* Encapsulates a double-linked, circular list.
18 * The list is organized in the following way:
19 * - List entries contain references to the next, and the previous entry in the
20 * list.
21 * - The list is circular, i.e. the "last" list entry references the "list head"
22 * in its 'next' reference, and the "list head" references the "last" entry in
24 * - The list is empty if its 'next' and 'previous' references are addressing the
25 * head of the list
[all...] |
| /external/chromium/net/websockets/ |
| websocket_net_log_params_unittest.cc | 14 ListValue* list = new ListValue(); local
15 list->Append(new StringValue("GET /demo HTTP/1.1"));
16 list->Append(new StringValue("Host: example.com"));
17 list->Append(new StringValue("Connection: Upgrade"));
18 list->Append(new StringValue("Sec-WebSocket-Key2: 12998 5 Y3 1 .P00"));
19 list->Append(new StringValue("Sec-WebSocket-Protocol: sample"));
20 list->Append(new StringValue("Upgrade: WebSocket"));
21 list->Append(new StringValue("Sec-WebSocket-Key1: 4 @1 46546xW%0l 1 5"));
22 list->Append(new StringValue("Origin: http://example.com"));
23 list->Append(new StringValue(""))
[all...] |
| /external/srec/seti/sltsEngine/src/ |
| linklist_impl.c | 33 1. pool of linked list nodes - from static allocated array
121 For now, dynamically allocate a new list node with the data
123 LListResult Insert(LList *list, void *data)
131 if(list->head == NULL){
132 /* if list is empty, assign to head */
133 list->head = newnode;
134 (list->head)->next = NULL;
135 (list->head)->prev = NULL;
138 list->curr = list->head
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.modifiers/ |
| push_back.pass.cpp | 10 // <list>
14 #include <list>
19 std::list<int> c;
23 assert(c == std::list<int>(a, a+5));
|
| push_front.pass.cpp | 10 // <list>
14 #include <list>
19 std::list<int> c;
23 assert(c == std::list<int>(a, a+5));
|
| clear.pass.cpp | 10 // <list>
14 #include <list>
20 std::list<int> c(a, a+3);
|
| pop_back.pass.cpp | 10 // <list>
14 #include <list>
20 std::list<int> c(a, a+3);
22 assert(c == std::list<int>(a, a+2));
24 assert(c == std::list<int>(a, a+1));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/ |
| remove.pass.cpp | 10 // <list>
14 #include <list>
21 std::list<int> c(a1, a1+4);
23 assert(c == std::list<int>(a2, a2+3));
|
| unique.pass.cpp | 10 // <list>
14 #include <list>
21 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
23 assert(c == std::list<int>(a2, a2+4));
|
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
20 static inline void dl_list_init(struct dl_list *list)
22 list->next = list;
23 list->prev = list;
26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
28 item->next = list->next;
29 item->prev = list;
[all...] |
| /external/webkit/Source/WebKit2/UIProcess/API/C/ |
| WKBackForwardList.h | 8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
37 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetCurrentItem(WKBackForwardListRef list);
38 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetBackItem(WKBackForwardListRef list);
39 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetForwardItem(WKBackForwardListRef list);
40 WK_EXPORT WKBackForwardListItemRef WKBackForwardListGetItemAtIndex(WKBackForwardListRef list, int index);
42 WK_EXPORT unsigned WKBackForwardListGetBackListCount(WKBackForwardListRef list);
43 WK_EXPORT unsigned WKBackForwardListGetForwardListCount(WKBackForwardListRef list);
45 WK_EXPORT WKArrayRef WKBackForwardListCopyBackListWithLimit(WKBackForwardListRef list, unsigned limit);
46 WK_EXPORT WKArrayRef WKBackForwardListCopyForwardListWithLimit(WKBackForwardListRef list, unsigned limit)
[all...] |
| /external/webkit/Source/WebKit2/WebProcess/InjectedBundle/API/c/ |
| WKBundleBackForwardList.h | 8 * notice, this list of conditions and the following disclaimer.
10 * notice, this list of conditions and the following disclaimer in the
37 WK_EXPORT WKBundleBackForwardListItemRef WKBundleBackForwardListCopyItemAtIndex(WKBundleBackForwardListRef list, int index);
39 WK_EXPORT unsigned WKBundleBackForwardListGetBackListCount(WKBundleBackForwardListRef list);
40 WK_EXPORT unsigned WKBundleBackForwardListGetForwardListCount(WKBundleBackForwardListRef list);
42 WK_EXPORT void WKBundleBackForwardListClear(WKBundleBackForwardListRef list);
|
