Lines Matching refs:CEs
56 ci->CEpos = ci->toReturn = ci->extendCEs ? ci->extendCEs : ci->CEs;
88 * This is to squeeze the 21bit ces into a 256 table
407 // ** Should processed CEs be signed or unsigned?
486 * @param cesize size of the pattern ces
499 // number of characters to give the relevant ces, ie approximately
500 // the number of ces minus their expansion, since expansions can come
508 // number of ces from right of array to the count
637 // iterates the individual ces
825 * ces.
918 * that when the match is passed in here with extra beginning ces, the
1198 // since backward contraction/expansion may have extra ces if we
1575 * We allow skipping of the ends of the accent set if the ces do not match.
1701 * equivalents and check their corresponding ces with the pattern ce.
1841 // since backward contraction/expansion may have extra ces if we
1875 // accents may have extra starting ces, this occurs when a
2039 // since forward contraction/expansion may have extra ces
2235 * We allow skipping of the ends of the accent set if the ces do not match.
2364 * canonical equivalents and check their corresponding ces with the pattern ce.
2479 // since forward contraction/expansion may have extra ces
2513 // accents may have extra starting ces, this occurs when a
3157 * If a direction switch is required, we'll count the number of ces till the
3396 // **** hack to deal w/ how processed CEs encode quaternary ****
3457 // CEBuffer A circular buffer of CEs from the text being searched.
3804 printf("Pattern CEs\n");
3852 // then the CE is deleted, so the following code sees only CEs that are relevant.
3967 // character, and all subsequent (expansions) CEs will report the source index of the
4012 printf("Target CEs [%d .. %d]\n", ceb.firstIx, ceb.limitIx);
4054 printf("Pattern CEs\n");
4119 // Here, targetIx values increase toward the beginning of the base text (i.e. we get the text CEs in reverse order).
4246 printf("Target CEs [%d .. %d]\n", ceb.firstIx, ceb.limitIx);
