Lines Matching refs:search
251 const SearchData *search)
255 int32_t matchindex = search->offset[count];
264 int32_t matchlength = search->size[count];
288 matchindex = search->offset[count];
303 matchindex = search->offset[count];
305 int32_t matchlength = search->size[count];
328 matchindex = count > 0 ? search->offset[count - 1] : -1;
345 UBool StringSearchTest::assertEqual(const SearchData *search)
349 Collator *collator = getCollator(search->collator);
350 BreakIterator *breaker = getBreakIterator(search->breaker);
355 if(search->breaker) {
359 u_unescape(search->text, temp, 128);
362 u_unescape(search->pattern, temp, 128);
371 collator->setStrength(getECollationStrength(search->strength));
375 errln("Error opening string search %s", u_errorName(status));
379 if (!assertEqualWithStringSearch(strsrch, search)) {
388 !assertEqualWithStringSearch(strsrch2, search)
403 UBool StringSearchTest::assertCanonicalEqual(const SearchData *search)
406 Collator *collator = getCollator(search->collator);
407 BreakIterator *breaker = getBreakIterator(search->breaker);
413 if(search->breaker) {
418 u_unescape(search->text, temp, 128);
421 u_unescape(search->pattern, temp, 128);
430 collator->setStrength(getECollationStrength(search->strength));
436 errln("Error opening string search %s", u_errorName(status));
441 if (!assertEqualWithStringSearch(strsrch, search)) {
454 UBool StringSearchTest::assertEqualWithAttribute(const SearchData *search,
459 Collator *collator = getCollator(search->collator);
460 BreakIterator *breaker = getBreakIterator(search->breaker);
466 if(search->breaker) {
471 u_unescape(search->text, temp, 128);
474 u_unescape(search->pattern, temp, 128);
483 collator->setStrength(getECollationStrength(search->strength));
490 errln("Error opening string search %s", u_errorName(status));
494 if (!assertEqualWithStringSearch(strsrch, search)) {
581 errln("Error: NULL break iterator is valid for opening search");
588 errln("Error: NULL break iterator is valid for opening search");
595 errln("Error: NULL break iterator is valid for opening search");
602 errln("Error: NULL break iterator is valid for opening search");
609 errln("Error: Break iterator is valid for opening search");
616 errln("Error: Break iterator is valid for opening search");
638 errln("Error opening search %s", u_errorName(status));
673 errln("Error: string search object expected to match itself");
676 errln("Error: string search objects are not expected to match");
690 errln("Error opening search %s", u_errorName(status));
767 errln("Error opening string search %s", u_errorName(status));
792 const SearchData *search = &(BREAKITERATOREXACT[count]);
793 RuleBasedCollator *collator = getCollator(search->collator);
794 BreakIterator *breaker = getBreakIterator(search->breaker);
797 u_unescape(search->text, temp, 128);
799 u_unescape(search->pattern, temp, 128);
804 collator->setStrength(getECollationStrength(search->strength));
814 if (!assertEqualWithStringSearch(strsrch, search)) {
818 search = &(BREAKITERATOREXACT[count + 1]);
819 breaker = getBreakIterator(search->breaker);
830 if (!assertEqualWithStringSearch(strsrch, search)) {
887 const SearchData *search = &(OVERLAP[count]);
889 u_unescape(search->text, temp, 128);
892 u_unescape(search->pattern, temp, 128);
896 RuleBasedCollator *collator = getCollator(search->collator);
907 if (!assertEqualWithStringSearch(strsrch, search)) {
912 search = &(NONOVERLAP[count]);
919 if (!assertEqualWithStringSearch(strsrch, search)) {
944 errln("Error opening string search %s", u_errorName(status));
1021 errln("Error opening string search %s", u_errorName(status));
1114 errln("Error opening string search %s", u_errorName(status));
1190 SearchData search = BASIC[index ++];
1193 u_unescape(search.text, temp, 128);
1195 u_unescape(search.pattern, temp, 128);
1200 search.strength));
1204 int32_t matchindex = search.offset[count];
1206 int32_t matchlength = search.size[count];
1219 matchindex = search.offset[count + 1] == -1 ? -1 :
1220 search.offset[count + 2];
1221 if (search.offset[count + 1] != -1) {
1222 strsrch->setOffset(search.offset[count + 1] + 1, status);
1223 if (strsrch->getOffset() != search.offset[count + 1] + 1) {
1256 errln("Error opening search %s", u_errorName(status));
1313 SearchData search = MATCH[0];
1314 u_unescape(search.text, temp, 128);
1317 u_unescape(search.pattern, temp, 128);
1325 errln("Error opening string search %s", u_errorName(status));
1333 int32_t matchindex = search.offset[count];
1336 int32_t matchlength = search.size[count];
1355 matchindex = search.offset[count];
1375 SearchData search = MATCH[count];
1378 u_unescape(search.text, temp, 128);
1381 u_unescape(search.pattern, temp, 128);
1388 errln("Error opening string search %s", u_errorName(status));
1396 while (search.offset[size] != -1) {
1400 if (strsrch->first(status) != search.offset[0] || U_FAILURE(status)) {
1403 if (strsrch->last(status) != search.offset[size -1] ||
1411 if (strsrch->following(search.offset[index + 2] - 1, status)
1412 != search.offset[index + 2] || U_FAILURE(status)) {
1414 search.offset[index + 2] - 1);
1418 if (strsrch->preceding(search.offset[index + 1] +
1419 search.size[index + 1] + 1,
1420 status) != search.offset[index + 1] ||
1423 search.offset[index + 1] + 1);
1448 errln("Error opening string search %s", u_errorName(status));
1466 errln("Error resetting string search");
1471 errln("Error resetting string search\n");
1506 errln("Error opening string search %s", u_errorName(status));
1546 errln("Error opening string search %s", u_errorName(status));
1578 const SearchData *search;
1580 search = &(DIACRITICMATCH[count]);
1581 while (search->text != NULL) {
1582 coll = getCollator(search->collator);
1583 coll->setStrength(getECollationStrength(search->strength));
1584 strsrch = new StringSearch(pattern, text, coll, getBreakIterator(search->breaker), status);
1586 errln("Error opening string search %s", u_errorName(status));
1589 u_unescape(search->text, temp, 128);
1591 u_unescape(search->pattern, temp, 128);
1595 if (!assertEqualWithStringSearch(strsrch, search)) {
1598 search = &(DIACRITICMATCH[++count]);
1650 const SearchData *search = &(BREAKITERATORCANONICAL[count]);
1652 u_unescape(search->text, temp, 128);
1655 u_unescape(search->pattern, temp, 128);
1658 RuleBasedCollator *collator = getCollator(search->collator);
1659 collator->setStrength(getECollationStrength(search->strength));
1661 BreakIterator *breaker = getBreakIterator(search->breaker);
1665 errln("Error creating string search data");
1675 if (!assertEqualWithStringSearch(strsrch, search)) {
1680 search = &(BREAKITERATOREXACT[count + 1]);
1681 breaker = getBreakIterator(search->breaker);
1695 if (!assertEqualWithStringSearch(strsrch, search)) {
1755 const SearchData *search = &(OVERLAPCANONICAL[count]);
1758 u_unescape(search->text, temp, 128);
1761 u_unescape(search->pattern, temp, 128);
1764 RuleBasedCollator *collator = getCollator(search->collator);
1773 if (!assertEqualWithStringSearch(strsrch, search)) {
1777 search = &(NONOVERLAPCANONICAL[count]);
1784 if (!assertEqualWithStringSearch(strsrch, search)) {
1810 errln("Error opening string search %s", u_errorName(status));
1876 errln("Error opening string search %s", u_errorName(status));
1940 errln("Error opening string search %s", u_errorName(status));
2020 SearchData search = BASICCANONICAL[index ++];
2026 u_unescape(search.text, temp, 128);
2028 u_unescape(search.pattern, temp, 128);
2037 int32_t matchindex = search.offset[count];
2039 int32_t matchlength = search.size[count];
2052 matchindex = search.offset[count + 1] == -1 ? -1 :
2053 search.offset[count + 2];
2054 if (search.offset[count + 1] != -1) {
2055 strsrch->setOffset(search.offset[count + 1] + 1, status);
2056 if (strsrch->getOffset() != search.offset[count + 1] + 1) {
2112 errln("Error opening string search %s", u_errorName(status));
2300 TestSearch search(text, NULL, pattern);
2301 TestSearch search2(search);
2307 search.setText(text, status);
2308 if (search.getText() != search2.getText()) {
2312 search.setText(chariter, status);
2313 if (search.getText() != search2.getText()) {
2317 search.reset();
2321 if (search.next(status) != expected[i]) {
2324 if (search.getMatchedLength() != search.m_pattern_.length()) {
2328 if (search.next(status) != USEARCH_DONE) {
2332 if (search.previous(status) != expected[i]) {
2335 if (search.getMatchedLength() != search.m_pattern_.length()) {
2339 if (search.previous(status) != USEARCH_DONE) {
