Module `Code_id_or_symbol.Lmap`

type key = Flambda2_identifiers.Int_ids.Code_id_or_symbol.t

type +'a t

val empty : 'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

val is_empty : 'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t -> bool

val add : 
  Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key ->
  'a ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

The key should not already exist in the map; this is not checked.

val singleton : 
  Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key ->
  'a ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

val disjoint_union : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

Unlike disjoint_union on maps, the disjointness is not checked.

val disjoint_union_many : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t list ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

The given maps must be pairwise disjoint, which is not checked.

val iter : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key -> 'a -> unit) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  unit

val fold : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key -> 'a -> 'b -> 'b) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'b ->
  'b

val fold_left_map : 
  ('a ->
    Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key ->
    'b ->
    'a * 'c) ->
  'a ->
  'b Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a * 'c Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

Simultaneously map over the elements and accumulate a value. The arguments are ordered so as to make the order preservation as explicit as possible (the accumulator is produced from the values _before_ the key and value being passed).

val filter : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key -> 'a -> bool) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

val keys : 
  _ Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key list

val data : 'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t -> 'a list

val bindings : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a) list

val of_list : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a) list ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

Keys in the list must be distinct, which is not checked.

val find : 
  Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a

val find_opt : 
  Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a option

val get_singleton : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a) option

val get_singleton_exn : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a

val map : 
  ('a -> 'b) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'b Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

val mapi : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key -> 'a -> 'b) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'b Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

val map_sharing : 
  ('a -> 'a) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

val filter_map : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key -> 'a -> 'b option) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'b Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

val to_seq : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a) Stdlib.Seq.t

val for_all_with_fixed_arg : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key -> 'a -> 'b -> bool) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'b ->
  bool

val exists : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key -> 'a -> bool) ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  bool

val choose : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a

Returns an unspecified binding from the map

raises Not_found
if the map is empty

val add_seq : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a) Stdlib.Seq.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

Keys in the sequence must be distinct from each other and from keys already in the map; neither of these conditions is checked.

val of_seq : 
  (Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.key * 'a) Stdlib.Seq.t ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t

Keys in the sequence must be distinct, which is not checked.

val print : 
  (Stdlib.Format.formatter -> 'a -> unit) ->
  Stdlib.Format.formatter ->
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  unit

val invariant : 
  'a Flambda2_identifiers.Int_ids.Code_id_or_symbol.Lmap.t ->
  unit

Check that there are no duplicates in the list, calling Misc.fatal_errorf if a duplicate is found.

Module Code_id_or_symbol.Lmap

Module `Code_id_or_symbol.Lmap`