aey/advent-of-code
0
0
Fork 0
Code Issues Pull requests 4 Projects Releases Packages Wiki Activity Actions

better visualzier

Browse source
This commit is contained in:
Anders Englöf Ytterström 2025-12-09 14:48:57 +01:00
parent 8fbd267d99
commit 267ecaebc1
1 changed files with 19 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

23
2025-python/output/__init__.py
View file

@ -1,4 +1,5 @@
import re import re
from math import inf
# Directions/Adjacents for 2D matrices, in the order UP, RIGHT, DOWN, LEFT # Directions/Adjacents for 2D matrices, in the order UP, RIGHT, DOWN, LEFT
D = [ D = [
@ -78,12 +79,26 @@ def mdbg(m):
print("".join(r)) print("".join(r))
def vdbg(seen, h, w, C="#", M=None): def vdbg(seen, mask=("#", "."), M=None):
"""Print-debug visited positions of a matrix""" """Print-debug visited positions of a matrix"""
t = inf
l = inf
b = 0
r = 0
for y, x in seen:
t = min(t, y)
r = max(r, x)
b = max(b, y)
l = min(l, x)
H = b - t + 1
W = r - l + 1
osr = t
osc = l
C, Z = mask
def _m(r, c): def _m(r, c):
return M[r][c] if M else "." return M[r][c] if M else Z
for r in range(h): for r in range(H):
print("".join([C if (r, c) in seen else _m(r, c) for c in range(w)])) print("".join([C if (r + osr, c + osc) in seen else _m(r, c) for c in range(W)]))
def vvdbg(seen, h, w): def vvdbg(seen, h, w):