annotate constant-q-cpp/misc/yeti/test_cqtkernel.yeti @ 372:af71cbdab621 tip

Update bqvec code
author Chris Cannam
date Tue, 19 Nov 2019 10:13:32 +0000
parents 5d0a2ebb4d17
children
rev   line source
Chris@366 1 /*
Chris@366 2 Constant-Q library
Chris@366 3 Copyright (c) 2013-2014 Queen Mary, University of London
Chris@366 4
Chris@366 5 Permission is hereby granted, free of charge, to any person
Chris@366 6 obtaining a copy of this software and associated documentation
Chris@366 7 files (the "Software"), to deal in the Software without
Chris@366 8 restriction, including without limitation the rights to use, copy,
Chris@366 9 modify, merge, publish, distribute, sublicense, and/or sell copies
Chris@366 10 of the Software, and to permit persons to whom the Software is
Chris@366 11 furnished to do so, subject to the following conditions:
Chris@366 12
Chris@366 13 The above copyright notice and this permission notice shall be
Chris@366 14 included in all copies or substantial portions of the Software.
Chris@366 15
Chris@366 16 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
Chris@366 17 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
Chris@366 18 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
Chris@366 19 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
Chris@366 20 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
Chris@366 21 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
Chris@366 22 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Chris@366 23
Chris@366 24 Except as contained in this notice, the names of the Centre for
Chris@366 25 Digital Music; Queen Mary, University of London; and Chris Cannam
Chris@366 26 shall not be used in advertising or otherwise to promote the sale,
Chris@366 27 use or other dealings in this Software without prior written
Chris@366 28 authorization.
Chris@366 29 */
Chris@366 30
Chris@366 31 module test_cqtkernel;
Chris@366 32
Chris@366 33 cm = load may.matrix.complex;
Chris@366 34 mm = load may.mathmisc;
Chris@366 35
Chris@366 36 { compare, compareUsing } = load may.test;
Chris@366 37
Chris@366 38 { makeKernel } = load cqtkernel;
Chris@366 39
Chris@366 40 eps = 1e-7;
Chris@366 41
Chris@366 42 compareClose = compareUsing do a b: abs (a - b) < eps done;
Chris@366 43
Chris@366 44 [
Chris@366 45
Chris@366 46 "minimal": \(
Chris@366 47 k = makeKernel { sampleRate = 16, maxFreq = 8, binsPerOctave = 4 };
Chris@366 48 compare k.binsPerOctave 4 and
Chris@366 49 compare (cm.size k.kernel) {
Chris@366 50 rows = k.binsPerOctave * k.atomsPerFrame,
Chris@366 51 columns = k.fftSize
Chris@366 52 } and
Chris@366 53 compareClose k.maxFrequency 8 and
Chris@366 54 compareClose k.minFrequency (4 * (mm.pow 2 (1/4))) and
Chris@366 55 compare k.atomsPerFrame 5 and
Chris@366 56 compare k.fftSize 32 and
Chris@366 57 compare (length k.binFrequencies) k.binsPerOctave and
Chris@366 58 compareClose (head k.binFrequencies) k.minFrequency and
Chris@366 59 compareClose (head (reverse k.binFrequencies)) k.maxFrequency
Chris@366 60 ),
Chris@366 61
Chris@366 62 ] is hash<string, () -> boolean>
Chris@366 63