triostr.c 41 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
/*************************************************************************
 *
 * $Id$
 *
 * Copyright (C) 2001 Bjorn Reese and Daniel Stenberg.
 *
 * Permission to use, copy, modify, and distribute this software for any
 * purpose with or without fee is hereby granted, provided that the above
 * copyright notice and this permission notice appear in all copies.
 *
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
 * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
 * MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND
 * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER.
 *
 ************************************************************************/

/*************************************************************************
 * Include files
 */

#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <math.h>
27
#include "triodef.h"
28 29 30 31 32 33
#include "triostr.h"

/*************************************************************************
 * Definitions
 */

34 35 36 37 38 39 40 41
#if !defined(TRIO_STRING_PUBLIC)
# define TRIO_STRING_PUBLIC TRIO_PUBLIC
#endif
#if !defined(TRIO_STRING_PRIVATE)
# define TRIO_STRING_PRIVATE TRIO_PRIVATE
#endif

#if !defined(NULL)
42 43
# define NULL 0
#endif
44 45 46 47
#if !defined(NIL)
# define NIL ((char)0)
#endif
#if !defined(FALSE)
48 49 50
# define FALSE (1 == 0)
# define TRUE (! FALSE)
#endif
51 52 53
#if !defined(BOOLEAN_T)
# define BOOLEAN_T int
#endif
54 55 56 57 58 59 60 61 62 63 64

#if defined(TRIO_COMPILER_SUPPORTS_C99)
# define USE_STRTOD
# define USE_STRTOF
#elif defined(TRIO_COMPILER_MSVC)
# define USE_STRTOD
#endif

#if defined(TRIO_PLATFORM_UNIX)
# define USE_STRCASECMP
# define USE_STRNCASECMP
65 66 67 68 69
# if defined(TRIO_PLATFORM_SUNOS)
#  define USE_SYS_ERRLIST
# else
#  define USE_STRERROR
# endif
70 71 72 73 74 75 76 77 78
# if defined(TRIO_PLATFORM_QNX)
#  define strcasecmp(x,y) stricmp(x,y)
#  define strncasecmp(x,y,n) strnicmp(x,y,n)
# endif
#elif defined(TRIO_PLATFORM_WIN32)
# define USE_STRCASECMP
# define strcasecmp(x,y) strcmpi(x,y)
#endif

79 80 81 82 83
#if !(defined(TRIO_PLATFORM_SUNOS))
# define USE_TOLOWER
# define USE_TOUPPER
#endif

84 85 86 87 88 89 90 91 92 93 94
/*************************************************************************
 * Structures
 */

struct _trio_string_t
{
  char *content;
  size_t length;
  size_t allocated;
};

95 96 97 98 99 100 101 102
/*************************************************************************
 * Constants
 */

#if !defined(TRIO_MINIMAL)
static TRIO_CONST char rcsid[] = "@(#)$Id$";
#endif

103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119
/*************************************************************************
 * Static String Functions
 */

#if defined(TRIO_DOCUMENTATION)
# include "doc/doc_static.h"
#endif
/** @addtogroup StaticStrings
    @{
*/

/**
   Create new string.

   @param size Size of new string.
   @return Pointer to string, or NULL if allocation failed.
*/
120 121 122 123
TRIO_STRING_PUBLIC char *
trio_create
TRIO_ARGS1((size),
	   size_t size)
124 125 126 127 128 129 130 131 132 133
{
  return (char *)TRIO_MALLOC(size);
}


/**
   Destroy string.

   @param string String to be freed.
*/
134 135 136 137
TRIO_STRING_PUBLIC void
trio_destroy
TRIO_ARGS1((string),
	   char *string)
138 139 140 141 142 143 144 145 146 147 148 149 150 151
{
  if (string)
    {
      TRIO_FREE(string);
    }
}


/**
   Count the number of characters in a string.

   @param string String to measure.
   @return Number of characters in @string.
*/
152 153 154 155
TRIO_STRING_PUBLIC size_t
trio_length
TRIO_ARGS1((string),
	   TRIO_CONST char *string)
156 157 158 159 160
{
  return strlen(string);
}


161
#if !defined(TRIO_MINIMAL)
162 163 164 165 166 167 168 169 170 171 172 173 174
/**
   Append @p source at the end of @p target.
   
   @param target Target string.
   @param source Source string.
   @return Boolean value indicating success or failure.
   
   @pre @p target must point to a memory chunk with sufficient room to
   contain the @p target string and @p source string.
   @pre No boundary checking is performed, so insufficient memory will
   result in a buffer overrun.
   @post @p target will be zero terminated.
*/
175 176 177 178 179
TRIO_STRING_PUBLIC int
trio_append
TRIO_ARGS2((target, source),
	   char *target,
	   TRIO_CONST char *source)
180 181 182 183 184 185
{
  assert(target);
  assert(source);
  
  return (strcat(target, source) != NULL);
}
186
#endif /* !defined(TRIO_MINIMAL) */
187

188
#if !defined(TRIO_MINIMAL)
189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
/**
   Append at most @p max characters from @p source to @p target.
   
   @param target Target string.
   @param max Maximum number of characters to append.
   @param source Source string.
   @return Boolean value indicating success or failure.
   
   @pre @p target must point to a memory chuck with sufficient room to
   contain the @p target string and the @p source string (at most @p max
   characters).
   @pre No boundary checking is performed, so insufficient memory will
   result in a buffer overrun.
   @post @p target will be zero terminated.
*/
204 205 206 207 208 209
TRIO_STRING_PUBLIC int
trio_append_max
TRIO_ARGS3((target, max, source),
	   char *target,
	   size_t max,
	   TRIO_CONST char *source)
210 211 212 213 214 215 216 217 218 219 220 221 222 223
{
  size_t length;
  
  assert(target);
  assert(source);

  length = trio_length(target);
  
  if (max > length)
    {
      strncat(target, source, max - length - 1);
    }
  return TRUE;
}
224
#endif /* !defined(TRIO_MINIMAL) */
225 226


227
#if !defined(TRIO_MINIMAL)
228 229 230 231 232 233 234
/**
   Determine if a string contains a substring.

   @param string String to be searched.
   @param substring String to be found.
   @return Boolean value indicating success or failure.
*/
235 236 237 238 239
TRIO_STRING_PUBLIC int
trio_contains
TRIO_ARGS2((string, substring),
	   TRIO_CONST char *string,
	   TRIO_CONST char *substring)
240 241 242 243 244 245
{
  assert(string);
  assert(substring);
  
  return (0 != strstr(string, substring));
}
246
#endif /* !defined(TRIO_MINIMAL) */
247 248


