summaryrefslogtreecommitdiffstats
path: root/chalk/core/kis_histogram.cpp
diff options
context:
space:
mode:
authorMichele Calgaro <[email protected]>2021-05-23 20:48:35 +0900
committerMichele Calgaro <[email protected]>2021-05-29 15:16:28 +0900
commit8b78a8791bc539bcffe7159f9d9714d577cb3d7d (patch)
tree1328291f966f19a22d7b13657d3f01a588eb1083 /chalk/core/kis_histogram.cpp
parent95834e2bdc5e01ae1bd21ac0dfa4fa1d2417fae9 (diff)
downloadkoffice-8b78a8791bc539bcffe7159f9d9714d577cb3d7d.tar.gz
koffice-8b78a8791bc539bcffe7159f9d9714d577cb3d7d.zip
Renaming of files in preparation for code style tools.
Signed-off-by: Michele Calgaro <[email protected]>
Diffstat (limited to 'chalk/core/kis_histogram.cpp')
-rw-r--r--chalk/core/kis_histogram.cpp215
1 files changed, 215 insertions, 0 deletions
diff --git a/chalk/core/kis_histogram.cpp b/chalk/core/kis_histogram.cpp
new file mode 100644
index 00000000..bece7c9a
--- /dev/null
+++ b/chalk/core/kis_histogram.cpp
@@ -0,0 +1,215 @@
+/*
+ * Copyright (c) 2004 Boudewijn Rempt
+ * (c) 2005 Bart Coppens <[email protected]>
+ *
+ * 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 Street, Fifth Floor, Boston, MA 02110-1301, USA.
+ */
+
+#include <kdebug.h>
+#include <tqdatetime.h> // ### Debug
+
+#include "kis_types.h"
+#include "kis_histogram.h"
+#include "kis_paint_layer.h"
+#include "kis_iterators_pixel.h"
+#include "kis_colorspace.h"
+#include "kis_debug_areas.h"
+
+KisHistogram::KisHistogram(KisPaintLayerSP layer,
+ KisHistogramProducerSP producer,
+ const enumHistogramType type)
+{
+ m_dev = layer->paintDevice();
+ m_type = type;
+ m_producer = producer;
+ m_selection = false;
+ m_channel = 0;
+
+ updateHistogram();
+}
+
+KisHistogram::KisHistogram(KisPaintDeviceSP paintdev,
+ KisHistogramProducerSP producer,
+ const enumHistogramType type)
+{
+ m_dev = paintdev;
+ m_type = type;
+ m_producer = producer;
+ m_selection = false;
+ m_channel = 0;
+
+ updateHistogram();
+}
+
+KisHistogram::~KisHistogram()
+{
+}
+
+void KisHistogram::updateHistogram()
+{
+ TQ_INT32 x,y,w,h;
+ m_dev->exactBounds(x,y,w,h);
+ KisRectIteratorPixel srcIt = m_dev->createRectIterator(x,y,w,h, false);
+ KisColorSpace* cs = m_dev->colorSpace();
+
+ TQTime t;
+ t.start();
+
+ // Let the producer do it's work
+ m_producer->clear();
+ int i;
+ // Handle degenerate case (this happens with the accumulating histogram,
+ // which has an empty device)
+ if (srcIt.isDone()) {
+ m_producer->addRegionToBin(0, 0, 0, cs);
+ } else {
+ while ( !srcIt.isDone() ) {
+ i = srcIt.nConseqPixels();
+ m_producer->addRegionToBin(srcIt.rawData(), srcIt.selectionMask(), i, cs);
+ srcIt += i;
+ }
+ }
+
+ computeHistogram();
+}
+
+void KisHistogram::computeHistogram()
+{
+ m_completeCalculations = calculateForRange(m_producer->viewFrom(),
+ m_producer->viewFrom() + m_producer->viewWidth());
+
+ if (m_selection) {
+ m_selectionCalculations = calculateForRange(m_selFrom, m_selTo);
+ } else {
+ m_selectionCalculations.clear();
+ }
+
+#if 1
+ dump();
+#endif
+}
+
+KisHistogram::Calculations KisHistogram::calculations() {
+ return m_completeCalculations.at(m_channel);
+}
+
+KisHistogram::Calculations KisHistogram::selectionCalculations() {
+ return m_selectionCalculations.at(m_channel);
+}
+
+TQValueVector<KisHistogram::Calculations> KisHistogram::calculateForRange(double from, double to) {
+ TQValueVector<Calculations> calculations;
+ uint count = m_producer->channels().count();
+
+ for (uint i = 0; i < count; i++) {
+ calculations.append(calculateSingleRange(i, from, to));
+ }
+
+ return calculations;
+}
+
+KisHistogram::Calculations KisHistogram::calculateSingleRange(int channel, double from, double to) {
+ Calculations c;
+
+ // XXX If from == to, we only want a specific bin, handle that properly!
+
+ double max = from, min = to, total = 0.0, mean = 0.0; //, median = 0.0, stddev = 0.0;
+ TQ_UINT32 high = 0, low = (TQ_UINT32) -1, count = 0;
+
+ if (m_producer->count() == 0) {
+ // We won't get anything, even if a range is specified
+ // XXX make sure all initial '0' values are correct here!
+ return c;
+ }
+
+ TQ_INT32 totbins = m_producer->numberOfBins();
+ TQ_UINT32 current;
+
+ // convert the double range into actual bins:
+ double factor = static_cast<double>(totbins) / m_producer->viewWidth();
+
+ TQ_INT32 fromBin = static_cast<TQ_INT32>((from - m_producer->viewFrom()) * factor);
+ TQ_INT32 toBin = fromBin + static_cast<TQ_INT32>((to - from) * factor);
+
+ // Min, max, count, low, high
+ for (TQ_INT32 i = fromBin; i < toBin; i++) {
+ current = m_producer->getBinAt(channel, i);
+ double pos = static_cast<double>(i) / factor + from;
+ if (current > high)
+ high = current;
+ if (current < low)
+ low = current;
+ if (current > 0) {
+ if (pos < min)
+ min = pos;
+ if (pos > max)
+ max = pos;
+ }
+ // We do the count here as well.
+ // we can't use m_producer->count() for this, because of the range
+ count += current;
+ total += current * pos;
+ }
+
+ if (count > 0)
+ mean = total / count;
+
+ c.m_high = high;
+ c.m_low = low;
+ c.m_count = count;
+ c.m_min = min;
+ c.m_max = max;
+ c.m_mean = mean;
+ c.m_total = total;
+
+ return c;
+}
+
+
+void KisHistogram::dump() {
+ kdDebug(DBG_AREA_MATH) << "Histogram\n";
+
+ switch (m_type) {
+ case LINEAR:
+ kdDebug(DBG_AREA_MATH) << "Linear histogram\n";
+ break;
+ case LOGARITHMIC:
+ kdDebug(DBG_AREA_MATH) << "Logarithmic histogram\n";
+ }
+
+ kdDebug(DBG_AREA_MATH) << "Dumping channel " << m_channel << endl;
+ Calculations c = calculations();
+
+/* for( int i = 0; i <256; ++i ) {
+ kdDebug(DBG_AREA_MATH) << "Value "
+ << TQString().setNum(i)
+ << ": "
+ << TQString().setNum(m_values[i])
+ << "\n";
+ }*/
+ kdDebug(DBG_AREA_MATH) << "\n";
+
+ kdDebug(DBG_AREA_MATH) << "Max: " << TQString(TQString().setNum(c.getMax())) << "\n";
+ kdDebug(DBG_AREA_MATH) << "Min: " << TQString(TQString().setNum(c.getMin())) << "\n";
+ kdDebug(DBG_AREA_MATH) << "High: " << TQString(TQString().setNum(c.getHighest())) << "\n";
+ kdDebug(DBG_AREA_MATH) << "Low: " << TQString(TQString().setNum(c.getLowest())) << "\n";
+ kdDebug(DBG_AREA_MATH) << "Mean: " << TQString(m_producer->positionToString(c.getMean())) << "\n";
+ kdDebug(DBG_AREA_MATH) << "Total: " << TQString(TQString().setNum(c.getTotal())) << "\n";
+// kdDebug(DBG_AREA_MATH) << "Median: " << TQString().setNum(m_median) << "\n";
+// kdDebug(DBG_AREA_MATH) << "Stddev: " << TQString().setNum(m_stddev) << "\n";
+// kdDebug(DBG_AREA_MATH) << "percentile: " << TQString().setNum(m_percentile) << "\n";
+
+ kdDebug(DBG_AREA_MATH) << "\n";
+}