voroskoi/pathfinder.zig - Change WD2QUJPWSPGUUG65XIL7HR5BTFH3AKNGXKJSOO655PRHFKEWDMUQC

Rename end to goal. Add comments.

Created by voroskoi on April 10, 2022

WD2QUJPWSPGUUG65XIL7HR5BTFH3AKNGXKJSOO655PRHFKEWDMUQC

Dependencies

In channels

main

Change contents

Insertion in src/grid.zig at line 1 [3.643]

[3.643]

[3.644]

//! Pathfinder algorithms on a grid. The grid is stack-based, we only use heap allocations
//! in solvers.

Insertion in src/grid.zig at line 7 [3.643]

[3.698]

[4.699]

/// Various predefined valid neighbour directions on a 2D grid.

Insertion in src/grid.zig at line 15 [3.643]
[4.794]
[4.794]
```
// XXX: 3D? More dimensions?
```

Insertion in src/grid.zig at line 23 [3.643]

[4.1051]

/// Grid for various pathfinder algorithms.
/// `T` is the type of Grid items.
/// `GRID_ROWS` and `GRID_COLS` defines the Grid size.
/// `dir` is an array of arrays defining the valid neighbour moves.

Insertion in src/grid.zig at line 52 [3.643]

[3.849]

        /// Parses a grid-file located in `path`. The items must be separated with `sep`.

Replacement in src/grid.zig at line 95 [3.643]

B:BD[3.2002] → [5.1277:1383]

        pub fn dijkstra(self: @This(), allocator: std.mem.Allocator, start: [2]usize, end: [2]usize) !T {

[3.2002]

[5.1383]

        /// Finds shortest path between `start` and `goal` using Dijkstra's algorithm.
        /// Returns the path length or `error.PathNotFound`.
        pub fn dijkstra(self: @This(), allocator: std.mem.Allocator, start: [2]usize, goal: [2]usize) !T {

Replacement in src/grid.zig at line 113 [3.643]

B:BD[3.2748] → [3.2748:2801]

                if (std.meta.eql(curr.state, end)) {

[3.2748]

[3.2801]

                if (std.meta.eql(curr.state, goal)) {

Replacement in src/graph_test.zig at line 280 [3.23757]
B:BD[3.33097] → [3.33097:33117]
```
    const end_str =
```
[3.33097]
[3.33117]
```
    const goal_str =
```
Replacement in src/graph_test.zig at line 288 [3.23757]
B:BD[3.33284] → [3.33284:33325]
```
    const end = try parseInput(end_str);
```
[3.33284]
[3.33325]
```
    const goal = try parseInput(goal_str);
```

Replacement in src/graph_test.zig at line 293 [3.23757]

B:BD[3.33413] → [2.1551:1599]

    const ret = try graph.dijkstra(start, end);

[3.33413]

[3.33462]

    const ret = try graph.dijkstra(start, goal);

Replacement in src/graph.zig at line 38 [3.33557]

B:BD[3.34552] → [3.34552:34619]

        pub fn dijkstra(self: *@This(), start: T, end: T) !usize {

[3.34552]

[3.34619]

        pub fn dijkstra(self: *@This(), start: T, goal: T) !usize {

Replacement in src/graph.zig at line 54 [3.33557]

B:BD[3.35157] → [3.35157:35210]

                if (std.meta.eql(curr.state, end)) {

[3.35157]

[3.35210]

                if (std.meta.eql(curr.state, goal)) {