flower-1.0.26

diff --git a/flower/path.hh b/flower/path.hh
index 781e86f970da53430856ee4416b3aa8da1fd3684..4a36730dcd34b840aa1aeffb2879db1af9a280d5 100644 (file)
--- a/flower/path.hh
+++ b/flower/path.hh
@@ -5,6 +5,15 @@
 
 
 ///   searching directory for file.
+/**
+
+   Abstraction of PATH variable. An interface for searching input files.
+   Search a number of dirs for a file.
+
+   Should use kpathsea?
+   
+*/
+
 class File_path : private Array<String>
 {
 public:
@@ -18,15 +27,6 @@ public:
     Array<String>::push;
     void add(String str) { push(str); }
 };
-/**
-
-   Abstraction of PATH variable. An interface for searching input files.
-   Search a number of dirs for a file.
-
-   Should use kpathsea?
-   
-*/
-
 /// split path into its components
 void split_path(String path, String &drive, String &dirs, String &filebase, String &extension);
 

diff --git a/flower/pcursor.hh b/flower/pcursor.hh
index a6b99c9097526d771aa099289d1e0ec8541b850b..8498aa9e0d38bd52b132cdad61662339dfa2dd32 100644 (file)
--- a/flower/pcursor.hh
+++ b/flower/pcursor.hh
@@ -10,6 +10,11 @@
 
 
 /// cursor to go with PointerList
+/**
+  don't create PointerList<void*>'s.
+  This cursor is just an interface class for Cursor. It takes care of the
+  appropriate type casts
+ */
 template<class T>
 struct PCursor : private Cursor<void *> {
     friend class IPointerList<T>;
@@ -53,11 +58,6 @@ public:
        return Cursor<void*>::compare(a,b);
     }
 };
-/**
-  don't create PointerList<void*>'s.
-  This cursor is just an interface class for Cursor. It takes care of the
-  appropriate type casts
- */
 
 
 

diff --git a/flower/plist.hh b/flower/plist.hh
index f5913c1299b33a2268b736d424581fef62ec6117..61b51d97e3cfc81986bb8bd3ff5b1a062e46747d 100644 (file)
--- a/flower/plist.hh
+++ b/flower/plist.hh
@@ -10,6 +10,11 @@
 #include "list.hh"
 
 /// Use for list of pointers, e.g. PointerList<AbstractType*>.
+/**
+  This class does no deletion of the pointers, but it knows how to
+  copy itself (shallow copy). We could have derived it from List<T>,
+  but this design saves a lot of code dup; for all PointerLists in the
+  program only one parent List<void*> is instantiated.  */
 template<class T>
 class PointerList : public List<void *>
 {
@@ -24,19 +29,8 @@ class PointerList : public List<void *>
     void concatenate(PointerList<T> const &s) { List<void*>::concatenate(s); }
     PointerList() {}
 };
-/**
-  This class does no deletion of the pointers, but it knows how to
-  copy itself (shallow copy). We could have derived it from List<T>,
-  but this design saves a lot of code dup; for all PointerLists in the
-  program only one parent List<void*> is instantiated.  */
 
 ///  pl. which deletes pointers given to it.
-template<class T>
-struct IPointerList : public PointerList<T> {
-    IPointerList(const IPointerList&) { set_empty(); }
-    IPointerList() { }
-    ~IPointerList();
-};
 /**
   NOTE:
   
@@ -48,6 +42,12 @@ struct IPointerList : public PointerList<T> {
   You have to copy this yourself, or use the macro PointerList__copy
   
   */
+template<class T>
+struct IPointerList : public PointerList<T> {
+    IPointerList(const IPointerList&) { set_empty(); }
+    IPointerList() { }
+    ~IPointerList();
+};
 
 #define IPointerList__copy(T, to, from, op)   \
   for (PCursor<T> _pc_(from); _pc_.ok(); _pc_++)\