funguje

list_ops.c

@@ -0,0 +1,47 @@
+#ifndef LIST_OPS_H
+#define LIST_OPS_H
+
+#include <stdlib.h>
+#include <stdbool.h>
+
+typedef int list_element_t;
+
+typedef struct {
+   size_t length;
+   list_element_t elements[];
+} list_t;
+
+// constructs a new list
+list_t *new_list(size_t length, list_element_t elements[]);
+
+// append entries to a list and return the new list
+list_t *append_list(list_t *list1, list_t *list2);
+
+// filter list returning only values that satisfy the filter function
+list_t *filter_list(list_t *list, bool (*filter)(list_element_t));
+
+// returns the length of the list
+size_t length_list(list_t *list);
+
+// return a list of elements whose values equal the list value transformed by
+// the mapping function
+list_t *map_list(list_t *list, list_element_t (*map)(list_element_t));
+
+// folds (reduces) the given list from the left with a function
+list_element_t foldl_list(list_t *list, list_element_t initial,
+                          list_element_t (*foldl)(list_element_t,
+                                                  list_element_t));
+
+// folds (reduces) the given list from the right with a function
+list_element_t foldr_list(list_t *list, list_element_t initial,
+                          list_element_t (*foldr)(list_element_t,
+                                                  list_element_t));
+
+// reverse the elements of the list
+list_t *reverse_list(list_t *list);
+
+// destroy the entire list
+// list will be a dangling pointer after calling this method on it
+void delete_list(list_t *list);
+
+#endif