# HG changeset patch
# User alpar
# Date 1094721521 0
# Node ID 056fbb112b307d8b6f02fc615e8687ff7eb15bc4
# Parent  738abd9d1262af88dc21e3fa307a1caa97a3be51
Spell checking (Ereasable ->Erasable), affected also the code.

diff -r 738abd9d1262 -r 056fbb112b30 src/hugo/skeletons/graph.h
--- a/src/hugo/skeletons/graph.h	Thu Sep 09 07:09:41 2004 +0000
+++ b/src/hugo/skeletons/graph.h	Thu Sep 09 09:18:41 2004 +0000
@@ -456,22 +456,22 @@
 
       /// This function deletes all edges and nodes of the graph.
       /// It also frees the memory allocated to store them.
-      /// \todo It might belong to \c EraseableGraphSkeleton.
+      /// \todo It might belong to \c ErasableGraphSkeleton.
       void clear() { }
     };
 
-    /// An empty eraseable graph class.
+    /// An empty erasable graph class.
   
     /// This class is an extension of \c GraphSkeleton. It also makes it
     /// possible to erase edges or nodes.
-    class EraseableGraphSkeleton : public GraphSkeleton
+    class ErasableGraphSkeleton : public GraphSkeleton
     {
     public:
       /// Defalult constructor.
 
       /// Defalult constructor.
       ///
-      EraseableGraphSkeleton() { }
+      ErasableGraphSkeleton() { }
       /// Deletes a node.
 
       /// Deletes node \c n node.
diff -r 738abd9d1262 -r 056fbb112b30 src/test/graph_test.cc
--- a/src/test/graph_test.cc	Thu Sep 09 07:09:41 2004 +0000
+++ b/src/test/graph_test.cc	Thu Sep 09 09:18:41 2004 +0000
@@ -58,8 +58,8 @@
 template void checkCompileGraph<skeleton::GraphSkeleton>
 (skeleton::GraphSkeleton &);
 
-template void checkCompileErasableGraph<skeleton::EraseableGraphSkeleton>
-(skeleton::EraseableGraphSkeleton &);
+template void checkCompileErasableGraph<skeleton::ErasableGraphSkeleton>
+(skeleton::ErasableGraphSkeleton &);
 
 //Compile SmartGraph
 template void checkCompileGraph<SmartGraph>(SmartGraph &);
diff -r 738abd9d1262 -r 056fbb112b30 src/work/marci/graph_concept.h
--- a/src/work/marci/graph_concept.h	Thu Sep 09 07:09:41 2004 +0000
+++ b/src/work/marci/graph_concept.h	Thu Sep 09 09:18:41 2004 +0000
@@ -399,11 +399,11 @@
   };
 
 
-  /// \brief Node-eraseable graph concept.
+  /// \brief Node-erasable graph concept.
   ///
   /// A graph class which provides a function to 
   /// delete any of its nodes.
-  class NodeEraseableGraphConcept : virtual public GraphConcept
+  class NodeErasableGraphConcept : virtual public GraphConcept
   {
   public:
     /// Deletes a node.
@@ -411,11 +411,11 @@
   };
 
 
-  /// \brief Edge-eraseable graph concept.
+  /// \brief Edge-erasable graph concept.
   /// 
   /// A graph class which provides a function to delete any 
   /// of its edges.
-  class EdgeEraseableGraphConcept : virtual public GraphConcept
+  class EdgeErasableGraphConcept : virtual public GraphConcept
   {
   public:
     /// Deletes a node.
diff -r 738abd9d1262 -r 056fbb112b30 src/work/peter/edgepathgraph.h
--- a/src/work/peter/edgepathgraph.h	Thu Sep 09 07:09:41 2004 +0000
+++ b/src/work/peter/edgepathgraph.h	Thu Sep 09 09:18:41 2004 +0000
@@ -364,9 +364,9 @@
     };
   };
 
-  /// An empty eraseable graph class.
+  /// An empty erasable graph class.
   
-  /// This class provides all the common features of an \e eraseable graph
+  /// This class provides all the common features of an \e erasable graph
   /// structure,
   /// however completely without implementations and real data structures
   /// behind the interface.
@@ -384,7 +384,7 @@
   /// like @ref ListGraph or
   /// @ref SmartGraph will just refer to this structure.
   template <typename P, typename Gact, typename Gsub>
-  class EraseableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
+  class ErasableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>
   {
   public:
     /// Deletes a node.
@@ -393,9 +393,9 @@
     void erase(typename Gact::Edge e) {actuallayer.erase(e);}
 
     /// Defalult constructor.
-    EraseableEdgePathGraph() {}
+    ErasableEdgePathGraph() {}
     ///Copy consructor.
-    EraseableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
+    ErasableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}
   };
 
   
diff -r 738abd9d1262 -r 056fbb112b30 src/work/peter/hierarchygraph.h
--- a/src/work/peter/hierarchygraph.h	Thu Sep 09 07:09:41 2004 +0000
+++ b/src/work/peter/hierarchygraph.h	Thu Sep 09 09:18:41 2004 +0000
@@ -527,9 +527,9 @@
     };
   };
 
-  /// An empty eraseable graph class.
+  /// An empty erasable graph class.
 
-  /// This class provides all the common features of an \e eraseable graph
+  /// This class provides all the common features of an \e erasable graph
   /// structure,
   /// however completely without implementations and real data structures
   /// behind the interface.
@@ -546,7 +546,7 @@
   /// feature, the documentation of a real graph imlementation
   /// like @ref ListGraph or
   /// @ref SmartGraph will just refer to this structure.
-template < typename Gact, typename Gsub > class EraseableHierarchyGraph:public HierarchyGraph < Gact,
+template < typename Gact, typename Gsub > class ErasableHierarchyGraph:public HierarchyGraph < Gact,
     Gsub
     >
   {
@@ -563,11 +563,11 @@
     }
 
     /// Defalult constructor.
-    EraseableHierarchyGraph ()
+    ErasableHierarchyGraph ()
     {
     }
     ///Copy consructor.
-    EraseableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
+    ErasableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)
     {
     }
   };