dep-selector-libgecode 1.0.0.alpha.0

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

@@ -0,0 +1,147 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2005
+ *
+ *  Last modified:
+ *     $Date: 2010-05-16 00:19:43 +1000 (Sun, 16 May 2010) $ by $Author: schulte $
+ *     $Revision: 10954 $
+ *
+ *  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 {
+
+  class IntVarArgs;
+  class IntVarArray;
+  class BoolVarArgs;
+  class BoolVarArray;
+  class IntArgs;
+  
+  /// Traits of %IntVarArgs
+  template<>
+  class ArrayTraits<VarArgArray<IntVar> > {
+  public:
+    typedef IntVarArgs StorageType;
+    typedef IntVar     ValueType;
+    typedef IntVarArgs ArgsType;
+  };
+
+  /// Traits of %IntVarArray
+  template<>
+  class ArrayTraits<VarArray<IntVar> > {
+  public:
+    typedef IntVarArray  StorageType;
+    typedef IntVar       ValueType;
+    typedef IntVarArgs   ArgsType;
+  };
+
+  /// Traits of %BoolVarArgs
+  template<>
+  class ArrayTraits<VarArgArray<BoolVar> > {
+  public:
+    typedef BoolVarArgs StorageType;
+    typedef BoolVar     ValueType;
+    typedef BoolVarArgs ArgsType;
+  };
+
+  /// Traits of %BoolVarArray
+  template<>
+  class ArrayTraits<VarArray<BoolVar> > {
+  public:
+    typedef BoolVarArray  StorageType;
+    typedef BoolVar       ValueType;
+    typedef BoolVarArgs   ArgsType;
+  };
+
+  /// Traits of %IntArgs
+  template<>
+  class ArrayTraits<PrimArgArray<int> > {
+  public:
+    typedef IntArgs StorageType;
+    typedef int     ValueType;
+    typedef IntArgs ArgsType;
+  };
+
+  /// Traits of %IntSetArgs
+  template<>
+  class ArrayTraits<ArgArray<IntSet> > {
+  public:
+    typedef IntSetArgs StorageType;
+    typedef IntSet     ValueType;
+    typedef IntSetArgs ArgsType;
+  };
+
+  /// Traits of %IntVarArray
+  template<>
+  class ArrayTraits<IntVarArray> {
+  public:
+    typedef IntVarArray  StorageType;
+    typedef IntVar       ValueType;
+    typedef IntVarArgs   ArgsType;
+  };
+  
+  /// Traits of %IntVarArgs
+  template<>
+  class ArrayTraits<IntVarArgs> {
+  public:
+    typedef IntVarArgs StorageType;
+    typedef IntVar     ValueType;
+    typedef IntVarArgs ArgsType;
+  };
+
+  /// Traits of %IntArgs
+  template<>
+  class ArrayTraits<IntArgs> {
+  public:
+    typedef IntArgs StorageType;
+    typedef int     ValueType;
+    typedef IntArgs ArgsType;
+  };
+  
+  /// Traits of %BoolVarArray
+  template<>
+  class ArrayTraits<BoolVarArray> {
+  public:
+    typedef BoolVarArray  StorageType;
+    typedef BoolVar       ValueType;
+    typedef BoolVarArgs   ArgsType;
+  };
+  
+  /// Traits of %BoolVarArgs
+  template<>
+  class ArrayTraits<BoolVarArgs> {
+  public:
+    typedef BoolVarArgs StorageType;
+    typedef BoolVar     ValueType;
+    typedef BoolVarArgs ArgsType;
+  };
+
+}
+
+// STATISTICS: int-other

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/array.cpp

