diff options
author | Guido van Rossum <guido@python.org> | 1994-08-08 12:30:22 (GMT) |
---|---|---|
committer | Guido van Rossum <guido@python.org> | 1994-08-08 12:30:22 (GMT) |
commit | 16d6e7109deb1bcfd8a860cb60c16c02a0ef183b (patch) | |
tree | 81624359068cca2b8476d0894c8cd28788d0762e /Doc/lib/libaudioop.tex | |
parent | 4b4c664d2e93279c8d749da027000453f9e2cd46 (diff) | |
download | cpython-16d6e7109deb1bcfd8a860cb60c16c02a0ef183b.zip cpython-16d6e7109deb1bcfd8a860cb60c16c02a0ef183b.tar.gz cpython-16d6e7109deb1bcfd8a860cb60c16c02a0ef183b.tar.bz2 |
Lots of small corrections by Andrew Kuchling (plus all new rotor docs)
Diffstat (limited to 'Doc/lib/libaudioop.tex')
-rw-r--r-- | Doc/lib/libaudioop.tex | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/Doc/lib/libaudioop.tex b/Doc/lib/libaudioop.tex index 734065a..61ab7fc 100644 --- a/Doc/lib/libaudioop.tex +++ b/Doc/lib/libaudioop.tex @@ -43,7 +43,7 @@ This function returns the average over all samples in the fragment. \begin{funcdesc}{avgpp}{fragment\, width} This function returns the average peak-peak value over all samples in -the fragment. No filtering is done, so the useability of this routine +the fragment. No filtering is done, so the usefulness of this routine is questionable. \end{funcdesc} @@ -74,9 +74,9 @@ match \var{reference} as good as possible to a portion of (conceptually) does this by taking slices out of \var{fragment}, using \code{findfactor} to compute the best match, and minimizing the result. -It returns a tuple \code{(\var{offset}, \var{factor})} with offset the +It returns a tuple \code{(\var{offset}, \var{factor})} with \var{offset} the (integer) offset into \var{fragment} where the optimal match started -and \var{factor} the floating-point factor as per findfactor. +and \var{factor} the floating-point factor as per \code{findfactor}. \end{funcdesc} \begin{funcdesc}{findmax}{fragment\, length} @@ -101,8 +101,8 @@ This function converts samples between 1-, 2- and 4-byte formats. This function converts samples to 4 bit Intel/DVI ADPCM encoding. ADPCM coding is an adaptive coding scheme, whereby each 4 bit number is the difference between one sample and the next, divided by a -(varying) step. The Intel/DVI ADPCM algorythm has been selected for -use by the IMA, so may well become a standard. +(varying) step. The Intel/DVI ADPCM algorithm has been selected for +use by the IMA, so it may well become a standard. \code{State} is a tuple containing the state of the coder. The coder returns a tuple \code{(\var{adpcmfrag}, \var{newstate})}, and the @@ -120,7 +120,7 @@ discouraged. \begin{funcdesc}{lin2ulaw}{fragment\, width} This function converts samples in the audio fragment to U-LAW encoding -and returns this as a python string. U-LAW is an audio encoding format +and returns this as a Python string. U-LAW is an audio encoding format whereby you get a dynamic range of about 14 bits using only 8 bit samples. It is used by the Sun audio hardware, among others. \end{funcdesc} |