# HG changeset patch
# User alpar
# Date 1079730914 0
# Node ID 6bc65a8a99c6dd8a17bdb7c151a73e9dc61d672b
# Parent  9a37b8d02d7477c0d89d23aaac8e45d9dc41d448
get() -> operator[]()

diff -r 9a37b8d02d74 -r 6bc65a8a99c6 doc/maps.dox
--- a/doc/maps.dox	Fri Mar 19 20:58:39 2004 +0000
+++ b/doc/maps.dox	Fri Mar 19 21:15:14 2004 +0000
@@ -13,21 +13,14 @@
 \code
 class MyMap 
 {
-  double get(Graph::EdgeIt e) const { return M_PI;}
-};
-\endcode
-
-Or if we accept the new map style, it will look like this:
-
-\code
-class MyMap 
-{
   double operator[](Graph::EdgeIt e) const { return 1;}
 };
 \endcode
 
 
-A more complex example
+Here is a more complex example. It provides a length function which is obtained
+from a base length function modified by a potential difference.
+\todo Please improve on the english. 
 
 \code
 class MyLengthMap 
@@ -35,7 +28,9 @@
   const Graph::EdgeMap &ol;
   const Graph::NodeMap &pot;
   
-  double get(Graph::EdgeIt e) const { return ol.get(e)-pot.get(v)-pot.get(u);}
+  double operator[](Graph::EdgeIt e) const {
+    return ol.get(e)-pot.get(v)-pot.get(u);
+  }
   
   MyComplexMap(const Graph::EdgeMap &o,const Graph::NodeMap &p) :
     ol(o), pot(p);