Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
2.5 kB · 80 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081/* -*- 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. * */
#include <gecode/support.hh>#include <gecode/gist/node.hh>#include <gecode/gist/visualnode.hh>#include <cassert>
namespace Gecode { namespace Gist {
void Node::setNumberOfChildren(unsigned int n, NodeAllocator& na) { assert(getTag() == UNDET); switch (n) { case 0: setTag(LEAF); break; case 1: childrenOrFirstChild = reinterpret_cast<void*>( static_cast<ptrdiff_t>(na.allocate(getIndex(na)) << 2)); noOfChildren = 1; setTag(TWO_CHILDREN); break; case 2: { int idx = getIndex(na); childrenOrFirstChild = reinterpret_cast<void*>( static_cast<ptrdiff_t>(na.allocate(idx) << 2)); noOfChildren = -na.allocate(idx); setTag(TWO_CHILDREN); } break; default: { int idx = getIndex(na); noOfChildren = n; int* children = heap.alloc<int>(n); childrenOrFirstChild = static_cast<void*>(children); setTag(MORE_CHILDREN); for (unsigned int i=n; i--;) children[i] = na.allocate(idx); } } }
}}
// STATISTICS: gist-any