gecoder-with-gecode 0.9.0 → 0.9.1

data/ext/gecode-2.1.1/gecode/support/block-allocator.icc

@@ -1,158 +0,0 @@
-/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2004
- *
- *  Last modified:
- *     $Date: 2007-09-11 14:20:32 +0200 (Tue, 11 Sep 2007) $ by $Author: schulte $
- *     $Revision: 4971 $
- *
- *  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 Manage memory organized into block lists (allocator)
-   *
-   * The allocation policy is to free all memory allocated when
-   * the block allocator is deleted.
-   *
-   * \ingroup FuncSupport
-   */
-  template <class T>
-  class BlockAllocator {
-  private:
-    /// One block of memory
-    class Block {
-    public:
-      static const int blocksize = 512;
-      T      b[blocksize];
-      Block* next;
-    };
-    /// Pointer to current block
-    Block* b;
-    /// Pointer to next part of block (decreasing)
-    T*     n;
-    /// Size of allocated blocks
-    size_t _size;
-    /// Allocate additional block
-    void allocate(void);
-  public:
-    /// Initialize
-    BlockAllocator(void);
-    /// Free all allocated blocks
-    ~BlockAllocator(void);
-    /// Return memory of size required by \a T
-    T* operator()(void);
-    /// Return size of memory required by allocator
-    size_t size(void) const;
-  };
-
-  /**
-   * \brief Client for block allocator of type \a T
-   *
-   * Provides memory management for objects of type \a T.
-   *
-   * \ingroup FuncSupport
-   */
-  template <class T>
-  class BlockClient {
-  public:
-    /// Allocate memory from block allocator \a ba
-    static void* operator new(size_t s, BlockAllocator<T>& ba);
-    /// Noop (memory freed only when block allocator deleted)
-    static void  operator delete(void*, BlockAllocator<T>& ba);
-    /// Noop (memory freed only when block allocator deleted)
-    static void  operator delete(void*);
-  };
-
-
-
-  template <class T>
-  forceinline
-  BlockAllocator<T>::BlockAllocator(void) {
-    b = static_cast<Block*>(Memory::malloc(sizeof(Block)));
-    b->next = NULL;
-    n       = &b->b[Block::blocksize];
-    _size = sizeof(Block);
-  }
-
-  template <class T>
-  forceinline
-  BlockAllocator<T>::~BlockAllocator(void) {
-    while (b != NULL) {
-      Block* f = b; b = b->next;
-      Memory::free(f);
-    }
-  }
-
-  template <class T>
-  forceinline T*
-  BlockAllocator<T>::operator()(void) {
-    T* t = --n;
-    if (t == &b->b[0])
-      allocate();
-    return t;
-  }
-
-  template <class T>
-  void
-  BlockAllocator<T>::allocate(void) {
-    // Allocate another block
-    Block* nb = static_cast<Block*>(Memory::malloc(sizeof(Block)));
-    nb->next = b; b = nb;
-    n = &nb->b[Block::blocksize];
-    _size += sizeof(Block);
-  }
-
-  template <class T>
-  forceinline size_t
-  BlockAllocator<T>::size(void) const {
-    return _size;
-  }
-
-
-
-  template <class T>
-  forceinline void
-  BlockClient<T>::operator delete(void*, BlockAllocator<T>&) {
-  }
-  template <class T>
-  forceinline void
-  BlockClient<T>::operator delete(void*) {
-  }
-  template <class T>
-  forceinline void*
-  BlockClient<T>::operator new(size_t, BlockAllocator<T>& ba) {
-    return ba();
-  }
-
-}}
-
-// STATISTICS: support-any

data/ext/gecode-2.1.1/gecode/support/config.icc.in

@@ -1,80 +0,0 @@
-/*
- *  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-02-28 19:55:12 +0100 (Thu, 28 Feb 2008) $ by $Author: tack $
- *     $Revision: 6353 $
- *
- *  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.
- *
- */
-
-/* How to tell the compiler to really, really inline */
-#undef forceinline
-
-/* Heap memory alignment */
-#undef GECODE_MEMORY_ALIGNMENT
-
-/* Whether integer variables are built */
-#undef GECODE_HAS_INT_VARS
-
-/* Whether set variables are built */
-#undef GECODE_HAS_SET_VARS
-
-/* Whether bdd variables are built */
-#undef GECODE_HAS_CPLTSET_VARS
-
-/* Whether we are compiling static libraries */
-#undef GECODE_STATIC_LIBS
-
-/* Whether we have mtrace for memory leak debugging*/
-#undef GECODE_HAS_MTRACE
-
-/* Whether gcc understands visibility attributes */
-#undef GECODE_GCC_HAS_CLASS_VISIBILITY
-
-/* Whether to include audit code */
-#undef GECODE_AUDIT
-
-/* Whether serialization support is built */
-#undef GECODE_HAS_SERIALIZATION
-
-/* Whether to compile with boost serialization support */
-#undef GECODE_HAS_BOOST_SERIALIZATION
-
-/* Whether Qt is available */
-#undef GECODE_HAS_QT
-
-/* Whether Gist is available */
-#undef GECODE_HAS_GIST
-
-// STATISTICS: support-any

