adp-web-components 0.0.89 → 0.0.90

package/dist/esm/{get-local-language-e286080a.js → get-local-language-BPo-xYwK.js}

@@ -2,305 +2,338 @@
  * Built by ShiftSoftware
  * Copyright (c)
  */
-import './index-3a623f7c.js';
+import './index-CikEOqe0.js';
+
+function getDefaultExportFromCjs (x) {
+	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+}
 
 /**
  * Based on Kendo UI Core expression code <https://github.com/telerik/kendo-ui-core#license-information>
  */
 
-function Cache(maxSize) {
-  this._maxSize = maxSize;
-  this.clear();
+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 = 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: Cache,
+
+	  split: split,
+
+	  normalizePath: 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;
 }
-Cache.prototype.clear = function () {
-  this._size = 0;
-  this._values = 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 propertyExprExports = requirePropertyExpr();
 
-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);
-
-var propertyExpr = {
-  Cache: Cache,
-
-  split: split,
-
-  normalizePath: 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
-          }
+var tinyCase;
+var hasRequiredTinyCase;
 
-          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 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;
 
-function normalizePath(path) {
-  return (
-    pathCache.get(path) ||
-    pathCache.set(
-      path,
-      split(path).map(function (part) {
-        return part.replace(CLEAN_QUOTES_REGEX, '$2')
-      })
-    )
-  )
-}
+	const words = (str) => str.match(reWords) || [];
 
-function split(path) {
-  return path.match(SPLIT_REGEX) || ['']
-}
+	const upperFirst = (str) => str[0].toUpperCase() + str.slice(1);
 
-function forEach(parts, iter, thisArg) {
-  var len = parts.length,
-    part,
-    idx,
-    isArray,
-    isBracket;
+	const join = (str, d) => words(str).join(d).toLowerCase();
 
-  for (idx = 0; idx < len; idx++) {
-    part = parts[idx];
+	const camelCase = (str) =>
+	  words(str).reduce(
+	    (acc, next) =>
+	      `${acc}${
+	        !acc
+	          ? next.toLowerCase()
+	          : next[0].toUpperCase() + next.slice(1).toLowerCase()
+	      }`,
+	    '',
+	  );
 
-    if (part) {
-      if (shouldBeQuoted(part)) {
-        part = '"' + part + '"';
-      }
+	const pascalCase = (str) => upperFirst(camelCase(str));
 
-      isBracket = isQuoted(part);
-      isArray = !isBracket && /^\d+$/.test(part);
+	const snakeCase = (str) => join(str, '_');
 
-      iter.call(thisArg, part, isBracket, isArray, idx, parts);
-    }
-  }
-}
+	const kebabCase = (str) => join(str, '-');
 
-function isQuoted(str) {
-  return (
-    typeof str === 'string' && str && ["'", '"'].indexOf(str.charAt(0)) !== -1
-  )
-}
+	const sentenceCase = (str) => upperFirst(join(str, ' '));
 
-function hasLeadingNumber(part) {
-  return part.match(LEAD_DIGIT_REGEX) && !part.match(DIGIT_REGEX)
-}
+	const titleCase = (str) => words(str).map(upperFirst).join(' ');
 
-function hasSpecialChars(part) {
-  return SPEC_CHAR_REGEX.test(part)
+	tinyCase = {
+	  words,
+	  upperFirst,
+	  camelCase,
+	  pascalCase,
+	  snakeCase,
+	  kebabCase,
+	  sentenceCase,
+	  titleCase,
+	};
+	return tinyCase;
 }
 
-function shouldBeQuoted(part) {
-  return !isQuoted(part) && (hasLeadingNumber(part) || hasSpecialChars(part))
+var tinyCaseExports = requireTinyCase();
+
+var toposort$1 = {exports: {}};
+
+var hasRequiredToposort;
+
+function requireToposort () {
+	if (hasRequiredToposort) return toposort$1.exports;
+	hasRequiredToposort = 1;
+	/**
+	 * Topological sorting function
+	 *
+	 * @param {Array} edges
+	 * @returns {Array}
+	 */
+
+	toposort$1.exports = function(edges) {
+	  return toposort(uniqueNodes(edges), edges)
+	};
+
+	toposort$1.exports.array = toposort;
+
+	function toposort(nodes, edges) {
+	  var cursor = nodes.length
+	    , sorted = new Array(cursor)
+	    , visited = {}
+	    , i = cursor
+	    // Better data structures make algorithm much faster.
+	    , outgoingEdges = makeOutgoingEdges(edges)
+	    , nodesHash = makeNodesHash(nodes);
+
+	  // check for unknown 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, new Set());
+	  }
+
+	  return sorted
+
+	  function visit(node, i, 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[i]) return;
+	    visited[i] = true;
+
+	    var outgoing = outgoingEdges.get(node) || new Set();
+	    outgoing = Array.from(outgoing);
+
+	    if (i = outgoing.length) {
+	      predecessors.add(node);
+	      do {
+	        var child = outgoing[--i];
+	        visit(child, nodesHash.get(child), predecessors);
+	      } while (i)
+	      predecessors.delete(node);
+	    }
+
+	    sorted[--cursor] = node;
+	  }
+	}
+
+	function uniqueNodes(arr){
+	  var res = 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 = 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], new Set());
+	    if (!edges.has(edge[1])) edges.set(edge[1], new Set());
+	    edges.get(edge[0]).add(edge[1]);
+	  }
+	  return edges
+	}
+
+	function makeNodesHash(arr){
+	  var res = new Map();
+	  for (var i = 0, len = arr.length; i < len; i++) {
+	    res.set(arr[i], i);
+	  }
+	  return res
+	}
+	return toposort$1.exports;
 }
 
