| ... | ... | @@ -650,7 +650,7 @@ pub const Walker = struct { |
| 650 | 650 | name_buffer: std.ArrayListUnmanaged(u8), |
| 651 | 651 | allocator: Allocator, |
| 652 | 652 | |
| 653 | | pub const WalkerEntry = struct { |
| 653 | pub const Entry = struct { |
| 654 | 654 | /// The containing directory. This can be used to operate directly on `basename` |
| 655 | 655 | /// rather than `path`, avoiding `error.NameTooLong` for deeply nested paths. |
| 656 | 656 | /// The directory remains open until `next` or `deinit` is called. |
| ... | ... | @@ -668,7 +668,7 @@ pub const Walker = struct { |
| 668 | 668 | /// After each call to this function, and on deinit(), the memory returned |
| 669 | 669 | /// from this function becomes invalid. A copy must be made in order to keep |
| 670 | 670 | /// a reference to the path. |
| 671 | | pub fn next(self: *Walker) !?WalkerEntry { |
| 671 | pub fn next(self: *Walker) !?Walker.Entry { |
| 672 | 672 | const gpa = self.allocator; |
| 673 | 673 | while (self.stack.items.len != 0) { |
| 674 | 674 | // `top` and `containing` become invalid after appending to `self.stack` |