@relative-ci/core 5.2.2-beta.0 → 5.3.0-alpha.0

package/lib/cjs/__/undici/lib/node/fixed-queue.js

@@ -0,0 +1,129 @@
+'use strict';
+
+/* eslint-disable */
+
+var fixedQueue;
+var hasRequiredFixedQueue;
+
+function requireFixedQueue () {
+	if (hasRequiredFixedQueue) return fixedQueue;
+	hasRequiredFixedQueue = 1;
+
+	// Extracted from node/lib/internal/fixed_queue.js
+
+	// Currently optimal queue size, tested on V8 6.0 - 6.6. Must be power of two.
+	const kSize = 2048;
+	const kMask = kSize - 1;
+
+	// The FixedQueue is implemented as a singly-linked list of fixed-size
+	// circular buffers. It looks something like this:
+	//
+	//  head                                                       tail
+	//    |                                                          |
+	//    v                                                          v
+	// +-----------+ <-----\       +-----------+ <------\         +-----------+
+	// |  [null]   |        \----- |   next    |         \------- |   next    |
+	// +-----------+               +-----------+                  +-----------+
+	// |   item    | <-- bottom    |   item    | <-- bottom       |  [empty]  |
+	// |   item    |               |   item    |                  |  [empty]  |
+	// |   item    |               |   item    |                  |  [empty]  |
+	// |   item    |               |   item    |                  |  [empty]  |
+	// |   item    |               |   item    |       bottom --> |   item    |
+	// |   item    |               |   item    |                  |   item    |
+	// |    ...    |               |    ...    |                  |    ...    |
+	// |   item    |               |   item    |                  |   item    |
+	// |   item    |               |   item    |                  |   item    |
+	// |  [empty]  | <-- top       |   item    |                  |   item    |
+	// |  [empty]  |               |   item    |                  |   item    |
+	// |  [empty]  |               |  [empty]  | <-- top  top --> |  [empty]  |
+	// +-----------+               +-----------+                  +-----------+
+	//
+	// Or, if there is only one circular buffer, it looks something
+	// like either of these:
+	//
+	//  head   tail                                 head   tail
+	//    |     |                                     |     |
+	//    v     v                                     v     v
+	// +-----------+                               +-----------+
+	// |  [null]   |                               |  [null]   |
+	// +-----------+                               +-----------+
+	// |  [empty]  |                               |   item    |
+	// |  [empty]  |                               |   item    |
+	// |   item    | <-- bottom            top --> |  [empty]  |
+	// |   item    |                               |  [empty]  |
+	// |  [empty]  | <-- top            bottom --> |   item    |
+	// |  [empty]  |                               |   item    |
+	// +-----------+                               +-----------+
+	//
+	// Adding a value means moving `top` forward by one, removing means
+	// moving `bottom` forward by one. After reaching the end, the queue
+	// wraps around.
+	//
+	// When `top === bottom` the current queue is empty and when
+	// `top + 1 === bottom` it's full. This wastes a single space of storage
+	// but allows much quicker checks.
+
+	class FixedCircularBuffer {
+	  constructor() {
+	    this.bottom = 0;
+	    this.top = 0;
+	    this.list = new Array(kSize);
+	    this.next = null;
+	  }
+
+	  isEmpty() {
+	    return this.top === this.bottom;
+	  }
+
+	  isFull() {
+	    return ((this.top + 1) & kMask) === this.bottom;
+	  }
+
+	  push(data) {
+	    this.list[this.top] = data;
+	    this.top = (this.top + 1) & kMask;
+	  }
+
+	  shift() {
+	    const nextItem = this.list[this.bottom];
+	    if (nextItem === undefined)
+	      return null;
+	    this.list[this.bottom] = undefined;
+	    this.bottom = (this.bottom + 1) & kMask;
+	    return nextItem;
+	  }
+	}
+
+	fixedQueue = class FixedQueue {
+	  constructor() {
+	    this.head = this.tail = new FixedCircularBuffer();
+	  }
+
+	  isEmpty() {
+	    return this.head.isEmpty();
+	  }
+
+	  push(data) {
+	    if (this.head.isFull()) {
+	      // Head is full: Creates a new queue, sets the old queue's `.next` to it,
+	      // and sets it as the new main queue.
+	      this.head = this.head.next = new FixedCircularBuffer();
+	    }
+	    this.head.push(data);
+	  }
+
+	  shift() {
+	    const tail = this.tail;
+	    const next = tail.shift();
+	    if (tail.isEmpty() && tail.next !== null) {
+	      // If there is another queue, it forms the new tail.
+	      this.tail = tail.next;
+	    }
+	    return next;
+	  }
+	};
+	return fixedQueue;
+}
+
+exports.__require = requireFixedQueue;
+//# sourceMappingURL=fixed-queue.js.map

