package containers

You can search for identifiers within the package.

in-package search v0.2.0

On This Page

Imperative Bitvectors

package containers

containers
- CCArray
  - S
  - Sub
- CCBool
- CCError
  - Infix
  - MONAD
  - Traverse
    
    M
- CCFloat
- CCFormat
- CCFun
  - Monad
    
    X
- CCHash
- CCHashtbl
  - COUNTER
  - DEFAULT
  - Make
    
    X
  - MakeCounter
    
    X
  - MakeDefault
    
    X
  - S
- CCHeap
  - Make
    
    E
  - PARTIAL_ORD
  - S
- CCIO
  - File
- CCInt
- CCList
  - Assoc
  - Idx
  - MONAD
  - Ref
  - Set
  - Traverse
    
    M
  - Zipper
- CCMap
  - Make
    
    O
  - S
- CCOpt
- CCOrd
- CCPair
- CCPrint
  - MONAD_IO
  - MakeIO
    
    M
- CCRandom
- CCRef
- CCSet
  - Make
    
    O
  - S
- CCString
  - S
  - Split
  - Sub
- CCVector
- Containers
  - Array
  - Format
  - List
  - Random
  - String
containers.advanced
- CCBatch
  - COLLECTION
  - Make
    
    C
  - S
- CCCat
  - APPLICATIVE
  - FOLDABLE
  - FREE_MONAD
    
    F
  - FUNCTOR
  - MONAD
  - MONAD_BARE
  - MONAD_TRANSFORMER
    
    M
  - MONOID
  - MakeFree
    
    F
  - MakeFreeFold
    
    FM
    
    F
    
    Fold
  - TRAVERSE
    
    M
  - WrapMonad
    
    M
- CCLinq
  - AdaptMap
    
    M
  - AdaptSet
    
    S
  - IO
  - L
  - M
  - PMap
- CCMonadIO
  - File
  - Raw
  - Seq
- Containers_advanced
containers.bigarray
- CCArray1
  - Bool
  - Float
    
    Infix
  - Int
    
    Infix
  - S
    
    Infix
  - View
    
    Float
    
    Int
    
    S
- CCBigstring
containers.data
- CCBV
- CCCache
- CCDeque
- CCFQueue
- CCFlatHashtbl
  - HASHABLE
  - Make
    
    X
  - S
- CCGraph
  - Dot
  - LazyTree
  - MAP
  - Map
    
    O
  - Seq
  - Traverse
    
    Event
- CCHashconsedSet
  - ELT
  - Make
    
    E
  - S
- CCIntMap
- CCMixmap
  - Make
    
    X
  - ORD
  - S
- CCMixset
- CCMixtbl
- CCMultiMap
  - BIDIR
  - Make
    
    K
    
    V
  - MakeBidir
    
    L
    
    R
  - OrderedType
  - S
- CCMultiSet
  - Make
    
    O
  - S
- CCPersistentArray
- CCPersistentHashtbl
  - HashedType
  - Make
    
    H
  - S
- CCRingBuffer
  - Array
    
    Byte
    
    Make
    
    Elt
    
    S
  - Byte
  - Make
    
    Array
    
    X
  - MakeFromArray
    
    A
  - S
    
    Array
- CCTrie
  - Make
    
    W
  - MakeArray
    
    X
  - MakeList
    
    X
  - ORDERED
  - S
  - String
  - WORD
containers.io
- Containers_io_is_deprecated
containers.iter
- CCKList
  - MONAD
  - Traverse
    
    M
- CCKTree
  - Dot
  - pset
containers.misc
- Containers_misc
containers.sexp
- CCSexp
  - Traverse
- CCSexpM
  - MONAD
  - MakeDecode
    
    M
- CCSexpStream
  - L
  - Lexer
  - ParseGen
  - Source
    
    Manual
containers.string
- CCApp_parse
  - Chan
  - INPUT
  - Infix
  - Make
    
    I
  - MakeFromReader
    
    R
  - READER
  - S
  - Str
- CCKMP
  - Make
    
    Str
  - S
  - STRING
- CCLevenshtein
  - Index
  - Make
    
    Index
    
    Str
  - S
    
    Index
  - STRING
- CCParse
  - U
- Containers_string
containers.thread
- CCFuture
  - Infix
  - Timer
- CCLock
containers.unix
- CCUnix
  - Infix

Legend:
Library
Module
Module type
Parameter
Class
Class type

Imperative Bitvectors

type t

val empty : unit -> t

Empty bitvector

val create : size:int -> bool -> t

Create a bitvector of given size, with given default value

val copy : t -> t

Copy of bitvector

val cardinal : t -> int

Number of bits set

val length : t -> int

Length of underlying array

val resize : t -> int -> unit

Resize the BV so that it has at least the given physical length

val is_empty : t -> bool

Any bit set?

val set : t -> int -> unit

Set i-th bit.

val get : t -> int -> bool

Is the i-th bit true? Returns false if the index is too high

val reset : t -> int -> unit

Set i-th bit to 0

val flip : t -> int -> unit

Flip i-th bit

val clear : t -> unit

Set every bit to 0

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

Iterate on all bits

val iter_true : t -> (int -> unit) -> unit

Iterate on bits set to 1

val to_list : t -> int list

List of indexes that are true

val to_sorted_list : t -> int list

Same as to_list, but also guarantees the list is sorted in increasing order

val of_list : int list -> t

From a list of true bits

val first : t -> int

First set bit, or

raises Not_found
if all bits are 0

val filter : t -> (int -> bool) -> unit

filter bv p only keeps the true bits of bv whose index satisfies p index

val union_into : into:t -> t -> unit

union ~into bv sets into to the union of itself and bv.

val inter_into : into:t -> t -> unit

union ~into bv sets into to the intersection of itself and bv

val union : t -> t -> t

union bv1 bv2 returns the union of the two sets

val inter : t -> t -> t

Intersection of bitvectors

val select : t -> 'a array -> 'a list

select arr bv selects the elements of arr whose index correspond to a true bit in bv. If bv is too short, elements of arr with too high an index cannot be selected and are therefore not selected.

val selecti : t -> 'a array -> ('a * int) list

Same as select, but selected elements are paired with their index

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

val to_seq : t -> int sequence

val of_seq : int sequence -> t