mirror of
https://code.equilibrium.co.ao/ITO/doneit-web.git
synced 2026-04-19 04:57:52 +00:00
Eudes Inácio
1 line
9.1 KiB
JSON
1 line
9.1 KiB
JSON
{"ast":null,"code":"import { SentryError } from './error.js';\nimport { rejectedSyncPromise, SyncPromise, resolvedSyncPromise } from './syncpromise.js';\n\n/**\n * Creates an new PromiseBuffer object with the specified limit\n * @param limit max number of promises that can be stored in the buffer\n */\nfunction makePromiseBuffer(limit) {\n var buffer = [];\n function isReady() {\n return limit === undefined || buffer.length < limit;\n }\n\n /**\n * Remove a promise from the queue.\n *\n * @param task Can be any PromiseLike<T>\n * @returns Removed promise.\n */\n function remove(task) {\n return buffer.splice(buffer.indexOf(task), 1)[0];\n }\n\n /**\n * Add a promise (representing an in-flight action) to the queue, and set it to remove itself on fulfillment.\n *\n * @param taskProducer A function producing any PromiseLike<T>; In previous versions this used to be `task:\n * PromiseLike<T>`, but under that model, Promises were instantly created on the call-site and their executor\n * functions therefore ran immediately. Thus, even if the buffer was full, the action still happened. By\n * requiring the promise to be wrapped in a function, we can defer promise creation until after the buffer\n * limit check.\n * @returns The original promise.\n */\n function add(taskProducer) {\n if (!isReady()) {\n return rejectedSyncPromise(new SentryError('Not adding Promise because buffer limit was reached.'));\n }\n\n // start the task and add its promise to the queue\n var task = taskProducer();\n if (buffer.indexOf(task) === -1) {\n buffer.push(task);\n }\n void task.then(() => remove(task))\n // Use `then(null, rejectionHandler)` rather than `catch(rejectionHandler)` so that we can use `PromiseLike`\n // rather than `Promise`. `PromiseLike` doesn't have a `.catch` method, making its polyfill smaller. (ES5 didn't\n // have promises, so TS has to polyfill when down-compiling.)\n .then(null, () => remove(task).then(null, () => {\n // We have to add another catch here because `remove()` starts a new promise chain.\n }));\n return task;\n }\n\n /**\n * Wait for all promises in the queue to resolve or for timeout to expire, whichever comes first.\n *\n * @param timeout The time, in ms, after which to resolve to `false` if the queue is still non-empty. Passing `0` (or\n * not passing anything) will make the promise wait as long as it takes for the queue to drain before resolving to\n * `true`.\n * @returns A promise which will resolve to `true` if the queue is already empty or drains before the timeout, and\n * `false` otherwise\n */\n function drain(timeout) {\n return new SyncPromise((resolve, reject) => {\n let counter = buffer.length;\n if (!counter) {\n return resolve(true);\n }\n\n // wait for `timeout` ms and then resolve to `false` (if not cancelled first)\n var capturedSetTimeout = setTimeout(() => {\n if (timeout && timeout > 0) {\n resolve(false);\n }\n }, timeout);\n\n // if all promises resolve in time, cancel the timer and resolve to `true`\n buffer.forEach(item => {\n void resolvedSyncPromise(item).then(() => {\n if (! --counter) {\n clearTimeout(capturedSetTimeout);\n resolve(true);\n }\n }, reject);\n });\n });\n }\n return {\n $: buffer,\n add,\n drain\n };\n}\nexport { makePromiseBuffer };","map":{"version":3,"names":["SentryError","rejectedSyncPromise","SyncPromise","resolvedSyncPromise","makePromiseBuffer","limit","buffer","isReady","undefined","length","remove","task","splice","indexOf","add","taskProducer","push","then","drain","timeout","resolve","reject","counter","capturedSetTimeout","setTimeout","forEach","item","clearTimeout","$"],"sources":["C:/Users/eudes.inacio/GabineteDigital/gabinete-digital-fo/node_modules/@sentry/utils/esm/promisebuffer.js"],"sourcesContent":["import { SentryError } from './error.js';\nimport { rejectedSyncPromise, SyncPromise, resolvedSyncPromise } from './syncpromise.js';\n\n/**\n * Creates an new PromiseBuffer object with the specified limit\n * @param limit max number of promises that can be stored in the buffer\n */\nfunction makePromiseBuffer(limit) {\n var buffer = [];\n\n function isReady() {\n return limit === undefined || buffer.length < limit;\n }\n\n /**\n * Remove a promise from the queue.\n *\n * @param task Can be any PromiseLike<T>\n * @returns Removed promise.\n */\n function remove(task) {\n return buffer.splice(buffer.indexOf(task), 1)[0];\n }\n\n /**\n * Add a promise (representing an in-flight action) to the queue, and set it to remove itself on fulfillment.\n *\n * @param taskProducer A function producing any PromiseLike<T>; In previous versions this used to be `task:\n * PromiseLike<T>`, but under that model, Promises were instantly created on the call-site and their executor\n * functions therefore ran immediately. Thus, even if the buffer was full, the action still happened. By\n * requiring the promise to be wrapped in a function, we can defer promise creation until after the buffer\n * limit check.\n * @returns The original promise.\n */\n function add(taskProducer) {\n if (!isReady()) {\n return rejectedSyncPromise(new SentryError('Not adding Promise because buffer limit was reached.'));\n }\n\n // start the task and add its promise to the queue\n var task = taskProducer();\n if (buffer.indexOf(task) === -1) {\n buffer.push(task);\n }\n void task\n .then(() => remove(task))\n // Use `then(null, rejectionHandler)` rather than `catch(rejectionHandler)` so that we can use `PromiseLike`\n // rather than `Promise`. `PromiseLike` doesn't have a `.catch` method, making its polyfill smaller. (ES5 didn't\n // have promises, so TS has to polyfill when down-compiling.)\n .then(null, () =>\n remove(task).then(null, () => {\n // We have to add another catch here because `remove()` starts a new promise chain.\n }),\n );\n return task;\n }\n\n /**\n * Wait for all promises in the queue to resolve or for timeout to expire, whichever comes first.\n *\n * @param timeout The time, in ms, after which to resolve to `false` if the queue is still non-empty. Passing `0` (or\n * not passing anything) will make the promise wait as long as it takes for the queue to drain before resolving to\n * `true`.\n * @returns A promise which will resolve to `true` if the queue is already empty or drains before the timeout, and\n * `false` otherwise\n */\n function drain(timeout) {\n return new SyncPromise((resolve, reject) => {\n let counter = buffer.length;\n\n if (!counter) {\n return resolve(true);\n }\n\n // wait for `timeout` ms and then resolve to `false` (if not cancelled first)\n var capturedSetTimeout = setTimeout(() => {\n if (timeout && timeout > 0) {\n resolve(false);\n }\n }, timeout);\n\n // if all promises resolve in time, cancel the timer and resolve to `true`\n buffer.forEach(item => {\n void resolvedSyncPromise(item).then(() => {\n if (!--counter) {\n clearTimeout(capturedSetTimeout);\n resolve(true);\n }\n }, reject);\n });\n });\n }\n\n return {\n $: buffer,\n add,\n drain,\n };\n}\n\nexport { makePromiseBuffer };\n"],"mappings":"AAAA,SAASA,WAAW,QAAQ,YAAY;AACxC,SAASC,mBAAmB,EAAEC,WAAW,EAAEC,mBAAmB,QAAQ,kBAAkB;;AAExF;AACA;AACA;AACA;AACA,SAASC,iBAAiBA,CAACC,KAAK,EAAE;EAChC,IAAIC,MAAM,GAAG,EAAE;EAEf,SAASC,OAAOA,CAAA,EAAG;IACjB,OAAOF,KAAK,KAAKG,SAAS,IAAIF,MAAM,CAACG,MAAM,GAAGJ,KAAK;EACrD;;EAEA;AACF;AACA;AACA;AACA;AACA;EACE,SAASK,MAAMA,CAACC,IAAI,EAAE;IACpB,OAAOL,MAAM,CAACM,MAAM,CAACN,MAAM,CAACO,OAAO,CAACF,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;EAClD;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASG,GAAGA,CAACC,YAAY,EAAE;IACzB,IAAI,CAACR,OAAO,CAAC,CAAC,EAAE;MACd,OAAON,mBAAmB,CAAC,IAAID,WAAW,CAAC,sDAAsD,CAAC,CAAC;IACrG;;IAEA;IACA,IAAIW,IAAI,GAAGI,YAAY,CAAC,CAAC;IACzB,IAAIT,MAAM,CAACO,OAAO,CAACF,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;MAC/BL,MAAM,CAACU,IAAI,CAACL,IAAI,CAAC;IACnB;IACA,KAAKA,IAAI,CACNM,IAAI,CAAC,MAAMP,MAAM,CAACC,IAAI,CAAC;IACxB;IACA;IACA;IAAA,CACCM,IAAI,CAAC,IAAI,EAAE,MACVP,MAAM,CAACC,IAAI,CAAC,CAACM,IAAI,CAAC,IAAI,EAAE,MAAM;MAC5B;IAAA,CACD,CACH,CAAC;IACH,OAAON,IAAI;EACb;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACE,SAASO,KAAKA,CAACC,OAAO,EAAE;IACtB,OAAO,IAAIjB,WAAW,CAAC,CAACkB,OAAO,EAAEC,MAAM,KAAK;MAC1C,IAAIC,OAAO,GAAGhB,MAAM,CAACG,MAAM;MAE3B,IAAI,CAACa,OAAO,EAAE;QACZ,OAAOF,OAAO,CAAC,IAAI,CAAC;MACtB;;MAEA;MACA,IAAIG,kBAAkB,GAAGC,UAAU,CAAC,MAAM;QACxC,IAAIL,OAAO,IAAIA,OAAO,GAAG,CAAC,EAAE;UAC1BC,OAAO,CAAC,KAAK,CAAC;QAChB;MACF,CAAC,EAAED,OAAO,CAAC;;MAEX;MACAb,MAAM,CAACmB,OAAO,CAACC,IAAI,IAAI;QACrB,KAAKvB,mBAAmB,CAACuB,IAAI,CAAC,CAACT,IAAI,CAAC,MAAM;UAC9B,IAAI,CAAC,GAAEK,OAAO,EAAE;YACxBK,YAAY,CAACJ,kBAAkB,CAAC;YAChCH,OAAO,CAAC,IAAI,CAAC;UACf;QACF,CAAC,EAAEC,MAAM,CAAC;MACZ,CAAC,CAAC;IACJ,CAAC,CAAC;EACJ;EAEA,OAAO;IACLO,CAAC,EAAEtB,MAAM;IACTQ,GAAG;IACHI;EACF,CAAC;AACH;AAEA,SAASd,iBAAiB"},"metadata":{},"sourceType":"module"} |