@qraft/asyncapi-plugin 1.0.0-beta.2 → 1.0.0-beta.4

package/dist/_vendor/define-data-property/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/define-data-property/index.js"],"sourcesContent":["'use strict';\n\nvar $defineProperty = require('es-define-property');\n\nvar $SyntaxError = require('es-errors/syntax');\nvar $TypeError = require('es-errors/type');\n\nvar gopd = require('gopd');\n\n/** @type {import('.')} */\nmodule.exports = function defineDataProperty(\n\tobj,\n\tproperty,\n\tvalue\n) {\n\tif (!obj || (typeof obj !== 'object' && typeof obj !== 'function')) {\n\t\tthrow new $TypeError('`obj` must be an object or a function`');\n\t}\n\tif (typeof property !== 'string' && typeof property !== 'symbol') {\n\t\tthrow new $TypeError('`property` must be a string or a symbol`');\n\t}\n\tif (arguments.length > 3 && typeof arguments[3] !== 'boolean' && arguments[3] !== null) {\n\t\tthrow new $TypeError('`nonEnumerable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 4 && typeof arguments[4] !== 'boolean' && arguments[4] !== null) {\n\t\tthrow new $TypeError('`nonWritable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 5 && typeof arguments[5] !== 'boolean' && arguments[5] !== null) {\n\t\tthrow new $TypeError('`nonConfigurable`, if provided, must be a boolean or null');\n\t}\n\tif (arguments.length > 6 && typeof arguments[6] !== 'boolean') {\n\t\tthrow new $TypeError('`loose`, if provided, must be a boolean');\n\t}\n\n\tvar nonEnumerable = arguments.length > 3 ? arguments[3] : null;\n\tvar nonWritable = arguments.length > 4 ? arguments[4] : null;\n\tvar nonConfigurable = arguments.length > 5 ? arguments[5] : null;\n\tvar loose = arguments.length > 6 ? arguments[6] : false;\n\n\t/* @type {false | TypedPropertyDescriptor<unknown>} */\n\tvar desc = !!gopd && gopd(obj, property);\n\n\tif ($defineProperty) {\n\t\t$defineProperty(obj, property, {\n\t\t\tconfigurable: nonConfigurable === null && desc ? desc.configurable : !nonConfigurable,\n\t\t\tenumerable: nonEnumerable === null && desc ? desc.enumerable : !nonEnumerable,\n\t\t\tvalue: value,\n\t\t\twritable: nonWritable === null && desc ? desc.writable : !nonWritable\n\t\t});\n\t} else if (loose || (!nonEnumerable && !nonWritable && !nonConfigurable)) {\n\t\t// must fall back to [[Set]], and was not explicitly asked to make non-enumerable, non-writable, or non-configurable\n\t\tobj[property] = value; // eslint-disable-line no-param-reassign\n\t} else {\n\t\tthrow new $SyntaxError('This environment does not support defining a property as non-configurable, non-writable, or non-enumerable.');\n\t}\n};\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;;;;;;;;;CAEA,IAAI,eAAe,iBAAgCA,uBAAA,EAAA,CAAA;;CAEnD,IAAI,YAAY,iBAA8BC,aAAA,EAAA,CAAA;CAC9C,IAAI,UAAU,iBAA4BC,WAAA,EAAA,CAAA;;CAE1C,IAAI,IAAI,iBAAkBC,WAAA,EAAA,CAAA;;AAE1B;AACA,CAAc,kBAAA,GAAG,SAAS,kBAAkB;AAC5C,EAAC,GAAG;AACJ,EAAC,QAAQ;EACR,KAAA;GACC;AACF,EAAC,IAAI,CAAC,GAAG,KAAK,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,UAAU,CAAC,EAAE;AACrE,GAAE,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAA;AAChE,GAAA;EACC,IAAI,OAAO,QAAQ,KAAK,QAAQ,IAAI,OAAO,QAAQ,KAAK,QAAQ,EAAE;AACnE,GAAE,MAAM,IAAI,UAAU,CAAC,0CAA0C,CAAC,CAAA;AAClE,GAAA;EACC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;AACzF,GAAE,MAAM,IAAI,UAAU,CAAC,yDAAyD,CAAC,CAAA;AACjF,GAAA;EACC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;AACzF,GAAE,MAAM,IAAI,UAAU,CAAC,uDAAuD,CAAC,CAAA;AAC/E,GAAA;EACC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE;AACzF,GAAE,MAAM,IAAI,UAAU,CAAC,2DAA2D,CAAC,CAAA;AACnF,GAAA;AACA,EAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,OAAO,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,EAAE;AAChE,GAAE,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAA;AACjE,GAAA;;AAEA,EAAC,IAAI,aAAa,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;AAC/D,EAAC,IAAI,WAAW,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;AAC7D,EAAC,IAAI,eAAe,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;AACjE,EAAC,IAAI,KAAK,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;;AAExD;AACA,EAAC,IAAI,IAAI,GAAG,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAA;;EAExC,IAAI,eAAe,EAAE;AACtB,GAAE,eAAe,CAAC,GAAG,EAAE,QAAQ,EAAE;AACjC,IAAG,YAAY,EAAE,eAAe,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,YAAY,GAAG,CAAC,eAAe;AACxF,IAAG,UAAU,EAAE,aAAa,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,UAAU,GAAG,CAAC,aAAa;IAC7E,KAAK,EAAE,KAAK;AACf,IAAG,QAAQ,EAAE,WAAW,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,WAAA;AAC7D,IAAG,CAAC,CAAA;AACJ,GAAE,MAAM,IAAI,KAAK,KAAK,CAAC,aAAa,IAAI,CAAC,WAAW,IAAI,CAAC,eAAe,CAAC,EAAE;AAC3E;AACA,GAAE,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;AACxB,GAAE,MAAM;AACR,GAAE,MAAM,IAAI,YAAY,CAAC,6GAA6G,CAAC,CAAA;AACvI,GAAA;EACC,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/_vendor/define-properties/index.js

@@ -1,61 +0,0 @@
-import { __require as requireObjectKeys } from '../object-keys/index.js';
-import { __require as requireDefineDataProperty } from '../define-data-property/index.js';
-import { __require as requireHasPropertyDescriptors } from '../has-property-descriptors/index.js';
-
-var defineProperties_1;
-var hasRequiredDefineProperties;
-
-function requireDefineProperties () {
-	if (hasRequiredDefineProperties) return defineProperties_1;
-	hasRequiredDefineProperties = 1;
-
-	var keys = /*@__PURE__*/ requireObjectKeys();
-	var hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';
-
-	var toStr = Object.prototype.toString;
-	var concat = Array.prototype.concat;
-	var defineDataProperty = /*@__PURE__*/ requireDefineDataProperty();
-
-	var isFunction = function (fn) {
-		return typeof fn === 'function' && toStr.call(fn) === '[object Function]';
-	};
-
-	var supportsDescriptors = /*@__PURE__*/ requireHasPropertyDescriptors()();
-
-	var defineProperty = function (object, name, value, predicate) {
-		if (name in object) {
-			if (predicate === true) {
-				if (object[name] === value) {
-					return;
-				}
-			} else if (!isFunction(predicate) || !predicate()) {
-				return;
-			}
-		}
-
-		if (supportsDescriptors) {
-			defineDataProperty(object, name, value, true);
-		} else {
-			defineDataProperty(object, name, value);
-		}
-	};
-
-	var defineProperties = function (object, map) {
-		var predicates = arguments.length > 2 ? arguments[2] : {};
-		var props = keys(map);
-		if (hasSymbols) {
-			props = concat.call(props, Object.getOwnPropertySymbols(map));
-		}
-		for (var i = 0; i < props.length; i += 1) {
-			defineProperty(object, props[i], map[props[i]], predicates[props[i]]);
-		}
-	};
-
-	defineProperties.supportsDescriptors = !!supportsDescriptors;
-
-	defineProperties_1 = defineProperties;
-	return defineProperties_1;
-}
-
-export { requireDefineProperties as __require };
-//# sourceMappingURL=index.js.map

package/dist/_vendor/define-properties/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../node_modules/define-properties/index.js"],"sourcesContent":["'use strict';\n\nvar keys = require('object-keys');\nvar hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';\n\nvar toStr = Object.prototype.toString;\nvar concat = Array.prototype.concat;\nvar defineDataProperty = require('define-data-property');\n\nvar isFunction = function (fn) {\n\treturn typeof fn === 'function' && toStr.call(fn) === '[object Function]';\n};\n\nvar supportsDescriptors = require('has-property-descriptors')();\n\nvar defineProperty = function (object, name, value, predicate) {\n\tif (name in object) {\n\t\tif (predicate === true) {\n\t\t\tif (object[name] === value) {\n\t\t\t\treturn;\n\t\t\t}\n\t\t} else if (!isFunction(predicate) || !predicate()) {\n\t\t\treturn;\n\t\t}\n\t}\n\n\tif (supportsDescriptors) {\n\t\tdefineDataProperty(object, name, value, true);\n\t} else {\n\t\tdefineDataProperty(object, name, value);\n\t}\n};\n\nvar defineProperties = function (object, map) {\n\tvar predicates = arguments.length > 2 ? arguments[2] : {};\n\tvar props = keys(map);\n\tif (hasSymbols) {\n\t\tprops = concat.call(props, Object.getOwnPropertySymbols(map));\n\t}\n\tfor (var i = 0; i < props.length; i += 1) {\n\t\tdefineProperty(object, props[i], map[props[i]], predicates[props[i]]);\n\t}\n};\n\ndefineProperties.supportsDescriptors = !!supportsDescriptors;\n\nmodule.exports = defineProperties;\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;CAEA,IAAI,IAAI,iBAAyBA,iBAAA,EAAA,CAAA;AACjC,CAAA,IAAI,UAAU,GAAG,OAAO,MAAM,KAAK,UAAU,IAAI,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,QAAQ,CAAA;;AAElF,CAAA,IAAI,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAA;AACrC,CAAA,IAAI,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,CAAA;CACnC,IAAI,kBAAkB,iBAAkCC,yBAAA,EAAA,CAAA;;AAExD,CAAA,IAAI,UAAU,GAAG,UAAU,EAAE,EAAE;AAC/B,EAAC,OAAO,OAAO,EAAE,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,mBAAmB,CAAA;EACzE,CAAA;;CAED,IAAI,mBAAmB,iBAAGC,6BAAA,EAAmC,EAAE,CAAA;;CAE/D,IAAI,cAAc,GAAG,UAAU,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE;AAC/D,EAAC,IAAI,IAAI,IAAI,MAAM,EAAE;AACrB,GAAE,IAAI,SAAS,KAAK,IAAI,EAAE;AAC1B,IAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,KAAK,EAAE;KAC3B,OAAA;AACJ,KAAA;IACG,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,EAAE,EAAE;IAClD,OAAA;AACH,IAAA;AACA,GAAA;;EAEC,IAAI,mBAAmB,EAAE;GACxB,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAA;AAC/C,GAAE,MAAM;AACR,GAAE,kBAAkB,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;AACzC,GAAA;EACC,CAAA;;AAED,CAAA,IAAI,gBAAgB,GAAG,UAAU,MAAM,EAAE,GAAG,EAAE;AAC9C,EAAC,IAAI,UAAU,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,EAAE,CAAA;AAC1D,EAAC,IAAI,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA;EACrB,IAAI,UAAU,EAAE;AACjB,GAAE,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAA;AAC/D,GAAA;AACA,EAAC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;GACzC,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACvE,GAAA;EACC,CAAA;;AAED,CAAA,gBAAgB,CAAC,mBAAmB,GAAG,CAAC,CAAC,mBAAmB,CAAA;;AAE5D,CAAA,kBAAc,GAAG,gBAAgB,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/_vendor/dependency-graph/lib/dep_graph.js

@@ -1,376 +0,0 @@
-import { __exports as dep_graph } from '../../../_virtual/dep_graph.js';
-
-/**
- * A simple dependency graph
- */
-
-var hasRequiredDep_graph;
-
-function requireDep_graph () {
-	if (hasRequiredDep_graph) return dep_graph;
-	hasRequiredDep_graph = 1;
-	/**
-	 * Helper for creating a Topological Sort using Depth-First-Search on a set of edges.
-	 *
-	 * Detects cycles and throws an Error if one is detected (unless the "circular"
-	 * parameter is "true" in which case it ignores them).
-	 *
-	 * @param edges The set of edges to DFS through
-	 * @param leavesOnly Whether to only return "leaf" nodes (ones who have no edges)
-	 * @param result An array in which the results will be populated
-	 * @param circular A boolean to allow circular dependencies
-	 */
-	function createDFS(edges, leavesOnly, result, circular) {
-	  var visited = {};
-	  return function (start) {
-	    if (visited[start]) {
-	      return;
-	    }
-	    var inCurrentPath = {};
-	    var currentPath = [];
-	    var todo = []; // used as a stack
-	    todo.push({ node: start, processed: false });
-	    while (todo.length > 0) {
-	      var current = todo[todo.length - 1]; // peek at the todo stack
-	      var processed = current.processed;
-	      var node = current.node;
-	      if (!processed) {
-	        // Haven't visited edges yet (visiting phase)
-	        if (visited[node]) {
-	          todo.pop();
-	          continue;
-	        } else if (inCurrentPath[node]) {
-	          // It's not a DAG
-	          if (circular) {
-	            todo.pop();
-	            // If we're tolerating cycles, don't revisit the node
-	            continue;
-	          }
-	          currentPath.push(node);
-	          throw new DepGraphCycleError(currentPath);
-	        }
-
-	        inCurrentPath[node] = true;
-	        currentPath.push(node);
-	        var nodeEdges = edges[node];
-	        // (push edges onto the todo stack in reverse order to be order-compatible with the old DFS implementation)
-	        for (var i = nodeEdges.length - 1; i >= 0; i--) {
-	          todo.push({ node: nodeEdges[i], processed: false });
-	        }
-	        current.processed = true;
-	      } else {
-	        // Have visited edges (stack unrolling phase)
-	        todo.pop();
-	        currentPath.pop();
-	        inCurrentPath[node] = false;
-	        visited[node] = true;
-	        if (!leavesOnly || edges[node].length === 0) {
-	          result.push(node);
-	        }
-	      }
-	    }
-	  };
-	}
-
-	/**
-	 * Simple Dependency Graph
-	 */
-	var DepGraph = (dep_graph.DepGraph = function DepGraph(opts) {
-	  this.nodes = {}; // Node -> Node/Data (treated like a Set)
-	  this.outgoingEdges = {}; // Node -> [Dependency Node]
-	  this.incomingEdges = {}; // Node -> [Dependant Node]
-	  this.circular = opts && !!opts.circular; // Allows circular deps
-	});
-	DepGraph.prototype = {
-	  /**
-	   * The number of nodes in the graph.
-	   */
-	  size: function () {
-	    return Object.keys(this.nodes).length;
-	  },
-	  /**
-	   * Add a node to the dependency graph. If a node already exists, this method will do nothing.
-	   */
-	  addNode: function (node, data) {
-	    if (!this.hasNode(node)) {
-	      // Checking the arguments length allows the user to add a node with undefined data
-	      if (arguments.length === 2) {
-	        this.nodes[node] = data;
-	      } else {
-	        this.nodes[node] = node;
-	      }
-	      this.outgoingEdges[node] = [];
-	      this.incomingEdges[node] = [];
-	    }
-	  },
-	  /**
-	   * Remove a node from the dependency graph. If a node does not exist, this method will do nothing.
-	   */
-	  removeNode: function (node) {
-	    if (this.hasNode(node)) {
-	      delete this.nodes[node];
-	      delete this.outgoingEdges[node];
-	      delete this.incomingEdges[node];
-	      [this.incomingEdges, this.outgoingEdges].forEach(function (edgeList) {
-	        Object.keys(edgeList).forEach(function (key) {
-	          var idx = edgeList[key].indexOf(node);
-	          if (idx >= 0) {
-	            edgeList[key].splice(idx, 1);
-	          }
-	        }, this);
-	      });
-	    }
-	  },
-	  /**
-	   * Check if a node exists in the graph
-	   */
-	  hasNode: function (node) {
-	    return this.nodes.hasOwnProperty(node);
-	  },
-	  /**
-	   * Get the data associated with a node name
-	   */
-	  getNodeData: function (node) {
-	    if (this.hasNode(node)) {
-	      return this.nodes[node];
-	    } else {
-	      throw new Error("Node does not exist: " + node);
-	    }
-	  },
-	  /**
-	   * Set the associated data for a given node name. If the node does not exist, this method will throw an error
-	   */
-	  setNodeData: function (node, data) {
-	    if (this.hasNode(node)) {
-	      this.nodes[node] = data;
-	    } else {
-	      throw new Error("Node does not exist: " + node);
-	    }
-	  },
-	  /**
-	   * Add a dependency between two nodes. If either of the nodes does not exist,
-	   * an Error will be thrown.
-	   */
-	  addDependency: function (from, to) {
-	    if (!this.hasNode(from)) {
-	      throw new Error("Node does not exist: " + from);
-	    }
-	    if (!this.hasNode(to)) {
-	      throw new Error("Node does not exist: " + to);
-	    }
-	    if (this.outgoingEdges[from].indexOf(to) === -1) {
-	      this.outgoingEdges[from].push(to);
-	    }
-	    if (this.incomingEdges[to].indexOf(from) === -1) {
-	      this.incomingEdges[to].push(from);
-	    }
-	    return true;
-	  },
-	  /**
-	   * Remove a dependency between two nodes.
-	   */
-	  removeDependency: function (from, to) {
-	    var idx;
-	    if (this.hasNode(from)) {
-	      idx = this.outgoingEdges[from].indexOf(to);
-	      if (idx >= 0) {
-	        this.outgoingEdges[from].splice(idx, 1);
-	      }
-	    }
-
-	    if (this.hasNode(to)) {
-	      idx = this.incomingEdges[to].indexOf(from);
-	      if (idx >= 0) {
-	        this.incomingEdges[to].splice(idx, 1);
-	      }
-	    }
-	  },
-	  /**
-	   * Return a clone of the dependency graph. If any custom data is attached
-	   * to the nodes, it will only be shallow copied.
-	   */
-	  clone: function () {
-	    var source = this;
-	    var result = new DepGraph();
-	    var keys = Object.keys(source.nodes);
-	    keys.forEach(function (n) {
-	      result.nodes[n] = source.nodes[n];
-	      result.outgoingEdges[n] = source.outgoingEdges[n].slice(0);
-	      result.incomingEdges[n] = source.incomingEdges[n].slice(0);
-	    });
-	    return result;
-	  },
-	  /**
-	   * Get an array containing the direct dependencies of the specified node.
-	   *
-	   * Throws an Error if the specified node does not exist.
-	   */
-	  directDependenciesOf: function (node) {
-	    if (this.hasNode(node)) {
-	      return this.outgoingEdges[node].slice(0);
-	    } else {
-	      throw new Error("Node does not exist: " + node);
-	    }
-	  },
-	  /**
-	   * Get an array containing the nodes that directly depend on the specified node.
-	   *
-	   * Throws an Error if the specified node does not exist.
-	   */
-	  directDependantsOf: function (node) {
-	    if (this.hasNode(node)) {
-	      return this.incomingEdges[node].slice(0);
-	    } else {
-	      throw new Error("Node does not exist: " + node);
-	    }
-	  },
-	  /**
-	   * Get an array containing the nodes that the specified node depends on (transitively).
-	   *
-	   * Throws an Error if the graph has a cycle, or the specified node does not exist.
-	   *
-	   * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned
-	   * in the array.
-	   */
-	  dependenciesOf: function (node, leavesOnly) {
-	    if (this.hasNode(node)) {
-	      var result = [];
-	      var DFS = createDFS(
-	        this.outgoingEdges,
-	        leavesOnly,
-	        result,
-	        this.circular
-	      );
-	      DFS(node);
-	      var idx = result.indexOf(node);
-	      if (idx >= 0) {
-	        result.splice(idx, 1);
-	      }
-	      return result;
-	    } else {
-	      throw new Error("Node does not exist: " + node);
-	    }
-	  },
-	  /**
-	   * get an array containing the nodes that depend on the specified node (transitively).
-	   *
-	   * Throws an Error if the graph has a cycle, or the specified node does not exist.
-	   *
-	   * If `leavesOnly` is true, only nodes that do not have any dependants will be returned in the array.
-	   */
-	  dependantsOf: function (node, leavesOnly) {
-	    if (this.hasNode(node)) {
-	      var result = [];
-	      var DFS = createDFS(
-	        this.incomingEdges,
-	        leavesOnly,
-	        result,
-	        this.circular
-	      );
-	      DFS(node);
-	      var idx = result.indexOf(node);
-	      if (idx >= 0) {
-	        result.splice(idx, 1);
-	      }
-	      return result;
-	    } else {
-	      throw new Error("Node does not exist: " + node);
-	    }
-	  },
-	  /**
-	   * Construct the overall processing order for the dependency graph.
-	   *
-	   * Throws an Error if the graph has a cycle.
-	   *
-	   * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned.
-	   */
-	  overallOrder: function (leavesOnly) {
-	    var self = this;
-	    var result = [];
-	    var keys = Object.keys(this.nodes);
-	    if (keys.length === 0) {
-	      return result; // Empty graph
-	    } else {
-	      if (!this.circular) {
-	        // Look for cycles - we run the DFS starting at all the nodes in case there
-	        // are several disconnected subgraphs inside this dependency graph.
-	        var CycleDFS = createDFS(this.outgoingEdges, false, [], this.circular);
-	        keys.forEach(function (n) {
-	          CycleDFS(n);
-	        });
-	      }
-
-	      var DFS = createDFS(
-	        this.outgoingEdges,
-	        leavesOnly,
-	        result,
-	        this.circular
-	      );
-	      // Find all potential starting points (nodes with nothing depending on them) an
-	      // run a DFS starting at these points to get the order
-	      keys
-	        .filter(function (node) {
-	          return self.incomingEdges[node].length === 0;
-	        })
-	        .forEach(function (n) {
-	          DFS(n);
-	        });
-
-	      // If we're allowing cycles - we need to run the DFS against any remaining
-	      // nodes that did not end up in the initial result (as they are part of a
-	      // subgraph that does not have a clear starting point)
-	      if (this.circular) {
-	        keys
-	          .filter(function (node) {
-	            return result.indexOf(node) === -1;
-	          })
-	          .forEach(function (n) {
-	            DFS(n);
-	          });
-	      }
-
-	      return result;
-	    }
-	  },
-	  /**
-	   * Get an array of nodes that have no dependants (i.e. nothing depends on them).
-	   */
-	  entryNodes: function () {
-	    var self = this;
-	    return Object.keys(this.nodes).filter(function (node) {
-	      return self.incomingEdges[node].length === 0;
-	    });
-	  }
-	};
-
-	// Create some aliases
-	DepGraph.prototype.directDependentsOf = DepGraph.prototype.directDependantsOf;
-	DepGraph.prototype.dependentsOf = DepGraph.prototype.dependantsOf;
-
-	/**
-	 * Cycle error, including the path of the cycle.
-	 */
-	var DepGraphCycleError = (dep_graph.DepGraphCycleError = function (cyclePath) {
-	  var message = "Dependency Cycle Found: " + cyclePath.join(" -> ");
-	  var instance = new Error(message);
-	  instance.cyclePath = cyclePath;
-	  Object.setPrototypeOf(instance, Object.getPrototypeOf(this));
-	  if (Error.captureStackTrace) {
-	    Error.captureStackTrace(instance, DepGraphCycleError);
-	  }
-	  return instance;
-	});
-	DepGraphCycleError.prototype = Object.create(Error.prototype, {
-	  constructor: {
-	    value: Error,
-	    enumerable: false,
-	    writable: true,
-	    configurable: true
-	  }
-	});
-	Object.setPrototypeOf(DepGraphCycleError, Error);
-	return dep_graph;
-}
-
-export { requireDep_graph as __require };
-//# sourceMappingURL=dep_graph.js.map

package/dist/_vendor/dependency-graph/lib/dep_graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"dep_graph.js","sources":["../../../../../../node_modules/dependency-graph/lib/dep_graph.js"],"sourcesContent":["/**\n * A simple dependency graph\n */\n\n/**\n * Helper for creating a Topological Sort using Depth-First-Search on a set of edges.\n *\n * Detects cycles and throws an Error if one is detected (unless the \"circular\"\n * parameter is \"true\" in which case it ignores them).\n *\n * @param edges The set of edges to DFS through\n * @param leavesOnly Whether to only return \"leaf\" nodes (ones who have no edges)\n * @param result An array in which the results will be populated\n * @param circular A boolean to allow circular dependencies\n */\nfunction createDFS(edges, leavesOnly, result, circular) {\n  var visited = {};\n  return function (start) {\n    if (visited[start]) {\n      return;\n    }\n    var inCurrentPath = {};\n    var currentPath = [];\n    var todo = []; // used as a stack\n    todo.push({ node: start, processed: false });\n    while (todo.length > 0) {\n      var current = todo[todo.length - 1]; // peek at the todo stack\n      var processed = current.processed;\n      var node = current.node;\n      if (!processed) {\n        // Haven't visited edges yet (visiting phase)\n        if (visited[node]) {\n          todo.pop();\n          continue;\n        } else if (inCurrentPath[node]) {\n          // It's not a DAG\n          if (circular) {\n            todo.pop();\n            // If we're tolerating cycles, don't revisit the node\n            continue;\n          }\n          currentPath.push(node);\n          throw new DepGraphCycleError(currentPath);\n        }\n\n        inCurrentPath[node] = true;\n        currentPath.push(node);\n        var nodeEdges = edges[node];\n        // (push edges onto the todo stack in reverse order to be order-compatible with the old DFS implementation)\n        for (var i = nodeEdges.length - 1; i >= 0; i--) {\n          todo.push({ node: nodeEdges[i], processed: false });\n        }\n        current.processed = true;\n      } else {\n        // Have visited edges (stack unrolling phase)\n        todo.pop();\n        currentPath.pop();\n        inCurrentPath[node] = false;\n        visited[node] = true;\n        if (!leavesOnly || edges[node].length === 0) {\n          result.push(node);\n        }\n      }\n    }\n  };\n}\n\n/**\n * Simple Dependency Graph\n */\nvar DepGraph = (exports.DepGraph = function DepGraph(opts) {\n  this.nodes = {}; // Node -> Node/Data (treated like a Set)\n  this.outgoingEdges = {}; // Node -> [Dependency Node]\n  this.incomingEdges = {}; // Node -> [Dependant Node]\n  this.circular = opts && !!opts.circular; // Allows circular deps\n});\nDepGraph.prototype = {\n  /**\n   * The number of nodes in the graph.\n   */\n  size: function () {\n    return Object.keys(this.nodes).length;\n  },\n  /**\n   * Add a node to the dependency graph. If a node already exists, this method will do nothing.\n   */\n  addNode: function (node, data) {\n    if (!this.hasNode(node)) {\n      // Checking the arguments length allows the user to add a node with undefined data\n      if (arguments.length === 2) {\n        this.nodes[node] = data;\n      } else {\n        this.nodes[node] = node;\n      }\n      this.outgoingEdges[node] = [];\n      this.incomingEdges[node] = [];\n    }\n  },\n  /**\n   * Remove a node from the dependency graph. If a node does not exist, this method will do nothing.\n   */\n  removeNode: function (node) {\n    if (this.hasNode(node)) {\n      delete this.nodes[node];\n      delete this.outgoingEdges[node];\n      delete this.incomingEdges[node];\n      [this.incomingEdges, this.outgoingEdges].forEach(function (edgeList) {\n        Object.keys(edgeList).forEach(function (key) {\n          var idx = edgeList[key].indexOf(node);\n          if (idx >= 0) {\n            edgeList[key].splice(idx, 1);\n          }\n        }, this);\n      });\n    }\n  },\n  /**\n   * Check if a node exists in the graph\n   */\n  hasNode: function (node) {\n    return this.nodes.hasOwnProperty(node);\n  },\n  /**\n   * Get the data associated with a node name\n   */\n  getNodeData: function (node) {\n    if (this.hasNode(node)) {\n      return this.nodes[node];\n    } else {\n      throw new Error(\"Node does not exist: \" + node);\n    }\n  },\n  /**\n   * Set the associated data for a given node name. If the node does not exist, this method will throw an error\n   */\n  setNodeData: function (node, data) {\n    if (this.hasNode(node)) {\n      this.nodes[node] = data;\n    } else {\n      throw new Error(\"Node does not exist: \" + node);\n    }\n  },\n  /**\n   * Add a dependency between two nodes. If either of the nodes does not exist,\n   * an Error will be thrown.\n   */\n  addDependency: function (from, to) {\n    if (!this.hasNode(from)) {\n      throw new Error(\"Node does not exist: \" + from);\n    }\n    if (!this.hasNode(to)) {\n      throw new Error(\"Node does not exist: \" + to);\n    }\n    if (this.outgoingEdges[from].indexOf(to) === -1) {\n      this.outgoingEdges[from].push(to);\n    }\n    if (this.incomingEdges[to].indexOf(from) === -1) {\n      this.incomingEdges[to].push(from);\n    }\n    return true;\n  },\n  /**\n   * Remove a dependency between two nodes.\n   */\n  removeDependency: function (from, to) {\n    var idx;\n    if (this.hasNode(from)) {\n      idx = this.outgoingEdges[from].indexOf(to);\n      if (idx >= 0) {\n        this.outgoingEdges[from].splice(idx, 1);\n      }\n    }\n\n    if (this.hasNode(to)) {\n      idx = this.incomingEdges[to].indexOf(from);\n      if (idx >= 0) {\n        this.incomingEdges[to].splice(idx, 1);\n      }\n    }\n  },\n  /**\n   * Return a clone of the dependency graph. If any custom data is attached\n   * to the nodes, it will only be shallow copied.\n   */\n  clone: function () {\n    var source = this;\n    var result = new DepGraph();\n    var keys = Object.keys(source.nodes);\n    keys.forEach(function (n) {\n      result.nodes[n] = source.nodes[n];\n      result.outgoingEdges[n] = source.outgoingEdges[n].slice(0);\n      result.incomingEdges[n] = source.incomingEdges[n].slice(0);\n    });\n    return result;\n  },\n  /**\n   * Get an array containing the direct dependencies of the specified node.\n   *\n   * Throws an Error if the specified node does not exist.\n   */\n  directDependenciesOf: function (node) {\n    if (this.hasNode(node)) {\n      return this.outgoingEdges[node].slice(0);\n    } else {\n      throw new Error(\"Node does not exist: \" + node);\n    }\n  },\n  /**\n   * Get an array containing the nodes that directly depend on the specified node.\n   *\n   * Throws an Error if the specified node does not exist.\n   */\n  directDependantsOf: function (node) {\n    if (this.hasNode(node)) {\n      return this.incomingEdges[node].slice(0);\n    } else {\n      throw new Error(\"Node does not exist: \" + node);\n    }\n  },\n  /**\n   * Get an array containing the nodes that the specified node depends on (transitively).\n   *\n   * Throws an Error if the graph has a cycle, or the specified node does not exist.\n   *\n   * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned\n   * in the array.\n   */\n  dependenciesOf: function (node, leavesOnly) {\n    if (this.hasNode(node)) {\n      var result = [];\n      var DFS = createDFS(\n        this.outgoingEdges,\n        leavesOnly,\n        result,\n        this.circular\n      );\n      DFS(node);\n      var idx = result.indexOf(node);\n      if (idx >= 0) {\n        result.splice(idx, 1);\n      }\n      return result;\n    } else {\n      throw new Error(\"Node does not exist: \" + node);\n    }\n  },\n  /**\n   * get an array containing the nodes that depend on the specified node (transitively).\n   *\n   * Throws an Error if the graph has a cycle, or the specified node does not exist.\n   *\n   * If `leavesOnly` is true, only nodes that do not have any dependants will be returned in the array.\n   */\n  dependantsOf: function (node, leavesOnly) {\n    if (this.hasNode(node)) {\n      var result = [];\n      var DFS = createDFS(\n        this.incomingEdges,\n        leavesOnly,\n        result,\n        this.circular\n      );\n      DFS(node);\n      var idx = result.indexOf(node);\n      if (idx >= 0) {\n        result.splice(idx, 1);\n      }\n      return result;\n    } else {\n      throw new Error(\"Node does not exist: \" + node);\n    }\n  },\n  /**\n   * Construct the overall processing order for the dependency graph.\n   *\n   * Throws an Error if the graph has a cycle.\n   *\n   * If `leavesOnly` is true, only nodes that do not depend on any other nodes will be returned.\n   */\n  overallOrder: function (leavesOnly) {\n    var self = this;\n    var result = [];\n    var keys = Object.keys(this.nodes);\n    if (keys.length === 0) {\n      return result; // Empty graph\n    } else {\n      if (!this.circular) {\n        // Look for cycles - we run the DFS starting at all the nodes in case there\n        // are several disconnected subgraphs inside this dependency graph.\n        var CycleDFS = createDFS(this.outgoingEdges, false, [], this.circular);\n        keys.forEach(function (n) {\n          CycleDFS(n);\n        });\n      }\n\n      var DFS = createDFS(\n        this.outgoingEdges,\n        leavesOnly,\n        result,\n        this.circular\n      );\n      // Find all potential starting points (nodes with nothing depending on them) an\n      // run a DFS starting at these points to get the order\n      keys\n        .filter(function (node) {\n          return self.incomingEdges[node].length === 0;\n        })\n        .forEach(function (n) {\n          DFS(n);\n        });\n\n      // If we're allowing cycles - we need to run the DFS against any remaining\n      // nodes that did not end up in the initial result (as they are part of a\n      // subgraph that does not have a clear starting point)\n      if (this.circular) {\n        keys\n          .filter(function (node) {\n            return result.indexOf(node) === -1;\n          })\n          .forEach(function (n) {\n            DFS(n);\n          });\n      }\n\n      return result;\n    }\n  },\n  /**\n   * Get an array of nodes that have no dependants (i.e. nothing depends on them).\n   */\n  entryNodes: function () {\n    var self = this;\n    return Object.keys(this.nodes).filter(function (node) {\n      return self.incomingEdges[node].length === 0;\n    });\n  }\n};\n\n// Create some aliases\nDepGraph.prototype.directDependentsOf = DepGraph.prototype.directDependantsOf;\nDepGraph.prototype.dependentsOf = DepGraph.prototype.dependantsOf;\n\n/**\n * Cycle error, including the path of the cycle.\n */\nvar DepGraphCycleError = (exports.DepGraphCycleError = function (cyclePath) {\n  var message = \"Dependency Cycle Found: \" + cyclePath.join(\" -> \");\n  var instance = new Error(message);\n  instance.cyclePath = cyclePath;\n  Object.setPrototypeOf(instance, Object.getPrototypeOf(this));\n  if (Error.captureStackTrace) {\n    Error.captureStackTrace(instance, DepGraphCycleError);\n  }\n  return instance;\n});\nDepGraphCycleError.prototype = Object.create(Error.prototype, {\n  constructor: {\n    value: Error,\n    enumerable: false,\n    writable: true,\n    configurable: true\n  }\n});\nObject.setPrototypeOf(DepGraphCycleError, Error);\n"],"names":[],"mappings":";;;;;;;;;;;AAIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;CACA,SAAS,SAAS,CAAC,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE;GACtD,IAAI,OAAO,GAAG,EAAE,CAAA;GAChB,OAAO,UAAU,KAAK,EAAE;AAC1B,KAAI,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE;OAClB,OAAA;AACN,MAAA;KACI,IAAI,aAAa,GAAG,EAAE,CAAA;KACtB,IAAI,WAAW,GAAG,EAAE,CAAA;AACxB,KAAI,IAAI,IAAI,GAAG,EAAE,CAAC;AAClB,KAAI,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAA;AAChD,KAAI,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;OACtB,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC1C,OAAM,IAAI,SAAS,GAAG,OAAO,CAAC,SAAS,CAAA;AACvC,OAAM,IAAI,IAAI,GAAG,OAAO,CAAC,IAAI,CAAA;OACvB,IAAI,CAAC,SAAS,EAAE;AACtB;AACA,SAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE;WACjB,IAAI,CAAC,GAAG,EAAE,CAAA;WACV,SAAA;AACV,UAAS,MAAM,IAAI,aAAa,CAAC,IAAI,CAAC,EAAE;AACxC;WACU,IAAI,QAAQ,EAAE;aACZ,IAAI,CAAC,GAAG,EAAE,CAAA;AACtB;aACY,SAAA;AACZ,YAAA;AACA,WAAU,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAChC,WAAU,MAAM,IAAI,kBAAkB,CAAC,WAAW,CAAC,CAAA;AACnD,UAAA;;AAEA,SAAQ,aAAa,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;AAClC,SAAQ,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC9B,SAAQ,IAAI,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,CAAA;AACnC;AACA,SAAQ,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACxD,WAAU,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAA;AAC7D,UAAA;AACA,SAAQ,OAAO,CAAC,SAAS,GAAG,IAAI,CAAA;AAChC,QAAO,MAAM;AACb;SACQ,IAAI,CAAC,GAAG,EAAE,CAAA;SACV,WAAW,CAAC,GAAG,EAAE,CAAA;AACzB,SAAQ,aAAa,CAAC,IAAI,CAAC,GAAG,KAAK,CAAA;AACnC,SAAQ,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;AAC5B,SAAQ,IAAI,CAAC,UAAU,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE;AACrD,WAAU,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AAC3B,UAAA;AACA,QAAA;AACA,MAAA;IACG,CAAA;AACH,EAAA;;AAEA;AACA;AACA;CACA,IAAI,QAAQ,IAAI,SAAgB,CAAA,QAAA,GAAG,SAAS,QAAQ,CAAC,IAAI,EAAE;AAC3D,GAAE,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;AAClB,GAAE,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;AAC1B,GAAE,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;GACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;AAC1C,EAAC,CAAC,CAAA;CACF,QAAQ,CAAC,SAAS,GAAG;AACrB;AACA;AACA;GACE,IAAI,EAAE,YAAY;KAChB,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAA;IACtC;AACH;AACA;AACA;AACA,GAAE,OAAO,EAAE,UAAU,IAAI,EAAE,IAAI,EAAE;KAC7B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC7B;AACA,OAAM,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE;AAClC,SAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;AAC/B,QAAO,MAAM;AACb,SAAQ,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;AAC/B,QAAA;AACA,OAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;AACnC,OAAM,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;AACnC,MAAA;IACG;AACH;AACA;AACA;AACA,GAAE,UAAU,EAAE,UAAU,IAAI,EAAE;AAC9B,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC5B,OAAM,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;AAC7B,OAAM,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;AACrC,OAAM,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAA;AACrC,OAAM,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,UAAU,QAAQ,EAAE;SACnE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAU,GAAG,EAAE;WAC3C,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;AAC/C,WAAU,IAAI,GAAG,IAAI,CAAC,EAAE;aACZ,QAAQ,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AACxC,YAAA;UACS,EAAE,IAAI,CAAC,CAAA;AAChB,QAAO,CAAC,CAAA;AACR,MAAA;IACG;AACH;AACA;AACA;AACA,GAAE,OAAO,EAAE,UAAU,IAAI,EAAE;KACvB,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,CAAA;IACvC;AACH;AACA;AACA;AACA,GAAE,WAAW,EAAE,UAAU,IAAI,EAAE;AAC/B,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC5B,OAAM,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;AAC7B,MAAK,MAAM;AACX,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAA;AACrD,MAAA;IACG;AACH;AACA;AACA;AACA,GAAE,WAAW,EAAE,UAAU,IAAI,EAAE,IAAI,EAAE;AACrC,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC5B,OAAM,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;AAC7B,MAAK,MAAM;AACX,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAA;AACrD,MAAA;IACG;AACH;AACA;AACA;AACA;AACA,GAAE,aAAa,EAAE,UAAU,IAAI,EAAE,EAAE,EAAE;KACjC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC7B,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAA;AACrD,MAAA;KACI,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;AAC3B,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,EAAE,CAAC,CAAA;AACnD,MAAA;AACA,KAAI,IAAI,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE;OAC/C,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;AACvC,MAAA;AACA,KAAI,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE;OAC/C,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACvC,MAAA;AACA,KAAI,OAAO,IAAI,CAAA;IACZ;AACH;AACA;AACA;AACA,GAAE,gBAAgB,EAAE,UAAU,IAAI,EAAE,EAAE,EAAE;AACxC,KAAI,IAAI,GAAG,CAAA;AACX,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;AAC5B,OAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;AAChD,OAAM,IAAI,GAAG,IAAI,CAAC,EAAE;AACpB,SAAQ,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AAC/C,QAAA;AACA,MAAA;;AAEA,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;AAC1B,OAAM,GAAG,GAAG,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;AAChD,OAAM,IAAI,GAAG,IAAI,CAAC,EAAE;AACpB,SAAQ,IAAI,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AAC7C,QAAA;AACA,MAAA;IACG;AACH;AACA;AACA;AACA;GACE,KAAK,EAAE,YAAY;KACjB,IAAI,MAAM,GAAG,IAAI,CAAA;AACrB,KAAI,IAAI,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAA;KAC3B,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;AACxC,KAAI,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;AAC9B,OAAM,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AACvC,OAAM,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AAChE,OAAM,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AAChE,MAAK,CAAC,CAAA;AACN,KAAI,OAAO,MAAM,CAAA;IACd;AACH;AACA;AACA;AACA;AACA;AACA,GAAE,oBAAoB,EAAE,UAAU,IAAI,EAAE;AACxC,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;OACtB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AAC9C,MAAK,MAAM;AACX,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAA;AACrD,MAAA;IACG;AACH;AACA;AACA;AACA;AACA;AACA,GAAE,kBAAkB,EAAE,UAAU,IAAI,EAAE;AACtC,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;OACtB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AAC9C,MAAK,MAAM;AACX,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAA;AACrD,MAAA;IACG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAE,cAAc,EAAE,UAAU,IAAI,EAAE,UAAU,EAAE;AAC9C,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;OACtB,IAAI,MAAM,GAAG,EAAE,CAAA;OACf,IAAI,GAAG,GAAG,SAAS;SACjB,IAAI,CAAC,aAAa;AAC1B,SAAQ,UAAU;AAClB,SAAQ,MAAM;AACd,SAAQ,IAAI,CAAC,QAAA;QACN,CAAA;OACD,GAAG,CAAC,IAAI,CAAC,CAAA;OACT,IAAI,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;AACpC,OAAM,IAAI,GAAG,IAAI,CAAC,EAAE;AACpB,SAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AAC7B,QAAA;AACA,OAAM,OAAO,MAAM,CAAA;AACnB,MAAK,MAAM;AACX,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAA;AACrD,MAAA;IACG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAE,YAAY,EAAE,UAAU,IAAI,EAAE,UAAU,EAAE;AAC5C,KAAI,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;OACtB,IAAI,MAAM,GAAG,EAAE,CAAA;OACf,IAAI,GAAG,GAAG,SAAS;SACjB,IAAI,CAAC,aAAa;AAC1B,SAAQ,UAAU;AAClB,SAAQ,MAAM;AACd,SAAQ,IAAI,CAAC,QAAA;QACN,CAAA;OACD,GAAG,CAAC,IAAI,CAAC,CAAA;OACT,IAAI,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;AACpC,OAAM,IAAI,GAAG,IAAI,CAAC,EAAE;AACpB,SAAQ,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAA;AAC7B,QAAA;AACA,OAAM,OAAO,MAAM,CAAA;AACnB,MAAK,MAAM;AACX,OAAM,MAAM,IAAI,KAAK,CAAC,uBAAuB,GAAG,IAAI,CAAC,CAAA;AACrD,MAAA;IACG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAE,YAAY,EAAE,UAAU,UAAU,EAAE;KAClC,IAAI,IAAI,GAAG,IAAI,CAAA;KACf,IAAI,MAAM,GAAG,EAAE,CAAA;KACf,IAAI,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACtC,KAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE;OACrB,OAAO,MAAM,CAAC;AACpB,MAAK,MAAM;AACX,OAAM,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;AAC1B;AACA;AACA,SAAQ,IAAI,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;AAC9E,SAAQ,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE;WACxB,QAAQ,CAAC,CAAC,CAAC,CAAA;AACrB,UAAS,CAAC,CAAA;AACV,QAAA;;OAEM,IAAI,GAAG,GAAG,SAAS;SACjB,IAAI,CAAC,aAAa;AAC1B,SAAQ,UAAU;AAClB,SAAQ,MAAM;AACd,SAAQ,IAAI,CAAC,QAAA;QACN,CAAA;AACP;AACA;OACM,IAAA;AACN,UAAS,MAAM,CAAC,UAAU,IAAI,EAAE;WACtB,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAA;UAC7C,CAAA;AACT,UAAS,OAAO,CAAC,UAAU,CAAC,EAAE;WACpB,GAAG,CAAC,CAAC,CAAC,CAAA;AAChB,UAAS,CAAC,CAAA;;AAEV;AACA;AACA;AACA,OAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;SACjB,IAAA;AACR,YAAW,MAAM,CAAC,UAAU,IAAI,EAAE;aACtB,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAA;YACnC,CAAA;AACX,YAAW,OAAO,CAAC,UAAU,CAAC,EAAE;aACpB,GAAG,CAAC,CAAC,CAAC,CAAA;AAClB,YAAW,CAAC,CAAA;AACZ,QAAA;;AAEA,OAAM,OAAO,MAAM,CAAA;AACnB,MAAA;IACG;AACH;AACA;AACA;GACE,UAAU,EAAE,YAAY;KACtB,IAAI,IAAI,GAAG,IAAI,CAAA;AACnB,KAAI,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,UAAU,IAAI,EAAE;OACpD,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAA;AAClD,MAAK,CAAC,CAAA;AACN,IAAA;EACC,CAAA;;AAED;CACA,QAAQ,CAAC,SAAS,CAAC,kBAAkB,GAAG,QAAQ,CAAC,SAAS,CAAC,kBAAkB,CAAA;CAC7E,QAAQ,CAAC,SAAS,CAAC,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAA;;AAEjE;AACA;AACA;AACA,CAAA,IAAI,kBAAkB,IAAI,SAAA,CAAA,kBAA0B,GAAG,UAAU,SAAS,EAAE;GAC1E,IAAI,OAAO,GAAG,0BAA0B,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AACnE,GAAE,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,CAAA;AACnC,GAAE,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAA;AAChC,GAAE,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAA;AAC9D,GAAE,IAAI,KAAK,CAAC,iBAAiB,EAAE;AAC/B,KAAI,KAAK,CAAC,iBAAiB,CAAC,QAAQ,EAAE,kBAAkB,CAAC,CAAA;AACzD,IAAA;AACA,GAAE,OAAO,QAAQ,CAAA;AACjB,EAAC,CAAC,CAAA;CACF,kBAAkB,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE;AAC9D,GAAE,WAAW,EAAE;KACX,KAAK,EAAE,KAAK;KACZ,UAAU,EAAE,KAAK;KACjB,QAAQ,EAAE,IAAI;AAClB,KAAI,YAAY,EAAE,IAAA;AAClB,IAAA;AACA,EAAC,CAAC,CAAA;AACF,CAAA,MAAM,CAAC,cAAc,CAAC,kBAAkB,EAAE,KAAK,CAAC,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/_vendor/dunder-proto/get.js

@@ -1,43 +0,0 @@
-import { __require as requireCallBindApplyHelpers } from '../call-bind-apply-helpers/index.js';
-import { __require as requireGopd } from '../gopd/index.js';
-
-var get;
-var hasRequiredGet;
-
-function requireGet () {
-	if (hasRequiredGet) return get;
-	hasRequiredGet = 1;
-
-	var callBind = /*@__PURE__*/ requireCallBindApplyHelpers();
-	var gOPD = /*@__PURE__*/ requireGopd();
-
-	var hasProtoAccessor;
-	try {
-		// eslint-disable-next-line no-extra-parens, no-proto
-		hasProtoAccessor = /** @type {{ __proto__?: typeof Array.prototype }} */ ([]).__proto__ === Array.prototype;
-	} catch (e) {
-		if (!e || typeof e !== 'object' || !('code' in e) || e.code !== 'ERR_PROTO_ACCESS') {
-			throw e;
-		}
-	}
-
-	// eslint-disable-next-line no-extra-parens
-	var desc = !!hasProtoAccessor && gOPD && gOPD(Object.prototype, /** @type {keyof typeof Object.prototype} */ ('__proto__'));
-
-	var $Object = Object;
-	var $getPrototypeOf = $Object.getPrototypeOf;
-
-	/** @type {import('./get')} */
-	get = desc && typeof desc.get === 'function'
-		? callBind([desc.get])
-		: typeof $getPrototypeOf === 'function'
-			? /** @type {import('./get')} */ function getDunder(value) {
-				// eslint-disable-next-line eqeqeq
-				return $getPrototypeOf(value == null ? value : $Object(value));
-			}
-			: false;
-	return get;
-}
-
-export { requireGet as __require };
-//# sourceMappingURL=get.js.map

package/dist/_vendor/dunder-proto/get.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get.js","sources":["../../../../../node_modules/dunder-proto/get.js"],"sourcesContent":["'use strict';\n\nvar callBind = require('call-bind-apply-helpers');\nvar gOPD = require('gopd');\n\nvar hasProtoAccessor;\ntry {\n\t// eslint-disable-next-line no-extra-parens, no-proto\n\thasProtoAccessor = /** @type {{ __proto__?: typeof Array.prototype }} */ ([]).__proto__ === Array.prototype;\n} catch (e) {\n\tif (!e || typeof e !== 'object' || !('code' in e) || e.code !== 'ERR_PROTO_ACCESS') {\n\t\tthrow e;\n\t}\n}\n\n// eslint-disable-next-line no-extra-parens\nvar desc = !!hasProtoAccessor && gOPD && gOPD(Object.prototype, /** @type {keyof typeof Object.prototype} */ ('__proto__'));\n\nvar $Object = Object;\nvar $getPrototypeOf = $Object.getPrototypeOf;\n\n/** @type {import('./get')} */\nmodule.exports = desc && typeof desc.get === 'function'\n\t? callBind([desc.get])\n\t: typeof $getPrototypeOf === 'function'\n\t\t? /** @type {import('./get')} */ function getDunder(value) {\n\t\t\t// eslint-disable-next-line eqeqeq\n\t\t\treturn $getPrototypeOf(value == null ? value : $Object(value));\n\t\t}\n\t\t: false;\n"],"names":["require$$0","require$$1"],"mappings":";;;;;;;;;;CAEA,IAAI,QAAQ,iBAAqCA,2BAAA,EAAA,CAAA;CACjD,IAAI,IAAI,iBAAkBC,WAAA,EAAA,CAAA;;AAE1B,CAAA,IAAI,gBAAgB,CAAA;CACpB,IAAI;AACJ;EACC,gBAAgB,yDAAyD,CAAC,EAAE,EAAE,SAAS,KAAK,KAAK,CAAC,SAAS,CAAA;EAC3G,CAAC,OAAO,CAAC,EAAE;EACX,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,kBAAkB,EAAE;AACrF,GAAE,MAAM,CAAC,CAAA;AACT,GAAA;AACA,EAAA;;AAEA;AACA,CAAA,IAAI,IAAI,GAAG,CAAC,CAAC,gBAAgB,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,gDAAgD,WAAW,EAAE,CAAA;;CAE3H,IAAI,OAAO,GAAG,MAAM,CAAA;AACpB,CAAA,IAAI,eAAe,GAAG,OAAO,CAAC,cAAc,CAAA;;AAE5C;AACA,CAAA,GAAc,GAAG,IAAI,IAAI,OAAO,IAAI,CAAC,GAAG,KAAK,UAAA;AAC7C,IAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACnB,OAAO,eAAe,KAAK,UAAA;AAC9B,oCAAmC,SAAS,SAAS,CAAC,KAAK,EAAE;AAC7D;AACA,IAAG,OAAO,eAAe,CAAC,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,CAAA;AACjE,IAAA;AACA,KAAI,KAAK,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/_vendor/dunder-proto/set.js

@@ -1,49 +0,0 @@
-import { __require as requireCallBindApplyHelpers } from '../call-bind-apply-helpers/index.js';
-import { __require as requireGopd } from '../gopd/index.js';
-import { __require as requireType } from '../es-errors/type.js';
-
-var set;
-var hasRequiredSet;
-
-function requireSet () {
-	if (hasRequiredSet) return set;
-	hasRequiredSet = 1;
-
-	var callBind = /*@__PURE__*/ requireCallBindApplyHelpers();
-	var gOPD = /*@__PURE__*/ requireGopd();
-	var $TypeError = /*@__PURE__*/ requireType();
-
-	/** @type {{ __proto__?: object | null }} */
-	var obj = {};
-	try {
-		obj.__proto__ = null; // eslint-disable-line no-proto
-	} catch (e) {
-		if (!e || typeof e !== 'object' || !('code' in e) || e.code !== 'ERR_PROTO_ACCESS') {
-			throw e;
-		}
-	}
-
-	var hasProtoMutator = !('toString' in obj);
-
-	// eslint-disable-next-line no-extra-parens
-	var desc = gOPD && gOPD(Object.prototype, /** @type {keyof typeof Object.prototype} */ ('__proto__'));
-
-	/** @type {import('./set')} */
-	set = hasProtoMutator && (
-	// eslint-disable-next-line no-extra-parens
-		(!!desc && typeof desc.set === 'function' && /** @type {import('./set')} */ (callBind([desc.set])))
-		|| /** @type {import('./set')} */ function setDunder(object, proto) {
-			// this is node v0.10 or older, which doesn't have Object.setPrototypeOf and has undeniable __proto__
-			if (object == null) { // eslint-disable-line eqeqeq
-				throw new $TypeError('set Object.prototype.__proto__ called on null or undefined');
-			}
-			// eslint-disable-next-line no-proto, no-param-reassign, no-extra-parens
-			/** @type {{ __proto__?: object | null }} */ (object).__proto__ = proto;
-			return proto;
-		}
-	);
-	return set;
-}
-
-export { requireSet as __require };
-//# sourceMappingURL=set.js.map

package/dist/_vendor/dunder-proto/set.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"set.js","sources":["../../../../../node_modules/dunder-proto/set.js"],"sourcesContent":["'use strict';\n\nvar callBind = require('call-bind-apply-helpers');\nvar gOPD = require('gopd');\nvar $TypeError = require('es-errors/type');\n\n/** @type {{ __proto__?: object | null }} */\nvar obj = {};\ntry {\n\tobj.__proto__ = null; // eslint-disable-line no-proto\n} catch (e) {\n\tif (!e || typeof e !== 'object' || !('code' in e) || e.code !== 'ERR_PROTO_ACCESS') {\n\t\tthrow e;\n\t}\n}\n\nvar hasProtoMutator = !('toString' in obj);\n\n// eslint-disable-next-line no-extra-parens\nvar desc = gOPD && gOPD(Object.prototype, /** @type {keyof typeof Object.prototype} */ ('__proto__'));\n\n/** @type {import('./set')} */\nmodule.exports = hasProtoMutator && (\n// eslint-disable-next-line no-extra-parens\n\t(!!desc && typeof desc.set === 'function' && /** @type {import('./set')} */ (callBind([desc.set])))\n\t|| /** @type {import('./set')} */ function setDunder(object, proto) {\n\t\t// this is node v0.10 or older, which doesn't have Object.setPrototypeOf and has undeniable __proto__\n\t\tif (object == null) { // eslint-disable-line eqeqeq\n\t\t\tthrow new $TypeError('set Object.prototype.__proto__ called on null or undefined');\n\t\t}\n\t\t// eslint-disable-next-line no-proto, no-param-reassign, no-extra-parens\n\t\t/** @type {{ __proto__?: object | null }} */ (object).__proto__ = proto;\n\t\treturn proto;\n\t}\n);\n"],"names":["require$$0","require$$1","require$$2"],"mappings":";;;;;;;;;;;CAEA,IAAI,QAAQ,iBAAqCA,2BAAA,EAAA,CAAA;CACjD,IAAI,IAAI,iBAAkBC,WAAA,EAAA,CAAA;CAC1B,IAAI,UAAU,iBAA4BC,WAAA,EAAA,CAAA;;AAE1C;CACA,IAAI,GAAG,GAAG,EAAE,CAAA;CACZ,IAAI;AACJ,EAAC,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC;EACrB,CAAC,OAAO,CAAC,EAAE;EACX,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,EAAE,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,kBAAkB,EAAE;AACrF,GAAE,MAAM,CAAC,CAAA;AACT,GAAA;AACA,EAAA;;AAEA,CAAA,IAAI,eAAe,GAAG,EAAE,UAAU,IAAI,GAAG,CAAC,CAAA;;AAE1C;CACA,IAAI,IAAI,GAAG,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,gDAAgD,WAAW,EAAE,CAAA;;AAErG;AACA,CAAA,GAAc,GAAG,eAAe;AAChC;EACC,CAAC,CAAC,CAAC,IAAI,IAAI,OAAO,IAAI,CAAC,GAAG,KAAK,UAAU,oCAAoC,QAAQ,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACnG,oCAAmC,SAAS,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE;AACrE;AACA,GAAE,IAAI,MAAM,IAAI,IAAI,EAAE;AACtB,IAAG,MAAM,IAAI,UAAU,CAAC,4DAA4D,CAAC,CAAA;AACrF,IAAA;AACA;AACA,gDAA+C,CAAC,MAAM,EAAE,SAAS,GAAG,KAAK,CAAA;AACzE,GAAE,OAAO,KAAK,CAAA;AACd,GAAA;EACC,CAAA;;;;;;","x_google_ignoreList":[0]}

package/dist/_vendor/es-aggregate-error/_vendor/es-abstract/2023/CreateNonEnumerableDataPropertyOrThrow.js

@@ -1,43 +0,0 @@
-import { __require as requireType } from '../../../../es-errors/type.js';
-import { __require as requireIsObject } from '../../../../es-object-atoms/isObject.js';
-import { __require as requireDefinePropertyOrThrow } from './DefinePropertyOrThrow.js';
-import { __require as requireIsPropertyKey } from '../helpers/isPropertyKey.js';
-
-var CreateNonEnumerableDataPropertyOrThrow;
-var hasRequiredCreateNonEnumerableDataPropertyOrThrow;
-
-function requireCreateNonEnumerableDataPropertyOrThrow () {
-	if (hasRequiredCreateNonEnumerableDataPropertyOrThrow) return CreateNonEnumerableDataPropertyOrThrow;
-	hasRequiredCreateNonEnumerableDataPropertyOrThrow = 1;
-
-	var $TypeError = /*@__PURE__*/ requireType();
-	var isObject = /*@__PURE__*/ requireIsObject();
-
-	var DefinePropertyOrThrow = /*@__PURE__*/ requireDefinePropertyOrThrow();
-
-	var isPropertyKey = /*@__PURE__*/ requireIsPropertyKey();
-
-	// https://262.ecma-international.org/13.0/#sec-createnonenumerabledatapropertyorthrow
-
-	CreateNonEnumerableDataPropertyOrThrow = function CreateNonEnumerableDataPropertyOrThrow(O, P, V) {
-		if (!isObject(O)) {
-			throw new $TypeError('Assertion failed: Type(O) is not Object');
-		}
-
-		if (!isPropertyKey(P)) {
-			throw new $TypeError('Assertion failed: P is not a Property Key');
-		}
-
-		var newDesc = {
-			'[[Configurable]]': true,
-			'[[Enumerable]]': false,
-			'[[Value]]': V,
-			'[[Writable]]': true
-		};
-		return DefinePropertyOrThrow(O, P, newDesc);
-	};
-	return CreateNonEnumerableDataPropertyOrThrow;
-}
-
-export { requireCreateNonEnumerableDataPropertyOrThrow as __require };
-//# sourceMappingURL=CreateNonEnumerableDataPropertyOrThrow.js.map

package/dist/_vendor/es-aggregate-error/_vendor/es-abstract/2023/CreateNonEnumerableDataPropertyOrThrow.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"CreateNonEnumerableDataPropertyOrThrow.js","sources":["../../../../../../../../node_modules/es-aggregate-error/node_modules/es-abstract/2023/CreateNonEnumerableDataPropertyOrThrow.js"],"sourcesContent":["'use strict';\n\nvar $TypeError = require('es-errors/type');\nvar isObject = require('es-object-atoms/isObject');\n\nvar DefinePropertyOrThrow = require('./DefinePropertyOrThrow');\n\nvar isPropertyKey = require('../helpers/isPropertyKey');\n\n// https://262.ecma-international.org/13.0/#sec-createnonenumerabledatapropertyorthrow\n\nmodule.exports = function CreateNonEnumerableDataPropertyOrThrow(O, P, V) {\n\tif (!isObject(O)) {\n\t\tthrow new $TypeError('Assertion failed: Type(O) is not Object');\n\t}\n\n\tif (!isPropertyKey(P)) {\n\t\tthrow new $TypeError('Assertion failed: P is not a Property Key');\n\t}\n\n\tvar newDesc = {\n\t\t'[[Configurable]]': true,\n\t\t'[[Enumerable]]': false,\n\t\t'[[Value]]': V,\n\t\t'[[Writable]]': true\n\t};\n\treturn DefinePropertyOrThrow(O, P, newDesc);\n};\n"],"names":["require$$0","require$$1","require$$2","require$$3"],"mappings":";;;;;;;;;;;;CAEA,IAAI,UAAU,iBAA4BA,WAAA,EAAA,CAAA;CAC1C,IAAI,QAAQ,iBAAsCC,eAAA,EAAA,CAAA;;CAElD,IAAI,qBAAqB,iBAAqCC,4BAAA,EAAA,CAAA;;CAE9D,IAAI,aAAa,iBAAsCC,oBAAA,EAAA,CAAA;;AAEvD;;AAEA,CAAc,sCAAA,GAAG,SAAS,sCAAsC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE;AAC1E,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE;AACnB,GAAE,MAAM,IAAI,UAAU,CAAC,yCAAyC,CAAC,CAAA;AACjE,GAAA;;AAEA,EAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE;AACxB,GAAE,MAAM,IAAI,UAAU,CAAC,2CAA2C,CAAC,CAAA;AACnE,GAAA;;EAEC,IAAI,OAAO,GAAG;GACb,kBAAkB,EAAE,IAAI;GACxB,gBAAgB,EAAE,KAAK;GACvB,WAAW,EAAE,CAAC;AAChB,GAAE,cAAc,EAAE,IAAA;GAChB,CAAA;EACD,OAAO,qBAAqB,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAA;EAC3C,CAAA;;;;;;","x_google_ignoreList":[0]}