forked from bunkat/later
-
Notifications
You must be signed in to change notification settings - Fork 0
/
later-recur.js
1433 lines (1282 loc) · 52.2 KB
/
later-recur.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
if (!Array.prototype.indexOf) {
Array.prototype.indexOf = function (searchElement /*, fromIndex */ ) {
"use strict";
if (this == null) {
throw new TypeError();
}
var t = Object(this);
var len = t.length >>> 0;
if (len === 0) {
return -1;
}
var n = 0;
if (arguments.length > 1) {
n = Number(arguments[1]);
if (n != n) { // shortcut for verifying if it's NaN
n = 0;
} else if (n != 0 && n != Infinity && n != -Infinity) {
n = (n > 0 || -1) * Math.floor(Math.abs(n));
}
}
if (n >= len) {
return -1;
}
var k = n >= 0 ? n : Math.max(len - Math.abs(n), 0);
for (; k < len; k++) {
if (k in t && t[k] === searchElement) {
return k;
}
}
return -1;
}
}
if(!String.prototype.trim) {
String.prototype.trim = function () {
return this.replace(/^\s+|\s+$/g,'');
};
}/**
* 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));
}
else {
return(date(Y, M, D+1));
}
}
}
// check day of week count (one based, 0 for last instance)
if (sched.dc) {
dc = floor((D - 1) / 7) + 1;
if (range(dc, sched.dc, 0) === dc) {
return reverse ? (date(Y, M, D-1)) : (date(Y, M, D+1));
}
}
// check day of week (zero based)
d = getDay.call(start);
if (sched.d && range(d+1, sched.d, 7) === d+1) {
return reverse ? (date(Y, M, D-1)) : (date(Y, M, D+1));
}
// check week of month (one based, 0 for last week of month)
if (sched.wm) {
firstDayOfMonth = getDay.call(nextDate(Y, M, 1));
wm = floor((((D + firstDayOfMonth - 1)/7))+1);
weeksInMonth = floor((((daysInMonth + firstDayOfMonth - 1)/7))+1);
if ((range(wm, sched.wm, weeksInMonth) || weeksInMonth) === wm) {
// not optimal at all...
return reverse ? (date(Y, M, D-1)) : (date(Y, M, D+1));
}
}
// check date of month (one based)
oMonthEnd = nextDate(Y, M + 1, 0);
daysInMonth = getDate.call(oMonthEnd);
if (sched.D && (range(D, sched.D, daysInMonth) || daysInMonth) === D) {
return reverse ? (date(Y, M, D-1)) : (date(Y, M, D+1));
}
// check week of year (one based, ISO week)
oJan1 = nextDate(Y, 0, 1, 12);
oDec31 = nextDate(Y + 1, 0, 0, 12);
if (sched.wy) {
oWeekStart = date(Y, M, D + 4 - (d || 7));
oWeekStartY = date(getYear.call(oWeekStart),0,1);
weeksInYear = getDay.call(oJan1) === 4 ||
getDay.call(oDec31) === 4 ? 53 : 52;
wy = ceil((((oWeekStart.getTime()-oWeekStartY.getTime())/DAY)+1)/7);
if ((range(wy, sched.wy, weeksInYear) || weeksInYear) === wy) {
return reverse ? (date(Y, M, D-1)) : (date(Y, M, D+1));
}
}
// check month (one based)
if (sched.M && range(M+1, sched.M, 12) === M+1) {
return reverse ? (date(Y, M-1)) : (date(Y, M+1));
}
// check day of year (one based)
if (sched.dy) {
dy = ceil((start.getTime() - oJan1.getTime())/DAY) + 1;
daysInYear = ceil((oDec31.getTime() - oJan1.getTime())/DAY) + 1;
if ((range(dy, sched.dy, daysInYear) || daysInYear) === dy) {
return reverse ? (date(Y, M-1)) : (date(Y, M+1));
}
}
// check year
if (sched.Y && range(Y, sched.Y, 0) === Y ) {
return reverse ? (date(Y-1)) : (date(Y+1));
}
return start;
};
/**
* Calculates the next valid occurrence of a particular schedule that
* occurs on or after the specified start time.
*
* @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 getNextForSchedule = function(sched, start, end, reverse) {
var next, inc, x, cur,
Y, M, D, d, h, m, s,
oJan1, oMonthStart, oWeekStart, oWeekStartY, oMonthEnd,
oDec31,
t, dy, wy, wm, dc,
daysInYear, daysInMonth, firstDayOfMonth,
weekStart, weeksInYear, weeksInMonth,
maxLoopCount = 1000;
var range = reverse ? prevInRange : nextInRange,
date = reverse ? prevDate : nextDate;
// handle any after constraints
// after constraints are not applied when searching backwards
next = reverse ? start : after(start, sched);
// It's not pretty, but just keep looping through all of the
// constraints until they have all been met (or no valid
// occurrence exists). All calculations are done just in time and
// and only once to prevent extra work from being done each loop.
while (next && maxLoopCount--) {
// make sure we are still with in the boundaries
if (end &&
((!reverse && next.getTime() > end.getTime()) ||
(reverse && next.getTime() < end.getTime()))) {
return null;
}
// check year
Y = getYear.call(next);
M = getMonth.call(next);
D = getDate.call(next);
if (sched.Y && (inc = range(Y, sched.Y, 0)) !== Y ) {
next = (!reverse && inc > Y) || (reverse && inc < Y) ? date(inc) : null;
continue;
}
// check day of year (one based)
oJan1 = nextDate(Y, 0, 1, 12, 0, 0);
var cDate = nextDate(Y, M, D, 12, 0, 0);
oDec31 = nextDate(Y + 1, 0, 0);
if (sched.dy) {
dy = ceil((cDate.getTime() - oJan1.getTime())/DAY) + 1;
daysInYear = ceil((oDec31.getTime() - oJan1.getTime())/DAY) + 1;
if (((inc = range(dy, sched.dy, daysInYear)) || daysInYear) !== dy) {
next = date(Y, 0, inc);
continue;
}
}
// check month (one based)
if (sched.M && (inc = range(M+1, sched.M, 12)) !== M+1) {
next = date(Y, inc-1);
continue;
}
// check week of year (one based, ISO week)
d = getDay.call(next);
if (sched.wy) {
oWeekStart = date(Y, M, D + 4 - (d || 7), 12);
oWeekStartY = date(getYear.call(oWeekStart),0,1, 12);
weeksInYear = getDay.call(oJan1) === 4 ||
getDay.call(oDec31) === 4 ? 53 : 52;
wy = ceil((((oWeekStart.getTime()-oWeekStartY.getTime())/DAY)+1)/7);
if (((inc = range(wy, sched.wy, weeksInYear)) || weeksInYear) !== wy) {
if(inc < 0) inc += 1; // don't double count a week when reverse
next = date(
getYear.call(oWeekStart),
getMonth.call(oWeekStart),
getDate.call(oWeekStart) - 3 + (inc - wy) * 7 +
(reverse ? 6 : 0)); // head to end of week if reverse
continue;
}
}
// check date of month (one based)
oMonthEnd = nextDate(Y, M + 1, 0, 12);
daysInMonth = getDate.call(oMonthEnd);
if (sched.D && ((inc = range(D, sched.D, daysInMonth)) || daysInMonth) !== D) {
// if we are going backwards, just jump to the last day in
// the previous month to avoid errors in calculating diff to
// desired date
next = date(Y, M, inc < 0 ? 0 : inc);
continue;
}
// check week of month (one based, 0 for last week of month)
if (sched.wm) {
firstDayOfMonth = getDay.call(nextDate(Y, M, 1));
wm = floor((((D + firstDayOfMonth - 1)/7))+1);
weeksInMonth = floor((((daysInMonth + firstDayOfMonth - 1)/7))+1);
if (((inc = range(wm, sched.wm, weeksInMonth)) || weeksInMonth) !== wm) {
// jump to the Sunday of the desired week, making sure not
// to double count the last week in the month if we cross
// a month boundary, set to 1st of month for week 1
if(inc === 0) { //only happens in reverse, go to end of prev month
next = date(Y, M, inc);
}
else {
next = date(Y, M,
(inc < 0 ? inc+1 : inc-1) * 7 - (firstDayOfMonth - 1) -
(inc > weeksInMonth && getDay.call(oMonthEnd) < 6 ? 7 : 0) +
(inc === weeksInMonth + 1 ? getDay.call(oMonthEnd) + 1 : 0) +
(reverse ? 6 : 0)); // skip to end of week in reverse
}
continue;
}
}
// check day of week (zero based)
if (sched.d && (inc = range(d+1, sched.d, 7)) !== d+1) {
next = date(Y, M, D + (inc-1) - d);
continue;
}
// check day of week count (one based, 0 for last instance)
if (sched.dc) {
dc = floor((D - 1) / 7) + 1;
if ((inc = range(dc, sched.dc, 0)) !== dc) {
if (reverse) {
if (inc > 0) {
next = date(Y, M + (inc < dc ? 0 : -1), 7 + (7 * (inc-1)));
continue;
}
else if (inc === 0 && D < (daysInMonth - 6)) {
next = date(Y, M, inc);
continue;
}
}
else {
if (inc > 0) {
next = date(Y, M + (inc < dc ? 1 : 0), 1 + (7 * (inc-1)));
continue;
}
else if (inc < 1 && D < (daysInMonth - 6)) {
next = date(Y, M, daysInMonth - 6);
continue;
}
}
}
}
// check after time (24-hr)
h = getHour.call(next);
m = getMin.call(next);
s = getSec.call(next);
t = pad(h) +':'+ pad(m) +':'+ pad(s);
if (sched.ta) {
if (t < sched.ta[0]) {
if (reverse) {
next = date(Y, M, D-1);
}
else {
x = sched.ta[0].split(':');
next = date(Y, M, D, x[0], x[1], x[2]);
}
continue;
}
}
// check before time (24-hr)
if (sched.tb) {
if (t >= sched.tb[0]) {
if (reverse) {
x = sched.tb[0].split(':');
next = date(Y, M, D, x[0], x[1], x[2]-1);
}
else {
next = date(Y, M, D+1);
}
continue;
}
}
// check hour of day (zero based)
if (sched.h && (inc = range(h, sched.h, 24)) !== h) {
next = date(Y, M, D, inc);
continue;
}
// check minute of hour (zero based)
if (sched.m && (inc = range(m, sched.m, 60)) !== m) {
next = date(Y, M, D, h, inc);
continue;
}
// check second of minute (zero based)
if (sched.s && (inc = range(s, sched.s, 60)) !== s) {
next = date(Y, M, D, h, m, inc);
continue;
}
// check time of day (24-hr)
if (sched.t) {
if ((inc = range(t, sched.t)) !== t) {
x = inc.split(':');
var dayInc = !reverse ? (t > inc ? 1 : 0) : (t < inc ? -1 : 0);
next = date(Y, M, D + dayInc, x[0], x[1], x[2]);
continue;
}
}
// if we make it this far, all constraints have been met
break;
}
return maxLoopCount > 0 ? next : null;
};
/**
* Increments a date by a given amount of time. Date
* returned is either using Local time or UTC based on isLocal.
*
* @param {Int} yr: Number of years to increment by
* @param {Int} mt: Number of months to increment by
* @param {Int} dt: Number of days to increment by
* @param {Int} hr: Number of hours to increment by
* @param {Int} mn: Number of minutes to increment by
* @param {Int} sc: Number of seconds to increment by
*/
var after = function (start, sched) {
var yr = getYear.call(start) + getAfter(sched.aY),
mt = getMonth.call(start) + getAfter(sched.aM),
dt = getDate.call(start) +
max(getAfter(sched.aD), getAfter(sched.ady), getAfter(sched.ad),
getAfter(sched.awy) * 7, getAfter(sched.awm) * 7),
hr = getHour.call(start) + getAfter(sched.ah),
mn = getMin.call(start) + getAfter(sched.am),
sc = getSec.call(start) + getAfter(sched.as);
return nextDate(yr, mt, dt, hr, mn, sc);
};
/**
* Returns the value of an after constraint or 0 if not set.
*
* @param {Array} constraint: After constrant to check
*/
var getAfter = function (constraint) {
return constraint && constraint[0] ? constraint[0] : 0;
};
/**
* Returns a new date object that represents the next possible valid
* occurrence based on the resolution that has beeen configured.
*
* @param {Date} date: The Date object to be incremented
* @param {Boolean} backwards: True to tick backwards instead of forwards
*/
var tick = function (date, backwards) {
return !backwards ?
new Date(date.getTime() + (resolution * 1000)) :
new Date(date.getTime() - (resolution * 1000)) ;
};
return {
/**
* Returns true if the specified date meets all of the constraints
* defined within the specified schedule.
*
* @param {Recur} recur: Set of schedule and exception constraints
* @param {Date} date: The date to validate against
* @api public
*/
isValid: function (recur, date) {
date.setMilliseconds(0);
var next = this.getNext(recur, date);
return next ? date.getTime() === next.getTime() : false;
},
/**
* Returns the next one or more valid occurrences of a schedule.
*
* @param {Recur} recur: Set of schedule and exception constraints
* @param {Int} count: The number of occurrences to return
* @param {Date} startDate: The initial date to start looking from
* @param {Date} endDate: The last date to include
* @param {boolean} reverse: True to search for occurrences in reverse
* @api public
*/
get: function (recur, count, startDate, endDate, reverse) {
var occurrences = [], date;
while (count-- > 0 && (date =
!reverse ?
this.getNext(recur, date || startDate, endDate) :
this.getPrevious(recur, date || startDate, endDate)
)) {
occurrences.push(date);
date = tick(date, reverse);
}
return occurrences;
},
/**
* Returns the next valid occurrence of a schedule.
*
* @param {Recur} recur: Set of schedule and exception constraints
* @param {Date} startDate: The initial date to start looking from
* @param {Date} endDate: The last date to include
* @api public
*/
getNext: function (recur, startDate, endDate) {
var schedules = recur ? recur.schedules || [] : [],
exceptions = recur ? recur.exceptions || [] : [],
schedLen = schedules.length,
exceptLen = exceptions.length,
start = startDate || new Date(),
date;
while(start) {
var tDate;
if(endDate && start.getTime() > endDate.getTime()) {
date = undefined;
break;
}
if(schedLen) {
for(var i = 0; i < schedLen; i++) {
tDate = getNextForSchedule(schedules[i], start, endDate);
if (tDate && (!date || (tDate.getTime() < date.getTime()))) {
date = tDate;
}
}
}
else {
date = start;
}
start = null;
if (date && exceptLen) {
tDate = this.getNextInvalid({schedules: exceptions}, date);
if(tDate.getTime() !== date.getTime()) {
start = tDate;
date = undefined;
}
}
}
return date;
},
/**
* Returns the next invalid occurrence of a schedule. Useful for
* quickly calculating the end of a valid time period.
*
* @param {Recur} recur: Set of schedule and exception constraints
* @param {Date} startDate: The initial date to start looking frome
* @api public
*/
getNextInvalid: function (recur, startDate) {
var schedules = recur ? recur.schedules || [] : [],
exceptions = recur ? recur.exceptions || [] : [],
schedLen = schedules.length,
exceptLen = exceptions.length,
start = startDate || new Date();
while(start && this.isValid(recur, start)) {
var nextExcep, nextInvalid;
// get the next invalid schedule if there is one
for(var i = 0; i < schedLen; i++) {
var tDate = getNextInvalidSchedule(schedules[i], start);
if (tDate && (!nextInvalid || (tDate.getTime() > nextInvalid.getTime()))) {
nextInvalid = tDate;
}
}
// get the next occurrence of any of the exceptions
if(exceptLen) {
nextExcep = this.getNext({schedules: exceptions}, start);
}
// if we didn't find any next occurrences, there is no next
// invalid (this schedule is always valid until the end
// of time)
if(!nextInvalid && !nextExcep) {
start = undefined;
}
else {
start = new Date(nextInvalid && nextExcep ?
Math.min(nextInvalid.getTime(), nextExcep.getTime()) :
nextExcep || nextInvalid);
}
}
// if the date is the start date, no next invalid was found
return start;
},
/**
* Returns the previous valid occurrence of a schedule based on the
* provided endDate.
*
* @param {Recur} recur: Set of schedule and exception constraints
* @param {Date} endDate: The date to start the search from
* @param {Date} startDate: The last date to include in the search
* @api public
*/
getPrevious: function (recur, startDate, endDate) {
var schedules = recur ? recur.schedules || [] : [],
exceptions = {schedules: recur ? recur.exceptions || [] : []},
end = startDate || new Date(),
date, tDate,
i = schedules.length;
// return null if we're earlier than the specified endDate date
if (endDate && startDate.getTime() < endDate.getTime()) {
return null;
}
if (i === 0) {
date = end; // no constraints, end date is fine
}
else {
while(i--) {
tDate = getNextForSchedule(schedules[i], end, endDate, true);
if (!date || (tDate > date)) {
date = tDate;
}
}
}
if (date && exceptions.schedules.length > 0 &&
this.isValid (exceptions, date)) {
date = this.getPrevious(recur, tick(date, true), endDate);
}
return date;
},
/**
* Executes the provided callback on the provided recurrence
* schedule. Returns true if the timer was started.
*
* @param {Recur} recur: Set of schedule and exception constraints
* @param {Date} startDate: The initial date to start looking from
* @param {Func} callback: The function to execute
* @param {arg[]} arg: Argument or array of arguments to pass to the
* callback
* @api public
*/
exec: function (recur, startDate, callback, arg) {
var next = this.getNext(recur, tick(startDate));
if (next) {
next = next.getTime() - (new Date()).getTime();
// reschedule the exec if the delay is greater than 2^31-1
// otherwise setTimeout will be called immediately
if (next > 2147483647) {
exec = setTimeout(this.exec, 2147483647, recur, startDate, callback, arg);
}
else {
exec = setTimeout(this.handleExec, next, this, recur, callback, arg);
}
return true;
}
},
/**
* Immediately stops the execution of the current timer if one
* exists.
*
* @api public
*/
stopExec: function () {
if (exec) {
clearTimeout(exec);
exec = false;
}
},
/**
* Handles the execution of the timer.
*
* @param {Later} later: The context to execute within
* @param {Recur} recur: The set of constraints to use
* @param {Func} callback: The function to execute
* @param {arg[]} arg: Argument or array of arguments to pass to the
* callback
*/
handleExec: function (later, recur, callback, arg) {
callback(arg);
if (exec) {
later.exec(recur, (new Date()), callback, arg);
}
}
};
};
/**
* Allow library to be used within both the browser and node.js
*/
var root = typeof exports !== "undefined" && exports !== null ? exports : window;
root.later = Later;
}).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
*/
(function () {
"use strict";
/**
* Simple API for generating valid schedules for Later.js. All commands
* are chainable.
*
* Example:
*
* Every 5 minutes between minutes 15 and 45 of each hour and also
* at 9:00 am every day, except in the months of January and February
*
* recur().every(5).minute().between(15, 45).and().at('09:00:00')
* .except().on(0, 1).month();
*/
var Recur = function () {
var schedules = [],
exceptions = [],
cur,
curArr = schedules,
curName,
values, every, after, applyMin, applyMax, i, last;
/**
* Adds values to the specified constraint in the current schedule.
*
* @param {String} name: Name of constraint to add
* @param {Int} min: Minimum value for this constraint
* @param {Int} max: Maximum value for this constraint
*/
var add = function (name, min, max) {
name = after ? 'a' + name : name;
if (!cur) {
curArr.push({});
cur = curArr[0];
}
if (!cur[name]) {
cur[name] = [];
}
curName = cur[name];
if (every) {
values = [];
for (i = min; i <= max; i += every) {
values.push(i);
}
// save off values in case of startingOn or between
last = {n: name, x: every, c: curName.length, m: max};
}
values = applyMin ? [min] : applyMax ? [max] : values;
var length = values.length;
for (i = 0; i < length; i += 1) {
if (curName.indexOf(values[i]) < 0) {
curName.push(values[i]);
}
}
// reset the built up state
values = every = after = applyMin = applyMax = 0;
};
return {
/**
* Set of constraints that must be met for an occurrence to be valid.
*
* @api public
*/
schedules: schedules,
/**
* Set of exceptions that must not be met for an occurrence to be
* valid.
*