/external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
H A D | push_front.pass.cpp | 10 // <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)));
|
/external/libcxx/test/std/containers/sequences/list/list.ops/ |
H A D | unique.pass.cpp | 10 // <list> 14 #include <list> 24 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 26 assert(c == std::list<int>(a2, a2+4)); 32 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0])); 34 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_caps.c | 34 * Iterates over a list of caps checks as defined in u_caps.h. Should 36 * the list (TERMINATE). Should any check fail returns FALSE and set 40 util_check_caps_out(struct pipe_screen *screen, const unsigned *list, int *out) argument 45 for (i = 0; list[i];) { 46 switch(list[i++]) { 48 if (!screen->get_param(screen, list[i++])) { 54 tmpi = screen->get_param(screen, list[i++]); 55 if (tmpi < (int)list[i++]) { 61 tmpf = screen->get_paramf(screen, list[i++]); 62 if (tmpf < (float)list[ 103 util_check_caps(struct pipe_screen *screen, const unsigned *list) argument 219 unsigned *list; member in struct:__anon14508 220 } list[] = { local [all...] |
/external/curl/lib/ |
H A D | slist.c | 33 /* returns last node in linked list */ 34 static struct curl_slist *slist_get_last(struct curl_slist *list) argument 39 if(!list) 43 item = list; 51 * Curl_slist_append_nodup() appends a string to the linked list. Rather than 59 struct curl_slist *Curl_slist_append_nodup(struct curl_slist *list, char *data) argument 73 /* if this is the first item, then new_item *is* the list */ 74 if(!list) 77 last = slist_get_last(list); 79 return list; 89 curl_slist_append(struct curl_slist *list, const char *data) argument 129 curl_slist_free_all(struct curl_slist *list) argument [all...] |
/external/dagger2/compiler/src/it/functional-tests/src/main/java/test/ |
H A D | BoundedGenericModule.java | 41 ArrayList<String> list = new ArrayList<>(); 42 list.add("arrayListOfString"); 43 return list; 48 LinkedList<String> list = new LinkedList<>(); 49 list.add("linkedListOfString"); 50 return list; 55 LinkedList<CharSequence> list = new LinkedList<>(); 56 list.add("linkedListOfCharSeq"); 57 return list; 63 LinkedList<Comparable<String>> list [all...] |
/external/kmod/testsuite/ |
H A D | test-list.c | 27 static int len(struct kmod_list *list) argument 31 kmod_list_foreach(l, list) 39 struct kmod_list *list = NULL, *last; local 45 list = kmod_list_append(list, v[i]); 46 assert_return(len(list) == N, EXIT_FAILURE); 48 last = kmod_list_last(list); 54 .description = "test for the last element of a list"); 59 struct kmod_list *list = NULL, *l, *p; local 64 l = kmod_list_prev(list, lis 88 struct kmod_list *list = NULL, *l; local 114 struct kmod_list *list = NULL, *l; local 173 struct kmod_list *list = NULL, *l; local 207 struct kmod_list *list = NULL, *l; 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/skia/src/core/ |
H A D | SkTMultiMap.h | 38 ValueList* list = fHash.find(key); local 39 if (list) { 41 // linked list, and it will contain the value of the first element. 42 ValueList* newEntry = new ValueList(list->fValue); 43 newEntry->fNext = list->fNext; 46 list->fNext = newEntry; 47 list->fValue = value; 56 ValueList* list = fHash.find(key); local 59 SkASSERT(list); 61 while (list 83 ValueList* list = fHash.find(key); local 92 ValueList* list = fHash.find(key); local 153 ValueList* list = fHash.find(key); local [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/libdrm/ |
H A D | xf86drmSL.c | 1 /* xf86drmSL.c -- Skip list support 30 * This file contains a straightforward skip list implementation.n 102 SkipListPtr list; local 105 list = drmMalloc(sizeof(*list)); 106 if (!list) return NULL; 107 list->magic = SL_LIST_MAGIC; 108 list->level = 0; 109 list->head = SLCreateEntry(SL_MAX_LEVEL, 0, NULL); 110 list 119 SkipListPtr list = (SkipListPtr)l; local 139 SkipListPtr list = (SkipListPtr)l; local 156 SkipListPtr list = (SkipListPtr)l; local 189 SkipListPtr list = (SkipListPtr)l; local 216 SkipListPtr list = (SkipListPtr)l; local 234 SkipListPtr list = (SkipListPtr)l; local 258 SkipListPtr list = (SkipListPtr)l; local 277 SkipListPtr list = (SkipListPtr)l; local 288 SkipListPtr list = (SkipListPtr)l; local [all...] |
/external/ltp/tools/pounder21/src/time_tests/ |
H A D | inconsistency-check.c | 46 struct timespec list[CALLS_PER_LOOP]; local 56 if (clock_gettime(clock_type, &list[0])) { 61 clock_gettime(clock_type, &list[0]); 62 now = then = list[0].tv_sec; 69 /* Fill list */ 71 clock_gettime(clock_type, &list[i]); 75 if (!in_order(list[i], list[i + 1])) 84 printf("%lu:%lu\n", list[i].tv_sec, 85 list[ [all...] |
/external/mockito/src/test/java/org/mockitousage/verification/ |
H A D | VerificationOnMultipleMocksUsingMatchersTest.java | 24 List<Object> list = Mockito.mock(List.class); 27 list.add("test"); 28 list.add(1, "test two"); 33 verify(list).add(anyObject()); 34 verify(list).add(anyInt(), eq("test two")); 39 verifyNoMoreInteractions(list, map); 44 List<String> list = mock(List.class); 48 list.add("one"); 49 list.add("one"); 50 list [all...] |
/external/hamcrest/hamcrest-library/src/test/java/org/hamcrest/collection/ |
H A D | IsCollectionWithSizeTest.java | 28 Collection<Object> list = asList(null, null); 29 assertMatches("correct size", hasSize(equalTo(2)), list); 30 assertMismatchDescription("collection size was <2>", hasSize(equalTo(3)), list); 34 Collection<String> list = asList("a", "b"); 35 assertMatches("correct size", hasSize(equalTo(2)), list); 36 assertMismatchDescription("collection size was <2>", hasSize(equalTo(3)), list); 40 Collection<?> list = asList("a", "b"); 41 assertMatches("correct size", hasSize(equalTo(2)), list); 42 assertMismatchDescription("collection size was <2>", hasSize(equalTo(3)), list); 46 List<Object> list [all...] |
/external/syslinux/core/thread/ |
H A D | semaphore.c | 7 sem->list.next = sem->list.prev = &sem->list; 43 /* Add to the end of the wakeup list */ 44 block.list.prev = sem->list.prev; 45 block.list.next = &sem->list; 46 sem->list.prev = &block.list; [all...] |
/external/kmod/libkmod/ |
H A D | libkmod-list.c | 26 * SECTION:libkmod-list 27 * @short_description: general purpose list 38 static inline void list_node_append(struct list_node *list, argument 41 if (list == NULL) { 46 node->prev = list->prev; 47 list->prev->next = node; 48 list->prev = node; 49 node->next = list; 63 static inline void list_node_insert_after(struct list_node *list, argument 66 if (list 77 list_node_insert_before(struct list_node *list, struct list_node *node) argument 111 kmod_list_append(struct kmod_list *list, const void *data) argument 125 kmod_list_insert_after(struct kmod_list *list, const void *data) argument 143 kmod_list_insert_before(struct kmod_list *list, const void *data) argument 175 kmod_list_prepend(struct kmod_list *list, const void *data) argument 189 kmod_list_remove(struct kmod_list *list) argument 205 kmod_list_remove_data(struct kmod_list *list, const void *data) argument 232 kmod_list_remove_n_latest(struct kmod_list *list, unsigned int n) argument 259 kmod_list_prev(const struct kmod_list *list, const struct kmod_list *curr) argument 284 kmod_list_next(const struct kmod_list *list, const struct kmod_list *curr) argument 309 kmod_list_last(const struct kmod_list *list) argument [all...] |
/external/syslinux/com32/lib/syslinux/ |
H A D | zonelist.c | 33 * hold memory maps. A zonelist is a sorted linked list of memory 45 * Create an empty syslinux_memmap list. 73 * Add an item to a syslinux_memmap list, potentially overwriting 76 int syslinux_add_memmap(struct syslinux_memmap **list, argument 86 syslinux_dump_memmap(*list); 95 mpp = list; 152 syslinux_dump_memmap(*list); 162 enum syslinux_memmap_types syslinux_memmap_type(struct syslinux_memmap *list, argument 169 while (list->type != SMT_END) { 170 llast = list 194 syslinux_memmap_largest(struct syslinux_memmap *list, enum syslinux_memmap_types type, addr_t * start, addr_t * len) argument 230 syslinux_memmap_highest(const struct syslinux_memmap *list, enum syslinux_memmap_types type, addr_t *start, addr_t len, addr_t ceiling, addr_t align) argument 271 syslinux_memmap_find_type(struct syslinux_memmap *list, enum syslinux_memmap_types type, addr_t * start, addr_t * len, addr_t align) argument 302 syslinux_free_memmap(struct syslinux_memmap *list) argument 316 syslinux_dup_memmap(struct syslinux_memmap *list) argument [all...] |
/external/icu/icu4c/source/common/ |
H A D | ulist.c | 35 static void ulist_addFirstItem(UList *list, UListNode *newItem); 60 * Function called by addItemEndList or addItemBeginList when the first item is added to the list. 63 static void ulist_addFirstItem(UList *list, UListNode *newItem) { argument 66 list->head = newItem; 67 list->tail = newItem; 70 static void ulist_removeItem(UList *list, UListNode *p) { argument 72 // p is the list head. 73 list->head = p->next; 78 // p is the list tail. 79 list 92 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) argument 125 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status) argument 159 ulist_containsString(const UList *list, const char *data, int32_t length) argument 173 ulist_removeString(UList *list, const char *data) argument 187 ulist_getNext(UList *list) argument 201 ulist_getListSize(const UList *list) argument 209 ulist_resetList(UList *list) argument 216 ulist_deleteList(UList *list) argument [all...] |
/external/protobuf/csharp/src/Google.Protobuf.Test/Collections/ |
H A D | RepeatedFieldTest.cs | 11 // notice, this list of conditions and the following disclaimer. 13 // copyright notice, this list of conditions and the following disclaimer 50 var list = new RepeatedField<string>(); 51 Assert.Throws<ArgumentNullException>(() => list.Add((string)null)); 52 Assert.Throws<ArgumentNullException>(() => list.Add((IEnumerable<string>)null)); 53 Assert.Throws<ArgumentNullException>(() => list.Add((RepeatedField<string>)null)); 54 Assert.Throws<ArgumentNullException>(() => list.Contains(null)); 55 Assert.Throws<ArgumentNullException>(() => list.IndexOf(null)); 61 var list = new RepeatedField<string>(); 62 list [all...] |
/external/v8/tools/clang/value_cleanup/tests/ |
H A D | list-value-append-expected.cc | 27 base::ListValue list; local 28 list.AppendBoolean(1 == 0); 29 list.AppendBoolean(true); 30 list.AppendInteger(static_cast<unsigned char>(1.0)); 31 list.AppendDouble(double{3}); 32 list.AppendString("abc"); 34 list.Append(ReturnsUniquePtr()); 36 list.Append(thing.ToValue()); 38 list.Append(std::move(unique_ptr_var)); 42 base::ListValue list; local [all...] |
H A D | list-value-append-original.cc | 27 base::ListValue list; local 28 list.Append(new base::FundamentalValue(1 == 0)); 29 list.Append(new base::FundamentalValue(true)); 30 list.Append(new base::FundamentalValue(static_cast<unsigned char>(1.0))); 31 list.Append(new base::FundamentalValue(double{3})); 32 list.Append(new base::StringValue("abc")); 34 list.Append(ReturnsUniquePtr().release()); 36 list.Append(thing.ToValue().release()); 38 list.Append(unique_ptr_var.release()); 42 base::ListValue list; local [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | ListsTest.java | 106 ArrayList<Integer> list = Lists.newArrayList(); 107 assertEquals(Collections.emptyList(), list); 111 ArrayList<Integer> list = Lists.newArrayListWithCapacity(0); 112 assertEquals(Collections.emptyList(), list); 127 ArrayList<Integer> list = Lists.newArrayListWithExpectedSize(0); 128 assertEquals(Collections.emptyList(), list); 143 ArrayList<Integer> list = Lists.newArrayList(0, 1, 1); 144 assertEquals(SOME_COLLECTION, list); 157 ArrayList<Integer> list = Lists.newArrayList(SOME_COLLECTION); 158 assertEquals(SOME_COLLECTION, list); 216 checkFooBarBazList(List<String> list) argument 256 assertIndexIsOutOfBounds(List<String> list, int index) argument 305 private static <E> List<E> list(E... elements) { method in class:ListsTest 388 assertTransformModifiable(List<String> list) argument 474 assertTransformListIterator(List<String> list) argument 532 assertTransformIterator(List<String> list) argument [all...] |
/external/libcxx/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/ |
H A D | container.pass.cpp | 17 #include <list> 29 test(std::list<int>());
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | LinearSearch.java | 10 * notice, this list of conditions and the following disclaimer. 12 * copyright notice, this list of conditions and the following disclaimer 39 * Performs a linear search in a sorted list for key, starting at initialGuess 41 * @param list The sorted list to search 48 public static <T> int linearSearch(List<? extends T> list, Comparator<T> comparator, T key, int initialGuess) { argument 50 if (guess >= list.size()) { 51 guess = list.size()-1; 53 int comparison = comparator.compare(list.get(guess), key); 59 while (guess < list [all...] |
/external/strace/ |
H A D | xlate.el | 8 ;; notice, this list of conditions and the following disclaimer. 10 ;; notice, this list of conditions and the following disclaimer in the 35 (defvar xlate-list nil 39 "Grab all of the defined names in the region and save them in xlate-list." 42 (setq xlate-list nil) 47 (setq xlate-list (cons (buffer-substring (match-beginning 1) 49 xlate-list))) 53 (setq xlate-list (nreverse xlate-list))) 55 (defun build-xlate (&optional list) [all...] |
/external/chromium-trace/catapult/telemetry/third_party/mox3/ |
H A D | .testr.conf | 3 test_id_option=--load-list $IDFILE 4 test_list_option=--list
|