data/ext/gecode-2.1.1/gecode/support/sentinel-stack.icc

@@ -1,122 +0,0 @@
-/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
-/*
- *  Main authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Christian Schulte, 2006
- *
- *  Last modified:
- *     $Date: 2007-09-12 15:44:07 +0200 (Wed, 12 Sep 2007) $ by $Author: tack $
- *     $Revision: 5001 $
- *
- *  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 A simple stack that uses a sentinel element
-   *
-   * The sentinel element is used to mark the bottom of the stack
-   * and must be given at compile time.
-   *
-   * Note that the stack does not provide memory management. As it
-   * is so simple it is ment to be used with automatically allocated
-   * memory.
-   *
-   * \ingroup FuncSupport
-   */
-  template<class T>
-  class SentinelStack {
-  private:
-    const T sentinel;
-    T* tos;
-  public:
-    /// Create stack that uses the memory area \a p and sentinel \a s
-    SentinelStack(T* p, T s);
-    /// Check whether stack is empty
-    bool empty(void) const;
-    /// Return topmost element
-    T top(void) const;
-    /// Return element that has just been popped
-    T last(void) const;
-    /// Return topmost element and pop it
-    T pop(void);
-    /// Push element
-    void push(T x);
-  };
-
-  template<class T>
-  forceinline
-  SentinelStack<T>::SentinelStack(T* p, T s) 
-    : sentinel(s), tos(p) {
-    *(tos++) = sentinel;
-  }
-  template<class T>
-  forceinline bool
-  SentinelStack<T>::empty(void) const {
-    return *(tos-1) == sentinel;
-  }
-  template<class T>
-  forceinline T
-  SentinelStack<T>::top(void) const {
-    return *(tos-1);
-  }
-  template<class T>
-  forceinline T
-  SentinelStack<T>::last(void) const {
-    return *tos;
-  }
-  template<class T>
-  forceinline T
-  SentinelStack<T>::pop(void) {
-    return *(--tos);
-  }
-  template<class T>
-  forceinline void
-  SentinelStack<T>::push(T x) {
-    assert(x != sentinel);
-    *(tos++) = x;
-  }
-
-}}
-
-/**
- * \def GECODE_AUTOSTACK(T,S,X,N)
- * \brief Simple sentinel stack using automatic memory
- *
- * Allocates automatic memory for a sentinel stack \a X with 
- * \a N objects of type \a T with sentinel \a S.
- *
- * As soon as the current scope is left, the memory is freed.
- *
- */
-
-#define GECODE_AUTOSTACK(T,S,X,N)                                          \
-  GECODE_AUTOARRAY(T,__GECODE__AS__ ## X ## __LINE__,(N)+1);               \
-  Gecode::Support::SentinelStack<T> X(__GECODE__AS__ ## X ## __LINE__,(S));
-
-// STATISTICS: support-any

data/ext/gecode-2.1.1/gecode/support/symbol.cc

@@ -1,226 +0,0 @@
-/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
-/*
- *  Main authors:
- *     Guido Tack <tack@gecode.org>
- *
- *  Contributing authors:
- *     Christian Schulte <schulte@gecode.org>
- *
- *  Copyright:
- *     Guido Tack, 2007
- *     Christian Schulte, 2007
- *
- *  Last modified:
- *     $Date: 2007-11-28 14:58:39 +0100 (Wed, 28 Nov 2007) $ by $Author: tack $
- *     $Revision: 5474 $
- *
- *  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/support.hh"
-
-namespace Gecode { namespace Support {
-
-  forceinline void* 
-  Symbol::SO::operator new(size_t s) {
-    return Memory::malloc(s);
-  }
-  forceinline void
-  Symbol::SO::operator delete(void* p) {
-    Memory::free(p);
-  }
-  forceinline bool
-  Symbol::SO::cancel(void) { return --use_cnt == 0; }
-
-  forceinline void
-  Symbol::SO::subscribe(void) { ++use_cnt; }
-
-  forceinline unsigned int
-  Symbol::SO::size(void) const {
-    return strlen(s);
-  }
-
-  forceinline char*
-  Symbol::SO::strdup(const char* s) {
-    unsigned int n = strlen(s)+1;
-    char* d = static_cast<char*>(Memory::malloc(sizeof(char)*n));
-    for (unsigned int i=n; i--; )
-      d[i]=s[i];
-    return d;
-  }
-
-  forceinline 
-  Symbol::SO::SO(const char* s0, bool copy)
-    : use_cnt(0),
-      s(copy ? strdup(s0) : const_cast<char*>(s0)), own(copy) {}
-
-  forceinline int
-  Symbol::SO::hash(int m) const {
-    int h = 0;
-    int pos = 0;
-    while (s[pos] != 0) {
-      h = (127 * h + s[pos++]) % m;
-    }
-    return h;
-  }
-
-  forceinline void
-  Symbol::SO::append(SO* so0) {
-    if (so0 == NULL)
-      return;
-    unsigned int n1 = strlen(s);
-    unsigned int n2 = strlen(so0->s);
-    char* d = static_cast<char*>(Memory::malloc(sizeof(char)*(n1+n2+1)));
-    for (unsigned int i=n1; i--; )
-      d[i] = s[i];
-    for (unsigned int i=n2+1; i--; )
-      d[n1+i] = so0->s[i];
-    if (own)
-      Memory::free(s);
-    s = d;
-    own = true;
-  }
-
-  forceinline bool
-  Symbol::SO::eq(const SO* other) const {
-    if (this == other)
-      return true;
-    if (other == NULL)
-      return false;
-    return (!strcmp(s, other->s));
-  }
-
-  forceinline bool
-  Symbol::SO::eq(const char* other) const {
-    return (!strcmp(s, other));
-  }
-  
-  std::ostream&
-  Symbol::SO::print(std::ostream& os) const {
-    return os << s;
-  }
-
-
-  Symbol::Symbol(void) : so(NULL) {}
-
-  Symbol::Symbol(const char* s0, bool copy)
-    : so(new SO(s0, copy)) {
-    so->subscribe();
-  }
-
-  Symbol::Symbol(const Symbol& s0) {
-    so = s0.so;
-    if (so)
-      so->subscribe();
-  }
-
-  const Symbol&
-  Symbol::operator=(const Symbol& s0) {
-    if (this != &s0) {
-      if (so && so->cancel()) {
-        if (so->own)
-          Memory::free(so->s);
-        delete so;
-      }
-      so = s0.so;
-      if (so)
-        so->subscribe();
-    }
-    return *this;
-  }
-  
-  bool
-  Symbol::empty(void) const {
-    return so==NULL;
-  }
-  
-  Symbol
-  Symbol::copy(void) const {
-    Symbol ret;
-    if (so == NULL) {
-      ret.so = NULL;
-    } else {
-      ret.so = new SO(so->s, true);
-      ret.so->subscribe();
-    }
-    return ret;
-  }
-
-  Symbol&
-  Symbol::operator+=(const Symbol& s0) {
-    if (so == NULL) {
-      so = s0.so;
-      if (so)
-        so->subscribe();
-    } else if (s0.so != NULL) {
-      so->append(s0.so);
-    }
-    return *this;
-  }
-  
-  int
-  Symbol::hash(int m) const {
-    if (so == NULL)
-      return 0;
-    return so->hash(m);
-  }
-
-  bool
-  Symbol::operator==(const Symbol& s0) const {
-    if (so == NULL)
-      return (s0.so == NULL);
-    return so->eq(s0.so);
-  }
-
-  bool
-  Symbol::operator==(const char* s0) const {
-    if (so==NULL)
-      return s0[0] == 0;
-    return so->eq(s0);
-  }
-  
-  std::ostream&
-  Symbol::print(std::ostream& os) const {
-    if (so) return so->print(os);
-    return os;
-  }
-
-  std::string
-  Symbol::toString(void) const {
-    if (so) return so->s;
-    return "";
-  }
-  
-  Symbol::~Symbol(void) {
-    if ((so != NULL) && so->cancel()) {
-      if (so->own)
-        Memory::free(so->s);
-      delete so;
-    }
-  }
-
-}}
-
-// STATISTICS: support-any