annotate src/MatchFeatureFeeder.cpp @ 49:c2e152d8a9d4 refactors_no_float

Comment
author Chris Cannam
date Thu, 13 Nov 2014 18:50:25 +0000
parents 6a5d165e5ea4
children faa523be20f9
rev   line source
cannam@0 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
cannam@0 2
cannam@0 3 /*
cannam@0 4 Vamp feature extraction plugin using the MATCH audio alignment
cannam@0 5 algorithm.
cannam@0 6
cannam@0 7 Centre for Digital Music, Queen Mary, University of London.
cannam@0 8 This file copyright 2007 Simon Dixon, Chris Cannam and QMUL.
cannam@0 9
cannam@0 10 This program is free software; you can redistribute it and/or
cannam@0 11 modify it under the terms of the GNU General Public License as
cannam@0 12 published by the Free Software Foundation; either version 2 of the
cannam@0 13 License, or (at your option) any later version. See the file
cannam@0 14 COPYING included with this distribution for more information.
cannam@0 15 */
cannam@0 16
Chris@24 17 #include "MatchFeatureFeeder.h"
cannam@0 18
Chris@14 19 using std::vector;
Chris@14 20
Chris@24 21 MatchFeatureFeeder::MatchFeatureFeeder(Matcher *m1, Matcher *m2) :
cannam@0 22 pm1(m1), pm2(m2)
cannam@0 23 {
cannam@0 24 finder = new Finder(m1, m2);
cannam@0 25 }
cannam@0 26
Chris@24 27 MatchFeatureFeeder::~MatchFeatureFeeder()
cannam@0 28 {
cannam@0 29 delete finder;
cannam@0 30 }
cannam@0 31
cannam@0 32 void
Chris@24 33 MatchFeatureFeeder::feed(vector<double> f1, vector<double> f2)
cannam@0 34 {
Chris@49 35 // We maintain two FIFO queues of feature vectors, one per input
Chris@49 36 // stream. When the match-feeder function is entered, it knows
Chris@49 37 // that it has at least one feature in each queue. It loops,
Chris@49 38 // processing up to one feature per matcher, until a queue is
Chris@49 39 // empty. Then it returns, to be called again with more data.
Chris@49 40
Chris@24 41 q1.push(f1);
Chris@24 42 q2.push(f2);
Chris@14 43
Chris@14 44 while (!q1.empty() && !q2.empty()) {
Chris@24 45 feedBlock();
Chris@14 46 }
Chris@14 47 }
Chris@14 48
Chris@24 49 void
Chris@24 50 MatchFeatureFeeder::feedBlock()
Chris@14 51 {
Chris@43 52 if (pm1->m_frameCount < pm1->m_blockSize) { // fill initial block
Chris@24 53 feed1();
Chris@24 54 feed2();
Chris@14 55 }
Chris@43 56 else if (pm1->m_runCount >= pm1->m_params.maxRunCount) { // slope constraints
Chris@24 57 feed2();
Chris@43 58 } else if (pm2->m_runCount >= pm2->m_params.maxRunCount) {
Chris@24 59 feed1();
cannam@0 60 } else {
cannam@0 61 switch (finder->getExpandDirection
Chris@43 62 (pm1->m_frameCount-1, pm2->m_frameCount-1)) {
cannam@0 63 case ADVANCE_THIS:
Chris@24 64 feed1();
cannam@0 65 break;
cannam@0 66 case ADVANCE_OTHER:
Chris@24 67 feed2();
cannam@0 68 break;
cannam@0 69 case ADVANCE_BOTH:
Chris@24 70 feed1();
Chris@24 71 feed2();
cannam@0 72 break;
cannam@0 73 }
cannam@0 74 }
cannam@0 75 }
cannam@0 76
Chris@24 77 void
Chris@24 78 MatchFeatureFeeder::feed1()
cannam@0 79 {
Chris@24 80 pm1->consumeFeatureVector(q1.front());
cannam@0 81 q1.pop();
cannam@0 82 }
cannam@0 83
Chris@24 84 void
Chris@24 85 MatchFeatureFeeder::feed2()
cannam@0 86 {
Chris@24 87 pm2->consumeFeatureVector(q2.front());
cannam@0 88 q2.pop();
cannam@0 89 }
cannam@0 90