val add : 'a BatHashtbl.Make(ResultNode).t -> key:key -> data:'a -> unit
val replace : 'a BatHashtbl.Make(ResultNode).t -> key:key -> data:'a -> unit
val iter :
f:(key:key -> data:'a -> unit) ->
'a BatHashtbl.Make(ResultNode).t ->
unit
val for_all :
f:(key:key -> data:'a -> bool) ->
'a BatHashtbl.Make(ResultNode).t ->
bool
val map :
f:(key:key -> data:'a -> 'b) ->
'a BatHashtbl.Make(ResultNode).t ->
'b BatHashtbl.Make(ResultNode).t
val map_inplace :
f:(key:key -> data:'a -> 'a) ->
'a BatHashtbl.Make(ResultNode).t ->
unit
val filter :
f:('a -> bool) ->
'a BatHashtbl.Make(ResultNode).t ->
'a BatHashtbl.Make(ResultNode).t
val filter_inplace : f:('a -> bool) -> 'a BatHashtbl.Make(ResultNode).t -> unit
val filteri :
f:(key:key -> data:'a -> bool) ->
'a BatHashtbl.Make(ResultNode).t ->
'a BatHashtbl.Make(ResultNode).t
val filteri_inplace :
f:(key:key -> data:'a -> bool) ->
'a BatHashtbl.Make(ResultNode).t ->
unit
val filter_map :
f:(key:key -> data:'a -> 'b option) ->
'a BatHashtbl.Make(ResultNode).t ->
'b BatHashtbl.Make(ResultNode).t
val filter_map_inplace :
f:(key:key -> data:'a -> 'a option) ->
'a BatHashtbl.Make(ResultNode).t ->
unit
val fold :
f:(key:key -> data:'a -> 'b -> 'b) ->
'a BatHashtbl.Make(ResultNode).t ->
init:'b ->
'b
val exists :
f:(key:key -> data:'a -> bool) ->
'a BatHashtbl.Make(ResultNode).t ->
bool
val modify :
key:key ->
f:('a -> 'a) ->
'a BatHashtbl.Make(ResultNode).t ->
unit
val modify_def :
default:'a ->
key:key ->
f:('a -> 'a) ->
'a BatHashtbl.Make(ResultNode).t ->
unit
val modify_opt :
key:key ->
f:('a option -> 'a option) ->
'a BatHashtbl.Make(ResultNode).t ->
unit
val merge :
f:(key -> 'a option -> 'b option -> 'c option) ->
left:'a BatHashtbl.Make(ResultNode).t ->
right:'b BatHashtbl.Make(ResultNode).t ->
'c BatHashtbl.Make(ResultNode).t
val merge_all :
f:(key -> 'a list -> 'b list -> 'c list) ->
left:'a BatHashtbl.Make(ResultNode).t ->
right:'b BatHashtbl.Make(ResultNode).t ->
'c BatHashtbl.Make(ResultNode).t