forked from lballabio/QuantLib
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathschedule.cpp
624 lines (549 loc) · 23.8 KB
/
schedule.cpp
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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
/* -*- mode: c++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
Copyright (C) 2006, 2007, 2008, 2010, 2011, 2015 Ferdinando Ametrano
Copyright (C) 2000, 2001, 2002, 2003 RiskMap srl
Copyright (C) 2009, 2012 StatPro Italia srl
This file is part of QuantLib, a free-software/open-source library
for financial quantitative analysts and developers - http://quantlib.org/
QuantLib is free software: you can redistribute it and/or modify it
under the terms of the QuantLib license. You should have received a
copy of the license along with this program; if not, please email
<[email protected]>. The license is also available online at
<http://quantlib.org/license.shtml>.
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 license for more details.
*/
#include <ql/time/schedule.hpp>
#include <ql/time/imm.hpp>
#include <ql/settings.hpp>
namespace QuantLib {
namespace {
Date nextTwentieth(const Date& d, DateGeneration::Rule rule) {
Date result = Date(20, d.month(), d.year());
if (result < d)
result += 1*Months;
if (rule == DateGeneration::TwentiethIMM ||
rule == DateGeneration::OldCDS ||
rule == DateGeneration::CDS) {
Month m = result.month();
if (m % 3 != 0) { // not a main IMM nmonth
Integer skip = 3 - m%3;
result += skip*Months;
}
}
return result;
}
Date previousTwentieth(const Date& d, DateGeneration::Rule rule) {
Date result = Date(20, d.month(), d.year());
if (result > d)
result -= 1*Months;
if (rule == DateGeneration::TwentiethIMM ||
rule == DateGeneration::OldCDS ||
rule == DateGeneration::CDS) {
Month m = result.month();
if (m % 3 != 0) { // not a main IMM nmonth
Integer skip = m%3;
result -= skip*Months;
}
}
return result;
}
bool allowsEndOfMonth(const Period& tenor) {
return (tenor.units() == Months || tenor.units() == Years)
&& tenor >= 1*Months;
}
}
Schedule::Schedule(const std::vector<Date>& dates,
const Calendar& calendar,
BusinessDayConvention convention,
boost::optional<BusinessDayConvention>
terminationDateConvention,
const boost::optional<Period> tenor,
boost::optional<DateGeneration::Rule> rule,
boost::optional<bool> endOfMonth,
const std::vector<bool>& isRegular)
: tenor_(tenor), calendar_(calendar),
convention_(convention),
terminationDateConvention_(terminationDateConvention),
rule_(rule),
dates_(dates), isRegular_(isRegular) {
if (tenor != boost::none && !allowsEndOfMonth(*tenor))
endOfMonth_ = false;
else
endOfMonth_ = endOfMonth;
QL_REQUIRE(
isRegular_.size() == 0 || isRegular_.size() == dates.size() - 1,
"isRegular size ("
<< isRegular_.size()
<< ") must be zero or equal to the number of dates minus 1 ("
<< dates.size() - 1 << ")");
}
Schedule::Schedule(Date effectiveDate,
const Date& terminationDate,
const Period& tenor,
const Calendar& cal,
BusinessDayConvention convention,
BusinessDayConvention terminationDateConvention,
DateGeneration::Rule rule,
bool endOfMonth,
const Date& first,
const Date& nextToLast)
: tenor_(tenor), calendar_(cal), convention_(convention),
terminationDateConvention_(terminationDateConvention), rule_(rule),
endOfMonth_(allowsEndOfMonth(tenor) ? endOfMonth : false),
firstDate_(first==effectiveDate ? Date() : first),
nextToLastDate_(nextToLast==terminationDate ? Date() : nextToLast)
{
// sanity checks
QL_REQUIRE(terminationDate != Date(), "null termination date");
// in many cases (e.g. non-expired bonds) the effective date is not
// really necessary. In these cases a decent placeholder is enough
if (effectiveDate==Date() && first==Date()
&& rule==DateGeneration::Backward) {
Date evalDate = Settings::instance().evaluationDate();
QL_REQUIRE(evalDate < terminationDate, "null effective date");
Natural y;
if (nextToLast != Date()) {
y = (nextToLast - evalDate)/366 + 1;
effectiveDate = nextToLast - y*Years;
} else {
y = (terminationDate - evalDate)/366 + 1;
effectiveDate = terminationDate - y*Years;
}
} else
QL_REQUIRE(effectiveDate != Date(), "null effective date");
QL_REQUIRE(effectiveDate < terminationDate,
"effective date (" << effectiveDate
<< ") later than or equal to termination date ("
<< terminationDate << ")");
if (tenor.length()==0)
rule_ = DateGeneration::Zero;
else
QL_REQUIRE(tenor.length()>0,
"non positive tenor (" << tenor << ") not allowed");
if (firstDate_ != Date()) {
switch (*rule_) {
case DateGeneration::Backward:
case DateGeneration::Forward:
QL_REQUIRE(firstDate_ > effectiveDate &&
firstDate_ < terminationDate,
"first date (" << firstDate_ <<
") out of effective-termination date range [" <<
effectiveDate << ", " << terminationDate << ")");
// we should ensure that the above condition is still
// verified after adjustment
break;
case DateGeneration::ThirdWednesday:
QL_REQUIRE(IMM::isIMMdate(firstDate_, false),
"first date (" << firstDate_ <<
") is not an IMM date");
break;
case DateGeneration::Zero:
case DateGeneration::Twentieth:
case DateGeneration::TwentiethIMM:
case DateGeneration::OldCDS:
case DateGeneration::CDS:
QL_FAIL("first date incompatible with " << *rule_ <<
" date generation rule");
default:
QL_FAIL("unknown rule (" << Integer(*rule_) << ")");
}
}
if (nextToLastDate_ != Date()) {
switch (*rule_) {
case DateGeneration::Backward:
case DateGeneration::Forward:
QL_REQUIRE(nextToLastDate_ > effectiveDate &&
nextToLastDate_ < terminationDate,
"next to last date (" << nextToLastDate_ <<
") out of effective-termination date range (" <<
effectiveDate << ", " << terminationDate << "]");
// we should ensure that the above condition is still
// verified after adjustment
break;
case DateGeneration::ThirdWednesday:
QL_REQUIRE(IMM::isIMMdate(nextToLastDate_, false),
"next-to-last date (" << nextToLastDate_ <<
") is not an IMM date");
break;
case DateGeneration::Zero:
case DateGeneration::Twentieth:
case DateGeneration::TwentiethIMM:
case DateGeneration::OldCDS:
case DateGeneration::CDS:
QL_FAIL("next to last date incompatible with " << *rule_ <<
" date generation rule");
default:
QL_FAIL("unknown rule (" << Integer(*rule_) << ")");
}
}
// calendar needed for endOfMonth adjustment
Calendar nullCalendar = NullCalendar();
Integer periods = 1;
Date seed, exitDate;
switch (*rule_) {
case DateGeneration::Zero:
tenor_ = 0*Years;
dates_.push_back(effectiveDate);
dates_.push_back(terminationDate);
isRegular_.push_back(true);
break;
case DateGeneration::Backward:
dates_.push_back(terminationDate);
seed = terminationDate;
if (nextToLastDate_ != Date()) {
dates_.insert(dates_.begin(), nextToLastDate_);
Date temp = nullCalendar.advance(seed,
-periods*(*tenor_), convention, *endOfMonth_);
if (temp!=nextToLastDate_)
isRegular_.insert(isRegular_.begin(), false);
else
isRegular_.insert(isRegular_.begin(), true);
seed = nextToLastDate_;
}
exitDate = effectiveDate;
if (firstDate_ != Date())
exitDate = firstDate_;
for (;;) {
Date temp = nullCalendar.advance(seed,
-periods*(*tenor_), convention, *endOfMonth_);
if (temp < exitDate) {
if (firstDate_ != Date() &&
(calendar_.adjust(dates_.front(),convention)!=
calendar_.adjust(firstDate_,convention))) {
dates_.insert(dates_.begin(), firstDate_);
isRegular_.insert(isRegular_.begin(), false);
}
break;
} else {
// skip dates that would result in duplicates
// after adjustment
if (calendar_.adjust(dates_.front(),convention)!=
calendar_.adjust(temp,convention)) {
dates_.insert(dates_.begin(), temp);
isRegular_.insert(isRegular_.begin(), true);
}
++periods;
}
}
if (calendar_.adjust(dates_.front(),convention)!=
calendar_.adjust(effectiveDate,convention)) {
dates_.insert(dates_.begin(), effectiveDate);
isRegular_.insert(isRegular_.begin(), false);
}
break;
case DateGeneration::Twentieth:
case DateGeneration::TwentiethIMM:
case DateGeneration::ThirdWednesday:
case DateGeneration::OldCDS:
case DateGeneration::CDS:
QL_REQUIRE(!*endOfMonth_,
"endOfMonth convention incompatible with " << *rule_ <<
" date generation rule");
// fall through
case DateGeneration::Forward:
if (*rule_ == DateGeneration::CDS) {
dates_.push_back(previousTwentieth(effectiveDate,
DateGeneration::CDS));
} else {
dates_.push_back(effectiveDate);
}
seed = dates_.back();
if (firstDate_!=Date()) {
dates_.push_back(firstDate_);
Date temp = nullCalendar.advance(seed, periods*(*tenor_),
convention, *endOfMonth_);
if (temp!=firstDate_)
isRegular_.push_back(false);
else
isRegular_.push_back(true);
seed = firstDate_;
} else if (*rule_ == DateGeneration::Twentieth ||
*rule_ == DateGeneration::TwentiethIMM ||
*rule_ == DateGeneration::OldCDS ||
*rule_ == DateGeneration::CDS) {
Date next20th = nextTwentieth(effectiveDate, *rule_);
if (*rule_ == DateGeneration::OldCDS) {
// distance rule inforced in natural days
static const Date::serial_type stubDays = 30;
if (next20th - effectiveDate < stubDays) {
// +1 will skip this one and get the next
next20th = nextTwentieth(next20th + 1, *rule_);
}
}
if (next20th != effectiveDate) {
dates_.push_back(next20th);
isRegular_.push_back(false);
seed = next20th;
}
}
exitDate = terminationDate;
if (nextToLastDate_ != Date())
exitDate = nextToLastDate_;
for (;;) {
Date temp = nullCalendar.advance(seed, periods*(*tenor_),
convention, *endOfMonth_);
if (temp > exitDate) {
if (nextToLastDate_ != Date() &&
(calendar_.adjust(dates_.back(),convention)!=
calendar_.adjust(nextToLastDate_,convention))) {
dates_.push_back(nextToLastDate_);
isRegular_.push_back(false);
}
break;
} else {
// skip dates that would result in duplicates
// after adjustment
if (calendar_.adjust(dates_.back(),convention)!=
calendar_.adjust(temp,convention)) {
dates_.push_back(temp);
isRegular_.push_back(true);
}
++periods;
}
}
if (calendar_.adjust(dates_.back(),terminationDateConvention)!=
calendar_.adjust(terminationDate,terminationDateConvention)) {
if (*rule_ == DateGeneration::Twentieth ||
*rule_ == DateGeneration::TwentiethIMM ||
*rule_ == DateGeneration::OldCDS ||
*rule_ == DateGeneration::CDS) {
dates_.push_back(nextTwentieth(terminationDate, *rule_));
isRegular_.push_back(true);
} else {
dates_.push_back(terminationDate);
isRegular_.push_back(false);
}
}
break;
default:
QL_FAIL("unknown rule (" << Integer(*rule_) << ")");
}
// adjustments
if (*rule_==DateGeneration::ThirdWednesday)
for (Size i=1; i<dates_.size()-1; ++i)
dates_[i] = Date::nthWeekday(3, Wednesday,
dates_[i].month(),
dates_[i].year());
if (*endOfMonth_ && calendar_.isEndOfMonth(seed)) {
// adjust to end of month
if (convention == Unadjusted) {
for (Size i=1; i<dates_.size()-1; ++i)
dates_[i] = Date::endOfMonth(dates_[i]);
} else {
for (Size i=1; i<dates_.size()-1; ++i)
dates_[i] = calendar_.endOfMonth(dates_[i]);
}
if (terminationDateConvention != Unadjusted) {
dates_.front() = calendar_.endOfMonth(dates_.front());
dates_.back() = calendar_.endOfMonth(dates_.back());
} else {
// the termination date is the first if going backwards,
// the last otherwise.
if (*rule_ == DateGeneration::Backward)
dates_.back() = Date::endOfMonth(dates_.back());
else
dates_.front() = Date::endOfMonth(dates_.front());
}
} else {
// first date not adjusted for old CDS schedules
if (*rule_ != DateGeneration::OldCDS)
dates_[0] = calendar_.adjust(dates_[0], convention);
for (Size i=1; i<dates_.size()-1; ++i)
dates_[i] = calendar_.adjust(dates_[i], convention);
// termination date is NOT adjusted as per ISDA
// specifications, unless otherwise specified in the
// confirmation of the deal or unless we're creating an old CDS
// schedule
if (terminationDateConvention != Unadjusted
|| *rule_ == DateGeneration::Twentieth
|| *rule_ == DateGeneration::TwentiethIMM
|| *rule_ == DateGeneration::OldCDS) {
dates_.back() = calendar_.adjust(dates_.back(),
terminationDateConvention);
}
}
// Final safety checks to remove extra next-to-last date, if
// necessary. It can happen to be equal or later than the end
// date due to EOM adjustments (see the Schedule test suite
// for an example).
if (dates_.size() >= 2 && dates_[dates_.size()-2] >= dates_.back()) {
isRegular_[isRegular_.size()-2] =
(dates_[dates_.size()-2] == dates_.back());
dates_[dates_.size()-2] = dates_.back();
dates_.pop_back();
isRegular_.pop_back();
}
if (dates_.size() >= 2 && dates_[1] <= dates_.front()) {
isRegular_[1] =
(dates_[1] == dates_.front());
dates_[1] = dates_.front();
dates_.erase(dates_.begin());
isRegular_.erase(isRegular_.begin());
}
QL_ENSURE(dates_.size()>1,
"degenerate single date (" << dates_[0] << ") schedule" <<
"\n seed date: " << seed <<
"\n exit date: " << exitDate <<
"\n effective date: " << effectiveDate <<
"\n first date: " << first <<
"\n next to last date: " << nextToLast <<
"\n termination date: " << terminationDate <<
"\n generation rule: " << *rule_ <<
"\n end of month: " << *endOfMonth_);
}
Schedule Schedule::until(const Date& truncationDate) const {
Schedule result = *this;
QL_REQUIRE(truncationDate>result.dates_[0],
"truncation date " << truncationDate <<
" must be later than schedule first date " <<
result.dates_[0]);
if (truncationDate<result.dates_.back()) {
// remove later dates
while (result.dates_.back()>truncationDate) {
result.dates_.pop_back();
result.isRegular_.pop_back();
}
// add truncationDate if missing
if (truncationDate!=result.dates_.back()) {
result.dates_.push_back(truncationDate);
result.isRegular_.push_back(false);
result.terminationDateConvention_ = Unadjusted;
} else {
result.terminationDateConvention_ = convention_;
}
if (result.nextToLastDate_>=truncationDate)
result.nextToLastDate_ = Date();
if (result.firstDate_>=truncationDate)
result.firstDate_ = Date();
}
return result;
}
std::vector<Date>::const_iterator
Schedule::lower_bound(const Date& refDate) const {
Date d = (refDate==Date() ?
Settings::instance().evaluationDate() :
refDate);
return std::lower_bound(dates_.begin(), dates_.end(), d);
}
Date Schedule::nextDate(const Date& refDate) const {
std::vector<Date>::const_iterator res = lower_bound(refDate);
if (res!=dates_.end())
return *res;
else
return Date();
}
Date Schedule::previousDate(const Date& refDate) const {
std::vector<Date>::const_iterator res = lower_bound(refDate);
if (res!=dates_.begin())
return *(--res);
else
return Date();
}
bool Schedule::isRegular(Size i) const {
QL_REQUIRE(isRegular_.size() > 0,
"full interface (isRegular) not available");
QL_REQUIRE(i<=isRegular_.size() && i>0,
"index (" << i << ") must be in [1, " <<
isRegular_.size() <<"]");
return isRegular_[i-1];
}
const std::vector<bool>& Schedule::isRegular() const {
QL_REQUIRE(isRegular_.size() > 0,
"full interface (isRegular) not available");
return isRegular_;
}
MakeSchedule::MakeSchedule()
: rule_(DateGeneration::Backward), endOfMonth_(false) {}
MakeSchedule& MakeSchedule::from(const Date& effectiveDate) {
effectiveDate_ = effectiveDate;
return *this;
}
MakeSchedule& MakeSchedule::to(const Date& terminationDate) {
terminationDate_ = terminationDate;
return *this;
}
MakeSchedule& MakeSchedule::withTenor(const Period& tenor) {
tenor_ = tenor;
return *this;
}
MakeSchedule& MakeSchedule::withFrequency(Frequency frequency) {
tenor_ = Period(frequency);
return *this;
}
MakeSchedule& MakeSchedule::withCalendar(const Calendar& calendar) {
calendar_ = calendar;
return *this;
}
MakeSchedule& MakeSchedule::withConvention(BusinessDayConvention conv) {
convention_ = conv;
return *this;
}
MakeSchedule& MakeSchedule::withTerminationDateConvention(
BusinessDayConvention conv) {
terminationDateConvention_ = conv;
return *this;
}
MakeSchedule& MakeSchedule::withRule(DateGeneration::Rule r) {
rule_ = r;
return *this;
}
MakeSchedule& MakeSchedule::forwards() {
rule_ = DateGeneration::Forward;
return *this;
}
MakeSchedule& MakeSchedule::backwards() {
rule_ = DateGeneration::Backward;
return *this;
}
MakeSchedule& MakeSchedule::endOfMonth(bool flag) {
endOfMonth_ = flag;
return *this;
}
MakeSchedule& MakeSchedule::withFirstDate(const Date& d) {
firstDate_ = d;
return *this;
}
MakeSchedule& MakeSchedule::withNextToLastDate(const Date& d) {
nextToLastDate_ = d;
return *this;
}
MakeSchedule::operator Schedule() const {
// check for mandatory arguments
QL_REQUIRE(effectiveDate_ != Date(), "effective date not provided");
QL_REQUIRE(terminationDate_ != Date(), "termination date not provided");
QL_REQUIRE(tenor_, "tenor/frequency not provided");
// set dynamic defaults:
BusinessDayConvention convention;
// if a convention was set, we use it.
if (convention_) {
convention = *convention_;
} else {
if (!calendar_.empty()) {
// ...if we set a calendar, we probably want it to be used;
convention = Following;
} else {
// if not, we don't care.
convention = Unadjusted;
}
}
BusinessDayConvention terminationDateConvention;
// if set explicitly, we use it;
if (terminationDateConvention_) {
terminationDateConvention = *terminationDateConvention_;
} else {
// Unadjusted as per ISDA specification
terminationDateConvention = convention;
}
Calendar calendar = calendar_;
// if no calendar was set...
if (calendar.empty()) {
// ...we use a null one.
calendar = NullCalendar();
}
return Schedule(effectiveDate_, terminationDate_, *tenor_, calendar,
convention, terminationDateConvention,
rule_, endOfMonth_, firstDate_, nextToLastDate_);
}
}