gecoder-with-gecode 0.7.1 → 0.8.0

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

@@ -0,0 +1,86 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2006
+ *
+ *  Last modified:
+ *     $Date: 2007-12-05 11:37:37 +0100 (Wed, 05 Dec 2007) $ by $Author: tack $
+ *     $Revision: 5586 $
+ *
+ *  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_MAINWINDOW_HH
+#define GECODE_GIST_MAINWINDOW_HH
+
+#include "gecode/gist/treecanvas.hh"
+
+namespace Gecode { namespace Gist {
+  
+  class AboutGist : public QDialog {
+  public:
+    AboutGist(QWidget* parent = 0);
+  };
+  
+  /// \brief Main window for stand-alone %Gist
+  class GistMainWindow : public QMainWindow {
+    Q_OBJECT
+  protected:
+    /// The contained tree canvas
+    TreeCanvas c;
+    /// A menu bar
+    QMenuBar* menuBar;
+    /// About dialog
+    AboutGist aboutGist;
+    
+    /// Whether search is currently running
+    bool isSearching;
+    /// Status bar label for number of solutions
+    QLabel* solvedLabel;
+    /// Status bar label for number of failures
+    QLabel* failedLabel;
+    /// Status bar label for number of choices
+    QLabel* choicesLabel;
+    /// Status bar label for number of open nodes
+    QLabel* openLabel;
+  protected Q_SLOTS:
+    void statusChanged(const Statistics& stats, bool finished);
+    void about(void);
+    void preferences(void);
+  public:
+    /// Constructor
+    GistMainWindow(Space* root, Better* b, Gist::Inspector* gi);
+  protected:
+    void closeEvent(QCloseEvent* event);
+  };
+  
+}}
+
+#endif
+
+
+// STATISTICS: gist-any

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

@@ -0,0 +1,100 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2006
+ *
+ *  Last modified:
+ *     $Date: 2007-12-05 20:01:01 +0100 (Wed, 05 Dec 2007) $ by $Author: nikopp $
+ *     $Revision: 5601 $
+ *
+ *  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/node.hh"
+#include <cassert>
+
+namespace Gecode { namespace Gist {
+  
+  Node::Node(void) : parent(NULL), children(0), noOfChildren(-1) {}
+
+  Node::~Node(void) {
+    for (std::vector<Node*>::iterator i=children.begin(); i != children.end(); ++i)
+      delete *i;
+  }
+
+  Node*
+  Node::getParent(void) { return parent; }
+
+  Node*
+  Node::getChild(int n) { return children[n]; }
+    
+  bool
+  Node::isRoot(void) { return parent == NULL; }
+
+  int
+  Node::getDepth(void) { return isRoot() ? 1 : parent->getDepth() + 1; }
+    
+  void
+  Node::setNumberOfChildren(int n) {
+    assert(noOfChildren == -1);
+    noOfChildren = n;
+    children.resize(n);
+    for (int i=n; i--;)
+      children[i] = NULL;
+  }
+
+  void
+  Node::setChild(int n, Node* child) {
+    assert(noOfChildren > n);
+    children[n] = child;
+    child->parent = this;
+    child->alternative = n;
+  }
+
+  void
+  Node::addChild(Node* child) {
+    if(noOfChildren == -1)
+      setNumberOfChildren(0);
+
+    child->parent = this;
+    child->alternative = noOfChildren;
+    children.resize(++noOfChildren);
+    children[noOfChildren-1] = child;
+  }
+
+  int
+  Node::getNumberOfChildren(void) {
+    return noOfChildren;
+  }
+  
+  int
+  Node::getAlternative(void) {
+    return alternative;
+  }
+}}
+
+// STATISTICS: gist-any

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

@@ -0,0 +1,89 @@
+/*
+ *  Main authors:
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Guido Tack, 2006
+ *
+ *  Last modified:
+ *     $Date: 2007-11-27 17:43:23 +0100 (Tue, 27 Nov 2007) $ by $Author: nikopp $
+ *     $Revision: 5460 $
+ *
+ *  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_NODE_HH
+#define GECODE_GIST_NODE_HH
+
+#include <vector>
+
+namespace Gecode { namespace Gist {
+
+  /// \brief Base class for nodes of the search tree
+  class Node {
+  protected:
+    /// The parent of this node, or NULL for the root
+    Node* parent;
+    /// The children of this node
+    std::vector<Node*> children;
+    /// The number of children of this node
+    int noOfChildren;
+    /// The alternative number this node represents
+    int alternative;
+  public:
+    /// Default constructor
+    Node(void);
+    /// Destructor
+    virtual ~Node(void);
+    
+    /// Return the parent
+    Node* getParent(void);
+    /// Return child no \a n
+    Node* getChild(int n);
+    
+    /// Check if this node is the root of a tree
+    bool isRoot(void);
+    /// Compute the depth of this node
+    int getDepth(void);
+    
+    /// Set the number of children to \a n
+    void setNumberOfChildren(int n);
+    /// Set child number \a n to be \a child
+    void setChild(int n, Node* child);
+
+    /// Add new child node
+    void addChild(Node* child);
+
+    /// Return the number of children
+    int getNumberOfChildren(void);
+    /// Return which alternative this node represents
+    int getAlternative(void);
+  };
+
+}}
+
+#endif
+
+// STATISTICS: gist-any

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

@@ -0,0 +1,124 @@
+/*
+ *  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

@@ -0,0 +1,122 @@
+/*
+ *  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