@@ -0,0 +1,113 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2002
+ *
+ *  Last modified:
+ *     $Date: 2010-10-04 19:01:21 +1100 (Mon, 04 Oct 2010) $ by $Author: schulte $
+ *     $Revision: 11440 $
+ *
+ *  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 <gecode/int.hh>
+
+namespace Gecode {
+
+  IntArgs::IntArgs(int n, int e0, ...) : PrimArgArray<int>(n) {
+    va_list args;
+    va_start(args, e0);
+    a[0] = e0;
+    for (int i = 1; i < n; i++)
+      a[i] = va_arg(args,int);
+    va_end(args);
+  }
+  
+  IntVarArray::IntVarArray(Space& home, int n, int min, int max)
+    : VarArray<IntVar>(home,n) {
+    Int::Limits::check(min,"IntVarArray::IntVarArray");
+    Int::Limits::check(max,"IntVarArray::IntVarArray");
+    if (min > max)
+      throw Int::VariableEmptyDomain("IntVarArray::IntVarArray");
+    for (int i = size(); i--; )
+      x[i]._init(home,min,max);
+  }
+
+  IntVarArray::IntVarArray(Space& home, int n, const IntSet& s)
+    : VarArray<IntVar>(home,n) {
+    Int::Limits::check(s.min(),"IntVarArray::IntVarArray");
+    Int::Limits::check(s.max(),"IntVarArray::IntVarArray");
+    if (s.size() == 0)
+      throw Int::VariableEmptyDomain("IntVarArray::IntVarArray");
+    for (int i = size(); i--; )
+      x[i]._init(home,s);
+  }
+
+  BoolVarArray::BoolVarArray(Space& home, int n, int min, int max)
+    : VarArray<BoolVar>(home, n) {
+    if ((min < 0) || (max > 1))
+      throw Int::NotZeroOne("BoolVarArray::BoolVarArray");
+    if (min > max)
+      throw Int::VariableEmptyDomain("BoolVarArray::BoolVarArray");
+    for (int i = size(); i--; )
+      x[i]._init(home,min,max);
+  }
+
+  IntVarArgs::IntVarArgs(Space& home, int n, int min, int max)
+    : VarArgArray<IntVar>(n) {
+    Int::Limits::check(min,"IntVarArgs::IntVarArgs");
+    Int::Limits::check(max,"IntVarArgs::IntVarArgs");
+    if (min > max)
+      throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs");
+    for (int i = size(); i--; )
+      a[i]._init(home,min,max);
+  }
+
+  IntVarArgs::IntVarArgs(Space& home, int n, const IntSet& s)
+    : VarArgArray<IntVar>(n) {
+    Int::Limits::check(s.min(),"IntVarArgs::IntVarArgs");
+    Int::Limits::check(s.max(),"IntVarArgs::IntVarArgs");
+    if (s.size() == 0)
+      throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs");
+    for (int i = size(); i--; )
+      a[i]._init(home,s);
+  }
+
+  BoolVarArgs::BoolVarArgs(Space& home, int n, int min, int max)
+    : VarArgArray<BoolVar>(n) {
+    if ((min < 0) || (max > 1))
+      throw Int::NotZeroOne("BoolVarArgs::BoolVarArgs");
+    if (min > max)
+      throw Int::VariableEmptyDomain("BoolVarArgs::BoolVarArgs");
+    for (int i = size(); i--; )
+      a[i]._init(home,min,max);
+  }
+
+}
+
+// STATISTICS: int-post

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

