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/subst.ml.html
Source file subst.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 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873
(**************************************************************************) (* *) (* OCaml *) (* *) (* Xavier Leroy, projet Cristal, INRIA Rocquencourt *) (* *) (* Copyright 1996 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. *) (* *) (**************************************************************************) (* Substitutions *) open Misc open Path open Types open Btype open Local_store type type_replacement = | Path of Path.t | Type_function of { params : type_expr list; body : type_expr } type s = { types: type_replacement Path.Map.t; modules: Path.t Path.Map.t; modtypes: module_type Path.Map.t; for_saving: bool; loc: Location.t option; make_loc_ghost: bool; } type 'a subst = s type safe = [`Safe] type unsafe = [`Unsafe] type t = safe subst exception Module_type_path_substituted_away of Path.t * Types.module_type let identity = { types = Path.Map.empty; modules = Path.Map.empty; modtypes = Path.Map.empty; for_saving = false; loc = None; make_loc_ghost = false; } let unsafe x = x let add_type id p s = { s with types = Path.Map.add (Pident id) (Path p) s.types } let add_module id p s = { s with modules = Path.Map.add (Pident id) p s.modules } let add_modtype_gen p ty s = { s with modtypes = Path.Map.add p ty s.modtypes } let add_modtype_path p p' s = add_modtype_gen p (Mty_ident p') s let add_modtype id p s = add_modtype_path (Pident id) p s let for_saving s = { s with for_saving = true } let change_locs s loc = { s with loc = Some loc } let make_loc_ghost s = { s with make_loc_ghost = true } let loc s x = match s.loc with | Some l -> l | None -> if s.for_saving && not !Clflags.keep_locs then Location.none else if s.make_loc_ghost then { x with loc_ghost = true } else x let remove_loc = let open Ast_mapper in {default_mapper with location = (fun _this _loc -> Location.none)} let is_not_doc = function | {Parsetree.attr_name = {Location.txt = "ocaml.doc"}; _} -> false | {Parsetree.attr_name = {Location.txt = "ocaml.text"}; _} -> false | {Parsetree.attr_name = {Location.txt = "doc"}; _} -> false | {Parsetree.attr_name = {Location.txt = "text"}; _} -> false | _ -> true let attrs s x = let x = if s.for_saving && not !Clflags.keep_docs then List.filter is_not_doc x else x in if s.for_saving && not !Clflags.keep_locs then remove_loc.Ast_mapper.attributes remove_loc x else x let rec module_path s path = try Path.Map.find path s.modules with Not_found -> match path with | Pident _ -> path | Pdot(p, n) -> Pdot(module_path s p, n) | Papply(p1, p2) -> Papply(module_path s p1, module_path s p2) | Pextra_ty _ -> fatal_error "Subst.module_path" let modtype_path s path = match Path.Map.find path s.modtypes with | Mty_ident p -> p | Mty_alias _ | Mty_signature _ | Mty_functor _ | Mty_for_hole as mty -> raise (Module_type_path_substituted_away (path,mty)) | exception Not_found -> match path with | Pdot(p, n) -> Pdot(module_path s p, n) | Papply _ | Pextra_ty _ -> fatal_error "Subst.modtype_path" | Pident _ -> path (* For values, extension constructors, classes and class types *) let value_path s path = match path with | Pident _ -> path | Pdot(p, n) -> Pdot(module_path s p, n) | Papply _ | Pextra_ty _ -> fatal_error "Subst.value_path" let rec type_path s path = match Path.Map.find path s.types with | Path p -> p | Type_function _ -> assert false | exception Not_found -> match path with | Pident _ -> path | Pdot(p, n) -> Pdot(module_path s p, n) | Papply _ -> fatal_error "Subst.type_path" | Pextra_ty (p, extra) -> match extra with | Pcstr_ty _ -> Pextra_ty (type_path s p, extra) | Pext_ty -> Pextra_ty (value_path s p, extra) let to_subst_by_type_function s p = match Path.Map.find p s.types with | Path _ -> false | Type_function _ -> true | exception Not_found -> false (* Special type ids for saved signatures *) let new_id = s_ref (-1) let reset_for_saving () = new_id := -1 let newpersty desc = decr new_id; create_expr desc ~level:generic_level ~scope:Btype.lowest_level ~id:!new_id (* ensure that all occurrences of 'Tvar None' are physically shared *) let tvar_none = Tvar None let tunivar_none = Tunivar None let norm = function | Tvar None -> tvar_none | Tunivar None -> tunivar_none | d -> d let apply_type_function params args body = For_copy.with_scope (fun copy_scope -> List.iter2 (fun param arg -> For_copy.redirect_desc copy_scope param (Tsubst (arg, None))) params args; let rec copy ty = assert (get_level ty = generic_level); match get_desc ty with | Tsubst (ty, _) -> ty | Tvariant row -> let t = newgenstub ~scope:(get_scope ty) in For_copy.redirect_desc copy_scope ty (Tsubst (t, None)); let more = row_more row in assert (get_level more = generic_level); let mored = get_desc more in (* We must substitute in a subtle way *) (* Tsubst takes a tuple containing the row var and the variant *) let desc' = match mored with | Tsubst (_, Some ty2) -> (* This variant type has been already copied *) (* Change the stub to avoid Tlink in the new type *) For_copy.redirect_desc copy_scope ty (Tsubst (ty2, None)); Tlink ty2 | _ -> let more' = match mored with Tsubst (ty, None) -> ty (* TODO: is this case possible? possibly an interaction with (copy more) below? *) | Tconstr _ | Tnil -> copy more | Tvar _ | Tunivar _ -> newgenty mored | _ -> assert false in let row = match get_desc more' with (* PR#6163 *) Tconstr (x,_,_) when not (is_fixed row) -> let Row {fields; more; closed; name} = row_repr row in create_row ~fields ~more ~closed ~name ~fixed:(Some (Reified x)) | _ -> row in (* Register new type first for recursion *) For_copy.redirect_desc copy_scope more (Tsubst(more', Some t)); (* Return a new copy *) Tvariant (copy_row copy true row false more') in Transient_expr.set_stub_desc t desc'; t | desc -> let t = newgenstub ~scope:(get_scope ty) in For_copy.redirect_desc copy_scope ty (Tsubst (t, None)); let desc' = copy_type_desc copy desc in Transient_expr.set_stub_desc t desc'; t in copy body) (* Similar to [Ctype.nondep_type_rec]. *) let rec typexp copy_scope s ty = let desc = get_desc ty in match desc with Tvar _ | Tunivar _ -> if s.for_saving || get_id ty < 0 then let ty' = if s.for_saving then newpersty (norm desc) else newty2 ~level:(get_level ty) desc in For_copy.redirect_desc copy_scope ty (Tsubst (ty', None)); ty' else ty | Tsubst (ty, _) -> ty | Tfield (m, k, _t1, _t2) when not s.for_saving && m = dummy_method && field_kind_repr k <> Fabsent && get_level ty < generic_level -> (* do not copy the type of self when it is not generalized *) ty (* cannot do it, since it would omit substitution | Tvariant row when not (static_row row) -> ty *) | _ -> let tm = row_of_type ty in let has_fixed_row = not (is_Tconstr ty) && is_constr_row ~allow_ident:false tm in (* Make a stub *) let ty' = if s.for_saving then newpersty (Tvar None) else newgenstub ~scope:(get_scope ty) in For_copy.redirect_desc copy_scope ty (Tsubst (ty', None)); let desc = if has_fixed_row then match get_desc tm with (* PR#7348 *) Tconstr (Pdot(m,i), tl, _abbrev) -> let i' = String.sub i 0 (String.length i - 4) in Tconstr(type_path s (Pdot(m,i')), tl, ref Mnil) | _ -> assert false else match desc with | Tconstr (p, args, _abbrev) -> let args = List.map (typexp copy_scope s) args in begin match Path.Map.find p s.types with | exception Not_found -> Tconstr(type_path s p, args, ref Mnil) | Path _ -> Tconstr(type_path s p, args, ref Mnil) | Type_function { params; body } -> Tlink (apply_type_function params args body) end | Tpackage(p, fl) -> Tpackage(modtype_path s p, List.map (fun (n, ty) -> (n, typexp copy_scope s ty)) fl) | Tobject (t1, name) -> let t1' = typexp copy_scope s t1 in let name' = match !name with | None -> None | Some (p, tl) -> if to_subst_by_type_function s p then None else Some (type_path s p, List.map (typexp copy_scope s) tl) in Tobject (t1', ref name') | Tvariant row -> let more = row_more row in let mored = get_desc more in (* We must substitute in a subtle way *) (* Tsubst takes a tuple containing the row var and the variant *) begin match mored with Tsubst (_, Some ty2) -> (* This variant type has been already copied *) (* Change the stub to avoid Tlink in the new type *) For_copy.redirect_desc copy_scope ty (Tsubst (ty2, None)); Tlink ty2 | _ -> let dup = s.for_saving || get_level more = generic_level || static_row row || is_Tconstr more in (* Various cases for the row variable *) let more' = match mored with Tsubst (ty, None) -> ty | Tconstr _ | Tnil -> typexp copy_scope s more | Tunivar _ | Tvar _ -> if s.for_saving then newpersty (norm mored) else if dup && is_Tvar more then newgenty mored else more | _ -> assert false in (* Register new type first for recursion *) For_copy.redirect_desc copy_scope more (Tsubst (more', Some ty')); (* TODO: check if more' can be eliminated *) (* Return a new copy *) let row = copy_row (typexp copy_scope s) true row (not dup) more' in match row_name row with | Some (p, tl) -> let name = if to_subst_by_type_function s p then None else Some (type_path s p, tl) in Tvariant (set_row_name row name) | None -> Tvariant row end | Tfield(_label, kind, _t1, t2) when field_kind_repr kind = Fabsent -> Tlink (typexp copy_scope s t2) | _ -> copy_type_desc (typexp copy_scope s) desc in Transient_expr.set_stub_desc ty' desc; ty' (* Always make a copy of the type. If this is not done, type levels might not be correct. *) let type_expr s ty = For_copy.with_scope (fun copy_scope -> typexp copy_scope s ty) let label_declaration copy_scope s l = { ld_id = l.ld_id; ld_mutable = l.ld_mutable; ld_type = typexp copy_scope s l.ld_type; ld_loc = loc s l.ld_loc; ld_attributes = attrs s l.ld_attributes; ld_uid = l.ld_uid; } let constructor_arguments copy_scope s = function | Cstr_tuple l -> Cstr_tuple (List.map (typexp copy_scope s) l) | Cstr_record l -> Cstr_record (List.map (label_declaration copy_scope s) l) let constructor_declaration copy_scope s c = { cd_id = c.cd_id; cd_args = constructor_arguments copy_scope s c.cd_args; cd_res = Option.map (typexp copy_scope s) c.cd_res; cd_loc = loc s c.cd_loc; cd_attributes = attrs s c.cd_attributes; cd_uid = c.cd_uid; } let type_declaration' copy_scope s decl = { type_params = List.map (typexp copy_scope s) decl.type_params; type_arity = decl.type_arity; type_kind = begin match decl.type_kind with Type_abstract r -> Type_abstract r | Type_variant (cstrs, rep) -> Type_variant (List.map (constructor_declaration copy_scope s) cstrs, rep) | Type_record(lbls, rep) -> Type_record (List.map (label_declaration copy_scope s) lbls, rep) | Type_open -> Type_open end; type_manifest = begin match decl.type_manifest with None -> None | Some ty -> Some(typexp copy_scope s ty) end; type_private = decl.type_private; type_variance = decl.type_variance; type_separability = decl.type_separability; type_is_newtype = false; type_expansion_scope = Btype.lowest_level; type_loc = loc s decl.type_loc; type_attributes = attrs s decl.type_attributes; type_immediate = decl.type_immediate; type_unboxed_default = decl.type_unboxed_default; type_uid = decl.type_uid; } let type_declaration s decl = For_copy.with_scope (fun copy_scope -> type_declaration' copy_scope s decl) let class_signature copy_scope s sign = { csig_self = typexp copy_scope s sign.csig_self; csig_self_row = typexp copy_scope s sign.csig_self_row; csig_vars = Vars.map (function (m, v, t) -> (m, v, typexp copy_scope s t)) sign.csig_vars; csig_meths = Meths.map (function (p, v, t) -> (p, v, typexp copy_scope s t)) sign.csig_meths; } let rec class_type copy_scope s = function | Cty_constr (p, tyl, cty) -> let p' = type_path s p in let tyl' = List.map (typexp copy_scope s) tyl in let cty' = class_type copy_scope s cty in Cty_constr (p', tyl', cty') | Cty_signature sign -> Cty_signature (class_signature copy_scope s sign) | Cty_arrow (l, ty, cty) -> Cty_arrow (l, typexp copy_scope s ty, class_type copy_scope s cty) let class_declaration' copy_scope s decl = { cty_params = List.map (typexp copy_scope s) decl.cty_params; cty_variance = decl.cty_variance; cty_type = class_type copy_scope s decl.cty_type; cty_path = type_path s decl.cty_path; cty_new = begin match decl.cty_new with | None -> None | Some ty -> Some (typexp copy_scope s ty) end; cty_loc = loc s decl.cty_loc; cty_attributes = attrs s decl.cty_attributes; cty_uid = decl.cty_uid; } let class_declaration s decl = For_copy.with_scope (fun copy_scope -> class_declaration' copy_scope s decl) let cltype_declaration' copy_scope s decl = { clty_params = List.map (typexp copy_scope s) decl.clty_params; clty_variance = decl.clty_variance; clty_type = class_type copy_scope s decl.clty_type; clty_path = type_path s decl.clty_path; clty_hash_type = type_declaration' copy_scope s decl.clty_hash_type ; clty_loc = loc s decl.clty_loc; clty_attributes = attrs s decl.clty_attributes; clty_uid = decl.clty_uid; } let cltype_declaration s decl = For_copy.with_scope (fun copy_scope -> cltype_declaration' copy_scope s decl) let class_type s cty = For_copy.with_scope (fun copy_scope -> class_type copy_scope s cty) let value_description' copy_scope s descr = { val_type = typexp copy_scope s descr.val_type; val_kind = descr.val_kind; val_loc = loc s descr.val_loc; val_attributes = attrs s descr.val_attributes; val_uid = descr.val_uid; } let value_description s descr = For_copy.with_scope (fun copy_scope -> value_description' copy_scope s descr) let extension_constructor' copy_scope s ext = { ext_type_path = type_path s ext.ext_type_path; ext_type_params = List.map (typexp copy_scope s) ext.ext_type_params; ext_args = constructor_arguments copy_scope s ext.ext_args; ext_ret_type = Option.map (typexp copy_scope s) ext.ext_ret_type; ext_private = ext.ext_private; ext_attributes = attrs s ext.ext_attributes; ext_loc = if s.for_saving then Location.none else ext.ext_loc; ext_uid = ext.ext_uid; } let extension_constructor s ext = For_copy.with_scope (fun copy_scope -> extension_constructor' copy_scope s ext) (* For every binding k |-> d of m1, add k |-> f d to m2 and return resulting merged map. *) let merge_path_maps f m1 m2 = Path.Map.fold (fun k d accu -> Path.Map.add k (f d) accu) m1 m2 let keep_latest_loc l1 l2 = match l2 with | None -> l1 | Some _ -> l2 let type_replacement s = function | Path p -> Path (type_path s p) | Type_function { params; body } -> For_copy.with_scope (fun copy_scope -> let params = List.map (typexp copy_scope s) params in let body = typexp copy_scope s body in Type_function { params; body }) type scoping = | Keep | Make_local | Rescope of int module Lazy_types = struct type module_decl = { mdl_type: modtype; mdl_attributes: Parsetree.attributes; mdl_loc: Location.t; mdl_uid: Uid.t; } and modtype = | MtyL_ident of Path.t | MtyL_signature of signature | MtyL_functor of functor_parameter * modtype | MtyL_alias of Path.t | MtyL_for_hole and modtype_declaration = { mtdl_type: modtype option; mtdl_attributes: Parsetree.attributes; mtdl_loc: Location.t; mtdl_uid: Uid.t; } and signature' = | S_eager of Types.signature | S_lazy of signature_item list and signature = (scoping * t * signature', signature') Lazy_backtrack.t and signature_item = SigL_value of Ident.t * value_description * visibility | SigL_type of Ident.t * type_declaration * rec_status * visibility | SigL_typext of Ident.t * extension_constructor * ext_status * visibility | SigL_module of Ident.t * module_presence * module_decl * rec_status * visibility | SigL_modtype of Ident.t * modtype_declaration * visibility | SigL_class of Ident.t * class_declaration * rec_status * visibility | SigL_class_type of Ident.t * class_type_declaration * rec_status * visibility and functor_parameter = | Unit | Named of Ident.t option * modtype end open Lazy_types let rename_bound_idents scoping s sg = let rename = let open Ident in match scoping with | Keep -> (fun id -> create_scoped ~scope:(scope id) (name id)) | Make_local -> Ident.rename | Rescope scope -> (fun id -> create_scoped ~scope (name id)) in let rec rename_bound_idents s sg = function | [] -> sg, s | SigL_type(id, td, rs, vis) :: rest -> let id' = rename id in rename_bound_idents (add_type id (Pident id') s) (SigL_type(id', td, rs, vis) :: sg) rest | SigL_module(id, pres, md, rs, vis) :: rest -> let id' = rename id in rename_bound_idents (add_module id (Pident id') s) (SigL_module (id', pres, md, rs, vis) :: sg) rest | SigL_modtype(id, mtd, vis) :: rest -> let id' = rename id in rename_bound_idents (add_modtype id (Pident id') s) (SigL_modtype(id', mtd, vis) :: sg) rest | SigL_class(id, cd, rs, vis) :: rest -> (* cheat and pretend they are types cf. PR#6650 *) let id' = rename id in rename_bound_idents (add_type id (Pident id') s) (SigL_class(id', cd, rs, vis) :: sg) rest | SigL_class_type(id, ctd, rs, vis) :: rest -> (* cheat and pretend they are types cf. PR#6650 *) let id' = rename id in rename_bound_idents (add_type id (Pident id') s) (SigL_class_type(id', ctd, rs, vis) :: sg) rest | SigL_value(id, vd, vis) :: rest -> (* scope doesn't matter for value identifiers. *) let id' = Ident.rename id in rename_bound_idents s (SigL_value(id', vd, vis) :: sg) rest | SigL_typext(id, ec, es, vis) :: rest -> let id' = rename id in rename_bound_idents s (SigL_typext(id',ec,es,vis) :: sg) rest in rename_bound_idents s [] sg let rec lazy_module_decl md = { mdl_type = lazy_modtype md.md_type; mdl_attributes = md.md_attributes; mdl_loc = md.md_loc; mdl_uid = md.md_uid } and subst_lazy_module_decl scoping s md = let mdl_type = subst_lazy_modtype scoping s md.mdl_type in { mdl_type; mdl_attributes = attrs s md.mdl_attributes; mdl_loc = loc s md.mdl_loc; mdl_uid = md.mdl_uid } and force_module_decl md = let md_type = force_modtype md.mdl_type in { md_type; md_attributes = md.mdl_attributes; md_loc = md.mdl_loc; md_uid = md.mdl_uid } and lazy_modtype = function | Mty_ident p -> MtyL_ident p | Mty_signature sg -> MtyL_signature (Lazy_backtrack.create_forced (S_eager sg)) | Mty_functor (Unit, mty) -> MtyL_functor (Unit, lazy_modtype mty) | Mty_functor (Named (id, arg), res) -> MtyL_functor (Named (id, lazy_modtype arg), lazy_modtype res) | Mty_alias p -> MtyL_alias p | Mty_for_hole -> MtyL_for_hole and subst_lazy_modtype scoping s = function | MtyL_ident p -> begin match Path.Map.find p s.modtypes with | mty -> lazy_modtype mty | exception Not_found -> begin match p with | Pident _ -> MtyL_ident p | Pdot(p, n) -> MtyL_ident(Pdot(module_path s p, n)) | Papply _ | Pextra_ty _ -> fatal_error "Subst.modtype" end end | MtyL_signature sg -> MtyL_signature(subst_lazy_signature scoping s sg) | MtyL_functor(Unit, res) -> MtyL_functor(Unit, subst_lazy_modtype scoping s res) | MtyL_functor(Named (None, arg), res) -> MtyL_functor(Named (None, (subst_lazy_modtype scoping s) arg), subst_lazy_modtype scoping s res) | MtyL_functor(Named (Some id, arg), res) -> let id' = Ident.rename id in MtyL_functor(Named (Some id', (subst_lazy_modtype scoping s) arg), subst_lazy_modtype scoping (add_module id (Pident id') s) res) | MtyL_alias p -> MtyL_alias (module_path s p) | MtyL_for_hole -> MtyL_for_hole and force_modtype = function | MtyL_ident p -> Mty_ident p | MtyL_signature sg -> Mty_signature (force_signature sg) | MtyL_functor (param, res) -> let param : Types.functor_parameter = match param with | Unit -> Unit | Named (id, mty) -> Named (id, force_modtype mty) in Mty_functor (param, force_modtype res) | MtyL_alias p -> Mty_alias p | MtyL_for_hole -> Mty_for_hole and lazy_modtype_decl mtd = let mtdl_type = Option.map lazy_modtype mtd.mtd_type in { mtdl_type; mtdl_attributes = mtd.mtd_attributes; mtdl_loc = mtd.mtd_loc; mtdl_uid = mtd.mtd_uid } and subst_lazy_modtype_decl scoping s mtd = { mtdl_type = Option.map (subst_lazy_modtype scoping s) mtd.mtdl_type; mtdl_attributes = attrs s mtd.mtdl_attributes; mtdl_loc = loc s mtd.mtdl_loc; mtdl_uid = mtd.mtdl_uid } and force_modtype_decl mtd = let mtd_type = Option.map force_modtype mtd.mtdl_type in { mtd_type; mtd_attributes = mtd.mtdl_attributes; mtd_loc = mtd.mtdl_loc; mtd_uid = mtd.mtdl_uid } and subst_lazy_signature scoping s sg = match Lazy_backtrack.get_contents sg with | Left (scoping', s', sg) -> let scoping = match scoping', scoping with | sc, Keep -> sc | _, (Make_local|Rescope _) -> scoping in let s = compose s' s in Lazy_backtrack.create (scoping, s, sg) | Right sg -> Lazy_backtrack.create (scoping, s, sg) and force_signature sg = List.map force_signature_item (force_signature_once sg) and force_signature_once sg = lazy_signature' (Lazy_backtrack.force force_signature_once' sg) and lazy_signature' = function | S_lazy sg -> sg | S_eager sg -> List.map lazy_signature_item sg and force_signature_once' (scoping, s, sg) = let sg = lazy_signature' sg in (* Components of signature may be mutually recursive (e.g. type declarations or class and type declarations), so first build global renaming substitution... *) let (sg', s') = rename_bound_idents scoping s sg in (* ... then apply it to each signature component in turn *) For_copy.with_scope (fun copy_scope -> S_lazy (List.rev_map (subst_lazy_signature_item' copy_scope scoping s') sg') ) and lazy_signature_item = function | Sig_value(id, d, vis) -> SigL_value(id, d, vis) | Sig_type(id, d, rs, vis) -> SigL_type(id, d, rs, vis) | Sig_typext(id, ext, es, vis) -> SigL_typext(id, ext, es, vis) | Sig_module(id, res, d, rs, vis) -> SigL_module(id, res, lazy_module_decl d, rs, vis) | Sig_modtype(id, d, vis) -> SigL_modtype(id, lazy_modtype_decl d, vis) | Sig_class(id, d, rs, vis) -> SigL_class(id, d, rs, vis) | Sig_class_type(id, d, rs, vis) -> SigL_class_type(id, d, rs, vis) and subst_lazy_signature_item' copy_scope scoping s comp = match comp with SigL_value(id, d, vis) -> SigL_value(id, value_description' copy_scope s d, vis) | SigL_type(id, d, rs, vis) -> SigL_type(id, type_declaration' copy_scope s d, rs, vis) | SigL_typext(id, ext, es, vis) -> SigL_typext(id, extension_constructor' copy_scope s ext, es, vis) | SigL_module(id, pres, d, rs, vis) -> SigL_module(id, pres, subst_lazy_module_decl scoping s d, rs, vis) | SigL_modtype(id, d, vis) -> SigL_modtype(id, subst_lazy_modtype_decl scoping s d, vis) | SigL_class(id, d, rs, vis) -> SigL_class(id, class_declaration' copy_scope s d, rs, vis) | SigL_class_type(id, d, rs, vis) -> SigL_class_type(id, cltype_declaration' copy_scope s d, rs, vis) and force_signature_item = function | SigL_value(id, vd, vis) -> Sig_value(id, vd, vis) | SigL_type(id, d, rs, vis) -> Sig_type(id, d, rs, vis) | SigL_typext(id, ext, es, vis) -> Sig_typext(id, ext, es, vis) | SigL_module(id, pres, d, rs, vis) -> Sig_module(id, pres, force_module_decl d, rs, vis) | SigL_modtype(id, d, vis) -> Sig_modtype (id, force_modtype_decl d, vis) | SigL_class(id, d, rs, vis) -> Sig_class(id, d, rs, vis) | SigL_class_type(id, d, rs, vis) -> Sig_class_type(id, d, rs, vis) and modtype scoping s t = t |> lazy_modtype |> subst_lazy_modtype scoping s |> force_modtype (* Composition of substitutions: apply (compose s1 s2) x = apply s2 (apply s1 x) *) and compose s1 s2 = if s1 == identity then s2 else if s2 == identity then s1 else { types = merge_path_maps (type_replacement s2) s1.types s2.types; modules = merge_path_maps (module_path s2) s1.modules s2.modules; modtypes = merge_path_maps (modtype Keep s2) s1.modtypes s2.modtypes; for_saving = s1.for_saving || s2.for_saving; loc = keep_latest_loc s1.loc s2.loc; make_loc_ghost = s1.make_loc_ghost || s2.make_loc_ghost; } let subst_lazy_signature_item scoping s comp = For_copy.with_scope (fun copy_scope -> subst_lazy_signature_item' copy_scope scoping s comp) module Lazy = struct include Lazy_types let of_module_decl = lazy_module_decl let of_modtype = lazy_modtype let of_modtype_decl = lazy_modtype_decl let of_signature sg = Lazy_backtrack.create_forced (S_eager sg) let of_signature_items sg = Lazy_backtrack.create_forced (S_lazy sg) let of_signature_item = lazy_signature_item let module_decl = subst_lazy_module_decl let modtype = subst_lazy_modtype let modtype_decl = subst_lazy_modtype_decl let signature = subst_lazy_signature let signature_item = subst_lazy_signature_item let force_module_decl = force_module_decl let force_modtype = force_modtype let force_modtype_decl = force_modtype_decl let force_signature = force_signature let force_signature_once = force_signature_once let force_signature_item = force_signature_item end let signature sc s sg = Lazy.(sg |> of_signature |> signature sc s |> force_signature) let signature_item sc s comp = Lazy.(comp|> of_signature_item |> signature_item sc s |> force_signature_item) let modtype_declaration sc s decl = Lazy.(decl |> of_modtype_decl |> modtype_decl sc s |> force_modtype_decl) let module_declaration scoping s decl = Lazy.(decl |> of_module_decl |> module_decl scoping s |> force_module_decl) module Unsafe = struct type t = unsafe subst type error = Fcm_type_substituted_away of Path.t * Types.module_type let add_modtype_path = add_modtype_gen let add_modtype id mty s = add_modtype_path (Pident id) mty s let add_type_path id p s = { s with types = Path.Map.add id (Path p) s.types } let add_type_function id ~params ~body s = { s with types = Path.Map.add id (Type_function { params; body }) s.types } let add_module_path id p s = { s with modules = Path.Map.add id p s.modules } let wrap f = match f () with | x -> Ok x | exception Module_type_path_substituted_away (p,mty) -> Error (Fcm_type_substituted_away (p,mty)) let signature_item sc s comp = wrap (fun () -> signature_item sc s comp) let signature sc s comp = wrap (fun () -> signature sc s comp ) let compose s1 s2 = wrap (fun () -> compose s1 s2) let type_declaration s t = wrap (fun () -> type_declaration s t) end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>