From 8722a9920c1f6119bf6e769cba270e63097f8e25 Mon Sep 17 00:00:00 2001
From: chai <215380520@qq.com>
Date: Thu, 23 May 2024 10:08:29 +0800
Subject: + astar project

---
 .../Graphs/Grid/Jobs/JobCheckCollisions.cs         | 33 ++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobCheckCollisions.cs

(limited to 'Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobCheckCollisions.cs')

diff --git a/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobCheckCollisions.cs b/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobCheckCollisions.cs
new file mode 100644
index 0000000..71a3d2c
--- /dev/null
+++ b/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobCheckCollisions.cs
@@ -0,0 +1,33 @@
+using UnityEngine;
+using Unity.Collections;
+using Pathfinding.Jobs;
+
+namespace Pathfinding.Graphs.Grid.Jobs {
+	/// <summary>
+	/// Checks if nodes are obstructed by obstacles or not.
+	///
+	/// See: <see cref="GraphCollision"/>
+	/// </summary>
+	struct JobCheckCollisions : IJobTimeSliced {
+		[ReadOnly]
+		public NativeArray<Vector3> nodePositions;
+		public NativeArray<bool> collisionResult;
+		public GraphCollision collision;
+		int startIndex;
+
+		public void Execute () {
+			Execute(TimeSlice.Infinite);
+		}
+
+		public bool Execute (TimeSlice timeSlice) {
+			for (int i = startIndex; i < nodePositions.Length; i++) {
+				collisionResult[i] = collisionResult[i] && collision.Check(nodePositions[i]);
+				if ((i & 127) == 0 && timeSlice.expired) {
+					startIndex = i + 1;
+					return false;
+				}
+			}
+			return true;
+		}
+	}
+}
-- 
cgit v1.1-26-g67d0