249
#if !defined(TRIO_MINIMAL)
250 251 252 253 254 255 256 257 258 259 260 261 262
/**
   Copy @p source to @p target.
   
   @param target Target string.
   @param source Source string.
   @return Boolean value indicating success or failure.
   
   @pre @p target must point to a memory chunk with sufficient room to
   contain the @p source string.
   @pre No boundary checking is performed, so insufficient memory will
   result in a buffer overrun.
   @post @p target will be zero terminated.
*/
263 264 265 266 267
TRIO_STRING_PUBLIC int
trio_copy
TRIO_ARGS2((target, source),
	   char *target,
	   TRIO_CONST char *source)
268 269 270
{
  assert(target);
  assert(source);
271
     
272 273 274
  (void)strcpy(target, source);
  return TRUE;
}
275
#endif /* !defined(TRIO_MINIMAL) */
276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291


/**
   Copy at most @p max characters from @p source to @p target.
   
   @param target Target string.
   @param max Maximum number of characters to append.
   @param source Source string.
   @return Boolean value indicating success or failure.
   
   @pre @p target must point to a memory chunk with sufficient room to
   contain the @p source string (at most @p max characters).
   @pre No boundary checking is performed, so insufficient memory will
   result in a buffer overrun.
   @post @p target will be zero terminated.
*/
292 293 294 295 296 297
TRIO_STRING_PUBLIC int
trio_copy_max
TRIO_ARGS3((target, max, source),
	   char *target,
	   size_t max,
	   TRIO_CONST char *source)
298 299 300 301 302 303 304 305 306 307 308
{
  assert(target);
  assert(source);
  assert(max > 0); /* Includes != 0 */

  (void)strncpy(target, source, max - 1);
  target[max - 1] = (char)0;
  return TRUE;
}


309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332
/*
 * TrioDuplicateMax
 */
TRIO_STRING_PRIVATE char *
TrioDuplicateMax
TRIO_ARGS2((source, size),
	   TRIO_CONST char *source,
	   size_t size)
{
  char *target;

  assert(source);

  /* Make room for string plus a terminating zero */
  size++;
  target = trio_create(size);
  if (target)
    {
      trio_copy_max(target, size, source);
    }
  return target;
}


333 334 335 336 337 338 339 340
/**
   Duplicate @p source.
   
   @param source Source string.
   @return A copy of the @p source string.
   
   @post @p target will be zero terminated.
*/
341 342 343 344
TRIO_STRING_PUBLIC char *
trio_duplicate
TRIO_ARGS1((source),
	   TRIO_CONST char *source)
345 346 347 348 349
{
  return TrioDuplicateMax(source, trio_length(source));
}


350
#if !defined(TRIO_MINIMAL)
351 352 353 354 355 356 357 358 359
/**
   Duplicate at most @p max characters of @p source.
   
   @param source Source string.
   @param max Maximum number of characters to duplicate.
   @return A copy of the @p source string.
   
   @post @p target will be zero terminated.
*/
360 361 362 363
TRIO_STRING_PUBLIC char *
trio_duplicate_max TRIO_ARGS2((source, max),
			      TRIO_CONST char *source,
			      size_t max)
364 365 366 367 368 369 370 371 372 373 374 375 376
{
  size_t length;

  assert(source);
  assert(max > 0);

  length = trio_length(source);
  if (length > max)
    {
      length = max;
    }
  return TrioDuplicateMax(source, length);
}
377
#endif /* !defined(TRIO_MINIMAL) */
378 379 380 381 382 383 384 385 386 387 388


/**
   Compare if two strings are equal.
   
   @param first First string.
   @param second Second string.
   @return Boolean indicating whether the two strings are equal or not.
   
   Case-insensitive comparison.
*/
389 390 391 392 393
TRIO_STRING_PUBLIC int
trio_equal
TRIO_ARGS2((first, second),
	   TRIO_CONST char *first,
	   TRIO_CONST char *second)
394 395 396 397 398 399 400 401 402 403 404
{
  assert(first);
  assert(second);

  if ((first != NULL) && (second != NULL))
    {
#if defined(USE_STRCASECMP)
      return (0 == strcasecmp(first, second));
#else
      while ((*first != NIL) && (*second != NIL))
	{
405
	  if (trio_to_upper(*first) != trio_to_upper(*second))
406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427
	    {
	      break;
	    }
	  first++;
	  second++;
	}
      return ((*first == NIL) && (*second == NIL));
#endif
    }
  return FALSE;
}


/**
   Compare if two strings are equal.
   
   @param first First string.
   @param second Second string.
   @return Boolean indicating whether the two strings are equal or not.
   
   Case-sensitive comparison.
*/
428 429 430 431 432
TRIO_STRING_PUBLIC int
trio_equal_case
TRIO_ARGS2((first, second),
	   TRIO_CONST char *first,
	   TRIO_CONST char *second)
433 434 435 436 437 438 439 440 441 442 443 444
{
  assert(first);
  assert(second);

  if ((first != NULL) && (second != NULL))
    {
      return (0 == strcmp(first, second));
    }
  return FALSE;
}


445
#if !defined(TRIO_MINIMAL)
446 447 448 449 450 451 452 453 454 455
/**
   Compare if two strings up until the first @p max characters are equal.
   
   @param first First string.
   @param max Maximum number of characters to compare.
   @param second Second string.
   @return Boolean indicating whether the two strings are equal or not.
   
   Case-sensitive comparison.
*/
456 457 458 459 460 461
TRIO_STRING_PUBLIC int
trio_equal_case_max
TRIO_ARGS3((first, max, second),
	   TRIO_CONST char *first,
	   size_t max,
	   TRIO_CONST char *second)
462 463 464 465 466 467 468 469 470 471
{
  assert(first);
  assert(second);

  if ((first != NULL) && (second != NULL))
    {
      return (0 == strncmp(first, second, max));
    }
  return FALSE;
}
472
#endif /* !defined(TRIO_MINIMAL) */
473 474 475 476 477 478 479 480 481 482 483


/**
   Compare if two strings are equal.
   
   @param first First string.
   @param second Second string.
   @return Boolean indicating whether the two strings are equal or not.

   Collating characters are considered equal.
*/
484 485 486 487 488
TRIO_STRING_PUBLIC int
trio_equal_locale
TRIO_ARGS2((first, second),
	   TRIO_CONST char *first,
	   TRIO_CONST char *second)
489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510
{
  assert(first);
  assert(second);

#if defined(LC_COLLATE)
  return (strcoll(first, second) == 0);
#else
  return trio_equal(first, second);
#endif
}


