gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.2.0/gecode/iter/values-negative.icc

@@ -0,0 +1,116 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 09:47:36 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7308 $
+ *
+ *  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 Iter { namespace Values {
+
+  /**
+   * \brief Value iterator for selecting only negative values
+   *
+   * If \a strict is true, zero is excluded.
+   * \ingroup FuncIterValues
+   */
+  template <class I, bool strict=false>
+  class Negative {
+  protected:
+    /// Input iterator
+    I i;
+  public:
+    /// \name Constructors and initialization
+    //@{
+    /// Default constructor
+    Negative(void);
+    /// Initialize with values from \a i
+    Negative(I& i);
+    /// Initialize with values from \a i
+    void init(I& i);
+    //@}
+
+    /// \name Iteration control
+    //@{
+    /// Test whether iterator is still at a value or done
+    bool operator()(void) const;
+    /// Move iterator to next value (if possible)
+    void operator++(void);
+    //@}
+
+    /// \name Value access
+    //@{
+    /// Return current value
+    int val(void) const;
+    //@}
+  };
+
+
+  template <class I, bool strict>
+  forceinline
+  Negative<I,strict>::Negative(void) {}
+
+  template <class I, bool strict>
+  forceinline void
+  Negative<I,strict>::init(I& i0) {
+    i=i0;
+  }
+
+  template <class I, bool strict>
+  forceinline
+  Negative<I,strict>::Negative(I& i0) : i(i0) {}
+
+  template <class I, bool strict>
+  forceinline void
+  Negative<I,strict>::operator++(void) {
+    ++i;
+  }
+  template <class I, bool strict>
+  forceinline bool
+  Negative<I,strict>::operator()(void) const {
+    if (strict) {
+      return i() && (i.val() < 0);
+    } else {
+      return i() && (i.val() <= 0);
+    }
+  }
+
+  template <class I, bool strict>
+  forceinline int
+  Negative<I,strict>::val(void) const {
+    return i.val();
+  }
+
+}}}
+
+// STATISTICS: iter-any
+

data/ext/gecode-2.2.0/gecode/iter/values-positive.icc

@@ -0,0 +1,123 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 09:47:36 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7308 $
+ *
+ *  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 Iter { namespace Values {
+
+  /**
+   * \brief Value iterator for selecting only positive values
+   *
+   * If \a strict is true, zero is included.
+   * \ingroup FuncIterValues
+   */
+  template <class I, bool strict=false>
+  class Positive {
+  protected:
+    /// Input iterator
+    I i;
+  public:
+    /// \name Constructors and initialization
+    //@{
+    /// Default constructor
+    Positive(void);
+    /// Initialize with values from \a i
+    Positive(I& i);
+    /// Initialize with values from \a i
+    void init(I& i);
+    //@}
+
+    /// \name Iteration control
+    //@{
+    /// Test whether iterator is still at a value or done
+    bool operator()(void) const;
+    /// Move iterator to next value (if possible)
+    void operator++(void);
+    //@}
+
+    /// \name Value access
+    //@{
+    /// Return current value
+    int val(void) const;
+    //@}
+  };
+
+
+  template <class I, bool strict>
+  forceinline
+  Positive<I,strict>::Positive(void) {}
+
+  template <class I, bool strict>
+  forceinline void
+  Positive<I,strict>::init(I& i0) {
+    i=i0;
+    if (strict) {
+      while (i() && (i.val() <= 0)) ++i;
+    } else {
+      while (i() && (i.val() < 0)) ++i;
+    }
+  }
+
+  template <class I, bool strict>
+  forceinline
+  Positive<I,strict>::Positive(I& i0) : i(i0) {
+    if (strict) {
+      while (i() && (i.val() <= 0)) ++i;
+    } else {
+      while (i() && (i.val() < 0)) ++i;
+    }
+  }
+
+  template <class I, bool strict>
+  forceinline void
+  Positive<I,strict>::operator++(void) {
+    ++i;
+  }
+  template <class I, bool strict>
+  forceinline bool
+  Positive<I,strict>::operator()(void) const {
+    return i();
+  }
+
+  template <class I, bool strict>
+  forceinline int
+  Positive<I,strict>::val(void) const {
+    return i.val();
+  }
+
+}}}
+
+// STATISTICS: iter-any
+

data/ext/gecode-2.2.0/gecode/iter/values-union.icc

