@gkd-kit/inspect 0.0.1719927301505 → 0.0.1720768220157

package/dist/assets/index-Dt1fnF8L.js

@@ -1,2 +0,0 @@
-var y=Object.defineProperty;var w=t=>{throw TypeError(t)};var g=(t,e,n)=>e in t?y(t,e,{enumerable:!0,configurable:!0,writable:!0,value:n}):t[e]=n;var b=(t,e,n)=>g(t,typeof e!="symbol"?e+"":e,n),q=(t,e,n)=>e.has(t)||w("Cannot "+n);var s=(t,e,n)=>(q(t,e,"read from private field"),n?n.call(t):e.get(t)),l=(t,e,n)=>e.has(t)?w("Cannot add the same private member more than once"):e instanceof WeakSet?e.add(t):e.set(t,n),u=(t,e,n,a)=>(q(t,e,"write to private field"),a?a.call(t,n):e.set(t,n),n);var p=(t,e,n,a)=>({set _(f){u(t,e,f,n)},get _(){return s(t,e,a)}});class I{constructor(e){b(this,"value");b(this,"next");this.value=e}}var i,r,o;class z{constructor(){l(this,i);l(this,r);l(this,o);this.clear()}enqueue(e){const n=new I(e);s(this,i)?(s(this,r).next=n,u(this,r,n)):(u(this,i,n),u(this,r,n)),p(this,o)._++}dequeue(){const e=s(this,i);if(e)return u(this,i,s(this,i).next),p(this,o)._--,e.value}peek(){if(s(this,i))return s(this,i).value}clear(){u(this,i,void 0),u(this,r,void 0),u(this,o,0)}get size(){return s(this,o)}*[Symbol.iterator](){let e=s(this,i);for(;e;)yield e.value,e=e.next}}i=new WeakMap,r=new WeakMap,o=new WeakMap;const N={bind(t,e,n){return t.bind(n)}};function C(t){if(!((Number.isInteger(t)||t===Number.POSITIVE_INFINITY)&&t>0))throw new TypeError("Expected `concurrency` to be a number from 1 and up");const e=new z;let n=0;const a=()=>{n--,e.size>0&&e.dequeue()()},f=async(c,h,d)=>{n++;const m=(async()=>c(...d))();h(m);try{await m}catch{}a()},x=(c,h,d)=>{e.enqueue(N.bind(f.bind(void 0,c,h,d))),(async()=>(await Promise.resolve(),n<t&&e.size>0&&e.dequeue()()))()},v=(c,...h)=>new Promise(d=>{x(c,d,h)});return Object.defineProperties(v,{activeCount:{get:()=>n},pendingCount:{get:()=>e.size},clearQueue:{value(){e.clear()}}}),v}export{C as p};
-//# sourceMappingURL=index-Dt1fnF8L.js.map