/**
   Compare if two strings up until the first @p max characters are equal.
   
   @param first First string.
   @param max Maximum number of characters to compare.
   @param second Second string.
   @return Boolean indicating whether the two strings are equal or not.
   
   Case-insensitive comparison.
*/
511 512 513 514 515 516
TRIO_STRING_PUBLIC int
trio_equal_max
TRIO_ARGS3((first, max, second),
	   TRIO_CONST char *first,
	   size_t max,
	   TRIO_CONST char *second)
517 518 519 520 521 522 523 524 525 526 527 528 529
{
  assert(first);
  assert(second);

  if ((first != NULL) && (second != NULL))
    {
#if defined(USE_STRNCASECMP)
      return (0 == strncasecmp(first, second, max));
#else
      /* Not adequately tested yet */
      size_t cnt = 0;
      while ((*first != NIL) && (*second != NIL) && (cnt <= max))
	{
530
	  if (trio_to_upper(*first) != trio_to_upper(*second))
531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550
	    {
	      break;
	    }
	  first++;
	  second++;
	  cnt++;
	}
      return ((cnt == max) || ((*first == NIL) && (*second == NIL)));
#endif
    }
  return FALSE;
}


/**
   Provide a textual description of an error code (errno).

   @param error_number Error number.
   @return Textual description of @p error_number.
*/
551 552 553 554
TRIO_STRING_PUBLIC TRIO_CONST char *
trio_error
TRIO_ARGS1((error_number),
	   int error_number)
555 556
{
#if defined(USE_STRERROR)
557
  
558
  return strerror(error_number);
559 560 561 562 563 564 565 566 567 568

#elif defined(USE_SYS_ERRLIST)

  extern char *sys_errlist[];
  extern int sys_nerr;

  return ((error_number < 0) || (error_number >= sys_nerr))
    ? "unknown"
    : sys_errlist[error_number];
 
569
#else
570
  
571
  return "unknown";
572
  
573 574 575 576
#endif
}


577
#if !defined(TRIO_MINIMAL)
578 579 580 581 582 583 584 585 586 587 588 589
/**
   Format the date/time according to @p format.

   @param target Target string.
   @param max Maximum number of characters to format.
   @param format Formatting string.
   @param datetime Date/time structure.
   @return Number of formatted characters.

   The formatting string accepts the same specifiers as the standard C
   function strftime.
*/
590 591 592 593 594 595 596
TRIO_STRING_PUBLIC size_t
trio_format_date_max
TRIO_ARGS4((target, max, format, datetime),
	   char *target,
	   size_t max,
	   TRIO_CONST char *format,
	   TRIO_CONST struct tm *datetime)
597 598 599 600 601 602 603 604
{
  assert(target);
  assert(format);
  assert(datetime);
  assert(max > 0);
  
  return strftime(target, max, format, datetime);
}
605
#endif /* !defined(TRIO_MINIMAL) */
606 607


608
#if !defined(TRIO_MINIMAL)
609 610 611 612 613 614 615 616 617 618
/**
   Calculate a hash value for a string.

   @param string String to be calculated on.
   @param type Hash function.
   @return Calculated hash value.

   @p type can be one of the following
   @li @c TRIO_HASH_PLAIN Plain hash function.
*/
619 620 621 622 623
TRIO_STRING_PUBLIC unsigned long
trio_hash
TRIO_ARGS2((string, type),
	   TRIO_CONST char *string,
	   int type)
624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644
{
  unsigned long value = 0L;
  char ch;

  assert(string);
  
  switch (type)
    {
    case TRIO_HASH_PLAIN:
      while ( (ch = *string++) != NIL )
	{
	  value *= 31;
	  value += (unsigned long)ch;
	}
      break;
    default:
      assert(FALSE);
      break;
    }
  return value;
}
645
#endif /* !defined(TRIO_MINIMAL) */
646 647


648
#if !defined(TRIO_MINIMAL)
649 650 651 652 653 654 655
/**
   Find first occurrence of a character in a string.

   @param string String to be searched.
   @param character Character to be found.
   @param A pointer to the found character, or NULL if character was not found.
 */
656 657 658 659 660
TRIO_STRING_PUBLIC char *
trio_index
TRIO_ARGS2((string, character),
	   TRIO_CONST char *string,
	   int character)
661 662 663 664 665
{
  assert(string);

  return strchr(string, character);
}
666
#endif /* !defined(TRIO_MINIMAL) */
667 668


669
#if !defined(TRIO_MINIMAL)
670 671 672 673 674 675 676
/**
   Find last occurrence of a character in a string.

   @param string String to be searched.
   @param character Character to be found.
   @param A pointer to the found character, or NULL if character was not found.
 */
677 678 679 680 681
TRIO_STRING_PUBLIC char *
trio_index_last
TRIO_ARGS2((string, character),
	   TRIO_CONST char *string,
	   int character)
682 683 684 685 686
{
  assert(string);

  return strchr(string, character);
}
687
#endif /* !defined(TRIO_MINIMAL) */
688 689


690
#if !defined(TRIO_MINIMAL)
691 692 693 694 695 696
/**
   Convert the alphabetic letters in the string to lower-case.

   @param target String to be converted.
   @return Number of processed characters (converted or not).
*/
697 698 699 700
TRIO_STRING_PUBLIC int
trio_lower
TRIO_ARGS1((target),
	   char *target)
701 702 703
{
  assert(target);

704
  return trio_span_function(target, target, trio_to_lower);
705
}
706
#endif /* !defined(TRIO_MINIMAL) */
707 708


709
#if !defined(TRIO_MINIMAL)
710 711 712 713 714 715 716 717 718 719 720 721 722
/**
   Compare two strings using wildcards.

   @param string String to be searched.
   @param pattern Pattern, including wildcards, to search for.
   @return Boolean value indicating success or failure.

   Case-insensitive comparison.
   
   The following wildcards can be used
   @li @c * Match any number of characters.
   @li @c ? Match a single character.
*/
723 724 725 726 727
TRIO_STRING_PUBLIC int
trio_match
TRIO_ARGS2((string, pattern),
	   TRIO_CONST char *string,
	   TRIO_CONST char *pattern)
728 729 730 731 732 733 734 735 736 737
{
  assert(string);
  assert(pattern);
  
  for (; ('*' != *pattern); ++pattern, ++string)
    {
      if (NIL == *string)
	{
	  return (NIL == *pattern);
	}
738
      if ((trio_to_upper((int)*string) != trio_to_upper((int)*pattern))
739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758
	  && ('?' != *pattern))
	{
	  return FALSE;
	}
    }
  /* two-line patch to prevent *too* much recursiveness: */
  while ('*' == pattern[1])
    pattern++;

  do
    {
      if ( trio_match(string, &pattern[1]) )
	{
	  return TRUE;
	}
    }
  while (*string++);
  
  return FALSE;
}
759
#endif /* !defined(TRIO_MINIMAL) */
760 761


