jsm-utilities
Version:
A utilities library.
39 lines (38 loc) • 1.84 kB
JavaScript
;
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.applyOnChunkedArray = exports.chunkArray = exports.combineArrays = void 0;
const combineArrays = ([head, ...[headTail, ...tailTail]], separator = " ") => {
console.log("combineArrays", { head, headTail, tailTail });
if (!headTail)
return head;
const combined = headTail.reduce((acc, x) => {
return acc.concat(head.map((h) => `${h}${separator}${x}`));
}, []);
return (0, exports.combineArrays)([combined, ...tailTail], separator);
};
exports.combineArrays = combineArrays;
const chunkArray = (arr, chunkSize) => {
const chunks = [];
for (let i = 0; i < arr.length; i += chunkSize) {
chunks.push(arr.slice(i, i + chunkSize));
}
return chunks;
};
exports.chunkArray = chunkArray;
const applyOnChunkedArray = (arr, chunkSize, callback) => __awaiter(void 0, void 0, void 0, function* () {
arr = arr || [];
const chunks = (0, exports.chunkArray)(arr, chunkSize);
for (let i = 0; i < chunks.length; i += 1) {
yield callback(chunks[i], i);
}
});
exports.applyOnChunkedArray = applyOnChunkedArray;