BWAPI
|
#include <functional>
#include <set>
#include <BWAPI.h>
#include <utility>
#include <queue>
#include <bitset>
#include <vector>
#include <boost/unordered_set.hpp>
#include <boost/dynamic_bitset.hpp>
#include <boost/numeric/conversion/bounds.hpp>
#include "../../Utils/Logger.h"
Go to the source code of this file.
Classes | |
class | InfluenceMap< InfluenceType > |
Class that contains influence information (air, ground, etc.) about a player on the map. More... | |
struct | InfluenceMaps::detail::FunctorAdapter |
Adapter functor that redirects a call to a functor with the correct number of actual influence maps. More... | |
struct | InfluenceMaps::detail::VectorOpenList |
struct | InfluenceMaps::detail::BitSetOpenList< N > |
struct | InfluenceMaps::detail::DynamicBitSetOpenList |
struct | InfluenceMaps::detail::SetOpenList< SetType > |
struct | InfluenceMaps::detail::breadth_first_search< GoalTest, T0, T1, T2, T3 > |
Functor that performs a breadth-first search on a variable number of influence maps. Do not use this functor directly; use InfluenceMaps::breadth_first_search(...) instead. More... | |
struct | InfluenceMaps::detail::gradient_descent< Gradient, StopCriterion, T0, T1, T2, T3 > |
Functor that performs a gradient descent on a variable number of influence maps. Do not use this functor directly; use InfluenceMaps::gradient_descent(...) instead. More... | |
Namespaces | |
namespace | InfluenceMaps |
namespace | InfluenceMaps::detail |
Typedefs | |
typedef boost::tuples::null_type | InfluenceMaps::detail::Nothing |
typedef SetOpenList< std::set < int > > | InfluenceMaps::detail::StdSetOpenList |
typedef SetOpenList < boost::unordered_set< int > > | InfluenceMaps::detail::UnorderedSetOpenList |
typedef BitSetOpenList< 256 *256 > | InfluenceMaps::detail::OpenListType |
Functions | |
template<class InfluenceType > | |
void | InfluenceMaps::detail::getAdjacentTiles (int x, int y, std::vector< std::pair< int, int >> &adj, const InfluenceMap< InfluenceType > &map, bool shuffle=false) |
Returns a set containing the valid tiles adjacent to the given position. Do not use directly. | |
template<class GoalTest , class T0 > | |
std::pair< int, int > | InfluenceMaps::breadth_first_search (int x, int y, GoalTest test, const InfluenceMap< T0 > &map) |
Performs a breadth-first search on an influence map. | |
template<class GoalTest , class T0 , class T1 > | |
std::pair< int, int > | InfluenceMaps::breadth_first_search (int x, int y, GoalTest test, const InfluenceMap< T0 > &map0, const InfluenceMap< T1 > &map1) |
Performs a breadth-first search on two influence maps simultaneously. | |
template<class GoalTest , class T0 , class T1 , class T2 > | |
std::pair< int, int > | InfluenceMaps::breadth_first_search (int x, int y, GoalTest test, const InfluenceMap< T0 > &map0, const InfluenceMap< T1 > &map1, const InfluenceMap< T2 > &map2) |
Performs a breadth-first search on three influence maps simultaneously. | |
template<class Gradient , class StopCriterion , class T0 > | |
std::pair< int, int > | InfluenceMaps::gradient_descent (int x, int y, Gradient gradient, StopCriterion stop, const InfluenceMap< T0 > &map0) |
Performs a gradient descent on an influence map. | |
template<class Gradient , class StopCriterion , class T0 , class T1 > | |
std::pair< int, int > | InfluenceMaps::gradient_descent (int x, int y, Gradient gradient, StopCriterion stop, const InfluenceMap< T0 > &map0, const InfluenceMap< T1 > &map1) |
Performs a gradient descent on three two maps simultaneously. | |
template<class Gradient , class StopCriterion , class T0 , class T1 , class T2 > | |
std::pair< int, int > | InfluenceMaps::gradient_descent (int x, int y, Gradient gradient, StopCriterion stop, const InfluenceMap< T0 > &map0, const InfluenceMap< T1 > &map1, const InfluenceMap< T2 > &map2) |
Performs a gradient descent on three influence maps simultaneously. |