Tue, 02 Oct 2012 13:43:17 +0200
added sstrsplit function
olaf@20 | 1 | /* |
olaf@20 | 2 | * File: sstring.c |
olaf@20 | 3 | * Author: olaf |
olaf@20 | 4 | * |
olaf@20 | 5 | * Created on 17. Juni 2010, 13:27 |
olaf@20 | 6 | */ |
olaf@20 | 7 | |
olaf@20 | 8 | #include <stdlib.h> |
olaf@30 | 9 | #include <strings.h> |
olaf@20 | 10 | #include <stdarg.h> |
olaf@20 | 11 | |
olaf@20 | 12 | #include "string.h" |
olaf@20 | 13 | |
olaf@20 | 14 | sstr_t sstr (char *s) { |
olaf@20 | 15 | sstr_t string; |
olaf@20 | 16 | string.ptr = s; |
olaf@20 | 17 | string.length = strlen(s); |
olaf@20 | 18 | return string; |
olaf@20 | 19 | } |
olaf@20 | 20 | |
olaf@20 | 21 | sstr_t sstrn (char *s, size_t n) { |
olaf@20 | 22 | sstr_t string; |
olaf@20 | 23 | string.ptr = s; |
olaf@20 | 24 | string.length = n; |
olaf@20 | 25 | return string; |
olaf@20 | 26 | } |
olaf@20 | 27 | |
olaf@20 | 28 | size_t sstrnlen (size_t n, sstr_t s, ...) { |
olaf@20 | 29 | va_list ap; |
olaf@20 | 30 | size_t size = s.length; |
olaf@20 | 31 | va_start(ap, s); |
olaf@20 | 32 | |
olaf@20 | 33 | for (int i=0;i<n-1;i++) { |
olaf@20 | 34 | sstr_t str = va_arg(ap, sstr_t); |
olaf@20 | 35 | size += str.length; |
olaf@20 | 36 | } |
universe@24 | 37 | va_end(ap); |
olaf@20 | 38 | |
olaf@20 | 39 | return size; |
olaf@20 | 40 | } |
olaf@20 | 41 | |
olaf@20 | 42 | sstr_t sstrcat (sstr_t s, ...) { |
olaf@20 | 43 | va_list ap; |
olaf@20 | 44 | va_start(ap, s); |
olaf@20 | 45 | s.ptr[0] = 0; |
olaf@20 | 46 | |
olaf@20 | 47 | sstr_t str = va_arg (ap, sstr_t); |
olaf@20 | 48 | while (str.ptr != NULL) { |
olaf@20 | 49 | s.ptr = strncat (s.ptr, str.ptr, s.length); |
olaf@20 | 50 | str = va_arg (ap, sstr_t); |
olaf@20 | 51 | } |
universe@24 | 52 | va_end(ap); |
olaf@20 | 53 | |
olaf@20 | 54 | return s; |
olaf@20 | 55 | } |
olaf@20 | 56 | |
olaf@20 | 57 | sstr_t sstrncat (size_t n, sstr_t s, sstr_t c1, ...) { |
olaf@20 | 58 | va_list ap; |
olaf@20 | 59 | va_start(ap, c1); |
olaf@20 | 60 | s.ptr[0] = 0; |
olaf@20 | 61 | |
olaf@20 | 62 | s.ptr = strncat (s.ptr, c1.ptr, s.length); |
olaf@20 | 63 | for (int i=0;i<n-1;i++) { |
olaf@20 | 64 | sstr_t str = va_arg (ap, sstr_t); |
olaf@20 | 65 | s.ptr = strncat (s.ptr, str.ptr, s.length); |
olaf@20 | 66 | } |
universe@24 | 67 | va_end(ap); |
olaf@20 | 68 | |
olaf@20 | 69 | return s; |
olaf@20 | 70 | } |
olaf@20 | 71 | |
olaf@20 | 72 | sstr_t sstrsubs (sstr_t s, size_t start) { |
olaf@20 | 73 | return sstrsubsl (s, start, s.length-start); |
olaf@20 | 74 | } |
olaf@20 | 75 | |
olaf@20 | 76 | sstr_t sstrsubsl (sstr_t s, size_t start, size_t length) { |
olaf@20 | 77 | sstr_t new_sstr; |
olaf@20 | 78 | if (start < 0 || start >= s.length || length < 0) { |
olaf@20 | 79 | return s; |
olaf@20 | 80 | } |
olaf@20 | 81 | if (length > s.length-start) { |
olaf@20 | 82 | length = s.length-start; |
olaf@20 | 83 | } |
olaf@20 | 84 | new_sstr.ptr = &s.ptr[start]; |
olaf@20 | 85 | new_sstr.length = length; |
olaf@20 | 86 | return new_sstr; |
olaf@20 | 87 | } |
olaf@20 | 88 | |
universe@39 | 89 | sstr_t* sstrsplit(sstr_t s, sstr_t d, size_t *n) { |
universe@39 | 90 | if (d.length == 0) { |
universe@39 | 91 | return NULL; |
universe@39 | 92 | } |
universe@39 | 93 | |
universe@39 | 94 | sstr_t* result; |
universe@39 | 95 | size_t nmax = *n; |
universe@39 | 96 | *n = 1; |
universe@39 | 97 | |
universe@39 | 98 | /* special case: exact match - no processing needed */ |
universe@39 | 99 | if (s.length == d.length && strncmp(s.ptr, d.ptr, s.length) == 0) { |
universe@39 | 100 | result = malloc(sizeof(sstr_t)); |
universe@39 | 101 | result[0] = sstrn("", 0); |
universe@39 | 102 | return result; |
universe@39 | 103 | } |
universe@39 | 104 | sstr_t sv = sstrdup(s); |
universe@39 | 105 | |
universe@39 | 106 | for (int i = 0 ; i < s.length ; i++) { |
universe@39 | 107 | if (sv.ptr[i] == d.ptr[0]) { |
universe@39 | 108 | _Bool match = 1; |
universe@39 | 109 | for (int j = 1 ; j < d.length ; j++) { |
universe@39 | 110 | if (j+i < s.length) { |
universe@39 | 111 | match &= (sv.ptr[i+j] == d.ptr[j]); |
universe@39 | 112 | } else { |
universe@39 | 113 | match = 0; |
universe@39 | 114 | break; |
universe@39 | 115 | } |
universe@39 | 116 | } |
universe@39 | 117 | if (match) { |
universe@39 | 118 | (*n)++; |
universe@39 | 119 | for (int j = 0 ; j < d.length ; j++) { |
universe@39 | 120 | sv.ptr[i+j] = 0; |
universe@39 | 121 | } |
universe@39 | 122 | i += d.length; |
universe@39 | 123 | } |
universe@39 | 124 | } |
universe@39 | 125 | if ((*n) == nmax) break; |
universe@39 | 126 | } |
universe@39 | 127 | result = malloc(sizeof(sstr_t) * (*n)); |
universe@39 | 128 | |
universe@39 | 129 | char *pptr = sv.ptr; |
universe@39 | 130 | for (int i = 0 ; i < *n ; i++) { |
universe@39 | 131 | size_t l = strlen(pptr); |
universe@39 | 132 | char* ptr = malloc(l + 1); |
universe@39 | 133 | memcpy(ptr, pptr, l); |
universe@39 | 134 | ptr[l] = 0; |
universe@39 | 135 | |
universe@39 | 136 | result[i] = sstrn(ptr, l); |
universe@39 | 137 | pptr += l + d.length; |
universe@39 | 138 | } |
universe@39 | 139 | |
universe@39 | 140 | free(sv.ptr); |
universe@39 | 141 | |
universe@39 | 142 | return result; |
universe@39 | 143 | } |
universe@39 | 144 | |
olaf@20 | 145 | int sstrcmp(sstr_t s1, sstr_t s2) { |
olaf@20 | 146 | return strncmp(s1.ptr, s2.ptr, s1.length>s2.length ? s2.length: s1.length); |
olaf@20 | 147 | } |
olaf@20 | 148 | |
olaf@31 | 149 | sstr_t sstrdup(sstr_t s) { |
olaf@20 | 150 | sstr_t newstring; |
universe@24 | 151 | newstring.ptr = (char*) malloc(s.length + 1); |
universe@24 | 152 | if (newstring.ptr != NULL) { |
universe@24 | 153 | newstring.length = s.length; |
universe@24 | 154 | newstring.ptr[newstring.length] = 0; |
olaf@20 | 155 | |
universe@24 | 156 | memcpy(newstring.ptr, s.ptr, s.length); |
universe@24 | 157 | } |
olaf@20 | 158 | |
olaf@20 | 159 | return newstring; |
olaf@20 | 160 | } |