package biocaml

You can search for identifiers within the package.

in-package search v0.2.0

The OCaml Bioinformatics Library

Install

sha256=fae219e66db06f81f3fd7d9e44717ccf2d6d85701adb12004ab4ae6d3359dd2d

sha512=f6abd60dac2e02777be81ce3b5acdc0db23b3fa06731f5b2d0b32e6ecc9305fe64f407bbd95a3a9488b14d0a7ac7c41c73a7e18c329a8f18febfc8fd50eccbc6

Efficient integer sets when many elements expected to be large contiguous sequences of integers.

Sourcetype t

Type of a set of integers.

Sourcetype range = Range.t

Sourceval empty : t

The empty set.

Sourceval of_range_list : (int * int) list -> t

Construct the set of integers representing the union of integers in all given ranges.

Sourceval to_range_list : t -> (int * int) list

Return set of integers as a minimal list of non-overlapping ranges in ascending order by their coordinates.

Sourceval to_list : t -> int list

Return set of integers as a list. Elements will be in ascending order.

Sourceval size : t -> int

Number of elements in set.

Sourceval is_empty : t -> bool

Return true if given set is empty.

Sourceval inter : t -> t -> t

Set intersection.

Sourceval union : t -> t -> t

Set union.

Sourceval diff : t -> t -> t

Set difference. diff s t is the set of elements that are in s but not in t.

Sourceval subset : t -> t -> bool

subset s t returns true if s is a subset of t.