| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.cons/ |
| copy_alloc.pass.cpp | 10 // <list>
12 // list(const list& c, const allocator_type& a);
14 #include <list>
23 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
24 std::list<int, test_allocator<int> > l2(l, test_allocator<int>(3));
29 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
30 std::list<int, other_allocator<int> > l2(l, other_allocator<int>(3));
36 std::list<int, min_allocator<int> > l(3, 2, min_allocator<int>());
37 std::list<int, min_allocator<int> > l2(l, min_allocator<int>())
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::const_iterator i = l2.begin();
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>> l2(a1, a1+3);
40 std::list<int, min_allocator<int>>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| pop_back.pass.cpp | 10 // <list>
18 #include <list>
27 std::list<int> c(a, a+3);
29 assert(c == std::list<int>(a, a+2));
31 assert(c == std::list<int>(a, a+1));
42 std::list<int, min_allocator<int>> c(a, a+3);
44 assert((c == std::list<int, min_allocator<int>>(a, a+2)));
46 assert((c == std::list<int, min_allocator<int>>(a, a+1)));
|
| pop_front.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> c(a, a+3);
25 assert(c == std::list<int>(a+1, a+3));
27 assert(c == std::list<int>(a+2, a+3));
34 std::list<int, min_allocator<int>> c(a, a+3);
36 assert((c == std::list<int, min_allocator<int>>(a+1, a+3)));
38 assert((c == std::list<int, min_allocator<int>>(a+2, a+3)));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 10 // <list>
12 // void merge(list& x);
14 #include <list>
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| merge_comp.pass.cpp | 10 // <list>
12 // template <class Compare> void merge(list& x, Compare comp);
14 #include <list>
26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.cons/ |
| assign_copy.pass.cpp | 10 // <list>
12 // list& operator=(const list& c);
14 #include <list>
22 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
23 std::list<int, test_allocator<int> > l2(l, test_allocator<int>(3));
29 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
30 std::list<int, other_allocator<int> > l2(l, other_allocator<int>(3));
37 std::list<int, min_allocator<int> > l(3, 2, min_allocator<int>());
38 std::list<int, min_allocator<int> > l2(l, min_allocator<int>())
[all...] |
| copy_alloc.pass.cpp | 10 // <list>
12 // list(const list& c, const allocator_type& a);
14 #include <list>
23 std::list<int, test_allocator<int> > l(3, 2, test_allocator<int>(5));
24 std::list<int, test_allocator<int> > l2(l, test_allocator<int>(3));
29 std::list<int, other_allocator<int> > l(3, 2, other_allocator<int>(5));
30 std::list<int, other_allocator<int> > l2(l, other_allocator<int>(3));
36 std::list<int, min_allocator<int> > l(3, 2, min_allocator<int>());
37 std::list<int, min_allocator<int> > l2(l, min_allocator<int>())
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.modifiers/ |
| erase_iter_db2.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::const_iterator i = l2.begin();
38 std::list<int, min_allocator<int>> l1(a1, a1+3);
39 std::list<int, min_allocator<int>> l2(a1, a1+3);
40 std::list<int, min_allocator<int>>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <list>
18 #include <list>
29 std::list<int> l1(a1, a1+3);
30 std::list<int> l2(a1, a1+3);
31 std::list<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
37 std::list<int, min_allocator<int>> l1(a1, a1+3);
38 std::list<int, min_allocator<int>> l2(a1, a1+3);
39 std::list<int, min_allocator<int>>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| pop_back.pass.cpp | 10 // <list>
18 #include <list>
27 std::list<int> c(a, a+3);
29 assert(c == std::list<int>(a, a+2));
31 assert(c == std::list<int>(a, a+1));
42 std::list<int, min_allocator<int>> c(a, a+3);
44 assert((c == std::list<int, min_allocator<int>>(a, a+2)));
46 assert((c == std::list<int, min_allocator<int>>(a, a+1)));
|
| pop_front.pass.cpp | 10 // <list>
14 #include <list>
23 std::list<int> c(a, a+3);
25 assert(c == std::list<int>(a+1, a+3));
27 assert(c == std::list<int>(a+2, a+3));
34 std::list<int, min_allocator<int>> c(a, a+3);
36 assert((c == std::list<int, min_allocator<int>>(a+1, a+3)));
38 assert((c == std::list<int, min_allocator<int>>(a+2, a+3)));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/list/list.ops/ |
| merge.pass.cpp | 10 // <list>
12 // void merge(list& x);
14 #include <list>
25 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
26 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
28 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
35 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
36 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
38 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| merge_comp.pass.cpp | 10 // <list>
12 // template <class Compare> void merge(list& x, Compare comp);
14 #include <list>
26 std::list<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
27 std::list<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
29 assert(c1 == std::list<int>(a3, a3+sizeof(a3)/sizeof(a3[0])));
36 std::list<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
37 std::list<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
39 assert((c1 == std::list<int, min_allocator<int>>(a3, a3+sizeof(a3)/sizeof(a3[0]))));
|
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_ListTest.java | 21 import java.util.List;
27 List<Integer> list; // must contain the Integers 0 to 99 in order field in class:Support_ListTest
33 public Support_ListTest(String p1, List<Integer> l) {
35 list = l;
43 elem = list.get(counter);
48 assertTrue("ListTest - hashCode failed", hashCode == list.hashCode());
50 list.add(50, new Integer(1000));
51 assertTrue("ListTest - a) add with index failed--did not insert", list
55 list.get(51).equals(new Integer(50)))
[all...] |
| /external/slf4j/log4j-over-slf4j/compatibility/src/main/java/test/ |
| LoggerTest.java | 57 event = appender.list.get(0);
59 appender.list.clear();
62 event = appender.list.get(0);
64 appender.list.clear();
68 event = appender.list.get(0);
70 appender.list.clear();
85 assertEquals(1, appender.list.size());
86 appender.list.clear();
89 assertEquals(1, appender.list.size());
90 appender.list.clear()
[all...] |
| /libcore/ojluni/src/main/java/sun/nio/ch/ |
| FileLockTable.java | 66 * @return The list of file locks removed
68 public abstract List<FileLock> removeAll();
85 * SharedFileLockTable uses a list of file lock references to avoid keeping the
104 // The map value is a list of file locks represented by FileLockReferences.
105 // All access to the list must be synchronized on the list.
106 private static ConcurrentHashMap<FileKey, List<FileLockReference>> lockMap =
107 new ConcurrentHashMap<FileKey, List<FileLockReference>>();
125 List<FileLockReference> list = lockMap.get(fileKey) local
178 List<FileLockReference> list = lockMap.get(fileKey); local
200 List<FileLockReference> list = lockMap.get(fileKey); local
231 List<FileLockReference> list = lockMap.get(fileKey); local
264 List<FileLockReference> list = lockMap.get(fk); local
[all...] |
| /libcore/support/src/test/java/tests/support/ |
| Support_ListTest.java | 21 import java.util.List;
27 List<Integer> list; // must contain the Integers 0 to 99 in order field in class:Support_ListTest
33 public Support_ListTest(String p1, List<Integer> l) {
35 list = l;
43 elem = list.get(counter);
48 assertTrue("ListTest - hashCode failed", hashCode == list.hashCode());
50 list.add(50, new Integer(1000));
51 assertTrue("ListTest - a) add with index failed--did not insert", list
55 list.get(51).equals(new Integer(50)))
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| TypeListItem.java | 27 * Representation of a list of class references.
39 /** {@code non-null;} the actual list */
40 private final TypeList list; field in class:TypeListItem
45 * @param list {@code non-null;} the actual list
47 public TypeListItem(TypeList list) {
48 super(ALIGNMENT, (list.size() * ELEMENT_SIZE) + HEADER_SIZE);
50 this.list = list;
56 return StdTypeList.hashContents(list);
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/cst/ |
| CstArray.java | 27 /** {@code non-null;} the actual list of contents */
28 private final List list; field in class:CstArray
33 * @param list {@code non-null;} the actual list of contents
35 public CstArray(List list) {
36 if (list == null) {
37 throw new NullPointerException("list == null");
40 list.throwIfMutable()
[all...] |
