gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.1.1/gecode/gist/visualisation/setvaritem.hh

@@ -1,73 +0,0 @@
-/*
- *  Main authors:
- *     Niko Paltzer <nikopp@ps.uni-sb.de>
- *
- *  Copyright:
- *     Niko Paltzer, 2007
- *
- *  Last modified:
- *     $Date: 2008-02-06 17:16:59 +0100 (Wed, 06 Feb 2008) $ by $Author: nikopp $
- *     $Revision: 6097 $
- *
- *  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_VISUALISATION_SETVARITEM_HH
-#define GECODE_GIST_VISUALISATION_SETVARITEM_HH
-
-#include <QtCore/QStack>
-#include <QtCore/QBitArray>
-
-#include "gecode/gist/visualisation/varitem.hh"
-
-namespace Gecode { namespace Gist { namespace Visualisation {
-
-class SetVarItem : public VarItem {
-  
-public:
-  SetVarItem(Reflection::VarSpec* spec, QGraphicsItem *parent = 0);
-
-  void display(Reflection::VarSpec* spec);
-  void displayOld(int pit); ///< Use to show the variable at point in time \a pit
-
-protected:
-  virtual void initGraphic(void); 
-  virtual void updateGraphic(void);
-  virtual void store(Reflection::VarSpec* spec); ///< store the information of the variable on the stack
-
-  QVector<QGraphicsRectItem*> domainItems;
-  QGraphicsTextItem* cardText;
-  int initMin; ///< Initial domain minimum
-  int initMax; ///< Initial domain maximum
-  int arraylength;
-  QStack<QBitArray> updates; ///< Collected updates
-  QStack<int> bound_updates;
-};
-
-}}}
-
-#endif
-
-// STATISTICS: gist-any

data/ext/gecode-2.1.1/gecode/gist/visualisation/vararrayitem.hh

@@ -1,123 +0,0 @@
-/*
- *  Main authors:
- *     Niko Paltzer <nikopp@ps.uni-sb.de>
- *
- *  Copyright:
- *     Niko Paltzer, 2007
- *
- *  Last modified:
- *     $Date: 2008-01-13 13:20:50 +0100 (Sun, 13 Jan 2008) $ by $Author: schulte $
- *     $Revision: 5857 $
- *
- *  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_VISUALISATION_VARARRAYITEM_HH
-#define GECODE_GIST_VISUALISATION_VARARRAYITEM_HH
-
-#include <QtGui/QGraphicsRectItem>
-#include <QtCore/QVector>
-
-#include "gecode/minimodel.hh"
-#include "gecode/gist/visualisation/varitem.hh"
-
-namespace Gecode { namespace Gist { namespace Visualisation {
-
-  template<class VarItem>
-  class VarArrayItem : public QGraphicsRectItem {
-
-  public:
-    VarArrayItem(QVector<Reflection::VarSpec*> specs, QGraphicsItem *parent = 0);
-
-    void display(QVector<Reflection::VarSpec*> specs); ///< Use to commit an update
-    void displayOld(int pit); ///< Use to show the variable at point in time pit
-
-  protected:
-    void initGraphic(QVector<Reflection::VarSpec*> specs); 
-
-    QVector<VarItem*> varItems;
-    int numberOfVariables;
-    int numberOfUpdates;
-    int current; ///< Number of actually drawn item
-  };
-
-  template<class VarItem>
-  VarArrayItem<VarItem>::VarArrayItem(QVector<Reflection::VarSpec*> specs, QGraphicsItem *parent)
-  : QGraphicsRectItem(parent)
-  , numberOfUpdates(0)
-  { 
-    numberOfVariables = specs.size();
-    initGraphic(specs);
-  }
-
-  template<class VarItem>
-  void
-  VarArrayItem<VarItem>::display(QVector<Reflection::VarSpec*> specs) {
-
-    for (int i = 0; i < numberOfVariables; ++i) {
-      varItems[i]->display(specs[i]);
-    }
-    current = ++numberOfUpdates;
-  }
-
-  template<class VarItem>
-  void
-  VarArrayItem<VarItem>::displayOld(int pit) {
-
-    if(pit > numberOfUpdates || pit < 0) {
-      return;
-    }
-
-    for (int j = 0; j < numberOfVariables; ++j) {
-      varItems[j]->displayOld(pit);
-    }
-
-    current = pit;
-  }
-
-  template<class VarItem>
-  void
-  VarArrayItem<VarItem>::initGraphic(QVector<Reflection::VarSpec*> specs) {
-
-    varItems.resize(numberOfVariables);
-
-    for (int i = 0; i < numberOfVariables; ++i) {
-
-      VarItem* item = new VarItem(specs[i], this);
-
-      if(i>0)
-        item->moveBy(0, childrenBoundingRect().height());
-
-      varItems[i] = item;
-    }
-
-    setRect(childrenBoundingRect());
-  }
-
-}}}
-
-#endif
-
-// STATISTICS: gist-any

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

@@ -1,303 +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/visualnode.hh"
-
-#include "gecode/gist/nodecursor.hh"
-#include "gecode/gist/nodevisitor.hh"
-
-namespace Gecode { namespace Gist {
-
-  const Shape VisualNode::singletonShape(Extent(20));
-  const Shape VisualNode::unitShape(Extent(20), &singletonShape);
-
-  VisualNode::VisualNode(int alternative, BestNode* b)
-  : SpaceNode(alternative, b), offset(0), dirty(true), 
-    childrenLayoutDone(false), hidden(false), marked(false)
-  , onPath(false), lastOnPath(false), pathAlternative(-1)
-  , heat(0)
-  , shape(NULL), box(0,0,0)
-  {}
-
-  VisualNode::VisualNode(Space* root, Better* b)
-  : SpaceNode(root, b), offset(0), dirty(true), childrenLayoutDone(false), 
-    hidden(false), marked(false)
-  , onPath(false), lastOnPath(false), pathAlternative(-1)
-  , heat(0)
-  , shape(NULL), box(0,0,0)
-  {}
-
-  VisualNode::~VisualNode(void) {
-    delete shape;
-  }
-
-  bool
-  VisualNode::isHidden(void) { return hidden; }
-
-  void
-  VisualNode::setHidden(bool h) { hidden = h; }
-
-  void
-  VisualNode::dirtyUp(void) {
-    VisualNode* cur = this;
-    while (!cur->dirty) {
-      cur->dirty = true;
-      if (! cur->isRoot()) {
-        cur = cur->getParent();
-      }
-    }
-  }
-  
-  void
-  VisualNode::layout(void) {
-    LayoutCursor l(this);
-    PostorderNodeVisitor<LayoutCursor> p(l);
-    while (p.next()) {}
-  }
-  
-  int
-  VisualNode::getOffset(void) { return offset; }
-  
-  void
-  VisualNode::setOffset(int n) { offset = n; }
-  
-  bool
-  VisualNode::isDirty(void) { return dirty; }
-
-  void
-  VisualNode::setDirty(bool d) { dirty = d; }
-
-  bool
-  VisualNode::childrenLayoutIsDone(void) { return childrenLayoutDone; }
-
-  void
-  VisualNode::setChildrenLayoutDone(bool d) { childrenLayoutDone = d; }
-
-  bool
-  VisualNode::isMarked(void) { return marked; }
-
-  void
-  VisualNode::setMarked(bool m) { marked = m; }
-  
-  unsigned char
-  VisualNode::getHeat(void) const { return heat; }
-
-  void
-  VisualNode::setHeat(unsigned char h) { heat = h; }
-  
-  bool
-  VisualNode::isOnPath(void) { return onPath; }
-  
-  bool
-  VisualNode::isLastOnPath(void) { return lastOnPath; }
-  
-  int
-  VisualNode::getPathAlternative(void) { return pathAlternative; }
-  
-  void
-  VisualNode::setPathInfos(bool onPath0, int pathAlternative0, bool lastOnPath0) {
-    assert(pathAlternative0 <= noOfChildren);
-    assert(!lastOnPath0 || pathAlternative0 == -1);
-
-    onPath = onPath0;
-    pathAlternative = pathAlternative0;
-    lastOnPath = lastOnPath0;
-  }
-  
-  void VisualNode::pathUp(void) {
-    if(isRoot())
-      return;
-    
-    VisualNode* p = getParent();
-    p->setPathInfos(true, alternative);
-    p->pathUp();
-  }
-
-  void VisualNode::unPathUp(void) {
-    if(isRoot())
-      return;
-    
-    setPathInfos(false);
-
-    VisualNode* p = getParent();
-    p->unPathUp();
-  }
-
-  void
-  VisualNode::toggleHidden(void) {
-    hidden = !hidden;
-    dirtyUp();
-  }
-  
-  void
-  VisualNode::hideFailed(void) {
-    HideFailedCursor c(this);
-    PreorderNodeVisitor<HideFailedCursor> v(c);
-    while (v.next()) {}
-    dirtyUp();
-  }
-  
-  void
-  VisualNode::unhideAll(void) {
-    UnhideAllCursor c(this);
-    PreorderNodeVisitor<UnhideAllCursor> v(c);
-    while (v.next()) {}
-    dirtyUp();
-  }
-  
-    
-  Shape*
-  VisualNode::getShape(void) { return shape; }
-  
-  void
-  VisualNode::setShape(Shape* s) { delete shape; shape = s; }
-  
-  void
-  VisualNode::setBoundingBox(BoundingBox b) { box = b; }
-
-  BoundingBox
-  VisualNode::getBoundingBox(void) { return box; }
-  
-  VisualNode*
-  VisualNode::createChild(int alternative) {
-    return new VisualNode(alternative, curBest);
-  }
-
-
-  void
-  VisualNode::changedStatus() { dirtyUp(); }
-  
-  VisualNode*
-  VisualNode::getParent() {
-    return static_cast<VisualNode*>(SpaceNode::getParent());
-  }
-
-  VisualNode*
-  VisualNode::getChild(int i) {
-    return static_cast<VisualNode*>(SpaceNode::getChild(i));
-  }
-
-  bool
-  VisualNode::containsCoordinateAtDepth(int x, int depth) {
-    if (x < box.left ||
-      x > box.right ||
-      depth > box.depth) {
-      return false;
-    }
-    Extent theExtent;
-     if (shape->getExtentAtDepth(depth, theExtent)) {
-      return (theExtent.l <= x && x <= theExtent.r);
-    } else {
-      return false;
-    }    
-  }
-
-  VisualNode*
-  VisualNode::findNode(int x, int y) {
-    VisualNode* cur = this;
-    int depth = y / 38;
-
-    while (depth > 0 && cur != NULL) {
-     if (cur->isHidden()) {
-        break;
-      }
-      VisualNode* oldCur = cur;
-      cur = NULL;
-      for (int i=0; i<oldCur->noOfChildren; i++) {
-        VisualNode* nextChild = oldCur->getChild(i);
-        int newX = x - nextChild->getOffset();
-        if (nextChild->containsCoordinateAtDepth(newX, depth - 1)) {
-          cur = nextChild;
-          x = newX;
-          break;
-        }
-      }
-      depth--;
-      y -= 38;
-    }
-   
-    if(cur == this && !cur->containsCoordinateAtDepth(x, 0)) {
-      return NULL;
-    }
-    return cur;
-  }
-
-  std::string
-  VisualNode::toolTip(void) {
-    if (getStatus() != BRANCH)
-      return "";
-    Space* ws = getSpace();
-    (void) ws->status();
-    assert(ws->status() == SS_BRANCH);
-    const BranchingDesc* d = ws->description();
-    Reflection::VarMap vm;
-    ws->getVars(vm, false);
-    std::string tt;
-    try {
-      Reflection::BranchingSpec bs = ws->branchingSpec(vm,d);
-      delete d;
-      tt = "Alternatives:\n";
-      for (unsigned int i=0; i<bs.alternatives(); i++) {
-        std::ostringstream is; is << i;
-        tt += is.str()+": ";
-        Reflection::ArrayArg& aa = *bs[i]->toArray();
-        for (int j=0; j<aa.size(); j++) {
-          if (aa[j]->isString()) {
-            tt += aa[j]->toString();
-          } else if (aa[j]->isVar()) {
-            int v = aa[j]->toVar();
-            if (vm.hasName(v))
-              tt += vm.name(v).toString();
-            else {
-              std::ostringstream vs; vs << v;
-              tt += "_v"+vs.str();
-            }
-          } else {
-            tt += "error in BranchingSpec";
-          }
-        }
-        if (i < bs.alternatives()-1)
-          tt += "\n";
-      }
-    } catch (Reflection::ReflectionException&) {
-      tt = "No information available";
-    }
-    return tt;
-  }
-  
-}}
-
-// STATISTICS: gist-any