\cond show_private

Construct a relevant isize_t given the bound.

As int32_decoded/encode, but from/to blocks instead of cram_fd */

MinGW's printf has problem with "%lld" */

Initialise a bit set capable of holding ni integers, 0 <= i < ni. The set returned is empty if fill == 0, or all of [0,ni) otherwise.

initialize ->type, ->host, ->retr and ->size

reference: http://www-igm.univ-mlv.fr/~lecroq/string/node14.html

* Returns 's' split by delimiter, with *n being the number of components; * NULL on failue. */

s MUST BE a null terminated string; l = strlen(s)

Relies on the root->last being correct. Do not use with the other list_ routines unless they are fixed to modify root->last as well.

Load imdName.omit and initialize the init count vector.

pliu load isoform's prior information and re-calculate totc

generates a success * trials table of bionomial probability densities (log transformed) */

inpF in fasta format