Talon
/
stardew-access
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Changes `searched` from List to HashSet; saves ~43ms in `SearchLocation

master
Katie Durden 2023-02-25 21:49:27 -08:00
parent 32db14b329
commit e9ba7c96b9
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
stardew-access/Features/Radar.cs
View File

@ -1,3 +1,4 @@
using System.Collections.Generic;
using Microsoft.Xna.Framework; using Microsoft.Xna.Framework;
using StardewValley; using StardewValley;
using StardewValley.Objects; using StardewValley.Objects;
@ -94,7 +95,7 @@ namespace stardew_access.Features
Dictionary<Vector2, (string, string)> detectedTiles = new Dictionary<Vector2, (string, string)>(); Dictionary<Vector2, (string, string)> detectedTiles = new Dictionary<Vector2, (string, string)>();
Queue<Vector2> toSearch = new Queue<Vector2>(); Queue<Vector2> toSearch = new Queue<Vector2>();
List<Vector2> searched = new List<Vector2>(); HashSet<Vector2> searched = new HashSet<Vector2>();
int[] dirX = { -1, 0, 1, 0 }; int[] dirX = { -1, 0, 1, 0 };
int[] dirY = { 0, 1, 0, -1 }; int[] dirY = { 0, 1, 0, -1 };
@ -142,7 +143,7 @@ namespace stardew_access.Features
(bool, string? name, string category) tileInfo; (bool, string? name, string category) tileInfo;
Queue<Vector2> toSearch = new Queue<Vector2>(); Queue<Vector2> toSearch = new Queue<Vector2>();
List<Vector2> searched = new List<Vector2>(); HashSet<Vector2> searched = new HashSet<Vector2>();
int[] dirX = { -1, 0, 1, 0 }; int[] dirX = { -1, 0, 1, 0 };
int[] dirY = { 0, 1, 0, -1 }; int[] dirY = { 0, 1, 0, -1 };
int count = 0; int count = 0;
@ -185,7 +186,7 @@ namespace stardew_access.Features
/// <param name="searched">The list of searched items.</param> /// <param name="searched">The list of searched items.</param>
/// <param name="limit">The radius of search</param> /// <param name="limit">The radius of search</param>
/// <returns>Returns true if the tile is valid for search.</returns> /// <returns>Returns true if the tile is valid for search.</returns>
public bool isValid(Vector2 item, Vector2 center, List<Vector2> searched, int limit) public bool isValid(Vector2 item, Vector2 center, HashSet<Vector2> searched, int limit)
{ {
if (Math.Abs(item.X - center.X) > limit) if (Math.Abs(item.X - center.X) > limit)
return false; return false;