-U_CAPI int32_t U_EXPORT2
-utext_compare(UText *s1, int32_t length1,
- UText *s2, int32_t length2) {
- UChar32 c1 = 0, c2 = 0;
-
- if(length1<0 && length2<0) {
- /* strcmp style, go until end of string */
- for(;;) {
- c1 = UTEXT_NEXT32(s1);
- c2 = UTEXT_NEXT32(s2);
- if(c1 != c2) {
- break;
- } else if(c1 == U_SENTINEL) {
- return 0;
- }
- }
- } else {
- if(length1 < 0) {
- length1 = INT32_MIN;
- } else if (length2 < 0) {
- length2 = INT32_MIN;
- }
-
- /* memcmp/UnicodeString style, both length-specified */
- while((length1 > 0 || length1 == INT32_MIN) && (length2 > 0 || length2 == INT32_MIN)) {
- c1 = UTEXT_NEXT32(s1);
- c2 = UTEXT_NEXT32(s2);
-
- if(c1 != c2) {
- break;
- } else if(c1 == U_SENTINEL) {
- return 0;
- }
-
- if (length1 != INT32_MIN) {
- length1 -= 1;
- }
- if (length2 != INT32_MIN) {
- length2 -= 1;
- }
- }
-
- if(length1 <= 0 && length1 != INT32_MIN) {
- if(length2 <= 0) {
- return 0;
- } else {
- return -1;
- }
- } else if(length2 <= 0 && length2 != INT32_MIN) {
- if (length1 <= 0) {
- return 0;
- } else {
- return 1;
- }
- }
- }
-
- return (int32_t)c1-(int32_t)c2;
-}
-
-U_CAPI int32_t U_EXPORT2
-utext_compareNativeLimit(UText *s1, int64_t limit1,
- UText *s2, int64_t limit2) {
- UChar32 c1, c2;
-
- if(limit1<0 && limit2<0) {
- /* strcmp style, go until end of string */
- for(;;) {
- c1 = UTEXT_NEXT32(s1);
- c2 = UTEXT_NEXT32(s2);
- if(c1 != c2) {
- return (int32_t)c1-(int32_t)c2;
- } else if(c1 == U_SENTINEL) {
- return 0;
- }
- }
- } else {
- /* memcmp/UnicodeString style, both length-specified */
- int64_t index1 = (limit1 >= 0 ? UTEXT_GETNATIVEINDEX(s1) : 0);
- int64_t index2 = (limit2 >= 0 ? UTEXT_GETNATIVEINDEX(s2) : 0);
-
- while((limit1 < 0 || index1 < limit1) && (limit2 < 0 || index2 < limit2)) {
- c1 = UTEXT_NEXT32(s1);
- c2 = UTEXT_NEXT32(s2);
-
- if(c1 != c2) {
- return (int32_t)c1-(int32_t)c2;
- } else if(c1 == U_SENTINEL) {
- return 0;
- }
-
- if (limit1 >= 0) {
- index1 = UTEXT_GETNATIVEINDEX(s1);
- }
- if (limit2 >= 0) {
- index2 = UTEXT_GETNATIVEINDEX(s2);
- }
- }
-
- if(limit1 >= 0 && index1 >= limit1) {
- if(index2 >= limit2) {
- return 0;
- } else {
- return -1;
- }
- } else {
- if(index1 >= limit1) {
- return 0;
- } else {
- return 1;
- }
- }
- }
-}
-
-U_CAPI int32_t U_EXPORT2
-utext_caseCompare(UText *s1, int32_t length1,
- UText *s2, int32_t length2,
- uint32_t options, UErrorCode *pErrorCode) {
- const UCaseProps *csp;
-
- /* case folding variables */
- const UChar *p;
- int32_t length;
-
- /* case folding buffers, only use current-level start/limit */
- UChar fold1[UCASE_MAX_STRING_LENGTH+1], fold2[UCASE_MAX_STRING_LENGTH+1];
- int32_t foldOffset1, foldOffset2, foldLength1, foldLength2;
-
- /* current code points */
- UChar32 c1, c2;
- uint8_t cLength1, cLength2;
-
- /* argument checking */
- if(U_FAILURE(*pErrorCode)) {
- return 0;
- }
- if(s1==NULL || s2==NULL) {
- *pErrorCode=U_ILLEGAL_ARGUMENT_ERROR;
- return 0;
- }
-
- csp=ucase_getSingleton();
-
- /* for variable-length strings */
- if(length1 < 0) {
- length1 = INT32_MIN;
- }
- if (length2 < 0) {
- length2 = INT32_MIN;
- }
-
- /* initialize */
- foldOffset1 = foldOffset2 = foldLength1 = foldLength2 = 0;
-
- /* comparison loop */
- while((foldOffset1 < foldLength1 || length1 > 0 || length1 == INT32_MIN) &&
- (foldOffset2 < foldLength2 || length2 > 0 || length2 == INT32_MIN)) {
- if(foldOffset1 < foldLength1) {
- U16_NEXT_UNSAFE(fold1, foldOffset1, c1);
- cLength1 = 0;
- } else {
- c1 = UTEXT_NEXT32(s1);
- if (c1 != U_SENTINEL) {
- cLength1 = U16_LENGTH(c1);
-
- length = ucase_toFullFolding(csp, c1, &p, options);
- if(length >= 0) {
- if(length <= UCASE_MAX_STRING_LENGTH) { // !!!: Does not correctly handle 0-length folded-case strings
- u_memcpy(fold1, p, length);
- foldOffset1 = 0;
- foldLength1 = length;
- U16_NEXT_UNSAFE(fold1, foldOffset1, c1);
- } else {
- c1 = length;
- }
- }
- }
-
- if(length1 != INT32_MIN) {
- length1 -= 1;
- }
- }
-
- if(foldOffset2 < foldLength2) {
- U16_NEXT_UNSAFE(fold2, foldOffset2, c2);
- cLength2 = 0;
- } else {
- c2 = UTEXT_NEXT32(s2);
- if (c2 != U_SENTINEL) {
- cLength2 = U16_LENGTH(c2);
-
- length = ucase_toFullFolding(csp, c2, &p, options);
- if(length >= 0) {
- if(length <= UCASE_MAX_STRING_LENGTH) { // !!!: Does not correctly handle 0-length folded-case strings
- u_memcpy(fold2, p, length);
- foldOffset2 = 0;
- foldLength2 = length;
- U16_NEXT_UNSAFE(fold2, foldOffset2, c2);
- } else {
- c2 = length;
- }
- }
- } else if(c1 == U_SENTINEL) {
- return 0; // end of both strings at once
- }
-
- if(length2 != INT32_MIN) {
- length2 -= 1;
- }
- }
-
- if(c1 != c2) {
- return (int32_t)c1-(int32_t)c2;
- }
- }
-
- /* By now at least one of the strings is out of characters */
- length1 += foldLength1 - foldOffset1;
- length2 += foldLength2 - foldOffset2;
-
- if(length1 <= 0 && length1 != INT32_MIN) {
- if(length2 <= 0) {
- return 0;
- } else {
- return -1;
- }
- } else {
- if (length1 <= 0) {
- return 0;
- } else {
- return 1;
- }
- }
-}
-
-U_CAPI int32_t U_EXPORT2
-utext_caseCompareNativeLimit(UText *s1, int64_t limit1,
- UText *s2, int64_t limit2,
- uint32_t options, UErrorCode *pErrorCode) {
- const UCaseProps *csp;
-
- /* case folding variables */
- const UChar *p;
- int32_t length;
-
- /* case folding buffers, only use current-level start/limit */
- UChar fold1[UCASE_MAX_STRING_LENGTH+1], fold2[UCASE_MAX_STRING_LENGTH+1];
- int32_t foldOffset1, foldOffset2, foldLength1, foldLength2;
-
- /* current code points */
- UChar32 c1, c2;
-
- /* native indexes into s1 and s2 */
- int64_t index1, index2;
-
- /* argument checking */
- if(U_FAILURE(*pErrorCode)) {
- return 0;
- }
- if(s1==NULL || s2==NULL) {
- *pErrorCode=U_ILLEGAL_ARGUMENT_ERROR;
- return 0;
- }
-
- csp=ucase_getSingleton();
-
- /* initialize */
- index1 = (limit1 >= 0 ? UTEXT_GETNATIVEINDEX(s1) : 0);
- index2 = (limit2 >= 0 ? UTEXT_GETNATIVEINDEX(s2) : 0);
-
- foldOffset1 = foldOffset2 = foldLength1 = foldLength2 = 0;
-
- /* comparison loop */
- while((foldOffset1 < foldLength1 || limit1 < 0 || index1 < limit1) &&
- (foldOffset2 < foldLength2 || limit2 < 0 || index2 < limit2)) {
- if(foldOffset1 < foldLength1) {
- U16_NEXT_UNSAFE(fold1, foldOffset1, c1);
- } else {
- c1 = UTEXT_NEXT32(s1);
- if (c1 != U_SENTINEL) {
- length = ucase_toFullFolding(csp, c1, &p, options);
- if(length >= 0) {
- if(length <= UCASE_MAX_STRING_LENGTH) { // !!!: Does not correctly handle 0-length folded-case strings
- u_memcpy(fold1, p, length);
- foldOffset1 = 0;
- foldLength1 = length;
- U16_NEXT_UNSAFE(fold1, foldOffset1, c1);
- } else {
- c1 = length;
- }
- }
- }
-
- if (limit1 >= 0) {
- index1 = UTEXT_GETNATIVEINDEX(s1);
- }
- }
-
- if(foldOffset2 < foldLength2) {
- U16_NEXT_UNSAFE(fold2, foldOffset2, c2);
- } else {
- c2 = UTEXT_NEXT32(s2);
- if (c2 != U_SENTINEL) {
- length = ucase_toFullFolding(csp, c2, &p, options);
- if(length >= 0) {
- if(length <= UCASE_MAX_STRING_LENGTH) { // !!!: Does not correctly handle 0-length folded-case strings
- u_memcpy(fold2, p, length);
- foldOffset2 = 0;
- foldLength2 = length;
- U16_NEXT_UNSAFE(fold2, foldOffset2, c2);
- } else {
- c2 = length;
- }
- }
- } else if(c1 == U_SENTINEL) {
- return 0;
- }
-
- if (limit2 >= 0) {
- index2 = UTEXT_GETNATIVEINDEX(s2);
- }
- }
-
- if(c1 != c2) {
- return (int32_t)c1-(int32_t)c2;
- }
- }
-
- /* By now at least one of the strings is out of characters */
- index1 -= foldLength1 - foldOffset1;
- index2 -= foldLength2 - foldOffset2;
-
- if(limit1 >= 0 && index1 >= limit1) {
- if(index2 >= limit2) {
- return 0;
- } else {
- return -1;
- }
- } else {
- if(index1 >= limit1) {
- return 0;
- } else {
- return 1;
- }
- }
-}
-
-