/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/mjsunit/regress/ |
H A D | regress-299979.js | 7 // 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/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
H A D | container.fail.cpp | 19 #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 D | LinearSearchTest.java | 10 * 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/clang/test/Analysis/ |
H A D | kmalloc-linux.c | 16 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 D | malloc-three-arg.c | 16 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 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/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 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...] |
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 38 List<AstNode*>* list = new List<AstNode*>(0); local 39 CHECK_EQ(0, list->length()); 46 list->Add(node); 47 CHECK_EQ(1, list->length()); 48 CHECK_EQ(node, list->at(0)); 49 CHECK_EQ(node, list->last()); 53 list->Add(node); 55 CHECK_EQ(1 + kElements, list [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_simple_list.h | 5 * 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 D | simple_list.h | 5 * 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/toybox/lib/ |
H A D | llist.c | 1 /* llist.c - Linked list functions 3 * Linked list structures have a next pointer as their first element. 26 // Call a function (such as free()) on each element of a linked list. 27 void llist_traverse(void *list, void (*using)(void *node)) argument 29 void *old = list; 31 while (list) { 32 void *pop = llist_pop(&list); 35 // End doubly linked list too. 36 if (old == list) break; 40 // Return the first item from the list, advancin 42 llist_pop(void *list) argument 54 dlist_pop(void *list) argument 67 dlist_add_nomalloc(struct double_list **list, struct double_list *new) argument 79 dlist_add(struct double_list **list, char *data) argument 90 dlist_terminate(void *list) argument [all...] |
/external/toybox/toys/other/ |
H A D | tac.c | 20 struct arg_list *list = NULL; local 31 temp->next = list; 33 list = temp; 37 while (list) { 38 struct arg_list *temp = list->next; 39 xprintf("%s", list->arg); 40 free(list->arg); 41 free(list); 42 list = temp;
|
H A D | which.c | 25 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/wpa_supplicant_8/hostapd/src/utils/ |
H A D | list.h | 2 * 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 D | list.h | 2 * 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 D | list.h | 2 * 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 D | ListOrganizer.java | 26 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/chromium-trace/trace-viewer/tracing/tracing/ui/base/ |
H A D | list_view.css | 6 * /deep/ .x-list-view { 10 * /deep/ .x-list-view:focus { 14 * /deep/ .x-list-view * { 18 * /deep/ .x-list-view > .list-item { 22 * /deep/ .x-list-view:focus > .list-item[selected] { 28 * /deep/ .x-list-view > .list-item[selected] {
|
/external/skia/src/core/ |
H A D | SkTMultiMap.h | 39 ValueList* list = fHash.find(key); local 40 if (list) { 42 // linked list, and it will contain the value of the first element. 43 ValueList* newEntry = SkNEW_ARGS(ValueList, (list->fValue)); 44 newEntry->fNext = list->fNext; 47 list->fNext = newEntry; 48 list->fValue = value; 57 ValueList* list = fHash.find(key); local 60 SkASSERT(list); 62 while (list 84 ValueList* list = fHash.find(key); local 93 ValueList* list = fHash.find(key); local 109 ValueList* list = fHash.find(key); local [all...] |
/external/libcxx/test/std/containers/sequences/list/list.cons/ |
H A D | copy.pass.cpp | 10 // <list> 12 // list(const list& c); 14 #include <list> 23 std::list<int> l(3, 2); 24 std::list<int> l2 = l; 28 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); 29 std::list<int, test_allocator<int> > l2 = l; 35 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); 36 std::list<in [all...] |
/external/jetty/src/java/org/eclipse/jetty/util/ |
H A D | LazyList.java | 40 * LazyList works by passing an opaque representation of the list in 42 * null for an empty list, an Object for a list with a single entry 43 * or an {@link ArrayList} for a list of items. 72 * @param list The list to add to or null if none yet created. 77 public static Object add(Object list, Object item) argument 79 if (list==null) 91 if (list instanceof List) 93 ((List<Object>)list) 111 add(Object list, int index, Object item) argument 142 addCollection(Object list, Collection<?> collection) argument 156 addArray(Object list, Object[] array) argument 167 ensureSize(Object list, int initialSize) argument 186 remove(Object list, Object o) argument 206 remove(Object list, int i) argument 234 getList(Object list) argument 250 getList(Object list, boolean nullForEmpty) argument 266 toStringArray(Object list) argument 293 toArray(Object list,Class<?> clazz) argument 322 size(Object list) argument 338 get(Object list, int i) argument 353 contains(Object list,Object item) argument 366 clone(Object list) argument 376 toString(Object list) argument 387 iterator(Object list) argument 404 listIterator(Object list) argument [all...] |
/external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/test/fixtures/ |
H A D | formatting_element_list_test.js | 12 var list = new FormattingElementList(treeAdapter); 14 list.insertMarker(); 15 assert.strictEqual(list.length, 1); 16 assert.strictEqual(list.entries[0].type, FormattingElementList.MARKER_ENTRY); 18 list.insertMarker(); 19 assert.strictEqual(list.length, 2); 20 assert.strictEqual(list.entries[1].type, FormattingElementList.MARKER_ENTRY); 24 var list = new FormattingElementList(treeAdapter), 30 list.pushElement(element1, element1Token); 31 assert.strictEqual(list [all...] |
/external/protobuf/java/src/test/java/com/google/protobuf/ |
H A D | LazyStringArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer. 12 // copyright notice, this list of conditions and the following disclaimer 54 LazyStringArrayList list = new LazyStringArrayList(); 55 list.add(STRING_A); 56 list.add(STRING_B); 57 list.add(STRING_C); 59 assertEquals(3, list.size()); 60 assertSame(STRING_A, list.get(0)); 61 assertSame(STRING_B, list.get(1)); 62 assertSame(STRING_C, list [all...] |