762
#if !defined(TRIO_MINIMAL)
763 764 765 766 767 768 769 770 771 772 773 774 775
/**
   Compare two strings using wildcards.

   @param string String to be searched.
   @param pattern Pattern, including wildcards, to search for.
   @return Boolean value indicating success or failure.

   Case-sensitive comparison.
   
   The following wildcards can be used
   @li @c * Match any number of characters.
   @li @c ? Match a single character.
*/
776 777 778 779 780
TRIO_STRING_PUBLIC int
trio_match_case
TRIO_ARGS2((string, pattern),
	   TRIO_CONST char *string,
	   TRIO_CONST char *pattern)
781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811
{
  assert(string);
  assert(pattern);
  
  for (; ('*' != *pattern); ++pattern, ++string)
    {
      if (NIL == *string)
	{
	  return (NIL == *pattern);
	}
      if ((*string != *pattern)
	  && ('?' != *pattern))
	{
	  return FALSE;
	}
    }
  /* two-line patch to prevent *too* much recursiveness: */
  while ('*' == pattern[1])
    pattern++;

  do
    {
      if ( trio_match_case(string, &pattern[1]) )
	{
	  return TRUE;
	}
    }
  while (*string++);
  
  return FALSE;
}
812
#endif /* !defined(TRIO_MINIMAL) */
813 814


815
#if !defined(TRIO_MINIMAL)
816 817 818 819 820 821 822 823
/**
   Execute a function on each character in string.

   @param target Target string.
   @param source Source string.
   @param Function Function to be executed.
   @return Number of processed characters.
*/
824 825 826 827 828 829
TRIO_STRING_PUBLIC size_t
trio_span_function
TRIO_ARGS3((target, source, Function),
	   char *target,
	   TRIO_CONST char *source,
	   int (*Function) TRIO_PROTO((int)))
830 831 832 833 834 835 836 837 838 839 840 841 842 843
{
  size_t count = 0;

  assert(target);
  assert(source);
  assert(Function);
  
  while (*source != NIL)
    {
      *target++ = Function(*source++);
      count++;
    }
  return count;
}
844
#endif /* !defined(TRIO_MINIMAL) */
845 846


847
#if !defined(TRIO_MINIMAL)
848 849 850 851 852 853 854 855
/**
   Search for a substring in a string.

   @param string String to be searched.
   @param substring String to be found.
   @return Pointer to first occurrence of @p substring in @p string, or NULL
   if no match was found.
*/
856 857 858 859 860
TRIO_STRING_PUBLIC char *
trio_substring
TRIO_ARGS2((string, substring),
	   TRIO_CONST char *string,
	   TRIO_CONST char *substring)
861 862 863 864 865 866
{
  assert(string);
  assert(substring);

  return strstr(string, substring);
}
867
#endif /* !defined(TRIO_MINIMAL) */
868 869


870
#if !defined(TRIO_MINIMAL)
871 872 873 874 875 876 877 878 879
/**
   Search for a substring in the first @p max characters of a string.

   @param string String to be searched.
   @param max Maximum characters to be searched.
   @param substring String to be found.
   @return Pointer to first occurrence of @p substring in @p string, or NULL
   if no match was found.
*/
880 881 882 883 884 885
TRIO_STRING_PUBLIC char *
trio_substring_max
TRIO_ARGS3((string, max, substring),
	   TRIO_CONST char *string,
	   size_t max,
	   TRIO_CONST char *substring)
886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907
{
  size_t count;
  size_t size;
  char *result = NULL;

  assert(string);
  assert(substring);
  
  size = trio_length(substring);
  if (size <= max)
    {
      for (count = 0; count <= max - size; count++)
	{
	  if (trio_equal_max(substring, size, &string[count]))
	    {
	      result = (char *)&string[count];
	      break;
	    }
	}
    }
  return result;
}
908
#endif /* !defined(TRIO_MINIMAL) */
909 910


911
#if !defined(TRIO_MINIMAL)
912 913 914 915 916 917 918 919 920
/**
   Tokenize string.

   @param string String to be tokenized.
   @param tokens String containing list of delimiting characters.
   @return Start of new token.

   @warning @p string will be destroyed.
*/
921 922 923 924 925
TRIO_STRING_PUBLIC char *
trio_tokenize
TRIO_ARGS2((string, delimiters),
	   char *string,
	   TRIO_CONST char *delimiters)
926 927 928 929 930
{
  assert(delimiters);
  
  return strtok(string, delimiters);
}
931
#endif /* !defined(TRIO_MINIMAL) */
932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955


