Mercurial > hg > cline / file revision

/*
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. 
 * Copyright 2018 Mike Becker. All rights reserved.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 * 
 * 1. Redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer.
 * 
 * 2. Redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution.
 * 
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include "string_list.h"

#include <assert.h>

static void do_not_free(void *item) {
  (void) item; /* do not do anything with the item */
}

string_list *new_string_list() {
  string_list *list = malloc(sizeof(string_list));
  list->count = 0;
  list->capacity = 32;
  list->items = calloc(list->capacity, sizeof(char*));
  list->free_item = do_not_free;

  return list;
}

void destroy_string_list(string_list *list) {
  if (list) {
    if (list->items) {
      for (size_t i = 0 ; i < list->count ; i++) {
        list->free_item(list->items[i]);
      }
      free(list->items);
    }
    free(list);
  }
}

void add_string(string_list *list, char *item) {
  assert(list != NULL);
  if (list->count < list->capacity) {
    list->items[list->count++] = item;
    return;
  }
  size_t new_cap = list->capacity * 2;
  char **reallocated_list =
    realloc(list->items, sizeof(char*) * new_cap);
  assert(reallocated_list != NULL);
  list->capacity = new_cap;
  list->items = reallocated_list;
  list->items[list->count++] = item;
}