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