Contents

(* Binary tree with leaves car­rying an integer. *)
type Tree = Leaf of int | Node of Tree * Tree

let rec existsLeaf test tree =
  match tree with
  | Leaf v -> test v
  | Node (left, right) ->
      existsLeaf test left
      || existsLeaf test right

let hasEvenLeaf tree =
  existsLeaf (fun n -> n % 2 = 0) tree

Version data entries

16 entries across 16 versions & 2 rubygems

Version	Path
rouge-4.5.1	lib/rouge/demos/fsharp
rouge-4.5.0	lib/rouge/demos/fsharp
rouge-4.4.0	lib/rouge/demos/fsharp
rouge-4.3.0	lib/rouge/demos/fsharp
rouge-4.2.1	lib/rouge/demos/fsharp
rouge-4.2.0	lib/rouge/demos/fsharp
rouge-4.1.3	lib/rouge/demos/fsharp
rouge-4.1.2	lib/rouge/demos/fsharp
rouge-4.1.1	lib/rouge/demos/fsharp
mumukit-content-type-1.12.1	vendor/bundle/ruby/2.7.0/gems/rouge-3.30.0/lib/rouge/demos/fsharp
mumukit-content-type-1.12.0	vendor/bundle/ruby/2.7.0/gems/rouge-3.30.0/lib/rouge/demos/fsharp
rouge-4.1.0	lib/rouge/demos/fsharp
rouge-4.0.1	lib/rouge/demos/fsharp
rouge-4.0.0	lib/rouge/demos/fsharp
rouge-3.30.0	lib/rouge/demos/fsharp
rouge-3.29.0	lib/rouge/demos/fsharp