Resolve requested change for docs for SpatialHashingCellList.

Author: RubberLanding

src/cell_lists/spatial_hashing.jl

@@ -3,9 +3,9 @@
 
 A basic spatial hashing implementation. Similar to [`DictionaryCellList`](@ref), the domain is discretized into cells, 
 and the particles in each cell are stored in a hash map. The hash is computed using the spatial location of each cell 
-[as described by Ihmsen et al. (2001)](@cite Ihmsen2003). By using a hash map, which only stores non-empty cells, 
-the domain is effectively infinite. The size of the hash map is recommended to be approximately twice the number of particles to balance memory consumption  
-against the likelihood of hash collisions.
+[as described by Ihmsen et al. (2001)](@cite Ihmsen2003). By using a hash map that stores entries only for non-empty cells, 
+the domain is effectively infinite. The size of the hash map is recommended to be approximately twice the number of particles
+to balance memory consumption against the likelihood of hash collisions.
 
 # Arguments
 - `NDIMS::Int`: Number of spatial dimensions (e.g., `2` or `3`).

src/nhs_grid.jl

@@ -312,8 +312,7 @@ end
 
     # `each_cell_index(cell_list)` might return a `KeySet`, which has to be `collect`ed
     # first to be able to be used in a threaded loop. This function takes care of that.
-    @threaded parallelization_backend for cell_index in
-                                          each_cell_index_threadable(cell_list)
+    @threaded parallelization_backend for cell_index in each_cell_index_threadable(cell_list)
         mark_changed_cell!(neighborhood_search, cell_index, y)
     end
 end
@@ -361,13 +360,12 @@ function update_grid!(neighborhood_search::GridNeighborhoodSearch{<:Any,
     # We can work around this by using the old lengths.
     # TODO this is hardcoded for the `FullGridCellList`
     @threaded parallelization_backend for i in eachindex(update_buffer,
-                                                    cell_list.cells.lengths)
+                                                         cell_list.cells.lengths)
         update_buffer[i] = cell_list.cells.lengths[i]
     end
 
     # Add points to new cells
-    @threaded parallelization_backend for cell_index in
-                                          each_cell_index_threadable(cell_list)
+    @threaded parallelization_backend for cell_index in each_cell_index_threadable(cell_list)
         for i in 1:update_buffer[cell_index]
             point = cell_list.cells.backend[i, cell_index]
             point_coords = extract_svector(y, Val(ndims(neighborhood_search)), point)
@@ -381,8 +379,7 @@ function update_grid!(neighborhood_search::GridNeighborhoodSearch{<:Any,
     end
 
     # Remove points from old cells
-    @threaded parallelization_backend for cell_index in
-                                          each_cell_index_threadable(cell_list)
+    @threaded parallelization_backend for cell_index in each_cell_index_threadable(cell_list)
         points = cell_list[cell_index]
 
         # WARNING!!!

test/cell_lists/spatial_hashing.jl

@@ -51,7 +51,7 @@
             cell2_hash = PointNeighbors.spatial_hash(cell2, n_points)
             points1 = nhs.cell_list[cell1]
             points2 = nhs.cell_list[cell2]
-            
+
             @test points1 == points2 == [1, 2]
             @test cell1_hash == cell2_hash
         end

test/neighborhood_search.jl

@@ -132,10 +132,11 @@
 
         seeds = [1, 2]
         name(size,
-             seed) = "$(length(size))D with $(prod(size)) Particles " *
-                     "($(seed == 1 ? "`initialize!`" : "`update!`"))"
+        seed) = "$(length(size))D with $(prod(size)) Particles " *
+                "($(seed == 1 ? "`initialize!`" : "`update!`"))"
         @testset verbose=true "$(name(cloud_size, seed)))" for cloud_size in cloud_sizes,
                                                                seed in seeds
+
             coords = point_cloud(cloud_size, seed = seed)
             NDIMS = length(cloud_size)
             n_points = size(coords, 2)