@@ -3047,22 +3047,18 @@ class TFile {
30473047 #checkNeedReorder( place ) {
30483048 let res = false , resort = false ;
30493049 for ( let n = 0 ; n < place . length - 2 ; n += 2 ) {
3050- if ( place [ n ] > place [ n + 2 ] ) {
3050+ if ( place [ n ] > place [ n + 2 ] )
30513051 res = resort = true ;
3052- }
3053- if ( place [ n ] + place [ n + 1 ] > place [ n + 2 ] - kMinimalHttpGap ) {
3052+ if ( place [ n ] + place [ n + 1 ] > place [ n + 2 ] - kMinimalHttpGap )
30543053 res = true ;
3055- }
30563054 }
30573055 if ( ! res ) {
30583056 return {
30593057 place,
30603058 blobs : [ ] ,
3061- expectedSize : function ( indx ) {
3062- return this . place [ indx + 1 ] ;
3063- } ,
3064- addBuffer : function ( indx , buf , o ) {
3065- this . blobs [ indx / 2 ] = new DataView ( buf , o , this . place [ indx + 1 ] ) ;
3059+ expectedSize ( indx ) { return this . place [ indx + 1 ] ; } ,
3060+ addBuffer ( indx , buf , o ) {
3061+ this . blobs [ indx / 2 ] = new DataView ( buf , o , this . place [ indx + 1 ] ) ;
30663062 }
30673063 } ;
30683064 }
@@ -3075,7 +3071,7 @@ class TFile {
30753071 if ( resort )
30763072 res . reorder . sort ( ( a , b ) => { return a . pos - b . pos ; } ) ;
30773073
3078- for ( let n = 0 ; n < res . reorder . length - 1 ; n ++ ) {
3074+ for ( let n = 0 ; n < res . reorder . length - 1 ; n ++ ) {
30793075 const curr = res . reorder [ n ] ,
30803076 next = res . reorder [ n + 1 ] ;
30813077 if ( curr . pos + curr . len + kMinimalHttpGap > next . pos ) {
@@ -3096,7 +3092,7 @@ class TFile {
30963092 const elem = this . reorder [ indx / 2 ] ,
30973093 pos0 = elem . pos ;
30983094 elem . indx . forEach ( indx0 => {
3099- this . blobs [ indx0 / 2 ] = new DataView ( buf , o + this . place [ indx0 ] - pos0 , this . place [ indx0 + 1 ] ) ;
3095+ this . blobs [ indx0 / 2 ] = new DataView ( buf , o + this . place [ indx0 ] - pos0 , this . place [ indx0 + 1 ] ) ;
31003096 } ) ;
31013097 } ;
31023098
0 commit comments