yukimu 2.0.8 → 3.0.0

package/dist/Queue.d.ts

@@ -0,0 +1,89 @@
+/** Yukimu v2.0.0 — Track Queue with Enhanced Operations */
+import type { Track } from "./types";
+/**
+ * Manages the track queue for a player.
+ *
+ * Improvements from v1:
+ * - Configurable previous history size
+ * - New methods: reverse(), removeDuplicates(), swap(), insertAt()
+ * - Serialization/deserialization for persistence
+ * - Bounds checking with meaningful errors
+ * - Proper readonly access
+ */
+export declare class Queue {
+    current: Track | null;
+    previous: Track[];
+    private tracks;
+    private readonly maxPreviousSize;
+    constructor(maxPreviousSize?: 25);
+    /**
+     * Add one or more tracks to the queue.
+     * @param tracks - Track or array of tracks to add
+     * @param position - Optional position to insert at (default: end of queue)
+     */
+    add(tracks: Track | Track[], position?: number): void;
+    /**
+     * Advance the queue: move current to previous, shift next track to current.
+     * @returns The new current track, or null if the queue is empty
+     */
+    next(): Track | null;
+    /**
+     * Remove a track at a specific index.
+     * @returns The removed track, or null if index is out of bounds
+     */
+    remove(index: number): Track | null;
+    /**
+     * Remove a range of tracks.
+     * @param start - Start index (inclusive)
+     * @param end - End index (exclusive)
+     */
+    removeRange(start: number, end: number): Track[];
+    /** Clear the entire queue, current track, and history */
+    clear(): void;
+    /** Clear only the queue (keep current track and history) */
+    clearQueue(): void;
+    /** Shuffle the queue using Fisher-Yates algorithm */
+    shuffle(): void;
+    /** Move a track from one position to another */
+    move(from: number, to: number): boolean;
+    /** Swap two tracks in the queue */
+    swap(i: number, j: number): boolean;
+    /**
+     * Skip to a specific index in the queue, removing everything before it.
+     * @returns The track at the given index, or null if out of bounds
+     */
+    skipto(index: number): Track | null;
+    /** Reverse the queue order */
+    reverse(): void;
+    /**
+     * Remove duplicate tracks based on their encoded data.
+     * Keeps the first occurrence.
+     */
+    removeDuplicates(): number;
+    /** Peek at the next N tracks without modifying the queue */
+    peek(count?: number): Track[];
+    /** Find the first track matching a predicate */
+    find(predicate: (track: Track) => boolean): Track | undefined;
+    /** Filter tracks by a predicate */
+    filter(predicate: (track: Track) => boolean): Track[];
+    /** Get the index of a track by its encoded data */
+    indexOf(encoded: string): number;
+    /** Serialize the queue state for persistence */
+    toJSON(): {
+        current: Track | null;
+        tracks: Track[];
+        previous: Track[];
+    };
+    /** Restore queue state from serialized data */
+    fromJSON(data: {
+        current?: Track | null;
+        tracks?: Track[];
+        previous?: Track[];
+    }): void;
+    get size(): number;
+    get isEmpty(): boolean;
+    get totalDuration(): number;
+    /** Readonly access to the underlying track array */
+    get list(): readonly Track[];
+}
+//# sourceMappingURL=Queue.d.ts.map

