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