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.analysis/browse_misc.ml.html
Source file browse_misc.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
(* {{{ COPYING *( This file is part of Merlin, an helper for ocaml editors Copyright (C) 2013 - 2015 Frédéric Bour <frederic.bour(_)lakaban.net> Thomas Refis <refis.thomas(_)gmail.com> Simon Castellan <simon.castellan(_)iuwt.fr> Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. The Software is provided "as is", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages or other liability, whether in an action of contract, tort or otherwise, arising from, out of or in connection with the software or the use or other dealings in the Software. )* }}} *) open Std let dummy_type_scheme desc = Types.create_expr desc ~level:0 ~id:0 ~scope:Btype.generic_level let print_constructor c = let open Types in match c.cstr_args with | [] -> Out_type.tree_of_typexp Type_scheme (dummy_type_scheme (get_desc c.cstr_res)) | args -> let desc = Tarrow ( Ast_helper.no_label, dummy_type_scheme (Ttuple args), c.cstr_res, commu_ok ) in Out_type.tree_of_typexp Type_scheme (dummy_type_scheme desc) let summary_prev = function | Env.Env_empty -> None | Env.Env_open (s, _) | Env.Env_value (s, _, _) | Env.Env_type (s, _, _) | Env.Env_extension (s, _, _) | Env.Env_module (s, _, _, _) | Env.Env_modtype (s, _, _) | Env.Env_class (s, _, _) | Env.Env_cltype (s, _, _) | Env.Env_functor_arg (s, _) | Env.Env_constraints (s, _) | Env.Env_copy_types s | Env.Env_persistent (s, _) | Env.Env_value_unbound (s, _, _) | Env.Env_module_unbound (s, _, _) -> Some s let signature_of_env ?(ignore_extensions = true) env = let signature_of_summary = let open Env in let open Types in (* FIXME: the use of [Exported] here is wrong... The compiler should export that information. *) function | Env_value (_, i, v) -> Some (Sig_value (i, v, Exported)) (* Trec_not == bluff, FIXME *) | Env_type (_, i, t) -> Some (Sig_type (i, t, Trec_not, Exported)) (* Texp_first == bluff, FIXME *) | Env_extension (_, i, e) -> begin match e.ext_type_path with | Path.Pident id when Ident.name id = "exn" -> Some (Sig_typext (i, e, Text_exception, Exported)) | _ -> Some (Sig_typext (i, e, Text_first, Exported)) end | Env_module (_, i, pr, m) -> Some (Sig_module (i, pr, m, Trec_not, Exported)) | Env_modtype (_, i, m) -> Some (Sig_modtype (i, m, Exported)) | Env_class (_, i, c) -> Some (Sig_class (i, c, Trec_not, Exported)) | Env_cltype (_, i, c) -> Some (Sig_class_type (i, c, Trec_not, Exported)) | Env_open _ | Env_empty | Env_functor_arg _ | Env_constraints _ | Env_copy_types _ | Env_persistent _ | Env_value_unbound _ | Env_module_unbound _ -> None in let summary_module_ident_opt = function | Env.Env_module (_, i, _, _) -> Some i | _ -> None in let sg = ref [] in let append item = sg := item :: !sg in let rec aux summary = match summary_module_ident_opt summary with | Some i when ignore_extensions && i = Extension.ident -> () | _ -> Option.iter ~f:append (signature_of_summary summary); Option.iter ~f:aux (summary_prev summary) in aux (Env.summary env); (* Since 4.08 one can't simply call [simplify]. *) (* Typemod.simplify_signature *) !sg let dump_browse node = let attr attr = let { Location.txt; loc }, payload = Ast_helper.Attr.as_tuple attr in `Assoc [ ("start", Lexing.json_of_position loc.Location.loc_start); ("end", Lexing.json_of_position loc.Location.loc_end); ( "name", `String (txt ^ if payload = Parsetree.PStr [] then "" else " _") ) ] in let rec append env node acc = let loc = Mbrowse.node_loc node in `Assoc [ ("filename", `String loc.Location.loc_start.Lexing.pos_fname); ("start", Lexing.json_of_position loc.Location.loc_start); ("end", Lexing.json_of_position loc.Location.loc_end); ("ghost", `Bool loc.Location.loc_ghost); ("attrs", `List (List.map ~f:attr (Browse_raw.node_attributes node))); ("kind", `String (Browse_raw.string_of_node node)); ("children", dump_list env node) ] :: acc and dump_list env node = `List (List.sort ~cmp:compare @@ Mbrowse.fold_node append env node []) in `List (append Env.empty node []) let annotate_tail_calls (ts : Mbrowse.t) : (Env.t * Browse_raw.node * Query_protocol.is_tail_position) list = let is_one_of candidates node = List.mem node ~set:candidates in let find_entry_points candidates (env, node) = (Tail_analysis.entry_points node, (env, node, is_one_of candidates node)) in let _, entry_points = List.fold_n_map ts ~f:find_entry_points ~init:[] in let propagate candidates (env, node, entry) = let is_in_tail = entry || is_one_of candidates node in ( (if is_in_tail then Tail_analysis.tail_positions node else []), (env, node, is_in_tail) ) in let _, tail_positions = List.fold_n_map entry_points ~f:propagate ~init:[] in List.map ~f:(fun (env, node, tail) -> ( env, node, if not tail then `No else if Tail_analysis.is_call node then `Tail_call else `Tail_position )) tail_positions
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>