lilit
Version:
[![Build status][tr-svg]][travis]
101 lines • 2.79 kB
JavaScript
export function iterator(xs) {
const it = xs[Symbol.iterator]();
if (!it[Symbol.iterator])
it[Symbol.iterator] = () => it;
return it;
}
export function asyncIterator(xs) {
const it = xs[Symbol.asyncIterator]();
if (!it[Symbol.asyncIterator])
it[Symbol.asyncIterator] = () => it;
return it;
}
export function forAwaitableIterator(xs) {
return xs[Symbol.asyncIterator] ? asyncIterator(xs) : iterator(xs);
}
export function isIterator(xs) {
return xs && xs[Symbol.iterator] && xs[Symbol.iterator]() === xs;
}
export function isAsyncIterator(xs) {
return xs && xs[Symbol.asyncIterator] && xs[Symbol.asyncIterator]() === xs;
}
export function isForOfAwaitableIterator(xs) {
return isAsyncIterator(xs) || isIterator(xs);
}
// https://stackoverflow.com/a/46416353/870615
export function tee(it) {
// If `it` is not an iterator, i.e. can be traversed more than once,
// we just return it unmodified.
if (!isIterator(it))
return [it, it];
const source = it;
const buffers = [[], []];
const DONE = Symbol('done');
const next = (i) => {
if (buffers[i].length)
return buffers[i].shift();
const x = source.next();
if (x.done)
return DONE;
buffers[1 - i].push(x.value);
return x.value;
};
function* buffer2Iterable(i) {
while (true) {
const x = next(i);
if (x === DONE)
break;
yield x;
}
}
return [buffer2Iterable(0), buffer2Iterable(1)];
}
export function asyncTee(it) {
if (!isForOfAwaitableIterator(it))
return [it, it];
const source = it;
const buffers = [[], []];
const DONE = Symbol('done');
const next = async (i) => {
if (buffers[i].length)
return buffers[i].shift();
const x = await source.next();
if (x.done)
return DONE;
buffers[1 - i].push(x.value);
return x.value;
};
async function* buffer2AsyncIterable(i) {
while (true) {
const x = await next(i);
if (x === DONE)
break;
yield x;
}
}
return [buffer2AsyncIterable(0), buffer2AsyncIterable(1)];
}
// TODO: more performant impl?
export function teeN(it, n = 2) {
const res = [];
let orig = it;
let copy;
for (let i = 0; i < n - 1; i++) {
[orig, copy] = tee(orig);
res.push(copy);
}
res.push(orig);
return res;
}
export function asyncTeeN(it, n = 2) {
const res = [];
let orig = it;
let copy;
for (let i = 0; i < n - 1; i++) {
[orig, copy] = asyncTee(orig);
res.push(copy);
}
res.push(orig);
return res;
}
//# sourceMappingURL=common.js.map