HomeSort by relevance Sort by last modified time
    Searched refs:list (Results 1 - 25 of 2284) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/stlport/test/unit/
list_header_test.cpp 8 #include <list>
  /ndk/sources/android/stlport/test/unit/
list_header_test.cpp 8 #include <list>
  /frameworks/base/tests/CoreTests/android/core/
LinkedListTest.java 49 LinkedList<Integer> list = new LinkedList(); local
51 list.add(i);
52 list.add(i);
53 list.add(i);
54 list.add(i);
55 list.add(i);
56 list.add(i);
57 list.add(i);
58 list.add(i);
59 list.add(i)
65 LinkedList<Integer> list = new LinkedList(); local
82 LinkedList<Integer> list = mLinkedList; local
98 LinkedList<Integer> list = mLinkedList; local
116 LinkedList<Integer> list = mLinkedList; local
133 LinkedList<Integer> list = mLinkedList; local
151 LinkedList<Integer> list = mLinkedList; local
167 LinkedList<Integer> list = mLinkedList; local
185 LinkedList<Integer> list = mLinkedList; local
203 LinkedList<Integer> list = mLinkedList; local
220 LinkedList<Integer> list = new LinkedList(mLinkedList); local
237 LinkedList<Integer> list = new LinkedList(mLinkedList); local
254 LinkedList<Integer> list = new LinkedList(mLinkedList); local
271 LinkedList<Integer> list = new LinkedList(mLinkedList); local
289 LinkedList<Integer> list = new LinkedList(); local
305 LinkedList<String> list; local
331 LinkedList<Integer> list = mLinkedList; local
348 LinkedList<Integer> list = mLinkedList; local
365 LinkedList<Integer> list = mLinkedList; local
382 LinkedList<Integer> list = mLinkedList; local
399 LinkedList<Integer> list = mLinkedList; local
416 LinkedList<Integer> list = mLinkedList; local
432 LinkedList<Integer> list = new LinkedList(); local
449 LinkedList<Integer> list = mLinkedList; local
466 LinkedList<Integer> list = new LinkedList(mLinkedList); local
482 LinkedList<Integer> list = new LinkedList(); local
498 LinkedList<Integer> list = new LinkedList(); local
515 LinkedList<Integer> list = mLinkedList; local
    [all...]
  /external/v8/test/cctest/
test-ast.cc 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
37 TEST(List) {
38 List<AstNode*>* list = new List<AstNode*>(0); local
39 CHECK_EQ(0, list->length());
43 list->Add(node);
44 CHECK_EQ(1, list->length());
45 CHECK_EQ(node, list->at(0))
91 List<int>* list = new List<int>(0); local
    [all...]
test-list.cc 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
54 // Check that we can add (a reference to) an element of the list
57 // Add elements to the list to grow it to its capacity.
58 List<int, ZeroingAllocationPolicy> list(4);
59 list.Add(1);
60 list.Add(2);
61 list.Add(3);
62 list.Add(4)
    [all...]
  /external/v8/src/
frame-element.cc 7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
36 static ZoneObjectList list(10);
37 return &list;
  /system/core/init/
list.h 35 #define list_for_each(node, list) \
36 for (node = (list)->next; node != (list); node = node->next)
38 #define list_for_each_reverse(node, list) \
39 for (node = (list)->prev; node != (list); node = node->prev)
41 void list_init(struct listnode *list);
42 void list_add_tail(struct listnode *list, struct listnode *item);
45 #define list_empty(list) ((list) == (list)->next
    [all...]
  /external/bluetooth/glib/gio/xdgmime/
xdgmimealias.c 65 XdgAliasList *list; local
67 list = malloc (sizeof (XdgAliasList));
69 list->aliases = NULL;
70 list->n_aliases = 0;
72 return list;
76 _xdg_mime_alias_list_free (XdgAliasList *list)
80 if (list->aliases)
82 for (i = 0; i < list->n_aliases; i++)
84 free (list->aliases[i].alias);
85 free (list->aliases[i].mime_type)
    [all...]
xdgmimeicon.c 64 XdgIconList *list; local
66 list = malloc (sizeof (XdgIconList));
68 list->icons = NULL;
69 list->n_icons = 0;
71 return list;
75 _xdg_mime_icon_list_free (XdgIconList *list)
79 if (list->icons)
81 for (i = 0; i < list->n_icons; i++)
83 free (list->icons[i].mime_type);
84 free (list->icons[i].icon_name)
    [all...]
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...]
  /external/chromium/base/third_party/xdg_mime/
xdgmimealias.c 65 XdgAliasList *list; local
67 list = malloc (sizeof (XdgAliasList));
69 list->aliases = NULL;
70 list->n_aliases = 0;
72 return list;
76 _xdg_mime_alias_list_free (XdgAliasList *list)
80 if (list->aliases)
82 for (i = 0; i < list->n_aliases; i++)
84 free (list->aliases[i].alias);
85 free (list->aliases[i].mime_type)
    [all...]
xdgmimeicon.c 64 XdgIconList *list; local
66 list = malloc (sizeof (XdgIconList));
68 list->icons = NULL;
69 list->n_icons = 0;
71 return list;
75 _xdg_mime_icon_list_free (XdgIconList *list)
79 if (list->icons)
81 for (i = 0; i < list->n_icons; i++)
83 free (list->icons[i].mime_type);
84 free (list->icons[i].icon_name)
    [all...]
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...]
  /external/bluetooth/glib/glib/
