package ocaml-base-compiler
include Identifiable.S with type t := t
module T : Identifiable.Thing with type t = t
include Identifiable.Thing with type t := T.t
include Hashtbl.HashedType with type t := T.t
val hash : T.t -> int
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
val output : out_channel -> T.t -> unit
val print : Format.formatter -> T.t -> unit
module Set : Identifiable.Set with module T := T
module Map : Identifiable.Map with module T := T
module Tbl : Identifiable.Tbl with module T := T
val print_with_scope : Format.formatter -> t -> unit
Same as print
except that it will also add a "n
" suffix if the scope of the argument is n
.
val create_scoped : scope:int -> string -> t
val create_local : string -> t
val create_persistent : string -> t
val create_predef : string -> t
Creates an identifier with the same name as the input, a fresh stamp, and no scope.
val name : t -> string
val unique_name : t -> string
val unique_toplevel_name : t -> string
val persistent : t -> bool
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.
val global : t -> bool
val is_predef : t -> bool
val scope : t -> int
val empty : 'a tbl
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>