package batteries

  1. Overview
  2. Docs
A community-maintained standard library extension

Install 

dune-project
 Dependency

github.com Edit opam file Versions (15)

Authors

  1. O
    OCaml batteries-included team

Maintainers

  1. C
    Cedric Cellier <rixed@happyleptic.org>
  2. F
    Francois Berenger <unixjunkie@sdf.org>
  3. Gabriel Scherer
  4. T
    Thibault Suzanne <thi.suzanne@gmail.com>

Sources

v3.5.0.tar.gz
md5=e4b70d1a716f0aaba36f419f618d0a2e
sha512=a31f1f8cf2c7c3c6c757f3bfae98ff61bb32bab6a1f1e215937df42bcfa447aad41a37edb28d7bcecb88b3838ed8bd57142bcf8e2d28e09bb538055fd8a3b72d

doc/batteries.unthreaded/BatHashcons/MakeTable/index.html

Module BatHashcons.MakeTable

Parameters

Signature

type key = HT.t

type of objects in the table

type t

type of the table

val create : int -> t

create n creates a table with at least n cells.

val clear : t -> unit

clear tab removes all entries from the table tab.

val hashcons : t -> key -> key hobj

hashcons tab k returns either k, adding it to the table tab as a side effect, or if k is already in the table then it returns the hashed object corresponding to that entry.

  • raises Failure

    if number of objects with the same hash reaches system limit of array size

val iter : (key hobj -> unit) -> t -> unit

iter f tab applies f to every live hashed object in the table tab.

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

fold f tab x0 folds f across every live hashed object in the table tab, starting with value x0

val count : t -> int

count tab returns a count of how many live objects are in tab. This can decrease whenever the GC runs, even during execution, so consider the returned value as an upper-bound.