layoutcursor.cpp
Go to the documentation of this file.00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Guido Tack <tack@gecode.org> 00005 * 00006 * Copyright: 00007 * Guido Tack, 2006 00008 * 00009 * Last modified: 00010 * $Date: 2009-01-21 11:36:29 +0100 (Wed, 21 Jan 2009) $ by $Author: schulte $ 00011 * $Revision: 8083 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 #include <gecode/gist/layoutcursor.hh> 00039 00040 namespace Gecode { namespace Gist { 00041 00042 Shape* 00043 Shape::allocate(Extent e, const Shape* subShape) { 00044 Shape* shape = Shape::allocate(subShape->depth() + 1); 00045 (*shape)[0] = e; 00046 for (int i=subShape->depth(); i--;) { 00047 (*shape)[i+1] = (*subShape)[i]; 00048 } 00049 return shape; 00050 } 00051 00052 Shape* 00053 Shape::allocate(const Shape* subShape) { 00054 Shape* shape = Shape::allocate(subShape->depth()); 00055 for (int i=subShape->depth(); i--;) { 00056 (*shape)[i] = (*subShape)[i]; 00057 } 00058 return shape; 00059 } 00060 00061 bool 00062 Shape::getExtentAtDepth(int depth, Extent& extent) { 00063 if (depth > _depth) 00064 return false; 00065 extent = Extent(0,0); 00066 for (int i=0; i <= depth; i++) { 00067 Extent currentExtent = shape[i]; 00068 extent.l += currentExtent.l; 00069 extent.r += currentExtent.r; 00070 } 00071 return true; 00072 } 00073 00074 BoundingBox 00075 Shape::getBoundingBox(void) { 00076 int lastLeft = 0; 00077 int lastRight = 0; 00078 int left = 0; 00079 int right = 0; 00080 for (int i=0; i<_depth; i++) { 00081 Extent curExtent = shape[i]; 00082 lastLeft = lastLeft + curExtent.l; 00083 lastRight = lastRight + curExtent.r; 00084 if (lastLeft < left) 00085 left = lastLeft; 00086 if (lastRight > right) 00087 right = lastRight; 00088 } 00089 return BoundingBox(left, right); 00090 } 00091 00092 LayoutCursor::LayoutCursor(VisualNode* theNode) 00093 : NodeCursor<VisualNode>(theNode) {} 00094 00095 void 00096 LayoutCursor::processCurrentNode() { 00097 VisualNode* currentNode = node(); 00098 if (currentNode->isDirty()) { 00099 Extent extent(Layout::extent); 00100 unsigned int numberOfChildren = currentNode->getNumberOfChildren(); 00101 if (currentNode->isHidden()) { 00102 currentNode->setShape(Shape::hidden); 00103 } else if (numberOfChildren < 1) { 00104 currentNode->setShape(Shape::leaf); 00105 } else { 00106 currentNode->computeShape(startNode()); 00107 } 00108 currentNode->setDirty(false); 00109 } 00110 if (currentNode->getNumberOfChildren() >= 1) 00111 currentNode->setChildrenLayoutDone(true); 00112 } 00113 00114 }} 00115 00116 // STATISTICS: gist-any