Skip to content

Commit

Permalink
More Lwt_sequence tests (#541)
Browse files Browse the repository at this point in the history 
Resolves #406.
  • Loading branch information
@cedlemo @aantron
cedlemo authored and aantron committed Jan 16, 2018
1 parent 4e313b2 commit 77c6522
Showing 1 changed file with 96 additions and 65 deletions.
161 changes: 96 additions & 65 deletions test/core/test_lwt_sequence.ml
View file
Original file line number Diff line number Diff line change
Expand Up @@ -28,33 +28,35 @@ module Lwt_sequence = Lwt_sequence

let filled_sequence () =
let s = Lwt_sequence.create () in
let _ = Lwt_sequence.add_l (-1) s in
let _ = Lwt_sequence.add_l (-2) s in
let _ = Lwt_sequence.add_l (-3) s in
let _ = Lwt_sequence.add_r 1 s in
let _ = Lwt_sequence.add_r 2 s in
let _ = Lwt_sequence.add_r 3 s in
let _ = Lwt_sequence.add_r 4 s in
let _ = Lwt_sequence.add_r 5 s in
let _ = Lwt_sequence.add_r 6 s in
s

let filled_length = 6

let leftmost_value = (-3)
let leftmost_value = 1

let rightmost_value = 3
let rightmost_value = 6

let transfer_sequence () =
let s = Lwt_sequence.create () in
let _ = Lwt_sequence.add_r 4 s in
let _ = Lwt_sequence.add_r 5 s in
let _ = Lwt_sequence.add_r 7 s in
let _ = Lwt_sequence.add_r 8 s in
s

let transfer_length = 2

let empty_array = [||]

let l_filled_array = [|-3; -2; -1; 1; 2; 3|]
let l_filled_array = [|1; 2; 3; 4; 5; 6|]

let r_filled_array = [|6; 5; 4; 3; 2; 1|]

let r_filled_array = [|3; 2; 1; -1; -2; -3|]
let factorial_sequence = 720

let test_iter iter_f array_values seq =
let index = ref 0 in
Expand All @@ -63,8 +65,7 @@ let test_iter iter_f array_values seq =
iter_f (fun v ->
assert (v = array_values.(!index));
index := (!index + 1)) seq;
Lwt.return_true
)
Lwt.return_true)
(function _ -> Lwt.return_false)

let test_iter_node iter_f array_values seq =
Expand All @@ -74,8 +75,7 @@ let test_iter_node iter_f array_values seq =
iter_f (fun n ->
assert ((Lwt_sequence.get n) = array_values.(!index));
index := (!index + 1)) seq;
Lwt.return_true
)
Lwt.return_true)
(function _ -> Lwt.return_false)

let test_iter_rem iter_f array_values seq =
Expand All @@ -86,8 +86,7 @@ let test_iter_rem iter_f array_values seq =
assert ((Lwt_sequence.get n) = array_values.(!index));
Lwt_sequence.remove n;
index := (!index + 1)) seq;
Lwt.return_true
)
Lwt.return_true)
(function _ -> Lwt.return_false)

let suite = suite "lwt_sequence" [
Expand Down Expand Up @@ -120,49 +119,37 @@ let suite = suite "lwt_sequence" [
Lwt.catch
(fun () ->
let _ = Lwt_sequence.take_l s in
Lwt.return_false
)
Lwt.return_false)
(function
| Lwt_sequence.Empty -> Lwt.return_true
| _ -> Lwt.return_false
)
| _ -> Lwt.return_false)
end;

test "take_l" begin fun () ->
let s = filled_sequence () in
Lwt.catch
(fun () ->
let v = Lwt_sequence.take_l s in
Lwt.return (leftmost_value = v)
)
(function
| _ -> Lwt.return_false
)
Lwt.return (leftmost_value = v))
(function _ -> Lwt.return_false)
end;

