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 | 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 isCollection = require( '@stdlib/assert/is-collection' );
var isFunction = require( '@stdlib/assert/is-function' );
var format = require( '@stdlib/string/format' );
// MAIN //
/**
* Until a test condition is true, invokes a function once for each element in a collection, iterating from right to left.
*
* ## Notes
*
* - For dynamic array resizing, the only behavior made intentionally consistent with `doUntilEach` (iterating from left to right) is when elements are pushed onto the beginning (end) of an array. In other words, for `doUntilEach()`, `[].push()` behavior is consistent with `doUntilEachRight()` `[].unshift()` behavior.
* - The condition is evaluated **after** executing the function to invoke; thus, the provided function **always** executes at least once.
* - If provided an empty collection, the function invokes the provided function with the collection index set to `undefined`.
*
* @param {Collection} collection - input collection
* @param {Function} fcn - function to invoke
* @param {Function} predicate - function which indicates whether to stop iterating over a collection
* @param {*} [thisArg] - execution context for the applied function
* @throws {TypeError} first argument must be a collection
* @throws {TypeError} second argument must be a function
* @throws {TypeError} third argument must be a function
* @returns {Collection} input collection
*
* @example
* function predicate( v, index, collection ) {
* return ( v !== v );
* }
*
* function log( v, index, collection ) {
* console.log( '%s: %d', index, v );
* }
*
* var arr = [ 1, NaN, 2, 3, 4, 5 ];
*
* doUntilEachRight( arr, log, predicate );
*/
function doUntilEachRight( collection, fcn, predicate, thisArg ) {
var len;
var i;
if ( !isCollection( collection ) ) {
throw new TypeError( format( 'invalid argument. First argument must be a collection. Value: `%s`.', collection ) );
}
if ( !isFunction( fcn ) ) {
throw new TypeError( format( 'invalid argument. Second argument must be a function. Value: `%s`.', fcn ) );
}
if ( !isFunction( predicate ) ) {
throw new TypeError( format( 'invalid argument. Third argument must be a function. Value: `%s`.', predicate ) );
}
len = collection.length;
if ( len === 0 ) {
fcn.call( thisArg, void 0, void 0, collection );
len = collection.length;
if ( len === 0 ) {
return collection;
}
}
i = len - 1;
do {
fcn.call( thisArg, collection[ i ], i, collection );
// Account for dynamically resizing a collection...
if ( len !== collection.length ) {
i += ( collection.length - len );
len = collection.length;
}
i -= 1;
} while (
i >= 0 &&
!predicate( collection[ i+1 ], i+1, collection )
);
return collection;
}
// EXPORTS //
module.exports = doUntilEachRight;
|