Lines Matching refs:search
255 const SearchData *search)
259 int32_t matchindex = search->offset[count];
263 strsrch->setAttribute(USEARCH_ELEMENT_COMPARISON, search->elemCompare, status);
276 matchlength = search->size[count];
301 matchindex = search->offset[count];
317 matchindex = search->offset[count];
319 matchlength = search->size[count];
343 matchindex = count > 0 ? search->offset[count - 1] : -1;
363 matchindex = search->offset[count];
385 matchlength = search->size[count];
407 matchindex = search->offset[count];
412 while (search->offset[count + 1] >= 0) {
436 matchindex = search->offset[count];
437 matchlength = search->size[count];
460 UBool StringSearchTest::assertEqual(const SearchData *search)
464 Collator *collator = getCollator(search->collator);
465 BreakIterator *breaker = getBreakIterator(search->breaker);
470 if(search->breaker) {
474 u_unescape(search->text, temp, 128);
477 u_unescape(search->pattern, temp, 128);
486 collator->setStrength(getECollationStrength(search->strength));
490 errln("Error opening string search %s", u_errorName(status));
494 if (!assertEqualWithStringSearch(strsrch, search)) {
503 !assertEqualWithStringSearch(strsrch2, search)
518 UBool StringSearchTest::assertCanonicalEqual(const SearchData *search)
521 Collator *collator = getCollator(search->collator);
522 BreakIterator *breaker = getBreakIterator(search->breaker);
528 if(search->breaker) {
533 u_unescape(search->text, temp, 128);
536 u_unescape(search->pattern, temp, 128);
545 collator->setStrength(getECollationStrength(search->strength));
551 errln("Error opening string search %s", u_errorName(status));
556 if (!assertEqualWithStringSearch(strsrch, search)) {
569 UBool StringSearchTest::assertEqualWithAttribute(const SearchData *search,
574 Collator *collator = getCollator(search->collator);
575 BreakIterator *breaker = getBreakIterator(search->breaker);
581 if(search->breaker) {
586 u_unescape(search->text, temp, 128);
589 u_unescape(search->pattern, temp, 128);
598 collator->setStrength(getECollationStrength(search->strength));
605 errln("Error opening string search %s", u_errorName(status));
609 if (!assertEqualWithStringSearch(strsrch, search)) {
696 errln("Error: NULL break iterator is valid for opening search");
703 errln("Error: NULL break iterator is valid for opening search");
710 errln("Error: NULL break iterator is valid for opening search");
717 errln("Error: NULL break iterator is valid for opening search");
724 errln("Error: Break iterator is valid for opening search");
731 errln("Error: Break iterator is valid for opening search");
753 errln("Error opening search %s", u_errorName(status));
788 errln("Error: string search object expected to match itself");
791 errln("Error: string search objects are not expected to match");
805 errln("Error opening search %s", u_errorName(status));
882 errln("Error opening string search %s", u_errorName(status));
907 const SearchData *search = &(BREAKITERATOREXACT[count]);
908 RuleBasedCollator *collator = getCollator(search->collator);
909 BreakIterator *breaker = getBreakIterator(search->breaker);
912 u_unescape(search->text, temp, 128);
914 u_unescape(search->pattern, temp, 128);
919 collator->setStrength(getECollationStrength(search->strength));
929 if (!assertEqualWithStringSearch(strsrch, search)) {
933 search = &(BREAKITERATOREXACT[count + 1]);
934 breaker = getBreakIterator(search->breaker);
945 if (!assertEqualWithStringSearch(strsrch, search)) {
1002 const SearchData *search = &(OVERLAP[count]);
1004 u_unescape(search->text, temp, 128);
1007 u_unescape(search->pattern, temp, 128);
1011 RuleBasedCollator *collator = getCollator(search->collator);
1022 if (!assertEqualWithStringSearch(strsrch, search)) {
1027 search = &(NONOVERLAP[count]);
1034 if (!assertEqualWithStringSearch(strsrch, search)) {
1059 errln("Error opening string search %s", u_errorName(status));
1126 errln("Error opening string search %s", u_errorName(status));
1219 errln("Error opening string search %s", u_errorName(status));
1295 SearchData search = BASIC[index ++];
1298 u_unescape(search.text, temp, 128);
1300 u_unescape(search.pattern, temp, 128);
1305 search.strength));
1309 int32_t matchindex = search.offset[count];
1311 int32_t matchlength = search.size[count];
1324 matchindex = search.offset[count + 1] == -1 ? -1 :
1325 search.offset[count + 2];
1326 if (search.offset[count + 1] != -1) {
1327 strsrch->setOffset(search.offset[count + 1] + 1, status);
1328 if (strsrch->getOffset() != search.offset[count + 1] + 1) {
1361 errln("Error opening search %s", u_errorName(status));
1418 SearchData search = MATCH[0];
1419 u_unescape(search.text, temp, 128);
1422 u_unescape(search.pattern, temp, 128);
1430 errln("Error opening string search %s", u_errorName(status));
1438 int32_t matchindex = search.offset[count];
1441 int32_t matchlength = search.size[count];
1460 matchindex = search.offset[count];
1480 SearchData search = MATCH[count];
1483 u_unescape(search.text, temp, 128);
1486 u_unescape(search.pattern, temp, 128);
1493 errln("Error opening string search %s", u_errorName(status));
1501 while (search.offset[size] != -1) {
1505 if (strsrch->first(status) != search.offset[0] || U_FAILURE(status)) {
1508 if (strsrch->last(status) != search.offset[size -1] ||
1516 if (strsrch->following(search.offset[index + 2] - 1, status)
1517 != search.offset[index + 2] || U_FAILURE(status)) {
1519 search.offset[index + 2] - 1);
1523 if (strsrch->preceding(search.offset[index + 1] +
1524 search.size[index + 1] + 1,
1525 status) != search.offset[index + 1] ||
1528 search.offset[index + 1] + 1);
1553 errln("Error opening string search %s", u_errorName(status));
1571 errln("Error resetting string search");
1576 errln("Error resetting string search\n");
1611 errln("Error opening string search %s", u_errorName(status));
1651 errln("Error opening string search %s", u_errorName(status));
1683 const SearchData *search;
1685 search = &(DIACRITICMATCH[count]);
1686 while (search->text != NULL) {
1687 coll = getCollator(search->collator);
1688 coll->setStrength(getECollationStrength(search->strength));
1689 strsrch = new StringSearch(pattern, text, coll, getBreakIterator(search->breaker), status);
1691 errln("Error opening string search %s", u_errorName(status));
1694 u_unescape(search->text, temp, 128);
1696 u_unescape(search->pattern, temp, 128);
1700 if (!assertEqualWithStringSearch(strsrch, search)) {
1703 search = &(DIACRITICMATCH[++count]);
1755 const SearchData *search = &(BREAKITERATORCANONICAL[count]);
1757 u_unescape(search->text, temp, 128);
1760 u_unescape(search->pattern, temp, 128);
1763 RuleBasedCollator *collator = getCollator(search->collator);
1764 collator->setStrength(getECollationStrength(search->strength));
1766 BreakIterator *breaker = getBreakIterator(search->breaker);
1770 errln("Error creating string search data");
1780 if (!assertEqualWithStringSearch(strsrch, search)) {
1785 search = &(BREAKITERATOREXACT[count + 1]);
1786 breaker = getBreakIterator(search->breaker);
1800 if (!assertEqualWithStringSearch(strsrch, search)) {
1860 const SearchData *search = &(OVERLAPCANONICAL[count]);
1863 u_unescape(search->text, temp, 128);
1866 u_unescape(search->pattern, temp, 128);
1869 RuleBasedCollator *collator = getCollator(search->collator);
1878 if (!assertEqualWithStringSearch(strsrch, search)) {
1882 search = &(NONOVERLAPCANONICAL[count]);
1889 if (!assertEqualWithStringSearch(strsrch, search)) {
1915 errln("Error opening string search %s", u_errorName(status));
1981 errln("Error opening string search %s", u_errorName(status));
2045 errln("Error opening string search %s", u_errorName(status));
2125 SearchData search = BASICCANONICAL[index ++];
2131 u_unescape(search.text, temp, 128);
2133 u_unescape(search.pattern, temp, 128);
2142 int32_t matchindex = search.offset[count];
2144 int32_t matchlength = search.size[count];
2157 matchindex = search.offset[count + 1] == -1 ? -1 :
2158 search.offset[count + 2];
2159 if (search.offset[count + 1] != -1) {
2160 strsrch->setOffset(search.offset[count + 1] + 1, status);
2161 if (strsrch->getOffset() != search.offset[count + 1] + 1) {
2217 errln("Error opening string search %s", u_errorName(status));
2405 TestSearch search(text, NULL, pattern);
2406 TestSearch search2(search);
2412 search.setText(text, status);
2413 if (search.getText() != search2.getText()) {
2417 search.setText(chariter, status);
2418 if (search.getText() != search2.getText()) {
2422 search.reset();
2426 if (search.next(status) != expected[i]) {
2429 if (search.getMatchedLength() != search.m_pattern_.length()) {
2433 if (search.next(status) != USEARCH_DONE) {
2437 if (search.previous(status) != expected[i]) {
2440 if (search.getMatchedLength() != search.m_pattern_.length()) {
2444 if (search.previous(status) != USEARCH_DONE) {