Thu, 23 Aug 2018 19:45:36 +0200
adds simple tiny test suite and updates license headers
universe@10 | 1 | /* |
universe@34 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@57 | 3 | * Copyright 2018 Mike Becker. All rights reserved. |
universe@34 | 4 | * |
universe@34 | 5 | * Redistribution and use in source and binary forms, with or without |
universe@34 | 6 | * modification, are permitted provided that the following conditions are met: |
universe@34 | 7 | * |
universe@34 | 8 | * 1. Redistributions of source code must retain the above copyright |
universe@34 | 9 | * notice, this list of conditions and the following disclaimer. |
universe@34 | 10 | * |
universe@34 | 11 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@34 | 12 | * notice, this list of conditions and the following disclaimer in the |
universe@34 | 13 | * documentation and/or other materials provided with the distribution. |
universe@34 | 14 | * |
universe@34 | 15 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@34 | 16 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@34 | 17 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
universe@34 | 18 | * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE |
universe@34 | 19 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
universe@34 | 20 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR |
universe@34 | 21 | * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
universe@34 | 22 | * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, |
universe@34 | 23 | * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
universe@57 | 24 | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
universe@10 | 25 | */ |
universe@10 | 26 | |
universe@19 | 27 | #include "string_list.h" |
universe@10 | 28 | |
universe@19 | 29 | string_list_t* new_string_list_t() { |
universe@19 | 30 | string_list_t* stringList = malloc(sizeof(string_list_t)); |
universe@19 | 31 | stringList->count = 0; |
universe@19 | 32 | stringList->items = NULL; |
universe@10 | 33 | |
universe@19 | 34 | return stringList; |
universe@10 | 35 | } |
universe@10 | 36 | |
universe@19 | 37 | void destroy_string_list_t(string_list_t* list) { |
universe@44 | 38 | if (list) { |
universe@44 | 39 | if (list->items) { |
universe@44 | 40 | free(list->items); |
universe@44 | 41 | } |
universe@44 | 42 | free(list); |
universe@10 | 43 | } |
universe@10 | 44 | } |
universe@10 | 45 | |
universe@44 | 46 | /* Adds an item to the list, if a NULL-list is specified, the item will |
universe@44 | 47 | * be freed. This way a NULL-list can be used as garbage bin. |
universe@44 | 48 | */ |
universe@44 | 49 | void add_string(string_list_t* list, char* item) { |
universe@44 | 50 | if (list) { |
universe@44 | 51 | char** reallocated_list = |
universe@44 | 52 | realloc(list->items, sizeof(char*) * (list->count + 1)); |
universe@44 | 53 | if (reallocated_list != NULL) { |
universe@44 | 54 | list->items = reallocated_list; |
universe@44 | 55 | list->items[list->count] = item; |
universe@44 | 56 | list->count++; |
universe@44 | 57 | } |
universe@44 | 58 | } else { |
universe@44 | 59 | free(item); |
universe@44 | 60 | } |
universe@44 | 61 | } |
universe@44 | 62 |