davin.50webs.com/research
Bringing to you notes for the ages

Main Menu	Research Projects	Photo Album	Curriculum Vitae	The Greatest Artists
Email Address	Computer Games	Web Design	Java Training Wheels	The Fly (A Story)
Political Activism	Scruff the Cat	My Life Story	Smoking Cessation	Other Links
Debugging Macros	String Class I	Linked List System I	Java for C Programmers	Naming Convention
String Class II	How I use m4	Strings III	Symmetrical I/O	Linked Lists II
Run-Time Type Info	Virtual Methods	An Array System	Science & Religion	Submodes
Nested Packages	Memory Leaks	Garbage Collection	Internet & Poverty	What is Knowledge?
Limits of Evolution	Emacs Additions	Function Plotter	Romantic Love	The Next Big Thing
Science Fiction	Faster Compilation	Theory of Morality	Elisp Scoping	Elisp Advice
S.O.G.M. Pattern	Safe Properties	School Bullying	Charisma Control	Life and Death
Splitting Java	Multiple Ctors	Religious Beliefs	Conversation 1	Conversation 2
J.T.W. Language	Emacs Additions II	Build Counter	Relation Plotter	Lisp++ Language
Memory Leaks II	Super Constructors	CRUD Implementation	Order a Website Form	There Is An Afterlife
More Occam's Razor	C to Java Translator	Theory of Morality II

class List_Operator_Ee<X>

public:

Compares list contents deeply (i.e. in the sense of operator == (const X&,
const X&)).  Takes O(min(m,n)) time where m = list1.get_length() and n =
list2.get_length().
   friend bool           operator == (const List<X>& list1, const List<X>& list2);
   friend bool           operator != (const List<X>& list1, const List<X>& list2);

A more readable alternative to operator == (const List<X>&, const List<X>&).
   friend bool           lists_equal(const List<X>* list1, const List<X>* list2);

A more readable alternative to operator == (const X&, const X&).  Internally
calls operator == (const X&, const X&) but checks for null pointers first.
   friend bool           xs_equal(const X* x1, const X* x2)


Finds X values in the sense of operator == (const X&, const X&)
Each function takes O(n) time.  Argument "element" is a reference
rather than a pointer so that temporaries may be passed
as arguments.
   friend Node<X>*       find_element_equal(Node<X>* start, const X& element)
   friend const Node<X>* find_element_equal_const(const Node<X>* start, const X& element)


Deletes duplicates in the sense of operator == (const X&,const X&)
from the given list.  Takes O(n^2) time.
   friend void           delete_duplicates_equal(List<X>* list)

Same as above but deletes deeply.
   friend void           delete_duplicates_equal_deep(List<X>* list)

Back to Linked List System II