-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(' ');
-
-var tinyCase = {
-  words,
-  upperFirst,
-  camelCase,
-  pascalCase,
-  snakeCase,
-  kebabCase,
-  sentenceCase,
-  titleCase,
-};
-
-var toposort$2 = {exports: {}};
-
-/**
- * Topological sorting function
- *
- * @param {Array} edges
- * @returns {Array}
- */
-
-toposort$2.exports = function(edges) {
-  return toposort(uniqueNodes(edges), edges)
-};
-
-toposort$2.exports.array = toposort;
-
-function toposort(nodes, edges) {
-  var cursor = nodes.length
-    , sorted = new Array(cursor)
-    , visited = {}
-    , i = cursor
-    // Better data structures make algorithm much faster.
-    , outgoingEdges = makeOutgoingEdges(edges)
-    , nodesHash = makeNodesHash(nodes);
-
-  // check for unknown 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, new Set());
-  }
-
-  return sorted
-
-  function visit(node, i, 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[i]) return;
-    visited[i] = true;
-
-    var outgoing = outgoingEdges.get(node) || new Set();
-    outgoing = Array.from(outgoing);
-
-    if (i = outgoing.length) {
-      predecessors.add(node);
-      do {
-        var child = outgoing[--i];
-        visit(child, nodesHash.get(child), predecessors);
-      } while (i)
-      predecessors.delete(node);
-    }
-
-    sorted[--cursor] = node;
-  }
-}
-
-function uniqueNodes(arr){
-  var res = 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 = 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], new Set());
-    if (!edges.has(edge[1])) edges.set(edge[1], new Set());
-    edges.get(edge[0]).add(edge[1]);
-  }
-  return edges
-}
-
-function makeNodesHash(arr){
-  var res = new Map();
-  for (var i = 0, len = arr.length; i < len; i++) {
-    res.set(arr[i], i);
-  }
-  return res
-}
-
-const toposort$1 = toposort$2.exports;
+var toposortExports = requireToposort();
+var toposort = /*@__PURE__*/getDefaultExportFromCjs(toposortExports);
 
 const toString = Object.prototype.toString;
 const errorToString = Error.prototype.toString;
