/*
recast4j copyright (c) 2021 Piotr Piastucki piotr@jtilia.org
DotRecast Copyright (c) 2023-2024 Choi Ikpil ikpil@naver.com
Copyright (c) 2024 Facepunch Studios Ltd

This software is provided 'as-is', without any express or implied
warranty.  In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
 claim that you wrote the original software. If you use this software
 in a product, an acknowledgment in the product documentation would be
 appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
 misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/

namespace DotRecast.Detour.Crowd
{
	internal class DtCrowdConfig
	{
		public readonly float maxAgentRadius;
		public readonly float maxAgentHeight;

		public int pathQueueSize = 32; // Max number of path requests in the queue
		public int maxFindPathIterations = 100; // Max number of sliced path finding iterations executed per update (used to handle longer paths and replans)
		public int maxTargetFindPathIterations = 20; // Max number of sliced path finding iterations executed per agent to find the initial path to target
		public float topologyOptimizationTimeThreshold = 0.5f; // Min time between topology optimizations (in seconds)
		public int checkLookAhead = 16; // The number of polygons from the beginning of the corridor to check to ensure path validity
		public float targetReplanDelay = 1.0f; // Min time between target re-planning (in seconds)
		public int maxTopologyOptimizationIterations = 32; // Max number of sliced path finding iterations executed per topology optimization per agent
		public float collisionResolveFactor = 0.7f;
		public int maxObstacleAvoidanceCircles = 12; // Max number of neighbour agents to consider in obstacle avoidance processing
		public int maxObstacleAvoidanceSegments = 16; // Max number of neighbour segments to consider in obstacle avoidance processing
		public int obstacleAvoidanceParallelism = Math.Max( (Environment.ProcessorCount / 2) - 1, 1 ); // Number of parallel obstacle avoidance threads
		public IDtQueryFilter defaultFilter;

		public DtCrowdConfig( float maxAgentRadius, float maxAgentHeight )
		{
			this.maxAgentRadius = maxAgentRadius;
			this.maxAgentHeight = maxAgentHeight;
		}
	}
}
