dep-selector-libgecode 1.0.0.alpha.0

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/support/int-type.hpp

@@ -0,0 +1,172 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2010-01-26 23:22:47 +1100 (Tue, 26 Jan 2010) $ by $Author: schulte $
+ *     $Revision: 10238 $
+ *
+ *  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 <climits>
+
+namespace Gecode { namespace Support {
+
+  /// Description of integer types
+  enum IntType {
+    IT_CHAR = 0, ///< char integer type
+    IT_SHRT = 1, ///< short integer type
+    IT_INT  = 2  ///< integer type
+  };
+
+  /// Return type required to represent \a n
+  IntType u_type(unsigned int n);
+  /// Return type required to represent \a n
+  IntType s_type(signed int n);
+
+  /// Traits to for information about integer types
+  template<class IntType>
+  class IntTypeTraits {};
+
+  /// Traits for signed char
+  template<>
+  class IntTypeTraits<signed char> {
+  public:
+    /// Corresponding unsigned type
+    typedef unsigned char utype;
+    /// Corresponding signed type
+    typedef signed char stype;
+    /// Minimal value
+    static const signed char min = SCHAR_MIN;
+    /// Maximal value
+    static const signed char max = SCHAR_MAX;
+    /// Description of type
+    static const IntType description = IT_CHAR;
+  };
+  /// Traits for unsigned char
+  template<>
+  class IntTypeTraits<unsigned char> {
+  public:
+    /// Corresponding unsigned type
+    typedef unsigned char utype;
+    /// Corresponding signed type
+    typedef signed char stype;
+    /// Minimal value
+    static const unsigned char min = 0;
+    /// Maximal value
+    static const unsigned char max = UCHAR_MAX;
+    /// Description of type
+    static const IntType description = IT_CHAR;
+  };
+  /// Traits for signed short int
+  template<>
+  class IntTypeTraits<signed short int> {
+  public:
+    /// Corresponding unsigned type
+    typedef unsigned short int utype;
+    /// Corresponding signed type
+    typedef signed short int stype;
+    /// Minimal value
+    static const signed short int min = SHRT_MIN;
+    /// Maximal value
+    static const signed short int max = SHRT_MAX;
+    /// Description of type
+    static const IntType description = IT_SHRT;
+  };
+  /// Traits for unsigned short int
+  template<>
+  class IntTypeTraits<unsigned short int> {
+  public:
+    /// Corresponding unsigned type
+    typedef unsigned short int utype;
+    /// Corresponding signed type
+    typedef signed short int stype;
+    /// Minimal value
+    static const unsigned short int min = 0;
+    /// Maximal value
+    static const unsigned short int max = USHRT_MAX;
+    /// Description of type
+    static const IntType description = IT_SHRT;
+  };
+  /// Traits for signed integer
+  template<>
+  class IntTypeTraits<signed int> {
+  public:
+    /// Corresponding unsigned type
+    typedef unsigned int utype;
+    /// Corresponding signed type
+    typedef signed int stype;
+    /// Minimal value
+    static const signed int min = INT_MIN;
+    /// Maximal value
+    static const signed int max = INT_MAX;
+    /// Description of type
+    static const IntType description = IT_INT;
+  };
+  /// Traits for unsigned integer
+  template<>
+  class IntTypeTraits<unsigned int> {
+  public:
+    /// Corresponding unsigned type
+    typedef unsigned int utype;
+    /// Corresponding signed type
+    typedef signed int stype;
+    /// Minimal value
+    static const unsigned int min = 0;
+    /// Maximal value
+    static const unsigned int max = UINT_MAX;
+    /// Description of type
+    static const IntType description = IT_INT;
+  };
+
+
+  forceinline IntType
+  u_type(unsigned int n) {
+    if (n < UCHAR_MAX)
+      return IT_CHAR;
+    else if (n < USHRT_MAX)
+      return IT_SHRT;
+    else
+      return IT_INT;
+  }
+
+  forceinline IntType
+  s_type(int n) {
+    if ((n > SCHAR_MIN) && (n < SCHAR_MAX))
+      return IT_CHAR;
+    else if ((n > SHRT_MIN) && (n < SHRT_MAX))
+      return IT_SHRT;
+    else
+      return IT_INT;
+  }
+
+}}
+
+// STATISTICS: support-any

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/support/macros.hpp

