dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/task/array.hpp

@@ -0,0 +1,179 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2009
+ *
+ *  Last modified:
+ *     $Date: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
+ *     $Revision: 12022 $
+ *
+ *  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 {
+
+  /*
+   * Task array
+   */
+
+  template<class Task>
+  forceinline
+  TaskArray<Task>::TaskArray(void) 
+    : n(0), t(NULL) {}
+  template<class Task>
+  forceinline
+  TaskArray<Task>::TaskArray(Space& home, int n0)
+    : n(n0), t(home.alloc<Task>(n)) {
+    assert(n > 0);
+  }
+  template<class Task>
+  forceinline
+  TaskArray<Task>::TaskArray(const TaskArray<Task>& a)
+    : n(a.n), t(a.t) {}
+  template<class Task>
+  forceinline const TaskArray<Task>& 
+  TaskArray<Task>::operator =(const TaskArray<Task>& a) {
+    n=a.n; t=a.t;
+    return *this;
+  }
+
+  template<class Task>
+  forceinline int 
+  TaskArray<Task>::size(void) const {
+    return n;
+  }
+  template<class Task>
+  forceinline void
+  TaskArray<Task>::size(int n0) {
+    n = n0;
+  }
+
+  template<class Task>
+  forceinline Task& 
+  TaskArray<Task>::operator [](int i) {
+    assert((i >= 0) && (i < n));
+    return t[i];
+  }
+  template<class Task>
+  forceinline const Task& 
+  TaskArray<Task>::operator [](int i) const {
+    assert((i >= 0) && (i < n));
+    return t[i];
+  }
+
+  template<class Task>
+  inline void 
+  TaskArray<Task>::subscribe(Space& home, Propagator& p, PropCond pc) {
+    for (int i=n; i--; )
+      t[i].subscribe(home,p,pc);
+  }
+
+  template<class Task>
+  inline void 
+  TaskArray<Task>::cancel(Space& home, Propagator& p, PropCond pc) {
+    for (int i=n; i--; )
+      t[i].cancel(home,p,pc);
+  }
+
+  template<class Task>
+  forceinline void 
+  TaskArray<Task>::update(Space& home, bool share, TaskArray& a) {
+    n=a.n; t=home.alloc<Task>(n);
+    for (int i=n; i--; )
+      t[i].update(home,share,a.t[i]);
+  }
+
+
+  template<class Char, class Traits, class Task>
+  std::basic_ostream<Char,Traits>&
+  operator <<(std::basic_ostream<Char,Traits>& os, 
+              const TaskArray<Task>& t) {
+    std::basic_ostringstream<Char,Traits> s;
+    s.copyfmt(os); s.width(0);
+    s << '{';
+    if (t.size() > 0) {
+      s << t[0];
+      for (int i=1; i<t.size(); i++)
+        s << ", " << t[i];
+    }
+    s << '}';
+    return os << s.str();
+  }
+
+
+  /*
+   * Task view array
+   */
+  template<class TaskView>
+  forceinline
+  TaskViewArray<TaskView>::TaskViewArray(TaskArray<Task>& t0)
+    : t(t0) {}
+
+  template<class TaskView>
+  forceinline int 
+  TaskViewArray<TaskView>::size(void) const {
+    return t.size();
+  }
+
+  template<class TaskView>
+  forceinline void
+  TaskViewArray<TaskView>::size(int n) {
+    t.size(n);
+  }
+
+  template<class TaskView>
+  forceinline TaskView&
+  TaskViewArray<TaskView>::operator [](int i) {
+    return static_cast<TaskView&>(t[i]);
+  }
+  template<class TaskView>
+  forceinline const TaskView&
+  TaskViewArray<TaskView>::operator [](int i) const {
+    return static_cast<const TaskView&>(t[i]);
+  }
+
+  template<class Char, class Traits, class TaskView>
+  std::basic_ostream<Char,Traits>&
+  operator <<(std::basic_ostream<Char,Traits>& os, 
+              const TaskViewArray<TaskView>& t) {
+    std::basic_ostringstream<Char,Traits> s;
+    s.copyfmt(os); s.width(0);
+    s << '{';
+    if (t.size() > 0) {
+      s << t[0];
+      for (int i=1; i<t.size(); i++)
+        s << ", " << t[i];
+    }
+    s << '}';
+    return os << s.str();
+  }
+
+
+}}
+
+// STATISTICS: int-other

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/task/fwd-to-bwd.hpp

@@ -0,0 +1,102 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2009
+ *
+ *  Last modified:
+ *     $Date: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
+ *     $Revision: 12022 $
+ *
+ *  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 {
+
+  /*
+   * Task mapper: map forward task to view to backward task View
+   */
+  template<class TaskView>
+  forceinline int 
+  FwdToBwd<TaskView>::est(void) const {
+    return -TaskView::lct();
+  }
+  template<class TaskView>
+  forceinline int
+  FwdToBwd<TaskView>::ect(void) const {
+    return -TaskView::lst();
+  }
+  template<class TaskView>
+  forceinline int
+  FwdToBwd<TaskView>::lst(void) const {
+    return -TaskView::ect();
+  }
+  template<class TaskView>
+  forceinline int
+  FwdToBwd<TaskView>::lct(void) const {
+    return -TaskView::est();
+  }
+  template<class TaskView>
+  forceinline int
+  FwdToBwd<TaskView>::pmin(void) const {
+    return TaskView::pmin();
+  }
+  template<class TaskView>
+  forceinline int
+  FwdToBwd<TaskView>::pmax(void) const {
+    return TaskView::pmax();
+  }
+
+  template<class TaskView>
+  forceinline ModEvent 
+  FwdToBwd<TaskView>::est(Space& home, int n) {
+    return TaskView::lct(home,-n);
+  }
+  template<class TaskView>
+  forceinline ModEvent
+  FwdToBwd<TaskView>::ect(Space& home, int n) {
+    return TaskView::lst(home,-n);
+  }
+  template<class TaskView>
+  forceinline ModEvent
+  FwdToBwd<TaskView>::lst(Space& home, int n) {
+    return TaskView::ect(home,-n);
+  }
+  template<class TaskView>
+  forceinline ModEvent
+  FwdToBwd<TaskView>::lct(Space& home, int n) {
+    return TaskView::est(home,-n);
+  }
+  template<class TaskView>
+  forceinline ModEvent
+  FwdToBwd<TaskView>::norun(Space& home, int e, int l) {
+    return TaskView::norun(home,-l,-e);
+  }
+
+}}
+
+// STATISTICS: int-var

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/task/iter.hpp

