colourlist.h

/*
 *  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>
 
 
class ColourList
{
    public:
        typedef size_t  size_type;
        typedef TQValueListConstIterator<TQRgb>  const_iterator;
 
        ColourList()  { }
        ColourList(const ColourList& l)       : mList(l.mList) { }
        ColourList(const TQValueList<TQRgb>& list) : mList(list) { qHeapSort(mList); }
        ColourList(const TQColor* list);
        ColourList&    operator=(const ColourList& l)        { mList = l.mList;  return *this; }
        ColourList&    operator=(const TQValueList<TQRgb>& list) { mList = list;  qHeapSort(mList);  return *this; }
        void           clear()                               { mList.clear(); }
        void           insert(const TQColor& c);
        void           remove(const TQColor& c)               { mList.remove(c.rgb()); }
        ColourList&    operator+=(const TQColor& c)           { insert(c);  return *this; }
        ColourList&    operator+=(const ColourList& list)    { mList += list.mList;  qHeapSort(mList);  return *this; }
        bool           operator==(const ColourList& l) const { return mList == l.mList; }
        bool           operator!=(const ColourList& l) const { return mList != l.mList; }
        size_type      count() const                         { return mList.count(); }
        bool           isEmpty() const                       { return mList.isEmpty(); }
        const_iterator begin() const                         { return mList.begin(); }
        const_iterator end() const                           { return mList.end(); }
        const_iterator fromLast() const                      { return mList.fromLast(); }
        const_iterator at(size_type i) const                 { return mList.at(i); }
        size_type      contains(const TQColor& c) const       { return mList.contains(c.rgb()); }
        const_iterator find(const TQColor& c) const           { return mList.find(c.rgb()); }
        const_iterator find(const_iterator it, const TQColor& c) const   { return mList.find(it, c.rgb()); }
        int            findIndex(const TQColor& c) const      { return mList.findIndex(c.rgb()); }
        TQColor         first() const                         { return TQColor(mList.first()); }
        TQColor         last() const                          { return TQColor(mList.last()); }
        TQColor         operator[](size_type i) const         { return TQColor(mList[i]); }
    private:
        void              sort();
        TQValueList<TQRgb>  mList;
};
 
#endif // COLOURLIST_H