@@ -0,0 +1,137 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2008
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 09:47:36 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7308 $
+ *
+ *  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 Iter { namespace Values {
+
+  /**
+   * \brief Value iterator for the union of two value iterators
+   *
+   * \ingroup FuncIterValues
+   */
+
+  template <class I, class J>
+  class Union  {
+  private:
+    /// First iterator
+    I i;
+    /// Second iterator
+    J j;
+    /// Current value
+    int v;
+    /// Whether iterator is done
+    bool done;
+  public:
+    /// \name Constructors and initialization
+    //@{
+    /// Default constructor
+    Union(void);
+    /// Initialize with values from \a i and \a j
+    Union(I& i, J& j);
+    /// Initialize with values from \a i and \a j
+    void init(I& i, J& j);
+    //@}
+
+    /// \name Iteration control
+    //@{
+    /// Test whether iterator is still at a value or done
+    bool operator()(void) const;
+    /// Move iterator to next value (if possible)
+    void operator++(void);
+    //@}
+
+    /// \name Value access
+    //@{
+    /// Return current value
+    int val(void) const;
+    //@}
+  };
+
+
+  template <class I, class J>
+  forceinline
+  Union<I,J>::Union(void) {}
+
+  template <class I, class J>
+  forceinline void
+  Union<I,J>::operator++(void) {
+    if (i()) {
+      if (j()) {
+        if (i.val() == j.val()) {
+          v=i.val(); ++i; ++j;
+        } else if (i.val() < j.val()) {
+          v=i.val(); ++i;
+        } else {
+          v=j.val(); ++j;
+        }
+      } else {
+        v=i.val(); ++i;
+      }
+    } else if (j()) {
+      v=j.val(); ++j;
+    } else {
+      done=true;
+    }
+  }
+
+  template <class I, class J>
+  inline void
+  Union<I,J>::init(I& i0, J& j0) {
+    i=i0; j=j0; done=false;
+    operator++();
+  }
+
+  template <class I, class J>
+  forceinline
+  Union<I,J>::Union(I& i0, J& j0) : i(i0), j(j0), done(false) {
+    operator++();
+  }
+
+  template <class I, class J>
+  forceinline bool
+  Union<I,J>::operator()(void) const {
+    return !done;
+  }
+
+  template <class I, class J>
+  forceinline int
+  Union<I,J>::val(void) const {
+    return v;
+  }
+
+}}}
+
+// STATISTICS: iter-any

data/ext/gecode-2.2.0/gecode/kernel.hh

@@ -0,0 +1,188 @@
+/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
+/*
+ *  Main authors:
+ *     Christian Schulte <schulte@gecode.org>
+ *
+ *  Contributing authors:
+ *     Guido Tack <tack@gecode.org>
+ *
+ *  Copyright:
+ *     Christian Schulte, 2004
+ *     Guido Tack, 2004
+ *
+ *  Last modified:
+ *     $Date: 2008-07-11 10:10:11 +0200 (Fri, 11 Jul 2008) $ by $Author: tack $
+ *     $Revision: 7310 $
+ *
+ *  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_KERNEL_HH__
+#define __GECODE_KERNEL_HH__
+
+#include <cstddef>
+#include <cstdlib>
+#include <cstring>
+#include <cassert>
+
+#include "gecode/support.hh"
+
+/*
+ * Configure linking
+ *
+ */
+#if !defined(GECODE_STATIC_LIBS) && \
+    (defined(__CYGWIN__) || defined(__MINGW32__) || defined(_MSC_VER))
+
+#ifdef GECODE_BUILD_KERNEL
+#define GECODE_KERNEL_EXPORT __declspec( dllexport )
+#else
+#define GECODE_KERNEL_EXPORT __declspec( dllimport )
+#endif
+
+#else
+
+#ifdef GECODE_GCC_HAS_CLASS_VISIBILITY
+#define GECODE_KERNEL_EXPORT __attribute__ ((visibility("default")))
+#else
+#define GECODE_KERNEL_EXPORT
+#endif
+
+#endif
+
+/**
+ * \namespace Gecode
+ * \brief Gecode toplevel namespace
+ *
+ * The Gecode namespace contains nested namespaces for
+ * the various submodules (for example Int for the
+ * definition of integer propagator classes). Functionality
+ * that is used for interfacing (search engines, variables,
+ * and so on) or belongs to the %Gecode %Kernel is contained
+ * directly in the Gecode namespace.
+ *
+ */
+
+/*
+ * General exceptions and kernel exceptions
+ *
+ */
+
+#include "gecode/kernel/exception.icc"
+
+
+
+/*
+ * Basic kernel services
+ *
+ */
+
+#include "gecode/kernel/memory-manager.icc"
+
+
+/*
+ * Macros for checking failure
+ *
+ */
+
+
+#include "gecode/kernel/macros.icc"
+
+/*
+ * Gecode kernel
+ *
+ */
+
+#include "gecode/kernel/core.icc"
+#include "gecode/kernel/modevent.icc"
+
+/*
+ * Traits linking variables, views, and variable implementations
+ *
+ */
+
+#include "gecode/kernel/var-traits.icc"
+
+/*
+ * Variables and testing for shared variables
+ *
+ */
+
+#include "gecode/kernel/var.icc"
+
+/*
+ * Access to the constraint graph
+ *
+ */
+
+#include "gecode/kernel/reflection.icc"
+
+/*
+ * Views
+ *
+ */
+
+#include "gecode/kernel/view.icc"
+
+/*
+ * Variable and argument arrays
+ *
+ */
+
+#include "gecode/kernel/array.icc"
+
+/*
+ * Access to the constraint graph
+ *
+ */
+
+#include "gecode/kernel/var-map.icc"
+
+/*
+ * Shared arrays
+ *
+ */
+
+#include "gecode/kernel/shared-array.icc"
+
+/*
+ * Common propagator and branching patterns
+ *
+ */
+
+#include "gecode/kernel/propagator.icc"
+#include "gecode/kernel/advisor.icc"
+#include "gecode/kernel/branching.icc"
+
+/*
+ * Automatically generated variable implementations
+ *
+ */
+
+#include "gecode/kernel/var-imp.icc"
+
+#endif
+
+// STATISTICS: kernel-other