@@ -0,0 +1,92 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2009
+ *
+ *  Last modified:
+ *     $Date: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
+ *     $Revision: 12022 $
+ *
+ *  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.
+ *
+ */
+
+#include <algorithm>
+
+namespace Gecode { namespace Int {
+
+  template<class TaskView, SortTaskOrder sto, bool inc>
+  forceinline
+  TaskViewIter<TaskView,sto,inc>::TaskViewIter(void) {}
+
+  template<class TaskView, SortTaskOrder sto, bool inc>
+  forceinline
+  TaskViewIter<TaskView,sto,inc>
+  ::TaskViewIter(Region& r, const TaskViewArray<TaskView>& t)
+    : map(r.alloc<int>(t.size())), i(t.size()-1) {
+    sort<TaskView,sto,!inc>(map,t);
+  }
+
+  template<class TaskView, SortTaskOrder sto, bool inc>
+  forceinline bool
+  TaskViewIter<TaskView,sto,inc>::operator ()(void) const {
+    return i>=0;
+  }
+  template<class TaskView, SortTaskOrder sto, bool inc>
+  forceinline int
+  TaskViewIter<TaskView,sto,inc>::left(void) const {
+    return i+1;
+  }
+  template<class TaskView, SortTaskOrder sto, bool inc>
+  forceinline void
+  TaskViewIter<TaskView,sto,inc>::operator ++(void) {
+    i--;
+  }
+
+  template<class TaskView, SortTaskOrder sto, bool inc>
+  forceinline int
+  TaskViewIter<TaskView,sto,inc>::task(void) const {
+    return map[i];
+  }
+
+
+  template<class OptTaskView, SortTaskOrder sto, bool inc>
+  forceinline
+  ManTaskViewIter<OptTaskView,sto,inc>
+  ::ManTaskViewIter(Region& r, const TaskViewArray<OptTaskView>& t) {
+    map = r.alloc<int>(t.size()); i=0;
+    for (int j=t.size(); j--; )
+      if (t[j].mandatory())
+        map[i++]=j;
+    sort<OptTaskView,sto,!inc>(map,i,t); 
+    i--;
+  }
+
+
+}}
+
+// STATISTICS: int-prop

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/task/man-to-opt.hpp

@@ -0,0 +1,100 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2009
+ *
+ *  Last modified:
+ *     $Date: 2011-05-26 00:56:41 +1000 (Thu, 26 May 2011) $ by $Author: schulte $
+ *     $Revision: 12022 $
+ *
+ *  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 {
+
+  template<class ManTask>
+  forceinline
+  ManToOptTask<ManTask>::ManToOptTask(void) {}
+
+  template<class ManTask>
+  forceinline bool
+  ManToOptTask<ManTask>::mandatory(void) const {
+    return _m.one();
+  }
+  template<class ManTask>
+  forceinline bool
+  ManToOptTask<ManTask>::excluded(void) const {
+    return _m.zero();
+  }
+  template<class ManTask>
+  forceinline bool
+  ManToOptTask<ManTask>::optional(void) const {
+    return _m.none();
+  }
+
+  template<class ManTask>
+  forceinline bool
+  ManToOptTask<ManTask>::assigned(void) const {
+    return ManTask::assigned() && _m.assigned();
+  }
+
+  template<class ManTask>
+  forceinline ModEvent 
+  ManToOptTask<ManTask>::mandatory(Space& home) {
+    return _m.one(home);
+  }
+  template<class ManTask>
+  forceinline ModEvent 
+  ManToOptTask<ManTask>::excluded(Space& home) {
+    return _m.zero(home);
+  }
+
+  template<class ManTask>
+  forceinline void
+  ManToOptTask<ManTask>::update(Space& home, bool share, 
+                                ManToOptTask<ManTask>& t) {
+    ManTask::update(home, share, t);
+    _m.update(home,share,t._m);
+  }
+
+  template<class ManTask>
+  forceinline void
+  ManToOptTask<ManTask>::subscribe(Space& home, Propagator& p, PropCond pc) {
+    ManTask::subscribe(home, p, pc);
+    _m.subscribe(home, p, Int::PC_BOOL_VAL);
+  }
+  template<class ManTask>
+  forceinline void
+  ManToOptTask<ManTask>::cancel(Space& home, Propagator& p, PropCond pc) {
+    _m.cancel(home, p, Int::PC_BOOL_VAL);
+    ManTask::cancel(home, p, pc);
+  }
+
+}}
+
+// STATISTICS: int-var