Fix missing for-loop increment in C frontier updater

Author: HexDecimal

CHANGELOG.md

@@ -9,6 +9,7 @@ This project adheres to [Semantic Versioning](https://semver.org/) since version
 ### Fixed
 
 - Fixed dangling pointer in `Pathfinder.clear` method.
+- Fixed hang in `Pathfinder.rebuild_frontier` method.
 
 ## [19.4.0] - 2025-08-06
 

tcod/path.c

@@ -454,7 +454,7 @@ static int update_frontier_from_distance_iterator(
     int dist = get_array_int(dist_map, dimension, index);
     return TCOD_frontier_push(frontier, index, dist, dist);
   }
-  for (int i = 0; i < dist_map->shape[dimension];) {
+  for (int i = 0; i < dist_map->shape[dimension]; ++i) {
     index[dimension] = i;
     int err = update_frontier_from_distance_iterator(frontier, dist_map, dimension + 1, index);
     if (err) { return err; }

tcod/path.py

@@ -1246,6 +1246,20 @@ def rebuild_frontier(self) -> None:
         After you are finished editing :any:`distance` you must call this
         function before calling :any:`resolve` or any function which calls
         :any:`resolve` implicitly such as :any:`path_from` or :any:`path_to`.
+
+        Example::
+
+            >>> import tcod.path
+            >>> graph = tcod.path.SimpleGraph(
+            ...     cost=np.ones((5, 5), np.int8), cardinal=2, diagonal=3,
+            ... )
+            >>> pf = tcod.path.Pathfinder(graph)
+            >>> pf.distance[:, 0] = 0  # Set roots along entire left edge
+            >>> pf.rebuild_frontier()
+            >>> pf.path_to((0, 2)).tolist()  # Finds best path from [:, 0]
+            [[0, 0], [0, 1], [0, 2]]
+            >>> pf.path_to((4, 2)).tolist()
+            [[4, 0], [4, 1], [4, 2]]
         """
         lib.TCOD_frontier_clear(self._frontier_p)
         self._update_heuristic(None)