package core_kernel
Industrial strength alternative to OCaml's standard library
Install
Dune Dependency
Authors
Maintainers
Sources
v0.12.2.tar.gz
sha256=96750d5b097cdfcdf00a463e2c1083e3c62c1d92987a0751ca2cda3a1e09241f
md5=afc0271c35437c883b3c75fb821fe470
doc/core_kernel.int_set/Int_set/index.html
Module Int_set
An implementation of compressed integer sets using lists of integer ranges. Operations such as adding and membership are O(n) where n is the number of contiguous ranges in the set. For data that is mostly serial, n should remain very small.
Note that when n gets very large, in addition to poor performance, these operations may throw exceptions since some of the code is not tail-recursive.
val empty : t
val to_string : t -> string
add_range t i j
adds all the numbers between i
and j
(inclusive) to the set. Note that it doesn't matter which order i
and j
are specified in; either way the effect is the same.
val mem : t -> int -> bool
mem t i
tests whether i
is a member of the set.
val ranges : t -> (int * int) list
ranges t
returns a list of all ranges that make up the set.
val max : t -> int option
val min : t -> int option
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>