-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathconventions.cpp
More file actions
346 lines (311 loc) · 11 KB
/
Copy pathconventions.cpp
File metadata and controls
346 lines (311 loc) · 11 KB
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
// Financial Analytics Library (FINAL)
// Copyright (c) 2004 - 2012 by Marek Sestak, marek.sestak@gmail.com
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#include "conventions.h"
#include "exceptions.h"
namespace final {
floating YearFrac( const TDate& astart, const TDate& aend, int abasis )
{
int ds,ms,ys; // day, month, year - start date
int de,me,ye; // day, month, year - end date
int ss,se; // seriove cisla zacatku(ss) a konce(se)
TDate start,end,dummy_dt;
int num; // 'num'erator
floating denum; // 'denum'erator
int sign;
start = astart;
end = aend;
start.Validate();
end.Validate();
if( start.Serial()<=end.Serial() ) // pokud je obdobi zadano obracene
{ // nejprve datumy prohodime
sign=1; // a pracujeme s nimi, jako kdyby
} // byly zadany normalne a nakonci
else // to cele vynasobime sign
{
sign=-1;
dummy_dt=start;
start=end;
end=dummy_dt;
}
start.Get( ds,ms,ys );
end.Get( de,me,ye );
ss=start.Serial(); // pri vypoctu poctu dnu
se=end.Serial(); // se s tim ruzne hejba, proto si to
// radsi zapamatujeme hned
// ACT_ACT_ISDA je svou povahou trochu odlisna od ostatnich konvenci
// spocteme ji zvlast a rovnou vratime vysledek
if( abasis==ACT_ACT_ISDA || abasis==ACT_ACT_ISDA_NONEOM ) {
if( IsLeap(ys) ) {
denum = 366.0;
}
else {
denum = 365.0;
}
if( ys==ye ) {
return (se-ss)/denum;
}
floating denumEnd;
if( IsLeap(ye) ) {
denumEnd = 366.0;
}
else {
denumEnd = 365.0;
}
int yearStartSerial = TDate(1,1,ye).Serial();
return (se-yearStartSerial)/denumEnd + (yearStartSerial-ss)/denum;
}
num = 0;
denum = 0;
if( abasis>=NONEOM_start )
abasis = abasis-NONEOM_start;
switch( abasis ) // ve funknci YearFrac neni treba NOEOM
// modifikator brat v uvahu
{
case US_30_360:
case US_30_365:
case US_30_ACT:
if( de==31 ) // americka konvence 30/360 (365,ACT)
{ // ma spoustu zajimavosti:
de=30; num=1; // - 1.5.-31.5. = 30
} // - prestupne roky 29.2.-1.3. = 1
if( start.IsMonthEnd() || ds==30 )
{ // - neprestupne 28.2.-1.3. = 1
ds=1; ms++; //
if( ms==13 ) // princip uprav
// 1.pokud konec obdobi padne na 31. den
{ // posuneme to na 30. a pricteme 1
ms=1; // 2.pokud zacatek obdobi padne na
ys++; // konec mesice, posuneme to na zacatek
} // dalsiho mesice a pricteme 1
num=1; // 3.pokud nastane zaroven 1&2, nepricteme
} // 2, ale jen 1
num += (ye-ys)*360 + (me-ms)*30 + (de-ds);
break;
case ISMA_30_360:
case ISMA_30_365:
case ISMA_30_ACT: // evropska ISMA 30/360 (365,ACT)
if( ds==31 ) // je v porovnani s americkou jednodussi
ds = 30; // staci posunout 31.dny na 30.
if( de==31 )
de = 30;
num = (ye-ys)*360 + (me-ms)*30 + (de-ds);
break;
case NL_360:
case NL_365:
case NL_ACT:
num = (ye-ys)*365;
if( me==2 && de==29 )
de = 28;
if( ms==2 && ds==29 )
ds = 28;
dummy_dt.Set(ds,ms,1997);
num -= dummy_dt.Serial();
dummy_dt.Set(de,me,1997);
num += dummy_dt.Serial();
break;
case ACT_ACT:
case ACT_360: // u ACT je to nejjednodussi, staci
case ACT_365: // odecist seriovy cisla
num = end.Serial() - start.Serial();
break;
}
switch( abasis )
{
case US_30_360:
case ISMA_30_360:
case ACT_360:
case NL_360:
denum=360;
break;
case US_30_365:
case ISMA_30_365:
case ACT_365:
case NL_365:
denum=365;
break;
case US_30_ACT:
case ISMA_30_ACT:
case ACT_ACT:
case NL_ACT:
TDate dt1,dt2;
int ndays;
int yearend;
if( start.IsLeap() ) // zacina obdobi v prestupnem roce?
{
dt1=TDate(29,2,ys); // obsahuje obdobi den 29.2.?
if( dt1.Serial()>=ss && dt1.Serial()<=se )
ndays=366; // ano...proto je nutne vzit 366 dnu
else
ndays=365; // je to sice prestupny rok, ale
// 29.2.byl uz pred zacatkem obdobi
}
else
ndays=365; // neprestupny rok, proto 365
dt2=TDate(31,12,ys);
yearend=dt2.Serial();
if( se<=yearend )
denum=ndays; // cele obdobi lezi v jednom kalendarnim
else // roce
{
denum=(floating)(yearend-ss)/ndays;
if( end.IsLeap() ) // konci obdobi v prestupnem roce?
{
dt1=TDate(29,2,ye); // obsahuje obdobi den 29.2.?
if(dt1.Serial()<=se)
ndays=366;
else
ndays=365;
}
else
ndays=365;
dt2=TDate(31,12,ye-1);
denum+=(floating)(se-dt2.Serial())/ndays + (ye-ys-1);
denum=(floating)(se-ss)/(denum);
}
break;
}
floating result = sign*num/denum;
return result;
}
int NDays( const TDate& afrom, const TDate& ato, int abasis )
{
int ds,ms,ys; // day, month, year - start date
int de,me,ye; // day, month, year - end date
int num=0; // 'num'erator
int yearStartSerial;
afrom.Validate();
ato.Validate();
afrom.Get( ds,ms,ys );
ato.Get( de,me,ye );
switch( abasis<NONEOM_start? abasis:abasis-NONEOM_start )
// ve funknci YearFrac neni treba NOEOM
// modifikator brat v uvahu
{
case US_30_360:
case US_30_365:
case US_30_ACT:
if( de==31 ) // americka konvence 30/360 (365,ACT)
{ // ma spoustu zajimavosti:
de=30; num=1; // - 1.5.-31.5. = 30
} // - prestupne roky 29.2.-1.3. = 1
if( afrom.IsMonthEnd() || ds==30 )
{ // - neprestupne 28.2.-1.3. = 1
ds=1; ms++; //
if( ms==13 ) // princip uprav
// 1.pokud konec obdobi padne na 31. den
{ // posuneme to na 30. a pricteme 1
ms=1; // 2.pokud zacatek obdobi padne na
ys++; // konec mesice, posuneme to na zacatek
} // dalsiho mesice a pricteme 1
num=1; // 3.pokud nastane zaroven 1&2, nepricteme
} // 2, ale jen 1
num += (ye-ys)*360 + (me-ms)*30 + (de-ds);
break;
case ISMA_30_360:
case ISMA_30_365:
case ISMA_30_ACT: // evropska ISMA 30/360 (365,ACT)
if( ds==31 ) // je v porovnani s americkou jednodussi
ds = 30; // staci posunout 31.dny na 30.
if( de==31 )
de = 30;
num = (ye-ys)*360 + (me-ms)*30 + (de-ds);
break;
case ACT_ACT:
case ACT_360: // u ACT je to nejjednodussi, staci
case ACT_365: // odecist seriovy cisla
num = ato.Serial() - afrom.Serial();
break;
case ACT_ACT_ISDA:
floating denumNext, denumPrev;
if( ato.IsLeap() ) {
denumNext = 366.0;
}
else {
denumNext = 365.0;
}
if( afrom.IsLeap() ) {
denumPrev = 366.0;
}
else {
denumPrev = 365.0;
}
yearStartSerial = TDate(1,1,ye).Serial();
num = ( (ato.Serial()-yearStartSerial)*denumPrev
+ (yearStartSerial-afrom.Serial())*denumNext ) / 365.0;
break;
case NL_360:
case NL_365:
case NL_ACT:
TDate dummy_dt;
num = (ye-ys)*365;
if( me==2 && de==29 )
de = 28;
if( ms==2 && ds==29 )
ds = 28;
dummy_dt.Set(ds,ms,1997);
num -= dummy_dt.Serial();
dummy_dt.Set(de,me,1997);
num += dummy_dt.Serial();
break;
}
return num;
}
floating Denum( const TDate& prevcpn, const TDate& nextcpn,
int afrequency, int abasis )
{
floating denum;
switch( abasis<NONEOM_start? abasis : abasis-NONEOM_start )
{
case ACT_ACT:
case ISMA_30_ACT:
case US_30_ACT:
case NL_ACT:
denum = nextcpn.Serial()-prevcpn.Serial();
break;
case ACT_ACT_ISDA:
floating denumNext, denumPrev;
if( nextcpn.IsLeap() ) {
denumNext = 366.0;
}
else {
denumNext = 365.0;
}
if( prevcpn.IsLeap() ) {
denumPrev = 366.0;
}
else {
denumPrev = 365.0;
}
denum = denumNext * denumPrev / 365.0 / afrequency;
break;
case ACT_360:
case ISMA_30_360:
case US_30_360:
case NL_360:
denum = (floating)360.0/afrequency;
break;
case ACT_365:
case ISMA_30_365:
case US_30_365:
case NL_365:
denum = (floating)365.0/afrequency;
break;
default:
throw TExFINAL( "Unknown daycount basis. Accrued interest cannot be expressed." );
}
return denum;
}
} // end of namespace