Remove redundant test name prefixes now that test names are fully qualified

Follow up to #19079, which made test names fully qualified.

This fixes tests that now-redundant information in their test names. For example here's a fully qualified test name before the changes in this commit:

"priority_queue.test.std.PriorityQueue: shrinkAndFree"

and the same test's name after the changes in this commit:

"priority_queue.test.shrinkAndFree"

lib/std/priority_dequeue.zig

@@ -467,7 +467,7 @@ fn lessThanComparison(context: void, a: u32, b: u32) Order {
 
 const PDQ = PriorityDequeue(u32, void, lessThanComparison);
 
-test "std.PriorityDequeue: add and remove min" {
+test "add and remove min" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -486,7 +486,7 @@ test "std.PriorityDequeue: add and remove min" {
     try expectEqual(@as(u32, 54), queue.removeMin());
 }
 
-test "std.PriorityDequeue: add and remove min structs" {
+test "add and remove min structs" {
     const S = struct {
         size: u32,
     };
@@ -513,7 +513,7 @@ test "std.PriorityDequeue: add and remove min structs" {
     try expectEqual(@as(u32, 54), queue.removeMin().size);
 }
 
-test "std.PriorityDequeue: add and remove max" {
+test "add and remove max" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -532,7 +532,7 @@ test "std.PriorityDequeue: add and remove max" {
     try expectEqual(@as(u32, 7), queue.removeMax());
 }
 
-test "std.PriorityDequeue: add and remove same min" {
+test "add and remove same min" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -551,7 +551,7 @@ test "std.PriorityDequeue: add and remove same min" {
     try expectEqual(@as(u32, 2), queue.removeMin());
 }
 
-test "std.PriorityDequeue: add and remove same max" {
+test "add and remove same max" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -570,7 +570,7 @@ test "std.PriorityDequeue: add and remove same max" {
     try expectEqual(@as(u32, 1), queue.removeMax());
 }
 
-test "std.PriorityDequeue: removeOrNull empty" {
+test "removeOrNull empty" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -578,7 +578,7 @@ test "std.PriorityDequeue: removeOrNull empty" {
     try expect(queue.removeMaxOrNull() == null);
 }
 
-test "std.PriorityDequeue: edge case 3 elements" {
+test "edge case 3 elements" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -591,7 +591,7 @@ test "std.PriorityDequeue: edge case 3 elements" {
     try expectEqual(@as(u32, 9), queue.removeMin());
 }
 
-test "std.PriorityDequeue: edge case 3 elements max" {
+test "edge case 3 elements max" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -604,7 +604,7 @@ test "std.PriorityDequeue: edge case 3 elements max" {
     try expectEqual(@as(u32, 2), queue.removeMax());
 }
 
-test "std.PriorityDequeue: peekMin" {
+test "peekMin" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -618,7 +618,7 @@ test "std.PriorityDequeue: peekMin" {
     try expect(queue.peekMin().? == 2);
 }
 
-test "std.PriorityDequeue: peekMax" {
+test "peekMax" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -632,7 +632,7 @@ test "std.PriorityDequeue: peekMax" {
     try expect(queue.peekMax().? == 9);
 }
 
-test "std.PriorityDequeue: sift up with odd indices, removeMin" {
+test "sift up with odd indices, removeMin" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
     const items = [_]u32{ 15, 7, 21, 14, 13, 22, 12, 6, 7, 25, 5, 24, 11, 16, 15, 24, 2, 1 };
@@ -646,7 +646,7 @@ test "std.PriorityDequeue: sift up with odd indices, removeMin" {
     }
 }
 
-test "std.PriorityDequeue: sift up with odd indices, removeMax" {
+test "sift up with odd indices, removeMax" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
     const items = [_]u32{ 15, 7, 21, 14, 13, 22, 12, 6, 7, 25, 5, 24, 11, 16, 15, 24, 2, 1 };
@@ -660,7 +660,7 @@ test "std.PriorityDequeue: sift up with odd indices, removeMax" {
     }
 }
 
-test "std.PriorityDequeue: addSlice min" {
+test "addSlice min" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
     const items = [_]u32{ 15, 7, 21, 14, 13, 22, 12, 6, 7, 25, 5, 24, 11, 16, 15, 24, 2, 1 };
@@ -672,7 +672,7 @@ test "std.PriorityDequeue: addSlice min" {
     }
 }
 
-test "std.PriorityDequeue: addSlice max" {
+test "addSlice max" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
     const items = [_]u32{ 15, 7, 21, 14, 13, 22, 12, 6, 7, 25, 5, 24, 11, 16, 15, 24, 2, 1 };
@@ -684,7 +684,7 @@ test "std.PriorityDequeue: addSlice max" {
     }
 }
 
-test "std.PriorityDequeue: fromOwnedSlice trivial case 0" {
+test "fromOwnedSlice trivial case 0" {
     const items = [0]u32{};
     const queue_items = try testing.allocator.dupe(u32, &items);
     var queue = PDQ.fromOwnedSlice(testing.allocator, queue_items[0..], {});
@@ -693,7 +693,7 @@ test "std.PriorityDequeue: fromOwnedSlice trivial case 0" {
     try expect(queue.removeMinOrNull() == null);
 }
 
-test "std.PriorityDequeue: fromOwnedSlice trivial case 1" {
+test "fromOwnedSlice trivial case 1" {
     const items = [1]u32{1};
     const queue_items = try testing.allocator.dupe(u32, &items);
     var queue = PDQ.fromOwnedSlice(testing.allocator, queue_items[0..], {});
@@ -704,7 +704,7 @@ test "std.PriorityDequeue: fromOwnedSlice trivial case 1" {
     try expect(queue.removeMinOrNull() == null);
 }
 
-test "std.PriorityDequeue: fromOwnedSlice" {
+test "fromOwnedSlice" {
     const items = [_]u32{ 15, 7, 21, 14, 13, 22, 12, 6, 7, 25, 5, 24, 11, 16, 15, 24, 2, 1 };
     const queue_items = try testing.allocator.dupe(u32, items[0..]);
     var queue = PDQ.fromOwnedSlice(testing.allocator, queue_items[0..], {});
@@ -716,7 +716,7 @@ test "std.PriorityDequeue: fromOwnedSlice" {
     }
 }
 
-test "std.PriorityDequeue: update min queue" {
+test "update min queue" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -731,7 +731,7 @@ test "std.PriorityDequeue: update min queue" {
     try expectEqual(@as(u32, 5), queue.removeMin());
 }
 
-test "std.PriorityDequeue: update same min queue" {
+test "update same min queue" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -747,7 +747,7 @@ test "std.PriorityDequeue: update same min queue" {
     try expectEqual(@as(u32, 5), queue.removeMin());
 }
 
-test "std.PriorityDequeue: update max queue" {
+test "update max queue" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -763,7 +763,7 @@ test "std.PriorityDequeue: update max queue" {
     try expectEqual(@as(u32, 1), queue.removeMax());
 }
 
-test "std.PriorityDequeue: update same max queue" {
+test "update same max queue" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -779,7 +779,7 @@ test "std.PriorityDequeue: update same max queue" {
     try expectEqual(@as(u32, 1), queue.removeMax());
 }
 
-test "std.PriorityDequeue: update after remove" {
+test "update after remove" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -788,7 +788,7 @@ test "std.PriorityDequeue: update after remove" {
     try expectError(error.ElementNotFound, queue.update(1, 1));
 }
 
-test "std.PriorityDequeue: iterator" {
+test "iterator" {
     var queue = PDQ.init(testing.allocator, {});
     var map = std.AutoHashMap(u32, void).init(testing.allocator);
     defer {
@@ -810,7 +810,7 @@ test "std.PriorityDequeue: iterator" {
     try expectEqual(@as(usize, 0), map.count());
 }
 
-test "std.PriorityDequeue: remove at index" {
+test "remove at index" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -833,7 +833,7 @@ test "std.PriorityDequeue: remove at index" {
     try expectEqual(queue.removeMinOrNull(), null);
 }
 
-test "std.PriorityDequeue: iterator while empty" {
+test "iterator while empty" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -842,7 +842,7 @@ test "std.PriorityDequeue: iterator while empty" {
     try expectEqual(it.next(), null);
 }
 
-test "std.PriorityDequeue: shrinkAndFree" {
+test "shrinkAndFree" {
     var queue = PDQ.init(testing.allocator, {});
     defer queue.deinit();
 
@@ -865,7 +865,7 @@ test "std.PriorityDequeue: shrinkAndFree" {
     try expect(queue.removeMaxOrNull() == null);
 }
 
-test "std.PriorityDequeue: fuzz testing min" {
+test "fuzz testing min" {
     var prng = std.Random.DefaultPrng.init(0x12345678);
     const random = prng.random();
 
@@ -894,7 +894,7 @@ fn fuzzTestMin(rng: std.Random, comptime queue_size: usize) !void {
     }
 }
 
-test "std.PriorityDequeue: fuzz testing max" {
+test "fuzz testing max" {
     var prng = std.Random.DefaultPrng.init(0x87654321);
     const random = prng.random();
 
@@ -923,7 +923,7 @@ fn fuzzTestMax(rng: std.Random, queue_size: usize) !void {
     }
 }
 
-test "std.PriorityDequeue: fuzz testing min and max" {
+test "fuzz testing min and max" {
     var prng = std.Random.DefaultPrng.init(0x87654321);
     const random = prng.random();
 
@@ -982,7 +982,7 @@ fn contextLessThanComparison(context: []const u32, a: usize, b: usize) Order {
 
 const CPDQ = PriorityDequeue(usize, []const u32, contextLessThanComparison);
 
-test "std.PriorityDequeue: add and remove" {
+test "add and remove" {
     const context = [_]u32{ 5, 3, 4, 2, 2, 8, 0 };
 
     var queue = CPDQ.init(testing.allocator, context[0..]);
@@ -1006,7 +1006,7 @@ test "std.PriorityDequeue: add and remove" {
 
 var all_cmps_unique = true;
 
-test "std.PriorityDeque: don't compare a value to a copy of itself" {
+test "don't compare a value to a copy of itself" {
     var depq = PriorityDequeue(u32, void, struct {
         fn uniqueLessThan(_: void, a: u32, b: u32) Order {
             all_cmps_unique = all_cmps_unique and (a != b);