/external/slf4j/log4j-over-slf4j/src/test/java/org/dummy/ |
H A D | ListHandler.java | 34 List<LogRecord> list = new ArrayList<LogRecord>(); field in class:ListHandler 46 list.add(logRecord);
|
/external/slf4j/slf4j-ext/src/test/java/org/slf4j/dummyExt/ |
H A D | ListAppender.java | 35 public List<LoggingEvent> list = new ArrayList<LoggingEvent>(); field in class:ListAppender 40 list.add(event);
|
/external/slf4j/slf4j-log4j12/src/test/java/org/slf4j/ |
H A D | ListAppender.java | 35 public List<LoggingEvent> list = new ArrayList<LoggingEvent>(); field in class:ListAppender 40 list.add(event);
|
/external/smali/util/src/main/java/org/jf/util/ |
H A D | CharSequenceUtils.java | 10 * notice, this list of conditions and the following disclaimer. 12 * copyright notice, this list of conditions and the following disclaimer 43 public static int listHashCode(List<? extends CharSequence> list) { argument 44 return Lists.transform(list, TO_STRING).hashCode();
|
H A D | ImmutableUtils.java | 10 * notice, this list of conditions and the following disclaimer. 12 * copyright notice, this list of conditions and the following disclaimer 42 @Nonnull public static <T> ImmutableList<T> nullToEmptyList(@Nullable ImmutableList<T> list) { argument 43 if (list == null) { 46 return list;
|
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/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/strace/ |
H A D | affinity.c | 4 print_affinitylist(struct tcb *tcp, long list, unsigned int len) argument 14 len -= sizeof(w), list += sizeof(w)) { 15 if (umove(tcp, list, &w) < 0) 26 tprintf("%#lx", list);
|
/external/strace/tests/ |
H A D | uid16.c | 39 int *list = 0; local 69 assert((size = syscall(__NR_getgroups, 0, list)) >= 0); 70 assert(list = calloc(size + 1, sizeof(*list))); 71 assert(syscall(__NR_getgroups, size, list) == size);
|
/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;
|
/external/apache-http/src/org/apache/http/client/protocol/ |
H A D | ClientContextConfigurer.java | 74 public void setAuthSchemePref(final List<String> list) { argument 75 this.context.setAttribute(AUTH_SCHEME_PREF, list);
|
/external/clang/test/Analysis/inlining/ |
H A D | stl.cpp | 31 void testList_pop_front(std::list<int> list) { argument 32 while(!list.empty()) 33 list.pop_front(); // no-warning
|
/external/clang/test/CodeGen/ |
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/dexmaker/src/dx/java/com/android/dx/dex/file/ |
H A D | HeaderSection.java | 29 /** {@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/e2fsprogs/e2fsck/ |
H A D | prof_err.c | 17 N_("Bad linked list in profile structures"), 60 void initialize_prof_error_table_r(struct et_list **list); 68 void initialize_prof_error_table_r(struct et_list **list) argument 72 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
/external/e2fsprogs/lib/et/test_cases/ |
H A D | continuation.c | 30 void initialize_ovk_error_table_r(struct et_list **list); 38 void initialize_ovk_error_table_r(struct et_list **list) argument 42 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | heimdal.c | 111 void initialize_krb_error_table_r(struct et_list **list); 119 void initialize_krb_error_table_r(struct et_list **list) argument 123 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | heimdal2.c | 97 void initialize_kadm_error_table_r(struct et_list **list); 105 void initialize_kadm_error_table_r(struct et_list **list) argument 109 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | heimdal3.c | 31 void initialize_h3test_error_table_r(struct et_list **list); 39 void initialize_h3test_error_table_r(struct et_list **list) argument 43 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | imap_err.c | 59 void initialize_imap_error_table_r(struct et_list **list); 67 void initialize_imap_error_table_r(struct et_list **list) argument 71 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
H A D | simple.c | 51 void initialize_krb_error_table_r(struct et_list **list); 59 void initialize_krb_error_table_r(struct et_list **list) argument 63 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | ext2_err.c | 23 N_( "Wrong magic number for directory block list structure"), 117 N_( "Ext2fs directory block list is empty"), 185 void initialize_ext2_error_table_r(struct et_list **list); 193 void initialize_ext2_error_table_r(struct et_list **list) argument 197 for (end = list, et = *list; et; end = &et->next, et = et->next)
|
/external/eigen/Eigen/src/StlSupport/ |
H A D | StdList.h | 17 #define EIGEN_EXPLICIT_STL_LIST_INSTANTIATION(...) template class std::list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> >; 24 * std::list such that for data types with alignment issues the correct allocator 32 class list<__VA_ARGS__, _Ay> \ 33 : public list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > \ 35 typedef list<__VA_ARGS__, EIGEN_ALIGNED_ALLOCATOR<__VA_ARGS__> > list_base; \ 41 explicit list(const allocator_type& a = allocator_type()) : list_base(a) {} \ 43 list(InputIterator first, InputIterator last, const allocator_type& a = allocator_type()) : list_base(first, last, a) {} \ 44 list(const list& c) : list_base(c) {} \ 45 explicit list(size_typ 80 class list<T,EIGEN_ALIGNED_ALLOCATOR<T> > class in namespace:std [all...] |
/external/elfutils/src/libelf/ |
H A D | elf32_updatenull.c | 171 Elf_ScnList *list; local 187 list = &elf->state.ELFW(elf,LIBELFBITS).scns; 191 if (list->data[1].shdr.ELFW(e,LIBELFBITS) == NULL) 192 (void) __elfw2(LIBELFBITS,getshdr_wrlock) (&list->data[1]); 196 for (size_t cnt = first == true; cnt < list->cnt; ++cnt) 198 Elf_Scn *scn = &list->data[cnt]; 259 if (list->data[cnt].data_list_rear != NULL) 352 changed. Create the section data list. */ 378 assert (list->next == NULL || list [all...] |
H A D | elf_end.c | 79 /* Remove this structure from the children list. */ 132 Elf_ScnList *list = (elf->class == ELFCLASS32 local 141 size_t cnt = list->max; 147 Elf_Scn *scn = &list->data[cnt]; 166 /* Free the list of data buffers for the section. 180 Elf_ScnList *oldp = list; 181 list = list->next; 182 assert (list == NULL || oldp->cnt == oldp->max); 190 while (list ! [all...] |