#include "list_ops.h"
#include <string.h>
// constructs a new list
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->length = length;
	memcpy(list->elements,elements, length*sizeof(list_element_t));
	return list;
}

// append entries to a list and return the new list
list_t *append_list(list_t *list1, list_t *list2){
	if(list1==list2){};
  return NULL;

}

// filter list returning only values that satisfy the filter function
list_t *filter_list(list_t *list, bool (*filter)(list_element_t)){
	if(filter){};
	if(list){};
  return NULL;

}

// returns the length of the list
size_t length_list(list_t *list){
	if(list){};
  return 0;

}

// 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)){
	if(map){};
	if(list){};
  return NULL;

}

// 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)){

	if(list||foldl){};
	if(initial){};
  list_element_t res=0;
  return res;

}

// 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)){
	if(list){};
	if(initial||foldr){};
  list_element_t res=0;
  return res;

}

// reverse the elements of the list
list_t *reverse_list(list_t *list){
	if(list){};
  return NULL;

}

// destroy the entire list
// list will be a dangling pointer after calling this method on it
void delete_list(list_t *list){
	free(list);
}