HomeSort by relevance Sort by last modified time
    Searched refs:list (Results 26 - 50 of 9918) sorted by null

12 3 4 5 6 7 8 91011>>

  /external/chromium_org/net/websockets/
websocket_net_log_params_test.cc 15 base::ListValue* list = new base::ListValue(); local
16 list->Append(new base::StringValue("GET /demo HTTP/1.1"));
17 list->Append(new base::StringValue("Host: example.com"));
18 list->Append(new base::StringValue("Connection: Upgrade"));
19 list->Append(new base::StringValue("Sec-WebSocket-Key2: 12998 5 Y3 1 .P00"));
20 list->Append(new base::StringValue("Sec-WebSocket-Protocol: sample"));
21 list->Append(new base::StringValue("Upgrade: WebSocket"));
22 list->Append(new base::StringValue(
24 list->Append(new base::StringValue("Origin: http://example.com"));
25 list->Append(new base::StringValue(std::string()))
    [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/wpa_supplicant_8/src/utils/
list.h 2 * Doubly-linked list
13 * struct dl_list - Doubly-linked list
20 static inline void dl_list_init(struct dl_list *list)
22 list->next = list;
23 list->prev = list;
26 static inline void dl_list_add(struct dl_list *list, struct dl_list *item)
28 item->next = list->next;
29 item->prev = list;
    [all...]
  /external/chromium-trace/trace-viewer/src/ui/
list_view.css 6 .x-list-view {
10 .x-list-view:focus {
14 .x-list-view * {
18 .x-list-view > .list-item {
22 .x-list-view:focus > .list-item[selected] {
28 .x-list-view > .list-item[selected] {
  /external/chromium_org/chrome/browser/sync_file_system/
file_change_unittest.cc 33 void CreateList(FileChangeList* list, const FileChange (&inputs)[INPUT_SIZE]) {
34 list->clear();
36 list->Update(inputs[i]);
40 void VerifyList(const FileChangeList& list,
42 SCOPED_TRACE(testing::Message() << "actual:" << list.DebugString());
43 ASSERT_EQ(EXPECTED_SIZE, list.size());
44 for (size_t i = 0; i < list.size(); ++i) {
47 << " actual:" << list.list().at(i).DebugString());
48 EXPECT_EQ(expected[i], list.list().at(i))
55 FileChangeList list; local
86 FileChangeList list; local
    [all...]
  /external/chromium_org/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) {
39 List<AstNode*>* list = new List<AstNode*>(0); local
40 CHECK_EQ(0, list->length());
46 list->Add(node);
47 CHECK_EQ(1, list->length());
48 CHECK_EQ(node, list->at(0))
    [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) {
39 List<AstNode*>* list = new List<AstNode*>(0); local
40 CHECK_EQ(0, list->length());
45 list->Add(node);
46 CHECK_EQ(1, list->length());
47 CHECK_EQ(node, list->at(0))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/
copy.pass.cpp 10 // <list>
12 // list(const list& c);
14 #include <list>
23 std::list<int> l(3, 2);
24 std::list<int> l2 = l;
28 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
29 std::list<int, test_allocator<int> > l2 = l;
35 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
36 std::list<int, other_allocator<int> > l2 = l
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
dircache.py 3 The listdir() routine returns a sorted list of the files in a directory,
22 """List directory contents, using cache."""
24 cached_mtime, list = cache[path]
27 cached_mtime, list = -1, []
30 list = os.listdir(path)
31 list.sort()
32 cache[path] = mtime, list
33 return list
37 def annotate(head, list):
39 for i in range(len(list))
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
dircache.py 3 The listdir() routine returns a sorted list of the files in a directory,
22 """List directory contents, using cache."""
24 cached_mtime, list = cache[path]
27 cached_mtime, list = -1, []
30 list = os.listdir(path)
31 list.sort()
32 cache[path] = mtime, list
33 return list
37 def annotate(head, list):
39 for i in range(len(list))
    [all...]
  /external/chromium_org/net/proxy/
proxy_list_unittest.cc 45 // If the proxy list string parsed to empty, automatically fall-back to
59 ProxyList list; local
60 list.SetFromPacString(tests[i].pac_input);
61 EXPECT_EQ(tests[i].pac_output, list.ToPacString());
62 EXPECT_FALSE(list.IsEmpty());
85 ProxyList list; local
86 list.SetFromPacString(tests[i].pac_input);
87 list.RemoveProxiesWithoutScheme(tests[i].filter);
88 EXPECT_EQ(tests[i].filtered_pac_output, list.ToPacString());
99 // An empty list has nothing to try
101 ProxyList list; local
109 ProxyList list; local
120 ProxyList list; local
137 ProxyList list; local
149 ProxyList list; local
166 ProxyList list; local
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
radeon_list.c 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value)
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)
62 if (*list == rm_value) {
63 *list = rm_value->Next;
73 unsigned int rc_list_count(struct rc_list * list)
76 while (list) {
78 list = list->Next
    [all...]
radeon_list.h 40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value);
41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value);
42 unsigned int rc_list_count(struct rc_list * list);
43 void rc_list_print(struct rc_list * list);
  /external/chromium_org/tools/gyp/test/win/compiler-flags/
force-include-files.cc 6 std::list<std::vector<std::string> > l;
  /external/clang/test/Analysis/inlining/
stl.cpp 31 void testList_pop_front(std::list<int> list) {
32 while(!list.empty())
33 list.pop_front(); // no-warning
  /external/mesa3d/src/gallium/drivers/r300/compiler/
radeon_list.c 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value)
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)
62 if (*list == rm_value) {
63 *list = rm_value->Next;
73 unsigned int rc_list_count(struct rc_list * list)
76 while (list) {
78 list = list->Next
    [all...]
radeon_list.h 40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value);
41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value);
42 unsigned int rc_list_count(struct rc_list * list);
43 void rc_list_print(struct rc_list * list);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/
version.pass.cpp 10 // <list>
12 #include <list>
  /packages/apps/Dialer/src/com/android/dialer/list/
OnListFragmentScrolledListener.java 17 package com.android.dialer.list;
  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/list/
list0.hpp 19 #include <boost/mpl/list/aux_/push_front.hpp>
20 #include <boost/mpl/list/aux_/pop_front.hpp>
21 #include <boost/mpl/list/aux_/push_back.hpp>
22 #include <boost/mpl/list/aux_/front.hpp>
23 #include <boost/mpl/list/aux_/clear.hpp>
24 #include <boost/mpl/list/aux_/O1_size.hpp>
25 #include <boost/mpl/list/aux_/size.hpp>
26 #include <boost/mpl/list/aux_/empty.hpp>
27 #include <boost/mpl/list/aux_/begin_end.hpp>
28 #include <boost/mpl/list/aux_/item.hpp
    [all...]
  /external/chromium/net/proxy/
proxy_list_unittest.cc 45 // If the proxy list string parsed to empty, automatically fall-back to
59 ProxyList list; local
60 list.SetFromPacString(tests[i].pac_input);
61 EXPECT_EQ(tests[i].pac_output, list.ToPacString());
62 EXPECT_FALSE(list.IsEmpty());
85 ProxyList list; local
86 list.SetFromPacString(tests[i].pac_input);
87 list.RemoveProxiesWithoutScheme(tests[i].filter);
88 EXPECT_EQ(tests[i].filtered_pac_output, list.ToPacString());
101 ProxyList list; local
113 ProxyList list; local
130 ProxyList list; local
    [all...]
  /libcore/libdvm/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]);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
push_back.pass.cpp 10 // <list>
14 #include <list>
22 std::list<int> c;
26 assert(c == std::list<int>(a, a+5));
30 std::list<int, min_allocator<int>> c;
34 assert((c == std::list<int, min_allocator<int>>(a, a+5)));
push_front.pass.cpp 10 // <list>
14 #include <list>
22 std::list<int> c;
26 assert(c == std::list<int>(a, a+5));
30 std::list<int, min_allocator<int>> c;
34 assert((c == std::list<int, min_allocator<int>>(a, a+5)));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/
remove.pass.cpp 10 // <list>
14 #include <list>
24 std::list<int> c(a1, a1+4);
26 assert(c == std::list<int>(a2, a2+3));
32 std::list<int, min_allocator<int>> c(a1, a1+4);
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+3)));

Completed in 341 milliseconds

12 3 4 5 6 7 8 91011>>