package containers

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Hash combinators
1. Definitions
2. Basic Combinators

package containers

containers
- CCArray
  - S
  - Sub
- CCBV
- CCBool
- CCCache
- CCDeque
- CCError
  - MONAD
  - Traverse
    
    M
- CCFQueue
- CCFlatHashtbl
  - HASHABLE
  - Make
    
    X
  - S
- CCFloat
- CCFun
  - Monad
    
    X
- CCGen
  - Infix
  - Restart
    
    Infix
- CCHash
- CCHashtbl
  - COUNTER
  - DEFAULT
  - Make
    
    X
  - MakeCounter
    
    X
  - MakeDefault
    
    X
  - S
- CCHeap
  - Make
    
    E
  - PARTIAL_ORD
  - S
- CCIO
  - File
- CCInt
- CCKList
  - MONAD
  - Traverse
    
    M
- CCKTree
  - Dot
  - pset
- CCList
  - Assoc
  - Idx
  - MONAD
  - Ref
  - Set
  - Traverse
    
    M
  - Zipper
- CCMap
  - Make
    
    O
  - S
- CCMultiMap
  - BIDIR
  - Make
    
    K
    
    V
  - MakeBidir
    
    L
    
    R
  - OrderedType
  - S
- CCMultiSet
  - Make
    
    O
  - S
- CCOpt
- CCOrd
- CCPair
- CCPersistentHashtbl
  - HashedType
  - Make
    
    H
  - S
- CCPrint
  - MONAD_IO
  - MakeIO
    
    M
- CCRandom
- CCSequence
  - IO
  - Infix
  - Map
    
    Adapt
    
    M
    
    Make
    
    V
    
    S
  - Set
    
    Adapt
    
    X
    
    Make
    
    X
    
    S
- CCSexp
  - L
  - Lexer
  - ParseGen
  - Source
    
    Manual
  - Traverse
- CCString
  - S
  - Split
  - Sub
- CCTrie
  - Make
    
    W
  - MakeArray
    
    X
  - MakeList
    
    X
  - ORDERED
  - S
  - String
  - WORD
- CCVector
- Gen_intf
  - S
    
    Infix
containers.advanced
- Containers_advanced
containers.misc
- Containers_misc
containers.pervasives
- CCPervasives
  - Array
  - List
  - String
containers.string
- Containers_string

Legend:
Library
Module
Module type
Parameter
Class
Class type

Hash combinators

Combination of hashes based on the Murmur Hash (64 bits). See this page

Definitions

type t = int

A hash value is a positive integer

type state = int64

State required by the hash function

type 'a hash_fun = 'a -> state -> state

Hash function for values of type 'a, merging a fingerprint of the value into the state of type t

val init : state

Initial value

val finish : state -> int

Extract a usable hash value

val apply : 'a hash_fun -> 'a -> int

Apply a hash function to a value

Basic Combinators

val bool_ : bool hash_fun

val char_ : char hash_fun

val int_ : int hash_fun

val string_ : string hash_fun

val int32_ : int32 hash_fun

val int64_ : int64 hash_fun

val nativeint_ : nativeint hash_fun

val list_ : 'a hash_fun -> 'a list hash_fun

Hash a list. Each element is hashed using f.

val array_ : 'a hash_fun -> 'a array hash_fun

val opt : 'a hash_fun -> 'a option hash_fun

val pair : 'a hash_fun -> 'b hash_fun -> ('a * 'b) hash_fun

val triple : 
  'a hash_fun ->
  'b hash_fun ->
  'c hash_fun ->
  ('a * 'b * 'c) hash_fun

val if_ : bool -> 'a hash_fun -> 'a hash_fun -> 'a hash_fun

Decide which hash function to use depending on the boolean

type 'a sequence = ('a -> unit) -> unit

type 'a gen = unit -> 'a option

type 'a klist = unit -> [ `Nil | `Cons of 'a * 'a klist ]

val seq : 'a hash_fun -> 'a sequence hash_fun

val gen : 'a hash_fun -> 'a gen hash_fun

val klist : 'a hash_fun -> 'a klist hash_fun