@@ -0,0 +1,111 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2005
+ *
+ *  Last modified:
+ *     $Date: 2011-04-28 22:05:18 +1000 (Thu, 28 Apr 2011) $ by $Author: tack $
+ *     $Revision: 11968 $
+ *
+ *  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 {
+
+  /*
+   * Implementation
+   *
+   */
+
+  forceinline
+  IntArgs::IntArgs(void) : PrimArgArray<int>(0) {}
+
+  forceinline
+  IntArgs::IntArgs(int n) : PrimArgArray<int>(n) {}
+  
+  forceinline
+  IntArgs::IntArgs(const SharedArray<int>& x)
+    : PrimArgArray<int>(x.size()) {
+    for (int i=x.size(); i--;)
+      a[i] = x[i];
+  }
+  forceinline
+  IntArgs::IntArgs(const std::vector<int>& x)
+    : PrimArgArray<int>(static_cast<int>(x.size())) {
+    for (std::vector<int>::size_type i=x.size(); i--;)
+      a[i] = x[i];
+  }
+  
+  forceinline
+  IntArgs::IntArgs(int n, const int* e) : PrimArgArray<int>(n, e) {}
+  
+  forceinline
+  IntArgs::IntArgs(const PrimArgArray<int>& a) : PrimArgArray<int>(a) {}
+
+  forceinline IntArgs
+  IntArgs::create(int n, int start, int inc) {
+    IntArgs r(n);
+    for (int i=0; i<n; i++, start+=inc)
+      r[i] = start;
+    return r;
+  }
+
+  forceinline
+  IntVarArray::IntVarArray(void) {}
+
+  forceinline
+  IntVarArray::IntVarArray(Space& home, int n)
+    : VarArray<IntVar>(home,n) {}
+
+  forceinline
+  IntVarArray::IntVarArray(const IntVarArray& a)
+    : VarArray<IntVar>(a) {}
+
+  forceinline
+  IntVarArray::IntVarArray(Space& home, const IntVarArgs& a)
+    : VarArray<IntVar>(home,a) {}
+
+
+  forceinline
+  BoolVarArray::BoolVarArray(void) {}
+
+  forceinline
+  BoolVarArray::BoolVarArray(Space& home, int n)
+    : VarArray<BoolVar>(home,n) {}
+
+  forceinline
+  BoolVarArray::BoolVarArray(const BoolVarArray& a)
+    : VarArray<BoolVar>(a) {}
+
+  forceinline
+  BoolVarArray::BoolVarArray(Space& home, const BoolVarArgs& a)
+    : VarArray<BoolVar>(home,a) {}
+
+}
+
+// STATISTICS: int-other

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/bin-packing.cpp

@@ -0,0 +1,71 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2010
+ *
+ *  Last modified:
+ *     $Date: 2010-10-07 08:20:35 +1100 (Thu, 07 Oct 2010) $ by $Author: schulte $
+ *     $Revision: 11468 $
+ *
+ *  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 <gecode/int/bin-packing.hh>
+
+namespace Gecode {
+
+  void
+  binpacking(Home home, 
+             const IntVarArgs& l, 
+             const IntVarArgs& b, const IntArgs& s,
+             IntConLevel) {
+    using namespace Int;
+    if (l.same(home,b))
+      throw ArgumentSame("Int::binpacking");
+    if (b.size() != s.size())
+      throw ArgumentSizeMismatch("Int::binpacking");      
+    for (int i=s.size(); i--; )
+      Limits::positive(s[i],"Int::binpacking");
+    if (home.failed()) return;
+
+    ViewArray<OffsetView> lv(home,l.size());
+    for (int i=l.size(); i--; )
+      lv[i] = OffsetView(l[i],0);
+
+    ViewArray<BinPacking::Item> bs(home,b.size());
+    for (int i=bs.size(); i--; )
+      bs[i] = BinPacking::Item(b[i],s[i]);
+
+    Support::quicksort(&bs[0], bs.size());
+
+    GECODE_ES_FAIL(Int::BinPacking::Pack::post(home,lv,bs));
+  }
+
+}
+
+// STATISTICS: int-post

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/int/bin-packing.hh