package/dist/Queue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Queue.d.ts","sourceRoot":"","sources":["../src/Queue.ts"],"names":[],"mappings":"AAAA,2DAA2D;AAG3D,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAErC;;;;;;;;;GASG;AACH,qBAAa,KAAK;IACT,OAAO,EAAE,KAAK,GAAG,IAAI,CAAQ;IAC7B,QAAQ,EAAE,KAAK,EAAE,CAAM;IAC9B,OAAO,CAAC,MAAM,CAAe;IAC7B,OAAO,CAAC,QAAQ,CAAC,eAAe,CAAS;gBAE7B,eAAe,KAAiC;IAI5D;;;;OAIG;IACI,GAAG,CAAC,MAAM,EAAE,KAAK,GAAG,KAAK,EAAE,EAAE,QAAQ,CAAC,EAAE,MAAM,GAAG,IAAI;IAW5D;;;OAGG;IACI,IAAI,IAAI,KAAK,GAAG,IAAI;IAW3B;;;OAGG;IACI,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI;IAM1C;;;;OAIG;IACI,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,KAAK,EAAE;IAOvD,yDAAyD;IAClD,KAAK,IAAI,IAAI;IAMpB,4DAA4D;IACrD,UAAU,IAAI,IAAI;IAIzB,qDAAqD;IAC9C,OAAO,IAAI,IAAI;IAOtB,gDAAgD;IACzC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,OAAO;IAQ9C,mCAAmC;IAC5B,IAAI,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;IAM1C;;;OAGG;IACI,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI;IAM1C,8BAA8B;IACvB,OAAO,IAAI,IAAI;IAItB;;;OAGG;IACI,gBAAgB,IAAI,MAAM;IAWjC,4DAA4D;IACrD,IAAI,CAAC,KAAK,SAAK,GAAG,KAAK,EAAE;IAIhC,gDAAgD;IACzC,IAAI,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,GAAG,KAAK,GAAG,SAAS;IAIpE,mCAAmC;IAC5B,MAAM,CAAC,SAAS,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,OAAO,GAAG,KAAK,EAAE;IAI5D,mDAAmD;IAC5C,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAMvC,gDAAgD;IACzC,MAAM,IAAI;QACf,OAAO,EAAE,KAAK,GAAG,IAAI,CAAC;QACtB,MAAM,EAAE,KAAK,EAAE,CAAC;QAChB,QAAQ,EAAE,KAAK,EAAE,CAAC;KACnB;IAQD,+CAA+C;IACxC,QAAQ,CAAC,IAAI,EAAE;QACpB,OAAO,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC;QACvB,MAAM,CAAC,EAAE,KAAK,EAAE,CAAC;QACjB,QAAQ,CAAC,EAAE,KAAK,EAAE,CAAC;KACpB,GAAG,IAAI;IAQR,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,IAAI,OAAO,IAAI,OAAO,CAErB;IAED,IAAI,aAAa,IAAI,MAAM,CAE1B;IAED,oDAAoD;IACpD,IAAI,IAAI,IAAI,SAAS,KAAK,EAAE,CAE3B;CACF"}

package/dist/Queue.js

