41 lines
1.3 KiB
Python
41 lines
1.3 KiB
Python
#!/usr/bin/env python
|
|
from .term_manager import TermManager
|
|
|
|
|
|
def proof_of_concept() -> None:
|
|
matrix = []
|
|
with open("example_map.txt") as f:
|
|
for line in f.readlines():
|
|
matrix.append(line[:-1])
|
|
|
|
with TermManager() as term_manager:
|
|
stdscr = term_manager.screen
|
|
|
|
for y in range(len(matrix)):
|
|
for x in range(len(matrix[0])):
|
|
stdscr.addstr(y, x, matrix[y][x])
|
|
stdscr.refresh()
|
|
|
|
cur = [1, 6] # (y,x)
|
|
stdscr.addstr(1, 6, '@')
|
|
stdscr.refresh()
|
|
|
|
while True:
|
|
key = stdscr.getkey()
|
|
stdscr.addstr(cur[0], cur[1], '.')
|
|
if key == 'z':
|
|
if cur[0] > 0 and matrix[cur[0] - 1][cur[1]] != '#':
|
|
cur[0] = cur[0] - 1
|
|
if key == 's':
|
|
if cur[0] < len(matrix) - 1 and \
|
|
matrix[cur[0] + 1][cur[1]] != '#':
|
|
cur[0] = cur[0] + 1
|
|
if key == 'q':
|
|
if cur[1] > 0 and matrix[cur[0]][cur[1] - 1] != '#':
|
|
cur[1] = cur[1] - 1
|
|
if key == 'd':
|
|
if cur[1] < len(matrix[0]) and \
|
|
matrix[cur[0]][cur[1] + 1] != '#':
|
|
cur[1] = cur[1] + 1
|
|
stdscr.addstr(cur[0], cur[1], '@')
|