Skip site navigation (1)Skip section navigation (2)

FreeBSD Manual Pages


home | help
Hashtbl.Make(3)			 OCaml library		       Hashtbl.Make(3)

       Hashtbl.Make  -	Functor	 building  an  implementation of the hashtable

       Module	Hashtbl.Make

       Module Make
	: functor (H : HashedType) -> sig end

       Functor building	an implementation of  the  hashtable  structure.   The
       functor	Hashtbl.Make returns a structure containing a type key of keys
       and a type 'a t of hash tables associating data of type 'a to  keys  of
       type  key  .   The operations perform similarly to those	of the generic
       interface, but use the hashing and equality functions specified in  the
       functor	argument H instead of generic equality and hashing.  Since the
       hash function is	not seeded, the	create operation of the	result	struc-
       ture always returns non-randomized hash tables.




       type key

       type 'a t

       val create : int	-> 'a t

       val clear : 'a t	-> unit

       val reset : 'a t	-> unit

       val copy	: 'a t -> 'a t

       val add : 'a t -> key ->	'a -> unit

       val remove : 'a t -> key	-> unit

       val find	: 'a t -> key -> 'a

       val find_all : 'a t -> key -> 'a	list

       val replace : 'a	t -> key -> 'a -> unit

       val mem : 'a t -> key ->	bool

       val iter	: (key -> 'a ->	unit) -> 'a t -> unit

       val fold	: (key -> 'a ->	'b -> 'b) -> 'a	t -> 'b	-> 'b

       val length : 'a t -> int

       val stats : 'a t	-> Hashtbl.statistics

OCamldoc			  2017-04-30		       Hashtbl.Make(3)

NAME | Module | Documentation

Want to link to this manual page? Use this URL:

home | help