val of_int : int -> t
- val to_int : t -> int
+ val is_alive : t -> bool
val to_cell : t -> Cell.t
| 1 -> A
| _ -> assert false
- let to_int = function
- | D -> 0
- | A -> 1
+ let is_alive = function
+ | D -> false
+ | A -> true
let to_pheno = function
| D -> PhenoType.create ' ' None
let create () =
Random.int 2 |> State.of_int |> State.to_cell
- let live_neighbors neighbors =
- neighbors |> List.map ~f:(State.of_cell_state |- State.to_int)
- |> List.fold_left ~init:0 ~f:(+)
+ let count_of_live =
+ List.map ~f:State.of_cell_state
+ |- List.filter ~f:State.is_alive
+ |- List.length
let transition ~self ~neighbors =
self |> State.of_cell_state
- |> State.next ~live_neighbors:(live_neighbors neighbors)
+ |> State.next ~live_neighbors:(count_of_live neighbors)
|> State.to_cell
end
val of_int : int -> t
- val to_int : t -> int
-
val to_cell : t -> Cell.t
val of_cell_state : Cell.State.t -> t
| 2 -> B
| _ -> assert false
- let to_int = function
- | E -> 0
- | T -> 1
- | B -> 2
-
let to_pheno = function
| E -> PhenoType.create ' ' None
| T -> PhenoType.create 'T' (Some `green)
let create () =
Random.int 3 |> State.of_int |> State.to_cell
- let burning_neighbors neighbors =
- neighbors |> List.map ~f:State.of_cell_state
- |> List.filter ~f:State.is_burning
- |> List.map ~f:State.to_int
- |> List.fold_left ~init:0 ~f:(+)
+ let count_of_burning =
+ List.map ~f:State.of_cell_state
+ |- List.filter ~f:State.is_burning
+ |- List.length
let transition ~self ~neighbors =
self |> State.of_cell_state
- |> State.next ~burning_neighbors:(burning_neighbors neighbors)
+ |> State.next ~burning_neighbors:(count_of_burning neighbors)
|> State.to_cell
end