Man page or keyword search:   man All Sections 1 - General Commands 2 - System Calls 3 - Subroutines, Functions 4 - Special Files 5 - File Formats 6 - Games and Screensavers 7 - Macros and Conventions 8 - Maintenence Commands 9 - Kernel Interface New Commands Server 4.4BSD AIX Alpinelinux Archlinux Aros BSDOS BSDi Bifrost CentOS Cygwin Darwin Debian DigitalUNIX DragonFly ElementaryOS Fedora FreeBSD Gentoo GhostBSD HP-UX Haiku Hurd IRIX Inferno JazzOS Kali Knoppix LinuxMint MacOSX Mageia Mandriva Manjaro Minix MirBSD NeXTSTEP NetBSD OPENSTEP OSF1 OpenBSD OpenDarwin OpenIndiana OpenMandriva OpenServer OpenSuSE OpenVMS Oracle PC-BSD Peanut Pidora Plan9 QNX Raspbian RedHat Scientific Slackware SmartOS Solaris SuSE SunOS Syllable Tru64 UNIXv7 Ubuntu Ultrix UnixWare Xenix YellowDog aLinux   22533 pages apropos Keyword Search (all sections) Output format html ascii pdf view pdf save postscript

Hashtbl.Make(3)			 OCaml library		       Hashtbl.Make(3)

NAME
       Hashtbl.Make  -	Functor	 building  an  implementation of the hashtable
       structure.

Module
       Module	Hashtbl.Make

Documentation
       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.

       Parameters:

       "H"

       Hashtbl.HashedType

       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			  2013-10-24		       Hashtbl.Make(3)

Vote for polarhome