/**
   Convert string to floating-point number.

   @param source String to be converted.
   @param endp Pointer to end of the converted string.
   @return A floating-point number.

   The following Extended Backus-Naur form is used
   @verbatim
   double        ::= [ <sign> ]
                     ( <number> |
                       <number> <decimal_point> <number> |
                       <decimal_point> <number> )
                     [ <exponential> [ <sign> ] <number> ]
   number        ::= 1*( <digit> )
   digit         ::= ( '0' | '1' | '2' | '3' | '4' | '5' | '6' | '7' | '8' | '9' )
   exponential   ::= ( 'e' | 'E' )
   sign          ::= ( '-' | '+' )
   decimal_point ::= '.'
   @endverbatim
*/
/* FIXME: Add EBNF for hex-floats */
956 957 958 959 960 961 962 963
TRIO_STRING_PUBLIC trio_long_double_t
trio_to_long_double
TRIO_ARGS2((source, endp),
	   TRIO_CONST char *source,
	   char **endp)
{
#if defined(USE_STRTOLD)
  return strtold(source, endp);
964 965 966
#else
  int isNegative = FALSE;
  int isExponentNegative = FALSE;
967 968
  trio_long_double_t integer = 0.0;
  trio_long_double_t fraction = 0.0;
969
  unsigned long exponent = 0;
970 971 972
  trio_long_double_t base;
  trio_long_double_t fracdiv = 1.0;
  trio_long_double_t value = 0.0;
973 974 975 976

  /* First try hex-floats */
  if ((source[0] == '0') && ((source[1] == 'x') || (source[1] == 'X')))
    {
977
      base = 16.0;
978 979 980
      source += 2;
      while (isxdigit((int)*source))
	{
981
	  integer *= base;
982 983
	  integer += (isdigit((int)*source)
		      ? (*source - '0')
984
		      : 10 + (trio_to_upper((int)*source) - 'A'));
985 986 987 988 989 990 991
	  source++;
	}
      if (*source == '.')
	{
	  source++;
	  while (isxdigit((int)*source))
	    {
992 993 994
	      fracdiv /= base;
	      fraction += fracdiv * (isdigit((int)*source)
				     ? (*source - '0')
995
				     : 10 + (trio_to_upper((int)*source) - 'A'));
996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007
	      source++;
	    }
	  if ((*source == 'p') || (*source == 'P'))
	    {
	      source++;
	      if ((*source == '+') || (*source == '-'))
		{
		  isExponentNegative = (*source == '-');
		  source++;
		}
	      while (isdigit((int)*source))
		{
1008
		  exponent *= 10;
1009 1010 1011 1012 1013
		  exponent += (*source - '0');
		  source++;
		}
	    }
	}
1014 1015
      /* For later use with exponent */
      base = 2.0;
1016 1017 1018
    }
  else /* Then try normal decimal floats */
    {
1019
      base = 10.0;
1020 1021 1022 1023 1024 1025 1026 1027
      isNegative = (*source == '-');
      /* Skip sign */
      if ((*source == '+') || (*source == '-'))
	source++;

      /* Integer part */
      while (isdigit((int)*source))
	{
1028
	  integer *= base;
1029 1030 1031 1032 1033 1034 1035 1036 1037
	  integer += (*source - '0');
	  source++;
	}

      if (*source == '.')
	{
	  source++; /* skip decimal point */
	  while (isdigit((int)*source))
	    {
1038 1039
	      fracdiv /= base;
	      fraction += (*source - '0') * fracdiv;
1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056
	      source++;
	    }
	}
      if ((*source == 'e')
	  || (*source == 'E')
#if TRIO_MICROSOFT
	  || (*source == 'd')
	  || (*source == 'D')
#endif
	  )
	{
	  source++; /* Skip exponential indicator */
	  isExponentNegative = (*source == '-');
	  if ((*source == '+') || (*source == '-'))
	    source++;
	  while (isdigit((int)*source))
	    {
1057
	      exponent *= (int)base;
1058 1059 1060 1061 1062 1063
	      exponent += (*source - '0');
	      source++;
	    }
	}
    }
  
1064
  value = integer + fraction;
1065 1066 1067
  if (exponent != 0)
    {
      if (isExponentNegative)
1068
	value /= pow(base, (double)exponent);
1069
      else
1070
	value *= pow(base, (double)exponent);
1071 1072 1073 1074 1075
    }
  if (isNegative)
    value = -value;

  if (endp)
1076
    *endp = (char *)source;
1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088
  return value;
#endif
}


/**
   Convert string to floating-point number.

   @param source String to be converted.
   @param endp Pointer to end of the converted string.
   @return A floating-point number.

1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112
   See @ref trio_to_long_double.
*/
TRIO_STRING_PUBLIC double
trio_to_double
TRIO_ARGS2((source, endp),
	   TRIO_CONST char *source,
	   char **endp)
{
#if defined(USE_STRTOD)
  return strtod(source, endp);
#else
  return (double)trio_to_long_double(source, endp);
#endif
}

#if !defined(TRIO_MINIMAL)
/**
   Convert string to floating-point number.

   @param source String to be converted.
   @param endp Pointer to end of the converted string.
   @return A floating-point number.

   See @ref trio_to_long_double.
1113
*/
1114 1115 1116 1117 1118
TRIO_STRING_PUBLIC float
trio_to_float
TRIO_ARGS2((source, endp),
	   TRIO_CONST char *source,
	   char **endp)
1119 1120
{
#if defined(USE_STRTOF)
1121
  return strtof(source, endp);
1122
#else
1123
  return (float)trio_to_long_double(source, endp);
1124 1125
#endif
}
1126
#endif /* !defined(TRIO_MINIMAL) */
1127 1128 1129 1130 1131 1132 1133 1134 1135


/**
   Convert string to signed integer.

   @param string String to be converted.
   @param endp Pointer to end of converted string.
   @param base Radix number of number.
*/
1136 1137 1138 1139 1140 1141
TRIO_STRING_PUBLIC long
trio_to_long
TRIO_ARGS3((string, endp, base),
	   TRIO_CONST char *string,
	   char **endp,
	   int base)
1142 1143 1144 1145 1146 1147 1148 1149
{
  assert(string);
  assert((base >= 2) && (base <= 36));
  
  return strtol(string, endp, base);
}


1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176
#if !defined(TRIO_MINIMAL)
/**
   Convert one alphabetic letter to lower-case.

   @param source The letter to be converted.
   @return The converted letter.
*/
TRIO_STRING_PUBLIC int
trio_to_lower
TRIO_ARGS1((source),
	   int source)
{
#if defined(USE_TOLOWER)
  
  return tolower(source);
  
#else

  /* Does not handle locales or non-contiguous alphabetic characters */
  return ((source >= (int)'A') && (source <= (int)'Z'))
    ? source - 'A' + 'a'
    : source;
  
#endif
}
#endif /* !defined(TRIO_MINIMAL) */

1177
#if !defined(TRIO_MINIMAL)
1178 1179 1180 1181 1182 1183 1184
/**
   Convert string to unsigned integer.

   @param string String to be converted.
   @param endp Pointer to end of converted string.
   @param base Radix number of number.
*/
1185 1186 1187 1188 1189 1190
TRIO_STRING_PUBLIC unsigned long
trio_to_unsigned_long
TRIO_ARGS3((string, endp, base),
	   TRIO_CONST char *string,
	   char **endp,
	   int base)
1191 1192 1193 1194 1195 1196
{
  assert(string);
  assert((base >= 2) && (base <= 36));
  
  return strtoul(string, endp, base);
}
1197
#endif /* !defined(TRIO_MINIMAL) */
1198 1199


1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224
/**
   Convert one alphabetic letter to upper-case.

   @param source The letter to be converted.
   @return The converted letter.
*/
TRIO_STRING_PUBLIC int
trio_to_upper
TRIO_ARGS1((source),
	   int source)
{
#if defined(USE_TOUPPER)
  
  return toupper(source);
  
#else

  /* Does not handle locales or non-contiguous alphabetic characters */
  return ((source >= (int)'a') && (source <= (int)'z'))
    ? source - 'a' + 'A'
    : source;
  
#endif
}

1225
#if !defined(TRIO_MINIMAL)
1226 1227 1228 1229 1230 1231
/**
   Convert the alphabetic letters in the string to upper-case.

   @param target The string to be converted.
   @return The number of processed characters (converted or not).
*/
1232 1233 1234 1235
TRIO_STRING_PUBLIC int
trio_upper
TRIO_ARGS1((target),
	   char *target)
1236 1237 1238
{
  assert(target);

1239
  return trio_span_function(target, target, trio_to_upper);
1240
}
1241
#endif /* !defined(TRIO_MINIMAL) */
1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260


/** @} End of StaticStrings */


/*************************************************************************
 * Dynamic String Functions
 */

