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