steve
/
factor
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

game-of-life: ugly code that makes next-step faster.

windows-high-dpi
John Benediktsson 2018-03-09 15:04:23 -08:00
parent c24779d27e
commit 9e563c4103
1 changed files with 34 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

53
extra/game-of-life/game-of-life.factor
View File

@ -1,33 +1,40 @@
! Copyright (C) 2018 John Benediktsson ! Copyright (C) 2018 John Benediktsson
! See http://factorcode.org/license.txt for BSD license ! See http://factorcode.org/license.txt for BSD license
USING: accessors arrays assocs bit-arrays calendar circular USING: accessors arrays assocs bit-arrays calendar
colors.constants combinators fry kernel locals math math.order colors.constants combinators combinators.short-circuit fry
math.ranges namespaces opengl random sequences timers ui kernel kernel.private locals math math.order math.private
ui.commands ui.gadgets ui.gadgets.toolbar ui.gadgets.tracks math.ranges namespaces opengl random sequences sequences.private
ui.gestures ui.render words ; timers ui ui.commands ui.gadgets ui.gadgets.toolbar
ui.gadgets.tracks ui.gestures ui.render words ;
IN: game-of-life IN: game-of-life
: make-grid ( rows cols -- grid ) : make-grid ( rows cols -- grid )
'[ _ <bit-array> <circular> ] replicate <circular> ; '[ _ <bit-array> ] replicate ;
: grid-dim ( grid -- rows cols ) : grid-dim ( grid -- rows cols )
[ length ] [ first length ] bi ; [ length ] [ first length ] bi ;
CONSTANT: neighbors {
{ -1 -1 } { -1 0 } { -1 1 }
{ 0 -1 } { 0 1 }
{ 1 -1 } { 1 0 } { 1 1 }
}
:: count-neighbors ( grid -- counts ) :: count-neighbors ( grid -- counts )
grid grid-dim :> ( rows cols ) grid grid-dim { fixnum fixnum } declare :> ( rows cols )
rows <iota> [| j | rows <iota> [| j |
cols <iota> [| i | cols <iota> [| i |
neighbors [ { -1 0 1 } [
first2 [ i + ] [ j + ] bi* grid nth nth { -1 0 1 } [
] count [ i fixnum+fast ] [ j fixnum+fast ] bi*
{ fixnum fixnum } declare :> ( col row )
{
[ col i = not ] [ row i = not ]
[ col 0 >= ] [ col cols < ]
[ row 0 >= ] [ row rows < ]
} 0&& [
col row grid
{ array } declare nth-unsafe
{ bit-array } declare nth-unsafe
] [ f ] if
] with count
] map-sum
] map ] map
] map ; ] map ;
@ -35,11 +42,19 @@ CONSTANT: neighbors {
grid count-neighbors :> neighbors grid count-neighbors :> neighbors
grid [| row j | grid [| row j |
row [| cell i | row [| cell i |
i j neighbors nth nth i j neighbors
{ array } declare nth-unsafe
{ array } declare nth-unsafe
cell [ cell [
2 3 between? i j grid nth set-nth 2 3 between? i j grid
{ array } declare nth-unsafe
{ bit-array } declare set-nth-unsafe
] [ ] [
3 = [ t i j grid nth set-nth ] when 3 = [
t i j grid
{ array } declare nth-unsafe
{ bit-array } declare set-nth-unsafe
] when
] if ] if
] each-index ] each-index
] each-index ; ] each-index ;