aboutsummaryrefslogtreecommitdiff
path: root/src/field.nim
diff options
context:
space:
mode:
authorJulien Dessaux2021-10-05 22:46:37 +0200
committerJulien Dessaux2021-10-05 22:46:37 +0200
commitf6bd9fa1a8e541c4aaae7272f38a6e73e2b3e233 (patch)
tree90f17a8504ddb032c5b9d7ede3958dfb899c19c7 /src/field.nim
parentRefactoring (diff)
downloadnimfunge98-f6bd9fa1a8e541c4aaae7272f38a6e73e2b3e233.tar.gz
nimfunge98-f6bd9fa1a8e541c4aaae7272f38a6e73e2b3e233.tar.bz2
nimfunge98-f6bd9fa1a8e541c4aaae7272f38a6e73e2b3e233.zip
Implemented steps over a funge space field
Diffstat (limited to '')
-rw-r--r--src/field.nim15
1 files changed, 15 insertions, 0 deletions
diff --git a/src/field.nim b/src/field.nim
index e15d7b4..a9d706e 100644
--- a/src/field.nim
+++ b/src/field.nim
@@ -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