-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathastm.cpp
245 lines (150 loc) · 4.65 KB
/
astm.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
#include "astm.h"
#include <math.h>
#include <stdio.h>
// year month day hour minute second
double JD(int y, int m, int d, int h, int mi, double s)
{
double jd, dd ;
dd = d_d(2000, 1, 1, 12, 0, 0, y, m, d, h, mi, s) ;
jd = 2451545.0 + dd ;
return jd ;
}
// year 0 month 0 day 0 hour 0 minute 0 sec 0 year month day hour minute second
double d_d(int y0, int m0, int d0, int h0, int mi0, double s0, int y, int m, int d, int h, int mi, double s)
{
int month[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31} ;
int year ;
double diff = 0 ; // day difference
if (y0 < y)
{
year = y0 + 1 ;
if ( ( (y0 % 4) == 0 ) && ( ( (y0 % 100) != 0) || ( (y0 % 400) == 0) ) )
month[1] = 29 ;
diff += month[m0 - 1] - d0 + 1 ;
diff += - double(h0) / 24 - double(mi0) / 1440 - s0 / 86400 ; // hour in day
for (int c = m0; c < 12; c++)
diff += month[c] ;
// that was days to the end of year y0
// now we will have days since y
// because all years between are calulated later
diff += d - 1 ;
diff += double(h) / 24 + double(mi) / 1440 + s / 86400 ;
if ( ( (y % 4) == 0 ) && ( ( (y % 100) != 0) || ( (y % 400) == 0) ) )
month[1] = 29 ;
else
month[1] = 28 ;
for(int i = 0; i < (m - 1); i++)
diff += month[i] ;
}
else if (y < y0)
{
year = y + 1 ;
if ( ( (y % 4) == 0 ) && ( ( (y % 100) != 0) || ( (y % 400) == 0) ) )
month[1] = 29 ;
diff += month[m - 1] - d + 1 ;
diff += - double(h) / 24 - double(mi) / 1440 - s / 86400 ; // hour in day
for (int c = m; c < 12; c++)
diff += month[c] ;
// that was days to the end of year y
// now we will have days since y0
// because all years between are calulated later
diff += d0 - 1 ;
diff += double(h0) / 24 + double(mi0) / 1440 + s0 / 86400 ;
if ( ( (y0 % 4) == 0 ) && ( ( (y0 % 100) != 0) || ( (y0 % 400) == 0) ) )
month[1] = 29 ;
else
month[1] = 28 ;
for(int i = 0; i < (m0 - 1); i++)
diff += month[i] ;
}
else // if y0 == y
{
if ( ( (y0 % 4) == 0 ) && ( ( (y0 % 100) != 0) || ( (y0 % 400) == 0) ) )
month[1] = 29 ;
if (m0 < m)
{
diff += month[m0 - 1] - d0 + 1 ;
diff += -double(h0) / 24 - double(mi0) / 1440 - s0 / 86400 ;
diff += d - 1 ;
diff += double(h) / 24 + double(mi) / 1440 + s / 86400 ;
for (int i = m0; i < m - 1; i++)
diff += month[i] ;
}
else if (m0 > m)
{
diff += month[m - 1] - d + 1 ;
diff += -double(h) / 24 - double(mi) / 1440 - s / 86400 ;
diff += d0 - 1 ;
diff += double(h0) / 24 + double(mi0) / 1440 + s0 / 86400 ;
for (int i = m; i < m0 - 1; i++)
diff += month[i] ;
// printf("lol\n") ;
diff = -diff ;
}
else
{
diff += d - d0 ;
diff += double(h) / 24 + double(mi) / 1440 + s / 86400 ;
diff += -double(h0) / 24 - double(mi0) / 1440 - s0 / 86400 ;
}
}
for (int i = 1; i < abs(y0 - y); i++)
{
if ( ( (year % 4) == 0 ) && ( ( (year % 100) != 0) || ( (year % 400) == 0) ) ) // leap?
diff += 366 ;
else
diff += 365 ;
year++ ;
}
if (y < y0)
diff = -diff ;
return diff ;
}
double GMST(int y, int m, int d, int h, int mi, double s)
{
double D, T, gmst ;
D = JD(y, m, d, 0, 0, 0) - 2451545 ;
T = D / 36525 ;
gmst = 24110.54841 + 8640184.812866 * T + 0.093104 * T * T
- 0.00000632 * T * T * T ;
gmst *= 0.0002777777777777778 ;
gmst += ( h + mi * 0.01666666666667 + s * 0.0002777777777777 ) * 1.0027379093382884 ;
gmst = fmod(gmst, 24.0) ;
return gmst ;
}
double TAI(int y, int m, int d, int h, int mi, double s)
{
int n = 2020 - 1972 + 1 ; // limit array
double TAI ;
int leap[n][2] = { {1,1}, {0,1}, {0,1}, {0,1}, {0,1}, {0,1}, {0,1}, {0,1}, {0,0}, {1,0},
{1,0}, {1,0}, {0,0}, {1,0}, {0,0}, {0,1}, {0,0}, {0,1}, {0,1}, {0,0},
{1,0}, {1,0}, {1,0}, {0,1}, {0,0}, {1,0}, {0,1}, {0,0}, {0,0}, {0,0},
{0,0}, {0,0}, {0,0}, {0,1}, {0,0}, {0,0}, {0,1}, {0,0}, {0,0}, {0,0},
{1,0}, {0,0}, {0,0}, {1,0}, {0,1}, {0,0}, {0,0}, {0,0}, {0,0} } ; // leap seconds each year since 1972.
// Yes, I am masochist
int l = 10 ; // leap seconds
for (int i = 0; i < (y - 1972); i++)
{
if (i == n)
break ;
l += leap[i][0] + leap[i][1] ;
}
if ( ( (y - 1972) < n ) and (m > 6) )
l += leap[y - 1972][0] ;
TAI = h + double(mi) * 0.01666666666666666 + (s + double(l)) * 2.777777777777777777e-4 ;
return TAI ;
}
double GPS(int y, int m, int d, int h, int mi, double s)
{
double gps ;
gps = TAI(y, m, d, h, mi, s) - 5.27777777777777777778e-3 ;
if (gps < 0)
gps += 24 ;
return gps ;
}
double TT(int y, int m, int d, int h, int mi, double s)
{
double tt ;
tt = fmod( TAI(y, m, d, h, mi, s) + 8.94e-3, 24 ) ;
return tt ;
}