package merlin-lib
Merlin's libraries
Install
Dune Dependency
Authors
Maintainers
Sources
merlin-5.5-503.tbz
sha256=67da3b34f2fea07678267309f61da4a2c6f08298de0dc59655b8d30fd8269af1
sha512=1fb3b5180d36aa82b82a319e15b743b802b6888f0dc67645baafdb4e18dfc23a7b90064ec9bc42f7424061cf8cde7f8839178d8a8537bf4596759f3ff4891873
doc/src/merlin-lib.ocaml_typing/shape.ml.html
Source file shape.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374
(**************************************************************************) (* *) (* OCaml *) (* *) (* Ulysse Gérard, Thomas Refis, Tarides *) (* *) (* Copyright 2021 Institut National de Recherche en Informatique et *) (* en Automatique. *) (* *) (* All rights reserved. This file is distributed under the terms of *) (* the GNU Lesser General Public License version 2.1, with the *) (* special exception on linking described in the file LICENSE. *) (* *) (**************************************************************************) module Uid = struct type t = | Compilation_unit of string | Item of { comp_unit: string; id: int; from: Unit_info.intf_or_impl } | Internal | Predef of string include Identifiable.Make(struct type nonrec t = t let equal (x : t) y = x = y let compare (x : t) y = compare x y let hash (x : t) = Hashtbl.hash x let pp_intf_or_impl fmt = function | Unit_info.Intf -> Format.pp_print_string fmt "[intf]" | Unit_info.Impl -> () let print fmt = function | Internal -> Format.pp_print_string fmt "<internal>" | Predef name -> Format.fprintf fmt "<predef:%s>" name | Compilation_unit s -> Format.pp_print_string fmt s | Item { comp_unit; id; from } -> Format.fprintf fmt "%a%s.%d" pp_intf_or_impl from comp_unit id let output oc t = let fmt = Format.formatter_of_out_channel oc in print fmt t end) let id = Local_store.s_ref (-1) let reinit () = id := (-1) let get_current_stamp () = !id let restore_stamp i = id := i let stamp_of_uid = function | Item { id; _ } -> Some id | _ -> None let mk ~current_unit = let comp_unit, from = let open Unit_info in match current_unit with | None -> "", Impl | Some ui -> modname ui, kind ui in incr id; Item { comp_unit; id = !id; from } let of_compilation_unit_id id = if not (Ident.persistent id) then Misc.fatal_errorf "Types.Uid.of_compilation_unit_id %S" (Ident.name id); Compilation_unit (Ident.name id) let of_predef_id id = if not (Ident.is_predef id) then Misc.fatal_errorf "Types.Uid.of_predef_id %S" (Ident.name id); Predef (Ident.name id) let internal_not_actually_unique = Internal let for_actual_declaration = function | Item _ -> true | _ -> false end module Sig_component_kind = struct type t = | Value | Type | Constructor | Label | Module | Module_type | Extension_constructor | Class | Class_type let to_string = function | Value -> "value" | Type -> "type" | Constructor -> "constructor" | Label -> "label" | Module -> "module" | Module_type -> "module type" | Extension_constructor -> "extension constructor" | Class -> "class" | Class_type -> "class type" let can_appear_in_types = function | Value | Extension_constructor -> false | Type | Constructor | Label | Module | Module_type | Class | Class_type -> true end module Item = struct module T = struct type t = string * Sig_component_kind.t let compare = compare let name (name, _) = name let kind (_, kind) = kind let make str ns = str, ns let value id = Ident.name id, Sig_component_kind.Value let type_ id = Ident.name id, Sig_component_kind.Type let constr id = Ident.name id, Sig_component_kind.Constructor let label id = Ident.name id, Sig_component_kind.Label let module_ id = Ident.name id, Sig_component_kind.Module let module_type id = Ident.name id, Sig_component_kind.Module_type let extension_constructor id = Ident.name id, Sig_component_kind.Extension_constructor let class_ id = Ident.name id, Sig_component_kind.Class let class_type id = Ident.name id, Sig_component_kind.Class_type let print fmt (name, ns) = Format.fprintf fmt "%S[%s]" name (Sig_component_kind.to_string ns) end include T module Map = Map.Make(T) end type var = Ident.t type t = { uid: Uid.t option; desc: desc; approximated: bool } and desc = | Var of var | Abs of var * t | App of t * t | Struct of t Item.Map.t | Alias of t | Leaf | Proj of t * Item.t | Comp_unit of string | Error of string let print fmt t = let print_uid_opt = Format.pp_print_option (fun fmt -> Format.fprintf fmt "<%a>" Uid.print) in let rec aux fmt { uid; desc } = match desc with | Var id -> Format.fprintf fmt "%s%a" (Ident.name id) print_uid_opt uid | Abs (id, t) -> let rec collect_idents = function | { uid = None; desc = Abs(id, t) } -> let (ids, body) = collect_idents t in id :: ids, body | body -> ([], body) in let (other_idents, body) = collect_idents t in let pp_idents fmt idents = let idents_names = List.map Ident.name idents in let pp_sep fmt () = Format.fprintf fmt ",@ " in Format.pp_print_list ~pp_sep Format.pp_print_string fmt idents_names in Format.fprintf fmt "Abs@[%a@,(@[%a,@ @[%a@]@])@]" print_uid_opt uid pp_idents (id :: other_idents) aux body | App (t1, t2) -> Format.fprintf fmt "@[%a(@,%a)%a@]" aux t1 aux t2 print_uid_opt uid | Leaf -> Format.fprintf fmt "<%a>" (Format.pp_print_option Uid.print) uid | Proj (t, item) -> begin match uid with | None -> Format.fprintf fmt "@[%a@ .@ %a@]" aux t Item.print item | Some uid -> Format.fprintf fmt "@[(%a@ .@ %a)<%a>@]" aux t Item.print item Uid.print uid end | Comp_unit name -> Format.fprintf fmt "CU %s" name | Struct map -> let print_map fmt = Item.Map.iter (fun item t -> Format.fprintf fmt "@[<hv 2>%a ->@ %a;@]@," Item.print item aux t ) in if Item.Map.is_empty map then Format.fprintf fmt "@[<hv>{%a}@]" print_uid_opt uid else Format.fprintf fmt "{@[<v>%a@,%a@]}" print_uid_opt uid print_map map | Alias t -> Format.fprintf fmt "Alias@[(@[<v>%a@,%a@])@]" print_uid_opt uid aux t | Error s -> Format.fprintf fmt "Error %s" s in if t.approximated then Format.fprintf fmt "@[(approx)@ %a@]@;" aux t else Format.fprintf fmt "@[%a@]@;" aux t let rec strip_head_aliases = function | { desc = Alias t; _ } -> strip_head_aliases t | t -> t let fresh_var ?(name="shape-var") uid = let var = Ident.create_local name in var, { uid = Some uid; desc = Var var; approximated = false } let for_unnamed_functor_param = Ident.create_local "()" let var uid id = { uid = Some uid; desc = Var id; approximated = false } let abs ?uid var body = { uid; desc = Abs (var, body); approximated = false } let str ?uid map = { uid; desc = Struct map; approximated = false } let alias ?uid t = { uid; desc = Alias t; approximated = false} let leaf uid = { uid = Some uid; desc = Leaf; approximated = false } let approx t = { t with approximated = true} let proj ?uid t item = match t.desc with | Leaf -> (* When stuck projecting in a leaf we propagate the leaf as a best effort *) approx t | Struct map -> begin try Item.Map.find item map with Not_found -> approx t (* ill-typed program *) end | _ -> { uid; desc = Proj (t, item); approximated = false } let app ?uid f ~arg = { uid; desc = App (f, arg); approximated = false } let decompose_abs t = match t.desc with | Abs (x, t) -> Some (x, t) | _ -> None let dummy_mod = { uid = None; desc = Struct Item.Map.empty; approximated = false } let of_path ~find_shape ~namespace path = (* We need to handle the following cases: Path of constructor: M.t.C Path of label: M.t.lbl Path of label of inline record: M.t.C.lbl *) let rec aux : Sig_component_kind.t -> Path.t -> t = fun ns -> function | Pident id -> find_shape ns id | Pdot (path, name) -> let namespace : Sig_component_kind.t = match (ns : Sig_component_kind.t) with | Constructor -> Type | Label -> Type | _ -> Module in proj (aux namespace path) (name, ns) | Papply (p1, p2) -> app (aux Module p1) ~arg:(aux Module p2) | Pextra_ty (path, extra) -> begin match extra with Pcstr_ty name -> proj (aux Type path) (name, Constructor) | Pext_ty -> aux Extension_constructor path end in aux namespace path let for_persistent_unit s = { uid = Some (Uid.of_compilation_unit_id (Ident.create_persistent s)); desc = Comp_unit s; approximated = false } let leaf_for_unpack = { uid = None; desc = Leaf; approximated = false } let set_uid_if_none t uid = match t.uid with | None -> { t with uid = Some uid } | _ -> t module Map = struct type shape = t type nonrec t = t Item.Map.t let empty = Item.Map.empty let add t item shape = Item.Map.add item shape t let add_value t id uid = Item.Map.add (Item.value id) (leaf uid) t let add_value_proj t id shape = let item = Item.value id in Item.Map.add item (proj shape item) t let add_type t id shape = Item.Map.add (Item.type_ id) shape t let add_type_proj t id shape = let item = Item.type_ id in Item.Map.add item (proj shape item) t let add_constr t id shape = Item.Map.add (Item.constr id) shape t let add_constr_proj t id shape = let item = Item.constr id in Item.Map.add item (proj shape item) t let add_label t id uid = Item.Map.add (Item.label id) (leaf uid) t let add_label_proj t id shape = let item = Item.label id in Item.Map.add item (proj shape item) t let add_module t id shape = Item.Map.add (Item.module_ id) shape t let add_module_proj t id shape = let item = Item.module_ id in Item.Map.add item (proj shape item) t let add_module_type t id uid = Item.Map.add (Item.module_type id) (leaf uid) t let add_module_type_proj t id shape = let item = Item.module_type id in Item.Map.add item (proj shape item) t let add_extcons t id shape = Item.Map.add (Item.extension_constructor id) shape t let add_extcons_proj t id shape = let item = Item.extension_constructor id in Item.Map.add item (proj shape item) t let add_class t id uid = Item.Map.add (Item.class_ id) (leaf uid) t let add_class_proj t id shape = let item = Item.class_ id in Item.Map.add item (proj shape item) t let add_class_type t id uid = Item.Map.add (Item.class_type id) (leaf uid) t let add_class_type_proj t id shape = let item = Item.class_type id in Item.Map.add item (proj shape item) t end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>