From c5001d89b80c73e8edcff4ed3a9db715ad9c86ca Mon Sep 17 00:00:00 2001
From: fred <fred>
Date: Sat, 30 Nov 1996 10:59:51 +0000
Subject: [PATCH] flower-1.0.18

---
 flower/list.tcc | 113 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 113 insertions(+)
 create mode 100644 flower/list.tcc

diff --git a/flower/list.tcc b/flower/list.tcc
new file mode 100644
index 0000000000..55e1e20507
--- /dev/null
+++ b/flower/list.tcc
@@ -0,0 +1,113 @@
+#ifndef LIST_CC
+#define LIST_CC
+
+#include "list.hh"
+
+template<class T>
+List<T>::List(List const&src)
+{
+    set_empty();
+    // probably el stupido
+    for (Cursor<T> c(src); c.ok(); c++)
+	bottom().add(c);
+}
+
+template<class T>
+void
+List<T>::OK() const
+{
+    int i = size_;
+    Link<T> *lp = top_;
+    while (i--) {
+	assert(lp);
+	lp->OK();
+	lp = lp->next();
+    }
+    assert(!lp);
+     i = size_;
+    lp = bottom_;
+    while (i--) {
+	assert(lp);
+	lp->OK();
+	lp = lp->previous();
+    }
+    assert(!lp);
+}
+
+
+template<class T>
+List<T>::~List()
+{
+    Cursor<T> next(*this);
+    for ( Cursor<T> c( *this ); c.ok(); c = next ) {
+	next = c;
+	next++;
+	remove( c );
+    }
+}
+
+template<class T>
+void
+List<T>::add( const T& thing, Cursor<T> &after_me )
+{
+    if (!size_) {		// not much choice if list is empty
+        bottom_ = top_ = new Link<T>( thing );
+	if (!after_me.ok())
+	    after_me = bottom();
+    } else {			// add at aprioprate place
+	if (!after_me.ok())
+	    after_me = bottom();
+	Link<T> *p =after_me.pointer();
+	p->add(thing);
+	if (p == bottom_)	// adjust bottom_ if necessary.
+	    bottom_ = p->next();
+    }
+
+    size_++;
+}
+/** 
+
+  Procedure:
+  \begin{itemize}
+  \item if #after_me# is #ok()#, add after #after_me#, else
+  \item if list !empty simply add to bottom, else
+  \item list is empty: create first \Ref{Link} and initialize 
+  #bottom_# and #top_#.
+  \end{itemize}
+*/
+
+template<class T>
+void
+List<T>::insert( const T& thing, Cursor<T> &before_me )
+{
+    if (!size_) {
+	bottom_ = top_ = new Link<T>( thing );
+	if (!before_me.ok())
+	    before_me = top();
+	
+    } else {
+	if (!before_me.ok())
+	    before_me = top();
+	
+	Link<T> *p = before_me.pointer() ;
+
+	p->insert(thing);
+	if (p == top_)
+	    top_ = p->previous();
+    }
+
+    size_++;
+}
+
+
+template<class T>
+void
+List<T>::concatenate(List<T> const&s)
+{
+    Cursor<T> b(bottom());
+    for (Cursor<T> c(s); c.ok(); c++) {
+	b.add(c);
+	b++;
+    }
+}
+#endif
-- 
2.39.5