Generated on Thu Mar 22 10:39:32 2012 for Gecode by doxygen 1.6.3

node.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: 2010-08-11 12:41:24 +0200 (Wed, 11 Aug 2010) $ by $Author: tack $
00011  *     $Revision: 11340 $
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/support.hh>
00039 #include <gecode/gist/node.hh>
00040 #include <gecode/gist/visualnode.hh>
00041 #include <cassert>
00042 
00043 namespace Gecode { namespace Gist {
00044 
00045   void
00046   Node::setNumberOfChildren(unsigned int n, NodeAllocator& na) {
00047     assert(getTag() == UNDET);
00048     switch (n) {
00049     case 0:
00050       setTag(LEAF);
00051       break;
00052     case 1:
00053       childrenOrFirstChild = 
00054         reinterpret_cast<void*>(na.allocate(getIndex(na)) << 2);
00055       noOfChildren = 1;
00056       setTag(TWO_CHILDREN);
00057       break;
00058     case 2:
00059       {
00060         int idx = getIndex(na);
00061         childrenOrFirstChild =
00062           reinterpret_cast<void*>(na.allocate(idx) << 2);
00063         noOfChildren = -na.allocate(idx);
00064         setTag(TWO_CHILDREN);
00065       }
00066       break;
00067     default:
00068       {
00069         int idx = getIndex(na);
00070         noOfChildren = n;
00071         int* children = heap.alloc<int>(n);
00072         childrenOrFirstChild = static_cast<void*>(children);
00073         setTag(MORE_CHILDREN);
00074         for (unsigned int i=n; i--;)
00075           children[i] = na.allocate(idx);
00076       }
00077     }
00078   }
00079 
00080 }}
00081 
00082 // STATISTICS: gist-any