Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.9 kB · 242 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Guido Tack <tack@gecode.org> * * Copyright: * Guido Tack, 2006 * * 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_VISUALNODE_HH#define GECODE_GIST_VISUALNODE_HH
#include <gecode/gist/spacenode.hh>#include <gecode/kernel.hh>#include <string>
namespace Gecode { namespace Gist {
/// \brief %Layout parameters class Layout { public: static const int dist_y = 38; static const int extent = 20; static const int minimalSeparation = 10; };
/// \brief Bounding box class BoundingBox { public: /// Left coordinate int left; /// Right coordinate int right; /// Default constructor BoundingBox(void) {} };
/// \brief %Extent representing shape of a tree at one depth level class Extent { public: /// Left extent int l; /// Right extent int r; /// Default constructor Extent(void); /// Construct with \a l0 and \a r0 Extent(int l0, int r0); /// Construct with width \a width Extent(int width);
/// Extend extent by \a deltaL and \a deltaR void extend(int deltaL, int deltaR); /// Move extent by \a delta void move(int delta); };
/// \brief The shape of a subtree class Shape { private: /// The depth of this shape int _depth; /// The bounding box of this shape BoundingBox bb; /// The shape is an array of extents, one for each depth level Extent shape[1]; /// Copy construtor Shape(const Shape&); /// Assignment operator Shape& operator =(const Shape&); /// Constructor Shape(void); public: /// Construct shape of depth \a d static Shape* allocate(int d); // Destruct static void deallocate(Shape*);
/// Static shape for leaf nodes static Shape* leaf; /// Static shape for hidden nodes static Shape* hidden;
/// Return depth of the shape int depth(void) const; /// Set depth of the shape to \a d (must be smaller than original depth) void setDepth(int d); /// Compute bounding box void computeBoundingBox(void); /// Return extent at depth \a i const Extent& operator [](int i) const; /// Return extent at depth \a i Extent& operator [](int i); /// Return if extent exists at \a depth, if yes return it in \a extent bool getExtentAtDepth(int depth, Extent& extent); /// Return bounding box const BoundingBox& getBoundingBox(void) const; };
/// \brief %Node class that supports visual layout class VisualNode : public SpaceNode { protected: /// Flags for VisualNodes enum VisualNodeFlags { DIRTY = SpaceNode::LASTBIT+1, CHILDRENLAYOUTDONE, HIDDEN, MARKED, ONPATH, BOOKMARKED };
/// Relative offset from the parent node int offset; /// Shape of this node Shape* shape;
/// Check if the \a x at depth \a depth lies in this subtree bool containsCoordinateAtDepth(int x, int depth); public: /// Construct with parent \a p VisualNode(int p); /// Constructor for root node from \a root and \a b VisualNode(Space* root);
/// Return if node is hidden bool isHidden(void); /// Set hidden state to \a h void setHidden(bool h); /// Set stop state to \a h void setStop(bool h); /// Mark all nodes up the path to the parent as dirty void dirtyUp(const NodeAllocator& na); /// Compute layout for the subtree of this node void layout(const NodeAllocator& na); /// Return offset off this node from its parent int getOffset(void); /// Set offset of this node, relative to its parent void setOffset(int n); /// Return whether node is marked as dirty bool isDirty(void); /// Mark node as dirty void setDirty(bool d); /// Return whether the layout of the node's children has been completed bool childrenLayoutIsDone(void); /// Mark node whether the layout of the node's children has been completed void setChildrenLayoutDone(bool d); /// Return whether node is marked bool isMarked(void); /// Set mark of this node void setMarked(bool m); /// Return whether node is bookmarked bool isBookmarked(void); /// Set bookmark of this node void setBookmarked(bool m); /// Set all nodes from the node to the root to be on the path void pathUp(const NodeAllocator& na); /// Set all nodes from the node to the root not to be on the path void unPathUp(const NodeAllocator& na); /// Return whether node is on the path bool isOnPath(void); /// Return the alternative of the child that is on the path (-1 if none) int getPathAlternative(const NodeAllocator& na); /// Set whether node is on the path void setOnPath(bool onPath0);
/// Toggle whether this node is hidden void toggleHidden(const NodeAllocator& na); /// Hide all failed subtrees of this node void hideFailed(const NodeAllocator& na, bool onlyDirty=false); /// Unhide all nodes in the subtree of this node void unhideAll(const NodeAllocator& na); /// Do not stop at this node void toggleStop(const NodeAllocator& na); /// Do not stop at any stop node in the subtree of this node void unstopAll(const NodeAllocator& na);
/// Return the shape of this node Shape* getShape(void); /// Set the shape of this node void setShape(Shape* s); /// Compute the shape according to the shapes of the children void computeShape(const NodeAllocator& na); /// Return the bounding box BoundingBox getBoundingBox(void); /// Signal that the status has changed void changedStatus(const NodeAllocator& na); /// Find a node in this subtree at coordinates \a x, \a y VisualNode* findNode(const NodeAllocator& na, int x, int y);
/// Create or clear branch labels in subtree void labelBranches(NodeAllocator& na, BestNode* curBest, int c_d, int a_d); /// Create or clear branch labels on path to root void labelPath(NodeAllocator& na, BestNode* curBest, int c_d, int a_d); /// Return string that describes the branch std::string getBranchLabel(NodeAllocator& na, VisualNode* p, const Choice* c, BestNode* curBest, int c_d, int a_d, int alt);
/// Return string that is used as a tool tip std::string toolTip(NodeAllocator& na, BestNode* curBest, int c_d, int a_d);
/// Free allocated memory void dispose(void); };
}}
#include <gecode/gist/node.hpp>#include <gecode/gist/spacenode.hpp>#include <gecode/gist/visualnode.hpp>
#endif
// STATISTICS: gist-any