cutil/oldlist.h File Reference

#include "cutil.h"

Go to the source code of this file.

Classes

• struct list_rec

  Holds one node of a list, pointers to node and next node. More...
  

Defines

• #define copy_first(l1, l2)   (l2=push(l2, first(l1)))

  Do the appropriate kind a push operation to copy the first node from one list to another.
  

• #define first(l)   ((l) ? (l)->node : NIL)
• #define iterate(l)   for (; (l) != NIL; (l) = rest (l))

  Visit each node in the list.
  

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

  Visit each node in the list (l).
  

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

  Add another list onto the tail of this one.
  

• #define NIL   (LIST) 0
• #define pop_off(list)   ((list) = pop (list))

  Add a cell onto the front of a list.
  

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

  Add a cell onto the front of a list.
  

• #define rest(l)   ((l) ? (l)->next : NIL)
• #define second(l)   first (rest (l))

  Return the contents of the second list element.
  

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

  Change the "next" field of a list element to point to a desired place.
  

• #define third(l)   first (rest (rest (l)))

  Return the contents of the third list element.
  

Typedefs

• typedef list_rec _LIST_

  Type of list_rec, pointers to node and next node.
  

• typedef _LIST_ * LIST

  Pointer to _LIST_ which holds one node of a list, pointers to node and next node.
  

Functions

• int count (LIST var_list)

  Recursively count the elements in a list.
  

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

  Delete all the elements out of the current list that match the key.
  

• LIST destroy (LIST list)

  Return the space taken by a list to the heap.
  

• void destroy_nodes (LIST list, void_dest destructor)

  Return the space taken by the LISTs of a list to the heap.
  

• void insert (LIST list, void *node)

  Create a list element and rearange the pointers so that the first element in the list is the second aurgment.
  

• int is_same (void *item1, void *item2)

  Compare the list node with the key value return TRUE (non-zero) if they are equivalent strings. (Return FALSE if not).
  

• int is_same_node (void *item1, void *item2)

  Compare the list node with the key value return TRUE (non-zero) if they are equivalent strings. (Return FALSE if not).
  

• LIST join (LIST list1, LIST list2)

  Join the two lists together.
  

• LIST last (LIST var_list)

  Return the last list item (this is list type).
  

• void * nth_cell (LIST var_list, int item_num)

  Return nth list cell in the list.
  

• LIST pop (LIST list)

  Return the list with the first element removed & destroys the space that it occupied in the list.
  

• LIST push (LIST list, void *element)

  Create a list element.
  

• LIST push_last (LIST list, void *item)

  Create a list element.
  

• LIST reverse (LIST list)

  Create a new list with the elements reversed.
  

• LIST reverse_d (LIST list)

  Create a new list with the elements reversed.
  

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

  Adjoin an element to an assorted list.
  

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

  Search list, return NIL if not found.
  

---

Define Documentation

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

Do the appropriate kind a push operation to copy the first node from one list to another.

Definition at line 155 of file oldlist.h.

Referenced by reverse().

#define first

(

l

)

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

Definition at line 149 of file oldlist.h.

Referenced by AddToNormProtosList(), AlternativeChoicesWorseThan(), AmbigsFound(), append_number_choices(), BlobMicroFeatures(), CleanUpUnusedData(), ComputeChiSquared(), ComputeNormMatch(), ComputeOutlineStats(), ComputePrototypes(), copy_choices(), CurrentBestChoiceAdjustFactor(), CurrentBestChoiceIs(), cutline(), dawg_permute(), dawg_permute_and_select(), DebugWordChoices(), delete_d(), destroy_nodes(), display_edgepts(), ExtractMicros(), ExtractOutlineFeatures(), ExtractPicoFeatures(), FilterWordChoices(), FindClass(), FindClassifierErrors(), FindList(), FreeClusterer(), FreeLabeledClassList(), FreeMFOutline(), FreeNormProtoList(), FreeTrainingSamples(), GetBuckets(), insert(), LogNewSplit(), LogNewWordChoice(), MainSignalHandler(), NextSample(), NormalizeOutlines(), number_permute(), number_permute_and_select(), NumberOfProtos(), permute_compound_words(), permute_top_choice(), print_matrix(), read_variables(), RemoveInsignificantProtos(), s_adjoin(), search(), SetUpForClustering(), SetUpForFloat2Int(), word_associator(), WriteAdaptedClass(), WriteMergedTrainingSamples(), WriteMicrofeat(), WriteNormProtos(), WriteProtoList(), WriteProtos(), and WriteTrainingSamples().