package/lib/cjs/__/undici/lib/node/fixed-queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fixed-queue.js","sources":["../../../../../../../../node_modules/undici/lib/node/fixed-queue.js"],"sourcesContent":["/* eslint-disable */\n\n'use strict'\n\n// Extracted from node/lib/internal/fixed_queue.js\n\n// Currently optimal queue size, tested on V8 6.0 - 6.6. Must be power of two.\nconst kSize = 2048;\nconst kMask = kSize - 1;\n\n// The FixedQueue is implemented as a singly-linked list of fixed-size\n// circular buffers. It looks something like this:\n//\n//  head                                                       tail\n//    |                                                          |\n//    v                                                          v\n// +-----------+ <-----\\       +-----------+ <------\\         +-----------+\n// |  [null]   |        \\----- |   next    |         \\------- |   next    |\n// +-----------+               +-----------+                  +-----------+\n// |   item    | <-- bottom    |   item    | <-- bottom       |  [empty]  |\n// |   item    |               |   item    |                  |  [empty]  |\n// |   item    |               |   item    |                  |  [empty]  |\n// |   item    |               |   item    |                  |  [empty]  |\n// |   item    |               |   item    |       bottom --> |   item    |\n// |   item    |               |   item    |                  |   item    |\n// |    ...    |               |    ...    |                  |    ...    |\n// |   item    |               |   item    |                  |   item    |\n// |   item    |               |   item    |                  |   item    |\n// |  [empty]  | <-- top       |   item    |                  |   item    |\n// |  [empty]  |               |   item    |                  |   item    |\n// |  [empty]  |               |  [empty]  | <-- top  top --> |  [empty]  |\n// +-----------+               +-----------+                  +-----------+\n//\n// Or, if there is only one circular buffer, it looks something\n// like either of these:\n//\n//  head   tail                                 head   tail\n//    |     |                                     |     |\n//    v     v                                     v     v\n// +-----------+                               +-----------+\n// |  [null]   |                               |  [null]   |\n// +-----------+                               +-----------+\n// |  [empty]  |                               |   item    |\n// |  [empty]  |                               |   item    |\n// |   item    | <-- bottom            top --> |  [empty]  |\n// |   item    |                               |  [empty]  |\n// |  [empty]  | <-- top            bottom --> |   item    |\n// |  [empty]  |                               |   item    |\n// +-----------+                               +-----------+\n//\n// Adding a value means moving `top` forward by one, removing means\n// moving `bottom` forward by one. After reaching the end, the queue\n// wraps around.\n//\n// When `top === bottom` the current queue is empty and when\n// `top + 1 === bottom` it's full. This wastes a single space of storage\n// but allows much quicker checks.\n\nclass FixedCircularBuffer {\n  constructor() {\n    this.bottom = 0;\n    this.top = 0;\n    this.list = new Array(kSize);\n    this.next = null;\n  }\n\n  isEmpty() {\n    return this.top === this.bottom;\n  }\n\n  isFull() {\n    return ((this.top + 1) & kMask) === this.bottom;\n  }\n\n  push(data) {\n    this.list[this.top] = data;\n    this.top = (this.top + 1) & kMask;\n  }\n\n  shift() {\n    const nextItem = this.list[this.bottom];\n    if (nextItem === undefined)\n      return null;\n    this.list[this.bottom] = undefined;\n    this.bottom = (this.bottom + 1) & kMask;\n    return nextItem;\n  }\n}\n\nmodule.exports = class FixedQueue {\n  constructor() {\n    this.head = this.tail = new FixedCircularBuffer();\n  }\n\n  isEmpty() {\n    return this.head.isEmpty();\n  }\n\n  push(data) {\n    if (this.head.isFull()) {\n      // Head is full: Creates a new queue, sets the old queue's `.next` to it,\n      // and sets it as the new main queue.\n      this.head = this.head.next = new FixedCircularBuffer();\n    }\n    this.head.push(data);\n  }\n\n  shift() {\n    const tail = this.tail;\n    const next = tail.shift();\n    if (tail.isEmpty() && tail.next !== null) {\n      // If there is another queue, it forms the new tail.\n      this.tail = tail.next;\n    }\n    return next;\n  }\n};\n"],"names":[],"mappings":";;;;;;;;;;;AAIA;;AAEA;CACA,MAAM,KAAK,GAAG,IAAI;AAClB,CAAA,MAAM,KAAK,GAAG,KAAK,GAAG,CAAC;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,CAAA,MAAM,mBAAmB,CAAC;AAC1B,GAAE,WAAW,GAAG;AAChB,KAAI,IAAI,CAAC,MAAM,GAAG,CAAC;AACnB,KAAI,IAAI,CAAC,GAAG,GAAG,CAAC;KACZ,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC;AAChC,KAAI,IAAI,CAAC,IAAI,GAAG,IAAI;AACpB,GAAA;;AAEA,GAAE,OAAO,GAAG;AACZ,KAAI,OAAO,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,MAAM;AACnC,GAAA;;AAEA,GAAE,MAAM,GAAG;AACX,KAAI,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,MAAM;AACnD,GAAA;;GAEE,IAAI,CAAC,IAAI,EAAE;KACT,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI;KAC1B,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,KAAK;AACrC,GAAA;;AAEA,GAAE,KAAK,GAAG;KACN,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;KACvC,IAAI,QAAQ,KAAK,SAAS;AAC9B,OAAM,OAAO,IAAI;KACb,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,SAAS;KAClC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK;AAC3C,KAAI,OAAO,QAAQ;AACnB,GAAA;AACA;;AAEA,CAAA,UAAc,GAAG,MAAM,UAAU,CAAC;AAClC,GAAE,WAAW,GAAG;KACZ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,mBAAmB,EAAE;AACrD,GAAA;;AAEA,GAAE,OAAO,GAAG;AACZ,KAAI,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE;AAC9B,GAAA;;GAEE,IAAI,CAAC,IAAI,EAAE;AACb,KAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE;AAC5B;AACA;AACA,OAAM,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,mBAAmB,EAAE;AAC5D,KAAA;AACA,KAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACxB,GAAA;;AAEA,GAAE,KAAK,GAAG;AACV,KAAI,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI;AAC1B,KAAI,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE;KACzB,IAAI,IAAI,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;AAC9C;AACA,OAAM,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI;AAC3B,KAAA;AACA,KAAI,OAAO,IAAI;AACf,GAAA;EACC;;;;;;","x_google_ignoreList":[0]}

package/lib/cjs/__/undici/lib/pool-base.js

