Searched refs:list (Results 1 - 25 of 4308) sorted by relevance

1234567891011>>

/external/stlport/test/unit/
H A Dlist_header_test.cpp8 #include <list>
/external/clang/test/CodeGen/
H A D2002-08-19-RecursiveLocals.c5 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 D2002-07-14-MiscListTests.c3 // 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/chromium_org/net/spdy/
H A Dwrite_blocked_list_test.cc17 IntWriteBlockedList list; local
18 EXPECT_FALSE(list.HasWriteBlockedStreams());
19 list.PushBack(1, 1);
20 EXPECT_TRUE(list.HasWriteBlockedStreams());
21 EXPECT_EQ(1, list.GetHighestPriorityWriteBlockedList());
22 list.PushBack(1, 0);
23 EXPECT_TRUE(list.HasWriteBlockedStreams());
24 EXPECT_EQ(0, list.GetHighestPriorityWriteBlockedList());
28 IntWriteBlockedList list; local
29 list
38 IntWriteBlockedList list; local
57 IntWriteBlockedList list; local
[all...]
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-299979.js7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
31 var list = Object.freeze([1, 2, 3]);
32 assertThrows(function() { list.unshift(4); }, TypeError);
33 assertThrows(function() { list.shift(); }, TypeError);
/external/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/
H A Dcontainer.fail.cpp19 #include <list>
23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
/external/smali/util/src/test/java/org/jf/util/
H A DLinearSearchTest.java10 * notice, this list of conditions and the following disclaimer.
12 * copyright notice, this list of conditions and the following disclaimer
44 List<Integer> list = Lists.newArrayList(0, 1, 3, 4);
46 doTest(list, 5, 10);
47 doTest(list, 5, 4);
48 doTest(list, 5, 3);
49 doTest(list, 5, 2);
50 doTest(list, 5, 1);
51 doTest(list, 5, 0);
53 doTest(list,
96 doTest(List<Integer> list, int key, int guess) argument
[all...]
/external/chromium_org/gpu/config/
H A Dgpu_blacklist.cc20 GpuBlacklist* list = new GpuBlacklist(); local
21 list->AddSupportedFeature("accelerated_2d_canvas",
23 list->AddSupportedFeature("gpu_compositing",
25 list->AddSupportedFeature("webgl",
27 list->AddSupportedFeature("flash_3d",
29 list->AddSupportedFeature("flash_stage3d",
31 list->AddSupportedFeature("flash_stage3d_baseline",
33 list->AddSupportedFeature("accelerated_video_decode",
35 list->AddSupportedFeature("accelerated_video_encode",
37 list
[all...]
/external/clang/test/Analysis/
H A Dkmalloc-linux.c16 struct test **list, *t; local
19 list = kmalloc(sizeof(*list) * 10, __GFP_ZERO);
20 if (list == NULL)
24 t = list[i];
27 free(list); // no-warning
31 struct test **list, *t; local
34 list = kmalloc(sizeof(*list) * 10, 0);
35 if (list
46 struct test **list, *t; local
[all...]
H A Dmalloc-three-arg.c16 struct test **list, *t; local
19 list = malloc(sizeof(*list) * 10, NULL, M_ZERO);
20 if (list == NULL)
24 t = list[i];
27 free(list); // no-warning
31 struct test **list, *t; local
34 list = malloc(sizeof(*list) * 10, NULL, 0);
35 if (list
46 struct test **list, *t; local
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DListExtensions.cs14 * 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/chromium_org/v8/test/cctest/
H A Dtest-list.cc7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
55 // Check that we can add (a reference to) an element of the list
58 // Add elements to the list to grow it to its capacity.
59 List<int, ZeroingAllocationPolicy> list(4);
60 list.Add(1);
61 list.Add(2);
62 list.Add(3);
63 list.Add(4);
66 list
159 List<int>* list = new List<int>(0); local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_simple_list.h5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
41 * Remove an element from list.
54 * Insert an element to the list head.
56 * \param list list.
59 #define insert_at_head(list, elem) \
61 (elem)->prev = list; \
62 (elem)->next = (list)->next; \
63 (list)
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dsimple_list.h5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
50 * Remove an element from list.
61 * Insert an element to the list head.
63 * \param list list.
66 #define insert_at_head(list, elem) \
68 (elem)->prev = list; \
69 (elem)->next = (list)->next; \
70 (list)
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_simple_list.h5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
41 * Remove an element from list.
54 * Insert an element to the list head.
56 * \param list list.
59 #define insert_at_head(list, elem) \
61 (elem)->prev = list; \
62 (elem)->next = (list)->next; \
63 (list)
[all...]
/external/mesa3d/src/mesa/main/
H A Dsimple_list.h5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
50 * Remove an element from list.
61 * Insert an element to the list head.
63 * \param list list.
66 #define insert_at_head(list, elem) \
68 (elem)->prev = list; \
69 (elem)->next = (list)->next; \
70 (list)
[all...]
/external/chromium_org/third_party/android_crazy_linker/src/src/
H A Dcrazy_linker_search_path_list_unittest.cpp33 SearchPathList list; local
34 EXPECT_FALSE(list.FindFile("/foo"));
35 EXPECT_FALSE(list.FindFile("/tmp/zoo"));
36 EXPECT_FALSE(list.FindFile("/tmp/foo/bar"));
41 SearchPathList list; local
42 list.AddPaths("/tmp/foo");
43 EXPECT_STREQ("/tmp/foo/bar", list.FindFile("bar"));
44 EXPECT_FALSE(list.FindFile("zoo"));
45 EXPECT_FALSE(list.FindFile("foo"));
50 SearchPathList list; local
60 SearchPathList list; local
68 SearchPathList list; local
80 SearchPathList list; local
[all...]
/external/bluetooth/bluedroid/osi/include/
H A Dlist.h17 void list_free(list_t *list);
20 bool list_is_empty(const list_t *list);
21 size_t list_length(const list_t *list);
22 void *list_front(const list_t *list);
23 void *list_back(const list_t *list);
26 bool list_insert_after(list_t *list, list_node_t *prev_node, void *data);
27 bool list_prepend(list_t *list, void *data);
28 bool list_append(list_t *list, void *data);
29 bool list_remove(list_t *list, void *data);
30 void list_clear(list_t *list);
[all...]
/external/chromium_org/tools/clang/rewrite_scoped_refptr/tests/
H A Dtest11-expected.cc16 FooList list; local
17 list.push_back(new Foo);
18 list.push_back(new Foo);
19 for (FooList::const_iterator it = list.begin(); it != list.end(); ++it) {
H A Dtest11-original.cc16 FooList list; local
17 list.push_back(new Foo);
18 list.push_back(new Foo);
19 for (FooList::const_iterator it = list.begin(); it != list.end(); ++it) {
/external/bluetooth/bluedroid/osi/src/
H A Dlist.c3 #include "list.h"
18 static list_node_t *list_free_node_(list_t *list, list_node_t *node);
20 // Returns a new, empty list. Returns NULL if not enough memory could be allocated
21 // for the list structure. The returned list must be freed with |list_free|. The
22 // |callback| specifies a function to be called whenever a list element is removed
23 // from the list. It can be used to release resources held by the list element, e.g.
27 list_t *list = (list_t *)calloc(sizeof(list_t), 1); local
28 if (list)
35 list_free(list_t *list) argument
45 list_is_empty(const list_t *list) argument
51 list_length(const list_t *list) argument
58 list_front(const list_t *list) argument
67 list_back(const list_t *list) argument
74 list_insert_after(list_t *list, list_node_t *prev_node, void *data) argument
96 list_prepend(list_t *list, void *data) argument
116 list_append(list_t *list, void *data) argument
141 list_remove(list_t *list, void *data) argument
169 list_clear(list_t *list) argument
183 list_foreach(const list_t *list, list_iter_cb callback) argument
197 list_begin(const list_t *list) argument
206 list_end(UNUSED_ATTR const list_t *list) argument
227 list_free_node_(list_t *list, list_node_t *node) argument
[all...]
/external/qemu/android/utils/
H A Dlist.h21 /* Encapsulates a double-linked, circular list.
22 * The list is organized in the following way:
24 * list.
25 * - The list is circular, i.e. the "last" list entry references the "list head"
26 * in its 'next' reference, and the "list head" references the "last" entry in
28 * - The list is empty if its 'next' and 'previous' references are addressing the
29 * head of the list.
33 /* Next entry in the list */
41 alist_init(ACList* list) argument
48 alist_is_empty(const ACList* list) argument
55 alist_insert_head(ACList* list, ACList* entry) argument
65 alist_insert_tail(ACList* list, ACList* entry) argument
89 alist_remove_head(ACList* list) argument
104 alist_remove_tail(ACList* list) argument
[all...]
/external/chromium_org/net/websockets/
H A Dwebsocket_net_log_params_test.cc15 base::ListValue* list = new base::ListValue(); local
16 list->Append(new base::StringValue("GET /demo HTTP/1.1"));
17 list->Append(new base::StringValue("Host: example.com"));
18 list->Append(new base::StringValue("Connection: Upgrade"));
19 list->Append(new base::StringValue("Sec-WebSocket-Key2: 12998 5 Y3 1 .P00"));
20 list->Append(new base::StringValue("Sec-WebSocket-Protocol: sample"));
21 list->Append(new base::StringValue("Upgrade: WebSocket"));
22 list->Append(new base::StringValue(
24 list->Append(new base::StringValue("Origin: http://example.com"));
25 list
[all...]
/external/srec/seti/sltsEngine/src/
H A Dlinklist_impl.c33 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 Dlist.h2 * 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...]

Completed in 942 milliseconds

1234567891011>>