heuristics/variables/Domain.h

// Domain.h -- The `minimum/maximum domain' variable ordering
// heuristic interface.

/*
 * Copyright (C) 1998,2003,2004 Tudor Hulubei <tudor@hulubei.net>.
 *
 * This library is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as
 * published by the Free Software Foundation; either version 2, or (at
 * your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA,
 * 02111-1307, USA.
 */

// $Id: heuristics_2variables_2Domain_8h-source.html,v 1.1 2005/05/25 12:37:18 tudor Exp $

#ifndef _CSP_HEURISTICS_VARIABLE_Domain_H
#define _CSP_HEURISTICS_VARIABLE_Domain_H


#include "../../caches/DomainSizes.h"


CSP_NAMESPACE_BEGIN(csp);
CSP_NAMESPACE_BEGIN(heuristics);
CSP_NAMESPACE_BEGIN(variables);


class DomainSizeLT :
    public StrictWeakVariableOrdering
{
  public:
    DomainSizeLT(caches::DomainSizes& domainSizes) :
        m_domainSizes(domainSizes) {}

    bool operator()(const Variable* variable0, const Variable* variable1)
    {
        return
            m_domainSizes.domainSize(*variable0) <
            m_domainSizes.domainSize(*variable1);
    }

  private:
    caches::DomainSizes& m_domainSizes;
};


class DomainSizeGT :
    public StrictWeakVariableOrdering
{
  public:
    DomainSizeGT(caches::DomainSizes& domainSizes) :
        m_domainSizes(domainSizes) {}

    bool operator()(const Variable* variable0, const Variable* variable1)
    {
        return
            m_domainSizes.domainSize(*variable0) >
            m_domainSizes.domainSize(*variable1);
    }

  private:
    caches::DomainSizes& m_domainSizes;
};


class DomainSizeEQ :
    public StrictWeakVariableOrdering
{
  public:
    DomainSizeEQ(caches::DomainSizes& domainSizes) :
        m_domainSizes(domainSizes),
        m_previousVariable0(0),
        m_previousVariable1(0),
        m_previousDomainSize0(0),
        m_previousDomainSize1(0) {}

    bool operator()(const Variable* variable0, const Variable* variable1);

    void reset()
    {
        m_previousVariable0 = 0;
        m_previousVariable1 = 0;
        m_previousDomainSize0 = 0;
        m_previousDomainSize1 = 0;
    }

  private:
    caches::DomainSizes& m_domainSizes;

    const Variable* m_previousVariable0;
    const Variable* m_previousVariable1;

    size_t m_previousDomainSize0;
    size_t m_previousDomainSize1;
};


class CSP_API Domain :
    public VariableOH
{
  public:
    enum Preference
    {
        Minimum,

        Maximum
    };

    Domain(
        Decomposition& decomposition,
        const vector<pair<double, double> >& intervals,
        double quality = 1,
        Preference preference = Minimum);

    virtual void select(vlist_type& selectable, vlist_type& selected);

  private:
    Domain(const Domain&);

    Domain& operator=(const Domain&);

    Preference m_preference;

    caches::DomainSizes m_domainSizes;

    DomainSizeLT m_compareLT;

    DomainSizeGT m_compareGT;

    DomainSizeEQ m_compareEQ;
};


CSP_NAMESPACE_END(variables);
CSP_NAMESPACE_END(heuristics);
CSP_NAMESPACE_END(csp);


#endif // _CSP_HEURISTICS_VARIABLE_Domain_H

// Local Variables:
// mode: C++
// End:

---