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 bool
00074 TaskTree<TaskView,Node>::left(int i) {
00075 assert(!n_root(i));
00076
00077 return (i & 1) != 0;
00078 }
00079 template<class TaskView, class Node>
00080 forceinline int
00081 TaskTree<TaskView,Node>::n_right(int i) {
00082 return 2*(i+1);
00083 }
00084 template<class TaskView, class Node>
00085 forceinline bool
00086 TaskTree<TaskView,Node>::right(int i) {
00087 assert(!n_root(i));
00088
00089 return (i & 1) == 0;
00090 }
00091 template<class TaskView, class Node>
00092 forceinline int
00093 TaskTree<TaskView,Node>::n_parent(int i) {
00094 return (i+1)/2 - 1;
00095 }
00096
00097 template<class TaskView, class Node>
00098 forceinline Node&
00099 TaskTree<TaskView,Node>::leaf(int i) {
00100 return node[_leaf[i]];
00101 }
00102
00103 template<class TaskView, class Node>
00104 forceinline const Node&
00105 TaskTree<TaskView,Node>::root(void) const {
00106 return node[0];
00107 }
00108
00109 template<class TaskView, class Node>
00110 forceinline void
00111 TaskTree<TaskView,Node>::init(void) {
00112 for (int i=n_inner(); i--; )
00113 node[i].init(node[n_left(i)],node[n_right(i)]);
00114 }
00115
00116 template<class TaskView, class Node>
00117 forceinline void
00118 TaskTree<TaskView,Node>::update(int i, bool l) {
00119 if (l)
00120 i = _leaf[i];
00121 assert(!n_root(i));
00122 do {
00123 i = n_parent(i);
00124 node[i].update(node[n_left(i)],node[n_right(i)]);
00125 } while (!n_root(i));
00126 }
00127
00128 template<class TaskView, class Node>
00129 forceinline
00130 TaskTree<TaskView,Node>::TaskTree(Region& r,
00131 const TaskViewArray<TaskView>& t)
00132 : tasks(t),
00133 node(r.alloc<Node>(n_nodes())),
00134 _leaf(r.alloc<int>(tasks.size())) {
00135
00136 int* map = r.alloc<int>(tasks.size());
00137 sort<TaskView,STO_EST,true>(map, tasks);
00138
00139 for (int i=tasks.size(); i--; )
00140 _leaf[map[i]] = i;
00141 r.free<int>(map,tasks.size());
00142
00143 int fst = 1;
00144 while (fst < tasks.size())
00145 fst <<= 1;
00146 fst--;
00147
00148 for (int i=tasks.size(); i--; )
00149 if (_leaf[i] + fst >= n_nodes())
00150 _leaf[i] += fst - tasks.size();
00151 else
00152 _leaf[i] += fst;
00153 }
00154
00155 }}
00156
00157