package containers

You can search for identifiers within the package.

in-package search v0.2.0

containers
- CCArray
  - S
  - Sub
- CCBV
- CCBatch
  - COLLECTION
  - Make
    
    C
  - S
- CCBool
- CCCat
  - APPLICATIVE
  - FOLDABLE
  - FREE_MONAD
    
    F
  - FUNCTOR
  - MONAD
  - MONAD_BARE
  - MONAD_TRANSFORMER
    
    M
  - MONOID
  - MakeFree
    
    F
  - MakeFreeFold
    
    FM
    
    F
    
    Fold
  - TRAVERSE
    
    M
  - WrapMonad
    
    M
- CCDeque
- CCError
  - MONAD
  - Traverse
    
    M
- CCFQueue
- CCFun
  - Monad
    
    X
- CCGen
  - Infix
  - Restart
    
    Infix
  - S
    
    Infix
- CCHash
- CCHashtbl
  - HASHABLE
  - Make
    
    X
  - S
- CCHeap
  - Make
    
    E
  - PARTIAL_ORD
  - S
- CCIO
  - File
  - Raw
  - Seq
- CCInt
- CCKList
  - MONAD
  - Traverse
    
    M
- CCKTree
  - Dot
  - pset
- CCLinq
  - AdaptMap
    
    M
  - AdaptSet
    
    S
  - IO
  - L
  - M
  - PMap
- CCList
  - Assoc
  - Idx
  - MONAD
  - Ref
  - Set
  - Traverse
    
    M
  - Zipper
- 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
  - Infix
  - Map
    
    Adapt
    
    M
    
    Make
    
    V
    
    S
  - Set
    
    Adapt
    
    X
    
    Make
    
    X
    
    S
- CCString
  - S
  - Split
  - Sub
- CCTrie
  - Make
    
    W
  - MakeArray
    
    X
  - MakeList
    
    X
  - ORDERED
  - S
  - String
  - WORD
- CCVector
containers.misc
- Containers_misc
  - AVL
    
    Gen
    
    ITERATOR
    
    KList
  - AbsSet
    
    MakeHash
    
    X
    
    MakeSet
    
    S
  - ActionMan
    
    Action
  - Automaton
    
    I
    
    Instance
    
    O
  - BTree
    
    Make
    
    X
    
    ORDERED
    
    S
  - Bencode
    
    SMap
  - BencodeOnDisk
  - BencodeStream
    
    Decode
    
    Encode
  - Bidir
  - Bij
    
    TrBencode
  - CSM
    
    Gen
    
    Int
    
    KList
    
    List
    
    Mut
    
    Int
    
    List
    
    Sequence
  - Cache
    
    Dummy
    
    X
    
    Dummy2
    
    X
    
    Y
    
    EQ
    
    HASH
    
    LRU
    
    X
    
    Linear
    
    X
    
    Linear2
    
    X
    
    Y
    
    Replacing
    
    X
    
    Replacing2
    
    X
    
    Y
    
    S
    
    S2
  - Cause
    
    Bencode
    
    Sink
    
    Source
  - Conv
    
    Bencode
    
    Json
    
    Lambda
    
    Point
    
    Sexp
    
    Sink
    
    Source
    
    UniversalSink
    
    UniversalSource
  - FHashtbl
    
    Flat
    
    X
    
    HASH
    
    PArray
    
    S
    
    Tree
    
    X
  - FlatHashtbl
    
    Hashcons
    
    H
    
    HashconsedType
    
    Make
    
    H
    
    S
  - HGraph
    
    Default
    
    EdgeTbl
    
    Lexbuf
    
    DefaultParam
    
    Make
    
    EdgeTbl
    
    P
    
    PARAM
    
    S
    
    EdgeTbl
  - Hashset
  - Heap
  - Iteratee
  - LazyGraph
    
    Dot
    
    Full
    
    Heap
    
    Infix
    
    Mutable
  - PHashtbl
    
    Hashable
  - ParseReact
  - PersistentGraph
  - PiCalculus
  - PrintBox
    
    Box
    
    Output
    
    Simple
  - RAL
  - RatTerm
    
    Default
    
    Subst
    
    Symbol
    
    Make
    
    Subst
    
    Sym
    
    Symbol
    
    S
    
    Subst
    
    Symbol
    
    SYMBOL
    
    Str
  - Sexp
  - SkipList
  - SmallSet
  - SplayMap
    
    Make
    
    X
    
    ORDERED
    
    S
  - SplayTree
  - TTree
    
    Make
    
    X
    
    S
  - Tell
    
    B
  - Ty
  - UnionFind
    
    Make
    
    P
    
    PAIR
  - Univ
containers.string
- Containers_string
  - KMP
    
    Make
    
    Str
    
    S
    
    STRING
  - Levenshtein
    
    Index
    
    Make
    
    Index
    
    Str
    
    S
    
    Index
    
    STRING

Legend:
Library
Module
Module type
Parameter
Class
Class type

type ('id, 'v, 'e) t

val create : 
  ?eq:('id -> 'id -> bool) ->
  ?hash:('id -> int) ->
  unit ->
  ('id, 'v, 'e) t * ('id, 'v, 'e) graph

val add_vertex : ('id, 'v, 'e) t -> 'id -> 'v -> unit

val add_edge : ('id, 'v, 'e) t -> 'id -> 'e -> 'id -> unit