@@ -7,11 +7,9 @@ for (let i = 0; i < 100; i++) {
77 data . push ( Math . floor ( 100 * Math . random ( ) ) ) ;
88}
99
10- const sorted = data . slice ( ) . sort ( function ( a , b ) {
11- return a - b ;
12- } ) ;
10+ const sorted = data . slice ( ) . sort ( ( a , b ) => a - b ) ;
1311
14- test ( 'maintains a priority queue' , function ( t ) {
12+ test ( 'maintains a priority queue' , ( t ) => {
1513 const queue = new TinyQueue ( ) ;
1614 for ( let i = 0 ; i < data . length ; i ++ ) queue . push ( data [ i ] ) ;
1715
@@ -25,7 +23,7 @@ test('maintains a priority queue', function (t) {
2523 t . end ( ) ;
2624} ) ;
2725
28- test ( 'accepts data in constructor' , function ( t ) {
26+ test ( 'accepts data in constructor' , ( t ) => {
2927 const queue = new TinyQueue ( data . slice ( ) ) ;
3028
3129 const result = [ ] ;
@@ -36,7 +34,7 @@ test('accepts data in constructor', function (t) {
3634 t . end ( ) ;
3735} ) ;
3836
39- test ( 'handles edge cases with few elements' , function ( t ) {
37+ test ( 'handles edge cases with few elements' , ( t ) => {
4038 const queue = new TinyQueue ( ) ;
4139
4240 queue . push ( 2 ) ;
@@ -53,7 +51,7 @@ test('handles edge cases with few elements', function (t) {
5351 t . end ( ) ;
5452} ) ;
5553
56- test ( 'handles init with empty array' , function ( t ) {
54+ test ( 'handles init with empty array' , ( t ) => {
5755 const queue = new TinyQueue ( [ ] ) ;
5856
5957 t . same ( queue . data , [ ] ) ;
0 commit comments