The size of the bitvector is rounded up to the multiple of 30 or 62. In other words some functions such as iter might iterate on more bits than what was originally asked for.
val empty : unit -> tEmpty bitvector
val create : size:int -> bool -> tCreate a bitvector of given size, with given default value
val cardinal : t -> intNumber of bits set
val length : t -> intLength of underlying array
val resize : t -> int -> unitResize the BV so that it has at least the given physical length resize bv n should make bv able to store (Sys.word_size - 2)* n bits
val is_empty : t -> boolAny bit set?
val set : t -> int -> unitSet i-th bit.
val get : t -> int -> boolIs the i-th bit true? Returns false if the index is too high
val reset : t -> int -> unitSet i-th bit to 0
val flip : t -> int -> unitFlip i-th bit
val clear : t -> unitSet every bit to 0
val iter : t -> (int -> bool -> unit) -> unitIterate on all bits
val iter_true : t -> (int -> unit) -> unitIterate on bits set to 1
val to_list : t -> int listList of indexes that are true
val to_sorted_list : t -> int listSame as to_list, but also guarantees the list is sorted in increasing order
val of_list : int list -> tFrom a list of true bits
val first : t -> intFirst set bit, or
Not_found if all bits are 0
val filter : t -> (int -> bool) -> unitfilter bv p only keeps the true bits of bv whose index satisfies p index
val select : t -> 'a array -> 'a listselect arr bv selects the elements of arr whose index corresponds 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) listSame as select, but selected elements are paired with their index
val print : Format.formatter -> t -> unitPrint the bitvector as a string of bits