-rw-r--r-- | libkcal/incidence.cpp | 11 | ||||
-rw-r--r-- | libkcal/incidence.h | 2 |
2 files changed, 12 insertions, 1 deletions
diff --git a/libkcal/incidence.cpp b/libkcal/incidence.cpp index f446197..4382416 100644 --- a/libkcal/incidence.cpp +++ b/libkcal/incidence.cpp | |||
@@ -69,676 +69,687 @@ Incidence::Incidence( const Incidence &i ) : IncidenceBase( i ) | |||
69 | QPtrListIterator<Alarm> it( i.mAlarms ); | 69 | QPtrListIterator<Alarm> it( i.mAlarms ); |
70 | const Alarm *a; | 70 | const Alarm *a; |
71 | while( (a = it.current()) ) { | 71 | while( (a = it.current()) ) { |
72 | Alarm *b = new Alarm( *a ); | 72 | Alarm *b = new Alarm( *a ); |
73 | b->setParent( this ); | 73 | b->setParent( this ); |
74 | mAlarms.append( b ); | 74 | mAlarms.append( b ); |
75 | 75 | ||
76 | ++it; | 76 | ++it; |
77 | } | 77 | } |
78 | mAlarms.setAutoDelete(true); | 78 | mAlarms.setAutoDelete(true); |
79 | mHasRecurrenceID = i.mHasRecurrenceID; | 79 | mHasRecurrenceID = i.mHasRecurrenceID; |
80 | mRecurrenceID = i.mRecurrenceID; | 80 | mRecurrenceID = i.mRecurrenceID; |
81 | mRecurrence = new Recurrence( *(i.mRecurrence), this ); | 81 | mRecurrence = new Recurrence( *(i.mRecurrence), this ); |
82 | mHoliday = i.mHoliday ; | 82 | mHoliday = i.mHoliday ; |
83 | mBirthday = i.mBirthday; | 83 | mBirthday = i.mBirthday; |
84 | mAnniversary = i.mAnniversary; | 84 | mAnniversary = i.mAnniversary; |
85 | } | 85 | } |
86 | 86 | ||
87 | Incidence::~Incidence() | 87 | Incidence::~Incidence() |
88 | { | 88 | { |
89 | 89 | ||
90 | Incidence *ev; | 90 | Incidence *ev; |
91 | QPtrList<Incidence> Relations = relations(); | 91 | QPtrList<Incidence> Relations = relations(); |
92 | for (ev=Relations.first();ev;ev=Relations.next()) { | 92 | for (ev=Relations.first();ev;ev=Relations.next()) { |
93 | if (ev->relatedTo() == this) ev->setRelatedTo(0); | 93 | if (ev->relatedTo() == this) ev->setRelatedTo(0); |
94 | } | 94 | } |
95 | if (relatedTo()) relatedTo()->removeRelation(this); | 95 | if (relatedTo()) relatedTo()->removeRelation(this); |
96 | delete mRecurrence; | 96 | delete mRecurrence; |
97 | 97 | ||
98 | } | 98 | } |
99 | 99 | ||
100 | bool Incidence::isHoliday() const | 100 | bool Incidence::isHoliday() const |
101 | { | 101 | { |
102 | return mHoliday; | 102 | return mHoliday; |
103 | } | 103 | } |
104 | bool Incidence::isBirthday() const | 104 | bool Incidence::isBirthday() const |
105 | { | 105 | { |
106 | 106 | ||
107 | return mBirthday ; | 107 | return mBirthday ; |
108 | } | 108 | } |
109 | bool Incidence::isAnniversary() const | 109 | bool Incidence::isAnniversary() const |
110 | { | 110 | { |
111 | return mAnniversary ; | 111 | return mAnniversary ; |
112 | 112 | ||
113 | } | 113 | } |
114 | 114 | ||
115 | bool Incidence::hasRecurrenceID() const | 115 | bool Incidence::hasRecurrenceID() const |
116 | { | 116 | { |
117 | return mHasRecurrenceID; | 117 | return mHasRecurrenceID; |
118 | } | 118 | } |
119 | 119 | ||
120 | void Incidence::setHasRecurrenceID( bool b ) | 120 | void Incidence::setHasRecurrenceID( bool b ) |
121 | { | 121 | { |
122 | mHasRecurrenceID = b; | 122 | mHasRecurrenceID = b; |
123 | } | 123 | } |
124 | 124 | ||
125 | void Incidence::setRecurrenceID(QDateTime d) | 125 | void Incidence::setRecurrenceID(QDateTime d) |
126 | { | 126 | { |
127 | mRecurrenceID = d; | 127 | mRecurrenceID = d; |
128 | mHasRecurrenceID = true; | 128 | mHasRecurrenceID = true; |
129 | updated(); | 129 | updated(); |
130 | } | 130 | } |
131 | QDateTime Incidence::recurrenceID () const | 131 | QDateTime Incidence::recurrenceID () const |
132 | { | 132 | { |
133 | return mRecurrenceID; | 133 | return mRecurrenceID; |
134 | } | 134 | } |
135 | 135 | ||
136 | bool Incidence::cancelled() const | 136 | bool Incidence::cancelled() const |
137 | { | 137 | { |
138 | return mCancelled; | 138 | return mCancelled; |
139 | } | 139 | } |
140 | void Incidence::setCancelled( bool b ) | 140 | void Incidence::setCancelled( bool b ) |
141 | { | 141 | { |
142 | mCancelled = b; | 142 | mCancelled = b; |
143 | updated(); | 143 | updated(); |
144 | } | 144 | } |
145 | bool Incidence::hasStartDate() const | 145 | bool Incidence::hasStartDate() const |
146 | { | 146 | { |
147 | return mHasStartDate; | 147 | return mHasStartDate; |
148 | } | 148 | } |
149 | 149 | ||
150 | void Incidence::setHasStartDate(bool f) | 150 | void Incidence::setHasStartDate(bool f) |
151 | { | 151 | { |
152 | if (mReadOnly) return; | 152 | if (mReadOnly) return; |
153 | mHasStartDate = f; | 153 | mHasStartDate = f; |
154 | updated(); | 154 | updated(); |
155 | } | 155 | } |
156 | 156 | ||
157 | // A string comparison that considers that null and empty are the same | 157 | // A string comparison that considers that null and empty are the same |
158 | static bool stringCompare( const QString& s1, const QString& s2 ) | 158 | static bool stringCompare( const QString& s1, const QString& s2 ) |
159 | { | 159 | { |
160 | if ( s1.isEmpty() && s2.isEmpty() ) | 160 | if ( s1.isEmpty() && s2.isEmpty() ) |
161 | return true; | 161 | return true; |
162 | return s1 == s2; | 162 | return s1 == s2; |
163 | } | 163 | } |
164 | 164 | ||
165 | bool KCal::operator==( const Incidence& i1, const Incidence& i2 ) | 165 | bool KCal::operator==( const Incidence& i1, const Incidence& i2 ) |
166 | { | 166 | { |
167 | 167 | ||
168 | if( i1.alarms().count() != i2.alarms().count() ) { | 168 | if( i1.alarms().count() != i2.alarms().count() ) { |
169 | return false; // no need to check further | 169 | return false; // no need to check further |
170 | } | 170 | } |
171 | if ( i1.alarms().count() > 0 ) { | 171 | if ( i1.alarms().count() > 0 ) { |
172 | if ( !( *(i1.alarms().first()) == *(i2.alarms().first())) ) | 172 | if ( !( *(i1.alarms().first()) == *(i2.alarms().first())) ) |
173 | { | 173 | { |
174 | qDebug("alarm not equal "); | 174 | qDebug("alarm not equal "); |
175 | return false; | 175 | return false; |
176 | } | 176 | } |
177 | } | 177 | } |
178 | #if 0 | 178 | #if 0 |
179 | QPtrListIterator<Alarm> a1( i1.alarms() ); | 179 | QPtrListIterator<Alarm> a1( i1.alarms() ); |
180 | QPtrListIterator<Alarm> a2( i2.alarms() ); | 180 | QPtrListIterator<Alarm> a2( i2.alarms() ); |
181 | for( ; a1.current() && a2.current(); ++a1, ++a2 ) { | 181 | for( ; a1.current() && a2.current(); ++a1, ++a2 ) { |
182 | if( *a1.current() == *a2.current() ) { | 182 | if( *a1.current() == *a2.current() ) { |
183 | continue; | 183 | continue; |
184 | } | 184 | } |
185 | else { | 185 | else { |
186 | return false; | 186 | return false; |
187 | } | 187 | } |
188 | } | 188 | } |
189 | #endif | 189 | #endif |
190 | 190 | ||
191 | if ( i1.hasRecurrenceID() == i2.hasRecurrenceID() ) { | 191 | if ( i1.hasRecurrenceID() == i2.hasRecurrenceID() ) { |
192 | if ( i1.hasRecurrenceID() ) { | 192 | if ( i1.hasRecurrenceID() ) { |
193 | if ( i1.recurrenceID() != i2.recurrenceID() ) | 193 | if ( i1.recurrenceID() != i2.recurrenceID() ) |
194 | return false; | 194 | return false; |
195 | } | 195 | } |
196 | 196 | ||
197 | } else { | 197 | } else { |
198 | return false; | 198 | return false; |
199 | } | 199 | } |
200 | 200 | ||
201 | if ( ! operator==( (const IncidenceBase&)i1, (const IncidenceBase&)i2 ) ) | 201 | if ( ! operator==( (const IncidenceBase&)i1, (const IncidenceBase&)i2 ) ) |
202 | return false; | 202 | return false; |
203 | if ( i1.hasStartDate() == i2.hasStartDate() ) { | 203 | if ( i1.hasStartDate() == i2.hasStartDate() ) { |
204 | if ( i1.hasStartDate() ) { | 204 | if ( i1.hasStartDate() ) { |
205 | if ( i1.dtStart() != i2.dtStart() ) | 205 | if ( i1.dtStart() != i2.dtStart() ) |
206 | return false; | 206 | return false; |
207 | } | 207 | } |
208 | } else { | 208 | } else { |
209 | return false; | 209 | return false; |
210 | } | 210 | } |
211 | if (!( *i1.recurrence() == *i2.recurrence()) ) { | 211 | if (!( *i1.recurrence() == *i2.recurrence()) ) { |
212 | qDebug("recurrence is NOT equal "); | 212 | qDebug("recurrence is NOT equal "); |
213 | return false; | 213 | return false; |
214 | } | 214 | } |
215 | return | 215 | return |
216 | // i1.created() == i2.created() && | 216 | // i1.created() == i2.created() && |
217 | stringCompare( i1.description(), i2.description() ) && | 217 | stringCompare( i1.description(), i2.description() ) && |
218 | stringCompare( i1.summary(), i2.summary() ) && | 218 | stringCompare( i1.summary(), i2.summary() ) && |
219 | i1.categories() == i2.categories() && | 219 | i1.categories() == i2.categories() && |
220 | // no need to compare mRelatedTo | 220 | // no need to compare mRelatedTo |
221 | stringCompare( i1.relatedToUid(), i2.relatedToUid() ) && | 221 | stringCompare( i1.relatedToUid(), i2.relatedToUid() ) && |
222 | // i1.relations() == i2.relations() && | 222 | // i1.relations() == i2.relations() && |
223 | i1.exDates() == i2.exDates() && | 223 | i1.exDates() == i2.exDates() && |
224 | i1.attachments() == i2.attachments() && | 224 | i1.attachments() == i2.attachments() && |
225 | i1.resources() == i2.resources() && | 225 | i1.resources() == i2.resources() && |
226 | i1.secrecy() == i2.secrecy() && | 226 | i1.secrecy() == i2.secrecy() && |
227 | i1.priority() == i2.priority() && | 227 | i1.priority() == i2.priority() && |
228 | i1.cancelled() == i2.cancelled() && | 228 | i1.cancelled() == i2.cancelled() && |
229 | stringCompare( i1.location(), i2.location() ); | 229 | stringCompare( i1.location(), i2.location() ); |
230 | } | 230 | } |
231 | 231 | ||
232 | Incidence* Incidence::recreateCloneException( QDate d ) | 232 | Incidence* Incidence::recreateCloneException( QDate d ) |
233 | { | 233 | { |
234 | Incidence* newInc = clone(); | 234 | Incidence* newInc = clone(); |
235 | newInc->recreate(); | 235 | newInc->recreate(); |
236 | if ( doesRecur() ) { | 236 | if ( doesRecur() ) { |
237 | addExDate( d ); | 237 | addExDate( d ); |
238 | newInc->recurrence()->unsetRecurs(); | 238 | newInc->recurrence()->unsetRecurs(); |
239 | if ( typeID() == eventID ) { | 239 | if ( typeID() == eventID ) { |
240 | int len = dtStart().secsTo( ((Event*)this)->dtEnd()); | 240 | int len = dtStart().secsTo( ((Event*)this)->dtEnd()); |
241 | QTime tim = dtStart().time(); | 241 | QTime tim = dtStart().time(); |
242 | newInc->setDtStart( QDateTime(d, tim) ); | 242 | newInc->setDtStart( QDateTime(d, tim) ); |
243 | ((Event*)newInc)->setDtEnd( newInc->dtStart().addSecs( len ) ); | 243 | ((Event*)newInc)->setDtEnd( newInc->dtStart().addSecs( len ) ); |
244 | } else { | 244 | } else { |
245 | int len = dtStart().secsTo( ((Todo*)this)->dtDue()); | 245 | int len = dtStart().secsTo( ((Todo*)this)->dtDue()); |
246 | QTime tim = ((Todo*)this)->dtDue().time(); | 246 | QTime tim = ((Todo*)this)->dtDue().time(); |
247 | ((Todo*)newInc)->setDtDue( QDateTime(d, tim) ); | 247 | ((Todo*)newInc)->setDtDue( QDateTime(d, tim) ); |
248 | ((Todo*)newInc)->setDtStart( ((Todo*)newInc)->dtDue().addSecs( -len ) ); | 248 | ((Todo*)newInc)->setDtStart( ((Todo*)newInc)->dtDue().addSecs( -len ) ); |
249 | ((Todo*)this)->setRecurDates(); | 249 | ((Todo*)this)->setRecurDates(); |
250 | } | 250 | } |
251 | newInc->setExDates( DateList () ); | 251 | newInc->setExDates( DateList () ); |
252 | } | 252 | } |
253 | return newInc; | 253 | return newInc; |
254 | } | 254 | } |
255 | 255 | ||
256 | void Incidence::recreate() | 256 | void Incidence::recreate() |
257 | { | 257 | { |
258 | setCreated(QDateTime::currentDateTime()); | 258 | setCreated(QDateTime::currentDateTime()); |
259 | 259 | ||
260 | setUid(CalFormat::createUniqueId()); | 260 | setUid(CalFormat::createUniqueId()); |
261 | 261 | ||
262 | setRevision(0); | 262 | setRevision(0); |
263 | setIDStr( ":" ); | 263 | setIDStr( ":" ); |
264 | setLastModified(QDateTime::currentDateTime()); | 264 | setLastModified(QDateTime::currentDateTime()); |
265 | } | 265 | } |
266 | void Incidence::cloneRelations( Incidence * newInc ) | 266 | void Incidence::cloneRelations( Incidence * newInc ) |
267 | { | 267 | { |
268 | // newInc is already a clone of this incidence | 268 | // newInc is already a clone of this incidence |
269 | Incidence * inc; | 269 | Incidence * inc; |
270 | Incidence * cloneInc; | 270 | Incidence * cloneInc; |
271 | QPtrList<Incidence> Relations = relations(); | 271 | QPtrList<Incidence> Relations = relations(); |
272 | for (inc=Relations.first();inc;inc=Relations.next()) { | 272 | for (inc=Relations.first();inc;inc=Relations.next()) { |
273 | cloneInc = inc->clone(); | 273 | cloneInc = inc->clone(); |
274 | cloneInc->recreate(); | 274 | cloneInc->recreate(); |
275 | cloneInc->setRelatedTo( newInc ); | 275 | cloneInc->setRelatedTo( newInc ); |
276 | inc->cloneRelations( cloneInc ); | 276 | inc->cloneRelations( cloneInc ); |
277 | } | 277 | } |
278 | } | 278 | } |
279 | void Incidence::setReadOnly( bool readOnly ) | 279 | void Incidence::setReadOnly( bool readOnly ) |
280 | { | 280 | { |
281 | IncidenceBase::setReadOnly( readOnly ); | 281 | IncidenceBase::setReadOnly( readOnly ); |
282 | recurrence()->setRecurReadOnly( readOnly); | 282 | recurrence()->setRecurReadOnly( readOnly); |
283 | } | 283 | } |
284 | 284 | ||
285 | void Incidence::setCreated(QDateTime created) | 285 | void Incidence::setCreated(QDateTime created) |
286 | { | 286 | { |
287 | if (mReadOnly) return; | 287 | if (mReadOnly) return; |
288 | mCreated = getEvenTime(created); | 288 | mCreated = getEvenTime(created); |
289 | } | 289 | } |
290 | 290 | ||
291 | QDateTime Incidence::created() const | 291 | QDateTime Incidence::created() const |
292 | { | 292 | { |
293 | return mCreated; | 293 | return mCreated; |
294 | } | 294 | } |
295 | 295 | ||
296 | void Incidence::setRevision(int rev) | 296 | void Incidence::setRevision(int rev) |
297 | { | 297 | { |
298 | if (mReadOnly) return; | 298 | if (mReadOnly) return; |
299 | mRevision = rev; | 299 | mRevision = rev; |
300 | 300 | ||
301 | updated(); | 301 | updated(); |
302 | } | 302 | } |
303 | 303 | ||
304 | int Incidence::revision() const | 304 | int Incidence::revision() const |
305 | { | 305 | { |
306 | return mRevision; | 306 | return mRevision; |
307 | } | 307 | } |
308 | 308 | ||
309 | void Incidence::setDtStart(const QDateTime &dtStart) | 309 | void Incidence::setDtStart(const QDateTime &dtStart) |
310 | { | 310 | { |
311 | 311 | ||
312 | QDateTime dt = getEvenTime(dtStart); | 312 | QDateTime dt = getEvenTime(dtStart); |
313 | recurrence()->setRecurStart( dt); | 313 | recurrence()->setRecurStart( dt); |
314 | IncidenceBase::setDtStart( dt ); | 314 | IncidenceBase::setDtStart( dt ); |
315 | } | 315 | } |
316 | 316 | ||
317 | void Incidence::setDescription(const QString &description) | 317 | void Incidence::setDescription(const QString &description) |
318 | { | 318 | { |
319 | if (mReadOnly) return; | 319 | if (mReadOnly) return; |
320 | mDescription = description; | 320 | mDescription = description; |
321 | updated(); | 321 | updated(); |
322 | } | 322 | } |
323 | 323 | ||
324 | QString Incidence::description() const | 324 | QString Incidence::description() const |
325 | { | 325 | { |
326 | return mDescription; | 326 | return mDescription; |
327 | } | 327 | } |
328 | 328 | ||
329 | 329 | ||
330 | void Incidence::setSummary(const QString &summary) | 330 | void Incidence::setSummary(const QString &summary) |
331 | { | 331 | { |
332 | if (mReadOnly) return; | 332 | if (mReadOnly) return; |
333 | mSummary = summary; | 333 | mSummary = summary; |
334 | updated(); | 334 | updated(); |
335 | } | 335 | } |
336 | 336 | ||
337 | QString Incidence::summary() const | 337 | QString Incidence::summary() const |
338 | { | 338 | { |
339 | return mSummary; | 339 | return mSummary; |
340 | } | 340 | } |
341 | void Incidence::checkCategories() | 341 | void Incidence::checkCategories() |
342 | { | 342 | { |
343 | mHoliday = mCategories.contains("Holiday") || mCategories.contains(i18n("Holiday")); | 343 | mHoliday = mCategories.contains("Holiday") || mCategories.contains(i18n("Holiday")); |
344 | mBirthday = mCategories.contains("Birthday") || mCategories.contains(i18n("Birthday")); | 344 | mBirthday = mCategories.contains("Birthday") || mCategories.contains(i18n("Birthday")); |
345 | mAnniversary = mCategories.contains("Anniversary") || mCategories.contains(i18n("Anniversary")); | 345 | mAnniversary = mCategories.contains("Anniversary") || mCategories.contains(i18n("Anniversary")); |
346 | } | 346 | } |
347 | 347 | ||
348 | void Incidence::addCategories(const QStringList &categories, bool addToRelations ) //addToRelations = false | 348 | void Incidence::addCategories(const QStringList &categories, bool addToRelations ) //addToRelations = false |
349 | { | 349 | { |
350 | if (mReadOnly) return; | 350 | if (mReadOnly) return; |
351 | int i; | 351 | int i; |
352 | for( i = 0; i < categories.count(); ++i ) { | 352 | for( i = 0; i < categories.count(); ++i ) { |
353 | if ( !mCategories.contains (categories[i])) | 353 | if ( !mCategories.contains (categories[i])) |
354 | mCategories.append( categories[i] ); | 354 | mCategories.append( categories[i] ); |
355 | } | 355 | } |
356 | checkCategories(); | 356 | checkCategories(); |
357 | updated(); | 357 | updated(); |
358 | if ( addToRelations ) { | 358 | if ( addToRelations ) { |
359 | Incidence * inc; | 359 | Incidence * inc; |
360 | QPtrList<Incidence> Relations = relations(); | 360 | QPtrList<Incidence> Relations = relations(); |
361 | for (inc=Relations.first();inc;inc=Relations.next()) { | 361 | for (inc=Relations.first();inc;inc=Relations.next()) { |
362 | inc->addCategories( categories, true ); | 362 | inc->addCategories( categories, true ); |
363 | } | 363 | } |
364 | } | 364 | } |
365 | } | 365 | } |
366 | 366 | ||
367 | void Incidence::setCategories(const QStringList &categories, bool setForRelations ) //setForRelations = false | 367 | void Incidence::setCategories(const QStringList &categories, bool setForRelations ) //setForRelations = false |
368 | { | 368 | { |
369 | if (mReadOnly) return; | 369 | if (mReadOnly) return; |
370 | mCategories = categories; | 370 | mCategories = categories; |
371 | checkCategories(); | 371 | checkCategories(); |
372 | updated(); | 372 | updated(); |
373 | if ( setForRelations ) { | 373 | if ( setForRelations ) { |
374 | Incidence * inc; | 374 | Incidence * inc; |
375 | QPtrList<Incidence> Relations = relations(); | 375 | QPtrList<Incidence> Relations = relations(); |
376 | for (inc=Relations.first();inc;inc=Relations.next()) { | 376 | for (inc=Relations.first();inc;inc=Relations.next()) { |
377 | inc->setCategories( categories, true ); | 377 | inc->setCategories( categories, true ); |
378 | } | 378 | } |
379 | } | 379 | } |
380 | } | 380 | } |
381 | 381 | ||
382 | // TODO: remove setCategories(QString) function | 382 | // TODO: remove setCategories(QString) function |
383 | void Incidence::setCategories(const QString &catStr) | 383 | void Incidence::setCategories(const QString &catStr) |
384 | { | 384 | { |
385 | if (mReadOnly) return; | 385 | if (mReadOnly) return; |
386 | mCategories.clear(); | 386 | mCategories.clear(); |
387 | 387 | ||
388 | if (catStr.isEmpty()) return; | 388 | if (catStr.isEmpty()) return; |
389 | 389 | ||
390 | mCategories = QStringList::split(",",catStr); | 390 | mCategories = QStringList::split(",",catStr); |
391 | 391 | ||
392 | QStringList::Iterator it; | 392 | QStringList::Iterator it; |
393 | for(it = mCategories.begin();it != mCategories.end(); ++it) { | 393 | for(it = mCategories.begin();it != mCategories.end(); ++it) { |
394 | *it = (*it).stripWhiteSpace(); | 394 | *it = (*it).stripWhiteSpace(); |
395 | } | 395 | } |
396 | checkCategories(); | 396 | checkCategories(); |
397 | updated(); | 397 | updated(); |
398 | } | 398 | } |
399 | 399 | ||
400 | QStringList Incidence::categories() const | 400 | QStringList Incidence::categories() const |
401 | { | 401 | { |
402 | return mCategories; | 402 | return mCategories; |
403 | } | 403 | } |
404 | 404 | ||
405 | QString Incidence::categoriesStr() | 405 | QString Incidence::categoriesStr() |
406 | { | 406 | { |
407 | return mCategories.join(","); | 407 | return mCategories.join(","); |
408 | } | 408 | } |
409 | QString Incidence::categoriesStrWithSpace() | 409 | QString Incidence::categoriesStrWithSpace() |
410 | { | 410 | { |
411 | return mCategories.join(", "); | 411 | return mCategories.join(", "); |
412 | } | 412 | } |
413 | 413 | ||
414 | void Incidence::setRelatedToUid(const QString &relatedToUid) | 414 | void Incidence::setRelatedToUid(const QString &relatedToUid) |
415 | { | 415 | { |
416 | if (mReadOnly) return; | 416 | if (mReadOnly) return; |
417 | mRelatedToUid = relatedToUid; | 417 | mRelatedToUid = relatedToUid; |
418 | } | 418 | } |
419 | 419 | ||
420 | QString Incidence::relatedToUid() const | 420 | QString Incidence::relatedToUid() const |
421 | { | 421 | { |
422 | return mRelatedToUid; | 422 | return mRelatedToUid; |
423 | } | 423 | } |
424 | 424 | ||
425 | void Incidence::setRelatedTo(Incidence *relatedTo) | 425 | void Incidence::setRelatedTo(Incidence *relatedTo) |
426 | { | 426 | { |
427 | //qDebug("Incidence::setRelatedTo %d ", relatedTo); | 427 | //qDebug("Incidence::setRelatedTo %d ", relatedTo); |
428 | //qDebug("setRelatedTo(Incidence *relatedTo) %s %s", summary().latin1(), relatedTo->summary().latin1() ); | 428 | //qDebug("setRelatedTo(Incidence *relatedTo) %s %s", summary().latin1(), relatedTo->summary().latin1() ); |
429 | if (mReadOnly || mRelatedTo == relatedTo) return; | 429 | if (mReadOnly || mRelatedTo == relatedTo) return; |
430 | if(mRelatedTo) { | 430 | if(mRelatedTo) { |
431 | // updated(); | 431 | // updated(); |
432 | mRelatedTo->removeRelation(this); | 432 | mRelatedTo->removeRelation(this); |
433 | } | 433 | } |
434 | mRelatedTo = relatedTo; | 434 | mRelatedTo = relatedTo; |
435 | if (mRelatedTo) { | 435 | if (mRelatedTo) { |
436 | mRelatedTo->addRelation(this); | 436 | mRelatedTo->addRelation(this); |
437 | mRelatedToUid = mRelatedTo->uid(); | 437 | mRelatedToUid = mRelatedTo->uid(); |
438 | } else { | 438 | } else { |
439 | mRelatedToUid = ""; | 439 | mRelatedToUid = ""; |
440 | } | 440 | } |
441 | } | 441 | } |
442 | 442 | ||
443 | Incidence *Incidence::relatedTo() const | 443 | Incidence *Incidence::relatedTo() const |
444 | { | 444 | { |
445 | return mRelatedTo; | 445 | return mRelatedTo; |
446 | } | 446 | } |
447 | 447 | ||
448 | QPtrList<Incidence> Incidence::relations() const | 448 | QPtrList<Incidence> Incidence::relations() const |
449 | { | 449 | { |
450 | return mRelations; | 450 | return mRelations; |
451 | } | 451 | } |
452 | 452 | ||
453 | void Incidence::addRelationsToList(QPtrList<Incidence> *rel) | ||
454 | { | ||
455 | Incidence* inc; | ||
456 | QPtrList<Incidence> Relations = relations(); | ||
457 | for (inc=Relations.first();inc;inc=Relations.next()) { | ||
458 | inc->addRelationsToList( rel ); | ||
459 | } | ||
460 | if ( rel->findRef( this ) == -1 ) | ||
461 | rel->append( this ); | ||
462 | } | ||
463 | |||
453 | void Incidence::addRelation(Incidence *event) | 464 | void Incidence::addRelation(Incidence *event) |
454 | { | 465 | { |
455 | if( mRelations.findRef( event ) == -1 ) { | 466 | if( mRelations.findRef( event ) == -1 ) { |
456 | mRelations.append(event); | 467 | mRelations.append(event); |
457 | //updated(); | 468 | //updated(); |
458 | } | 469 | } |
459 | } | 470 | } |
460 | 471 | ||
461 | void Incidence::removeRelation(Incidence *event) | 472 | void Incidence::removeRelation(Incidence *event) |
462 | { | 473 | { |
463 | 474 | ||
464 | mRelations.removeRef(event); | 475 | mRelations.removeRef(event); |
465 | 476 | ||
466 | // if (event->getRelatedTo() == this) event->setRelatedTo(0); | 477 | // if (event->getRelatedTo() == this) event->setRelatedTo(0); |
467 | } | 478 | } |
468 | 479 | ||
469 | bool Incidence::recursOn(const QDate &qd) const | 480 | bool Incidence::recursOn(const QDate &qd) const |
470 | { | 481 | { |
471 | if (recurrence()->recursOnPure(qd) && !isException(qd)) return true; | 482 | if (recurrence()->recursOnPure(qd) && !isException(qd)) return true; |
472 | else return false; | 483 | else return false; |
473 | } | 484 | } |
474 | 485 | ||
475 | void Incidence::setExDates(const DateList &exDates) | 486 | void Incidence::setExDates(const DateList &exDates) |
476 | { | 487 | { |
477 | if (mReadOnly) return; | 488 | if (mReadOnly) return; |
478 | mExDates = exDates; | 489 | mExDates = exDates; |
479 | 490 | ||
480 | recurrence()->setRecurExDatesCount(mExDates.count()); | 491 | recurrence()->setRecurExDatesCount(mExDates.count()); |
481 | 492 | ||
482 | updated(); | 493 | updated(); |
483 | } | 494 | } |
484 | 495 | ||
485 | void Incidence::addExDate(const QDate &date) | 496 | void Incidence::addExDate(const QDate &date) |
486 | { | 497 | { |
487 | if (mReadOnly) return; | 498 | if (mReadOnly) return; |
488 | mExDates.append(date); | 499 | mExDates.append(date); |
489 | 500 | ||
490 | recurrence()->setRecurExDatesCount(mExDates.count()); | 501 | recurrence()->setRecurExDatesCount(mExDates.count()); |
491 | 502 | ||
492 | updated(); | 503 | updated(); |
493 | } | 504 | } |
494 | 505 | ||
495 | DateList Incidence::exDates() const | 506 | DateList Incidence::exDates() const |
496 | { | 507 | { |
497 | return mExDates; | 508 | return mExDates; |
498 | } | 509 | } |
499 | 510 | ||
500 | bool Incidence::isException(const QDate &date) const | 511 | bool Incidence::isException(const QDate &date) const |
501 | { | 512 | { |
502 | DateList::ConstIterator it; | 513 | DateList::ConstIterator it; |
503 | for( it = mExDates.begin(); it != mExDates.end(); ++it ) { | 514 | for( it = mExDates.begin(); it != mExDates.end(); ++it ) { |
504 | if ( (*it) == date ) { | 515 | if ( (*it) == date ) { |
505 | return true; | 516 | return true; |
506 | } | 517 | } |
507 | } | 518 | } |
508 | 519 | ||
509 | return false; | 520 | return false; |
510 | } | 521 | } |
511 | 522 | ||
512 | void Incidence::addAttachment(Attachment *attachment) | 523 | void Incidence::addAttachment(Attachment *attachment) |
513 | { | 524 | { |
514 | if (mReadOnly || !attachment) return; | 525 | if (mReadOnly || !attachment) return; |
515 | mAttachments.append(attachment); | 526 | mAttachments.append(attachment); |
516 | updated(); | 527 | updated(); |
517 | } | 528 | } |
518 | 529 | ||
519 | void Incidence::deleteAttachment(Attachment *attachment) | 530 | void Incidence::deleteAttachment(Attachment *attachment) |
520 | { | 531 | { |
521 | mAttachments.removeRef(attachment); | 532 | mAttachments.removeRef(attachment); |
522 | } | 533 | } |
523 | 534 | ||
524 | void Incidence::deleteAttachments(const QString& mime) | 535 | void Incidence::deleteAttachments(const QString& mime) |
525 | { | 536 | { |
526 | Attachment *at = mAttachments.first(); | 537 | Attachment *at = mAttachments.first(); |
527 | while (at) { | 538 | while (at) { |
528 | if (at->mimeType() == mime) | 539 | if (at->mimeType() == mime) |
529 | mAttachments.remove(); | 540 | mAttachments.remove(); |
530 | else | 541 | else |
531 | at = mAttachments.next(); | 542 | at = mAttachments.next(); |
532 | } | 543 | } |
533 | } | 544 | } |
534 | 545 | ||
535 | QPtrList<Attachment> Incidence::attachments() const | 546 | QPtrList<Attachment> Incidence::attachments() const |
536 | { | 547 | { |
537 | return mAttachments; | 548 | return mAttachments; |
538 | } | 549 | } |
539 | 550 | ||
540 | QPtrList<Attachment> Incidence::attachments(const QString& mime) const | 551 | QPtrList<Attachment> Incidence::attachments(const QString& mime) const |
541 | { | 552 | { |
542 | QPtrList<Attachment> attachments; | 553 | QPtrList<Attachment> attachments; |
543 | QPtrListIterator<Attachment> it( mAttachments ); | 554 | QPtrListIterator<Attachment> it( mAttachments ); |
544 | Attachment *at; | 555 | Attachment *at; |
545 | while ( (at = it.current()) ) { | 556 | while ( (at = it.current()) ) { |
546 | if (at->mimeType() == mime) | 557 | if (at->mimeType() == mime) |
547 | attachments.append(at); | 558 | attachments.append(at); |
548 | ++it; | 559 | ++it; |
549 | } | 560 | } |
550 | 561 | ||
551 | return attachments; | 562 | return attachments; |
552 | } | 563 | } |
553 | 564 | ||
554 | void Incidence::setResources(const QStringList &resources) | 565 | void Incidence::setResources(const QStringList &resources) |
555 | { | 566 | { |
556 | if (mReadOnly) return; | 567 | if (mReadOnly) return; |
557 | mResources = resources; | 568 | mResources = resources; |
558 | updated(); | 569 | updated(); |
559 | } | 570 | } |
560 | 571 | ||
561 | QStringList Incidence::resources() const | 572 | QStringList Incidence::resources() const |
562 | { | 573 | { |
563 | return mResources; | 574 | return mResources; |
564 | } | 575 | } |
565 | 576 | ||
566 | 577 | ||
567 | void Incidence::setPriority(int priority) | 578 | void Incidence::setPriority(int priority) |
568 | { | 579 | { |
569 | if (mReadOnly) return; | 580 | if (mReadOnly) return; |
570 | mPriority = priority; | 581 | mPriority = priority; |
571 | updated(); | 582 | updated(); |
572 | } | 583 | } |
573 | 584 | ||
574 | int Incidence::priority() const | 585 | int Incidence::priority() const |
575 | { | 586 | { |
576 | return mPriority; | 587 | return mPriority; |
577 | } | 588 | } |
578 | 589 | ||
579 | void Incidence::setSecrecy(int sec) | 590 | void Incidence::setSecrecy(int sec) |
580 | { | 591 | { |
581 | if (mReadOnly) return; | 592 | if (mReadOnly) return; |
582 | mSecrecy = sec; | 593 | mSecrecy = sec; |
583 | updated(); | 594 | updated(); |
584 | } | 595 | } |
585 | 596 | ||
586 | int Incidence::secrecy() const | 597 | int Incidence::secrecy() const |
587 | { | 598 | { |
588 | return mSecrecy; | 599 | return mSecrecy; |
589 | } | 600 | } |
590 | 601 | ||
591 | QString Incidence::secrecyStr() const | 602 | QString Incidence::secrecyStr() const |
592 | { | 603 | { |
593 | return secrecyName(mSecrecy); | 604 | return secrecyName(mSecrecy); |
594 | } | 605 | } |
595 | 606 | ||
596 | QString Incidence::secrecyName(int secrecy) | 607 | QString Incidence::secrecyName(int secrecy) |
597 | { | 608 | { |
598 | switch (secrecy) { | 609 | switch (secrecy) { |
599 | case SecrecyPublic: | 610 | case SecrecyPublic: |
600 | return i18n("Public"); | 611 | return i18n("Public"); |
601 | break; | 612 | break; |
602 | case SecrecyPrivate: | 613 | case SecrecyPrivate: |
603 | return i18n("Private"); | 614 | return i18n("Private"); |
604 | break; | 615 | break; |
605 | case SecrecyConfidential: | 616 | case SecrecyConfidential: |
606 | return i18n("Confidential"); | 617 | return i18n("Confidential"); |
607 | break; | 618 | break; |
608 | default: | 619 | default: |
609 | return i18n("Undefined"); | 620 | return i18n("Undefined"); |
610 | break; | 621 | break; |
611 | } | 622 | } |
612 | } | 623 | } |
613 | 624 | ||
614 | QStringList Incidence::secrecyList() | 625 | QStringList Incidence::secrecyList() |
615 | { | 626 | { |
616 | QStringList list; | 627 | QStringList list; |
617 | list << secrecyName(SecrecyPublic); | 628 | list << secrecyName(SecrecyPublic); |
618 | list << secrecyName(SecrecyPrivate); | 629 | list << secrecyName(SecrecyPrivate); |
619 | list << secrecyName(SecrecyConfidential); | 630 | list << secrecyName(SecrecyConfidential); |
620 | 631 | ||
621 | return list; | 632 | return list; |
622 | } | 633 | } |
623 | 634 | ||
624 | 635 | ||
625 | QPtrList<Alarm> Incidence::alarms() const | 636 | QPtrList<Alarm> Incidence::alarms() const |
626 | { | 637 | { |
627 | return mAlarms; | 638 | return mAlarms; |
628 | } | 639 | } |
629 | 640 | ||
630 | Alarm* Incidence::newAlarm() | 641 | Alarm* Incidence::newAlarm() |
631 | { | 642 | { |
632 | Alarm* alarm = new Alarm(this); | 643 | Alarm* alarm = new Alarm(this); |
633 | mAlarms.append(alarm); | 644 | mAlarms.append(alarm); |
634 | // updated(); | 645 | // updated(); |
635 | return alarm; | 646 | return alarm; |
636 | } | 647 | } |
637 | 648 | ||
638 | void Incidence::addAlarm(Alarm *alarm) | 649 | void Incidence::addAlarm(Alarm *alarm) |
639 | { | 650 | { |
640 | mAlarms.append(alarm); | 651 | mAlarms.append(alarm); |
641 | updated(); | 652 | updated(); |
642 | } | 653 | } |
643 | 654 | ||
644 | void Incidence::removeAlarm(Alarm *alarm) | 655 | void Incidence::removeAlarm(Alarm *alarm) |
645 | { | 656 | { |
646 | mAlarms.removeRef(alarm); | 657 | mAlarms.removeRef(alarm); |
647 | updated(); | 658 | updated(); |
648 | } | 659 | } |
649 | 660 | ||
650 | void Incidence::clearAlarms() | 661 | void Incidence::clearAlarms() |
651 | { | 662 | { |
652 | mAlarms.clear(); | 663 | mAlarms.clear(); |
653 | updated(); | 664 | updated(); |
654 | } | 665 | } |
655 | 666 | ||
656 | bool Incidence::isAlarmEnabled() const | 667 | bool Incidence::isAlarmEnabled() const |
657 | { | 668 | { |
658 | Alarm* alarm; | 669 | Alarm* alarm; |
659 | for (QPtrListIterator<Alarm> it(mAlarms); (alarm = it.current()) != 0; ++it) { | 670 | for (QPtrListIterator<Alarm> it(mAlarms); (alarm = it.current()) != 0; ++it) { |
660 | if (alarm->enabled()) | 671 | if (alarm->enabled()) |
661 | return true; | 672 | return true; |
662 | } | 673 | } |
663 | return false; | 674 | return false; |
664 | } | 675 | } |
665 | 676 | ||
666 | Recurrence *Incidence::recurrence() const | 677 | Recurrence *Incidence::recurrence() const |
667 | { | 678 | { |
668 | return mRecurrence; | 679 | return mRecurrence; |
669 | } | 680 | } |
670 | void Incidence::setRecurrence( Recurrence * r) | 681 | void Incidence::setRecurrence( Recurrence * r) |
671 | { | 682 | { |
672 | delete mRecurrence; | 683 | delete mRecurrence; |
673 | mRecurrence = r; | 684 | mRecurrence = r; |
674 | } | 685 | } |
675 | 686 | ||
676 | void Incidence::setLocation(const QString &location) | 687 | void Incidence::setLocation(const QString &location) |
677 | { | 688 | { |
678 | if (mReadOnly) return; | 689 | if (mReadOnly) return; |
679 | mLocation = location; | 690 | mLocation = location; |
680 | updated(); | 691 | updated(); |
681 | } | 692 | } |
682 | 693 | ||
683 | QString Incidence::location() const | 694 | QString Incidence::location() const |
684 | { | 695 | { |
685 | return mLocation; | 696 | return mLocation; |
686 | } | 697 | } |
687 | 698 | ||
688 | ushort Incidence::doesRecur() const | 699 | ushort Incidence::doesRecur() const |
689 | { | 700 | { |
690 | if ( mRecurrence ) return mRecurrence->doesRecur(); | 701 | if ( mRecurrence ) return mRecurrence->doesRecur(); |
691 | else return Recurrence::rNone; | 702 | else return Recurrence::rNone; |
692 | } | 703 | } |
693 | 704 | ||
694 | QDateTime Incidence::getNextOccurence( const QDateTime& dt, bool* ok ) const | 705 | QDateTime Incidence::getNextOccurence( const QDateTime& dt, bool* ok ) const |
695 | { | 706 | { |
696 | QDateTime incidenceStart = dt; | 707 | QDateTime incidenceStart = dt; |
697 | *ok = false; | 708 | *ok = false; |
698 | if ( doesRecur() ) { | 709 | if ( doesRecur() ) { |
699 | bool last; | 710 | bool last; |
700 | recurrence()->getPreviousDateTime( incidenceStart , &last ); | 711 | recurrence()->getPreviousDateTime( incidenceStart , &last ); |
701 | int count = 0; | 712 | int count = 0; |
702 | if ( !last ) { | 713 | if ( !last ) { |
703 | while ( !last ) { | 714 | while ( !last ) { |
704 | ++count; | 715 | ++count; |
705 | incidenceStart = recurrence()->getNextDateTime( incidenceStart, &last ); | 716 | incidenceStart = recurrence()->getNextDateTime( incidenceStart, &last ); |
706 | if ( recursOn( incidenceStart.date() ) ) { | 717 | if ( recursOn( incidenceStart.date() ) ) { |
707 | last = true; // exit while llop | 718 | last = true; // exit while llop |
708 | } else { | 719 | } else { |
709 | if ( last ) { // no alarm on last recurrence | 720 | if ( last ) { // no alarm on last recurrence |
710 | return QDateTime (); | 721 | return QDateTime (); |
711 | } | 722 | } |
712 | int year = incidenceStart.date().year(); | 723 | int year = incidenceStart.date().year(); |
713 | // workaround for bug in recurrence | 724 | // workaround for bug in recurrence |
714 | if ( count == 100 || year < 1000 || year > 5000 ) { | 725 | if ( count == 100 || year < 1000 || year > 5000 ) { |
715 | return QDateTime (); | 726 | return QDateTime (); |
716 | } | 727 | } |
717 | incidenceStart = incidenceStart.addSecs( 1 ); | 728 | incidenceStart = incidenceStart.addSecs( 1 ); |
718 | } | 729 | } |
719 | } | 730 | } |
720 | } else { | 731 | } else { |
721 | return QDateTime (); | 732 | return QDateTime (); |
722 | } | 733 | } |
723 | } else { | 734 | } else { |
724 | if ( hasStartDate () ) { | 735 | if ( hasStartDate () ) { |
725 | incidenceStart = dtStart(); | 736 | incidenceStart = dtStart(); |
726 | } | 737 | } |
727 | if ( typeID() == todoID ) { | 738 | if ( typeID() == todoID ) { |
728 | if ( ((Todo*)this)->hasDueDate() ) | 739 | if ( ((Todo*)this)->hasDueDate() ) |
729 | incidenceStart = ((Todo*)this)->dtDue(); | 740 | incidenceStart = ((Todo*)this)->dtDue(); |
730 | } | 741 | } |
731 | } | 742 | } |
732 | if ( incidenceStart > dt ) | 743 | if ( incidenceStart > dt ) |
733 | *ok = true; | 744 | *ok = true; |
734 | return incidenceStart; | 745 | return incidenceStart; |
735 | } | 746 | } |
736 | QDateTime Incidence::dtStart() const | 747 | QDateTime Incidence::dtStart() const |
737 | { | 748 | { |
738 | if ( doesRecur() ) { | 749 | if ( doesRecur() ) { |
739 | if ( typeID() == todoID ) { | 750 | if ( typeID() == todoID ) { |
740 | ((Todo*)this)->checkSetCompletedFalse(); | 751 | ((Todo*)this)->checkSetCompletedFalse(); |
741 | } | 752 | } |
742 | } | 753 | } |
743 | return mDtStart; | 754 | return mDtStart; |
744 | } | 755 | } |
diff --git a/libkcal/incidence.h b/libkcal/incidence.h index aa51e84..fc97ce9 100644 --- a/libkcal/incidence.h +++ b/libkcal/incidence.h | |||
@@ -1,317 +1,317 @@ | |||
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 | #ifndef INCIDENCE_H | 20 | #ifndef INCIDENCE_H |
21 | #define INCIDENCE_H | 21 | #define INCIDENCE_H |
22 | // | 22 | // |
23 | // Incidence - base class of calendaring components | 23 | // Incidence - base class of calendaring components |
24 | // | 24 | // |
25 | 25 | ||
26 | #include <qdatetime.h> | 26 | #include <qdatetime.h> |
27 | #include <qstringlist.h> | 27 | #include <qstringlist.h> |
28 | #include <qvaluelist.h> | 28 | #include <qvaluelist.h> |
29 | 29 | ||
30 | #include "recurrence.h" | 30 | #include "recurrence.h" |
31 | #include "alarm.h" | 31 | #include "alarm.h" |
32 | #include "attachment.h" | 32 | #include "attachment.h" |
33 | #include "listbase.h" | 33 | #include "listbase.h" |
34 | #include "incidencebase.h" | 34 | #include "incidencebase.h" |
35 | 35 | ||
36 | namespace KCal { | 36 | namespace KCal { |
37 | 37 | ||
38 | class Event; | 38 | class Event; |
39 | class Todo; | 39 | class Todo; |
40 | class Journal; | 40 | class Journal; |
41 | 41 | ||
42 | /** | 42 | /** |
43 | This class provides the base class common to all calendar components. | 43 | This class provides the base class common to all calendar components. |
44 | */ | 44 | */ |
45 | class Incidence : public IncidenceBase | 45 | class Incidence : public IncidenceBase |
46 | { | 46 | { |
47 | public: | 47 | public: |
48 | /** | 48 | /** |
49 | This class provides the interface for a visitor of calendar components. It | 49 | This class provides the interface for a visitor of calendar components. It |
50 | serves as base class for concrete visitors, which implement certain actions on | 50 | serves as base class for concrete visitors, which implement certain actions on |
51 | calendar components. It allows to add functions, which operate on the concrete | 51 | calendar components. It allows to add functions, which operate on the concrete |
52 | types of calendar components, without changing the calendar component classes. | 52 | types of calendar components, without changing the calendar component classes. |
53 | */ | 53 | */ |
54 | class Visitor | 54 | class Visitor |
55 | { | 55 | { |
56 | public: | 56 | public: |
57 | /** Destruct Incidence::Visitor */ | 57 | /** Destruct Incidence::Visitor */ |
58 | virtual ~Visitor() {} | 58 | virtual ~Visitor() {} |
59 | 59 | ||
60 | /** | 60 | /** |
61 | Reimplement this function in your concrete subclass of IncidenceVisitor to perform actions | 61 | Reimplement this function in your concrete subclass of IncidenceVisitor to perform actions |
62 | on an Event object. | 62 | on an Event object. |
63 | */ | 63 | */ |
64 | virtual bool visit(Event *) { return false; } | 64 | virtual bool visit(Event *) { return false; } |
65 | /** | 65 | /** |
66 | Reimplement this function in your concrete subclass of IncidenceVisitor to perform actions | 66 | Reimplement this function in your concrete subclass of IncidenceVisitor to perform actions |
67 | on an Todo object. | 67 | on an Todo object. |
68 | */ | 68 | */ |
69 | virtual bool visit(Todo *) { return false; } | 69 | virtual bool visit(Todo *) { return false; } |
70 | /** | 70 | /** |
71 | Reimplement this function in your concrete subclass of IncidenceVisitor to perform actions | 71 | Reimplement this function in your concrete subclass of IncidenceVisitor to perform actions |
72 | on an Journal object. | 72 | on an Journal object. |
73 | */ | 73 | */ |
74 | virtual bool visit(Journal *) { return false; } | 74 | virtual bool visit(Journal *) { return false; } |
75 | 75 | ||
76 | protected: | 76 | protected: |
77 | /** Constructor is protected to prevent direct creation of visitor base class. */ | 77 | /** Constructor is protected to prevent direct creation of visitor base class. */ |
78 | Visitor() {} | 78 | Visitor() {} |
79 | }; | 79 | }; |
80 | 80 | ||
81 | /** | 81 | /** |
82 | This class implements a visitor for adding an Incidence to a resource | 82 | This class implements a visitor for adding an Incidence to a resource |
83 | supporting addEvent(), addTodo() and addJournal() calls. | 83 | supporting addEvent(), addTodo() and addJournal() calls. |
84 | */ | 84 | */ |
85 | template<class T> | 85 | template<class T> |
86 | class AddVisitor : public Visitor | 86 | class AddVisitor : public Visitor |
87 | { | 87 | { |
88 | public: | 88 | public: |
89 | AddVisitor( T *r ) : mResource( r ) {} | 89 | AddVisitor( T *r ) : mResource( r ) {} |
90 | bool visit( Event *e ) { return mResource->addEvent( e ); } | 90 | bool visit( Event *e ) { return mResource->addEvent( e ); } |
91 | bool visit( Todo *t ) { return mResource->addTodo( t ); } | 91 | bool visit( Todo *t ) { return mResource->addTodo( t ); } |
92 | bool visit( Journal *j ) { return mResource->addJournal( j ); } | 92 | bool visit( Journal *j ) { return mResource->addJournal( j ); } |
93 | 93 | ||
94 | private: | 94 | private: |
95 | T *mResource; | 95 | T *mResource; |
96 | }; | 96 | }; |
97 | 97 | ||
98 | /** enumeration for describing an event's secrecy. */ | 98 | /** enumeration for describing an event's secrecy. */ |
99 | enum { SecrecyPublic = 0, SecrecyPrivate = 1, SecrecyConfidential = 2 }; | 99 | enum { SecrecyPublic = 0, SecrecyPrivate = 1, SecrecyConfidential = 2 }; |
100 | typedef ListBase<Incidence> List; | 100 | typedef ListBase<Incidence> List; |
101 | Incidence(); | 101 | Incidence(); |
102 | Incidence(const Incidence &); | 102 | Incidence(const Incidence &); |
103 | ~Incidence(); | 103 | ~Incidence(); |
104 | 104 | ||
105 | /** | 105 | /** |
106 | Accept IncidenceVisitor. A class taking part in the visitor mechanism has to | 106 | Accept IncidenceVisitor. A class taking part in the visitor mechanism has to |
107 | provide this implementation: | 107 | provide this implementation: |
108 | <pre> | 108 | <pre> |
109 | bool accept(Visitor &v) { return v.visit(this); } | 109 | bool accept(Visitor &v) { return v.visit(this); } |
110 | </pre> | 110 | </pre> |
111 | */ | 111 | */ |
112 | virtual bool accept(Visitor &) { return false; } | 112 | virtual bool accept(Visitor &) { return false; } |
113 | 113 | ||
114 | virtual Incidence *clone() = 0; | 114 | virtual Incidence *clone() = 0; |
115 | virtual void cloneRelations( Incidence * ); | 115 | virtual void cloneRelations( Incidence * ); |
116 | 116 | void addRelationsToList(QPtrList<Incidence> *rel); | |
117 | virtual QDateTime getNextAlarmDateTime( bool * ok, int * offset, QDateTime start_dt ) const = 0; | 117 | virtual QDateTime getNextAlarmDateTime( bool * ok, int * offset, QDateTime start_dt ) const = 0; |
118 | void setReadOnly( bool ); | 118 | void setReadOnly( bool ); |
119 | 119 | ||
120 | /** | 120 | /** |
121 | Recreate event. The event is made a new unique event, but already stored | 121 | Recreate event. The event is made a new unique event, but already stored |
122 | event information is preserved. Sets uniquie id, creation date, last | 122 | event information is preserved. Sets uniquie id, creation date, last |
123 | modification date and revision number. | 123 | modification date and revision number. |
124 | */ | 124 | */ |
125 | void recreate(); | 125 | void recreate(); |
126 | Incidence* recreateCloneException(QDate); | 126 | Incidence* recreateCloneException(QDate); |
127 | 127 | ||
128 | /** set creation date */ | 128 | /** set creation date */ |
129 | void setCreated(QDateTime); | 129 | void setCreated(QDateTime); |
130 | /** return time and date of creation. */ | 130 | /** return time and date of creation. */ |
131 | QDateTime created() const; | 131 | QDateTime created() const; |
132 | 132 | ||
133 | /** set the number of revisions this event has seen */ | 133 | /** set the number of revisions this event has seen */ |
134 | void setRevision(int rev); | 134 | void setRevision(int rev); |
135 | /** return the number of revisions this event has seen */ | 135 | /** return the number of revisions this event has seen */ |
136 | int revision() const; | 136 | int revision() const; |
137 | 137 | ||
138 | /** Set starting date/time. */ | 138 | /** Set starting date/time. */ |
139 | virtual void setDtStart(const QDateTime &dtStart); | 139 | virtual void setDtStart(const QDateTime &dtStart); |
140 | /** Return the incidence's ending date/time as a QDateTime. */ | 140 | /** Return the incidence's ending date/time as a QDateTime. */ |
141 | virtual QDateTime dtEnd() const { return QDateTime(); } | 141 | virtual QDateTime dtEnd() const { return QDateTime(); } |
142 | 142 | ||
143 | /** sets the event's lengthy description. */ | 143 | /** sets the event's lengthy description. */ |
144 | void setDescription(const QString &description); | 144 | void setDescription(const QString &description); |
145 | /** returns a reference to the event's description. */ | 145 | /** returns a reference to the event's description. */ |
146 | QString description() const; | 146 | QString description() const; |
147 | 147 | ||
148 | /** sets the event's short summary. */ | 148 | /** sets the event's short summary. */ |
149 | void setSummary(const QString &summary); | 149 | void setSummary(const QString &summary); |
150 | /** returns a reference to the event's summary. */ | 150 | /** returns a reference to the event's summary. */ |
151 | QString summary() const; | 151 | QString summary() const; |
152 | 152 | ||
153 | /** set event's applicable categories */ | 153 | /** set event's applicable categories */ |
154 | void setCategories(const QStringList &categories, bool setForRelations = false); | 154 | void setCategories(const QStringList &categories, bool setForRelations = false); |
155 | void addCategories(const QStringList &categories, bool addToRelations = false); | 155 | void addCategories(const QStringList &categories, bool addToRelations = false); |
156 | /** set event's categories based on a comma delimited string */ | 156 | /** set event's categories based on a comma delimited string */ |
157 | void setCategories(const QString &catStr); | 157 | void setCategories(const QString &catStr); |
158 | /** return categories in a list */ | 158 | /** return categories in a list */ |
159 | QStringList categories() const; | 159 | QStringList categories() const; |
160 | /** return categories as a comma separated string */ | 160 | /** return categories as a comma separated string */ |
161 | QString categoriesStr(); | 161 | QString categoriesStr(); |
162 | QString categoriesStrWithSpace(); | 162 | QString categoriesStrWithSpace(); |
163 | 163 | ||
164 | /** point at some other event to which the event relates. This function should | 164 | /** point at some other event to which the event relates. This function should |
165 | * only be used when constructing a calendar before the related Event | 165 | * only be used when constructing a calendar before the related Event |
166 | * exists. */ | 166 | * exists. */ |
167 | void setRelatedToUid(const QString &); | 167 | void setRelatedToUid(const QString &); |
168 | /** what event does this one relate to? This function should | 168 | /** what event does this one relate to? This function should |
169 | * only be used when constructing a calendar before the related Event | 169 | * only be used when constructing a calendar before the related Event |
170 | * exists. */ | 170 | * exists. */ |
171 | QString relatedToUid() const; | 171 | QString relatedToUid() const; |
172 | /** point at some other event to which the event relates */ | 172 | /** point at some other event to which the event relates */ |
173 | void setRelatedTo(Incidence *relatedTo); | 173 | void setRelatedTo(Incidence *relatedTo); |
174 | /** what event does this one relate to? */ | 174 | /** what event does this one relate to? */ |
175 | Incidence *relatedTo() const; | 175 | Incidence *relatedTo() const; |
176 | /** All events that are related to this event */ | 176 | /** All events that are related to this event */ |
177 | QPtrList<Incidence> relations() const; | 177 | QPtrList<Incidence> relations() const; |
178 | /** Add an event which is related to this event */ | 178 | /** Add an event which is related to this event */ |
179 | void addRelation(Incidence *); | 179 | void addRelation(Incidence *); |
180 | /** Remove event that is related to this event */ | 180 | /** Remove event that is related to this event */ |
181 | void removeRelation(Incidence *); | 181 | void removeRelation(Incidence *); |
182 | 182 | ||
183 | /** returns the list of dates which are exceptions to the recurrence rule */ | 183 | /** returns the list of dates which are exceptions to the recurrence rule */ |
184 | DateList exDates() const; | 184 | DateList exDates() const; |
185 | /** sets the list of dates which are exceptions to the recurrence rule */ | 185 | /** sets the list of dates which are exceptions to the recurrence rule */ |
186 | void setExDates(const DateList &_exDates); | 186 | void setExDates(const DateList &_exDates); |
187 | void setExDates(const char *dates); | 187 | void setExDates(const char *dates); |
188 | /** Add a date to the list of exceptions of the recurrence rule. */ | 188 | /** Add a date to the list of exceptions of the recurrence rule. */ |
189 | void addExDate(const QDate &date); | 189 | void addExDate(const QDate &date); |
190 | 190 | ||
191 | /** returns true if there is an exception for this date in the recurrence | 191 | /** returns true if there is an exception for this date in the recurrence |
192 | rule set, or false otherwise. */ | 192 | rule set, or false otherwise. */ |
193 | bool isException(const QDate &qd) const; | 193 | bool isException(const QDate &qd) const; |
194 | 194 | ||
195 | /** add attachment to this event */ | 195 | /** add attachment to this event */ |
196 | void addAttachment(Attachment *attachment); | 196 | void addAttachment(Attachment *attachment); |
197 | /** remove and delete a specific attachment */ | 197 | /** remove and delete a specific attachment */ |
198 | void deleteAttachment(Attachment *attachment); | 198 | void deleteAttachment(Attachment *attachment); |
199 | /** remove and delete all attachments with this mime type */ | 199 | /** remove and delete all attachments with this mime type */ |
200 | void deleteAttachments(const QString& mime); | 200 | void deleteAttachments(const QString& mime); |
201 | /** return list of all associated attachments */ | 201 | /** return list of all associated attachments */ |
202 | QPtrList<Attachment> attachments() const; | 202 | QPtrList<Attachment> attachments() const; |
203 | /** find a list of attachments with this mime type */ | 203 | /** find a list of attachments with this mime type */ |
204 | QPtrList<Attachment> attachments(const QString& mime) const; | 204 | QPtrList<Attachment> attachments(const QString& mime) const; |
205 | 205 | ||
206 | /** sets the event's status the value specified. See the enumeration | 206 | /** sets the event's status the value specified. See the enumeration |
207 | * above for possible values. */ | 207 | * above for possible values. */ |
208 | void setSecrecy(int); | 208 | void setSecrecy(int); |
209 | /** return the event's secrecy. */ | 209 | /** return the event's secrecy. */ |
210 | int secrecy() const; | 210 | int secrecy() const; |
211 | /** return the event's secrecy in string format. */ | 211 | /** return the event's secrecy in string format. */ |
212 | QString secrecyStr() const; | 212 | QString secrecyStr() const; |
213 | /** return list of all availbale secrecy classes */ | 213 | /** return list of all availbale secrecy classes */ |
214 | static QStringList secrecyList(); | 214 | static QStringList secrecyList(); |
215 | /** return human-readable name of secrecy class */ | 215 | /** return human-readable name of secrecy class */ |
216 | static QString secrecyName(int); | 216 | static QString secrecyName(int); |
217 | 217 | ||
218 | /** returns TRUE if the date specified is one on which the event will | 218 | /** returns TRUE if the date specified is one on which the event will |
219 | * recur. */ | 219 | * recur. */ |
220 | bool recursOn(const QDate &qd) const; | 220 | bool recursOn(const QDate &qd) const; |
221 | 221 | ||
222 | // VEVENT and VTODO, but not VJOURNAL (move to EventBase class?): | 222 | // VEVENT and VTODO, but not VJOURNAL (move to EventBase class?): |
223 | 223 | ||
224 | /** set resources used, such as Office, Car, etc. */ | 224 | /** set resources used, such as Office, Car, etc. */ |
225 | void setResources(const QStringList &resources); | 225 | void setResources(const QStringList &resources); |
226 | /** return list of current resources */ | 226 | /** return list of current resources */ |
227 | QStringList resources() const; | 227 | QStringList resources() const; |
228 | 228 | ||
229 | /** set the event's priority, 0 is undefined, 1 highest (decreasing order) */ | 229 | /** set the event's priority, 0 is undefined, 1 highest (decreasing order) */ |
230 | void setPriority(int priority); | 230 | void setPriority(int priority); |
231 | /** get the event's priority */ | 231 | /** get the event's priority */ |
232 | int priority() const; | 232 | int priority() const; |
233 | 233 | ||
234 | /** All alarms that are associated with this incidence */ | 234 | /** All alarms that are associated with this incidence */ |
235 | QPtrList<Alarm> alarms() const; | 235 | QPtrList<Alarm> alarms() const; |
236 | /** Create a new alarm which is associated with this incidence */ | 236 | /** Create a new alarm which is associated with this incidence */ |
237 | Alarm* newAlarm(); | 237 | Alarm* newAlarm(); |
238 | /** Add an alarm which is associated with this incidence */ | 238 | /** Add an alarm which is associated with this incidence */ |
239 | void addAlarm(Alarm*); | 239 | void addAlarm(Alarm*); |
240 | /** Remove an alarm that is associated with this incidence */ | 240 | /** Remove an alarm that is associated with this incidence */ |
241 | void removeAlarm(Alarm*); | 241 | void removeAlarm(Alarm*); |
242 | /** Remove all alarms that are associated with this incidence */ | 242 | /** Remove all alarms that are associated with this incidence */ |
243 | void clearAlarms(); | 243 | void clearAlarms(); |
244 | /** return whether any alarm associated with this incidence is enabled */ | 244 | /** return whether any alarm associated with this incidence is enabled */ |
245 | bool isAlarmEnabled() const; | 245 | bool isAlarmEnabled() const; |
246 | 246 | ||
247 | /** | 247 | /** |
248 | Return the recurrence rule associated with this incidence. If there is | 248 | Return the recurrence rule associated with this incidence. If there is |
249 | none, returns an appropriate (non-0) object. | 249 | none, returns an appropriate (non-0) object. |
250 | */ | 250 | */ |
251 | Recurrence *recurrence() const; | 251 | Recurrence *recurrence() const; |
252 | void setRecurrence(Recurrence * r); | 252 | void setRecurrence(Recurrence * r); |
253 | /** | 253 | /** |
254 | Forward to Recurrence::doesRecur(). | 254 | Forward to Recurrence::doesRecur(). |
255 | */ | 255 | */ |
256 | ushort doesRecur() const; | 256 | ushort doesRecur() const; |
257 | 257 | ||
258 | /** set the event's/todo's location. Do _not_ use it with journal */ | 258 | /** set the event's/todo's location. Do _not_ use it with journal */ |
259 | void setLocation(const QString &location); | 259 | void setLocation(const QString &location); |
260 | /** return the event's/todo's location. Do _not_ use it with journal */ | 260 | /** return the event's/todo's location. Do _not_ use it with journal */ |
261 | QString location() const; | 261 | QString location() const; |
262 | /** returns TRUE or FALSE depending on whether the todo has a start date */ | 262 | /** returns TRUE or FALSE depending on whether the todo has a start date */ |
263 | bool hasStartDate() const; | 263 | bool hasStartDate() const; |
264 | /** sets the event's hasStartDate value. */ | 264 | /** sets the event's hasStartDate value. */ |
265 | void setHasStartDate(bool f); | 265 | void setHasStartDate(bool f); |
266 | QDateTime getNextOccurence( const QDateTime& dt, bool* yes ) const; | 266 | QDateTime getNextOccurence( const QDateTime& dt, bool* yes ) const; |
267 | bool cancelled() const; | 267 | bool cancelled() const; |
268 | void setCancelled( bool b ); | 268 | void setCancelled( bool b ); |
269 | 269 | ||
270 | bool hasRecurrenceID() const; | 270 | bool hasRecurrenceID() const; |
271 | void setHasRecurrenceID( bool b ); | 271 | void setHasRecurrenceID( bool b ); |
272 | 272 | ||
273 | void setRecurrenceID(QDateTime); | 273 | void setRecurrenceID(QDateTime); |
274 | QDateTime recurrenceID () const; | 274 | QDateTime recurrenceID () const; |
275 | QDateTime dtStart() const; | 275 | QDateTime dtStart() const; |
276 | bool isHoliday() const; | 276 | bool isHoliday() const; |
277 | bool isBirthday() const; | 277 | bool isBirthday() const; |
278 | bool isAnniversary() const; | 278 | bool isAnniversary() const; |
279 | 279 | ||
280 | 280 | ||
281 | protected: | 281 | protected: |
282 | QPtrList<Alarm> mAlarms; | 282 | QPtrList<Alarm> mAlarms; |
283 | QPtrList<Incidence> mRelations; | 283 | QPtrList<Incidence> mRelations; |
284 | QDateTime mRecurrenceID; | 284 | QDateTime mRecurrenceID; |
285 | bool mHasRecurrenceID; | 285 | bool mHasRecurrenceID; |
286 | private: | 286 | private: |
287 | void checkCategories(); | 287 | void checkCategories(); |
288 | bool mHoliday, mBirthday, mAnniversary; | 288 | bool mHoliday, mBirthday, mAnniversary; |
289 | int mRevision; | 289 | int mRevision; |
290 | bool mCancelled; | 290 | bool mCancelled; |
291 | 291 | ||
292 | // base components of jounal, event and todo | 292 | // base components of jounal, event and todo |
293 | QDateTime mCreated; | 293 | QDateTime mCreated; |
294 | QString mDescription; | 294 | QString mDescription; |
295 | QString mSummary; | 295 | QString mSummary; |
296 | QStringList mCategories; | 296 | QStringList mCategories; |
297 | Incidence *mRelatedTo; | 297 | Incidence *mRelatedTo; |
298 | QString mRelatedToUid; | 298 | QString mRelatedToUid; |
299 | DateList mExDates; | 299 | DateList mExDates; |
300 | QPtrList<Attachment> mAttachments; | 300 | QPtrList<Attachment> mAttachments; |
301 | QStringList mResources; | 301 | QStringList mResources; |
302 | bool mHasStartDate; // if todo has associated start date | 302 | bool mHasStartDate; // if todo has associated start date |
303 | 303 | ||
304 | int mSecrecy; | 304 | int mSecrecy; |
305 | int mPriority; // 1 = highest, 2 = less, etc. | 305 | int mPriority; // 1 = highest, 2 = less, etc. |
306 | 306 | ||
307 | //QPtrList<Alarm> mAlarms; | 307 | //QPtrList<Alarm> mAlarms; |
308 | Recurrence *mRecurrence; | 308 | Recurrence *mRecurrence; |
309 | 309 | ||
310 | QString mLocation; | 310 | QString mLocation; |
311 | }; | 311 | }; |
312 | 312 | ||
313 | bool operator==( const Incidence&, const Incidence& ); | 313 | bool operator==( const Incidence&, const Incidence& ); |
314 | 314 | ||
315 | } | 315 | } |
316 | 316 | ||
317 | #endif | 317 | #endif |