Set the tolerance for the convergence of the iterative scaling algorithm */

* Return the array of nonzero values packed by column * * The size is nnz */

* Convert and pack two float Packets into one bfloat16 Packet - odd & even order */

\returns the stored value at index \a key * If the value does not exist, then the value \a defaultValue is returned without any insertion. */

\returns the dimension in which the box holds */

Finds and replaces a set of substrings in a string.

Given an \a index of a node, on exit, \a outVBegin and \a outVEnd range over the indices of the volume children of the node * and \a outOBegin and

\returns the index of the root of the hierarchy */

\internal Like malloc, but the returned pointer is guaranteed to be aligned to `alignment`. * Fast, but wastes `alignment` additional bytes of memor

\returns the image of the matrix, also called its column-space. The columns of the returned matrix * will form a basis of the image (column-spac

\returns true if the matrix is negative (semidefinite) */

\returns true if the matrix is positive (semidefinite) */

\returns the number of iterations performed */