post.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
00039
00040
00041
00042
00043
00044 #include <gecode/int/linear.hh>
00045 #include <gecode/int/distinct.hh>
00046
00047 namespace Gecode { namespace Int { namespace GCC {
00048
00049 template<class Card>
00051 class CardLess : public Support::Less<Card> {
00052 public:
00053 bool operator ()(const Card& x, const Card& y) {
00054 return x.card() < y.card();
00055 }
00056 };
00057
00062 template<class Card>
00063 ExecStatus
00064 postSideConstraints(Home home, ViewArray<IntView>& x, ViewArray<Card>& k) {
00065 CardLess<Card> cl;
00066 Support::quicksort(&k[0], k.size(), cl);
00067 Region r(home);
00068
00069 {
00070 int smin = 0;
00071 int smax = 0;
00072 for (int i = k.size(); i--; ) {
00073 GECODE_ME_CHECK((k[i].gq(home, 0)));
00074 GECODE_ME_CHECK((k[i].lq(home, x.size())));
00075 smin += k[i].min();
00076 smax += k[i].max();
00077 }
00078
00079
00080 if ((x.size() < smin) || (smax < x.size()))
00081 return ES_FAILED;
00082 }
00083
00084
00085 {
00086 int* v = r.alloc<int>(k.size());
00087 for (int i=k.size(); i--;)
00088 v[i]=k[i].card();
00089 Support::quicksort(v,k.size());
00090 for (int i=x.size(); i--; ) {
00091 Iter::Values::Array iv(v,k.size());
00092 GECODE_ME_CHECK(x[i].inter_v(home, iv, false));
00093 }
00094 }
00095
00096
00097
00098 {
00099
00100 int n_z = 0;
00101 for (int i=k.size(); i--;)
00102 if (k[i].max() == 0)
00103 n_z++;
00104
00105 if (n_z > 0) {
00106 int* z = r.alloc<int>(n_z);
00107 n_z = 0;
00108 int n_k = 0;
00109 for (int i=0; i<k.size(); i++)
00110 if (k[i].max() == 0) {
00111 z[n_z++] = k[i].card();
00112 } else {
00113 k[n_k++] = k[i];
00114 }
00115 k.size(n_k);
00116 Support::quicksort(z,n_z);
00117 for (int i=x.size(); i--;) {
00118 Iter::Values::Array zi(z,n_z);
00119 GECODE_ME_CHECK(x[i].minus_v(home,zi,false));
00120 }
00121 }
00122 }
00123
00124 if (Card::propagate) {
00125 Linear::Term<IntView>* t = r.alloc<Linear::Term<IntView> >(k.size());
00126 for (int i = k.size(); i--; ) {
00127 t[i].a=1; t[i].x=k[i].base();
00128 }
00129 Linear::post(home,t,k.size(),IRT_EQ,x.size(),ICL_BND);
00130 }
00131
00132 return ES_OK;
00133 }
00134
00135
00140 template<class Card>
00141 inline bool
00142 isDistinct(Home home, ViewArray<IntView>& x, ViewArray<Card>& k) {
00143 if (Card::propagate) {
00144 Region r(home);
00145 ViewRanges<IntView>* xrange = r.alloc<ViewRanges<IntView> >(x.size());
00146 for (int i = x.size(); i--; ){
00147 ViewRanges<IntView> iter(x[i]);
00148 xrange[i] = iter;
00149 }
00150 Iter::Ranges::NaryUnion drl(r, &xrange[0], x.size());
00151 if (static_cast<unsigned int>(k.size()) == Iter::Ranges::size(drl)) {
00152 for (int i=k.size(); i--;)
00153 if (k[i].min() != 1 || k[i].max() != 1)
00154 return false;
00155 return true;
00156 } else {
00157 return false;
00158 }
00159 } else {
00160 for (int i=k.size(); i--;)
00161 if (k[i].min() != 0 || k[i].max() != 1)
00162 return false;
00163 return true;
00164 }
00165 }
00166
00167 }}}
00168
00169