@gkd-kit/inspect 0.0.1730106886536 → 0.0.1730210050869

package/dist/assets/snapshot-CI3vERif.js

@@ -1,2 +0,0 @@
-var T=Object.defineProperty;var b=e=>{throw TypeError(e)};var D=(e,t,s)=>t in e?T(e,t,{enumerable:!0,configurable:!0,writable:!0,value:s}):e[t]=s;var w=(e,t,s)=>D(e,typeof t!="symbol"?t+"":t,s),x=(e,t,s)=>t.has(e)||b("Cannot "+s);var o=(e,t,s)=>(x(e,t,"read from private field"),s?s.call(e):t.get(e)),S=(e,t,s)=>t.has(e)?b("Cannot add the same private member more than once"):t instanceof WeakSet?t.add(e):t.set(e,s),c=(e,t,s,r)=>(x(e,t,"write to private field"),r?r.call(e,s):t.set(e,s),s);var p=(e,t,s,r)=>({set _(u){c(e,t,u,s)},get _(){return o(e,t,r)}});import{c8 as P,aE as E}from"./index-C21AA2f9.js";class k{constructor(t){w(this,"value");w(this,"next");this.value=t}}var a,l,I;class C{constructor(){S(this,a);S(this,l);S(this,I);this.clear()}enqueue(t){const s=new k(t);o(this,a)?(o(this,l).next=s,c(this,l,s)):(c(this,a,s),c(this,l,s)),p(this,I)._++}dequeue(){const t=o(this,a);if(t)return c(this,a,o(this,a).next),p(this,I)._--,t.value}peek(){if(o(this,a))return o(this,a).value}clear(){c(this,a,void 0),c(this,l,void 0),c(this,I,0)}get size(){return o(this,I)}*[Symbol.iterator](){let t=o(this,a);for(;t;)yield t.value,t=t.next}}a=new WeakMap,l=new WeakMap,I=new WeakMap;function V(e){q(e);const t=new C;let s=0;const r=()=>{s<e&&t.size>0&&(t.dequeue()(),s++)},u=()=>{s--,r()},v=async(i,n,m)=>{const h=(async()=>i(...m))();n(h);try{await h}catch{}u()},f=(i,n,m)=>{new Promise(h=>{t.enqueue(h)}).then(v.bind(void 0,i,n,m)),(async()=>(await Promise.resolve(),s<e&&r()))()},d=(i,...n)=>new Promise(m=>{f(i,m,n)});return Object.defineProperties(d,{activeCount:{get:()=>s},pendingCount:{get:()=>t.size},clearQueue:{value(){t.clear()}},concurrency:{get:()=>e,set(i){q(i),e=i,queueMicrotask(()=>{for(;s<e&&t.size>0;)r()})}}}),d}function q(e){if(!((Number.isInteger(e)||e===Number.POSITIVE_INFINITY)&&e>0))throw new TypeError("Expected `concurrency` to be a number from 1 and up")}const y=(e={})=>{var i;(i=e.driver)!=null||(e.driver=P.INDEXEDDB);const t=P.createInstance(e);return{keys:async()=>t.keys(),hasItem:async n=>{const m=n.toString();return t.keys().then(h=>h.includes(m))},getItem:async n=>t.getItem(n.toString()),setItem:async(n,m)=>t.setItem(n.toString(),m),removeItem:async n=>t.removeItem(n.toString()),getAllItems:async()=>Promise.all((await t.keys()).map(n=>t.getItem(n)))}},g=y({name:"snapshot",version:1}),O=g.setItem;g.setItem=async(e,t)=>{const s={...t,nodes:[]};return await N.setItem(e,s),O(e,t)};const j=g.removeItem;g.removeItem=async e=>{const{snapshotImportTime:t}=E();await Promise.all([j(e),N.removeItem(e),z.removeItem(e),t[e]&&delete t[e]])};const N=y({name:"shallowSnapshot",version:1}),z=y({name:"screenshot",version:1}),B=async(e,t)=>{const{importSnapshotId:s,snapshotImageId:r,snapshotImportId:u,snapshotImportTime:v}=E();Object.entries(s).forEach(([f,d])=>{d==e.id&&delete s[f]}),r[e.id]&&delete r[e.id],u[e.id]&&delete u[e.id],v[e.id]=Date.now(),await Promise.all([g.setItem(e.id,e),z.setItem(e.id,t)])};export{g as a,z as b,B as c,V as p,N as s};
-//# sourceMappingURL=snapshot-CI3vERif.js.map

