gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.1.1/gecode/gist/nodecursor.cc

@@ -1,124 +0,0 @@
-/*
- *  Main authors:
- *     Guido Tack <tack@gecode.org>
- *
- *  Copyright:
- *     Guido Tack, 2006
- *
- *  Last modified:
- *     $Date: 2008-02-19 11:05:15 +0100 (Tue, 19 Feb 2008) $ by $Author: tack $
- *     $Revision: 6231 $
- *
- *  This file is part of Gecode, the generic constraint
- *  development environment:
- *     http://www.gecode.org
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
- * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
- * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
- * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- */
-
-#include "gecode/gist/nodecursor.hh"
-#include "gecode/gist/shapelist.hh"
-
-namespace Gecode { namespace Gist {
-    
-  LayoutCursor::LayoutCursor(VisualNode* theNode)
-   : NodeCursor<VisualNode>(theNode) {}
-    
-  bool
-  LayoutCursor::mayMoveDownwards(void) {
-    return NodeCursor<VisualNode>::mayMoveDownwards() &&
-           node()->isDirty() /*&&
-           (! n->isHidden() )*/;
-  }
-  
-  void
-  LayoutCursor::processCurrentNode() {
-    VisualNode* currentNode = node();
-    if (currentNode->isDirty()) {
-      Extent extent(20);
-      int numberOfChildren = currentNode->getNumberOfChildren();
-      Shape* shape;
-      if (numberOfChildren == -1) {
-        shape = new Shape(extent);
-      } else if (currentNode->isHidden()) {
-        shape = new Shape(&VisualNode::unitShape);
-      } else if (numberOfChildren == 0) {
-        shape = new Shape(extent);
-      } else {
-        ShapeList childShapes(numberOfChildren, 10);
-        for (int i=0; i<numberOfChildren; i++) {
-          childShapes[i]=currentNode->getChild(i)->getShape();
-        }
-
-        Shape* subtreeShape = 
-          childShapes.getMergedShape(currentNode->getStatus() == STEP);
-        subtreeShape->extend(- extent.l, - extent.r);
-        shape = new Shape(extent, subtreeShape);
-        delete subtreeShape;
-        for (int i=0; i<numberOfChildren; i++) {
-          currentNode->getChild(i)->setOffset(childShapes.getOffsetOfChild(i));
-        }
-      }
-      currentNode->setShape(shape);
-      currentNode->setBoundingBox(shape->getBoundingBox());
-      currentNode->setDirty(false);
-    }
-    if (currentNode->getNumberOfChildren() >= 1)
-      currentNode->setChildrenLayoutDone(true);
-  }
-  
-  HideFailedCursor::HideFailedCursor(VisualNode* root) : NodeCursor<VisualNode>(root) {}
-  
-  bool
-  HideFailedCursor::mayMoveDownwards(void) {
-    VisualNode* n = node();
-    return NodeCursor<VisualNode>::mayMoveDownwards() &&
-           (n->hasSolvedChildren() || n->getNoOfOpenChildren() > 0) &&
-           (! n->isHidden());
-  }
-  
-  void
-  HideFailedCursor::processCurrentNode(void) {
-    VisualNode* n = node();
-    if ((n->getStatus() == BRANCH ||
-         ((n->getStatus() == SPECIAL || n->getStatus() == STEP) && n->hasFailedChildren())) &&
-        !n->hasSolvedChildren() &&
-        n->getNoOfOpenChildren() == 0) {
-      n->setHidden(true);
-      n->setChildrenLayoutDone(false);
-      n->dirtyUp();
-    }
-  }
-
-  UnhideAllCursor::UnhideAllCursor(VisualNode* root) : NodeCursor<VisualNode>(root) {}
-  
-  void
-  UnhideAllCursor::processCurrentNode(void) {
-    VisualNode* n = node();
-    if (n->isHidden()) {
-      n->setHidden(false);
-      n->dirtyUp();
-    }
-  }
-  
-}}
-
-// STATISTICS: gist-any

data/ext/gecode-2.1.1/gecode/gist/nodecursor.hh

