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