forked from bunkat/later
-
Notifications
You must be signed in to change notification settings - Fork 0
/
later.js
2157 lines (1924 loc) · 77.3 KB
/
later.js
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
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* Later.js 0.0.1
* (c) 2012 Bill, BunKat LLC.
* Later is freely distributable under the MIT license.
* For all details and documentation:
* http://bunkat.github.com/later
*/
(function () {
"use strict";
/**
* Parses a cron expression and produces a schedule that is compatible
* with Later.js. See http://en.wikipedia.org/wiki/Cron for details of
* the cron format.
*/
var CronParser = function () {
// Constant array to convert valid names to values
var NAMES = {
JAN: 1, FEB: 2, MAR: 3, APR: 4, MAY: 5, JUN: 6, JUL: 7, AUG: 8,
SEP: 9, OCT: 10, NOV: 11, DEC: 12,
SUN: 1, MON: 2, TUE: 3, WED: 4, THU: 5, FRI: 6, SAT: 7
};
// Contains the index, min, and max for each of the constraints
var FIELDS = {
s: [0, 0, 59], // seconds
m: [1, 0, 59], // minutes
h: [2, 0, 23], // hours
D: [3, 1, 31], // day of month
M: [4, 1, 12], // month
Y: [6, 1970, 2099], // year
d: [5, 1, 7, 1] // day of week
};
/**
* Returns the value + offset if value is a number, otherwise it
* attempts to look up the value in the NAMES table and returns
* that result instead.
*
* @param {Int,String} value: The value that should be parsed
* @param {Int} offset: Any offset that must be added to the value
*/
var getValue = function(value, offset) {
return isNaN(value) ? NAMES[value] : +value + (offset || 0);
};
/**
* Returns a deep clone of a schedule skipping any day of week
* constraints.
*
* @param {Sched} sched: The schedule that will be cloned
*/
var cloneSchedule = function(sched) {
var clone = {}, field;
for(field in sched) {
if (field !== 'dc' && field !== 'd') {
clone[field] = sched[field].slice(0);
}
}
return clone;
};
/**
* Adds values to the specified constraint in the current schedule.
*
* @param {Sched} sched: The schedule to add the constraint to
* @param {String} name: Name of constraint to add
* @param {Int} min: Minimum value for this constraint
* @param {Int} max: Maximum value for this constraint
* @param {Int} inc: The increment to use between min and max
*/
var add = function (sched, name, min, max, inc) {
var i = min;
if (!sched[name]) {
sched[name] = [];
}
while (i <= max) {
if (sched[name].indexOf(i) < 0) {
sched[name].push(i);
}
i += inc || 1;
}
};
/**
* Adds a hash item (of the form x#y or xL) to the schedule.
*
* @param {Schedule} schedules: The current schedule array to add to
* @param {Schedule} curSched: The current schedule to add to
* @param {Int} value: The value to add (x of x#y or xL)
* @param {Int} hash: The hash value to add (y of x#y)
*/
var addHash = function(schedules, curSched, value, hash) {
// if there are any existing day of week constraints that
// aren't equal to the one we're adding, create a new
// composite schedule
if ((curSched.d && !curSched.dc) ||
(curSched.dc && curSched.dc.indexOf(hash) < 0)) {
schedules.push(cloneSchedule(curSched));
curSched = schedules[schedules.length-1];
}
add(curSched, 'd', value, value);
add(curSched, 'dc', hash, hash);
};
var addWeekday = function(s, curSched, value) {
var except1 = {}, except2 = {};
if (value=== 1) {
// cron doesn't pass month boundaries, so if 1st is a
// weekend then we need to use 2nd or 3rd instead
add(curSched, 'D', 1, 3);
add(curSched, 'd', NAMES.MON, NAMES.FRI);
add(except1, 'D', 2, 2);
add(except1, 'd', NAMES.TUE, NAMES.FRI);
add(except2, 'D', 3, 3);
add(except2, 'd', NAMES.TUE, NAMES.FRI);
} else {
// normally you want the closest day, so if v is a
// Saturday, use the previous Friday. If it's a
// sunday, use the following Monday.
add(curSched, 'D', value-1, value+1);
add(curSched, 'd', NAMES.MON, NAMES.FRI);
add(except1, 'D', value-1, value-1);
add(except1, 'd', NAMES.MON, NAMES.THU);
add(except2, 'D', value+1, value+1);
add(except2, 'd', NAMES.TUE, NAMES.FRI);
}
s.exceptions.push(except1);
s.exceptions.push(except2);
};
/**
* Adds a range item (of the form x-y/z) to the schedule.
*
* @param {String} item: The cron expression item to add
* @param {Schedule} curSched: The current schedule to add to
* @param {String} name: The name to use for this constraint
* @param {Int} min: The min value for the constraint
* @param {Int} max: The max value for the constraint
* @param {Int} offset: The offset to apply to the cron value
*/
var addRange = function(item, curSched, name, min, max, offset) {
// parse range/x
var incSplit = item.split('/')
, inc = +incSplit[1]
, range = incSplit[0];
// parse x-y or * or 0
if (range !== '*' && range !== '0') {
var rangeSplit = range.split('-');
min = getValue(rangeSplit[0], offset);
max = getValue(rangeSplit[1], offset);
}
add(curSched, name, min, max, inc);
};
/**
* Parses a particular item within a cron expression.
*
* @param {String} item: The cron expression item to parse
* @param {Schedule} s: The existing set of schedules
* @param {String} name: The name to use for this constraint
* @param {Int} min: The min value for the constraint
* @param {Int} max: The max value for the constraint
* @param {Int} offset: The offset to apply to the cron value
*/
var parse = function(item, s, name, min, max, offset) {
var value
, split
, schedules = s.schedules
, curSched = schedules[schedules.length-1];
// L just means min - 1 (this also makes it work for any field)
if (item === 'L') {
item = min - 1;
}
// parse x
if ((value = getValue(item, offset)) != null) {
add(curSched, name, value, value);
}
// parse xW
else if ((value = getValue(item.replace('W', ''), offset)) != null) {
addWeekday(s, curSched, value);
}
// parse xL
else if ((value = getValue(item.replace('L', ''), offset)) != null) {
addHash(schedules, curSched, value, min-1);
}
// parse x#y
else if ((split = item.split('#')).length === 2) {
value = getValue(split[0], offset);
addHash(schedules, curSched, value, getValue(split[1]));
}
// parse x-y or x-y/z or */z or 0/z
else {
addRange(item, curSched, name, min, max, offset);
}
};
/**
* Returns true if the item is either of the form x#y or xL.
*
* @param {String} item: The expression item to check
*/
var isHash = function(item) {
return item.indexOf('#') > -1 || item.indexOf('L') > 0;
};
var itemSorter = function(a,b) {
return isHash(a) && !isHash(b) ? 1 : 0;
};
/**
* Parses each of the fields in a cron expression. The expression must
* include the seconds field, the year field is optional.
*
* @param {String} expr: The cron expression to parse
*/
var parseExpr = function(expr) {
var schedule = {schedules: [{}], exceptions: []}
, components = expr.split(' ')
, field, f, component, items;
for(field in FIELDS) {
f = FIELDS[field];
component = components[f[0]];
if (component && component !== '*' && component !== '?') {
// need to sort so that any #'s come last, otherwise
// schedule clones to handle # won't contain all of the
// other constraints
items = component.split(',').sort(itemSorter);
var i, length = items.length;
for (i = 0; i < length; i++) {
parse(items[i], schedule, field, f[1], f[2], f[3]);
}
}
}
return schedule;
};
return {
/**
* Parses a valid cron expression and produces a valid schedule that
* can then be used with Later.
*
* CronParser().parse('* 5 * * * * *', true);
*
* @param {String} expr: The cron expression to parse
* @param {Bool} hasSeconds: True if the expression uses a seconds field
* @api public
*/
parse: function (expr, hasSeconds) {
var e = expr.toUpperCase();
return parseExpr(hasSeconds ? e : '0 ' + e);
}
};
};
/**
* Allow library to be used within both the browser and node.js
*/
var root = typeof exports !== "undefined" && exports !== null ? exports : window;
root.cronParser = CronParser;
}).call(this);/**
* Later.js 0.0.1
* (c) 2012 Bill, BunKat LLC.
* Later is freely distributable under the MIT license.
* For all details and documentation:
* http://bunkat.github.com/later
*/
var root = typeof exports !== "undefined" && exports !== null ? exports : window;
var recur = root.recur;
if (!recur && (typeof require !== 'undefined')) {
recur = require('./recur').recur;
}
(function () {
"use strict";
/**
* Parses an English string expression and produces a schedule that is
* compatible with Later.js.
*
* Examples:
*
* every 5 minutes between the 1st and 30th minute
* at 10:00 am on tues of may in 2012
* on the 15-20th day of march-dec
* every 20 seconds every 5 minutes every 4 hours between the 10th and 20th hour
*/
var EnParser = function () {
var pos = 0
, input = ''
, error;
// Regex expressions for all of the valid tokens
var TOKENTYPES = {
eof: /^$/,
rank: /^((\d\d\d\d)|([2-5]?1(st)?|[2-5]?2(nd)?|[2-5]?3(rd)?|(0|[1-5]?[4-9]|[1-5]0|1[1-3])(th)?))\b/,
time: /^((([0]?[1-9]|1[0-2]):[0-5]\d(\s)?(am|pm))|(([0]?\d|1\d|2[0-3]):[0-5]\d))\b/,
dayName: /^((sun|mon|tue(s)?|wed(nes)?|thu(r(s)?)?|fri|sat(ur)?)(day)?)\b/,
monthName: /^(jan(uary)?|feb(ruary)?|ma((r(ch)?)?|y)|apr(il)?|ju(ly|ne)|aug(ust)?|oct(ober)?|(sept|nov|dec)(ember)?)\b/,
yearIndex: /^(\d\d\d\d)\b/,
every: /^every\b/,
after: /^after\b/,
second: /^(s|sec(ond)?(s)?)\b/,
minute: /^(m|min(ute)?(s)?)\b/,
hour: /^(h|hour(s)?)\b/,
day: /^(day(s)?( of the month)?)\b/,
dayInstance: /^day instance\b/,
dayOfWeek: /^day(s)? of the week\b/,
dayOfYear: /^day(s)? of the year\b/,
weekOfYear: /^week(s)?( of the year)?\b/,
weekOfMonth: /^week(s)? of the month\b/,
weekday: /^weekday\b/,
weekend: /^weekend\b/,
month: /^month(s)?\b/,
year: /^year(s)?\b/,
between: /^between (the)?\b/,
start: /^(start(ing)? (at|on( the)?)?)\b/,
at: /^(at|@)\b/,
and: /^(,|and\b)/,
except: /^(except\b)/,
also: /(also)\b/,
first: /^(first)\b/,
last: /^last\b/,
"in": /^in\b/,
of: /^of\b/,
onthe: /^on the\b/,
on: /^on\b/,
through: /(-|^(to|through)\b)/
};
// Array to convert string names to valid numerical values
var NAMES = { jan: 1, feb: 2, mar: 3, apr: 4, may: 5, jun: 6, jul: 7,
aug: 8, sep: 9, oct: 10, nov: 11, dec: 12, sun: 1, mon: 2, tue: 3,
wed: 4, thu: 5, fri: 6, sat: 7, '1st': 1, fir: 1, '2nd': 2, sec: 2,
'3rd': 3, thi: 3, '4th': 4, 'for': 4
};
/**
* Bundles up the results of the peek operation into a token.
*
* @param {Int} start: The start position of the token
* @param {Int} end: The end position of the token
* @param {String} text: The actual text that was parsed
* @param {TokenType} type: The TokenType of the token
*/
var t = function (start, end, text, type) {
return {startPos: start, endPos: end, text: text, type: type};
}
/**
* Peeks forward to see if the next token is the expected token and
* returns the token if found. Pos is not moved during a Peek operation.
*
* @param {TokenType} exepected: The types of token to scan for
*/
var peek = function (expected) {
var scanTokens = expected instanceof Array ? expected : [expected]
, whiteSpace = /\s+/
, token, curInput, m, scanToken, start, len
scanTokens.push(whiteSpace);
// loop past any skipped tokens and only look for expected tokens
start = pos;
while (!token || token.type === whiteSpace) {
len = -1;
curInput = input.substring(start);
token = t(start, start, input.split(whiteSpace)[0]);
var i, length = scanTokens.length;
for(i = 0; i < length; i++) {
scanToken = scanTokens[i];
m = scanToken.exec(curInput);
if (m && m.index === 0 && m[0].length > len) {
len = m[0].length;
token = t(start, start + len, curInput.substring(0, len), scanToken);
}
}
// update the start position if this token should be skipped
if (token.type === whiteSpace) {
start = token.endPos;
}
}
return token;
}
/**
* Moves pos to the end of the expectedToken if it is found.
*
* @param {TokenType} exepectedToken: The types of token to scan for
*/
var scan = function (expectedToken) {
var token = peek(expectedToken);
pos = token.endPos;
return token;
}
/**
* Parses the next 'y-z' expression and returns the resulting valid
* value array.
*
* @param {TokenType} tokenType: The type of range values allowed
*/
var parseThroughExpr = function(tokenType) {
var start = +parseTokenValue(tokenType)
, end = checkAndParse(TOKENTYPES.through) ?
+parseTokenValue(tokenType) : start
, nums = [];
for (var i = start; i <= end; i++) {
nums.push(i);
}
return nums;
}
/**
* Parses the next 'x,y-z' expression and returns the resulting valid
* value array.
*
* @param {TokenType} tokenType: The type of range values allowed
*/
var parseRanges = function(tokenType) {
var nums = parseThroughExpr(tokenType);
while (checkAndParse(TOKENTYPES.and)) {
nums = nums.concat(parseThroughExpr(tokenType));
}
return nums;
}
/**
* Parses the next 'every (weekend|weekday|x) (starting on|between)' expression.
*
* @param {Recur} r: The recurrence to add the expression to
*/
var parseEvery = function(r) {
var num, period, start, end;
if (checkAndParse(TOKENTYPES.weekend)) {
r.on(NAMES.sun,NAMES.sat).dayOfWeek();
}
else if (checkAndParse(TOKENTYPES.weekday)) {
r.on(NAMES.mon,NAMES.tue,NAMES.wed,NAMES.thu,NAMES.fri).dayOfWeek();
}
else {
num = parseTokenValue(TOKENTYPES.rank);
r.every(num);
period = parseTimePeriod(r);
if (checkAndParse(TOKENTYPES.start)) {
num = parseTokenValue(TOKENTYPES.rank);
r.startingOn(num);
parseToken(period.type);
}
else if (checkAndParse(TOKENTYPES.between)) {
start = parseTokenValue(TOKENTYPES.rank);
if (checkAndParse(TOKENTYPES.and)) {
end = parseTokenValue(TOKENTYPES.rank);
r.between(start,end);
}
}
}
}
/**
* Parses the next 'on the (first|last|x,y-z)' expression.
*
* @param {Recur} r: The recurrence to add the expression to
*/
var parseOnThe = function(r) {
if (checkAndParse(TOKENTYPES.first)) {
r.first();
}
else if (checkAndParse(TOKENTYPES.last)) {
r.last();
}
else {
r.on(parseRanges(TOKENTYPES.rank));
}
parseTimePeriod(r);
}
/**
* Parses the schedule expression and returns the resulting schedules,
* and exceptions. Error will return the position in the string where
* an error occurred, will be null if no errors were found in the
* expression.
*
* @param {String} str: The schedule expression to parse
*/
var parseScheduleExpr = function (str) {
pos = 0;
input = str;
error = -1;
var r = recur();
while (pos < input.length && error < 0) {
var token = parseToken([TOKENTYPES.every, TOKENTYPES.after,
TOKENTYPES.onthe, TOKENTYPES.on, TOKENTYPES.of, TOKENTYPES["in"],
TOKENTYPES.at, TOKENTYPES.and, TOKENTYPES.except,
TOKENTYPES.also]);
switch (token.type) {
case TOKENTYPES.every:
parseEvery(r);
break;
case TOKENTYPES.after:
r.after(parseTokenValue(TOKENTYPES.rank));
parseTimePeriod(r);
break;
case TOKENTYPES.onthe:
parseOnThe(r);
break;
case TOKENTYPES.on:
r.on(parseRanges(TOKENTYPES.dayName)).dayOfWeek();
break;
case TOKENTYPES.of:
r.on(parseRanges(TOKENTYPES.monthName)).month();
break;
case TOKENTYPES["in"]:
r.on(parseRanges(TOKENTYPES.yearIndex)).year();
break;
case TOKENTYPES.at:
r.at(parseTokenValue(TOKENTYPES.time));
while (checkAndParse(TOKENTYPES.and)) {
r.at(parseTokenValue(TOKENTYPES.time));
}
break;
case TOKENTYPES.also:
r.and();
break;
case TOKENTYPES.except:
r.except();
break;
default:
error = pos;
}
}
return {schedules: r.schedules, exceptions: r.exceptions, error: error};
}
/**
* Parses the next token representing a time period and adds it to
* the provided recur object.
*
* @param {Recur} r: The recurrence to add the time period to
*/
var parseTimePeriod = function (r) {
var timePeriod = parseToken([TOKENTYPES.second, TOKENTYPES.minute,
TOKENTYPES.hour, TOKENTYPES.dayOfYear, TOKENTYPES.dayOfWeek,
TOKENTYPES.dayInstance, TOKENTYPES.day, TOKENTYPES.month,
TOKENTYPES.year, TOKENTYPES.weekOfMonth, TOKENTYPES.weekOfYear]);
switch (timePeriod.type) {
case TOKENTYPES.second:
r.second();
break;
case TOKENTYPES.minute:
r.minute();
break;
case TOKENTYPES.hour:
r.hour();
break;
case TOKENTYPES.dayOfYear:
r.dayOfYear();
break;
case TOKENTYPES.dayOfWeek:
r.dayOfWeek();
break;
case TOKENTYPES.dayInstance:
r.dayOfWeekCount();
break;
case TOKENTYPES.day:
r.dayOfMonth();
break;
case TOKENTYPES.weekOfMonth:
r.weekOfMonth();
break;
case TOKENTYPES.weekOfYear:
r.weekOfYear();
break;
case TOKENTYPES.month:
r.month();
break;
case TOKENTYPES.year:
r.year();
break;
default:
error = pos;
}
return timePeriod;
}
/**
* Checks the next token to see if it is of tokenType. Returns true if
* it is and discards the token. Returns false otherwise.
*
* @param {TokenType} tokenType: The type or types of token to parse
*/
var checkAndParse = function (tokenType) {
var found = (peek(tokenType)).type === tokenType;
if (found) {
scan(tokenType);
}
return found;
}
/**
* Parses and returns the next token.
*
* @param {TokenType} tokenType: The type or types of token to parse
*/
var parseToken = function (tokenType) {
var t = scan(tokenType);
if (t.type) {
t.text = convertString(t.text, tokenType)
}
else {
error = pos;
}
return t;
}
/**
* Returns the text value of the token that was parsed.
*
* @param {TokenType} tokenType: The type of token to parse
*/
var parseTokenValue = function (tokenType) {
return (parseToken(tokenType)).text;
}
/**
* Converts a string value to a numerical value based on the type of
* token that was parsed.
*
* @param {String} str: The schedule string to parse
* @param {TokenType} tokenType: The type of token to convert
*/
var convertString = function (str, tokenType) {
var output = str;
switch (tokenType) {
case TOKENTYPES.time:
var parts = str.split(/(:|am|pm)/)
, hour = parts[3] === 'pm' ? parseInt(parts[0],10) + 12 : parts[0]
, min = parts[2].trim();
output = (hour.length === 1 ? '0' : '') + hour + ":" + min;
break;
case TOKENTYPES.rank:
output = parseInt((/^\d+/.exec(str))[0],10);
break;
case TOKENTYPES.monthName:
case TOKENTYPES.dayName:
output = NAMES[str.substring(0,3)];
break;
}
return output;
}
return {
/**
* Parses a schedule string. Returns the schedule, exceptions, and
* an error position if an error was hit.
*
* @param {String} str: The schedule string to parse
* @api public
*/
parse: function(str) {
return parseScheduleExpr(str.toLowerCase());
}
};
};
/**
* Allow library to be used within both the browser and node.js
*/
/* if (typeof exports !== 'undefined') {
module.exports = EnParser;
} else {
window.enParser = EnParser;
} */
//root = typeof exports !== "undefined" && exports !== null ? exports : window;
root.enParser = EnParser;
}).call(this);
/**
* Later.js 0.0.17
* (c) 2012 Bill, BunKat LLC.
* Later is freely distributable under the MIT license.
* For all details and documentation:
* http://bunkat.github.com/later
*/
(function() {
"use strict";
/**
* Calculates the next occurrence (or occcurrences) of a given schedule.
* Schedules are simply a set of constraints that must be met for a
* particular date to be valid. Schedules can be generated using Recur or
* can be created directly.
*
* Schedules have the following form:
*
* {
* schedules: [
* {
* constraintId: [valid values],
* constraintId: [valid values],
* ...
* },
* {
* constraintId: [valid values],
* constraintId: [valid values],
* ...
* }
* ...
* ],
* exceptions: [
* {
* constraintId: [valid values],
* constraintId: [valid values],
* ...
* },
* {
* constraintId: [valid values],
* constraintId: [valid values],
* ...
* },
* ...
* ]
* }
*
* See Recur.js for the available constraints and their value ranges. May
* also be useful to create a schedule using Recur and then examining the
* schedule that is produced.
*/
/**
* Initializes the Later object.
*
* @param {Int} resolution: Minimum number of seconds between occurrences
* @param {Bool} useLocalTime: True if local time zone should be used
* @api public
*/
var Later = function(resolution, useLocalTime) {
var isLocal = useLocalTime || false,
get = 'get' + (isLocal ? '' : 'UTC'),
exec = true,
// constants
SEC = 1000,
MIN = SEC * 60,
HOUR = MIN * 60,
DAY = HOUR * 24,
// aliases for common math functions
ceil = Math.ceil,
floor = Math.floor,
max = Math.max,
// data prototypes to switch between UTC and local time calculations
dateProto = Date.prototype,
getYear = dateProto[get + 'FullYear'],
getMonth = dateProto[get + 'Month'],
getDate = dateProto[get + 'Date'],
getDay = dateProto[get + 'Day'],
getHour = dateProto[get + 'Hours'],
getMin = dateProto[get + 'Minutes'],
getSec = dateProto[get + 'Seconds'];
// minimum time between valid occurrences in seconds
resolution = resolution === undefined ? 1 : resolution;
/**
* Finds the next valid value which is either the next largest valid
* value or the minimum valid value if no larger value exists. To
* simplify some calculations, the min value is then added to a specified
* offset.
*
* For example, if the current minute is 5 and the next valid
* value is 1, the offset will be set to 60 (max number of minutes) and
* nextInRange will return 61. This is the number of minutes that must
* be added to the current hour to get to the next valid minute.
*
* @param {Int/String} val: The current value
* @param {[]} values: Array of possible valid values
* @param {Int/String} minOffset: Value to add to the minimum value
*/
var nextInRange = function(val, values, minOffset) {
var cur, next = null, min = values[0], i = values.length;
while (i--) {
cur = values[i];
if (cur === val) {
return val;
}
min = cur < min ? cur : min;
next = cur > val && (!next || cur < next) ? cur : next;
}
return next || (minOffset === undefined ? min : (min + minOffset));
};
/**
* Finds the previous valid value which is either the next smallest valid
* value or the maximum valid value if no smaller value exists. To
* simplify some calculations, the min value is then substracted to a specified
* offset.
*
* For example, if the current minute is 5 and the next valid
* value is 7, the offset will be set to 60 (max number of minutes) and
* prevInRange will return -67. This is the number of minutes that must
* be added to the current hour to get to the next valid minute.
*
* @param {Int/String} val: The current value
* @param {[]} values: Array of possible valid values
* @param {Int/String} maxOffset: Value to subtract from the maximum value
*/
var prevInRange = function(val, values, maxOffset) {
var cur, prev = null, i = values.length, max = values[i-1];
while (i--) {
cur = values[i];
if (cur === val) {
return val;
}
max = cur > max ? cur : max;
prev = cur < val && (!prev || cur > prev) ? cur : prev;
}
return prev !== null ? prev : (maxOffset === undefined ? max : (max - maxOffset));
};
/**
* Builds and returns a new Date using the specified values. Date
* returned is either using Local time or UTC based on isLocal.
*
* @param {Int} yr: Four digit year
* @param {Int} mt: Month between 0 and 11, defaults to 0
* @param {Int} dt: Date between 1 and 31, defaults to 1
* @param {Int} hr: Hour between 0 and 23, defaults to 0
* @param {Int} mn: Minute between 0 and 59, defaults to 0
* @param {Int} sc: Second between 0 and 59, defaults to 0
*/
var nextDate = function(yr, mt, dt, hr, mn, sc) {
mt = mt === undefined ? 0 : mt;
dt = dt === undefined ? 1 : dt;
hr = hr === undefined ? 0 : hr;
mn = mn === undefined ? 0 : mn;
sc = sc === undefined ? 0 : sc;
return isLocal ? new Date(yr, mt, dt, hr, mn, sc) :
new Date(Date.UTC(yr, mt, dt, hr, mn, sc));
};
/**
* Builds and returns a new Date using the specified values. Date
* returned is either using Local time or UTC based on isLocal.
*
* @param {Int} yr: Four digit year
* @param {Int} mt: Month between 0 and 11, defaults to 11
* @param {Int} dt: Date between 1 and 31, defaults to last day of month
* @param {Int} hr: Hour between 0 and 23, defaults to 23
* @param {Int} mn: Minute between 0 and 59, defaults to 59
* @param {Int} sc: Second between 0 and 59, defaults to 59
*/
var prevDate = function(yr, mt, dt, hr, mn, sc) {
mt = mt === undefined ? 11 : mt;
dt = dt === undefined ? getDate.call(nextDate(yr, mt+1, 0)) : dt;
hr = hr === undefined ? 23 : hr;
mn = mn === undefined ? 59 : mn;
sc = sc === undefined ? 59 : sc;
return isLocal ? new Date(yr, mt, dt, hr, mn, sc) :
new Date(Date.UTC(yr, mt, dt, hr, mn, sc));
};
/**
* Pads a digit with a leading zero if it is less than 10.
*
* @param {Int} val: The value that needs to be padded
*/
var pad = function(val) {
return (val < 10 ? '0' : '') + val;
};
/**
* Given a valid start time, finds the next schedule that is invalid.
* Useful for finding the end of a valid time range.
*
* @param {object} schedule: Valid schedule object containing constraints
* @param {Date} start: The first possible valid occurrence
* @param {Date} end: The last possible valid occurrence
* @param {boolean} reverse: True if we are looking for previous occurrences
*/
var getNextInvalidSchedule = function(sched, start, reverse) {
var Y, M, D, d, h, m, s,
oJan1, oMonthStart, oWeekStart, oWeekStartY, oMonthEnd,
oDec31,
t, dy, wy, wm, dc,
daysInYear, daysInMonth, firstDayOfMonth,
weekStart, weeksInYear, weeksInMonth, x;
// helper functions based on which direction we are going in
var range = reverse ? prevInRange : nextInRange,
date = reverse ? prevDate : nextDate;
// calculate the earliest date that violates the schedule.
// Note: This search isn't exact, date returned may still be valid,
// but is pretty fast since most of the time the next invalid time
// will be one increment away from current time
Y = getYear.call(start);
M = getMonth.call(start);
D = getDate.call(start);
h = getHour.call(start);
m = getMin.call(start);
s = getSec.call(start);
t = pad(h) +':'+ pad(m) +':'+ pad(s);
// check time of day (24-hr)
if (sched.t && range(t, sched.t) === t) {
return reverse ? (date(Y, M, D, h, m, s-1)) : (date(Y, M, D, h, m, s+1));
}
// check second of minute (zero based)
if (sched.s && range(s, sched.s, 60) === s) {
return reverse ? (date(Y, M, D, h, m, s-1)) : (date(Y, M, D, h, m, s+1));
}
// check minute of hour (zero based)
if (sched.m && range(m, sched.m, 60) === m) {
return reverse ? (date(Y, M, D, h, m-1)) : (date(Y, M, D, h, m+1));
}
// check hour of day (zero based)
if (sched.h && range(h, sched.h, 24) === h) {
return reverse ? (date(Y, M, D, h-1)) : (date(Y, M, D, h+1));
}
// check before time (24-hr)
if (sched.tb) {
if (t < sched.tb[0]) {
x = sched.tb[0].split(':');
if (reverse) {
return(date(Y, M, D-1, x[0], x[1], x[2]-1));
}
else {
return(date(Y, M, D, x[0], x[1], x[2]));
}
}
}
// check after time (24-hr)
if (sched.ta) {
if (t >= sched.ta[0]) {
if (reverse) {
x = sched.ta[0].split(':');
return(date(Y, M, D, x[0], x[1], x[2]-1));
}