PATH:
usr
/
local
/
lib
/
node_modules
/
bower
/
lib
/
node_modules
/
mout
/
array
/** * Array reduceRight */ function reduceRight(arr, fn, initVal) { // check for args.length since initVal might be "undefined" see #gh-57 var hasInit = arguments.length > 2; if (arr == null || !arr.length) { if (hasInit) { return initVal; } else { throw new Error('reduce of empty array with no initial value'); } } var i = arr.length, result = initVal, value; while (--i >= 0) { // we iterate over sparse items since there is no way to make it // work properly on IE 7-8. see #64 value = arr[i]; if (!hasInit) { result = value; hasInit = true; } else { result = fn(result, value, i, arr); } } return result; } module.exports = reduceRight;
[-] compact.js
[edit]
[-] find.js
[edit]
[-] equals.js
[edit]
[-] union.js
[edit]
[-] intersection.js
[edit]
[-] shuffle.js
[edit]
[-] reduce.js
[edit]
[-] max.js
[edit]
[+]
..
[-] collect.js
[edit]
[-] unique.js
[edit]
[-] combine.js
[edit]
[-] split.js
[edit]
[-] contains.js
[edit]
[-] forEach.js
[edit]
[-] some.js
[edit]
[-] pluck.js
[edit]
[-] insert.js
[edit]
[-] flatten.js
[edit]
[-] lastIndexOf.js
[edit]
[-] findLastIndex.js
[edit]
[-] take.js
[edit]
[-] append.js
[edit]
[-] removeAll.js
[edit]
[-] reduceRight.js
[edit]
[-] pick.js
[edit]
[-] min.js
[edit]
[-] groupBy.js
[edit]
[-] zip.js
[edit]
[-] toLookup.js
[edit]
[-] indexOf.js
[edit]
[-] findLast.js
[edit]
[-] slice.js
[edit]
[-] reject.js
[edit]
[-] range.js
[edit]
[-] remove.js
[edit]
[-] sortBy.js
[edit]
[-] last.js
[edit]
[-] sort.js
[edit]
[-] map.js
[edit]
[-] findIndex.js
[edit]
[-] reverse.js
[edit]
[-] join.js
[edit]
[-] filter.js
[edit]
[-] every.js
[edit]
[-] invoke.js
[edit]
[-] difference.js
[edit]
[-] xor.js
[edit]