Searched refs:list (Results 1 - 25 of 6952) sorted by relevance

1234567891011>>

/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/
H A Dcontainer.fail.cpp19 #include <list>
23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/
H A Dcontainer.fail.cpp19 #include <list>
23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/iterators/predef.iterators/insert.iterators/front.insert.iter.ops/front.insert.iter.cons/
H A Dcontainer.fail.cpp19 #include <list>
23 std::front_insert_iterator<std::list<int> > i = std::list<int>();
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/
H A Dallocator_mismatch.fail.cpp10 // <list>
13 #include <list>
17 std::list<int, std::allocator<long> > l;
H A Dincomplete_type.pass.cpp10 // <list>
12 // Check that std::list and it's iterators can be instantiated with an incomplete
15 #include <list>
18 std::list<A> l;
19 std::list<A>::iterator it;
20 std::list<A>::const_iterator cit;
21 std::list<A>::reverse_iterator rit;
22 std::list<A>::const_reverse_iterator crit;
H A Dversion.pass.cpp10 // <list>
12 #include <list>
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/
H A Dallocator_mismatch.fail.cpp10 // <list>
13 #include <list>
17 std::list<int, std::allocator<long> > l;
H A Dincomplete_type.pass.cpp10 // <list>
12 // Check that std::list and it's iterators can be instantiated with an incomplete
15 #include <list>
18 std::list<A> l;
19 std::list<A>::iterator it;
20 std::list<A>::const_iterator cit;
21 std::list<A>::reverse_iterator rit;
22 std::list<A>::const_reverse_iterator crit;
H A Dversion.pass.cpp10 // <list>
12 #include <list>
/prebuilts/gdb/darwin-x86/lib/python2.7/
H A Ddircache.py3 The listdir() routine returns a sorted list of the files in a directory,
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)):
40 if os.path.isdir(os.path.join(head, list[
[all...]
/prebuilts/gdb/linux-x86/lib/python2.7/
H A Ddircache.py3 The listdir() routine returns a sorted list of the files in a directory,
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)):
40 if os.path.isdir(os.path.join(head, list[
[all...]
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/
H A Dcopy.pass.cpp10 // <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<in
[all...]
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/
H A Dcopy.pass.cpp10 // <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<in
[all...]
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/
H A Dcopy.pass.cpp10 // <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<in
[all...]
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
H A Ddircache.py3 The listdir() routine returns a sorted list of the files in a directory,
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)):
40 if os.path.isdir(os.path.join(head, list[
[all...]
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/
H A Ddircache.py3 The listdir() routine returns a sorted list of the files in a directory,
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)):
40 if os.path.isdir(os.path.join(head, list[
[all...]
/prebuilts/misc/common/swig/include/2.0.11/ruby/
H A Dstd_list.i9 struct traits_asptr<std::list<T> > {
10 static int asptr(VALUE obj, std::list<T> **lis) {
11 return traits_asptr_stdseq<std::list<T> >::asptr(obj, lis);
16 struct traits_from<std::list<T> > {
17 static VALUE from(const std::list<T> & vec) {
18 return traits_from_stdseq<std::list<T> >::from(vec);
24 %ignore std::list::push_back;
25 %ignore std::list::pop_back;
31 %rename("delete") std::list::__delete__;
32 %rename("reject!") std::list
[all...]
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/
H A Dversion.pass.cpp10 // <list>
12 #include <list>
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/
H A Dpush_back.pass.cpp10 // <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)));
H A Dpush_front.pass.cpp10 // <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)));
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/
H A Dunique.pass.cpp10 // <list>
14 #include <list>
24 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 assert(c == std::list<int>(a2, a2+4));
32 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/
H A Dpush_back.pass.cpp10 // <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)));
H A Dpush_front.pass.cpp10 // <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)));
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/
H A Dremove.pass.cpp10 // <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)));
H A Dunique.pass.cpp10 // <list>
14 #include <list>
24 std::list<int> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 assert(c == std::list<int>(a2, a2+4));
32 std::list<int, min_allocator<int>> c(a1, a1+sizeof(a1)/sizeof(a1[0]));
34 assert((c == std::list<int, min_allocator<int>>(a2, a2+4)));

Completed in 3631 milliseconds

1234567891011>>