@@ -0,0 +1,103 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004
+ *
+ *  Last modified:
+ *     $Date: 2009-01-21 09:44:27 +1100 (Wed, 21 Jan 2009) $ by $Author: schulte $
+ *     $Revision: 8082 $
+ *
+ *  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.
+ *
+ */
+
+/// Concatenate \a R and \a LINE
+#define GECODE_CAT2(R,LINE) R ## LINE
+/// Concatenate macro-expanded \a R and \a LINE
+#define GECODE_CAT(R,LINE) GECODE_CAT2(R,LINE)
+/// Generate fresh name with prefix P
+#define GECODE_FRESH(P) GECODE_CAT(_GECODE_ ## P, __LINE__)
+
+/**
+ * \def GECODE_NEVER
+ * \brief Assert that this command is never executed
+ *
+ * This is preferred over assert(false) as it is used for optimization,
+ * if supported by a compiler (for example, Microsoft Visual C++).
+ *
+ */
+
+#if defined(_MSC_VER) && defined(NDEBUG)
+
+#define GECODE_NEVER __assume(false);
+
+#else
+
+#define GECODE_NEVER assert(false);
+
+#endif
+
+/**
+ * \def GECODE_NOT_NULL
+ * \brief Assert that a pointer is never NULL
+ *
+ * This is preferred over assert as it is used for optimization,
+ * if supported by a compiler (for example, Microsoft Visual C++).
+ *
+ */
+
+#if defined(_MSC_VER) && defined(NDEBUG)
+
+#define GECODE_NOT_NULL(p) __assume(p != NULL);
+
+#else
+
+#define GECODE_NOT_NULL(p) assert(p != NULL);
+
+#endif
+
+/**
+ * \def GECODE_ASSUME
+ * \brief Assert certain property
+ *
+ * This might be used for optimization as well (for example,
+ * Microsoft Visual C++), otherwise it behaves like any
+ * assert.
+ *
+ */
+
+#if defined(_MSC_VER) && defined(NDEBUG)
+
+#define GECODE_ASSUME(p) __assume((p));
+
+#else
+
+#define GECODE_ASSUME(p) assert((p));
+
+#endif
+
+// STATISTICS: support-any

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/support/marked-pointer.hpp

@@ -0,0 +1,79 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2009-10-16 19:20:59 +1100 (Fri, 16 Oct 2009) $ by $Author: schulte $
+ *     $Revision: 9936 $
+ *
+ *  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 <cstddef>
+
+namespace Gecode { namespace Support {
+
+  /// Check whether \a p is marked
+  bool marked(void* p);
+  /// Return marked pointer for \a p
+  void* mark(void* p);
+  /// Return unmarked pointer for a marked pointer \a p
+  void* unmark(void* p);
+  /// Return marked pointer for \a p (possibly already marked)
+  void* fmark(void* p);
+  /// Return unmarked pointer for a possibly marked pointer \a p
+  void* funmark(void* p);
+
+  forceinline bool
+  marked(void* p) {
+    return (reinterpret_cast<ptrdiff_t>(p) & 1) != 0;
+  }
+  forceinline void*
+  mark(void* p) {
+    assert(!marked(p));
+    return reinterpret_cast<void*>(reinterpret_cast<ptrdiff_t>(p)+1);
+  }
+  forceinline void*
+  unmark(void* p) {
+    assert(marked(p));
+    return reinterpret_cast<void*>(reinterpret_cast<ptrdiff_t>(p)-1);
+  }
+  forceinline void*
+  fmark(void* p) {
+    return reinterpret_cast<void*>(reinterpret_cast<ptrdiff_t>(p)|1);
+  }
+  forceinline void*
+  funmark(void* p) {
+    return reinterpret_cast<void*>(reinterpret_cast<ptrdiff_t>(p)&
+                                   ~static_cast<ptrdiff_t>(1));
+  }
+
+}}
+
+// STATISTICS: support-any

