module type MATRIX = sig
type 'a t
- val create : rows:int -> cols:int -> data:'a -> 'a t
+ val create : rs:int -> ks:int -> data:'a -> 'a t
- val get : 'a t -> row:int -> col:int -> 'a
-
- val set : 'a t -> row:int -> col:int -> data:'a -> unit
+ val get_neighbors : 'a t -> r:int -> k:int -> 'a list
val map : 'a t -> f:('a -> 'b) -> 'b t
- val mapi : 'a t -> f:(row:int -> col:int -> data:'a -> 'b) -> 'b t
+ val mapi : 'a t -> f:(r:int -> k:int -> data:'a -> 'b) -> 'b t
- val iter : 'a t -> f:(row:int -> col:int -> data:'a -> unit) -> unit
+ val iter : 'a t -> f:(r:int -> k:int -> data:'a -> unit) -> unit
val print : 'a t -> to_string:('a -> string) -> unit
end
module Matrix : MATRIX = struct
+ module Direction = struct
+ type t = NW | N | NE
+ | W | E
+ | SW | S | SE
+
+ let all = [ NW ; N ; NE
+ ; W ; E
+ ; SW ; S ; SE
+ ]
+
+ let to_offset = function
+ (*| D -> r, k *)
+ | NW -> -1, -1
+ | N -> -1, 0
+ | NE -> -1, 1
+ | W -> 0, -1
+ | E -> 0, 1
+ | SW -> 1, -1
+ | S -> 1, 0
+ | SE -> 1, 1
+ end
+
type 'a t = 'a array array
- let create ~rows ~cols ~data =
- Array.make_matrix ~dimx:rows ~dimy:cols data
+ let create ~rs ~ks ~data =
+ Array.make_matrix ~dimx:rs ~dimy:ks data
let iter t ~f =
Array.iteri t ~f:(
- fun row cols ->
- Array.iteri cols ~f:(
- fun col data ->
- f ~row ~col ~data
+ fun r ks ->
+ Array.iteri ks ~f:(
+ fun k data ->
+ f ~r ~k ~data
)
)
let print t ~to_string =
Array.iter t ~f:(
- fun row ->
- Array.iter row ~f:(fun x -> printf "%s" (to_string x));
+ fun r ->
+ Array.iter r ~f:(fun x -> printf "%s" (to_string x));
print_newline ()
)
let mapi t ~f =
Array.mapi t ~f:(
- fun row cols ->
- Array.mapi cols ~f:(
- fun col data ->
- f ~row ~col ~data
+ fun r ks ->
+ Array.mapi ks ~f:(
+ fun k data ->
+ f ~r ~k ~data
)
)
- let get t ~row ~col =
- t.(row).(col)
+ let get t ~r ~k =
+ t.(r).(k)
- let set t ~row ~col ~data =
- t.(row).(col) <- data
+ let is_within_bounds t ~r ~k =
+ match t with
+ | [||] -> assert false
+ | t ->
+ r >= 0 && r < Array.length t &&
+ k >= 0 && k < Array.length t.(0)
+
+ let neighborhood t ~r ~k =
+ List.map Direction.all ~f:Direction.to_offset
+ |> List.map ~f:(fun (ro, ko) -> (r + ro), (k + ko))
+ |> List.filter ~f:(fun (r, k) -> is_within_bounds t ~r ~k)
+
+ let get_neighbors t ~r ~k =
+ List.map (neighborhood t ~r ~k) ~f:(fun (r, k) -> get t ~r ~k)
end
module type CELL = sig
type t
- val init : unit -> t
+ val create : unit -> t
val to_string : t -> string
| D -> " "
| A -> "o"
- let init () =
+ let create () =
Random.int 2 |> of_int
let state = to_int
end
-let main rows cols () =
+let main rs ks () =
Random.self_init ();
- let grid = Matrix.create ~rows ~cols ~data:() |> Matrix.map ~f:Conway.init in
+ let grid = Matrix.create ~rs ~ks ~data:() |> Matrix.map ~f:Conway.create in
+ Matrix.print grid ~to_string:Conway.to_string;
+ print_endline (String.make 80 '-');
+ let grid =
+ Matrix.mapi grid ~f:(fun ~r ~k ~data:cell ->
+ let neighbors = Matrix.get_neighbors grid ~r ~k in
+ Conway.react cell ~states:(List.map neighbors ~f:Conway.state)
+ )
+ in
Matrix.print grid ~to_string:Conway.to_string