test "take_r Empty" begin fun () ->
let s = Lwt_sequence.create () in
Lwt.catch
(fun () ->
let _ = Lwt_sequence.take_r s in
Lwt.return_false
)
let _ = Lwt_sequence.take_r s in Lwt.return_false)
(function
| Lwt_sequence.Empty -> Lwt.return_true
| _ -> Lwt.return_false
)
| _ -> Lwt.return_false)
end;

test "take_r" begin fun () ->
let s = filled_sequence () in
Lwt.catch
(fun () ->
let v = Lwt_sequence.take_r s in
Lwt.return (rightmost_value = v)
)
(function
| _ -> Lwt.return_false
)
let v = Lwt_sequence.take_r s in Lwt.return (rightmost_value = v))
(function _ -> Lwt.return_false)
end;

test "take_opt_l Empty" begin fun () ->
Expand Down Expand Up @@ -209,7 +196,7 @@ let suite = suite "lwt_sequence" [
let _ = assert ((filled_length + transfer_length) = len) in
match Lwt_sequence.take_opt_l s with
| None -> Lwt.return_false
| Some v -> Lwt.return (4 = v)
| Some v -> Lwt.return (7 = v)
end;

test "transfer_r Empty" begin fun () ->
Expand All @@ -228,7 +215,7 @@ let suite = suite "lwt_sequence" [
let _ = assert ((filled_length + transfer_length) = len) in
match Lwt_sequence.take_opt_r s with
| None -> Lwt.return_false
| Some v -> Lwt.return (5 = v)
| Some v -> Lwt.return (8 = v)
end;

test "iter_l Empty" begin fun () ->
Expand Down Expand Up @@ -273,7 +260,7 @@ let suite = suite "lwt_sequence" [

test "fold_l" begin fun () ->
let acc = Lwt_sequence.fold_l (fun v e -> v * e) (filled_sequence ()) 1 in
Lwt.return (acc = (-36))
Lwt.return (factorial_sequence = acc)
end;

test "fold_l Empty" begin fun () ->
Expand All @@ -283,7 +270,7 @@ let suite = suite "lwt_sequence" [

test "fold_r" begin fun () ->
let acc = Lwt_sequence.fold_r (fun v e -> v * e) (filled_sequence ()) 1 in
Lwt.return (acc = (-36))
Lwt.return (factorial_sequence = acc)
end;

test "fold_r Empty" begin fun () ->
Expand Down Expand Up @@ -340,21 +327,18 @@ let suite = suite "lwt_sequence" [
Lwt.catch
(fun () -> let n = Lwt_sequence.find_node_l (fun v -> v = 1) s in
if ((Lwt_sequence.get n) = 1) then Lwt.return_false
else Lwt.return_false
)
else Lwt.return_false)
(function
| Not_found -> Lwt.return_true
| _ -> Lwt.return_false
)
| _ -> Lwt.return_false)
end;

test "find_node_l" begin fun () ->
let s = filled_sequence () in
Lwt.catch
(fun () -> let n = Lwt_sequence.find_node_l (fun v -> v = 1) s in
if ((Lwt_sequence.get n) = 1) then Lwt.return_true
else Lwt.return_false
)
else Lwt.return_false)
(function _ -> Lwt.return_false)
end;

Expand All @@ -363,47 +347,94 @@ let suite = suite "lwt_sequence" [
Lwt.catch
(fun () -> let n = Lwt_sequence.find_node_r (fun v -> v = 1) s in
if ((Lwt_sequence.get n) = 1) then Lwt.return_false
else Lwt.return_false
)
else Lwt.return_false)
(function
| Not_found -> Lwt.return_true
| _ -> Lwt.return_false
)
| _ -> Lwt.return_false)
end;

test "find_node_r" begin fun () ->
let s = filled_sequence () in
Lwt.catch
(fun () -> let n = Lwt_sequence.find_node_r (fun v -> v = 1) s in
if ((Lwt_sequence.get n) = 1) then Lwt.return_true
else Lwt.return_false
)
else Lwt.return_false)
(function _ -> Lwt.return_false)
end;

