package containers-data

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Signature
1. Conversions
2. IO

containers-data
- CCBV
- CCBijection
  - Make
    
    L
    
    R
  - OrderedType
  - S
- CCBitField
  - Make
  - S
- CCCache
- CCDeque
- CCFQueue
- CCFun_vec
- CCGraph
  - Dot
  - Iter
  - Lazy_tree
  - MAP
  - Map
  - Traverse
    
    Event
- CCHashSet
  - ELEMENT
  - Make
    
    E
  - S
- CCHashTrie
  - KEY
  - Make
    
    K
  - S
  - Transient
- CCHet
  - Key
  - Map
  - Tbl
- CCImmutArray
- CCIntMap
- CCKTree
  - Dot
  - pset
- CCLazy_list
  - Infix
- CCMixmap
  - Make
    
    X
  - ORD
  - S
- CCMixset
- CCMixtbl
- CCMultiMap
  - BIDIR
  - Make
    
    K
    
    V
  - MakeBidir
    
    L
    
    R
  - OrderedType
  - S
- CCMultiSet
  - Make
  - S
- CCMutHeap
  - Make
    
    X
- CCMutHeap_intf
  - RANKED
  - S
- CCPersistentArray
- CCPersistentHashtbl
  - HashedType
  - Make
    
    H
  - S
- CCRAL
  - Infix
- CCRingBuffer
  - Array
    
    Byte
    
    Make
    
    Elt
    
    S
  - Byte
  - Make
    
    Array
    
    X
  - MakeFromArray
    
    A
  - S
    
    Array
- CCSimple_queue
  - Infix
- CCTrie
  - Make
    
    W
  - MakeArray
    
    X
  - MakeList
    
    X
  - ORDERED
  - S
  - String
  - WORD
- CCWBTree
  - KEY
  - Make
    
    X
  - MakeFull
    
    X
  - ORD
  - S
- CCZipper
containers-data.top
- Containers_data_top

Legend:
Library
Module
Module type
Parameter
Class
Class type

Functional Vectors

Tree with a large branching factor for logarithmic operations with a low multiplicative factor.

status: experimental. DO NOT USE (yet)

since 2.1

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

type 'a gen = unit -> 'a option

type 'a printer = Stdlib.Format.formatter -> 'a -> unit

type 'a ktree = unit -> [ `Nil | `Node of 'a * 'a ktree list ]

Signature

type 'a t

val empty : 'a t

val is_empty : _ t -> bool

val return : 'a -> 'a t

val length : _ t -> int

val push : 'a -> 'a t -> 'a t

Add element at the end.

val get : int -> 'a t -> 'a option

val get_exn : int -> 'a t -> 'a

raises Not_found
if key not present.

val pop_exn : 'a t -> 'a * 'a t

Pop last element.

raises Invalid_argument
in case the vec is empty.

val pop : 'a t -> ('a * 'a t) option

Pop last element.

since 2.5

val iter : f:('a -> unit) -> 'a t -> unit

val iteri : f:(int -> 'a -> unit) -> 'a t -> unit

Iterate on elements with their index, in increasing order.

val iteri_rev : f:(int -> 'a -> unit) -> 'a t -> unit

Iterate on elements with their index, but starting from the end.

val fold : f:('b -> 'a -> 'b) -> x:'b -> 'a t -> 'b

val fold_rev : f:('b -> 'a -> 'b) -> x:'b -> 'a t -> 'b

val foldi : f:('b -> int -> 'a -> 'b) -> x:'b -> 'a t -> 'b

val append : 'a t -> 'a t -> 'a t

val map : ('a -> 'b) -> 'a t -> 'b t

val choose : 'a t -> 'a option

Conversions

val to_list : 'a t -> 'a list

val of_list : 'a list -> 'a t

val add_list : 'a t -> 'a list -> 'a t

val add_iter : 'a t -> 'a iter -> 'a t

val of_iter : 'a iter -> 'a t

val to_iter : 'a t -> 'a iter

val add_gen : 'a t -> 'a gen -> 'a t

val of_gen : 'a gen -> 'a t

val to_gen : 'a t -> 'a gen

IO

val pp : 'a printer -> 'a t printer