view data/model/DenseTimeValueModel.cpp @ 875:3e6ed8a8577b tonioni

Use a sparse time-value model only for outputs with fixed bin count of 1, not for those with unknown bin count. (Precursor to using more than one model for outputs with unknown bin count)
author Chris Cannam
date Tue, 28 Jan 2014 18:52:22 +0000
parents e802e550a1f2
children 59e7fe1b1003
line wrap: on
line source
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */

/*
    Sonic Visualiser
    An audio file viewer and annotation editor.
    Centre for Digital Music, Queen Mary, University of London.
    This file copyright 2006 Chris Cannam.
    
    This program is free software; you can redistribute it and/or
    modify it under the terms of the GNU General Public License as
    published by the Free Software Foundation; either version 2 of the
    License, or (at your option) any later version.  See the file
    COPYING included with this distribution for more information.
*/

#include "DenseTimeValueModel.h"
#include "base/PlayParameterRepository.h"

#include <QStringList>

DenseTimeValueModel::DenseTimeValueModel()
{
    PlayParameterRepository::getInstance()->addPlayable(this);
}

DenseTimeValueModel::~DenseTimeValueModel()
{
    PlayParameterRepository::getInstance()->removePlayable(this);
}
	
QString
DenseTimeValueModel::toDelimitedDataString(QString delimiter, size_t f0, size_t f1) const
{
    size_t ch = getChannelCount();

    cerr << "f0 = " << f0 << ", f1 = " << f1 << endl;

    if (f1 <= f0) return "";

    float **all = new float *[ch];
    for (size_t c = 0; c < ch; ++c) {
        all[c] = new float[f1 - f0];
    }

    size_t n = getData(0, ch - 1, f0, f1 - f0, all);

    QStringList list;
    for (size_t i = 0; i < n; ++i) {
        QStringList parts;
        parts << QString("%1").arg(f0 + i);
        for (size_t c = 0; c < ch; ++c) {
            parts << QString("%1").arg(all[c][i]);
        }
        list << parts.join(delimiter);
    }

    for (size_t c = 0; c < ch; ++c) {
        delete[] all[c];
    }
    delete[] all;

    return list.join("\n");
}