Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 | 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x 1x | /**
* @license Apache-2.0
*
* Copyright (c) 2018 The Stdlib Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
'use strict';
// MODULES //
var isPositiveInteger = require( '@stdlib/assert/is-positive-integer' ).isPrimitive;
var isArrayLike = require( '@stdlib/assert/is-array-like-object' );
var isPositiveZero = require( '@stdlib/math/base/assert/is-positive-zero' );
var isNegativeZero = require( '@stdlib/math/base/assert/is-negative-zero' );
var isnan = require( '@stdlib/math/base/assert/is-nan' );
var PINF = require( '@stdlib/constants/float64/pinf' );
var NINF = require( '@stdlib/constants/float64/ninf' );
var Float64Array = require( '@stdlib/array/float64' );
var format = require( '@stdlib/string/format' );
// MAIN //
/**
* Returns an accumulator function which incrementally computes moving minimum and maximum values.
*
* @param {Collection} [out] - output array
* @param {PositiveInteger} window - window size
* @throws {TypeError} output argument must be array-like
* @throws {TypeError} window size must be a positive integer
* @returns {Function} accumulator function
*
* @example
* var accumulator = incrmminmax( 3 );
*
* var mm = accumulator();
* // returns null
*
* mm = accumulator( 2.0 );
* // returns [ 2.0, 2.0 ]
*
* mm = accumulator( -5.0 );
* // returns [ -5.0, 2.0 ]
*
* mm = accumulator( 3.0 );
* // returns [ -5.0, 3.0 ]
*
* mm = accumulator( 5.0 );
* // returns [ -5.0, 5.0 ]
*
* mm = accumulator();
* // returns [ -5.0, 5.0 ]
*/
function incrmminmax( out, window ) {
var minmax;
var buf;
var min;
var max;
var W;
var N;
var i;
if ( arguments.length === 1 ) {
minmax = [ 0.0, 0.0 ];
W = out;
} else {
if ( !isArrayLike( out ) ) {
throw new TypeError( format( 'invalid argument. Output argument must be an array-like object. Value: `%s`.', out ) );
}
minmax = out;
W = window;
}
if ( !isPositiveInteger( W ) ) {
throw new TypeError( format( 'invalid argument. Window size must be a positive integer. Value: `%s`.', W ) );
}
buf = new Float64Array( W );
min = PINF;
max = NINF;
i = -1;
N = 0;
return accumulator;
/**
* If provided a value, the accumulator function returns updated minimum and maximum values. If not provided a value, the accumulator function returns the current minimum and maximum values.
*
* @private
* @param {number} [x] - input value
* @returns {(ArrayLikeObject|null)} output array or null
*/
function accumulator( x ) {
var sgn;
var v;
var k;
if ( arguments.length === 0 ) {
if ( N === 0 ) {
return null;
}
return minmax;
}
// Update the index for managing the circular buffer:
i = (i+1) % W;
// Case: incoming value is NaN...
if ( isnan( x ) ) {
N = W; // explicitly set to avoid `N < W` branch
min = x;
max = x;
}
// Case: initial window...
else if ( N < W ) {
N += 1;
if ( x < min || ( x === min && isNegativeZero( x ) ) ) {
min = x;
}
if ( x > max || ( x === max && isPositiveZero( x ) ) ) {
max = x;
}
}
// Case: outgoing value is the current minimum or maximum and the new value is either greater than the minimum or less than the maximum, and, thus, we need to find new accumulated values among the current buffer values...
else if (
( buf[ i ] === min && x > min ) ||
( buf[ i ] === max && x < max ) ||
isnan( buf[ i ] )
) {
min = x;
max = x;
for ( k = 0; k < W; k++ ) {
if ( k !== i ) {
v = buf[ k ];
if ( isnan( v ) ) {
min = v;
max = v;
break; // no need to continue searching
}
if ( v < min || ( v === min && isNegativeZero( v ) ) ) {
min = v;
}
if ( v > max || ( v === max && isPositiveZero( v ) ) ) {
max = v;
}
}
}
}
// Case: incoming value is less than current minimum value...
else if ( x < min ) {
min = x;
}
// Case: incoming value is greater than current maximum value...
else if ( x > max ) {
max = x;
}
// Case: incoming value is zero, which means we need to be careful and correctly handle signed zeros...
else if ( x === 0.0 ) {
sgn = isNegativeZero( x );
if ( x === min ) {
// Case: outgoing value is the current minimum...
if (
buf[ i ] === min &&
isNegativeZero( buf[ i ] ) &&
sgn === false
) {
// Because the outgoing and incoming are different signs (-,+), we need to search the buffer to see if it contains a negative zero. If so, the minimum value remains negative zero; otherwise, the minimum value is incoming value...
min = x;
for ( k = 0; k < W; k++ ) {
if ( k !== i && isNegativeZero( buf[ k ] ) ) {
min = buf[ k ];
break;
}
}
} else if ( sgn ) {
// Ensure minimum value has the correct sign:
min = x;
}
}
if ( x === max ) {
// Case: outgoing value is the current maximum...
if (
buf[ i ] === max &&
isPositiveZero( buf[ i ] ) &&
sgn
) {
// Because the outgoing and incoming are different signs (+,-), we need to search the buffer to see if it contains a positive zero. If so, the maximum value remains positive zero; otherwise, the maximum value is incoming value...
max = x;
for ( k = 0; k < W; k++ ) {
if ( k !== i && isPositiveZero( buf[ k ] ) ) {
max = buf[ k ];
break;
}
}
} else if ( sgn === false ) {
// Ensure maximum value has the correct sign:
max = x;
}
}
}
// Case: updating existing window; however, the minimum and maximum values do not change so nothing to do but update our buffer...
buf[ i ] = x;
minmax[ 0 ] = min;
minmax[ 1 ] = max;
return minmax;
}
}
// EXPORTS //
module.exports = incrmminmax;
|