Searched defs:list (Results 101 - 125 of 1364) sorted by relevance

1234567891011>>

/external/guava/guava-tests/test/com/google/common/collect/
H A DSortedListsTest.java41 void assertModelAgrees(List<Integer> list, Integer key, int answer, argument
45 if (list.contains(key)) {
46 assertEquals(list.indexOf(key), answer);
51 if (list.contains(key)) {
52 assertEquals(list.lastIndexOf(key), answer);
57 if (list.contains(key)) {
58 assertEquals(key, list.get(answer));
63 if (list.contains(key)) {
64 assertEquals(list.lastIndexOf(key) + 1, answer);
69 if (list
[all...]
/external/icu4c/common/
H A Dbmpset.h90 * inclusive, such that c < list[i]
137 * Inversion list indexes for restricted binary searches in
147 * The inversion list of the parent set, for the slower contains() implementation
149 * The list is terminated with list[listLength-1]=0x110000.
151 const int32_t *list; member in class:BMPSet
/external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/util/
H A DDebugMeshCallback.java10 * notice, this list of conditions and the following disclaimer.
13 * notice, this list of conditions and the following disclaimer in the
45 private ArrayList<Vector3f> list = new ArrayList<Vector3f>(); field in class:DebugMeshCallback
48 list.add(new Vector3f(x, y, z));
52 FloatBuffer buf = BufferUtils.createFloatBuffer(list.size() * 3);
53 for (int i = 0; i < list.size(); i++) {
54 Vector3f vector3f = list.get(i);
/external/kernel-headers/original/linux/mtd/
H A Dpartitions.h61 struct list_head list; member in struct:mtd_part_parser
/external/mesa3d/src/gallium/drivers/r300/compiler/
H A Dradeon_list.c45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value) argument
49 if (*list == NULL) {
50 *list = new_value;
54 for (temp = *list; temp->Next; temp = temp->Next);
60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value) argument
62 if (*list == rm_value) {
63 *list = rm_value->Next;
73 unsigned int rc_list_count(struct rc_list * list) argument
76 while (list) {
78 list
83 rc_list_print(struct rc_list * list) argument
[all...]
/external/mesa3d/src/gallium/drivers/trace/
H A Dtr_texture.h45 struct tr_list list; member in struct:trace_resource
55 struct tr_list list; member in struct:trace_surface
74 struct tr_list list; member in struct:trace_transfer
/external/mesa3d/src/glsl/
H A Dir_import_prototypes.cpp45 import_prototype_visitor(exec_list *list, glsl_symbol_table *symbols, argument
49 this->list = list;
62 list->push_tail(this->function);
96 exec_list *list; member in class:import_prototype_visitor
/external/oprofile/daemon/
H A Dopd_anon.h40 /** hash list */
41 struct list_head list; member in struct:anon_mapping
42 /** lru list */
/external/proguard/src/proguard/util/
H A DListUtil.java37 public static String commaSeparatedString(List list) argument
39 if (list == null)
46 for (int index = 0; index < list.size(); index++)
53 buffer.append(quotedString((String)list.get(index)));
70 List list = new ArrayList();
86 list.add(string.substring(index + 1, nextIndex));
100 list.add(substring);
107 return list;
150 List list = commaSeparatedList(args[0]);
152 System.out.println("Resulting list
[all...]
/external/qemu/android/utils/
H A Dlist.h17 /* Encapsulates a double-linked, circular list.
18 * The list is organized in the following way:
20 * list.
21 * - The list is circular, i.e. the "last" list entry references the "list head"
22 * in its 'next' reference, and the "list head" references the "last" entry in
24 * - The list is empty if its 'next' and 'previous' references are addressing the
25 * head of the list.
29 /* Next entry in the list */
37 alist_init(ACList* list) argument
44 alist_is_empty(const ACList* list) argument
51 alist_insert_head(ACList* list, ACList* entry) argument
61 alist_insert_tail(ACList* list, ACList* entry) argument
85 alist_remove_head(ACList* list) argument
100 alist_remove_tail(ACList* list) argument
[all...]
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowAssetManager.java28 public final String[] list(String path) throws IOException { method in class:ShadowAssetManager
31 return file.list();
/external/srec/srec/Recognizer/src/
H A DRecognizerResult.c56 ESR_ReturnCode SR_RecognizerResultGetKeyList(const SR_RecognizerResult* self, const size_t nbest, LCHAR** list, size_t* size) argument
63 return self->getKeyList(self, nbest, list, size);
/external/srec/srec/Semproc/src/
H A DSemanticResult.c38 ESR_ReturnCode SR_SemanticResultGetKeyList(SR_SemanticResult* self, LCHAR** list, size_t* size) argument
45 return self->getKeyList(self, list, size);
/external/v8/test/cctest/
H A Dtest-list.cc7 // 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);
65 list
145 List<int>* list = new List<int>(0); local
[all...]
/external/webrtc/src/system_wrappers/test/list/
H A Dlist.cc39 void PrintList(ListWrapper& list) argument
41 ListItem* list_item = list.First();
48 list_item = list.Next(list_item);
53 // The list should always be in ascending order
54 void ListSanity(ListWrapper& list)
56 if(list.Empty())
60 ListItem* item_iter = list.First();
68 item_iter = list.Next(item_iter);
147 // Erase the whole list
154 // Test APIs when list i
[all...]
/external/wpa_supplicant_8/hostapd/src/utils/
H A Dtrace.h17 #include "list.h"
22 struct dl_list list; member in struct:wpa_trace_ref
40 dl_list_del(&(ptr)->wpa_trace_ref_##name.list); \
/external/wpa_supplicant_8/src/utils/
H A Dtrace.h17 #include "list.h"
22 struct dl_list list; member in struct:wpa_trace_ref
40 dl_list_del(&(ptr)->wpa_trace_ref_##name.list); \
/external/wpa_supplicant_8/wpa_supplicant/src/utils/
H A Dtrace.h17 #include "list.h"
22 struct dl_list list; member in struct:wpa_trace_ref
40 dl_list_del(&(ptr)->wpa_trace_ref_##name.list); \
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DListExtensions.cs14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
47 public static bool add( this IList list, object value ) argument
49 int count = list.Count;
50 list.Add( value );
51 return list.Count == count + 1;
55 public static void add<T>( this ICollection<T> list, T value ) argument
57 list.Add( value );
61 public static void add<T>( this List<T> list, T value ) argument
63 list
67 add( this IList list, int index, object value ) argument
73 addAll( this List<object> list, IEnumerable items ) argument
79 addAll( this IList list, IEnumerable items ) argument
85 addAll( this ICollection<T> list, IEnumerable<T> items ) argument
93 addElement( this List<object> list, object value ) argument
105 contains( this IList list, object value ) argument
111 contains( this ICollection<T> list, T value ) argument
117 elementAt( this IList<T> list, int index ) argument
123 get( this IList list, int index ) argument
129 get( this IList<T> list, int index ) argument
136 get( this List<T> list, int index ) argument
142 remove( this IList list, int index ) argument
150 remove( this IList<T> list, T item ) argument
156 set( this IList list, int index, object value ) argument
162 set( this IList<T> list, int index, T value ) argument
168 set( this List<T> list, int index, T value ) argument
174 setSize( this List<T> list, int size ) argument
206 subList( this IList list, int fromIndex, int toIndex ) argument
217 subList( this IList<T> list, int fromIndex, int toIndex ) argument
227 subList( this List<T> list, int fromIndex, int toIndex ) argument
[all...]
/external/bison/src/
H A DInadequacyList.c1 /* IELR's inadequacy list.
74 InadequacyList__prependTo (InadequacyList *self, InadequacyList **list) argument
76 InadequacyList *head_old = *list;
77 *list = self;
/external/chromium/base/json/
H A Djson_reader_unittest.cc226 ListValue* list = static_cast<ListValue*>(root.get()); local
227 ASSERT_EQ(3U, list->GetSize());
238 list = static_cast<ListValue*>(root.get());
239 ASSERT_EQ(0U, list->GetSize());
246 list = static_cast<ListValue*>(root.get());
247 ASSERT_EQ(4U, list->GetSize());
276 list = static_cast<ListValue*>(root.get());
277 EXPECT_EQ(1U, list->GetSize());
279 ASSERT_TRUE(list->Get(0, &tmp_value));
439 list
[all...]
/external/chromium/base/
H A Dlinked_list_unittest.cc34 // Checks that when iterating |list| (either from head to tail, or from
37 void ExpectListContentsForDirection(const LinkedList<Node>& list, argument
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
41 node != list.end();
51 void ExpectListContents(const LinkedList<Node>& list, argument
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
72 LinkedList<Node> list; local
107 LinkedList<Node> list; local
182 LinkedList<Node> list; local
219 LinkedList<Node> list; local
[all...]
/external/chromium/chrome/browser/extensions/
H A Dextension_bookmark_helpers.cc64 ListValue* list,
68 list->Append(dict);
71 // Add a JSON representation of |node| to the JSON |list|.
73 ListValue* list,
75 return AddNode(node, list, recurse, false);
79 ListValue* list,
81 return AddNode(node, list, recurse, true);
63 AddNode(const BookmarkNode* node, ListValue* list, bool recurse, bool only_folders) argument
72 AddNode(const BookmarkNode* node, ListValue* list, bool recurse) argument
78 AddNodeFoldersOnly(const BookmarkNode* node, ListValue* list, bool recurse) argument
/external/chromium/chrome/browser/metrics/
H A Dmetrics_service_unittest.cc36 // Store and retrieve empty list.
38 ListValue list; local
41 MetricsService::StoreUnsentLogsHelper(local_list, kMaxLocalListSize, &list);
42 EXPECT_EQ(0U, list.GetSize());
46 MetricsService::RecallUnsentLogsHelper(list, &local_list));
52 ListValue list; local
58 MetricsService::StoreUnsentLogsHelper(local_list, kMaxLocalListSize, &list);
60 // |list| will now contain the following:
62 EXPECT_EQ(3U, list.GetSize());
65 ListValue::const_iterator it = list
92 ListValue list; local
127 ListValue list; local
146 ListValue list; local
165 ListValue list; local
184 ListValue list; local
[all...]
/external/chromium_org/base/containers/
H A Dlinked_list_unittest.cc34 // Checks that when iterating |list| (either from head to tail, or from
37 void ExpectListContentsForDirection(const LinkedList<Node>& list, argument
40 for (const LinkNode<Node>* node = (forward ? list.head() : list.tail());
41 node != list.end();
51 void ExpectListContents(const LinkedList<Node>& list, argument
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
72 LinkedList<Node> list; local
107 LinkedList<Node> list; local
182 LinkedList<Node> list; local
219 LinkedList<Node> list; local
[all...]

Completed in 1089 milliseconds

1234567891011>>