[Migration] NPM (#1266)

* chore: add npm + vite for progressive enhancement * fix: update Dockerfile to copy only the dist folder contents * fix: update Dockerfile to use multi-stage build for optimized production image * fix: correct nginx config file copy command in Dockerfile * chore: add netlify configuration for build and redirects * fix: add NODE_VERSION to environment in Netlify configuration * remove wrong dist folder * Update package.json Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> * chore: split public and src * migrating all util files from js to ts * feat: Implement HeightmapGenerator and Voronoi module - Added HeightmapGenerator class for generating heightmaps with various tools (Hill, Pit, Range, Trough, Strait, etc.). - Introduced Voronoi class for creating Voronoi diagrams using Delaunator. - Updated index.html to include new modules. - Created index.ts to manage module imports. - Enhanced arrayUtils and graphUtils with type definitions and improved functionality. - Added utility functions for generating grids and calculating Voronoi cells. * chore: add GitHub Actions workflow for deploying to GitHub Pages * fix: update branch name in GitHub Actions workflow from 'main' to 'master' * chore: update package.json to specify Node.js engine version and remove unused launch.json * Initial plan * Update copilot guidelines to reflect NPM/Vite/TypeScript migration Co-authored-by: Azgaar <26469650+Azgaar@users.noreply.github.com> * Update src/modules/heightmap-generator.ts Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> * Update src/utils/graphUtils.ts Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> * Update src/modules/heightmap-generator.ts Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> * feat: Add TIME and ERROR variables to global scope in HeightmapGenerator * fix: Update base path in vite.config.ts for Netlify deployment * fix: Update Node.js version in Dockerfile to 24-alpine --------- Co-authored-by: Marc Emmanuel <marc.emmanuel@tado.com> Co-authored-by: Marc Emmanuel <marcwissler@gmail.com> Co-authored-by: Copilot <175728472+Copilot@users.noreply.github.com> Co-authored-by: copilot-swe-agent[bot] <198982749+Copilot@users.noreply.github.com> Co-authored-by: Azgaar <26469650+Azgaar@users.noreply.github.com>
2026-02-04 17:41:23 +01:00 · 2026-01-22 12:20:12 +01:00 · 2026-01-22 12:20:12 +01:00 · 9e0eb03618
commit 9e0eb03618
parent 0c26f0831f
713 changed files with 5182 additions and 2161 deletions
--- a/public/modules/renderers/draw-borders.js
+++ b/public/modules/renderers/draw-borders.js
@ -0,0 +1,120 @@
+"use strict";
+
+function drawBorders() {
+  TIME && console.time("drawBorders");
+  const {cells, vertices} = pack;
+
+  const statePath = [];
+  const provincePath = [];
+  const checked = {};
+
+  const isLand = cellId => cells.h[cellId] >= 20;
+
+  for (let cellId = 0; cellId < cells.i.length; cellId++) {
+    if (!cells.state[cellId]) continue;
+    const provinceId = cells.province[cellId];
+    const stateId = cells.state[cellId];
+
+    // bordering cell of another province
+    if (provinceId) {
+      const provToCell = cells.c[cellId].find(neibId => {
+        const neibProvinceId = cells.province[neibId];
+        return (
+          neibProvinceId &&
+          provinceId > neibProvinceId &&
+          !checked[`prov-${provinceId}-${neibProvinceId}-${cellId}`] &&
+          cells.state[neibId] === stateId
+        );
+      });
+
+      if (provToCell !== undefined) {
+        const addToChecked = cellId => (checked[`prov-${provinceId}-${cells.province[provToCell]}-${cellId}`] = true);
+        const border = getBorder({type: "province", fromCell: cellId, toCell: provToCell, addToChecked});
+
+        if (border) {
+          provincePath.push(border);
+          cellId--; // check the same cell again
+          continue;
+        }
+      }
+    }
+
+    // if cell is on state border
+    const stateToCell = cells.c[cellId].find(neibId => {
+      const neibStateId = cells.state[neibId];
+      return isLand(neibId) && stateId > neibStateId && !checked[`state-${stateId}-${neibStateId}-${cellId}`];
+    });
+
+    if (stateToCell !== undefined) {
+      const addToChecked = cellId => (checked[`state-${stateId}-${cells.state[stateToCell]}-${cellId}`] = true);
+      const border = getBorder({type: "state", fromCell: cellId, toCell: stateToCell, addToChecked});
+
+      if (border) {
+        statePath.push(border);
+        cellId--; // check the same cell again
+        continue;
+      }
+    }
+  }
+
+  svg.select("#borders").selectAll("path").remove();
+  svg.select("#stateBorders").append("path").attr("d", statePath.join(" "));
+  svg.select("#provinceBorders").append("path").attr("d", provincePath.join(" "));
+
+  function getBorder({type, fromCell, toCell, addToChecked}) {
+    const getType = cellId => cells[type][cellId];
+    const isTypeFrom = cellId => cellId < cells.i.length && getType(cellId) === getType(fromCell);
+    const isTypeTo = cellId => cellId < cells.i.length && getType(cellId) === getType(toCell);
+
+    addToChecked(fromCell);
+    const startingVertex = cells.v[fromCell].find(v => vertices.c[v].some(i => isLand(i) && isTypeTo(i)));
+    if (startingVertex === undefined) return null;
+
+    const checkVertex = vertex =>
+      vertices.c[vertex].some(isTypeFrom) && vertices.c[vertex].some(c => isLand(c) && isTypeTo(c));
+    const chain = getVerticesLine({vertices, startingVertex, checkCell: isTypeFrom, checkVertex, addToChecked});
+    if (chain.length > 1) return "M" + chain.map(cellId => vertices.p[cellId]).join(" ");
+
+    return null;
+  }
+
+  // connect vertices to chain to form a border
+  function getVerticesLine({vertices, startingVertex, checkCell, checkVertex, addToChecked}) {
+    let chain = []; // vertices chain to form a path
+    let next = startingVertex;
+    const MAX_ITERATIONS = vertices.c.length;
+
+    for (let run = 0; run < 2; run++) {
+      // first run: from any vertex to a border edge
+      // second run: from found border edge to another edge
+      chain = [];
+
+      for (let i = 0; i < MAX_ITERATIONS; i++) {
+        const previous = chain.at(-1);
+        const current = next;
+        chain.push(current);
+
+        const neibCells = vertices.c[current];
+        neibCells.map(addToChecked);
+
+        const [c1, c2, c3] = neibCells.map(checkCell);
+        const [v1, v2, v3] = vertices.v[current].map(checkVertex);
+        const [vertex1, vertex2, vertex3] = vertices.v[current];
+
+        if (v1 && vertex1 !== previous && c1 !== c2) next = vertex1;
+        else if (v2 && vertex2 !== previous && c2 !== c3) next = vertex2;
+        else if (v3 && vertex3 !== previous && c1 !== c3) next = vertex3;
+
+        if (next === current || next === startingVertex) {
+          if (next === startingVertex) chain.push(startingVertex);
+          startingVertex = next;
+          break;
+        }
+      }
+    }
+
+    return chain;
+  }
+
+  TIME && console.timeEnd("drawBorders");
+}