2 * This file is part of the PulseView project.
4 * Copyright (C) 2013 Joel Holdsworth <joel@airwebreathe.org.uk>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
21 #include "sweeptimingwidget.hpp"
37 SweepTimingWidget::SweepTimingWidget(const char *suffix,
46 setContentsMargins(0, 0, 0, 0);
48 value_.setDecimals(0);
49 value_.setSuffix(QString::fromUtf8(suffix));
51 connect(&list_, SIGNAL(currentIndexChanged(int)),
52 this, SIGNAL(value_changed()));
53 connect(&value_, SIGNAL(editingFinished()),
54 this, SIGNAL(value_changed()));
58 layout_.addWidget(&list_);
59 layout_.addWidget(&value_);
64 void SweepTimingWidget::show_none()
71 void SweepTimingWidget::show_min_max_step(uint64_t min, uint64_t max,
77 value_type_ = MinMaxStep;
79 value_.setRange(min, max);
80 value_.setSingleStep(step);
86 void SweepTimingWidget::show_list(const uint64_t *vals, size_t count)
91 for (size_t i = 0; i < count; i++) {
92 char *const s = sr_si_string_u64(vals[i], suffix_);
93 list_.addItem(QString::fromUtf8(s),
94 qVariantFromValue(vals[i]));
102 void SweepTimingWidget::show_125_list(uint64_t min, uint64_t max)
106 // Create a 1-2-5-10 list of entries.
107 const unsigned int FineScales[] = {1, 2, 5};
108 uint64_t value, decade;
110 vector<uint64_t> values;
112 // Compute the starting decade
113 for (decade = 1; decade * 10 <= min; decade *= 10);
115 // Compute the first entry
116 for (fine = 0; fine < countof(FineScales); fine++)
117 if (FineScales[fine] * decade >= min)
120 assert(fine < countof(FineScales));
122 // Add the minimum entry if it's not on the 1-2-5 progression
123 if (min != FineScales[fine] * decade)
124 values.push_back(min);
126 while ((value = FineScales[fine] * decade) < max) {
127 values.push_back(value);
128 if (++fine >= countof(FineScales))
129 fine = 0, decade *= 10;
133 values.push_back(max);
135 // Make a C array, and give it to the sweep timing widget
136 uint64_t *const values_array = new uint64_t[values.size()];
137 copy(values.begin(), values.end(), values_array);
138 show_list(values_array, values.size());
139 delete[] values_array;
142 uint64_t SweepTimingWidget::value() const
144 switch(value_type_) {
149 return (uint64_t)value_.value();
153 const int index = list_.currentIndex();
154 return (index >= 0) ? list_.itemData(
155 index).value<uint64_t>() : 0;
159 // Unexpected value type
165 void SweepTimingWidget::set_value(uint64_t value)
167 value_.setValue(value);
169 int best_match = list_.count() - 1;
170 int64_t best_variance = INT64_MAX;
172 for (int i = 0; i < list_.count(); i++) {
173 const int64_t this_variance = abs(
174 (int64_t)value - list_.itemData(i).value<int64_t>());
175 if (this_variance < best_variance) {
176 best_variance = this_variance;
181 list_.setCurrentIndex(best_match);