package/dist/assets/snapshot-CI3vERif.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"snapshot-CI3vERif.js","sources":["../../node_modules/.pnpm/yocto-queue@1.1.1/node_modules/yocto-queue/index.js","../../node_modules/.pnpm/p-limit@6.1.0/node_modules/p-limit/index.js","../../src/utils/snapshot.ts"],"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","import Queue from 'yocto-queue';\n\nexport default function pLimit(concurrency) {\n\tvalidateConcurrency(concurrency);\n\n\tconst queue = new Queue();\n\tlet activeCount = 0;\n\n\tconst resumeNext = () => {\n\t\tif (activeCount < concurrency && queue.size > 0) {\n\t\t\tqueue.dequeue()();\n\t\t\t// Since `pendingCount` has been decreased by one, increase `activeCount` by one.\n\t\t\tactiveCount++;\n\t\t}\n\t};\n\n\tconst next = () => {\n\t\tactiveCount--;\n\n\t\tresumeNext();\n\t};\n\n\tconst run = async (function_, resolve, arguments_) => {\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\t// Queue `internalResolve` instead of the `run` function\n\t\t// to preserve asynchronous context.\n\t\tnew Promise(internalResolve => {\n\t\t\tqueue.enqueue(internalResolve);\n\t\t}).then(\n\t\t\trun.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// after the `internalResolve` 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) {\n\t\t\t\tresumeNext();\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\tconcurrency: {\n\t\t\tget: () => concurrency,\n\n\t\t\tset(newConcurrency) {\n\t\t\t\tvalidateConcurrency(newConcurrency);\n\t\t\t\tconcurrency = newConcurrency;\n\n\t\t\t\tqueueMicrotask(() => {\n\t\t\t\t\t// eslint-disable-next-line no-unmodified-loop-condition\n\t\t\t\t\twhile (activeCount < concurrency && queue.size > 0) {\n\t\t\t\t\t\tresumeNext();\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t},\n\t\t},\n\t});\n\n\treturn generator;\n}\n\nfunction validateConcurrency(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","import localforage from 'localforage';\nimport type { Snapshot } from './types';\n\nconst useStorage = <T>(options: LocalForageOptions = {}) => {\n  options.driver ??= localforage.INDEXEDDB;\n  const storage = localforage.createInstance(options);\n  const setItem = async (key: string | number, value: T) => {\n    return storage.setItem(key.toString(), value);\n  };\n  const getItem = async (key: string | number) => {\n    return storage.getItem<T>(key.toString());\n  };\n  const getAllItems = async (): Promise<T[]> => {\n    return Promise.all(\n      (await storage.keys()).map((k) => storage.getItem(k) as Promise<T>),\n    );\n  };\n  const removeItem = async (key: string | number) => {\n    return storage.removeItem(key.toString());\n  };\n\n  const hasItem = async (key: string | number) => {\n    const keyStr = key.toString();\n    return storage.keys().then((r) => r.includes(keyStr));\n  };\n  const keys = async () => {\n    return storage.keys();\n  };\n\n  return {\n    keys,\n    hasItem,\n    getItem,\n    setItem,\n    removeItem,\n    getAllItems,\n  };\n};\n\nexport const snapshotStorage = useStorage<Snapshot>({\n  name: `snapshot`,\n  version: 1,\n});\n\nconst snapshotSetItem = snapshotStorage.setItem;\nsnapshotStorage.setItem = async (key, value) => {\n  const shallowValue = { ...value, nodes: [] };\n  await shallowSnapshotStorage.setItem(key, shallowValue);\n  return snapshotSetItem(key, value);\n};\n\nconst snapshotRemoveItem = snapshotStorage.removeItem;\nsnapshotStorage.removeItem = async (key) => {\n  const { snapshotImportTime } = useStorageStore();\n  await Promise.all([\n    snapshotRemoveItem(key),\n    shallowSnapshotStorage.removeItem(key),\n    screenshotStorage.removeItem(key),\n    snapshotImportTime[key] && delete snapshotImportTime[key],\n  ]);\n};\n\nexport const shallowSnapshotStorage = useStorage<Snapshot>({\n  name: `shallowSnapshot`,\n  version: 1,\n});\n\nexport const screenshotStorage = useStorage<ArrayBuffer>({\n  name: `screenshot`,\n  version: 1,\n});\n\nexport const setSnapshot = async (snapshot: Snapshot, bf: ArrayBuffer) => {\n  const {\n    importSnapshotId,\n    snapshotImageId,\n    snapshotImportId,\n    snapshotImportTime,\n  } = useStorageStore();\n  Object.entries(importSnapshotId).forEach(([k, v]) => {\n    if (v == snapshot.id) {\n      delete importSnapshotId[k];\n    }\n  });\n  if (snapshotImageId[snapshot.id]) {\n    delete snapshotImageId[snapshot.id];\n  }\n  if (snapshotImportId[snapshot.id]) {\n    delete snapshotImportId[snapshot.id];\n  }\n  snapshotImportTime[snapshot.id] = Date.now();\n  await Promise.all([\n    snapshotStorage.setItem(snapshot.id, snapshot),\n    screenshotStorage.setItem(snapshot.id, bf),\n  ]);\n};\n"],"names":["Node","value","__publicField","Queue","__privateAdd","_head","_tail","_size","node","__privateGet","__privateSet","__privateWrapper","current","pLimit","concurrency","validateConcurrency","queue","activeCount","resumeNext","next","run","function_","resolve","arguments_","result","enqueue","internalResolve","generator","newConcurrency","useStorage","options","_a","localforage","storage","key","keyStr","r","k","snapshotStorage","snapshotSetItem","shallowValue","shallowSnapshotStorage","snapshotRemoveItem","snapshotImportTime","useStorageStore","screenshotStorage","setSnapshot","snapshot","bf","importSnapshotId","snapshotImageId","snapshotImportId","v"],"mappings":"+lBAKA,MAAMA,CAAK,CAIV,YAAYC,EAAO,CAHnBC,EAAA,cACAA,EAAA,aAGC,KAAK,MAAQD,CACb,CACF,WAEe,MAAME,CAAM,CAK1B,aAAc,CAJdC,EAAA,KAAAC,GACAD,EAAA,KAAAE,GACAF,EAAA,KAAAG,GAGC,KAAK,MAAK,CACV,CAED,QAAQN,EAAO,CACd,MAAMO,EAAO,IAAIR,EAAKC,CAAK,EAEvBQ,EAAA,KAAKJ,IACRI,EAAA,KAAKH,GAAM,KAAOE,EAClBE,EAAA,KAAKJ,EAAQE,KAEbE,EAAA,KAAKL,EAAQG,GACbE,EAAA,KAAKJ,EAAQE,IAGdG,EAAA,KAAKJ,GAAL,GACA,CAED,SAAU,CACT,MAAMK,EAAUH,EAAA,KAAKJ,GACrB,GAAKO,EAIL,OAAAF,EAAA,KAAKL,EAAQI,EAAA,KAAKJ,GAAM,MACxBM,EAAA,KAAKJ,GAAL,IACOK,EAAQ,KACf,CAED,MAAO,CACN,GAAKH,EAAA,KAAKJ,GAIV,OAAOI,EAAA,KAAKJ,GAAM,KAIlB,CAED,OAAQ,CACPK,EAAA,KAAKL,EAAQ,QACbK,EAAA,KAAKJ,EAAQ,QACbI,EAAA,KAAKH,EAAQ,EACb,CAED,IAAI,MAAO,CACV,OAAOE,EAAA,KAAKF,EACZ,CAED,EAAG,OAAO,QAAQ,GAAI,CACrB,IAAIK,EAAUH,EAAA,KAAKJ,GAEnB,KAAOO,GACN,MAAMA,EAAQ,MACdA,EAAUA,EAAQ,IAEnB,CACF,CA9DCP,EAAA,YACAC,EAAA,YACAC,EAAA,YCfc,SAASM,EAAOC,EAAa,CAC3CC,EAAoBD,CAAW,EAE/B,MAAME,EAAQ,IAAIb,EAClB,IAAIc,EAAc,EAElB,MAAMC,EAAa,IAAM,CACpBD,EAAcH,GAAeE,EAAM,KAAO,IAC7CA,EAAM,QAAO,IAEbC,IAEH,EAEOE,EAAO,IAAM,CAClBF,IAEAC,GACF,EAEOE,EAAM,MAAOC,EAAWC,EAASC,IAAe,CACrD,MAAMC,GAAU,SAAYH,EAAU,GAAGE,CAAU,GAAC,EAEpDD,EAAQE,CAAM,EAEd,GAAI,CACH,MAAMA,CACN,MAAO,CAAE,CAEVL,GACF,EAEOM,EAAU,CAACJ,EAAWC,EAASC,IAAe,CAGnD,IAAI,QAAQG,GAAmB,CAC9BV,EAAM,QAAQU,CAAe,CAC7B,CAAA,EAAE,KACFN,EAAI,KAAK,OAAWC,EAAWC,EAASC,CAAU,CACrD,GAEG,UAKA,MAAM,QAAQ,UAEVN,EAAcH,GACjBI,OAGJ,EAEOS,EAAY,CAACN,KAAcE,IAAe,IAAI,QAAQD,GAAW,CACtEG,EAAQJ,EAAWC,EAASC,CAAU,CACxC,CAAE,EAED,cAAO,iBAAiBI,EAAW,CAClC,YAAa,CACZ,IAAK,IAAMV,CACX,EACD,aAAc,CACb,IAAK,IAAMD,EAAM,IACjB,EACD,WAAY,CACX,OAAQ,CACPA,EAAM,MAAK,CACX,CACD,EACD,YAAa,CACZ,IAAK,IAAMF,EAEX,IAAIc,EAAgB,CACnBb,EAAoBa,CAAc,EAClCd,EAAcc,EAEd,eAAe,IAAM,CAEpB,KAAOX,EAAcH,GAAeE,EAAM,KAAO,GAChDE,GAEN,CAAK,CACD,CACD,CACH,CAAE,EAEMS,CACR,CAEA,SAASZ,EAAoBD,EAAa,CACzC,GAAI,GAAG,OAAO,UAAUA,CAAW,GAAKA,IAAgB,OAAO,oBAAsBA,EAAc,GAClG,MAAM,IAAI,UAAU,qDAAqD,CAE3E,CC7FA,MAAMe,EAAa,CAAIC,EAA8B,KAAO,QAC1DC,EAAAD,EAAQ,SAAR,OAAAA,EAAQ,OAAWE,EAAY,WACzB,MAAAC,EAAUD,EAAY,eAAeF,CAAO,EAwB3C,MAAA,CACL,KALW,SACJG,EAAQ,OAKf,QAVc,MAAOC,GAAyB,CACxC,MAAAC,EAASD,EAAI,WACZ,OAAAD,EAAQ,KAAO,EAAA,KAAMG,GAAMA,EAAE,SAASD,CAAM,CAAC,CAAA,EASpD,QAvBc,MAAOD,GACdD,EAAQ,QAAWC,EAAI,SAAU,CAAA,EAuBxC,QA3Bc,MAAOA,EAAsBjC,IACpCgC,EAAQ,QAAQC,EAAI,WAAYjC,CAAK,EA2B5C,WAjBiB,MAAOiC,GACjBD,EAAQ,WAAWC,EAAI,SAAU,CAAA,EAiBxC,YAvBkB,SACX,QAAQ,KACZ,MAAMD,EAAQ,KAAA,GAAQ,IAAKI,GAAMJ,EAAQ,QAAQI,CAAC,CAAe,CAAA,CAqBpE,CAEJ,EAEaC,EAAkBT,EAAqB,CAClD,KAAM,WACN,QAAS,CACX,CAAC,EAEKU,EAAkBD,EAAgB,QACxCA,EAAgB,QAAU,MAAOJ,EAAKjC,IAAU,CAC9C,MAAMuC,EAAe,CAAE,GAAGvC,EAAO,MAAO,CAAG,CAAA,EACrC,aAAAwC,EAAuB,QAAQP,EAAKM,CAAY,EAC/CD,EAAgBL,EAAKjC,CAAK,CACnC,EAEA,MAAMyC,EAAqBJ,EAAgB,WAC3CA,EAAgB,WAAa,MAAOJ,GAAQ,CACpC,KAAA,CAAE,mBAAAS,GAAuBC,IAC/B,MAAM,QAAQ,IAAI,CAChBF,EAAmBR,CAAG,EACtBO,EAAuB,WAAWP,CAAG,EACrCW,EAAkB,WAAWX,CAAG,EAChCS,EAAmBT,CAAG,GAAK,OAAOS,EAAmBT,CAAG,CAAA,CACzD,CACH,EAEO,MAAMO,EAAyBZ,EAAqB,CACzD,KAAM,kBACN,QAAS,CACX,CAAC,EAEYgB,EAAoBhB,EAAwB,CACvD,KAAM,aACN,QAAS,CACX,CAAC,EAEYiB,EAAc,MAAOC,EAAoBC,IAAoB,CAClE,KAAA,CACJ,iBAAAC,EACA,gBAAAC,EACA,iBAAAC,EACA,mBAAAR,GACEC,EAAgB,EACb,OAAA,QAAQK,CAAgB,EAAE,QAAQ,CAAC,CAACZ,EAAGe,CAAC,IAAM,CAC/CA,GAAKL,EAAS,IAChB,OAAOE,EAAiBZ,CAAC,CAC3B,CACD,EACGa,EAAgBH,EAAS,EAAE,GACtB,OAAAG,EAAgBH,EAAS,EAAE,EAEhCI,EAAiBJ,EAAS,EAAE,GACvB,OAAAI,EAAiBJ,EAAS,EAAE,EAErCJ,EAAmBI,EAAS,EAAE,EAAI,KAAK,IAAI,EAC3C,MAAM,QAAQ,IAAI,CAChBT,EAAgB,QAAQS,EAAS,GAAIA,CAAQ,EAC7CF,EAAkB,QAAQE,EAAS,GAAIC,CAAE,CAAA,CAC1C,CACH","x_google_ignoreList":[0,1]}