Atoms Crowd
4.1.0
|
#include <DetourNavMeshQuery.h>
Public Member Functions | |
dtQueryFilter (bool inIsVirtual=true) | |
bool | passFilter (const dtPolyRef ref, const dtMeshTile *tile, const dtPoly *poly) const |
float | getCost (const float *pa, const float *pb, const dtPolyRef prevRef, const dtMeshTile *prevTile, const dtPoly *prevPoly, const dtPolyRef curRef, const dtMeshTile *curTile, const dtPoly *curPoly, const dtPolyRef nextRef, const dtMeshTile *nextTile, const dtPoly *nextPoly) const |
bool | equals (const dtQueryFilter *other) const |
Check if two filters have the same data values. | |
bool | equals (const dtQueryFilter &other) const |
void | copyFrom (const dtQueryFilter *other) |
Copy data values from source filter. | |
void | copyFrom (const dtQueryFilter &other) |
Getters and setters for the default implementation data. | |
float | getAreaCost (const int i) const |
void | setAreaCost (const int i, const float cost) |
const float * | getAllAreaCosts () const |
float | getAreaFixedCost (const int i) const |
void | setAreaFixedCost (const int i, const float cost) |
const float * | getAllFixedAreaCosts () const |
float | getModifiedHeuristicScale () const |
float | getHeuristicScale () const |
void | setHeuristicScale (const float newScale) |
Set euclidean distance heuristic scale. | |
bool | isValidLinkSide (const unsigned char side) const |
void | setIsBacktracking (const bool isBacktracking) |
Sets up filter for backtracking. | |
bool | getIsBacktracking () const |
void | setShouldIgnoreClosedNodes (const bool shouldIgnore) |
Instruct filter whether it can reopen nodes already on closed list. | |
bool | getShouldIgnoreClosedNodes () const |
unsigned short | getIncludeFlags () const |
void | setIncludeFlags (const unsigned short flags) |
unsigned short | getExcludeFlags () const |
void | setExcludeFlags (const unsigned short flags) |
Protected Member Functions | |
bool | passInlineFilter (const dtPolyRef ref, const dtMeshTile *tile, const dtPoly *poly) const |
inlined filter implementation. More... | |
virtual bool | passVirtualFilter (const dtPolyRef ref, const dtMeshTile *tile, const dtPoly *poly) const |
virtual filter implementation (defaults to passInlineFilter). More... | |
float | getInlineCost (const float *pa, const float *pb, const dtPolyRef prevRef, const dtMeshTile *prevTile, const dtPoly *prevPoly, const dtPolyRef curRef, const dtMeshTile *curTile, const dtPoly *curPoly, const dtPolyRef nextRef, const dtMeshTile *nextTile, const dtPoly *nextPoly) const |
inlined scoring function. More... | |
virtual float | getVirtualCost (const float *pa, const float *pb, const dtPolyRef prevRef, const dtMeshTile *prevTile, const dtPoly *prevPoly, const dtPolyRef curRef, const dtMeshTile *curTile, const dtPoly *curPoly, const dtPolyRef nextRef, const dtMeshTile *nextTile, const dtPoly *nextPoly) const |
virtual scoring function implementation (defaults to getInlineCost). More... | |
Protected Attributes | |
dtQueryFilterData | data |
const bool | isVirtual |
Defines polygon filtering and traversal costs for navigation mesh query operations.
|
inline |
Returns the traversal cost of the area.
[in] | i | The id of the area. |
|
inline |
Returns the fixed cost for entering an area.
[in] | i | The id of the area. |
|
inline |
Returns cost to move from the beginning to the end of a line segment that is fully contained within a polygon.
[in] | pa | The start position on the edge of the previous and current polygon. [(x, y, z)] |
[in] | pb | The end position on the edge of the current and next polygon. [(x, y, z)] |
[in] | prevRef | The reference id of the previous polygon. [opt] |
[in] | prevTile | The tile containing the previous polygon. [opt] |
[in] | prevPoly | The previous polygon. [opt] |
[in] | curRef | The reference id of the current polygon. |
[in] | curTile | The tile containing the current polygon. |
[in] | curPoly | The current polygon. |
[in] | nextRef | The reference id of the next polygon. [opt] |
[in] | nextTile | The tile containing the next polygon. [opt] |
[in] | nextPoly | The next polygon. [opt] |
|
inline |
Returns the exclude flags for the filter. Any polygons that include one ore more of these flags will be excluded from the operation.
|
inline |
Retrieves euclidean distance heuristic scale
|
inline |
Returns the include flags for the filter. Any polygons that include one or more of these flags will be included in the operation.
|
inlineprotected |
inlined scoring function.
|
inline |
Retrieves information whether this filter is set up for backtracking
|
inline |
Retrieves information whether this filter allows reopening closed nodes
|
inlineprotectedvirtual |
virtual scoring function implementation (defaults to getInlineCost).
|
inline |
Filters link in regards to its side. Used for backtracking.
|
inline |
Returns true if the polygon can be visited. (I.e. Is traversable.)
[in] | ref | The reference id of the polygon test. |
[in] | tile | The tile containing the polygon. |
[in] | poly | The polygon to test. |
|
inlineprotected |
inlined filter implementation.
|
inlineprotectedvirtual |
virtual filter implementation (defaults to passInlineFilter).
|
inline |
Sets the traversal cost of the area.
[in] | i | The id of the area. |
[in] | cost | The new cost of traversing the area. |
|
inline |
Sets the fixed cost for entering an area.
[in] | i | The id of the area. |
[in] | cost | The new fixed cost of entering the area polygon. |
|
inline |
Sets the exclude flags for the filter.
[in] | flags | The new flags. |
|
inline |
Sets the include flags for the filter.
[in] | flags | The new flags. |