Searched refs:list (Results 26 - 50 of 3732) sorted by relevance

1234567891011>>

/external/wpa_supplicant_8/hostapd/src/utils/
H A Dlist.h2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list) argument
24 list->next = list;
25 list->prev = list;
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument
30 item->next = list->next;
31 item->prev = list;
36 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument
49 dl_list_empty(struct dl_list *list) argument
54 dl_list_len(struct dl_list *list) argument
[all...]
/external/wpa_supplicant_8/src/utils/
H A Dlist.h2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list) argument
24 list->next = list;
25 list->prev = list;
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument
30 item->next = list->next;
31 item->prev = list;
36 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument
49 dl_list_empty(struct dl_list *list) argument
54 dl_list_len(struct dl_list *list) argument
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Dlist.h2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list) argument
24 list->next = list;
25 list->prev = list;
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument
30 item->next = list->next;
31 item->prev = list;
36 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument
49 dl_list_empty(struct dl_list *list) argument
54 dl_list_len(struct dl_list *list) argument
[all...]
/external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/
H A DListOrganizer.java26 private List<ElementType> list; field in class:ListOrganizer
28 public ListOrganizer(List<ElementType> list) { argument
29 this.list = list;
34 if(list.remove(element)) {
35 list.add(list.size(), element);
48 list.remove(objectToMove);
49 int refIndex = list.indexOf(reference);
50 list
[all...]
/external/libpng/tests/
H A Dpngimage-full2 exec ./pngimage --exhaustive --list-combos --log "${srcdir}/contrib/pngsuite/"*.png
H A Dpngimage-quick2 exec ./pngimage --list-combos --log "${srcdir}/contrib/pngsuite/"*.png
/external/toybox/toys/other/
H A Dwhich.c25 struct string_list *list; local
43 list = find_in_path(getenv("PATH"), filename);
44 if (!list) return 1;
47 while (list) {
48 if (!access(list->str, X_OK)) {
49 puts(list->str);
52 llist_traverse(list, free);
56 free(llist_pop(&list));
/external/libdrm/tests/
H A Ddrmsl.c1 /* drmsl.c -- Skip list test
30 * This file contains a straightforward skip list implementation.n
47 static void print(void* list) argument
52 if (drmSLFirst(list, &key, &value)) {
55 } while (drmSLNext(list, &key, &value));
61 void *list; local
71 list = drmSLCreate();
76 drmSLInsert(list, keys[i], NULL);
80 if (drmSLFirst(list, &key, &value)) {
86 } while (drmSLNext(list,
109 print_neighbors(void *list, unsigned long key) argument
126 void* list; local
[all...]
/external/libcxx/test/std/containers/sequences/list/list.cons/
H A Dcopy.pass.cpp10 // <list>
12 // list(const list& c);
14 #include <list>
25 std::list<int> l(3, 2);
26 std::list<int> l2 = l;
30 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
31 std::list<int, test_allocator<int> > l2 = l;
37 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
38 std::list<in
[all...]
/external/mockito/src/test/java/org/mockitousage/bugs/
H A DMultipleInOrdersTest.java21 List<String> list= mock(List.class);
23 list.add("a");
24 list.add("x");
25 list.add("b");
26 list.add("y");
28 InOrder inOrder = inOrder(list);
29 InOrder inAnotherOrder = inOrder(list);
32 inOrder.verify(list).add("a");
33 inOrder.verify(list).add("b");
35 inAnotherOrder.verify(list)
[all...]
/external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/table/
H A DSortIndexTest.java48 final List<Integer> list = createList(1);
49 index.init(list);
50 assertSequence(list);
55 final List<Integer> list = createList(20);
56 index.init(list);
57 assertSequence(list);
63 final List<Integer> list = createList(20);
64 index.init(list);
65 assertSequence(list);
70 final List<Integer> list
92 assertSequence(List<Integer> list) argument
[all...]
/external/curl/lib/
H A Dllist.c48 struct curl_llist *list; local
50 list = malloc(sizeof(struct curl_llist));
51 if(!list)
54 llist_init(list, dtor);
56 return list;
62 * Inserts a new list element after the given one 'e'. If the given existing
63 * entry is NULL and the list already has elements, the new one will be
64 * inserted first in the list.
71 Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e, argument
79 if(list
112 Curl_llist_remove(struct curl_llist *list, struct curl_llist_element *e, void *user) argument
147 Curl_llist_destroy(struct curl_llist *list, void *user) argument
158 Curl_llist_count(struct curl_llist *list) argument
166 Curl_llist_move(struct curl_llist *list, struct curl_llist_element *e, struct curl_llist *to_list, struct curl_llist_element *to_e) argument
[all...]
/external/libcxx/test/libcxx/containers/sequences/list/list.cons/
H A Ddb_move.pass.cpp12 // <list>
14 // list(list&& c);
19 #include <list>
28 std::list<int> l1 = {1, 2, 3};
29 std::list<int>::iterator i = l1.begin();
30 std::list<int> l2 = std::move(l1);
/external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/
H A Derase_iter_db2.pass.cpp10 // <list>
17 #include <list>
24 std::list<int> l1(a1, a1+3);
25 std::list<int> l2(a1, a1+3);
26 std::list<int>::const_iterator i = l2.begin();
H A Dinsert_iter_size_value_db1.pass.cpp10 // <list>
17 #include <list>
23 std::list<int> c1(100);
24 std::list<int> c2;
25 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
/external/libcxx/test/libcxx/containers/sequences/list/
H A Dversion.pass.cpp10 // <list>
12 #include <list>
/external/libcxx/test/std/utilities/optional/optional.syn/
H A Doptional_includes_initializer_list.pass.cpp21 std::initializer_list<int> list;
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value) argument
49 if (*list == NULL) {
50 *list = new_value;
54 for (temp = *list; temp->Next; temp = temp->Next);
60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value) argument
62 if (*list == rm_value) {
63 *list = rm_value->Next;
73 unsigned int rc_list_count(struct rc_list * list) argument
76 while (list) {
78 list
83 rc_list_print(struct rc_list * list) argument
[all...]
H A Dradeon_list.h40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value);
41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value);
42 unsigned int rc_list_count(struct rc_list * list);
43 void rc_list_print(struct rc_list * list);
/external/selinux/restorecond/
H A Dstringslist.h31 void strings_list_free(struct stringsList *list);
32 void strings_list_add(struct stringsList **list, const char *string);
33 void strings_list_print(struct stringsList *list);
34 int strings_list_find(struct stringsList *list, const char *string, int *exact);
/external/libcap/libcap/
H A D_makenames.c19 } const list[] = { variable
20 #include "cap_names.list.h"
31 for ( i=0; list[i].index >= 0 && list[i].name; ++i ) {
32 if (maxcaps <= list[i].index) {
33 maxcaps = list[i].index + 1;
35 pointers[list[i].index] = list[i].name;
/external/libdrm/tests/radeon/
H A Dradeon_ttm.c37 struct list_head list; local
42 list_inithead(&list);
50 list_add(&bo->list, &list);
52 LIST_FOR_EACH_ENTRY_SAFE(bo, tmp, &list, list) {
53 list_del(&bo->list);
/external/protobuf/java/core/src/test/java/com/google/protobuf/
H A DLazyStringArrayListTest.java10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
58 LazyStringArrayList list = new LazyStringArrayList();
59 list.add(STRING_A);
60 list.add(STRING_B);
61 list.add(STRING_C);
63 assertEquals(3, list.size());
64 assertSame(STRING_A, list.get(0));
65 assertSame(STRING_B, list.get(1));
66 assertSame(STRING_C, list
284 assertGenericListImmutable(List<T> list, T value) argument
[all...]
/external/ltp/tools/pounder21/
H A Dproclist.c1 /* Manage a list of processes. */
25 void add_to_proclist(struct proclist_t *list, struct proclist_item_t *item) argument
29 if (list->head == NULL) {
31 list->head = item;
35 curr = list->head;
44 void remove_from_proclist(struct proclist_t *list, struct proclist_item_t *item) argument
48 if (list->head == NULL) {
52 if (list->head == item) {
53 list->head = item->next;
58 prev = list
[all...]
/external/libcxx/test/std/containers/sequences/list/list.modifiers/
H A Dpush_back.pass.cpp10 // <list>
14 #include <list>
22 std::list<int> c;
26 assert(c == std::list<int>(a, a+5));
30 std::list<int, min_allocator<int>> c;
34 assert((c == std::list<int, min_allocator<int>>(a, a+5)));

Completed in 2022 milliseconds

1234567891011>>