-
Notifications
You must be signed in to change notification settings - Fork 7
/
dt_weekday.c
250 lines (222 loc) · 6.45 KB
/
dt_weekday.c
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
/*
* Copyright (c) 2012-2015 Christian Hansen <[email protected]>
* <https://github.com/chansen/c-dt>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stddef.h>
#include "dt_core.h"
#include "dt_weekday.h"
dt_t
dt_from_nth_weekday_in_year(int y, int nth) {
dt_t dt;
if (nth > 0) {
dt = dt_add_weekdays(dt_from_yd(y, 0), nth);
if (nth <= 52 * 5 || dt <= dt_from_yd(y + 1, 0))
return dt;
}
else if (nth < 0) {
dt = dt_add_weekdays(dt_from_yd(y + 1, 1), nth);
if (nth >= -52 * 5 || dt >= dt_from_yd(y, 1))
return dt;
}
return 0;
}
dt_t
dt_from_nth_weekday_in_quarter(int y, int q, int nth) {
dt_t dt;
if (nth > 0) {
dt = dt_add_weekdays(dt_from_yqd(y, q, 0), nth);
if (nth <= 12 * 5 || dt <= dt_from_yqd(y, q + 1, 0))
return dt;
}
else if (nth < 0) {
dt = dt_add_weekdays(dt_from_yqd(y, q + 1, 1), nth);
if (nth >= -12 * 5 || dt >= dt_from_yqd(y, q, 1))
return dt;
}
return 0;
}
dt_t
dt_from_nth_weekday_in_month(int y, int m, int nth) {
dt_t dt;
if (nth > 0) {
dt = dt_add_weekdays(dt_from_ymd(y, m, 0), nth);
if (nth <= 4 * 5 || dt <= dt_from_ymd(y, m + 1, 0))
return dt;
}
else if (nth < 0) {
dt = dt_add_weekdays(dt_from_ymd(y, m + 1, 1), nth);
if (nth >= -4 * 5 || dt >= dt_from_ymd(y, m, 1))
return dt;
}
return 0;
}
dt_t
dt_nth_weekday_in_year(dt_t dt, int nth) {
int y;
dt_to_yd(dt, &y, NULL);
return dt_from_nth_weekday_in_year(y, nth);
}
dt_t
dt_nth_weekday_in_quarter(dt_t dt, int nth) {
int y, q;
dt_to_yqd(dt, &y, &q, NULL);
return dt_from_nth_weekday_in_quarter(y, q, nth);
}
dt_t
dt_nth_weekday_in_month(dt_t dt, int nth) {
int y, m;
dt_to_ymd(dt, &y, &m, NULL);
return dt_from_nth_weekday_in_month(y, m, nth);
}
int
dt_weekday_in_year(dt_t dt, bool end) {
int y;
dt_t start;
if (!dt_is_weekday(dt))
return 0;
dt_to_yd(dt, &y, NULL);
if (!end)
start = dt_from_yd(y, 1);
else {
start = dt_from_yd(y + 1, 0);
if (start == dt)
return -1;
}
return dt_delta_weekdays(start, dt, true);
}
int
dt_weekday_in_quarter(dt_t dt, bool end) {
int y, q;
dt_t start;
if (!dt_is_weekday(dt))
return 0;
dt_to_yqd(dt, &y, &q, NULL);
if (!end)
start = dt_from_yqd(y, q, 1);
else {
start = dt_from_yqd(y, q + 1, 0);
if (start == dt)
return -1;
}
return dt_delta_weekdays(start, dt, true);
}
int
dt_weekday_in_month(dt_t dt, bool end) {
int y, m;
dt_t start;
if (!dt_is_weekday(dt))
return 0;
dt_to_ymd(dt, &y, &m, NULL);
if (!end)
start = dt_from_ymd(y, m, 1);
else {
start = dt_from_ymd(y, m + 1, 0);
if (start == dt)
return -1;
}
return dt_delta_weekdays(start, dt, true);
}
bool
dt_is_weekday(dt_t dt) {
return (dt_dow(dt) <= DT_FRIDAY);
}
dt_t
dt_next_weekday(dt_t dt, bool current) {
static const int T[2][8] = {
/* M T W T F S S */
{ 0,1,1,1,1,3,2,1 },
{ 0,0,0,0,0,0,2,1 },
};
return dt + T[!!current][dt_dow(dt)];
}
dt_t
dt_prev_weekday(dt_t dt, bool current) {
static const int T[2][8] = {
/* M T W T F S S */
{ 0,3,1,1,1,1,1,2 },
{ 0,0,0,0,0,0,1,2 },
};
return dt - T[!!current][dt_dow(dt)];
}
dt_t
dt_add_weekdays(dt_t dt, int delta) {
int w, d;
if (!delta)
return dt;
w = delta / 5;
d = delta - 5 * w;
if (delta > 0) {
static const int T[35] = {
/* 0 1 2 3 4 (+n days) */
/* M */ 0,1,2,3,4,
/* T */ 0,1,2,3,6,
/* W */ 0,1,2,5,6,
/* T */ 0,1,4,5,6,
/* F */ 0,3,4,5,6,
/* S */ -1,2,3,4,5,
/* S */ -2,1,2,3,4,
};
return dt + 7 * w + T[5 * dt_dow(dt) - 5 + d];
}
else {
static const int T[35] = {
/* 0 1 2 3 4 (-n days) */
/* M */ 0,3,4,5,6,
/* T */ 0,1,4,5,6,
/* W */ 0,1,2,5,6,
/* T */ 0,1,2,3,6,
/* F */ 0,1,2,3,4,
/* S */ -2,1,2,3,4,
/* S */ -1,2,3,4,5,
};
return dt + 7 * w - T[5 * dt_dow(dt) - 5 - d];
}
}
int
dt_delta_weekdays(dt_t dt1, dt_t dt2, bool inclusive) {
static const int T[98] = {
/* M T W T F S S (exclusive) */
/* M */ 0,1,2,3,4,4,4,
/* T */ 4,0,1,2,3,3,3,
/* W */ 3,4,0,1,2,2,2,
/* T */ 2,3,4,0,1,1,1,
/* F */ 1,2,3,4,0,0,0,
/* S */ 0,1,2,3,4,0,0,
/* S */ 0,1,2,3,4,5,0,
/* M T W T F S S (inclusive) */
/* M */ 1,2,3,4,5,5,5,
/* T */ 5,1,2,3,4,4,4,
/* W */ 4,5,1,2,3,3,3,
/* T */ 3,4,5,1,2,2,2,
/* F */ 2,3,4,5,1,1,1,
/* S */ 1,2,3,4,5,0,0,
/* S */ 1,2,3,4,5,5,0,
};
const int d1 = dt_dow(dt1);
const int d2 = dt_dow(dt2);
if (dt1 <= dt2)
return 5 * ((dt2 - dt1) / 7) + T[7 * d1 + d2 - 8 + (49 * !!inclusive)];
else
return 5 * ((dt2 - dt1) / 7) - T[7 * d2 + d1 - 8 + (49 * !!inclusive)];
}