cafe-utility 23.11.0 → 24.0.0

package/index.d.ts

@@ -449,10 +449,6 @@ declare function pushToBidirectionalMap<K, T>(object: BidirectionalMap<K, T>, ke
 declare function unshiftToBidirectionalMap<K, T>(object: BidirectionalMap<K, T>, key: K, item: T, limit?: number): void;
 declare function addToTemporalBidirectionalMap<K, T>(object: BidirectionalMap<K, TemporalData<T>>, key: K, item: T, expiration: number, limit?: number): void;
 declare function getFromTemporalBidirectionalMap<K, T>(object: BidirectionalMap<K, TemporalData<T>>, key: K): T | null;
-declare function makeAsyncQueue(concurrency?: number): {
-    enqueue(fn: () => Promise<void>): void;
-    drain: () => Promise<void>;
-};
 export declare class Optional<T> {
     value: T | null | undefined;
     private constructor();
@@ -568,6 +564,20 @@ export declare class PubSubChannel<T> {
     private subscribers;
     subscribe(callback: (data: T) => void): () => void;
     publish(data: T): void;
+    clear(): void;
+    getSubscriberCount(): number;
+}
+export declare class AsyncQueue {
+    queue: (() => Promise<void>)[];
+    concurrency: number;
+    capacity: number;
+    running: number;
+    onProcessed: PubSubChannel<void>;
+    onDrained: PubSubChannel<void>;
+    constructor(concurrency: number, capacity: number);
+    private process;
+    enqueue(fn: () => Promise<void>): Promise<void>;
+    drain(): Promise<void>;
 }
 export declare const Binary: {
     hexToUint8Array: typeof hexToUint8Array;
@@ -687,7 +697,6 @@ export declare const Promises: {
     raceFulfilled: typeof raceFulfilled;
     invert: typeof invertPromise;
     runInParallelBatches: typeof runInParallelBatches;
-    makeAsyncQueue: typeof makeAsyncQueue;
 };
 export declare const Dates: {
     getTimestamp: typeof getTimestamp;

package/index.js

@@ -13,6 +13,7 @@ Object.defineProperty(exports, '__esModule', { value: !0 }),
         exports.Arrays =
         exports.Random =
         exports.Binary =
+        exports.AsyncQueue =
         exports.PubSubChannel =
         exports.AsyncLazy =
         exports.Lazy =
@@ -145,13 +146,13 @@ function pickManyUnique(n, e, t, r = Math.random) {
     return o
 }
 function pickGuaranteed(n, e, t, r, o, i = Math.random) {
-    const u = n.filter(c => c !== e && c !== t),
-        s = []
-    for (e !== null && s.push(e); u.length && s.length < r; ) {
-        const c = exports.Random.intBetween(0, u.length - 1, i)
-        o(u[c], s) && s.push(u[c]), u.splice(c, 1)
+    const u = n.filter(s => s !== e && s !== t),
+        c = []
+    for (e !== null && c.push(e); u.length && c.length < r; ) {
+        const s = exports.Random.intBetween(0, u.length - 1, i)
+        o(u[s], c) && c.push(u[s]), u.splice(s, 1)
     }
-    return shuffle(s, i), { values: s, indexOfGuaranteed: e !== null ? s.indexOf(e) : -1 }
+    return shuffle(c, i), { values: c, indexOfGuaranteed: e !== null ? c.indexOf(e) : -1 }
 }
 function last(n) {
     if (!n.length) throw Error('Received empty array')
@@ -191,10 +192,10 @@ function setDeep(n, e, t) {
     let o = n
     for (let i = 0; i < r.length; i++) {
         const u = r[i],
-            s = i < r.length - 1 && r[i + 1].includes(']'),
+            c = i < r.length - 1 && r[i + 1].includes(']'),
             f = u.includes(']') ? u.replace(/\[|\]/g, '') : u
         if (i === r.length - 1) return (o[f] = t), t
-        isObject(o[f]) || (s ? (o[f] = []) : (o[f] = {})), (o = o[f])
+        isObject(o[f]) || (c ? (o[f] = []) : (o[f] = {})), (o = o[f])
     }
     return t
 }
@@ -268,9 +269,9 @@ function rgbToHex(n) {
 function haversineDistanceToMeters(n, e, t, r) {
     const i = (n * Math.PI) / 180,
         u = (t * Math.PI) / 180,
-        s = ((t - n) * Math.PI) / 180,
-        c = ((r - e) * Math.PI) / 180,
-        f = Math.sin(s / 2) * Math.sin(s / 2) + Math.cos(i) * Math.cos(u) * Math.sin(c / 2) * Math.sin(c / 2)
+        c = ((t - n) * Math.PI) / 180,
+        s = ((r - e) * Math.PI) / 180,
+        f = Math.sin(c / 2) * Math.sin(c / 2) + Math.cos(i) * Math.cos(u) * Math.sin(s / 2) * Math.sin(s / 2)
     return 6371e3 * (2 * Math.atan2(Math.sqrt(f), Math.sqrt(1 - f)))
 }
 function roundToNearest(n, e) {
@@ -806,9 +807,9 @@ function expand(n) {
         o = n.slice(0, t.index),
         i = n.slice(t.index + t[0].length)
     let u = []
-    for (const s of r) {
-        const c = expand(o + s + i)
-        u = u.concat(c)
+    for (const c of r) {
+        const s = expand(o + c + i)
+        u = u.concat(s)
     }
     return u
 }
@@ -1052,11 +1053,11 @@ function baseToUint8Array(n, e) {
     let o = 0,
         i = 0
     const u = []
-    for (let s = 0; s < n.length; s++) {
-        const c = n[s]
-        if (c === t) break
-        const f = e.indexOf(c)
-        if (f === -1) throw new Error(`Invalid character: ${c}`)
+    for (let c = 0; c < n.length; c++) {
+        const s = n[c]
+        if (s === t) break
+        const f = e.indexOf(s)
+        if (f === -1) throw new Error(`Invalid character: ${s}`)
         ;(i = (i << Math.log2(r)) | f), (o += Math.log2(r)), o >= 8 && ((o -= 8), u.push((i >> o) & 255))
     }
     return new Uint8Array(u)
@@ -1110,7 +1111,7 @@ function generateVariants(n, e, t, r = Math.random) {
     const o = exports.Arrays.shuffle(
             e.map(u => ({
                 variants: exports.Arrays.shuffle(
-                    u.variants.map(s => s),
+                    u.variants.map(c => c),
                     r
                 ),
                 avoid: u.avoid
@@ -1119,14 +1120,14 @@ function generateVariants(n, e, t, r = Math.random) {
         ),
         i = []
     for (const u of o) {
-        const s = u.variants.filter(f => f !== u.avoid),
-            c = s.find(f => n.includes(f))
-        if (c && (pushAll(i, explodeReplace(n, c, s)), i.length >= t)) break
+        const c = u.variants.filter(f => f !== u.avoid),
+            s = c.find(f => n.includes(f))
+        if (s && (pushAll(i, explodeReplace(n, s, c)), i.length >= t)) break
     }
     if (i.length < t)
         for (const u of o) {
-            const s = u.variants.find(c => n.includes(c))
-            if (s && (pushAll(i, explodeReplace(n, s, u.variants)), i.length >= t)) break
+            const c = u.variants.find(s => n.includes(s))
+            if (c && (pushAll(i, explodeReplace(n, c, u.variants)), i.length >= t)) break
         }
     return i.slice(0, t)
 }
@@ -1161,9 +1162,9 @@ function toLines(n, e, t = {}) {
     let o = '',
         i = 0
     for (let u = 0; u < n.length; u++) {
-        const s = n[u],
-            c = t[s] || 1
-        if (((o += s), (i += c), i > e)) {
+        const c = n[u],
+            s = t[c] || 1
+        if (((o += c), (i += s), i > e)) {
             const { line: f, rest: l } = breakLine(o)
             r.push(f),
                 (o = l),
@@ -1218,8 +1219,8 @@ function resolveVariableWithDefaultSyntax(n, e, t, r = '$', o = ':') {
         if (n[i + e.length + 1] === o)
             if (n[i + e.length + 2] === o) n = n.replace(`${r}${e}${o}${o}`, t)
             else {
-                const s = readNextWord(n, i + e.length + 2, ['_'])
-                n = n.replace(`${r}${e}${o}${s}`, t)
+                const c = readNextWord(n, i + e.length + 2, ['_'])
+                n = n.replace(`${r}${e}${o}${c}`, t)
             }
         else n = n.replace(`${r}${e}`, t)
         i = n.indexOf(`${r}${e}`, i + t.length)
@@ -1247,8 +1248,8 @@ function resolveMarkdownLinks(n, e) {
             o = n.indexOf(')', t)
         if (r !== -1 && o !== -1) {
             const [i, u] = n.slice(r + 1, o).split(']('),
-                s = e(i, u)
-            n = n.slice(0, r) + s + n.slice(o + 1)
+                c = e(i, u)
+            n = n.slice(0, r) + c + n.slice(o + 1)
         }
         t = n.indexOf('](', t + 1)
     }
@@ -1286,8 +1287,8 @@ function reposition(n, e, t, r) {
     const o = n.find(u => u[e] === t),
         i = n.find(u => u[e] === t + r)
     o && i ? ((o[e] = t + r), (i[e] = t)) : o && (o[e] = t + r),
-        n.sort((u, s) => asNumber(u[e]) - asNumber(s[e])),
-        n.forEach((u, s) => (u[e] = s + 1))
+        n.sort((u, c) => asNumber(u[e]) - asNumber(c[e])),
+        n.forEach((u, c) => (u[e] = c + 1))
 }
 function unwrapSingleKey(n) {
     const e = Object.keys(n)
@@ -1310,7 +1311,7 @@ function parseCsv(n, e = ',', t = '"') {
     let o = '',
         i = !1
     const u = n.split('')
-    for (const s of u) s === e && !i ? (r.push(o), (o = '')) : s === t && ((!o && !i) || i) ? (i = !i) : (o += s)
+    for (const c of u) c === e && !i ? (r.push(o), (o = '')) : c === t && ((!o && !i) || i) ? (i = !i) : (o += c)
     return r.push(o), r
 }
 function humanizeProgress(n) {
@@ -1428,12 +1429,12 @@ function secondsToHumanTime(n, e = DefaultTimeDeltaLabels) {
 }
 function countCycles(n, e, t) {
     var r, o, i
-    const s = ((r = t?.now) !== null && r !== void 0 ? r : Date.now()) - n,
-        c = Math.floor(s / e),
+    const c = ((r = t?.now) !== null && r !== void 0 ? r : Date.now()) - n,
+        s = Math.floor(c / e),
         f =
             e / ((o = t?.precision) !== null && o !== void 0 ? o : 1) -
-            Math.ceil((s % e) / ((i = t?.precision) !== null && i !== void 0 ? i : 1))
-    return { cycles: c, remaining: f }
+            Math.ceil((c % e) / ((i = t?.precision) !== null && i !== void 0 ? i : 1))
+    return { cycles: s, remaining: f }
 }
 const throttleTimers = {}
 function throttle(n, e) {
@@ -1450,9 +1451,9 @@ function getProgress(n, e, t, r) {
     const o = e / t,
         i = r - n,
         u = i / e,
-        s = u * t,
-        c = s - i
-    return { deltaMs: i, progress: o, baseTimeMs: u, totalTimeMs: s, remainingTimeMs: c }
+        c = u * t,
+        s = c - i
+    return { deltaMs: i, progress: o, baseTimeMs: u, totalTimeMs: c, remainingTimeMs: s }
 }
 const dayNumberIndex = {
     0: 'sunday',
@@ -1620,9 +1621,9 @@ function organiseWithLimits(n, e, t, r, o) {
     for (const u of Object.keys(e)) i[u] = []
     ;(i[r] = []), o && (n = n.sort(o))
     for (const u of n) {
-        const s = u[t],
-            c = e[s] ? s : r
-        i[c].length >= e[c] ? i[r].push(u) : i[c].push(u)
+        const c = u[t],
+            s = e[c] ? c : r
+        i[s].length >= e[s] ? i[r].push(u) : i[s].push(u)
     }
     return i
 }
@@ -1691,11 +1692,11 @@ function formatNumber(n, e) {
     const o = (t = e?.longForm) !== null && t !== void 0 ? t : !1,
         i = e?.unit ? ` ${e.unit}` : '',
         u = o ? longNumberUnits : shortNumberUnits,
-        s = (r = e?.precision) !== null && r !== void 0 ? r : 1
+        c = (r = e?.precision) !== null && r !== void 0 ? r : 1
     if (n < thresholds[0]) return `${n}${i}`
-    for (let c = 0; c < thresholds.length - 1; c++)
-        if (n < thresholds[c + 1]) return `${(n / thresholds[c]).toFixed(s)}${o ? ' ' : ''}${u[c]}${i}`
-    return `${(n / thresholds[thresholds.length - 1]).toFixed(s)}${o ? ' ' : ''}${u[thresholds.length - 1]}${i}`
+    for (let s = 0; s < thresholds.length - 1; s++)
+        if (n < thresholds[s + 1]) return `${(n / thresholds[s]).toFixed(c)}${o ? ' ' : ''}${u[s]}${i}`
+    return `${(n / thresholds[thresholds.length - 1]).toFixed(c)}${o ? ' ' : ''}${u[thresholds.length - 1]}${i}`
 }
 function makeNumber(n) {
     const e = parseFloat(n)
@@ -1774,20 +1775,20 @@ function flip(n) {
 }
 function getAllPermutations(n) {
     const e = Object.keys(n),
-        t = e.map(s => n[s].length),
-        r = t.reduce((s, c) => (s *= c))
+        t = e.map(c => n[c].length),
+        r = t.reduce((c, s) => (c *= s))
     let o = 1
     const i = [1]
-    for (let s = 0; s < t.length - 1; s++) (o *= t[s]), i.push(o)
+    for (let c = 0; c < t.length - 1; c++) (o *= t[c]), i.push(o)
     const u = []
-    for (let s = 0; s < r; s++) {
-        const c = {}
+    for (let c = 0; c < r; c++) {
+        const s = {}
         for (let f = 0; f < e.length; f++) {
             const l = n[e[f]],
-                a = Math.floor(s / i[f]) % l.length
-            c[e[f]] = l[a]
+                a = Math.floor(c / i[f]) % l.length
+            s[e[f]] = l[a]
         }
-        u.push(c)
+        u.push(s)
     }
     return u
 }
@@ -1800,14 +1801,14 @@ function getFlatNotation(n, e, t) {
 function flattenInner(n, e, t, r, o) {
     if (!isObject(e)) return e
     for (const [i, u] of Object.entries(e)) {
-        const s = getFlatNotation(t, i, r)
+        const c = getFlatNotation(t, i, r)
         Array.isArray(u)
             ? o
-                ? flattenInner(n, u, s, !0, o)
-                : (n[s] = u.map(c => flattenInner(Array.isArray(c) ? [] : {}, c, '', !1, o)))
+                ? flattenInner(n, u, c, !0, o)
+                : (n[c] = u.map(s => flattenInner(Array.isArray(s) ? [] : {}, s, '', !1, o)))
             : isObject(u)
-            ? flattenInner(n, u, s, !1, o)
-            : (n[s] = u)
+            ? flattenInner(n, u, c, !1, o)
+            : (n[c] = u)
     }
     return n
 }
@@ -1873,9 +1874,9 @@ function makeUnique(n, e) {
 function countUnique(n, e, t, r, o) {
     const i = e ? n.map(e) : n,
         u = {}
-    for (const c of i) u[c] = (u[c] || 0) + 1
-    const s = r ? sortObjectValues(u, o ? (c, f) => c[1] - f[1] : (c, f) => f[1] - c[1]) : u
-    return t ? Object.keys(s) : s
+    for (const s of i) u[s] = (u[s] || 0) + 1
+    const c = r ? sortObjectValues(u, o ? (s, f) => s[1] - f[1] : (s, f) => f[1] - s[1]) : u
+    return t ? Object.keys(c) : c
 }
 function sortObjectValues(n, e) {
     return Object.fromEntries(Object.entries(n).sort(e))
@@ -1940,36 +1941,6 @@ function getFromTemporalBidirectionalMap(n, e) {
     const t = n.map.get(e)
     return t && t.validUntil > Date.now() ? t.data : null
 }
-function makeAsyncQueue(n = 1) {
-    const e = [],
-        t = []
-    let r = 0
-    async function o() {
-        if (e.length > 0 && r < n) {
-            r++
-            const u = e.shift()
-            try {
-                u && (await u())
-            } finally {
-                if (--r === 0) for (; t.length > 0; ) t.shift()()
-                o()
-            }
-        }
-    }
-    async function i() {
-        return r
-            ? new Promise(u => {
-                  t.push(u)
-              })
-            : Promise.resolve()
-    }
-    return {
-        enqueue(u) {
-            e.push(u), o()
-        },
-        drain: i
-    }
-}
 class Optional {
     constructor(e) {
         this.value = e
@@ -2040,28 +2011,28 @@ class Node {
 function createHierarchy(n, e, t, r, o = !1) {
     const i = new Map(),
         u = []
-    n.forEach(c => {
-        const f = new Node(c)
-        i.set(c[e], f)
+    n.forEach(s => {
+        const f = new Node(s)
+        i.set(s[e], f)
     }),
-        n.forEach(c => {
-            const f = i.get(c[e])
+        n.forEach(s => {
+            const f = i.get(s[e])
             if (!f) return
-            const l = c[t]
+            const l = s[t]
             if (l) {
                 const a = i.get(l)
                 a && a.children.push(f)
             } else u.push(f)
         })
-    const s = c => {
-        c.children.sort((f, l) => {
+    const c = s => {
+        s.children.sort((f, l) => {
             const a = f.value[r],
                 h = l.value[r]
             return o ? h - a : a - h
         }),
-            c.children.forEach(s)
+            s.children.forEach(c)
     }
-    return u.forEach(s), u
+    return u.forEach(c), u
 }
 function log2Reduce(n, e) {
     if (Math.log2(n.length) % 1 !== 0) throw new Error('Array length must be a power of 2')
@@ -2188,7 +2159,7 @@ function tickPlaybook(n) {
     )
 }
 function getArgument(n, e, t, r) {
-    const o = n.findIndex(s => s === `--${e}` || s.startsWith(`--${e}=`)),
+    const o = n.findIndex(c => c === `--${e}` || c.startsWith(`--${e}=`)),
         i = n[o]
     if (!i) return (t || {})[r || e || ''] || null
     if (i.includes('=')) return i.split('=')[1]
@@ -2205,14 +2176,14 @@ function getNumberArgument(n, e, t, r) {
     }
 }
 function getBooleanArgument(n, e, t, r) {
-    const o = n.some(c => c.endsWith('-' + e)),
+    const o = n.some(s => s.endsWith('-' + e)),
         i = getArgument(n, e, t, r)
     if (!i && o) return !0
     if (!i && !o) return null
     const u = ['true', '1', 'yes', 'y', 'on'],
-        s = ['false', '0', 'no', 'n', 'off']
+        c = ['false', '0', 'no', 'n', 'off']
     if (u.includes(i.toLowerCase())) return !0
-    if (s.includes(i.toLowerCase())) return !1
+    if (c.includes(i.toLowerCase())) return !1
     throw Error(`Invalid boolean argument ${e}: ${i}`)
 }
 function requireStringArgument(n, e, t, r) {
@@ -2295,16 +2266,16 @@ function isBottommost(n, e, t) {
     return !n[e][t + 1]
 }
 function getCorners(n, e, t) {
-    var r, o, i, u, s, c, f, l
+    var r, o, i, u, c, s, f, l
     const a = []
     return n[e][t]
         ? isHorizontalLine(n, e, t) || isVerticalLine(n, e, t)
             ? []
-            : (!(!((s = n[e - 1]) === null || s === void 0) && s[t - 1]) &&
+            : (!(!((c = n[e - 1]) === null || c === void 0) && c[t - 1]) &&
                   isLeftmost(n, e, t) &&
                   isTopmost(n, e, t) &&
                   a.push({ x: e, y: t }),
-              !(!((c = n[e + 1]) === null || c === void 0) && c[t - 1]) &&
+              !(!((s = n[e + 1]) === null || s === void 0) && s[t - 1]) &&
                   isRightmost(n, e, t) &&
                   isTopmost(n, e, t) &&
                   a.push({ x: e + 1, y: t }),
@@ -2332,42 +2303,42 @@ function findCorners(n, e, t, r) {
     ]
     for (let i = 0; i < n.length; i++)
         for (let u = 0; u < n[0].length; u++) {
-            const s = getCorners(n, i, u)
-            for (const c of s) o.some(f => f.x === c.x && f.y === c.y) || o.push(c)
+            const c = getCorners(n, i, u)
+            for (const s of c) o.some(f => f.x === s.x && f.y === s.y) || o.push(s)
         }
     return o.map(i => ({ x: i.x * e, y: i.y * e }))
 }
 function findLines(n, e) {
-    const t = filterCoordinates(n, (c, f) => n[c][f] === 0 && n[c][f + 1] !== 0, 'row-first').map(c =>
-            Object.assign(Object.assign({}, c), { dx: 1, dy: 0 })
+    const t = filterCoordinates(n, (s, f) => n[s][f] === 0 && n[s][f + 1] !== 0, 'row-first').map(s =>
+            Object.assign(Object.assign({}, s), { dx: 1, dy: 0 })
         ),
-        r = filterCoordinates(n, (c, f) => n[c][f] === 0 && n[c][f - 1] !== 0, 'row-first').map(c =>
-            Object.assign(Object.assign({}, c), { dx: 1, dy: 0 })
+        r = filterCoordinates(n, (s, f) => n[s][f] === 0 && n[s][f - 1] !== 0, 'row-first').map(s =>
+            Object.assign(Object.assign({}, s), { dx: 1, dy: 0 })
         ),
         o = filterCoordinates(
             n,
-            (c, f) => {
+            (s, f) => {
                 var l
-                return n[c][f] === 0 && ((l = n[c - 1]) === null || l === void 0 ? void 0 : l[f]) !== 0
+                return n[s][f] === 0 && ((l = n[s - 1]) === null || l === void 0 ? void 0 : l[f]) !== 0
             },
             'column-first'
-        ).map(c => Object.assign(Object.assign({}, c), { dx: 0, dy: 1 })),
+        ).map(s => Object.assign(Object.assign({}, s), { dx: 0, dy: 1 })),
         i = filterCoordinates(
             n,
-            (c, f) => {
+            (s, f) => {
                 var l
-                return n[c][f] === 0 && ((l = n[c + 1]) === null || l === void 0 ? void 0 : l[f]) !== 0
+                return n[s][f] === 0 && ((l = n[s + 1]) === null || l === void 0 ? void 0 : l[f]) !== 0
             },
             'column-first'
-        ).map(c => Object.assign(Object.assign({}, c), { dx: 0, dy: 1 }))
-    t.forEach(c => c.y++), i.forEach(c => c.x++)
-    const u = group([...o, ...i], (c, f) => c.x === f.x && c.y - 1 === f.y),
-        s = group([...r, ...t], (c, f) => c.y === f.y && c.x - 1 === f.x)
-    return [...u, ...s]
-        .map(c => ({ start: c[0], end: last(c) }))
-        .map(c => ({
-            start: multiplyPoint(c.start, e),
-            end: multiplyPoint(addPoint(c.end, { x: c.start.dx, y: c.start.dy }), e)
+        ).map(s => Object.assign(Object.assign({}, s), { dx: 0, dy: 1 }))
+    t.forEach(s => s.y++), i.forEach(s => s.x++)
+    const u = group([...o, ...i], (s, f) => s.x === f.x && s.y - 1 === f.y),
+        c = group([...r, ...t], (s, f) => s.y === f.y && s.x - 1 === f.x)
+    return [...u, ...c]
+        .map(s => ({ start: s[0], end: last(s) }))
+        .map(s => ({
+            start: multiplyPoint(s.start, e),
+            end: multiplyPoint(addPoint(s.end, { x: s.start.dx, y: s.start.dy }), e)
         }))
 }
 function getAngleInRadians(n, e) {
@@ -2381,11 +2352,11 @@ function getLineIntersectionPoint(n, e, t, r) {
     if (o === 0) return null
     let i = n.y - t.y,
         u = n.x - t.x
-    const s = (r.x - t.x) * i - (r.y - t.y) * u,
-        c = (e.x - n.x) * i - (e.y - n.y) * u
+    const c = (r.x - t.x) * i - (r.y - t.y) * u,
+        s = (e.x - n.x) * i - (e.y - n.y) * u
     return (
-        (i = s / o),
-        (u = c / o),
+        (i = c / o),
+        (u = s / o),
         i > 0 && i < 1 && u > 0 && u < 1 ? { x: n.x + i * (e.x - n.x), y: n.y + i * (e.y - n.y) } : null
     )
 }
@@ -2398,9 +2369,9 @@ function raycast(n, e, t) {
     }
     return r.length
         ? r.reduce((i, u) => {
-              const s = getDistanceBetweenPoints(n, u),
-                  c = getDistanceBetweenPoints(n, i)
-              return s < c ? u : i
+              const c = getDistanceBetweenPoints(n, u),
+                  s = getDistanceBetweenPoints(n, i)
+              return c < s ? u : i
           })
         : null
 }
@@ -2408,9 +2379,9 @@ function raycastCircle(n, e, t) {
     const o = getSortedRayAngles(n, t),
         i = []
     for (const u of o) {
-        const s = raycast(n, e, u - 0.001),
-            c = raycast(n, e, u + 0.001)
-        s && i.push(s), c && i.push(c)
+        const c = raycast(n, e, u - 0.001),
+            s = raycast(n, e, u + 0.001)
+        c && i.push(c), s && i.push(s)
     }
     return i
 }
@@ -2429,8 +2400,55 @@ class PubSubChannel {
     publish(e) {
         this.subscribers.forEach(t => t(e))
     }
+    clear() {
+        this.subscribers = []
+    }
+    getSubscriberCount() {
+        return this.subscribers.length
+    }
+}
+exports.PubSubChannel = PubSubChannel
+class AsyncQueue {
+    constructor(e, t) {
+        ;(this.queue = []),
+            (this.running = 0),
+            (this.onProcessed = new PubSubChannel()),
+            (this.onDrained = new PubSubChannel()),
+            (this.concurrency = e),
+            (this.capacity = t)
+    }
+    process() {
+        if (this.running >= this.concurrency) return
+        const e = this.queue.shift()
+        e &&
+            (this.running++,
+            e().finally(() => {
+                this.running--,
+                    this.process(),
+                    this.onProcessed.publish(),
+                    this.running === 0 && this.onDrained.publish()
+            }))
+    }
+    enqueue(e) {
+        if (this.queue.length < this.capacity) return this.queue.push(e), this.process(), Promise.resolve()
+        if (this.onProcessed.getSubscriberCount()) throw Error('Queue capacity is full')
+        return new Promise(t => {
+            this.onProcessed.subscribe(() => {
+                this.queue.length < this.capacity && (this.queue.push(e), this.process(), this.onProcessed.clear(), t())
+            })
+        })
+    }
+    drain() {
+        if (this.running === 0) return Promise.resolve()
+        if (this.onDrained.getSubscriberCount()) throw Error('Already draining')
+        return new Promise(e => {
+            this.onDrained.subscribe(() => {
+                this.onDrained.clear(), e()
+            })
+        })
+    }
 }
-;(exports.PubSubChannel = PubSubChannel),
+;(exports.AsyncQueue = AsyncQueue),
     (exports.Binary = {
         hexToUint8Array,
         uint8ArrayToHex,
@@ -2538,7 +2556,7 @@ class PubSubChannel {
         triangularNumber,
         searchFloat
     }),
-    (exports.Promises = { raceFulfilled, invert: invertPromise, runInParallelBatches, makeAsyncQueue }),
+    (exports.Promises = { raceFulfilled, invert: invertPromise, runInParallelBatches }),
     (exports.Dates = {
         getTimestamp,
         getTimeDelta,

package/package.json

@@ -1,6 +1,6 @@
 {
     "name": "cafe-utility",
-    "version": "23.11.0",
+    "version": "24.0.0",
     "description": "",
     "main": "index.js",
     "exports": {