Lines Matching refs:CEs
54 ci->CEpos = ci->toReturn = ci->extendCEs ? ci->extendCEs : ci->CEs;
86 * This is to squeeze the 21bit ces into a 256 table
397 // ** Should processed CEs be signed or unsigned?
476 * @param cesize size of the pattern ces
489 // number of characters to give the relevant ces, ie approximately
490 // the number of ces minus their expansion, since expansions can come
498 // number of ces from right of array to the count
627 // iterates the individual ces
815 * ces.
908 * that when the match is passed in here with extra beginning ces, the
1222 // since backward contraction/expansion may have extra ces if we
1599 * We allow skipping of the ends of the accent set if the ces do not match.
1725 * equivalents and check their corresponding ces with the pattern ce.
1865 // since backward contraction/expansion may have extra ces if we
1899 // accents may have extra starting ces, this occurs when a
2063 // since forward contraction/expansion may have extra ces
2259 * We allow skipping of the ends of the accent set if the ces do not match.
2388 * canonical equivalents and check their corresponding ces with the pattern ce.
2503 // since forward contraction/expansion may have extra ces
2537 // accents may have extra starting ces, this occurs when a
3161 * If a direction switch is required, we'll count the number of ces till the
3400 // **** hack to deal w/ how processed CEs encode quaternary ****
3459 // CEBuffer A circular buffer of CEs from the text being searched.
3744 printf("Pattern CEs\n");
3852 // character, and all subsequent (expansions) CEs will report the source index of the
3897 printf("Target CEs [%d .. %d]\n", ceb.firstIx, ceb.limitIx);
3939 printf("Pattern CEs\n");
4116 printf("Target CEs [%d .. %d]\n", ceb.firstIx, ceb.limitIx);
