@@ -1403,49 +1403,49 @@ module Tutorial = struct
14031403 end
14041404end
14051405
1406- (* module Partition = struct
1407- * type t =
1408- * {
1409- * not_graded : Token.t list;
1410- * bad_type : Token.t list;
1411- * partition_by_grade :
1412- * (int *
1413- * (((Token.t * string) list) Asak.Wtree.wtree list))
1414- * list;
1415- * }
1416- *
1417- * let token_list = J.list Token.enc
1418- *
1419- * let tree_enc leaf_enc =
1420- * let open Asak.Wtree in
1421- * J.mu "tree" @@ fun self ->
1422- * J.union
1423- * [ J.case (J.obj1 (J.req "leaf" leaf_enc))
1424- * (function Leaf x -> Some x | Node _ -> None)
1425- * (fun x -> Leaf x) ;
1426- * J.case (J.obj3 (J.req "coef" J.int) (J.req "left" self) (J.req "right" self))
1427- * (function Node (t,l,r) -> Some (t,l,r) | Leaf _ -> None)
1428- * (fun (t,l,r) -> Node (t,l,r)) ]
1429- *
1430- * let leaf_enc =
1431- * J.list (J.tup2 Token.enc J.string)
1432- *
1433- * let innerlist = J.list (tree_enc leaf_enc)
1434- *
1435- * let int_assoc =
1436- * J.tup2 J.int innerlist
1437- *
1438- * let enc =
1439- * J.conv
1440- * (fun t ->
1441- * (t.not_graded, t.bad_type, t.partition_by_grade))
1442- * (fun (not_graded, bad_type, partition_by_grade) ->
1443- * {not_graded; bad_type; partition_by_grade}) @@
1444- * J.obj3
1445- * J.(req "not_graded" token_list)
1446- * J.(req "bad_type" token_list)
1447- * J.(req "patition_by_grade" (J.list int_assoc))
1448- * end *)
1406+ module Partition = struct
1407+ type t =
1408+ {
1409+ not_graded : Token .t list ;
1410+ bad_type : Token .t list ;
1411+ partition_by_grade :
1412+ (int *
1413+ (((Token .t * string ) list ) Asak.Wtree .wtree list ))
1414+ list ;
1415+ }
1416+
1417+ let token_list = J. list Token. enc
1418+
1419+ let tree_enc leaf_enc =
1420+ let open Asak.Wtree in
1421+ J. mu " tree" @@ fun self ->
1422+ J. union
1423+ [ J. case (J. obj1 (J. req " leaf" leaf_enc))
1424+ (function Leaf x -> Some x | Node _ -> None )
1425+ (fun x -> Leaf x) ;
1426+ J. case (J. obj3 (J. req " coef" J. int ) (J. req " left" self) (J. req " right" self))
1427+ (function Node (t ,l ,r ) -> Some (t,l,r) | Leaf _ -> None )
1428+ (fun (t ,l ,r ) -> Node (t,l,r)) ]
1429+
1430+ let leaf_enc =
1431+ J. list (J. tup2 Token. enc J. string )
1432+
1433+ let innerlist = J. list (tree_enc leaf_enc)
1434+
1435+ let int_assoc =
1436+ J. tup2 J. int innerlist
1437+
1438+ let enc =
1439+ J. conv
1440+ (fun t ->
1441+ (t.not_graded, t.bad_type, t.partition_by_grade))
1442+ (fun (not_graded , bad_type , partition_by_grade ) ->
1443+ {not_graded; bad_type; partition_by_grade}) @@
1444+ J. obj3
1445+ J. (req " not_graded" token_list)
1446+ J. (req " bad_type" token_list)
1447+ J. (req " patition_by_grade" (J. list int_assoc))
1448+ end
14491449
14501450module Playground = struct
14511451 type id = string
0 commit comments