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: program test;
Chris@366: 
Chris@366: { runTests } = load may.test;
Chris@366: 
Chris@366: // We want to test:
Chris@366: // 
Chris@366: // Kernel design -- check size (number of bins, number of atoms);
Chris@366: // check an example kernel against known data
Chris@366: //
Chris@366: // Time alignment -- feed a dirac train, check that peaks in all bins
Chris@366: // align
Chris@366: //
Chris@366: // Frequency discrimination -- feed a sinusoid, check peaks
Chris@366: //
Chris@366: // Latency compensation -- for dirac at 0, check peak can be found at
Chris@366: // 0 plus the declared latency
Chris@366: //
Chris@366: // Signal-noise ratio
Chris@366: //
Chris@366: // Specimen output for simple test case
Chris@366: 
Chris@366: tests = [
Chris@366: "kernel"    : load test_cqtkernel,
Chris@366: "frequency" : load test_frequency,
Chris@366: ];
Chris@366: 
Chris@366: bad = sum (mapHash do name testHash: runTests name testHash done tests);
Chris@366: 
Chris@366: if (bad > 0) then
Chris@366:     println "\n** \(bad) test(s) failed!";
Chris@366:     threadExit 1
Chris@366: else
Chris@366:     ()
Chris@366: fi
Chris@366: 
Chris@366: 
Chris@366: 
Chris@366: 
Chris@366: /*
Chris@366: //testStream = manipulate.withDuration 96000 (syn.sinusoid 48000 500);
Chris@366: //testStream = manipulate.withDuration 96000 (syn.pulseTrain 48000 4);
Chris@366: testStream = af.open "sweep-48000.wav";
Chris@366: //testStream = af.open "sweep.wav";
Chris@366: 
Chris@366: // So the stream is [ 0, 1, 0, -1, 0, 1, 0, -1, ... ] :
Chris@366: //testStream = manipulate.withDuration 64 (syn.sinusoid 8 2);
Chris@366: 
Chris@366: testStream = manipulate.withDuration 32 (syn.pulseTrain 8 0.001);
Chris@366: 
Chris@366: eprintln "have test stream";
Chris@366: 
Chris@366: cq = cqt { maxFreq = testStream.sampleRate/2, minFreq = 50, binsPerOctave = 24 } testStream;
Chris@366: 
Chris@366: eprintln "bin frequencies: \(cq.kernel.binFrequencies)";
Chris@366: 
Chris@366: bigM = mat.concatHorizontal (map cm.magnitudes cq.output);
Chris@366: 
Chris@366: eprintln "overall output size = \(mat.size bigM)";
Chris@366: 
Chris@366: mat.print bigM;
Chris@366: 
Chris@366: //\() (plot.plot [Contour bigM]);
Chris@366: \() (plot.plot [Grid bigM]);
Chris@366: */
Chris@366: //()
Chris@366: