| /* |
| ***************************************************************************** |
| * Copyright (C) 1996-2002, International Business Machines Corporation and * |
| * others. All Rights Reserved. * |
| ***************************************************************************** |
| */ |
| |
| #include "unicode/uset.h" |
| #include "unicode/ustring.h" |
| #include "hash.h" |
| #include "unormimp.h" |
| #include "caniter.h" |
| #include "cmemory.h" |
| |
| /** |
| * This class allows one to iterate through all the strings that are canonically equivalent to a given |
| * string. For example, here are some sample results: |
| Results for: {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} |
| 1: \u0041\u030A\u0064\u0307\u0327 |
| = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} |
| 2: \u0041\u030A\u0064\u0327\u0307 |
| = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D}{COMBINING CEDILLA}{COMBINING DOT ABOVE} |
| 3: \u0041\u030A\u1E0B\u0327 |
| = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D WITH DOT ABOVE}{COMBINING CEDILLA} |
| 4: \u0041\u030A\u1E11\u0307 |
| = {LATIN CAPITAL LETTER A}{COMBINING RING ABOVE}{LATIN SMALL LETTER D WITH CEDILLA}{COMBINING DOT ABOVE} |
| 5: \u00C5\u0064\u0307\u0327 |
| = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} |
| 6: \u00C5\u0064\u0327\u0307 |
| = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D}{COMBINING CEDILLA}{COMBINING DOT ABOVE} |
| 7: \u00C5\u1E0B\u0327 |
| = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D WITH DOT ABOVE}{COMBINING CEDILLA} |
| 8: \u00C5\u1E11\u0307 |
| = {LATIN CAPITAL LETTER A WITH RING ABOVE}{LATIN SMALL LETTER D WITH CEDILLA}{COMBINING DOT ABOVE} |
| 9: \u212B\u0064\u0307\u0327 |
| = {ANGSTROM SIGN}{LATIN SMALL LETTER D}{COMBINING DOT ABOVE}{COMBINING CEDILLA} |
| 10: \u212B\u0064\u0327\u0307 |
| = {ANGSTROM SIGN}{LATIN SMALL LETTER D}{COMBINING CEDILLA}{COMBINING DOT ABOVE} |
| 11: \u212B\u1E0B\u0327 |
| = {ANGSTROM SIGN}{LATIN SMALL LETTER D WITH DOT ABOVE}{COMBINING CEDILLA} |
| 12: \u212B\u1E11\u0307 |
| = {ANGSTROM SIGN}{LATIN SMALL LETTER D WITH CEDILLA}{COMBINING DOT ABOVE} |
| *<br>Note: the code is intended for use with small strings, and is not suitable for larger ones, |
| * since it has not been optimized for that situation. |
| *@author M. Davis |
| *@draft |
| */ |
| #if 0 |
| static UBool PROGRESS = FALSE; |
| |
| #include <stdio.h> |
| #include "unicode/translit.h" |
| |
| UErrorCode status = U_ZERO_ERROR; |
| |
| // Just for testing - remove, not thread safe. |
| static const char* UToS(const UnicodeString &source) { |
| static char buffer[256]; |
| buffer[source.extract(0, source.length(), buffer)] = 0; |
| return buffer; |
| } |
| |
| static const UnicodeString &Tr(const UnicodeString &source) { |
| static Transliterator *NAME = Transliterator::createInstance("name", UTRANS_FORWARD, status); |
| static UnicodeString result; |
| result = source; |
| NAME->transliterate(result); |
| return result; |
| } |
| #endif |
| // public |
| |
| U_NAMESPACE_BEGIN |
| |
| // TODO: add boilerplate methods. |
| |
| const char CanonicalIterator::fgClassID=0; |
| |
| /** |
| *@param source string to get results for |
| */ |
| CanonicalIterator::CanonicalIterator(UnicodeString sourceStr, UErrorCode &status) : |
| pieces(NULL), |
| pieces_length(0), |
| pieces_lengths(NULL), |
| current(NULL), |
| current_length(0) |
| { |
| if(U_SUCCESS(status)) { |
| setSource(sourceStr, status); |
| } |
| } |
| |
| CanonicalIterator::~CanonicalIterator() { |
| cleanPieces(); |
| } |
| |
| void CanonicalIterator::cleanPieces() { |
| int32_t i = 0; |
| if(pieces != NULL) { |
| for(i = 0; i < pieces_length; i++) { |
| if(pieces[i] != NULL) { |
| delete[] pieces[i]; |
| } |
| } |
| uprv_free(pieces); |
| pieces = NULL; |
| if(pieces_lengths != NULL) { |
| uprv_free(pieces_lengths); |
| } |
| pieces_lengths = NULL; |
| if(current != NULL) { |
| uprv_free(current); |
| } |
| current = NULL; |
| } |
| } |
| |
| /** |
| *@return gets the source: NOTE: it is the NFD form of source |
| */ |
| UnicodeString CanonicalIterator::getSource() { |
| return source; |
| } |
| |
| /** |
| * Resets the iterator so that one can start again from the beginning. |
| */ |
| void CanonicalIterator::reset() { |
| done = FALSE; |
| for (int i = 0; i < current_length; ++i) { |
| current[i] = 0; |
| } |
| } |
| |
| /** |
| *@return the next string that is canonically equivalent. The value null is returned when |
| * the iteration is done. |
| */ |
| UnicodeString CanonicalIterator::next() { |
| int32_t i = 0; |
| if (done) |
| return ""; |
| |
| // construct return value |
| |
| buffer.truncate(0); //buffer.setLength(0); // delete old contents |
| for (i = 0; i < pieces_length; ++i) { |
| buffer.append(pieces[i][current[i]]); |
| } |
| //String result = buffer.toString(); // not needed |
| |
| // find next value for next time |
| |
| for (i = current_length - 1; ; --i) { |
| if (i < 0) { |
| done = TRUE; |
| break; |
| } |
| current[i]++; |
| if (current[i] < pieces_lengths[i]) break; // got sequence |
| current[i] = 0; |
| } |
| return buffer; |
| } |
| |
| /** |
| *@param set the source string to iterate against. This allows the same iterator to be used |
| * while changing the source string, saving object creation. |
| */ |
| void CanonicalIterator::setSource(const UnicodeString &newSource, UErrorCode &status) { |
| if(U_FAILURE(status)) { |
| return; |
| } |
| Normalizer::normalize(newSource, UNORM_NFD, 0, source, status); |
| done = FALSE; |
| |
| cleanPieces(); |
| |
| // catch degenerate case |
| if (newSource.length() == 0) { |
| pieces_length = 1; |
| pieces = (UnicodeString **)uprv_malloc(sizeof(UnicodeString *)); |
| /* test for NULL */ |
| if (pieces == NULL) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| return; |
| } |
| current_length = 1; |
| current = (int32_t*)uprv_malloc(1 * sizeof(int32_t)); |
| /* test for NULL */ |
| if (current == NULL) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| uprv_free(pieces); |
| pieces = NULL; |
| return; |
| } |
| current[0] = 0; |
| pieces[0] = new UnicodeString[1]; |
| /* test for NULL */ |
| if (pieces[0] == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| uprv_free(pieces); |
| pieces = NULL; |
| uprv_free(current); |
| return; |
| } |
| pieces[0][0] = UnicodeString(""); |
| pieces_lengths = (int32_t*)uprv_malloc(1 * sizeof(int32_t)); |
| /* test for NULL */ |
| if (pieces_lengths == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| uprv_free(pieces); |
| pieces = NULL; |
| uprv_free(current); |
| return; |
| } |
| pieces_lengths[0] = 1; |
| return; |
| } |
| |
| |
| UnicodeString *list = new UnicodeString[source.length()]; |
| /* test for NULL */ |
| if (list == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| return; |
| } |
| |
| int32_t list_length = 0; |
| UChar32 cp = 0; |
| int32_t start = 0; |
| // i should initialy be the number of code units at the |
| // start of the string |
| int32_t i = UTF16_CHAR_LENGTH(source.char32At(0)); |
| //int32_t i = 1; |
| // find the segments |
| // This code iterates through the source string and |
| // extracts segments that end up on a codepoint that |
| // doesn't start any decompositions. (Analysis is done |
| // on the NFD form - see above). |
| for (; i < source.length(); i += UTF16_CHAR_LENGTH(cp)) { |
| cp = source.char32At(i); |
| if (unorm_isCanonSafeStart(cp)) { |
| source.extract(start, i-start, list[list_length++]); // add up to i |
| start = i; |
| } |
| } |
| source.extract(start, i-start, list[list_length++]); // add last one |
| |
| |
| // allocate the arrays, and find the strings that are CE to each segment |
| pieces = (UnicodeString **)uprv_malloc(list_length * sizeof(UnicodeString *)); |
| /* test for NULL */ |
| if (pieces == NULL) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| delete[] list; |
| return; |
| } |
| pieces_length = list_length; |
| pieces_lengths = (int32_t*)uprv_malloc(list_length * sizeof(int32_t)); |
| /* test for NULL */ |
| if (pieces_lengths == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| delete[] list; |
| uprv_free(pieces); |
| pieces = NULL; |
| return; |
| } |
| |
| current_length = list_length; |
| current = (int32_t*)uprv_malloc(list_length * sizeof(int32_t)); |
| /* test for NULL */ |
| if (current == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| delete[] list; |
| uprv_free(pieces); |
| pieces = NULL; |
| uprv_free(pieces_lengths); |
| return; |
| } |
| for (i = 0; i < current_length; i++) { |
| current[i] = 0; |
| } |
| // for each segment, get all the combinations that can produce |
| // it after NFD normalization |
| for (i = 0; i < pieces_length; ++i) { |
| //if (PROGRESS) printf("SEGMENT\n"); |
| pieces[i] = getEquivalents(list[i], pieces_lengths[i], status); |
| } |
| |
| delete[] list; |
| } |
| |
| /** |
| * Dumb recursive implementation of permutation. |
| * TODO: optimize |
| * @param source the string to find permutations for |
| * @return the results in a set. |
| */ |
| void CanonicalIterator::permute(UnicodeString &source, UBool skipZeros, Hashtable *result, UErrorCode &status) { |
| if(U_FAILURE(status)) { |
| return; |
| } |
| //if (PROGRESS) printf("Permute: %s\n", UToS(Tr(source))); |
| int32_t i = 0; |
| |
| // optimization: |
| // if zero or one character, just return a set with it |
| // we check for length < 2 to keep from counting code points all the time |
| if (source.length() <= 2 && source.countChar32() <= 1) { |
| UnicodeString *toPut = new UnicodeString(source); |
| /* test for NULL */ |
| if (toPut == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| return; |
| } |
| result->put(source, toPut, status); |
| return; |
| } |
| |
| // otherwise iterate through the string, and recursively permute all the other characters |
| UChar32 cp; |
| Hashtable *subpermute = new Hashtable(FALSE, status); |
| /* test for NULL */ |
| if (subpermute == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| return; |
| } |
| if (U_SUCCESS(status)) { |
| subpermute->setValueDeleter(uhash_deleteUnicodeString); |
| } |
| |
| for (i = 0; i < source.length(); i += UTF16_CHAR_LENGTH(cp)) { |
| cp = source.char32At(i); |
| const UHashElement *ne = NULL; |
| int32_t el = -1; |
| UnicodeString subPermuteString = source; |
| |
| // optimization: |
| // if the character is canonical combining class zero, |
| // don't permute it |
| if (skipZeros && i != 0 && u_getCombiningClass(cp) == 0) { |
| //System.out.println("Skipping " + Utility.hex(UTF16.valueOf(source, i))); |
| continue; |
| } |
| |
| subpermute->removeAll(); |
| |
| // see what the permutations of the characters before and after this one are |
| //Hashtable *subpermute = permute(source.substring(0,i) + source.substring(i + UTF16.getCharCount(cp))); |
| permute(subPermuteString.replace(i, UTF16_CHAR_LENGTH(cp), NULL, 0), skipZeros, subpermute, status); |
| /* Test for buffer overflows */ |
| if(U_FAILURE(status)) { |
| delete subpermute; |
| return; |
| } |
| // The upper replace is destructive. The question is do we have to make a copy, or we don't care about the contents |
| // of source at this point. |
| |
| // prefix this character to all of them |
| ne = subpermute->nextElement(el); |
| while (ne != NULL) { |
| UnicodeString *permRes = (UnicodeString *)(ne->value.pointer); |
| UnicodeString *chStr = new UnicodeString(cp); |
| //test for NULL |
| if (chStr == NULL) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| delete subpermute; |
| return; |
| } |
| chStr->append(*permRes); //*((UnicodeString *)(ne->value.pointer)); |
| //if (PROGRESS) printf(" Piece: %s\n", UToS(*chStr)); |
| result->put(*chStr, chStr, status); |
| ne = subpermute->nextElement(el); |
| } |
| } |
| delete subpermute; |
| //return result; |
| } |
| |
| // privates |
| |
| // we have a segment, in NFD. Find all the strings that are canonically equivalent to it. |
| UnicodeString* CanonicalIterator::getEquivalents(const UnicodeString &segment, int32_t &result_len, UErrorCode &status) { |
| //private String[] getEquivalents(String segment) |
| |
| Hashtable *result = new Hashtable(FALSE, status); |
| /* test for NULL */ |
| if (result == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| return 0; |
| } |
| if (U_SUCCESS(status)) { |
| result->setValueDeleter(uhash_deleteUnicodeString); |
| } |
| UChar USeg[256]; |
| int32_t segLen = segment.extract(USeg, 256, status); |
| Hashtable *basic = getEquivalents2(USeg, segLen, status); |
| //Hashtable *basic = getEquivalents2(segment, segLen, status); |
| |
| // now get all the permutations |
| // add only the ones that are canonically equivalent |
| // TODO: optimize by not permuting any class zero. |
| |
| Hashtable *permutations = new Hashtable(FALSE, status); |
| /* test for NULL */ |
| if (permutations == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| delete result; |
| delete basic; |
| return 0; |
| } |
| if (U_SUCCESS(status)) { |
| permutations->setValueDeleter(uhash_deleteUnicodeString); |
| } |
| |
| const UHashElement *ne = NULL; |
| int32_t el = -1; |
| //Iterator it = basic.iterator(); |
| ne = basic->nextElement(el); |
| //while (it.hasNext()) |
| while (ne != NULL) { |
| //String item = (String) it.next(); |
| UnicodeString item = *((UnicodeString *)(ne->value.pointer)); |
| |
| permutations->removeAll(); |
| permute(item, SKIP_ZEROES, permutations, status); |
| const UHashElement *ne2 = NULL; |
| int32_t el2 = -1; |
| //Iterator it2 = permutations.iterator(); |
| ne2 = permutations->nextElement(el2); |
| //while (it2.hasNext()) |
| while (ne2 != NULL) { |
| //String possible = (String) it2.next(); |
| //UnicodeString *possible = new UnicodeString(*((UnicodeString *)(ne2->value.pointer))); |
| UnicodeString possible(*((UnicodeString *)(ne2->value.pointer))); |
| UnicodeString attempt; |
| Normalizer::normalize(possible, UNORM_NFD, 0, attempt, status); |
| |
| // TODO: check if operator == is semanticaly the same as attempt.equals(segment) |
| if (attempt==segment) { |
| //if (PROGRESS) printf("Adding Permutation: %s\n", UToS(Tr(*possible))); |
| // TODO: use the hashtable just to catch duplicates - store strings directly (somehow). |
| result->put(possible, new UnicodeString(possible), status); //add(possible); |
| } else { |
| //if (PROGRESS) printf("-Skipping Permutation: %s\n", UToS(Tr(*possible))); |
| } |
| |
| ne2 = permutations->nextElement(el2); |
| } |
| ne = basic->nextElement(el); |
| } |
| |
| /* Test for buffer overflows */ |
| if(U_FAILURE(status)) { |
| delete result; |
| delete permutations; |
| delete basic; |
| return 0; |
| } |
| // convert into a String[] to clean up storage |
| //String[] finalResult = new String[result.size()]; |
| UnicodeString *finalResult = new UnicodeString[result->count()]; |
| /* test for NULL */ |
| if (finalResult == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| delete result; |
| delete permutations; |
| delete basic; |
| return 0; |
| } |
| //result.toArray(finalResult); |
| result_len = 0; |
| el = -1; |
| ne = result->nextElement(el); |
| while(ne != NULL) { |
| UnicodeString finResult = *((UnicodeString *)(ne->value.pointer)); |
| finalResult[result_len++] = finResult; |
| ne = result->nextElement(el); |
| } |
| |
| |
| delete permutations; |
| delete basic; |
| delete result; |
| return finalResult; |
| } |
| |
| Hashtable *CanonicalIterator::getEquivalents2(const UChar *segment, int32_t segLen, UErrorCode &status) { |
| //Hashtable *CanonicalIterator::getEquivalents2(const UnicodeString &segment, int32_t segLen, UErrorCode &status) { |
| |
| Hashtable *result = new Hashtable(FALSE, status); |
| /* test for NULL */ |
| if (result == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| return 0; |
| } |
| if (U_SUCCESS(status)) { |
| result->setValueDeleter(uhash_deleteUnicodeString); |
| } |
| |
| //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(segment))); |
| |
| UnicodeString toPut(segment, segLen); |
| |
| result->put(toPut, new UnicodeString(toPut), status); |
| |
| USerializedSet starts; |
| |
| // cycle through all the characters |
| UChar32 cp, end = 0; |
| int32_t i = 0, j; |
| for (i = 0; i < segLen; i += UTF16_CHAR_LENGTH(cp)) { |
| // see if any character is at the start of some decomposition |
| UTF_GET_CHAR(segment, 0, i, segLen, cp); |
| if (!unorm_getCanonStartSet(cp, &starts)) { |
| continue; |
| } |
| // if so, see which decompositions match |
| for(j = 0, cp = end+1; cp <= end || uset_getSerializedRange(&starts, j++, &cp, &end); ++cp) { |
| //Hashtable *remainder = extract(cp, segment, segLen, i, status); |
| Hashtable *remainder = extract(cp, segment, segLen, i, status); |
| if (remainder == NULL) continue; |
| |
| // there were some matches, so add all the possibilities to the set. |
| UnicodeString prefix(segment, i); |
| prefix += cp; |
| |
| const UHashElement *ne = NULL; |
| int32_t el = -1; |
| ne = remainder->nextElement(el); |
| while (ne != NULL) { |
| UnicodeString item = *((UnicodeString *)(ne->value.pointer)); |
| UnicodeString *toAdd = new UnicodeString(prefix); |
| /* test for NULL */ |
| if (toAdd == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| delete result; |
| delete remainder; |
| return 0; |
| } |
| *toAdd += item; |
| result->put(*toAdd, toAdd, status); |
| |
| //if (PROGRESS) printf("Adding: %s\n", UToS(Tr(*toAdd))); |
| |
| ne = remainder->nextElement(el); |
| } |
| |
| delete remainder; |
| } |
| } |
| |
| /* Test for buffer overflows */ |
| if(U_FAILURE(status)) { |
| return 0; |
| } |
| return result; |
| } |
| |
| /** |
| * See if the decomposition of cp2 is at segment starting at segmentPos |
| * (with canonical rearrangment!) |
| * If so, take the remainder, and return the equivalents |
| */ |
| Hashtable *CanonicalIterator::extract(UChar32 comp, const UChar *segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) { |
| //Hashtable *CanonicalIterator::extract(UChar32 comp, const UnicodeString &segment, int32_t segLen, int32_t segmentPos, UErrorCode &status) { |
| //if (PROGRESS) printf(" extract: %s, ", UToS(Tr(UnicodeString(comp)))); |
| //if (PROGRESS) printf("%s, %i\n", UToS(Tr(segment)), segmentPos); |
| |
| const int32_t bufSize = 256; |
| int32_t bufLen = 0; |
| UChar temp[bufSize]; |
| |
| const int32_t decompSize = 64; |
| int32_t inputLen = 0; |
| UChar decomp[decompSize]; |
| |
| UTF_APPEND_CHAR(temp, inputLen, bufSize, comp); |
| int32_t decompLen = unorm_getDecomposition(comp, FALSE, decomp, decompSize); |
| if(decompLen < 0) { |
| decompLen = -decompLen; |
| } |
| |
| UChar *buff = temp+inputLen; |
| |
| // See if it matches the start of segment (at segmentPos) |
| UBool ok = FALSE; |
| UChar32 cp; |
| int32_t decompPos = 0; |
| UChar32 decompCp; |
| UTF_NEXT_CHAR(decomp, decompPos, decompLen, decompCp); |
| |
| int32_t i = 0; |
| i = segmentPos; |
| while(i < segLen) { |
| UTF_NEXT_CHAR(segment, i, segLen, cp); |
| |
| if (cp == decompCp) { // if equal, eat another cp from decomp |
| |
| //if (PROGRESS) printf(" matches: %s\n", UToS(Tr(UnicodeString(cp)))); |
| |
| if (decompPos == decompLen) { // done, have all decomp characters! |
| //u_strcat(buff+bufLen, segment+i); |
| memcpy(buff+bufLen, segment+i, (segLen-i)*sizeof(UChar)); |
| bufLen+=segLen-i; |
| |
| ok = TRUE; |
| break; |
| } |
| UTF_NEXT_CHAR(decomp, decompPos, decompLen, decompCp); |
| } else { |
| //if (PROGRESS) printf(" buffer: %s\n", UToS(Tr(UnicodeString(cp)))); |
| |
| // brute force approach |
| |
| UTF_APPEND_CHAR(buff, bufLen, bufSize, cp); |
| |
| /* TODO: optimize |
| // since we know that the classes are monotonically increasing, after zero |
| // e.g. 0 5 7 9 0 3 |
| // we can do an optimization |
| // there are only a few cases that work: zero, less, same, greater |
| // if both classes are the same, we fail |
| // if the decomp class < the segment class, we fail |
| |
| segClass = getClass(cp); |
| if (decompClass <= segClass) return null; |
| */ |
| } |
| } |
| if (!ok) return NULL; // we failed, characters left over |
| |
| //if (PROGRESS) printf("Matches\n"); |
| |
| if (bufLen == 0) { |
| Hashtable *result = new Hashtable(FALSE, status); |
| /* test for NULL */ |
| if (result == 0) { |
| status = U_MEMORY_ALLOCATION_ERROR; |
| return 0; |
| } |
| result->setValueDeleter(uhash_deleteUnicodeString); |
| result->put("", new UnicodeString(""), status); |
| return result; // succeed, but no remainder |
| } |
| |
| // brute force approach |
| // check to make sure result is canonically equivalent |
| int32_t tempLen = inputLen + bufLen; |
| |
| UChar trial[bufSize]; |
| unorm_decompose(trial, bufSize, temp, tempLen, FALSE, FALSE, &status); |
| |
| /* Test for buffer overflows */ |
| if(U_FAILURE(status)) { |
| return 0; |
| } |
| |
| if(uprv_memcmp(segment+segmentPos, trial, (segLen - segmentPos)*sizeof(UChar)) != 0) { |
| return NULL; |
| } |
| |
| return getEquivalents2(buff, bufLen, status); |
| } |
| |
| U_NAMESPACE_END |
