#include <algorithm>
#include <cmath>
#include <functional>
#include <iosfwd>
#include <mutable/Options.hpp>
#include <mutable/util/ADT.hpp>
#include <mutable/util/exception.hpp>
#include <mutable/util/macro.hpp>
#include <mutable/util/OptField.hpp>
#include <type_traits>
#include <unordered_map>
#include <vector>
Go to the source code of this file.
|
struct | m::ai::budget_exhausted_exception |
|
struct | m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context > |
| Tracks states and their presence in queues. More...
|
|
struct | m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >::comparator |
|
comparator for map entries based on states' g + h value
More...
|
|
struct | m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >::Partitions< true > |
|
struct | m::ai::StateManager< State, Expand, Heurisitc, HasRegularQueue, HasBeamQueue, Config, Context >::Partitions< false > |
|
struct | m::ai::SearchConfiguration< StaticConfig > |
| Relies on the rules of aggregate initialization More...
|
|
struct | m::ai::genericAStar< State, Expand, Heuristic, StaticConfig, Context > |
| Implements a generic A* search algorithm. More...
|
|
|
namespace | m |
|
mutable namespace
|
|
namespace | m::ai |
|
◆ DEF_COUNTER [1/2]
#define DEF_COUNTER |
( |
|
NAME | ) |
|
Value: private: \
std::size_t num_##NAME##_ = 0; \
void inc_##NAME() { ++num_##NAME##_; } \
public: \
std::size_t num_##NAME() const { return num_##NAME##_; }
Definition at line 661 of file HeuristicSearch.hpp.
◆ DEF_COUNTER [2/2]
#define DEF_COUNTER |
( |
|
NAME | ) |
|
Value: private: \
std::size_t num_##NAME##_ = 0; \
void inc_##NAME() { ++num_##NAME##_; } \
public: \
std::size_t num_##NAME() const { return num_##NAME##_; }
Definition at line 661 of file HeuristicSearch.hpp.
#define X |
( |
|
NAME | ) |
num_##NAME() << " " #NAME |