Commit 9dcd50cc authored by Taddeus Kroes's avatar Taddeus Kroes

funclang series5: Indent cleanup.

parent 810556ae
...@@ -4,7 +4,7 @@ type 'a rbtree = Leaf | Node of 'a * color * 'a rbtree * 'a rbtree ...@@ -4,7 +4,7 @@ type 'a rbtree = Leaf | Node of 'a * color * 'a rbtree * 'a rbtree
(* Balance a node by matching it against the four cases and returning a new, (* Balance a node by matching it against the four cases and returning a new,
* well-structured node *) * well-structured node *)
let balance_node node = match node with let balance_node node = match node with
Node (z, Black, Node (y, Red, Node (x, Red, a, b), c), d) Node (z, Black, Node (y, Red, Node (x, Red, a, b), c), d)
| Node (z, Black, Node (x, Red, a, Node (y, Red, b, c)), d) | Node (z, Black, Node (x, Red, a, Node (y, Red, b, c)), d)
| Node (x, Black, a, Node (z, Red, Node (y, Red, b, c), d)) | Node (x, Black, a, Node (z, Red, Node (y, Red, b, c), d))
| Node (x, Black, a, Node (y, Red, b, Node (z, Red, c, d))) -> | Node (x, Black, a, Node (y, Red, b, Node (z, Red, c, d))) ->
...@@ -16,7 +16,7 @@ let balance_node node = match node with ...@@ -16,7 +16,7 @@ let balance_node node = match node with
let insert tree value = let insert tree value =
let rec insert_in_tree = function let rec insert_in_tree = function
(* Insert new Node at leaf position *) (* Insert new Node at leaf position *)
Leaf -> Node (value, Red, Leaf, Leaf) Leaf -> Node (value, Red, Leaf, Leaf)
| Node (v, color, left, right) -> | Node (v, color, left, right) ->
if value = v then if value = v then
(* Value has already been inserted *) (* Value has already been inserted *)
...@@ -30,12 +30,12 @@ let insert tree value = ...@@ -30,12 +30,12 @@ let insert tree value =
in in
match insert_in_tree tree with match insert_in_tree tree with
(* Color the root black *) (* Color the root black *)
Node (v, _, left, right) -> Node (v, Black, left, right) Node (v, _, left, right) -> Node (v, Black, left, right)
| Leaf -> raise (Failure "Error during insertion") | Leaf -> raise (Failure "Error during insertion")
(* 'a -> 'a rbtree -> bool *) (* 'a -> 'a rbtree -> bool *)
let rec lookup value = function let rec lookup value = function
Leaf -> false Leaf -> false
| Node (v, _, left, right) -> v = value | Node (v, _, left, right) -> v = value
|| (if value < v then lookup value left else lookup value right) || (if value < v then lookup value left else lookup value right)
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment