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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
/*
* colourlist.h - an ordered list of colours
* Program: kalarm
* Copyright (C) 2003, 2005 by David Jarvie <software@astrojar.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 Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef COLOURLIST_H
#define COLOURLIST_H
#include <tqtl.h>
#include <tqcolor.h>
#include <tqvaluelist.h>
/**
* @short Represents a sorted list of colours.
*
* The ColourList class holds a list of colours, sorted in RGB value order.
*
* It provides a sorted TQValueList of colours in RGB value order, with iterators
* and other access methods which return either TQRgb or TQColor objects.
*
* @author David Jarvie <software@astrojar.org.uk>
*/
class ColourList
{
public:
typedef size_t size_type;
typedef TQValueListConstIterator<TQRgb> const_iterator;
/** Constructs an empty list. */
ColourList() { }
/** Copy constructor. */
ColourList(const ColourList& l) : mList(l.mList) { }
/** Constructs a list whose values are preset to the colours in @p list. */
ColourList(const TQValueList<TQRgb>& list) : mList(list) { qHeapSort(mList); }
/** Constructs a list whose values are preset to the colours in the @p list.
* Terminate @p list by an invalid colour.
*/
ColourList(const TQColor* list);
/** Assignment operator. */
ColourList& operator=(const ColourList& l) { mList = l.mList; return *this; }
/** Sets the list to comprise the colours in @p list. */
ColourList& operator=(const TQValueList<TQRgb>& list) { mList = list; qHeapSort(mList); return *this; }
/** Removes all values from the list. */
void clear() { mList.clear(); }
/** Adds the specified colour @p c to the list. */
void insert(const TQColor& c);
/** Removes the colour @p c from the list. */
void remove(const TQColor& c) { mList.remove(c.rgb()); }
/** Adds the specified colour @p c to the list. */
ColourList& operator+=(const TQColor& c) { insert(c); return *this; }
/** Adds the colours in @p list to this list. */
ColourList& operator+=(const ColourList& list) { mList += list.mList; qHeapSort(mList); return *this; }
/** Returns true if the colours in the two lists are the same. */
bool operator==(const ColourList& l) const { return mList == l.mList; }
/** Returns true if the colours in the two lists differ. */
bool operator!=(const ColourList& l) const { return mList != l.mList; }
/** Returns the number of colours in the list. */
size_type count() const { return mList.count(); }
/** Returns true if the list is empty. */
bool isEmpty() const { return mList.isEmpty(); }
/** Returns an iterator pointing to the first colour in the list. */
const_iterator begin() const { return mList.begin(); }
/** Returns an iterator pointing past the last colour in the list. */
const_iterator end() const { return mList.end(); }
/** Returns an iterator pointing to the last colour in the list, or end() if the list is empty. */
const_iterator fromLast() const { return mList.fromLast(); }
/** Returns an iterator pointing to the colour at position @p i in the list. */
const_iterator at(size_type i) const { return mList.at(i); }
/** Returns true if the list contains the colour @p c. */
size_type contains(const TQColor& c) const { return mList.contains(c.rgb()); }
/** Returns an iterator pointing to the first occurrence of colour @p c in the list.
* Returns end() if colour @p c is not in the list.
*/
const_iterator find(const TQColor& c) const { return mList.find(c.rgb()); }
/** Returns an iterator pointing to the first occurrence of colour @p c in the list, starting.
* from position @p it. Returns end() if colour @p c is not in the list.
*/
const_iterator find(const_iterator it, const TQColor& c) const { return mList.find(it, c.rgb()); }
/** Returns the index to the first occurrence of colour @p c in the list.
* Returns -1 if colour @p c is not in the list.
*/
int findIndex(const TQColor& c) const { return mList.findIndex(c.rgb()); }
/** Returns the first colour in the list. If the list is empty, the result is undefined. */
TQColor first() const { return TQColor(mList.first()); }
/** Returns the last colour in the list. If the list is empty, the result is undefined. */
TQColor last() const { return TQColor(mList.last()); }
/** Returns the colour at position @p i in the list. If the item does not exist, the result is undefined. */
TQColor operator[](size_type i) const { return TQColor(mList[i]); }
private:
void sort();
TQValueList<TQRgb> mList;
};
#endif // COLOURLIST_H
|
