/external/chromium_org/tools/json_schema_compiler/ |
H A D | util.h | 47 // Populates |out| with |list|. Returns false if there is no list at the 48 // specified key or if the list has anything other than |T|. 51 const base::ListValue& list, std::vector<T>* out) { 54 for (size_t i = 0; i < list.GetSize(); ++i) { 55 if (!GetItemFromList(list, i, &value)) 63 // Populates |out| with |from|.|name|. Returns false if there is no list at 64 // the specified key or if the list has anything other than |T|. 70 const base::ListValue* list = NULL; local 71 if (!from.GetListWithoutPathExpansion(name, &list)) 50 PopulateArrayFromList( const base::ListValue& list, std::vector<T>* out) argument 81 PopulateOptionalArrayFromList( const base::ListValue& list, scoped_ptr<std::vector<T> >* out) argument 105 const base::ListValue* list = NULL; local 163 base::ListValue* list = new base::ListValue(); local [all...] |
/external/chromium_org/ui/events/ |
H A D | event_dispatcher.cc | 153 void EventDispatcher::DispatchEventToEventHandlers(EventHandlerList* list, argument 155 for (EventHandlerList::const_iterator it = list->begin(), 156 end = list->end(); it != end; ++it) { 160 while (!list->empty()) { 161 EventHandler* handler = (*list->begin()); 165 if (!list->empty() && *list->begin() == handler) { 167 // have been removed from the list). 170 list->erase(list [all...] |
H A D | event_target.cc | 97 void EventTarget::GetPreTargetHandlers(EventHandlerList* list) { argument 105 list->insert(list->begin(), *it); 111 void EventTarget::GetPostTargetHandlers(EventHandlerList* list) { argument 116 list->push_back(*it);
|
/external/chromium_org/webkit/browser/fileapi/ |
H A D | file_system_operation_context.h | 62 void set_change_observers(const ChangeObserverList& list) { argument 64 change_observers_ = list; 66 void set_update_observers(const UpdateObserverList& list) { argument 68 update_observers_ = list;
|
/external/clang/test/CodeGenCXX/ |
H A D | cxx0x-initializer-stdinitializerlist-startend.cpp | 50 // init the list 81 auto list = { destroyme1(), destroyme1() }; local
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
H A D | DalvInsnList.java | 48 * identical to the ones in the given list, in the same order. 50 * @param list {@code non-null;} the list to use for elements 56 public static DalvInsnList makeImmutable(ArrayList<DalvInsn> list, argument 58 int size = list.size(); 62 result.set(i, list.get(i)); 72 * @param size the size of the list
|
/external/dexmaker/src/dx/java/com/android/dx/rop/cst/ |
H A D | CstArray.java | 26 /** {@code non-null;} the actual list of contents */ 27 private final List list; field in class:CstArray 32 * @param list {@code non-null;} the actual list of contents 34 public CstArray(List list) { argument 35 if (list == null) { 36 throw new NullPointerException("list == null"); 39 list.throwIfMutable(); 41 this.list = list; [all...] |
/external/dropbear/libtomcrypt/src/pk/asn1/der/set/ |
H A D | der_encode_setof.c | 55 @param list The list of items to encode 56 @param inlen The number of items in the list 61 int der_encode_setof(ltc_asn1_list *list, unsigned long inlen, argument 71 if (list[x].type != list[x-1].type) { 82 /* encode list */ 83 if ((err = der_encode_sequence_ex(list, inlen, buf, outlen, LTC_ASN1_SETOF)) != CRYPT_OK) {
|
/external/e2fsprogs/lib/blkid/ |
H A D | list.h | 15 * Simple doubly linked list implementation. 40 * This is only for internal list manipulation where we know 56 * @head: list head to add it after 69 * @head: list head to add it before 80 * Delete a list entry by making the prev/next entries 83 * This is only for internal list manipulation where we know 94 * list_del - deletes entry from list. 95 * @entry: the element to delete from the list. 106 * list_del_init - deletes entry from list and reinitialize it. 107 * @entry: the element to delete from the list 129 list_splice(struct list_head *list, struct list_head *head) argument [all...] |
/external/e2fsprogs/lib/ext2fs/ |
H A D | finddev.c | 43 * This function adds an entry to the directory list 45 static void add_to_dirlist(const char *name, struct dir_list **list) argument 58 dp->next = *list; 59 *list = dp; 63 * This function frees a directory list 65 static void free_dirlist(struct dir_list **list) argument 69 for (dp = *list; dp; dp = next) { 74 *list = 0; 77 static int scan_dir(char *dirname, dev_t device, struct dir_list **list, argument 101 add_to_dirlist(path, list); 127 struct dir_list *list = 0, *new_list = 0; local [all...] |
H A D | kernel-list.h | 5 * Simple doubly linked list implementation. 34 * This is only for internal list manipulation where we know 64 * Delete a list entry by making the prev/next entries 67 * This is only for internal list manipulation where we know 88 * Splice in "list" into "head" 90 static __inline__ void list_splice(struct list_head *list, struct list_head *head) argument 92 struct list_head *first = list->next; 94 if (first != list) { 95 struct list_head *last = list->prev;
|
/external/freetype/src/base/ |
H A D | ftutil.c | 5 /* FreeType utility file for memory and list management (body). */ 242 FT_List_Find( FT_List list, 248 cur = list->head; 264 FT_List_Add( FT_List list, argument 267 FT_ListNode before = list->tail; 276 list->head = node; 278 list->tail = node; 285 FT_List_Insert( FT_List list, argument 288 FT_ListNode after = list->head; 295 list 306 FT_List_Remove( FT_List list, FT_ListNode node ) argument 330 FT_List_Up( FT_List list, FT_ListNode node ) argument 387 FT_List_Finalize( FT_List list, FT_List_Destructor destroy, FT_Memory memory, void* user ) argument [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/guava/guava/src/com/google/common/collect/ |
H A D | SortedLists.java | 36 * 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/jmonkeyengine/engine/src/core/com/jme3/shadow/ |
H A D | ShadowUtil.java | 10 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
169 * @param list
173 public static BoundingBox computeUnionBound(GeometryList list, Transform transform) {
argument 175 for (int i = 0; i < list.size(); i++) {
176 BoundingVolume vol = list.get(i).getWorldBound();
188 * @param list
192 public static BoundingBox computeUnionBound(GeometryList list, Matrix4f mat) {
argument 195 for (int i = 0; i < list.size(); i++) {
196 BoundingVolume vol = list [all...] |
/external/jmonkeyengine/engine/src/test/jme3test/app/ |
H A D | TestIDList.java | 10 * notice, this list of conditions and the following disclaimer. 13 * notice, this list of conditions and the following disclaimer in the 56 // remove a random id from free id list 77 static IDList list = new IDList(); field in class:TestIDList 100 if (!list.moveToNew(slot)){ 134 for (int i = 0; i < list.oldLen; i++){ 135 int slot = list.oldList[i]; 139 list.copyNewToOld();
|
/external/jsilver/src/com/google/clearsilver/jsilver/adaptor/ |
H A D | LoadPathToFileCache.java | 26 * This class implements a cache of a list of loadpaths and a file name to the absolute file name 45 * @param loadPaths the ordered list of directories to search for the file. 62 * @param loadPaths the ordered list of directories to search for the file. 90 * Generate a hashCode to represent the ordered list of loadpaths. Used as a key into the fileMap 96 * hash as the key and throw away the loadpath list 98 * @param list an ordered list of loadpaths. 101 static long hashLoadPath(List<String> list) { argument 103 for (String path : list) {
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
H A D | ACallCommand.java | 78 public void setMacro(List<TWord> list) argument 81 this._macro_.addAll(list); 82 for(TWord e : list) 98 public void setArguments(List<PExpression> list) argument 101 this._arguments_.addAll(list); 102 for(PExpression e : list)
|
H A D | AFunctionExpression.java | 73 public void setArgs(List<PExpression> list) argument 76 this._args_.addAll(list); 77 for(PExpression e : list)
|
/external/junit/src/org/junit/experimental/theories/internal/ |
H A D | AllMembersSupplier.java | 64 List<PotentialAssignment> list= new ArrayList<PotentialAssignment>(); 66 addFields(sig, list); 67 addSinglePointMethods(sig, list); 68 addMultiPointMethods(list); 70 return list; 73 private void addMultiPointMethods(List<PotentialAssignment> list) { argument 77 addArrayValues(dataPointsMethod.getName(), list, dataPointsMethod.invokeExplosively(null)); 85 List<PotentialAssignment> list) { 90 list.add(new MethodParameterValue(dataPointMethod)); 95 List<PotentialAssignment> list) { 84 addSinglePointMethods(ParameterSignature sig, List<PotentialAssignment> list) argument 94 addFields(ParameterSignature sig, List<PotentialAssignment> list) argument 111 addArrayValues(String name, List<PotentialAssignment> list, Object array) argument [all...] |
/external/kernel-headers/original/linux/mtd/ |
H A D | blktrans.h | 23 struct list_head list; member in struct:mtd_blktrans_dev 60 struct list_head list; member in struct:mtd_blktrans_ops
|
/external/kernel-headers/original/linux/ |
H A D | mutex.h | 13 #include <linux/list.h> 41 * - list of all locks held in the system, printout of them 67 struct list_head list; member in struct:mutex_waiter
|
/external/libnl-headers/netlink/ |
H A D | list.h | 2 * netlink/list.h Netlink List Utilities 21 static inline void NL_INIT_LIST_HEAD(struct nl_list_head *list) argument 23 list->next = list; 24 list->prev = list;
|
/external/libppp/src/ |
H A D | iplist.c | 9 * notice, this list of conditions and the following disclaimer. 11 * notice, this list of conditions and the following disclaimer in the 56 iplist_first(struct iplist *list) argument 58 list->cur.pos = -1; 62 iplist_setrange(struct iplist *list, char *range) argument 67 if (!inet_aton(range, &list->cur.ip)) 69 list->cur.lstart = ntohl(list->cur.ip.s_addr); 70 list->cur.nItems = 1; 72 if (!do_inet_aton(range, ptr, &list 99 iplist_nextrange(struct iplist *list) argument 128 iplist_next(struct iplist *list) argument 150 iplist_setsrc(struct iplist *list, const char *src) argument 165 iplist_reset(struct iplist *list) argument 173 iplist_setcurpos(struct iplist *list, long pos) argument 201 iplist_setrandpos(struct iplist *list) argument 208 iplist_ip2pos(struct iplist *list, struct in_addr ip) argument [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_double_list.h | 31 * list handling. No list looping yet. 57 static INLINE void list_add(struct list_head *item, struct list_head *list) argument 59 item->prev = list; 60 item->next = list->next; 61 list->next->prev = item; 62 list->next = item; 65 static INLINE void list_addtail(struct list_head *item, struct list_head *list) argument 67 item->next = list; 68 item->prev = list [all...] |