#define iterate

(

l

)

for (; (l) != NIL; (l) = rest (l))

Visit each node in the list.

Replace the old list with the list minus the head. Continue until the list is NIL.

Definition at line 164 of file oldlist.h.

Referenced by AddToNormProtosList(), AlternativeChoicesWorseThan(), AmbigsFound(), BlobMicroFeatures(), CleanUpUnusedData(), ComputeNormMatch(), ComputeOutlineStats(), count(), DebugWordChoices(), display_edgepts(), ExtractMicros(), ExtractOutlineFeatures(), ExtractPicoFeatures(), FindClass(), FindList(), FreeClusterer(), FreeLabeledClassList(), FreeNormProtoList(), FreeTrainingSamples(), LogNewSplit(), LogNewWordChoice(), MainSignalHandler(), NormalizeOutlines(), nth_cell(), NumberOfProtos(), print_choices(), read_variables(), RemoveInsignificantProtos(), reverse(), s_adjoin(), search(), SetUpForClustering(), SetUpForFloat2Int(), SmearBulges(), WriteAdaptedClass(), WriteMergedTrainingSamples(), WriteMicrofeat(), WriteNormProtos(), WriteProtoList(), WriteProtos(), and WriteTrainingSamples().

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

Visit each node in the list (l).

Use a local variable (x) to iterate through all of the list cells. This macro is identical to iterate except that it does not lose the original list.

Definition at line 174 of file oldlist.h.

Referenced by copy_choices(), dawg_permute(), number_permute(), and permute_top_choice().

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

Add another list onto the tail of this one.

The list given as an input parameter is modified.

Definition at line 182 of file oldlist.h.

Referenced by append_next_choice(), and append_number_choices().

#define NIL   (LIST) 0

Definition at line 122 of file oldlist.h.

Referenced by AcceptableResult(), AdaptiveClassifier(), AddLargeSpeckleTo(), AddSignalMenuItem(), BlobMicroFeatures(), CharNormalizeOutline(), ComputePrototypes(), ConvertBlob(), ConvertMatchesToChoices(), ConvertOutline(), copy_choices(), CurrentBestChoiceAdjustFactor(), CurrentBestChoiceIs(), CurrentWordAmbig(), dawg_permute(), dawg_permute_and_select(), delete_d(), destroy(), destroy_nodes(), draw_blob_edges(), evaluate_chunks(), FillAmbigTable(), FilterWordChoices(), FindClassifierErrors(), free_variables(), FreeMFOutline(), get_match_by_bounds(), improve_one_blob(), InitChoiceAccum(), insert(), join(), last(), LogNewWordChoice(), MainSignalHandler(), NewAdaptedClass(), NewLabeledList(), NewTempConfig(), NormalizeOutline(), number_permute(), number_permute_and_select(), pop(), print_choices(), push_last(), rating_priority(), read_list(), ReadAdaptedClass(), ReadNormProtos(), ReadTrainingSamples(), record_piece_ratings(), RemoveInsignificantProtos(), reverse(), search(), select_blob_to_split(), and SmearExtremities().

#define pop_off

(

list

)

((list) = pop (list))

Add a cell onto the front of a list.

The list given as an input parameter is modified.

Definition at line 190 of file oldlist.h.

Referenced by append_number_choices(), dawg_permute_and_select(), and number_permute_and_select().

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

Add a cell onto the front of a list.

The list given as an input parameter is modified.

Definition at line 198 of file oldlist.h.

Referenced by append_next_choice(), append_number_choices(), and draw_blob_edges().

#define rest

(

l

)

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

Definition at line 148 of file oldlist.h.

Referenced by AcceptableResult(), AlternativeChoicesWorseThan(), CurrentWordAmbig(), delete_d(), destroy(), FilterWordChoices(), FreeMFOutline(), insert(), last(), LogNewWordChoice(), permute_top_choice(), and pop().

#define second

(

l

)

first (rest (l))

Return the contents of the second list element.

#define second(l) first (rest (l))

Definition at line 206 of file oldlist.h.

Referenced by FilterWordChoices(), and print_matrix().

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

Change the "next" field of a list element to point to a desired place.

#define set_rest(l,node) l->next = node;

Definition at line 214 of file oldlist.h.

Referenced by delete_d(), FilterWordChoices(), FreeMFOutline(), insert(), join(), LogNewWordChoice(), and push().

#define third

(

l

)

first (rest (rest (l)))

Return the contents of the third list element.

