|
|
|
|
@ -6,7 +6,10 @@
|
|
|
|
|
*/
|
|
|
|
|
const Log = require("logger");
|
|
|
|
|
const ical = require("node-ical");
|
|
|
|
|
const request = require("request");
|
|
|
|
|
const fetch = require("node-fetch");
|
|
|
|
|
const digest = require("digest-fetch");
|
|
|
|
|
const https = require("https");
|
|
|
|
|
const base64 = require("base-64");
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* Moment date
|
|
|
|
|
@ -43,385 +46,382 @@ const CalendarFetcher = function (url, reloadInterval, excludedEvents, maximumEn
|
|
|
|
|
const fetchCalendar = function () {
|
|
|
|
|
clearTimeout(reloadTimer);
|
|
|
|
|
reloadTimer = null;
|
|
|
|
|
|
|
|
|
|
const nodeVersion = Number(process.version.match(/^v(\d+\.\d+)/)[1]);
|
|
|
|
|
const opts = {
|
|
|
|
|
headers: {
|
|
|
|
|
"User-Agent": "Mozilla/5.0 (Node.js " + nodeVersion + ") MagicMirror/" + global.version + " (https://github.com/MichMich/MagicMirror/)"
|
|
|
|
|
},
|
|
|
|
|
gzip: true
|
|
|
|
|
let fetcher = null;
|
|
|
|
|
let httpsAgent = null;
|
|
|
|
|
let headers = {
|
|
|
|
|
"User-Agent": "Mozilla/5.0 (Node.js " + nodeVersion + ") MagicMirror/" + global.version + " (https://github.com/MichMich/MagicMirror/)"
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
if (selfSignedCert) {
|
|
|
|
|
var agentOptions = {
|
|
|
|
|
httpsAgent = new https.Agent({
|
|
|
|
|
rejectUnauthorized: false
|
|
|
|
|
};
|
|
|
|
|
opts.agentOptions = agentOptions;
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (auth) {
|
|
|
|
|
if (auth.method === "bearer") {
|
|
|
|
|
opts.auth = {
|
|
|
|
|
bearer: auth.pass
|
|
|
|
|
};
|
|
|
|
|
headers.Authorization = "Bearer " + auth.pass;
|
|
|
|
|
} else if (auth.method === "digest") {
|
|
|
|
|
fetcher = new digest(auth.user, auth.pass).fetch(url, { headers: headers, httpsAgent: httpsAgent });
|
|
|
|
|
} else {
|
|
|
|
|
opts.auth = {
|
|
|
|
|
user: auth.user,
|
|
|
|
|
pass: auth.pass,
|
|
|
|
|
sendImmediately: auth.method !== "digest"
|
|
|
|
|
};
|
|
|
|
|
headers.Authorization = "Basic " + base64.encode(auth.user + ":" + auth.pass);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
if (fetcher === null) {
|
|
|
|
|
fetcher = fetch(url, { headers: headers, httpsAgent: httpsAgent });
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
request(url, opts, function (err, r, requestData) {
|
|
|
|
|
if (err) {
|
|
|
|
|
fetchFailedCallback(self, err);
|
|
|
|
|
fetcher
|
|
|
|
|
.catch((error) => {
|
|
|
|
|
fetchFailedCallback(self, error);
|
|
|
|
|
scheduleTimer();
|
|
|
|
|
return;
|
|
|
|
|
} else if (r.statusCode !== 200) {
|
|
|
|
|
fetchFailedCallback(self, r.statusCode + ": " + r.statusMessage);
|
|
|
|
|
scheduleTimer();
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
})
|
|
|
|
|
.then((response) => {
|
|
|
|
|
if (response.status !== 200) {
|
|
|
|
|
fetchFailedCallback(self, response.statusText);
|
|
|
|
|
scheduleTimer();
|
|
|
|
|
}
|
|
|
|
|
return response;
|
|
|
|
|
})
|
|
|
|
|
.then((response) => response.text())
|
|
|
|
|
.then((responseData) => {
|
|
|
|
|
let data = [];
|
|
|
|
|
|
|
|
|
|
let data = [];
|
|
|
|
|
|
|
|
|
|
try {
|
|
|
|
|
data = ical.parseICS(requestData);
|
|
|
|
|
} catch (error) {
|
|
|
|
|
fetchFailedCallback(self, error.message);
|
|
|
|
|
scheduleTimer();
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Log.debug(" parsed data=" + JSON.stringify(data));
|
|
|
|
|
|
|
|
|
|
const newEvents = [];
|
|
|
|
|
|
|
|
|
|
// limitFunction doesn't do much limiting, see comment re: the dates array in rrule section below as to why we need to do the filtering ourselves
|
|
|
|
|
const limitFunction = function (date, i) {
|
|
|
|
|
return true;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const eventDate = function (event, time) {
|
|
|
|
|
return isFullDayEvent(event) ? moment(event[time], "YYYYMMDD") : moment(new Date(event[time]));
|
|
|
|
|
};
|
|
|
|
|
Log.debug("there are " + Object.entries(data).length + " calendar entries");
|
|
|
|
|
Object.entries(data).forEach(([key, event]) => {
|
|
|
|
|
const now = new Date();
|
|
|
|
|
const today = moment().startOf("day").toDate();
|
|
|
|
|
const future = moment().startOf("day").add(maximumNumberOfDays, "days").subtract(1, "seconds").toDate(); // Subtract 1 second so that events that start on the middle of the night will not repeat.
|
|
|
|
|
let past = today;
|
|
|
|
|
Log.debug("have entries ");
|
|
|
|
|
if (includePastEvents) {
|
|
|
|
|
past = moment().startOf("day").subtract(maximumNumberOfDays, "days").toDate();
|
|
|
|
|
try {
|
|
|
|
|
data = ical.parseICS(responseData);
|
|
|
|
|
} catch (error) {
|
|
|
|
|
fetchFailedCallback(self, error.message);
|
|
|
|
|
scheduleTimer();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// FIXME: Ugly fix to solve the facebook birthday issue.
|
|
|
|
|
// Otherwise, the recurring events only show the birthday for next year.
|
|
|
|
|
let isFacebookBirthday = false;
|
|
|
|
|
if (typeof event.uid !== "undefined") {
|
|
|
|
|
if (event.uid.indexOf("@facebook.com") !== -1) {
|
|
|
|
|
isFacebookBirthday = true;
|
|
|
|
|
Log.debug(" parsed data=" + JSON.stringify(data));
|
|
|
|
|
|
|
|
|
|
const newEvents = [];
|
|
|
|
|
|
|
|
|
|
// limitFunction doesn't do much limiting, see comment re: the dates array in rrule section below as to why we need to do the filtering ourselves
|
|
|
|
|
const limitFunction = function (date, i) {
|
|
|
|
|
return true;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
const eventDate = function (event, time) {
|
|
|
|
|
return isFullDayEvent(event) ? moment(event[time], "YYYYMMDD") : moment(new Date(event[time]));
|
|
|
|
|
};
|
|
|
|
|
Log.debug("there are " + Object.entries(data).length + " calendar entries");
|
|
|
|
|
Object.entries(data).forEach(([key, event]) => {
|
|
|
|
|
const now = new Date();
|
|
|
|
|
const today = moment().startOf("day").toDate();
|
|
|
|
|
const future = moment().startOf("day").add(maximumNumberOfDays, "days").subtract(1, "seconds").toDate(); // Subtract 1 second so that events that start on the middle of the night will not repeat.
|
|
|
|
|
let past = today;
|
|
|
|
|
Log.debug("have entries ");
|
|
|
|
|
if (includePastEvents) {
|
|
|
|
|
past = moment().startOf("day").subtract(maximumNumberOfDays, "days").toDate();
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (event.type === "VEVENT") {
|
|
|
|
|
let startDate = eventDate(event, "start");
|
|
|
|
|
let endDate;
|
|
|
|
|
// FIXME: Ugly fix to solve the facebook birthday issue.
|
|
|
|
|
// Otherwise, the recurring events only show the birthday for next year.
|
|
|
|
|
let isFacebookBirthday = false;
|
|
|
|
|
if (typeof event.uid !== "undefined") {
|
|
|
|
|
if (event.uid.indexOf("@facebook.com") !== -1) {
|
|
|
|
|
isFacebookBirthday = true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Log.debug("\nevent=" + JSON.stringify(event));
|
|
|
|
|
if (typeof event.end !== "undefined") {
|
|
|
|
|
endDate = eventDate(event, "end");
|
|
|
|
|
} else if (typeof event.duration !== "undefined") {
|
|
|
|
|
endDate = startDate.clone().add(moment.duration(event.duration));
|
|
|
|
|
} else {
|
|
|
|
|
if (!isFacebookBirthday) {
|
|
|
|
|
// make copy of start date, separate storage area
|
|
|
|
|
endDate = moment(startDate.format("x"), "x");
|
|
|
|
|
if (event.type === "VEVENT") {
|
|
|
|
|
let startDate = eventDate(event, "start");
|
|
|
|
|
let endDate;
|
|
|
|
|
|
|
|
|
|
Log.debug("\nevent=" + JSON.stringify(event));
|
|
|
|
|
if (typeof event.end !== "undefined") {
|
|
|
|
|
endDate = eventDate(event, "end");
|
|
|
|
|
} else if (typeof event.duration !== "undefined") {
|
|
|
|
|
endDate = startDate.clone().add(moment.duration(event.duration));
|
|
|
|
|
} else {
|
|
|
|
|
endDate = moment(startDate).add(1, "days");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Log.debug(" start=" + startDate.toDate() + " end=" + endDate.toDate());
|
|
|
|
|
|
|
|
|
|
// calculate the duration of the event for use with recurring events.
|
|
|
|
|
let duration = parseInt(endDate.format("x")) - parseInt(startDate.format("x"));
|
|
|
|
|
|
|
|
|
|
if (event.start.length === 8) {
|
|
|
|
|
startDate = startDate.startOf("day");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const title = getTitleFromEvent(event);
|
|
|
|
|
|
|
|
|
|
let excluded = false,
|
|
|
|
|
dateFilter = null;
|
|
|
|
|
|
|
|
|
|
for (let f in excludedEvents) {
|
|
|
|
|
let filter = excludedEvents[f],
|
|
|
|
|
testTitle = title.toLowerCase(),
|
|
|
|
|
until = null,
|
|
|
|
|
useRegex = false,
|
|
|
|
|
regexFlags = "g";
|
|
|
|
|
|
|
|
|
|
if (filter instanceof Object) {
|
|
|
|
|
if (typeof filter.until !== "undefined") {
|
|
|
|
|
until = filter.until;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (typeof filter.regex !== "undefined") {
|
|
|
|
|
useRegex = filter.regex;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If additional advanced filtering is added in, this section
|
|
|
|
|
// must remain last as we overwrite the filter object with the
|
|
|
|
|
// filterBy string
|
|
|
|
|
if (filter.caseSensitive) {
|
|
|
|
|
filter = filter.filterBy;
|
|
|
|
|
testTitle = title;
|
|
|
|
|
} else if (useRegex) {
|
|
|
|
|
filter = filter.filterBy;
|
|
|
|
|
testTitle = title;
|
|
|
|
|
regexFlags += "i";
|
|
|
|
|
if (!isFacebookBirthday) {
|
|
|
|
|
// make copy of start date, separate storage area
|
|
|
|
|
endDate = moment(startDate.format("x"), "x");
|
|
|
|
|
} else {
|
|
|
|
|
filter = filter.filterBy.toLowerCase();
|
|
|
|
|
endDate = moment(startDate).add(1, "days");
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
filter = filter.toLowerCase();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (testTitleByFilter(testTitle, filter, useRegex, regexFlags)) {
|
|
|
|
|
if (until) {
|
|
|
|
|
dateFilter = until;
|
|
|
|
|
} else {
|
|
|
|
|
excluded = true;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
Log.debug(" start=" + startDate.toDate() + " end=" + endDate.toDate());
|
|
|
|
|
|
|
|
|
|
if (excluded) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
// calculate the duration of the event for use with recurring events.
|
|
|
|
|
let duration = parseInt(endDate.format("x")) - parseInt(startDate.format("x"));
|
|
|
|
|
|
|
|
|
|
const location = event.location || false;
|
|
|
|
|
const geo = event.geo || false;
|
|
|
|
|
const description = event.description || false;
|
|
|
|
|
|
|
|
|
|
if (typeof event.rrule !== "undefined" && event.rrule !== null && !isFacebookBirthday) {
|
|
|
|
|
const rule = event.rrule;
|
|
|
|
|
let addedEvents = 0;
|
|
|
|
|
|
|
|
|
|
const pastMoment = moment(past);
|
|
|
|
|
const futureMoment = moment(future);
|
|
|
|
|
|
|
|
|
|
// can cause problems with e.g. birthdays before 1900
|
|
|
|
|
if ((rule.options && rule.origOptions && rule.origOptions.dtstart && rule.origOptions.dtstart.getFullYear() < 1900) || (rule.options && rule.options.dtstart && rule.options.dtstart.getFullYear() < 1900)) {
|
|
|
|
|
rule.origOptions.dtstart.setYear(1900);
|
|
|
|
|
rule.options.dtstart.setYear(1900);
|
|
|
|
|
if (event.start.length === 8) {
|
|
|
|
|
startDate = startDate.startOf("day");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// For recurring events, get the set of start dates that fall within the range
|
|
|
|
|
// of dates we're looking for.
|
|
|
|
|
// kblankenship1989 - to fix issue #1798, converting all dates to locale time first, then converting back to UTC time
|
|
|
|
|
let pastLocal = 0;
|
|
|
|
|
let futureLocal = 0;
|
|
|
|
|
if (isFullDayEvent(event)) {
|
|
|
|
|
// if full day event, only use the date part of the ranges
|
|
|
|
|
pastLocal = pastMoment.toDate();
|
|
|
|
|
futureLocal = futureMoment.toDate();
|
|
|
|
|
} else {
|
|
|
|
|
// if we want past events
|
|
|
|
|
if (includePastEvents) {
|
|
|
|
|
// use the calculated past time for the between from
|
|
|
|
|
pastLocal = pastMoment.toDate();
|
|
|
|
|
} else {
|
|
|
|
|
// otherwise use NOW.. cause we shouldnt use any before now
|
|
|
|
|
pastLocal = moment().toDate(); //now
|
|
|
|
|
}
|
|
|
|
|
futureLocal = futureMoment.toDate(); // future
|
|
|
|
|
}
|
|
|
|
|
Log.debug(" between=" + pastLocal + " to " + futureLocal);
|
|
|
|
|
const dates = rule.between(pastLocal, futureLocal, true, limitFunction);
|
|
|
|
|
Log.debug("title=" + event.summary + " dates=" + JSON.stringify(dates));
|
|
|
|
|
// The "dates" array contains the set of dates within our desired date range range that are valid
|
|
|
|
|
// for the recurrence rule. *However*, it's possible for us to have a specific recurrence that
|
|
|
|
|
// had its date changed from outside the range to inside the range. For the time being,
|
|
|
|
|
// we'll handle this by adding *all* recurrence entries into the set of dates that we check,
|
|
|
|
|
// because the logic below will filter out any recurrences that don't actually belong within
|
|
|
|
|
// our display range.
|
|
|
|
|
// Would be great if there was a better way to handle this.
|
|
|
|
|
if (event.recurrences !== undefined) {
|
|
|
|
|
for (let r in event.recurrences) {
|
|
|
|
|
// Only add dates that weren't already in the range we added from the rrule so that
|
|
|
|
|
// we don"t double-add those events.
|
|
|
|
|
if (moment(new Date(r)).isBetween(pastMoment, futureMoment) !== true) {
|
|
|
|
|
dates.push(new Date(r));
|
|
|
|
|
const title = getTitleFromEvent(event);
|
|
|
|
|
|
|
|
|
|
let excluded = false,
|
|
|
|
|
dateFilter = null;
|
|
|
|
|
|
|
|
|
|
for (let f in excludedEvents) {
|
|
|
|
|
let filter = excludedEvents[f],
|
|
|
|
|
testTitle = title.toLowerCase(),
|
|
|
|
|
until = null,
|
|
|
|
|
useRegex = false,
|
|
|
|
|
regexFlags = "g";
|
|
|
|
|
|
|
|
|
|
if (filter instanceof Object) {
|
|
|
|
|
if (typeof filter.until !== "undefined") {
|
|
|
|
|
until = filter.until;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (typeof filter.regex !== "undefined") {
|
|
|
|
|
useRegex = filter.regex;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// If additional advanced filtering is added in, this section
|
|
|
|
|
// must remain last as we overwrite the filter object with the
|
|
|
|
|
// filterBy string
|
|
|
|
|
if (filter.caseSensitive) {
|
|
|
|
|
filter = filter.filterBy;
|
|
|
|
|
testTitle = title;
|
|
|
|
|
} else if (useRegex) {
|
|
|
|
|
filter = filter.filterBy;
|
|
|
|
|
testTitle = title;
|
|
|
|
|
regexFlags += "i";
|
|
|
|
|
} else {
|
|
|
|
|
filter = filter.filterBy.toLowerCase();
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
filter = filter.toLowerCase();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (testTitleByFilter(testTitle, filter, useRegex, regexFlags)) {
|
|
|
|
|
if (until) {
|
|
|
|
|
dateFilter = until;
|
|
|
|
|
} else {
|
|
|
|
|
excluded = true;
|
|
|
|
|
}
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// Loop through the set of date entries to see which recurrences should be added to our event list.
|
|
|
|
|
for (let d in dates) {
|
|
|
|
|
let date = dates[d];
|
|
|
|
|
// ical.js started returning recurrences and exdates as ISOStrings without time information.
|
|
|
|
|
// .toISOString().substring(0,10) is the method they use to calculate keys, so we'll do the same
|
|
|
|
|
// (see https://github.com/peterbraden/ical.js/pull/84 )
|
|
|
|
|
const dateKey = date.toISOString().substring(0, 10);
|
|
|
|
|
let curEvent = event;
|
|
|
|
|
let showRecurrence = true;
|
|
|
|
|
|
|
|
|
|
// for full day events, the time might be off from RRULE/Luxon problem
|
|
|
|
|
if (excluded) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const location = event.location || false;
|
|
|
|
|
const geo = event.geo || false;
|
|
|
|
|
const description = event.description || false;
|
|
|
|
|
|
|
|
|
|
if (typeof event.rrule !== "undefined" && event.rrule !== null && !isFacebookBirthday) {
|
|
|
|
|
const rule = event.rrule;
|
|
|
|
|
let addedEvents = 0;
|
|
|
|
|
|
|
|
|
|
const pastMoment = moment(past);
|
|
|
|
|
const futureMoment = moment(future);
|
|
|
|
|
|
|
|
|
|
// can cause problems with e.g. birthdays before 1900
|
|
|
|
|
if ((rule.options && rule.origOptions && rule.origOptions.dtstart && rule.origOptions.dtstart.getFullYear() < 1900) || (rule.options && rule.options.dtstart && rule.options.dtstart.getFullYear() < 1900)) {
|
|
|
|
|
rule.origOptions.dtstart.setYear(1900);
|
|
|
|
|
rule.options.dtstart.setYear(1900);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// For recurring events, get the set of start dates that fall within the range
|
|
|
|
|
// of dates we're looking for.
|
|
|
|
|
// kblankenship1989 - to fix issue #1798, converting all dates to locale time first, then converting back to UTC time
|
|
|
|
|
let pastLocal = 0;
|
|
|
|
|
let futureLocal = 0;
|
|
|
|
|
if (isFullDayEvent(event)) {
|
|
|
|
|
Log.debug("fullday");
|
|
|
|
|
// if the offset is negative, east of GMT where the problem is
|
|
|
|
|
if (date.getTimezoneOffset() < 0) {
|
|
|
|
|
// get the offset of today where we are processing
|
|
|
|
|
// this will be the correction we need to apply
|
|
|
|
|
let nowOffset = new Date().getTimezoneOffset();
|
|
|
|
|
Log.debug("now offset is " + nowOffset);
|
|
|
|
|
// reduce the time by the offset
|
|
|
|
|
Log.debug(" recurring date is " + date + " offset is " + date.getTimezoneOffset());
|
|
|
|
|
// apply the correction to the date/time to get it UTC relative
|
|
|
|
|
date = new Date(date.getTime() - Math.abs(nowOffset) * 60000);
|
|
|
|
|
// the duration was calculated way back at the top before we could correct the start time..
|
|
|
|
|
// fix it for this event entry
|
|
|
|
|
duration = 24 * 60 * 60 * 1000;
|
|
|
|
|
Log.debug("new recurring date is " + date);
|
|
|
|
|
// if full day event, only use the date part of the ranges
|
|
|
|
|
pastLocal = pastMoment.toDate();
|
|
|
|
|
futureLocal = futureMoment.toDate();
|
|
|
|
|
} else {
|
|
|
|
|
// if we want past events
|
|
|
|
|
if (includePastEvents) {
|
|
|
|
|
// use the calculated past time for the between from
|
|
|
|
|
pastLocal = pastMoment.toDate();
|
|
|
|
|
} else {
|
|
|
|
|
// otherwise use NOW.. cause we shouldnt use any before now
|
|
|
|
|
pastLocal = moment().toDate(); //now
|
|
|
|
|
}
|
|
|
|
|
futureLocal = futureMoment.toDate(); // future
|
|
|
|
|
}
|
|
|
|
|
Log.debug(" between=" + pastLocal + " to " + futureLocal);
|
|
|
|
|
const dates = rule.between(pastLocal, futureLocal, true, limitFunction);
|
|
|
|
|
Log.debug("title=" + event.summary + " dates=" + JSON.stringify(dates));
|
|
|
|
|
// The "dates" array contains the set of dates within our desired date range range that are valid
|
|
|
|
|
// for the recurrence rule. *However*, it's possible for us to have a specific recurrence that
|
|
|
|
|
// had its date changed from outside the range to inside the range. For the time being,
|
|
|
|
|
// we'll handle this by adding *all* recurrence entries into the set of dates that we check,
|
|
|
|
|
// because the logic below will filter out any recurrences that don't actually belong within
|
|
|
|
|
// our display range.
|
|
|
|
|
// Would be great if there was a better way to handle this.
|
|
|
|
|
if (event.recurrences !== undefined) {
|
|
|
|
|
for (let r in event.recurrences) {
|
|
|
|
|
// Only add dates that weren't already in the range we added from the rrule so that
|
|
|
|
|
// we don"t double-add those events.
|
|
|
|
|
if (moment(new Date(r)).isBetween(pastMoment, futureMoment) !== true) {
|
|
|
|
|
dates.push(new Date(r));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
startDate = moment(date);
|
|
|
|
|
// Loop through the set of date entries to see which recurrences should be added to our event list.
|
|
|
|
|
for (let d in dates) {
|
|
|
|
|
let date = dates[d];
|
|
|
|
|
// ical.js started returning recurrences and exdates as ISOStrings without time information.
|
|
|
|
|
// .toISOString().substring(0,10) is the method they use to calculate keys, so we'll do the same
|
|
|
|
|
// (see https://github.com/peterbraden/ical.js/pull/84 )
|
|
|
|
|
const dateKey = date.toISOString().substring(0, 10);
|
|
|
|
|
let curEvent = event;
|
|
|
|
|
let showRecurrence = true;
|
|
|
|
|
|
|
|
|
|
let adjustDays = getCorrection(event, date);
|
|
|
|
|
// for full day events, the time might be off from RRULE/Luxon problem
|
|
|
|
|
if (isFullDayEvent(event)) {
|
|
|
|
|
Log.debug("fullday");
|
|
|
|
|
// if the offset is negative, east of GMT where the problem is
|
|
|
|
|
if (date.getTimezoneOffset() < 0) {
|
|
|
|
|
// get the offset of today where we are processing
|
|
|
|
|
// this will be the correction we need to apply
|
|
|
|
|
let nowOffset = new Date().getTimezoneOffset();
|
|
|
|
|
Log.debug("now offset is " + nowOffset);
|
|
|
|
|
// reduce the time by the offset
|
|
|
|
|
Log.debug(" recurring date is " + date + " offset is " + date.getTimezoneOffset());
|
|
|
|
|
// apply the correction to the date/time to get it UTC relative
|
|
|
|
|
date = new Date(date.getTime() - Math.abs(nowOffset) * 60000);
|
|
|
|
|
// the duration was calculated way back at the top before we could correct the start time..
|
|
|
|
|
// fix it for this event entry
|
|
|
|
|
duration = 24 * 60 * 60 * 1000;
|
|
|
|
|
Log.debug("new recurring date is " + date);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
startDate = moment(date);
|
|
|
|
|
|
|
|
|
|
// For each date that we're checking, it's possible that there is a recurrence override for that one day.
|
|
|
|
|
if (curEvent.recurrences !== undefined && curEvent.recurrences[dateKey] !== undefined) {
|
|
|
|
|
// We found an override, so for this recurrence, use a potentially different title, start date, and duration.
|
|
|
|
|
curEvent = curEvent.recurrences[dateKey];
|
|
|
|
|
startDate = moment(curEvent.start);
|
|
|
|
|
duration = parseInt(moment(curEvent.end).format("x")) - parseInt(startDate.format("x"));
|
|
|
|
|
let adjustDays = getCorrection(event, date);
|
|
|
|
|
|
|
|
|
|
// For each date that we're checking, it's possible that there is a recurrence override for that one day.
|
|
|
|
|
if (curEvent.recurrences !== undefined && curEvent.recurrences[dateKey] !== undefined) {
|
|
|
|
|
// We found an override, so for this recurrence, use a potentially different title, start date, and duration.
|
|
|
|
|
curEvent = curEvent.recurrences[dateKey];
|
|
|
|
|
startDate = moment(curEvent.start);
|
|
|
|
|
duration = parseInt(moment(curEvent.end).format("x")) - parseInt(startDate.format("x"));
|
|
|
|
|
}
|
|
|
|
|
// If there's no recurrence override, check for an exception date. Exception dates represent exceptions to the rule.
|
|
|
|
|
else if (curEvent.exdate !== undefined && curEvent.exdate[dateKey] !== undefined) {
|
|
|
|
|
// This date is an exception date, which means we should skip it in the recurrence pattern.
|
|
|
|
|
showRecurrence = false;
|
|
|
|
|
}
|
|
|
|
|
Log.debug("duration=" + duration);
|
|
|
|
|
|
|
|
|
|
endDate = moment(parseInt(startDate.format("x")) + duration, "x");
|
|
|
|
|
if (startDate.format("x") === endDate.format("x")) {
|
|
|
|
|
endDate = endDate.endOf("day");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const recurrenceTitle = getTitleFromEvent(curEvent);
|
|
|
|
|
|
|
|
|
|
// If this recurrence ends before the start of the date range, or starts after the end of the date range, don"t add
|
|
|
|
|
// it to the event list.
|
|
|
|
|
if (endDate.isBefore(past) || startDate.isAfter(future)) {
|
|
|
|
|
showRecurrence = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (timeFilterApplies(now, endDate, dateFilter)) {
|
|
|
|
|
showRecurrence = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (showRecurrence === true) {
|
|
|
|
|
Log.debug("saving event =" + description);
|
|
|
|
|
addedEvents++;
|
|
|
|
|
newEvents.push({
|
|
|
|
|
title: recurrenceTitle,
|
|
|
|
|
startDate: (adjustDays ? (adjustDays > 0 ? startDate.add(adjustDays, "hours") : startDate.subtract(Math.abs(adjustDays), "hours")) : startDate).format("x"),
|
|
|
|
|
endDate: (adjustDays ? (adjustDays > 0 ? endDate.add(adjustDays, "hours") : endDate.subtract(Math.abs(adjustDays), "hours")) : endDate).format("x"),
|
|
|
|
|
fullDayEvent: isFullDayEvent(event),
|
|
|
|
|
recurringEvent: true,
|
|
|
|
|
class: event.class,
|
|
|
|
|
firstYear: event.start.getFullYear(),
|
|
|
|
|
location: location,
|
|
|
|
|
geo: geo,
|
|
|
|
|
description: description
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// If there's no recurrence override, check for an exception date. Exception dates represent exceptions to the rule.
|
|
|
|
|
else if (curEvent.exdate !== undefined && curEvent.exdate[dateKey] !== undefined) {
|
|
|
|
|
// This date is an exception date, which means we should skip it in the recurrence pattern.
|
|
|
|
|
showRecurrence = false;
|
|
|
|
|
}
|
|
|
|
|
Log.debug("duration=" + duration);
|
|
|
|
|
// end recurring event parsing
|
|
|
|
|
} else {
|
|
|
|
|
// Single event.
|
|
|
|
|
const fullDayEvent = isFacebookBirthday ? true : isFullDayEvent(event);
|
|
|
|
|
// Log.debug("full day event")
|
|
|
|
|
|
|
|
|
|
endDate = moment(parseInt(startDate.format("x")) + duration, "x");
|
|
|
|
|
if (startDate.format("x") === endDate.format("x")) {
|
|
|
|
|
endDate = endDate.endOf("day");
|
|
|
|
|
if (includePastEvents) {
|
|
|
|
|
// Past event is too far in the past, so skip.
|
|
|
|
|
if (endDate < past) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
// It's not a fullday event, and it is in the past, so skip.
|
|
|
|
|
if (!fullDayEvent && endDate < new Date()) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// It's a fullday event, and it is before today, So skip.
|
|
|
|
|
if (fullDayEvent && endDate <= today) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
const recurrenceTitle = getTitleFromEvent(curEvent);
|
|
|
|
|
|
|
|
|
|
// If this recurrence ends before the start of the date range, or starts after the end of the date range, don"t add
|
|
|
|
|
// it to the event list.
|
|
|
|
|
if (endDate.isBefore(past) || startDate.isAfter(future)) {
|
|
|
|
|
showRecurrence = false;
|
|
|
|
|
// It exceeds the maximumNumberOfDays limit, so skip.
|
|
|
|
|
if (startDate > future) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (timeFilterApplies(now, endDate, dateFilter)) {
|
|
|
|
|
showRecurrence = false;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (showRecurrence === true) {
|
|
|
|
|
Log.debug("saving event =" + description);
|
|
|
|
|
addedEvents++;
|
|
|
|
|
newEvents.push({
|
|
|
|
|
title: recurrenceTitle,
|
|
|
|
|
startDate: (adjustDays ? (adjustDays > 0 ? startDate.add(adjustDays, "hours") : startDate.subtract(Math.abs(adjustDays), "hours")) : startDate).format("x"),
|
|
|
|
|
endDate: (adjustDays ? (adjustDays > 0 ? endDate.add(adjustDays, "hours") : endDate.subtract(Math.abs(adjustDays), "hours")) : endDate).format("x"),
|
|
|
|
|
fullDayEvent: isFullDayEvent(event),
|
|
|
|
|
recurringEvent: true,
|
|
|
|
|
class: event.class,
|
|
|
|
|
firstYear: event.start.getFullYear(),
|
|
|
|
|
location: location,
|
|
|
|
|
geo: geo,
|
|
|
|
|
description: description
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
// end recurring event parsing
|
|
|
|
|
} else {
|
|
|
|
|
// Single event.
|
|
|
|
|
const fullDayEvent = isFacebookBirthday ? true : isFullDayEvent(event);
|
|
|
|
|
// Log.debug("full day event")
|
|
|
|
|
|
|
|
|
|
if (includePastEvents) {
|
|
|
|
|
// Past event is too far in the past, so skip.
|
|
|
|
|
if (endDate < past) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
} else {
|
|
|
|
|
// It's not a fullday event, and it is in the past, so skip.
|
|
|
|
|
if (!fullDayEvent && endDate < new Date()) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// It's a fullday event, and it is before today, So skip.
|
|
|
|
|
if (fullDayEvent && endDate <= today) {
|
|
|
|
|
return;
|
|
|
|
|
// Adjust start date so multiple day events will be displayed as happening today even though they started some days ago already
|
|
|
|
|
if (fullDayEvent && startDate <= today) {
|
|
|
|
|
startDate = moment(today);
|
|
|
|
|
}
|
|
|
|
|
// if the start and end are the same, then make end the 'end of day' value (start is at 00:00:00)
|
|
|
|
|
if (fullDayEvent && startDate.format("x") === endDate.format("x")) {
|
|
|
|
|
endDate = endDate.endOf("day");
|
|
|
|
|
}
|
|
|
|
|
// get correction for date saving and dst change between now and then
|
|
|
|
|
let adjustDays = getCorrection(event, startDate.toDate());
|
|
|
|
|
// Every thing is good. Add it to the list.
|
|
|
|
|
newEvents.push({
|
|
|
|
|
title: title,
|
|
|
|
|
startDate: (adjustDays ? (adjustDays > 0 ? startDate.add(adjustDays, "hours") : startDate.subtract(Math.abs(adjustDays), "hours")) : startDate).format("x"),
|
|
|
|
|
endDate: (adjustDays ? (adjustDays > 0 ? endDate.add(adjustDays, "hours") : endDate.subtract(Math.abs(adjustDays), "hours")) : endDate).format("x"),
|
|
|
|
|
fullDayEvent: fullDayEvent,
|
|
|
|
|
class: event.class,
|
|
|
|
|
location: location,
|
|
|
|
|
geo: geo,
|
|
|
|
|
description: description
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// It exceeds the maximumNumberOfDays limit, so skip.
|
|
|
|
|
if (startDate > future) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (timeFilterApplies(now, endDate, dateFilter)) {
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// Adjust start date so multiple day events will be displayed as happening today even though they started some days ago already
|
|
|
|
|
if (fullDayEvent && startDate <= today) {
|
|
|
|
|
startDate = moment(today);
|
|
|
|
|
}
|
|
|
|
|
// if the start and end are the same, then make end the 'end of day' value (start is at 00:00:00)
|
|
|
|
|
if (fullDayEvent && startDate.format("x") === endDate.format("x")) {
|
|
|
|
|
endDate = endDate.endOf("day");
|
|
|
|
|
}
|
|
|
|
|
// get correction for date saving and dst change between now and then
|
|
|
|
|
let adjustDays = getCorrection(event, startDate.toDate());
|
|
|
|
|
// Every thing is good. Add it to the list.
|
|
|
|
|
newEvents.push({
|
|
|
|
|
title: title,
|
|
|
|
|
startDate: (adjustDays ? (adjustDays > 0 ? startDate.add(adjustDays, "hours") : startDate.subtract(Math.abs(adjustDays), "hours")) : startDate).format("x"),
|
|
|
|
|
endDate: (adjustDays ? (adjustDays > 0 ? endDate.add(adjustDays, "hours") : endDate.subtract(Math.abs(adjustDays), "hours")) : endDate).format("x"),
|
|
|
|
|
fullDayEvent: fullDayEvent,
|
|
|
|
|
class: event.class,
|
|
|
|
|
location: location,
|
|
|
|
|
geo: geo,
|
|
|
|
|
description: description
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
newEvents.sort(function (a, b) {
|
|
|
|
|
return a.startDate - b.startDate;
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
// include up to maximumEntries current or upcoming events
|
|
|
|
|
// If past events should be included, include all past events
|
|
|
|
|
const now = moment();
|
|
|
|
|
var entries = 0;
|
|
|
|
|
events = [];
|
|
|
|
|
for (let ne of newEvents) {
|
|
|
|
|
if (moment(ne.endDate, "x").isBefore(now)) {
|
|
|
|
|
if (includePastEvents) events.push(ne);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
entries++;
|
|
|
|
|
// If max events has been saved, skip the rest
|
|
|
|
|
if (entries > maximumEntries) break;
|
|
|
|
|
events.push(ne);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
self.broadcastEvents();
|
|
|
|
|
scheduleTimer();
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
newEvents.sort(function (a, b) {
|
|
|
|
|
return a.startDate - b.startDate;
|
|
|
|
|
});
|
|
|
|
|
|
|
|
|
|
// include up to maximumEntries current or upcoming events
|
|
|
|
|
// If past events should be included, include all past events
|
|
|
|
|
const now = moment();
|
|
|
|
|
var entries = 0;
|
|
|
|
|
events = [];
|
|
|
|
|
for (let ne of newEvents) {
|
|
|
|
|
if (moment(ne.endDate, "x").isBefore(now)) {
|
|
|
|
|
if (includePastEvents) events.push(ne);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
entries++;
|
|
|
|
|
// If max events has been saved, skip the rest
|
|
|
|
|
if (entries > maximumEntries) break;
|
|
|
|
|
events.push(ne);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
self.broadcastEvents();
|
|
|
|
|
scheduleTimer();
|
|
|
|
|
});
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
|
Michael Teeuw
GitHub