es-toolkit/dist/compat/array/reduceRight.mjs

A state-of-the-art, high-performance JavaScript utility library with a small bundle size and strong type annotations.

import { identity } from "../../function/identity.mjs";
import { range } from "../../math/range.mjs";
import { isArrayLike } from "../predicate/isArrayLike.mjs";
//#region src/compat/array/reduceRight.ts
/**
* Reduces a collection to a single value using an iteratee function, starting from the right.
*
* @param collection - The collection to iterate over.
* @param iteratee - The function invoked per iteration or the key to reduce over.
* @param initialValue - The initial value.
* @returns Returns the accumulated value.
*
* @example
* // Using a reducer function
* const array = [1, 2, 3];
* reduceRight(array, (acc, value) => acc + value, 0); // => 6
*
* @example
* // Using a reducer function with initialValue
* const array = [1, 2, 3];
* reduceRight(array, (acc, value) => acc + value % 2 === 0, true); // => false
*
* @example
* // Using an object as the collection
* const obj = { a: 1, b: 2, c: 3 };
* reduceRight(obj, (acc, value) => acc + value, 0); // => 6
*/
function reduceRight(collection, iteratee = identity, accumulator) {
	const hasAccumulator = arguments.length >= 3;
	if (!collection) return accumulator;
	let keys;
	let startIndex;
	if (isArrayLike(collection)) {
		keys = range(0, collection.length).reverse();
		if (!hasAccumulator && collection.length > 0) {
			accumulator = collection[collection.length - 1];
			startIndex = 1;
		} else startIndex = 0;
	} else {
		keys = Object.keys(collection).reverse();
		if (!hasAccumulator && keys.length > 0) {
			accumulator = collection[keys[0]];
			startIndex = 1;
		} else startIndex = 0;
	}
	for (let i = startIndex; i < keys.length; i++) {
		const key = keys[i];
		const value = collection[key];
		accumulator = iteratee(accumulator, value, key, collection);
	}
	return accumulator;
}
//#endregion
export { reduceRight };