Generated on Sat Feb 7 2015 02:01:18 for Gecode by doxygen 1.8.9.1
node.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Guido Tack <tack@gecode.org>
5  *
6  * Copyright:
7  * Guido Tack, 2006
8  *
9  * Last modified:
10  * $Date: 2010-08-11 12:41:24 +0200 (Wed, 11 Aug 2010) $ by $Author: tack $
11  * $Revision: 11340 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <gecode/support.hh>
39 #include <gecode/gist/node.hh>
41 #include <cassert>
42 
43 namespace Gecode { namespace Gist {
44 
45  void
47  assert(getTag() == UNDET);
48  switch (n) {
49  case 0:
50  setTag(LEAF);
51  break;
52  case 1:
53  childrenOrFirstChild =
54  reinterpret_cast<void*>(na.allocate(getIndex(na)) << 2);
55  noOfChildren = 1;
56  setTag(TWO_CHILDREN);
57  break;
58  case 2:
59  {
60  int idx = getIndex(na);
61  childrenOrFirstChild =
62  reinterpret_cast<void*>(na.allocate(idx) << 2);
63  noOfChildren = -na.allocate(idx);
64  setTag(TWO_CHILDREN);
65  }
66  break;
67  default:
68  {
69  int idx = getIndex(na);
70  noOfChildren = n;
71  int* children = heap.alloc<int>(n);
72  childrenOrFirstChild = static_cast<void*>(children);
73  setTag(MORE_CHILDREN);
74  for (unsigned int i=n; i--;)
75  children[i] = na.allocate(idx);
76  }
77  }
78  }
79 
80 }}
81 
82 // STATISTICS: gist-any
Node allocator.
Definition: node.hh:52
Heap heap
The single global heap.
Definition: heap.cpp:49
T * alloc(long unsigned int n)
Allocate block of n objects of type T from heap.
Definition: heap.hpp:400
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
void setNumberOfChildren(unsigned int n, NodeAllocator &na)
Set the number of children to n and initialize children.
Definition: node.cpp:46
int getIndex(const NodeAllocator &na) const
Return index of this node.
Definition: node.hpp:228
Gecode toplevel namespace