mirror of
https://github.com/wesnoth/wesnoth
synced 2025-05-10 12:56:24 +00:00
42 lines
1.2 KiB
C++
42 lines
1.2 KiB
C++
/* $Id$ */
|
|
/*
|
|
Copyright (C) 2003 - 2012 by David White <dave@whitevine.net>
|
|
Part of the Battle for Wesnoth Project http://www.wesnoth.org/
|
|
|
|
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 2 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.
|
|
|
|
See the COPYING file for more details.
|
|
*/
|
|
|
|
/** @file */
|
|
|
|
#ifndef UNIT_HELPER_HPP_INCLUDED
|
|
#define UNIT_HELPER_HPP_INCLUDED
|
|
|
|
#include "unit_map.hpp"
|
|
|
|
namespace unit_helper {
|
|
|
|
/**
|
|
* Encapsulates the logic for deciding whether an iterator @a u points to
|
|
* a unit that can advance.
|
|
* @return true if the unit exists, has available advances, and can_advance().
|
|
*/
|
|
bool will_certainly_advance(const unit_map::iterator &u);
|
|
|
|
/**
|
|
* Determines the total number of available advancements (of any kind) for
|
|
* a given unit. This includes normal advances and modifiers.
|
|
* @return the total number of possible advancements.
|
|
*/
|
|
int number_of_possible_advances(const unit &unit);
|
|
|
|
}
|
|
|
|
#endif
|