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_Clone<X>

public:
Adds element deeply using X(const X&).  Takes O(1) time.

   friend void           add_element_deep(List<X>* accumulator, const X* x)

Adds list deeply using X(const X&).  Takes O(adder->get_length()) time.

   friend void           add_list_deep(List<X>* accumulator, const List<X>* adder)

Creates a deep clone of list using X(const X&).  Takes O(list->get_length()) time.

   friend List<X>*       clone_deep(const List<X>* list);

Back to Linked List System II