@@ -0,0 +1,188 @@
+"use strict";
+/** Yukimu v2.0.0 — Track Queue with Enhanced Operations */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Queue = void 0;
+const Constants_1 = require("./Constants");
+/**
+ * Manages the track queue for a player.
+ *
+ * Improvements from v1:
+ * - Configurable previous history size
+ * - New methods: reverse(), removeDuplicates(), swap(), insertAt()
+ * - Serialization/deserialization for persistence
+ * - Bounds checking with meaningful errors
+ * - Proper readonly access
+ */
+class Queue {
+    current = null;
+    previous = [];
+    tracks = [];
+    maxPreviousSize;
+    constructor(maxPreviousSize = Constants_1.DEFAULTS.PREVIOUS_HISTORY_SIZE) {
+        this.maxPreviousSize = maxPreviousSize;
+    }
+    /**
+     * Add one or more tracks to the queue.
+     * @param tracks - Track or array of tracks to add
+     * @param position - Optional position to insert at (default: end of queue)
+     */
+    add(tracks, position) {
+        const arr = Array.isArray(tracks) ? tracks : [tracks];
+        if (arr.length === 0)
+            return;
+        if (position !== undefined && position >= 0 && position <= this.tracks.length) {
+            this.tracks.splice(position, 0, ...arr);
+        }
+        else {
+            this.tracks.push(...arr);
+        }
+    }
+    /**
+     * Advance the queue: move current to previous, shift next track to current.
+     * @returns The new current track, or null if the queue is empty
+     */
+    next() {
+        if (this.current) {
+            this.previous.unshift(this.current);
+            if (this.previous.length > this.maxPreviousSize) {
+                this.previous.length = this.maxPreviousSize;
+            }
+        }
+        this.current = this.tracks.shift() ?? null;
+        return this.current;
+    }
+    /**
+     * Remove a track at a specific index.
+     * @returns The removed track, or null if index is out of bounds
+     */
+    remove(index) {
+        if (index < 0 || index >= this.tracks.length)
+            return null;
+        const [removed] = this.tracks.splice(index, 1);
+        return removed ?? null;
+    }
+    /**
+     * Remove a range of tracks.
+     * @param start - Start index (inclusive)
+     * @param end - End index (exclusive)
+     */
+    removeRange(start, end) {
+        if (start < 0)
+            start = 0;
+        if (end > this.tracks.length)
+            end = this.tracks.length;
+        if (start >= end)
+            return [];
+        return this.tracks.splice(start, end - start);
+    }
+    /** Clear the entire queue, current track, and history */
+    clear() {
+        this.tracks = [];
+        this.current = null;
+        this.previous = [];
+    }
+    /** Clear only the queue (keep current track and history) */
+    clearQueue() {
+        this.tracks = [];
+    }
+    /** Shuffle the queue using Fisher-Yates algorithm */
+    shuffle() {
+        for (let i = this.tracks.length - 1; i > 0; i--) {
+            const j = Math.floor(Math.random() * (i + 1));
+            [this.tracks[i], this.tracks[j]] = [this.tracks[j], this.tracks[i]];
+        }
+    }
+    /** Move a track from one position to another */
+    move(from, to) {
+        if (from < 0 || to < 0 || from >= this.tracks.length || to >= this.tracks.length)
+            return false;
+        const [track] = this.tracks.splice(from, 1);
+        if (!track)
+            return false;
+        this.tracks.splice(to, 0, track);
+        return true;
+    }
+    /** Swap two tracks in the queue */
+    swap(i, j) {
+        if (i < 0 || j < 0 || i >= this.tracks.length || j >= this.tracks.length)
+            return false;
+        [this.tracks[i], this.tracks[j]] = [this.tracks[j], this.tracks[i]];
+        return true;
+    }
+    /**
+     * Skip to a specific index in the queue, removing everything before it.
+     * @returns The track at the given index, or null if out of bounds
+     */
+    skipto(index) {
+        if (index < 0 || index >= this.tracks.length)
+            return null;
+        this.tracks.splice(0, index);
+        return this.next();
+    }
+    /** Reverse the queue order */
+    reverse() {
+        this.tracks.reverse();
+    }
+    /**
+     * Remove duplicate tracks based on their encoded data.
+     * Keeps the first occurrence.
+     */
+    removeDuplicates() {
+        const seen = new Set();
+        const before = this.tracks.length;
+        this.tracks = this.tracks.filter((track) => {
+            if (seen.has(track.encoded))
+                return false;
+            seen.add(track.encoded);
+            return true;
+        });
+        return before - this.tracks.length;
+    }
+    /** Peek at the next N tracks without modifying the queue */
+    peek(count = 10) {
+        return this.tracks.slice(0, count);
+    }
+    /** Find the first track matching a predicate */
+    find(predicate) {
+        return this.tracks.find(predicate);
+    }
+    /** Filter tracks by a predicate */
+    filter(predicate) {
+        return this.tracks.filter(predicate);
+    }
+    /** Get the index of a track by its encoded data */
+    indexOf(encoded) {
+        return this.tracks.findIndex((t) => t.encoded === encoded);
+    }
+    // ─── Serialization ────────────────────────────────────────────────────
+    /** Serialize the queue state for persistence */
+    toJSON() {
+        return {
+            current: this.current,
+            tracks: [...this.tracks],
+            previous: [...this.previous],
+        };
+    }
+    /** Restore queue state from serialized data */
+    fromJSON(data) {
+        this.current = data.current ?? null;
+        this.tracks = data.tracks ? [...data.tracks] : [];
+        this.previous = data.previous ? [...data.previous] : [];
+    }
+    // ─── Getters ──────────────────────────────────────────────────────────
+    get size() {
+        return this.tracks.length;
+    }
+    get isEmpty() {
+        return this.tracks.length === 0;
+    }
+    get totalDuration() {
+        return this.tracks.reduce((acc, t) => acc + (t.info?.length ?? 0), 0);
+    }
+    /** Readonly access to the underlying track array */
+    get list() {
+        return this.tracks;
+    }
+}
+exports.Queue = Queue;
+//# sourceMappingURL=Queue.js.map

