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
|
/*
This file is part of KOrganizer.
Copyright (c) 2002 Cornelius Schumacher <schumacher@kde.org>
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.
As a special exception, permission is given to link this program
with any edition of TQt, and distribute the resulting executable,
without including the source code for TQt in the source distribution.
*/
#ifndef CUSTOMLISTVIEWITEM_H
#define CUSTOMLISTVIEWITEM_H
#include <tqmap.h>
#include <tqstring.h>
#include <klistview.h>
template<class T>
class CustomListViewItem : public KListViewItem
{
public:
CustomListViewItem( T data, KListView *tqparent ) :
KListViewItem( tqparent ), mData( data ) { updateItem(); };
CustomListViewItem( T data, KListView *tqparent, KListViewItem* after ) :
KListViewItem( tqparent, after ), mData( data ) { updateItem(); };
~CustomListViewItem() {};
void updateItem() {};
T data() const { return mData; }
TQString key(int column, bool) const
{
TQMap<int,TQString>::ConstIterator it = mKeyMap.find(column);
if (it == mKeyMap.end()) return text(column);
else return *it;
}
void setSortKey(int column,const TQString &key)
{
mKeyMap.insert(column,key);
}
private:
T mData;
TQMap<int,TQString> mKeyMap;
};
#endif
|
