| ... | ... | @@ -197,7 +197,7 @@ pub const Progress = struct { |
| 197 | 197 | var maybe_node: ?*Node = &self.root; |
| 198 | 198 | while (maybe_node) |node| { |
| 199 | 199 | if (need_ellipse) { |
| 200 | | self.bufWrite(&end, "...", .{}); |
| 200 | self.bufWrite(&end, "... ", .{}); |
| 201 | 201 | } |
| 202 | 202 | need_ellipse = false; |
| 203 | 203 | if (node.name.len != 0 or node.estimated_total_items != null) { |
| ... | ... | @@ -218,7 +218,7 @@ pub const Progress = struct { |
| 218 | 218 | maybe_node = node.recently_updated_child; |
| 219 | 219 | } |
| 220 | 220 | if (need_ellipse) { |
| 221 | | self.bufWrite(&end, "...", .{}); |
| 221 | self.bufWrite(&end, "... ", .{}); |
| 222 | 222 | } |
| 223 | 223 | } |
| 224 | 224 | |
| ... | ... | @@ -253,7 +253,7 @@ pub const Progress = struct { |
| 253 | 253 | const bytes_needed_for_esc_codes_at_end = if (std.builtin.os.tag == .windows) 0 else 11; |
| 254 | 254 | const max_end = self.output_buffer.len - bytes_needed_for_esc_codes_at_end; |
| 255 | 255 | if (end.* > max_end) { |
| 256 | | const suffix = "..."; |
| 256 | const suffix = "... "; |
| 257 | 257 | self.columns_written = self.columns_written - (end.* - max_end) + suffix.len; |
| 258 | 258 | std.mem.copy(u8, self.output_buffer[max_end..], suffix); |
| 259 | 259 | end.* = max_end + suffix.len; |