package/dist/Queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../src/Queue.ts"],"names":[],"mappings":";AAAA,2DAA2D;;;AAE3D,2CAAuC;AAGvC;;;;;;;;;GASG;AACH,MAAa,KAAK;IACT,OAAO,GAAiB,IAAI,CAAC;IAC7B,QAAQ,GAAY,EAAE,CAAC;IACtB,MAAM,GAAY,EAAE,CAAC;IACZ,eAAe,CAAS;IAEzC,YAAY,eAAe,GAAG,oBAAQ,CAAC,qBAAqB;QAC1D,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACI,GAAG,CAAC,MAAuB,EAAE,QAAiB;QACnD,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAE7B,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,IAAI,CAAC,IAAI,QAAQ,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YAC9E,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED;;;OAGG;IACI,IAAI;QACT,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;gBAChD,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC;YAC9C,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,IAAI,CAAC;QAC3C,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,KAAa;QACzB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAC1D,MAAM,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC/C,OAAO,OAAO,IAAI,IAAI,CAAC;IACzB,CAAC;IAED;;;;OAIG;IACI,WAAW,CAAC,KAAa,EAAE,GAAW;QAC3C,IAAI,KAAK,GAAG,CAAC;YAAE,KAAK,GAAG,CAAC,CAAC;QACzB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QACvD,IAAI,KAAK,IAAI,GAAG;YAAE,OAAO,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,GAAG,GAAG,KAAK,CAAC,CAAC;IAChD,CAAC;IAED,yDAAyD;IAClD,KAAK;QACV,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAED,4DAA4D;IACrD,UAAU;QACf,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC;IACnB,CAAC;IAED,qDAAqD;IAC9C,OAAO;QACZ,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChD,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;QAC1E,CAAC;IACH,CAAC;IAED,gDAAgD;IACzC,IAAI,CAAC,IAAY,EAAE,EAAU;QAClC,IAAI,IAAI,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAC/F,MAAM,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK;YAAE,OAAO,KAAK,CAAC;QACzB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mCAAmC;IAC5B,IAAI,CAAC,CAAS,EAAE,CAAS;QAC9B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QACvF,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC;QACxE,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,KAAa;QACzB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QAC1D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,IAAI,EAAE,CAAC;IACrB,CAAC;IAED,8BAA8B;IACvB,OAAO;QACZ,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;IACxB,CAAC;IAED;;;OAGG;IACI,gBAAgB;QACrB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;YACzC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC1C,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;YACxB,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IACrC,CAAC;IAED,4DAA4D;IACrD,IAAI,CAAC,KAAK,GAAG,EAAE;QACpB,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACrC,CAAC;IAED,gDAAgD;IACzC,IAAI,CAAC,SAAoC;QAC9C,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACrC,CAAC;IAED,mCAAmC;IAC5B,MAAM,CAAC,SAAoC;QAChD,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACvC,CAAC;IAED,mDAAmD;IAC5C,OAAO,CAAC,OAAe;QAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,KAAK,OAAO,CAAC,CAAC;IAC7D,CAAC;IAED,yEAAyE;IAEzE,gDAAgD;IACzC,MAAM;QAKX,OAAO;YACL,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACxB,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC;SAC7B,CAAC;IACJ,CAAC;IAED,+CAA+C;IACxC,QAAQ,CAAC,IAIf;QACC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC;QACpC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAClD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC1D,CAAC;IAED,yEAAyE;IAEzE,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,oDAAoD;IACpD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;CACF;AAjMD,sBAiMC"}

package/dist/Resolver.d.ts

