Searched refs:list (Results 76 - 100 of 1911) sorted by relevance

1234567891011>>

/external/icu4c/common/
H A Dulist.h19 U_CAPI void U_EXPORT2 ulist_addItemEndList(UList *list, const void *data, UBool forceDelete, UErrorCode *status);
21 U_CAPI void U_EXPORT2 ulist_addItemBeginList(UList *list, const void *data, UBool forceDelete, UErrorCode *status);
23 U_CAPI UBool U_EXPORT2 ulist_containsString(const UList *list, const char *data, int32_t length);
25 U_CAPI void *U_EXPORT2 ulist_getNext(UList *list);
27 U_CAPI int32_t U_EXPORT2 ulist_getListSize(const UList *list);
29 U_CAPI void U_EXPORT2 ulist_resetList(UList *list);
31 U_CAPI void U_EXPORT2 ulist_deleteList(UList *list);
/external/linux-tools-perf/
H A Dbuiltin-buildid-cache.c27 "file list", "file(s) to add"),
28 OPT_STRING('r', "remove", &remove_name_list_str, "file list",
77 struct strlist *list; local
84 list = strlist__new(true, add_name_list_str);
85 if (list) {
86 strlist__for_each(pos, list)
97 strlist__delete(list);
102 list = strlist__new(true, remove_name_list_str);
103 if (list) {
104 strlist__for_each(pos, list)
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DListsTest.java195 List<String> list = Lists.newArrayList();
197 list.add(elements[i]);
198 return Lists.reverse(list);
217 List<String> list = Lists.newLinkedList();
219 list.add(elements[i]);
220 return Lists.reverse(list);
305 ArrayList<Integer> list = Lists.newArrayList();
306 assertEquals(Collections.emptyList(), list);
310 ArrayList<Integer> list = Lists.newArrayListWithCapacity(0);
311 assertEquals(Collections.emptyList(), list);
437 checkFooBarBazList(List<String> list) argument
497 assertIndexIsOutOfBounds(List<String> list, int index) argument
582 assertTransformModifiable(List<String> list) argument
654 assertTransformListIterator(List<String> list) argument
732 assertTransformIterator(List<String> list) argument
[all...]
/external/chromium/chrome/browser/
H A Doom_priority_manager.h8 #include <list>
39 typedef std::list<RendererStats> StatsList;
49 void DoAdjustOomPriorities(StatsList list);
/external/dexmaker/src/dx/java/com/android/dx/dex/file/
H A DHeaderSection.java29 /** {@code non-null;} the list of the one item in the section */
30 private final List<HeaderItem> list; field in class:HeaderSection
43 this.list = Collections.singletonList(item);
55 return list;
/external/webkit/Source/WebCore/bindings/v8/
H A DV8DOMMap.cpp9 * notice, this list of conditions and the following disclaimer.
11 * copyright notice, this list of conditions and the following disclaimer
120 DOMDataList& list = DOMDataStore::allStores(); local
121 for (size_t i = 0; i < list.size(); ++i) {
122 DOMDataStore* store = list[i];
135 DOMDataList& list = DOMDataStore::allStores(); local
136 for (size_t i = 0; i < list.size(); ++i) {
137 DOMDataStore* store = list[i];
150 DOMDataList& list = DOMDataStore::allStores(); local
151 for (size_t i = 0; i < list
167 DOMDataList& list = DOMDataStore::allStores(); local
[all...]
/external/e2fsprogs/e2fsck/
H A Dea_refcount.c35 struct ea_refcount_el *list; member in struct:ea_refcount
43 if (refcount->list)
44 ext2fs_free_mem(&refcount->list);
67 retval = ext2fs_get_mem(bytes, &refcount->list);
70 memset(refcount->list, 0, bytes);
90 struct ea_refcount_el *list; local
92 list = refcount->list;
94 if (list[i].ea_count) {
96 list[
308 struct ea_refcount_el *list; local
[all...]
H A Dprof_err.c15 "Bad linked list in profile structures",
58 void initialize_prof_error_table_r(struct et_list **list);
66 void initialize_prof_error_table_r(struct et_list **list) argument
70 for (end = list, et = *list; et; end = &et->next, et = et->next)
/external/libxml2/
H A Dtriodef.h139 # define TRIO_ARGS1(list,a1) list a1;
140 # define TRIO_ARGS2(list,a1,a2) list a1; a2;
141 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3;
142 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4;
143 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a
[all...]
/external/libxslt/libxslt/
H A Dtriodef.h137 # define TRIO_ARGS1(list,a1) list a1;
138 # define TRIO_ARGS2(list,a1,a2) list a1; a2;
139 # define TRIO_ARGS3(list,a1,a2,a3) list a1; a2; a3;
140 # define TRIO_ARGS4(list,a1,a2,a3,a4) list a1; a2; a3; a4;
141 # define TRIO_ARGS5(list,a1,a2,a3,a4,a5) list a
[all...]
/external/chromium/chrome/browser/resources/bookmark_manager/css/
H A Dbmm.css14 list {
20 list > * {
28 list > * > * {
37 list > * > .label {
43 list > * > .url {
47 list > :hover > .url,
48 list > [selected] > .url {
52 html[dir=rtl] list .label {
56 list > .folder > .label {
61 list > * >
[all...]
/external/chromium/net/disk_cache/
H A Drankings.h11 #include <list>
99 List list; // Which entry was returned to the user. member in struct:disk_cache::Rankings::Iterator
113 void Insert(CacheRankingsBlock* node, bool modified, List list);
115 // Removes a given entry from the LRU list. If |strict| is true, this method
118 // to be removed from the list (basically without control of the code that is
120 void Remove(CacheRankingsBlock* node, List list, bool strict);
123 void UpdateRank(CacheRankingsBlock* node, bool modified, List list);
125 // Iterates through the list.
126 CacheRankingsBlock* GetNext(CacheRankingsBlock* node, List list);
127 CacheRankingsBlock* GetPrev(CacheRankingsBlock* node, List list);
[all...]
/external/e2fsprogs/lib/et/test_cases/
H A Dcontinuation.c28 void initialize_ovk_error_table_r(struct et_list **list);
36 void initialize_ovk_error_table_r(struct et_list **list) argument
40 for (end = list, et = *list; et; end = &et->next, et = et->next)
H A Dcontinuation.h13 extern void initialize_ovk_error_table_r(struct et_list **list);
H A Dheimdal.c109 void initialize_krb_error_table_r(struct et_list **list);
117 void initialize_krb_error_table_r(struct et_list **list) argument
121 for (end = list, et = *list; et; end = &et->next, et = et->next)
H A Dheimdal2.c95 void initialize_kadm_error_table_r(struct et_list **list);
103 void initialize_kadm_error_table_r(struct et_list **list) argument
107 for (end = list, et = *list; et; end = &et->next, et = et->next)
H A Dheimdal3.c29 void initialize_h3test_error_table_r(struct et_list **list);
37 void initialize_h3test_error_table_r(struct et_list **list) argument
41 for (end = list, et = *list; et; end = &et->next, et = et->next)
H A Dheimdal3.h14 extern void initialize_h3test_error_table_r(struct et_list **list);
H A Dimap_err.c57 void initialize_imap_error_table_r(struct et_list **list);
65 void initialize_imap_error_table_r(struct et_list **list) argument
69 for (end = list, et = *list; et; end = &et->next, et = et->next)
H A Dsimple.c49 void initialize_krb_error_table_r(struct et_list **list);
57 void initialize_krb_error_table_r(struct et_list **list) argument
61 for (end = list, et = *list; et; end = &et->next, et = et->next)
/external/e2fsprogs/lib/ext2fs/
H A Dbadblocks.c30 * Helper function for making a badblocks list
32 static errcode_t make_u32_list(int size, int num, __u32 *list, argument
45 retval = ext2fs_get_array(bb->size, sizeof(blk_t), &bb->list);
50 if (list)
51 memcpy(bb->list, list, bb->size * sizeof(blk_t));
53 memset(bb->list, 0, bb->size * sizeof(blk_t));
60 * This procedure creates an empty u32 list.
68 * This procedure creates an empty badblocks list.
77 * This procedure copies a badblocks list
[all...]
H A Dext2_err.c21 "Wrong magic number for directory block list structure",
115 "Ext2fs directory block list is empty",
164 void initialize_ext2_error_table_r(struct et_list **list);
172 void initialize_ext2_error_table_r(struct et_list **list) argument
176 for (end = list, et = *list; et; end = &et->next, et = et->next)
/external/guava/guava/src/com/google/common/collect/
H A DSortedLists.java36 * list.
45 * A specification for which index to return if the list contains at least one element that
50 * Return the index of any list element that compares as equal to the key. No guarantees are
56 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
61 * Return the index of the last list element that compares as equal to the key.
66 Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) {
70 int upper = list.size() - 1;
74 int c = comparator.compare(list.get(middle), key);
85 * Return the index of the first list element that compares as equal to the key.
90 Comparator<? super E> comparator, E key, List<? extends E> list, in
131 resultIndex( Comparator<? super E> comparator, E key, List<? extends E> list, int foundIndex) argument
189 binarySearch(List<? extends E> list, E e, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument
202 binarySearch(List<E> list, Function<? super E, K> keyFunction, K key, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument
221 binarySearch( List<E> list, Function<? super E, K> keyFunction, K key, Comparator<? super K> keyComparator, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument
255 binarySearch(List<? extends E> list, @Nullable E key, Comparator<? super E> comparator, KeyPresentBehavior presentBehavior, KeyAbsentBehavior absentBehavior) argument
[all...]
/external/guava/guava-testlib/src/com/google/common/collect/testing/
H A DListIteratorTester.java52 List<Stimulus<E, ? super ListIterator<E>>> list =
54 Helpers.addAll(list, iteratorStimuli());
55 Helpers.addAll(list, listIteratorStimuli());
56 return list;
/external/guava/guava-testlib/src/com/google/common/testing/
H A DTestLogHandler.java56 /** We will keep a private list of all logged records */
57 private final List<LogRecord> list = field in class:TestLogHandler
61 * Adds the most recently logged record to our list.
65 list.add(record);
75 list.clear();
79 * Fetch the list of logged records
80 * @return unmodifiable LogRecord list of all logged records
83 List<LogRecord> result = new ArrayList<LogRecord>(list);

Completed in 508 milliseconds

1234567891011>>