test "set" begin fun () ->
let s = filled_sequence () in
match Lwt_sequence.find_node_opt_l (fun v -> v = 1) s with
match Lwt_sequence.find_node_opt_l (fun v -> v = 4) s with
| None -> Lwt.return_false
| Some n -> let _ = Lwt_sequence.set n 10 in
let data = [|-3; -2; -1; 10; 2; 3|] in
let data = [|1; 2; 3; 10; 5; 6|] in
test_iter Lwt_sequence.iter_l data s
end;

test "fold_r with multiple removal" begin fun () ->
let s = filled_sequence () in
let n_three = Lwt_sequence.find_node_r (fun v' -> v' = 3) s in
let n_two = Lwt_sequence.find_node_r (fun v' -> v' = 2) s in
let n_four = Lwt_sequence.find_node_r (fun v' -> v' = 4) s in
let acc = Lwt_sequence.fold_r begin fun v e ->
if v = 3 then begin
let _ = Lwt_sequence.remove n_three in
let _ = Lwt_sequence.remove n_two in
ignore(Lwt_sequence.remove n_four)
end;
v * e
end s 1 in
Lwt.return (acc = (factorial_sequence / 2))
end;

test "fold_l multiple removal" begin fun () ->
let s = filled_sequence () in
let acc = Lwt_sequence.fold_r
(fun v e ->
(if v = (-1) then
let n = Lwt_sequence.find_node_r (fun v' -> v' = 1) s in
let _ = Lwt_sequence.remove n in
let n = Lwt_sequence.find_node_r (fun v' -> v' = (-2)) s in
let _ = Lwt_sequence.remove n in
let n = Lwt_sequence.find_node_r (fun v' -> v' = (-1)) s in
ignore(Lwt_sequence.remove n)
);
let n_four = Lwt_sequence.find_node_r (fun v' -> v' = 4) s in
let n_five = Lwt_sequence.find_node_r (fun v' -> v' = 5) s in
let n_three = Lwt_sequence.find_node_r (fun v' -> v' = 3) s in
let acc = Lwt_sequence.fold_l begin fun v e ->
if v = 4 then begin
let _ = Lwt_sequence.remove n_four in
let _ = Lwt_sequence.remove n_five in
ignore(Lwt_sequence.remove n_three)
end;
v * e
) s 1 in
Lwt.return (acc = 18)
end s 1 in
Lwt.return (acc = (factorial_sequence / 5))
end;

test "find_node_r with multiple removal" begin fun () ->
let s = filled_sequence () in
let n_three = Lwt_sequence.find_node_r (fun v' -> v' = 3) s in
let n_two = Lwt_sequence.find_node_r (fun v' -> v' = 2) s in
Lwt.catch
begin fun () ->
let n = Lwt_sequence.find_node_r begin fun v ->
if v = 3 then (
let _ = Lwt_sequence.remove n_three in
ignore(Lwt_sequence.remove n_two));
v = 1
end s in
let v = Lwt_sequence.get n in
Lwt.return (v = 1)
end
(function _ -> Lwt.return_false)
end;

test "find_node_l with multiple removal" begin fun () ->
let s = filled_sequence () in
let n_three = Lwt_sequence.find_node_r (fun v' -> v' = 3) s in
let n_four = Lwt_sequence.find_node_r (fun v' -> v' = 4) s in
Lwt.catch
begin fun () ->
let n = Lwt_sequence.find_node_l begin fun v ->
if v = 3 then (
let _ = Lwt_sequence.remove n_three in
ignore(Lwt_sequence.remove n_four));
v = 6 end s in
let v = Lwt_sequence.get n in
Lwt.return (v = 6)
end
(function _ -> Lwt.return_false)
end;
]

0 comments on commit 77c6522

Please sign in to comment.