hexmove.h

Go to the documentation of this file.

/*                            Package   : libhex
 * hexmove.h                  Created   : 2008/02/19
 *                            Author    : Alex Tingle
 *
 *    Copyright (C) 2008, Alex Tingle.
 *
 *    This file is part of the libhex application.
 *
 *    libhex 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.1 of the License, or (at your option) any later version.
 *
 *    libhex 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
 */

#ifndef FIRETREE__HEXMOVE_H
#define FIRETREE__HEXMOVE_H 1


#include "hex.h"


namespace hex {

namespace move {


class no_solution: public hex::exception
{
public:
  no_solution(const std::string& w) throw(): hex::exception(w) {}
  virtual ~no_solution() throw() {}
};


typedef double Cost;


class Topography
{
  bool  _has_default;
  Cost  _default;
  std::map<hex::Hex*,Cost>  _hexes;
  std::map<hex::Edge*,Cost>  _edges;
public:
  Topography();
  Topography(Cost default_hex_cost);
  virtual ~Topography() {}
  
  std::set<hex::Hex*> accessible(void) const;

  void increase_hex_cost(hex::Hex* h, Cost c);
  void override_hex_cost(hex::Hex* h, Cost c);
        
  void increase_edge_cost(hex::Edge* e, Cost c);
  void override_edge_cost(hex::Edge* e, Cost c);

  // Convenience functions.
  void increase_cost(const hex::Area& a, Cost c);
  void override_cost(const hex::Area& a, Cost c);
  void increase_cost(const hex::Boundary& b, Cost c);
  void override_cost(const hex::Boundary& b, Cost c);

  hex::Path best_path(hex::Hex* start, hex::Hex* goal) const throw(no_solution);

  hex::Area horizon(hex::Hex* start, Cost budget) const throw(no_solution);

protected:
  struct Step
    {
      hex::Hex*  to_hex;
      Cost       cost;
    };

  Step step(hex::Hex* from_hex, Direction direction) const;
};


class _Route
{
  Cost             _value; 

public:
  std::list<Hex*>  path;  
  Cost             cost;  

  static _Route factory(hex::Hex* start, hex::Hex* goal=NULL);

  _Route step(hex::Hex* next, Cost cost, hex::Hex* goal=NULL) const;
     
  hex::Distance distance(hex::Hex* goal) const;

  bool operator<(const _Route& right) const { return _value < right._value; }
};


} // end namespace move
} // end namespace hex

#endif

---