package merlin-lib
Merlin's libraries
Install
Dune Dependency
Authors
Maintainers
Sources
merlin-5.3-502.tbz
sha256=2cea46f12397fa6e31ef0c0d4f5e11c1cfd916ee49420694005c95ebb3aa24bc
sha512=e94abb9ae38149245337db033e2c3891c7ec772168e99abf1bda0216a894c0854e7170b56fe88eba83ec98f2ebc0f5c7c723e8db14f59eeb6dd348bec12c6d62
doc/src/merlin-lib.analysis/browse_tree.ml.html
Source file browse_tree.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
(* {{{ 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 default_loc = Location.none let default_env = Env.empty type t = { t_node : Mbrowse.node; t_loc : Location.t; t_env : Env.t; t_children : t list lazy_t } let of_node ?(env = default_env) node = let rec one t_env t_node = let t_loc = Mbrowse.node_loc t_node in let rec t = { t_node; t_env; t_loc; t_children = lazy (aux t) } in t and aux t = Mbrowse.fold_node (fun env node acc -> one env node :: acc) t.t_env t.t_node [] in one (Browse_raw.node_update_env env node) node let of_browse b = let env, node = Mbrowse.leaf_node b in of_node ~env node let dummy = { t_node = Browse_raw.Dummy; t_loc = default_loc; t_env = default_env; t_children = lazy [] } let all_occurrences_of_prefix path node = let rec path_prefix ~prefix path = Path.same prefix path || match path with | Pdot (p, _) -> path_prefix ~prefix p | _ -> false in let rec aux env node acc = let acc = let paths_and_lids = Browse_raw.node_paths_and_longident node in let has_prefix ({ Location.txt; _ }, _) = match txt with | Path.Pdot (p, _) -> path_prefix ~prefix:path p | _ -> false in List.fold_right paths_and_lids ~init:acc ~f:(fun elt acc -> if has_prefix elt then elt :: acc else acc) in Browse_raw.fold_node aux env node acc in aux Env.empty node []
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>