dtoro
d4d99a7473
Problem: the hexagonal refactor churns the backend tree for nine more phases; the UI delivery stack (web/ SPA, cmd/desktop Wails wrapper, compose/web image) must move to its own repo first so doc/layout rewrites land once on a backend-only tree. Change: - New repo git.hubris.network/dtoro/oikos-web (v0.33.0): web/, desktop/ (updateURL repointed to oikos-web releases), compose/, own CI (web + desktop jobs), own deploy script (CI-green gate, TOCTOU guard, version-tagged images, prune-to-3), own webhook receiver on :9798 + launchd unit, own compose project publishing the same 8091:80. - Cutover executed on mac-mini in order: oikos stack's web service stopped+removed, oikos-web project brought up on 8091; outer Caddy untouched (targets the published port) — serving + Authentik flow + /wails 404 quirk verified post-cutover. - Stripped from oikos: web/, cmd/desktop/, compose/web/, desktop CI workflow, ci.yml web job, Makefile ui/desktop/desktop-package/install targets, the compose web service, oikos-web from deploy.sh's fallback prune list; wails + go-keyring dropped from go.mod, vendor synced. - README / CONTRIBUTING / AGENTS.md / .agents dev+operations docs now point at the new repo; mbse + mascot design docs carry a path note. Risk: production SPA serving depends on the new pipeline now; rollback is versioned-image re-up of the old web service from a pre-split checkout (port 8091). Desktop builds installed before the split still check dtoro/oikos releases — one manual reinstall, noted in the oikos-web release notes. Verification: go vet, make test (race), make generate-check, golangci (no new findings; baseline down 400→365); post-cutover curls — localhost:8091 200, /wails/runtime.js 404, outer Caddy 302 Authentik.
88 lines
3.5 KiB
JavaScript
88 lines
3.5 KiB
JavaScript
"use strict";
|
|
|
|
Object.defineProperty(exports, "__esModule", {
|
|
value: true
|
|
});
|
|
exports["default"] = misc;
|
|
var _assert = _interopRequireDefault(require("assert"));
|
|
var _helpers = require("./helpers");
|
|
function _interopRequireDefault(e) { return e && e.__esModule ? e : { "default": e }; }
|
|
/**
|
|
* Graphology Misc Specs
|
|
* ======================
|
|
*
|
|
* Testing the miscellaneous things about the graph.
|
|
*/
|
|
|
|
function misc(Graph) {
|
|
return {
|
|
Structure: {
|
|
'a simple mixed graph can have A->B, B->A & A<->B': function a_simple_mixed_graph_can_have_AB_BA__AB() {
|
|
var graph = new Graph();
|
|
(0, _helpers.addNodesFrom)(graph, ['Audrey', 'Benjamin']);
|
|
_assert["default"].doesNotThrow(function () {
|
|
graph.addEdge('Audrey', 'Benjamin');
|
|
graph.addEdge('Benjamin', 'Audrey');
|
|
graph.addUndirectedEdge('Benjamin', 'Audrey');
|
|
});
|
|
},
|
|
'deleting the last edge between A & B should correctly clear neighbor index.': function deleting_the_last_edge_between_A__B_should_correctly_clear_neighbor_index() {
|
|
var graph = new Graph({
|
|
multi: true
|
|
});
|
|
graph.addNode('A');
|
|
graph.addNode('B');
|
|
graph.addEdge('A', 'B');
|
|
graph.addEdge('A', 'B');
|
|
graph.forEachEdge('A', function (edge) {
|
|
return graph.dropEdge(edge);
|
|
});
|
|
_assert["default"].deepStrictEqual(graph.neighbors('A'), []);
|
|
_assert["default"].deepStrictEqual(graph.neighbors('B'), []);
|
|
},
|
|
'exhaustive deletion use-cases should not break doubly-linked lists implementation of multigraph edge storage.': function exhaustive_deletion_useCases_should_not_break_doublyLinked_lists_implementation_of_multigraph_edge_storage() {
|
|
var graph = new Graph({
|
|
multi: true
|
|
});
|
|
graph.mergeEdgeWithKey('1', 'A', 'B');
|
|
graph.mergeEdgeWithKey('2', 'A', 'B');
|
|
graph.mergeEdgeWithKey('3', 'A', 'B');
|
|
graph.mergeEdgeWithKey('4', 'A', 'B');
|
|
graph.dropEdge('1');
|
|
graph.dropEdge('2');
|
|
graph.dropEdge('3');
|
|
graph.dropEdge('4');
|
|
_assert["default"].strictEqual(graph.size, 0);
|
|
_assert["default"].strictEqual(graph.areNeighbors('A', 'B'), false);
|
|
graph.mergeEdgeWithKey('1', 'A', 'B');
|
|
graph.mergeEdgeWithKey('2', 'A', 'B');
|
|
graph.mergeEdgeWithKey('3', 'A', 'B');
|
|
graph.mergeEdgeWithKey('4', 'A', 'B');
|
|
_assert["default"].strictEqual(graph.size, 4);
|
|
_assert["default"].strictEqual(graph.areNeighbors('A', 'B'), true);
|
|
graph.dropEdge('2');
|
|
graph.dropEdge('3');
|
|
_assert["default"].strictEqual(graph.size, 2);
|
|
_assert["default"].strictEqual(graph.areNeighbors('A', 'B'), true);
|
|
graph.dropEdge('4');
|
|
graph.dropEdge('1');
|
|
_assert["default"].strictEqual(graph.size, 0);
|
|
_assert["default"].strictEqual(graph.areNeighbors('A', 'B'), false);
|
|
}
|
|
},
|
|
'Key coercion': {
|
|
'keys should be correctly coerced to strings.': function keys_should_be_correctly_coerced_to_strings() {
|
|
var graph = new Graph();
|
|
graph.addNode(1);
|
|
graph.addNode('2');
|
|
_assert["default"].strictEqual(graph.hasNode(1), true);
|
|
_assert["default"].strictEqual(graph.hasNode('1'), true);
|
|
_assert["default"].strictEqual(graph.hasNode(2), true);
|
|
_assert["default"].strictEqual(graph.hasNode('2'), true);
|
|
graph.addEdgeWithKey(3, 1, 2);
|
|
_assert["default"].strictEqual(graph.hasEdge(3), true);
|
|
_assert["default"].strictEqual(graph.hasEdge('3'), true);
|
|
}
|
|
}
|
|
};
|
|
} |