ELIST Class Reference

#include <elst.h>

Public Member Functions
	ELIST ()
void	internal_clear (void(*zapper)(ELIST_LINK *))
bool	empty () const
bool	singleton () const
void	shallow_copy (ELIST *from_list)
void	internal_deep_copy (ELIST_LINK *(*copier)(ELIST_LINK *), const ELIST *list)
void	assign_to_sublist (ELIST_ITERATOR *start_it, ELIST_ITERATOR *end_it)
int32_t	length () const
void	sort (int comparator(const void *, const void *))
ELIST_LINK *	add_sorted_and_find (int comparator(const void *, const void *), bool unique, ELIST_LINK *new_link)
bool	add_sorted (int comparator(const void *, const void *), bool unique, ELIST_LINK *new_link)

Friends
class	ELIST_ITERATOR

Detailed Description

Definition at line 113 of file elst.h.

Constructor & Destructor Documentation

ELIST()

ELIST::ELIST ( )

inline

Definition at line 124 of file elst.h.

            {  //constructor
      last = nullptr;
    }

Member Function Documentation

add_sorted()

bool ELIST::add_sorted ( int   comparatorconst void *, const void *, bool  unique, ELIST_LINK *  new_link  )

inline

Definition at line 174 of file elst.h.

                                                       {
      return (add_sorted_and_find(comparator, unique, new_link) == new_link);
    }

add_sorted_and_find()

ELIST_LINK * ELIST::add_sorted_and_find	(	int	comparatorconst void *, const void *,
		bool	unique,
		ELIST_LINK *	new_link
	)

Definition at line 150 of file elst.cpp.

                                       {
  // Check for adding at the end.
  if (last == nullptr || comparator(&last, &new_link) < 0) {
    if (last == nullptr) {
      new_link->next = new_link;
    } else {
      new_link->next = last->next;
      last->next = new_link;
    }
    last = new_link;
  } else {
    // Need to use an iterator.
    ELIST_ITERATOR it(this);
    for (it.mark_cycle_pt(); !it.cycled_list(); it.forward()) {
      ELIST_LINK* link = it.data();
      int compare = comparator(&link, &new_link);
      if (compare > 0) {
        break;
      } else if (unique && compare == 0) {
        return link;
      }
    }
    if (it.cycled_list())
      it.add_to_end(new_link);
    else
      it.add_before_then_move(new_link);
  }
  return new_link;
}

assign_to_sublist()

void ELIST::assign_to_sublist	(	ELIST_ITERATOR *	start_it,
		ELIST_ITERATOR *	end_it
	)

Definition at line 72 of file elst.cpp.

                                                      {  //from list end
  const ERRCODE LIST_NOT_EMPTY =
    "Destination list must be empty before extracting a sublist";

  if (!empty ())
    LIST_NOT_EMPTY.error ("ELIST.assign_to_sublist", ABORT, nullptr);

  last = start_it->extract_sublist (end_it);
}

empty()

bool ELIST::empty ( ) const

inline

Definition at line 132 of file elst.h.

                       {  //is list empty?
      return !last;
    }

internal_clear()

void ELIST::internal_clear

(

void(*)(ELIST_LINK *)

zapper

)

Definition at line 41 of file elst.cpp.

                               {
                                 //ptr to zapper functn
  ELIST_LINK *ptr;
  ELIST_LINK *next;

  if (!empty ()) {
    ptr = last->next;            //set to first
    last->next = nullptr;           //break circle
    last = nullptr;                 //set list empty
    while (ptr) {
      next = ptr->next;
      zapper(ptr);
      ptr = next;
    }
  }
}

internal_deep_copy()

void ELIST::internal_deep_copy	(	ELIST_LINK *(*)(ELIST_LINK *)	copier,
		const ELIST *	list
	)

length()

int32_t ELIST::length

(

)

const

Definition at line 90 of file elst.cpp.

                            {  // count elements
  ELIST_ITERATOR it(const_cast<ELIST*>(this));
  int32_t count = 0;

  for (it.mark_cycle_pt (); !it.cycled_list (); it.forward ())
    count++;
  return count;
}

shallow_copy()

void ELIST::shallow_copy ( ELIST *  from_list )

inline

Definition at line 140 of file elst.h.

                                        {  //beware destructors!!
      last = from_list->last;
    }

singleton()

bool ELIST::singleton ( ) const

inline

Definition at line 136 of file elst.h.

                           {
      return last ? (last == last->next) : false;
    }

sort()

void ELIST::sort

(

int

comparator const void *, const void *

)

Definition at line 108 of file elst.cpp.

                             {
  ELIST_ITERATOR it(this);
  int32_t count;
  ELIST_LINK **base;             //ptr array to sort
  ELIST_LINK **current;
  int32_t i;

  /* Allocate an array of pointers, one per list element */
  count = length ();
  base = (ELIST_LINK **) malloc (count * sizeof (ELIST_LINK *));

  /* Extract all elements, putting the pointers in the array */
  current = base;
  for (it.mark_cycle_pt (); !it.cycled_list (); it.forward ()) {
    *current = it.extract ();
    current++;
  }

  /* Sort the pointer array */
  qsort(base, count, sizeof(*base), comparator);

  /* Rebuild the list from the sorted pointers */
  current = base;
  for (i = 0; i < count; i++) {
    it.add_to_end (*current);
    current++;
  }
  free(base);
}

Friends And Related Function Documentation

ELIST_ITERATOR

friend class ELIST_ITERATOR

friend

Definition at line 115 of file elst.h.

---

The documentation for this class was generated from the following files:

• /usr/src/tesseract-ocr.master/src/ccutil/elst.h
• /usr/src/tesseract-ocr.master/src/ccutil/elst.cpp