LPC analysis via acf (=implementation of Durbin recursion)*/

FIR impulse responses are clipped to a finite length N This function fades out the impulse response linearly in the left and right border regions (10%

initialise a inverse RDFT work area K is number of frequency bins (input) I is the number of actual output samples to compute nI is the denominator of

perform an arbitrary inverse RDFT (slow version)

Normalises an impulse response, so that the convolution of a signal with the impulse response has the same gain/amplitude as the input signal

bartlett (triangular) window (zero endpoints) */

triangular window (non-zero endpoints) */

computes euclidean norm of given vector x */

Converts integer PCM sample values to float sample values in [-1,+1]. nChan is the number of channels allocated in *a. Requires nBits, nBPS, and nChan

Reads pcm data from a filehandle and converts it to float array with value range -1 to +1. Return value: -1 eof, 0 error, > 0 num samples read

Interface functions

add vector b onto vector a

subtract vector b from vector a

Get the error code.

return the size of the array

Check whether the array is empty.

Erase a value in a subtree. ! \param root Root value of a DOM sub-tree to be resolved. It can be any value other than document root. \

version for inverses - gm2 is identity

Get the \ref ParseErrorCode of last parsing.

Get the length of string. ! Since rapidjson permits "\\u0000" in the json string, strlen(v.GetString()) may not equal to v.GetStringLength(). */

Whether a parse error has occured in the last parsing.

Whether the result is an error.

Check whether this is a valid pointer.

Get the error offset, if \ref IsError(), 0 otherwise.

Assignment without calling destructor

enabled via kParseNumbersAsStringsFlag, string is not null-terminated (use length)