oldlist.cpp File Reference

#include "oldlist.h"
#include <cstdio>
#include <cstring>
#include "errcode.h"
#include "structures.h"

Go to the source code of this file.

Macros
#define	copy_first(l1, l2)   (l2=push(l2, first_node(l1)))

Functions
int	count (LIST var_list)
LIST	delete_d (LIST list, void *key, int_compare is_equal)
LIST	destroy (LIST list)
void	destroy_nodes (LIST list, void_dest destructor)
void	insert (LIST list, void *node)
LIST	last (LIST var_list)
LIST	pop (LIST list)
LIST	push (LIST list, void *element)
LIST	push_last (LIST list, void *item)
LIST	reverse (LIST list)
LIST	search (LIST list, void *key, int_compare is_equal)

Macro Definition Documentation

#define copy_first	(		l1,
			l2
	)		(l2=push(l2, first_node(l1)))

Definition at line 72 of file oldlist.cpp.

Function Documentation

int count

(

LIST

var_list

)

Definition at line 96 of file oldlist.cpp.

                         {
  int temp = 0;

  iterate(var_list) temp += 1;
  return (temp);
}

LIST delete_d	(	LIST	list,
		void *	key,
		int_compare	is_equal
	)

Definition at line 111 of file oldlist.cpp.

                                                          {
  LIST result = NIL_LIST;
  LIST last_one = NIL_LIST;

  if (is_equal == nullptr) is_equal = is_same;

  while (list != NIL_LIST) {
    if (!(*is_equal)(first_node(list), key)) {
      if (last_one == NIL_LIST) {
        last_one = list;
        list = list_rest(list);
        result = last_one;
        set_rest(last_one, NIL_LIST);
      } else {
        set_rest(last_one, list);
        last_one = list;
        list = list_rest(list);
        set_rest(last_one, NIL_LIST);
      }
    } else {
      list = pop(list);
    }
  }
  return (result);
}

LIST destroy

(

LIST

list

)

Definition at line 142 of file oldlist.cpp.

                        {
  LIST next;

  while (list != NIL_LIST) {
    next = list_rest(list);
    free_cell(list);
    list = next;
  }
  return (NIL_LIST);
}

void destroy_nodes	(	LIST	list,
		void_dest	destructor
	)

Definition at line 158 of file oldlist.cpp.

                                                    {
  ASSERT_HOST(destructor != nullptr);

  while (list != NIL_LIST) {
    if (first_node(list) != nullptr) (*destructor)(first_node(list));
    list = pop(list);
  }
}

void insert	(	LIST	list,
		void *	node
	)

Definition at line 173 of file oldlist.cpp.

                                   {
  LIST element;

  if (list != NIL_LIST) {
    element = push(NIL_LIST, node);
    set_rest(element, list_rest(list));
    set_rest(list, element);
    node = first_node(list);
    list->node = first_node(list_rest(list));
    list->next->node = (LIST)node;
  }
}

LIST last

(

LIST

var_list

)

Definition at line 191 of file oldlist.cpp.

                         {
  while (list_rest(var_list) != NIL_LIST) var_list = list_rest(var_list);
  return (var_list);
}

LIST pop

(

LIST

list

)

Definition at line 202 of file oldlist.cpp.

                    {
  LIST temp;

  temp = list_rest(list);

  if (list != NIL_LIST) {
    free_cell(list);
  }
  return (temp);
}

LIST push	(	LIST	list,
		void *	element
	)

Definition at line 219 of file oldlist.cpp.

                                    {
  LIST t;

  t = new_cell();
  t->node = static_cast<LIST>(element);
  set_rest(t, list);
  return (t);
}

LIST push_last	(	LIST	list,
		void *	item
	)

Definition at line 233 of file oldlist.cpp.

                                      {
  LIST t;

  if (list != NIL_LIST) {
    t = last(list);
    t->next = push(NIL_LIST, item);
    return (list);
  } else
    return (push(NIL_LIST, item));
}

LIST reverse

(

LIST

list

)

Definition at line 250 of file oldlist.cpp.

                        {
  LIST newlist = NIL_LIST;

  iterate(list) copy_first(list, newlist);
  return (newlist);
}

LIST search	(	LIST	list,
		void *	key,
		int_compare	is_equal
	)

Definition at line 264 of file oldlist.cpp.

                                                        {
  if (is_equal == nullptr) is_equal = is_same;

  iterate(list) if ((*is_equal)(first_node(list), key)) return (list);
  return (NIL_LIST);
}