icons: Renamed probe.svg to channels.svg

[pulseview.git] / pv / widgets / sweeptimingwidget.cpp

/*
 * This file is part of the PulseView project.
 *
 * Copyright (C) 2013 Joel Holdsworth <joel@airwebreathe.org.uk>
 *
 * 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.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
 */

#include "sweeptimingwidget.h"

#include <vector>

#include <assert.h>

#include <extdef.h>

using std::abs;
using std::vector;

namespace pv {
namespace widgets {

SweepTimingWidget::SweepTimingWidget(const char *suffix,
	QWidget *parent) :
	QWidget(parent),
	_suffix(suffix),
	_layout(this),
	_value(this),
	_list(this),
	_value_type(None)
{
	setContentsMargins(0, 0, 0, 0);

	_value.setDecimals(0);
	_value.setSuffix(QString::fromUtf8(suffix));

	connect(&_list, SIGNAL(currentIndexChanged(int)),
		this, SIGNAL(value_changed()));
	connect(&_value, SIGNAL(editingFinished()),
		this, SIGNAL(value_changed()));

	setLayout(&_layout);
	_layout.setMargin(0);
	_layout.addWidget(&_list);
	_layout.addWidget(&_value);

	show_none();
}

void SweepTimingWidget::show_none()
{
	_value_type = None;
	_value.hide();
	_list.hide();
}

void SweepTimingWidget::show_min_max_step(uint64_t min, uint64_t max,
	uint64_t step)
{
	assert(max > min);
	assert(step > 0);

	_value_type = MinMaxStep;

	_value.setRange(min, max);
	_value.setSingleStep(step);

	_value.show();
	_list.hide();
}

void SweepTimingWidget::show_list(const uint64_t *vals, size_t count)
{
	_value_type = List;

	_list.clear();
	for (size_t i = 0; i < count; i++)
	{
		char *const s = sr_si_string_u64(vals[i], _suffix);
		_list.addItem(QString::fromUtf8(s),
			qVariantFromValue(vals[i]));
		g_free(s);
	}

	_value.hide();
	_list.show();
}

void SweepTimingWidget::show_125_list(uint64_t min, uint64_t max)
{
	assert(max > min);

	// Create a 1-2-5-10 list of entries.
	const unsigned int FineScales[] = {1, 2, 5};
	uint64_t value, decade;
	unsigned int fine;
	vector<uint64_t> values;

	// Compute the starting decade
	for (decade = 1; decade * 10 <= min; decade *= 10);

	// Compute the first entry
	for (fine = 0; fine < countof(FineScales); fine++)
		if (FineScales[fine] * decade >= min)
			break;

	assert(fine < countof(FineScales));

	// Add the minimum entry if it's not on the 1-2-5 progression
	if (min != FineScales[fine] * decade)
		values.push_back(min);

	while ((value = FineScales[fine] * decade) < max) {
		values.push_back(value);
		if (++fine >= countof(FineScales))
			fine = 0, decade *= 10;
	}

	// Add the max value
	values.push_back(max);

	// Make a C array, and give it to the sweep timing widget
	uint64_t *const values_array = new uint64_t[values.size()];
	copy(values.begin(), values.end(), values_array);
	show_list(values_array, values.size());
	delete[] values_array;
}

uint64_t SweepTimingWidget::value() const
{
	switch(_value_type)
	{
	case None:
		return 0;

	case MinMaxStep:
		return (uint64_t)_value.value();

	case List:
	{
		const int index = _list.currentIndex();
		return (index >= 0) ? _list.itemData(
			index).value<uint64_t>() : 0;
	}

	default:
		// Unexpected value type
		assert(0);
		return 0;
	}
}

void SweepTimingWidget::set_value(uint64_t value)
{
	_value.setValue(value);

	int best_match = _list.count() - 1;
	int64_t best_variance = INT64_MAX;

	for (int i = 0; i < _list.count(); i++) {
		const int64_t this_variance = abs(
			(int64_t)value - _list.itemData(i).value<int64_t>());
		if (this_variance < best_variance) {
			best_variance = this_variance;
			best_match = i;
		}
	}

	_list.setCurrentIndex(best_match);
}

} // widgets
} // pv