DomainWipeouts.h

// DomainWipeouts.h -- The 'maximum/minimum domain wipeouts' variable
// ordering heuristic.

/*
 * Copyright (C) 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: DomainWipeouts_8h-source.html,v 1.1 2005/05/25 12:37:18 tudor Exp $


#ifndef _CSP_HEURISTICS_VARIABLE_DomainWipeouts_H
#define _CSP_HEURISTICS_VARIABLE_DomainWipeouts_H


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


class DomainWipeoutsLT :
    public StrictWeakVariableOrdering
{
  public:
    DomainWipeoutsLT(Filter& filter) : m_filter(filter) {}

    bool operator()(const Variable* variable0, const Variable* variable1)
    {
        return variable0->domainWipeouts() < variable1->domainWipeouts();
    }

  private:
    Filter& m_filter;
};


class DomainWipeoutsGT :
    public StrictWeakVariableOrdering
{
  public:
    DomainWipeoutsGT(Filter& filter) : m_filter(filter) {}

    bool operator()(const Variable* variable0, const Variable* variable1)
    {
        return variable0->domainWipeouts() > variable1->domainWipeouts();
    }

  private:
    Filter& m_filter;
};


class DomainWipeoutsEQ :
    public StrictWeakVariableOrdering
{
  public:
    DomainWipeoutsEQ(Filter& filter) :
        m_filter(filter),
        m_previousVariable0(0),
        m_previousVariable1(0),
        m_previousDomainWipeouts0(0),
        m_previousDomainWipeouts1(0) {}

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

    void reset()
    {
        m_previousVariable0 = 0;
        m_previousVariable1 = 0;
        m_previousDomainWipeouts0 = 0;
        m_previousDomainWipeouts1 = 0;
    }

  private:
    Filter& m_filter;

    const Variable* m_previousVariable0;
    const Variable* m_previousVariable1;

    ulonglong m_previousDomainWipeouts0;
    ulonglong m_previousDomainWipeouts1;
};


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

        Maximum
    };

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

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

  private:
    DomainWipeouts(const DomainWipeouts&);

    DomainWipeouts& operator=(const DomainWipeouts&);

    Preference m_preference;

    DomainWipeoutsLT m_compareLT;

    DomainWipeoutsGT m_compareGT;

    DomainWipeoutsEQ m_compareEQ;
};


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


#endif // _CSP_HEURISTICS_VARIABLE_DomainWipeouts_H

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

---