comparison src/Silvet.cpp @ 92:81eaba98985b bqvec

Complete using bqvec for allocation etc, but with unchanged processing logic

 
         if (sum < 1e-5) continue;
 
         EM em;
         for (int j = 0; j < iterations; ++j) {
-            em.iterate(filtered[i]);
-        }
-
-        vector<double> pitches = em.getPitchDistribution();
+            em.iterate(filtered[i].data());
+        }
+
+        const double *pd = em.getPitchDistribution();
+        vector<double> pitches(pd, pd + processingNotes);
         
         for (int j = 0; j < processingNotes; ++j) {
             pitches[j] *= sum;
         }