mbarbin / super-master-mind / 217

Committed 31 Jan 2026 12:24PM UTC coverage: 50.206% (-38.1%) from 88.313%

Build # 217

Build Type

Pull #45

github

Committed by

web-flow

Commit Message

Merge 235b668da into 3d48eb3d9

Pull Request Pull Request #45: Dune pkg ci migration

Run Details

610 of 1215 relevant lines covered (50.21%)

597078.5 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

0.0

/test/expect/test__codes.ml

(*********************************************************************************)
(*  super-master-mind: A solver for the super master mind game                   *)
(*  SPDX-FileCopyrightText: 2021-2025 Mathieu Barbin <mathieu.barbin@gmail.com>  *)
(*  SPDX-License-Identifier: MIT                                                 *)
(*********************************************************************************)

let%expect_test "all" =
  print_dyn (Dyn.int (Codes.size Codes.all));
  [%expect {| 32768 |}];
  print_dyn (Dyn.float (Codes.bits Codes.all));
  [%expect {| 15. |}];
  print_dyn (Dyn.record [ "is_empty", Dyn.bool (Codes.is_empty Codes.all) ]);
  [%expect {| { is_empty = false } |}]
;;

let%expect_test "to_list" =
  let test t = print_dyn (Dyn.int (List.length (Codes.to_list t))) in
  test Codes.all;
  [%expect {| 32768 |}];
  let t =
    Codes.filter
      Codes.all
      ~candidate:(Code.create_exn [| Black; Blue; Brown; Green; Orange |])
      ~cue:(Cue.create_exn { white = 2; black = 3 })
  in
  test t;
  [%expect {| 10 |}];
  (* to_dyn *)
  print_dyn (Codes.to_dyn Codes.all);
  [%expect {| All |}];
  print_dyn (Codes.to_dyn t);
  [%expect
    {|
    Only
      [ [| Orange;  Blue;  Brown;  Green;  Black |]
      ; [| Black;  Orange;  Brown;  Green;  Blue |]
      ; [| Black;  Blue;  Orange;  Green;  Brown |]
      ; [| Black;  Blue;  Brown;  Orange;  Green |]
      ; [| Green;  Blue;  Brown;  Black;  Orange |]
      ; [| Black;  Green;  Brown;  Blue;  Orange |]
      ; [| Black;  Blue;  Green;  Brown;  Orange |]
      ; [| Brown;  Blue;  Black;  Green;  Orange |]
      ; [| Black;  Brown;  Blue;  Green;  Orange |]
      ; [| Blue;  Black;  Brown;  Green;  Orange |]
      ]
    |}];
  ()
;;

let%expect_test "filter" =
  List.iter (Lazy.force Cue.all) ~f:(fun cue ->
    let t =
      Codes.filter
        Codes.all
        ~candidate:(Code.create_exn [| Black; Blue; Brown; Green; Orange |])
        ~cue
    in
    print_dyn
      (Dyn.record [ "cue", Cue.to_dyn cue; "size_remaining", Dyn.int (Codes.size t) ]));
  [%expect
    {|
    { cue = { white = 0; black = 0 }; size_remaining = 243 }
    { cue = { white = 0; black = 1 }; size_remaining = 1280 }
    { cue = { white = 0; black = 2 }; size_remaining = 1250 }
    { cue = { white = 0; black = 3 }; size_remaining = 360 }
    { cue = { white = 0; black = 4 }; size_remaining = 35 }
    { cue = { white = 0; black = 5 }; size_remaining = 1 }
    { cue = { white = 1; black = 0 }; size_remaining = 2625 }
    { cue = { white = 1; black = 1 }; size_remaining = 4880 }
    { cue = { white = 1; black = 2 }; size_remaining = 1650 }
    { cue = { white = 1; black = 3 }; size_remaining = 120 }
    { cue = { white = 2; black = 0 }; size_remaining = 7070 }
    { cue = { white = 2; black = 1 }; size_remaining = 4680 }
    { cue = { white = 2; black = 2 }; size_remaining = 510 }
    { cue = { white = 2; black = 3 }; size_remaining = 10 }
    { cue = { white = 3; black = 0 }; size_remaining = 5610 }
    { cue = { white = 3; black = 1 }; size_remaining = 1120 }
    { cue = { white = 3; black = 2 }; size_remaining = 20 }
    { cue = { white = 4; black = 0 }; size_remaining = 1215 }
    { cue = { white = 4; black = 1 }; size_remaining = 45 }
    { cue = { white = 5; black = 0 }; size_remaining = 44 } |}]
