oldlist.h File Reference

#include "cutil.h"
#include "tesscallback.h"

Go to the source code of this file.

Classes
struct	list_rec

Macros
#define	NIL_LIST   ((LIST)nullptr)
#define	list_rest(l)   ((l) ? (l)->next : NIL_LIST)
#define	first_node(l)   ((l) ? (l)->node : NIL_LIST)
#define	copy_first(l1, l2)   (l2=push(l2, first_node(l1)))
#define	iterate(l)   for (; (l) != NIL_LIST; (l) = list_rest (l))
#define	iterate_list(x, l)   for ((x)=(l); (x)!=0; (x)=list_rest(x))
#define	JOIN_ON(list1, list2)   ((list1) = join ((list1), (list2)))
#define	pop_off(list)   ((list) = pop (list))
#define	push_on(list, thing)   ((list) = push (list, (LIST) (thing)))
#define	second_node(l)   first_node (list_rest (l))
#define	set_rest(l, cell)   ((l)->next = (cell))
#define	third(l)   first_node (list_rest (list_rest (l)))

Typedefs
using	LIST = list_rec *

Functions
int	count (LIST var_list)
LIST	delete_d (LIST list, void *key, int_compare is_equal)
LIST	delete_d (LIST list, void *key, TessResultCallback2< int, void *, void *> *is_equal)
LIST	destroy (LIST list)
void	destroy_nodes (LIST list, void_dest destructor)
void	insert (LIST list, void *node)
int	is_same (void *item1, void *item2)
LIST	join (LIST list1, LIST list2)
LIST	last (LIST var_list)
void *	nth_cell (LIST var_list, int item_num)
LIST	pop (LIST list)
LIST	push (LIST list, void *element)
LIST	push_last (LIST list, void *item)
LIST	reverse (LIST list)
LIST	reverse_d (LIST list)
LIST	s_adjoin (LIST var_list, void *variable, int_compare compare)
LIST	search (LIST list, void *key, int_compare is_equal)
LIST	search (LIST list, void *key, TessResultCallback2< int, void *, void *> *)

Macro Definition Documentation

copy_first

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

Definition at line 151 of file oldlist.h.

first_node

#define first_node

(

l

)

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

Definition at line 141 of file oldlist.h.

iterate

#define iterate

(

l

)

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

Definition at line 161 of file oldlist.h.

iterate_list

#define iterate_list	(		x,
			l
	)		for ((x)=(l); (x)!=0; (x)=list_rest(x))

Definition at line 172 of file oldlist.h.

JOIN_ON

#define JOIN_ON	(		list1,
			list2
	)		((list1) = join ((list1), (list2)))

Definition at line 182 of file oldlist.h.

list_rest

#define list_rest

(

l

)

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

Definition at line 140 of file oldlist.h.

NIL_LIST

#define NIL_LIST   ((LIST)nullptr)

Definition at line 127 of file oldlist.h.

pop_off

#define pop_off

(

list

)

((list) = pop (list))

Definition at line 192 of file oldlist.h.

push_on

#define push_on	(		list,
			thing
	)		((list) = push (list, (LIST) (thing)))

Definition at line 202 of file oldlist.h.

second_node

#define second_node

(

l

)

first_node (list_rest (l))

Definition at line 213 of file oldlist.h.

set_rest

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

Definition at line 224 of file oldlist.h.

third

#define third

(

l

)

first_node (list_rest (list_rest (l)))

Definition at line 235 of file oldlist.h.

Typedef Documentation

LIST

using LIST = list_rec *

Definition at line 134 of file oldlist.h.

Function Documentation

count()

int count

(

LIST

var_list

)

Definition at line 98 of file oldlist.cpp.

                         {
  int temp = 0;

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

delete_d() [1/2]

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

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

delete_d() [2/2]

LIST delete_d	(	LIST	list,
		void *	key,
		TessResultCallback2< int, void *, void *> *	is_equal
	)

Definition at line 140 of file oldlist.cpp.

                                                                  {
  LIST result = NIL_LIST;
  LIST last_one = NIL_LIST;

  while (list != NIL_LIST) {
    if (!(*is_equal).Run(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);
}

destroy()

LIST destroy

(

LIST

list

)

Definition at line 170 of file oldlist.cpp.

                        {
  LIST next;

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

destroy_nodes()

void destroy_nodes	(	LIST	list,
		void_dest	destructor
	)

Definition at line 186 of file oldlist.cpp.

                                                    {
  ASSERT_HOST(destructor != nullptr);

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

insert()

void insert	(	LIST	list,
		void *	node
	)

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

is_same()

int is_same	(	void *	item1,
		void *	item2
	)

Definition at line 220 of file oldlist.cpp.

                                      {
  return strcmp((char *)item1, (char *)item2) == 0 ? 1 : 0;
}

join()

LIST join	(	LIST	list1,
		LIST	list2
	)

Definition at line 231 of file oldlist.cpp.

                                  {
  if (list1 == NIL_LIST) return (list2);
  set_rest(last(list1), list2);
  return (list1);
}

last()

LIST last

(

LIST

var_list

)

Definition at line 242 of file oldlist.cpp.

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

nth_cell()

void* nth_cell	(	LIST	var_list,
		int	item_num
	)

Definition at line 252 of file oldlist.cpp.

                                            {
  int x = 0;
  iterate(var_list) {
    if (x++ == item_num) return (var_list);
  }
  return (var_list);
}

pop()

LIST pop

(

LIST

list

)

Definition at line 266 of file oldlist.cpp.

                    {
  LIST temp;

  temp = list_rest(list);

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

push()

LIST push	(	LIST	list,
		void *	element
	)

Definition at line 283 of file oldlist.cpp.

                                    {
  LIST t;

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

push_last()

LIST push_last	(	LIST	list,
		void *	item
	)

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

reverse()

LIST reverse

(

LIST

list

)

Definition at line 314 of file oldlist.cpp.

                        {
  LIST newlist = NIL_LIST;

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

reverse_d()

LIST reverse_d

(

LIST

list

)

Definition at line 327 of file oldlist.cpp.

                          {
  LIST result = reverse(list);
  destroy(list);
  return (result);
}

s_adjoin()

LIST s_adjoin	(	LIST	var_list,
		void *	variable,
		int_compare	compare
	)

Definition at line 339 of file oldlist.cpp.

                                                                  {
  LIST l;
  int result;

  if (compare == nullptr) compare = (int_compare)strcmp;

  l = var_list;
  iterate(l) {
    result = (*compare)(variable, first_node(l));
    if (result == 0)
      return (var_list);
    else if (result < 0) {
      insert(l, variable);
      return (var_list);
    }
  }
  return (push_last(var_list, variable));
}

search() [1/2]

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

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

search() [2/2]

LIST search	(	LIST	list,
		void *	key,
		TessResultCallback2< int, void *, void *> *
	)

Definition at line 373 of file oldlist.cpp.

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