@bleedingdev/modern-js-utils 3.9.3-ultramodern.1 → 3.9.3-ultramodern.10

package/dist/compiled/chokidar/index.mjs

@@ -39,7 +39,7 @@ const h = {
     lstat: false,
     depth: 2147483648,
     alwaysStat: false,
-    highWaterMark: 4096
+    highWaterMark: 256
 };
 Object.freeze(h);
 const c = "READDIRP_RECURSIVE_ERROR";
@@ -97,17 +97,19 @@ class ReaddirpStream extends a.Readable {
     _rdOptions;
     _fileFilter;
     _directoryFilter;
+    _relStart;
     constructor(t = {}){
         super({
             objectMode: true,
             autoDestroy: true,
-            highWaterMark: t.highWaterMark
+            highWaterMark: t.highWaterMark ?? h.highWaterMark
         });
         const e = {
             ...h,
             ...t
         };
-        const { root: s, type: i } = e;
+        const s = e.root ?? h.root;
+        const i = e.type ?? h.type;
         this._fileFilter = normalizeFilter(e.fileFilter);
         this._directoryFilter = normalizeFilter(e.directoryFilter);
         const a = e.lstat ? r.lstat : r.stat;
@@ -116,18 +118,24 @@ class ReaddirpStream extends a.Readable {
             });
         else this._stat = a;
         this._maxDepth = null != e.depth && Number.isSafeInteger(e.depth) ? e.depth : h.depth;
-        this._wantsDir = i ? f.has(i) : false;
-        this._wantsFile = i ? u.has(i) : false;
+        this._wantsDir = f.has(i);
+        this._wantsFile = u.has(i);
         this._wantsEverything = i === o.EVERYTHING_TYPE;
         this._root = (0, n.resolve)(s);
+        this._relStart = this._root.endsWith(n.sep) ? this._root.length : this._root.length + 1;
         this._isDirent = !e.alwaysStat;
         this._statsProp = this._isDirent ? "dirent" : "stats";
         this._rdOptions = {
             encoding: "utf8",
             withFileTypes: this._isDirent
         };
+        const c = {
+            path: this._root,
+            depth: 1
+        };
+        c.pending = this._exploreDir(this._root, 1);
         this.parents = [
-            this._exploreDir(s, 1)
+            c
         ];
         this.reading = false;
         this.parent = void 0;
@@ -142,13 +150,17 @@ class ReaddirpStream extends a.Readable {
                 if (s && s.length > 0) {
                     const { path: i, depth: r } = e;
                     const n = s.splice(0, t).map((t)=>this._formatEntry(t, i));
-                    const a = await Promise.all(n);
+                    const a = this._isDirent ? n : await Promise.all(n);
                     for (const e of a){
                         if (!e) continue;
                         if (this.destroyed) return;
-                        const s = await this._getEntryType(e);
+                        let s = this._getEntryType(e);
+                        if ("string" != typeof s) s = await s;
                         if ("directory" === s && this._directoryFilter(e)) {
-                            if (r <= this._maxDepth) this.parents.push(this._exploreDir(e.fullPath, r + 1));
+                            if (r <= this._maxDepth) this.parents.push({
+                                path: e.fullPath,
+                                depth: r + 1
+                            });
                             if (this._wantsDir) {
                                 this.push(e);
                                 t--;
@@ -166,7 +178,10 @@ class ReaddirpStream extends a.Readable {
                         this.push(null);
                         break;
                     }
-                    this.parent = await t;
+                    const e = t.pending ?? this._exploreDir(t.path, t.depth);
+                    const s = this.parents[this.parents.length - 1];
+                    if (s && !s.pending) s.pending = this._exploreDir(s.path, s.depth);
+                    this.parent = await e;
                     if (this.destroyed) return;
                 }
             }
@@ -189,52 +204,57 @@ class ReaddirpStream extends a.Readable {
             path: t
         };
     }
-    async _formatEntry(t, e) {
-        let s;
-        const i = this._isDirent ? t.name : t;
-        try {
-            const r = (0, n.resolve)((0, n.join)(e, i));
-            s = {
-                path: (0, n.relative)(this._root, r),
-                fullPath: r,
-                basename: i
-            };
-            s[this._statsProp] = this._isDirent ? t : await this._stat(r);
-        } catch (t) {
-            this._onError(t);
-            return;
+    _formatEntry(t, e) {
+        const s = this._isDirent ? t.name : t;
+        const i = (0, n.join)(e, s);
+        const r = {
+            path: i.slice(this._relStart),
+            fullPath: i,
+            basename: s
+        };
+        if (this._isDirent) {
+            r.dirent = t;
+            return r;
         }
-        return s;
+        return this._stat(i).then((t)=>{
+            r.stats = t;
+            return r;
+        }, (t)=>{
+            this._onError(t);
+        });
     }
     _onError(t) {
         if (isNormalFlowError(t) && !this.destroyed) this.emit("warn", t);
         else this.destroy(t);
     }
-    async _getEntryType(t) {
-        if (!t && this._statsProp in t) return "";
+    _getEntryType(t) {
+        if (!t || !(this._statsProp in t)) return "";
         const e = t[this._statsProp];
         if (e.isFile()) return "file";
         if (e.isDirectory()) return "directory";
-        if (e && e.isSymbolicLink()) {
-            const e = t.fullPath;
-            try {
-                const t = await (0, r.realpath)(e);
-                const s = await (0, r.lstat)(t);
-                if (s.isFile()) return "file";
-                if (s.isDirectory()) {
-                    const s = t.length;
-                    if (e.startsWith(t) && e.substr(s, 1) === n.sep) {
-                        const s = new Error(`Circular symlink detected: "${e}" points to "${t}"`);
-                        s.code = c;
-                        return this._onError(s);
-                    }
-                    return "directory";
+        if (e.isSymbolicLink()) return this._getSymlinkEntryType(t);
+        return "";
+    }
+    async _getSymlinkEntryType(t) {
+        const e = t.fullPath;
+        try {
+            const t = await (0, r.realpath)(e);
+            const s = await (0, r.lstat)(t);
+            if (s.isFile()) return "file";
+            if (s.isDirectory()) {
+                const s = t.length;
+                if (e.startsWith(t) && e[s] === n.sep) {
+                    const s = new Error(`Circular symlink detected: "${e}" points to "${t}"`);
+                    s.code = c;
+                    this._onError(s);
+                    return "";
                 }
-            } catch (t) {
-                this._onError(t);
-                return "";
+                return "directory";
             }
+        } catch (t) {
+            this._onError(t);
         }
+        return "";
     }
     _includeAsFile(t) {
         const e = t && t[this._statsProp];
@@ -244,13 +264,16 @@ class ReaddirpStream extends a.Readable {
 function readdirp(t, e = {}) {
     let s = e.entryType || e.type;
     if ("both" === s) s = o.FILE_DIR_TYPE;
-    if (s) e.type = s;
     if (t) {
         if ("string" != typeof t) throw new TypeError("readdirp: root argument must be a string. Usage: readdirp(root, options)");
         else if (s && !d.includes(s)) throw new Error(`readdirp: Invalid type passed. Use one of ${d.join(", ")}`);
     } else throw new Error("readdirp: root argument is required. Usage: readdirp(root, options)");
-    e.root = t;
-    return new ReaddirpStream(e);
+    const i = {
+        ...e,
+        root: t
+    };
+    if (s) i.type = s;
+    return new ReaddirpStream(i);
 }
 const m = require("node:os");
 const w = "data";
@@ -276,19 +299,19 @@ const I = {
 };
 const F = I;
 const W = "watch";
-const x = {
+const k = {
     lstat: r.lstat,
     stat: r.stat
 };
-const A = "listeners";
-const k = "errHandlers";
-const N = "rawEmitters";
-const S = [
+const x = "listeners";
+const A = "errHandlers";
+const S = "rawEmitters";
+const T = [
+    x,
     A,
-    k,
-    N
+    S
 ];
-const T = new Set([
+const N = new Set([
     "3dm",
     "3ds",
     "3g2",
@@ -551,7 +574,7 @@ const T = new Set([
     "zip",
     "zipx"
 ]);
-const isBinaryPath = (t)=>T.has(n.extname(t).slice(1).toLowerCase());
+const isBinaryPath = (t)=>N.has(n.extname(t).slice(1).toLowerCase());
 const foreach = (t, e)=>{
     if (t instanceof Set) t.forEach(e);
     else e(t);
@@ -581,7 +604,7 @@ function createFsWatchInstance(t, e, s, r, a) {
         a(e, i, {
             watchedPath: t
         });
-        if (i && t !== i) fsWatchBroadcast(n.resolve(t, i), A, n.join(t, i));
+        if (i && t !== i) fsWatchBroadcast(n.resolve(t, i), x, n.join(t, i));
     };
     try {
         return (0, i.watch)(t, {
@@ -609,14 +632,14 @@ const setFsWatchListener = (t, e, s, i)=>{
         return c.close.bind(c);
     }
     if (h) {
-        addAndConvert(h, A, n);
-        addAndConvert(h, k, a);
-        addAndConvert(h, N, o);
+        addAndConvert(h, x, n);
+        addAndConvert(h, A, a);
+        addAndConvert(h, S, o);
     } else {
-        c = createFsWatchInstance(t, s, fsWatchBroadcast.bind(null, e, A), a, fsWatchBroadcast.bind(null, e, N));
+        c = createFsWatchInstance(t, s, fsWatchBroadcast.bind(null, e, x), a, fsWatchBroadcast.bind(null, e, S));
         if (!c) return;
         c.on(F.ERROR, async (s)=>{
-            const i = fsWatchBroadcast.bind(null, e, k);
+            const i = fsWatchBroadcast.bind(null, e, A);
             if (h) h.watcherUnusable = true;
             if (P && "EPERM" === s.code) try {
                 const e = await (0, r.open)(t, "r");
@@ -634,13 +657,13 @@ const setFsWatchListener = (t, e, s, i)=>{
         C.set(e, h);
     }
     return ()=>{
-        delFromSet(h, A, n);
-        delFromSet(h, k, a);
-        delFromSet(h, N, o);
+        delFromSet(h, x, n);
+        delFromSet(h, A, a);
+        delFromSet(h, S, o);
         if (isEmptySet(h.listeners)) {
             h.watcher.close();
             C.delete(e);
-            S.forEach(clearItem(h));
+            T.forEach(clearItem(h));
             h.watcher = void 0;
             Object.freeze(h);
         }
@@ -656,8 +679,8 @@ const setFsWatchFileListener = (t, e, s, r)=>{
         o = void 0;
     }
     if (o) {
-        addAndConvert(o, A, n);
-        addAndConvert(o, N, a);
+        addAndConvert(o, x, n);
+        addAndConvert(o, S, a);
     } else {
         o = {
             listeners: n,
@@ -677,8 +700,8 @@ const setFsWatchFileListener = (t, e, s, r)=>{
         z.set(e, o);
     }
     return ()=>{
-        delFromSet(o, A, n);
-        delFromSet(o, N, a);
+        delFromSet(o, x, n);
+        delFromSet(o, S, a);
         if (isEmptySet(o.listeners)) {
             z.delete(e);
             (0, i.unwatchFile)(e);
@@ -870,7 +893,7 @@ class NodeFsHandler {
             h.filterDir = (t)=>s.filterDir(t);
         }
         try {
-            const s = await x[h.statMethod](h.watchPath);
+            const s = await k[h.statMethod](h.watchPath);
             if (this.fsw.closed) return;
             if (this.fsw._isIgnored(h.watchPath, s)) {
                 o();

package/dist/compiled/chokidar/provenance.json

@@ -19,9 +19,9 @@
     },
     {
       "name": "readdirp",
-      "version": "5.0.0",
+      "version": "5.1.1",
       "license": "MIT"
     }
   ],
-  "lockfileSha256": "486928a3a1b80a640cc67d3eeba705a259b639085fe1299dd4f566602b51ede6"
+  "lockfileSha256": "b3ac341ea4d3fbd3adf92aa1683e1d5d49f8e7a90ee6b84d9af8904f4643cdd4"
 }

package/dist/compiled/commander/provenance.json

@@ -18,5 +18,5 @@
       "license": "MIT"
     }
   ],
-  "lockfileSha256": "486928a3a1b80a640cc67d3eeba705a259b639085fe1299dd4f566602b51ede6"
+  "lockfileSha256": "b3ac341ea4d3fbd3adf92aa1683e1d5d49f8e7a90ee6b84d9af8904f4643cdd4"
 }

package/dist/compiled/debug/provenance.json

@@ -23,5 +23,5 @@
       "license": "MIT"
     }
   ],
-  "lockfileSha256": "486928a3a1b80a640cc67d3eeba705a259b639085fe1299dd4f566602b51ede6"
+  "lockfileSha256": "b3ac341ea4d3fbd3adf92aa1683e1d5d49f8e7a90ee6b84d9af8904f4643cdd4"
 }

package/dist/compiled/dotenv-expand/LICENSE

@@ -1,15 +1,20 @@
+BSD 3-Clause License
+
 Copyright (c) 2016, Scott Motte
-All rights reserved.
 
 Redistribution and use in source and binary forms, with or without
 modification, are permitted provided that the following conditions are met:
 
-* Redistributions of source code must retain the above copyright notice, this
-  list of conditions and the following disclaimer.
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
 
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
+3. Neither the name of the copyright holder nor the names of its
+   contributors may be used to endorse or promote products derived from
+   this software without specific prior written permission.
 
 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
@@ -21,4 +26,3 @@ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-

package/dist/compiled/dotenv-expand/declaration-licenses/dotenv-expand/LICENSE

@@ -1,15 +1,20 @@
+BSD 3-Clause License
+
 Copyright (c) 2016, Scott Motte
-All rights reserved.
 
 Redistribution and use in source and binary forms, with or without
 modification, are permitted provided that the following conditions are met:
 
-* Redistributions of source code must retain the above copyright notice, this
-  list of conditions and the following disclaimer.
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
 
-* Redistributions in binary form must reproduce the above copyright notice,
-  this list of conditions and the following disclaimer in the documentation
-  and/or other materials provided with the distribution.
+3. Neither the name of the copyright holder nor the names of its
+   contributors may be used to endorse or promote products derived from
+   this software without specific prior written permission.
 
 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
@@ -21,4 +26,3 @@ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-