@@ -0,0 +1,211 @@
+'use strict';
+
+var dispatcherBase = require('./dispatcher-base.js');
+var fixedQueue = require('./node/fixed-queue.js');
+var symbols = require('./core/symbols.js');
+var poolStats = require('./pool-stats.js');
+
+var poolBase;
+var hasRequiredPoolBase;
+
+function requirePoolBase () {
+	if (hasRequiredPoolBase) return poolBase;
+	hasRequiredPoolBase = 1;
+
+	const DispatcherBase = dispatcherBase.__require();
+	const FixedQueue = fixedQueue.__require();
+	const { kConnected, kSize, kRunning, kPending, kQueued, kBusy, kFree, kUrl, kClose, kDestroy, kDispatch } = symbols.__require();
+	const PoolStats = poolStats.__require();
+
+	const kClients = Symbol('clients');
+	const kNeedDrain = Symbol('needDrain');
+	const kQueue = Symbol('queue');
+	const kClosedResolve = Symbol('closed resolve');
+	const kOnDrain = Symbol('onDrain');
+	const kOnConnect = Symbol('onConnect');
+	const kOnDisconnect = Symbol('onDisconnect');
+	const kOnConnectionError = Symbol('onConnectionError');
+	const kGetDispatcher = Symbol('get dispatcher');
+	const kAddClient = Symbol('add client');
+	const kRemoveClient = Symbol('remove client');
+	const kStats = Symbol('stats');
+
+	class PoolBase extends DispatcherBase {
+	  constructor () {
+	    super();
+
+	    this[kQueue] = new FixedQueue();
+	    this[kClients] = [];
+	    this[kQueued] = 0;
+
+	    const pool = this;
+
+	    this[kOnDrain] = function onDrain (origin, targets) {
+	      const queue = pool[kQueue];
+
+	      let needDrain = false;
+
+	      while (!needDrain) {
+	        const item = queue.shift();
+	        if (!item) {
+	          break
+	        }
+	        pool[kQueued]--;
+	        needDrain = !this.dispatch(item.opts, item.handler);
+	      }
+
+	      this[kNeedDrain] = needDrain;
+
+	      if (!this[kNeedDrain] && pool[kNeedDrain]) {
+	        pool[kNeedDrain] = false;
+	        pool.emit('drain', origin, [pool, ...targets]);
+	      }
+
+	      if (pool[kClosedResolve] && queue.isEmpty()) {
+	        Promise
+	          .all(pool[kClients].map(c => c.close()))
+	          .then(pool[kClosedResolve]);
+	      }
+	    };
+
+	    this[kOnConnect] = (origin, targets) => {
+	      pool.emit('connect', origin, [pool, ...targets]);
+	    };
+
+	    this[kOnDisconnect] = (origin, targets, err) => {
+	      pool.emit('disconnect', origin, [pool, ...targets], err);
+	    };
+
+	    this[kOnConnectionError] = (origin, targets, err) => {
+	      pool.emit('connectionError', origin, [pool, ...targets], err);
+	    };
+
+	    this[kStats] = new PoolStats(this);
+	  }
+
+	  get [kBusy] () {
+	    return this[kNeedDrain]
+	  }
+
+	  get [kConnected] () {
+	    return this[kClients].filter(client => client[kConnected]).length
+	  }
+
+	  get [kFree] () {
+	    return this[kClients].filter(client => client[kConnected] && !client[kNeedDrain]).length
+	  }
+
+	  get [kPending] () {
+	    let ret = this[kQueued];
+	    for (const { [kPending]: pending } of this[kClients]) {
+	      ret += pending;
+	    }
+	    return ret
+	  }
+
+	  get [kRunning] () {
+	    let ret = 0;
+	    for (const { [kRunning]: running } of this[kClients]) {
+	      ret += running;
+	    }
+	    return ret
+	  }
+
+	  get [kSize] () {
+	    let ret = this[kQueued];
+	    for (const { [kSize]: size } of this[kClients]) {
+	      ret += size;
+	    }
+	    return ret
+	  }
+
+	  get stats () {
+	    return this[kStats]
+	  }
+
+	  async [kClose] () {
+	    if (this[kQueue].isEmpty()) {
+	      return Promise.all(this[kClients].map(c => c.close()))
+	    } else {
+	      return new Promise((resolve) => {
+	        this[kClosedResolve] = resolve;
+	      })
+	    }
+	  }
+
+	  async [kDestroy] (err) {
+	    while (true) {
+	      const item = this[kQueue].shift();
+	      if (!item) {
+	        break
+	      }
+	      item.handler.onError(err);
+	    }
+
+	    return Promise.all(this[kClients].map(c => c.destroy(err)))
+	  }
+
+	  [kDispatch] (opts, handler) {
+	    const dispatcher = this[kGetDispatcher]();
+
+	    if (!dispatcher) {
+	      this[kNeedDrain] = true;
+	      this[kQueue].push({ opts, handler });
+	      this[kQueued]++;
+	    } else if (!dispatcher.dispatch(opts, handler)) {
+	      dispatcher[kNeedDrain] = true;
+	      this[kNeedDrain] = !this[kGetDispatcher]();
+	    }
+
+	    return !this[kNeedDrain]
+	  }
+
+	  [kAddClient] (client) {
+	    client
+	      .on('drain', this[kOnDrain])
+	      .on('connect', this[kOnConnect])
+	      .on('disconnect', this[kOnDisconnect])
+	      .on('connectionError', this[kOnConnectionError]);
+
+	    this[kClients].push(client);
+
+	    if (this[kNeedDrain]) {
+	      process.nextTick(() => {
+	        if (this[kNeedDrain]) {
+	          this[kOnDrain](client[kUrl], [this, client]);
+	        }
+	      });
+	    }
+
+	    return this
+	  }
+
+	  [kRemoveClient] (client) {
+	    client.close(() => {
+	      const idx = this[kClients].indexOf(client);
+	      if (idx !== -1) {
+	        this[kClients].splice(idx, 1);
+	      }
+	    });
+
+	    this[kNeedDrain] = this[kClients].some(dispatcher => (
+	      !dispatcher[kNeedDrain] &&
+	      dispatcher.closed !== true &&
+	      dispatcher.destroyed !== true
+	    ));
+	  }
+	}
+
+	poolBase = {
+	  PoolBase,
+	  kClients,
+	  kNeedDrain,
+	  kAddClient,
+	  kRemoveClient,
+	  kGetDispatcher
+	};
+	return poolBase;
+}
+
+exports.__require = requirePoolBase;
+//# sourceMappingURL=pool-base.js.map

