Lines Matching refs:search
339 const SearchData search) in assertEqualWithUStringSearch() argument
343 int32_t matchindex = search.offset[count]; in assertEqualWithUStringSearch()
350 usearch_setAttribute(strsrch, USEARCH_ELEMENT_COMPARISON, search.elemCompare, &status); in assertEqualWithUStringSearch()
362 matchlength = search.size[count]; in assertEqualWithUStringSearch()
385 matchindex = search.offset[count]; in assertEqualWithUStringSearch()
401 matchindex = search.offset[count]; in assertEqualWithUStringSearch()
404 matchlength = search.size[count]; in assertEqualWithUStringSearch()
426 matchindex = count > 0 ? search.offset[count - 1] : -1; in assertEqualWithUStringSearch()
447 matchindex = search.offset[count]; in assertEqualWithUStringSearch()
469 matchlength = search.size[count]; in assertEqualWithUStringSearch()
491 matchindex = search.offset[count]; in assertEqualWithUStringSearch()
496 while (search.offset[count + 1] >= 0) { in assertEqualWithUStringSearch()
520 matchindex = search.offset[count]; in assertEqualWithUStringSearch()
521 matchlength = search.size[count]; in assertEqualWithUStringSearch()
544 static UBool assertEqual(const SearchData search) in assertEqual() argument
549 UCollator *collator = getCollator(search.collator); in assertEqual()
550 UBreakIterator *breaker = getBreakIterator(search.breaker); in assertEqual()
553 CHECK_BREAK_BOOL(search.breaker); in assertEqual()
555 u_unescape(search.text, text, 128); in assertEqual()
556 u_unescape(search.pattern, pattern, 32); in assertEqual()
557 ucol_setStrength(collator, search.strength); in assertEqual()
565 if (!assertEqualWithUStringSearch(strsrch, search)) { in assertEqual()
575 static UBool assertCanonicalEqual(const SearchData search) in assertCanonicalEqual() argument
580 UCollator *collator = getCollator(search.collator); in assertCanonicalEqual()
581 UBreakIterator *breaker = getBreakIterator(search.breaker); in assertCanonicalEqual()
585 CHECK_BREAK_BOOL(search.breaker); in assertCanonicalEqual()
586 u_unescape(search.text, text, 128); in assertCanonicalEqual()
587 u_unescape(search.pattern, pattern, 32); in assertCanonicalEqual()
588 ucol_setStrength(collator, search.strength); in assertCanonicalEqual()
600 if (!assertEqualWithUStringSearch(strsrch, search)) { in assertCanonicalEqual()
614 static UBool assertEqualWithAttribute(const SearchData search, in assertEqualWithAttribute() argument
621 UCollator *collator = getCollator(search.collator); in assertEqualWithAttribute()
622 UBreakIterator *breaker = getBreakIterator(search.breaker); in assertEqualWithAttribute()
625 CHECK_BREAK_BOOL(search.breaker); in assertEqualWithAttribute()
626 u_unescape(search.text, text, 128); in assertEqualWithAttribute()
627 u_unescape(search.pattern, pattern, 32); in assertEqualWithAttribute()
628 ucol_setStrength(collator, search.strength); in assertEqualWithAttribute()
640 if (!assertEqualWithUStringSearch(strsrch, search)) { in assertEqualWithAttribute()
776 const SearchData *search = &(BREAKITERATOREXACT[count]); in TestBreakIterator() local
777 UCollator *collator = getCollator(search->collator); in TestBreakIterator()
778 UBreakIterator *breaker = getBreakIterator(search->breaker); in TestBreakIterator()
780 u_unescape(search->text, text, 128); in TestBreakIterator()
781 u_unescape(search->pattern, pattern, 32); in TestBreakIterator()
782 ucol_setStrength(collator, search->strength); in TestBreakIterator()
793 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestBreakIterator()
798 search = &(BREAKITERATOREXACT[count + 1]); in TestBreakIterator()
799 breaker = getBreakIterator(search->breaker); in TestBreakIterator()
807 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestBreakIterator()
883 const SearchData *search = &(OVERLAP[count]); in TestOverlap() local
884 UCollator *collator = getCollator(search->collator); in TestOverlap()
888 u_unescape(search->text, text, 128); in TestOverlap()
889 u_unescape(search->pattern, pattern, 32); in TestOverlap()
904 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestOverlap()
908 search = &(NONOVERLAP[count]); in TestOverlap()
915 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestOverlap()
1246 SearchData search = BASIC[searchDataIndex ++]; in TestGetSetOffset() local
1247 int32_t matchindex = search.offset[count]; in TestGetSetOffset()
1250 u_unescape(search.text, text, 128); in TestGetSetOffset()
1251 u_unescape(search.pattern, pattern, 32); in TestGetSetOffset()
1255 ucol_setStrength(usearch_getCollator(strsrch), search.strength); in TestGetSetOffset()
1258 uint32_t matchlength = search.size[count]; in TestGetSetOffset()
1287 matchindex = search.offset[count + 1] == -1 ? -1 : in TestGetSetOffset()
1288 search.offset[count + 2]; in TestGetSetOffset()
1289 if (search.offset[count + 1] != -1) { in TestGetSetOffset()
1290 usearch_setOffset(strsrch, search.offset[count + 1] + 1, in TestGetSetOffset()
1292 if (usearch_getOffset(strsrch) != search.offset[count + 1] + 1) { in TestGetSetOffset()
1409 SearchData search = MATCH[0]; in TestGetMatch() local
1410 int32_t matchindex = search.offset[count]; in TestGetMatch()
1427 u_unescape(search.text, text, 128); in TestGetMatch()
1428 u_unescape(search.pattern, pattern, 32); in TestGetMatch()
1440 int32_t matchlength = search.size[count]; in TestGetMatch()
1486 matchindex = search.offset[count]; in TestGetMatch()
1513 SearchData search = MATCH[count]; in TestSetMatch() local
1525 u_unescape(search.text, text, 128); in TestSetMatch()
1526 u_unescape(search.pattern, pattern, 32); in TestSetMatch()
1538 while (search.offset[size] != -1) { in TestSetMatch()
1542 if (usearch_first(strsrch, &status) != search.offset[0] || in TestSetMatch()
1546 if (usearch_last(strsrch, &status) != search.offset[size -1] || in TestSetMatch()
1553 if (usearch_following(strsrch, search.offset[offsetIndex + 2] - 1, in TestSetMatch()
1554 &status) != search.offset[offsetIndex + 2] || in TestSetMatch()
1557 search.offset[offsetIndex + 2] - 1); in TestSetMatch()
1561 if (usearch_preceding(strsrch, search.offset[offsetIndex + 1] + in TestSetMatch()
1562 search.size[offsetIndex + 1] + 1, in TestSetMatch()
1563 &status) != search.offset[offsetIndex + 1] || in TestSetMatch()
1566 search.offset[offsetIndex + 1] + 1); in TestSetMatch()
1747 SearchData search; in TestDiacriticMatch() local
1758 search = DIACRITICMATCH[count]; in TestDiacriticMatch()
1759 while (search.text != NULL) { in TestDiacriticMatch()
1760 if (search.collator != NULL) { in TestDiacriticMatch()
1761 coll = ucol_openFromShortString(search.collator, FALSE, NULL, &status); in TestDiacriticMatch()
1765 ucol_setStrength(coll, search.strength); in TestDiacriticMatch()
1768 …log_err("Error opening string search collator(\"%s\") %s\n", search.collator, u_errorName(status)); in TestDiacriticMatch()
1778 u_unescape(search.text, text, 128); in TestDiacriticMatch()
1779 u_unescape(search.pattern, pattern, 128); in TestDiacriticMatch()
1782 if (!assertEqualWithUStringSearch(strsrch, search)) { in TestDiacriticMatch()
1787 search = DIACRITICMATCH[++count]; in TestDiacriticMatch()
1866 const SearchData *search = &(BREAKITERATORCANONICAL[count]); in TestBreakIteratorCanonical() local
1867 UCollator *collator = getCollator(search->collator); in TestBreakIteratorCanonical()
1868 UBreakIterator *breaker = getBreakIterator(search->breaker); in TestBreakIteratorCanonical()
1871 u_unescape(search->text, text, 128); in TestBreakIteratorCanonical()
1872 u_unescape(search->pattern, pattern, 32); in TestBreakIteratorCanonical()
1873 ucol_setStrength(collator, search->strength); in TestBreakIteratorCanonical()
1892 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestBreakIteratorCanonical()
1897 search = &(BREAKITERATOREXACT[count + 1]); in TestBreakIteratorCanonical()
1898 breaker = getBreakIterator(search->breaker); in TestBreakIteratorCanonical()
1908 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestBreakIteratorCanonical()
1984 const SearchData *search = &(OVERLAPCANONICAL[count]); in TestOverlapCanonical() local
1985 UCollator *collator = getCollator(search->collator); in TestOverlapCanonical()
1989 u_unescape(search->text, text, 128); in TestOverlapCanonical()
1990 u_unescape(search->pattern, pattern, 32); in TestOverlapCanonical()
2007 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestOverlapCanonical()
2011 search = &(NONOVERLAPCANONICAL[count]); in TestOverlapCanonical()
2018 if (!assertEqualWithUStringSearch(strsrch, *search)) { in TestOverlapCanonical()
2301 SearchData search = BASICCANONICAL[searchDataIndex ++]; in TestGetSetOffsetCanonical() local
2302 int32_t matchindex = search.offset[count]; in TestGetSetOffsetCanonical()
2310 u_unescape(search.text, text, 128); in TestGetSetOffsetCanonical()
2311 u_unescape(search.pattern, pattern, 32); in TestGetSetOffsetCanonical()
2316 uint32_t matchlength = search.size[count]; in TestGetSetOffsetCanonical()
2330 matchindex = search.offset[count + 1] == -1 ? -1 : in TestGetSetOffsetCanonical()
2331 search.offset[count + 2]; in TestGetSetOffsetCanonical()
2332 if (search.offset[count + 1] != -1) { in TestGetSetOffsetCanonical()
2333 usearch_setOffset(strsrch, search.offset[count + 1] + 1, in TestGetSetOffsetCanonical()
2335 if (usearch_getOffset(strsrch) != search.offset[count + 1] + 1) { in TestGetSetOffsetCanonical()
2461 UStringSearch *search = NULL; in TestForwardBackward() local
2478 search = usearch_openFromCollator(value, 2, usrcstr, 22, coll, NULL, &status); in TestForwardBackward()
2484 usearch_reset(search); in TestForwardBackward()
2486 pos = usearch_first(search, &status); in TestForwardBackward()
2493 usearch_reset(search); in TestForwardBackward()
2495 pos = usearch_last(search, &status); in TestForwardBackward()
2504 if (search != NULL) { in TestForwardBackward()
2505 usearch_close(search); in TestForwardBackward()
2516 UStringSearch *search; in TestSearchForNull() local
2569 search = usearch_openFromCollator(pattern, PATTERN_LEN, text, in TestSearchForNull()
2573 if (coll != NULL && search != NULL) { in TestSearchForNull()
2574 pos = usearch_first(search, &ec); in TestSearchForNull()
2575 len = usearch_getMatchedLength(search); in TestSearchForNull()
2586 for (pos = usearch_first(search, &ec); pos != USEARCH_DONE; pos in TestSearchForNull()
2587 = usearch_next(search, &ec)) { in TestSearchForNull()
2598 usearch_close(search); in TestSearchForNull()
2605 UStringSearch *search; in TestStrengthIdentical() local
2626 search = usearch_openFromCollator (pattern, pLen, text, tLen, coll, NULL, &ec); in TestStrengthIdentical()
2629 if (coll != NULL && search != NULL) { in TestStrengthIdentical()
2630 pos = usearch_first(search, &ec); in TestStrengthIdentical()
2631 len = usearch_getMatchedLength(search); in TestStrengthIdentical()
2643 usearch_reset(search); in TestStrengthIdentical()
2645 pos = usearch_first(search, &ec); in TestStrengthIdentical()
2646 len = usearch_getMatchedLength(search); in TestStrengthIdentical()
2653 usearch_close(search); in TestStrengthIdentical()
2819 static void TestPCEBuffer_with(const UChar *search, uint32_t searchLen, const UChar *source, uint32… in TestPCEBuffer_with() argument
2860 usearch = usearch_openFromCollator( search, in TestPCEBuffer_with()
2897 UChar search[] = in TestPCEBuffer_100df() local
2901 uint32_t searchLen = UPRV_LENGTHOF(search); in TestPCEBuffer_100df()
2903 TestPCEBuffer_with(search,searchLen,source,sourceLen); in TestPCEBuffer_100df()
2908 UChar search[] = in TestPCEBuffer_2surr() local
2912 uint32_t searchLen = UPRV_LENGTHOF(search); in TestPCEBuffer_2surr()
2914 TestPCEBuffer_with(search,searchLen,source,sourceLen); in TestPCEBuffer_2surr()
2919 UChar search[] = { 0x00c9 }; in TestMatchFollowedByIgnorables() local
2932 searchLen = UPRV_LENGTHOF(search); in TestMatchFollowedByIgnorables()
2959 usearch = usearch_openFromCollator(search, in TestMatchFollowedByIgnorables()