An Id_table.t exploits the fact that Probe_id.ts should be consecutive integers
to make lookups fast
val create : Core_profiler.Probe_id.t list ‑> 'a ‑> ('a, _) tTo create a table you need to specify which Probe_id.ts are valid cells, and give an empty
value.
This can either be in the form of a list of Probe_id.ts, or by copying the list from
another Id_table.t (whose cell contents are ignored)
val init : Core_profiler.Probe_id.t list ‑> f:(Core_profiler.Probe_id.t ‑> 'a) ‑> ('a, _) tval init_from_map : 'b Core_profiler.Probe_id.Map.t ‑> f:(Core_profiler.Probe_id.t ‑> 'b ‑> 'a) ‑> ('a, _) tval set_exn : ('a, Core.read_write) t ‑> Core_profiler.Probe_id.t ‑> 'a ‑> unitval find : ('a, _) t ‑> Core_profiler.Probe_id.t ‑> 'a optionA ('a, read_only) Id_table.t is meant to look like an Probe_id.Map.t:
val find_exn : ('a, _) t ‑> Core_profiler.Probe_id.t ‑> 'aval iter : ('a, _) t ‑> f:(Core_profiler.Probe_id.t ‑> 'a ‑> unit) ‑> unitval fold : ('a, _) t ‑> init:'accum ‑> f:('accum ‑> Core_profiler.Probe_id.t ‑> 'a ‑> 'accum) ‑> 'accumval fold_right : ('a, _) t ‑> init:'accum ‑> f:('accum ‑> Core_profiler.Probe_id.t ‑> 'a ‑> 'accum) ‑> 'accumval to_alist : ('a, _) t ‑> (Core_profiler.Probe_id.t * 'a) listval map : ('a, _) t ‑> f:(Core_profiler.Probe_id.t ‑> 'a ‑> 'b) ‑> ('b, _) tval filter_map : ('a, _) t ‑> f:(Core_profiler.Probe_id.t ‑> 'a ‑> 'b option) ‑> ('b, _) t