index: bitgroup index, bits: bitgroup size(1, 2 or 4), in: bitgroup value, out: octet array to add bits to*/

Return the adler32 of the bytes data[0..len-1]*/

\returns the value of the rotation angle in radian */

\returns the value of the rotation angle in radian */

color is not allowed to already exist. Index should be >= 0 (it's signed to be compatible with using -1 for "doesn't exist")*/

returns -1 if color not present, its index otherwise*/

* Number of columns */

* Number of columns */

input parameters: I : a numpy array of shape [H, W, C], where C should be 3. type of I should be np.uint8, and the valu

input parameters: I: a numpy array of shape [D, H, W, C], where C is the channel number type of I should be np.uint8, and the

\returns The determinant of the matrix. * * \sa absDeterminant(), logAbsDeterminant() */

\returns The determinant of the matrix. * * \sa absDeterminant(), logAbsDeterminant() */

LZ77-encode the data. Return value is error code. The input are raw bytes, the output is in the form of unsigned integers with codes representing for

\return the equivalent permutation matrix */

\return the equivalent permutation matrix */

get the distance code tree of a deflated block with fixed tree, as specified in the deflate specification*/

get the literal and length code tree of a deflated block with fixed tree, as per the deflate specification*/

Read the labeling from a file

Similar to getPixelColorRGBA8, but with all the for loops inside of the color mode test cases, optimized to convert the colors much faster, when conv

* Returns an iterator to the node that stores the information * of the given virtual pointer from the given pointer map structure. * If pointer

* Returns an iterator to the node that stores the information * of the given virtual pointer from the given pointer map structure. * If pointer

\internal Like malloc, but the returned pointer is guaranteed to be 16-byte aligned. * Fast, but wastes 16 additional bytes of memory. Does not thro

\internal Like malloc, but the returned pointer is guaranteed to be 16-byte aligned. * Fast, but wastes 16 additional bytes of memory. Does not thro