AtomsUtils::dtQueryFilterData Struct Reference

Public Member Functions
bool	equals (const dtQueryFilterData *other) const
void	copyFrom (const dtQueryFilterData *source)

Public Attributes
float	m_areaCost [DT_MAX_AREAS]
	Cost per area type. (Used by default implementation.)
float	m_areaFixedCost [DT_MAX_AREAS]
	Fixed cost for entering an area type (Used by default implementation.)
float	heuristicScale
	Search heuristic scale.
float	lowestAreaCost
unsigned short	m_includeFlags
	Flags for polygons that can be visited. (Used by default implementation.)
unsigned short	m_excludeFlags
	Flags for polygons that should not be visited. (Used by default implementation.)
bool	m_isBacktracking
bool	m_shouldIgnoreClosedNodes

Member Data Documentation

m_shouldIgnoreClosedNodes

bool AtomsUtils::dtQueryFilterData::m_shouldIgnoreClosedNodes

whether to ignore neighbour nodes that have already been visited. FALSE by default but you might want to set it to true if using heuristic scale much larger than 1 or experiencing cycles in our paths for any other reason

---

The documentation for this struct was generated from the following file:

• C:/projects/atomsCrowd/AtomsUtils/include/AtomsUtils/NavigationMesh/Detour/DetourNavMeshQuery.h