@@ -0,0 +1,184 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2010
+ *
+ *  Last modified:
+ *     $Date: 2010-10-07 08:20:35 +1100 (Thu, 07 Oct 2010) $ by $Author: schulte $
+ *     $Revision: 11468 $
+ *
+ *  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.
+ *
+ */
+
+#ifndef __GECODE_INT_BIN_PACKING_HH__
+#define __GECODE_INT_BIN_PACKING_HH__
+
+#include <gecode/int.hh>
+
+/**
+ * \namespace Gecode::Int::BinPacking
+ * \brief %Bin-packing propagators
+ */
+
+namespace Gecode { namespace Int { namespace BinPacking {
+
+  /**
+   * \brief Item combining bin and size information
+   */
+  class Item : public DerivedView<IntView> {
+  protected:
+    using DerivedView<IntView>::x;
+    /// Size of item
+    int s;
+  public:
+    /// Default constructor
+    Item(void);
+    /// Constructor
+    Item(IntView b, int s);
+
+    /// Return bin of item
+    IntView bin(void) const;
+    /// Set bin of item to \a b
+    void bin(IntView b);
+    /// Return size of item
+    int size(void) const;
+    /// Set size of item to \a s
+    void size(int s);
+
+    /// Update item during cloning
+    void update(Space& home, bool share, Item& i);
+  };
+
+  /// Whether two items are the same
+  bool same(const Item& i, const Item& j);
+  /// Test whether one item is before another
+  bool before(const Item& i, const Item& j);
+
+  /// For sorting according to size
+  bool operator <(const Item& i, const Item& j);
+
+
+  /// Size sets
+  class SizeSet {
+  protected:
+    /// Number of size entries in the set
+    int n;
+    /// Total size of the set
+    int t;
+    /// Array of sizes (will have more elements)
+    int* s;
+  public:
+    /// Default constructor
+    SizeSet(void);
+    /// Initialize for at most \a n_max items
+    SizeSet(Region& region, int n_max);
+    /// Add new size \a s
+    void add(int s);
+    /// Return cardinality of set (number of entries)
+    int card(void) const;
+    /// Return total size
+    int total(void) const;
+    /// Return size of item \a i
+    int operator [](int i) const;
+  };
+
+  /// Size sets with one element discarded
+  class SizeSetMinusOne : public SizeSet {
+  protected:
+    /// Position of discarded item
+    int p;
+  public:
+    /// Default constructor
+    SizeSetMinusOne(void);
+    /// Initialize for at most \n n_max entries
+    SizeSetMinusOne(Region& region, int n);
+    /// Discard size \a s
+    void minus(int s);
+    /// Return cardinality of set (number of entries)
+    int card(void) const;
+    /// Return total size
+    int total(void) const;
+    /// Return size of item \a i
+    int operator [](int i) const;
+  };
+
+
+  /**
+   * \brief Bin-packing propagator
+   *
+   * The algorithm is taken from:
+   *   Paul Shaw. A Constraint for Bin Packing. CP 2004.
+   *
+   * Requires \code #include <gecode/int/bin-packing.hh> \endcode
+   *
+   * \ingroup FuncIntProp
+   */
+  class Pack : public Propagator {
+  protected:
+    /// Views for load of bins
+    ViewArray<OffsetView> l;
+    /// Items with bin and size
+    ViewArray<Item> bs;
+    /// Total size of all items
+    int t;
+    /// Constructor for posting
+    Pack(Home home, ViewArray<OffsetView>& l, ViewArray<Item>& bs);
+    /// Constructor for cloning \a p
+    Pack(Space& home, bool share, Pack& p);
+  public:
+    /// Post propagator for loads \a l and items \a bs
+    GECODE_INT_EXPORT 
+    static ExecStatus post(Home home, 
+                           ViewArray<OffsetView>& l, ViewArray<Item>& bs);
+    /// Detect non-existence of sums in \a a .. \a b
+    template<class SizeSet>
+    bool nosum(const SizeSet& s, int a, int b, int& ap, int& bp);
+    /// Detect non-existence of sums in \a a .. \a b
+    template<class SizeSet>
+    bool nosum(const SizeSet& s, int a, int b);
+    /// Perform propagation
+    GECODE_INT_EXPORT 
+    virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
+    /// Cost function
+    GECODE_INT_EXPORT 
+    virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
+    /// Copy propagator during cloning
+    GECODE_INT_EXPORT 
+    virtual Actor* copy(Space& home, bool share);
+    /// Destructor
+    virtual size_t dispose(Space& home);
+  };
+
+}}}
+
+#include <gecode/int/bin-packing/propagate.hpp>
+
+#endif
+
+// STATISTICS: int-prop
+