| /external/libcxx/test/std/strings/basic.string/string.iterators/ |
| cend.pass.cpp | 23 typename S::const_iterator ce = s.cend(); local
24 assert(ce == s.end());
|
| crend.pass.cpp | 23 typename S::const_reverse_iterator ce = s.crend(); local
24 assert(ce == s.rend());
|
| end.pass.cpp | 26 typename S::const_iterator ce = cs.end(); local
30 assert(ce == cs.begin());
33 assert(ce - cs.begin() == cs.size());
|
| rend.pass.cpp | 26 typename S::const_reverse_iterator ce = cs.rend(); local
30 assert(ce == cs.rbegin());
33 assert(ce - cs.rbegin() == cs.size());
|
| /external/v8/test/mjsunit/regress/ |
| regress-crbug-272564.js | 34 function ce(a, b) { function
41 a.width = ce(b, !0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.iterators/ |
| cend.pass.cpp | 23 typename S::const_iterator ce = s.cend(); local
24 assert(ce == s.end());
|
| crend.pass.cpp | 23 typename S::const_reverse_iterator ce = s.crend(); local
24 assert(ce == s.rend());
|
| end.pass.cpp | 26 typename S::const_iterator ce = cs.end(); local
30 assert(ce == cs.begin());
33 assert(ce - cs.begin() == cs.size());
|
| rend.pass.cpp | 26 typename S::const_reverse_iterator ce = cs.rend(); local
30 assert(ce == cs.rbegin());
33 assert(ce - cs.rbegin() == cs.size());
|
| /libcore/luni/src/test/java/libcore/javax/sql/ |
| OldConnectionEventTest.java | 32 ConnectionEvent ce = new ConnectionEvent(ipc); local
34 assertSame(ce2.getSource(),ce.getSource());
39 ConnectionEvent ce = new ConnectionEvent(ipc); local
42 assertNull(ce.getSQLException());
43 assertEquals(ce2.getSQLException(), ce.getSQLException());
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_intersection_comp.pass.cpp | 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
40 assert(base(ce) - ic == sr);
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
44 assert(base(ce) - ic == sr);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_symmetric_difference_comp.pass.cpp | 40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
48 assert(base(ce) - ic == sr);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_union_comp.pass.cpp | 39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 37 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_intersection_comp.pass.cpp | 39 OutIter ce = std::set_intersection(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 38 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
40 assert(base(ce) - ic == sr);
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
44 assert(base(ce) - ic == sr);
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_symmetric_difference_comp.pass.cpp | 40 OutIter ce = std::set_symmetric_difference(Iter1(ia), Iter1(ia+sa), local
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
48 assert(base(ce) - ic == sr);
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 37 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
43 assert(base(ce) - ic == sr);
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_union_comp.pass.cpp | 39 OutIter ce = std::set_union(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == sr);
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/proxy/ |
| InterfaceMaker.java | 103 ClassEmitter ce = new ClassEmitter(v); local
104 ce.begin_class(Constants.V1_2,
113 ce.begin_method(Constants.ACC_PUBLIC | Constants.ACC_ABSTRACT,
117 ce.end_class();
|
| /external/apache-harmony/sql/src/test/java/org/apache/harmony/sql/tests/javax/sql/ |
| ConnectionEventTest.java | 39 ConnectionEvent ce = new ConnectionEvent(ipc); local
40 assertSame(ipc, ce.getSource());
41 assertNull(ce.getSQLException());
52 ConnectionEvent ce = new ConnectionEvent(ipc, null); local
53 assertSame(ipc, ce.getSource());
54 assertNull(ce.getSQLException());
57 ce = new ConnectionEvent(ipc, e);
58 assertSame(ipc, ce.getSource());
59 assertSame(e, ce.getSQLException());
68 ConnectionEvent ce = new ConnectionEvent(ipc, e) local
86 ConnectionEvent ce = new ConnectionEvent(ipc, sqlException); local
[all...] |
| /libcore/ojluni/src/main/java/sun/nio/cs/ |
| ThreadLocalCoders.java | 132 CharsetEncoder ce = (CharsetEncoder)encoderCache.forName(name); local
133 ce.reset();
134 return ce;
|
