linked_list.c

#include <stdlib.h>
#include <stdbool.h>

#include "linked_list.h"

Node * cons(void *ptr, Node *list) {
  struct Node* node = (struct Node*)malloc(sizeof(struct Node));
  node->ptr = ptr;
  node->next = list;
  return node;
}

Node * reverse(Node *head) {
  Node *ret = NULL;
  while (head != NULL) {
    ret = cons(head->ptr, ret);
    head = head->next;
  }
  return ret;
}

bool null_list(Node *head) {
  return (head == NULL);
}

bool member_list(void *ptr, Node *head) {
  while (head != NULL) {
    if (ptr == head->ptr) return true;
    head = head->next;
  }
  return false;
}

u64 length_list(Node *head) {
  u64 len = 0;
  while (head != NULL) {
    head = head->next;
    len++;
  }
  return len;
}

void free_list(Node *head, bool free_contents) {
  Node *tmp;

  while (head != NULL) {
    tmp = head;
    head = head->next;
    if (free_contents) free(tmp->ptr);
    free(tmp);
  }
}