package/lib/cjs/__/undici/lib/pool-base.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool-base.js","sources":["../../../../../../../node_modules/undici/lib/pool-base.js"],"sourcesContent":["'use strict'\n\nconst DispatcherBase = require('./dispatcher-base')\nconst FixedQueue = require('./node/fixed-queue')\nconst { kConnected, kSize, kRunning, kPending, kQueued, kBusy, kFree, kUrl, kClose, kDestroy, kDispatch } = require('./core/symbols')\nconst PoolStats = require('./pool-stats')\n\nconst kClients = Symbol('clients')\nconst kNeedDrain = Symbol('needDrain')\nconst kQueue = Symbol('queue')\nconst kClosedResolve = Symbol('closed resolve')\nconst kOnDrain = Symbol('onDrain')\nconst kOnConnect = Symbol('onConnect')\nconst kOnDisconnect = Symbol('onDisconnect')\nconst kOnConnectionError = Symbol('onConnectionError')\nconst kGetDispatcher = Symbol('get dispatcher')\nconst kAddClient = Symbol('add client')\nconst kRemoveClient = Symbol('remove client')\nconst kStats = Symbol('stats')\n\nclass PoolBase extends DispatcherBase {\n  constructor () {\n    super()\n\n    this[kQueue] = new FixedQueue()\n    this[kClients] = []\n    this[kQueued] = 0\n\n    const pool = this\n\n    this[kOnDrain] = function onDrain (origin, targets) {\n      const queue = pool[kQueue]\n\n      let needDrain = false\n\n      while (!needDrain) {\n        const item = queue.shift()\n        if (!item) {\n          break\n        }\n        pool[kQueued]--\n        needDrain = !this.dispatch(item.opts, item.handler)\n      }\n\n      this[kNeedDrain] = needDrain\n\n      if (!this[kNeedDrain] && pool[kNeedDrain]) {\n        pool[kNeedDrain] = false\n        pool.emit('drain', origin, [pool, ...targets])\n      }\n\n      if (pool[kClosedResolve] && queue.isEmpty()) {\n        Promise\n          .all(pool[kClients].map(c => c.close()))\n          .then(pool[kClosedResolve])\n      }\n    }\n\n    this[kOnConnect] = (origin, targets) => {\n      pool.emit('connect', origin, [pool, ...targets])\n    }\n\n    this[kOnDisconnect] = (origin, targets, err) => {\n      pool.emit('disconnect', origin, [pool, ...targets], err)\n    }\n\n    this[kOnConnectionError] = (origin, targets, err) => {\n      pool.emit('connectionError', origin, [pool, ...targets], err)\n    }\n\n    this[kStats] = new PoolStats(this)\n  }\n\n  get [kBusy] () {\n    return this[kNeedDrain]\n  }\n\n  get [kConnected] () {\n    return this[kClients].filter(client => client[kConnected]).length\n  }\n\n  get [kFree] () {\n    return this[kClients].filter(client => client[kConnected] && !client[kNeedDrain]).length\n  }\n\n  get [kPending] () {\n    let ret = this[kQueued]\n    for (const { [kPending]: pending } of this[kClients]) {\n      ret += pending\n    }\n    return ret\n  }\n\n  get [kRunning] () {\n    let ret = 0\n    for (const { [kRunning]: running } of this[kClients]) {\n      ret += running\n    }\n    return ret\n  }\n\n  get [kSize] () {\n    let ret = this[kQueued]\n    for (const { [kSize]: size } of this[kClients]) {\n      ret += size\n    }\n    return ret\n  }\n\n  get stats () {\n    return this[kStats]\n  }\n\n  async [kClose] () {\n    if (this[kQueue].isEmpty()) {\n      return Promise.all(this[kClients].map(c => c.close()))\n    } else {\n      return new Promise((resolve) => {\n        this[kClosedResolve] = resolve\n      })\n    }\n  }\n\n  async [kDestroy] (err) {\n    while (true) {\n      const item = this[kQueue].shift()\n      if (!item) {\n        break\n      }\n      item.handler.onError(err)\n    }\n\n    return Promise.all(this[kClients].map(c => c.destroy(err)))\n  }\n\n  [kDispatch] (opts, handler) {\n    const dispatcher = this[kGetDispatcher]()\n\n    if (!dispatcher) {\n      this[kNeedDrain] = true\n      this[kQueue].push({ opts, handler })\n      this[kQueued]++\n    } else if (!dispatcher.dispatch(opts, handler)) {\n      dispatcher[kNeedDrain] = true\n      this[kNeedDrain] = !this[kGetDispatcher]()\n    }\n\n    return !this[kNeedDrain]\n  }\n\n  [kAddClient] (client) {\n    client\n      .on('drain', this[kOnDrain])\n      .on('connect', this[kOnConnect])\n      .on('disconnect', this[kOnDisconnect])\n      .on('connectionError', this[kOnConnectionError])\n\n    this[kClients].push(client)\n\n    if (this[kNeedDrain]) {\n      process.nextTick(() => {\n        if (this[kNeedDrain]) {\n          this[kOnDrain](client[kUrl], [this, client])\n        }\n      })\n    }\n\n    return this\n  }\n\n  [kRemoveClient] (client) {\n    client.close(() => {\n      const idx = this[kClients].indexOf(client)\n      if (idx !== -1) {\n        this[kClients].splice(idx, 1)\n      }\n    })\n\n    this[kNeedDrain] = this[kClients].some(dispatcher => (\n      !dispatcher[kNeedDrain] &&\n      dispatcher.closed !== true &&\n      dispatcher.destroyed !== true\n    ))\n  }\n}\n\nmodule.exports = {\n  PoolBase,\n  kClients,\n  kNeedDrain,\n  kAddClient,\n  kRemoveClient,\n  kGetDispatcher\n}\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;;;;;;;;;;;AAEA,CAAA,MAAM,cAAc,GAAGA,wBAAA;AACvB,CAAA,MAAM,UAAU,GAAGC,oBAAA;CACnB,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAGC,iBAAA;AAC5G,CAAA,MAAM,SAAS,GAAGC,mBAAA;;AAElB,CAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS;AACjC,CAAA,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW;AACrC,CAAA,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO;AAC7B,CAAA,MAAM,cAAc,GAAG,MAAM,CAAC,gBAAgB;AAC9C,CAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS;AACjC,CAAA,MAAM,UAAU,GAAG,MAAM,CAAC,WAAW;AACrC,CAAA,MAAM,aAAa,GAAG,MAAM,CAAC,cAAc;AAC3C,CAAA,MAAM,kBAAkB,GAAG,MAAM,CAAC,mBAAmB;AACrD,CAAA,MAAM,cAAc,GAAG,MAAM,CAAC,gBAAgB;AAC9C,CAAA,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY;AACtC,CAAA,MAAM,aAAa,GAAG,MAAM,CAAC,eAAe;AAC5C,CAAA,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO;;CAE7B,MAAM,QAAQ,SAAS,cAAc,CAAC;GACpC,WAAW,CAAC,GAAG;AACjB,KAAI,KAAK;;AAET,KAAI,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,UAAU;AACjC,KAAI,IAAI,CAAC,QAAQ,CAAC,GAAG;AACrB,KAAI,IAAI,CAAC,OAAO,CAAC,GAAG;;KAEhB,MAAM,IAAI,GAAG;;KAEb,IAAI,CAAC,QAAQ,CAAC,GAAG,SAAS,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE;AACxD,OAAM,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM;;OAEzB,IAAI,SAAS,GAAG;;OAEhB,OAAO,CAAC,SAAS,EAAE;AACzB,SAAQ,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK;SACxB,IAAI,CAAC,IAAI,EAAE;WACT;AACV,SAAA;SACQ,IAAI,CAAC,OAAO,CAAC;AACrB,SAAQ,SAAS,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO;AAC1D,OAAA;;AAEA,OAAM,IAAI,CAAC,UAAU,CAAC,GAAG;;OAEnB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE;AACjD,SAAQ,IAAI,CAAC,UAAU,CAAC,GAAG;AAC3B,SAAQ,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC;AACrD,OAAA;;OAEM,IAAI,IAAI,CAAC,cAAc,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,EAAE;SAC3C;AACR,YAAW,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AACjD,YAAW,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC;AACpC,OAAA;AACA,KAAA;;KAEI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,KAAK;AAC5C,OAAM,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC;AACrD,KAAA;;KAEI,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK;AACpD,OAAM,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,EAAE,GAAG;AAC7D,KAAA;;KAEI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,KAAK;AACzD,OAAM,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,MAAM,EAAE,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,EAAE,GAAG;AAClE,KAAA;;KAEI,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC,IAAI;AACrC,GAAA;;GAEE,KAAK,KAAK,EAAE,GAAG;KACb,OAAO,IAAI,CAAC,UAAU;AAC1B,GAAA;;GAEE,KAAK,UAAU,EAAE,GAAG;AACtB,KAAI,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;AAC/D,GAAA;;GAEE,KAAK,KAAK,EAAE,GAAG;KACb,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;AACtF,GAAA;;GAEE,KAAK,QAAQ,EAAE,GAAG;AACpB,KAAI,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO;AAC1B,KAAI,KAAK,MAAM,EAAE,CAAC,QAAQ,GAAG,OAAO,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE;AAC1D,OAAM,GAAG,IAAI;AACb,KAAA;AACA,KAAI,OAAO;AACX,GAAA;;GAEE,KAAK,QAAQ,EAAE,GAAG;KAChB,IAAI,GAAG,GAAG;AACd,KAAI,KAAK,MAAM,EAAE,CAAC,QAAQ,GAAG,OAAO,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE;AAC1D,OAAM,GAAG,IAAI;AACb,KAAA;AACA,KAAI,OAAO;AACX,GAAA;;GAEE,KAAK,KAAK,EAAE,GAAG;AACjB,KAAI,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO;AAC1B,KAAI,KAAK,MAAM,EAAE,CAAC,KAAK,GAAG,IAAI,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,EAAE;AACpD,OAAM,GAAG,IAAI;AACb,KAAA;AACA,KAAI,OAAO;AACX,GAAA;;GAEE,IAAI,KAAK,CAAC,GAAG;KACX,OAAO,IAAI,CAAC,MAAM;AACtB,GAAA;;GAEE,OAAO,MAAM,EAAE,GAAG;KAChB,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,EAAE;AAChC,OAAM,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;AAC3D,KAAA,CAAK,MAAM;AACX,OAAM,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,KAAK;AACtC,SAAQ,IAAI,CAAC,cAAc,CAAC,GAAG;OAC/B,CAAO;AACP,KAAA;AACA,GAAA;;AAEA,GAAE,OAAO,QAAQ,EAAE,CAAC,GAAG,EAAE;KACrB,OAAO,IAAI,EAAE;OACX,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK;OAC/B,IAAI,CAAC,IAAI,EAAE;SACT;AACR,OAAA;AACA,OAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG;AAC9B,KAAA;;KAEI,OAAO,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AAC9D,GAAA;;AAEA,GAAE,CAAC,SAAS,EAAE,CAAC,IAAI,EAAE,OAAO,EAAE;AAC9B,KAAI,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC;;KAEvC,IAAI,CAAC,UAAU,EAAE;AACrB,OAAM,IAAI,CAAC,UAAU,CAAC,GAAG;OACnB,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE;OACnC,IAAI,CAAC,OAAO,CAAC;KACnB,CAAK,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE;AACpD,OAAM,UAAU,CAAC,UAAU,CAAC,GAAG;OACzB,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,CAAC;AAC9C,KAAA;;AAEA,KAAI,OAAO,CAAC,IAAI,CAAC,UAAU;AAC3B,GAAA;;AAEA,GAAE,CAAC,UAAU,EAAE,CAAC,MAAM,EAAE;KACpB;AACJ,QAAO,EAAE,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC;AACjC,QAAO,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC;AACrC,QAAO,EAAE,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC;AAC3C,QAAO,EAAE,CAAC,iBAAiB,EAAE,IAAI,CAAC,kBAAkB,CAAC;;AAErD,KAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,MAAM;;AAE9B,KAAI,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE;AAC1B,OAAM,OAAO,CAAC,QAAQ,CAAC,MAAM;AAC7B,SAAQ,IAAI,IAAI,CAAC,UAAU,CAAC,EAAE;AAC9B,WAAU,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC;AACrD,SAAA;OACA,CAAO;AACP,KAAA;;AAEA,KAAI,OAAO;AACX,GAAA;;AAEA,GAAE,CAAC,aAAa,EAAE,CAAC,MAAM,EAAE;AAC3B,KAAI,MAAM,CAAC,KAAK,CAAC,MAAM;OACjB,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,MAAM;AAC/C,OAAM,IAAI,GAAG,KAAK,EAAE,EAAE;SACd,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;AACpC,OAAA;KACA,CAAK;;AAEL,KAAI,IAAI,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU;AACrD,OAAM,CAAC,UAAU,CAAC,UAAU,CAAC;AAC7B,OAAM,UAAU,CAAC,MAAM,KAAK,IAAI;OAC1B,UAAU,CAAC,SAAS,KAAK;MAC1B;AACL,GAAA;AACA;;AAEA,CAAA,QAAc,GAAG;AACjB,GAAE,QAAQ;AACV,GAAE,QAAQ;AACV,GAAE,UAAU;AACZ,GAAE,UAAU;AACZ,GAAE,aAAa;GACb;AACF;;;;;;","x_google_ignoreList":[0]}

