Home | History | Annotate | Download | only in i18n

Lines Matching defs:CE

127 int32_t ucol_inv_findCE(const UColTokenParser *src, uint32_t CE, uint32_t SecondCE) {
138 res = compareCEs(first, second, CE, SecondCE);
153 /* able to find the elements around any CE, even if it is */
157 if((first == CE && second == SecondCE)) {
172 uint32_t CE, uint32_t contCE,
179 iCE = ucol_inv_findCE(src, CE, contCE);
186 CE &= strengthMask[strength];
189 *nextCE = CE;
192 while((*nextCE & strengthMask[strength]) == CE
203 uint32_t CE, uint32_t contCE,
210 iCE = ucol_inv_findCE(src, CE, contCE);
217 CE &= strengthMask[strength];
220 *prevCE = CE;
223 while((*prevCE & strengthMask[strength]) == CE
235 U_CFUNC uint32_t U_EXPORT2 ucol_getCEStrengthDifference(uint32_t CE, uint32_t contCE,
238 if(prevCE == CE && prevContCE == contCE) {
241 if((prevCE & strengthMask[UCOL_PRIMARY]) != (CE & strengthMask[UCOL_PRIMARY])
246 if((prevCE & strengthMask[UCOL_SECONDARY]) != (CE & strengthMask[UCOL_SECONDARY])
258 uint32_t CE = lh->baseCE;
265 iCE = ucol_inv_findCE(src, CE, SecondCE);
271 CE &= strengthMask[strength];
274 previousCE = CE;
277 while((previousCE & strengthMask[strength]) == CE && (previousContCE & strengthMask[strength])== SecondCE) {
289 uint32_t CE = lh->baseCE;
296 iCE = ucol_inv_findCE(src, CE, SecondCE);
302 CE &= strengthMask[strength];
305 nextCE = CE;
308 while((nextCE & strengthMask[strength]) == CE
382 } else { /* The CE must be implicit, since it's not in the table */
521 // We must not use CE weight byte 02, so we set it as the minimum lower bound.
959 fprintf(stderr, "replaced CE for %04X with CE for %04X\n", el.cPoints[0], tok->debugSource);
975 uint32_t CE = utrie_get32(t->mapping, start, NULL);
976 if(CE == UCOL_NOT_FOUND) {
1009 uint32_t CE = UCOL_NOT_FOUND;
1019 if((CE = utrie_get32(t->mapping, u, NULL)) == UCOL_NOT_FOUND
1021 || ((isCntTableElement(CE)) &&
1022 (uprv_cnttab_getCE(t->contractions, CE, 0, status) == UCOL_NOT_FOUND))
1042 UTRIE_GET32(src->UCA->mapping, u, CE);
1043 tag = getCETag(CE);
1047 el.CEs[el.noOfCEs++] = CE;
1056 while(CE != UCOL_NO_MORE_CES) {
1057 CE = ucol_getNextCE(src->UCA, &colIt, status);
1058 if(CE != UCOL_NO_MORE_CES) {
1059 el.CEs[el.noOfCEs++] = CE;
1089 next/previous CE, at the strength of the first token. Add these to the
1167 /* After this, we have assigned CE values to all regular CEs */
1268 // get CE of prefix character first