#if defined(TRIO_DOCUMENTATION)
# include "doc/doc_dynamic.h"
#endif
/** @addtogroup DynamicStrings
    @{
*/

/*
 * TrioStringAlloc
 */
1261 1262
TRIO_STRING_PRIVATE trio_string_t *
TrioStringAlloc(TRIO_NOARGS)
1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282
{
  trio_string_t *self;
  
  self = (trio_string_t *)TRIO_MALLOC(sizeof(trio_string_t));
  if (self)
    {
      self->content = NULL;
      self->length = 0;
      self->allocated = 0;
    }
  return self;
}


/*
 * TrioStringGrow
 *
 * The size of the string will be increased by 'delta' characters. If
 * 'delta' is zero, the size will be doubled.
 */
1283 1284 1285 1286 1287
TRIO_STRING_PRIVATE BOOLEAN_T
TrioStringGrow
TRIO_ARGS2((self, delta),
	   trio_string_t *self,
	   size_t delta)
1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307
{
  BOOLEAN_T status = FALSE;
  char *new_content;
  size_t new_size;

  new_size = (delta == 0)
    ? ( (self->allocated == 0) ? 1 : self->allocated * 2 )
    : self->allocated + delta;
  
  new_content = (char *)TRIO_REALLOC(self->content, new_size);
  if (new_content)
    {
      self->content = new_content;
      self->allocated = new_size;
      status = TRUE;
    }
  return status;
}


1308
#if !defined(TRIO_MINIMAL)
1309 1310 1311 1312 1313 1314 1315
/*
 * TrioStringGrowTo
 *
 * The size of the string will be increased to 'length' plus one characters.
 * If 'length' is less than the original size, the original size will be
 * used (that is, the size of the string is never decreased).
 */
1316 1317 1318 1319 1320
TRIO_STRING_PRIVATE BOOLEAN_T
TrioStringGrowTo
TRIO_ARGS2((self, length),
	   trio_string_t *self,
	   size_t length)
1321 1322 1323 1324 1325 1326
{
  length++; /* Room for terminating zero */
  return (self->allocated < length)
    ? TrioStringGrow(self, length - self->allocated)
    : TRUE;
}
1327
#endif /* !defined(TRIO_MINIMAL) */
1328 1329


1330
#if !defined(TRIO_MINIMAL)
1331 1332 1333 1334 1335 1336
/**
   Create a new dynamic string.
   
   @param initial_size Initial size of the buffer.
   @return Newly allocated dynamic string, or NULL if memory allocation failed.
*/
1337 1338 1339 1340
TRIO_STRING_PUBLIC trio_string_t *
trio_string_create
TRIO_ARGS1((initial_size),
	   int initial_size)
1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360
{
  trio_string_t *self;

  self = TrioStringAlloc();
  if (self)
    {
      if (TrioStringGrow(self,
			 (size_t)((initial_size > 0) ? initial_size : 1)))
	{
	  self->content[0] = (char)0;
	  self->allocated = initial_size;
	}
      else
	{
	  trio_string_destroy(self);
	  self = NULL;
	}
    }
  return self;
}
1361
#endif /* !defined(TRIO_MINIMAL) */
1362 1363 1364 1365 1366 1367 1368


/**
   Deallocate the dynamic string and its contents.
   
   @param self Dynamic string
*/
1369 1370 1371 1372
TRIO_STRING_PUBLIC void
trio_string_destroy
TRIO_ARGS1((self),
	   trio_string_t *self)
1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383
{
  assert(self);
  
  if (self)
    {
      trio_destroy(self->content);
      TRIO_FREE(self);
    }
}


1384
#if !defined(TRIO_MINIMAL)
1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398
/**
   Get a pointer to the content.
   
   @param self Dynamic string.
   @param offset Offset into content.
   @return Pointer to the content.
   
   @p Offset can be zero, positive, or negative. If @p offset is zero,
   then the start of the content will be returned. If @p offset is positive,
   then a pointer to @p offset number of characters from the beginning of the
   content is returned. If @p offset is negative, then a pointer to @p offset
   number of characters from the ending of the string, starting at the
   terminating zero, is returned.
*/
1399 1400 1401 1402 1403
TRIO_STRING_PUBLIC char *
trio_string_get
TRIO_ARGS2((self, offset),
	   trio_string_t *self,
	   int offset)
1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416
{
  char *result = NULL;
  
  assert(self);

  if (self->content != NULL)
    {
      if (self->length == 0)
	{
	  (void)trio_string_length(self);
	}
      if (offset >= 0)
	{
1417
	  if (offset > (int)self->length)
1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433
	    {
	      offset = self->length;
	    }
	}
      else
	{
	  offset += self->length + 1;
	  if (offset < 0)
	    {
	      offset = 0;
	    }
	}
      result = &(self->content[offset]);
    }
  return result;
}
1434
#endif /* !defined(TRIO_MINIMAL) */
1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445


/**
   Extract the content.
   
   @param self Dynamic String
   @return Content of dynamic string.
   
   The content is removed from the dynamic string. This enables destruction
   of the dynamic string without deallocation of the content.
*/
1446 1447 1448 1449
TRIO_STRING_PUBLIC char *
trio_string_extract
TRIO_ARGS1((self),
	   trio_string_t *self)
1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462
{
  char *result;
  
  assert(self);

  result = self->content;
  /* FIXME: Allocate new empty buffer? */
  self->content = NULL;
  self->length = self->allocated = 0;
  return result;
}


1463
#if !defined(TRIO_MINIMAL)
1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476
/**
   Set the content of the dynamic string.
   
   @param self Dynamic String
   @param buffer The new content.
   
   Sets the content of the dynamic string to a copy @p buffer.
   An existing content will be deallocated first, if necessary.
   
   @remark
   This function will make a copy of @p buffer.
   You are responsible for deallocating @p buffer yourself.
*/
1477 1478 1479 1480 1481
TRIO_STRING_PUBLIC void
trio_xstring_set
TRIO_ARGS2((self, buffer),
	   trio_string_t *self,
	   char *buffer)
1482 1483 1484 1485 1486 1487
{
  assert(self);

  trio_destroy(self->content);
  self->content = trio_duplicate(buffer);
}
1488
#endif /* !defined(TRIO_MINIMAL) */
1489 1490 1491 1492 1493


/*
 * trio_string_size
 */
1494 1495 1496 1497
TRIO_STRING_PUBLIC int
trio_string_size
TRIO_ARGS1((self),
	   trio_string_t *self)
1498 1499 1500 1501 1502 1503 1504 1505 1506 1507
{
  assert(self);

  return self->allocated;
}


/*
 * trio_string_terminate
 */
1508 1509 1510 1511
TRIO_STRING_PUBLIC void
trio_string_terminate
TRIO_ARGS1((self),
	   trio_string_t *self)