package/lib/cjs/__/undici/lib/pool-stats.js

@@ -0,0 +1,49 @@
+'use strict';
+
+var symbols = require('./core/symbols.js');
+
+var poolStats;
+var hasRequiredPoolStats;
+
+function requirePoolStats () {
+	if (hasRequiredPoolStats) return poolStats;
+	hasRequiredPoolStats = 1;
+	const { kFree, kConnected, kPending, kQueued, kRunning, kSize } = symbols.__require();
+	const kPool = Symbol('pool');
+
+	class PoolStats {
+	  constructor (pool) {
+	    this[kPool] = pool;
+	  }
+
+	  get connected () {
+	    return this[kPool][kConnected]
+	  }
+
+	  get free () {
+	    return this[kPool][kFree]
+	  }
+
+	  get pending () {
+	    return this[kPool][kPending]
+	  }
+
+	  get queued () {
+	    return this[kPool][kQueued]
+	  }
+
+	  get running () {
+	    return this[kPool][kRunning]
+	  }
+
+	  get size () {
+	    return this[kPool][kSize]
+	  }
+	}
+
+	poolStats = PoolStats;
+	return poolStats;
+}
+
+exports.__require = requirePoolStats;
+//# sourceMappingURL=pool-stats.js.map

package/lib/cjs/__/undici/lib/pool-stats.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool-stats.js","sources":["../../../../../../../node_modules/undici/lib/pool-stats.js"],"sourcesContent":["const { kFree, kConnected, kPending, kQueued, kRunning, kSize } = require('./core/symbols')\nconst kPool = Symbol('pool')\n\nclass PoolStats {\n  constructor (pool) {\n    this[kPool] = pool\n  }\n\n  get connected () {\n    return this[kPool][kConnected]\n  }\n\n  get free () {\n    return this[kPool][kFree]\n  }\n\n  get pending () {\n    return this[kPool][kPending]\n  }\n\n  get queued () {\n    return this[kPool][kQueued]\n  }\n\n  get running () {\n    return this[kPool][kRunning]\n  }\n\n  get size () {\n    return this[kPool][kSize]\n  }\n}\n\nmodule.exports = PoolStats\n"],"names":["require$$0"],"mappings":";;;;;;;;;;AAAA,CAAA,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAGA,iBAAA;AAClE,CAAA,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM;;AAE3B,CAAA,MAAM,SAAS,CAAC;AAChB,GAAE,WAAW,CAAC,CAAC,IAAI,EAAE;AACrB,KAAI,IAAI,CAAC,KAAK,CAAC,GAAG;AAClB,GAAA;;GAEE,IAAI,SAAS,CAAC,GAAG;AACnB,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,UAAU;AACjC,GAAA;;GAEE,IAAI,IAAI,CAAC,GAAG;AACd,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK;AAC5B,GAAA;;GAEE,IAAI,OAAO,CAAC,GAAG;AACjB,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ;AAC/B,GAAA;;GAEE,IAAI,MAAM,CAAC,GAAG;AAChB,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO;AAC9B,GAAA;;GAEE,IAAI,OAAO,CAAC,GAAG;AACjB,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ;AAC/B,GAAA;;GAEE,IAAI,IAAI,CAAC,GAAG;AACd,KAAI,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK;AAC5B,GAAA;AACA;;AAEA,CAAA,SAAc,GAAG;;;;;;","x_google_ignoreList":[0]}

