diff options
author | chai <215380520@qq.com> | 2024-05-23 10:08:29 +0800 |
---|---|---|
committer | chai <215380520@qq.com> | 2024-05-23 10:08:29 +0800 |
commit | 8722a9920c1f6119bf6e769cba270e63097f8e25 (patch) | |
tree | 2eaf9865de7fb1404546de4a4296553d8f68cc3b /Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Utilities/AstarChecksum.cs | |
parent | 3ba4020b69e5971bb0df7ee08b31d10ea4d01937 (diff) |
+ astar project
Diffstat (limited to 'Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Utilities/AstarChecksum.cs')
-rw-r--r-- | Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Utilities/AstarChecksum.cs | 21 |
1 files changed, 21 insertions, 0 deletions
diff --git a/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Utilities/AstarChecksum.cs b/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Utilities/AstarChecksum.cs new file mode 100644 index 0000000..b492542 --- /dev/null +++ b/Other/AstarPathfindingDemo/Packages/com.arongranberg.astar/Utilities/AstarChecksum.cs @@ -0,0 +1,21 @@ +using System; +namespace Pathfinding.Util { + /// <summary>Calculates checksums of byte arrays</summary> + public class Checksum { + /// <summary> + /// Calculate checksum for the byte array starting from a previous values. + /// Useful if data is split up between several byte arrays + /// </summary> + public static uint GetChecksum (byte[] arr, uint hash) { + // Sort of implements the Fowler–Noll–Vo hash function + const int prime = 16777619; + + hash ^= 2166136261U; + + for (int i = 0; i < arr.Length; i++) + hash = (hash ^ arr[i]) * prime; + + return hash; + } + } +} |