|
1 /* |
|
2 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
|
3 * |
|
4 * Copyright 2011 Olaf Wintermann. All rights reserved. |
|
5 * |
|
6 * Redistribution and use in source and binary forms, with or without |
|
7 * modification, are permitted provided that the following conditions are met: |
|
8 * |
|
9 * 1. Redistributions of source code must retain the above copyright |
|
10 * notice, this list of conditions and the following disclaimer. |
|
11 * |
|
12 * 2. Redistributions in binary form must reproduce the above copyright |
|
13 * notice, this list of conditions and the following disclaimer in the |
|
14 * documentation and/or other materials provided with the distribution. |
|
15 * |
|
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
17 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
18 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
19 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
|
20 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
21 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
22 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
23 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
24 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
25 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
26 * POSSIBILITY OF SUCH DAMAGE. |
|
27 */ |
|
28 |
|
29 #include <stdlib.h> |
|
30 #include <string.h> |
|
31 #include <stdarg.h> |
|
32 |
|
33 #include "sstring.h" |
|
34 |
|
35 sstr_t sstr (char *s) { |
|
36 sstr_t string; |
|
37 string.ptr = s; |
|
38 string.length = strlen(s); |
|
39 return string; |
|
40 } |
|
41 |
|
42 sstr_t sstrn (char *s, size_t n) { |
|
43 sstr_t string; |
|
44 string.ptr = s; |
|
45 string.length = n; |
|
46 return string; |
|
47 } |
|
48 |
|
49 size_t sstrnlen (size_t n, sstr_t s, ...) { |
|
50 va_list ap; |
|
51 size_t size = s.length; |
|
52 va_start(ap, s); |
|
53 |
|
54 for (int i=0;i<n-1;i++) { |
|
55 sstr_t str = va_arg(ap, sstr_t); |
|
56 size += str.length; |
|
57 } |
|
58 |
|
59 return size; |
|
60 } |
|
61 |
|
62 sstr_t sstrcat (sstr_t s, ...) { |
|
63 va_list ap; |
|
64 va_start(ap, s); |
|
65 s.ptr[0] = 0; |
|
66 |
|
67 sstr_t str = va_arg (ap, sstr_t); |
|
68 while (str.ptr != NULL) { |
|
69 s.ptr = strncat (s.ptr, str.ptr, s.length); |
|
70 str = va_arg (ap, sstr_t); |
|
71 } |
|
72 |
|
73 return s; |
|
74 } |
|
75 |
|
76 sstr_t sstrncat (size_t n, sstr_t s, sstr_t c1, ...) { |
|
77 va_list ap; |
|
78 va_start(ap, c1); |
|
79 s.ptr[0] = 0; |
|
80 |
|
81 s.ptr = strncat (s.ptr, c1.ptr, s.length); |
|
82 for (int i=0;i<n-1;i++) { |
|
83 sstr_t str = va_arg (ap, sstr_t); |
|
84 s.ptr = strncat (s.ptr, str.ptr, s.length); |
|
85 } |
|
86 |
|
87 return s; |
|
88 } |
|
89 |
|
90 sstr_t sstrsubs (sstr_t s, size_t start) { |
|
91 return sstrsubsl (s, start, s.length-start); |
|
92 } |
|
93 |
|
94 sstr_t sstrsubsl (sstr_t s, size_t start, size_t length) { |
|
95 sstr_t new_sstr; |
|
96 if (start < 0 || start >= s.length || length < 0) { |
|
97 return s; |
|
98 } |
|
99 if (length > s.length-start) { |
|
100 length = s.length-start; |
|
101 } |
|
102 new_sstr.ptr = &s.ptr[start]; |
|
103 new_sstr.length = length; |
|
104 return new_sstr; |
|
105 } |
|
106 |
|
107 int sstrcmp(sstr_t s1, sstr_t s2) { |
|
108 return strncmp(s1.ptr, s2.ptr, s1.length>s2.length ? s2.length: s1.length); |
|
109 } |
|
110 |
|
111 sstr_t sstrdub(sstr_t s) { |
|
112 sstr_t newstring; |
|
113 newstring.ptr = malloc(s.length + 1); |
|
114 newstring.length = s.length; |
|
115 newstring.ptr[newstring.length] = 0; |
|
116 |
|
117 memcpy(newstring.ptr, s.ptr, s.length); |
|
118 |
|
119 return newstring; |
|
120 } |