package/lib/cjs/__/undici/lib/pool.js

@@ -0,0 +1,127 @@
+'use strict';
+
+var poolBase = require('./pool-base.js');
+var client = require('./client.js');
+var errors = require('./core/errors.js');
+var util = require('./core/util.js');
+var symbols = require('./core/symbols.js');
+var connect = require('./core/connect.js');
+
+var pool;
+var hasRequiredPool;
+
+function requirePool () {
+	if (hasRequiredPool) return pool;
+	hasRequiredPool = 1;
+
+	const {
+	  PoolBase,
+	  kClients,
+	  kNeedDrain,
+	  kAddClient,
+	  kGetDispatcher
+	} = poolBase.__require();
+	const Client = client.__require();
+	const {
+	  InvalidArgumentError
+	} = errors.__require();
+	const util$1 = util.__require();
+	const { kUrl, kInterceptors } = symbols.__require();
+	const buildConnector = connect.__require();
+
+	const kOptions = Symbol('options');
+	const kConnections = Symbol('connections');
+	const kFactory = Symbol('factory');
+
+	function defaultFactory (origin, opts) {
+	  return new Client(origin, opts)
+	}
+
+	class Pool extends PoolBase {
+	  constructor (origin, {
+	    connections,
+	    factory = defaultFactory,
+	    connect,
+	    connectTimeout,
+	    tls,
+	    maxCachedSessions,
+	    socketPath,
+	    autoSelectFamily,
+	    autoSelectFamilyAttemptTimeout,
+	    allowH2,
+	    ...options
+	  } = {}) {
+	    super();
+
+	    if (connections != null && (!Number.isFinite(connections) || connections < 0)) {
+	      throw new InvalidArgumentError('invalid connections')
+	    }
+
+	    if (typeof factory !== 'function') {
+	      throw new InvalidArgumentError('factory must be a function.')
+	    }
+
+	    if (connect != null && typeof connect !== 'function' && typeof connect !== 'object') {
+	      throw new InvalidArgumentError('connect must be a function or an object')
+	    }
+
+	    if (typeof connect !== 'function') {
+	      connect = buildConnector({
+	        ...tls,
+	        maxCachedSessions,
+	        allowH2,
+	        socketPath,
+	        timeout: connectTimeout,
+	        ...(util$1.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : undefined),
+	        ...connect
+	      });
+	    }
+
+	    this[kInterceptors] = options.interceptors && options.interceptors.Pool && Array.isArray(options.interceptors.Pool)
+	      ? options.interceptors.Pool
+	      : [];
+	    this[kConnections] = connections || null;
+	    this[kUrl] = util$1.parseOrigin(origin);
+	    this[kOptions] = { ...util$1.deepClone(options), connect, allowH2 };
+	    this[kOptions].interceptors = options.interceptors
+	      ? { ...options.interceptors }
+	      : undefined;
+	    this[kFactory] = factory;
+
+	    this.on('connectionError', (origin, targets, error) => {
+	      // If a connection error occurs, we remove the client from the pool,
+	      // and emit a connectionError event. They will not be re-used.
+	      // Fixes https://github.com/nodejs/undici/issues/3895
+	      for (const target of targets) {
+	        // Do not use kRemoveClient here, as it will close the client,
+	        // but the client cannot be closed in this state.
+	        const idx = this[kClients].indexOf(target);
+	        if (idx !== -1) {
+	          this[kClients].splice(idx, 1);
+	        }
+	      }
+	    });
+	  }
+
+	  [kGetDispatcher] () {
+	    let dispatcher = this[kClients].find(dispatcher => !dispatcher[kNeedDrain]);
+
+	    if (dispatcher) {
+	      return dispatcher
+	    }
+
+	    if (!this[kConnections] || this[kClients].length < this[kConnections]) {
+	      dispatcher = this[kFactory](this[kUrl], this[kOptions]);
+	      this[kAddClient](dispatcher);
+	    }
+
+	    return dispatcher
+	  }
+	}
+
+	pool = Pool;
+	return pool;
+}
+
+exports.__require = requirePool;
+//# sourceMappingURL=pool.js.map