#define third(l) first (rest (rest (l)))

Definition at line 222 of file oldlist.h.

Referenced by print_matrix().

---

Typedef Documentation

_LIST_

Type of list_rec, pointers to node and next node.

LIST

Pointer to _LIST_ which holds one node of a list, pointers to node and next node.

Definition at line 142 of file oldlist.h.

---

Function Documentation

int count

(

LIST

var_list

)

Recursively count the elements in a list.

Return the count.

Definition at line 102 of file oldlist.cpp.

References iterate.

Referenced by REJMAP::accept_count(), AdaptiveClassifier(), apply_box_testing(), apply_box_training(), STATS::cluster(), POLY_BLOCK::contains(), count_alphanums(), count_alphas(), edgesteps_to_edgepts(), ExtractMicros(), find_modal_font(), fix_rep_char(), font_recognition_pass(), CLIST::internal_de_dump(), ELIST::internal_de_dump(), ELIST2::internal_de_dump(), CLIST::length(), ELIST::length(), ELIST2::length(), LogNewWordChoice(), POLY_BLOCK::overlap(), CLIST::prep_serialise(), ELIST::prep_serialise(), ELIST2::prep_serialise(), PrintAdaptedTemplates(), read_next_box(), CLIST::sort(), ELIST::sort(), ELIST2::sort(), POLY_BLOCK::winding_number(), and WriteAdaptedClass().

                         {
  int temp = 0;

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

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

Delete all the elements out of the current list that match the key.

Parameters:

	list	The list
	key	Key
	is_equal	Routine that will compare each node to the key

Returns:

last value deleted ??

This operation destroys the original list. is_equal compares each node to the key, and returns a non-zero value when they match. If the value NULL is supplied for is_equal, the is_key routine will be used.

Definition at line 123 of file oldlist.cpp.

References first, is_same(), NIL, NULL, pop(), rest, and set_rest.

Referenced by FilterWordChoices(), GetBuckets(), LogNewWordChoice(), and MakePermanent().

                                                          {
  LIST result = NIL;
  LIST last_one = NIL;

  if (is_equal == NULL)
    is_equal = is_same;

  while (list != NIL) {
    if (!(*is_equal) (first (list), key)) {
      if (last_one == NIL) {
        last_one = list;
        list = rest (list);
        result = last_one;
        set_rest(last_one, NIL);
      }
      else {
        set_rest(last_one, list);
        last_one = list;
        list = rest (list);
        set_rest(last_one, NIL);
      }
    }
    else {
      list = pop (list);
    }
  }
  return (result);
}

LIST destroy

(

LIST

list

)

Return the space taken by a list to the heap.

Definition at line 156 of file oldlist.cpp.

References free_cell(), NIL, and rest.

Referenced by draw_blob_edges(), FreeLabeledClassList(), FreeLabeledList(), FreeNormProtoList(), FreeTrainingSamples(), reverse_d(), and IMAGE::~IMAGE().

                        {
  LIST next;

  while (list != NIL) {
    next = rest (list);
    free_cell(list);
    list = next;
  }
  return (NIL);
}

void destroy_nodes	(	LIST	list,
		void_dest	destructor
	)

Return the space taken by the LISTs of a list to the heap.

Definition at line 171 of file oldlist.cpp.

References first, memfree(), NIL, NULL, and pop().

Referenced by convert_choice_list(), EndDangerousAmbigs(), free_adapted_class(), free_variables(), FreeMicroFeatures(), FreeOutlines(), FreeProtoList(), FreeTempConfig(), init_match_table(), InitChoiceAccum(), and LogNewWordChoice().

                                                    {
  if (destructor == NULL)
    destructor = memfree;

  while (list != NIL) {
    (*destructor) (first (list));
    list = pop (list);
  }
}

void insert	(	LIST	list,
		void *	node
	)

Create a list element and rearange the pointers so that the first element in the list is the second aurgment.

Definition at line 186 of file oldlist.cpp.

References first, NIL, push(), rest, and set_rest.

Referenced by s_adjoin().

                                   {
  LIST element;

  if (list != NIL) {
    element = push (NIL, node);
    set_rest (element, rest (list));
    set_rest(list, element);
    node = first (list);
    list->node = first (rest (list));
    list->next->node = (LIST) node;
  }
}

int is_same	(	void *	item1,
		void *	item2
	)

Compare the list node with the key value return TRUE (non-zero) if they are equivalent strings. (Return FALSE if not).

Definition at line 213 of file oldlist.cpp.

Referenced by delete_d(), and search().

                                      {
  return (!strcmp ((char *) item1, (char *) item2));
}

int is_same_node	(	void *	item1,
		void *	item2
	)

Compare the list node with the key value return TRUE (non-zero) if they are equivalent strings. (Return FALSE if not).

Definition at line 204 of file oldlist.cpp.

Referenced by LogNewWordChoice().

                                           {
  return (item1 == item2);
}

LIST join	(	LIST	list1,
		LIST	list2
	)

Join the two lists together.

This function is similar to concat except that concat creates a new list. This function returns the first list updated.

Definition at line 224 of file oldlist.cpp.

References last(), NIL, and set_rest.

Referenced by h_edge(), and v_edge().

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

LIST last

(

LIST

var_list

)

Return the last list item (this is list type).

Definition at line 235 of file oldlist.cpp.

References NIL, and rest.

Referenced by AddLargeSpeckleTo(), CLIST::CLIST(), cutline(), ELIST::ELIST(), ELIST2::ELIST2(), CLIST::empty(), ELIST::empty(), ELIST2::empty(), CLIST::First(), ELIST::First(), ELIST2::First(), join(), push_last(), CLIST::shallow_copy(), ELIST::shallow_copy(), ELIST2::shallow_copy(), CLIST::singleton(), ELIST::singleton(), and ELIST2::singleton().

                         {
  while (rest (var_list) != NIL)
    var_list = rest (var_list);
  return (var_list);
}

void* nth_cell	(	LIST	var_list,
		int	item_num
	)

Return nth list cell in the list.

Definition at line 245 of file oldlist.cpp.

References iterate.

Referenced by LogNewWordChoice().

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

LIST pop

(

LIST

list

)

Return the list with the first element removed & destroys the space that it occupied in the list.

Definition at line 259 of file oldlist.cpp.

References free_cell(), NIL, and rest.

Referenced by ComputePrototypes(), delete_d(), destroy_nodes(), FreeMFOutline(), and NextSample().

                    {
  LIST temp;

  temp = rest (list);

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

LIST push	(	LIST	list,
		void *	element
	)

Create a list element.

Push the second parameter (the node) onto the first parameter (the list). Return the new list to the caller.

Definition at line 277 of file oldlist.cpp.

References new_cell(), list_rec::node, and set_rest.

Referenced by add_32bit_variable(), add_ptr_variable(), AddToNormProtosList(), ComputeChiSquared(), ComputePrototypes(), ConvertOutline(), ConvertOutlines(), ConvertToMicroFeatures(), copy_choices(), FreeBuckets(), insert(), MakeNewAdaptedClass(), MakeNewTempProtos(), NextSample(), push_last(), read_list(), and ReadTrainingSamples().

                                    {
  LIST t;

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

LIST push_last	(	LIST	list,
		void *	item
	)

Create a list element.

Add the element onto the end of the list.

Definition at line 292 of file oldlist.cpp.

References last(), list_rec::next, NIL, and push().

Referenced by append_choice(), FillAmbigTable(), ReadAdaptedClass(), ReadNormProtos(), and s_adjoin().

                                      {
  LIST t;

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

LIST reverse

(

LIST

list

)

Create a new list with the elements reversed.

The old list is not destroyed.

Definition at line 310 of file oldlist.cpp.

References copy_first, iterate, and NIL.

Referenced by ELISTIZE_S(), and reverse_d().

                        {
  LIST newlist = NIL;

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

LIST reverse_d

(

LIST

list

)

Create a new list with the elements reversed.

The old list is destroyed.

Definition at line 323 of file oldlist.cpp.

References destroy(), and reverse().

Referenced by copy_choices(), and read_list().

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

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

Adjoin an element to an assorted list.

The original list is modified. Returns the modified list.

Definition at line 335 of file oldlist.cpp.

References first, insert(), iterate, NULL, and push_last().

Referenced by AddSignalMenuItem(), and LogNewWordChoice().

                                                                  {
  LIST l;
  int result;

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

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

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

Search list, return NIL if not found.

Return the list starting from the item if found. The compare routine "is_equal" is passed in as the third paramter to this routine. If the value NULL is supplied for is_equal, the is_key routine will be used.

Definition at line 364 of file oldlist.cpp.

References first, is_same(), iterate, NIL, and NULL.

Referenced by ComputeChiSquared(), GetBuckets(), and read_variables().

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

  iterate (list) if ((*is_equal) (first (list), key))
  return (list);
  return (NIL);
}

---