src/ucx/string.h

Tue, 17 Oct 2017 16:15:41 +0200

author
Mike Becker <universe@uap-core.de>
date
Tue, 17 Oct 2017 16:15:41 +0200
changeset 251
fae240d633fc
parent 250
ucx/string.h@b7d1317b138e
child 259
2f5dea574a75
permissions
-rw-r--r--

changes source directory structure in preperation for autotools rollout

olaf@20 1 /*
universe@103 2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
olaf@20 3 *
universe@250 4 * Copyright 2017 Olaf Wintermann. All rights reserved.
universe@103 5 *
universe@103 6 * Redistribution and use in source and binary forms, with or without
universe@103 7 * modification, are permitted provided that the following conditions are met:
universe@103 8 *
universe@103 9 * 1. Redistributions of source code must retain the above copyright
universe@103 10 * notice, this list of conditions and the following disclaimer.
universe@103 11 *
universe@103 12 * 2. Redistributions in binary form must reproduce the above copyright
universe@103 13 * notice, this list of conditions and the following disclaimer in the
universe@103 14 * documentation and/or other materials provided with the distribution.
universe@103 15 *
universe@103 16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
universe@103 17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
universe@103 18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
universe@103 19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
universe@103 20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
universe@103 21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
universe@103 22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
universe@103 23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
universe@103 24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
universe@103 25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
universe@103 26 * POSSIBILITY OF SUCH DAMAGE.
olaf@20 27 */
universe@116 28 /**
universe@116 29 * Bounded string implementation.
universe@116 30 *
universe@116 31 * The UCX strings (<code>sstr_t</code>) provide an alternative to C strings.
universe@116 32 * The main difference to C strings is, that <code>sstr_t</code> does <b>not
universe@116 33 * need to be <code>NULL</code>-terminated</b>. Instead the length is stored
universe@116 34 * within the structure.
universe@116 35 *
universe@116 36 * When using <code>sstr_t</code>, developers must be full aware of what type
universe@116 37 * of string (<code>NULL</code>-terminated) or not) they are using, when
universe@116 38 * accessing the <code>char* ptr</code> directly.
universe@116 39 *
universe@116 40 * The UCX string module provides some common string functions, known from
universe@116 41 * standard libc, working with <code>sstr_t</code>.
universe@116 42 *
universe@116 43 * @file string.h
universe@116 44 * @author Mike Becker
universe@116 45 * @author Olaf Wintermann
universe@116 46 */
olaf@20 47
universe@116 48 #ifndef UCX_STRING_H
universe@116 49 #define UCX_STRING_H
olaf@20 50
universe@251 51 #include <ucx/ucx.h>
universe@251 52 #include <ucx/allocator.h>
universe@38 53 #include <stddef.h>
universe@38 54
universe@116 55 /** Shortcut for a <code>sstr_t struct</code> literal. */
universe@116 56 #define ST(s) { (char*)s, sizeof(s)-1 }
universe@146 57
universe@116 58 /** Shortcut for the conversion of a C string to a <code>sstr_t</code>. */
universe@116 59 #define S(s) sstrn((char*)s, sizeof(s)-1)
olaf@20 60
olaf@20 61 #ifdef __cplusplus
olaf@20 62 extern "C" {
olaf@20 63 #endif
olaf@20 64
universe@116 65 /**
universe@116 66 * The UCX string structure.
universe@116 67 */
universe@116 68 typedef struct {
universe@116 69 /** A reference to the string (<b>not necessarily <code>NULL</code>
universe@116 70 * -terminated</b>) */
olaf@20 71 char *ptr;
universe@116 72 /** The length of the string */
olaf@20 73 size_t length;
olaf@20 74 } sstr_t;
olaf@20 75
universe@116 76 /**
universe@116 77 * Creates a new sstr_t based on a C string.
universe@116 78 *
universe@116 79 * The length is implicitly inferred by using a call to <code>strlen()</code>.
olaf@20 80 *
universe@116 81 * <b>Note:</b> the sstr_t will hold a <i>reference</i> to the C string. If you
universe@116 82 * do want a copy, use sstrdup() on the return value of this function.
universe@116 83 *
universe@116 84 * @param cstring the C string to wrap
universe@116 85 * @return a new sstr_t containing the C string
universe@116 86 *
universe@116 87 * @see sstrn()
olaf@20 88 */
universe@116 89 sstr_t sstr(char *cstring);
olaf@20 90
universe@116 91 /**
universe@116 92 * Creates a new sstr_t of the specified length based on a C string.
olaf@20 93 *
universe@116 94 * <b>Note:</b> the sstr_t will hold a <i>reference</i> to the C string. If you
universe@116 95 * do want a copy, use sstrdup() on the return value of this function.
universe@116 96 *
universe@116 97 * @param cstring the C string to wrap
universe@116 98 * @param length the length of the string
universe@116 99 * @return a new sstr_t containing the C string
universe@116 100 *
universe@116 101 * @see sstr()
universe@116 102 * @see S()
olaf@20 103 */
universe@116 104 sstr_t sstrn(char *cstring, size_t length);
olaf@20 105
olaf@20 106
universe@116 107 /**
universe@116 108 * Returns the cumulated length of all specified strings.
olaf@20 109 *
universe@116 110 * At least one string must be specified.
universe@116 111 *
universe@116 112 * <b>Attention:</b> if the count argument does not match the count of the
universe@116 113 * specified strings, the behavior is undefined.
universe@116 114 *
universe@116 115 * @param count the total number of specified strings (so at least 1)
universe@116 116 * @param string the first string
universe@116 117 * @param ... all other strings
universe@116 118 * @return the cumulated length of all strings
olaf@20 119 */
universe@116 120 size_t sstrnlen(size_t count, sstr_t string, ...);
olaf@20 121
universe@119 122 /**
olaf@183 123 * Concatenates two or more strings.
olaf@183 124 *
olaf@183 125 * The resulting string will be allocated by standard <code>malloc()</code>.
olaf@183 126 * So developers <b>MUST</b> pass the sstr_t.ptr to <code>free()</code>.
olaf@183 127 *
olaf@183 128 * The sstr_t.ptr of the return value will <i>always</i> be <code>NULL</code>-
olaf@183 129 * terminated.
olaf@180 130 *
olaf@180 131 * @param count the total number of strings to concatenate
olaf@183 132 * @param s1 first string
olaf@183 133 * @param s2 second string
olaf@183 134 * @param ... all remaining strings
olaf@180 135 * @return the concatenated string
olaf@180 136 */
olaf@180 137 sstr_t sstrcat(size_t count, sstr_t s1, sstr_t s2, ...);
olaf@183 138
olaf@183 139 /**
universe@225 140 * Concatenates two or more strings using a UcxAllocator.
olaf@183 141 *
olaf@183 142 * See sstrcat() for details.
olaf@183 143 *
olaf@183 144 * @param a the allocator to use
olaf@183 145 * @param count the total number of strings to concatenate
olaf@183 146 * @param s1 first string
olaf@183 147 * @param s2 second string
olaf@183 148 * @param ... all remaining strings
olaf@183 149 * @return the concatenated string
olaf@183 150 */
olaf@180 151 sstr_t sstrcat_a(UcxAllocator *a, size_t count, sstr_t s1, sstr_t s2, ...);
olaf@180 152
olaf@180 153
olaf@180 154 /**
universe@119 155 * Returns a substring starting at the specified location.
universe@119 156 *
universe@119 157 * <b>Attention:</b> the new string references the same memory area as the
universe@119 158 * input string and will <b>NOT</b> be <code>NULL</code>-terminated.
universe@119 159 * Use sstrdup() to get a copy.
universe@119 160 *
universe@119 161 * @param string input string
universe@119 162 * @param start start location of the substring
universe@119 163 * @return a substring of <code>string</code> starting at <code>start</code>
universe@119 164 *
universe@119 165 * @see sstrsubsl()
universe@119 166 * @see sstrchr()
universe@119 167 */
universe@119 168 sstr_t sstrsubs(sstr_t string, size_t start);
universe@119 169
universe@119 170 /**
universe@119 171 * Returns a substring with a maximum length starting at the specified location.
universe@119 172 *
universe@119 173 * <b>Attention:</b> the new string references the same memory area as the
universe@119 174 * input string and will <b>NOT</b> be <code>NULL</code>-terminated.
universe@119 175 * Use sstrdup() to get a copy.
universe@119 176 *
universe@119 177 * @param string input string
universe@119 178 * @param start start location of the substring
universe@119 179 * @param length the maximum length of the substring
universe@119 180 * @return a substring of <code>string</code> starting at <code>start</code>
universe@119 181 * with a maximum length of <code>length</code>
universe@119 182 *
universe@119 183 * @see sstrsubs()
universe@119 184 * @see sstrchr()
universe@119 185 */
universe@119 186 sstr_t sstrsubsl(sstr_t string, size_t start, size_t length);
universe@119 187
universe@119 188 /**
universe@119 189 * Returns a substring starting at the location of the first occurrence of the
universe@119 190 * specified character.
universe@119 191 *
universe@119 192 * If the string does not contain the character, an empty string is returned.
universe@119 193 *
universe@119 194 * @param string the string where to locate the character
universe@119 195 * @param chr the character to locate
universe@148 196 * @return a substring starting at the first location of <code>chr</code>
universe@119 197 *
universe@119 198 * @see sstrsubs()
universe@119 199 */
universe@119 200 sstr_t sstrchr(sstr_t string, int chr);
universe@119 201
universe@119 202 /**
universe@148 203 * Returns a substring starting at the location of the last occurrence of the
universe@148 204 * specified character.
universe@148 205 *
universe@148 206 * If the string does not contain the character, an empty string is returned.
universe@148 207 *
universe@148 208 * @param string the string where to locate the character
universe@148 209 * @param chr the character to locate
universe@148 210 * @return a substring starting at the last location of <code>chr</code>
universe@148 211 *
universe@148 212 * @see sstrsubs()
universe@148 213 */
universe@148 214 sstr_t sstrrchr(sstr_t string, int chr);
universe@148 215
universe@148 216 /**
universe@214 217 * Returns a substring starting at the location of the first occurrence of the
universe@214 218 * specified string.
universe@214 219 *
universe@214 220 * If the string does not contain the other string, an empty string is returned.
universe@214 221 *
universe@214 222 * If <code>match</code> is an empty string, the complete <code>string</code> is
universe@214 223 * returned.
universe@214 224 *
universe@214 225 * @param string the string to be scanned
universe@214 226 * @param match string containing the sequence of characters to match
universe@214 227 * @return a substring starting at the first occurrence of
universe@214 228 * <code>match</code>, or an empty string, if the sequence is not
universe@214 229 * present in <code>string</code>
universe@214 230 */
universe@214 231 sstr_t sstrstr(sstr_t string, sstr_t match);
universe@214 232
universe@214 233 /**
universe@119 234 * Splits a string into parts by using a delimiter string.
universe@119 235 *
universe@119 236 * This function will return <code>NULL</code>, if one of the following happens:
universe@119 237 * <ul>
universe@119 238 * <li>the string length is zero</li>
universe@119 239 * <li>the delimeter length is zero</li>
universe@119 240 * <li>the string equals the delimeter</li>
universe@119 241 * <li>memory allocation fails</li>
universe@119 242 * </ul>
universe@119 243 *
universe@119 244 * The integer referenced by <code>count</code> is used as input and determines
universe@160 245 * the maximum size of the resulting array, i.e. the maximum count of splits to
universe@119 246 * perform + 1.
universe@119 247 *
universe@119 248 * The integer referenced by <code>count</code> is also used as output and is
universe@119 249 * set to
universe@119 250 * <ul>
universe@119 251 * <li>-2, on memory allocation errors</li>
universe@119 252 * <li>-1, if either the string or the delimiter is an empty string</li>
universe@119 253 * <li>0, if the string equals the delimiter</li>
universe@119 254 * <li>1, if the string does not contain the delimiter</li>
universe@160 255 * <li>the count of array items, otherwise</li>
universe@119 256 * </ul>
universe@119 257 *
universe@119 258 * If the string starts with the delimiter, the first item of the resulting
universe@160 259 * array will be an empty string.
universe@119 260 *
universe@119 261 * If the string ends with the delimiter and the maximum list size is not
universe@160 262 * exceeded, the last array item will be an empty string.
universe@233 263 * In case the list size would be exceeded, the last array item will be the
universe@233 264 * remaining string after the last split, <i>including</i> the terminating
universe@233 265 * delimiter.
universe@119 266 *
universe@160 267 * <b>Attention:</b> The array pointer <b>AND</b> all sstr_t.ptr of the array
universe@125 268 * items must be manually passed to <code>free()</code>. Use sstrsplit_a() with
universe@119 269 * an allocator to managed memory, to avoid this.
olaf@20 270 *
universe@119 271 * @param string the string to split
universe@119 272 * @param delim the delimiter string
universe@160 273 * @param count IN: the maximum size of the resulting array (0 = no limit),
universe@160 274 * OUT: the actual size of the array
universe@160 275 * @return a sstr_t array containing the split strings or
universe@119 276 * <code>NULL</code> on error
universe@119 277 *
universe@125 278 * @see sstrsplit_a()
olaf@20 279 */
universe@173 280 sstr_t* sstrsplit(sstr_t string, sstr_t delim, ssize_t *count);
olaf@20 281
universe@119 282 /**
universe@225 283 * Performing sstrsplit() using a UcxAllocator.
universe@119 284 *
universe@119 285 * <i>Read the description of sstrsplit() for details.</i>
universe@119 286 *
universe@160 287 * The memory for the sstr_t.ptr pointers of the array items and the memory for
universe@119 288 * the sstr_t array itself are allocated by using the UcxAllocator.malloc()
universe@119 289 * function.
universe@119 290 *
universe@119 291 * <b>Note:</b> the allocator is not used for memory that is freed within the
universe@119 292 * same call of this function (locally scoped variables).
universe@119 293 *
universe@125 294 * @param allocator the UcxAllocator used for allocating memory
universe@119 295 * @param string the string to split
universe@119 296 * @param delim the delimiter string
universe@160 297 * @param count IN: the maximum size of the resulting array (0 = no limit),
universe@160 298 * OUT: the actual size of the array
universe@160 299 * @return a sstr_t array containing the split strings or
universe@119 300 * <code>NULL</code> on error
universe@119 301 *
universe@119 302 * @see sstrsplit()
olaf@20 303 */
universe@125 304 sstr_t* sstrsplit_a(UcxAllocator *allocator, sstr_t string, sstr_t delim,
universe@173 305 ssize_t *count);
olaf@20 306
universe@116 307 /**
universe@116 308 * Compares two UCX strings with standard <code>memcmp()</code>.
universe@116 309 *
universe@116 310 * At first it compares the sstr_t.length attribute of the two strings. The
universe@116 311 * <code>memcmp()</code> function is called, if and only if the lengths match.
universe@116 312 *
universe@116 313 * @param s1 the first string
universe@116 314 * @param s2 the second string
universe@116 315 * @return -1, if the length of s1 is less than the length of s2 or 1, if the
universe@116 316 * length of s1 is greater than the length of s2 or the result of
universe@116 317 * <code>memcmp()</code> otherwise (i.e. 0 if the strings match)
universe@116 318 */
olaf@68 319 int sstrcmp(sstr_t s1, sstr_t s2);
olaf@20 320
universe@116 321 /**
universe@149 322 * Compares two UCX strings ignoring the case.
universe@149 323 *
universe@149 324 * At first it compares the sstr_t.length attribute of the two strings. If and
universe@149 325 * only if the lengths match, both strings are compared char by char ignoring
universe@149 326 * the case.
universe@149 327 *
universe@149 328 * @param s1 the first string
universe@149 329 * @param s2 the second string
universe@149 330 * @return -1, if the length of s1 is less than the length of s2 or 1, if the
universe@149 331 * length of s1 is greater than the length of s2 or the difference between the
universe@149 332 * first two differing characters otherwise (i.e. 0 if the strings match and
universe@149 333 * no characters differ)
universe@149 334 */
universe@149 335 int sstrcasecmp(sstr_t s1, sstr_t s2);
universe@149 336
universe@149 337 /**
universe@116 338 * Creates a duplicate of the specified string.
universe@116 339 *
universe@116 340 * The new sstr_t will contain a copy allocated by standard
universe@116 341 * <code>malloc()</code>. So developers <b>MUST</b> pass the sstr_t.ptr to
universe@116 342 * <code>free()</code>.
universe@116 343 *
universe@118 344 * The sstr_t.ptr of the return value will <i>always</i> be <code>NULL</code>-
universe@118 345 * terminated.
universe@118 346 *
universe@116 347 * @param string the string to duplicate
universe@118 348 * @return a duplicate of the string
universe@125 349 * @see sstrdup_a()
universe@116 350 */
universe@116 351 sstr_t sstrdup(sstr_t string);
olaf@20 352
universe@118 353 /**
universe@225 354 * Creates a duplicate of the specified string using a UcxAllocator.
universe@118 355 *
universe@118 356 * The new sstr_t will contain a copy allocated by the allocators
universe@118 357 * ucx_allocator_malloc function. So it is implementation depended, whether the
universe@118 358 * returned sstr_t.ptr pointer must be passed to the allocators
universe@118 359 * ucx_allocator_free function manually.
universe@118 360 *
universe@118 361 * The sstr_t.ptr of the return value will <i>always</i> be <code>NULL</code>-
universe@118 362 * terminated.
universe@118 363 *
universe@225 364 * @param allocator a valid instance of a UcxAllocator
universe@118 365 * @param string the string to duplicate
universe@118 366 * @return a duplicate of the string
universe@119 367 * @see sstrdup()
universe@118 368 */
universe@125 369 sstr_t sstrdup_a(UcxAllocator *allocator, sstr_t string);
universe@118 370
universe@118 371 /**
universe@118 372 * Omits leading and trailing spaces.
universe@118 373 *
universe@118 374 * This function returns a new sstr_t containing a trimmed version of the
universe@118 375 * specified string.
universe@118 376 *
universe@118 377 * <b>Note:</b> the new sstr_t references the same memory, thus you
universe@118 378 * <b>MUST NOT</b> pass the sstr_t.ptr of the return value to
universe@118 379 * <code>free()</code>. It is also highly recommended to avoid assignments like
universe@118 380 * <code>mystr = sstrtrim(mystr);</code> as you lose the reference to the
universe@118 381 * source string. Assignments of this type are only permitted, if the
universe@118 382 * sstr_t.ptr of the source string does not need to be freed or if another
universe@118 383 * reference to the source string exists.
universe@118 384 *
universe@118 385 * @param string the string that shall be trimmed
universe@118 386 * @return a new sstr_t containing the trimmed string
universe@118 387 */
olaf@96 388 sstr_t sstrtrim(sstr_t string);
olaf@96 389
universe@146 390 /**
universe@146 391 * Checks, if a string has a specific prefix.
universe@146 392 * @param string the string to check
universe@146 393 * @param prefix the prefix the string should have
universe@146 394 * @return 1, if and only if the string has the specified prefix, 0 otherwise
universe@146 395 */
universe@146 396 int sstrprefix(sstr_t string, sstr_t prefix);
universe@146 397
universe@146 398 /**
universe@146 399 * Checks, if a string has a specific suffix.
universe@146 400 * @param string the string to check
universe@146 401 * @param suffix the suffix the string should have
universe@146 402 * @return 1, if and only if the string has the specified suffix, 0 otherwise
universe@146 403 */
universe@146 404 int sstrsuffix(sstr_t string, sstr_t suffix);
universe@146 405
universe@210 406 /**
universe@210 407 * Returns a lower case version of a string.
universe@210 408 *
universe@210 409 * This function creates a duplicate of the input string, first. See the
universe@210 410 * documentation of sstrdup() for the implications.
universe@210 411 *
universe@210 412 * @param string the input string
universe@210 413 * @return the resulting lower case string
universe@210 414 * @see sstrdup()
universe@210 415 */
universe@210 416 sstr_t sstrlower(sstr_t string);
universe@210 417
universe@210 418 /**
universe@210 419 * Returns a lower case version of a string.
universe@210 420 *
universe@210 421 * This function creates a duplicate of the input string, first. See the
universe@210 422 * documentation of sstrdup_a() for the implications.
universe@210 423 *
universe@210 424 * @param allocator the allocator used for duplicating the string
universe@210 425 * @param string the input string
universe@210 426 * @return the resulting lower case string
universe@210 427 * @see sstrdup_a()
universe@210 428 */
universe@210 429 sstr_t sstrlower_a(UcxAllocator *allocator, sstr_t string);
universe@210 430
universe@210 431 /**
universe@210 432 * Returns a upper case version of a string.
universe@210 433 *
universe@210 434 * This function creates a duplicate of the input string, first. See the
universe@210 435 * documentation of sstrdup() for the implications.
universe@210 436 *
universe@210 437 * @param string the input string
universe@210 438 * @return the resulting upper case string
universe@210 439 * @see sstrdup()
universe@210 440 */
universe@210 441 sstr_t sstrupper(sstr_t string);
universe@210 442
universe@210 443 /**
universe@210 444 * Returns a upper case version of a string.
universe@210 445 *
universe@210 446 * This function creates a duplicate of the input string, first. See the
universe@210 447 * documentation of sstrdup_a() for the implications.
universe@210 448 *
universe@210 449 * @param allocator the allocator used for duplicating the string
universe@210 450 * @param string the input string
universe@210 451 * @return the resulting upper case string
universe@210 452 * @see sstrdup_a()
universe@210 453 */
universe@210 454 sstr_t sstrupper_a(UcxAllocator *allocator, sstr_t string);
universe@210 455
olaf@20 456 #ifdef __cplusplus
olaf@20 457 }
olaf@20 458 #endif
olaf@20 459
universe@116 460 #endif /* UCX_STRING_H */

mercurial