package/lib/cjs/__/undici/lib/pool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pool.js","sources":["../../../../../../../node_modules/undici/lib/pool.js"],"sourcesContent":["'use strict'\n\nconst {\n  PoolBase,\n  kClients,\n  kNeedDrain,\n  kAddClient,\n  kGetDispatcher\n} = require('./pool-base')\nconst Client = require('./client')\nconst {\n  InvalidArgumentError\n} = require('./core/errors')\nconst util = require('./core/util')\nconst { kUrl, kInterceptors } = require('./core/symbols')\nconst buildConnector = require('./core/connect')\n\nconst kOptions = Symbol('options')\nconst kConnections = Symbol('connections')\nconst kFactory = Symbol('factory')\n\nfunction defaultFactory (origin, opts) {\n  return new Client(origin, opts)\n}\n\nclass Pool extends PoolBase {\n  constructor (origin, {\n    connections,\n    factory = defaultFactory,\n    connect,\n    connectTimeout,\n    tls,\n    maxCachedSessions,\n    socketPath,\n    autoSelectFamily,\n    autoSelectFamilyAttemptTimeout,\n    allowH2,\n    ...options\n  } = {}) {\n    super()\n\n    if (connections != null && (!Number.isFinite(connections) || connections < 0)) {\n      throw new InvalidArgumentError('invalid connections')\n    }\n\n    if (typeof factory !== 'function') {\n      throw new InvalidArgumentError('factory must be a function.')\n    }\n\n    if (connect != null && typeof connect !== 'function' && typeof connect !== 'object') {\n      throw new InvalidArgumentError('connect must be a function or an object')\n    }\n\n    if (typeof connect !== 'function') {\n      connect = buildConnector({\n        ...tls,\n        maxCachedSessions,\n        allowH2,\n        socketPath,\n        timeout: connectTimeout,\n        ...(util.nodeHasAutoSelectFamily && autoSelectFamily ? { autoSelectFamily, autoSelectFamilyAttemptTimeout } : undefined),\n        ...connect\n      })\n    }\n\n    this[kInterceptors] = options.interceptors && options.interceptors.Pool && Array.isArray(options.interceptors.Pool)\n      ? options.interceptors.Pool\n      : []\n    this[kConnections] = connections || null\n    this[kUrl] = util.parseOrigin(origin)\n    this[kOptions] = { ...util.deepClone(options), connect, allowH2 }\n    this[kOptions].interceptors = options.interceptors\n      ? { ...options.interceptors }\n      : undefined\n    this[kFactory] = factory\n\n    this.on('connectionError', (origin, targets, error) => {\n      // If a connection error occurs, we remove the client from the pool,\n      // and emit a connectionError event. They will not be re-used.\n      // Fixes https://github.com/nodejs/undici/issues/3895\n      for (const target of targets) {\n        // Do not use kRemoveClient here, as it will close the client,\n        // but the client cannot be closed in this state.\n        const idx = this[kClients].indexOf(target)\n        if (idx !== -1) {\n          this[kClients].splice(idx, 1)\n        }\n      }\n    })\n  }\n\n  [kGetDispatcher] () {\n    let dispatcher = this[kClients].find(dispatcher => !dispatcher[kNeedDrain])\n\n    if (dispatcher) {\n      return dispatcher\n    }\n\n    if (!this[kConnections] || this[kClients].length < this[kConnections]) {\n      dispatcher = this[kFactory](this[kUrl], this[kOptions])\n      this[kAddClient](dispatcher)\n    }\n\n    return dispatcher\n  }\n}\n\nmodule.exports = Pool\n"],"names":["require$$0","require$$1","require$$2","util","require$$3","require$$4","require$$5"],"mappings":";;;;;;;;;;;;;;;;CAEA,MAAM;AACN,GAAE,QAAQ;AACV,GAAE,QAAQ;AACV,GAAE,UAAU;AACZ,GAAE,UAAU;GACV;AACF,EAAC,GAAGA,kBAAA;AACJ,CAAA,MAAM,MAAM,GAAGC,gBAAA;CACf,MAAM;GACJ;AACF,EAAC,GAAGC,gBAAA;AACJ,CAAA,MAAMC,MAAI,GAAGC,cAAA;AACb,CAAA,MAAM,EAAE,IAAI,EAAE,aAAa,EAAE,GAAGC,iBAAA;AAChC,CAAA,MAAM,cAAc,GAAGC,iBAAA;;AAEvB,CAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS;AACjC,CAAA,MAAM,YAAY,GAAG,MAAM,CAAC,aAAa;AACzC,CAAA,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS;;AAEjC,CAAA,SAAS,cAAc,EAAE,MAAM,EAAE,IAAI,EAAE;AACvC,GAAE,OAAO,IAAI,MAAM,CAAC,MAAM,EAAE,IAAI;AAChC,CAAA;;CAEA,MAAM,IAAI,SAAS,QAAQ,CAAC;AAC5B,GAAE,WAAW,CAAC,CAAC,MAAM,EAAE;AACvB,KAAI,WAAW;KACX,OAAO,GAAG,cAAc;AAC5B,KAAI,OAAO;AACX,KAAI,cAAc;AAClB,KAAI,GAAG;AACP,KAAI,iBAAiB;AACrB,KAAI,UAAU;AACd,KAAI,gBAAgB;AACpB,KAAI,8BAA8B;AAClC,KAAI,OAAO;AACX,KAAI,GAAG;IACJ,GAAG,EAAE,EAAE;AACV,KAAI,KAAK;;AAET,KAAI,IAAI,WAAW,IAAI,IAAI,KAAK,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC,CAAC,EAAE;AACnF,OAAM,MAAM,IAAI,oBAAoB,CAAC,qBAAqB;AAC1D,KAAA;;AAEA,KAAI,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE;AACvC,OAAM,MAAM,IAAI,oBAAoB,CAAC,6BAA6B;AAClE,KAAA;;AAEA,KAAI,IAAI,OAAO,IAAI,IAAI,IAAI,OAAO,OAAO,KAAK,UAAU,IAAI,OAAO,OAAO,KAAK,QAAQ,EAAE;AACzF,OAAM,MAAM,IAAI,oBAAoB,CAAC,yCAAyC;AAC9E,KAAA;;AAEA,KAAI,IAAI,OAAO,OAAO,KAAK,UAAU,EAAE;OACjC,OAAO,GAAG,cAAc,CAAC;AAC/B,SAAQ,GAAG,GAAG;AACd,SAAQ,iBAAiB;AACzB,SAAQ,OAAO;AACf,SAAQ,UAAU;SACV,OAAO,EAAE,cAAc;AAC/B,SAAQ,IAAIH,MAAI,CAAC,uBAAuB,IAAI,gBAAgB,GAAG,EAAE,gBAAgB,EAAE,8BAA8B,EAAE,GAAG,SAAS,CAAC;AAChI,SAAQ,GAAG;QACJ;AACP,KAAA;;KAEI,IAAI,CAAC,aAAa,CAAC,GAAG,OAAO,CAAC,YAAY,IAAI,OAAO,CAAC,YAAY,CAAC,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI;SAC9G,OAAO,CAAC,YAAY,CAAC;SACrB;AACR,KAAI,IAAI,CAAC,YAAY,CAAC,GAAG,WAAW,IAAI;KACpC,IAAI,CAAC,IAAI,CAAC,GAAGA,MAAI,CAAC,WAAW,CAAC,MAAM;AACxC,KAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAGA,MAAI,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,OAAO,EAAE,OAAO;KAC/D,IAAI,CAAC,QAAQ,CAAC,CAAC,YAAY,GAAG,OAAO,CAAC;AAC1C,SAAQ,EAAE,GAAG,OAAO,CAAC,YAAY;SACzB;AACR,KAAI,IAAI,CAAC,QAAQ,CAAC,GAAG;;AAErB,KAAI,IAAI,CAAC,EAAE,CAAC,iBAAiB,EAAE,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,KAAK;AAC3D;AACA;AACA;AACA,OAAM,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;AACpC;AACA;SACQ,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,MAAM;AACjD,SAAQ,IAAI,GAAG,KAAK,EAAE,EAAE;WACd,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC;AACtC,SAAA;AACA,OAAA;KACA,CAAK;AACL,GAAA;;GAEE,CAAC,cAAc,EAAE,GAAG;AACtB,KAAI,IAAI,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC;;KAE1E,IAAI,UAAU,EAAE;AACpB,OAAM,OAAO;AACb,KAAA;;AAEA,KAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE;AAC3E,OAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,QAAQ,CAAC;AAC5D,OAAM,IAAI,CAAC,UAAU,CAAC,CAAC,UAAU;AACjC,KAAA;;AAEA,KAAI,OAAO;AACX,GAAA;AACA;;AAEA,CAAA,IAAc,GAAG;;;;;;","x_google_ignoreList":[0]}