Lines Matching refs:segment
227 // allocate the arrays, and find the strings that are CE to each segment
241 // for each segment, get all the combinations that can produce
244 //if (PROGRESS) printf("SEGMENT\n");
340 // we have a segment, in NFD. Find all the strings that are canonically equivalent to it.
341 UnicodeString* CanonicalIterator::getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status) {
353 int32_t segLen = segment.extract(USeg, 256, status);
383 // TODO: check if operator == is semanticaly the same as attempt.equals(segment)
384 if (attempt==segment) {
429 Hashtable *CanonicalIterator::getEquivalents2(Hashtable *fillinResult, const UChar *segment, int32_t segLen, UErrorCode &status) {
435 //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(segment)));
437 UnicodeString toPut(segment, segLen);
447 UTF_GET_CHAR(segment, 0, i, segLen, cp);
457 if (extract(&remainder, cp2, segment, segLen, i, status) == NULL) {
462 UnicodeString prefix(segment, i);
493 * See if the decomposition of cp2 is at segment starting at segmentPos
497 Hashtable *CanonicalIterator::extract(Hashtable *fillinResult, UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) {
498 //Hashtable *CanonicalIterator::extract(UChar32 comp, const UnicodeString &segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) {
500 //if (PROGRESS) printf("%s, %i\n", UToS(Tr(segment)), segmentPos);
513 // See if it matches the start of segment (at segmentPos)
522 U16_NEXT(segment, i, segLen, cp);
529 temp.append(segment+i, segLen-i);
546 // if the decomp class < the segment class, we fail
567 if(U_FAILURE(status) || trial.compare(segment+segmentPos, segLen - segmentPos) != 0) {
