|
OdinAI
|
Classes | |
| class | AStarGraphSearch |
| class | DijkstraGraphSearch |
| Given a graph, and an optional target, it calculates the shortest path from the source node to the target. More... | |
| class | Event |
| class | EventManager |
| class | BaseGoal |
| class | AtomicGoal |
| class | CompositeGoal |
| class | GraphEdge |
| class | GraphNode |
| class | NavGraphNode |
| class | NetworkManager |
| class | OdinAIRoot |
| class | IndexedPriorityQLow |
| class | SparseGraph |
| class | Timer |
Typedefs | |
|
typedef std::function< void(const Event *)> | EventCallback |
| typedef unsigned int | uint |
| typedef unsigned short | ushort |
| typedef unsigned char | byte |
|
typedef std::function< void(char *, int)> | AsyncRecvCallback |
Enumerations | |
| enum | Goal_Status { GOAL_FAILED, GOAL_COMPLETE, GOAL_ACTIVE, GOAL_INACTIVE } |
Functions | |
| void | DebugMessage (const char *msg) |
| bool | IsEqual (double a, double b) |
| int | DoubleInt (int a) |
| int | DoubleToIntRound (double value) |
Timer for time dependent code.
|
inline |
Double a number, by using left shift.
|
inline |
Checks if two floats are equal. NOTE: It is the most safe way of doing it!