-rw-r--r-- | libkcal/incidence.cpp | 35 |
1 files changed, 34 insertions, 1 deletions
diff --git a/libkcal/incidence.cpp b/libkcal/incidence.cpp index f9e1e9e..dbc159c 100644 --- a/libkcal/incidence.cpp +++ b/libkcal/incidence.cpp | |||
@@ -1,300 +1,333 @@ | |||
1 | /* | 1 | /* |
2 | This file is part of libkcal. | 2 | This file is part of libkcal. |
3 | Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org> | 3 | Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org> |
4 | 4 | ||
5 | This library is free software; you can redistribute it and/or | 5 | This library is free software; you can redistribute it and/or |
6 | modify it under the terms of the GNU Library General Public | 6 | modify it under the terms of the GNU Library General Public |
7 | License as published by the Free Software Foundation; either | 7 | License as published by the Free Software Foundation; either |
8 | version 2 of the License, or (at your option) any later version. | 8 | version 2 of the License, or (at your option) any later version. |
9 | 9 | ||
10 | This library is distributed in the hope that it will be useful, | 10 | This library is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | 11 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | 12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
13 | Library General Public License for more details. | 13 | Library General Public License for more details. |
14 | 14 | ||
15 | You should have received a copy of the GNU Library General Public License | 15 | You should have received a copy of the GNU Library General Public License |
16 | along with this library; see the file COPYING.LIB. If not, write to | 16 | along with this library; see the file COPYING.LIB. If not, write to |
17 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, | 17 | the Free Software Foundation, Inc., 59 Temple Place - Suite 330, |
18 | Boston, MA 02111-1307, USA. | 18 | Boston, MA 02111-1307, USA. |
19 | */ | 19 | */ |
20 | 20 | ||
21 | #include <kglobal.h> | 21 | #include <kglobal.h> |
22 | #include <klocale.h> | 22 | #include <klocale.h> |
23 | #include <kdebug.h> | 23 | #include <kdebug.h> |
24 | 24 | ||
25 | #include "calformat.h" | 25 | #include "calformat.h" |
26 | 26 | ||
27 | #include "incidence.h" | 27 | #include "incidence.h" |
28 | #include "todo.h" | 28 | #include "todo.h" |
29 | 29 | ||
30 | using namespace KCal; | 30 | using namespace KCal; |
31 | 31 | ||
32 | Incidence::Incidence() : | 32 | Incidence::Incidence() : |
33 | IncidenceBase(), | 33 | IncidenceBase(), |
34 | mRelatedTo(0), mSecrecy(SecrecyPublic), mPriority(3) | 34 | mRelatedTo(0), mSecrecy(SecrecyPublic), mPriority(3) |
35 | { | 35 | { |
36 | mRecurrence = new Recurrence(this); | 36 | mRecurrence = new Recurrence(this); |
37 | mCancelled = false; | 37 | mCancelled = false; |
38 | recreate(); | 38 | recreate(); |
39 | mHasStartDate = true; | 39 | mHasStartDate = true; |
40 | mAlarms.setAutoDelete(true); | 40 | mAlarms.setAutoDelete(true); |
41 | mAttachments.setAutoDelete(true); | 41 | mAttachments.setAutoDelete(true); |
42 | mHasRecurrenceID = false; | ||
42 | } | 43 | } |
43 | 44 | ||
44 | Incidence::Incidence( const Incidence &i ) : IncidenceBase( i ) | 45 | Incidence::Incidence( const Incidence &i ) : IncidenceBase( i ) |
45 | { | 46 | { |
46 | // TODO: reenable attributes currently commented out. | 47 | // TODO: reenable attributes currently commented out. |
47 | mRevision = i.mRevision; | 48 | mRevision = i.mRevision; |
48 | mCreated = i.mCreated; | 49 | mCreated = i.mCreated; |
49 | mDescription = i.mDescription; | 50 | mDescription = i.mDescription; |
50 | mSummary = i.mSummary; | 51 | mSummary = i.mSummary; |
51 | mCategories = i.mCategories; | 52 | mCategories = i.mCategories; |
52 | // Incidence *mRelatedTo; Incidence *mRelatedTo; | 53 | // Incidence *mRelatedTo; Incidence *mRelatedTo; |
53 | mRelatedTo = 0; | 54 | mRelatedTo = 0; |
54 | mRelatedToUid = i.mRelatedToUid; | 55 | mRelatedToUid = i.mRelatedToUid; |
55 | // QPtrList<Incidence> mRelations; QPtrList<Incidence> mRelations; | 56 | // QPtrList<Incidence> mRelations; QPtrList<Incidence> mRelations; |
56 | mExDates = i.mExDates; | 57 | mExDates = i.mExDates; |
57 | mAttachments = i.mAttachments; | 58 | mAttachments = i.mAttachments; |
58 | mResources = i.mResources; | 59 | mResources = i.mResources; |
59 | mSecrecy = i.mSecrecy; | 60 | mSecrecy = i.mSecrecy; |
60 | mPriority = i.mPriority; | 61 | mPriority = i.mPriority; |
61 | mLocation = i.mLocation; | 62 | mLocation = i.mLocation; |
62 | mCancelled = i.mCancelled; | 63 | mCancelled = i.mCancelled; |
63 | mHasStartDate = i.mHasStartDate; | 64 | mHasStartDate = i.mHasStartDate; |
64 | QPtrListIterator<Alarm> it( i.mAlarms ); | 65 | QPtrListIterator<Alarm> it( i.mAlarms ); |
65 | const Alarm *a; | 66 | const Alarm *a; |
66 | while( (a = it.current()) ) { | 67 | while( (a = it.current()) ) { |
67 | Alarm *b = new Alarm( *a ); | 68 | Alarm *b = new Alarm( *a ); |
68 | b->setParent( this ); | 69 | b->setParent( this ); |
69 | mAlarms.append( b ); | 70 | mAlarms.append( b ); |
70 | 71 | ||
71 | ++it; | 72 | ++it; |
72 | } | 73 | } |
73 | mAlarms.setAutoDelete(true); | 74 | mAlarms.setAutoDelete(true); |
74 | 75 | mHasRecurrenceID = i.mHasRecurrenceID; | |
76 | mRecurrenceID = i.mRecurrenceID; | ||
75 | mRecurrence = new Recurrence( *(i.mRecurrence), this ); | 77 | mRecurrence = new Recurrence( *(i.mRecurrence), this ); |
76 | } | 78 | } |
77 | 79 | ||
78 | Incidence::~Incidence() | 80 | Incidence::~Incidence() |
79 | { | 81 | { |
80 | 82 | ||
81 | Incidence *ev; | 83 | Incidence *ev; |
82 | QPtrList<Incidence> Relations = relations(); | 84 | QPtrList<Incidence> Relations = relations(); |
83 | for (ev=Relations.first();ev;ev=Relations.next()) { | 85 | for (ev=Relations.first();ev;ev=Relations.next()) { |
84 | if (ev->relatedTo() == this) ev->setRelatedTo(0); | 86 | if (ev->relatedTo() == this) ev->setRelatedTo(0); |
85 | } | 87 | } |
86 | if (relatedTo()) relatedTo()->removeRelation(this); | 88 | if (relatedTo()) relatedTo()->removeRelation(this); |
87 | delete mRecurrence; | 89 | delete mRecurrence; |
88 | 90 | ||
89 | } | 91 | } |
92 | bool Incidence::hasRecurrenceID() const | ||
93 | { | ||
94 | return mHasRecurrenceID; | ||
95 | } | ||
96 | |||
97 | void Incidence::setHasRecurrenceID( bool b ) | ||
98 | { | ||
99 | mHasRecurrenceID = b; | ||
100 | } | ||
101 | |||
102 | void Incidence::setRecurrenceID(QDateTime d) | ||
103 | { | ||
104 | mRecurrenceID = d; | ||
105 | mHasRecurrenceID = true; | ||
106 | updated(); | ||
107 | } | ||
108 | QDateTime Incidence::recurrenceID () const | ||
109 | { | ||
110 | return mRecurrenceID; | ||
111 | } | ||
90 | 112 | ||
91 | bool Incidence::cancelled() const | 113 | bool Incidence::cancelled() const |
92 | { | 114 | { |
93 | return mCancelled; | 115 | return mCancelled; |
94 | } | 116 | } |
95 | void Incidence::setCancelled( bool b ) | 117 | void Incidence::setCancelled( bool b ) |
96 | { | 118 | { |
97 | mCancelled = b; | 119 | mCancelled = b; |
98 | updated(); | 120 | updated(); |
99 | } | 121 | } |
100 | bool Incidence::hasStartDate() const | 122 | bool Incidence::hasStartDate() const |
101 | { | 123 | { |
102 | return mHasStartDate; | 124 | return mHasStartDate; |
103 | } | 125 | } |
104 | 126 | ||
105 | void Incidence::setHasStartDate(bool f) | 127 | void Incidence::setHasStartDate(bool f) |
106 | { | 128 | { |
107 | if (mReadOnly) return; | 129 | if (mReadOnly) return; |
108 | mHasStartDate = f; | 130 | mHasStartDate = f; |
109 | updated(); | 131 | updated(); |
110 | } | 132 | } |
111 | 133 | ||
112 | // A string comparison that considers that null and empty are the same | 134 | // A string comparison that considers that null and empty are the same |
113 | static bool stringCompare( const QString& s1, const QString& s2 ) | 135 | static bool stringCompare( const QString& s1, const QString& s2 ) |
114 | { | 136 | { |
115 | if ( s1.isEmpty() && s2.isEmpty() ) | 137 | if ( s1.isEmpty() && s2.isEmpty() ) |
116 | return true; | 138 | return true; |
117 | return s1 == s2; | 139 | return s1 == s2; |
118 | } | 140 | } |
119 | 141 | ||
120 | bool KCal::operator==( const Incidence& i1, const Incidence& i2 ) | 142 | bool KCal::operator==( const Incidence& i1, const Incidence& i2 ) |
121 | { | 143 | { |
122 | 144 | ||
123 | if( i1.alarms().count() != i2.alarms().count() ) { | 145 | if( i1.alarms().count() != i2.alarms().count() ) { |
124 | return false; // no need to check further | 146 | return false; // no need to check further |
125 | } | 147 | } |
126 | if ( i1.alarms().count() > 0 ) { | 148 | if ( i1.alarms().count() > 0 ) { |
127 | if ( !( *(i1.alarms().first()) == *(i2.alarms().first())) ) | 149 | if ( !( *(i1.alarms().first()) == *(i2.alarms().first())) ) |
128 | { | 150 | { |
129 | qDebug("alarm not equal "); | 151 | qDebug("alarm not equal "); |
130 | return false; | 152 | return false; |
131 | } | 153 | } |
132 | } | 154 | } |
133 | #if 0 | 155 | #if 0 |
134 | QPtrListIterator<Alarm> a1( i1.alarms() ); | 156 | QPtrListIterator<Alarm> a1( i1.alarms() ); |
135 | QPtrListIterator<Alarm> a2( i2.alarms() ); | 157 | QPtrListIterator<Alarm> a2( i2.alarms() ); |
136 | for( ; a1.current() && a2.current(); ++a1, ++a2 ) { | 158 | for( ; a1.current() && a2.current(); ++a1, ++a2 ) { |
137 | if( *a1.current() == *a2.current() ) { | 159 | if( *a1.current() == *a2.current() ) { |
138 | continue; | 160 | continue; |
139 | } | 161 | } |
140 | else { | 162 | else { |
141 | return false; | 163 | return false; |
142 | } | 164 | } |
143 | } | 165 | } |
144 | #endif | 166 | #endif |
145 | 167 | ||
168 | if ( i1.hasRecurrenceID() == i2.hasRecurrenceID() ) { | ||
169 | if ( i1.hasRecurrenceID() ) { | ||
170 | if ( i1.recurrenceID() != i2.recurrenceID() ) | ||
171 | return false; | ||
172 | } | ||
173 | |||
174 | } else { | ||
175 | return false; | ||
176 | } | ||
177 | |||
146 | if ( ! operator==( (const IncidenceBase&)i1, (const IncidenceBase&)i2 ) ) | 178 | if ( ! operator==( (const IncidenceBase&)i1, (const IncidenceBase&)i2 ) ) |
147 | return false; | 179 | return false; |
148 | if ( i1.hasStartDate() == i2.hasStartDate() ) { | 180 | if ( i1.hasStartDate() == i2.hasStartDate() ) { |
149 | if ( i1.hasStartDate() ) { | 181 | if ( i1.hasStartDate() ) { |
150 | if ( i1.dtStart() != i2.dtStart() ) | 182 | if ( i1.dtStart() != i2.dtStart() ) |
151 | return false; | 183 | return false; |
152 | } | 184 | } |
153 | } else { | 185 | } else { |
154 | return false; | 186 | return false; |
155 | } | 187 | } |
156 | if (!( *i1.recurrence() == *i2.recurrence()) ) { | 188 | if (!( *i1.recurrence() == *i2.recurrence()) ) { |
157 | qDebug("recurrence is NOT equal "); | 189 | qDebug("recurrence is NOT equal "); |
158 | return false; | 190 | return false; |
159 | } | 191 | } |
160 | return | 192 | return |
161 | // i1.created() == i2.created() && | 193 | // i1.created() == i2.created() && |
162 | stringCompare( i1.description(), i2.description() ) && | 194 | stringCompare( i1.description(), i2.description() ) && |
163 | stringCompare( i1.summary(), i2.summary() ) && | 195 | stringCompare( i1.summary(), i2.summary() ) && |
164 | i1.categories() == i2.categories() && | 196 | i1.categories() == i2.categories() && |
165 | // no need to compare mRelatedTo | 197 | // no need to compare mRelatedTo |
166 | stringCompare( i1.relatedToUid(), i2.relatedToUid() ) && | 198 | stringCompare( i1.relatedToUid(), i2.relatedToUid() ) && |
167 | // i1.relations() == i2.relations() && | 199 | // i1.relations() == i2.relations() && |
168 | i1.exDates() == i2.exDates() && | 200 | i1.exDates() == i2.exDates() && |
169 | i1.attachments() == i2.attachments() && | 201 | i1.attachments() == i2.attachments() && |
170 | i1.resources() == i2.resources() && | 202 | i1.resources() == i2.resources() && |
171 | i1.secrecy() == i2.secrecy() && | 203 | i1.secrecy() == i2.secrecy() && |
172 | i1.priority() == i2.priority() && | 204 | i1.priority() == i2.priority() && |
205 | i1.cancelled() == i2.cancelled() && | ||
173 | stringCompare( i1.location(), i2.location() ); | 206 | stringCompare( i1.location(), i2.location() ); |
174 | } | 207 | } |
175 | 208 | ||
176 | Incidence* Incidence::recreateCloneException( QDate d ) | 209 | Incidence* Incidence::recreateCloneException( QDate d ) |
177 | { | 210 | { |
178 | Incidence* newInc = clone(); | 211 | Incidence* newInc = clone(); |
179 | newInc->recreate(); | 212 | newInc->recreate(); |
180 | if ( doesRecur() ) { | 213 | if ( doesRecur() ) { |
181 | addExDate( d ); | 214 | addExDate( d ); |
182 | newInc->recurrence()->unsetRecurs(); | 215 | newInc->recurrence()->unsetRecurs(); |
183 | int len = dtStart().secsTo( ((Event*)this)->dtEnd()); | 216 | int len = dtStart().secsTo( ((Event*)this)->dtEnd()); |
184 | QTime tim = dtStart().time(); | 217 | QTime tim = dtStart().time(); |
185 | newInc->setDtStart( QDateTime(d, tim) ); | 218 | newInc->setDtStart( QDateTime(d, tim) ); |
186 | ((Event*)newInc)->setDtEnd( newInc->dtStart().addSecs( len ) ); | 219 | ((Event*)newInc)->setDtEnd( newInc->dtStart().addSecs( len ) ); |
187 | } | 220 | } |
188 | return newInc; | 221 | return newInc; |
189 | } | 222 | } |
190 | 223 | ||
191 | void Incidence::recreate() | 224 | void Incidence::recreate() |
192 | { | 225 | { |
193 | setCreated(QDateTime::currentDateTime()); | 226 | setCreated(QDateTime::currentDateTime()); |
194 | 227 | ||
195 | setUid(CalFormat::createUniqueId()); | 228 | setUid(CalFormat::createUniqueId()); |
196 | 229 | ||
197 | setRevision(0); | 230 | setRevision(0); |
198 | setIDStr( ":" ); | 231 | setIDStr( ":" ); |
199 | setLastModified(QDateTime::currentDateTime()); | 232 | setLastModified(QDateTime::currentDateTime()); |
200 | } | 233 | } |
201 | 234 | ||
202 | void Incidence::setReadOnly( bool readOnly ) | 235 | void Incidence::setReadOnly( bool readOnly ) |
203 | { | 236 | { |
204 | IncidenceBase::setReadOnly( readOnly ); | 237 | IncidenceBase::setReadOnly( readOnly ); |
205 | recurrence()->setRecurReadOnly( readOnly); | 238 | recurrence()->setRecurReadOnly( readOnly); |
206 | } | 239 | } |
207 | 240 | ||
208 | void Incidence::setCreated(QDateTime created) | 241 | void Incidence::setCreated(QDateTime created) |
209 | { | 242 | { |
210 | if (mReadOnly) return; | 243 | if (mReadOnly) return; |
211 | mCreated = getEvenTime(created); | 244 | mCreated = getEvenTime(created); |
212 | } | 245 | } |
213 | 246 | ||
214 | QDateTime Incidence::created() const | 247 | QDateTime Incidence::created() const |
215 | { | 248 | { |
216 | return mCreated; | 249 | return mCreated; |
217 | } | 250 | } |
218 | 251 | ||
219 | void Incidence::setRevision(int rev) | 252 | void Incidence::setRevision(int rev) |
220 | { | 253 | { |
221 | if (mReadOnly) return; | 254 | if (mReadOnly) return; |
222 | mRevision = rev; | 255 | mRevision = rev; |
223 | 256 | ||
224 | updated(); | 257 | updated(); |
225 | } | 258 | } |
226 | 259 | ||
227 | int Incidence::revision() const | 260 | int Incidence::revision() const |
228 | { | 261 | { |
229 | return mRevision; | 262 | return mRevision; |
230 | } | 263 | } |
231 | 264 | ||
232 | void Incidence::setDtStart(const QDateTime &dtStart) | 265 | void Incidence::setDtStart(const QDateTime &dtStart) |
233 | { | 266 | { |
234 | 267 | ||
235 | QDateTime dt = getEvenTime(dtStart); | 268 | QDateTime dt = getEvenTime(dtStart); |
236 | recurrence()->setRecurStart( dt); | 269 | recurrence()->setRecurStart( dt); |
237 | IncidenceBase::setDtStart( dt ); | 270 | IncidenceBase::setDtStart( dt ); |
238 | } | 271 | } |
239 | 272 | ||
240 | void Incidence::setDescription(const QString &description) | 273 | void Incidence::setDescription(const QString &description) |
241 | { | 274 | { |
242 | if (mReadOnly) return; | 275 | if (mReadOnly) return; |
243 | mDescription = description; | 276 | mDescription = description; |
244 | updated(); | 277 | updated(); |
245 | } | 278 | } |
246 | 279 | ||
247 | QString Incidence::description() const | 280 | QString Incidence::description() const |
248 | { | 281 | { |
249 | return mDescription; | 282 | return mDescription; |
250 | } | 283 | } |
251 | 284 | ||
252 | 285 | ||
253 | void Incidence::setSummary(const QString &summary) | 286 | void Incidence::setSummary(const QString &summary) |
254 | { | 287 | { |
255 | if (mReadOnly) return; | 288 | if (mReadOnly) return; |
256 | mSummary = summary; | 289 | mSummary = summary; |
257 | updated(); | 290 | updated(); |
258 | } | 291 | } |
259 | 292 | ||
260 | QString Incidence::summary() const | 293 | QString Incidence::summary() const |
261 | { | 294 | { |
262 | return mSummary; | 295 | return mSummary; |
263 | } | 296 | } |
264 | 297 | ||
265 | void Incidence::setCategories(const QStringList &categories) | 298 | void Incidence::setCategories(const QStringList &categories) |
266 | { | 299 | { |
267 | if (mReadOnly) return; | 300 | if (mReadOnly) return; |
268 | mCategories = categories; | 301 | mCategories = categories; |
269 | updated(); | 302 | updated(); |
270 | } | 303 | } |
271 | 304 | ||
272 | // TODO: remove setCategories(QString) function | 305 | // TODO: remove setCategories(QString) function |
273 | void Incidence::setCategories(const QString &catStr) | 306 | void Incidence::setCategories(const QString &catStr) |
274 | { | 307 | { |
275 | if (mReadOnly) return; | 308 | if (mReadOnly) return; |
276 | mCategories.clear(); | 309 | mCategories.clear(); |
277 | 310 | ||
278 | if (catStr.isEmpty()) return; | 311 | if (catStr.isEmpty()) return; |
279 | 312 | ||
280 | mCategories = QStringList::split(",",catStr); | 313 | mCategories = QStringList::split(",",catStr); |
281 | 314 | ||
282 | QStringList::Iterator it; | 315 | QStringList::Iterator it; |
283 | for(it = mCategories.begin();it != mCategories.end(); ++it) { | 316 | for(it = mCategories.begin();it != mCategories.end(); ++it) { |
284 | *it = (*it).stripWhiteSpace(); | 317 | *it = (*it).stripWhiteSpace(); |
285 | } | 318 | } |
286 | 319 | ||
287 | updated(); | 320 | updated(); |
288 | } | 321 | } |
289 | 322 | ||
290 | QStringList Incidence::categories() const | 323 | QStringList Incidence::categories() const |
291 | { | 324 | { |
292 | return mCategories; | 325 | return mCategories; |
293 | } | 326 | } |
294 | 327 | ||
295 | QString Incidence::categoriesStr() | 328 | QString Incidence::categoriesStr() |
296 | { | 329 | { |
297 | return mCategories.join(","); | 330 | return mCategories.join(","); |
298 | } | 331 | } |
299 | 332 | ||
300 | void Incidence::setRelatedToUid(const QString &relatedToUid) | 333 | void Incidence::setRelatedToUid(const QString &relatedToUid) |