Id_location_hashmap (bonsai.bonsai.private_base.Bonsai_private_base.Computation_watcher.Id_location

include Core.Hashtbl.S_plain
  with type key =
         [ `Named of Core.Type_equal.Id.Uid.t
         | `Incr of Incremental.For_analyzer.Node_id.t ]

type key = [

| `Named of Core.Type_equal.Id.Uid.t
| `Incr of Incremental.For_analyzer.Node_id.t

]

type ('a, 'b) hashtbl = ('a, 'b) Core.Hashtbl.t

type 'b t = (key, 'b) hashtbl

include Ppx_compare_lib.Equal.S1 with type 'b t := 'b t

val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

include Ppx_compare_lib.Equal.S1__local with type 'b t := 'b t

val sexp_of_t : ('b -> Sexplib0.Sexp.t) -> 'b t -> Sexplib0.Sexp.t

type ('a, 'b) t_ = 'b t

type 'a key_ = key

val hashable : key Base.Hashable.t

include Base.Invariant.S1 with type 'b t := 'b t

val invariant : ('a -> unit) -> 'a t -> unit

include Core.Hashtbl_intf.Creators
  with type ('a, 'b) t := ('a, 'b) t_
  with type 'a key := 'a key_
  with type ('key, 'data, 'z) create_options :=
         ('key, 'data, 'z) Core.Hashtbl_intf.create_options_without_hashable

val create : 
  ('key key_, 'data, unit -> ('key, 'data) t_)
    Core.Hashtbl_intf.create_options_without_hashable

Creates a new empty dictionary.

val of_alist : 
  ('key key_,
    'data,
    ('key key_ * 'data) list ->
    [ `Ok of ('key, 'data) t_ | `Duplicate_key of 'key key_ ])
    Core.Hashtbl_intf.create_options_without_hashable

Dictionary containing the given key/value pairs. Fails if there are duplicate keys.

val of_alist_report_all_dups : 
  ('key key_,
    'data,
    ('key key_ * 'data) list ->
    [ `Ok of ('key, 'data) t_ | `Duplicate_keys of 'key key_ list ])
    Core.Hashtbl_intf.create_options_without_hashable

Like of_alist. On failure, provides all duplicate keys instead of a single representative.

val of_alist_or_error : 
  ('key key_,
    'data,
    ('key key_ * 'data) list ->
    ('key, 'data) t_ Base.Or_error.t)
    Core.Hashtbl_intf.create_options_without_hashable

Like of_alist. Returns a Result.t.

val of_alist_exn : 
  ('key key_, 'data, ('key key_ * 'data) list -> ('key, 'data) t_)
    Core.Hashtbl_intf.create_options_without_hashable

Like of_alist. Raises on duplicates.

val of_alist_multi : 
  ('key key_, 'data list, ('key key_ * 'data) list -> ('key, 'data list) t_)
    Core.Hashtbl_intf.create_options_without_hashable

Produces a dictionary mapping each key to a list of associated values.

val create_mapped : 
  ('key key_,
    'data,
    get_key:('a -> 'key key_) @ local ->
    (get_data:('a -> 'data) @ local ->
    ('a list ->
    [ `Ok of ('key, 'data) t_ | `Duplicate_keys of 'key key_ list ]) @ local) @ local)
    Core.Hashtbl_intf.create_options_without_hashable

Like of_alist. Consume a list of elements for which key/value pairs can be computed.

val create_with_key : 
  ('key key_,
    'data,
    get_key:('data -> 'key key_) @ local ->
    ('data list ->
    [ `Ok of ('key, 'data) t_ | `Duplicate_keys of 'key key_ list ]) @ local)
    Core.Hashtbl_intf.create_options_without_hashable

Like of_alist. Consume values for which keys can be computed.

val create_with_key_or_error : 
  ('key key_,
    'data,
    get_key:('data -> 'key key_) @ local ->
    ('data list ->
    ('key, 'data) t_ Base.Or_error.t) @ local)
    Core.Hashtbl_intf.create_options_without_hashable

Like of_alist_or_error. Consume values for which keys can be computed.

val create_with_key_exn : 
  ('key key_,
    'data,
    get_key:('data -> 'key key_) @ local ->
    ('data list ->
    ('key, 'data) t_) @ local)
    Core.Hashtbl_intf.create_options_without_hashable

Like of_alist_exn. Consume values for which keys can be computed.

val group : 
  ('key key_,
    'data,
    get_key:('a -> 'key key_) @ local ->
    (get_data:('a -> 'data) @ local ->
    (combine:('data -> ('data -> 'data) @ local) @ local ->
    ('a list ->
    ('key, 'data) t_) @ local) @ local) @ local)
    Core.Hashtbl_intf.create_options_without_hashable

Like create_mapped. Multiple values for a key are combined rather than producing an error.

val update_and_check_if_value_set : 
  id:key ->
  update_data:(Source_code_positions.finalized * Config.t) ->
  (Source_code_positions.finalized Source_code_positions.t * Config.t) t ->
  [ `Already_set | `Not_set ]