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