Searched refs:list (Results 276 - 300 of 1871) sorted by relevance

<<11121314151617181920>>

/external/webkit/Tools/QtTestBrowser/
H A Dutils.cpp10 * notice, this list of conditions and the following disclaimer.
12 * notice, this list of conditions and the following disclaimer in the
52 QList<QString> list; local
60 list.append(key.remove(strip));
64 return list;
/external/kernel-headers/original/linux/
H A Dskbuff.h187 * @next: Next buffer in list
188 * @prev: Previous buffer in list
410 * @list: queue head
414 static inline int skb_queue_empty(const struct sk_buff_head *list) argument
416 return list->next == (struct sk_buff *)list;
556 * @list_: list to peek at
560 * list and someone else may run off with it. You must hold
563 * Returns %NULL for an empty list or a pointer to the head element.
569 struct sk_buff *list local
590 struct sk_buff *list = ((struct sk_buff *)list_)->prev; local
615 skb_queue_head_init(struct sk_buff_head *list) argument
640 __skb_queue_after(struct sk_buff_head *list, struct sk_buff *prev, struct sk_buff *newsk) argument
664 __skb_queue_head(struct sk_buff_head *list, struct sk_buff *newsk) argument
681 __skb_queue_tail(struct sk_buff_head *list, struct sk_buff *newsk) argument
704 __skb_dequeue(struct sk_buff_head *list) argument
727 __skb_insert(struct sk_buff *newsk, struct sk_buff *prev, struct sk_buff *next, struct sk_buff_head *list) argument
741 __skb_append(struct sk_buff *old, struct sk_buff *newsk, struct sk_buff_head *list) argument
751 __skb_unlink(struct sk_buff *skb, struct sk_buff_head *list) argument
775 __skb_dequeue_tail(struct sk_buff_head *list) argument
1082 __skb_queue_purge(struct sk_buff_head *list) argument
[all...]
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
H A DCollectionsTest.java112 // ensure the list either contains the numbers from 0 to size-1 or
150 // answer true iff the list is filled with a counting sequence
152 // else the list with be filled starting at 0 to size - 1
162 // answer the number of checks that have been performed on the list
192 // ensure the list either contains the numbers from 0 to size-1 or
237 // answer true iff the list is filled with a counting sequence
239 // else the list with be filled starting at 0 to size - 1
249 // answer the number of checks that have been performed on the list
290 // Ensure a NPE is thrown if the list is NULL
293 fail("Expected NullPointerException for null list paramete
609 testShuffle(List list, String type, boolean random) argument
927 testRotate(List list, String type) argument
974 getString(List list) argument
[all...]
H A DArrayListTest.java91 ArrayList<String> list = new ArrayList<String>(collection);
92 assertFalse(list.contains(null));
103 assertTrue("Failed to fix up list after insert",
195 assertEquals("Returned incorrect size after adding to existing list",
252 assertTrue("The object list is not the same as original list", list1
263 assertTrue("The object list is not the same as original list", obj
369 assertEquals("Returned incorrect size after adding to existing list",
372 assertTrue("Added to list i
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.test.performance.ui/src/org/eclipse/test/internal/performance/results/model/
H A DBuildResultsElement.java92 List list = new ArrayList();
94 list.add("This test and/or its variation has a small value, hence it may not be necessary to spend time on fixing it if a regression occurs");
97 list.add("The student-t test error on this test is over the threshold");
99 String[] infos = new String[list.size()];
100 if (list.size() > 0) {
101 list.toArray(infos);
108 List list = new ArrayList();
110 list.add("The error on this test is over the 3% threshold, hence its result may not be really reliable");
113 list.add("The results history shows that the variation of its delta is over 20%, hence its result is surely not reliable");
116 list
[all...]
/external/dropbear/libtomcrypt/src/pk/asn1/der/sequence/
H A Dder_length_sequence.c22 @param list The sequences of items in the SEQUENCE
27 int der_length_sequence(ltc_asn1_list *list, unsigned long inlen, argument
34 LTC_ARGCHK(list != NULL);
40 type = list[i].type;
41 size = list[i].size;
42 data = list[i].data;
/external/libnl-headers/netlink/
H A Dlist.h2 * 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/chromium/chrome/common/extensions/docs/examples/api/webNavigation/basic/
H A Dnavigation_collector.js12 * Collects navigation events, and provides a list of successful requests
22 * A list of currently pending requests, implemented as a hash of each
31 * A list of completed requests, implemented as a hash of each
40 * A list of requests that errored off, implemented as a hash of each
288 * @return {Object.<string, NavigationCollector.Request>} The complete list of
297 * @return {Object.<string, Navigationcollector.Request>} The complete list of
306 * Get a list of the X most requested URLs.
311 * @return {Object.<string, NavigationCollector.Request>} The list of
320 * Get a list of the X most errored URLs.
325 * @return {Object.<string, NavigationCollector.Request>} The list o
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DAbstractListMultimapTest.java181 List<Integer> list = multimap.get("foo");
183 list.add(1, 2);
187 list.addAll(3, asList(4, 8));
191 assertEquals(8, list.get(4).intValue());
192 assertEquals(4, list.indexOf(8));
193 assertEquals(4, list.lastIndexOf(8));
195 list.remove(4);
199 list.set(4, 10);
211 List<Integer> list = multimap.get("foo");
213 List<Integer> sublist = list
[all...]
H A DConstraintsTest.java179 List<String> list = Lists.newArrayList("foo", "bar");
181 list, TEST_CONSTRAINT);
182 list.add(TEST_ELEMENT);
188 assertTrue(list.equals(constrained));
189 assertTrue(constrained.equals(list));
190 assertEquals(list.toString(), constrained.toString());
191 assertEquals(list.hashCode(), constrained.hashCode());
192 ASSERT.that(list).hasContentsInOrder(
200 ASSERT.that(list).hasContentsInOrder(
208 List<String> list
[all...]
/external/webkit/Source/WebCore/loader/cache/
H A DCachedFont.cpp9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
150 RefPtr<NodeList> list = m_externalSVGDocument->getElementsByTagNameNS(SVGNames::fontTag.namespaceURI(), SVGNames::fontTag.localName()); local
151 if (!list)
154 unsigned listLength = list->length();
160 ASSERT(list->item(i));
161 ASSERT(list->item(i)->hasTagName(SVGNames::fontTag));
166 return static_cast<SVGFontElement*>(list->item(0));
169 SVGFontElement* element = static_cast<SVGFontElement*>(list->item(i));
/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/chromium/chrome/browser/ui/webui/
H A Dnet_internals_ui.cc173 void OnRendererReady(const ListValue* list);
174 void OnEnableHttpThrottling(const ListValue* list);
182 void OnLoadLogFile(const ListValue* list);
271 void OnRendererReady(const ListValue* list);
273 void OnGetProxySettings(const ListValue* list);
274 void OnReloadProxySettings(const ListValue* list);
275 void OnGetBadProxies(const ListValue* list);
276 void OnClearBadProxies(const ListValue* list);
277 void OnGetHostResolverInfo(const ListValue* list);
278 void OnClearHostResolverCache(const ListValue* list);
504 OnLoadLogFile(const ListValue* list) argument
622 OnRendererReady(const ListValue* list) argument
632 OnEnableHttpThrottling(const ListValue* list) argument
725 OnRendererReady( const ListValue* list) argument
885 OnGetProxySettings( const ListValue* list) argument
899 OnReloadProxySettings( const ListValue* list) argument
908 OnGetBadProxies( const ListValue* list) argument
933 OnClearBadProxies( const ListValue* list) argument
942 OnGetHostResolverInfo( const ListValue* list) argument
1012 OnClearHostResolverCache( const ListValue* list) argument
1024 OnEnableIPv6( const ListValue* list) argument
1039 OnStartConnectionTests( const ListValue* list) argument
1054 OnHSTSQuery( const ListValue* list) argument
1100 OnHSTSAdd( const ListValue* list) argument
1148 OnHSTSDelete( const ListValue* list) argument
1165 OnGetHttpCacheInfo( const ListValue* list) argument
1188 OnGetSocketPoolInfo( const ListValue* list) argument
1201 OnFlushSocketPools( const ListValue* list) argument
1210 OnCloseIdleSockets( const ListValue* list) argument
1219 OnGetSpdySessionInfo( const ListValue* list) argument
1232 OnGetSpdyStatus( const ListValue* list) argument
1256 OnGetSpdyAlternateProtocolMappings( const ListValue* list) argument
1284 OnGetServiceProviders( const ListValue* list) argument
1325 OnSetLogLevel( const ListValue* list) argument
[all...]
/external/qemu/
H A Dqemu-config.c82 { /* end of list */ }
155 { /* end of list */ }
174 { /*End of list */ }
197 { /*End of list */ }
211 { /* end of list */ }
224 { /* end of list */ }
237 { /* end of list */ }
255 { /* end of list */ }
273 { /* end of list */ }
295 { /* end of list */ }
489 qemu_add_opts(QemuOptsList *list) argument
508 QemuOptsList *list; local
556 QemuOptsList *list; member in struct:ConfigWriteData
600 QemuOptsList *list = NULL; local
[all...]
/external/stlport/stlport/stl/pointers/
H A D_list.h29 #define LIST_IMPL _STLP_PTR_IMPL_NAME(list)
54 # define list _STLP_NON_DBG_NAME(list) macro
59 class list class in inherits:__stlport_class
60 #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (list)
61 : public __stlport_class<list<_Tp, _Alloc> >
70 typedef list<_Tp, _Alloc> _Self;
92 explicit list(const allocator_type& __a = allocator_type()) function in class:list
96 explicit list(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(value_type), function in class:list
98 list(size_typ
105 explicit list(size_type __n) function in class:list
111 list(_InputIterator __first, _InputIterator __last, function in class:list
123 list(_InputIterator __first, _InputIterator __last) function in class:list
133 list(const value_type *__first, const value_type *__last, function in class:list
138 list(const_iterator __first, const_iterator __last, function in class:list
145 list(const _Self& __x) : _M_impl(__x._M_impl) {} function in class:list
148 list(__move_source<_Self> src) function in class:list
330 # undef list macro
[all...]
/external/dbus/bus/
H A Dpolicy.c29 #include <dbus/dbus-list.h>
149 DBusList **list = data; local
151 if (list == NULL) /* DBusHashTable is on crack */
154 _dbus_list_foreach (list, free_rule_func, NULL);
156 _dbus_list_clear (list);
158 dbus_free (list);
239 add_list_to_client (DBusList **list, argument
244 link = _dbus_list_get_first_link (list);
248 link = _dbus_list_get_next_link (list, link);
305 DBusList **list; local
329 DBusList **list; local
377 list_allows_user(dbus_bool_t def, DBusList **list, unsigned long uid, const unsigned long *group_ids, int n_group_ids) argument
519 DBusList **list; local
544 DBusList **list; local
564 DBusList **list; local
602 append_copy_of_policy_list(DBusList **list, DBusList **to_append) argument
643 DBusList **list = _dbus_hash_iter_get_value (&iter); local
[all...]
/external/mesa3d/src/glsl/glcpp/
H A Dglcpp-parse.c129 _string_list_append_item (string_list_t *list, const char *str);
132 _string_list_contains (string_list_t *list, const char *member, int *index);
135 _string_list_length (string_list_t *list);
144 _argument_list_append (argument_list_t *list, token_list_t *argument);
147 _argument_list_length (argument_list_t *list);
150 _argument_list_member_at (argument_list_t *list, int index);
167 _token_list_append (token_list_t *list, token_t *token);
170 _token_list_append_list (token_list_t *list, token_list_t *tail);
176 _active_list_push (active_list_t *list,
181 _active_list_pop (active_list_t *list);
2887 string_list_t *list; local
2897 _string_list_append_item(string_list_t *list, const char *str) argument
2916 _string_list_contains(string_list_t *list, const char *member, int *index) argument
2936 _string_list_length(string_list_t *list) argument
2978 argument_list_t *list; local
2988 _argument_list_append(argument_list_t *list, token_list_t *argument) argument
3007 _argument_list_length(argument_list_t *list) argument
3022 _argument_list_member_at(argument_list_t *list, int index) argument
3071 token_list_t *list; local
3082 _token_list_append(token_list_t *list, token_t *token) argument
3103 _token_list_append_list(token_list_t *list, token_list_t *tail) argument
3135 _token_list_trim_trailing_space(token_list_t *list) argument
3355 _token_list_print(glcpp_parser_t *parser, token_list_t *list) argument
3376 token_list_t *list; local
3547 token_list_t *list; local
3558 _glcpp_parser_expand_if(glcpp_parser_t *parser, int type, token_list_t *list) argument
3808 _active_list_push(active_list_t *list, const char *identifier, token_node_t *marker) argument
3823 _active_list_pop(active_list_t *list) argument
3837 _active_list_contains(active_list_t *list, const char *identifier) argument
3857 _glcpp_parser_expand_token_list(glcpp_parser_t *parser, token_list_t *list) argument
3926 _glcpp_parser_print_expanded_token_list(glcpp_parser_t *parser, token_list_t *list) argument
4111 glcpp_parser_lex_from(glcpp_parser_t *parser, token_list_t *list) argument
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DIterables.java191 List<T> list, Predicate<? super T> predicate) {
197 for (; from < list.size(); from++) {
198 T element = list.get(from);
202 list.set(to, element);
204 slowRemoveIfForRemainingElements(list, predicate, to, from);
213 list.subList(to, list.size()).clear();
217 private static <T> void slowRemoveIfForRemainingElements(List<T> list, argument
226 // Check from the end of the list backwards (minimize expected cost of
229 for (int n = list
190 removeIfFromRandomAccessList( List<T> list, Predicate<? super T> predicate) argument
847 getLastInNonemptyList(List<T> list) argument
1035 reverse(final List<T> list) argument
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DIterables.java188 List<T> list, Predicate<? super T> predicate) {
194 for (; from < list.size(); from++) {
195 T element = list.get(from);
199 list.set(to, element);
201 slowRemoveIfForRemainingElements(list, predicate, to, from);
210 list.subList(to, list.size()).clear();
214 private static <T> void slowRemoveIfForRemainingElements(List<T> list, argument
223 // Check from the end of the list backwards (minimize expected cost of
226 for (int n = list
187 removeIfFromRandomAccessList( List<T> list, Predicate<? super T> predicate) argument
805 getLastInNonemptyList(List<T> list) argument
993 reverse(final List<T> list) argument
[all...]
/external/iptables/libiptc/
H A Dlinux_list.h38 * non-initialized list entries.
44 * Simple doubly linked list implementation.
69 * This is only for internal list manipulation where we know
85 * @head: list head to add it after
98 * @head: list head to add it before
111 * This is only for internal list manipulation where we know
125 * list_add_rcu - add a new entry to rcu-protected list
127 * @head: list head to add it after
134 * with another list-mutation primitive, such as list_add_rcu()
135 * or list_del_rcu(), running on this same list
238 list_move(struct list_head *list, struct list_head *head) argument
249 list_move_tail(struct list_head *list, struct list_head *head) argument
283 __list_splice(struct list_head *list, struct list_head *head) argument
302 list_splice(struct list_head *list, struct list_head *head) argument
315 list_splice_init(struct list_head *list, struct list_head *head) argument
[all...]
/external/skia/src/ports/
H A DSkFontHost_simple.cpp100 // should never get here, since the faces list should not be empty
101 SkDEBUGFAIL("faces list is empty");
170 SkDEBUGFAIL("Yikes, couldn't find family in our list to remove/delete");
174 NameFamilyPair* list = gNameList.begin(); local
177 int index = SkStrLCSearch(&list[0].fName, count, name, sizeof(list[0]));
180 return find_best_face(list[index].fFamily, style);
195 NameFamilyPair* list = gNameList.begin(); local
198 int index = SkStrLCSearch(&list[0].fName, count, name, sizeof(list[
214 SkTDArray<NameFamilyPair>& list = gNameList; local
613 const uint32_t* list = gFallbackFonts; local
[all...]
/external/webkit/Source/WebKit/mac/History/
H A DWebBackForwardList.mm9 * notice, this list of conditions and the following disclaimer.
11 * notice, this list of conditions and the following disclaimer in the
202 static NSArray* vectorToNSArray(HistoryItemVector& list)
204 unsigned size = list.size();
207 [result addObject:kit(list[i].get())];
222 HistoryItemVector list;
223 core(self)->backListWithLimit(limit, list);
224 NSArray *result = vectorToNSArray(list);
237 HistoryItemVector list;
238 core(self)->forwardListWithLimit(limit, list);
[all...]
/external/doclava/res/assets/templates/components/
H A Dleft_nav.cs21 <?cs call:list("Interfaces", class.package.interfaces) ?>
22 <?cs call:list("Classes", class.package.classes) ?>
23 <?cs call:list("Enums", class.package.enums) ?>
24 <?cs call:list("Exceptions", class.package.exceptions) ?>
25 <?cs call:list("Errors", class.package.errors) ?>
/external/wpa_supplicant_8/hostapd/src/wps/
H A Dwps_upnp_event.c49 struct dl_list list; member in struct:wps_event_
89 e = dl_list_first(&s->event_queue, struct wps_event_, list);
93 dl_list_del(&e->list);
140 dl_list_add(&s->event_queue, &e->list);
194 dl_list_del(&e->addr->list);
202 dl_list_del(&s->list);
290 dl_list_for_each(e->addr, &s->addr_list, struct subscr_addr, list)
323 list) {
408 dl_list_init(&e->list);
420 dl_list_add_tail(&s->event_queue, &e->list);
[all...]
/external/wpa_supplicant_8/src/wps/
H A Dwps_upnp_event.c49 struct dl_list list; member in struct:wps_event_
89 e = dl_list_first(&s->event_queue, struct wps_event_, list);
93 dl_list_del(&e->list);
140 dl_list_add(&s->event_queue, &e->list);
194 dl_list_del(&e->addr->list);
202 dl_list_del(&s->list);
290 dl_list_for_each(e->addr, &s->addr_list, struct subscr_addr, list)
323 list) {
408 dl_list_init(&e->list);
420 dl_list_add_tail(&s->event_queue, &e->list);
[all...]

Completed in 1578 milliseconds

<<11121314151617181920>>