package merlin-lib
Install
Dune Dependency
Authors
Maintainers
Sources
sha256=67da3b34f2fea07678267309f61da4a2c6f08298de0dc59655b8d30fd8269af1
sha512=1fb3b5180d36aa82b82a319e15b743b802b6888f0dc67645baafdb4e18dfc23a7b90064ec9bc42f7424061cf8cde7f8839178d8a8537bf4596759f3ff4891873
doc/merlin-lib.ocaml_typing/Ocaml_typing/Ident/index.html
Module Ocaml_typing.Ident
Source
include Ocaml_utils.Identifiable.S with type t := t
include Ocaml_utils.Identifiable.Thing with type t := T.t
include Hashtbl.HashedType with type t := T.t
A hashing function on keys. It must be such that if two keys are equal according to equal
, then they have identical hash values as computed by hash
. Examples: suitable (equal
, hash
) pairs for arbitrary key types include
- (
(=)
,hash
) for comparing objects by structure (provided objects do not contain floats) - (
(fun x y -> compare x y = 0)
,hash
) for comparing objects by structure and handlingStdlib.nan
correctly - (
(==)
,hash
) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
include Map.OrderedType with type t := T.t
Same as print
except that it will also add a "n
" suffix if the scope of the argument is n
.
Creates an identifier with the same name as the input, a fresh stamp, and no scope.
Compare identifiers by binding location. Two identifiers are the same either if they are both non-persistent and have been created by the same call to create_*
, or if they are both persistent and have the same name.
'a tbl
represents association tables from identifiers to values of type 'a
.
'a tbl
plays the role of map, but bindings can be looked up from either the full Ident using find_same
, or just its user-visible name using find_name
. In general the two lookups may not return the same result, as an identifier may have been shadowed in the environment by a distinct identifier with the same name.
find_all
returns the bindings for all idents of a given name, most recently introduced first.
In other words, 'a tbl
corresponds to (Ident.t * 'a) list Map.Make(String)
and the implementation is very close to that representation.
Note in particular that searching among idents of the same name takes linear time, and that add
simply extends the list without checking for duplicates. So it is not a good idea to implement union by repeated add
calls, which may result in many duplicated identifiers and poor find_same
performance. It is even possible to build overly large same-name lists such that non-recursive functions like find_all
or fold_all
blow the stack.
You should probably use Map.Make(Ident)
instead, unless you really need to query bindings by user-visible name, not just by unique identifiers.
Get the value of the current stamp (the stamp of the last created identifier). Used to flush identifier-based caches when backtracking.