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_utils/load_path.ml.html
Source file load_path.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
(**************************************************************************) (* *) (* OCaml *) (* *) (* Jeremie Dimino, Jane Street Europe *) (* *) (* Copyright 2018 Jane Street Group LLC *) (* *) (* 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. *) (* *) (**************************************************************************) open Local_store module STbl = Misc.String.Tbl (* Mapping from basenames to full filenames *) type registry = string STbl.t let visible_files : registry ref = s_table STbl.create 42 let visible_files_uncap : registry ref = s_table STbl.create 42 let : registry ref = s_table STbl.create 42 let : registry ref = s_table STbl.create 42 module Dir = struct type t = { path : string; files : string list; hidden : bool; } let path t = t.path let files t = t.files let t = t.hidden let find t fn = if List.mem fn t.files then Some (Filename.concat t.path fn) else None let find_normalized t fn = let fn = Misc.normalized_unit_filename fn in let search base = if Misc.normalized_unit_filename base = fn then Some (Filename.concat t.path base) else None in List.find_map search t.files let create ~ path = { path; files = Array.to_list (Directory_content_cache.read path); hidden } let check t = Directory_content_cache.check t.path end type auto_include_callback = (Dir.t -> string -> string option) -> string -> string let visible_dirs = s_ref [] let = s_ref [] let no_auto_include _ _ = raise Not_found let auto_include_callback = ref no_auto_include let reset_visible () = assert (not Config.merlin || Local_store.is_bound ()); STbl.clear !visible_files; STbl.clear !visible_files_uncap; visible_dirs := [] let () = assert (not Config.merlin || Local_store.is_bound ()); STbl.clear !hidden_files; STbl.clear !hidden_files_uncap; hidden_dirs := [] let reset ?( = false) ?(only_visible = false) () = if not only_visible then reset_hidden (); if not only_hidden then reset_visible (); auto_include_callback := no_auto_include let get_visible () = List.rev !visible_dirs let get_path_list () = Misc.rev_map_end Dir.path !visible_dirs (List.rev_map Dir.path !hidden_dirs) type paths = { visible : string list; hidden : string list } let get_paths () = { visible = List.rev_map Dir.path !visible_dirs; hidden = List.rev_map Dir.path !hidden_dirs } let get_visible_path_list () = List.rev_map Dir.path !visible_dirs let () = List.rev_map Dir.path !hidden_dirs (* Optimized version of [add] below, for use in [init] and [remove_dir]: since we are starting from an empty cache, we can avoid checking whether a unit name already exists in the cache simply by adding entries in reverse order. *) let prepend_add dir = List.iter (fun base -> let fn = Filename.concat dir.Dir.path base in let filename = Misc.normalized_unit_filename base in if dir.Dir.hidden then begin STbl.replace !hidden_files base fn; STbl.replace !hidden_files_uncap filename fn end else begin STbl.replace !visible_files base fn; STbl.replace !visible_files_uncap filename fn end ) dir.Dir.files let init ~auto_include ~visible ~ = assert (not Config.merlin || Local_store.is_bound ()); let rec loop_changed ~ acc = function | [] -> Some acc | new_path :: new_rest -> loop_changed ~hidden (Dir.create ~hidden new_path :: acc) new_rest in let rec loop_unchanged ~ acc new_paths old_dirs = match new_paths, old_dirs with | [], [] -> None | new_path :: new_rest, [] -> loop_changed ~hidden (Dir.create ~hidden new_path :: acc) new_rest | [], _ :: _ -> Some acc | new_path :: new_rest, old_dir :: old_rest -> if String.equal new_path (Dir.path old_dir) then begin if Dir.check old_dir then begin loop_unchanged ~hidden (old_dir :: acc) new_rest old_rest end else begin loop_changed ~hidden (Dir.create ~hidden new_path :: acc) new_rest end end else begin loop_changed ~hidden (Dir.create ~hidden new_path :: acc) new_rest end in let () = match loop_unchanged ~hidden:false [] visible (List.rev !visible_dirs) with | None -> () | Some new_dirs -> reset ~only_visible:true (); visible_dirs := new_dirs; List.iter prepend_add new_dirs; auto_include_callback := auto_include in match loop_unchanged ~hidden:true [] hidden (List.rev !hidden_dirs) with | None -> () | Some new_dirs -> reset ~only_hidden:true (); hidden_dirs := new_dirs; List.iter prepend_add new_dirs; auto_include_callback := auto_include let remove_dir dir = assert (not Config.merlin || Local_store.is_bound ()); let visible = List.filter (fun d -> Dir.path d <> dir) !visible_dirs in let = List.filter (fun d -> Dir.path d <> dir) !hidden_dirs in if List.compare_lengths visible !visible_dirs <> 0 || List.compare_lengths hidden !hidden_dirs <> 0 then begin reset (); visible_dirs := visible; hidden_dirs := hidden; List.iter prepend_add hidden; List.iter prepend_add visible end (* General purpose version of function to add a new entry to load path: We only add a basename to the cache if it is not already present, in order to enforce left-to-right precedence. *) let add (dir : Dir.t) = assert (not Config.merlin || Local_store.is_bound ()); let update base fn visible_files = if dir.hidden && not (STbl.mem !hidden_files base) then STbl.replace !hidden_files base fn else if not (STbl.mem !visible_files base) then STbl.replace !visible_files base fn in List.iter (fun base -> let fn = Filename.concat dir.Dir.path base in update base fn visible_files hidden_files; let ubase = Misc.normalized_unit_filename base in update ubase fn visible_files_uncap hidden_files_uncap) dir.files; if dir.hidden then hidden_dirs := dir :: !hidden_dirs else visible_dirs := dir :: !visible_dirs let append_dir = add let add_dir ~ dir = add (Dir.create ~hidden dir) (* Add the directory at the start of load path - so basenames are unconditionally added. *) let prepend_dir (dir : Dir.t) = assert (not Config.merlin || Local_store.is_bound ()); prepend_add dir; if dir.hidden then hidden_dirs := !hidden_dirs @ [dir] else visible_dirs := !visible_dirs @ [dir] let is_basename fn = Filename.basename fn = fn (* let auto_include_libs libs alert find_in_dir fn = let scan (lib, lazy dir) = let file = find_in_dir dir fn in let alert_and_add_dir _ = alert lib; append_dir dir in Option.iter alert_and_add_dir file; file in match List.find_map scan libs with | Some base -> base | None -> raise Not_found *) (* let auto_include_otherlibs = (* Ensure directories are only ever scanned once *) let expand = Misc.expand_directory Config.standard_library in let otherlibs = let read_lib lib = lazy (Dir.create ~hidden:false (expand ("+" ^ lib))) in List.map (fun lib -> (lib, read_lib lib)) ["dynlink"; "str"; "unix"] in auto_include_libs otherlibs *) type visibility = Visible | Hidden let find_file_in_cache fn visible_files = try (STbl.find !visible_files fn, Visible) with | Not_found -> (STbl.find !hidden_files fn, Hidden) let find fn = assert (not Config.merlin || Local_store.is_bound ()); try if is_basename fn && not !Sys.interactive then fst (find_file_in_cache fn visible_files hidden_files) else Misc.find_in_path (get_path_list ()) fn with Not_found -> !auto_include_callback Dir.find fn let find_normalized_with_visibility fn = assert (not Config.merlin || Local_store.is_bound ()); try if is_basename fn && not !Sys.interactive then find_file_in_cache (Misc.normalized_unit_filename fn) visible_files_uncap hidden_files_uncap else try (Misc.find_in_path_normalized (get_visible_path_list ()) fn, Visible) with | Not_found -> (Misc.find_in_path_normalized (get_hidden_path_list ()) fn, Hidden) with Not_found -> let fn_uncap = Misc.normalized_unit_filename fn in (!auto_include_callback Dir.find_normalized fn_uncap, Visible) let find_normalized fn = fst (find_normalized_with_visibility fn) (* Merlin: expose standard reset function *) let reset () = reset ()
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>