mirror of
https://github.com/Azgaar/Fantasy-Map-Generator.git
synced 2025-12-16 17:31:24 +01:00
* feat: routes generation * feat: routes rendering * feat: searoutes fix, changing reGraph * feat: searoute - change pathfinding algo * feat: routes - cleanup code * feat: routes - change data format * feat: routes - add routes to json export * feat: edit routes - start * feat: edit routes - main * feat: edit routes - EP * feat: edit routes - remove route * feat: route - generate names * feat: route - continue * Refactor route merging logic for improved performance * feat: routes - show name in tooltip * feat: routes - create route dialog * feat: update data on control point remove * feat: routes editor - split route * feat: add join route functionality to routes editor * feat: Add join route functionality to routes editor * feat: Update join route tooltip in routes editor * feat: routes overview - sort by length * feat: routes overview - fix distanceScale value * feat: routes overview - create route * Refactor getMiddlePoint function to getCloseToEdgePoint * feat: routes - change data format, fix issues * feat: routes - regenerateRoutes * feat: routes - add route on burg creation * chore - remove merge conflict markers * chore - remove merge conflict markers * feat: routes name - no unnamed burg names * feat: routes - lock routes * fix: routes - split routes * feat: routes - tip correction * feat: routes - auto-update part 1 * feat: routes - return old rePacj logic to not break auto-update * feat: routes - auto-update - add connections --------- Co-authored-by: Azgaar <azgaar.fmg@yandex.com>
31 lines
867 B
JavaScript
31 lines
867 B
JavaScript
"use strict";
|
|
// FMG helper functions
|
|
|
|
// extracted d3 code to bypass version conflicts
|
|
// https://github.com/d3/d3-array/blob/main/src/group.js
|
|
function rollups(values, reduce, ...keys) {
|
|
return nest(values, Array.from, reduce, keys);
|
|
}
|
|
|
|
function nest(values, map, reduce, keys) {
|
|
return (function regroup(values, i) {
|
|
if (i >= keys.length) return reduce(values);
|
|
const groups = new Map();
|
|
const keyof = keys[i++];
|
|
let index = -1;
|
|
for (const value of values) {
|
|
const key = keyof(value, ++index, values);
|
|
const group = groups.get(key);
|
|
if (group) group.push(value);
|
|
else groups.set(key, [value]);
|
|
}
|
|
for (const [key, values] of groups) {
|
|
groups.set(key, regroup(values, i));
|
|
}
|
|
return map(groups);
|
|
})(values, 0);
|
|
}
|
|
|
|
function dist2([x1, y1], [x2, y2]) {
|
|
return (x1 - x2) ** 2 + (y1 - y2) ** 2;
|
|
}
|