/* -*- C++ -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library

 *

 * Copyright (C) 2003-2006

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#include <limits>

#include <cmath>

#include <gtkmm.h>

#include <mapstorage.h>

#include <gui_writer.h>

#include <gui_reader.h>

#include <lemon/graph_to_eps.h>

const int i_d=20;

const double a_d=0.05;

const double p_d=40000;

MapStorage::MapStorage() : modified(false), file_name(""), arrow_pos_read_ok(false), iterations(i_d), attraction(a_d), propulsation(p_d), background_set(false)

{

  nodemap_storage["coordinates_x"] = new Graph::NodeMap<double>(graph);

  coords.setXMap(*nodemap_storage["coordinates_x"]);

  nodemap_storage["coordinates_y"] = new Graph::NodeMap<double>(graph);

  coords.setYMap(*nodemap_storage["coordinates_y"]);

  edgemap_storage["arrow_pos_x"] = new Graph::EdgeMap<double>(graph);

  arrow_pos.setXMap(*edgemap_storage["arrow_pos_x"]);

  edgemap_storage["arrow_pos_y"] = new Graph::EdgeMap<double>(graph);

  arrow_pos.setYMap(*edgemap_storage["arrow_pos_y"]);

  nodemap_storage["label"] = new Graph::NodeMap<double>(graph);

  edgemap_storage["label"] = new Graph::EdgeMap<double>(graph);

  nodemap_default["label"] = 1.0;

  edgemap_default["label"] = 1.0;

  active_nodemaps.resize(NODE_PROPERTY_NUM);

  for(int i=0;i<NODE_PROPERTY_NUM;i++)

    {

      active_nodemaps[i]="";

    }

  active_edgemaps.resize(EDGE_PROPERTY_NUM);

  for(int i=0;i<EDGE_PROPERTY_NUM;i++)

    {

      active_edgemaps[i]="";

    }

}

MapStorage::~MapStorage()

{

  for (std::map<std::string, Graph::NodeMap<double>*>::const_iterator it =

      nodemap_storage.begin(); it != nodemap_storage.end(); ++it)

  {

    delete it->second;

  }

  for (std::map<std::string, Graph::EdgeMap<double>*>::const_iterator it =

      edgemap_storage.begin(); it != edgemap_storage.end(); ++it)

  {

    delete it->second;

  }

}

int MapStorage::addNodeMap(const std::string & name, Graph::NodeMap<double> *nodemap, double default_value)

{

  if( nodemap_storage.find(name) == nodemap_storage.end() )

    {

      nodemap_storage[name]=nodemap;

      // set the maps default value

      nodemap_default[name] = default_value;

      //announce changement in maps

      signal_node_map.emit(name);

      return 0;

    }

  return 1;

}

void MapStorage::changeActiveMap(bool itisedge, int prop, std::string mapname)

{

  if(itisedge)

    {

      active_edgemaps[prop]=mapname;

    }

  else

    {

      active_nodemaps[prop]=mapname;

    }

  signal_prop.emit(itisedge, prop);

}

void MapStorage::broadcastActiveMaps()

{

  for(int i=0;i<NODE_PROPERTY_NUM;i++)

    {

      signal_map_win.emit(false, i, active_nodemaps[i]);

    }

  for(int i=0;i<EDGE_PROPERTY_NUM;i++)

    {

      signal_map_win.emit(true, i, active_edgemaps[i]);

    }

}

std::string MapStorage::getActiveEdgeMap(int prop)

{

  return active_edgemaps[prop];

}

std::string MapStorage::getActiveNodeMap(int prop)

{

  return active_nodemaps[prop];

}

std::vector<std::string> MapStorage::getEdgeMapList()

{

  std::vector<std::string> eml;

  eml.resize(edgemap_storage.size());

  int i=0;

  std::map< std::string,Graph::EdgeMap<double> * >::iterator emsi=beginOfEdgeMaps();

  for(;emsi!=endOfEdgeMaps();emsi++)

    {

      eml[i]=(emsi->first);

      i++;

    }

  return eml;

}

std::vector<std::string> MapStorage::getNodeMapList()

{

  std::vector<std::string> nml;

  nml.resize(nodemap_storage.size());

  int i=0;

  std::map< std::string,Graph::NodeMap<double> * >::iterator nmsi=beginOfNodeMaps();

  for(;nmsi!=endOfNodeMaps();nmsi++)

    {

      nml[i]=(nmsi->first);

      i++;

    }

  return nml;

}

sigc::signal<void, bool, int> MapStorage::signal_prop_ch()

{

  return signal_prop;

}

int MapStorage::addEdgeMap(const std::string & name, Graph::EdgeMap<double> *edgemap, double default_value)

{

  if( edgemap_storage.find(name) == edgemap_storage.end() )

    {

      edgemap_storage[name]=edgemap;

      // set the maps default value

      edgemap_default[name] = default_value;

      //announce changement in maps

      signal_edge_map.emit(name);

      return 0;

    }

  return 1;

}

double MapStorage::maxOfNodeMap(const std::string & name)

{

  double max=0;

  for (NodeIt j(graph); j!=INVALID; ++j)

  {

    if( (*nodemap_storage[name])[j]>max )

    {

      max=(*nodemap_storage[name])[j];

    }

  }

  return max;

}

double MapStorage::maxOfEdgeMap(const std::string & name)

{

  double max=0;

  for (EdgeIt j(graph); j!=INVALID; ++j)

  {

    if( (*edgemap_storage[name])[j]>max )

    {

      max=(*edgemap_storage[name])[j];

    }

  }

  return max;

}

double MapStorage::minOfNodeMap(const std::string & name)

{

  NodeIt j(graph);

  double min;

  if(j!=INVALID)

    {

      min=(*nodemap_storage[name])[j];

    }

  else

    {

      min=0;

    }

  for (; j!=INVALID; ++j)

  {

    if( (*nodemap_storage[name])[j]<min )

    {

      min=(*nodemap_storage[name])[j];

    }

  }

  return min;

}

double MapStorage::minOfEdgeMap(const std::string & name)

{

  EdgeIt j(graph);

  double min;

  if(j!=INVALID)

    {

      min=(*edgemap_storage[name])[j];

    }

  else

    {

      min=0;

    }

  for (EdgeIt j(graph); j!=INVALID; ++j)

  {

    if( (*edgemap_storage[name])[j]<min )

    {

      min=(*edgemap_storage[name])[j];

    }

  }

  return min;

}

int MapStorage::readFromFile(const std::string &filename)

{

  bool read_x = false;

  bool read_y = false;

  bool read_edge_id = false;

  try {

    LemonReader lreader(filename);

    ContentReader content(lreader);

    lreader.run();

    if (content.nodeSetNum() < 1)

    {

      Gtk::MessageDialog mdialog("No nodeset found in file.");

      mdialog.run();

      clear();

      return 1;

    }

    if (content.edgeSetNum() < 1)

    {

      Gtk::MessageDialog mdialog("No edgeset found in file.");

      mdialog.run();

      clear();

      return 1;

    }

    const std::vector<std::string>& nodeMapNames = content.nodeSetMaps(0);

    const std::vector<std::string>& edgeMapNames = content.edgeSetMaps(0);

    GraphReader<Graph> greader(filename, graph);

    for (std::vector<std::string>::const_iterator it = nodeMapNames.begin();

        it != nodeMapNames.end(); ++it)

    {

      if (*it == "coordinates_x")

      {

        read_x = true;

        //std::cout << "read X nodemap" << std::endl;

      }

      else if (*it == "coordinates_y")

      {

        read_y = true;

        //std::cout << "read Y nodemap" << std::endl;

      }

      else if (*it == "label")

      {

        //std::cout << "read id nodemap" << std::endl;

      }

      else

      {

        nodemap_storage[*it] = new Graph::NodeMap<double>(graph);

        //std::cout << "read " << *it << " nodemap" << std::endl;

      }

      greader.readNodeMap(*it, *nodemap_storage[*it]);

    }

    for (std::vector<std::string>::const_iterator it = edgeMapNames.begin();

        it != edgeMapNames.end(); ++it)

    {

      if (*it == "label")

      {

        //std::cout << "read id edgemap" << std::endl;

        read_edge_id = true;

      }

      else

      {

        edgemap_storage[*it] = new Graph::EdgeMap<double>(graph);

        //std::cout << "read " << *it << " edgemap" << std::endl;

      }

      greader.readEdgeMap(*it, *edgemap_storage[*it]);

    }

    GuiReader gui_reader(greader, this);

    greader.run();

  } catch (Exception& error) {

    Gtk::MessageDialog mdialog(error.what());

    mdialog.run();

    clear();

    return 1;

  }

  if (!read_edge_id)

  {

    edgemap_storage["label"] = new Graph::EdgeMap<double>(graph);

    int i = 1;

    for (EdgeIt e(graph); e != INVALID; ++e)

    {

      (*edgemap_storage["label"])[e] = i++;

    }

  }

  if (!read_x || !read_y)

  {

    int node_num = 0;

    for (NodeIt n(graph); n != INVALID; ++n)

    {

      node_num++;

    }

    const double pi = 3.142;

    double step = 2 * pi / (double) node_num;

    int i = 0;

    for (NodeIt n(graph); n != INVALID; ++n)

    {

      nodemap_storage["coordinates_x"]->set(n, 250.0 * std::cos(i * step));

      nodemap_storage["coordinates_y"]->set(n, 250.0 * std::sin(i * step));

      i++;

    }

  }

  if (!arrow_pos_read_ok)

  {

    arrow_pos_read_ok = false;

    for (EdgeIt e(graph); e != INVALID; ++e)

    {

      if (graph.source(e) == graph.target(e))

      {

        arrow_pos.set(e, coords[graph.source(e)] + XY(0.0, 80.0));

      }

      else

      {

        arrow_pos.set(e, (coords[graph.source(e)] + coords[graph.target(e)]) / 2.0);

      }

    }

  }

  // fill in the default values for the maps

  for (std::map<std::string, Graph::NodeMap<double>*>::const_iterator it =

      nodemap_storage.begin(); it != nodemap_storage.end(); ++it)

  {

    if ((it->first != "label") &&

        (it->first != "coordiantes_x") &&

        (it->first != "coordinates_y"))

    {

      nodemap_default[it->first] = 0.0;

    }

    else if (it->first == "label")

    {

      NodeIt n(graph);

      double max = (*nodemap_storage["label"])[n];

      for (; n != INVALID; ++n)

      {

        if ((*nodemap_storage["label"])[n] > max)

          max = (*nodemap_storage["label"])[n];

      }

      nodemap_default["label"] = max + 1.0;

    }

  }

  for (std::map<std::string, Graph::EdgeMap<double>*>::const_iterator it =

      edgemap_storage.begin(); it != edgemap_storage.end(); ++it)

  {

    if (it->first != "label")

    {

      edgemap_default[it->first] = 0.0;

    }

    else

    {

      double max = std::numeric_limits<double>::min();

      for (EdgeIt e(graph); e != INVALID; ++e)

      {

        if ((*edgemap_storage["label"])[e] > max)

          max = (*edgemap_storage["label"])[e];

      }

      if (max > std::numeric_limits<double>::min())

        edgemap_default["label"] = max + 1.0;

      else

        edgemap_default["label"] = 1.0;

    }

  }

  return 0;

}

void MapStorage::writeToFile(const std::string &filename)

{

  GraphWriter<Graph> gwriter(filename, graph);

  for (std::map<std::string, Graph::NodeMap<double>*>::const_iterator it =

      nodemap_storage.begin(); it != nodemap_storage.end(); ++it)

  {

    gwriter.writeNodeMap(it->first, *(it->second));

  }

  for (std::map<std::string, Graph::EdgeMap<double>*>::const_iterator it =

      edgemap_storage.begin(); it != edgemap_storage.end(); ++it)

  {

    if ((it->first != "arrow_pos_x") &&

        (it->first != "arrow_pos_y"))

    {

      gwriter.writeEdgeMap(it->first, *(it->second));

    }

  }

  GuiWriter gui_writer(gwriter, this);

  gwriter.run();

}

void MapStorage::clear()

{

  for (std::map<std::string, Graph::NodeMap<double>*>::iterator it =

      nodemap_storage.begin(); it != nodemap_storage.end(); ++it)

  {

    if ((it->first != "coordinates_x") &&

        (it->first != "coordinates_y") &&

        (it->first != "label"))

    {

      delete it->second;

      nodemap_storage.erase(it);

    }

  }

  for (std::map<std::string, Graph::EdgeMap<double>*>::iterator it =

      edgemap_storage.begin(); it != edgemap_storage.end(); ++it)

  {

    if ((it->first != "label") &&

        (it->first != "arrow_pos_x") &&

        (it->first != "arrow_pos_y"))

    {

      delete it->second;

      edgemap_storage.erase(it);

    }

  }

  for (std::map<std::string, double>::iterator it =

      nodemap_default.begin(); it != nodemap_default.end(); ++it)

  {

    if (it->first != "label")

      nodemap_default.erase(it);

  }

  for (std::map<std::string, double>::iterator it =

      edgemap_default.begin(); it != edgemap_default.end(); ++it)

  {

    if (it->first != "label")

      edgemap_default.erase(it);

  }

  graph.clear();

  file_name = "";

  modified = false;

  arrow_pos_read_ok = false;

  for(int i=0;i<NODE_PROPERTY_NUM;i++)

    {

      changeActiveMap(false, i, "");

      signal_map_win.emit(false, i, "");

    }

  for(int i=0;i<EDGE_PROPERTY_NUM;i++)

    {

      changeActiveMap(true, i, "");

      signal_map_win.emit(true, i, "");

    }

  attraction=a_d;

  propulsation=p_d;

  iterations=i_d;

  signal_design_win.emit(attraction, propulsation, iterations);

}

void MapStorage::ArrowPosReadOK()

{

  arrow_pos_read_ok = true;

}

void MapStorage::mapChanged(bool itisedge, std::string mapname)

{

  if(itisedge)

    {

      for(int i=0;i<EDGE_PROPERTY_NUM;i++)

	{

	  if(active_edgemaps[i]==mapname)

	    {

	      signal_prop.emit(itisedge, i);

	    }

	}

    }

  else

    {

      for(int i=0;i<NODE_PROPERTY_NUM;i++)

	{

	  if(active_nodemaps[i]==mapname)

	    {

	      signal_prop.emit(itisedge, i);

	    }

	}

    }

}

void MapStorage::get_design_data(double & attraction_p, double & propulsation_p, int & iterations_p)

{

  attraction_p=attraction;

  propulsation_p=propulsation;

  iterations_p=iterations;

}

void MapStorage::set_attraction(double attraction_p)

{

  attraction=attraction_p;

}

void MapStorage::set_propulsation(double propulsation_p)

{

  propulsation=propulsation_p;

}

void MapStorage::set_iteration(int iterations_p)

{

  iterations=iterations_p;

}

void MapStorage::redesign_data_changed()

{

  signal_design_win.emit(attraction, propulsation, iterations);

}

void MapStorage::setBackground(const std::string& file_name)

{

  if (file_name == background_file_name) return;

  if (file_name == "")

  {

    background_file_name = "";

    background_set = false;

  }

  else

  {

    background_file_name = file_name;

    background_set = true;

  }

  signal_background.emit();

}

const std::string& MapStorage::getBackgroundFilename()

{

  return background_file_name;

}

bool MapStorage::isBackgroundSet()

{

  return background_set;

}

double MapStorage::getBackgroundScaling()

{

  return background_scaling;

}

void MapStorage::setBackgroundScaling(double scaling)

{

  background_scaling = scaling;

}

void MapStorage::exportGraphToEPS(std::vector<bool> options, std::string filename, std::string shapemap)

{

  Graph::NodeMap<int> _shapes(graph, 0);

  Graph::NodeMap<int> _nodeColors(graph, 0);

  Graph::EdgeMap<int> _edgeColors(graph, 0);

  Graph::NodeMap<double> _nodeSizes(graph, 6.0);

  Graph::EdgeMap<double> _edgeWidths(graph, 1.0);

  bool _drawArrows=options[ARROWS];

  bool _enableParallel=options[PAR];

  std::string emptyString="";

  Graph::NodeMap<std::string> _nodeTextMap(graph,emptyString);

  //_nodeTextMap=(Graph::NodeMap<void> *)&emptyStringMap;

  if(options[N_MAPS])

    {

      if(active_nodemaps[N_RADIUS]!="")

	{

	  _nodeSizes=*(nodemap_storage[active_nodemaps[N_RADIUS]]);

	}

      if(active_nodemaps[N_COLOR]!="")

	{

	  for(NodeIt ni(graph);ni!=INVALID;++ni)

	    {

	      _nodeColors[ni]=(int)((*(nodemap_storage[active_nodemaps[N_COLOR]]))[ni]);

	    }

	}

      if(active_nodemaps[N_TEXT]!="")

	{

	  for(NodeIt ni(graph);ni!=INVALID;++ni)

	    {

	      std::ostringstream o;

	      o << ((*(nodemap_storage[active_nodemaps[N_TEXT]]))[ni]);

	      _nodeTextMap[ni]=o.str();	      

	    }

	}

    }

  if(options[E_MAPS])

    {

      if(active_edgemaps[E_WIDTH]!="")

	{

	  _edgeWidths=*(edgemap_storage[active_edgemaps[E_WIDTH]]);

	}

      if(active_edgemaps[E_COLOR]!="")

	{

	  for(EdgeIt ei(graph);ei!=INVALID;++ei)

	    {

	      _edgeColors[ei]=(int)((*(edgemap_storage[active_edgemaps[E_COLOR]]))[ei]);

	    }

	}

    }

  if(shapemap!="")

    {

      if((minOfNodeMap(shapemap)>=0)&&(maxOfNodeMap(shapemap)<=4))

	{

	  _shapes=*(nodemap_storage[shapemap]);

	}

    }

  Palette palette;

  Palette paletteW(true);

  graphToEps(graph,filename).

    title("Sample .eps figure (fits to A4)").

    copyright("(C) 2006 LEMON Project").

    absoluteNodeSizes().absoluteEdgeWidths().

    nodeScale(2).nodeSizes(_nodeSizes).

    coords(coords).

    nodeShapes(_shapes).

    nodeColors(composeMap(paletteW,_nodeColors)).

    edgeColors(composeMap(palette,_edgeColors)).

    edgeWidthScale(0.3).edgeWidths(_edgeWidths).

    nodeTexts(_nodeTextMap).nodeTextSize(7).

    enableParallel(_enableParallel).parEdgeDist(5).

    drawArrows(_drawArrows).arrowWidth(7).arrowLength(7).

    run();

}