Lines Matching refs:count
138 int count = 0; in toCharString() local
141 for (; count < length; count ++) { in toCharString()
142 UChar ch = unichars[count]; in toCharString()
339 int count = 0; in assertEqualWithUStringSearch() local
342 int32_t matchindex = search.offset[count]; in assertEqualWithUStringSearch()
358 uint32_t matchlength = search.size[count]; in assertEqualWithUStringSearch()
371 count ++; in assertEqualWithUStringSearch()
381 matchindex = search.offset[count]; in assertEqualWithUStringSearch()
396 count = count == 0 ? 0 : count - 1; in assertEqualWithUStringSearch()
397 matchlimit = count; in assertEqualWithUStringSearch()
398 matchindex = search.offset[count]; in assertEqualWithUStringSearch()
401 uint32_t matchlength = search.size[count]; in assertEqualWithUStringSearch()
423 matchindex = count > 0 ? search.offset[count - 1] : -1; in assertEqualWithUStringSearch()
424 count --; in assertEqualWithUStringSearch()
551 int count = 0; in TestBasic() local
558 while (BASIC[count].text != NULL) { in TestBasic()
559 if (!assertEqual(BASIC[count])) { in TestBasic()
560 log_err("Error at test number %d\n", count); in TestBasic()
562 count ++; in TestBasic()
569 int count = 0; in TestNormExact() local
581 while (BASIC[count].text != NULL) { in TestNormExact()
582 if (!assertEqual(BASIC[count])) { in TestNormExact()
583 log_err("Error at test number %d\n", count); in TestNormExact()
585 count ++; in TestNormExact()
587 count = 0; in TestNormExact()
588 while (NORMEXACT[count].text != NULL) { in TestNormExact()
589 if (!assertEqual(NORMEXACT[count])) { in TestNormExact()
590 log_err("Error at test number %d\n", count); in TestNormExact()
592 count ++; in TestNormExact()
595 count = 0; in TestNormExact()
596 while (NONNORMEXACT[count].text != NULL) { in TestNormExact()
597 if (!assertEqual(NONNORMEXACT[count])) { in TestNormExact()
598 log_err("Error at test number %d\n", count); in TestNormExact()
600 count ++; in TestNormExact()
607 int count = 0; in TestStrength() local
614 while (STRENGTH[count].text != NULL) { in TestStrength()
615 if (!assertEqual(STRENGTH[count])) { in TestStrength()
616 log_err("Error at test number %d\n", count); in TestStrength()
618 count ++; in TestStrength()
628 int count = 0; in TestBreakIterator() local
672 count = 0; in TestBreakIterator()
673 while (count < 4) { in TestBreakIterator()
675 const SearchData *search = &(BREAKITERATOREXACT[count]); in TestBreakIterator()
697 search = &(BREAKITERATOREXACT[count + 1]); in TestBreakIterator()
707 log_err("Error at test number %d\n", count); in TestBreakIterator()
712 count += 2; in TestBreakIterator()
714 count = 0; in TestBreakIterator()
715 while (BREAKITERATOREXACT[count].text != NULL) { in TestBreakIterator()
716 if (!assertEqual(BREAKITERATOREXACT[count])) { in TestBreakIterator()
717 log_err("Error at test number %d\n", count); in TestBreakIterator()
720 count ++; in TestBreakIterator()
730 int count = 0; in TestVariable() local
742 while (VARIABLE[count].text != NULL) { in TestVariable()
743 log_verbose("variable %d\n", count); in TestVariable()
744 if (!assertEqual(VARIABLE[count])) { in TestVariable()
745 log_err("Error at test number %d\n", count); in TestVariable()
747 count ++; in TestVariable()
756 int count = 0; in TestOverlap() local
763 while (OVERLAP[count].text != NULL) { in TestOverlap()
764 if (!assertEqualWithAttribute(OVERLAP[count], USEARCH_OFF, in TestOverlap()
766 log_err("Error at overlap test number %d\n", count); in TestOverlap()
768 count ++; in TestOverlap()
770 count = 0; in TestOverlap()
771 while (NONOVERLAP[count].text != NULL) { in TestOverlap()
772 if (!assertEqual(NONOVERLAP[count])) { in TestOverlap()
773 log_err("Error at non overlap test number %d\n", count); in TestOverlap()
775 count ++; in TestOverlap()
778 count = 0; in TestOverlap()
779 while (count < 1) { in TestOverlap()
782 const SearchData *search = &(OVERLAP[count]); in TestOverlap()
807 search = &(NONOVERLAP[count]); in TestOverlap()
816 log_err("Error at test number %d\n", count); in TestOverlap()
819 count ++; in TestOverlap()
1097 int count = 0; in TestCompositeBoundaries() local
1104 while (COMPOSITEBOUNDARIES[count].text != NULL) { in TestCompositeBoundaries()
1105 log_verbose("composite %d\n", count); in TestCompositeBoundaries()
1106 if (!assertEqual(COMPOSITEBOUNDARIES[count])) { in TestCompositeBoundaries()
1107 log_err("Error at test number %d\n", count); in TestCompositeBoundaries()
1109 count ++; in TestCompositeBoundaries()
1144 int count = 0; in TestGetSetOffset() local
1146 int32_t matchindex = search.offset[count]; in TestGetSetOffset()
1157 uint32_t matchlength = search.size[count]; in TestGetSetOffset()
1186 matchindex = search.offset[count + 1] == -1 ? -1 : in TestGetSetOffset()
1187 search.offset[count + 2]; in TestGetSetOffset()
1188 if (search.offset[count + 1] != -1) { in TestGetSetOffset()
1189 usearch_setOffset(strsrch, search.offset[count + 1] + 1, in TestGetSetOffset()
1191 if (usearch_getOffset(strsrch) != search.offset[count + 1] + 1) { in TestGetSetOffset()
1197 count += 2; in TestGetSetOffset()
1304 int count = 0; in TestGetMatch() local
1309 int32_t matchindex = search.offset[count]; in TestGetMatch()
1339 int32_t matchlength = search.size[count]; in TestGetMatch()
1352 count ++; in TestGetMatch()
1385 matchindex = search.offset[count]; in TestGetMatch()
1404 int count = 0; in TestSetMatch() local
1411 while (MATCH[count].text != NULL) { in TestSetMatch()
1412 SearchData search = MATCH[count]; in TestSetMatch()
1478 count ++; in TestSetMatch()
1535 int count = 0; in TestSupplementary() local
1542 while (SUPPLEMENTARY[count].text != NULL) { in TestSupplementary()
1543 if (!assertEqual(SUPPLEMENTARY[count])) { in TestSupplementary()
1544 log_err("Error at test number %d\n", count); in TestSupplementary()
1546 count ++; in TestSupplementary()
1558 int count = 0; in TestContraction() local
1580 while (CONTRACTION[count].text != NULL) { in TestContraction()
1581 u_unescape(CONTRACTION[count].text, text, 128); in TestContraction()
1582 u_unescape(CONTRACTION[count].pattern, pattern, 128); in TestContraction()
1585 if (!assertEqualWithUStringSearch(strsrch, CONTRACTION[count])) { in TestContraction()
1586 log_err("Error at test number %d\n", count); in TestContraction()
1588 count ++; in TestContraction()
1602 uint32_t count = 0; in TestIgnorable() local
1610 IGNORABLE[count].strength, NULL, &status); in TestIgnorable()
1624 while (IGNORABLE[count].text != NULL) { in TestIgnorable()
1625 u_unescape(IGNORABLE[count].text, text, 128); in TestIgnorable()
1626 u_unescape(IGNORABLE[count].pattern, pattern, 128); in TestIgnorable()
1629 if (!assertEqualWithUStringSearch(strsrch, IGNORABLE[count])) { in TestIgnorable()
1630 log_err("Error at test number %d\n", count); in TestIgnorable()
1632 count ++; in TestIgnorable()
1645 uint32_t count = 0; in TestDiacriticMatch() local
1657 search = DIACRITICMATCH[count]; in TestDiacriticMatch()
1682 log_err("Error at test number %d\n", count); in TestDiacriticMatch()
1686 search = DIACRITICMATCH[++count]; in TestDiacriticMatch()
1693 int count = 0; in TestCanonical() local
1700 while (BASICCANONICAL[count].text != NULL) { in TestCanonical()
1701 if (!assertCanonicalEqual(BASICCANONICAL[count])) { in TestCanonical()
1702 log_err("Error at test number %d\n", count); in TestCanonical()
1704 count ++; in TestCanonical()
1711 int count = 0; in TestNormCanonical() local
1719 count = 0; in TestNormCanonical()
1720 while (NORMCANONICAL[count].text != NULL) { in TestNormCanonical()
1721 if (!assertCanonicalEqual(NORMCANONICAL[count])) { in TestNormCanonical()
1722 log_err("Error at test number %d\n", count); in TestNormCanonical()
1724 count ++; in TestNormCanonical()
1732 int count = 0; in TestStrengthCanonical() local
1739 while (STRENGTHCANONICAL[count].text != NULL) { in TestStrengthCanonical()
1740 if (!assertCanonicalEqual(STRENGTHCANONICAL[count])) { in TestStrengthCanonical()
1741 log_err("Error at test number %d\n", count); in TestStrengthCanonical()
1743 count ++; in TestStrengthCanonical()
1750 int count = 0; in TestBreakIteratorCanonical() local
1761 while (count < 4) { in TestBreakIteratorCanonical()
1765 const SearchData *search = &(BREAKITERATORCANONICAL[count]); in TestBreakIteratorCanonical()
1796 search = &(BREAKITERATOREXACT[count + 1]); in TestBreakIteratorCanonical()
1808 log_err("Error at test number %d\n", count); in TestBreakIteratorCanonical()
1813 count += 2; in TestBreakIteratorCanonical()
1815 count = 0; in TestBreakIteratorCanonical()
1816 while (BREAKITERATORCANONICAL[count].text != NULL) { in TestBreakIteratorCanonical()
1817 if (!assertEqual(BREAKITERATORCANONICAL[count])) { in TestBreakIteratorCanonical()
1818 log_err("Error at test number %d\n", count); in TestBreakIteratorCanonical()
1821 count ++; in TestBreakIteratorCanonical()
1831 int count = 0; in TestVariableCanonical() local
1843 while (VARIABLE[count].text != NULL) { in TestVariableCanonical()
1844 log_verbose("variable %d\n", count); in TestVariableCanonical()
1845 if (!assertCanonicalEqual(VARIABLE[count])) { in TestVariableCanonical()
1846 log_err("Error at test number %d\n", count); in TestVariableCanonical()
1848 count ++; in TestVariableCanonical()
1857 int count = 0; in TestOverlapCanonical() local
1864 while (OVERLAPCANONICAL[count].text != NULL) { in TestOverlapCanonical()
1865 if (!assertEqualWithAttribute(OVERLAPCANONICAL[count], USEARCH_ON, in TestOverlapCanonical()
1867 log_err("Error at overlap test number %d\n", count); in TestOverlapCanonical()
1869 count ++; in TestOverlapCanonical()
1871 count = 0; in TestOverlapCanonical()
1872 while (NONOVERLAP[count].text != NULL) { in TestOverlapCanonical()
1873 if (!assertCanonicalEqual(NONOVERLAPCANONICAL[count])) { in TestOverlapCanonical()
1874 log_err("Error at non overlap test number %d\n", count); in TestOverlapCanonical()
1876 count ++; in TestOverlapCanonical()
1879 count = 0; in TestOverlapCanonical()
1880 while (count < 1) { in TestOverlapCanonical()
1883 const SearchData *search = &(OVERLAPCANONICAL[count]); in TestOverlapCanonical()
1910 search = &(NONOVERLAPCANONICAL[count]); in TestOverlapCanonical()
1919 log_err("Error at test number %d\n", count); in TestOverlapCanonical()
1922 count ++; in TestOverlapCanonical()
2146 int count = 0; in TestCompositeBoundariesCanonical() local
2153 while (COMPOSITEBOUNDARIESCANONICAL[count].text != NULL) { in TestCompositeBoundariesCanonical()
2154 log_verbose("composite %d\n", count); in TestCompositeBoundariesCanonical()
2155 if (!assertCanonicalEqual(COMPOSITEBOUNDARIESCANONICAL[count])) { in TestCompositeBoundariesCanonical()
2156 log_err("Error at test number %d\n", count); in TestCompositeBoundariesCanonical()
2158 count ++; in TestCompositeBoundariesCanonical()
2199 int count = 0; in TestGetSetOffsetCanonical() local
2201 int32_t matchindex = search.offset[count]; in TestGetSetOffsetCanonical()
2215 uint32_t matchlength = search.size[count]; in TestGetSetOffsetCanonical()
2229 matchindex = search.offset[count + 1] == -1 ? -1 : in TestGetSetOffsetCanonical()
2230 search.offset[count + 2]; in TestGetSetOffsetCanonical()
2231 if (search.offset[count + 1] != -1) { in TestGetSetOffsetCanonical()
2232 usearch_setOffset(strsrch, search.offset[count + 1] + 1, in TestGetSetOffsetCanonical()
2234 if (usearch_getOffset(strsrch) != search.offset[count + 1] + 1) { in TestGetSetOffsetCanonical()
2240 count += 2; in TestGetSetOffsetCanonical()
2263 int count = 0; in TestSupplementaryCanonical() local
2270 while (SUPPLEMENTARYCANONICAL[count].text != NULL) { in TestSupplementaryCanonical()
2271 if (!assertCanonicalEqual(SUPPLEMENTARYCANONICAL[count])) { in TestSupplementaryCanonical()
2272 log_err("Error at test number %d\n", count); in TestSupplementaryCanonical()
2274 count ++; in TestSupplementaryCanonical()
2286 int count = 0; in TestContractionCanonical() local
2310 while (CONTRACTIONCANONICAL[count].text != NULL) { in TestContractionCanonical()
2311 u_unescape(CONTRACTIONCANONICAL[count].text, text, 128); in TestContractionCanonical()
2312 u_unescape(CONTRACTIONCANONICAL[count].pattern, pattern, 128); in TestContractionCanonical()
2316 CONTRACTIONCANONICAL[count])) { in TestContractionCanonical()
2317 log_err("Error at test number %d\n", count); in TestContractionCanonical()
2319 count ++; in TestContractionCanonical()
2421 int count = 0; in TestSearchForNull() local
2488 count += 1; in TestSearchForNull()
2491 if (count != expectedNum) { in TestSearchForNull()
2492 log_err("Expected %d search hits, found %d\n", expectedNum, count); in TestSearchForNull()