-rw-r--r-- | kaddressbook/typecombo.h | 193 |
1 files changed, 193 insertions, 0 deletions
diff --git a/kaddressbook/typecombo.h b/kaddressbook/typecombo.h new file mode 100644 index 0000000..191273d --- a/dev/null +++ b/kaddressbook/typecombo.h | |||
@@ -0,0 +1,193 @@ | |||
1 | /* | ||
2 | This file is part of KAddressBook. | ||
3 | Copyright (c) 2002 Cornelius Schumacher <schumacher@kde.org> | ||
4 | |||
5 | This program is free software; you can redistribute it and/or modify | ||
6 | it under the terms of the GNU General Public License as published by | ||
7 | the Free Software Foundation; either version 2 of the License, or | ||
8 | (at your option) any later version. | ||
9 | |||
10 | This program is distributed in the hope that it will be useful, | ||
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | ||
13 | GNU General Public License for more details. | ||
14 | |||
15 | You should have received a copy of the GNU General Public License | ||
16 | along with this program; if not, write to the Free Software | ||
17 | Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. | ||
18 | |||
19 | As a special exception, permission is given to link this program | ||
20 | with any edition of Qt, and distribute the resulting executable, | ||
21 | without including the source code for Qt in the source distribution. | ||
22 | */ | ||
23 | |||
24 | #ifndef TYPECOMBO_H | ||
25 | #define TYPECOMBO_H | ||
26 | |||
27 | #include <kabc/phonenumber.h> | ||
28 | #include <kcombobox.h> | ||
29 | |||
30 | /** | ||
31 | Combo box for type information of Addresses and Phone numbers. | ||
32 | */ | ||
33 | template <class T> | ||
34 | class TypeCombo : public KComboBox | ||
35 | { | ||
36 | public: | ||
37 | typedef typename T::List List; | ||
38 | typedef typename T::List::Iterator Iterator; | ||
39 | |||
40 | TypeCombo( List &list, QWidget *parent, const char *name = 0 ); | ||
41 | |||
42 | void setLineEdit( QLineEdit *edit ) { mLineEdit = edit; } | ||
43 | QLineEdit *lineEdit() const { return mLineEdit; } | ||
44 | |||
45 | void updateTypes(); | ||
46 | |||
47 | void selectType( int type ); | ||
48 | |||
49 | int selectedType(); | ||
50 | |||
51 | Iterator selectedElement(); | ||
52 | |||
53 | void insertType( const List &list, int type, | ||
54 | const T &defaultObject ); | ||
55 | void insertTypeList( const List &list ); | ||
56 | |||
57 | bool hasType( int type ); | ||
58 | |||
59 | private: | ||
60 | List &mTypeList; | ||
61 | QLineEdit *mLineEdit; | ||
62 | }; | ||
63 | |||
64 | template <class T> | ||
65 | #ifdef _WIN32_ | ||
66 | TypeCombo<T>::TypeCombo( typename TypeCombo::List &list, QWidget *parent, | ||
67 | #else | ||
68 | TypeCombo<T>::TypeCombo( TypeCombo::List &list, QWidget *parent, | ||
69 | |||
70 | #endif | ||
71 | const char *name ) | ||
72 | : KComboBox( parent), | ||
73 | //US my kde version has no KComboBox constructor witgh two parameters | ||
74 | //US : KComboBox( parent, name ), | ||
75 | mTypeList( list ) | ||
76 | { | ||
77 | } | ||
78 | |||
79 | template <class T> | ||
80 | void TypeCombo<T>::updateTypes() | ||
81 | { | ||
82 | // Remember current item | ||
83 | QString currentId; | ||
84 | int current = currentItem(); | ||
85 | if ( current >= 0 ) currentId = mTypeList[ current ].id(); | ||
86 | |||
87 | clear(); | ||
88 | |||
89 | QMap<int,int> labelCount; | ||
90 | |||
91 | uint i; | ||
92 | for( i = 0; i < mTypeList.count(); ++i ) { | ||
93 | int type = ( mTypeList[ i ].type() & ~( T::Pref ) ); | ||
94 | QString label = mTypeList[ i ].typeLabel( type ); | ||
95 | int count = 1; | ||
96 | if ( labelCount.contains( type ) ) { | ||
97 | count = labelCount[ type ] + 1; | ||
98 | } | ||
99 | labelCount[ type ] = count; | ||
100 | if ( count > 1 ) { | ||
101 | label = i18n("label (number)", "%1 (%2)").arg( label ) | ||
102 | .arg( QString::number( count ) ); | ||
103 | } | ||
104 | insertItem( label ); | ||
105 | } | ||
106 | |||
107 | // Restore previous current item | ||
108 | if ( !currentId.isEmpty() ) { | ||
109 | for( i = 0; i < mTypeList.count(); ++i ) { | ||
110 | if ( mTypeList[ i ].id() == currentId ) { | ||
111 | setCurrentItem( i ); | ||
112 | break; | ||
113 | } | ||
114 | } | ||
115 | } | ||
116 | } | ||
117 | |||
118 | template <class T> | ||
119 | void TypeCombo<T>::selectType( int type ) | ||
120 | { | ||
121 | uint i; | ||
122 | for( i = 0; i < mTypeList.count(); ++i ) { | ||
123 | if ( (mTypeList[ i ].type() & ~T::Pref) == type ) { | ||
124 | setCurrentItem( i ); | ||
125 | break; | ||
126 | } | ||
127 | } | ||
128 | } | ||
129 | |||
130 | template <class T> | ||
131 | int TypeCombo<T>::selectedType() | ||
132 | { | ||
133 | return mTypeList[ currentItem() ].type(); | ||
134 | } | ||
135 | |||
136 | template <class T> | ||
137 | typename TypeCombo<T>::Iterator TypeCombo<T>::selectedElement() | ||
138 | { | ||
139 | return mTypeList.at( currentItem() ); | ||
140 | } | ||
141 | |||
142 | template <class T> | ||
143 | #ifdef _WIN32_ | ||
144 | void TypeCombo<T>::insertType( typename const TypeCombo::List &list, int type, | ||
145 | #else | ||
146 | void TypeCombo<T>::insertType( const TypeCombo::List &list, int type, | ||
147 | #endif | ||
148 | const T &defaultObject ) | ||
149 | { | ||
150 | uint i; | ||
151 | for ( i = 0; i < list.count(); ++i ) { | ||
152 | if ( list[ i ].type() == type ) { | ||
153 | mTypeList.append( list[ i ] ); | ||
154 | break; | ||
155 | } | ||
156 | } | ||
157 | if ( i == list.count() ) { | ||
158 | mTypeList.append( defaultObject ); | ||
159 | } | ||
160 | } | ||
161 | |||
162 | template <class T> | ||
163 | #ifdef _WIN32_ | ||
164 | void TypeCombo<T>::insertTypeList( typename const TypeCombo::List &list ) | ||
165 | #else | ||
166 | void TypeCombo<T>::insertTypeList( const TypeCombo::List &list ) | ||
167 | |||
168 | #endif | ||
169 | { | ||
170 | uint i; | ||
171 | for ( i = 0; i < list.count(); ++i ) { | ||
172 | uint j; | ||
173 | for( j = 0; j < mTypeList.count(); ++j ) { | ||
174 | if ( list[ i ].id() == mTypeList[ j ].id() ) break; | ||
175 | } | ||
176 | if ( j == mTypeList.count() ) { | ||
177 | mTypeList.append( list[ i ] ); | ||
178 | } | ||
179 | } | ||
180 | } | ||
181 | |||
182 | template <class T> | ||
183 | bool TypeCombo<T>::hasType( int type ) | ||
184 | { | ||
185 | for( uint i = 0; i < mTypeList.count(); ++i ) { | ||
186 | if ( ( mTypeList[ i ].type() & ~T::Pref ) == type ) | ||
187 | return true; | ||
188 | } | ||
189 | |||
190 | return false; | ||
191 | } | ||
192 | |||
193 | #endif | ||