Ordered_hash_map_local_ident
Hash algorithm only hash stamp, this makes sense when all identifiers are local (no global)
include Ordered_hash_map_gen.S with type key = Ident.t
type key = Ident.t
type 'value t
val create : int -> 'value t
val clear : 'vaulue t -> unit
val reset : 'value t -> unit
val add : 'value t -> key -> 'value -> unit
val mem : 'value t -> key -> bool
val rank : 'value t -> key -> int
val find_value : 'value t -> key -> 'value
val iter : 'value t -> (key -> 'value -> int -> unit) -> unit
val fold : 'value t -> 'b -> (key -> 'value -> int -> 'b -> 'b) -> 'b
val length : 'value t -> int
val elements : 'value t -> key list
val choose : 'value t -> key
val to_sorted_array : 'value t -> key array