Failures.h

// Failure.h -- The `minimum/maximum failures' value ordering
// heuristic interface.

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

#ifndef _CSP_HEURISTICS_VALUE_Failures_H
#define _CSP_HEURISTICS_VALUE_Failures_H


CSP_NAMESPACE_BEGIN(csp);
CSP_NAMESPACE_BEGIN(heuristics);
CSP_NAMESPACE_BEGIN(values);


class FailureCountLT :
    public StrictWeakValueOrdering
{
  public:
    FailureCountLT() {}

    bool operator()(const Value* value0, const Value* value1)
    {
        return value0->failures() < value1->failures();
    }
};


class FailureCountGT :
    public StrictWeakValueOrdering
{
  public:
    FailureCountGT() {}

    bool operator()(const Value* value0, const Value* value1)
    {
        return value0->failures() > value1->failures();
    }
};


class FailureCountEQ :
    public StrictWeakValueOrdering
{
  public:
    FailureCountEQ() {}

    bool operator()(const Value* value0, const Value* value1)
    {
        return value0->failures() == value1->failures();
    }
};


class CSP_API Failures :
    public ValueOH
{
  public:
    enum Preference
    {
        Minimum,

        Maximum
    };

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

    virtual void select(
        Domain& selectable,
        Domain& selected,
        Variable& variable);

    virtual bool better(const Value& value0, const Value& value1);

    virtual bool equal(const Value& value0, const Value& value1);

    virtual void sort(
        Domain& original,
        Domain& sorted,
        Variable& variable);

    virtual long double score(Variable& variable, const Value& value);

  private:
    Failures(const Failures&);

    Failures& operator=(const Failures&);

    Preference m_preference;

    FailureCountLT m_compareLT;

    FailureCountGT m_compareGT;

    FailureCountEQ m_compareEQ;
};


CSP_NAMESPACE_END(values);
CSP_NAMESPACE_END(heuristics);
CSP_NAMESPACE_END(csp);


#endif // _CSP_HEURISTICS_VALUE_Failures_H

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

---