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

12345

/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.cpp27 typename S::const_iterator ce = cs.end(); local
31 assert(ce == cs.begin());
34 assert(static_cast<std::size_t>(ce - cs.begin()) == cs.size());
H A Drend.pass.cpp27 typename S::const_reverse_iterator ce = cs.rend(); local
31 assert(ce == cs.rbegin());
34 assert(static_cast<std::size_t>(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/icu/icu4c/source/i18n/
H A Dcollationfastlatinbuilder.h58 void addUniqueCE(int64_t ce, UErrorCode &errorCode);
59 uint32_t getMiniCE(int64_t ce) const;
65 static UBool isContractionCharCE(int64_t ce) { argument
66 return (uint32_t)(ce >> 32) == Collation::NO_CE_PRIMARY && ce != Collation::NO_CE;
H A Dcollationcompare.cpp49 int64_t ce = left.nextCE(errorCode); local
50 leftPrimary = (uint32_t)(ce >> 32);
57 left.setCurrentCE(ce & INT64_C(0xffffffff00000000));
59 ce = left.nextCE(errorCode);
60 leftPrimary = (uint32_t)(ce >> 32);
74 int64_t ce = right.nextCE(errorCode); local
75 rightPrimary = (uint32_t)(ce >> 32);
82 right.setCurrentCE(ce & INT64_C(0xffffffff00000000));
84 ce = right.nextCE(errorCode);
85 rightPrimary = (uint32_t)(ce >> 3
197 int64_t ce; local
315 int64_t ce = left.getCE(leftIndex++); local
329 int64_t ce = right.getCE(rightIndex++); local
[all...]
H A Dcollationiterator.h47 inline void append(int64_t ce, UErrorCode &errorCode) { argument
49 buffer[length++] = ce;
53 inline void appendUnsafe(int64_t ce) { argument
54 buffer[length++] = ce;
70 inline int64_t set(int32_t i, int64_t ce) { argument
71 return buffer[i] = ce;
167 void setCurrentCE(int64_t ce) { argument
169 ceBuffer.set(cesIndex - 1, ce);
H A Dcoleitr.cpp76 UBool ceNeedsTwoParts(int64_t ce) { argument
77 return (ce & INT64_C(0xffff00ff003f)) != 0;
126 int64_t ce = iter_->nextCE(status); local
127 if (ce == Collation::NO_CE) { return NULLORDER; }
129 uint32_t p = (uint32_t)(ce >> 32);
130 uint32_t lower32 = (uint32_t)ce;
198 int64_t ce = iter_->previousCE(*offsets_, status); local
199 if (ce == Collation::NO_CE) { return NULLORDER; }
201 uint32_t p = (uint32_t)(ce >> 32);
202 uint32_t lower32 = (uint32_t)ce;
411 int64_t ce = ces[length - 1]; local
[all...]
H A Dcollationbuilder.h81 int32_t findOrInsertNodeForRootCE(int64_t ce, int32_t strength, UErrorCode &errorCode);
205 static inline UBool isTempCE(int64_t ce) { argument
206 uint32_t sec = (uint32_t)ce >> 24;
223 static int32_t ceStrength(int64_t ce);
H A Dcollationfastlatin.h228 static uint32_t nextPair(const uint16_t *table, UChar32 c, uint32_t ce,
232 uint32_t ce = pair & 0xffff; local
233 if(ce >= MIN_SHORT) { return pair & TWO_SHORT_PRIMARIES_MASK; }
234 if(ce > variableTop) { return pair & TWO_LONG_PRIMARIES_MASK; }
235 if(ce >= MIN_LONG) { return 0; } // variable
238 static inline uint32_t getSecondariesFromOneShortCE(uint32_t ce) { argument
239 ce &= SECONDARY_MASK;
240 if(ce < MIN_SEC_HIGH) {
241 return ce + SEC_OFFSET;
243 return ((ce
[all...]
/external/compiler-rt/lib/tsan/rtl/
H A Dtsan_clock.cc196 ClockElem &ce = dst->elem(i); local
197 ce.epoch = max(ce.epoch, clk_[i].epoch);
198 ce.reused = 0;
235 ClockElem &ce = dst->elem(i); local
236 ce.epoch = clk_[i].epoch;
237 ce.reused = 0;
242 ClockElem &ce = dst->elem(i); local
243 ce.epoch = 0;
244 ce
[all...]
/external/icu/icu4c/source/test/perf/howExpensiveIs/
H A Dsieve.cpp87 double ce = ceil(i); local
88 if(ce>=n) ce=n;
89 if(fl==ce) {
92 return (times[(int)fl]+times[(int)ce])/2;
/external/clang/test/SemaTemplate/
H A Dtemp_arg_nontype_cxx1z.cpp89 constexpr int C::*ce = (int C::*)e; member in class:PtrMem::C
91 constexpr int B::*bce = (int B::*)ce; // expected-note +{{here}}
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/
H A DCollationFastLatinBuilder.java45 private static final int binarySearch(long[] list, int limit, long ce) { argument
50 int cmp = compareInt64AsUnsigned(ce, list[i]);
55 return ~start; // insert ce before i
60 return ~(start + 1); // insert ce after i
390 private void addUniqueCE(long ce) { argument
391 if(ce == 0 || (ce >>> 32) == Collation.NO_CE_PRIMARY) { return; }
392 ce &= ~(long)Collation.CASE_MASK; // blank out case bits
393 int i = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
395 uniqueCEs.insertElementAt(ce, ~
399 getMiniCE(long ce) argument
673 isContractionCharCE(long ce) argument
[all...]
H A DContractionsAndExpansions.java42 void handleCE(long ce); argument
/external/icu/android_icu4j/src/main/java/android/icu/text/
H A DCollationElementIterator.java152 * @param ce the collation element
155 public final static int primaryOrder(int ce) { argument
156 return (ce >>> 16) & 0xffff;
162 * @param ce the collation element
165 public final static int secondaryOrder(int ce) { argument
166 return (ce >>> 8) & 0xff;
172 * @param ce the collation element
175 public final static int tertiaryOrder(int ce) { argument
176 return ce & 0xff;
188 private static final boolean ceNeedsTwoParts(long ce) { argument
576 handleCE(long ce) argument
625 getMaxExpansion(int ce) argument
[all...]
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/
H A DCollationFastLatinBuilder.java44 private static final int binarySearch(long[] list, int limit, long ce) { argument
49 int cmp = compareInt64AsUnsigned(ce, list[i]);
54 return ~start; // insert ce before i
59 return ~(start + 1); // insert ce after i
389 private void addUniqueCE(long ce) { argument
390 if(ce == 0 || (ce >>> 32) == Collation.NO_CE_PRIMARY) { return; }
391 ce &= ~(long)Collation.CASE_MASK; // blank out case bits
392 int i = binarySearch(uniqueCEs.getBuffer(), uniqueCEs.size(), ce);
394 uniqueCEs.insertElementAt(ce, ~
398 getMiniCE(long ce) argument
672 isContractionCharCE(long ce) argument
[all...]

Completed in 2511 milliseconds

12345