Changeset 1849:a4d1362397fe in lemon-0.x for gui/graph_displayer_canvas-edge.cc

Timestamp:

12/06/05 11:53:38 (18 years ago)

Author:

Hegyi Péter

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2414

Message:

Notebook style is provided. Without opportunity to close tabs. :-) But with all other necessary things (I think).

File:

• gui/graph_displayer_canvas-edge.cc (modified) (8 diffs)

gui/graph_displayer_canvas-edge.cc

@@ -9 +9 @@
   min=edge_property_defaults[E_WIDTH];
   max=edge_property_defaults[E_WIDTH];
-  Graph::EdgeMap<double> actual_map((mainwin.mapstorage).graph,edge_property_defaults[E_WIDTH]);
+  Graph::EdgeMap<double> actual_map((mytab.mapstorage).graph,edge_property_defaults[E_WIDTH]);
   
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
         {
           double v=fabs(actual_map[i]);
@@ -45 +45 @@
   double min, max;
 
-  min=(mainwin.mapstorage).minOfEdgeMap(mapname);
-  max=(mainwin.mapstorage).maxOfEdgeMap(mapname);
-  actual_map=((mainwin.mapstorage).edgemap_storage)[mapname];
-
-  if(edge==INVALID)
-    {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+  min=(mytab.mapstorage).minOfEdgeMap(mapname);
+  max=(mytab.mapstorage).maxOfEdgeMap(mapname);
+  actual_map=((mytab.mapstorage).edgemap_storage)[mapname];
+
+  if(edge==INVALID)
+    {
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
         {
           double v=fabs((*actual_map)[i]);
@@ -84 +84 @@
   //green in RGB
   Graph::EdgeMap<double> * actual_map;
-  actual_map=((mainwin.mapstorage).edgemap_storage)[mapname];
+  actual_map=((mytab.mapstorage).edgemap_storage)[mapname];
 
   double max, min;
 
-  max=(mainwin.mapstorage).maxOfEdgeMap(mapname);
-  min=(mainwin.mapstorage).minOfEdgeMap(mapname);
-
-  if(edge==INVALID)
-    {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+  max=(mytab.mapstorage).maxOfEdgeMap(mapname);
+  min=(mytab.mapstorage).minOfEdgeMap(mapname);
+
+  if(edge==INVALID)
+    {
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
         {
           double w=(*actual_map)[i];
@@ -135 +135 @@
   //the minimum of the nodemap to the range of
   //green in RGB
-  Graph::EdgeMap<double> actual_map((mainwin.mapstorage).graph,edge_property_defaults[E_COLOR]);
+  Graph::EdgeMap<double> actual_map((mytab.mapstorage).graph,edge_property_defaults[E_COLOR]);
 
   double max, min;
@@ -144 +144 @@
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
         {
           double w=actual_map[i];
@@ -189 +189 @@
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
         {
           edgemap_to_edit=mapname;
-          double number=(*((mainwin.mapstorage).edgemap_storage)[mapname])[i];
+          double number=(*((mytab.mapstorage).edgemap_storage)[mapname])[i];
           
           std::ostringstream ostr;
@@ -203 +203 @@
   else
     {
-          double number=(*((mainwin.mapstorage).edgemap_storage)[mapname])[edge];
+          double number=(*((mytab.mapstorage).edgemap_storage)[mapname])[edge];
 
           std::ostringstream ostr;
@@ -224 +224 @@
   if(edge==INVALID)
     {
-      for (EdgeIt i((mainwin.mapstorage).graph); i!=INVALID; ++i)
+      for (EdgeIt i((mytab.mapstorage).graph); i!=INVALID; ++i)
         {
           edgemap_to_edit="";