Lines Matching refs:search
258 const SearchData *search) in assertEqualWithStringSearch() argument
262 int32_t matchindex = search->offset[count]; in assertEqualWithStringSearch()
266 strsrch->setAttribute(USEARCH_ELEMENT_COMPARISON, search->elemCompare, status); in assertEqualWithStringSearch()
279 matchlength = search->size[count]; in assertEqualWithStringSearch()
304 matchindex = search->offset[count]; in assertEqualWithStringSearch()
320 matchindex = search->offset[count]; in assertEqualWithStringSearch()
322 matchlength = search->size[count]; in assertEqualWithStringSearch()
346 matchindex = count > 0 ? search->offset[count - 1] : -1; in assertEqualWithStringSearch()
366 matchindex = search->offset[count]; in assertEqualWithStringSearch()
388 matchlength = search->size[count]; in assertEqualWithStringSearch()
410 matchindex = search->offset[count]; in assertEqualWithStringSearch()
415 while (search->offset[count + 1] >= 0) { in assertEqualWithStringSearch()
439 matchindex = search->offset[count]; in assertEqualWithStringSearch()
440 matchlength = search->size[count]; in assertEqualWithStringSearch()
463 UBool StringSearchTest::assertEqual(const SearchData *search) in assertEqual() argument
467 Collator *collator = getCollator(search->collator); in assertEqual()
468 BreakIterator *breaker = getBreakIterator(search->breaker); in assertEqual()
473 if(search->breaker) { in assertEqual()
477 u_unescape(search->text, temp, 128); in assertEqual()
480 u_unescape(search->pattern, temp, 128); in assertEqual()
489 collator->setStrength(getECollationStrength(search->strength)); in assertEqual()
497 if (!assertEqualWithStringSearch(strsrch, search)) { in assertEqual()
506 !assertEqualWithStringSearch(strsrch2, search) in assertEqual()
521 UBool StringSearchTest::assertCanonicalEqual(const SearchData *search) in assertCanonicalEqual() argument
524 Collator *collator = getCollator(search->collator); in assertCanonicalEqual()
525 BreakIterator *breaker = getBreakIterator(search->breaker); in assertCanonicalEqual()
531 if(search->breaker) { in assertCanonicalEqual()
536 u_unescape(search->text, temp, 128); in assertCanonicalEqual()
539 u_unescape(search->pattern, temp, 128); in assertCanonicalEqual()
548 collator->setStrength(getECollationStrength(search->strength)); in assertCanonicalEqual()
559 if (!assertEqualWithStringSearch(strsrch, search)) { in assertCanonicalEqual()
572 UBool StringSearchTest::assertEqualWithAttribute(const SearchData *search, in assertEqualWithAttribute() argument
577 Collator *collator = getCollator(search->collator); in assertEqualWithAttribute()
578 BreakIterator *breaker = getBreakIterator(search->breaker); in assertEqualWithAttribute()
584 if(search->breaker) { in assertEqualWithAttribute()
589 u_unescape(search->text, temp, 128); in assertEqualWithAttribute()
592 u_unescape(search->pattern, temp, 128); in assertEqualWithAttribute()
601 collator->setStrength(getECollationStrength(search->strength)); in assertEqualWithAttribute()
612 if (!assertEqualWithStringSearch(strsrch, search)) { in assertEqualWithAttribute()
910 const SearchData *search = &(BREAKITERATOREXACT[count]); in TestBreakIterator() local
911 RuleBasedCollator *collator = getCollator(search->collator); in TestBreakIterator()
912 BreakIterator *breaker = getBreakIterator(search->breaker); in TestBreakIterator()
915 u_unescape(search->text, temp, 128); in TestBreakIterator()
917 u_unescape(search->pattern, temp, 128); in TestBreakIterator()
922 collator->setStrength(getECollationStrength(search->strength)); in TestBreakIterator()
932 if (!assertEqualWithStringSearch(strsrch, search)) { in TestBreakIterator()
936 search = &(BREAKITERATOREXACT[count + 1]); in TestBreakIterator()
937 breaker = getBreakIterator(search->breaker); in TestBreakIterator()
948 if (!assertEqualWithStringSearch(strsrch, search)) { in TestBreakIterator()
1005 const SearchData *search = &(OVERLAP[count]); in TestOverlap() local
1007 u_unescape(search->text, temp, 128); in TestOverlap()
1010 u_unescape(search->pattern, temp, 128); in TestOverlap()
1014 RuleBasedCollator *collator = getCollator(search->collator); in TestOverlap()
1025 if (!assertEqualWithStringSearch(strsrch, search)) { in TestOverlap()
1030 search = &(NONOVERLAP[count]); in TestOverlap()
1037 if (!assertEqualWithStringSearch(strsrch, search)) { in TestOverlap()
1298 SearchData search = BASIC[index ++]; in TestGetSetOffset() local
1301 u_unescape(search.text, temp, 128); in TestGetSetOffset()
1303 u_unescape(search.pattern, temp, 128); in TestGetSetOffset()
1308 search.strength)); in TestGetSetOffset()
1312 int32_t matchindex = search.offset[count]; in TestGetSetOffset()
1314 int32_t matchlength = search.size[count]; in TestGetSetOffset()
1327 matchindex = search.offset[count + 1] == -1 ? -1 : in TestGetSetOffset()
1328 search.offset[count + 2]; in TestGetSetOffset()
1329 if (search.offset[count + 1] != -1) { in TestGetSetOffset()
1330 strsrch->setOffset(search.offset[count + 1] + 1, status); in TestGetSetOffset()
1331 if (strsrch->getOffset() != search.offset[count + 1] + 1) { in TestGetSetOffset()
1421 SearchData search = MATCH[0]; in TestGetMatch() local
1422 u_unescape(search.text, temp, 128); in TestGetMatch()
1425 u_unescape(search.pattern, temp, 128); in TestGetMatch()
1441 int32_t matchindex = search.offset[count]; in TestGetMatch()
1444 int32_t matchlength = search.size[count]; in TestGetMatch()
1463 matchindex = search.offset[count]; in TestGetMatch()
1483 SearchData search = MATCH[count]; in TestSetMatch() local
1486 u_unescape(search.text, temp, 128); in TestSetMatch()
1489 u_unescape(search.pattern, temp, 128); in TestSetMatch()
1504 while (search.offset[size] != -1) { in TestSetMatch()
1508 if (strsrch->first(status) != search.offset[0] || U_FAILURE(status)) { in TestSetMatch()
1511 if (strsrch->last(status) != search.offset[size -1] || in TestSetMatch()
1519 if (strsrch->following(search.offset[index + 2] - 1, status) in TestSetMatch()
1520 != search.offset[index + 2] || U_FAILURE(status)) { in TestSetMatch()
1522 search.offset[index + 2] - 1); in TestSetMatch()
1526 if (strsrch->preceding(search.offset[index + 1] + in TestSetMatch()
1527 search.size[index + 1] + 1, in TestSetMatch()
1528 status) != search.offset[index + 1] || in TestSetMatch()
1531 search.offset[index + 1] + 1); in TestSetMatch()
1686 const SearchData *search; in TestDiacriticMatch() local
1688 search = &(DIACRITICMATCH[count]); in TestDiacriticMatch()
1689 while (search->text != NULL) { in TestDiacriticMatch()
1690 coll = getCollator(search->collator); in TestDiacriticMatch()
1691 coll->setStrength(getECollationStrength(search->strength)); in TestDiacriticMatch()
1692 strsrch = new StringSearch(pattern, text, coll, getBreakIterator(search->breaker), status); in TestDiacriticMatch()
1697 u_unescape(search->text, temp, 128); in TestDiacriticMatch()
1699 u_unescape(search->pattern, temp, 128); in TestDiacriticMatch()
1703 if (!assertEqualWithStringSearch(strsrch, search)) { in TestDiacriticMatch()
1706 search = &(DIACRITICMATCH[++count]); in TestDiacriticMatch()
1758 const SearchData *search = &(BREAKITERATORCANONICAL[count]); in TestBreakIteratorCanonical() local
1760 u_unescape(search->text, temp, 128); in TestBreakIteratorCanonical()
1763 u_unescape(search->pattern, temp, 128); in TestBreakIteratorCanonical()
1766 RuleBasedCollator *collator = getCollator(search->collator); in TestBreakIteratorCanonical()
1767 collator->setStrength(getECollationStrength(search->strength)); in TestBreakIteratorCanonical()
1769 BreakIterator *breaker = getBreakIterator(search->breaker); in TestBreakIteratorCanonical()
1783 if (!assertEqualWithStringSearch(strsrch, search)) { in TestBreakIteratorCanonical()
1788 search = &(BREAKITERATOREXACT[count + 1]); in TestBreakIteratorCanonical()
1789 breaker = getBreakIterator(search->breaker); in TestBreakIteratorCanonical()
1803 if (!assertEqualWithStringSearch(strsrch, search)) { in TestBreakIteratorCanonical()
1863 const SearchData *search = &(OVERLAPCANONICAL[count]); in TestOverlapCanonical() local
1866 u_unescape(search->text, temp, 128); in TestOverlapCanonical()
1869 u_unescape(search->pattern, temp, 128); in TestOverlapCanonical()
1872 RuleBasedCollator *collator = getCollator(search->collator); in TestOverlapCanonical()
1881 if (!assertEqualWithStringSearch(strsrch, search)) { in TestOverlapCanonical()
1885 search = &(NONOVERLAPCANONICAL[count]); in TestOverlapCanonical()
1892 if (!assertEqualWithStringSearch(strsrch, search)) { in TestOverlapCanonical()
2128 SearchData search = BASICCANONICAL[index ++]; in TestGetSetOffsetCanonical() local
2134 u_unescape(search.text, temp, 128); in TestGetSetOffsetCanonical()
2136 u_unescape(search.pattern, temp, 128); in TestGetSetOffsetCanonical()
2145 int32_t matchindex = search.offset[count]; in TestGetSetOffsetCanonical()
2147 int32_t matchlength = search.size[count]; in TestGetSetOffsetCanonical()
2160 matchindex = search.offset[count + 1] == -1 ? -1 : in TestGetSetOffsetCanonical()
2161 search.offset[count + 2]; in TestGetSetOffsetCanonical()
2162 if (search.offset[count + 1] != -1) { in TestGetSetOffsetCanonical()
2163 strsrch->setOffset(search.offset[count + 1] + 1, status); in TestGetSetOffsetCanonical()
2164 if (strsrch->getOffset() != search.offset[count + 1] + 1) { in TestGetSetOffsetCanonical()
2408 TestSearch search(text, NULL, pattern); in TestSubclass() local
2409 TestSearch search2(search); in TestSubclass()
2415 search.setText(text, status); in TestSubclass()
2416 if (search.getText() != search2.getText()) { in TestSubclass()
2420 search.setText(chariter, status); in TestSubclass()
2421 if (search.getText() != search2.getText()) { in TestSubclass()
2425 search.reset(); in TestSubclass()
2429 if (search.next(status) != expected[i]) { in TestSubclass()
2432 if (search.getMatchedLength() != search.m_pattern_.length()) { in TestSubclass()
2436 if (search.next(status) != USEARCH_DONE) { in TestSubclass()
2440 if (search.previous(status) != expected[i]) { in TestSubclass()
2443 if (search.getMatchedLength() != search.m_pattern_.length()) { in TestSubclass()
2447 if (search.previous(status) != USEARCH_DONE) { in TestSubclass()