mirror of
https://github.com/Kizuren/statusPage.git
synced 2025-12-28 01:54:43 +01:00
72 lines
1.9 KiB
JavaScript
72 lines
1.9 KiB
JavaScript
let config;
|
|
document.addEventListener("DOMContentLoaded", async () => {
|
|
let $main = document.querySelector('main');
|
|
const refreshStatus = async () => {
|
|
try {
|
|
const response = await fetch('./status.json');
|
|
if (!response.ok) {
|
|
throw new Error(`Error fetching status.json: ${response.statusText}`);
|
|
}
|
|
const status = await response.json();
|
|
config = status.config;
|
|
console.log(status);
|
|
for (let [siteId, endpointIds] of status.ui) {
|
|
let site = status.sites[siteId];
|
|
if(!site)
|
|
continue;
|
|
|
|
let $site = document.createElement('div');
|
|
$site.classList.add('site');
|
|
let $siteName = document.createElement('h1');
|
|
$siteName.innerText = site.name;
|
|
$site.append($siteName);
|
|
|
|
let $statusBar = document.createElement('status-bar');
|
|
$statusBar.logs = '';
|
|
$site.append($statusBar);
|
|
$main.append($site);
|
|
|
|
for (let endpointId of endpointIds) {
|
|
let endpoint = site.endpoints[endpointId];
|
|
if(!endpoint)
|
|
continue;
|
|
let $endpoint = document.createElement('div');
|
|
$endpoint.classList.add('endpoint');
|
|
|
|
$endpointName = document.createElement('h3');
|
|
$endpointName.innerText = endpoint.name;
|
|
$endpoint.append($endpointName);
|
|
|
|
let $statusBarEndpoint = document.createElement('status-bar');
|
|
$statusBarEndpoint.logs = endpoint.logs;
|
|
$endpoint.append($statusBarEndpoint);
|
|
|
|
$site.append($endpoint);
|
|
}
|
|
}
|
|
} catch (error) {
|
|
console.error("Error loading server status:", error);
|
|
}
|
|
};
|
|
refreshStatus();
|
|
setInterval(refreshStatus, 60_000); // Refresh every minute
|
|
});
|
|
const formatDate = (date) => new Intl.DateTimeFormat('en-US', {
|
|
month: 'long',
|
|
day: 'numeric',
|
|
year: 'numeric',
|
|
hour: 'numeric',
|
|
minute: '2-digit',
|
|
hour12: true
|
|
}).format(date);
|
|
|
|
const findClosestPoint = (logs, t, maxDistance=Infinity) => {
|
|
let best;
|
|
for(let log of logs) {
|
|
let d = Math.abs(log.t-t);
|
|
if(d <= maxDistance && (!best || d<Math.abs(best.t-t))) {
|
|
best = log;
|
|
}
|
|
}
|
|
return best;
|
|
}
|