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

FreeBSD Manual Pages


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

       Hashtbl.MakeSeeded   -	Functor	 building  an  implementation  of  the
       hashtable structure.

       Module	Hashtbl.MakeSeeded

       Module MakeSeeded
	: functor (H : SeededHashedType) -> sig	end

       Functor building	an implementation of  the  hashtable  structure.   The
       functor Hashtbl.MakeSeeded 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 seeded hashing and equality functions  specified
       in the functor argument H instead of generic equality and hashing.  The
       create operation	of the result structure	supports the ~random  optional
       parameter  and returns randomized hash tables if	~random:true is	passed
       or if randomization is globally on (see Hashtbl.randomize ).

       Since 4.00.0




       type key

       type 'a t

       val create : ?random:bool -> 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.MakeSeeded(3)

NAME | Module | Documentation

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

home | help