Andy Dixon
1e11e4a650
Blades named the file they were attached to. They now act as street signs: for each corner of a folder's block, the building nearest that corner gets a green blade on each wall facing the corner's two streets, near the corner end, reading the folder path (shortened from the left when long; the repository name at the root). Neighbouring blocks each sign their own corner, so an intersection shows a different folder on every side. Courtyard walls set back from the street are skipped, and blades still shorten or disappear when a neighbour is too close. File names remain on the flat wall and roof signs.
83 lines
4.5 KiB
JavaScript
83 lines
4.5 KiB
JavaScript
import { test } from 'node:test';
|
|
import assert from 'node:assert/strict';
|
|
import { ShelfPacker } from '../web/labels.js';
|
|
import { flatQuad, wallSigns, facadeQuad } from '../web/city.js';
|
|
|
|
test('shelf packer fills rows then reports full', () => {
|
|
const packer = new ShelfPacker(100, 20, 10);
|
|
assert.deepEqual(packer.add(60), { x: 0, y: 0, w: 60, h: 10 });
|
|
assert.deepEqual(packer.add(60), { x: 0, y: 10, w: 60, h: 10 });
|
|
assert.deepEqual(packer.add(30), { x: 62, y: 10, w: 30, h: 10 });
|
|
assert.equal(packer.add(30), null);
|
|
packer.reset();
|
|
assert.deepEqual(packer.add(500), { x: 0, y: 0, w: 100, h: 10 });
|
|
});
|
|
|
|
const building = { x: 0, y: 0, w: 20, h: 10, height: 30 };
|
|
const cross = (a, b) => [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];
|
|
|
|
test('wall signs only appear on walls facing the viewer and read left to right', () => {
|
|
const south = wallSigns(building, [10, 50, 1.7], 4);
|
|
assert.equal(south.length, 1);
|
|
assert.ok(south[0].c[1] > 10 && south[0].u[0] > 0, 'south wall reads along +x for a viewer looking north');
|
|
const corner = wallSigns(building, [40, 40, 1.7], 4);
|
|
assert.equal(corner.length, 2);
|
|
for (const quad of corner) {
|
|
// u x v points out of the wall toward the viewer when text reads correctly (left-handed world).
|
|
const normal = cross(quad.u, quad.v), toEye = [40 - quad.c[0], 40 - quad.c[1], 0];
|
|
assert.ok(normal[0] * toEye[0] + normal[1] * toEye[1] < 0);
|
|
}
|
|
assert.ok(wallSigns(building, [10, 50, 1.7], 100)[0].u[0] * 2 <= 20 * .85 + 1e-9, 'long names shrink to the wall');
|
|
const long = wallSigns({ x: 0, y: 0, w: 100, h: 10, height: 30 }, [50, 50, 1.7], 4);
|
|
assert.equal(long.length, 4, 'a 100 m wall repeats its sign');
|
|
assert.ok(long.every(quad => quad.c[1] > 10) && new Set(long.map(quad => Math.round(quad.c[0]))).size === 4);
|
|
});
|
|
|
|
test('facade covers the most squarely facing wall within the building', () => {
|
|
const quad = facadeQuad(building, [60, 5, 1.7], .5);
|
|
assert.ok(quad.c[0] > 20, 'east wall');
|
|
const height = quad.v[2] * 2, width = Math.hypot(quad.u[0], quad.u[1]) * 2;
|
|
assert.ok(Math.abs(width / height - .5) < 1e-9 && quad.c[2] + height / 2 <= building.height);
|
|
assert.deepEqual(flatQuad(1, 2, 3, 4, 2), { c: [1, 2, 3], u: [2, 0, 0], v: [0, -1, 0] });
|
|
});
|
|
|
|
import { folderBlades, folderLabel, readableFrom } from '../web/city.js';
|
|
|
|
// A 2x2 grid of buildings inside a block whose kerb is 2.5 m from the boundary.
|
|
const block = { x: 0, y: 0, w: 50, h: 50 };
|
|
const grid = [
|
|
{ x: 2.5, y: 2.5, w: 20, h: 20, height: 30 }, { x: 27.5, y: 2.5, w: 20, h: 20, height: 30 },
|
|
{ x: 2.5, y: 27.5, w: 20, h: 20, height: 30 }, { x: 27.5, y: 27.5, w: 20, h: 20, height: 30 },
|
|
];
|
|
|
|
test('folder blades sit at every block corner, on street-facing walls, pointing outward', () => {
|
|
const blades = folderBlades(block, grid, null, 4);
|
|
assert.equal(blades.length, 16, 'two walls per corner, two faces per blade');
|
|
for (let i = 0; i < blades.length; i += 2) {
|
|
const [a, b] = [blades[i], blades[i + 1]];
|
|
const outward = [Math.sign(a.u[0]), Math.sign(a.u[1])];
|
|
const corner = [a.c[0] < 25 ? 0 : 50, a.c[1] < 25 ? 0 : 50];
|
|
assert.ok(Math.hypot(a.c[0] - corner[0], a.c[1] - corner[1]) < 6, `near its corner: ${a.c}`);
|
|
assert.ok(outward[0] ? (outward[0] > 0) === (a.c[0] > 25) : (outward[1] > 0) === (a.c[1] > 25), 'projects into the street');
|
|
for (const eye of [[a.c[0] + a.v[2] * 0 + (a.u[1] ? 10 : 0), a.c[1] + (a.u[0] ? 10 : 0), 2], [a.c[0] - (a.u[1] ? 10 : 0), a.c[1] - (a.u[0] ? 10 : 0), 2]]) {
|
|
assert.equal(readableFrom(a, eye) + readableFrom(b, eye), 1);
|
|
}
|
|
}
|
|
});
|
|
|
|
test('courtyard walls, hidden walls and cramped gaps get no blades', () => {
|
|
const inner = [{ x: 10, y: 10, w: 30, h: 30, height: 30 }];
|
|
assert.equal(folderBlades(block, inner, null, 4).length, 0, 'set back from the street');
|
|
const northOnly = folderBlades(block, grid, [25, -40, 1.7], 4);
|
|
assert.ok(northOnly.length === 4 && northOnly.every(q => q.c[1] < 2.5), 'only walls facing the viewer');
|
|
assert.equal(folderBlades(block, grid, null, 4, () => 1).length, 0);
|
|
assert.ok(readableFrom(flatQuad(0, 0, 0, 4, 1), [0, 0, 50]), 'ground labels read from above');
|
|
});
|
|
|
|
test('folder labels keep the tail of long paths', () => {
|
|
assert.equal(folderLabel('', 'prometheus'), 'prometheus');
|
|
assert.equal(folderLabel('tsdb/chunks', 'x'), 'tsdb/chunks');
|
|
const long = folderLabel('web/ui/react-app/src/pages/graph/components', 'x');
|
|
assert.ok(long.startsWith('…/') && long.endsWith('graph/components') && long.length <= 34 + 2, long);
|
|
});
|