@@ -561,7 +594,7 @@ class Reference {
     this.isSibling = !this.isContext && !this.isValue;
     let prefix = this.isContext ? prefixes.context : this.isValue ? prefixes.value : '';
     this.path = this.key.slice(prefix.length);
-    this.getter = this.path && propertyExpr.getter(this.path, true);
+    this.getter = this.path && propertyExprExports.getter(this.path, true);
     this.map = options.map;
   }
   getValue(value, parent, context) {
@@ -692,7 +725,7 @@ function getIn(schema, path, value, context = value) {
     parentPath: path,
     schema
   };
-  propertyExpr.forEach(path, (_part, isBracket, isArray) => {
+  propertyExprExports.forEach(path, (_part, isBracket, isArray) => {
     let part = isBracket ? _part.slice(1, _part.length - 1) : _part;
     schema = schema.resolve({
       context,
@@ -1741,7 +1774,7 @@ function sortFields(fields, excludedEdges = []) {
   let nodes = new Set();
   let excludes = new Set(excludedEdges.map(([a, b]) => `${a}-${b}`));
   function addNode(depPath, key) {
-    let node = propertyExpr.split(depPath)[0];
+    let node = propertyExprExports.split(depPath)[0];
     nodes.add(node);
     if (!excludes.has(`${key}-${node}`)) edges.push([key, node]);
   }
@@ -1750,7 +1783,7 @@ function sortFields(fields, excludedEdges = []) {
     nodes.add(key);
     if (Reference.isRef(value) && value.isSibling) addNode(value.path, key);else if (isSchema(value) && 'deps' in value) value.deps.forEach(path => addNode(path, key));
   }
-  return toposort$1.array(Array.from(nodes), edges).reverse();
+  return toposort.array(Array.from(nodes), edges).reverse();
 }
 
 function findIndex(arr, err) {
@@ -1808,10 +1841,10 @@ function deepPartial(schema) {
   return schema;
 }
 const deepHas = (obj, p) => {
-  const path = [...propertyExpr.normalizePath(p)];
+  const path = [...propertyExprExports.normalizePath(p)];
   if (path.length === 1) return path[0] in obj;
   let last = path.pop();
-  let parent = propertyExpr.getter(propertyExpr.join(path), true)(obj);
+  let parent = propertyExprExports.getter(propertyExprExports.join(path), true)(obj);
   return !!(parent && last in parent);
 };
 let isObject = obj => Object.prototype.toString.call(obj) === '[object Object]';
@@ -2027,7 +2060,7 @@ class ObjectSchema extends Schema {
     return this.pick(remaining);
   }
   from(from, to, alias) {
-    let fromGetter = propertyExpr.getter(from, true);
+    let fromGetter = propertyExprExports.getter(from, true);
     return this.transform(obj => {
       if (!obj) return obj;
       let newObj = obj;
@@ -2103,13 +2136,13 @@ class ObjectSchema extends Schema {
     });
   }
   camelCase() {
-    return this.transformKeys(tinyCase.camelCase);
+    return this.transformKeys(tinyCaseExports.camelCase);
   }
   snakeCase() {
-    return this.transformKeys(tinyCase.snakeCase);
+    return this.transformKeys(tinyCaseExports.snakeCase);
   }
   constantCase() {
-    return this.transformKeys(key => tinyCase.snakeCase(key).toUpperCase());
+    return this.transformKeys(key => tinyCaseExports.snakeCase(key).toUpperCase());
   }
   describe(options) {
     const next = (options ? this.resolve(options) : this).clone();
@@ -2131,7 +2164,7 @@ class ObjectSchema extends Schema {
 }
 create$3.prototype = ObjectSchema.prototype;
 
-const version = "0.0.89";
+const version = "0.0.90";
 
 // This file is auto-generated. Do not edit it manually.
 // Use command: yarn generate-locale-mapper
@@ -2175,14 +2208,14 @@ const localeMapper = {
     ],
     "vehicleLookup": [
         "locales/vehicleLookup/accessories/",
-        "locales/vehicleLookup/dynamicClaim/",
+        "locales/vehicleLookup/claimableItems/",
         "locales/vehicleLookup/paintThickness/",
         "locales/vehicleLookup/serviceHistory/",
         "locales/vehicleLookup/specification/",
         "locales/vehicleLookup/warranty/"
     ],
-    "vehicleLookup.dynamicClaim": [
-        "locales/vehicleLookup/dynamicClaim/"
+    "vehicleLookup.claimableItems": [
+        "locales/vehicleLookup/claimableItems/"
     ],
     "vehicleLookup.paintThickness": [
         "locales/vehicleLookup/paintThickness/"
@@ -2308,11 +2341,21 @@ function recursiveParser(parents, bluePrint, parsedResponseMapper, languageFile)
 async function requestLocaleFile(localeFile) {
     if (cachedLocales[localeFile])
         return await cachedLocales[localeFile];
-    const fetchPromise = (fetch(`https://cdn.jsdelivr.net/npm/adp-web-components@${version}/dist/${localeFile}`)).then(res => res.json());
-    cachedLocales[localeFile] = fetchPromise;
-    const result = await fetchPromise;
-    cachedLocales[localeFile] = result;
-    return result;
+    try {
+        const fetchPromise = (fetch(`https://cdn.jsdelivr.net/npm/adp-web-components@${version}/dist/${localeFile}`)).then(res => {
+            if (!res.ok)
+                delete cachedLocales[localeFile];
+            return res.json();
+        });
+        cachedLocales[localeFile] = fetchPromise;
+        const result = await fetchPromise;
+        cachedLocales[localeFile] = result;
+        return result;
+    }
+    catch (error) {
+        delete cachedLocales[localeFile];
+        return {};
+    }
 }
 
-export { create$6 as a, getSharedLocal as b, create$3 as c, getLocaleLanguage as g, sharedLocalesSchema as s, yupTypeMapper as y };
+export { getSharedLocal as a, create$6 as b, create$3 as c, getLocaleLanguage as g, sharedLocalesSchema as s, yupTypeMapper as y };