1512
{
1513
  trio_xstring_append_char(self, 0);
1514 1515 1516
}


1517
#if !defined(TRIO_MINIMAL)
1518 1519 1520 1521 1522 1523 1524
/**
   Append the second string to the first.
   
   @param self Dynamic string to be modified.
   @param other Dynamic string to copy from.
   @return Boolean value indicating success or failure.
*/
1525 1526 1527 1528 1529
TRIO_STRING_PUBLIC int
trio_string_append
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   trio_string_t *other)
1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545
{
  size_t length;
  
  assert(self);
  assert(other);

  length = self->length + other->length;
  if (!TrioStringGrowTo(self, length))
    goto error;
  trio_copy(&self->content[self->length], other->content);
  self->length = length;
  return TRUE;
  
 error:
  return FALSE;
}
1546
#endif /* !defined(TRIO_MINIMAL) */
1547 1548


1549
#if !defined(TRIO_MINIMAL)
1550 1551 1552
/*
 * trio_xstring_append
 */
1553 1554 1555 1556 1557
TRIO_STRING_PUBLIC int
trio_xstring_append
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   TRIO_CONST char *other)
1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573
{
  size_t length;
  
  assert(self);
  assert(other);

  length = self->length + trio_length(other);
  if (!TrioStringGrowTo(self, length))
    goto error;
  trio_copy(&self->content[self->length], other);
  self->length = length;
  return TRUE;
  
 error:
  return FALSE;
}
1574
#endif /* !defined(TRIO_MINIMAL) */
1575 1576 1577 1578 1579


/*
 * trio_xstring_append_char
 */
1580 1581 1582 1583 1584
TRIO_STRING_PUBLIC int
trio_xstring_append_char
TRIO_ARGS2((self, character),
	   trio_string_t *self,
	   char character)
1585 1586 1587
{
  assert(self);

1588
  if ((int)self->length >= trio_string_size(self))
1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601
    {
      if (!TrioStringGrow(self, 0))
	goto error;
    }
  self->content[self->length] = character;
  self->length++;
  return TRUE;
  
 error:
  return FALSE;
}


1602
#if !defined(TRIO_MINIMAL)
1603 1604 1605 1606 1607 1608 1609
/**
   Search for the first occurrence of second parameter in the first.
   
   @param self Dynamic string to be modified.
   @param other Dynamic string to copy from.
   @return Boolean value indicating success or failure.
*/
1610 1611 1612 1613 1614
TRIO_STRING_PUBLIC int
trio_string_contains
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   trio_string_t *other)
1615 1616 1617 1618 1619 1620
{
  assert(self);
  assert(other);

  return trio_contains(self->content, other->content);
}
1621
#endif /* !defined(TRIO_MINIMAL) */
1622 1623


1624
#if !defined(TRIO_MINIMAL)
1625 1626 1627
/*
 * trio_xstring_contains
 */
1628 1629 1630 1631 1632
TRIO_STRING_PUBLIC int
trio_xstring_contains
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   TRIO_CONST char *other)
1633 1634 1635 1636 1637 1638
{
  assert(self);
  assert(other);

  return trio_contains(self->content, other);
}
1639
#endif /* !defined(TRIO_MINIMAL) */
1640 1641


1642
#if !defined(TRIO_MINIMAL)
1643 1644 1645
/*
 * trio_string_copy
 */
1646 1647 1648 1649 1650
TRIO_STRING_PUBLIC int
trio_string_copy
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   trio_string_t *other)
1651 1652 1653 1654 1655 1656 1657
{
  assert(self);
  assert(other);

  self->length = 0;
  return trio_string_append(self, other);
}
1658
#endif /* !defined(TRIO_MINIMAL) */
1659 1660


1661
#if !defined(TRIO_MINIMAL)
1662 1663 1664
/*
 * trio_xstring_copy
 */
1665 1666 1667 1668 1669
TRIO_STRING_PUBLIC int
trio_xstring_copy
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   TRIO_CONST char *other)
1670 1671 1672 1673 1674 1675 1676
{
  assert(self);
  assert(other);

  self->length = 0;
  return trio_xstring_append(self, other);
}
1677
#endif /* !defined(TRIO_MINIMAL) */
1678 1679


1680
#if !defined(TRIO_MINIMAL)
1681 1682 1683
/*
 * trio_string_duplicate
 */
1684 1685 1686 1687
TRIO_STRING_PUBLIC trio_string_t *
trio_string_duplicate
TRIO_ARGS1((other),
	   trio_string_t *other)
1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708
{
  trio_string_t *self;
  
  assert(other);

  self = TrioStringAlloc();
  if (self)
    {
      self->content = TrioDuplicateMax(other->content, other->length);
      if (self->content)
	{
	  self->length = other->length;
	  self->allocated = self->length + 1;
	}
      else
	{
	  self->length = self->allocated = 0;
	}
    }
  return self;
}
1709
#endif /* !defined(TRIO_MINIMAL) */
1710 1711 1712 1713 1714


/*
 * trio_xstring_duplicate
 */
1715 1716 1717 1718
TRIO_STRING_PUBLIC trio_string_t *
trio_xstring_duplicate
TRIO_ARGS1((other),
	   TRIO_CONST char *other)
1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741
{
  trio_string_t *self;
  
  assert(other);

  self = TrioStringAlloc();
  if (self)
    {
      self->content = TrioDuplicateMax(other, trio_length(other));
      if (self->content)
	{
	  self->length = trio_length(self->content);
	  self->allocated = self->length + 1;
	}
      else
	{
	  self->length = self->allocated = 0;
	}
    }
  return self;
}


1742
#if !defined(TRIO_MINIMAL)
1743 1744 1745
/*
 * trio_string_equal
 */
1746 1747 1748 1749 1750
TRIO_STRING_PUBLIC int
trio_string_equal
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   trio_string_t *other)
1751 1752 1753 1754 1755 1756
{
  assert(self);
  assert(other);

  return trio_equal(self->content, other->content);
}
1757
#endif /* !defined(TRIO_MINIMAL) */
1758 1759


1760
#if !defined(TRIO_MINIMAL)
1761 1762 1763
/*
 * trio_xstring_equal
 */
1764 1765 1766 1767 1768
TRIO_STRING_PUBLIC int
trio_xstring_equal
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   TRIO_CONST char *other)
1769 1770 1771 1772 1773 1774
{
  assert(self);
  assert(other);

  return trio_equal(self->content, other);
}
1775
#endif /* !defined(TRIO_MINIMAL) */
1776 1777


1778
#if !defined(TRIO_MINIMAL)
1779 1780 1781
/*
 * trio_string_equal_max
 */
