| /prebuilts/python/darwin-x86/2.7.5/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/python/linux-x86/2.7.5/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...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Other/Maintained/Tools/Pccts/sorcerer/lib/ |
| sorlist.c | 41 /* Iterate over a list of elements; returns ptr to a new element
42 * in list upon every call and NULL when no more are left.
50 * The cursor must be initialized to point to the list to iterate over.
54 slist_iterate(SList *list, SList **cursor)
56 slist_iterate(list, cursor)
57 SList *list, **cursor;
62 if ( list==NULL || cursor == NULL || *cursor==NULL ) return NULL;
63 if ( list== *cursor ) { *cursor = (*cursor)->next; }
70 * add an element to a list.
72 * Any non-empty list has a sentinel node whose 'elem' pointer is really
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/ruby/ |
| std_list.i | 9 struct traits_asptr<std::list<T> > {
10 static int asptr(VALUE obj, std::list<T> **lis) {
11 return traits_asptr_stdseq<std::list<T> >::asptr(obj, lis);
16 struct traits_from<std::list<T> > {
17 static VALUE from(const std::list<T> & vec) {
18 return traits_from_stdseq<std::list<T> >::from(vec);
24 %ignore std::list::push_back;
25 %ignore std::list::pop_back;
31 %rename("delete") std::list::__delete__;
32 %rename("reject!") std::list::reject_bang
[all...] |
| /external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/table/ |
| SortIndexTest.java | 20 import java.util.List;
48 final List<Integer> list = createList(1); local
49 index.init(list);
50 assertSequence(list);
55 final List<Integer> list = createList(20); local
56 index.init(list);
57 assertSequence(list);
63 final List<Integer> list = createList(20) local
70 final List<Integer> list = createList(57); local
78 final List<Integer> list = createList(71); local
85 List<Integer> list = new ArrayList<Integer>(length); local
[all...] |
| /external/toybox/lib/ |
| 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))
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, advancing the list (which must be calle
[all...] |
| /packages/apps/CellBroadcastReceiver/tests/unit/src/com/android/cellbroadcastreceiver/ |
| CellBroadcastChannelManagerTest.java | 63 ArrayList<CellBroadcastChannelRange> list = CellBroadcastChannelManager.getInstance() local
66 assertEquals(12, list.get(0).mStartId);
67 assertEquals(12, list.get(0).mEndId);
68 assertEquals(AlertType.EARTHQUAKE, list.get(0).mAlertType);
69 assertTrue(list.get(0).mIsEmergency);
71 assertEquals(456, list.get(1).mStartId);
72 assertEquals(456, list.get(1).mEndId);
73 assertEquals(AlertType.TSUNAMI, list.get(1).mAlertType);
74 assertTrue(list.get(1).mIsEmergency);
76 assertEquals(0xAC00, list.get(2).mStartId)
[all...] |
| /external/curl/lib/ |
| llist.c | 48 struct curl_llist *list; local
50 list = malloc(sizeof(struct curl_llist));
51 if(!list)
54 llist_init(list, dtor);
56 return list;
62 * Inserts a new list element after the given one 'e'. If the given existing
63 * entry is NULL and the list already has elements, the new one will be
64 * inserted first in the list.
71 Curl_llist_insert_next(struct curl_llist *list, struct curl_llist_element *e,
79 if(list->size == 0)
[all...] |
| /external/libcxx/test/libcxx/containers/sequences/list/list.cons/ |
| db_move.pass.cpp | 12 // <list>
14 // list(list&& c);
19 #include <list>
28 std::list<int> l1 = {1, 2, 3};
29 std::list<int>::iterator i = l1.begin();
30 std::list<int> l2 = std::move(l1);
|
| /external/libcxx/test/libcxx/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 10 // <list>
17 #include <list>
24 std::list<int> l1(a1, a1+3);
25 std::list<int> l2(a1, a1+3);
26 std::list<int>::const_iterator i = l2.begin();
|
| insert_iter_size_value_db1.pass.cpp | 10 // <list>
17 #include <list>
23 std::list<int> c1(100);
24 std::list<int> c2;
25 std::list<int>::iterator i = c1.insert(next(c2.cbegin(), 10), 5, 1);
|
| /external/libcxx/test/libcxx/containers/sequences/list/ |
| version.pass.cpp | 10 // <list>
12 #include <list>
|
| /external/libcxx/test/std/utilities/optional/optional.syn/ |
| optional_includes_initializer_list.pass.cpp | 21 std::initializer_list<int> list;
|
| /external/mesa3d/src/gallium/drivers/r300/compiler/ |
| radeon_list.c | 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value)
49 if (*list == NULL) {
50 *list = new_value;
54 for (temp = *list; temp->Next; temp = temp->Next);
60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value)
62 if (*list == rm_value) {
63 *list = rm_value->Next;
73 unsigned int rc_list_count(struct rc_list * list)
76 while (list) {
78 list = list->Next
[all...] |
| radeon_list.h | 40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value);
41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value);
42 unsigned int rc_list_count(struct rc_list * list);
43 void rc_list_print(struct rc_list * list);
|
| /external/parameter-framework/upstream/parameter/ |
| ConfigurableElementAggregator.h | 9 * list of conditions and the following disclaimer.
12 * this list of conditions and the following disclaimer in the documentation and/or
35 #include <list>
45 CConfigurableElementAggregator(std::list<const CConfigurableElement *> &aggregateList,
54 std::list<const CConfigurableElement *> &aggregateList);
56 // Aggegate list
57 std::list<const CConfigurableElement *> &_aggregateList;
|
| /external/selinux/restorecond/ |
| stringslist.h | 31 void strings_list_free(struct stringsList *list);
32 void strings_list_add(struct stringsList **list, const char *string);
33 void strings_list_print(struct stringsList *list);
34 int strings_list_find(struct stringsList *list, const char *string, int *exact);
|
| /frameworks/support/paging/common/src/test/java/android/arch/paging/ |
| NullPaddedListTest.java | 29 import java.util.List;
35 List<String> data = Arrays.asList("A", "B", "C", "D", "E", "F");
36 NullPaddedList<String> list = new NullPaddedList<>( local
39 assertNull(list.get(0));
40 assertNull(list.get(1));
41 assertSame(data.get(2), list.get(2));
42 assertSame(data.get(3), list.get(3));
43 assertNull(list.get(4));
44 assertNull(list.get(5));
46 assertEquals(6, list.size())
53 NullPaddedList<String> list = new NullPaddedList<>(0, new ArrayList<String>(), 0); local
59 NullPaddedList<String> list = new NullPaddedList<>(0, Arrays.asList("a", "b"), 0); local
65 NullPaddedList<String> list = new NullPaddedList<>(0, Arrays.asList("a", "b"), 0); local
[all...] |
| /packages/inputmethods/LatinIME/native/dicttoolkit/src/offdevice_intermediate_dict/ |
| offdevice_intermediate_dict_pt_node_array.h | 20 #include <list>
32 const std::list<std::shared_ptr<OffdeviceIntermediateDictPtNode>> &getPtNodeList() const {
36 std::list<std::shared_ptr<OffdeviceIntermediateDictPtNode>> *getMutablePtNodeList() {
43 std::list<std::shared_ptr<OffdeviceIntermediateDictPtNode>> mPtNodes;
|
| /packages/inputmethods/LatinIME/native/jni/src/suggest/core/dicnode/ |
| dic_nodes_cache.cpp | 17 #include <list>
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/ |
| version.pass.cpp | 10 // <list>
12 #include <list>
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/ |
| version.pass.cpp | 10 // <list>
12 #include <list>
|
| /external/libcap/libcap/ |
| _makenames.c | 19 } const list[] = { variable
20 #include "cap_names.list.h"
31 for ( i=0; list[i].index >= 0 && list[i].name; ++i ) {
32 if (maxcaps <= list[i].index) {
33 maxcaps = list[i].index + 1;
35 pointers[list[i].index] = list[i].name;
|
| /external/libdrm/tests/radeon/ |
| radeon_ttm.c | 37 struct list_head list; local
42 list_inithead(&list);
50 list_add(&bo->list, &list);
52 LIST_FOR_EACH_ENTRY_SAFE(bo, tmp, &list, list) {
53 list_del(&bo->list);
|
| /external/protobuf/java/core/src/test/java/com/google/protobuf/ |
| LazyStringArrayListTest.java | 10 // notice, this list of conditions and the following disclaimer.
12 // copyright notice, this list of conditions and the following disclaimer
40 import java.util.List;
58 LazyStringArrayList list = new LazyStringArrayList(); local
59 list.add(STRING_A);
60 list.add(STRING_B);
61 list.add(STRING_C);
63 assertEquals(3, list.size());
64 assertSame(STRING_A, list.get(0));
65 assertSame(STRING_B, list.get(1))
85 LazyStringArrayList list = new LazyStringArrayList(); local
105 LazyStringArrayList list = new LazyStringArrayList(); local
180 LazyStringArrayList list = new LazyStringArrayList(); local
211 LazyStringArrayList list = new LazyStringArrayList(); local
272 LazyStringArrayList list = new LazyStringArrayList(); local
[all...] |
