Generated on Fri Oct 19 11:24:59 2018 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  *  This file is part of Gecode, the generic constraint
00010  *  development environment:
00011  *     http://www.gecode.org
00012  *
00013  * Permission is hereby granted, free of charge, to any person obtaining
00014  * a copy of this software and associated documentation files (the
00015  * "Software"), to deal in the Software without restriction, including
00016  * without limitation the rights to use, copy, modify, merge, publish,
00017  * distribute, sublicense, and/or sell copies of the Software, and to
00018  * permit persons to whom the Software is furnished to do so, subject to
00019  * the following conditions:
00020  *
00021  * The above copyright notice and this permission notice shall be
00022  * included in all copies or substantial portions of the Software.
00023  *
00024  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
00025  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
00026  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
00027  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
00028  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
00029  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
00030  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
00031  *
00032  */
00033 
00034 #include <gecode/support.hh>
00035 #include <gecode/gist/node.hh>
00036 #include <gecode/gist/visualnode.hh>
00037 #include <cassert>
00038 
00039 namespace Gecode { namespace Gist {
00040 
00041   void
00042   Node::setNumberOfChildren(unsigned int n, NodeAllocator& na) {
00043     assert(getTag() == UNDET);
00044     switch (n) {
00045     case 0:
00046       setTag(LEAF);
00047       break;
00048     case 1:
00049       childrenOrFirstChild =
00050         reinterpret_cast<void*>(
00051           static_cast<ptrdiff_t>(na.allocate(getIndex(na)) << 2));
00052       noOfChildren = 1;
00053       setTag(TWO_CHILDREN);
00054       break;
00055     case 2:
00056       {
00057         int idx = getIndex(na);
00058         childrenOrFirstChild =
00059           reinterpret_cast<void*>(
00060             static_cast<ptrdiff_t>(na.allocate(idx) << 2));
00061         noOfChildren = -na.allocate(idx);
00062         setTag(TWO_CHILDREN);
00063       }
00064       break;
00065     default:
00066       {
00067         int idx = getIndex(na);
00068         noOfChildren = n;
00069         int* children = heap.alloc<int>(n);
00070         childrenOrFirstChild = static_cast<void*>(children);
00071         setTag(MORE_CHILDREN);
00072         for (unsigned int i=n; i--;)
00073           children[i] = na.allocate(idx);
00074       }
00075     }
00076   }
00077 
00078 }}
00079 
00080 // STATISTICS: gist-any