| /dalvik/dx/src/com/android/dx/util/_tests/ |
| _IntList.java | 32 IntList list = new IntList(sz); local
34 list.add(i * 2);
37 boolean contains = list.contains(i);
44 assertFalse(label(sz, -1), list.contains(-1));
45 assertFalse(label(sz, sz * 2), list.contains(sz * 2));
50 IntList list = new IntList(2); local
52 list.add(9);
53 list.add(12);
55 assertTrue(list.contains(9));
56 assertTrue(list.contains(12))
60 IntList list = new IntList(2); local
[all...] |
| /dalvik/dx/src/com/android/dx/rop/cst/ |
| CstArray.java | 27 /** {@code non-null;} the actual list of contents */
28 private final List list; field in class:CstArray
33 * @param list {@code non-null;} the actual list of contents
35 public CstArray(List list) {
36 if (list == null) {
37 throw new NullPointerException("list == null");
40 list.throwIfMutable()
[all...] |
| /external/bluetooth/glib/gio/xdgmime/ |
| xdgmimeparent.c | 66 XdgParentList *list; local
68 list = malloc (sizeof (XdgParentList));
70 list->parents = NULL;
71 list->n_mimes = 0;
73 return list;
77 _xdg_mime_parent_list_free (XdgParentList *list)
82 if (list->parents)
84 for (i = 0; i < list->n_mimes; i++)
86 for (p = list->parents[i].parents; *p; p++)
89 free (list->parents[i].parents)
[all...] |
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| ulist.h | 17 /// \class list ulist.h ustl.h
20 /// \brief Linked list, defined as an alias to \ref vector.
23 class list : public vector<T> { class in namespace:ustl
31 inline list (void) : vector<T> () {} function in class:ustl::list
32 inline explicit list (size_type n) : vector<T> (n) {} function in class:ustl::list
33 inline list (size_type n, const T& v) : vector<T> (n, v) {} function in class:ustl::list
34 inline list (const list<T>& v) : vector<T> (v) {} function in class:ustl::list
35 inline list (const_iterator i1, const_iterator i2) : vector<T> (i1, i2) {} function in class:ustl::list
48 void merge (list<T>& l)
[all...] |
| /external/icu4c/common/ |
| ulist.h | 19 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);
|
| /hardware/ti/wlan/wl1271/stad/src/Data_link/ |
| GeneralUtil.c | 12 * notice, this list of conditions and the following disclaimer.
14 * notice, this list of conditions and the following disclaimer in
41 * LIST OBJ *
45 * The list object mange the allocation and deallocation of generic element.
46 * The obj create a list of N generic elements and fined a free entry for the Alloc process.
57 * DESCRIPTION: This function initializes the List data module.
60 * MaxNumOfElements - the number of elemnts that will be Managed by the list
61 ContainerSize - The size of the basic data type managed by the list
65 * RETURN: Handle to the allocated List data control block
70 List_t *List;
[all...] |
| /system/wlan/ti/sta_dk_4_0_4_32/common/src/core/data_ctrl/Ctrl/TrafficMonitor/ |
| GeneralUtil.c | 12 **| notice, this list of conditions and the following disclaimer. |**
14 **| notice, this list of conditions and the following disclaimer in |**
41 * LIST OBJ *
45 * The list object mange the allocation and deallocation of generic element.
46 * The obj create a list of N generic elements and fined a free entry for the Alloc process.
57 * DESCRIPTION: This function initializes the List data module.
60 * MaxNumOfElements - the number of elemnts that will be Managed by the list
61 ContainerSize - The size of the basic data type managed by the list
65 * RETURN: Handle to the allocated List data control block
70 List_t *List;
[all...] |
| /system/wlan/ti/wilink_6_1/stad/src/Data_link/ |
| GeneralUtil.c | 12 * notice, this list of conditions and the following disclaimer.
14 * notice, this list of conditions and the following disclaimer in
41 * LIST OBJ *
45 * The list object mange the allocation and deallocation of generic element.
46 * The obj create a list of N generic elements and fined a free entry for the Alloc process.
57 * DESCRIPTION: This function initializes the List data module.
60 * MaxNumOfElements - the number of elemnts that will be Managed by the list
61 ContainerSize - The size of the basic data type managed by the list
65 * RETURN: Handle to the allocated List data control block
70 List_t *List;
[all...] |
| /external/freetype/include/freetype/ |
| ftlist.h | 5 /* Generic list support for FreeType (specification). */
21 /* This file implements functions relative to list processing. Its */
50 /* List Processing */
56 /* This section contains various definitions related to list */
84 /* Find the list node for a given listed object. */
87 /* list :: A pointer to the parent list. */
91 /* List node. NULL if it wasn't found. */
94 FT_List_Find( FT_List list,
104 /* Append an element to the end of a list. *
[all...] |
| /packages/apps/IM/src/com/android/im/engine/ |
| ContactListManager.java | 22 import java.util.List;
32 * ContactListManager state that indicates the contact list(s) has not been loaded.
37 * ContactListManager state that indicates the contact list(s) is loading.
42 * ContactListManager state that indicates the blocked list has been loaded.
47 * ContactListManager state that indicates the contact list(s) has been loaded.
62 * A pending list of blocking contacts which is used for checking duplicated
67 * A pending list of deleting contacts which is used for checking duplicated
112 * list changed.
159 * @return the Contact or null if the Contact doesn't exist in any list.
166 for (ContactList list : mContactLists)
[all...] |
| /cts/tools/dex-tools/src/dex/structure/ |
| DexClass.java | 19 import java.util.List;
27 * Returns a list containing the names of all implemented interfaces.
29 * @return a list containing the names of all implemented interfaces
31 List<String> getInterfaces();
41 * Returns a list containing all fields declared by this {@code DexClass}.
43 * @return a list containing all fields declared by this {@code DexClass}
45 List<DexField> getFields();
48 * Returns a list containing all methods declared by this {@code DexClass}.
50 * @return a list containing all methods declared by this {@code DexClass}
52 List<DexMethod> getMethods()
[all...] |
| /external/clearsilver/util/ |
| skiplist.h | 28 * <maxLevel> should be calculated from expected list size using (^ = power):
41 /* SKIP LIST TYPEDEFS */
48 * Function: skipNewList - create a skip list.
49 * Description: Returns a new skip list. If <threaded> is true, list is
57 * Input: threaded - true if list should be thread-safe.
65 * Return: New skip list, NULL on error.
69 void skipFreeList(skipList list);
71 * Function: skipFreeList - free a skip list.
72 * Description: Release all resources used by <list> including all key/valu
[all...] |
| /external/srec/seti/sltsEngine/src/ |
| linklist_impl.c | 33 1. pool of linked list nodes - from static allocated array
121 For now, dynamically allocate a new list node with the data
123 LListResult Insert(LList *list, void *data)
131 if(list->head == NULL){
132 /* if list is empty, assign to head */
133 list->head = newnode;
134 (list->head)->next = NULL;
135 (list->head)->prev = NULL;
138 list->curr = list->head
[all...] |
| /external/proguard/src/proguard/util/ |
| ListUtil.java | 28 * <code>java.util.List</code> objects.
35 * Creates a comma-separated String from the given List of String objects.
37 public static String commaSeparatedString(List list)
39 if (list == null)
46 for (int index = 0; index < list.size(); index++)
53 buffer.append(quotedString((String)list.get(index)));
61 * Creates a List of String objects from the given comma-separated String.
63 public static List commaSeparatedList(String string)
70 List list = new ArrayList() local
150 List list = commaSeparatedList(args[0]); local
160 List list = Arrays.asList(args); local
[all...] |
| /external/blktrace/btt/ |
| list.h | 29 * non-initialized list entries.
43 static inline void INIT_LIST_HEAD(struct list_head *list)
45 list->next = list;
46 list->prev = list;
52 * This is only for internal list manipulation where we know
68 * @head: list head to add it after
81 * @head: list head to add it before
92 * Delete a list entry by making the prev/next entrie
[all...] |
| /external/e2fsprogs/tests/f_badorphan/ |
| expect.1 | 8 Inodes that were part of a corrupted orphan linked list found. Fix? yes
10 Inode 13 was part of the orphaned inode list. FIXED.
11 Inode 17 was part of the orphaned inode list. FIXED.
14 Inode 19 was part of the orphaned inode list. FIXED.
15 Inode 22 was part of the orphaned inode list. FIXED.
16 Inode 23 was part of the orphaned inode list. FIXED.
17 Inode 24 was part of the orphaned inode list. FIXED.
18 Inode 25 was part of the orphaned inode list. FIXED.
19 Inode 26 was part of the orphaned inode list. FIXED.
20 Inode 27 was part of the orphaned inode list. FIXED
[all...] |
| /external/guava/src/com/google/common/collect/ |
| Lists.java | 32 import java.util.List;
43 * Static utility methods pertaining to {@link List} instances. Also see this
76 * @param elements the elements that the list should contain, in order
84 ArrayList<E> list = new ArrayList<E>(capacity); local
85 Collections.addAll(list, elements);
86 return list;
103 * @param elements the elements that the list should contain, in order
126 * @param elements the elements that the list should contain, in order
132 ArrayList<E> list = newArrayList(); local
134 list.add(elements.next())
210 LinkedList<E> list = newLinkedList(); local
[all...] |
| /external/clearsilver/man/man3/ |
| skipNext.3 | 20 void *skipNext(skipList list, UINT32 *pkey, void **plock);
25 list - list to search in.
32 Searches in list <list> for item with key next larger
40 MT-Level: Safe if <list> thread-safe.
|
| skipSearch.3 | 14 skipSearch - search a skip list.
20 void *skipSearch(skipList list, UINT32 key, void **plock);
25 list - list to search in.
32 Searches for <key> in <list>, and returns value if
39 MT-Level: Safe if <list> thread-safe.
|
| skipRelease.3 | 20 void skipRelease(skipList list, void *lock);
25 list - list containing value to release.
34 MT-Level: Safe if <list> thread-safe.
|
| /dalvik/vm/ |
| PointerSet.c | 22 * Sorted, expanding list of pointers.
27 const void** list; member in struct:PointerSet
39 const void* cur = pSet->list[i];
59 pSet->list = malloc(sizeof(const void*) * initialSize);
60 if (pSet->list == NULL) {
79 if (pSet->list != NULL) {
80 free(pSet->list);
81 pSet->list = NULL;
95 * Get the number of pointers currently stored in the list.
103 * Get the Nth entry from the list
[all...] |
| /dalvik/libcore/prefs/src/main/java/java/util/prefs/ |
| NodeSet.java | 15 ArrayList<Node> list = new ArrayList<Node>(); field in class:NodeSet
19 list.add(nodes.next());
24 return list.size();
30 result = list.get(index);
|
| /external/dbus/test/data/auth/ |
| mechanisms.auth-script | 1 ## this tests that the server sends a list of mechanisms
|
| /external/elfutils/libelf-po/ |
| POTFILES.in | 0 # List of files which containing translatable strings.
|
| /hardware/ti/omap3/dspbridge/libbridge/inc/ |
| list.h | 2 * dspbridge/mpu_api/inc/list.h
20 * ======== list.h ========
22 * Declarations of list management control structures and definitions
23 * of inline list management functions.
79 * Allocates and initializes a circular list.
81 * Uses portable MEM_Calloc() function to allocate a list containing
83 * is the "end of the list" (i.e., the list is empty).
84 * An empty list is indicated by the "next" pointer in the element
85 * at the head of the list pointing to the head of the list, itself
[all...] |