glist.c 22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
42 #define _g_list_free1(list) g_slice_free (GList, list)
52 * @list: a #GList
58 * If list elements contain dynamically-allocated memory,
63 g_list_free (GList *list)
65 g_slice_free_chain (GList, list, next);
70 * @list: a #GList element
76 g_list_free_1 (GList *list)
898 GList list, *l, *lprev; local
    [all...]
glist.h 22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
50 void g_list_free (GList *list);
51 void g_list_free_1 (GList *list);
53 GList* g_list_append (GList *list,
55 GList* g_list_prepend (GList *list,
57 GList* g_list_insert (GList *list,
60 GList* g_list_insert_sorted (GList *list,
63 GList* g_list_insert_sorted_with_data (GList *list,
67 GList* g_list_insert_before (GList *list,
    [all...]
gslist.c 22 * file for a list of people on the GLib Team. See the ChangeLog
23 * files for a list of changes. These files are distributed with
52 * @list: a #GSList
58 g_slist_free (GSList *list)
60 g_slice_free_chain (GSList, list, next);
65 * @list: a #GSList element
71 g_slist_free_1 (GSList *list)
73 _g_slist_free1 (list);
78 * @list: a #GSList
81 * Adds a new element on to the end of the list
854 GSList list, *l; local
    [all...]
  /external/chromium/base/
linked_list_unittest.cc 34 // Checks that when iterating |list| (either from head to tail, or from
37 void ExpectListContentsForDirection(const LinkedList<Node>& list,
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
41 node != list.end();
51 void ExpectListContents(const LinkedList<Node>& list,
56 ExpectListContentsForDirection(list, num_nodes, node_ids, true);
60 ExpectListContentsForDirection(list, num_nodes, node_ids, false);
65 LinkedList<Node> list; local
66 EXPECT_EQ(list.end(), list.head())
72 LinkedList<Node> list; local
107 LinkedList<Node> list; local
182 LinkedList<Node> list; local
219 LinkedList<Node> list; local
    [all...]
  /packages/apps/Email/tests/src/com/android/email/mail/store/imap/
ImapListTest.java 37 ImapList list = new ImapList(); local
39 assertTrue(list.isList());
40 assertFalse(list.isString());
42 assertTrue(list.isEmpty());
43 assertEquals(0, list.size());
45 list.add(STRING_1);
46 assertFalse(list.isEmpty());
47 assertEquals(1, list.size());
49 list.add(STRING_2);
50 assertEquals(2, list.size())
65 ImapList list = buildList(ImapList.EMPTY, ABC, LIST_1, ImapString.EMPTY); local
96 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
109 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
122 ImapList list = buildList(ImapList.EMPTY, STRING_1, LIST_1, ImapString.EMPTY); local
139 ImapList list = buildList( local
166 ImapList list = buildList(K1, LIST_1); local
179 ImapList list = buildList(K1, STRING_1); local
195 ImapList list = buildList(K1, K2, K3); local
    [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/dbus/dbus/
dbus-list.h 2 /* dbus-list.h Generic linked list utility (internal to D-Bus implementation)
36 DBusList *prev; /**< Previous list node. */
37 DBusList *next; /**< Next list node. */
40 dbus_bool_t _dbus_list_append (DBusList **list,
42 dbus_bool_t _dbus_list_prepend (DBusList **list,
44 dbus_bool_t _dbus_list_insert_before (DBusList **list,
47 dbus_bool_t _dbus_list_insert_after (DBusList **list,
50 void _dbus_list_insert_before_link (DBusList **list,
53 void _dbus_list_insert_after_link (DBusList **list,
    [all...]
  /external/bluetooth/glib/tests/
list-test.c 36 GList *list = NULL; local
42 list = g_list_append (list, GINT_TO_POINTER (array[i]));
45 list = g_list_sort (list, sort);
49 p1 = g_list_nth_data (list, i);
50 p2 = g_list_nth_data (list, i+1);
56 g_list_free (list);
62 GList *list = NULL; local
68 list = g_list_append (list, GINT_TO_POINTER (array[i]))
88 GList *list = NULL; local
113 GList *list = NULL; local
141 GList *list = NULL; local
165 GList *list = NULL; local
    [all...]
  /external/clearsilver/util/
skiplist.c 61 /* list constants */
62 int threaded; /* TRUE if list needs to be thread safe */
64 INT32 maxLevel; /* max level list can reach */
70 static void readLock(skipList list) {
72 mLock(&list->read);
74 if(list->block)
75 cWait(&list->resume, &list->read);
77 list->readers++;
79 mUnlock(&list->read)
362 skipList list; local
    [all...]
  /external/chromium/net/proxy/
proxy_list_unittest.cc 43 // If the proxy list string parsed to empty, automatically fall-back to
57 ProxyList list; local
58 list.SetFromPacString(tests[i].pac_input);
59 EXPECT_EQ(tests[i].pac_output, list.ToPacString());
60 EXPECT_FALSE(list.IsEmpty());
83 ProxyList list; local
84 list.SetFromPacString(tests[i].pac_input);
85 list.RemoveProxiesWithoutScheme(tests[i].filter);
86 EXPECT_EQ(tests[i].filtered_pac_output, list.ToPacString());
99 ProxyList list; local
111 ProxyList list; local
128 ProxyList list; local
    [all...]
  /libcore/luni/src/main/java/org/apache/harmony/kernel/vm/
StringUtils.java 31 * Combine a list of strings in an <code>Object[]</code> into a single
34 * @param list non-null; the strings to combine
37 public static String combineStrings(Object[] list) {
38 int listLength = list.length;
45 return (String) list[0];
52 strLength += ((String) list[i]).length();
58 sb.append(list[i]);
  /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...]

Completed in 356 milliseconds

1 2 3 4 5 6 7 8 91011>>