@naverpay/hidash
Version:
improved lodash
25 lines (24 loc) • 459 B
JavaScript
function f(t) {
if (!t || t.length === 0)
return [];
const i = t.length;
let l = 0;
for (let n = 0; n < i; n++) {
const e = t[n];
e && e.length > l && (l = e.length);
}
const o = new Array(l);
for (let n = 0; n < l; n++)
o[n] = new Array(i);
for (let n = 0; n < i; n++) {
const e = t[n];
if (e)
for (let r = 0; r < e.length; r++)
o[r][n] = e[r];
}
return o;
}
export {
f as default,
f as unzip
};