c@69: /*
c@69:     Constant-Q library
c@69:     Copyright (c) 2013-2014 Queen Mary, University of London
c@69: 
c@69:     Permission is hereby granted, free of charge, to any person
c@69:     obtaining a copy of this software and associated documentation
c@69:     files (the "Software"), to deal in the Software without
c@69:     restriction, including without limitation the rights to use, copy,
c@69:     modify, merge, publish, distribute, sublicense, and/or sell copies
c@69:     of the Software, and to permit persons to whom the Software is
c@69:     furnished to do so, subject to the following conditions:
c@69: 
c@69:     The above copyright notice and this permission notice shall be
c@69:     included in all copies or substantial portions of the Software.
c@69: 
c@69:     THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
c@69:     EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
c@69:     MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
c@69:     NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
c@69:     CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
c@69:     CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
c@69:     WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
c@69: 
c@69:     Except as contained in this notice, the names of the Centre for
c@69:     Digital Music; Queen Mary, University of London; and Chris Cannam
c@69:     shall not be used in advertising or otherwise to promote the sale,
c@69:     use or other dealings in this Software without prior written
c@69:     authorization.
c@69: */
c@65: 
c@65: module test_cqtkernel;
c@65: 
c@65: cm = load may.matrix.complex;
c@81: mm = load may.mathmisc;
c@81: 
c@81: { compare, compareUsing } = load may.test;
c@65: 
c@65: { makeKernel } = load cqtkernel;
c@65: 
c@81: eps = 1e-7;
c@81: 
c@81: compareClose = compareUsing do a b: abs (a - b) < eps done;
c@81: 
c@65: [
c@65: 
c@65: "minimal": \(
c@65:     k = makeKernel { sampleRate = 16, maxFreq = 8, binsPerOctave = 4 };
c@81:     compare k.binsPerOctave 4 and
c@81:         compare (cm.size k.kernel) {
c@81:             rows = k.binsPerOctave * k.atomsPerFrame,
c@81:             columns = k.fftSize
c@81:         } and
c@81:         compareClose k.maxFrequency 8 and
c@81:         compareClose k.minFrequency (4 * (mm.pow 2 (1/4))) and
c@81:         compare k.atomsPerFrame 5 and
c@81:         compare k.fftSize 32 and
c@81:         compare (length k.binFrequencies) k.binsPerOctave and
c@81:         compareClose (head k.binFrequencies) k.minFrequency and
c@81:         compareClose (head (reverse k.binFrequencies)) k.maxFrequency
c@65: ),
c@65: 
c@65: ] is hash<string, () -> boolean>
c@65: