oldlist.h File Reference

Go to the source code of this file.

Classes
struct	list_rec

Macros
#define	NIL_LIST   static_cast<LIST>(nullptr)
#define	list_rest(l)   ((l) ? (l)->next : NIL_LIST)
#define	first_node(l)   ((l) ? (l)->node : NIL_LIST)
#define	iterate(l)   for (; (l) != NIL_LIST; (l) = list_rest(l))
#define	set_rest(l, cell)   ((l)->next = (cell))

Typedefs
using	int_compare = int(*)(void *, void *)
using	void_dest = void(*)(void *)
using	LIST = list_rec *

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)
LIST	last (LIST var_list)
LIST	pop (LIST list)
LIST	push (LIST list, void *element)
LIST	push_last (LIST list, void *item)
LIST	search (LIST list, void *key, int_compare is_equal)

Macro Definition Documentation

first_node

#define first_node

(

l

)

((l) ? (l)->node : NIL_LIST)

Definition at line 84 of file oldlist.h.

iterate

#define iterate

(

l

)

for (; (l) != NIL_LIST; (l) = list_rest(l))

Definition at line 92 of file oldlist.h.

list_rest

#define list_rest

(

l

)

((l) ? (l)->next : NIL_LIST)

Definition at line 83 of file oldlist.h.

NIL_LIST

#define NIL_LIST   static_cast<LIST>(nullptr)

Definition at line 68 of file oldlist.h.

set_rest

#define set_rest	(		l,
			cell
	)		((l)->next = (cell))

Definition at line 101 of file oldlist.h.

Typedef Documentation

int_compare

using int_compare = int (*)(void*, void*)

Definition at line 70 of file oldlist.h.

LIST

using LIST = list_rec*

Definition at line 77 of file oldlist.h.

void_dest

using void_dest = void (*)(void*)

Definition at line 71 of file oldlist.h.

Function Documentation

count()

int count

(

LIST

var_list

)

Definition at line 79 of file oldlist.cpp.

                         {
  int temp = 0;
 
  iterate(var_list) temp += 1;

delete_d()

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

Definition at line 93 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);
    }

destroy()

LIST destroy

(

LIST

list

)

Definition at line 123 of file oldlist.cpp.

                        {
  LIST next;
 
  while (list != NIL_LIST) {
    next = list_rest(list);
    delete list;

destroy_nodes()

void destroy_nodes	(	LIST	list,
		void_dest	destructor
	)

Definition at line 138 of file oldlist.cpp.

                                                    {
  ASSERT_HOST(destructor != nullptr);
 

last()

LIST last

(

LIST

var_list

)

Definition at line 151 of file oldlist.cpp.

                         {

pop()

LIST pop

(

LIST

list

)

Definition at line 161 of file oldlist.cpp.

                    {

push()

LIST push	(	LIST	list,
		void *	element
	)

Definition at line 172 of file oldlist.cpp.

                                    {

push_last()

LIST push_last	(	LIST	list,
		void *	item
	)

Definition at line 185 of file oldlist.cpp.

                                      {

search()

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

Definition at line 202 of file oldlist.cpp.

                                                        {