package dolmen
Source file name.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(* This file is free software, part of dolmen. See file "LICENSE" for more information. *) (* Type definition *) (* ************************************************************************* *) type t = | Simple of string | Indexed of { basename : string; indexes : string list; } | Qualified of { path : string list; basename : string; } (* Creation functions *) (* ************************************************************************* *) let simple basename = Simple basename let indexed basename indexes = Indexed { basename; indexes; } let qualified path basename = Qualified { path; basename; } (* Std functions *) (* ************************************************************************* *) let print fmt = function | Simple basename -> if Misc.exists_in_string (function ' ' | '\n' | '\t' -> true | _ -> false) basename then Format.fprintf fmt "'%s'" basename else Format.fprintf fmt "%s" basename | Indexed { basename; indexes; } -> Format.fprintf fmt "(_ %s %a)" basename (Format.pp_print_list ~pp_sep:Format.pp_print_space Format.pp_print_string) indexes | Qualified { path = []; basename; } -> Format.fprintf fmt "%s" basename | Qualified { path; basename; } -> Format.fprintf fmt "%a.%s" (Format.pp_print_list ~pp_sep:Format.pp_print_space Format.pp_print_string) path basename let hash = function | Simple basename -> Misc.hash2 3 (Misc.hash_string basename) | Indexed { basename; indexes; } -> Misc.hash3 5 (Misc.hash_string basename) (Misc.hash_list Misc.hash_string indexes) | Qualified { path; basename; } -> Misc.hash3 7 (Misc.hash_list Misc.hash_string path) (Misc.hash_string basename) let discr = function | Simple _ -> 0 | Indexed _ -> 1 | Qualified _ -> 2 let compare n n' = let (<?>) = Misc.(<?>) in match n, n' with | Simple name, Simple name' -> String.compare name name' | Indexed { basename = s; indexes = l; }, Indexed { basename = s'; indexes = l'; } -> String.compare s s' <?> (Misc.lexicographic String.compare, l, l') | Qualified { path = p; basename = s; }, Qualified { path = p'; basename = s'; } -> Misc.lexicographic String.compare p p' <?> (String.compare, s, s') | _, _ -> compare (discr n) (discr n') let equal n n' = n == n' || compare n n' = 0 (* Maps *) (* ************************************************************************* *) module Map = struct module M = Maps.String type key = t (* Types *) type 'a t = { simple : 'a M.t; qualified : 'a qualified M.t; indexed : 'a indexed M.t; } and 'a qualified = { base : 'a M.t; mod_value : 'a option; path : 'a qualified M.t; } and 'a indexed = { value : 'a option; prefix_value : 'a option; index : 'a indexed M.t; } (* Empty *) let empty = { simple = M.empty; qualified = M.empty; indexed = M.empty; } let empty_q = { base = M.empty; path = M.empty; mod_value = None; } let empty_i = { value = None; prefix_value = None; index = M.empty; } (* helper functions *) let (>=) o o' = match o with | Some _ as res -> res | None -> o' (* find *) let rec find_opt k t = match k with | Simple basename -> M.find_opt basename t.simple | Qualified { path = []; _ } -> assert false | Qualified { path = hd :: tl; basename; } -> begin match M.find_opt hd t.qualified with | None -> None | Some q -> find_qualified basename None q tl end | Indexed { basename; indexes; } -> begin match M.find_opt basename t.indexed with | None -> None | Some i -> find_indexed None i indexes end and find_qualified basename prec_mod_value { base; path; mod_value; } = function | [] -> M.find_opt basename base >= mod_value >= prec_mod_value | s :: r -> let prec_mod_value = mod_value >= prec_mod_value in begin match M.find_opt s path with | Some q' -> find_qualified basename prec_mod_value q' r | None -> prec_mod_value end and find_indexed prec_index_value { value; index; prefix_value; } indexes = match indexes with | [] -> value >= prefix_value >= prec_index_value | s :: r -> let prec_index_value = prefix_value >= prec_index_value in begin match M.find_opt s index with | Some i' -> find_indexed prec_index_value i' r | None -> prec_index_value end let find_exn k t = match find_opt k t with | Some res -> res | None -> raise Not_found (* Add *) let rec add k v t = match k with | Simple basename -> { t with simple = M.add basename v t.simple; } | Qualified { path = []; _ } -> assert false | Qualified { path = hd :: tl; basename; } -> { t with qualified = M.find_add hd (function | None -> add_qualified basename v empty_q tl | Some q -> add_qualified basename v q tl ) t.qualified; } | Indexed { basename; indexes; } -> { t with indexed = M.find_add basename (function | None -> add_indexed v empty_i indexes | Some i -> add_indexed v i indexes ) t.indexed; } and add_qualified basename v q = function | [] -> { q with base = M.add basename v q.base; } | s :: r -> { q with path = M.find_add s (function | None -> add_qualified basename v empty_q r | Some q' -> add_qualified basename v q' r ) q.path; } and add_indexed v i = function | [] -> { i with value = Some v; } | s :: r -> { i with index = M.find_add s (function | None -> add_indexed v empty_i r | Some i' -> add_indexed v i' r ) i.index; } (* Add-set *) let rec add_set ~prefix v t = match prefix with | Simple basename -> { t with simple = M.add basename v t.simple; } | Qualified { path = []; _ } -> assert false | Qualified { path = hd :: tl; basename; } -> { t with qualified = M.find_add hd (function | None -> add_set_qualified basename v empty_q tl | Some q -> add_set_qualified basename v q tl ) t.qualified; } | Indexed { basename; indexes; } -> { t with indexed = M.find_add basename (function | None -> add_set_indexed v empty_i indexes | Some i -> add_set_indexed v i indexes ) t.indexed; } and add_set_qualified basename v q = function | [] -> assert (basename = ""); { q with mod_value = Some v; } | s :: r -> { q with path = M.find_add s (function | None -> add_set_qualified basename v empty_q r | Some q' -> add_set_qualified basename v q' r ) q.path; } and add_set_indexed v i = function | [] -> { i with prefix_value = Some v; } | s :: r -> { i with index = M.find_add s (function | None -> add_set_indexed v empty_i r | Some i' -> add_set_indexed v i' r ) i.index; } (* Find-Add *) let rec find_add k f t = match k with | Simple basename -> { t with simple = M.find_add basename f t.simple; } | Qualified { path = []; _ } -> assert false | Qualified { path = hd :: tl; basename; } -> { t with qualified = M.find_add hd (function | None -> find_add_qualified None basename f empty_q tl | Some q -> find_add_qualified None basename f q tl ) t.qualified; } | Indexed { basename; indexes; } -> { t with indexed = M.find_add basename (function | None -> find_add_indexed None f empty_i indexes | Some i -> find_add_indexed None f i indexes ) t.indexed; } and find_add_qualified prec_mod_value basename f q = function | [] -> { q with base = M.find_add basename (fun old -> f (old >= q.mod_value >= prec_mod_value) ) q.base; } | s :: r -> let prec_mod_value = q.mod_value >= prec_mod_value in { q with path = M.find_add s (function | Some q' -> find_add_qualified prec_mod_value basename f q' r | None -> find_add_qualified prec_mod_value basename f empty_q r ) q.path; } and find_add_indexed prec_index_value f i = function | [] -> { i with value = Some ( f (i.value >= i.prefix_value >= prec_index_value) ); } | s :: r -> let prec_index_value = i.prefix_value >= prec_index_value in { i with index = M.find_add s (function | None -> find_add_indexed prec_index_value f empty_i r | Some i' -> find_add_indexed prec_index_value f i' r ) i.index; } (* Iter *) let rec iter f t = M.iter (fun s v -> f (simple s) v) t.simple; M.iter (fun s q -> iter_qualified f [s] q) t.qualified; M.iter (fun basename i -> iter_indexed f basename [] i) t.indexed; () and iter_qualified f rev_path q = let path = List.rev rev_path in M.iter (fun s v -> f (qualified path s) v) q.base; M.iter (fun s q' -> iter_qualified f (s :: rev_path) q') q.path; () and iter_indexed f basename indexes i = begin match i.value with | None -> () | Some v -> f (indexed basename (List.rev indexes)) v end; M.iter (fun s i' -> iter_indexed f basename (s :: indexes) i') i.index; () let fold f t acc = let r = ref acc in iter (fun name v -> r := f name v !r) t; !r end