path.hh

Go to the documentation of this file.

/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.dev>
 *
 *  Contributing authors:
 *     Mikael Zayenz Lagerkvist <lagerkvist@gecode.dev>
 *
 *  Copyright:
 *     Christian Schulte, 2003
 *     Mikael Zayenz Lagerkvist, 2026
 *
 *  This file is part of Gecode, the generic constraint
 *  development environment:
 *     http://www.gecode.dev
 *
 *  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_SEARCH_SEQ_PATH_HH
#define GECODE_SEARCH_SEQ_PATH_HH
 
#include <algorithm>
 
#include <gecode/search.hh>
#include <gecode/search/support.hh>
#include <gecode/search/worker.hh>
#include <gecode/search/nogoods.hh>
 
namespace Gecode { namespace Search { namespace Seq {

  template<class Tracer>
  class GECODE_VTABLE_EXPORT Path : public NoGoods {
    friend class Search::NoGoodsProp;
  public:
    typedef typename Tracer::ID ID;
    class Edge {
    protected:
      Space* _space;
      unsigned int _alt;
      const Choice* _choice;
      ID _nid;
    public:
      Edge(void);
      Edge(Space* s, Space* c, unsigned int nid);

      Space* space(void) const;
      void space(Space* s);

      const Choice* choice(void) const;

      unsigned int alt(void) const;
      unsigned int truealt(void) const;
      bool leftmost(void) const;
      bool rightmost(void) const;
      void next(void);
      bool lao(void) const;

      unsigned int nid(void) const;

      void dispose(void);
    };
  protected:
    Support::DynamicStack<Edge,Heap> ds;
    unsigned int _ngdl;
  public:
    Path(unsigned int l);
    unsigned int ngdl(void) const;
    void ngdl(unsigned int l);
    const Choice* push(Worker& stat, Space* s, Space* c, unsigned int nid);
    void next(void);
    Edge& top(void) const;
    bool empty(void) const;
    int lc(void) const;
    void unwind(int l, Tracer& t);
    void commit(Space* s, int i) const;
    Space* recompute(unsigned int& d, unsigned int a_d, Worker& s,
                     Tracer& t);
    Space* recompute(unsigned int& d, unsigned int a_d, Worker& s,
                     const Space* best, int& mark,
                     Tracer& t);
    int entries(void) const;
    void reset(void);
    virtual void post(Space& home) const;
  };
 
}}}
 
#include <gecode/search/seq/path.hpp>
 
#endif
 
// STATISTICS: search-seq