@@ -1,122 +0,0 @@
-/*
- *  Main authors:
- *     Guido Tack <tack@gecode.org>
- *
- *  Copyright:
- *     Guido Tack, 2006
- *
- *  Last modified:
- *     $Date: 2007-11-26 15:48:52 +0100 (Mon, 26 Nov 2007) $ by $Author: tack $
- *     $Revision: 5437 $
- *
- *  This file is part of Gecode, the generic constraint
- *  development environment:
- *     http://www.gecode.org
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
- * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
- * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
- * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- */
-
-#ifndef GECODE_GIST_NODECURSOR_HH
-#define GECODE_GIST_NODECURSOR_HH
-
-#include "gecode/gist/visualnode.hh"
-
-namespace Gecode { namespace Gist {
-  
-  /// \brief A cursor that can be run over a tree
-  template <class Node>
-  class NodeCursor {
-  private:
-    /// The node where the iteration starts
-    Node* _startNode;
-    /// The current node
-    Node* _node;
-  public:
-    /// Construct cursor, initially set to \a theNode
-    NodeCursor(Node* theNode);
-    /// Return current node
-    Node* node(void);
-    
-    /// \name Cursor interface
-    //@{
-    /// Test if the cursor may move to the parent node
-    bool mayMoveUpwards(void);
-    /// Move cursor to the parent node
-    void moveUpwards(void);
-    /// Test if cursor may move to the first child node
-    bool mayMoveDownwards(void);
-    /// Move cursor to the first child node
-    void moveDownwards(void);
-    /// Test if cursor may move to the first sibling
-    bool mayMoveSidewards(void);
-    /// Move cursor to the first sibling
-    void moveSidewards(void);    
-    //@}
-  };
-
-  /// \brief A cursor that computes a tree layout for VisualNodes
-  class LayoutCursor : public NodeCursor<VisualNode> {
-  public:
-    /// Constructor
-    LayoutCursor(VisualNode* theNode);
-
-    /// \name Cursor interface
-    //@{
-    /// Test if the cursor may move to the first child node
-    bool mayMoveDownwards(void);
-    /// Compute layout for current node
-    void processCurrentNode(void);
-    //@}
-  };
-
-  /// \brief A cursor that marks failed subtrees as hidden
-  class HideFailedCursor : public NodeCursor<VisualNode> {
-  public:
-    /// Constructor
-    HideFailedCursor(VisualNode* theNode);
-    /// \name Cursor interface
-    //@{
-    /// Test if the cursor may move to the first child node
-    bool mayMoveDownwards(void);
-    /// Process node
-    void processCurrentNode(void);
-    //@}
-  };
-  
-  /// \brief A cursor that marks all nodes in the tree as not hidden
-  class UnhideAllCursor : public NodeCursor<VisualNode> {
-  public:
-    /// Constructor
-    UnhideAllCursor(VisualNode* theNode);
-    /// \name Cursor interface
-    //@{
-    /// Process node
-    void processCurrentNode(void);
-    //@}
-  };
-  
-}}
-
-#include "gecode/gist/nodecursor.icc"
-
-#endif
-
-// STATISTICS: gist-any

data/ext/gecode-2.1.1/gecode/gist/nodecursor.icc

@@ -1,79 +0,0 @@
-/*
- *  Main authors:
- *     Guido Tack <tack@gecode.org>
- *
- *  Copyright:
- *     Guido Tack, 2006
- *
- *  Last modified:
- *     $Date: 2007-11-25 22:16:57 +0100 (Sun, 25 Nov 2007) $ by $Author: tack $
- *     $Revision: 5420 $
- *
- *  This file is part of Gecode, the generic constraint
- *  development environment:
- *     http://www.gecode.org
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
- * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
- * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
- * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- */
-
-namespace Gecode { namespace Gist {
-
-  template <class Node>
-  NodeCursor<Node>::NodeCursor(Node* theNode) : _startNode(theNode), _node(theNode) {}
-
-  template <class Node>
-  Node*
-  NodeCursor<Node>::node(void) { return _node; }
-
-  template <class Node>
-  bool
-  NodeCursor<Node>::mayMoveUpwards(void) { return _node != _startNode && !_node->isRoot(); }
-
-  template <class Node>
-  void
-  NodeCursor<Node>::moveUpwards(void) {
-    _node = static_cast<Node*>(_node->getParent());
-  }
-
-  template <class Node>
-  bool
-  NodeCursor<Node>::mayMoveDownwards(void) { return _node->getNumberOfChildren() > 0; }
-
-  template <class Node>
-  void
-  NodeCursor<Node>::moveDownwards(void) { _node = _node->getChild(0); }
-
-  template <class Node>
-  bool
-  NodeCursor<Node>::mayMoveSidewards(void) {
-    return (!_node->isRoot()) &&
-      (_node->getAlternative() < _node->getParent()->getNumberOfChildren() - 1);
-  }
-
-  template <class Node>
-  void
-  NodeCursor<Node>::moveSidewards(void) {
-    _node = static_cast<Node*>(_node->getParent()->getChild(_node->getAlternative()+1));
-  }
-
-}}
-
-// STATISTICS: gist-any

