forked from hebcal/hebcal
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sedra.c
344 lines (303 loc) · 10.8 KB
/
sedra.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
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
/*
Hebcal - A Jewish Calendar Generator
Copyright (C) 1994 Danny Sadinoff
Portions Copyright (c) 2002 Michael J. Radwin. All Rights Reserved.
https://github.com/hebcal/hebcal
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 2
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, write to the Free Software
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
Danny Sadinoff can be reached at
*/
/*
* Many of the following algorithms were taken from hebrew calendar
* routines by Maimonedes, from his Mishneh Torah, and implemented by
* Nachum Dershowitz Department of Computer Science
* (217) 333-4219 University of Illinois at Urbana-Champaign
* [email protected] 1304 West Springfield Avenue
* Urbana, Illinois 61801
*
* The routines were included in the emacs 19 distribution.
*
*/
#include <string.h>
#include "greg.h"
#include "hebcal.h"
#include "sedra.h"
#include "common.h"
static const char *sedrot[] =
{
"Bereshit",
"Noach",
"Lech-Lecha",
"Vayera",
"Chayei Sara",
"Toldot",
"Vayetzei",
"Vayishlach",
"Vayeshev",
"Miketz",
"Vayigash",
"Vayechi",
"Shemot",
"Vaera",
"Bo",
"Beshalach",
"Yitro",
"Mishpatim",
"Terumah",
"Tetzaveh",
"Ki Tisa",
"Vayakhel",
"Pekudei",
"Vayikra",
"Tzav",
"Shmini",
"Tazria",
"Metzora",
"Achrei Mot",
"Kedoshim",
"Emor",
"Behar",
"Bechukotai",
"Bamidbar",
"Nasso",
"Beha'alotcha",
"Sh'lach",
"Korach",
"Chukat",
"Balak",
"Pinchas",
"Matot",
"Masei",
"Devarim",
"Vaetchanan",
"Eikev",
"Re'eh",
"Shoftim",
"Ki Teitzei",
"Ki Tavo",
"Nitzavim",
"Vayeilech",
"Ha'Azinu",
};
#define INCOMPLETE 0
#define REGULAR 1
#define COMPLETE 2
/* parsha doubler */
#define D(p) (-(p))
/* parsha undoubler */
#define U(p) (-(p))
/*
* These indices were originally included in the emacs 19 distribution.
* These arrays determine the correct indices into the parsha names
* -1 means no parsha that week.
*/
static int Sat_short[] = {
-1, 52, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 18, 19, 20, D(21), 23, 24, -1, 25, D(26), D(28), 30, D(31), 33, 34, 35, 36, 37, 38, 39, 40, D(41), 43, 44, 45, 46, 47,
48, 49, 50 };
static int Sat_long[] = {
-1, 52, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
17, 18, 19, 20, D(21), 23, 24, -1, 25, D(26), D(28), 30, D(31), 33, 34, 35, 36, 37, 38, 39, 40, D(41), 43, 44, 45, 46, 47,
48, 49, D(50) };
static int Mon_short[] = {
51, 52, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
18, 19, 20, D(21), 23, 24, -1, 25, D(26), D(28), 30, D(31), 33, 34, 35, 36, 37, 38, 39, 40, D(41), 43, 44, 45, 46, 47, 48,
49, D(50) };
static int Mon_long[] = {
51, 52, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, D(21), 23, 24, -1, 25, D(26), D(28),
30, D(31), 33, -1, 34, 35, 36, 37, D(38), 40, D(41), 43, 44, 45, 46, 47, 48, 49, D(50) };
static int Thu_normal[] = {
52, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
18, 19, 20, D(21), 23, 24, -1, -1, 25, D(26), D(28), 30, D(31), 33, 34, 35, 36, 37, 38, 39, 40, D(41), 43, 44, 45, 46, 47,
48, 49, 50 };
static int Thu_normal_Israel[] = {
52, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
16, 17, 18, 19, 20, D(21), 23, 24, -1, 25, D(26), D(28), 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, D(41), 43, 44, 45,
46, 47, 48, 49, 50 };
static int Thu_long[] = {
52, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,
18, 19, 20, 21, 22, 23, 24, -1, 25, D(26), D(28), 30, D(31), 33, 34, 35, 36, 37, 38, 39, 40, D(41), 43, 44, 45, 46, 47,
48, 49, 50 };
static int Sat_short_leap[] = {
-1, 52, -1, -1, 0, 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, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, D(41),
43, 44, 45, 46, 47, 48, 49, D(50) };
static int Sat_long_leap[] = {
-1, 52, -1, -1, 0, 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, -1, 28, 29, 30, 31, 32, 33, -1, 34, 35, 36, 37, D(38), 40, D(41),
43, 44, 45, 46, 47, 48, 49, D(50) };
static int Mon_short_leap[] = {
51, 52, -1, 0, 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, -1, 28, 29, 30, 31, 32, 33, -1, 34, 35, 36, 37, D(38), 40, D(41), 43,
44, 45, 46, 47, 48, 49, D(50) };
static int Mon_short_leap_Israel[] = {
51, 52, -1, 0, 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, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
D(41), 43, 44, 45, 46, 47, 48, 49, D(50) };
static int Mon_long_leap[] = {
51, 52, -1, 0, 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, -1, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, D(41),
43, 44, 45, 46, 47, 48, 49, 50 };
static int Mon_long_leap_Israel[] = {
51, 52, -1, 0, 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, -1, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
41, 42, 43, 44, 45, 46, 47, 48, 49, 50 };
static int Thu_short_leap[] = {
52, -1, -1, 0, 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, -1, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 44, 45, 46, 47, 48, 49, 50 };
static int Thu_long_leap[] = {
52, -1, -1, 0, 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, -1, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42,
43, 44, 45, 46, 47, 48, 49, D(50) };
static int *theSedraArray;
static size_t sedraNumWeeks;
static long int first_saturday;
/* sets static globals based on this year. */
void reset_sedra( int hebYr ) /* the hebrew year */
{
date_t tempDt;
int long_c, short_k, rosh_hashana_day, type;
long int rosh_hashana;
size_t theSedraArraySize;
long_c = long_cheshvan (hebYr);
short_k = short_kislev (hebYr);
if (long_c && !short_k)
type = COMPLETE;
else if (!long_c && short_k)
type = INCOMPLETE;
else
type = REGULAR;
tempDt.dd = 1;
tempDt.mm = TISHREI;
tempDt.yy = hebYr;
rosh_hashana = hebrew2abs (tempDt);
rosh_hashana_day = (int) (rosh_hashana % 7L);
/* find the first saturday on or after Rosh Hashana */
first_saturday = day_on_or_before (6, rosh_hashana + 6L);
if (!LEAP_YR_HEB(hebYr)) {
switch (rosh_hashana_day) {
case SAT:
if (type == INCOMPLETE) {
theSedraArray = Sat_short;
theSedraArraySize = sizeof(Sat_short);
} else if (type == COMPLETE) {
theSedraArray = Sat_long;
theSedraArraySize = sizeof(Sat_long);
}
break;
case MON:
if (type == INCOMPLETE) {
theSedraArray = Mon_short;
theSedraArraySize = sizeof(Mon_short);
} else if (type == COMPLETE) {
theSedraArray = israel_sw ? Mon_short : Mon_long;
theSedraArraySize = israel_sw ? sizeof(Mon_short) : sizeof(Mon_long);
}
break;
case TUE:
if (type == REGULAR) {
theSedraArray = israel_sw ? Mon_short : Mon_long;
theSedraArraySize = israel_sw ? sizeof(Mon_short) : sizeof(Mon_long);
}
break;
case THU:
if (type == REGULAR) {
theSedraArray = israel_sw ? Thu_normal_Israel : Thu_normal;
theSedraArraySize = israel_sw ? sizeof(Thu_normal_Israel) : sizeof(Thu_normal);
} else if (type == COMPLETE) {
theSedraArray = Thu_long;
theSedraArraySize = sizeof(Thu_long);
}
break;
default:
die ("improper sedra year type calculated.", "");
}
} else {
/* leap year */
switch (rosh_hashana_day) {
case SAT:
if (type == INCOMPLETE) {
theSedraArray = Sat_short_leap;
theSedraArraySize = sizeof(Sat_short_leap);
} else if (type == COMPLETE) {
theSedraArray = israel_sw ? Sat_short_leap : Sat_long_leap;
theSedraArraySize = israel_sw ? sizeof(Sat_short_leap) : sizeof(Sat_long_leap);
}
break;
case MON:
if (type == INCOMPLETE) {
theSedraArray = israel_sw ? Mon_short_leap_Israel : Mon_short_leap;
theSedraArraySize = israel_sw ? sizeof(Mon_short_leap_Israel) : sizeof(Mon_short_leap);
} else if (type == COMPLETE) {
theSedraArray = israel_sw ? Mon_long_leap_Israel : Mon_long_leap;
theSedraArraySize = israel_sw ? sizeof(Mon_long_leap_Israel) : sizeof(Mon_long_leap);
}
break;
case TUE:
if (type == REGULAR) {
theSedraArray = israel_sw ? Mon_long_leap_Israel : Mon_long_leap;
theSedraArraySize = israel_sw ? sizeof(Mon_long_leap_Israel) : sizeof(Mon_long_leap);
}
break;
case THU:
if (type == INCOMPLETE) {
theSedraArray = Thu_short_leap;
theSedraArraySize = sizeof(Thu_short_leap);
} else if (type == COMPLETE) {
theSedraArray = Thu_long_leap;
theSedraArraySize = sizeof(Thu_long_leap);
}
break;
default:
die ("improper sedra year type calculated.", "");
}
}
sedraNumWeeks = theSedraArraySize / sizeof(int);
}
/* Fills input "buf" of size buf_len with a string "Parshat <parsha>"
based on the current parsha number, and returns 1; or returns 0 if
it can't find the parsha for some reason.
*/
int sedra( long absDate, char *buf, int buf_len )
{
int index;
int weekNum;
/* find the first saturday on or after today's date */
absDate = day_on_or_before (6, absDate + 6L);
weekNum = (absDate - first_saturday) / 7;
if (weekNum >= sedraNumWeeks) {
int indexLast = theSedraArray[sedraNumWeeks - 1];
if (indexLast < 0) {
/* advance 2 parashiyot ahead after a doubled week */
index = U(indexLast) + 2;
} else {
index = indexLast + 1;
}
} else {
index = theSedraArray[weekNum];
}
*buf = '\0'; /* reset the return buffer */
if (index >= 0)
strncpy (buf, LANGUAGE2(sedrot[index]), buf_len);
else if (-1 == index)
return 0;
else
{
int i = U (index); /* undouble the parsha */
sprintf (buf, "%s-%s",
LANGUAGE2(sedrot[i]),
LANGUAGE2(sedrot[i + 1]));
}
return 1;
}