Lines Matching refs:segment
228 // allocate the arrays, and find the strings that are CE to each segment
242 // for each segment, get all the combinations that can produce
245 //if (PROGRESS) printf("SEGMENT\n");
341 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
342 UnicodeString* CanonicalIterator::getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status) {
354 int32_t segLen = segment.extract(USeg, 256, status);
384 // TODO: check if operator == is semanticaly the same as attempt.equals(segment)
385 if (attempt==segment) {
430 Hashtable *CanonicalIterator::getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status) {
436 //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(segment)));
438 UnicodeString toPut(segment, segLen);
448 U16_GET(segment, 0, i, segLen, cp);
458 if (extract(&remainder, cp2, segment, segLen, i, status) == NULL) {
463 UnicodeString prefix(segment, i);
494 * See if the decomposition of cp2 is at segment
498 Hashtable *CanonicalIterator::extract(Hashtable *fillinResult, UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) {
499 //Hashtable *CanonicalIterator::extract(UChar32 comp, const UnicodeString &segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) {
501 //if (PROGRESS) printf("%s, %i\n", UToS(Tr(segment)), segmentPos);
521 // See if it matches the start of segment (at segmentPos)
530 U16_NEXT(segment, i, segLen, cp);
537 temp.append(segment+i, segLen-i);
554 // if the decomp class < the segment class, we fail
575 if(U_FAILURE(status) || trial.compare(segment+segmentPos, segLen - segmentPos) != 0) {
