Lines Matching defs:b1
310 /* int bconcat (bstring b0, const_bstring b1)
312 * Concatenate the bstring b1 to the bstring b0.
314 int bconcat (bstring b0, const_bstring b1) {
316 bstring aux = (bstring) b1;
318 if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL) return BSTR_ERR;
321 len = b1->slen;
325 ptrdiff_t pd = b1->data - b0->data;
327 if (NULL == (aux = bstrcpy (b1))) return BSTR_ERR;
330 if (aux != b1) bdestroy (aux);
338 if (aux != b1) bdestroy (aux);
587 /* int bstricmp (const_bstring b0, const_bstring b1)
596 int bstricmp (const_bstring b0, const_bstring b1) {
600 bdata (b1) == NULL || b1->slen < 0) return SHRT_MIN;
601 if ((n = b0->slen) > b1->slen) n = b1->slen;
602 else if (b0->slen == b1->slen && b0->data == b1->data) return BSTR_OK;
606 - (char) downcase (b1->data[i]);
615 if (b1->slen > n) {
616 v = - (char) downcase (b1->data[n]);
623 /* int bstrnicmp (const_bstring b0, const_bstring b1, int n)
633 int bstrnicmp (const_bstring b0, const_bstring b1, int n) {
637 bdata (b1) == NULL || b1->slen < 0 || n < 0) return SHRT_MIN;
640 if (m > b1->slen) m = b1->slen;
642 if (b0->data != b1->data) {
645 v -= (char) downcase (b1->data[i]);
646 if (v != 0) return b0->data[i] - b1->data[i];
650 if (n == m || b0->slen == b1->slen) return BSTR_OK;
658 v = - (char) downcase (b1->data[m]);
663 /* int biseqcaseless (const_bstring b0, const_bstring b1)
671 int biseqcaseless (const_bstring b0, const_bstring b1) {
675 bdata (b1) == NULL || b1->slen < 0) return BSTR_ERR;
676 if (b0->slen != b1->slen) return BSTR_OK;
677 if (b0->data == b1->data || b0->slen == 0) return 1;
679 if (b0->data[i] != b1->data[i]) {
681 if (c != (unsigned char) downcase (b1->data[i])) return 0;
784 /* int biseq (const_bstring b0, const_bstring b1)
786 * Compare the string b0 and b1. If the strings differ, 0 is returned, if
791 int biseq (const_bstring b0, const_bstring b1) {
792 if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL ||
793 b0->slen < 0 || b1->slen < 0) return BSTR_ERR;
794 if (b0->slen != b1->slen) return BSTR_OK;
795 if (b0->data == b1->data || b0->slen == 0) return 1;
796 return !bstr__memcmp (b0->data, b1->data, b0->slen);
865 /* int bstrcmp (const_bstring b0, const_bstring b1)
867 * Compare the string b0 and b1. If there is an error, SHRT_MIN is returned,
870 * the string pointed to by b1 is returned. If the the string lengths are
873 * pointed to by b0 is shorter or longer than the string pointed to by b1 is
879 int bstrcmp (const_bstring b0, const_bstring b1) {
882 if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL ||
883 b0->slen < 0 || b1->slen < 0) return SHRT_MIN;
884 n = b0->slen; if (n > b1->slen) n = b1->slen;
885 if (b0->slen == b1->slen && (b0->data == b1->data || b0->slen == 0))
889 v = ((char) b0->data[i]) - ((char) b1->data[i]);
895 if (b1->slen > n) return -1;
899 /* int bstrncmp (const_bstring b0, const_bstring b1, int n)
901 * Compare the string b0 and b1 for at most n characters. If there is an
903 * b1 were first truncated to at most n characters then bstrcmp was called
909 int bstrncmp (const_bstring b0, const_bstring b1, int n) {
912 if (b0 == NULL || b1 == NULL || b0->data == NULL || b1->data == NULL ||
913 b0->slen < 0 || b1->slen < 0) return SHRT_MIN;
916 if (m > b1->slen) m = b1->slen;
918 if (b0->data != b1->data) {
920 v = ((char) b0->data[i]) - ((char) b1->data[i]);
926 if (n == m || b0->slen == b1->slen) return BSTR_OK;
1010 /* int binstr (const_bstring b1, int pos, const_bstring b2)
1012 * Search for the bstring b2 in b1 starting from position pos, and searching
1019 int binstr (const_bstring b1, int pos, const_bstring b2) {
1027 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1029 if (b1->slen == pos) return (b2->slen == 0)?pos:BSTR_ERR;
1030 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1034 if ((lf = b1->slen - b2->slen + 1) <= pos) return BSTR_ERR;
1037 if (b1->data == b2->data && pos == 0) return 0;
1042 d1 = b1->data;
1054 lf = b1->slen - 1;
1097 /* int binstrr (const_bstring b1, int pos, const_bstring b2)
1099 * Search for the bstring b2 in b1 starting from position pos, and searching
1106 int binstrr (const_bstring b1, int pos, const_bstring b2) {
1110 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1112 if (b1->slen == pos && b2->slen == 0) return pos;
1113 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1117 if (b1->data == b2->data && pos == 0 && b2->slen <= b1->slen) return 0;
1120 if ((l = b1->slen - b2->slen) < 0) return BSTR_ERR;
1127 d1 = b1->data;
1144 /* int binstrcaseless (const_bstring b1, int pos, const_bstring b2)
1146 * Search for the bstring b2 in b1 starting from position pos, and searching
1153 int binstrcaseless (const_bstring b1, int pos, const_bstring b2) {
1157 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1159 if (b1->slen == pos) return (b2->slen == 0)?pos:BSTR_ERR;
1160 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1163 l = b1->slen - b2->slen + 1;
1169 if (b1->data == b2->data && pos == 0) return BSTR_OK;
1175 d1 = b1->data;
1192 /* int binstrrcaseless (const_bstring b1, int pos, const_bstring b2)
1194 * Search for the bstring b2 in b1 starting from position pos, and searching
1201 int binstrrcaseless (const_bstring b1, int pos, const_bstring b2) {
1205 if (b1 == NULL || b1->data == NULL || b1->slen < 0 ||
1207 if (b1->slen == pos && b2->slen == 0) return pos;
1208 if (b1->slen < pos || pos < 0) return BSTR_ERR;
1212 if (b1->data == b2->data && pos == 0 && b2->slen <= b1->slen) return BSTR_OK;
1215 if ((l = b1->slen - b2->slen) < 0) return BSTR_ERR;
1222 d1 = b1->data;
1317 /* int binchr (const_bstring b0, int pos, const_bstring b1);
1320 * one of the characters in b1 is found and return it. If such a position
1323 int binchr (const_bstring b0, int pos, const_bstring b1) {
1327 if (1 == b1->slen) return bstrchrp (b0, b1->data[0], pos);
1328 if (0 > buildCharField (&chrs, b1)) return BSTR_ERR;
1342 /* int binchrr (const_bstring b0, int pos, const_bstring b1);
1345 * the characters in b1 is found and return it. If such a position does not
1348 int binchrr (const_bstring b0, int pos, const_bstring b1) {
1350 if (pos < 0 || b0 == NULL || b0->data == NULL || b1 == NULL ||
1353 if (1 == b1->slen) return bstrrchrp (b0, b1->data[0], pos);
1354 if (0 > buildCharField (&chrs, b1)) return BSTR_ERR;
1358 /* int bninchr (const_bstring b0, int pos, const_bstring b1);
1361 * none of the characters in b1 is found and return it. If such a position
1364 int bninchr (const_bstring b0, int pos, const_bstring b1) {
1368 if (buildCharField (&chrs, b1) < 0) return BSTR_ERR;
1373 /* int bninchrr (const_bstring b0, int pos, const_bstring b1);
1376 * the characters in b1 is found and return it. If such a position does not
1379 int bninchrr (const_bstring b0, int pos, const_bstring b1) {
1384 if (buildCharField (&chrs, b1) < 0) return BSTR_ERR;
1389 /* int bsetstr (bstring b0, int pos, bstring b1, unsigned char fill)
1391 * Overwrite the string b0 starting at position pos with the string b1. If
1394 * If b1 is NULL, it behaves as if it were a 0-length string.
1396 int bsetstr (bstring b0, int pos, const_bstring b1, unsigned char fill) {
1399 bstring aux = (bstring) b1;
1403 if (b1 != NULL && (b1->slen < 0 || b1->data == NULL)) return BSTR_ERR;
1409 if ((pd = (ptrdiff_t) (b1->data - b0->data)) >= 0 && pd < (ptrdiff_t) b0->mlen) {
1410 if (NULL == (aux = bstrcpy (b1))) return BSTR_ERR;
1417 if (aux != b1) bdestroy (aux);
1429 /* Copy b1 to position pos in b0. */
1432 if (aux != b1) bdestroy (aux);
1444 /* int binsert (bstring b1, int pos, bstring b2, unsigned char fill)
1446 * Inserts the string b2 into b1 at position pos. If the position pos is
1447 * past the end of b1, then the character "fill" is appended as necessary to
1448 * make up the gap between the end of b1 and pos. Unlike bsetstr, binsert
1451 int binsert (bstring b1, int pos, const_bstring b2, unsigned char fill) {
1456 if (pos < 0 || b1 == NULL || b2 == NULL || b1->slen < 0 ||
1457 b2->slen < 0 || b1->mlen < b1->slen || b1->mlen <= 0) return BSTR_ERR;
1460 if ((pd = (ptrdiff_t) (b2->data - b1->data)) >= 0 && pd < (ptrdiff_t) b1->mlen) {
1465 d = b1->slen + aux->slen;
1471 if (balloc (b1, l + 1) != BSTR_OK) {
1475 bstr__memset (b1->data + b1->slen, (int) fill, (size_t) (pos - b1->slen));
1476 b1->slen = l;
1479 if (balloc (b1, d + 1) != BSTR_OK) {
1483 bBlockCopy (b1->data + l, b1->data + pos, d - l);
1484 b1->slen = d;
1486 bBlockCopy (b1->data + pos, aux->data, aux->slen);
1487 b1->data[b1->slen] = (unsigned char) '\0';
1492 /* int breplace (bstring b1, int pos, int len, bstring b2,
1496 * fill is used is pos > b1->slen.
1498 int breplace (bstring b1, int pos, int len, const_bstring b2,
1504 if (pos < 0 || len < 0 || (pl = pos + len) < 0 || b1 == NULL ||
1505 b2 == NULL || b1->data == NULL || b2->data == NULL ||
1506 b1->slen < 0 || b2->slen < 0 || b1->mlen < b1->slen ||
1507 b1->mlen <= 0) return BSTR_ERR;
1510 if (pl >= b1->slen) {
1511 if ((ret = bsetstr (b1, pos, b2, fill)) < 0) return ret;
1512 if (pos + b2->slen < b1->slen) {
1513 b1->slen = pos + b2->slen;
1514 b1->data[b1->slen] = (unsigned char) '\0';
1520 if ((pd = (ptrdiff_t) (b2->data - b1->data)) >= 0 && pd < (ptrdiff_t) b1->slen) {
1525 if (balloc (b1, b1->slen + aux->slen - len) != BSTR_OK) {
1531 if (aux->slen != len) bstr__memmove (b1->data + pos + aux->slen, b1->data + pos + len, b1->slen - (pos + len));
1532 bstr__memcpy (b1->data + pos, aux->data, aux->slen);
1533 b1->slen += aux->slen - len;
1534 b1->data[b1->slen] = (unsigned char) '\0';