RhodeCode

class BezierBase {

public:

protected:

  static Point conv(Point x,Point y,double t) {return (1-t)*x+t*y;}

};

    typedef typename Map::Key Key;

    typedef typename Map::Value Value;

  };

  template <typename Map>

    typedef typename MatrixMap::SecondKey SecondKey;

    typedef typename MatrixMap::Value Value;

  };

  template <typename MatrixMap>

///\file

///\brief Dijkstra algorithm.

#include <lemon/list_graph.h>

#include <lemon/bin_heap.h>

#include <lemon/bits/path_dump.h>

      }

      else for(ArcIt e(g);e!=INVALID;++e)

	if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0

	  if(_drawArrows) {

	    dim2::Point<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]);

	    double rn=_nodeSizes[g.target(e)]*_nodeScale;

		  << _arcColors[e].green() << ' '

		  << _arcColors[e].blue() << ' '

		  << _arcWidths[e]*_arcWidthScale << " l\n";

      os << "grestore\n";

    }

    if(_showNodes) {

      int n;

      for(n = first_node; 

	  n!=-1 && nodes[n].first_in == -1; 

      arc.id = (n == -1) ? -1 : nodes[n].first_in;

    }

	int n;

	for(n = nodes[arcs[arc.id].target].next;

	  n!=-1 && nodes[n].first_in == -1; 

	arc.id = (n == -1) ? -1 : nodes[n].first_in;

      }      

    }

///\brief Some utilities to write test programs.

#include <iostream>

///If \c rc is fail, writes an error message and exits.

///\code check(0==1,"This is obviously false.");\endcode will

///print something like this (and then exits).

///\verbatim file_name.cc:123: error: This is obviously false. \endverbatim

#define check(rc, msg) \

  if(!(rc)) { \

    std::cerr << __FILE__ ":" << __LINE__ << ": error: " << msg << std::endl; \