1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
|
/* -*- 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
|
