ucx/string.c

Thu, 11 Oct 2012 16:29:30 +0200

author
Olaf Wintermann <olaf.wintermann@gmail.com>
date
Thu, 11 Oct 2012 16:29:30 +0200
changeset 68
88dbea299440
parent 67
27e67e725d35
child 69
fb59270b1de3
permissions
-rw-r--r--

removed const from string.*

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@68 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@68 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@68 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@68 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@68 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@47 61
olaf@47 62 size_t len = s.length;
olaf@47 63 size_t cplen = c1.length > len ? len : c1.length;
olaf@47 64 char *ptr = s.ptr;
olaf@47 65
olaf@47 66 memcpy(ptr, c1.ptr, cplen);
olaf@47 67 len -= cplen;
olaf@47 68 ptr += cplen;
olaf@20 69 for (int i=0;i<n-1;i++) {
olaf@20 70 sstr_t str = va_arg (ap, sstr_t);
olaf@47 71 cplen = str.length > len ? len : str.length;
olaf@47 72 if(cplen <= 0) {
olaf@47 73 va_end(ap);
olaf@47 74 return s;
olaf@47 75 }
olaf@47 76 memcpy(ptr, str.ptr, cplen);
olaf@47 77 len -= cplen;
olaf@47 78 ptr += cplen;
olaf@20 79 }
universe@24 80 va_end(ap);
olaf@20 81
olaf@20 82 return s;
olaf@20 83 }
olaf@20 84
olaf@68 85 sstr_t sstrsubs(sstr_t s, size_t start) {
olaf@20 86 return sstrsubsl (s, start, s.length-start);
olaf@20 87 }
olaf@20 88
olaf@68 89 sstr_t sstrsubsl(sstr_t s, size_t start, size_t length) {
olaf@20 90 sstr_t new_sstr;
olaf@20 91 if (start < 0 || start >= s.length || length < 0) {
olaf@20 92 return s;
olaf@20 93 }
olaf@20 94 if (length > s.length-start) {
olaf@20 95 length = s.length-start;
olaf@20 96 }
olaf@20 97 new_sstr.ptr = &s.ptr[start];
olaf@20 98 new_sstr.length = length;
olaf@20 99 return new_sstr;
olaf@20 100 }
olaf@20 101
olaf@68 102 sstr_t* sstrsplit(sstr_t s, sstr_t d, size_t *n) {
universe@39 103 if (d.length == 0) {
universe@39 104 return NULL;
universe@39 105 }
universe@39 106
universe@39 107 sstr_t* result;
universe@39 108 size_t nmax = *n;
universe@39 109 *n = 1;
universe@39 110
universe@39 111 /* special case: exact match - no processing needed */
universe@39 112 if (s.length == d.length && strncmp(s.ptr, d.ptr, s.length) == 0) {
universe@39 113 result = malloc(sizeof(sstr_t));
universe@39 114 result[0] = sstrn("", 0);
universe@39 115 return result;
universe@39 116 }
universe@39 117 sstr_t sv = sstrdup(s);
universe@39 118
universe@39 119 for (int i = 0 ; i < s.length ; i++) {
universe@39 120 if (sv.ptr[i] == d.ptr[0]) {
universe@39 121 _Bool match = 1;
universe@39 122 for (int j = 1 ; j < d.length ; j++) {
universe@39 123 if (j+i < s.length) {
universe@39 124 match &= (sv.ptr[i+j] == d.ptr[j]);
universe@39 125 } else {
universe@39 126 match = 0;
universe@39 127 break;
universe@39 128 }
universe@39 129 }
universe@39 130 if (match) {
universe@39 131 (*n)++;
universe@39 132 for (int j = 0 ; j < d.length ; j++) {
universe@39 133 sv.ptr[i+j] = 0;
universe@39 134 }
universe@39 135 i += d.length;
universe@39 136 }
universe@39 137 }
universe@39 138 if ((*n) == nmax) break;
universe@39 139 }
universe@39 140 result = malloc(sizeof(sstr_t) * (*n));
universe@39 141
universe@39 142 char *pptr = sv.ptr;
universe@39 143 for (int i = 0 ; i < *n ; i++) {
universe@39 144 size_t l = strlen(pptr);
universe@39 145 char* ptr = malloc(l + 1);
universe@39 146 memcpy(ptr, pptr, l);
universe@39 147 ptr[l] = 0;
universe@39 148
universe@39 149 result[i] = sstrn(ptr, l);
universe@39 150 pptr += l + d.length;
universe@39 151 }
universe@39 152
universe@39 153 free(sv.ptr);
universe@39 154
universe@39 155 return result;
universe@39 156 }
universe@39 157
olaf@68 158 int sstrcmp(sstr_t s1, sstr_t s2) {
olaf@20 159 return strncmp(s1.ptr, s2.ptr, s1.length>s2.length ? s2.length: s1.length);
olaf@20 160 }
olaf@20 161
olaf@68 162 sstr_t sstrdup(sstr_t s) {
olaf@20 163 sstr_t newstring;
universe@24 164 newstring.ptr = (char*) malloc(s.length + 1);
universe@24 165 if (newstring.ptr != NULL) {
universe@24 166 newstring.length = s.length;
universe@24 167 newstring.ptr[newstring.length] = 0;
olaf@20 168
universe@24 169 memcpy(newstring.ptr, s.ptr, s.length);
universe@24 170 }
olaf@20 171
olaf@20 172 return newstring;
olaf@20 173 }

mercurial