@@ -0,0 +1,68 @@
+/** Yukimu v2.0.0 — Track Resolver with Retry, Caching & Fallback */
+import type { Yukimu } from "./Yukimu";
+import type { Node } from "./Node";
+import type { SearchResult, SearchSource } from "./types";
+/**
+ * Resolves search queries and URLs into playable tracks.
+ *
+ * Improvements from v1:
+ * - Accepts optional `node` parameter (loads on the correct node for a player)
+ * - Search retry with fallback sources
+ * - Search result caching
+ * - Spotify playlist/album resolution
+ * - Spotify token refresh with retry and timeout
+ * - Rate limit handling for Spotify API
+ */
+export declare class Resolver {
+    private readonly manager;
+    private spotifyToken;
+    private spotifyExpiry;
+    private spotifyRefreshing;
+    constructor(manager: Yukimu);
+    /**
+     * Resolve a query (URL or search term) into tracks.
+     *
+     * @param query - A URL or search query string
+     * @param source - The search source to use (ignored for URLs)
+     * @param requester - Optional requester metadata to attach to tracks
+     * @param node - Optional specific node to use for loading
+     */
+    resolve(query: string, source: SearchSource, requester?: unknown, node?: Node): Promise<SearchResult>;
+    /**
+     * Internal resolve with an overall timeout and node failover.
+     * If the primary node fails or times out, tries a different connected node.
+     */
+    private resolveWithTimeout;
+    /**
+     * Try loading tracks with retries on a specific node.
+     * Separated so we can run this against different nodes for failover.
+     */
+    private tryLoadWithRetries;
+    /**
+     * Race a promise against a timeout. Returns null if the timeout fires first.
+     */
+    private raceTimeout;
+    /**
+     * Detect the source platform from a URL.
+     */
+    detectSource(url: string): SearchSource | null;
+    private trySpotifyFallback;
+    private getSpotifyToken;
+    private resolveSpotifyMeta;
+    private resolveSpotifyPlaylist;
+    private resolveSpotifyAlbum;
+    /**
+     * Resolve a batch of Spotify track metadata concurrently with a concurrency
+     * limit. Prevents the sequential N × 15s timeout that caused player freezes.
+     */
+    private resolveSpotifyBatch;
+    private getLoadNode;
+    /**
+     * Get a fallback node that is different from the given node.
+     * Used when the primary node fails or times out during search.
+     */
+    private getFallbackNode;
+    private attachRequester;
+    private sleep;
+}
+//# sourceMappingURL=Resolver.d.ts.map

package/dist/Resolver.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Resolver.d.ts","sourceRoot":"","sources":["../src/Resolver.ts"],"names":[],"mappings":"AAAA,oEAAoE;AAGpE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AACvC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AACnC,OAAO,KAAK,EAAE,YAAY,EAAE,YAAY,EAAS,MAAM,SAAS,CAAC;AASjE;;;;;;;;;;GAUG;AACH,qBAAa,QAAQ;IACnB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IACjC,OAAO,CAAC,YAAY,CAAuB;IAC3C,OAAO,CAAC,aAAa,CAAK;IAC1B,OAAO,CAAC,iBAAiB,CAAS;gBAEtB,OAAO,EAAE,MAAM;IAI3B;;;;;;;OAOG;IACU,OAAO,CAClB,KAAK,EAAE,MAAM,EACb,MAAM,EAAE,YAAY,EACpB,SAAS,CAAC,EAAE,OAAO,EACnB,IAAI,CAAC,EAAE,IAAI,GACV,OAAO,CAAC,YAAY,CAAC;IAoBxB;;;OAGG;YACW,kBAAkB;IAiEhC;;;OAGG;YACW,kBAAkB;IAwBhC;;OAEG;IACH,OAAO,CAAC,WAAW;IAWnB;;OAEG;IACI,YAAY,CAAC,GAAG,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;YASvC,kBAAkB;YAkDlB,eAAe;YAiDf,kBAAkB;YA6BlB,sBAAsB;YAqCtB,mBAAmB;IAqCjC;;;OAGG;YACW,mBAAmB;IA6BjC,OAAO,CAAC,WAAW;IAInB;;;OAGG;IACH,OAAO,CAAC,eAAe;IASvB,OAAO,CAAC,eAAe;IAMvB,OAAO,CAAC,KAAK;CAGd"}