linked_list_oo.c

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

#define linkedList_malloc(generic_ptr) \
  (generic_ptr *)malloc(sizeof(generic_ptr));

typedef struct self_node
{
  int this_info;
  struct self_node *next;
} Node;

typedef struct self_queue
{
  Node *head;
  // Methods
  void (*push_head)(struct self_queue *, const int);
  void (*push_rear)(struct self_queue *, const int);

  bool (*pop_head)(Node *);
  bool (*pop_rear)(Node *);

  bool (*remove_who)(Node *, const int);
  bool (*search_who)(Node *, const int);

  void (*show)(Node *);
  int (*size)(Node *);

} generic_linkedList;

void linkedList_push_rear(generic_linkedList *self, const int info)
{

  Node *node_next = linkedList_malloc(Node);

  node_next->this_info = info;
  node_next->next = NULL;

  if (self->head != NULL)
  {
    Node *tmp_ptr = self->head;

    while (tmp_ptr->next != NULL)
      tmp_ptr = tmp_ptr->next;
    tmp_ptr->next = node_next;
  }
  else
    self->head = node_next;
}

void linkedList_push_head(generic_linkedList *self, const int info)
{
  Node *node_next = linkedList_malloc(Node);

  node_next->this_info = info;
  node_next->next = self->head;

  self->head = node_next;
}

void linkedList_show(Node *self)
{
  if (self != NULL)
  {
    printf("%d\n", self->this_info);
    linkedList_show(self->next);
  }
}

int linkedList_size(Node *self)
{
  if (self != NULL)
    return linkedList_size(self->next) + 1;
  return 0;
}

generic_linkedList *initialize_linkedList()
{
  generic_linkedList *tmp = linkedList_malloc(generic_linkedList);

  tmp->head = NULL;

  // Iniciando os métodos de acesso
  tmp->push_head = linkedList_push_head;
  tmp->push_rear = linkedList_push_rear;

  tmp->show = linkedList_show;
  tmp->size = linkedList_size;

  return tmp;
}

int main(int argc, char **argv)
{
  generic_linkedList *ptr = initialize_linkedList();

  for (int generic_value = 0; generic_value < 5; generic_value++)
  {
    ptr->push_head(ptr, generic_value);
    ptr->push_rear(ptr, generic_value);
  }

  ptr->show(ptr->head);

  printf("size_q: %d\n", ptr->size(ptr->head));

  return 0;
}