diff -r 096d83158d41 -r 81b47fc5c444 lemon/lemon_writer.h
--- a/lemon/lemon_writer.h	Fri Mar 02 17:56:22 2007 +0000
+++ b/lemon/lemon_writer.h	Fri Mar 02 18:04:28 2007 +0000
@@ -472,22 +472,22 @@
     ///
     /// Add a new node map writer command for the writer.
     template <typename Map>
-    NodeSetWriter& writeNodeMap(std::string name, const Map& map) {
+    NodeSetWriter& writeNodeMap(std::string label, const Map& map) {
       return writeNodeMap<typename Traits::
-	template Writer<typename Map::Value>, Map>(name, map);
+	template Writer<typename Map::Value>, Map>(label, map);
     }
 
     /// \brief Add a new node map writer command for the writer.
     ///
     /// Add a new node map writer command for the writer.
-    template <typename Writer, typename Map>
-    NodeSetWriter& writeNodeMap(std::string name, const Map& map, 
-			    const Writer& writer = Writer()) {
+    template <typename ItemWriter, typename Map>
+    NodeSetWriter& writeNodeMap(std::string label, const Map& map, 
+			    const ItemWriter& iw = ItemWriter()) {
       checkConcept<concepts::ReadMap<Node, typename Map::Value>, Map>();
-      checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>();
+      checkConcept<_writer_bits::ItemWriter<typename Map::Value>,ItemWriter>();
       writers.push_back(
-	make_pair(name, new _writer_bits::
-		  MapWriter<Node, Map, Writer>(map, writer)));
+	make_pair(label, new _writer_bits::
+		  MapWriter<Node, Map, ItemWriter>(map, iw)));
       return *this;
     }
 
@@ -504,7 +504,7 @@
     ///
     /// Write the content of the section.
     virtual void write(std::ostream& os) {
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	if (writers[i].first == "label") {
 	  labelMap = writers[i].second;
 	  forceLabelMap = false;
@@ -528,7 +528,7 @@
       if (forceLabelMap) {
 	os << "label\t";
       }
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	os << writers[i].first << '\t';
       }
       os << std::endl;
@@ -537,7 +537,7 @@
 	if (forceLabelMap) {
 	  os << graph.id(*it) << '\t';
 	}
-	for (int i = 0; i < (int)writers.size(); ++i) {
+	for (int i = 0; i < int(writers.size()); ++i) {
 	  writers[i].second->write(os, *it);
 	  os << '\t';
 	}
@@ -661,22 +661,22 @@
     ///
     /// Add a new edge map writer command for the writer.
     template <typename Map>
-    EdgeSetWriter& writeEdgeMap(std::string name, const Map& map) {
+    EdgeSetWriter& writeEdgeMap(std::string label, const Map& map) {
       return writeEdgeMap<typename Traits::
-	template Writer<typename Map::Value>, Map>(name, map);
+	template Writer<typename Map::Value>, Map>(label, map);
     }
 
     /// \brief Add a new edge map writer command for the writer.
     ///
     /// Add a new edge map writer command for the writer.
-    template <typename Writer, typename Map>
-    EdgeSetWriter& writeEdgeMap(std::string name, const Map& map, 
-			    const Writer& writer = Writer()) {
+    template <typename ItemWriter, typename Map>
+    EdgeSetWriter& writeEdgeMap(std::string label, const Map& map, 
+			    const ItemWriter& iw = ItemWriter()) {
       checkConcept<concepts::ReadMap<Edge, typename Map::Value>, Map>();
-      checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>();
+      checkConcept<_writer_bits::ItemWriter<typename Map::Value>, ItemWriter>();
       writers.push_back(
-	make_pair(name, new _writer_bits::
-		  MapWriter<Edge, Map, Writer>(map, writer)));
+	make_pair(label, new _writer_bits::
+		  MapWriter<Edge, Map, ItemWriter>(map, iw)));
       return *this;
     }
 
@@ -696,7 +696,7 @@
       if (!nodeLabelWriter->isLabelWriter()) {
 	throw DataFormatError("Cannot find nodeset or label map");
       }
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	if (writers[i].first == "label") {
 	  labelMap = writers[i].second;
 	  forceLabelMap = false;
@@ -721,7 +721,7 @@
       if (forceLabelMap) {
 	os << "label\t";
       }
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	os << writers[i].first << '\t';
       }
       os << std::endl;
@@ -734,7 +734,7 @@
 	if (forceLabelMap) {
 	  os << graph.id(*it) << '\t';
 	}
-	for (int i = 0; i < (int)writers.size(); ++i) {
+	for (int i = 0; i < int(writers.size()); ++i) {
 	  writers[i].second->write(os, *it);
 	  os << '\t';
 	}
@@ -867,22 +867,22 @@
     ///
     /// Add a new undirected map writer command for the writer.
     template <typename Map>
-    UEdgeSetWriter& writeUEdgeMap(std::string name, const Map& map) {
+    UEdgeSetWriter& writeUEdgeMap(std::string label, const Map& map) {
       return writeUEdgeMap<typename Traits::
-	template Writer<typename Map::Value>, Map>(name, map);
+	template Writer<typename Map::Value>, Map>(label, map);
     }
 
     /// \brief Add a new undirected map writer command for the writer.
     ///
     /// Add a new undirected map writer command for the writer.
-    template <typename Writer, typename Map>
-    UEdgeSetWriter& writeUEdgeMap(std::string name, const Map& map, 
-                                  const Writer& writer = Writer()) {
+    template <typename ItemWriter, typename Map>
+    UEdgeSetWriter& writeUEdgeMap(std::string label, const Map& map, 
+                                  const ItemWriter& iw = ItemWriter()) {
       checkConcept<concepts::ReadMap<UEdge, typename Map::Value>, Map>();
-      checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>();
+      checkConcept<_writer_bits::ItemWriter<typename Map::Value>, ItemWriter>();
       writers.push_back(
-	make_pair(name, new _writer_bits::
-		  MapWriter<UEdge, Map, Writer>(map, writer)));
+	make_pair(label, new _writer_bits::
+		  MapWriter<UEdge, Map, ItemWriter>(map, iw)));
       return *this;
     }
 
@@ -890,23 +890,23 @@
     ///
     /// Add a new directed map writer command for the writer.
     template <typename Map>
-    UEdgeSetWriter& writeEdgeMap(std::string name, const Map& map) {
+    UEdgeSetWriter& writeEdgeMap(std::string label, const Map& map) {
       return writeEdgeMap<typename Traits::
-	template Writer<typename Map::Value>, Map>(name, map);
+	template Writer<typename Map::Value>, Map>(label, map);
     }
 
     /// \brief Add a new directed map writer command for the writer.
     ///
     /// Add a new directed map writer command for the writer.
-    template <typename Writer, typename Map>
-    UEdgeSetWriter& writeEdgeMap(std::string name, const Map& map, 
-                                 const Writer& writer = Writer()) {
+    template <typename ItemWriter, typename Map>
+    UEdgeSetWriter& writeEdgeMap(std::string label, const Map& map, 
+                                 const ItemWriter& iw = ItemWriter()) {
       checkConcept<concepts::ReadMap<Edge, typename Map::Value>, Map>();
-      checkConcept<_writer_bits::ItemWriter<typename Map::Value>, Writer>();
+      checkConcept<_writer_bits::ItemWriter<typename Map::Value>, ItemWriter>();
       writeUEdgeMap("+" + name, 
-                    _writer_bits::forwardComposeMap(graph, map), writer);
+                    _writer_bits::forwardComposeMap(graph, map), iw);
       writeUEdgeMap("-" + name, 
-                    _writer_bits::backwardComposeMap(graph, map), writer);
+                    _writer_bits::backwardComposeMap(graph, map), iw);
       return *this;
     }
 
@@ -926,7 +926,7 @@
       if (!nodeLabelWriter->isLabelWriter()) {
 	throw DataFormatError("Cannot find nodeset or label map");
       }
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	if (writers[i].first == "label") {
 	  labelMap = writers[i].second;
 	  forceLabelMap = false;
@@ -951,7 +951,7 @@
       if (forceLabelMap) {
 	os << "label\t";
       }
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	os << writers[i].first << '\t';
       }
       os << std::endl;
@@ -964,7 +964,7 @@
 	if (forceLabelMap) {
 	  os << graph.id(*it) << '\t';
 	}
-	for (int i = 0; i < (int)writers.size(); ++i) {
+	for (int i = 0; i < int(writers.size()); ++i) {
 	  writers[i].second->write(os, *it);
 	  os << '\t';
 	}
@@ -1080,8 +1080,8 @@
     /// \brief Add a node writer command for the NodeWriter.
     ///
     /// Add a node writer command for the NodeWriter.
-    void writeNode(const std::string& name, const Node& item) {
-      writers.push_back(make_pair(name, &item));
+    void writeNode(std::string label, const Node& item) {
+      writers.push_back(make_pair(label, &item));
     }
 
   protected:
@@ -1100,7 +1100,7 @@
       if (!labelWriter->isLabelWriter()) {
 	throw DataFormatError("Cannot find nodeset or label map");
       }
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	os << writers[i].first << ' ';
 	labelWriter->write(os, *(writers[i].second));
 	os << std::endl;
@@ -1164,8 +1164,8 @@
     /// \brief Add an edge writer command for the EdgeWriter.
     ///
     /// Add an edge writer command for the EdgeWriter.
-    void writeEdge(const std::string& name, const Edge& item) {
-      writers.push_back(make_pair(name, &item));
+    void writeEdge(std::string label, const Edge& item) {
+      writers.push_back(make_pair(label, &item));
     }
 
   protected:
@@ -1184,7 +1184,7 @@
       if (!labelWriter->isLabelWriter()) {
 	throw DataFormatError("Cannot find edgeset or label map");
       }
-      for (int i = 0; i < (int)writers.size(); ++i) {
+      for (int i = 0; i < int(writers.size()); ++i) {
 	os << writers[i].first << ' ';
 	labelWriter->write(os, *(writers[i].second));
 	os << std::endl;
@@ -1256,15 +1256,15 @@
     /// \brief Add an edge writer command for the UEdgeWriter.
     ///
     /// Add an edge writer command for the UEdgeWriter.
-    void writeEdge(const std::string& name, const Edge& item) {
-      edgeWriters.push_back(make_pair(name, &item));
+    void writeEdge(std::string label, const Edge& item) {
+      edgeWriters.push_back(make_pair(label, &item));
     }
 
     /// \brief Add an undirected edge writer command for the UEdgeWriter.
     ///
     /// Add an undirected edge writer command for the UEdgeWriter.
-    void writeUEdge(const std::string& name, const UEdge& item) {
-      uEdgeWriters.push_back(make_pair(name, &item));
+    void writeUEdge(std::string label, const UEdge& item) {
+      uEdgeWriters.push_back(make_pair(label, &item));
     }
 
   protected:
@@ -1286,12 +1286,12 @@
       if (!uEdgeLabelWriter->isLabelWriter()) {
 	throw DataFormatError("Cannot find undirected edgeset or label map");
       }
-      for (int i = 0; i < (int)uEdgeWriters.size(); ++i) {
+      for (int i = 0; i < int(uEdgeWriters.size()); ++i) {
 	os << uEdgeWriters[i].first << ' ';
 	uEdgeLabelWriter->write(os, *(uEdgeWriters[i].second));
 	os << std::endl;
       }
-      for (int i = 0; i < (int)edgeWriters.size(); ++i) {
+      for (int i = 0; i < int(edgeWriters.size()); ++i) {
 	os << edgeWriters[i].first << ' ';
 	edgeLabelWriter->write(os, *(edgeWriters[i].second));
 	os << std::endl;
@@ -1363,7 +1363,7 @@
     ///
     /// Add an attribute writer command for the writer.
     template <typename Value>
-    AttributeWriter& writeAttribute(const std::string& name, 
+    AttributeWriter& writeAttribute(std::string label, 
 				    const Value& value) {
       return 
 	writeAttribute<typename Traits::template Writer<Value> >(name, value);
@@ -1372,13 +1372,12 @@
     /// \brief Add an attribute writer command for the writer.
     ///
     /// Add an attribute writer command for the writer.
-    template <typename Writer, typename Value>
-    AttributeWriter& writeAttribute(const std::string& name, 
-				    const Value& value,
-				    const Writer& writer = Writer()) {
-      checkConcept<_writer_bits::ItemWriter<Value>, Writer>();
-      writers.push_back(make_pair(name, new _writer_bits::
-				  ValueWriter<Value, Writer>(value, writer)));
+    template <typename ItemWriter, typename Value>
+    AttributeWriter& writeAttribute(std::string label, const Value& value,
+				    const ItemWriter& iw = ItemWriter()) {
+      checkConcept<_writer_bits::ItemWriter<Value>, ItemWriter>();
+      writers.push_back(make_pair(label, new _writer_bits::
+				  ValueWriter<Value, ItemWriter>(value, iw)));
       return *this;
     }