/external/stlport/test/unit/ |
H A D | list_header_test.cpp | 8 #include <list>
|
/external/clang/test/CodeGen/ |
H A D | 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 };
|
H A D | 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*)mallo [all...] |
/external/v8/test/cctest/ |
H A D | 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); 65 list 145 List<int>* list = new List<int>(0); local [all...] |
H A D | test-ast.cc | 7 // notice, this list of conditions and the following disclaimer. 9 // copyright notice, this list of conditions and the following 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)); 48 CHECK_EQ(node, list->last()); 52 list->Add(node); 54 CHECK_EQ(1 + kElements, list [all...] |
/external/qemu/ |
H A D | notify.c | 17 void notifier_list_init(NotifierList *list) argument 19 QTAILQ_INIT(&list->notifiers); 22 void notifier_list_add(NotifierList *list, Notifier *notifier) argument 24 QTAILQ_INSERT_HEAD(&list->notifiers, notifier, node); 27 void notifier_list_remove(NotifierList *list, Notifier *notifier) argument 29 QTAILQ_REMOVE(&list->notifiers, notifier, node); 32 void notifier_list_notify(NotifierList *list) argument 36 QTAILQ_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
|
H A D | notify.h | 35 void notifier_list_init(NotifierList *list); 37 void notifier_list_add(NotifierList *list, Notifier *notifier); 39 void notifier_list_remove(NotifierList *list, Notifier *notifier); 41 void notifier_list_notify(NotifierList *list);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
H A D | ListExtensions.cs | 14 * notice, this list of conditions and the following disclaimer. 16 * notice, this list of conditions and the following disclaimer in the 47 public static bool add( this IList list, object value ) argument 49 int count = list.Count; 50 list.Add( value ); 51 return list.Count == count + 1; 55 public static void add<T>( this ICollection<T> list, T value ) argument 57 list.Add( value ); 61 public static void add<T>( this List<T> list, T value ) argument 63 list 67 add( this IList list, int index, object value ) argument 73 addAll( this List<object> list, IEnumerable items ) argument 79 addAll( this IList list, IEnumerable items ) argument 85 addAll( this ICollection<T> list, IEnumerable<T> items ) argument 93 addElement( this List<object> list, object value ) argument 105 contains( this IList list, object value ) argument 111 contains( this ICollection<T> list, T value ) argument 117 elementAt( this IList<T> list, int index ) argument 123 get( this IList list, int index ) argument 129 get( this IList<T> list, int index ) argument 136 get( this List<T> list, int index ) argument 142 remove( this IList list, int index ) argument 150 remove( this IList<T> list, T item ) argument 156 set( this IList list, int index, object value ) argument 162 set( this IList<T> list, int index, T value ) argument 168 set( this List<T> list, int index, T value ) argument 174 setSize( this List<T> list, int size ) argument 206 subList( this IList list, int fromIndex, int toIndex ) argument 217 subList( this IList<T> list, int fromIndex, int toIndex ) argument 227 subList( this List<T> list, int fromIndex, int toIndex ) argument [all...] |
/external/libppp/src/ |
H A D | 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) argument 58 list->cur.pos = -1; 62 iplist_setrange(struct iplist *list, char *range) argument 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 99 iplist_nextrange(struct iplist *list) argument 128 iplist_next(struct iplist *list) argument 150 iplist_setsrc(struct iplist *list, const char *src) argument 165 iplist_reset(struct iplist *list) argument 173 iplist_setcurpos(struct iplist *list, long pos) argument 201 iplist_setrandpos(struct iplist *list) argument 208 iplist_ip2pos(struct iplist *list, struct in_addr ip) argument [all...] |
/external/chromium/base/ |
H A D | linked_list_unittest.cc | 34 // Checks that when iterating |list| (either from head to tail, or from 37 void ExpectListContentsForDirection(const LinkedList<Node>& list, argument 40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); 41 node != list.end(); 51 void ExpectListContents(const LinkedList<Node>& list, argument 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 72 LinkedList<Node> list; local 107 LinkedList<Node> list; local 182 LinkedList<Node> list; local 219 LinkedList<Node> list; local [all...] |
/external/qemu/android/utils/ |
H A D | list.h | 17 /* Encapsulates a double-linked, circular list. 18 * The list is organized in the following way: 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. 29 /* Next entry in the list */ 37 alist_init(ACList* list) argument 44 alist_is_empty(const ACList* list) argument 51 alist_insert_head(ACList* list, ACList* entry) argument 61 alist_insert_tail(ACList* list, ACList* entry) argument 85 alist_remove_head(ACList* list) argument 100 alist_remove_tail(ACList* list) argument [all...] |
/external/chromium/net/websockets/ |
H A D | 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 [all...] |
/external/srec/seti/sltsEngine/src/ |
H A D | 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) argument 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 192 Delete(LList *list) argument [all...] |
/external/wpa_supplicant_8/hostapd/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/wpa_supplicant_8/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/wpa_supplicant_8/wpa_supplicant/src/utils/ |
H A D | list.h | 2 * Doubly-linked list 13 * struct dl_list - Doubly-linked list 20 static inline void dl_list_init(struct dl_list *list) argument 22 list->next = list; 23 list->prev = list; 26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item) argument 28 item->next = list->next; 29 item->prev = list; 34 dl_list_add_tail(struct dl_list *list, struct dl_list *item) argument 47 dl_list_empty(struct dl_list *list) argument 52 dl_list_len(struct dl_list *list) argument [all...] |
/external/webkit/Source/WebKit2/UIProcess/API/C/ |
H A D | 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, unsigne [all...] |
/external/webkit/Source/WebKit2/WebProcess/InjectedBundle/API/c/ |
H A D | 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);
|
/external/chromium/net/proxy/ |
H A D | proxy_list_unittest.cc | 45 // If the proxy list string parsed to empty, automatically fall-back to 59 ProxyList list; local 60 list.SetFromPacString(tests[i].pac_input); 61 EXPECT_EQ(tests[i].pac_output, list.ToPacString()); 62 EXPECT_FALSE(list.IsEmpty()); 85 ProxyList list; local 86 list.SetFromPacString(tests[i].pac_input); 87 list.RemoveProxiesWithoutScheme(tests[i].filter); 88 EXPECT_EQ(tests[i].filtered_pac_output, list.ToPacString()); 101 ProxyList list; local 113 ProxyList list; local 130 ProxyList list; local [all...] |
/external/javassist/src/main/javassist/compiler/ast/ |
H A D | ASTList.java | 21 * A linked list. 53 * Returns the car part of the list. 62 * Returns the cdr part of the list. 77 ASTList list = this; 78 while (list != null) { 80 ASTree a = list.left; 82 list = list.right; 90 * Returns the number of the elements in this list. 96 public static int length(ASTList list) { argument [all...] |
/external/freetype/src/cache/ |
H A D | ftcmru.c | 169 FTC_MruList_Init( FTC_MruList list, argument 175 list->num_nodes = 0; 176 list->max_nodes = max_nodes; 177 list->nodes = NULL; 178 list->clazz = *clazz; 179 list->data = data; 180 list->memory = memory; 185 FTC_MruList_Reset( FTC_MruList list ) 187 while ( list->nodes ) 188 FTC_MruList_Remove( list, lis 308 FTC_MruList_Remove( FTC_MruList list, FTC_MruNode node ) argument 327 FTC_MruList_RemoveSelection( FTC_MruList list, FTC_MruNode_CompareFunc selection, FT_Pointer key ) argument [all...] |
/external/openfst/src/include/fst/ |
H A D | slist.h | 18 // Includes slist definition or defines in terms of STL list as a fallback. 37 #include <list> 41 using std::list; 43 template <typename T> class slist : public list<T> { 45 typedef typename list<T>::iterator iterator; 46 typedef typename list<T>::const_iterator const_iterator; 48 using list<T>::erase;
|
/external/stlport/test/compiler/ |
H A D | movable.cpp | 1 #include <list> 14 list<S> l;
|
/external/chromium/chrome/browser/sync/ |
H A D | js_arg_list_unittest.cc | 21 scoped_ptr<ListValue> list(new ListValue()); 22 list->Append(Value::CreateBooleanValue(false)); 23 list->Append(Value::CreateIntegerValue(5)); 25 list->Append(dict); 29 JsArgList arg_list(*list); 32 scoped_ptr<ListValue> list_copy(list->DeepCopy()); 33 list.reset(); 51 ListValue list; local 52 list.Append(bool_value.DeepCopy()); 53 list [all...] |
/external/mockito/src/org/mockito/internal/util/collections/ |
H A D | IdentitySet.java | 12 LinkedList list = new LinkedList();
field in class:IdentitySet 15 for(Object existing:list) {
24 list.add(o);
|