@@ -286,7 +286,6 @@ const PQlt = PriorityQueue(u32, void, lessThan);
286286const PQgt = PriorityQueue (u32 , void , greaterThan );
287287
288288test "std.PriorityQueue: add and remove min heap" {
289- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
290289 var queue = PQlt .init (testing .allocator , {});
291290 defer queue .deinit ();
292291
@@ -305,7 +304,6 @@ test "std.PriorityQueue: add and remove min heap" {
305304}
306305
307306test "std.PriorityQueue: add and remove same min heap" {
308- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
309307 var queue = PQlt .init (testing .allocator , {});
310308 defer queue .deinit ();
311309
@@ -355,7 +353,6 @@ test "std.PriorityQueue: peek" {
355353}
356354
357355test "std.PriorityQueue: sift up with odd indices" {
358- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
359356 var queue = PQlt .init (testing .allocator , {});
360357 defer queue .deinit ();
361358 const items = [_ ]u32 { 15 , 7 , 21 , 14 , 13 , 22 , 12 , 6 , 7 , 25 , 5 , 24 , 11 , 16 , 15 , 24 , 2 , 1 };
@@ -370,7 +367,6 @@ test "std.PriorityQueue: sift up with odd indices" {
370367}
371368
372369test "std.PriorityQueue: addSlice" {
373- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
374370 var queue = PQlt .init (testing .allocator , {});
375371 defer queue .deinit ();
376372 const items = [_ ]u32 { 15 , 7 , 21 , 14 , 13 , 22 , 12 , 6 , 7 , 25 , 5 , 24 , 11 , 16 , 15 , 24 , 2 , 1 };
@@ -403,7 +399,6 @@ test "std.PriorityQueue: fromOwnedSlice trivial case 1" {
403399}
404400
405401test "std.PriorityQueue: fromOwnedSlice" {
406- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ;
407402 const items = [_ ]u32 { 15 , 7 , 21 , 14 , 13 , 22 , 12 , 6 , 7 , 25 , 5 , 24 , 11 , 16 , 15 , 24 , 2 , 1 };
408403 const heap_items = try testing .allocator .dupe (u32 , items [0.. ]);
409404 var queue = PQlt .fromOwnedSlice (testing .allocator , heap_items [0.. ], {});
@@ -416,7 +411,6 @@ test "std.PriorityQueue: fromOwnedSlice" {
416411}
417412
418413test "std.PriorityQueue: add and remove max heap" {
419- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
420414 var queue = PQgt .init (testing .allocator , {});
421415 defer queue .deinit ();
422416
@@ -435,7 +429,6 @@ test "std.PriorityQueue: add and remove max heap" {
435429}
436430
437431test "std.PriorityQueue: add and remove same max heap" {
438- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
439432 var queue = PQgt .init (testing .allocator , {});
440433 defer queue .deinit ();
441434
@@ -476,7 +469,6 @@ test "std.PriorityQueue: iterator" {
476469}
477470
478471test "std.PriorityQueue: remove at index" {
479- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
480472 var queue = PQlt .init (testing .allocator , {});
481473 defer queue .deinit ();
482474
@@ -512,7 +504,6 @@ test "std.PriorityQueue: iterator while empty" {
512504}
513505
514506test "std.PriorityQueue: shrinkAndFree" {
515- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
516507 var queue = PQlt .init (testing .allocator , {});
517508 defer queue .deinit ();
518509
@@ -536,7 +527,6 @@ test "std.PriorityQueue: shrinkAndFree" {
536527}
537528
538529test "std.PriorityQueue: update min heap" {
539- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
540530 var queue = PQlt .init (testing .allocator , {});
541531 defer queue .deinit ();
542532
@@ -552,7 +542,6 @@ test "std.PriorityQueue: update min heap" {
552542}
553543
554544test "std.PriorityQueue: update same min heap" {
555- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
556545 var queue = PQlt .init (testing .allocator , {});
557546 defer queue .deinit ();
558547
@@ -569,7 +558,6 @@ test "std.PriorityQueue: update same min heap" {
569558}
570559
571560test "std.PriorityQueue: update max heap" {
572- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
573561 var queue = PQgt .init (testing .allocator , {});
574562 defer queue .deinit ();
575563
@@ -585,7 +573,6 @@ test "std.PriorityQueue: update max heap" {
585573}
586574
587575test "std.PriorityQueue: update same max heap" {
588- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
589576 var queue = PQgt .init (testing .allocator , {});
590577 defer queue .deinit ();
591578
@@ -602,7 +589,6 @@ test "std.PriorityQueue: update same max heap" {
602589}
603590
604591test "std.PriorityQueue: siftUp in remove" {
605- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
606592 var queue = PQlt .init (testing .allocator , {});
607593 defer queue .deinit ();
608594
@@ -623,7 +609,6 @@ fn contextLessThan(context: []const u32, a: usize, b: usize) Order {
623609const CPQlt = PriorityQueue (usize , []const u32 , contextLessThan );
624610
625611test "std.PriorityQueue: add and remove min heap with contextful comparator" {
626- if (@import ("builtin" ).zig_backend != .stage1 ) return error .SkipZigTest ; // TODO
627612 const context = [_ ]u32 { 5 , 3 , 4 , 2 , 2 , 8 , 0 };
628613
629614 var queue = CPQlt .init (testing .allocator , context [0.. ]);
0 commit comments