tree.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Christian Schulte, 2009
* Guido Tack, 2010
*
* 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.
*
*/
namespace Gecode { namespace Int {
forceinline int
plus(int x, int y) {
assert(y != -Limits::infinity);
return (x == -Limits::infinity) ? x : x+y;
}
forceinline long long int
plus(long long int x, long long int y) {
assert(y != -Limits::llinfinity);
return (x == -Limits::llinfinity) ? x : x+y;
}
template<class TaskView, class Node>
forceinline int
TaskTree<TaskView,Node>::n_inner(void) const {
return tasks.size()-1;
}
template<class TaskView, class Node>
forceinline int
TaskTree<TaskView,Node>::n_nodes(void) const {
return 2*tasks.size() - 1;
}
template<class TaskView, class Node>
forceinline bool
TaskTree<TaskView,Node>::n_root(int i) {
return i == 0;
}
template<class TaskView, class Node>
forceinline bool
TaskTree<TaskView,Node>::n_leaf(int i) const {
return i >= n_inner();
}
template<class TaskView, class Node>
forceinline int
TaskTree<TaskView,Node>::n_left(int i) {
return 2*(i+1) - 1;
}
template<class TaskView, class Node>
forceinline bool
TaskTree<TaskView,Node>::left(int i) {
assert(!n_root(i));
// A left node has an odd number
return (i & 1) != 0;
}
template<class TaskView, class Node>
forceinline int
TaskTree<TaskView,Node>::n_right(int i) {
return 2*(i+1);
}
template<class TaskView, class Node>
forceinline bool
TaskTree<TaskView,Node>::right(int i) {
assert(!n_root(i));
// A left node has an even number
return (i & 1) == 0;
}
template<class TaskView, class Node>
forceinline int
TaskTree<TaskView,Node>::n_parent(int i) {
return (i+1)/2 - 1;
}
template<class TaskView, class Node>
forceinline Node&
TaskTree<TaskView,Node>::leaf(int i) {
return node[_leaf[i]];
}
template<class TaskView, class Node>
forceinline const Node&
TaskTree<TaskView,Node>::root(void) const {
return node[0];
}
template<class TaskView, class Node>
forceinline void
TaskTree<TaskView,Node>::init(void) {
for (int i=n_inner(); i--; )
node[i].init(node[n_left(i)],node[n_right(i)]);
}
template<class TaskView, class Node>
forceinline void
TaskTree<TaskView,Node>::update(void) {
for (int i=n_inner(); i--; )
node[i].update(node[n_left(i)],node[n_right(i)]);
}
template<class TaskView, class Node>
forceinline void
TaskTree<TaskView,Node>::update(int i, bool l) {
if (l)
i = _leaf[i];
assert(!n_root(i));
do {
i = n_parent(i);
node[i].update(node[n_left(i)],node[n_right(i)]);
} while (!n_root(i));
}
template<class TaskView, class Node>
forceinline
TaskTree<TaskView,Node>::TaskTree(Region& r,
const TaskViewArray<TaskView>& t)
: tasks(t),
node(r.alloc<Node>(n_nodes())),
_leaf(r.alloc<int>(tasks.size())) {
// Compute a sorting map to order by non decreasing est
int* map = r.alloc<int>(tasks.size());
sort<TaskView,STO_EST,true>(map, tasks);
// Compute inverse of sorting map
for (int i=0; i<tasks.size(); i++)
_leaf[map[i]] = i;
r.free<int>(map,tasks.size());
// Compute index of first leaf in tree: the next larger power of two
int fst = 1;
while (fst < tasks.size())
fst <<= 1;
fst--;
// Remap task indices to leaf indices
for (int i=0; i<tasks.size(); i++)
if (_leaf[i] + fst >= n_nodes())
_leaf[i] += fst - tasks.size();
else
_leaf[i] += fst;
}
template<class TaskView, class Node> template<class Node2>
forceinline
TaskTree<TaskView,Node>::TaskTree(Region& r,
const TaskTree<TaskView,Node2>& t)
: tasks(t.tasks),
node(r.alloc<Node>(n_nodes())),
_leaf(r.alloc<int>(tasks.size())) {
for (int i=0; i<tasks.size(); i++)
_leaf[i] = t._leaf[i];
}
}}
// STATISTICS: int-prop
Gecode::Int::TaskTree::n_nodes
int n_nodes(void) const
Return number of nodes for balanced binary tree.
Definition tree.hpp:57
Gecode::Int::TaskTree::tasks
const TaskViewArray< TaskView > & tasks
The tasks from which the tree is computed.
Definition task.hh:369
Gecode::Int::TaskTree::n_right
static int n_right(int i)
Return index of right child of node i.
Definition tree.hpp:85
Gecode::Int::TaskTree::n_inner
int n_inner(void) const
Return number of inner nodes.
Definition tree.hpp:52
Gecode::Int::TaskTree::right
static bool right(int i)
Test whether node i is a right child.
Definition tree.hpp:90
Gecode::Int::TaskTree::n_left
static int n_left(int i)
Return index of left child of node i.
Definition tree.hpp:73
Gecode::Int::TaskTree::left
static bool left(int i)
Test whether node i is a left child.
Definition tree.hpp:78
Gecode::Int::TaskTree::init
void init(void)
Initialize tree after leaves have been initialized.
Definition tree.hpp:115
Gecode::Int::TaskTree::node
Node * node
Task nodes.
Definition task.hh:371
Gecode::Int::TaskTree::TaskTree
friend class TaskTree
Definition task.hh:366
Gecode::Int::TaskTree::n_leaf
bool n_leaf(int i) const
Whether node i is leaf.
Definition tree.hpp:68
Gecode::Int::TaskTree::root
const Node & root(void) const
Return root node.
Definition tree.hpp:109
Gecode::Int::TaskTree::n_parent
static int n_parent(int i)
Return index of parent of node i.
Definition tree.hpp:97
Gecode::Int::TaskTree::_leaf
int * _leaf
Map task number to leaf node number in right order.
Definition task.hh:373
Gecode::Int::TaskTree::leaf
Node & leaf(int i)
Return leaf for task i.
Definition tree.hpp:103
Gecode::Int::TaskTree::update
void update(void)
Update all inner nodes of tree after leaves have been initialized.
Definition tree.hpp:122
Gecode::Int::TaskTree::n_root
static bool n_root(int i)
Whether node i is index of root.
Definition tree.hpp:63
Gecode::Int::TaskViewArray
Task view array.
Definition task.hh:233
Gecode::Region
Handle to region.
Definition region.hpp:55
Gecode::Int::OffsetView::update
void update(const NoOffset &)
Integer-precision integer scale view.
Definition view.hpp:638
Gecode::Int::Limits::infinity
const int infinity
Infinity for integers.
Definition int.hh:120
Gecode::Int::Limits::llinfinity
const long long int llinfinity
Infinity for long long integers.
Definition int.hh:126
Gecode::Int
Finite domain integers.
Gecode::Int::sort
void sort(TaskViewArray< TaskView > &t)
Sort task view array t according to sto and inc (increasing or decreasing).
Definition sort.hpp:133
Gecode::Int::plus
int plus(int x, int y)
Safe addition in case x is -Int::Limits::infinity.
Definition tree.hpp:39
Gecode
Gecode toplevel namespace
forceinline
#define forceinline
Definition config.hpp:187