Name no node in restic's and mosquitto's fixtures (issue 1838)

modules/mosquitto/test/topics.test.ts

@@ -9,7 +9,7 @@ import assert from "node:assert/strict";
 import { filterProblem, missingAcls, parseRoleAcls, staleAcls, topicFilters, wantedAcls } from "../topics.ts";
 
 test("a consumer that contributed nothing gets its own subtree", () => {
-  assert.deepEqual(topicFilters({}, "mesh_ace_hass"), { ok: true, filters: ["mesh_ace_hass/#"], own: true });
+  assert.deepEqual(topicFilters({}, "mesh_node_a_hass"), { ok: true, filters: ["mesh_node_a_hass/#"], own: true });
   assert.deepEqual(topicFilters(undefined, "x"), { ok: true, filters: ["x/#"], own: true });
   // Settings merge into every contribution: keys that are not `topics` change nothing.
   assert.deepEqual(topicFilters({ endpoints: { web: {} } }, "x"), { ok: true, filters: ["x/#"], own: true });

modules/restic/cmd/restic-backups/hand_test.go

@@ -212,7 +212,7 @@ func TestWithTheRealResticAHandTakenBackupOutlivesTheNightTheSameDay(t *testing.
 	must(t, os.Mkdir(data, 0o700))
 	must(t, os.WriteFile(filepath.Join(data, "library"), []byte("before the migration\n"), 0o600))
 	where := placed(t, "# plex\npath "+data+"\n")
-	// A machine whose counts are full, as ace's plex was: restic keeps the oldest restore point of a period not
+	// A machine whose counts are full, as node-a's plex was: restic keeps the oldest restore point of a period not
 	// yet filled, which would hide the issue on a fresh repository.
 	conf, err := os.ReadFile(filepath.Join(where.State, RetentionFile))
 	must(t, err)