|
| 1 | +(**************************************************************************) |
| 2 | +(* *) |
| 3 | +(* Copyright (c) 2021-2023 OCamlPro SAS *) |
| 4 | +(* *) |
| 5 | +(* All rights reserved. *) |
| 6 | +(* This file is distributed under the terms of the *) |
| 7 | +(* OCAMLPRO-NON-COMMERCIAL license. *) |
| 8 | +(* *) |
| 9 | +(**************************************************************************) |
| 10 | +open Cobol_ast |
| 11 | +open Cobol_common.Srcloc.INFIX |
| 12 | + |
| 13 | +type t = |
| 14 | + | Elementary of string * int |
| 15 | + | Group of string * int * t list |
| 16 | + |
| 17 | +let wss = |
| 18 | + [Group ("Level 1", 0, [ |
| 19 | + Group ("Level 3", 1, [ |
| 20 | + Elementary ("Level 2", 2)]); |
| 21 | + Group ("Level 4", 3,[ |
| 22 | + Elementary ("Level 2", 4)]) |
| 23 | + ]); |
| 24 | + Group ("X", 0, [ |
| 25 | + Group ("Y", 5, [ |
| 26 | + Elementary ("Z", 10) |
| 27 | + ]) |
| 28 | + ]) |
| 29 | + ] |
| 30 | + |
| 31 | +let unwrap = Result.get_ok |
| 32 | +let unwrap_err = Result.get_error |
| 33 | +let dummy_loc = Cobol_common.Srcloc.raw Lexing.(dummy_pos, dummy_pos) |
| 34 | + |
| 35 | +let rec qualname_of_str_list: string list -> qualname = function |
| 36 | + | [] -> raise (Invalid_argument "The string list should not be empty") |
| 37 | + | hd::[] -> Name (hd &@ dummy_loc) |
| 38 | + | hd::tl -> Qual (hd &@ dummy_loc, qualname_of_str_list tl) |
| 39 | + |
| 40 | + |
| 41 | +let transform wss map = |
| 42 | + let rec aux str_list map = function |
| 43 | + | Group (name, elt, elts) -> |
| 44 | + let str_list = name::str_list in |
| 45 | + List.fold_left (aux str_list) |
| 46 | + (Cobol_data.Qualmap.add (qualname_of_str_list str_list) elt map) |
| 47 | + elts |
| 48 | + | Elementary (name, elt) -> |
| 49 | + Cobol_data.Qualmap.add (qualname_of_str_list (name::str_list)) elt map |
| 50 | + in |
| 51 | + aux [] map wss |
| 52 | + |
| 53 | +let wss = List.fold_left |
| 54 | + (fun map grp -> |
| 55 | + transform grp map) |
| 56 | + Cobol_data.Qualmap.empty |
| 57 | + wss |
| 58 | + |
| 59 | +let wss = |
| 60 | + Cobol_data.Qualmap.add |
| 61 | + (Qual ("Level 5" &@ dummy_loc, |
| 62 | + Qual ("Level 3" &@ dummy_loc, |
| 63 | + Name ("Level 1" &@ dummy_loc)))) |
| 64 | + 10 |
| 65 | + wss |
| 66 | + |
| 67 | +let elt = Alcotest.testable Format.pp_print_int (=) |
| 68 | +(* let error = Alcotest.testable *) |
| 69 | +(* (fun fmt -> function `AmbiguousQualification qualname -> Format.fprintf fmt "Duplicate(@[%a@])" pp_qualname qualname) *) |
| 70 | +(* (=) *) |
| 71 | + |
| 72 | +let qual n qn = |
| 73 | + Qual (n &@ dummy_loc, qn) |
| 74 | + |
| 75 | +let name n: qualname = |
| 76 | + Name (n &@ dummy_loc) |
| 77 | + |
| 78 | +let access_elt_1 () = |
| 79 | + Alcotest.(check elt) "can access simple elt" |
| 80 | + (Cobol_data.Qualmap.find (name "Level 1") wss) 0 |
| 81 | + |
| 82 | +let access_elt_3 () = |
| 83 | + Alcotest.(check elt) "can access simple sub element" |
| 84 | + (Cobol_data.Qualmap.find (name "Level 3") wss) 1 |
| 85 | + |
| 86 | +let access_elt_3_2 () = |
| 87 | + Alcotest.(check elt) "can access qualified elt" |
| 88 | + (Cobol_data.Qualmap.find (qual "Level 2" (name "Level 3")) wss) 2 |
| 89 | + |
| 90 | +let access_elt_4_2 () = |
| 91 | + Alcotest.(check elt) "can access qualified elt" |
| 92 | + (Cobol_data.Qualmap.find (qual "Level 2" (name "Level 4")) wss) 4 |
| 93 | + |
| 94 | +let duplicate_2 () = |
| 95 | + let qualname: qualname = name "Level 2" in |
| 96 | + Alcotest.check_raises "Not_found on ambiguous" |
| 97 | + Not_found (fun () -> ignore @@ Cobol_data.Qualmap.find qualname wss) |
| 98 | + |
| 99 | +let bad_name () = |
| 100 | + let qualname: qualname = qual "Y" (name "Z") in |
| 101 | + Alcotest.check_raises "Not_found on bad name" |
| 102 | + Not_found (fun () -> ignore @@ Cobol_data.Qualmap.find qualname wss) |
| 103 | + |
| 104 | +let access_elt_x_y_z () = |
| 105 | + let qualname: qualname = qual "Z" (qual "Y" (name "X")) in |
| 106 | + Alcotest.(check elt) "can access qualified elt" |
| 107 | + (Cobol_data.Qualmap.find qualname wss) 10 |
| 108 | + |
| 109 | +let access_elt_x_z () = |
| 110 | + let qualname: qualname = qual "Z" (name "X") in |
| 111 | + Alcotest.(check elt) "can access partial qualified elt" |
| 112 | + (Cobol_data.Qualmap.find qualname wss) 10 |
| 113 | + |
| 114 | +let bad_order () = |
| 115 | + let qualname: qualname = qual "Z" (qual "X" (name "Y")) in |
| 116 | + Alcotest.check_raises "Not_found on invalid name order" |
| 117 | + Not_found (fun () -> ignore @@ Cobol_data.Qualmap.find qualname wss) |
| 118 | + |
| 119 | +(* let pp_print_str_list = |
| 120 | + Format.(pp_print_list ~pp_sep:pp_print_space pp_print_string) |
| 121 | +
|
| 122 | +let pp_print_set fmt = |
| 123 | + Cobol_data.Qualmap.(fun elt -> |
| 124 | + pp_qualname fmt elt; |
| 125 | + Format.pp_print_break fmt 2 0) |
| 126 | +
|
| 127 | +let pp_print_map f fmt = |
| 128 | + Cobol_data.Qualmap.iter (fun l elt -> |
| 129 | + Format.fprintf fmt |
| 130 | + "Key: %a; Value: %a;\n" |
| 131 | + pp_qualname l |
| 132 | + f elt) |
| 133 | +
|
| 134 | +let pp_map fmt m = |
| 135 | + Format.fprintf |
| 136 | + fmt |
| 137 | + "Bindings: @[<h>%a@]@;" |
| 138 | + (pp_print_map Format.pp_print_int) m *) |
| 139 | + |
| 140 | +(* let _ = |
| 141 | + Format.printf "%a" pp_map wss *) |
| 142 | + |
| 143 | +let () = |
| 144 | + Alcotest.(run "qualified map" [ |
| 145 | + "access", [ |
| 146 | + test_case "Access Level 1" `Quick access_elt_1; |
| 147 | + test_case "Access Level 3" `Quick access_elt_3; |
| 148 | + test_case "Access Level 2 IN Level 3" `Quick access_elt_3_2; |
| 149 | + test_case "Access Level 2 IN Level 4" `Quick access_elt_4_2; |
| 150 | + test_case "Error on duplicate" `Quick duplicate_2; |
| 151 | + test_case "Error on unknown name" `Quick bad_name; |
| 152 | + test_case "Access Z OF Y OF X" `Quick access_elt_x_y_z; |
| 153 | + test_case "Access Z OF X" `Quick access_elt_x_z; |
| 154 | + test_case "Error on invalid order" `Quick bad_order; |
| 155 | + ]]) |
0 commit comments