Оновити 'cv4/list_ops.c'

cv4/list_ops.c

@@ -1,57 +1,87 @@
 #include "list_ops.h"
+#include "test-framework/unity.h"
+#include <stdlib.h>
+#include <stdbool.h>
 #include <string.h>
 
-list_t *new_list(size_t length, list_element_t elements[]){
+list_t *new_list(size_t length, list_element_t elements[]) {
-  list_t* list = (list_t*)malloc(sizeof(list_t) + length * sizeof(list_element_t));
+    list_t *list = malloc(sizeof(list_t) + length * sizeof(list_element_t));
-  list->length = length;
+    list->length = length;
-  memcpy(list->elements,elements, length*sizeof(list_element_t));
+    for (int i = 0; i < length; i++) {
-<<<<<<< HEAD
+        list->elements[i] = elements[i];
-  free(list);
+    }
-  return list;
+    return list;
 }
 
-list_t *append_list(list_t *list1, list_t *list2){
+list_t *append_list(list_t *list1, list_t *list2) {
-  
+    list_t *list3 = malloc(sizeof(list_t) + (list1->length + list2->length) * sizeof(list_element_t));
-  return list2;
+    memcpy(list3,list1,sizeof(list_t));
-
+    for(size_t i = sizeof(list_t); i < (sizeof(list_t) + (list1->length + list2->length));i++){
+      list3->elements[i] = list2->elements[i];
+  }
+    return list3;
 }
 
-list_t *filter_list(list_t *list, bool (*filter)(list_element_t)){
+list_t *filter_list(list_t *list, bool (*predicate)(list_element_t)) {
-  return NULL;
+   list_element_t filter[list->length];
-
+   int counter = 0;
+   for(int i = 0; i < list->length;i++){
+     if(predicate(list->elements[i])){
+       filter[counter] = list->elements[i];
+       counter++;
+   	}
+   }
+   list_t *result = malloc(list->length);
+   for(int i = 0;i < list->length;i++)
+   		result->elements[i] = filter[i];
+   return result;
 }
 
-size_t length_list(list_t *list){
+size_t length_list(list_t *list) {
-  return 0;
+    return list->length;
-
 }
 
-list_t *map_list(list_t *list, list_element_t (*map)(list_element_t)){
+list_t *map_list(list_t *list, list_element_t (*mapper)(list_element_t)) {
-  return NULL;
+    for (int i = 0; i < list->length; i++) {
+        list->elements[i] = mapper(list->elements[i]);
+    }
 
+    return list;
 }
 
-list_element_t foldl_list(list_t *list, list_element_t initial,
-                          list_element_t (*foldl)(list_element_t,
-                                                  list_element_t)){
-  list_element_t res=0;
-  return res;
 
+
+list_element_t foldl_list(list_t *list, list_element_t initial, list_element_t (*folder)(list_element_t, list_element_t)) {
+    list_element_t accumulator = initial;
+    
+    for (size_t i = 0; i < list->length; i++) {
+        accumulator = folder(accumulator, list->elements[i]);
+    }
+    
+    return accumulator;
 }
 
-list_element_t foldr_list(list_t *list, list_element_t initial,
+list_element_t foldr_list(list_t *list, list_element_t initial, list_element_t (*folder)(list_element_t, list_element_t)) {
-                          list_element_t (*foldr)(list_element_t,
+    list_element_t accumulator = initial;
-                                                  list_element_t)){
-  list_element_t res=0;
-  return res;
     
+    for (size_t i = list->length; i > 0; i--) {
+        accumulator = folder(list->elements[i - 1], accumulator);
+    }
+    
+    return accumulator;
 }
 
-list_t *reverse_list(list_t *list){
+list_t *reverse_list(list_t *list) {
-  return NULL;
+    list_t *list2 = malloc(list->length); 
+    for (size_t i = 0; i < list->length; i++) {
+        list2->elements[i] = list->elements[list->length - i - 1];
+    }
 
+    return list2;
 }
 
-void delete_list(list_t *list){
+void delete_list(list_t *list) {
-
+    if (list != NULL) {
+        free(list);
+    }
 }