Improve access's to HashMaps

Author: Indy2222

crates/index/src/grid.rs

@@ -112,18 +112,12 @@ impl TileGrid {
     }
 
     fn insert_to_tile(&mut self, entity: Entity, tile_coords: IVec2) {
-        match self.tiles.get_mut(&tile_coords) {
-            Some(tile) => {
-                let inserted = tile.insert(entity);
-                debug_assert!(inserted);
-            }
-            None => {
-                let mut tile = AHashSet::new();
-                tile.insert(entity);
-                let old = self.tiles.insert(tile_coords, tile);
-                debug_assert!(old.is_none());
-            }
-        }
+        let inserted = self
+            .tiles
+            .entry(tile_coords)
+            .or_insert_with(AHashSet::new)
+            .insert(entity);
+        debug_assert!(inserted);
     }
 
     fn remove_from_tile(&mut self, entity: Entity, tile_coords: IVec2) {

crates/pathing/src/exclusion.rs

@@ -132,12 +132,10 @@ impl Merger {
 
     fn insert(&mut self, exclusion: ExclusionArea) {
         let key = self.key(&exclusion);
-        match self.grid.get_mut(&key) {
-            Some(exclusions) => exclusions.push(exclusion),
-            None => {
-                self.grid.insert(key, vec![exclusion]);
-            }
-        }
+        self.grid
+            .entry(key)
+            .or_insert_with(Vec::new)
+            .push(exclusion);
     }
 
     fn remove_intersecting(&mut self, exclusion: &ExclusionArea) -> Vec<ExclusionArea> {