fastapi-rtk 0.1.13 → 0.1.14

package/dist/external/esm/property-expr@2.0.6/node_modules/property-expr/index.mjs

@@ -0,0 +1,105 @@
+var propertyExpr;
+var hasRequiredPropertyExpr;
+function requirePropertyExpr() {
+  if (hasRequiredPropertyExpr) return propertyExpr;
+  hasRequiredPropertyExpr = 1;
+  function Cache(maxSize) {
+    this._maxSize = maxSize;
+    this.clear();
+  }
+  Cache.prototype.clear = function() {
+    this._size = 0;
+    this._values = /* @__PURE__ */ Object.create(null);
+  };
+  Cache.prototype.get = function(key) {
+    return this._values[key];
+  };
+  Cache.prototype.set = function(key, value) {
+    this._size >= this._maxSize && this.clear();
+    if (!(key in this._values)) this._size++;
+    return this._values[key] = value;
+  };
+  var SPLIT_REGEX = /[^.^\]^[]+|(?=\[\]|\.\.)/g, DIGIT_REGEX = /^\d+$/, LEAD_DIGIT_REGEX = /^\d/, SPEC_CHAR_REGEX = /[~`!#$%\^&*+=\-\[\]\\';,/{}|\\":<>\?]/g, CLEAN_QUOTES_REGEX = /^\s*(['"]?)(.*?)(\1)\s*$/, MAX_CACHE_SIZE = 512;
+  var pathCache = new Cache(MAX_CACHE_SIZE), setCache = new Cache(MAX_CACHE_SIZE), getCache = new Cache(MAX_CACHE_SIZE);
+  propertyExpr = {
+    Cache,
+    split,
+    normalizePath,
+    setter: function(path) {
+      var parts = normalizePath(path);
+      return setCache.get(path) || setCache.set(path, function setter(obj, value) {
+        var index = 0;
+        var len = parts.length;
+        var data = obj;
+        while (index < len - 1) {
+          var part = parts[index];
+          if (part === "__proto__" || part === "constructor" || part === "prototype") {
+            return obj;
+          }
+          data = data[parts[index++]];
+        }
+        data[parts[index]] = value;
+      });
+    },
+    getter: function(path, safe) {
+      var parts = normalizePath(path);
+      return getCache.get(path) || getCache.set(path, function getter(data) {
+        var index = 0, len = parts.length;
+        while (index < len) {
+          if (data != null || !safe) data = data[parts[index++]];
+          else return;
+        }
+        return data;
+      });
+    },
+    join: function(segments) {
+      return segments.reduce(function(path, part) {
+        return path + (isQuoted(part) || DIGIT_REGEX.test(part) ? "[" + part + "]" : (path ? "." : "") + part);
+      }, "");
+    },
+    forEach: function(path, cb, thisArg) {
+      forEach(Array.isArray(path) ? path : split(path), cb, thisArg);
+    }
+  };
+  function normalizePath(path) {
+    return pathCache.get(path) || pathCache.set(
+      path,
+      split(path).map(function(part) {
+        return part.replace(CLEAN_QUOTES_REGEX, "$2");
+      })
+    );
+  }
+  function split(path) {
+    return path.match(SPLIT_REGEX) || [""];
+  }
+  function forEach(parts, iter, thisArg) {
+    var len = parts.length, part, idx, isArray, isBracket;
+    for (idx = 0; idx < len; idx++) {
+      part = parts[idx];
+      if (part) {
+        if (shouldBeQuoted(part)) {
+          part = '"' + part + '"';
+        }
+        isBracket = isQuoted(part);
+        isArray = !isBracket && /^\d+$/.test(part);
+        iter.call(thisArg, part, isBracket, isArray, idx, parts);
+      }
+    }
+  }
+  function isQuoted(str) {
+    return typeof str === "string" && str && ["'", '"'].indexOf(str.charAt(0)) !== -1;
+  }
+  function hasLeadingNumber(part) {
+    return part.match(LEAD_DIGIT_REGEX) && !part.match(DIGIT_REGEX);
+  }
+  function hasSpecialChars(part) {
+    return SPEC_CHAR_REGEX.test(part);
+  }
+  function shouldBeQuoted(part) {
+    return !isQuoted(part) && (hasLeadingNumber(part) || hasSpecialChars(part));
+  }
+  return propertyExpr;
+}
+export {
+  requirePropertyExpr as __require
+};

package/dist/external/esm/tiny-case@1.0.3/node_modules/tiny-case/index.mjs

@@ -0,0 +1,33 @@
+var tinyCase;
+var hasRequiredTinyCase;
+function requireTinyCase() {
+  if (hasRequiredTinyCase) return tinyCase;
+  hasRequiredTinyCase = 1;
+  const reWords = /[A-Z\xc0-\xd6\xd8-\xde]?[a-z\xdf-\xf6\xf8-\xff]+(?:['’](?:d|ll|m|re|s|t|ve))?(?=[\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000]|[A-Z\xc0-\xd6\xd8-\xde]|$)|(?:[A-Z\xc0-\xd6\xd8-\xde]|[^\ud800-\udfff\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000\d+\u2700-\u27bfa-z\xdf-\xf6\xf8-\xffA-Z\xc0-\xd6\xd8-\xde])+(?:['’](?:D|LL|M|RE|S|T|VE))?(?=[\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000]|[A-Z\xc0-\xd6\xd8-\xde](?:[a-z\xdf-\xf6\xf8-\xff]|[^\ud800-\udfff\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000\d+\u2700-\u27bfa-z\xdf-\xf6\xf8-\xffA-Z\xc0-\xd6\xd8-\xde])|$)|[A-Z\xc0-\xd6\xd8-\xde]?(?:[a-z\xdf-\xf6\xf8-\xff]|[^\ud800-\udfff\xac\xb1\xd7\xf7\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\xbf\u2000-\u206f \t\x0b\f\xa0\ufeff\n\r\u2028\u2029\u1680\u180e\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u202f\u205f\u3000\d+\u2700-\u27bfa-z\xdf-\xf6\xf8-\xffA-Z\xc0-\xd6\xd8-\xde])+(?:['’](?:d|ll|m|re|s|t|ve))?|[A-Z\xc0-\xd6\xd8-\xde]+(?:['’](?:D|LL|M|RE|S|T|VE))?|\d*(?:1ST|2ND|3RD|(?![123])\dTH)(?=\b|[a-z_])|\d*(?:1st|2nd|3rd|(?![123])\dth)(?=\b|[A-Z_])|\d+|(?:[\u2700-\u27bf]|(?:\ud83c[\udde6-\uddff]){2}|[\ud800-\udbff][\udc00-\udfff])[\ufe0e\ufe0f]?(?:[\u0300-\u036f\ufe20-\ufe2f\u20d0-\u20ff]|\ud83c[\udffb-\udfff])?(?:\u200d(?:[^\ud800-\udfff]|(?:\ud83c[\udde6-\uddff]){2}|[\ud800-\udbff][\udc00-\udfff])[\ufe0e\ufe0f]?(?:[\u0300-\u036f\ufe20-\ufe2f\u20d0-\u20ff]|\ud83c[\udffb-\udfff])?)*/g;
+  const words = (str) => str.match(reWords) || [];
+  const upperFirst = (str) => str[0].toUpperCase() + str.slice(1);
+  const join = (str, d) => words(str).join(d).toLowerCase();
+  const camelCase = (str) => words(str).reduce(
+    (acc, next) => `${acc}${!acc ? next.toLowerCase() : next[0].toUpperCase() + next.slice(1).toLowerCase()}`,
+    ""
+  );
+  const pascalCase = (str) => upperFirst(camelCase(str));
+  const snakeCase = (str) => join(str, "_");
+  const kebabCase = (str) => join(str, "-");
+  const sentenceCase = (str) => upperFirst(join(str, " "));
+  const titleCase = (str) => words(str).map(upperFirst).join(" ");
+  tinyCase = {
+    words,
+    upperFirst,
+    camelCase,
+    pascalCase,
+    snakeCase,
+    kebabCase,
+    sentenceCase,
+    titleCase
+  };
+  return tinyCase;
+}
+export {
+  requireTinyCase as __require
+};

package/dist/external/esm/toposort@2.0.2/node_modules/toposort/index.mjs

@@ -0,0 +1,79 @@
+import { __module as toposort } from "../../../../../core/esm/_virtual/index4.mjs";
+var hasRequiredToposort;
+function requireToposort() {
+  if (hasRequiredToposort) return toposort.exports;
+  hasRequiredToposort = 1;
+  toposort.exports = function(edges) {
+    return toposort$1(uniqueNodes(edges), edges);
+  };
+  toposort.exports.array = toposort$1;
+  function toposort$1(nodes, edges) {
+    var cursor = nodes.length, sorted = new Array(cursor), visited = {}, i = cursor, outgoingEdges = makeOutgoingEdges(edges), nodesHash = makeNodesHash(nodes);
+    edges.forEach(function(edge) {
+      if (!nodesHash.has(edge[0]) || !nodesHash.has(edge[1])) {
+        throw new Error("Unknown node. There is an unknown node in the supplied edges.");
+      }
+    });
+    while (i--) {
+      if (!visited[i]) visit(nodes[i], i, /* @__PURE__ */ new Set());
+    }
+    return sorted;
+    function visit(node, i2, predecessors) {
+      if (predecessors.has(node)) {
+        var nodeRep;
+        try {
+          nodeRep = ", node was:" + JSON.stringify(node);
+        } catch (e) {
+          nodeRep = "";
+        }
+        throw new Error("Cyclic dependency" + nodeRep);
+      }
+      if (!nodesHash.has(node)) {
+        throw new Error("Found unknown node. Make sure to provided all involved nodes. Unknown node: " + JSON.stringify(node));
+      }
+      if (visited[i2]) return;
+      visited[i2] = true;
+      var outgoing = outgoingEdges.get(node) || /* @__PURE__ */ new Set();
+      outgoing = Array.from(outgoing);
+      if (i2 = outgoing.length) {
+        predecessors.add(node);
+        do {
+          var child = outgoing[--i2];
+          visit(child, nodesHash.get(child), predecessors);
+        } while (i2);
+        predecessors.delete(node);
+      }
+      sorted[--cursor] = node;
+    }
+  }
+  function uniqueNodes(arr) {
+    var res = /* @__PURE__ */ new Set();
+    for (var i = 0, len = arr.length; i < len; i++) {
+      var edge = arr[i];
+      res.add(edge[0]);
+      res.add(edge[1]);
+    }
+    return Array.from(res);
+  }
+  function makeOutgoingEdges(arr) {
+    var edges = /* @__PURE__ */ new Map();
+    for (var i = 0, len = arr.length; i < len; i++) {
+      var edge = arr[i];
+      if (!edges.has(edge[0])) edges.set(edge[0], /* @__PURE__ */ new Set());
+      if (!edges.has(edge[1])) edges.set(edge[1], /* @__PURE__ */ new Set());
+      edges.get(edge[0]).add(edge[1]);
+    }
+    return edges;
+  }
+  function makeNodesHash(arr) {
+    var res = /* @__PURE__ */ new Map();
+    for (var i = 0, len = arr.length; i < len; i++) {
+      res.set(arr[i], i);
+    }
+    return res;
+  }
+  return toposort.exports;
+}
+export {
+  requireToposort as __require
+};