data/ext/gecode-2.1.1/gecode/gist/postscript.cc

@@ -1,543 +0,0 @@
-/*
- *  Main authors:
- *     Guido Tack <tack@gecode.org>
- *
- *  Copyright:
- *     Guido Tack, 2006
- *
- *  Last modified:
- *     $Date: 2008-03-04 13:54:11 +0100 (Tue, 04 Mar 2008) $ by $Author: tack $
- *     $Revision: 6405 $
- *
- *  This file is part of Gecode, the generic constraint
- *  development environment:
- *     http://www.gecode.org
- *
- * Permission is hereby granted, free of charge, to any person obtaining
- * a copy of this software and associated documentation files (the
- * "Software"), to deal in the Software without restriction, including
- * without limitation the rights to use, copy, modify, merge, publish,
- * distribute, sublicense, and/or sell copies of the Software, and to
- * permit persons to whom the Software is furnished to do so, subject to
- * the following conditions:
- *
- * The above copyright notice and this permission notice shall be
- * included in all copies or substantial portions of the Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
- * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
- * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
- * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
- * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
- * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
- * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
- *
- */
-
-#include "gecode/gist/postscript.hh"
-#include "gecode/gist/nodecursor.hh"
-#include "gecode/gist/nodevisitor.hh"
-#include <list>
-
-namespace Gecode { namespace Gist {
-  
-  /// \brief A postscript color
-  class PSColor {
-  public:
-    /// Red
-    double r;
-    /// Green
-    double g;
-    /// Blue
-    double b;
-    /// Constructor
-    PSColor(double r0, double g0, double b0);
-    /// Default constructor
-    PSColor(void);
-  };
-  
-  PSColor::PSColor(double r0, double g0, double b0) : r(r0), g(g0), b(b0) {}
-  PSColor::PSColor(void) : r(0.0), g(0.0), b(0.0) {}
-
-  /// \brief A postscript bounding box
-  class PSBoundingBox {
-  public:
-    /// The minimal x coordinate
-    int minx;
-    /// The maximal x coordinate
-    int maxx;
-    /// The minimal y coordinate
-    int miny;
-    /// The maximal y coordinate
-    int maxy;
-    /// Constructor
-    PSBoundingBox(int minx0, int maxx0, int miny0, int maxy0);
-    /// Merge with \a b
-    void merge(const PSBoundingBox& b);
-    /// Translate by \a scale, \a translatex and \a translatey
-    void translate(double scale, double translatex, double translatey);
-  };
-  
-  PSBoundingBox::PSBoundingBox(int minx0, int maxx0, int miny0, int maxy0) {
-    minx = minx0;
-    maxx = maxx0;
-    miny = miny0;
-    maxy = maxy0;    
-  }
-  
-  void
-  PSBoundingBox::merge(const PSBoundingBox& b) {
-    if (b.minx < minx) minx = b.minx;
-    if (b.maxx > maxx) maxx = b.maxx;
-    if (b.miny < miny) miny = b.miny;
-    if (b.maxy > maxy) maxy = b.maxy;    
-  }
-  
-  void
-  PSBoundingBox::translate(double scale, double translatex, double translatey) {
-    minx = static_cast<int> ((static_cast<double>(minx))*scale+translatex);
-    maxx = static_cast<int> ((static_cast<double>(maxx))*scale+translatex);
-    miny = static_cast<int> ((static_cast<double>(miny))*scale+translatey);
-    maxy = static_cast<int> ((static_cast<double>(maxy))*scale+translatey);    
-  }
-  
-  /// \brief Base class for a postscript path
-  class Path {
-  public:
-    /// Emit command for drawing the path to \a out
-    virtual void emit(std::ostream& out) = 0;
-    /// Compute bounding box of the path
-    virtual PSBoundingBox bb(void) = 0;
-    /// Destructor
-    virtual ~Path(void);
-  };
-  
-  Path::~Path(void) {}
-  
-  /// \brief A postscript path for drawing a triangle
-  class Triangle : public Path {
-  private:
-    int c1x, c1y, c2x, c2y, c3x, c3y;
-    PSColor outline;
-    PSColor fill;
-  
-  public:
-    Triangle(int c1x0, int c1y0, int c2x0, int c2y0, int c3x0, int c3y0,
-             const PSColor& outline0, const PSColor& fill0);
-    virtual void emit(std::ostream& out);
-    virtual PSBoundingBox bb(void);
-  };
-
-  Triangle::Triangle(int c1x0, int c1y0, int c2x0, int c2y0, int c3x0, int c3y0,
-                      const PSColor& outline0, const PSColor& fill0)
-    : c1x(c1x0), c1y(c1y0), c2x(c2x0), c2y(c2y0), c3x(c3x0), c3y(c3y0),
-      outline(outline0), fill(fill0) {}
-
-  void
-  Triangle::emit(std::ostream& out) {
-    out << "gsave\n";
-    out << c1x << " " << c1y << " moveto "<<c2x<<" "<<c2y<<" lineto ";
-    out << c3x<<" "<<c3y<<" lineto "<<c1x<<" "<<c1y<<" lineto\n";
-    out << fill.r<<" "<<fill.g<<" "<<fill.b<<" setrgbcolor\n";
-    out << "eofill\n";
-    out << c1x<<" "<<c1y<<" moveto "<<c2x<<" "<<c2y<<" lineto ";
-    out << c3x<<" "<<c3y<<" lineto "<<c1x<<" "<<c1y<<" lineto\n";
-    out << "1 setlinejoin 1 setlinecap\n";
-    out << "1 setlinewidth\n";
-    out << "[] 0 setdash\n";
-    out << outline.r<<" "<<outline.g<<" "<<outline.b<<" setrgbcolor\n";
-    out << "stroke\n";
-    out << "grestore\n";    
-  }
-
-  PSBoundingBox
-  Triangle::bb(void) {
-    return PSBoundingBox(std::min(std::min(c1x,c2x),c3x),
-                         std::max(std::max(c1x,c2x),c3x),
-                         std::min(std::min(c1y,c2y),c3y),
-                         std::max(std::max(c1y,c2y),c3y));
-   }
-  
-  /// \brief A postscript path for drawing a circle
-  class Circle : public Path {
-  private:
-    int cx, cy, r;
-    PSColor outline;
-    PSColor fill;
-
-  public:  
-    Circle(int cx0, int cy0, int r0, const PSColor& outline0, const PSColor& fill0);
-    virtual void emit(std::ostream& out);
-    virtual PSBoundingBox bb(void);
-  };
-
-  Circle::Circle(int cx0, int cy0, int r0, const PSColor& outline0, const PSColor& fill0)
-    : cx(cx0), cy(cy0), r(r0), outline(outline0), fill(fill0) {}
-
-  void
-  Circle::emit(std::ostream& out) {
-    out << "gsave\n";
-    out << "matrix currentmatrix\n";
-    out << cx << ".0 " << cy << ".0 translate " << r << ".0 " << r << 
-      ".0 scale 1 0 moveto 0 0 1 0 360 arc\n";
-    out << "setmatrix\n";
-    out << fill.r << " " << fill.g << " " << fill.b << " setrgbcolor\n";
-    out << "fill\n";
-    out << "matrix currentmatrix\n";
-    out << cx << ".0 " << cy << ".0 translate " << r << ".0 " << r << 
-      ".0 scale 1 0 moveto 0 0 1 0 360 arc\n";
-    out << "setmatrix\n";
-    out << "0 setlinejoin 2 setlinecap\n";
-    out << "1 setlinewidth\n";
-    out << "[] 0 setdash\n";
-    out << outline.r << " " << outline.g << " " << outline.b << " setrgbcolor\n";
-    out << "stroke\n";
-    out << "grestore\n";    
-  }
-  
-  PSBoundingBox
-  Circle::bb(void) {
-    return PSBoundingBox(cx-r,cx+r,cy-r,cy+r);    
-  }
-  
-  /// \brief A postscript path for drawing a diamond
-  class Diamond : public Path {
-  private:
-    int cx, cy, r;
-    PSColor outline;
-    PSColor fill;
-
-  public:  
-    Diamond(int cx0, int cy0, int r0, const PSColor& outline0, const PSColor& fill0);
-    
-    virtual void emit(std::ostream& out);
-    virtual PSBoundingBox bb(void);
-  };
-  
-  Diamond::Diamond(int cx0, int cy0, int r0, const PSColor& outline0, const PSColor& fill0)
-    : cx(cx0), cy(cy0), r(r0), outline(outline0), fill(fill0) {}
-
-  void
-  Diamond::emit(std::ostream& out) {
-    double c1x = static_cast<double> (cx);
-    double c1y = static_cast<double> (cy);
-    double c2x = c1x + static_cast<double> (r);
-    double c2y = c1y + static_cast<double> (r);
-    double c3x = c1x;
-    double c3y = c1y + static_cast<double> (2*r);
-    double c4x = c1x - static_cast<double> (r);
-    double c4y = c2y;
-
-    out << "gsave\n";
-    out << c1x << " " << c1y << " moveto " << c2x << " " << c2y << " lineto ";
-    out << c3x << " " << c3y << " lineto " << c4x << " " << c4y << " lineto ";
-    out << c1x << " " << c1y << " lineto\n";
-    out << fill.r << " " << fill.g << " " << fill.b << " setrgbcolor\n";
-    out << "eofill\n";
-    out << c1x << " " << c1y << " moveto " << c2x << " " << c2y << " lineto ";
-    out << c3x << " " << c3y << " lineto " << c4x << " " << c4y << " lineto ";
-    out << c1x << " " << c1y << " lineto\n";
-    out << "1 setlinejoin 1 setlinecap\n";
-    out << "1 setlinewidth\n";
-    out << "[] 0 setdash\n";
-    out << outline.r << " " << outline.g << " " << outline.b << " setrgbcolor\n";
-    out << "stroke\n";
-    out << "grestore\n";
-  }
-  
-  PSBoundingBox
-  Diamond::bb(void) {
-    return PSBoundingBox(cx-r,cx+r,cy-r,cy+r);
-  }
-
-  /// \brief A postscript path for drawing a rectangle
-  class Rectangle : public Path {
-    int c1x, c1y, c2x, c2y;
-    PSColor outline;
-    PSColor fill;
-
-  public:
-    Rectangle(int c1x0, int c1y0, int c2x0, int c2y0,
-              const PSColor& outline0, const PSColor& fill0);
-    
-    virtual void emit(std::ostream& out);
-    virtual PSBoundingBox bb(void);
-  };
-
-  Rectangle::Rectangle(int c1x0, int c1y0, int c2x0, int c2y0,
-                         const PSColor& outline0, const PSColor& fill0)
-    : c1x(c1x0), c1y(c1y0), c2x(c2x0), c2y(c2y0),
-      outline(outline0), fill(fill0) {}
-  
-  void
-  Rectangle::emit(std::ostream& out) {
-    out << "gsave\n";
-    out << c1x << ".0 " << c1y << ".0 moveto " << c1x << ".0 " << c2y << ".0 lineto ";
-    out << c2x << ".0 " << c2y << ".0 lineto " << c2x << ".0 " << c1y << 
-      ".0 lineto " << "closepath\n";
-    out << fill.r << " " << fill.g << " " << fill.b << " setrgbcolor\n";
-    out << "fill\n";
-    out << c1x << ".0 " << c1y << ".0 moveto " << c1x << ".0 " << c2y << ".0 lineto ";
-    out << c2x << ".0 " << c2y << ".0 lineto " << c2x << ".0 " << c1y << 
-      ".0 lineto " << "closepath\n";
-    out << "1 setlinejoin 1 setlinecap\n";
-    out << "1 setlinewidth\n";
-    out << "[] 0 setdash\n";
-    out << outline.r << " " << outline.g << " " << outline.b << " setrgbcolor\n";
-    out << "stroke\n";
-    out << "grestore\n";    
-  }
-  
-  PSBoundingBox
-  Rectangle::bb(void) {
-    return PSBoundingBox(std::min(c1x,c2x), std::max(c1x,c2x),
-                          std::min(c1y,c2y), std::max(c1y,c2y));    
-  }
-
-  /// \brief A postscript path for drawing a line
-  class Line : public Path {
-  private:
-    int ax, ay, bx, by;
-    PSColor color;
-  public:
-    Line(int ax0, int ay0, int bx0, int by0, const PSColor& color0);
-    
-    virtual void emit(std::ostream& out);
-    virtual PSBoundingBox bb(void);
-  };
-
-  Line::Line(int ax0, int ay0, int bx0, int by0, const PSColor& color0)
-    : ax(ax0), ay(ay0), bx(bx0), by(by0), color(color0) {}
-    
-  void
-  Line::emit(std::ostream& out) {
-    out << "gsave\n";
-    out << ax << ".0 " << ay << ".0 moveto\n";
-    out << bx << ".0 " << by << ".0 lineto\n";
-    out << "0 setlinecap\n";
-    out << "1 setlinejoin\n";
-    out << "1 setlinewidth\n";
-    out << "[] 0 setdash\n";
-    out << color.r << " " << color.g << " " << color.b << " setrgbcolor\n";
-    out << "stroke\n";
-    out << "grestore\n";    
-  }
-
-  PSBoundingBox
-  Line::bb(void) {
-    return PSBoundingBox(std::min(ax,bx), std::max(ax,bx),
-                          std::min(ay,by), std::max(ay,by));    
-  }
-
-  /// \brief Cursor that emits postscript for drawing a tree
-  class PostscriptCursor : public NodeCursor<VisualNode> {
-  protected:
-    static const int verticalOffset = 38;
-    static const PSColor black;
-    static const PSColor blue;
-    static const PSColor white;
-    static const PSColor yellow;
-    static const PSColor red;
-    static const PSColor green;
-    static const PSColor lightgray;
-    
-    int x, y;
-    
-    std::list<Path*>& ps;
-
-    void drawHidden(int x, int y, bool solved, bool open);
-    void drawFailed(int x, int y);
-    void drawSolved(int x, int y);
-    void drawChoice(int x, int y);
-    void drawUndetermined(int x, int y);
-    void drawSpecial(int x, int y);
- public:
-    PostscriptCursor(VisualNode* tree, std::list<Path*>& ps0);
-    void moveUpwards(void);
-    bool mayMoveDownwards(void);
-    void moveDownwards(void);
-    void moveSidewards(void);        
-    
-    void processCurrentNode(void);
-  };
-
-  const PSColor
-  PostscriptCursor::black(0.0,0.0,0.0);
-  const PSColor
-  PostscriptCursor::blue(0.0,0.36,0.63);
-  const PSColor
-  PostscriptCursor::white(1.0,1.0,1.0);
-  const PSColor
-  PostscriptCursor::yellow(1.0,1.0,0.0);
-  const PSColor
-  PostscriptCursor::red(0.85,0.14,0.11);
-  const PSColor
-  PostscriptCursor::green(0.04,0.46,0.27);
-  const PSColor
-  PostscriptCursor::lightgray(0.92,0.92,0.92);
-
-  PostscriptCursor::PostscriptCursor(VisualNode* tree, std::list<Path*>& ps0)
-    : NodeCursor<VisualNode>(tree), x(0), y(0), ps(ps0) {}
-
-  void
-  PostscriptCursor::moveUpwards() {
-    x = x - node()->getOffset();
-    y = y - verticalOffset;
-    NodeCursor<VisualNode>::moveUpwards();
-  }
-      
-  bool
-  PostscriptCursor::mayMoveDownwards() {
-      return (NodeCursor<VisualNode>::mayMoveDownwards() &&
-              ! node()->isHidden() );
-  }
-  
-  void
-  PostscriptCursor::moveDownwards() {
-      NodeCursor<VisualNode>::moveDownwards();
-      x = x + node()->getOffset();
-      y = y + verticalOffset;
-  }
-  
-  void
-  PostscriptCursor::moveSidewards() {
-      x = x - node()->getOffset();
-      NodeCursor<VisualNode>::moveSidewards();
-      x = x + node()->getOffset();
-  }
-
-  void
-  PostscriptCursor::drawHidden(int x, int y, bool solved, bool) {
-    PSColor fill = solved ? green : red;
-    ps.push_back(new Triangle(x,-y+10,x-16,-y-38,x+16,-y-38,black,fill));
-  }
-
-  void
-  PostscriptCursor::drawFailed(int x, int y) {
-    ps.push_back(new Rectangle(x-7,-y+7,x+7,-y-7,black,red));
-  }
-
-  void
-  PostscriptCursor::drawSolved(int x, int y) {
-    ps.push_back(new Diamond(x, -y-10, 10, black, green));
-  }
-
-  void
-  PostscriptCursor::drawChoice(int x, int y) {
-    ps.push_back(new Circle(x, -y, 10, black, blue));
-  }
-
-  void
-  PostscriptCursor::drawUndetermined(int x, int y) {
-    ps.push_back(new Circle(x, -y, 10, black, white));
-  }
-
-  void
-  PostscriptCursor::drawSpecial(int x, int y) {
-    ps.push_back(new Circle(x, -y, 10, black, yellow));
-  }
-
-  void
-  PostscriptCursor::processCurrentNode(void) {
-    VisualNode* currentNode = node();
-    int parentX = (x - currentNode->getOffset());
-    int myx = x;
-
-    if (! currentNode->isRoot()) {
-      if (currentNode->isHidden()) {
-        ps.push_back(new Line(myx, -y+10, parentX, -y+28, black));
-      } else {
-        switch(currentNode->getStatus()) {
-        case SOLVED:
-        case UNDETERMINED:
-        case BRANCH:
-        case STEP:
-        case SPECIAL:
-          ps.push_back(new Line(myx, -y+10, parentX, -y+28, black));
-          break;
-        case FAILED:
-          ps.push_back(new Line(myx, -y+7, parentX, -y+28, black));
-          break;
-        }
-      }
-    }
-    if (currentNode->isHidden()) {
-      drawHidden(myx, y,
-                  currentNode->hasSolvedChildren(),
-                  currentNode->isOpen());
-    } else {
-      switch(currentNode->getStatus()) {
-      case STEP:
-        // TODO nikopp: may draw sth. different
-      case SPECIAL:
-    	drawSpecial(myx,y);
-    	break;
-      case UNDETERMINED:
-        drawUndetermined(myx,y);
-        break;
-      case FAILED:
-        drawFailed(myx,y);
-        break;
-      case SOLVED:
-        drawSolved(myx,y);
-        break;
-      case BRANCH:
-        drawChoice(myx,y);
-        break;
-      }
-    }    
-  }
-  
-  void
-  Postscript::output(std::ostream& out, VisualNode* tree) {
-    PSBoundingBox b(100000,0,100000,0);
-
-    double scale = 0.72;
-    double translatex = 306.0;
-    double translatey = 396.0;
-    
-    int translatexI = 311;
-    int translateyI = 390;
-    
-    std::list<Path*> p;
-    PostscriptCursor cursor(tree, p);
-    PreorderNodeVisitor<PostscriptCursor> visitor(cursor);
-    while (visitor.next()) {}
-    
-    for (std::list<Path*>::iterator i=p.begin(); i != p.end(); ++i) {
-        b.merge((*i)->bb());
-    }
-    b.translate(scale, translatex, translatey);
-
-    out << "%!PS-Adobe-3.0 EPSF-3.0\n";
-    out << "%%Creator: Gecode/J PS library\n";
-    out << "%%For: Who knows?\n";
-    out << "%%Title: figure\n";
-    out << "%%CreationDate: Fri Jul 16 13:58:16 2004\n";
-    out << "%%BoundingBox: " << b.minx << " " << b.miny-10 << " " << 
-        b.maxx+10 << " " << b.maxy << "\n";
-    out << "%%Pages: 1\n";
-    out << "%%DocumentData: Clean7Bit\n";
-    out << "%%Orientation: Portrait\n";
-    out << "%%EndComments\n\n";
-    out << "%%BeginProlog\n";
-    out << "50 dict begin\n\n";
-    out << "%%EndProlog\n";
-    out << "%%Page: 1 1\n";
-    out << "save\n";
-    out << translatexI << " " << translateyI << " translate\n";
-    out << scale << " " << scale << " scale\n";
-
-    for (std::list<Path*>::iterator i=p.begin(); i != p.end(); ++i) {
-        (*i)->emit(out);
-        delete *i;
-    }
-    out << "restore showpage\n\n" << 
-              "%%Trailer\n" << 
-              "end\n" << 
-              "%%EOF\n";
-  }
-  
-}}
-
-// STATISTICS: gist-any