package/dist/assets/index-Dt1fnF8L.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index-Dt1fnF8L.js","sources":["../../node_modules/.pnpm/yocto-queue@1.1.1/node_modules/yocto-queue/index.js","../../node_modules/.pnpm/p-limit@5.0.0/node_modules/p-limit/async-hooks-stub.js","../../node_modules/.pnpm/p-limit@5.0.0/node_modules/p-limit/index.js"],"sourcesContent":["/*\nHow it works:\n`this.#head` is an instance of `Node` which keeps track of its current value and nests another instance of `Node` that keeps the value that comes after it. When a value is provided to `.enqueue()`, the code needs to iterate through `this.#head`, going deeper and deeper to find the last value. However, iterating through every single item is slow. This problem is solved by saving a reference to the last value as `this.#tail` so that it can reference it to add a new value.\n*/\n\nclass Node {\n\tvalue;\n\tnext;\n\n\tconstructor(value) {\n\t\tthis.value = value;\n\t}\n}\n\nexport default class Queue {\n\t#head;\n\t#tail;\n\t#size;\n\n\tconstructor() {\n\t\tthis.clear();\n\t}\n\n\tenqueue(value) {\n\t\tconst node = new Node(value);\n\n\t\tif (this.#head) {\n\t\t\tthis.#tail.next = node;\n\t\t\tthis.#tail = node;\n\t\t} else {\n\t\t\tthis.#head = node;\n\t\t\tthis.#tail = node;\n\t\t}\n\n\t\tthis.#size++;\n\t}\n\n\tdequeue() {\n\t\tconst current = this.#head;\n\t\tif (!current) {\n\t\t\treturn;\n\t\t}\n\n\t\tthis.#head = this.#head.next;\n\t\tthis.#size--;\n\t\treturn current.value;\n\t}\n\n\tpeek() {\n\t\tif (!this.#head) {\n\t\t\treturn;\n\t\t}\n\n\t\treturn this.#head.value;\n\n\t\t// TODO: Node.js 18.\n\t\t// return this.#head?.value;\n\t}\n\n\tclear() {\n\t\tthis.#head = undefined;\n\t\tthis.#tail = undefined;\n\t\tthis.#size = 0;\n\t}\n\n\tget size() {\n\t\treturn this.#size;\n\t}\n\n\t* [Symbol.iterator]() {\n\t\tlet current = this.#head;\n\n\t\twhile (current) {\n\t\t\tyield current.value;\n\t\t\tcurrent = current.next;\n\t\t}\n\t}\n}\n","export const AsyncResource = {\n\tbind(fn, _type, thisArg) {\n\t\treturn fn.bind(thisArg);\n\t},\n};\n\nexport class AsyncLocalStorage {\n\tgetStore() {\n\t\treturn undefined;\n\t}\n\n\trun(_store, callback) {\n\t\treturn callback();\n\t}\n}\n","import Queue from 'yocto-queue';\nimport {AsyncResource} from '#async_hooks';\n\nexport default function pLimit(concurrency) {\n\tif (!((Number.isInteger(concurrency) || concurrency === Number.POSITIVE_INFINITY) && concurrency > 0)) {\n\t\tthrow new TypeError('Expected `concurrency` to be a number from 1 and up');\n\t}\n\n\tconst queue = new Queue();\n\tlet activeCount = 0;\n\n\tconst next = () => {\n\t\tactiveCount--;\n\n\t\tif (queue.size > 0) {\n\t\t\tqueue.dequeue()();\n\t\t}\n\t};\n\n\tconst run = async (function_, resolve, arguments_) => {\n\t\tactiveCount++;\n\n\t\tconst result = (async () => function_(...arguments_))();\n\n\t\tresolve(result);\n\n\t\ttry {\n\t\t\tawait result;\n\t\t} catch {}\n\n\t\tnext();\n\t};\n\n\tconst enqueue = (function_, resolve, arguments_) => {\n\t\tqueue.enqueue(\n\t\t\tAsyncResource.bind(run.bind(undefined, function_, resolve, arguments_)),\n\t\t);\n\n\t\t(async () => {\n\t\t\t// This function needs to wait until the next microtask before comparing\n\t\t\t// `activeCount` to `concurrency`, because `activeCount` is updated asynchronously\n\t\t\t// when the run function is dequeued and called. The comparison in the if-statement\n\t\t\t// needs to happen asynchronously as well to get an up-to-date value for `activeCount`.\n\t\t\tawait Promise.resolve();\n\n\t\t\tif (activeCount < concurrency && queue.size > 0) {\n\t\t\t\tqueue.dequeue()();\n\t\t\t}\n\t\t})();\n\t};\n\n\tconst generator = (function_, ...arguments_) => new Promise(resolve => {\n\t\tenqueue(function_, resolve, arguments_);\n\t});\n\n\tObject.defineProperties(generator, {\n\t\tactiveCount: {\n\t\t\tget: () => activeCount,\n\t\t},\n\t\tpendingCount: {\n\t\t\tget: () => queue.size,\n\t\t},\n\t\tclearQueue: {\n\t\t\tvalue() {\n\t\t\t\tqueue.clear();\n\t\t\t},\n\t\t},\n\t});\n\n\treturn generator;\n}\n"],"names":["Node","value","__publicField","_head","_tail","_size","Queue","__privateAdd","node","__privateGet","__privateSet","__privateWrapper","current","AsyncResource","fn","_type","thisArg","pLimit","concurrency","queue","activeCount","next","run","function_","resolve","arguments_","result","enqueue","generator"],"mappings":"8iBAKA,MAAMA,CAAK,CAIV,YAAYC,EAAO,CAHnBC,EAAA,cACAA,EAAA,aAGC,KAAK,MAAQD,CACb,CACF,CAZA,IAAAE,EAAAC,EAAAC,EAce,MAAMC,CAAM,CAK1B,aAAc,CAJdC,EAAA,KAAAJ,GACAI,EAAA,KAAAH,GACAG,EAAA,KAAAF,GAGC,KAAK,MAAK,CACV,CAED,QAAQJ,EAAO,CACd,MAAMO,EAAO,IAAIR,EAAKC,CAAK,EAEvBQ,EAAA,KAAKN,IACRM,EAAA,KAAKL,GAAM,KAAOI,EAClBE,EAAA,KAAKN,EAAQI,KAEbE,EAAA,KAAKP,EAAQK,GACbE,EAAA,KAAKN,EAAQI,IAGdG,EAAA,KAAKN,GAAL,GACA,CAED,SAAU,CACT,MAAMO,EAAUH,EAAA,KAAKN,GACrB,GAAKS,EAIL,OAAAF,EAAA,KAAKP,EAAQM,EAAA,KAAKN,GAAM,MACxBQ,EAAA,KAAKN,GAAL,IACOO,EAAQ,KACf,CAED,MAAO,CACN,GAAKH,EAAA,KAAKN,GAIV,OAAOM,EAAA,KAAKN,GAAM,KAIlB,CAED,OAAQ,CACPO,EAAA,KAAKP,EAAQ,QACbO,EAAA,KAAKN,EAAQ,QACbM,EAAA,KAAKL,EAAQ,EACb,CAED,IAAI,MAAO,CACV,OAAOI,EAAA,KAAKJ,EACZ,CAED,EAAG,OAAO,QAAQ,GAAI,CACrB,IAAIO,EAAUH,EAAA,KAAKN,GAEnB,KAAOS,GACN,MAAMA,EAAQ,MACdA,EAAUA,EAAQ,IAEnB,CACF,CA9DCT,EAAA,YACAC,EAAA,YACAC,EAAA,YCjBM,MAAMQ,EAAgB,CAC5B,KAAKC,EAAIC,EAAOC,EAAS,CACxB,OAAOF,EAAG,KAAKE,CAAO,CACtB,CACF,ECDe,SAASC,EAAOC,EAAa,CAC3C,GAAI,GAAG,OAAO,UAAUA,CAAW,GAAKA,IAAgB,OAAO,oBAAsBA,EAAc,GAClG,MAAM,IAAI,UAAU,qDAAqD,EAG1E,MAAMC,EAAQ,IAAIb,EAClB,IAAIc,EAAc,EAElB,MAAMC,EAAO,IAAM,CAClBD,IAEID,EAAM,KAAO,GAChBA,EAAM,QAAO,GAEhB,EAEOG,EAAM,MAAOC,EAAWC,EAASC,IAAe,CACrDL,IAEA,MAAMM,GAAU,SAAYH,EAAU,GAAGE,CAAU,GAAC,EAEpDD,EAAQE,CAAM,EAEd,GAAI,CACH,MAAMA,CACN,MAAO,CAAE,CAEVL,GACF,EAEOM,EAAU,CAACJ,EAAWC,EAASC,IAAe,CACnDN,EAAM,QACLN,EAAc,KAAKS,EAAI,KAAK,OAAWC,EAAWC,EAASC,CAAU,CAAC,CACzE,GAEG,UAKA,MAAM,QAAQ,UAEVL,EAAcF,GAAeC,EAAM,KAAO,GAC7CA,EAAM,QAAO,OAGjB,EAEOS,EAAY,CAACL,KAAcE,IAAe,IAAI,QAAQD,GAAW,CACtEG,EAAQJ,EAAWC,EAASC,CAAU,CACxC,CAAE,EAED,cAAO,iBAAiBG,EAAW,CAClC,YAAa,CACZ,IAAK,IAAMR,CACX,EACD,aAAc,CACb,IAAK,IAAMD,EAAM,IACjB,EACD,WAAY,CACX,OAAQ,CACPA,EAAM,MAAK,CACX,CACD,CACH,CAAE,EAEMS,CACR","x_google_ignoreList":[0,1,2]}