data/ext/libgecode3/vendor/gecode-3.7.3/gecode/support/random.hpp

@@ -0,0 +1,128 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *     Mikael Lagerkvist <lagerkvist@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2005
+ *     Mikael Lagerkvist, 2005
+ *
+ *  Last modified:
+ *     $Date: 2011-05-11 20:44:17 +1000 (Wed, 11 May 2011) $ by $Author: tack $
+ *     $Revision: 12001 $
+ *
+ *  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 Support {
+
+  /** \brief Template for linear congruential generators
+   *
+   * This class template defines a simple class for linear
+   * congruential generators.
+   *
+   * \ingroup FuncSupport
+   */
+  template<unsigned int m, unsigned int a, unsigned int q, unsigned int r>
+  class LinearCongruentialGenerator {
+  private:
+    /// The maximum size of random numbers generated.
+    static const unsigned int max = 1UL<<31;
+    /// Current seed value
+    unsigned int s;
+    /// Generate next number in series
+    unsigned int next(void);
+  public:
+    /// Set the current seed
+    void seed(unsigned int _s);
+    /// Construct the generator instance.
+    LinearCongruentialGenerator(unsigned int _s = 1);
+    /// Return current seed
+    unsigned int seed(void) const;
+    /// Returns a random integer from the interval [0..n)
+    unsigned int operator ()(unsigned int n);
+    /// Report size occupied
+    size_t size(void) const;
+  };
+
+  template<unsigned int m, unsigned int a, unsigned int q, unsigned int r>
+  forceinline unsigned int
+  LinearCongruentialGenerator<m,a,q,r>::next(void) {
+    s = a*(s%q) - r*(s/q);
+    unsigned int res = s;
+    if (s==0) s = 1;
+    return res;
+  }
+  template<unsigned int m, unsigned int a, unsigned int q, unsigned int r>
+  forceinline void
+  LinearCongruentialGenerator<m,a,q,r>::seed(unsigned int _s) {
+    s = _s % m;
+    if (s == 0) s = 1;
+  }
+  template<unsigned int m, unsigned int a, unsigned int q, unsigned int r>
+  forceinline
+  LinearCongruentialGenerator<m,a,q,r>::
+  LinearCongruentialGenerator(unsigned int _s) {
+    seed(_s);
+  }
+  template<unsigned int m, unsigned int a, unsigned int q, unsigned int r>
+  forceinline unsigned int
+  LinearCongruentialGenerator<m,a,q,r>::seed(void) const {
+    return s;
+  }
+  template<unsigned int m, unsigned int a, unsigned int q, unsigned int r>
+  forceinline unsigned int
+  LinearCongruentialGenerator<m,a,q,r>::operator ()(unsigned int n) {
+    unsigned int x1 = next() & ((1<<16)-1);
+    unsigned int x2 = next() & ((1<<16)-1);
+    if (n < 2) return 0;
+    double d = static_cast<double>(((x1<<16) | x2) % max) / max;
+    unsigned int val = static_cast<unsigned int>(n * d);
+    return (val < n) ? val : (n-1);
+  }
+  template<unsigned int m, unsigned int a, unsigned int q, unsigned int r>
+  forceinline size_t
+  LinearCongruentialGenerator<m,a,q,r>::size(void) const {
+    return sizeof(LinearCongruentialGenerator<m,a,q,r>);
+  }
+
+
+  /** \brief Default values for linear congruential generator
+   *
+   * While this pseudo-random number generator is not a good source of
+   * randomness, it is still an acceptable choice for many
+   * applications. The choice of values is taken from D. E. Knuth,
+   * The Art of Computer Programming, Vol 2, Seminumerical Algorithms,
+   * 3rd edition.
+   *
+   * \ingroup FuncSupport
+   */
+  typedef LinearCongruentialGenerator<2147483647, 48271, 44488, 3399>
+  RandomGenerator;
+
+}}
+
+// STATISTICS: support-any