| /external/protobuf/java/core/src/test/java/com/google/protobuf/ |
| DoubleArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private DoubleArrayList list; field in class:DoubleArrayListTest
56 list = new DoubleArrayList();
68 list.addDouble(2);
69 list.addDouble(4);
70 list.addDouble(6);
71 list.addDouble(8);
72 list.makeImmutable();
73 assertImmutable(list);
282 assertEquals(asList(), list); local
452 DoubleArrayList list = new DoubleArrayList(); local
[all...] |
| FloatArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private FloatArrayList list; field in class:FloatArrayListTest
56 list = new FloatArrayList();
68 list.addFloat(2);
69 list.addFloat(4);
70 list.addFloat(6);
71 list.addFloat(8);
72 list.makeImmutable();
73 assertImmutable(list);
282 assertEquals(asList(), list); local
452 FloatArrayList list = new FloatArrayList(); local
[all...] |
| LongArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
52 private LongArrayList list; field in class:LongArrayListTest
56 list = new LongArrayList();
68 list.addLong(2);
69 list.addLong(4);
70 list.addLong(6);
71 list.addLong(8);
72 list.makeImmutable();
73 assertImmutable(list);
282 assertEquals(asList(), list); local
452 LongArrayList list = new LongArrayList(); local
[all...] |
| /external/toybox/toys/other/ |
| 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;
|
| 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/clang/test/CodeGen/ |
| 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*)malloc(12); // This is not a proper list allocatio
[all...] |
| /external/v8/tools/clang/rewrite_scoped_refptr/tests/ |
| test11-expected.cc | 16 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) {
|
| test11-original.cc | 16 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/mesa3d/src/gallium/state_trackers/nine/ |
| nine_shader.h | 130 nine_shader_variant_get(struct nine_shader_variant *list, uint64_t key)
132 while (list->key != key && list->next)
133 list = list->next;
134 if (list->key == key)
135 return list->cso;
140 nine_shader_variant_add(struct nine_shader_variant *list,
143 while (list->next) {
144 assert(list->key != key)
[all...] |
| /external/syslinux/core/thread/ |
| root_thread.c | 6 .list = { .next = &__root_thread.list, .prev = &__root_thread.list },
|
| /external/wpa_supplicant_8/src/utils/ |
| list.h | 2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
22 static inline void dl_list_init(struct dl_list *list)
24 list->next = list;
25 list->prev = list;
28 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
30 item->next = list->next;
31 item->prev = list;
[all...] |
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/util/ |
| ListOrganizer.java | 19 import java.util.List;
26 private List<ElementType> list;
field in class:ListOrganizer
28 public ListOrganizer(List<ElementType> list) {
29 this.list = list;
34 if(list.remove(element)) {
35 list.add(list.size(), element);
[all...] |
| /bionic/linker/tests/ |
| linked_list_test.cpp | 9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in
61 std::string test_list_to_string(test_list_t& list) {
63 list.for_each([&] (const char* c) {
74 test_list_t list; local
75 ASSERT_EQ("", test_list_to_string(list));
78 list.push_front("a");
81 ASSERT_EQ("a", test_list_to_string(list));
82 list.push_front("b");
83 ASSERT_EQ("ba", test_list_to_string(list));
112 test_list_t list; local
132 test_list_t list; local
149 test_list_t list; local
166 test_list_t list; local
211 test_list_t list; local
[all...] |
| /external/libpng/tests/ |
| pngimage-full | 2 exec ./pngimage --exhaustive --list-combos --log "${srcdir}/contrib/pngsuite/"*.png
|
| pngimage-quick | 2 exec ./pngimage --list-combos --log "${srcdir}/contrib/pngsuite/"*.png
|
| /external/libdrm/tests/ |
| drmsl.c | 1 /* drmsl.c -- Skip list test
30 * This file contains a straightforward skip list implementation.n
47 static void print(void* list)
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, &key, &value))
126 void* list; local
[all...] |
| /hardware/intel/common/libmix/mix_vbp/viddec_fw/fw/parser/ |
| viddec_pm_utils_list.c | 5 Initialize list.
17 Add a new ES buffer to list. If not succesful returns 0.
19 uint32_t viddec_pm_utils_list_addbuf(viddec_pm_utils_list_t *list, viddec_input_buffer_t *es_buf)
22 if((list->num_items + 1) <= MAX_IBUFS_PER_SC)
24 list->num_items +=1;
25 list->sc_ibuf[list->num_items - 1] = *es_buf;
33 EX: if byte=4, and the first es buffer in list is of length 100, we return lis_index=0, offset=3.
36 uint32_t viddec_pm_utils_list_getbyte_position(viddec_pm_utils_list_t *list, uint32_t byte, uint32_t *list_index, uint32_t *offset)
40 /* First buffer in list is always special case, since start offset is tied to it *
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| dircache.py | 3 The listdir() routine returns a sorted list of the files in a directory,
22 """List directory contents, using cache."""
24 cached_mtime, list = cache[path]
27 cached_mtime, list = -1, []
30 list = os.listdir(path)
31 list.sort()
32 cache[path] = mtime, list
33 return list
37 def annotate(head, list):
39 for i in range(len(list)):
[all...] |
| /external/libcxx/test/std/containers/sequences/list/list.cons/ |
| copy.pass.cpp | 10 // <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<int, other_allocator<int> > l2 = l
[all...] |
| /external/mockito/src/test/java/org/mockitousage/bugs/ |
| MultipleInOrdersTest.java | 10 import java.util.List;
21 List<String> list= mock(List.class); local
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);
[all...] |
| /external/python/cpython2/Lib/ |
| dircache.py | 3 The listdir() routine returns a sorted list of the files in a directory,
22 """List directory contents, using cache."""
24 cached_mtime, list = cache[path]
27 cached_mtime, list = -1, []
30 list = os.listdir(path)
31 list.sort()
32 cache[path] = mtime, list
33 return list
37 def annotate(head, list):
39 for i in range(len(list))
[all...] |
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| dircache.py | 3 The listdir() routine returns a sorted list of the files in a directory,
22 """List directory contents, using cache."""
24 cached_mtime, list = cache[path]
27 cached_mtime, list = -1, []
30 list = os.listdir(path)
31 list.sort()
32 cache[path] = mtime, list
33 return list
37 def annotate(head, list):
39 for i in range(len(list))
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| dircache.py | 3 The listdir() routine returns a sorted list of the files in a directory,
22 """List directory contents, using cache."""
24 cached_mtime, list = cache[path]
27 cached_mtime, list = -1, []
30 list = os.listdir(path)
31 list.sort()
32 cache[path] = mtime, list
33 return list
37 def annotate(head, list):
39 for i in range(len(list))
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| 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<int, other_allocator<int> > l2 = l
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| 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<int, other_allocator<int> > l2 = l
[all...] |
