chalk/chalkcolor/kis_histogram_producer.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67

/*
 *  Copyright (c) 2005 Bart Coppens <kde@bartcoppens.be>
 *
 *  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 "kis_histogram_producer.h"
#include "kis_basic_histogram_producers.h"

KisHistogramProducerFactoryRegistry* KisHistogramProducerFactoryRegistry::m_singleton = 0;

KisHistogramProducerFactoryRegistry::KisHistogramProducerFactoryRegistry() {
    Q_ASSERT(KisHistogramProducerFactoryRegistry::m_singleton == 0);
}

KisHistogramProducerFactoryRegistry::~KisHistogramProducerFactoryRegistry() {
}

KisHistogramProducerFactoryRegistry* KisHistogramProducerFactoryRegistry::instance() {
    if(KisHistogramProducerFactoryRegistry::m_singleton == 0) {
        KisHistogramProducerFactoryRegistry::m_singleton
                = new KisHistogramProducerFactoryRegistry();
        m_singleton->add( new KisGenericLabHistogramProducerFactory() );
    }
    return KisHistogramProducerFactoryRegistry::m_singleton;
}

KisIDList KisHistogramProducerFactoryRegistry::listKeysCompatibleWith(
        KisColorSpace* colorSpace) const
{
    KisIDList list;
    TQValueList<float> preferredList;
    storageMap::const_iterator it = m_storage.begin();
    storageMap::const_iterator endit = m_storage.end();
    // O(n^2), can't this be done better? (But preferrably not by looking up the preferredness
    // during the sorting...
    while( it != endit ) {
        if (it->second->isCompatibleWith(colorSpace)) {
            float preferred = it->second->preferrednessLevelWith(colorSpace);
            TQValueList<float>::iterator pit = preferredList.begin();
            TQValueList<float>::iterator pend = preferredList.end();
            KisIDList::iterator lit = list.begin();

            while (pit != pend && preferred <= *pit) {
                ++pit;
                ++lit;
            }

            list.insert(lit, it->first);
            preferredList.insert(pit, preferred);
        }
        ++it;
    }
    return list;
}