adyxax/nimfunge98
Archived
1
0
Fork 0
Code Issues Activity

Implemented steps over a funge space field

Browse source
This commit is contained in:
Julien Dessaux 2021-10-05 22:46:37 +02:00
parent a952eaabb7
commit f6bd9fa1a8
2 changed files with 26 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
src/field.nim
View file

@ -198,3 +198,18 @@ func Set*(f: var Field, x, y, v: int) =
f.x = x
if f.lx < x-f.x+1:
f.lx = x-f.x+1
func Step*(f: Field, v: tuple[x, y: int], d: tuple[x, y: int]): (int, int) =
var x = v.x + d.x
var y = v.y + d.y
if f.IsIn(x, y):
return (x, y)
# We are stepping outside, we need to wrap the Lahey-space
x = v.x
y = v.y
while true:
let x2 = x - d.x
let y2 = y - d.y
if not f.IsIn(x2, y2):
return (x, y)
x = x2; y = y2

11
tests/field.nim
View file

@ -205,3 +205,14 @@ suite "Field":
])
f.Set(-7, 4, int('y'))
check f == xprependyappend
test "Step":
var minimal = Load("examples/minimal.b98")
var hello = Load("examples/hello.b98")
var dna = Load("examples/dna.b98")
check minimal[].Step((0, 0), (0, 0)) == (0, 0)
check minimal[].Step((0, 0), (1, 0)) == (0, 0)
check hello[].Step((3, 0), (0, 0)) == (3, 0)
check hello[].Step((3, 0), (1, 0)) == (4, 0)
check dna[].Step((1, 2), (3, 5)) == (4, 7)
check dna[].Step((6, 1), (1, 1)) == (5, 0)
check dna[].Step((1, 4), (-2, 2)) == (5, 0)