str

A small library for handling strings in c.


str

/

str.c

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 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310
//
// MIT License
//
// Copyright (c) 2018 Brett Robinson
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in all
// copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.
//

#include "str.h"

#include <stdlib.h>

int str_new(str_t *str)
{
  char *tmp = malloc(sizeof(char) * 1);
  if (tmp == NULL)
  {
    return -1;
  }
  str->str = tmp;
  str->str[0] = '\0';
  str->len = 0;
  str->cap = 1;
  return 0;
}

void str_delete(str_t *str)
{
  free(str->str);
}

int str_set(str_t *str1, str_t *str2)
{
  if (str_clear(str1) == -1) return -1;
  if (str_append(str1, str2) == -1) return -1;
  return 0;
}

int str_move(str_t *str1, str_t *str2)
{
  str_delete(str1);
  *str1 = *str2;
  return 0;
}

int str_reserve(str_t *str, size_t len)
{
  char *tmp = realloc(str->str, sizeof(char) * (len + str->len + 1));
  if (tmp == NULL)
  {
    return -1;
  }
  str->str = tmp;
  str->cap = len + str->len + 1;
  return str->cap;
}

int str_append(str_t *str1, str_t *str2)
{
  if (str1->len + str2->len + 1 > str1->cap)
  {
    char *tmp = realloc(str1->str, sizeof(char) * (str1->len + str2->len + 1));
    if (tmp == NULL)
    {
      return -1;
    }
    str1->str = tmp;
    str1->cap = str1->len + str2->len + 1;
  }

  char *dest = str1->str;
  char *s_ptr = str2->str;
  dest += str1->len;
  while ((*dest++ = *s_ptr++));

  str1->len += str2->len;
  return 0;
}

int str_insert(str_t *str, char *s, size_t i, size_t len)
{
  if (i >= str->len) return -1;

  str_t strf;
  if (i == 0)
  {
    if (str_new(&strf) == -1) goto err;
    if (str_reserve(&strf, str->len + len) == -1) goto err;

    if (str_cappend(&strf, s, len) == -1) goto err;
    if (str_cappend(&strf, str->str, str->len) == -1) goto err;

    if (str_move(str, &strf) == -1) goto err;
  }
  else if (i == str->len)
  {
    if (str_cappend(str, s, len) == -1) return -1;
  }
  else
  {
    if (str_new(&strf) == -1) goto err;
    if (str_reserve(&strf, str->len + len) == -1) goto err;

    if (str_cappend(&strf, str->str, i) == -1) goto err;
    if (str_cappend(&strf, s, len) == -1) goto err;
    if (str_cappend(&strf, str->str + i, str->len - i) == -1) goto err;

    if (str_move(str, &strf) == -1) goto err;
  }

  return 0;

err:
  str_delete(&strf);
  return -1;
}

int str_compare(str_t *str1, str_t *str2)
{
  char *s1 = str1->str;
  char *s2 = str2->str;
  while (*s1 && (*s1 == *s2))
  {
    s1++;
    s2++;
  }
  return *s1 - *s2;
}

int str_resize(str_t *str, size_t len)
{
  char *tmp = realloc(str->str, (sizeof(char) * (len + 1)));
  if (tmp == NULL)
  {
    return -1;
  }
  str->str = tmp;
  str->cap = len + 1;
  if (str->len > len)
  {
    str->len = len;
    str->str[str->len] = '\0';
  }
  str->str[str->cap - 1] = '\0';
  return 0;
}

int str_erase(str_t *str, size_t index, size_t len)
{
  if (index > str->len) return -1;
  if (index + len > str->len) return -1;

  char *s = str->str + index;
  char *p = str->str + index + len;
  while ((*s++ = *p++));
  str->len -= len;
  return str->len;
}

int str_clear(str_t *str)
{
  *str->str = '\0';
  str->len = 0;
  return 0;
}

int str_escape(str_t *str)
{
  str_t tmp;
  if (str_new(&tmp) == -1) goto err;
  if (str_reserve(&tmp, str->len + 64) == -1) goto err;

  char *tok = str->str;
  char *tok_start = str->str;
  int count = 0;

  for (size_t i = 0; i <= str->len; ++i)
  {
    switch(tok[i])
    {
    case '\n':
      if (str_cappend(&tmp, tok_start, &tok[i] - tok_start) == -1) goto err;
      if (str_cappend(&tmp, "\\n", 2) == -1) goto err;
      tok_start = &tok[i] + 1;
      ++count;
      break;

    case '\t':
      if (str_cappend(&tmp, tok_start, &tok[i] - tok_start) == -1) goto err;
      if (str_cappend(&tmp, "\\t", 2) == -1) goto err;
      tok_start = &tok[i] + 1;
      ++count;
      break;

    case '\r':
      if (str_cappend(&tmp, tok_start, &tok[i] - tok_start) == -1) goto err;
      if (str_cappend(&tmp, "\\r", 2) == -1) goto err;
      tok_start = &tok[i] + 1;
      ++count;
      break;

    case '\'':
      if (str_cappend(&tmp, tok_start, &tok[i] - tok_start) == -1) goto err;
      if (str_cappend(&tmp, "\\\'", 2) == -1) goto err;
      tok_start = &tok[i] + 1;
      ++count;
      break;

    case '\"':
      if (str_cappend(&tmp, tok_start, &tok[i] - tok_start) == -1) goto err;
      if (str_cappend(&tmp, "\\\"", 2) == -1) goto err;
      tok_start = &tok[i] + 1;
      ++count;
      break;

    case '\0':
      if (str_cappend(&tmp, tok_start, 1) == -1) goto err;
      break;

    default:
      break;
    }
  }

  if (str_move(str, &tmp) == -1) goto err;
  return count;

  err:
    str_delete(&tmp);
    return -1;
}

int str_cset(str_t *str, char *s, size_t len)
{
  if (str_clear(str) == -1) return -1;
  if (str_cappend(str, s, len) == -1) return -1;
  return 0;
}

int str_cappend(str_t *str, char *s, size_t len)
{
  size_t s_len = 0;
  {
    char *p = s;
    while (*p)
    {
      p++;
      s_len++;
    }
  }
  if (s_len < len) return -1;

  if (str->len + len + 1 > str->cap)
  {
    char *tmp = realloc(str->str, sizeof(char) * (str->len + len + 1));
    if (tmp == NULL)
    {
      return -1;
    }
    str->str = tmp;
    str->cap = str->len + len + 1;
  }

  size_t count = 0;
  {
    char *dest = str->str;
    char *s_ptr = s;
    dest += str->len;
    while ((count < len) && (*dest = *s_ptr))
    {
      dest++;
      s_ptr++;
      count++;
    }
  }

  str->len += len;
  str->str[str->len] = '\0';

  return 0;
}

int str_ccompare(str_t *str, char *s, size_t len)
{
  size_t count = 0;
  char *s1 = str->str;
  char *s2 = s;
  while (*s1 && (*s1 == *s2) && (++count < len))
  {
    s1++;
    s2++;
  }
  return *s1 - *s2;
}
Back to Top