package containers

You can search for identifiers within the package.

in-package search v0.2.0

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

type elt

type t

val empty : t

val is_empty : t -> bool

val mem : t -> elt -> bool

val count : t -> elt -> int

val singleton : elt -> t

val add : t -> elt -> t

val remove : t -> elt -> t

val add_mult : t -> elt -> int -> t

add_mult set x n adds n occurrences of x to set

raises Invalid_argument
if n < 0

since 0.6

val remove_mult : t -> elt -> int -> t

remove_mult set x n removes at most n occurrences of x from set

raises Invalid_argument
if n < 0

since 0.6

val update : t -> elt -> (int -> int) -> t

update set x f calls f n where n is the current multiplicity of x in set (0 to indicate its absence); the result of f n is the new multiplicity of x.

raises Invalid_argument
if f n < 0

since 0.6

val min : t -> elt

Minimal element w.r.t the total ordering on elements

val max : t -> elt

val union : t -> t -> t

union a b contains as many occurrences of an element x as count a x + count b x.

val meet : t -> t -> t

meet a b is a multiset such that count (meet a b) x = max (count a x) (count b x)

val intersection : t -> t -> t

intersection a b is a multiset such that count (intersection a b) x = min (count a x) (count b x)

val diff : t -> t -> t

MultiSet difference. count (diff a b) x = max (count a x - count b x) 0

val contains : t -> t -> bool

contains a x = (count m x > 0)

val compare : t -> t -> int

val equal : t -> t -> bool

val cardinal : t -> int

Number of distinct elements

val iter : t -> (int -> elt -> unit) -> unit

val fold : t -> 'b -> ('b -> int -> elt -> 'b) -> 'b

val of_list : elt list -> t

val to_list : t -> elt list

val to_seq : t -> elt sequence

val of_seq : elt sequence -> t