You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
175 lines
4.9 KiB
175 lines
4.9 KiB
/***************************************************************************
|
|
gui_list_helper.h
|
|
-------------------
|
|
begin : Son Sep 26 2004
|
|
copyright : (C) 2004 by Martin Witte
|
|
email : witte@kawo1.rwth-aachen.de
|
|
***************************************************************************/
|
|
|
|
/***************************************************************************
|
|
* *
|
|
* 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. *
|
|
* *
|
|
***************************************************************************/
|
|
|
|
#ifndef _KRADIO_LIBKRADIO_GUI_GUI_LIST_HELPER_H_
|
|
#define _KRADIO_LIBKRADIO_GUI_GUI_LIST_HELPER_H_
|
|
|
|
#include <tqmap.h>
|
|
#include <tqvaluelist.h>
|
|
|
|
|
|
template <class TLIST> class GUISimpleListHelper
|
|
{
|
|
public:
|
|
GUISimpleListHelper(TLIST *list) : m_List(list) {}
|
|
~GUISimpleListHelper() {}
|
|
|
|
void setData(const TQValueList<TQString> &data);
|
|
TQString getCurrentText() const { return m_List->currentText(); }
|
|
void setCurrentText(const TQString &s) { m_List->setCurrentItem(m_revData.contains(s) ? m_revData[s] : 0); }
|
|
|
|
int count() const { return m_revData.count(); }
|
|
bool contains(const TQString &id) const { return m_revData.contains(id); }
|
|
|
|
protected:
|
|
TLIST *m_List;
|
|
TQMap<TQString, int> m_revData;
|
|
};
|
|
|
|
|
|
template <class TLIST>
|
|
void GUISimpleListHelper<TLIST>::setData(const TQValueList<TQString> &data)
|
|
{
|
|
m_List->clear();
|
|
m_revData.clear();
|
|
|
|
TQValueListConstIterator<TQString> it = data.begin();
|
|
TQValueListConstIterator<TQString> end = data.end();
|
|
for (int i = 0; it != end; ++it, ++i) {
|
|
m_revData[*it] = i;
|
|
m_List->insertItem(*it);
|
|
}
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
template <class TLIST, class TID> class GUIListHelper
|
|
{
|
|
public:
|
|
enum SORT_KEY { SORT_BY_ID, SORT_BY_DESCR };
|
|
|
|
GUIListHelper(TLIST *list, SORT_KEY skey);
|
|
GUIListHelper(TLIST *list, const TQMap<TID, TQString> &data, SORT_KEY skey);
|
|
~GUIListHelper();
|
|
|
|
void setData(const TQMap<TID, TQString> &data);
|
|
|
|
void setCurrentItem(const TID &) const;
|
|
const TID &getCurrentItem() const;
|
|
|
|
int count() const { return m_Index2ID.count(); }
|
|
|
|
bool contains(const TID &id) const { return m_ID2Index.contains(id); }
|
|
|
|
protected:
|
|
SORT_KEY m_skey;
|
|
TLIST *m_List;
|
|
TQMap<int, TID> m_Index2ID;
|
|
TQMap<TID, int> m_ID2Index;
|
|
TQMap<TID, TQString> m_ID2Description;
|
|
|
|
struct THelpData {
|
|
TID id;
|
|
TQString descr;
|
|
SORT_KEY skey;
|
|
|
|
THelpData() : id(), descr(), skey(SORT_BY_ID) {}
|
|
THelpData(TID _id, const TQString &_descr, SORT_KEY _skey)
|
|
: id(_id),
|
|
descr(_descr),
|
|
skey(_skey)
|
|
{}
|
|
bool operator > (const THelpData &d) { return (skey == SORT_BY_ID) ? id > d.id : descr > d.descr; }
|
|
bool operator < (const THelpData &d) { return (skey == SORT_BY_ID) ? id < d.id : descr < d.descr; }
|
|
};
|
|
};
|
|
|
|
|
|
|
|
template <class TLIST, class TID>
|
|
GUIListHelper<TLIST, TID>::GUIListHelper(TLIST *list, SORT_KEY skey)
|
|
: m_skey(skey),
|
|
m_List(list)
|
|
{
|
|
}
|
|
|
|
|
|
template <class TLIST, class TID>
|
|
GUIListHelper<TLIST, TID>::GUIListHelper(TLIST *list, const TQMap<TID, TQString> &data, SORT_KEY skey)
|
|
: m_skey(skey),
|
|
m_List(list)
|
|
{
|
|
setData(data);
|
|
}
|
|
|
|
|
|
template <class TLIST, class TID>
|
|
GUIListHelper<TLIST, TID>::~GUIListHelper()
|
|
{
|
|
}
|
|
|
|
|
|
template <class TLIST, class TID>
|
|
void GUIListHelper<TLIST, TID>::setData (const TQMap<TID, TQString> &data)
|
|
{
|
|
m_List->clear();
|
|
|
|
m_ID2Description = data;
|
|
TQValueList<THelpData> help_list;
|
|
TQMapConstIterator<TID, TQString> end = data.end();
|
|
for (TQMapConstIterator<TID, TQString> it = data.begin(); it != end; ++it) {
|
|
help_list.push_back(THelpData(it.key(), *it, m_skey));
|
|
}
|
|
qHeapSort(help_list);
|
|
|
|
m_Index2ID.clear();
|
|
m_ID2Index.clear();
|
|
|
|
int idx = 0;
|
|
TQValueListIterator<THelpData> end_hlp = help_list.end();
|
|
for (TQValueListIterator<THelpData> it = help_list.begin(); it != end_hlp; ++it, ++idx) {
|
|
m_Index2ID.insert(idx, (*it).id);
|
|
m_ID2Index.insert((*it).id, idx);
|
|
m_List->insertItem((*it).descr);
|
|
}
|
|
}
|
|
|
|
|
|
template <class TLIST, class TID>
|
|
void GUIListHelper<TLIST, TID>::setCurrentItem(const TID &id) const
|
|
{
|
|
if (m_ID2Index.contains(id))
|
|
m_List->setCurrentItem(m_ID2Index[id]);
|
|
else
|
|
m_List->setCurrentItem(0);
|
|
}
|
|
|
|
template <class TLIST, class TID>
|
|
const TID &GUIListHelper<TLIST, TID>::getCurrentItem() const
|
|
{
|
|
int idx = m_List->currentItem();
|
|
return m_Index2ID[idx];
|
|
}
|
|
|
|
#endif
|