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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
// -*- Mode: C++; c-basic-offset: 4; indent-tabs-mode: nil; tab-width: 8; -*-
/* This file is part of the KDE project
Copyright (C) 2004 Esben Mose Hansen <kde@mosehansen.dk>
Copyright (C) Andrew Stanley-Jones
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; see the file COPYING. If not, write to
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301, USA.
*/
#ifndef _HISTORY_H_
#define _HISTORY_H_
#include <tqobject.h>
#include <tqptrlist.h>
#include "historyitem.h"
class KlipperPopup;
class TQPopupMenu;
class TQWidget;
class QptrListIterator;
class History : public TQObject
{
Q_OBJECT
public:
History( TQWidget* parent, const char* name );
~History();
/**
* Iterator for history
*/
typedef TQPtrListIterator<HistoryItem> iterator;
/**
* Return (toplevel) popup menu (or default view, of you like)
*/
KlipperPopup* popup();
/**
* Inserts item into clipboard history top
* if duplicate entry exist, the older duplicate is deleted.
* The duplicate concept is "deep", so that two text string
* are considerd duplicate if identical.
*/
void insert( const HistoryItem* item );
/**
* Inserts item into clipboard without any checks
* Used when restoring a saved history and internally.
* Don't use this unless you're reasonable certain
* that no duplicates are introduced
*/
void forceInsert( const HistoryItem* item );
/**
* Remove (first) history item equal to item from history
*/
void remove( const HistoryItem* item );
/**
* Traversal: Get first item
*/
const HistoryItem* first();
/**
* Traversal: Get current item
*/
const HistoryItem* next();
/**
* Get an iterator pointing to the first (most recent) item
* This iterator should probably be a constant iterator, but
* the QTL doesn't support this easily.
*
* Anyway, if you modify the items via. the iterator, call changed()
* when you're done. Calling changed() multiple times doesn't hurt.
*
* iterator could be made into a proxy class that did the right thing.
*/
iterator youngest();
/**
* True if no history items
*/
bool empty() const { return itemList.isEmpty(); }
/**
* Set maximum history size
*/
void max_size( unsigned max_size );
/**
* Get the maximum history size
*/
unsigned max_size() const { return m_max_size; }
/**
* returns true if the user has selected the top item
*/
bool topIsUserSelected() {
return m_topIsUserSelected;
}
public slots:
/**
* move the history in position pos to top
*/
void slotMoveToTop(int pos );
/**
* Clear history
*/
void slotClear();
signals:
void changed();
/**
* Emitted when the first history item has changed.
*/
void topChanged();
private:
/**
* The history
*/
TQPtrList<HistoryItem> itemList;
/**
* ensure that the number of items does not exceed max_size()
* Deletes items from the end as neccessary.
*/
void trim();
private:
/**
* "Default view" --- a popupmenu containing the clipboard history.
*/
KlipperPopup* m_popup;
/**
* The number of clipboard items stored.
*/
unsigned m_max_size;
/**
* True if the top is selected by the user
*/
bool m_topIsUserSelected;
};
inline const HistoryItem* History::first() { return itemList.first(); }
inline const HistoryItem* History::next() { return itemList.next(); }
#endif
|