;;

1	(*********************************************************************************)
2	(* super-master-mind: A solver for the super master mind game *)
3	(* SPDX-FileCopyrightText: 2021-2025 Mathieu Barbin <mathieu.barbin@gmail.com> *)
4	(* SPDX-License-Identifier: MIT *)
5	(*********************************************************************************)
6
7	let%expect_test "all" =
8	print_dyn (Dyn.int (Codes.size Codes.all));	×
9	[%expect {\| 32768 \|}];	×
10	print_dyn (Dyn.float (Codes.bits Codes.all));	×
11	[%expect {\| 15. \|}];	×
12	print_dyn (Dyn.record [ "is_empty", Dyn.bool (Codes.is_empty Codes.all) ]);	×
13	[%expect {\| { is_empty = false } \|}]	×
14	;;
15
16	let%expect_test "to_list" =
17	let test t = print_dyn (Dyn.int (List.length (Codes.to_list t))) in	×
18	test Codes.all;
19	[%expect {\| 32768 \|}];	×
20	let t =
21	Codes.filter
22	Codes.all
23	~candidate:(Code.create_exn [\| Black; Blue; Brown; Green; Orange \|])	×
24	~cue:(Cue.create_exn { white = 2; black = 3 })	×
25	in
26	test t;	×
27	[%expect {\| 10 \|}];	×
28	(* to_dyn *)
29	print_dyn (Codes.to_dyn Codes.all);	×
30	[%expect {\| All \|}];	×
31	print_dyn (Codes.to_dyn t);	×
32	[%expect	×
33	{\|
34	Only
35	[ [\| Orange; Blue; Brown; Green; Black \|]
36	; [\| Black; Orange; Brown; Green; Blue \|]
37	; [\| Black; Blue; Orange; Green; Brown \|]
38	; [\| Black; Blue; Brown; Orange; Green \|]
39	; [\| Green; Blue; Brown; Black; Orange \|]
40	; [\| Black; Green; Brown; Blue; Orange \|]
41	; [\| Black; Blue; Green; Brown; Orange \|]
42	; [\| Brown; Blue; Black; Green; Orange \|]
43	; [\| Black; Brown; Blue; Green; Orange \|]
44	; [\| Blue; Black; Brown; Green; Orange \|]
45	]
46	\|}];	×
47	()
48	;;
49
50	let%expect_test "filter" =
51	List.iter (Lazy.force Cue.all) ~f:(fun cue ->	×
52	let t =	×
53	Codes.filter
54	Codes.all
55	~candidate:(Code.create_exn [\| Black; Blue; Brown; Green; Orange \|])	×
56	~cue
57	in
58	print_dyn	×
59	(Dyn.record [ "cue", Cue.to_dyn cue; "size_remaining", Dyn.int (Codes.size t) ]));	×
60	[%expect	×
61	{\|
62	{ cue = { white = 0; black = 0 }; size_remaining = 243 }
63	{ cue = { white = 0; black = 1 }; size_remaining = 1280 }
64	{ cue = { white = 0; black = 2 }; size_remaining = 1250 }
65	{ cue = { white = 0; black = 3 }; size_remaining = 360 }
66	{ cue = { white = 0; black = 4 }; size_remaining = 35 }
67	{ cue = { white = 0; black = 5 }; size_remaining = 1 }
68	{ cue = { white = 1; black = 0 }; size_remaining = 2625 }
69	{ cue = { white = 1; black = 1 }; size_remaining = 4880 }
70	{ cue = { white = 1; black = 2 }; size_remaining = 1650 }
71	{ cue = { white = 1; black = 3 }; size_remaining = 120 }
72	{ cue = { white = 2; black = 0 }; size_remaining = 7070 }
73	{ cue = { white = 2; black = 1 }; size_remaining = 4680 }
74	{ cue = { white = 2; black = 2 }; size_remaining = 510 }
75	{ cue = { white = 2; black = 3 }; size_remaining = 10 }
76	{ cue = { white = 3; black = 0 }; size_remaining = 5610 }
77	{ cue = { white = 3; black = 1 }; size_remaining = 1120 }
78	{ cue = { white = 3; black = 2 }; size_remaining = 20 }
79	{ cue = { white = 4; black = 0 }; size_remaining = 1215 }
80	{ cue = { white = 4; black = 1 }; size_remaining = 45 }
81	{ cue = { white = 5; black = 0 }; size_remaining = 44 } \|}]	×
82	;;

mbarbin / super-master-mind / 217

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous