Continued implementing the funge space field
This commit is contained in:
parent
9a5ff5f233
commit
40257e354d
3 changed files with 296 additions and 24 deletions
140
src/field.nim
140
src/field.nim
|
|
@ -1,37 +1,135 @@
|
|||
type
|
||||
Line = ref object
|
||||
Line = object
|
||||
x, l: int
|
||||
columns: seq[int]
|
||||
|
||||
Field* = ref object
|
||||
Field* = object
|
||||
x, y: int
|
||||
lx, ly: int
|
||||
lines: seq[Line]
|
||||
|
||||
proc blank*(f: var Field, x, y: int) =
|
||||
if y < f.y or y >= f.y+f.ly: # outside the field
|
||||
return
|
||||
var l = addr f.lines[y-f.y]
|
||||
if x < l.x or x >= l.x+l.l: # outside the field
|
||||
return
|
||||
if x > l.x and x < l.x+l.l-1: # just set the value
|
||||
l.columns[x-l.x] = int(' ')
|
||||
return
|
||||
if l.l == 1: # this was the last character on the line
|
||||
if y == f.y: # we need to trim the leading lines
|
||||
var i = 1
|
||||
while f.lines[i].l == 0:
|
||||
inc i
|
||||
f.y += i
|
||||
f.lines = f.lines[i..<f.ly]
|
||||
f.ly -= i
|
||||
elif y == f.y+f.ly-1: # we need to trim the trailing lines
|
||||
var i = f.ly-2
|
||||
while f.lines[i].l == 0:
|
||||
dec i
|
||||
f.ly = i+1
|
||||
f.lines = f.lines[0..<f.ly]
|
||||
else: # it was a line in the middle
|
||||
l.l = 0
|
||||
l.columns = @[]
|
||||
elif x == l.x: # we need to remove leading spaces
|
||||
var i = 1
|
||||
while l.columns[i] == int(' '):
|
||||
inc i
|
||||
l.x += i
|
||||
l.columns = l.columns[i..<l.l]
|
||||
l.l -= i
|
||||
elif x == l.l+l.x-1: # we need to remove trailing spaces
|
||||
var i = l.l-2
|
||||
while l.columns[i] == int(' '):
|
||||
dec i
|
||||
l.l = i+1
|
||||
l.columns = l.columns[0..<l.l]
|
||||
# we now need to calculate the new field limits
|
||||
f.x = f.lines[0].x
|
||||
var x2 = f.lines[0].l + f.lines[0].x
|
||||
for i in 1..<f.ly:
|
||||
if f.lines[i].l == 0:
|
||||
continue
|
||||
if f.x > f.lines[i].x:
|
||||
f.x = f.lines[i].x
|
||||
if x2 < f.lines[i].x + f.lines[i].l:
|
||||
x2 = f.lines[i].x + f.lines[i].l
|
||||
f.lx = x2-f.x
|
||||
|
||||
proc get*(f: Field, x, y: int): int =
|
||||
if y >= f.y and y < f.y + f.ly:
|
||||
if y >= f.y and y < f.y+f.ly:
|
||||
let l = f.lines[y-f.y]
|
||||
if x >= l.x and x < l.x + l.l:
|
||||
if x >= l.x and x < l.x+l.l:
|
||||
return l.columns[x-l.x]
|
||||
return int(' ')
|
||||
|
||||
proc isIn*(f: Field, x, y: int): bool =
|
||||
return x >= f.x and y >= f.y and x < f.x+f.lx and y < f.y+f.ly
|
||||
|
||||
when defined(unitTesting):
|
||||
let minimal = Field(
|
||||
x: 0,
|
||||
y: 0,
|
||||
lx: 1,
|
||||
ly: 1,
|
||||
lines: @[
|
||||
Line(x: 0, l: 1, columns: @[int('@')])
|
||||
]
|
||||
)
|
||||
suite "Field":
|
||||
test "Field.get":
|
||||
check minimal.get(0,0) == int('@')
|
||||
check minimal.get(1,0) == int(' ')
|
||||
test "Field.isIn":
|
||||
check minimal.isIn(0, 0) == true
|
||||
check minimal.isIn(1, 0) == false
|
||||
proc set*(f: var Field, x, y, v: int) =
|
||||
if v == int(' '):
|
||||
f.blank(x, y)
|
||||
elif y >= f.y:
|
||||
if y < f.y+f.ly: # the line exists
|
||||
var l = addr f.lines[y-f.y]
|
||||
if l.l == 0: # An empty line is a special case
|
||||
l.x = x
|
||||
l.l = 1
|
||||
l.columns = @[v]
|
||||
if f.x > x:
|
||||
f.lx = f.lx+f.x-x
|
||||
f.x = x
|
||||
if f.lx < x-f.x+1:
|
||||
f.lx = x-f.x+1
|
||||
elif x >= l.x:
|
||||
if x < l.x+l.l: # just set the value
|
||||
l.columns[x-l.x] = v
|
||||
else: # append columns
|
||||
let newL = x-l.x+1
|
||||
l.columns.setlen(newL)
|
||||
for i in l.l..<newL-1:
|
||||
l.columns[i] = int(' ')
|
||||
l.columns[newL-1] = v
|
||||
l.l = newL
|
||||
if f.lx < l.l+l.x-f.x:
|
||||
f.lx = l.l+l.x-f.x
|
||||
else: # preprend columns
|
||||
let newL = l.l + l.x - x
|
||||
var newline = newSeqUninitialized[int](newL)
|
||||
newline[0] = v
|
||||
for i in 1..<l.x-x:
|
||||
newline[i] = int(' ')
|
||||
for i in l.x-x..<newL:
|
||||
newline[i] = l.columns[i-l.x+x]
|
||||
l.columns = newline
|
||||
l.x = x
|
||||
l.l = newL
|
||||
if f.x > x:
|
||||
f.lx = f.lx + f.x - x
|
||||
f.x = x
|
||||
else: # append lines
|
||||
f.ly = y-f.y+1
|
||||
f.lines.setlen(f.ly)
|
||||
f.lines[f.ly-1] = Line(x: x, l: 1, columns: @[v])
|
||||
if f.x > x:
|
||||
f.lx = f.lx + f.x - x
|
||||
f.x = x
|
||||
if f.lx < x-f.x+1:
|
||||
f.lx = x-f.x+1
|
||||
else: # prepend lines
|
||||
let newLy = f.ly+f.y-y
|
||||
var newlines = newSeq[Line](newLy)
|
||||
newlines[0] = Line(x: x, l: 1, columns: @[v])
|
||||
for i in f.y-y..<newLy:
|
||||
newlines[i] = f.lines[i-f.y+y]
|
||||
f.lines = newlines
|
||||
f.y = y
|
||||
f.ly = newLy
|
||||
if f.x > x:
|
||||
f.lx = f.lx+f.x-x
|
||||
f.x = x
|
||||
if f.lx < x-f.x+1:
|
||||
f.lx = x-f.x+1
|
||||
|
|
|
|||
Reference in a new issue