Searched defs:ce (Results 1 - 25 of 114) sorted by relevance

12345

/external/v8/test/mjsunit/regress/
H A Dregress-crbug-272564.js34 function ce(a, b) { function
41 a.width = ce(b, !0);
/external/libcxx/test/std/strings/basic.string/string.iterators/
H A Dcend.pass.cpp23 typename S::const_iterator ce = s.cend(); local
24 assert(ce == s.end());
H A Dcrend.pass.cpp23 typename S::const_reverse_iterator ce = s.crend(); local
24 assert(ce == s.rend());
H A Dend.pass.cpp26 typename S::const_iterator ce = cs.end(); local
30 assert(ce == cs.begin());
33 assert(ce - cs.begin() == cs.size());
H A Drend.pass.cpp26 typename S::const_reverse_iterator ce = cs.rend(); local
30 assert(ce == cs.rbegin());
33 assert(ce - cs.rbegin() == cs.size());
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/
H A Dset_intersection.pass.cpp37 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);
H A Dset_intersection_comp.pass.cpp39 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/
H A Dset_symmetric_difference.pass.cpp38 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);
H A Dset_symmetric_difference_comp.pass.cpp40 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/
H A Dset_union.pass.cpp37 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);
H A Dset_union_comp.pass.cpp39 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/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/
H A Dset_difference.pass.cpp37 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), local
39 assert(base(ce) - ic == sr);
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
45 assert(base(ce) - ic == srr);
46 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
H A Dset_difference_comp.pass.cpp39 OutIter ce = std::set_difference(Iter1(ia), Iter1(ia+sa), local
41 assert(base(ce) - ic == sr);
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
47 assert(base(ce) - ic == srr);
48 assert(std::lexicographical_compare(ic, base(ce), irr, irr+srr) == 0);
/external/mockito/cglib-and-asm/src/org/mockito/cglib/proxy/
H A DFixedValueGenerator.java30 public void generate(ClassEmitter ce, Context context, List methods) { argument
33 CodeEmitter e = context.beginMethod(ce, method);
H A DInvocationHandlerGenerator.java37 public void generate(ClassEmitter ce, Context context, List methods) { argument
41 ce.declare_field(Constants.PRIVATE_FINAL_STATIC, impl.getName(), METHOD, null);
43 CodeEmitter e = context.beginMethod(ce, method);
H A DLazyLoaderGenerator.java32 public void generate(ClassEmitter ce, Context context, List methods) { argument
41 CodeEmitter e = context.beginMethod(ce, method);
57 ce.declare_field(Constants.ACC_PRIVATE, delegate, Constants.TYPE_OBJECT, null);
59 CodeEmitter e = ce.begin_method(Constants.ACC_PRIVATE |
H A DNoOpGenerator.java28 public void generate(ClassEmitter ce, Context context, List methods) { argument
33 CodeEmitter e = EmitUtils.begin_method(ce, method);
H A DCallbackGenerator.java24 void generate(ClassEmitter ce, Context context, List methods) throws Exception; argument
30 CodeEmitter beginMethod(ClassEmitter ce, MethodInfo method); argument
33 void emitCallback(CodeEmitter ce, int index); argument
H A DDispatcherGenerator.java44 public void generate(ClassEmitter ce, Context context, List methods) { argument
48 CodeEmitter e = context.beginMethod(ce, method);
H A DMethodInterceptorGenerator.java84 public void generate(ClassEmitter ce, Context context, List methods) { argument
95 ce.declare_field(Constants.PRIVATE_FINAL_STATIC, methodField, METHOD, null);
96 ce.declare_field(Constants.PRIVATE_FINAL_STATIC, methodProxyField, METHOD_PROXY, null);
97 ce.declare_field(Constants.PRIVATE_FINAL_STATIC, EMPTY_ARGS_NAME, Constants.TYPE_OBJECT_ARRAY, null);
101 e = ce.begin_method(Constants.ACC_FINAL,
109 e = context.beginMethod(ce, method);
134 generateFindProxy(ce, sigMap);
218 public void generateFindProxy(ClassEmitter ce, final Map sigMap) { argument
219 final CodeEmitter e = ce.begin_method(Constants.ACC_PUBLIC | Constants.ACC_STATIC,
/external/icu/icu4c/source/i18n/
H A Dcollationfastlatinbuilder.h55 void addUniqueCE(int64_t ce, UErrorCode &errorCode);
56 uint32_t getMiniCE(int64_t ce) const;
62 static UBool isContractionCharCE(int64_t ce) { argument
63 return (uint32_t)(ce >> 32) == Collation::NO_CE_PRIMARY && ce != Collation::NO_CE;
H A Dcollationcompare.cpp48 int64_t ce = left.nextCE(errorCode); local
49 leftPrimary = (uint32_t)(ce >> 32);
56 left.setCurrentCE(ce & INT64_C(0xffffffff00000000));
58 ce = left.nextCE(errorCode);
59 leftPrimary = (uint32_t)(ce >> 32);
73 int64_t ce = right.nextCE(errorCode); local
74 rightPrimary = (uint32_t)(ce >> 32);
81 right.setCurrentCE(ce & INT64_C(0xffffffff00000000));
83 ce = right.nextCE(errorCode);
84 rightPrimary = (uint32_t)(ce >> 3
196 int64_t ce; local
314 int64_t ce = left.getCE(leftIndex++); local
328 int64_t ce = right.getCE(rightIndex++); local
[all...]
H A Dcollationiterator.h45 inline void append(int64_t ce, UErrorCode &errorCode) { argument
47 buffer[length++] = ce;
51 inline void appendUnsafe(int64_t ce) { argument
52 buffer[length++] = ce;
68 inline int64_t set(int32_t i, int64_t ce) { argument
69 return buffer[i] = ce;
165 void setCurrentCE(int64_t ce) { argument
167 ceBuffer.set(cesIndex - 1, ce);
/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_clock.cc198 ClockElem &ce = dst->elem(i); local
199 ce.epoch = max(ce.epoch, clk_[i].epoch);
200 ce.reused = 0;
237 ClockElem &ce = dst->elem(i); local
238 ce.epoch = clk_[i].epoch;
239 ce.reused = 0;
244 ClockElem &ce = dst->elem(i); local
245 ce.epoch = 0;
246 ce
[all...]
/external/icu/icu4c/source/test/perf/howExpensiveIs/
H A Dsieve.cpp83 double ce = ceil(i); local
84 if(ce>=n) ce=n;
85 if(fl==ce) {
88 return (times[(int)fl]+times[(int)ce])/2;

Completed in 611 milliseconds

12345