/home/archives/knight-path/branch.1/branch.0/delta5682.018/knight-path/taxi_distance.h

Go to the documentation of this file.

//
// knight-path - shortest knight path between two squares
// Copyright (C) 2011 Peter Miller
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 3 of the License, or (at
// your option) any later version.
//
// This program 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
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License along
// with this program. If not, see <http://www.gnu.org/licenses/>.
//

#ifndef KNIGHT_PATH_TAXI_DISTANCE_H
#define KNIGHT_PATH_TAXI_DISTANCE_H

#include <knight-path/position.h>

class taxi_distance
{
public:
    ~taxi_distance() { }

    taxi_distance(const position &agoal) : goal(agoal) { }

    bool
    operator()(const position &lhs, const position &rhs)
    {
        return (goal.distance(lhs) < goal.distance(rhs));
    }

    taxi_distance(const taxi_distance &rhs) :
        goal(rhs.goal)
    {
    }

    taxi_distance &operator=(const taxi_distance &rhs)
    {
        if (this != &rhs)
        {
            goal = rhs.goal;
        }
        return *this;
    }

private:
    position goal;

    taxi_distance();
};

#endif // KNIGHT_PATH_TAXI_DISTANCE_H