1782 1783 1784 1785 1786 1787
TRIO_STRING_PUBLIC int
trio_string_equal_max
TRIO_ARGS3((self, max, other),
	   trio_string_t *self,
	   size_t max,
	   trio_string_t *other)
1788 1789 1790 1791 1792 1793
{
  assert(self);
  assert(other);

  return trio_equal_max(self->content, max, other->content);
}
1794
#endif /* !defined(TRIO_MINIMAL) */
1795 1796


1797
#if !defined(TRIO_MINIMAL)
1798 1799 1800
/*
 * trio_xstring_equal_max
 */
1801 1802 1803 1804 1805 1806
TRIO_STRING_PUBLIC int
trio_xstring_equal_max
TRIO_ARGS3((self, max, other),
	   trio_string_t *self,
	   size_t max,
	   TRIO_CONST char *other)
1807 1808 1809 1810 1811 1812
{
  assert(self);
  assert(other);

  return trio_equal_max(self->content, max, other);
}
1813
#endif /* !defined(TRIO_MINIMAL) */
1814 1815


1816
#if !defined(TRIO_MINIMAL)
1817 1818 1819
/*
 * trio_string_equal_case
 */
1820 1821 1822 1823 1824
TRIO_STRING_PUBLIC int
trio_string_equal_case
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   trio_string_t *other)
1825 1826 1827 1828 1829 1830
{
  assert(self);
  assert(other);

  return trio_equal_case(self->content, other->content);
}
1831
#endif /* !defined(TRIO_MINIMAL) */
1832 1833


1834
#if !defined(TRIO_MINIMAL)
1835 1836 1837
/*
 * trio_xstring_equal_case
 */
1838 1839 1840 1841 1842
TRIO_STRING_PUBLIC int
trio_xstring_equal_case
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   TRIO_CONST char *other)
1843 1844 1845 1846 1847 1848
{
  assert(self);
  assert(other);

  return trio_equal_case(self->content, other);
}
1849
#endif /* !defined(TRIO_MINIMAL) */
1850 1851


1852
#if !defined(TRIO_MINIMAL)
1853 1854 1855
/*
 * trio_string_equal_case_max
 */
1856 1857 1858 1859 1860 1861
TRIO_STRING_PUBLIC int
trio_string_equal_case_max
TRIO_ARGS3((self, max, other),
	   trio_string_t *self,
	   size_t max,
	   trio_string_t *other)
1862 1863 1864 1865 1866 1867
{
  assert(self);
  assert(other);

  return trio_equal_case_max(self->content, max, other->content);
}
1868
#endif /* !defined(TRIO_MINIMAL) */
1869 1870


1871
#if !defined(TRIO_MINIMAL)
1872 1873 1874
/*
 * trio_xstring_equal_case_max
 */
1875 1876 1877 1878 1879 1880
TRIO_STRING_PUBLIC int
trio_xstring_equal_case_max
TRIO_ARGS3((self, max, other),
	   trio_string_t *self,
	   size_t max,
	   TRIO_CONST char *other)
1881 1882 1883 1884 1885 1886
{
  assert(self);
  assert(other);

  return trio_equal_case_max(self->content, max, other);
}
1887
#endif /* !defined(TRIO_MINIMAL) */
1888 1889


1890
#if !defined(TRIO_MINIMAL)
1891 1892 1893
/*
 * trio_string_format_data_max
 */
1894 1895 1896 1897 1898 1899 1900
TRIO_STRING_PUBLIC size_t
trio_string_format_date_max
TRIO_ARGS4((self, max, format, datetime),
	   trio_string_t *self,
	   size_t max,
	   TRIO_CONST char *format,
	   TRIO_CONST struct tm *datetime)
1901 1902 1903 1904 1905
{
  assert(self);

  return trio_format_date_max(self->content, max, format, datetime);
}
1906
#endif /* !defined(TRIO_MINIMAL) */
1907 1908


1909
#if !defined(TRIO_MINIMAL)
1910 1911 1912
/*
 * trio_string_index
 */
1913 1914 1915 1916 1917
TRIO_STRING_PUBLIC char *
trio_string_index
TRIO_ARGS2((self, character),
	   trio_string_t *self,
	   int character)
1918 1919 1920 1921 1922
{
  assert(self);

  return trio_index(self->content, character);
}
1923
#endif /* !defined(TRIO_MINIMAL) */
1924 1925


1926
#if !defined(TRIO_MINIMAL)
1927 1928 1929
/*
 * trio_string_index_last
 */
1930 1931 1932 1933 1934
TRIO_STRING_PUBLIC char *
trio_string_index_last
TRIO_ARGS2((self, character),
	   trio_string_t *self,
	   int character)
1935 1936 1937 1938 1939
{
  assert(self);

  return trio_index_last(self->content, character);
}
1940
#endif /* !defined(TRIO_MINIMAL) */
1941 1942


1943
#if !defined(TRIO_MINIMAL)
1944 1945 1946
/*
 * trio_string_length
 */
1947 1948 1949 1950
TRIO_STRING_PUBLIC int
trio_string_length
TRIO_ARGS1((self),
	   trio_string_t *self)
1951 1952 1953 1954 1955 1956 1957 1958 1959
{
  assert(self);

  if (self->length == 0)
    {
      self->length = trio_length(self->content);
    }
  return self->length;
}
1960
#endif /* !defined(TRIO_MINIMAL) */
1961 1962


1963
#if !defined(TRIO_MINIMAL)
1964 1965 1966
/*
 * trio_string_lower
 */
1967 1968 1969 1970
TRIO_STRING_PUBLIC int
trio_string_lower
TRIO_ARGS1((self),
	   trio_string_t *self)
1971 1972 1973 1974 1975
{
  assert(self);

  return trio_lower(self->content);
}
1976
#endif /* !defined(TRIO_MINIMAL) */
1977 1978


1979
#if !defined(TRIO_MINIMAL)
1980 1981 1982
/*
 * trio_string_match
 */
1983 1984 1985 1986 1987
TRIO_STRING_PUBLIC int
trio_string_match
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   trio_string_t *other)
1988 1989 1990 1991 1992 1993
{
  assert(self);
  assert(other);

  return trio_match(self->content, other->content);
}
1994
#endif /* !defined(TRIO_MINIMAL) */
1995 1996


1997
#if !defined(TRIO_MINIMAL)
1998 1999 2000
/*
 * trio_xstring_match
 */
2001 2002 2003 2004 2005
TRIO_STRING_PUBLIC int
trio_xstring_match
TRIO_ARGS2((self, other),
	   trio_string_t *self,
	   TRIO_CONST char *other)
2006 2007 2008 2009 2010 2011
{
  assert(self);
  assert(other);

  return trio_match(self->content, other);