val create : int ->'aStdlib.Hashtbl.Make(ResultNode).t
val length : 'aStdlib.Hashtbl.Make(ResultNode).t-> int
val is_empty : 'aStdlib.Hashtbl.Make(ResultNode).t-> bool
val clear : 'aStdlib.Hashtbl.Make(ResultNode).t-> unit
val reset : 'aStdlib.Hashtbl.Make(ResultNode).t-> unit
val copy :
'aStdlib.Hashtbl.Make(ResultNode).t->'aStdlib.Hashtbl.Make(ResultNode).t
val add : 'aStdlib.Hashtbl.Make(ResultNode).t->key->'a-> unit
val remove : 'aStdlib.Hashtbl.Make(ResultNode).t->key-> unit
val remove_all : 'aStdlib.Hashtbl.Make(ResultNode).t->key-> unit
val find : 'aStdlib.Hashtbl.Make(ResultNode).t->key->'a
val find_all : 'aStdlib.Hashtbl.Make(ResultNode).t->key->'a list
val find_default : 'aStdlib.Hashtbl.Make(ResultNode).t->key->'a->'a
val find_option : 'aStdlib.Hashtbl.Make(ResultNode).t->key->'a option
val find_opt : 'aStdlib.Hashtbl.Make(ResultNode).t->key->'a option
val replace : 'aStdlib.Hashtbl.Make(ResultNode).t->key->'a-> unit
val mem : 'aStdlib.Hashtbl.Make(ResultNode).t->key-> bool
val iter : (key->'a-> unit)->'aStdlib.Hashtbl.Make(ResultNode).t-> unit
val for_all :
(key->'a-> bool)->'aStdlib.Hashtbl.Make(ResultNode).t->
bool
val fold :
(key->'a->'b->'b)->'aStdlib.Hashtbl.Make(ResultNode).t->'b->'b
val exists :
(key->'a-> bool)->'aStdlib.Hashtbl.Make(ResultNode).t->
bool
val map :
(key->'b->'c)->'bStdlib.Hashtbl.Make(ResultNode).t->'cStdlib.Hashtbl.Make(ResultNode).t
val map_inplace :
(key->'a->'a)->'aStdlib.Hashtbl.Make(ResultNode).t->
unit
val filter :
('a-> bool)->'aStdlib.Hashtbl.Make(ResultNode).t->'aStdlib.Hashtbl.Make(ResultNode).t
val filter_inplace :
('a-> bool)->'aStdlib.Hashtbl.Make(ResultNode).t->
unit
val filteri :
(key->'a-> bool)->'aStdlib.Hashtbl.Make(ResultNode).t->'aStdlib.Hashtbl.Make(ResultNode).t
val filteri_inplace :
(key->'a-> bool)->'aStdlib.Hashtbl.Make(ResultNode).t->
unit
val filter_map :
(key->'a->'b option)->'aStdlib.Hashtbl.Make(ResultNode).t->'bStdlib.Hashtbl.Make(ResultNode).t
val filter_map_inplace :
(key->'a->'a option)->'aStdlib.Hashtbl.Make(ResultNode).t->
unit
val modify : key->('a->'a)->'aStdlib.Hashtbl.Make(ResultNode).t-> unit
val modify_def :
'a->key->('a->'a)->'aStdlib.Hashtbl.Make(ResultNode).t->
unit
val modify_opt :
key->('a option->'a option)->'aStdlib.Hashtbl.Make(ResultNode).t->
unit
val merge :
(key->'a option->'b option->'c option)->'aStdlib.Hashtbl.Make(ResultNode).t->'bStdlib.Hashtbl.Make(ResultNode).t->'cStdlib.Hashtbl.Make(ResultNode).t
val merge_all :
(key->'a list->'b list->'c list)->'aStdlib.Hashtbl.Make(ResultNode).t->'bStdlib.Hashtbl.Make(ResultNode).t->'cStdlib.Hashtbl.Make(ResultNode).t
val stats : 'aStdlib.Hashtbl.Make(ResultNode).t->BatHashtbl.statistics
val to_seq : 'aStdlib.Hashtbl.Make(ResultNode).t->(key * 'a)Stdlib.Seq.t
val to_seq_keys : 'aStdlib.Hashtbl.Make(ResultNode).t->keyStdlib.Seq.t
val to_seq_values : 'aStdlib.Hashtbl.Make(ResultNode).t->'aStdlib.Seq.t
val add_seq :
'aStdlib.Hashtbl.Make(ResultNode).t->(key * 'a)Stdlib.Seq.t->
unit
val replace_seq :
'aStdlib.Hashtbl.Make(ResultNode).t->(key * 'a)Stdlib.Seq.t->
unit
val of_seq : (key * 'a)Stdlib.Seq.t->'aStdlib.Hashtbl.Make(ResultNode).t
val keys : 'aStdlib.Hashtbl.Make(ResultNode).t->keyBatEnum.t
val values : 'aStdlib.Hashtbl.Make(ResultNode).t->'aBatEnum.t
val enum : 'aStdlib.Hashtbl.Make(ResultNode).t->(key * 'a)BatEnum.t
val to_list : 'aStdlib.Hashtbl.Make(ResultNode).t->(key * 'a) list
val of_enum : (key * 'a)BatEnum.t->'aStdlib.Hashtbl.Make(ResultNode).t
val of_list : (key * 'a) list->'aStdlib.Hashtbl.Make(ResultNode).t
val print :
?first:string ->?last:string ->?sep:string ->('aBatInnerIO.output->key-> unit)->('aBatInnerIO.output->'b-> unit)->'aBatInnerIO.output->'bStdlib.Hashtbl.Make(ResultNode).t->
unit