✨ feat: Rework on streaming to use WebM format

example/test.ts

@@ -2,6 +2,7 @@ import NekoMelody from "../src";
 
 import Speaker from "speaker";
 import ffmpeg from "fluent-ffmpeg";
+import { YtDlpProvider } from "../src/providers";
 
 const main = async () => {
     // Create the Speaker instance
@@ -9,18 +10,23 @@ const main = async () => {
 
     const videoId = "9PuudPiyma4";
 
-    // Get the stream from the URL
+    // Providers
-    const stream = await NekoMelody.stream(
+    const providers = [new YtDlpProvider()];
-        `https://www.youtube.com/watch?v=${videoId}`,
+    const player = NekoMelody.createPlayer(providers);
-    );
+
+    await player.play(`https://www.youtube.com/watch?v=${videoId}`);
+
+    if (!player.stream) {
+        console.error("No input stream");
+        return;
+    }
 
     // PCM data from stdin gets piped into the speaker
-    let audioStream = stream;
     const ffmpegProcess = ffmpeg()
-        .input(audioStream)
+        .input(player.stream)
         .format("s16le") // Output format (PCM 16-bit little-endian)
-        //.audioChannels(2) // Number of audio channels
+        .audioChannels(2)
-        //.audioFrequency(44100) // Sample rate
+        .audioFrequency(44100)
         .on("error", (err) => {
             console.error("An error occurred:", err.message);
         })

package.json

@@ -42,7 +42,10 @@
     "dependencies": {
         "axios": "^1.7.2",
         "fluent-ffmpeg": "^2.1.3",
+        "music-metadata": "^8.3.0",
+        "play-audio": "^0.5.2",
         "play-dl": "github:YuzuZensai/play-dl-test#test",
+        "readable-web-to-node-stream": "^3.0.2",
         "speaker": "^0.5.5",
         "yt-dlp-wrap": "^2.3.12"
     }

pnpm-lock.yaml

@@ -14,9 +14,18 @@ importers:
       fluent-ffmpeg:
         specifier: ^2.1.3
         version: 2.1.3
+      music-metadata:
+        specifier: ^8.3.0
+        version: 8.3.0
+      play-audio:
+        specifier: ^0.5.2
+        version: 0.5.2
       play-dl:
         specifier: github:YuzuZensai/play-dl-test#test
         version: https://codeload.github.com/YuzuZensai/play-dl-test/tar.gz/45fefec62445eba6b10359a446d3ec7d28587f86
+      readable-web-to-node-stream:
+        specifier: ^3.0.2
+        version: 3.0.2
       speaker:
         specifier: ^0.5.5
         version: 0.5.5
@@ -432,6 +441,9 @@ packages:
   '@swc/types@0.1.8':
     resolution: {integrity: sha512-RNFA3+7OJFNYY78x0FYwi1Ow+iF1eF5WvmfY1nXPOEH4R2p/D4Cr1vzje7dNAI2aLFqpv8Wyz4oKSWqIZArpQA==}
 
+  '@tokenizer/token@0.3.0':
+    resolution: {integrity: sha512-OvjF+z51L3ov0OyAU0duzsYuvO01PH7x4t6DJx+guahgTnBHkhJdG7soQeTSFLWN3efnHyibZ4Z8l2EuWwJN3A==}
+
   '@types/estree@1.0.5':
     resolution: {integrity: sha512-/kYRxGDLWzHOB7q+wtSUQlFrtcdUccpfy+X+9iMBpHK8QLLhx2wIPYuS5DYtR9Wa/YlZAbIovy7qVdB1Aq6Lyw==}
 
@@ -620,6 +632,10 @@ packages:
   concat-map@0.0.1:
     resolution: {integrity: sha512-/Srv4dswyQNBfohGpz9o6Yb3Gz3SrUDqBH5rTuhGR7ahtlbYKnVxw2bCFMRljaA7EXHaXZ8wsHdodFvbkhKmqg==}
 
+  content-type@1.0.5:
+    resolution: {integrity: sha512-nTjqfcBFEipKdXCv4YDQWCfmcLZKm81ldF0pAopTvyrFGVbcR6P/VAAd5G7N+0tTr8QqiU0tFadD6FK4NtJwOA==}
+    engines: {node: '>= 0.6'}
+
   cross-spawn@7.0.3:
     resolution: {integrity: sha512-iRDPJKUPVEND7dHPO8rkbOnPpyDygcDFtWjpeWNCgy8WP2rXcxXL8TskReQl6OrB2G7+UJrags1q15Fudc7G6w==}
     engines: {node: '>= 8'}
@@ -746,6 +762,10 @@ packages:
     resolution: {integrity: sha512-XXTUwCvisa5oacNGRP9SfNtYBNAMi+RPwBFmblZEF7N7swHYQS6/Zfk7SRwx4D5j3CH211YNRco1DEMNVfZCnQ==}
     engines: {node: '>=16.0.0'}
 
+  file-type@18.7.0:
+    resolution: {integrity: sha512-ihHtXRzXEziMrQ56VSgU7wkxh55iNchFkosu7Y9/S+tXHdKyrGjVK0ujbqNnsxzea+78MaLhN6PGmfYSAv1ACw==}
+    engines: {node: '>=14.16'}
+
   file-uri-to-path@1.0.0:
     resolution: {integrity: sha512-0Zt+s3L7Vf1biwWZ29aARiVYLx7iMGnEUl9x33fbB/j3jR81u/O2LbqK+Bm1CDSNDKVtJ/YjwY7TUd5SkeLQLw==}
 
@@ -829,6 +849,9 @@ packages:
     resolution: {integrity: sha512-B4FFZ6q/T2jhhksgkbEW3HBvWIfDW85snkQgawt07S7J5QXTk6BkNV+0yAeZrM5QpMAdYlocGoljn0sJ/WQkFw==}
     engines: {node: '>=10.17.0'}
 
+  ieee754@1.2.1:
+    resolution: {integrity: sha512-dcyqhDvX1C46lXZcVqCpK+FtMRQVdIMN6/Df5js2zouUsqG7I6sFxitIC+7KYK29KdXOLHdu9zL4sFnoVQnqaA==}
+
   ignore@5.3.1:
     resolution: {integrity: sha512-5Fytz/IraMjqpwfd34ke28PTVMjZjJG2MPn5t7OE4eUCUNf8BAa7b5WUS9/Qvr6mwOQS7Mk6vdsMno5he+T8Xw==}
     engines: {node: '>= 4'}
@@ -841,6 +864,9 @@ packages:
     resolution: {integrity: sha512-JmXMZ6wuvDmLiHEml9ykzqO6lwFbof0GG4IkcGaENdCRDDmMVnny7s5HsIgHCbaq0w2MyPhDqkhTUgS2LU2PHA==}
     engines: {node: '>=0.8.19'}
 
+  inherits@2.0.4:
+    resolution: {integrity: sha512-k/vGaX4/Yla3WzyMCvTQOXYeIHvqOKtnqBduzTHpzpQZzAskKMhZ2K+EnBiSM9zGSoIFeMpXKxa4dYeZIQqewQ==}
+
   is-binary-path@2.1.0:
     resolution: {integrity: sha512-ZMERYes6pDydyuGidse7OsHxtbI7WVeUEozgR/g7rd0xUimYNlvZRE/K2MgZTjWy725IfelLeVcEM97mmtRGXw==}
     engines: {node: '>=8'}
@@ -925,6 +951,10 @@ packages:
     resolution: {integrity: sha512-9hp3Vp2/hFQUiIwKo8XCeFVnrg8Pk3TYNPIR7tJADKi5YfcF7vEaK7avFHTlSy3kOKYaJQaalfEo6YuXdceBOQ==}
     engines: {node: 14 || >=16.14}
 
+  media-typer@1.1.0:
+    resolution: {integrity: sha512-aisnrDP4GNe06UcKFnV5bfMNPBUw4jsLGaWwWfnH3v02GnBuXX2MCVn5RbrWo0j3pczUilYblq7fQ7Nw2t5XKw==}
+    engines: {node: '>= 0.8'}
+
   merge-stream@2.0.0:
     resolution: {integrity: sha512-abv/qOcuPfk3URPfDzmZU1LKmuw8kT+0nIHvKrKgFrwifol/doWcdA4ZqsWQ8ENrFKkd67Mfpo/LovbIUsbt3w==}
 
@@ -962,6 +992,10 @@ packages:
   ms@2.1.2:
     resolution: {integrity: sha512-sGkPx+VjMtmA6MX27oA4FBFELFCZZ4S4XqeGOXCv68tT+jb3vk/RyaKWP0PTKyWtmLSM0b+adUTEvbs1PEaH2w==}
 
+  music-metadata@8.3.0:
+    resolution: {integrity: sha512-Mjt+Mqea2gooB+14XhJBxuGJVXrmAlWgeyBHlYRKSl7RfA92ktoJBz+fZ25zOa0yqKqg47ocNAngWE/WQOPYbw==}
+    engines: {node: ^14.13.1 || >=16.0.0}
+
   mz@2.7.0:
     resolution: {integrity: sha512-z81GNO7nnYMEhrGh9LeymoE4+Yr0Wn5McHIZMK5cfQCl+NDX08sCZgUc9/6MHni9IWuFLm1Z3HTCXu2z9fN62Q==}
 
@@ -1019,6 +1053,10 @@ packages:
     resolution: {integrity: sha512-gDKb8aZMDeD/tZWs9P6+q0J9Mwkdl6xMV8TjnGP3qJVJ06bdMgkbBlLU8IdfOsIsFz2BW1rNVT3XuNEl8zPAvw==}
     engines: {node: '>=8'}
 
+  peek-readable@5.0.0:
+    resolution: {integrity: sha512-YtCKvLUOvwtMGmrniQPdO7MwPjgkFBtFIrmfSbYmYuq3tKDV/mcfAhBth1+C3ru7uXIZasc/pHnb+YDYNkkj4A==}
+    engines: {node: '>=14.16'}
+
   picomatch@2.3.1:
     resolution: {integrity: sha512-JU3teHTNjmE2VCGFzuY8EXzCDVwEqB2a8fsIvwaStHhAWJEeVd1o1QD80CU6+ZdEXXSLbSsuLwJjkCBWqRQUVA==}
     engines: {node: '>=8.6'}
@@ -1070,6 +1108,14 @@ packages:
   queue-microtask@1.2.3:
     resolution: {integrity: sha512-NuaNSa6flKT5JaSYQzJok04JzTL1CA6aGhv5rfLW3PgqA+M2ChpZQnAC8h8i4ZFkBS8X5RqkDBHA7r4hej3K9A==}
 
+  readable-stream@3.6.2:
+    resolution: {integrity: sha512-9u/sniCrY3D5WdsERHzHE4G2YCXqoG5FTHUiCC4SIbr6XcLZBY05ya9EKjYek9O5xOAwjGq+1JdGBAS7Q9ScoA==}
+    engines: {node: '>= 6'}
+
+  readable-web-to-node-stream@3.0.2:
+    resolution: {integrity: sha512-ePeK6cc1EcKLEhJFt/AebMCLL+GgSKhuygrZ/GLaKZYEecIgIECf4UaUuaByiGtzckwR4ain9VzUh95T1exYGw==}
+    engines: {node: '>=8'}
+
   readdirp@3.6.0:
     resolution: {integrity: sha512-hOS089on8RduqdbhvQ5Z37A0ESjsqz6qnRcffsMU3495FuTdqSm+7bhJ29JvIOsBDEEnan5DPu9t3To9VRlMzA==}
     engines: {node: '>=8.10.0'}
@@ -1097,6 +1143,9 @@ packages:
   run-parallel@1.2.0:
     resolution: {integrity: sha512-5l4VyZR86LZ/lDxZTR6jqL8AFE2S0IFLMP26AbjsLVADxHdhB/c0GUsH+y39UfCi3dzz8OlQuPmnaJOMoDHQBA==}
 
+  safe-buffer@5.2.1:
+    resolution: {integrity: sha512-rp3So07KcdmmKbGvgaNxQSJr7bGVSVk5S9Eq1F+ppbRo70+YeaDxkw5Dd8NPN+GD6bjnYm2VuPuCXmpuYvmCXQ==}
+
   semver@7.6.2:
     resolution: {integrity: sha512-FNAIBWCx9qcRhoHcgcJ0gvU7SN1lYU2ZXuSfl04bSC5OpvDHFyJCjdNHomPXxjQlCBU67YW64PzY7/VIEH7F2w==}
     engines: {node: '>=10'}
@@ -1137,6 +1186,9 @@ packages:
     resolution: {integrity: sha512-HnLOCR3vjcY8beoNLtcjZ5/nxn2afmME6lhrDrebokqMap+XbeW8n9TXpPDOqdGK5qcI3oT0GKTW6wC7EMiVqA==}
     engines: {node: '>=12'}
 
+  string_decoder@1.3.0:
+    resolution: {integrity: sha512-hkRX8U1WjJFd8LsDJ2yQ/wWWxaopEsABU1XfkM8A+j0+85JAGppt16cr1Whg6KIbb4okU6Mql6BOj+uup/wKeA==}
+
   strip-ansi@6.0.1:
     resolution: {integrity: sha512-Y38VPSHcqkFrCpFnQ9vuSXmquuv5oXOKpGeT6aGrr3o3Gc9AlVa6JBfUSOCnbxGGZF+/0ooI7KrPuUSztUdU5A==}
     engines: {node: '>=8'}
@@ -1153,6 +1205,10 @@ packages:
     resolution: {integrity: sha512-6fPc+R4ihwqP6N/aIv2f1gMH8lOVtWQHoqC4yK6oSDVVocumAsfCqjkXnqiYMhmMwS/mEHLp7Vehlt3ql6lEig==}
     engines: {node: '>=8'}
 
+  strtok3@7.0.0:
+    resolution: {integrity: sha512-pQ+V+nYQdC5H3Q7qBZAz/MO6lwGhoC2gOAjuouGf/VO0m7vQRh8QNMl2Uf6SwAtzZ9bOw3UIeBukEGNJl5dtXQ==}
+    engines: {node: '>=14.16'}
+
   sucrase@3.35.0:
     resolution: {integrity: sha512-8EbVDiu9iN/nESwxeSxDKe0dunta1GOlHufmSSXxMD2z2/tMZpDMpvXQGsc+ajGo8y2uYUmixaSRUc/QPoQ0GA==}
     engines: {node: '>=16 || 14 >=14.17'}
@@ -1180,6 +1236,10 @@ packages:
     resolution: {integrity: sha512-65P7iz6X5yEr1cwcgvQxbbIw7Uk3gOy5dIdtZ4rDveLqhrdJP+Li/Hx6tyK0NEb+2GCyneCMJiGqrADCSNk8sQ==}
     engines: {node: '>=8.0'}
 
+  token-types@5.0.1:
+    resolution: {integrity: sha512-Y2fmSnZjQdDb9W4w4r1tswlMHylzWIeOKpx0aZH9BgGtACHhrk3OkT52AzwcuqTRBZtvvnTjDBh8eynMulu8Vg==}
+    engines: {node: '>=14.16'}
+
   tr46@1.0.1:
     resolution: {integrity: sha512-dTpowEjclQ7Kgx5SdBkqRzVhERQXov8/l9Ft9dVM9fmg0W0KQSVaXX9T4i6twCPNtYiZM53lpSSUAwJbFPOHxA==}
 
@@ -1238,6 +1298,9 @@ packages:
   uri-js@4.4.1:
     resolution: {integrity: sha512-7rKUyy33Q1yc98pQ1DAmLtwX109F7TIfWlW1Ydo8Wl1ii1SeHieeh0HHfPeL2fMXK6z0s8ecKs9frCuLJvndBg==}
 
+  util-deprecate@1.0.2:
+    resolution: {integrity: sha512-EPD5q1uXyFxJpCrLnCc1nHnq3gOa6DZBocAIiI2TaSCA7VCJ1UJDMagCzIkXNsUYfD1daK//LTEQ8xiIbrHtcw==}
+
   webidl-conversions@4.0.2:
     resolution: {integrity: sha512-YQ+BmxuTgd6UXZW3+ICGfyqRyHXVlD5GtQr5+qjiNW7bF0cqrzX500HVXPBOvgXb5YnzDd+h0zqyv61KUD7+Sg==}
 
@@ -1528,6 +1591,8 @@ snapshots:
     dependencies:
       '@swc/counter': 0.1.3
 
+  '@tokenizer/token@0.3.0': {}
+
   '@types/estree@1.0.5': {}
 
   '@types/fluent-ffmpeg@2.1.24':
@@ -1735,6 +1800,8 @@ snapshots:
 
   concat-map@0.0.1: {}
 
+  content-type@1.0.5: {}
+
   cross-spawn@7.0.3:
     dependencies:
       path-key: 3.1.1
@@ -1902,6 +1969,12 @@ snapshots:
     dependencies:
       flat-cache: 4.0.1
 
+  file-type@18.7.0:
+    dependencies:
+      readable-web-to-node-stream: 3.0.2
+      strtok3: 7.0.0
+      token-types: 5.0.1
+
   file-uri-to-path@1.0.0: {}
 
   fill-range@7.1.1:
@@ -1981,6 +2054,8 @@ snapshots:
 
   human-signals@2.1.0: {}
 
+  ieee754@1.2.1: {}
+
   ignore@5.3.1: {}
 
   import-fresh@3.3.0:
@@ -1990,6 +2065,8 @@ snapshots:
 
   imurmurhash@0.1.4: {}
 
+  inherits@2.0.4: {}
+
   is-binary-path@2.1.0:
     dependencies:
       binary-extensions: 2.3.0
@@ -2053,6 +2130,8 @@ snapshots:
 
   lru-cache@10.2.2: {}
 
+  media-typer@1.1.0: {}
+
   merge-stream@2.0.0: {}
 
   merge2@1.4.1: {}
@@ -2082,6 +2161,18 @@ snapshots:
 
   ms@2.1.2: {}
 
+  music-metadata@8.3.0:
+    dependencies:
+      '@tokenizer/token': 0.3.0
+      content-type: 1.0.5
+      debug: 4.3.5
+      file-type: 18.7.0
+      media-typer: 1.1.0
+      strtok3: 7.0.0
+      token-types: 5.0.1
+    transitivePeerDependencies:
+      - supports-color
+
   mz@2.7.0:
     dependencies:
       any-promise: 1.3.0
@@ -2136,6 +2227,8 @@ snapshots:
 
   path-type@4.0.0: {}
 
+  peek-readable@5.0.0: {}
+
   picomatch@2.3.1: {}
 
   pirates@4.0.6: {}
@@ -2165,6 +2258,16 @@ snapshots:
 
   queue-microtask@1.2.3: {}
 
+  readable-stream@3.6.2:
+    dependencies:
+      inherits: 2.0.4
+      string_decoder: 1.3.0
+      util-deprecate: 1.0.2
+
+  readable-web-to-node-stream@3.0.2:
+    dependencies:
+      readable-stream: 3.6.2
+
   readdirp@3.6.0:
     dependencies:
       picomatch: 2.3.1
@@ -2203,6 +2306,8 @@ snapshots:
     dependencies:
       queue-microtask: 1.2.3
 
+  safe-buffer@5.2.1: {}
+
   semver@7.6.2: {}
 
   shebang-command@2.0.0:
@@ -2241,6 +2346,10 @@ snapshots:
       emoji-regex: 9.2.2
       strip-ansi: 7.1.0
 
+  string_decoder@1.3.0:
+    dependencies:
+      safe-buffer: 5.2.1
+
   strip-ansi@6.0.1:
     dependencies:
       ansi-regex: 5.0.1
@@ -2253,6 +2362,11 @@ snapshots:
 
   strip-json-comments@3.1.1: {}
 
+  strtok3@7.0.0:
+    dependencies:
+      '@tokenizer/token': 0.3.0
+      peek-readable: 5.0.0
+
   sucrase@3.35.0:
     dependencies:
       '@jridgewell/gen-mapping': 0.3.5
@@ -2286,6 +2400,11 @@ snapshots:
     dependencies:
       is-number: 7.0.0
 
+  token-types@5.0.1:
+    dependencies:
+      '@tokenizer/token': 0.3.0
+      ieee754: 1.2.1
+
   tr46@1.0.1:
     dependencies:
       punycode: 2.3.1
@@ -2342,6 +2461,8 @@ snapshots:
     dependencies:
       punycode: 2.3.1
 
+  util-deprecate@1.0.2: {}
+
   webidl-conversions@4.0.2: {}
 
   whatwg-url@7.1.0:

src/index.ts

@@ -1,5 +1,8 @@
-import { stream } from "./stream";
+import { Player, createPlayer } from "./player";
+
+export { Player, createPlayer };
 
 export default {
-    stream,
+    Player,
+    createPlayer,
 };

src/player/index.ts

@@ -0,0 +1,50 @@
+import { Readable, Stream } from "stream";
+import { Provider } from "../providers/base";
+import { SeekableStream } from "../utils/SeekableStream";
+
+export class Player {
+    private providers: Provider[];
+    private currentProvider: Provider | null = null;
+
+    public _stream: SeekableStream | null = null;
+
+    get stream() {
+        return this._stream?.stream;
+    }
+
+    constructor(providers: Provider[]) {
+        this.providers = providers;
+    }
+
+    public async play(url: string) {
+        if (!this.currentProvider) {
+            const providers = this.providers.filter((provider) =>
+                provider.canPlay(url),
+            );
+
+            if (providers.length === 0) {
+                throw new Error("No provider can play this URL");
+            }
+
+            this.currentProvider = providers[0];
+        }
+
+        // TODO: Handle if already playing
+
+        const information = await this.currentProvider.getInformation(url);
+        //console.log(information);
+
+        if (information.livestream)
+            // TODO: Implement livestreams
+            throw new Error("Livestreams are not supported yet");
+        else this._stream = new SeekableStream(information, url);
+    }
+
+    public getCurrentSampleRate() {
+        return this._stream?.information.bitrate || 0;
+    }
+}
+
+export function createPlayer(providers: Provider[]) {
+    return new Player(providers);
+}

src/providers/base.ts

@@ -0,0 +1,17 @@
+export interface AudioInformation {
+    url: string;
+    fileSize: number;
+    duration: number;
+    indexRange: {
+        start: number;
+        end: number;
+    };
+    bitrate: number;
+    livestream: boolean;
+    refreshInfoFunction: () => Promise<AudioInformation>;
+}
+
+export abstract class Provider {
+    abstract canPlay(url: string): boolean;
+    abstract getInformation(url: string): Promise<AudioInformation>;
+}

src/providers/index.ts

@@ -0,0 +1,7 @@
+import { YtDlpProvider } from "./yt-dlp";
+
+export default {
+    YtDlpProvider,
+};
+
+export { YtDlpProvider };

src/providers/yt-dlp.ts

@@ -0,0 +1,49 @@
+import YTDlpWrap from "yt-dlp-wrap";
+import { AudioInformation, Provider } from "./base";
+import { getYouTubeFormats } from "../utils/Request";
+
+export class YtDlpProvider extends Provider {
+    public ytDlpWrap = new YTDlpWrap();
+
+    public canPlay(url: string) {
+        // TODO: Implement this
+        return true;
+    }
+
+    public async getInformation(url: string) {
+        const getYtDlpWrapInfo = async () => {
+            return JSON.parse(
+                await this.ytDlpWrap.execPromise([
+                    url,
+                    "-f",
+                    "bestaudio[ext=webm]",
+                    //"--extractor-args",
+                    //"youtube:player_client=ios",
+                    "--dump-json",
+                ]),
+            );
+        };
+
+        const refreshInfoFunction = async () => {
+            const ytDlpWrapInfo = await getYtDlpWrapInfo();
+
+            const formats = await getYouTubeFormats(ytDlpWrapInfo.id);
+            if (!formats) {
+                throw new Error("Failed to parse YouTube formats");
+            }
+
+            return {
+                url: ytDlpWrapInfo.url,
+                fileSize: ytDlpWrapInfo.filesize,
+                duration: ytDlpWrapInfo.duration,
+                indexRange: formats[0].indexRange,
+                // TODO: Check if this is correct
+                bitrate: ytDlpWrapInfo.asr, //bitrate: Math.ceil((ytDlpWrapInfo.tbr || 128) * 1000),
+                livestream: ytDlpWrapInfo.is_live,
+                refreshInfoFunction,
+            } as AudioInformation;
+        };
+
+        return await refreshInfoFunction();
+    }
+}

src/stream.ts

@@ -1,105 +0,0 @@
-import { Readable } from "stream";
-import playdl from "play-dl/play-dl";
-import YTDlpWrap from "yt-dlp-wrap";
-import { Stream } from "./utils/stream";
-
-const ytDlpWrap = new YTDlpWrap();
-
-export const stream = async (url: string): Promise<Readable> => {
-    const getPlayDlInfo = async () => {
-        const info = await playdl.video_basic_info(url);
-        if (!info.format) {
-            throw new Error("No stream URL found");
-        }
-
-        for (const format of info.format) {
-            if (format.itag === 140) {
-                console.log("format", format);
-                if (
-                    !format.url ||
-                    !format.contentLength ||
-                    !format.approxDurationMs
-                ) {
-                    continue;
-                }
-
-                type DefinedFormat = typeof format & {
-                    url: string;
-                    contentLength: number;
-                    approxDurationMs: number;
-                };
-
-                const newFormat: DefinedFormat = format as DefinedFormat;
-                return newFormat;
-            }
-        }
-
-        throw new Error("No stream URL found");
-    };
-
-    const getYtDlpWrapInfo = async () => {
-        return JSON.parse(
-            await ytDlpWrap.execPromise([
-                url,
-                "-f",
-                "140",
-                "--extractor-args",
-                "youtube:player_client=ios",
-                "--dump-json",
-            ]),
-        );
-    };
-
-    const ytDlpWrapInfo = await getYtDlpWrapInfo();
-    const playDlInfo = await getPlayDlInfo();
-    console.log("dlp", ytDlpWrapInfo.url);
-    console.log("play-dl", playDlInfo);
-
-    const ytDlpRefreshStreamUrlFunction = async () => {
-        const info = await getYtDlpWrapInfo();
-        return info.url;
-    };
-
-    const playDlRefreshStreamUrlFunction = async () => {
-        const info = await getPlayDlInfo();
-        if (!info.url) throw new Error("No stream URL found");
-
-        return info.url;
-    };
-
-    const ytDlpWrapStream = new Stream(
-        ytDlpWrapInfo.url,
-        url,
-        ytDlpWrapInfo.filesize,
-        ytDlpWrapInfo.duration,
-        ytDlpRefreshStreamUrlFunction,
-    );
-
-    const playDlStream = new Stream(
-        playDlInfo.url,
-        url,
-        playDlInfo.contentLength,
-        Math.ceil(playDlInfo.approxDurationMs / 1000),
-        playDlRefreshStreamUrlFunction,
-    );
-
-    const stream = playDlStream.stream;
-
-    // stream.on("error", (err) => {
-    //     console.error("An error occurred:", err.message);
-    // });
-
-    // stream.on("end", () => {
-    //     console.log("Stream ended.");
-    // });
-
-    // stream.on("close", () => {
-    //     console.log("Stream closed.");
-    // });
-
-    stream.on("finished", () => {
-        console.log("Stream finished.");
-    });
-
-    return stream;
-};

src/utils/Request.ts

@@ -0,0 +1,91 @@
+import axios, { AxiosRequestConfig, AxiosResponse } from "axios";
+
+export async function makeStreamRequest(
+    url: string,
+    options: AxiosRequestConfig = {},
+    body?: any,
+): Promise<AxiosResponse> {
+    const { headers = {}, method = "GET" } = options;
+
+    let config: AxiosRequestConfig = {
+        url,
+        method,
+        headers,
+        data: body,
+        responseType: "stream",
+    };
+
+    // Override / Add config
+    config = Object.assign(config, options);
+
+    try {
+        const response = await axios(config);
+        return response;
+    } catch (err) {
+        throw err;
+    }
+}
+
+export async function getStream(
+    url: string,
+    options: AxiosRequestConfig = { method: "GET" },
+): Promise<AxiosResponse<any, any>> {
+    try {
+        let response = await makeStreamRequest(url, options);
+        const visitedUrls = new Set<string>();
+
+        // Handle redirection and detect redirection loop
+        while (
+            response.status >= 300 &&
+            response.status < 400 &&
+            response.headers.location
+        ) {
+            const redirectUrl = response.headers.location;
+            if (visitedUrls.has(redirectUrl)) {
+                throw new Error("Redirection loop detected");
+            }
+            visitedUrls.add(redirectUrl);
+            response = await makeStreamRequest(redirectUrl, options);
+        }
+
+        return response;
+    } catch (error) {
+        throw error;
+    }
+}
+
+export async function getYouTubeFormats(id: string) {
+    const new_url = `https://www.youtube.com/watch?v=${id}&has_verified=1`;
+    const response = await axios.get(new_url, {
+        headers: { "accept-language": "en-US,en;q=0.9" },
+        withCredentials: true,
+    });
+    const body = response.data;
+
+    const match = body.match(
+        /var ytInitialPlayerResponse = (.*?)(?=;\s*<\/script>)/,
+    );
+    const data = match ? match[1] : null;
+    if (!data) throw new Error("Failed to get YouTube formats");
+
+    try {
+        let formats = JSON.parse(data).streamingData.adaptiveFormats;
+        if (!formats) throw new Error("Failed to parse YouTube formats");
+
+        // Filters only audio formats that are webm
+        formats = formats.filter((format: any) =>
+            format.mimeType.startsWith("audio/webm;"),
+        );
+
+        // Sort the quality of the formats
+        formats = formats.sort((a: any, b: any) => {
+            const aQuality = a.audioQuality === "AUDIO_QUALITY_MEDIUM" ? 0 : 1;
+            const bQuality = b.audioQuality === "AUDIO_QUALITY_MEDIUM" ? 0 : 1;
+            return aQuality - bQuality;
+        });
+
+        return formats;
+    } catch (err) {
+        throw new Error("Failed to parse YouTube formats");
+    }
+}

src/utils/SeekableStream.ts

@@ -0,0 +1,202 @@
+import { Readable } from "stream";
+import { AudioInformation } from "../providers/base";
+import { Timer } from "./Timer";
+import { WebmSeeker } from "./WebmSeeker";
+import { getStream } from "./Request";
+
+const DEBUG_SIMULATE_FAILURE = false;
+
+export class SeekableStream {
+    private id: string;
+    public information: AudioInformation;
+    private referenceUrl: string;
+
+    public stream: WebmSeeker;
+
+    private timer: Timer;
+    private ticking: boolean = false;
+    private locked: boolean = false;
+    private destroyed: boolean = false;
+
+    private bytesReceived: number = 0;
+    private bytesRead: number = 0;
+    private bytesPerRequestLimit = 1 * 1024 * 1024; // 1 MB per request
+
+    constructor(information: AudioInformation, referenceUrl: string) {
+        this.id = Math.random().toString(36).substring(8);
+        this.information = information;
+        this.referenceUrl = referenceUrl;
+
+        this.stream = new WebmSeeker(0, {
+            highWaterMark: 5 * 1024 * 1024,
+        });
+
+        this.stream.on("data", (chunk: any) => {
+            this.bytesRead += chunk.length;
+        });
+
+        this.timer = new Timer(() => {
+            if (this.ticking) return;
+            this.ticking = true;
+            this.timer.reset();
+            this.tick();
+            this.ticking = false;
+        }, 2000);
+
+        this.timer.start();
+        this.tick();
+    }
+
+    private async tick() {
+        console.log(`[${this.id}] > Ticking...`);
+
+        if (this.destroyed) {
+            console.debug(
+                `[${this.id}] > Stream already destroyed, not ticking`,
+            );
+            this.destroy();
+            return;
+        }
+
+        this.debugLog();
+
+        const isBufferSufficient =
+            this.stream.readableLength >= this.bytesPerRequestLimit;
+
+        if (!this.locked) {
+            if (
+                !isBufferSufficient &&
+                this.bytesReceived < this.information.fileSize
+            ) {
+                this.locked = true;
+
+                const end = Math.min(
+                    this.bytesReceived + this.bytesPerRequestLimit,
+                    this.information.fileSize,
+                );
+                const rangeHeader = `bytes=${this.bytesReceived}-${end}`;
+                const request = await getStream(this.information.url, {
+                    headers: {
+                        range: rangeHeader,
+                    },
+                }).catch((err: Error) => err);
+
+                console.debug(
+                    `[${this.id}] > Requesting range | ${rangeHeader}`,
+                );
+
+                if (request instanceof Error) {
+                    console.debug(
+                        `[${this.id}] > Request error: ${request.message}`,
+                    );
+                    await this.refreshInformation();
+                    this.locked = false;
+                    this.timer.reset();
+                    this.tick();
+                    return;
+                }
+
+                // Simulate failed request 25% of the time
+                if (DEBUG_SIMULATE_FAILURE && Math.random() < 0.25) {
+                    console.debug(`[${this.id}] > Simulating request failure`);
+                    request.status = 416;
+                }
+
+                if (request.status >= 400) {
+                    console.debug(
+                        `[${this.id}] > Request failed with status ${request.status}`,
+                    );
+                    await this.refreshInformation();
+                    this.locked = false;
+                    this.timer.reset();
+                    this.tick();
+                    return;
+                }
+
+                if (!request.data) {
+                    this.locked = false;
+                    return;
+                }
+
+                console.debug(`[${this.id}] > Request successful`);
+
+                const incomingStream = request.data;
+
+                incomingStream.on("data", (chunk: any) => {
+                    this.stream.push(chunk);
+                    this.bytesReceived += chunk.length;
+                });
+
+                incomingStream.once("error", async () => {
+                    console.debug(`[${this.id}] > Pipe error, refreshing...`);
+                    this.destroy();
+                    await this.refreshInformation();
+                    this.timer.reset();
+                    this.tick();
+                });
+
+                incomingStream.on("end", async () => {
+                    console.debug(
+                        `[${this.id}] > Full chunk received, unlocking`,
+                    );
+                    this.locked = false;
+                    incomingStream.destroy();
+                    this.debugLog();
+                });
+            }
+        }
+
+        if (
+            this.bytesReceived >= this.information.fileSize &&
+            this.stream.readableLength === 0
+        ) {
+            console.debug(`[${this.id}] > Stream completed`);
+            this.destroy();
+            return;
+        }
+
+        console.debug(`[${this.id}] > Tick completed`);
+    }
+
+    private getCurrentTimestamp() {
+        // TODO: Calculate more accurately
+        const realBitrate =
+            this.information.fileSize / this.information.duration;
+        const currentTime = this.bytesRead / realBitrate;
+        return currentTime;
+    }
+
+    private async refreshInformation() {
+        console.debug(`[${this.id}] > Refreshing stream info...`);
+        let information = await this.information.refreshInfoFunction();
+        this.information = information;
+        console.debug(`[${this.id}] > Stream info refreshed`);
+    }
+
+    public on(event: string, listener: (...args: any[]) => void) {
+        this.stream.on(event, listener);
+    }
+
+    private destroy() {
+        console.debug(`[${this.id}] > Stream destroyed`);
+        if (!this.timer.isDestroyed()) this.timer.destroy();
+        if (this.stream) this.stream.destroy();
+        this.destroyed = true;
+    }
+
+    private debugLog() {
+        //        console.debug("Tick");
+        const isBufferSufficient =
+            this.stream.readableLength >= this.bytesPerRequestLimit;
+        console.debug(
+            `[${this.id}] > ` +
+                `Timestamp: ${this.getCurrentTimestamp().toFixed(1)}s / ${this.information.duration.toFixed(1)}s | ` +
+                `Data Received: ${(this.bytesReceived / (1024 * 1024)).toFixed(3)} MB / ${(this.information.fileSize / (1024 * 1024)).toFixed(3)} MB | ` +
+                `Data Read: ${(this.bytesRead / (1024 * 1024)).toFixed(3)} MB | ` +
+                `Buffer Remaining: ${(this.stream.readableLength / (1024 * 1024)).toFixed(3)} MB | ` +
+                `${!false ? `Buffer Sufficient: ${isBufferSufficient} | ` : ``}` +
+                `Locked: ${this.locked} | `, // +
+            //`Fetch Completed: ${this.fetchCompleted}`,
+        );
+    }
+}

src/utils/WebmSeeker.ts

@@ -0,0 +1,988 @@
+/*
+    GPL-3.0 License
+    This file is modified from the original file of the play-dl project.
+    https://github.com/play-dl/play-dl/blob/main/play-dl/YouTube/classes/WebmSeeker.ts
+
+    License URL: https://github.com/play-dl/play-dl/blob/main/LICENSE
+
+                        GNU GENERAL PUBLIC LICENSE
+                        Version 3, 29 June 2007
+
+    Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
+    Everyone is permitted to copy and distribute verbatim copies
+    of this license document, but changing it is not allowed.
+
+                                Preamble
+
+    The GNU General Public License is a free, copyleft license for
+    software and other kinds of works.
+
+    The licenses for most software and other practical works are designed
+    to take away your freedom to share and change the works.  By contrast,
+    the GNU General Public License is intended to guarantee your freedom to
+    share and change all versions of a program--to make sure it remains free
+    software for all its users.  We, the Free Software Foundation, use the
+    GNU General Public License for most of our software; it applies also to
+    any other work released this way by its authors.  You can apply it to
+    your programs, too.
+
+    When we speak of free software, we are referring to freedom, not
+    price.  Our General Public Licenses are designed to make sure that you
+    have the freedom to distribute copies of free software (and charge for
+    them if you wish), that you receive source code or can get it if you
+    want it, that you can change the software or use pieces of it in new
+    free programs, and that you know you can do these things.
+
+    To protect your rights, we need to prevent others from denying you
+    these rights or asking you to surrender the rights.  Therefore, you have
+    certain responsibilities if you distribute copies of the software, or if
+    you modify it: responsibilities to respect the freedom of others.
+
+    For example, if you distribute copies of such a program, whether
+    gratis or for a fee, you must pass on to the recipients the same
+    freedoms that you received.  You must make sure that they, too, receive
+    or can get the source code.  And you must show them these terms so they
+    know their rights.
+
+    Developers that use the GNU GPL protect your rights with two steps:
+    (1) assert copyright on the software, and (2) offer you this License
+    giving you legal permission to copy, distribute and/or modify it.
+
+    For the developers' and authors' protection, the GPL clearly explains
+    that there is no warranty for this free software.  For both users' and
+    authors' sake, the GPL requires that modified versions be marked as
+    changed, so that their problems will not be attributed erroneously to
+    authors of previous versions.
+
+    Some devices are designed to deny users access to install or run
+    modified versions of the software inside them, although the manufacturer
+    can do so.  This is fundamentally incompatible with the aim of
+    protecting users' freedom to change the software.  The systematic
+    pattern of such abuse occurs in the area of products for individuals to
+    use, which is precisely where it is most unacceptable.  Therefore, we
+    have designed this version of the GPL to prohibit the practice for those
+    products.  If such problems arise substantially in other domains, we
+    stand ready to extend this provision to those domains in future versions
+    of the GPL, as needed to protect the freedom of users.
+
+    Finally, every program is threatened constantly by software patents.
+    States should not allow patents to restrict development and use of
+    software on general-purpose computers, but in those that do, we wish to
+    avoid the special danger that patents applied to a free program could
+    make it effectively proprietary.  To prevent this, the GPL assures that
+    patents cannot be used to render the program non-free.
+
+    The precise terms and conditions for copying, distribution and
+    modification follow.
+
+                        TERMS AND CONDITIONS
+
+    0. Definitions.
+
+    "This License" refers to version 3 of the GNU General Public License.
+
+    "Copyright" also means copyright-like laws that apply to other kinds of
+    works, such as semiconductor masks.
+
+    "The Program" refers to any copyrightable work licensed under this
+    License.  Each licensee is addressed as "you".  "Licensees" and
+    "recipients" may be individuals or organizations.
+
+    To "modify" a work means to copy from or adapt all or part of the work
+    in a fashion requiring copyright permission, other than the making of an
+    exact copy.  The resulting work is called a "modified version" of the
+    earlier work or a work "based on" the earlier work.
+
+    A "covered work" means either the unmodified Program or a work based
+    on the Program.
+
+    To "propagate" a work means to do anything with it that, without
+    permission, would make you directly or secondarily liable for
+    infringement under applicable copyright law, except executing it on a
+    computer or modifying a private copy.  Propagation includes copying,
+    distribution (with or without modification), making available to the
+    public, and in some countries other activities as well.
+
+    To "convey" a work means any kind of propagation that enables other
+    parties to make or receive copies.  Mere interaction with a user through
+    a computer network, with no transfer of a copy, is not conveying.
+
+    An interactive user interface displays "Appropriate Legal Notices"
+    to the extent that it includes a convenient and prominently visible
+    feature that (1) displays an appropriate copyright notice, and (2)
+    tells the user that there is no warranty for the work (except to the
+    extent that warranties are provided), that licensees may convey the
+    work under this License, and how to view a copy of this License.  If
+    the interface presents a list of user commands or options, such as a
+    menu, a prominent item in the list meets this criterion.
+
+    1. Source Code.
+
+    The "source code" for a work means the preferred form of the work
+    for making modifications to it.  "Object code" means any non-source
+    form of a work.
+
+    A "Standard Interface" means an interface that either is an official
+    standard defined by a recognized standards body, or, in the case of
+    interfaces specified for a particular programming language, one that
+    is widely used among developers working in that language.
+
+    The "System Libraries" of an executable work include anything, other
+    than the work as a whole, that (a) is included in the normal form of
+    packaging a Major Component, but which is not part of that Major
+    Component, and (b) serves only to enable use of the work with that
+    Major Component, or to implement a Standard Interface for which an
+    implementation is available to the public in source code form.  A
+    "Major Component", in this context, means a major essential component
+    (kernel, window system, and so on) of the specific operating system
+    (if any) on which the executable work runs, or a compiler used to
+    produce the work, or an object code interpreter used to run it.
+
+    The "Corresponding Source" for a work in object code form means all
+    the source code needed to generate, install, and (for an executable
+    work) run the object code and to modify the work, including scripts to
+    control those activities.  However, it does not include the work's
+    System Libraries, or general-purpose tools or generally available free
+    programs which are used unmodified in performing those activities but
+    which are not part of the work.  For example, Corresponding Source
+    includes interface definition files associated with source files for
+    the work, and the source code for shared libraries and dynamically
+    linked subprograms that the work is specifically designed to require,
+    such as by intimate data communication or control flow between those
+    subprograms and other parts of the work.
+
+    The Corresponding Source need not include anything that users
+    can regenerate automatically from other parts of the Corresponding
+    Source.
+
+    The Corresponding Source for a work in source code form is that
+    same work.
+
+    2. Basic Permissions.
+
+    All rights granted under this License are granted for the term of
+    copyright on the Program, and are irrevocable provided the stated
+    conditions are met.  This License explicitly affirms your unlimited
+    permission to run the unmodified Program.  The output from running a
+    covered work is covered by this License only if the output, given its
+    content, constitutes a covered work.  This License acknowledges your
+    rights of fair use or other equivalent, as provided by copyright law.
+
+    You may make, run and propagate covered works that you do not
+    convey, without conditions so long as your license otherwise remains
+    in force.  You may convey covered works to others for the sole purpose
+    of having them make modifications exclusively for you, or provide you
+    with facilities for running those works, provided that you comply with
+    the terms of this License in conveying all material for which you do
+    not control copyright.  Those thus making or running the covered works
+    for you must do so exclusively on your behalf, under your direction
+    and control, on terms that prohibit them from making any copies of
+    your copyrighted material outside their relationship with you.
+
+    Conveying under any other circumstances is permitted solely under
+    the conditions stated below.  Sublicensing is not allowed; section 10
+    makes it unnecessary.
+
+    3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+    No covered work shall be deemed part of an effective technological
+    measure under any applicable law fulfilling obligations under article
+    11 of the WIPO copyright treaty adopted on 20 December 1996, or
+    similar laws prohibiting or restricting circumvention of such
+    measures.
+
+    When you convey a covered work, you waive any legal power to forbid
+    circumvention of technological measures to the extent such circumvention
+    is effected by exercising rights under this License with respect to
+    the covered work, and you disclaim any intention to limit operation or
+    modification of the work as a means of enforcing, against the work's
+    users, your or third parties' legal rights to forbid circumvention of
+    technological measures.
+
+    4. Conveying Verbatim Copies.
+
+    You may convey verbatim copies of the Program's source code as you
+    receive it, in any medium, provided that you conspicuously and
+    appropriately publish on each copy an appropriate copyright notice;
+    keep intact all notices stating that this License and any
+    non-permissive terms added in accord with section 7 apply to the code;
+    keep intact all notices of the absence of any warranty; and give all
+    recipients a copy of this License along with the Program.
+
+    You may charge any price or no price for each copy that you convey,
+    and you may offer support or warranty protection for a fee.
+
+    5. Conveying Modified Source Versions.
+
+    You may convey a work based on the Program, or the modifications to
+    produce it from the Program, in the form of source code under the
+    terms of section 4, provided that you also meet all of these conditions:
+
+        a) The work must carry prominent notices stating that you modified
+        it, and giving a relevant date.
+
+        b) The work must carry prominent notices stating that it is
+        released under this License and any conditions added under section
+        7.  This requirement modifies the requirement in section 4 to
+        "keep intact all notices".
+
+        c) You must license the entire work, as a whole, under this
+        License to anyone who comes into possession of a copy.  This
+        License will therefore apply, along with any applicable section 7
+        additional terms, to the whole of the work, and all its parts,
+        regardless of how they are packaged.  This License gives no
+        permission to license the work in any other way, but it does not
+        invalidate such permission if you have separately received it.
+
+        d) If the work has interactive user interfaces, each must display
+        Appropriate Legal Notices; however, if the Program has interactive
+        interfaces that do not display Appropriate Legal Notices, your
+        work need not make them do so.
+
+    A compilation of a covered work with other separate and independent
+    works, which are not by their nature extensions of the covered work,
+    and which are not combined with it such as to form a larger program,
+    in or on a volume of a storage or distribution medium, is called an
+    "aggregate" if the compilation and its resulting copyright are not
+    used to limit the access or legal rights of the compilation's users
+    beyond what the individual works permit.  Inclusion of a covered work
+    in an aggregate does not cause this License to apply to the other
+    parts of the aggregate.
+
+    6. Conveying Non-Source Forms.
+
+    You may convey a covered work in object code form under the terms
+    of sections 4 and 5, provided that you also convey the
+    machine-readable Corresponding Source under the terms of this License,
+    in one of these ways:
+
+        a) Convey the object code in, or embodied in, a physical product
+        (including a physical distribution medium), accompanied by the
+        Corresponding Source fixed on a durable physical medium
+        customarily used for software interchange.
+
+        b) Convey the object code in, or embodied in, a physical product
+        (including a physical distribution medium), accompanied by a
+        written offer, valid for at least three years and valid for as
+        long as you offer spare parts or customer support for that product
+        model, to give anyone who possesses the object code either (1) a
+        copy of the Corresponding Source for all the software in the
+        product that is covered by this License, on a durable physical
+        medium customarily used for software interchange, for a price no
+        more than your reasonable cost of physically performing this
+        conveying of source, or (2) access to copy the
+        Corresponding Source from a network server at no charge.
+
+        c) Convey individual copies of the object code with a copy of the
+        written offer to provide the Corresponding Source.  This
+        alternative is allowed only occasionally and noncommercially, and
+        only if you received the object code with such an offer, in accord
+        with subsection 6b.
+
+        d) Convey the object code by offering access from a designated
+        place (gratis or for a charge), and offer equivalent access to the
+        Corresponding Source in the same way through the same place at no
+        further charge.  You need not require recipients to copy the
+        Corresponding Source along with the object code.  If the place to
+        copy the object code is a network server, the Corresponding Source
+        may be on a different server (operated by you or a third party)
+        that supports equivalent copying facilities, provided you maintain
+        clear directions next to the object code saying where to find the
+        Corresponding Source.  Regardless of what server hosts the
+        Corresponding Source, you remain obligated to ensure that it is
+        available for as long as needed to satisfy these requirements.
+
+        e) Convey the object code using peer-to-peer transmission, provided
+        you inform other peers where the object code and Corresponding
+        Source of the work are being offered to the general public at no
+        charge under subsection 6d.
+
+    A separable portion of the object code, whose source code is excluded
+    from the Corresponding Source as a System Library, need not be
+    included in conveying the object code work.
+
+    A "User Product" is either (1) a "consumer product", which means any
+    tangible personal property which is normally used for personal, family,
+    or household purposes, or (2) anything designed or sold for incorporation
+    into a dwelling.  In determining whether a product is a consumer product,
+    doubtful cases shall be resolved in favor of coverage.  For a particular
+    product received by a particular user, "normally used" refers to a
+    typical or common use of that class of product, regardless of the status
+    of the particular user or of the way in which the particular user
+    actually uses, or expects or is expected to use, the product.  A product
+    is a consumer product regardless of whether the product has substantial
+    commercial, industrial or non-consumer uses, unless such uses represent
+    the only significant mode of use of the product.
+
+    "Installation Information" for a User Product means any methods,
+    procedures, authorization keys, or other information required to install
+    and execute modified versions of a covered work in that User Product from
+    a modified version of its Corresponding Source.  The information must
+    suffice to ensure that the continued functioning of the modified object
+    code is in no case prevented or interfered with solely because
+    modification has been made.
+
+    If you convey an object code work under this section in, or with, or
+    specifically for use in, a User Product, and the conveying occurs as
+    part of a transaction in which the right of possession and use of the
+    User Product is transferred to the recipient in perpetuity or for a
+    fixed term (regardless of how the transaction is characterized), the
+    Corresponding Source conveyed under this section must be accompanied
+    by the Installation Information.  But this requirement does not apply
+    if neither you nor any third party retains the ability to install
+    modified object code on the User Product (for example, the work has
+    been installed in ROM).
+
+    The requirement to provide Installation Information does not include a
+    requirement to continue to provide support service, warranty, or updates
+    for a work that has been modified or installed by the recipient, or for
+    the User Product in which it has been modified or installed.  Access to a
+    network may be denied when the modification itself materially and
+    adversely affects the operation of the network or violates the rules and
+    protocols for communication across the network.
+
+    Corresponding Source conveyed, and Installation Information provided,
+    in accord with this section must be in a format that is publicly
+    documented (and with an implementation available to the public in
+    source code form), and must require no special password or key for
+    unpacking, reading or copying.
+
+    7. Additional Terms.
+
+    "Additional permissions" are terms that supplement the terms of this
+    License by making exceptions from one or more of its conditions.
+    Additional permissions that are applicable to the entire Program shall
+    be treated as though they were included in this License, to the extent
+    that they are valid under applicable law.  If additional permissions
+    apply only to part of the Program, that part may be used separately
+    under those permissions, but the entire Program remains governed by
+    this License without regard to the additional permissions.
+
+    When you convey a copy of a covered work, you may at your option
+    remove any additional permissions from that copy, or from any part of
+    it.  (Additional permissions may be written to require their own
+    removal in certain cases when you modify the work.)  You may place
+    additional permissions on material, added by you to a covered work,
+    for which you have or can give appropriate copyright permission.
+
+    Notwithstanding any other provision of this License, for material you
+    add to a covered work, you may (if authorized by the copyright holders of
+    that material) supplement the terms of this License with terms:
+
+        a) Disclaiming warranty or limiting liability differently from the
+        terms of sections 15 and 16 of this License; or
+
+        b) Requiring preservation of specified reasonable legal notices or
+        author attributions in that material or in the Appropriate Legal
+        Notices displayed by works containing it; or
+
+        c) Prohibiting misrepresentation of the origin of that material, or
+        requiring that modified versions of such material be marked in
+        reasonable ways as different from the original version; or
+
+        d) Limiting the use for publicity purposes of names of licensors or
+        authors of the material; or
+
+        e) Declining to grant rights under trademark law for use of some
+        trade names, trademarks, or service marks; or
+
+        f) Requiring indemnification of licensors and authors of that
+        material by anyone who conveys the material (or modified versions of
+        it) with contractual assumptions of liability to the recipient, for
+        any liability that these contractual assumptions directly impose on
+        those licensors and authors.
+
+    All other non-permissive additional terms are considered "further
+    restrictions" within the meaning of section 10.  If the Program as you
+    received it, or any part of it, contains a notice stating that it is
+    governed by this License along with a term that is a further
+    restriction, you may remove that term.  If a license document contains
+    a further restriction but permits relicensing or conveying under this
+    License, you may add to a covered work material governed by the terms
+    of that license document, provided that the further restriction does
+    not survive such relicensing or conveying.
+
+    If you add terms to a covered work in accord with this section, you
+    must place, in the relevant source files, a statement of the
+    additional terms that apply to those files, or a notice indicating
+    where to find the applicable terms.
+
+    Additional terms, permissive or non-permissive, may be stated in the
+    form of a separately written license, or stated as exceptions;
+    the above requirements apply either way.
+
+    8. Termination.
+
+    You may not propagate or modify a covered work except as expressly
+    provided under this License.  Any attempt otherwise to propagate or
+    modify it is void, and will automatically terminate your rights under
+    this License (including any patent licenses granted under the third
+    paragraph of section 11).
+
+    However, if you cease all violation of this License, then your
+    license from a particular copyright holder is reinstated (a)
+    provisionally, unless and until the copyright holder explicitly and
+    finally terminates your license, and (b) permanently, if the copyright
+    holder fails to notify you of the violation by some reasonable means
+    prior to 60 days after the cessation.
+
+    Moreover, your license from a particular copyright holder is
+    reinstated permanently if the copyright holder notifies you of the
+    violation by some reasonable means, this is the first time you have
+    received notice of violation of this License (for any work) from that
+    copyright holder, and you cure the violation prior to 30 days after
+    your receipt of the notice.
+
+    Termination of your rights under this section does not terminate the
+    licenses of parties who have received copies or rights from you under
+    this License.  If your rights have been terminated and not permanently
+    reinstated, you do not qualify to receive new licenses for the same
+    material under section 10.
+
+    9. Acceptance Not Required for Having Copies.
+
+    You are not required to accept this License in order to receive or
+    run a copy of the Program.  Ancillary propagation of a covered work
+    occurring solely as a consequence of using peer-to-peer transmission
+    to receive a copy likewise does not require acceptance.  However,
+    nothing other than this License grants you permission to propagate or
+    modify any covered work.  These actions infringe copyright if you do
+    not accept this License.  Therefore, by modifying or propagating a
+    covered work, you indicate your acceptance of this License to do so.
+
+    10. Automatic Licensing of Downstream Recipients.
+
+    Each time you convey a covered work, the recipient automatically
+    receives a license from the original licensors, to run, modify and
+    propagate that work, subject to this License.  You are not responsible
+    for enforcing compliance by third parties with this License.
+
+    An "entity transaction" is a transaction transferring control of an
+    organization, or substantially all assets of one, or subdividing an
+    organization, or merging organizations.  If propagation of a covered
+    work results from an entity transaction, each party to that
+    transaction who receives a copy of the work also receives whatever
+    licenses to the work the party's predecessor in interest had or could
+    give under the previous paragraph, plus a right to possession of the
+    Corresponding Source of the work from the predecessor in interest, if
+    the predecessor has it or can get it with reasonable efforts.
+
+    You may not impose any further restrictions on the exercise of the
+    rights granted or affirmed under this License.  For example, you may
+    not impose a license fee, royalty, or other charge for exercise of
+    rights granted under this License, and you may not initiate litigation
+    (including a cross-claim or counterclaim in a lawsuit) alleging that
+    any patent claim is infringed by making, using, selling, offering for
+    sale, or importing the Program or any portion of it.
+
+    11. Patents.
+
+    A "contributor" is a copyright holder who authorizes use under this
+    License of the Program or a work on which the Program is based.  The
+    work thus licensed is called the contributor's "contributor version".
+
+    A contributor's "essential patent claims" are all patent claims
+    owned or controlled by the contributor, whether already acquired or
+    hereafter acquired, that would be infringed by some manner, permitted
+    by this License, of making, using, or selling its contributor version,
+    but do not include claims that would be infringed only as a
+    consequence of further modification of the contributor version.  For
+    purposes of this definition, "control" includes the right to grant
+    patent sublicenses in a manner consistent with the requirements of
+    this License.
+
+    Each contributor grants you a non-exclusive, worldwide, royalty-free
+    patent license under the contributor's essential patent claims, to
+    make, use, sell, offer for sale, import and otherwise run, modify and
+    propagate the contents of its contributor version.
+
+    In the following three paragraphs, a "patent license" is any express
+    agreement or commitment, however denominated, not to enforce a patent
+    (such as an express permission to practice a patent or covenant not to
+    sue for patent infringement).  To "grant" such a patent license to a
+    party means to make such an agreement or commitment not to enforce a
+    patent against the party.
+
+    If you convey a covered work, knowingly relying on a patent license,
+    and the Corresponding Source of the work is not available for anyone
+    to copy, free of charge and under the terms of this License, through a
+    publicly available network server or other readily accessible means,
+    then you must either (1) cause the Corresponding Source to be so
+    available, or (2) arrange to deprive yourself of the benefit of the
+    patent license for this particular work, or (3) arrange, in a manner
+    consistent with the requirements of this License, to extend the patent
+    license to downstream recipients.  "Knowingly relying" means you have
+    actual knowledge that, but for the patent license, your conveying the
+    covered work in a country, or your recipient's use of the covered work
+    in a country, would infringe one or more identifiable patents in that
+    country that you have reason to believe are valid.
+
+    If, pursuant to or in connection with a single transaction or
+    arrangement, you convey, or propagate by procuring conveyance of, a
+    covered work, and grant a patent license to some of the parties
+    receiving the covered work authorizing them to use, propagate, modify
+    or convey a specific copy of the covered work, then the patent license
+    you grant is automatically extended to all recipients of the covered
+    work and works based on it.
+
+    A patent license is "discriminatory" if it does not include within
+    the scope of its coverage, prohibits the exercise of, or is
+    conditioned on the non-exercise of one or more of the rights that are
+    specifically granted under this License.  You may not convey a covered
+    work if you are a party to an arrangement with a third party that is
+    in the business of distributing software, under which you make payment
+    to the third party based on the extent of your activity of conveying
+    the work, and under which the third party grants, to any of the
+    parties who would receive the covered work from you, a discriminatory
+    patent license (a) in connection with copies of the covered work
+    conveyed by you (or copies made from those copies), or (b) primarily
+    for and in connection with specific products or compilations that
+    contain the covered work, unless you entered into that arrangement,
+    or that patent license was granted, prior to 28 March 2007.
+
+    Nothing in this License shall be construed as excluding or limiting
+    any implied license or other defenses to infringement that may
+    otherwise be available to you under applicable patent law.
+
+    12. No Surrender of Others' Freedom.
+
+    If conditions are imposed on you (whether by court order, agreement or
+    otherwise) that contradict the conditions of this License, they do not
+    excuse you from the conditions of this License.  If you cannot convey a
+    covered work so as to satisfy simultaneously your obligations under this
+    License and any other pertinent obligations, then as a consequence you may
+    not convey it at all.  For example, if you agree to terms that obligate you
+    to collect a royalty for further conveying from those to whom you convey
+    the Program, the only way you could satisfy both those terms and this
+    License would be to refrain entirely from conveying the Program.
+
+    13. Use with the GNU Affero General Public License.
+
+    Notwithstanding any other provision of this License, you have
+    permission to link or combine any covered work with a work licensed
+    under version 3 of the GNU Affero General Public License into a single
+    combined work, and to convey the resulting work.  The terms of this
+    License will continue to apply to the part which is the covered work,
+    but the special requirements of the GNU Affero General Public License,
+    section 13, concerning interaction through a network will apply to the
+    combination as such.
+
+    14. Revised Versions of this License.
+
+    The Free Software Foundation may publish revised and/or new versions of
+    the GNU General Public License from time to time.  Such new versions will
+    be similar in spirit to the present version, but may differ in detail to
+    address new problems or concerns.
+
+    Each version is given a distinguishing version number.  If the
+    Program specifies that a certain numbered version of the GNU General
+    Public License "or any later version" applies to it, you have the
+    option of following the terms and conditions either of that numbered
+    version or of any later version published by the Free Software
+    Foundation.  If the Program does not specify a version number of the
+    GNU General Public License, you may choose any version ever published
+    by the Free Software Foundation.
+
+    If the Program specifies that a proxy can decide which future
+    versions of the GNU General Public License can be used, that proxy's
+    public statement of acceptance of a version permanently authorizes you
+    to choose that version for the Program.
+
+    Later license versions may give you additional or different
+    permissions.  However, no additional obligations are imposed on any
+    author or copyright holder as a result of your choosing to follow a
+    later version.
+
+    15. Disclaimer of Warranty.
+
+    THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+    APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+    HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+    OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+    THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+    PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+    IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+    ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+    16. Limitation of Liability.
+
+    IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+    WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+    THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+    GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+    USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+    DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+    PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+    EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+    SUCH DAMAGES.
+
+    17. Interpretation of Sections 15 and 16.
+
+    If the disclaimer of warranty and limitation of liability provided
+    above cannot be given local legal effect according to their terms,
+    reviewing courts shall apply local law that most closely approximates
+    an absolute waiver of all civil liability in connection with the
+    Program, unless a warranty or assumption of liability accompanies a
+    copy of the Program in return for a fee.
+
+                        END OF TERMS AND CONDITIONS
+
+                How to Apply These Terms to Your New Programs
+
+    If you develop a new program, and you want it to be of the greatest
+    possible use to the public, the best way to achieve this is to make it
+    free software which everyone can redistribute and change under these terms.
+
+    To do so, attach the following notices to the program.  It is safest
+    to attach them to the start of each source file to most effectively
+    state the exclusion of warranty; and each file should have at least
+    the "copyright" line and a pointer to where the full notice is found.
+
+        <one line to give the program's name and a brief idea of what it does.>
+        Copyright (C) <year>  <name of author>
+
+        This program is free software: you can redistribute it and/or modify
+        it under the terms of the GNU General Public License as published by
+        the Free Software Foundation, either version 3 of the License, or
+        (at your option) any later version.
+
+        This program is distributed in the hope that it will be useful,
+        but WITHOUT ANY WARRANTY; without even the implied warranty of
+        MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+        GNU General Public License for more details.
+
+        You should have received a copy of the GNU General Public License
+        along with this program.  If not, see <https://www.gnu.org/licenses/>.
+
+    Also add information on how to contact you by electronic and paper mail.
+
+    If the program does terminal interaction, make it output a short
+    notice like this when it starts in an interactive mode:
+
+        <program>  Copyright (C) <year>  <name of author>
+        This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+        This is free software, and you are welcome to redistribute it
+        under certain conditions; type `show c' for details.
+
+    The hypothetical commands `show w' and `show c' should show the appropriate
+    parts of the General Public License.  Of course, your program's commands
+    might be different; for a GUI interface, you would use an "about box".
+
+    You should also get your employer (if you work as a programmer) or school,
+    if any, to sign a "copyright disclaimer" for the program, if necessary.
+    For more information on this, and how to apply and follow the GNU GPL, see
+    <https://www.gnu.org/licenses/>.
+
+    The GNU General Public License does not permit incorporating your program
+    into proprietary programs.  If your program is a subroutine library, you
+    may consider it more useful to permit linking proprietary applications with
+    the library.  If this is what you want to do, use the GNU Lesser General
+    Public License instead of this License.  But first, please read
+    <https://www.gnu.org/licenses/why-not-lgpl.html>.
+*/
+
+import { WebmElements, WebmHeader } from "play-audio";
+import { Duplex, DuplexOptions } from "node:stream";
+
+enum DataType {
+    master,
+    string,
+    uint,
+    binary,
+    float,
+}
+
+export enum WebmSeekerState {
+    READING_HEAD = "READING_HEAD",
+    READING_DATA = "READING_DATA",
+}
+
+interface WebmSeekerOptions extends DuplexOptions {
+    mode?: "precise" | "granular";
+}
+
+const WEB_ELEMENT_KEYS = Object.keys(WebmElements);
+
+export class WebmSeeker extends Duplex {
+    remaining?: Buffer;
+    state: WebmSeekerState;
+    chunk?: Buffer;
+    cursor: number;
+    header: WebmHeader;
+    headfound: boolean;
+    headerparsed: boolean;
+    seekfound: boolean;
+    private data_size: number;
+    private offset: number;
+    private data_length: number;
+    private sec: number;
+    private time: number;
+
+    constructor(sec: number, options: WebmSeekerOptions) {
+        super(options);
+        this.state = WebmSeekerState.READING_HEAD;
+        this.cursor = 0;
+        this.header = new WebmHeader();
+        this.headfound = false;
+        this.headerparsed = false;
+        this.seekfound = false;
+        this.data_length = 0;
+        this.data_size = 0;
+        this.offset = 0;
+        this.sec = sec;
+        this.time = Math.floor(sec / 10) * 10;
+    }
+
+    private get vint_length(): number {
+        let i = 0;
+        for (; i < 8; i++) {
+            if ((1 << (7 - i)) & this.chunk![this.cursor]) break;
+        }
+        return ++i;
+    }
+
+    private vint_value(): boolean {
+        if (!this.chunk) return false;
+        const length = this.vint_length;
+        if (this.chunk.length < this.cursor + length) return false;
+        let value = this.chunk[this.cursor] & ((1 << (8 - length)) - 1);
+        for (let i = this.cursor + 1; i < this.cursor + length; i++)
+            value = (value << 8) + this.chunk[i];
+        this.data_size = length;
+        this.data_length = value;
+        return true;
+    }
+
+    cleanup() {
+        this.cursor = 0;
+        this.chunk = undefined;
+        this.remaining = undefined;
+    }
+
+    _read() {}
+
+    seek(content_length: number): Error | number {
+        let clusterlength = 0,
+            position = 0;
+        let time_left = (this.sec - this.time) * 1000 || 0;
+        time_left = Math.round(time_left / 20) * 20;
+        if (!this.header.segment.cues) return new Error("Failed to Parse Cues");
+
+        for (let i = 0; i < this.header.segment.cues.length; i++) {
+            const data = this.header.segment.cues[i];
+            if (Math.floor((data.time as number) / 1000) === this.time) {
+                position = data.position as number;
+                clusterlength =
+                    (this.header.segment.cues[i + 1]?.position ||
+                        content_length) -
+                    position -
+                    1;
+                break;
+            } else continue;
+        }
+        if (clusterlength === 0) return position;
+        return (
+            this.offset +
+            Math.round(position + (time_left / 20) * (clusterlength / 500))
+        );
+    }
+
+    _write(
+        chunk: Buffer,
+        _: BufferEncoding,
+        callback: (error?: Error | null) => void,
+    ): void {
+        if (this.remaining) {
+            this.chunk = Buffer.concat([this.remaining, chunk]);
+            this.remaining = undefined;
+        } else this.chunk = chunk;
+
+        let err: Error | undefined;
+
+        if (this.state === WebmSeekerState.READING_HEAD) err = this.readHead();
+        else if (!this.seekfound) err = this.getClosestBlock();
+        else err = this.readTag();
+
+        if (err) callback(err);
+        else callback();
+    }
+
+    private readHead(): Error | undefined {
+        if (!this.chunk) return new Error("Chunk is missing");
+
+        while (this.chunk.length > this.cursor) {
+            const oldCursor = this.cursor;
+            const id = this.vint_length;
+            if (this.chunk.length < this.cursor + id) break;
+
+            const ebmlID = this.parseEbmlID(
+                this.chunk.slice(this.cursor, this.cursor + id).toString("hex"),
+            );
+            this.cursor += id;
+
+            if (!this.vint_value()) {
+                this.cursor = oldCursor;
+                break;
+            }
+            if (!ebmlID) {
+                this.cursor += this.data_size + this.data_length;
+                continue;
+            }
+
+            if (!this.headfound) {
+                if (ebmlID.name === "ebml") this.headfound = true;
+                else
+                    return new Error(
+                        "Failed to find EBML ID at start of stream.",
+                    );
+            }
+            const data = this.chunk.slice(
+                this.cursor + this.data_size,
+                this.cursor + this.data_size + this.data_length,
+            );
+            const parse = this.header.parse(ebmlID, data);
+            if (parse instanceof Error) return parse;
+
+            // stop parsing the header once we have found the correct cue
+
+            if (ebmlID.name === "seekHead") this.offset = oldCursor;
+
+            if (
+                ebmlID.name === "cueClusterPosition" &&
+                this.header.segment.cues!.length > 2 &&
+                this.time ===
+                    (this.header.segment.cues!.at(-2)!.time as number) / 1000
+            )
+                this.emit("headComplete");
+
+            if (ebmlID.type === DataType.master) {
+                this.cursor += this.data_size;
+                continue;
+            }
+
+            if (
+                this.chunk.length <
+                this.cursor + this.data_size + this.data_length
+            ) {
+                this.cursor = oldCursor;
+                break;
+            } else this.cursor += this.data_size + this.data_length;
+        }
+        this.remaining = this.chunk.slice(this.cursor);
+        this.cursor = 0;
+    }
+
+    private readTag(): Error | undefined {
+        if (!this.chunk) return new Error("Chunk is missing");
+
+        while (this.chunk.length > this.cursor) {
+            const oldCursor = this.cursor;
+            const id = this.vint_length;
+            if (this.chunk.length < this.cursor + id) break;
+
+            const ebmlID = this.parseEbmlID(
+                this.chunk.slice(this.cursor, this.cursor + id).toString("hex"),
+            );
+            this.cursor += id;
+
+            if (!this.vint_value()) {
+                this.cursor = oldCursor;
+                break;
+            }
+            if (!ebmlID) {
+                this.cursor += this.data_size + this.data_length;
+                continue;
+            }
+
+            const data = this.chunk.slice(
+                this.cursor + this.data_size,
+                this.cursor + this.data_size + this.data_length,
+            );
+            const parse = this.header.parse(ebmlID, data);
+            if (parse instanceof Error) return parse;
+
+            if (ebmlID.type === DataType.master) {
+                this.cursor += this.data_size;
+                continue;
+            }
+
+            if (
+                this.chunk.length <
+                this.cursor + this.data_size + this.data_length
+            ) {
+                this.cursor = oldCursor;
+                break;
+            } else this.cursor += this.data_size + this.data_length;
+
+            if (ebmlID.name === "simpleBlock") {
+                const track =
+                    this.header.segment.tracks![this.header.audioTrack];
+                if (!track || track.trackType !== 2)
+                    return new Error("No audio Track in this webm file.");
+                if ((data[0] & 0xf) === track.trackNumber)
+                    this.push(data.slice(4));
+            }
+        }
+        this.remaining = this.chunk.slice(this.cursor);
+        this.cursor = 0;
+    }
+
+    private getClosestBlock(): Error | undefined {
+        if (this.sec === 0) {
+            this.seekfound = true;
+            return this.readTag();
+        }
+        if (!this.chunk) return new Error("Chunk is missing");
+        this.cursor = 0;
+        let positionFound = false;
+        while (!positionFound && this.cursor < this.chunk.length) {
+            this.cursor = this.chunk.indexOf("a3", this.cursor, "hex");
+            if (this.cursor === -1)
+                return new Error("Failed to find nearest Block.");
+            this.cursor++;
+            if (!this.vint_value())
+                return new Error(
+                    "Failed to find correct simpleBlock in first chunk",
+                );
+            if (
+                this.cursor + this.data_length + this.data_length >
+                this.chunk.length
+            )
+                continue;
+            const data = this.chunk.slice(
+                this.cursor + this.data_size,
+                this.cursor + this.data_size + this.data_length,
+            );
+            const track = this.header.segment.tracks![this.header.audioTrack];
+            if (!track || track.trackType !== 2)
+                return new Error("No audio Track in this webm file.");
+            if ((data[0] & 0xf) === track.trackNumber) {
+                this.cursor += this.data_size + this.data_length;
+                this.push(data.slice(4));
+                positionFound = true;
+            } else continue;
+        }
+        if (!positionFound)
+            return new Error("Failed to find nearest correct simple Block.");
+        this.seekfound = true;
+        return this.readTag();
+    }
+
+    private parseEbmlID(ebmlID: string) {
+        if (WEB_ELEMENT_KEYS.includes(ebmlID)) return WebmElements[ebmlID];
+        else return false;
+    }
+
+    _destroy(
+        error: Error | null,
+        callback: (error: Error | null) => void,
+    ): void {
+        this.cleanup();
+        callback(error);
+    }
+
+    _final(callback: (error?: Error | null) => void): void {
+        this.cleanup();
+        callback();
+    }
+}

src/utils/stream.ts

@@ -1,283 +0,0 @@
-import { Readable } from "stream";
-import axios, { AxiosRequestConfig, AxiosResponse } from "axios";
-import { Timer } from "./timer";
-
-const DEBUG_SIMULATE_FAILURE = false;
-
-async function makeStreamRequest(
-    url: string,
-    options: AxiosRequestConfig = {},
-    body?: any,
-): Promise<AxiosResponse> {
-    const { headers = {}, method = "GET" } = options;
-
-    let config: AxiosRequestConfig = {
-        url,
-        method,
-        headers,
-        data: body,
-        responseType: "stream",
-    };
-
-    // Override / Add config
-    config = Object.assign(config, options);
-
-    try {
-        const response = await axios(config);
-        return response;
-    } catch (err) {
-        throw err;
-    }
-}
-
-export async function fetchStream(
-    url: string,
-    options: AxiosRequestConfig = { method: "GET" },
-): Promise<AxiosResponse<any, any>> {
-    try {
-        let response = await makeStreamRequest(url, options);
-        const visitedUrls = new Set<string>();
-
-        // Handle redirection and detect redirection loop
-        while (
-            response.status >= 300 &&
-            response.status < 400 &&
-            response.headers.location
-        ) {
-            const redirectUrl = response.headers.location;
-            if (visitedUrls.has(redirectUrl)) {
-                throw new Error("Redirection loop detected");
-            }
-            visitedUrls.add(redirectUrl);
-            response = await makeStreamRequest(redirectUrl, options);
-        }
-
-        return response;
-    } catch (error) {
-        throw error;
-    }
-}
-
-export class Stream {
-    private id: string;
-    private url: string;
-    private referenceUrl: string;
-    private duration: number;
-
-    private timer: Timer;
-    private locked: boolean = false;
-    private destroyed: boolean = false;
-    private fetchCompleted: boolean = false;
-
-    public stream: Readable;
-    private bytesReceived: number = 0;
-
-    private contentLength: number;
-
-    private inputReadable: Readable | null = null;
-
-    private bytesPerRequestLimit = 1 * 1024 * 1024; // 1 MB per request
-
-    private refreshStreamUrlFunction: () => Promise<string>;
-
-    constructor(
-        streamUrl: string,
-        referenceUrl: string,
-        contentLength: number,
-        duration: number,
-        refreshStreamUrlFunction: () => Promise<string>,
-    ) {
-        this.id = Math.random().toString(36).substring(7);
-        this.url = streamUrl;
-        this.referenceUrl = referenceUrl;
-        this.duration = duration;
-        this.stream = new Readable({
-            highWaterMark: 5 * 1024 * 1024,
-            read() {},
-        });
-        this.contentLength = contentLength;
-        this.refreshStreamUrlFunction = refreshStreamUrlFunction;
-
-        this.timer = new Timer(() => {
-            this.timer.reset();
-            this.tick();
-        }, 2000);
-
-        this.stream.on("close", () => {
-            console.debug(
-                `[${this.id}] > Destination stream closed, destroying...`,
-            );
-            this.timer.destroy();
-            this.destroy();
-        });
-
-        this.timer.start();
-        this.tick();
-    }
-
-    private debugLog() {
-        const isBufferSufficient =
-            this.stream.readableLength >= this.bytesPerRequestLimit;
-
-        console.debug(
-            `[${this.id}] > ` +
-                `Data Received: ${(this.bytesReceived / (1024 * 1024)).toFixed(3)} MB / ${(this.contentLength / (1024 * 1024)).toFixed(3)} MB | ` +
-                `Buffer Remaining: ${(this.stream.readableLength / (1024 * 1024)).toFixed(3)} MB | ` +
-                `${!this.fetchCompleted ? `Buffer Sufficient: ${isBufferSufficient} | ` : ``}` +
-                `Locked: ${this.locked} | ` +
-                `Fetch Completed: ${this.fetchCompleted}`,
-        );
-    }
-
-    private async tick() {
-        if (this.destroyed) {
-            console.debug(`[${this.id}] > Stream destroyed, not ticking`);
-            this.timer.destroy();
-            return;
-        }
-
-        if (this.stream.destroyed) {
-            console.debug(
-                `[${this.id}] > Destination stream destroyed, destroying...`,
-            );
-            this.timer.destroy();
-            this.destroy();
-            return;
-        }
-
-        const remainingBufferBytes = this.stream.readableLength;
-        const isBufferSufficient =
-            remainingBufferBytes >= this.bytesPerRequestLimit;
-
-        this.debugLog();
-
-        if (!this.locked && !this.fetchCompleted) {
-            // Check if the remaining buffer size is less than a threshold before fetching the next chunk
-            if (!isBufferSufficient) {
-                this.locked = true;
-                const end = Math.min(
-                    this.bytesReceived + this.bytesPerRequestLimit,
-                    this.contentLength,
-                );
-
-                const rangeHeader = `bytes=${this.bytesReceived}-${end}`;
-
-                const request = await fetchStream(this.url, {
-                    headers: {
-                        range: rangeHeader,
-                    },
-                }).catch((err: Error) => err);
-
-                console.log(`[${this.id}] > Requesting range | ${rangeHeader}`);
-
-                if (request instanceof Error) {
-                    console.debug(
-                        `[${this.id}] > Request error: ${request.message}`,
-                    );
-
-                    await this.refreshStreamUrl();
-                    this.locked = false;
-                    this.timer.reset();
-                    this.tick();
-                    return;
-                }
-
-                // Simulate failed request 25% of the time
-                if (DEBUG_SIMULATE_FAILURE && Math.random() < 0.25) {
-                    console.debug(`[${this.id}] > Simulating request failure`);
-                    request.status = 416;
-                }
-
-                if (request.status >= 400) {
-                    await this.refreshStreamUrl();
-                    this.locked = false;
-                    this.timer.reset();
-                    this.tick();
-                    return;
-                }
-
-                this.inputReadable = request.data;
-
-                if (this.inputReadable === null) {
-                    this.locked = false;
-                    return;
-                }
-
-                console.debug(`[${this.id}] > Request successful`);
-
-                request.data.on("data", (data: any) => {
-                    this.stream.push(data);
-                    this.bytesReceived += data.length;
-                });
-
-                request.data.on("end", (data: any) => {
-                    const check = () => {
-                        // If still locked, delay the check
-                        if (this.locked) {
-                            console.debug(
-                                `[${this.id}] > Still locked, delaying end check...`,
-                            );
-                            setTimeout(check, 1000);
-                            return;
-                        }
-
-                        if (end >= this.contentLength - 1) {
-                            console.debug(
-                                `[${this.id}] > Fetching completed, permanently locking...`,
-                            );
-                            this.locked = true;
-
-                            //this.timer.destroy();
-                            this.stream.push(null);
-                            this.debugLog();
-                            this.fetchCompleted = true;
-                            //this.destroy();
-                        }
-                    };
-                    check();
-                });
-
-                request.data.once("error", async () => {
-                    this.destroy();
-                    await this.refreshStreamUrl();
-                    this.timer.reset();
-                    this.tick();
-                });
-
-                this.locked = false;
-            }
-        }
-
-        // If data fetch is completed, check if the buffer is empty, if so, destroy the stream
-        if (this.fetchCompleted && remainingBufferBytes === 0) {
-            console.debug(`[${this.id}] > Buffer empty, destroying...`);
-            this.stream.emit("finished");
-            this.destroy();
-            return;
-        }
-
-        return;
-    }
-
-    pause() {
-        this.timer.pause();
-    }
-
-    resume() {
-        this.timer.resume();
-    }
-
-    private async refreshStreamUrl() {
-        console.debug(`[${this.id}] > Refreshing stream URL...`);
-        let url = await this.refreshStreamUrlFunction();
-        this.url = url;
-        console.debug(`[${this.id}] > Stream URL refreshed | ${url}`);
-    }
-
-    private destroy() {
-        this.debugLog();
-        console.debug(`[${this.id}] > Stream destroyed`);
-        if (this.inputReadable) this.inputReadable.destroy();
-        this.destroyed = true;
-    }
-}

src/utils/timer.ts

@@ -1,4 +1,4 @@
-type TimerState = "idle" | "running" | "paused" | "finished";
+type TimerState = "idle" | "running" | "paused" | "finished" | "destroyed";
 
 export class Timer {
     private callback: () => void | Promise<void>;
@@ -72,7 +72,11 @@ export class Timer {
     destroy() {
         this.clearExistingInterval();
         this.callback = () => {};
-        this.state = "finished";
+        this.state = "destroyed";
+    }
+
+    isDestroyed(): boolean {
+        return this.state === "destroyed";
     }
 
     getState(): TimerState {