mirror of
https://github.com/unicode-org/icu.git
synced 2025-04-08 06:53:45 +00:00
ICU-11750 Improve comments again
X-SVN-Rev: 37951
This commit is contained in:
parent
79589c201a
commit
525a00b02e
3 changed files with 8 additions and 8 deletions
|
@ -4041,9 +4041,9 @@ U_CAPI UBool U_EXPORT2 usearch_search(UStringSearch *strsrch,
|
|||
mLimit = minLimit;
|
||||
} else {
|
||||
int32_t nba = nextBoundaryAfter(strsrch, minLimit);
|
||||
// Note that we can have nba < maxLimit, in which case we want to set
|
||||
// mLimit to nba regardless of allowMidclusterMatch (i.e. we back off
|
||||
// mLimit to the previous breakIterator boundary).
|
||||
// Note that we can have nba < maxLimit && nba >= minLImit, in which
|
||||
// case we want to set mLimit to nba regardless of allowMidclusterMatch
|
||||
// (i.e. we back off mLimit to the previous breakIterator boundary).
|
||||
if (nba >= lastCEI->highIndex && (!allowMidclusterMatch || nba < maxLimit)) {
|
||||
mLimit = nba;
|
||||
}
|
||||
|
@ -4311,9 +4311,9 @@ U_CAPI UBool U_EXPORT2 usearch_searchBackwards(UStringSearch *strsrch,
|
|||
// This advances the index over any combining characters.
|
||||
if (minLimit < maxLimit) {
|
||||
int32_t nba = nextBoundaryAfter(strsrch, minLimit);
|
||||
// Note that we can have nba < maxLimit, in which case we want to set
|
||||
// mLimit to nba regardless of allowMidclusterMatch (i.e. we back off
|
||||
// mLimit to the previous breakIterator boundary).
|
||||
// Note that we can have nba < maxLimit && nba >= minLImit, in which
|
||||
// case we want to set mLimit to nba regardless of allowMidclusterMatch
|
||||
// (i.e. we back off mLimit to the previous breakIterator boundary).
|
||||
if (nba >= lastCEI->highIndex && (!allowMidclusterMatch || nba < maxLimit)) {
|
||||
mLimit = nba;
|
||||
}
|
||||
|
|
|
@ -754,7 +754,7 @@ static const SearchData DIACRITICMATCH[] = {
|
|||
{NULL, NULL, NULL, UCOL_TERTIARY, USEARCH_STANDARD_ELEMENT_COMPARISON, NULL, {-1}, {0}}
|
||||
};
|
||||
|
||||
static const SearchData INDICPREFIXMATCH[] = { // <rdar://problem/18063262>
|
||||
static const SearchData INDICPREFIXMATCH[] = {
|
||||
{"\\u0915\\u0020\\u0915\\u0901\\u0020\\u0915\\u0902\\u0020\\u0915\\u0903\\u0020\\u0915\\u0940\\u0020\\u0915\\u093F\\u0020\\u0915\\u0943\\u0020\\u0915\\u093C\\u0020\\u0958",
|
||||
"\\u0915", NULL, UCOL_PRIMARY, USEARCH_STANDARD_ELEMENT_COMPARISON, NULL, {0, 2, 5, 8, 11, 14, 17, 20, 23,-1}, {1, 2, 2, 2, 1, 1, 1, 2, 1}},
|
||||
{"\\u0915\\u0924\\u0020\\u0915\\u0924\\u0940\\u0020\\u0915\\u0924\\u093F\\u0020\\u0915\\u0924\\u0947\\u0020\\u0915\\u0943\\u0924\\u0020\\u0915\\u0943\\u0924\\u0947",
|
||||
|
|
|
@ -2987,7 +2987,7 @@ static void TestMatchFollowedByIgnorables(void) {
|
|||
ucol_close(coll);
|
||||
}
|
||||
|
||||
static void TestIndicPrefixMatch(void) // <rdar://problem/18063262>
|
||||
static void TestIndicPrefixMatch(void)
|
||||
{
|
||||
int count = 0;
|
||||
UErrorCode status = U_ZERO_ERROR;
|
||||
|
|
Loading…
Add table
Reference in a new issue