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
---
.../Grid/Jobs/JobMergeRaycastCollisionHits.cs | 31 ++++++++++++++++++++++
1 file changed, 31 insertions(+)
create mode 100644 Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobMergeRaycastCollisionHits.cs
(limited to 'Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobMergeRaycastCollisionHits.cs')
diff --git a/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobMergeRaycastCollisionHits.cs b/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobMergeRaycastCollisionHits.cs
new file mode 100644
index 0000000..61707dd
--- /dev/null
+++ b/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Graphs/Grid/Jobs/JobMergeRaycastCollisionHits.cs
@@ -0,0 +1,31 @@
+using UnityEngine;
+using Unity.Burst;
+using Unity.Collections;
+using Unity.Jobs;
+
+namespace Pathfinding.Graphs.Grid.Jobs {
+ ///
+ /// Calculates if either of the two input hits actually hit something.
+ ///
+ /// result[i] = true if hit1[i] or hit2[i] is a valid hit.
+ ///
+ /// A valid hit will always have a non-zero normal.
+ ///
+ [BurstCompile]
+ public struct JobMergeRaycastCollisionHits : IJob {
+ [ReadOnly]
+ public NativeArray hit1;
+
+ [ReadOnly]
+ public NativeArray hit2;
+
+ [WriteOnly]
+ public NativeArray result;
+
+ public void Execute () {
+ for (int i = 0; i < hit1.Length; i++) {
+ result[i] = hit1[i].normal == Vector3.zero && hit2[i].normal == Vector3.zero;
+ }
+ }
+ }
+}
--
cgit v1.1-26-g67d0