@@ -96,24 +96,24 @@ function reduceAccessor(f) {
96
96
strict
97
97
? {
98
98
mapIndex ( I , S , T ) {
99
- const s = ( i ) => ( S [ i ] == null ? NaN : + S [ i ] ) ;
99
+ const v = ( i ) => ( S [ i ] == null ? NaN : + S [ i ] ) ;
100
100
let nans = 0 ;
101
- for ( let i = 0 ; i < k - 1 ; ++ i ) if ( isNaN ( s ( i ) ) ) ++ nans ;
101
+ for ( let i = 0 ; i < k - 1 ; ++ i ) if ( isNaN ( v ( i ) ) ) ++ nans ;
102
102
for ( let i = 0 , n = I . length - k + 1 ; i < n ; ++ i ) {
103
- if ( isNaN ( s ( i + k - 1 ) ) ) ++ nans ;
104
- T [ I [ i + s ] ] = nans === 0 ? f ( slice ( I , i , i + k ) , s ) : NaN ;
105
- if ( isNaN ( s ( i ) ) ) -- nans ;
103
+ if ( isNaN ( v ( i + k - 1 ) ) ) ++ nans ;
104
+ T [ I [ i + s ] ] = nans === 0 ? f ( slice ( I , i , i + k ) , v ) : NaN ;
105
+ if ( isNaN ( v ( i ) ) ) -- nans ;
106
106
}
107
107
}
108
108
}
109
109
: {
110
110
mapIndex ( I , S , T ) {
111
- const s = ( i ) => ( S [ i ] == null ? NaN : + S [ i ] ) ;
111
+ const v = ( i ) => ( S [ i ] == null ? NaN : + S [ i ] ) ;
112
112
for ( let i = - s ; i < 0 ; ++ i ) {
113
- T [ I [ i + s ] ] = f ( slice ( I , 0 , i + k ) , s ) ;
113
+ T [ I [ i + s ] ] = f ( slice ( I , 0 , i + k ) , v ) ;
114
114
}
115
115
for ( let i = 0 , n = I . length - s ; i < n ; ++ i ) {
116
- T [ I [ i + s ] ] = f ( slice ( I , i , i + k ) , s ) ;
116
+ T [ I [ i + s ] ] = f ( slice ( I , i , i + k ) , v ) ;
117
117
}
118
118
}
119
119
} ;
0 commit comments