tree.hpp
Go to the documentation of this file.00001
00002
00003
00004
00005
00006
00007
00008
00009
00010
00011
00012
00013
00014
00015
00016
00017
00018
00019
00020
00021
00022
00023
00024
00025
00026
00027
00028
00029
00030
00031
00032
00033
00034
00035
00036
00037
00038 namespace Gecode { namespace Scheduling {
00039
00040 forceinline int
00041 plus(int x, int y) {
00042 assert(y != -Int::Limits::infinity);
00043 return (x == -Int::Limits::infinity) ? x : x+y;
00044 }
00045
00046 template<class TaskView, class Node>
00047 forceinline int
00048 TaskTree<TaskView,Node>::n_inner(void) const {
00049 return tasks.size()-1;
00050 }
00051 template<class TaskView, class Node>
00052 forceinline int
00053 TaskTree<TaskView,Node>::n_nodes(void) const {
00054 return 2*tasks.size() - 1;
00055 }
00056
00057 template<class TaskView, class Node>
00058 forceinline bool
00059 TaskTree<TaskView,Node>::n_root(int i) {
00060 return i == 0;
00061 }
00062 template<class TaskView, class Node>
00063 forceinline bool
00064 TaskTree<TaskView,Node>::n_leaf(int i) const {
00065 return i > n_inner();
00066 }
00067 template<class TaskView, class Node>
00068 forceinline int
00069 TaskTree<TaskView,Node>::n_left(int i) {
00070 return 2*(i+1) - 1;
00071 }
00072 template<class TaskView, class Node>
00073 forceinline int
00074 TaskTree<TaskView,Node>::n_right(int i) {
00075 return 2*(i+1);
00076 }
00077 template<class TaskView, class Node>
00078 forceinline int
00079 TaskTree<TaskView,Node>::n_parent(int i) {
00080 return (i+1)/2 - 1;
00081 }
00082
00083 template<class TaskView, class Node>
00084 forceinline Node&
00085 TaskTree<TaskView,Node>::leaf(int i) {
00086 return node[_leaf[i]];
00087 }
00088
00089 template<class TaskView, class Node>
00090 forceinline const Node&
00091 TaskTree<TaskView,Node>::root(void) const {
00092 return node[0];
00093 }
00094
00095 template<class TaskView, class Node>
00096 forceinline void
00097 TaskTree<TaskView,Node>::init(void) {
00098 for (int i=n_inner(); i--; )
00099 node[i].init(node[n_left(i)],node[n_right(i)]);
00100 }
00101
00102 template<class TaskView, class Node>
00103 forceinline void
00104 TaskTree<TaskView,Node>::update(int i, bool l) {
00105 if (l)
00106 i = _leaf[i];
00107 assert(!n_root(i));
00108 do {
00109 i = n_parent(i);
00110 node[i].update(node[n_left(i)],node[n_right(i)]);
00111 } while (!n_root(i));
00112 }
00113
00114 template<class TaskView, class Node>
00115 forceinline
00116 TaskTree<TaskView,Node>::TaskTree(Region& r,
00117 const TaskViewArray<TaskView>& t)
00118 : tasks(t),
00119 node(r.alloc<Node>(n_nodes())),
00120 _leaf(r.alloc<int>(tasks.size())) {
00121
00122 int* map = r.alloc<int>(tasks.size());
00123 sort<TaskView,STO_EST,true>(map, tasks);
00124
00125 for (int i=tasks.size(); i--; )
00126 _leaf[map[i]] = i;
00127 r.free<int>(map,tasks.size());
00128
00129 int fst = 1;
00130 while (fst < tasks.size())
00131 fst <<= 1;
00132 fst--;
00133
00134 for (int i=tasks.size(); i--; )
00135 if (_leaf[i] + fst >= n_nodes())
00136 _leaf[i] += fst - tasks.size();
00137 else
00138 _leaf[i] += fst;
00139 }
00140
00141 }}
00142
00143