Generated on Sun Aug 26 2012 08:43:08 for Gecode by doxygen 1.8.1.1
not-first-not-last.hpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2009
8  *
9  * Last modified:
10  * $Date: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
11  * $Revision: 12022 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #include <algorithm>
39 
40 namespace Gecode { namespace Int { namespace Unary {
41 
42  template<class ManTaskView>
45  sort<ManTaskView,STO_LCT,true>(t);
46 
47  Region r(home);
48 
51  int* lct = r.alloc<int>(t.size());
52 
53  for (int i=t.size(); i--; )
54  lct[i] = t[i].lct();
55 
56  for (int i=0; i<t.size(); i++) {
57  int j = -1;
58  while (q() && (t[i].lct() > t[q.task()].lst())) {
59  if ((j >= 0) && (o.ect() > t[q.task()].lst()))
60  lct[q.task()] = std::min(lct[q.task()],t[j].lst());
61  j = q.task();
62  o.insert(j); ++q;
63  }
64  if ((j >= 0) && (o.ect(i) > t[i].lst()))
65  lct[i] = std::min(lct[i],t[j].lst());
66  }
67 
68  for (int i=t.size(); i--; )
69  GECODE_ME_CHECK(t[i].lct(home,lct[i]));
70 
71  return ES_OK;
72  }
73 
74  template<class ManTask>
78  GECODE_ES_CHECK(notlast(home,f));
80  return notlast(home,b);
81  }
82 
83  template<class OptTaskView>
86  sort<OptTaskView,STO_LCT,true>(t);
87 
88  Region r(home);
89 
92  int* lct = r.alloc<int>(t.size());
93 
94  for (int i=t.size(); i--; )
95  lct[i] = t[i].lct();
96 
97  for (int i=0; i<t.size(); i++) {
98  int j = -1;
99  while (q() && (t[i].lct() > t[q.task()].lst())) {
100  if ((j >= 0) && (o.ect() > t[q.task()].lst()))
101  lct[q.task()] = std::min(lct[q.task()],t[j].lst());
102  j = q.task();
103  o.insert(j); ++q;
104  }
105  if ((j >= 0) && (o.ect(i) > t[i].lst()))
106  lct[i] = std::min(lct[i],t[j].lst());
107  }
108 
109  int n = t.size();
110  for (int i=n; i--; )
111  if (t[i].mandatory()) {
112  GECODE_ME_CHECK(t[i].lct(home,lct[i]));
113  } else if (lct[i] < t[i].ect()) {
114  // GECODE_ME_CHECK(t[i].excluded(home));
115  // t[i].cancel(home,p); t[i]=t[--n];
116  }
117  t.size(n);
118 
119  return (t.size() < 2) ? home.ES_SUBSUMED(p) : ES_OK;
120  }
121 
122  template<class OptTask>
123  ExecStatus
126  GECODE_ES_CHECK(notlast(home,p,f));
128  return notlast(home,p,b);
129  }
130 
131 }}}
132 
133 // STATISTICS: int-prop