Conflicts.h

// Conflicts.h -- The `minimum/maximum conflicts' value 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: Conflicts_8h-source.html,v 1.1 2005/05/25 12:37:18 tudor Exp $

#ifndef _CSP_HEURISTICS_VALUE_Conflicts_H
#define _CSP_HEURISTICS_VALUE_Conflicts_H


#include "../../caches/ConflictCounts.h"


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


class ConflictCountLT :
    public StrictWeakValueOrdering
{
  public:
    ConflictCountLT(caches::ConflictCounts& conflictCounts) :
        m_conflictCounts(conflictCounts) {}

    bool operator()(const Value* value0, const Value* value1)
    {
        return
            m_conflictCounts.conflictCount(*value0) <
            m_conflictCounts.conflictCount(*value1);
    }

  private:
    caches::ConflictCounts& m_conflictCounts;
};


class ConflictCountGT :
    public StrictWeakValueOrdering
{
  public:
    ConflictCountGT(caches::ConflictCounts& conflictCounts) :
        m_conflictCounts(conflictCounts) {}

    bool operator()(const Value* value0, const Value* value1)
    {
        return
            m_conflictCounts.conflictCount(*value0) >
            m_conflictCounts.conflictCount(*value1);
    }

  private:
    caches::ConflictCounts& m_conflictCounts;
};


class ConflictCountEQ :
    public StrictWeakValueOrdering
{
  public:
    ConflictCountEQ(caches::ConflictCounts& conflictCounts) :
        m_conflictCounts(conflictCounts),
        m_previousValue0(0),
        m_previousValue1(0),
        m_previousConflictCount0(0),
        m_previousConflictCount1(0) {}

    bool operator()(const Value* value0, const Value* value1);

    void reset()
    {
        m_previousValue0 = 0;
        m_previousValue1 = 0;
        m_previousConflictCount0 = 0;
        m_previousConflictCount1 = 0;
    }

  private:
    caches::ConflictCounts& m_conflictCounts;

    const Value* m_previousValue0;
    const Value* m_previousValue1;

    size_t m_previousConflictCount0;
    size_t m_previousConflictCount1;
};


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

        Maximum
    };

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

    ~Conflicts();

    virtual void init(const vlist_type& uninstantiatedVariables);

    virtual void done();

    virtual void dynamicInit(Variable& variable, Domain& selectable);

    virtual void dynamicDone(Variable& variable);

    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:
    Conflicts(const Conflicts&);

    Conflicts& operator=(const Conflicts&);

    void compute(const Constraint& c);

    Preference m_preference;

    bool m_dynamic;

    caches::ConflictCounts m_conflictCounts;

    ConflictCountLT m_compareLT;

    ConflictCountGT m_compareGT;

    ConflictCountEQ m_compareEQ;
};


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


#endif // _CSP_HEURISTICS_VALUE_Conflicts_H

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

---