@ni/nimble-components 29.3.6 → 29.3.7

package/dist/all-components-bundle.js

@@ -16280,7 +16280,7 @@
 
   /**
    * Do not edit directly
-   * Generated on Thu, 13 Jun 2024 16:48:33 GMT
+   * Generated on Mon, 17 Jun 2024 15:00:56 GMT
    */
 
   const Information100DarkUi = "#a46eff";
@@ -51839,38 +51839,35 @@ img.ProseMirror-separator {
   LinkifyIt.prototype.onCompile = function onCompile () {
   };
 
-  /*! https://mths.be/punycode v1.4.1 by @mathias */
-
-
   /** Highest positive signed 32-bit float value */
-  var maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1
+  const maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1
 
   /** Bootstring parameters */
-  var base = 36;
-  var tMin = 1;
-  var tMax = 26;
-  var skew = 38;
-  var damp = 700;
-  var initialBias = 72;
-  var initialN = 128; // 0x80
-  var delimiter = '-'; // '\x2D'
+  const base = 36;
+  const tMin = 1;
+  const tMax = 26;
+  const skew = 38;
+  const damp = 700;
+  const initialBias = 72;
+  const initialN = 128; // 0x80
+  const delimiter = '-'; // '\x2D'
 
   /** Regular expressions */
-  var regexPunycode = /^xn--/;
-  var regexNonASCII = /[^\x20-\x7E]/; // unprintable ASCII chars + non-ASCII chars
-  var regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g; // RFC 3490 separators
+  const regexPunycode = /^xn--/;
+  const regexNonASCII = /[^\0-\x7F]/; // Note: U+007F DEL is excluded too.
+  const regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g; // RFC 3490 separators
 
   /** Error messages */
-  var errors = {
-    'overflow': 'Overflow: input needs wider integers to process',
-    'not-basic': 'Illegal input >= 0x80 (not a basic code point)',
-    'invalid-input': 'Invalid input'
+  const errors = {
+  	'overflow': 'Overflow: input needs wider integers to process',
+  	'not-basic': 'Illegal input >= 0x80 (not a basic code point)',
+  	'invalid-input': 'Invalid input'
   };
 
   /** Convenience shortcuts */
-  var baseMinusTMin = base - tMin;
-  var floor = Math.floor;
-  var stringFromCharCode = String.fromCharCode;
+  const baseMinusTMin = base - tMin;
+  const floor = Math.floor;
+  const stringFromCharCode = String.fromCharCode;
 
   /*--------------------------------------------------------------------------*/
 
@@ -51881,7 +51878,7 @@ img.ProseMirror-separator {
    * @returns {Error} Throws a `RangeError` with the applicable error message.
    */
   function error(type) {
-    throw new RangeError(errors[type]);
+  	throw new RangeError(errors[type]);
   }
 
   /**
@@ -51892,13 +51889,13 @@ img.ProseMirror-separator {
    * item.
    * @returns {Array} A new array of values returned by the callback function.
    */
-  function map$1(array, fn) {
-    var length = array.length;
-    var result = [];
-    while (length--) {
-      result[length] = fn(array[length]);
-    }
-    return result;
+  function map$1(array, callback) {
+  	const result = [];
+  	let length = array.length;
+  	while (length--) {
+  		result[length] = callback(array[length]);
+  	}
+  	return result;
   }
 
   /**
@@ -51908,23 +51905,23 @@ img.ProseMirror-separator {
    * @param {String} domain The domain name or email address.
    * @param {Function} callback The function that gets called for every
    * character.
-   * @returns {Array} A new string of characters returned by the callback
+   * @returns {String} A new string of characters returned by the callback
    * function.
    */
-  function mapDomain(string, fn) {
-    var parts = string.split('@');
-    var result = '';
-    if (parts.length > 1) {
-      // In email addresses, only the domain name should be punycoded. Leave
-      // the local part (i.e. everything up to `@`) intact.
-      result = parts[0] + '@';
-      string = parts[1];
-    }
-    // Avoid `split(regex)` for IE8 compatibility. See #17.
-    string = string.replace(regexSeparators, '\x2E');
-    var labels = string.split('.');
-    var encoded = map$1(labels, fn).join('.');
-    return result + encoded;
+  function mapDomain(domain, callback) {
+  	const parts = domain.split('@');
+  	let result = '';
+  	if (parts.length > 1) {
+  		// In email addresses, only the domain name should be punycoded. Leave
+  		// the local part (i.e. everything up to `@`) intact.
+  		result = parts[0] + '@';
+  		domain = parts[1];
+  	}
+  	// Avoid `split(regex)` for IE8 compatibility. See #17.
+  	domain = domain.replace(regexSeparators, '\x2E');
+  	const labels = domain.split('.');
+  	const encoded = map$1(labels, callback).join('.');
+  	return result + encoded;
   }
 
   /**
@@ -51941,29 +51938,27 @@ img.ProseMirror-separator {
    * @returns {Array} The new array of code points.
    */
   function ucs2decode(string) {
-    var output = [],
-      counter = 0,
-      length = string.length,
-      value,
-      extra;
-    while (counter < length) {
-      value = string.charCodeAt(counter++);
-      if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
-        // high surrogate, and there is a next character
-        extra = string.charCodeAt(counter++);
-        if ((extra & 0xFC00) == 0xDC00) { // low surrogate
-          output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
-        } else {
-          // unmatched surrogate; only append this code unit, in case the next
-          // code unit is the high surrogate of a surrogate pair
-          output.push(value);
-          counter--;
-        }
-      } else {
-        output.push(value);
-      }
-    }
-    return output;
+  	const output = [];
+  	let counter = 0;
+  	const length = string.length;
+  	while (counter < length) {
+  		const value = string.charCodeAt(counter++);
+  		if (value >= 0xD800 && value <= 0xDBFF && counter < length) {
+  			// It's a high surrogate, and there is a next character.
+  			const extra = string.charCodeAt(counter++);
+  			if ((extra & 0xFC00) == 0xDC00) { // Low surrogate.
+  				output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);
+  			} else {
+  				// It's an unmatched surrogate; only append this code unit, in case the
+  				// next code unit is the high surrogate of a surrogate pair.
+  				output.push(value);
+  				counter--;
+  			}
+  		} else {
+  			output.push(value);
+  		}
+  	}
+  	return output;
   }
 
   /**
@@ -51974,18 +51969,7 @@ img.ProseMirror-separator {
    * @param {Array} codePoints The array of numeric code points.
    * @returns {String} The new Unicode string (UCS-2).
    */
-  function ucs2encode(array) {
-    return map$1(array, function(value) {
-      var output = '';
-      if (value > 0xFFFF) {
-        value -= 0x10000;
-        output += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);
-        value = 0xDC00 | value & 0x3FF;
-      }
-      output += stringFromCharCode(value);
-      return output;
-    }).join('');
-  }
+  const ucs2encode = codePoints => String.fromCodePoint(...codePoints);
 
   /**
    * Converts a basic code point into a digit/integer.
@@ -51996,18 +51980,18 @@ img.ProseMirror-separator {
    * representing integers) in the range `0` to `base - 1`, or `base` if
    * the code point does not represent a value.
    */
-  function basicToDigit(codePoint) {
-    if (codePoint - 48 < 10) {
-      return codePoint - 22;
-    }
-    if (codePoint - 65 < 26) {
-      return codePoint - 65;
-    }
-    if (codePoint - 97 < 26) {
-      return codePoint - 97;
-    }
-    return base;
-  }
+  const basicToDigit = function(codePoint) {
+  	if (codePoint >= 0x30 && codePoint < 0x3A) {
+  		return 26 + (codePoint - 0x30);
+  	}
+  	if (codePoint >= 0x41 && codePoint < 0x5B) {
+  		return codePoint - 0x41;
+  	}
+  	if (codePoint >= 0x61 && codePoint < 0x7B) {
+  		return codePoint - 0x61;
+  	}
+  	return base;
+  };
 
   /**
    * Converts a digit/integer into a basic code point.
@@ -52020,26 +52004,26 @@ img.ProseMirror-separator {
    * used; else, the lowercase form is used. The behavior is undefined
    * if `flag` is non-zero and `digit` has no uppercase form.
    */
-  function digitToBasic(digit, flag) {
-    //  0..25 map to ASCII a..z or A..Z
-    // 26..35 map to ASCII 0..9
-    return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
-  }
+  const digitToBasic = function(digit, flag) {
+  	//  0..25 map to ASCII a..z or A..Z
+  	// 26..35 map to ASCII 0..9
+  	return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);
+  };
 
   /**
    * Bias adaptation function as per section 3.4 of RFC 3492.
    * https://tools.ietf.org/html/rfc3492#section-3.4
    * @private
    */
-  function adapt(delta, numPoints, firstTime) {
-    var k = 0;
-    delta = firstTime ? floor(delta / damp) : delta >> 1;
-    delta += floor(delta / numPoints);
-    for ( /* no initialization */ ; delta > baseMinusTMin * tMax >> 1; k += base) {
-      delta = floor(delta / baseMinusTMin);
-    }
-    return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
-  }
+  const adapt = function(delta, numPoints, firstTime) {
+  	let k = 0;
+  	delta = firstTime ? floor(delta / damp) : delta >> 1;
+  	delta += floor(delta / numPoints);
+  	for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {
+  		delta = floor(delta / baseMinusTMin);
+  	}
+  	return floor(k + (baseMinusTMin + 1) * delta / (delta + skew));
+  };
 
   /**
    * Converts a Punycode string of ASCII-only symbols to a string of Unicode
@@ -52048,213 +52032,187 @@ img.ProseMirror-separator {
    * @param {String} input The Punycode string of ASCII-only symbols.
    * @returns {String} The resulting string of Unicode symbols.
    */
-  function decode(input) {
-    // Don't use UCS-2
-    var output = [],
-      inputLength = input.length,
-      out,
-      i = 0,
-      n = initialN,
-      bias = initialBias,
-      basic,
-      j,
-      index,
-      oldi,
-      w,
-      k,
-      digit,
-      t,
-      /** Cached calculation results */
-      baseMinusT;
-
-    // Handle the basic code points: let `basic` be the number of input code
-    // points before the last delimiter, or `0` if there is none, then copy
-    // the first basic code points to the output.
-
-    basic = input.lastIndexOf(delimiter);
-    if (basic < 0) {
-      basic = 0;
-    }
-
-    for (j = 0; j < basic; ++j) {
-      // if it's not a basic code point
-      if (input.charCodeAt(j) >= 0x80) {
-        error('not-basic');
-      }
-      output.push(input.charCodeAt(j));
-    }
-
-    // Main decoding loop: start just after the last delimiter if any basic code
-    // points were copied; start at the beginning otherwise.
-
-    for (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */ ) {
-
-      // `index` is the index of the next character to be consumed.
-      // Decode a generalized variable-length integer into `delta`,
-      // which gets added to `i`. The overflow checking is easier
-      // if we increase `i` as we go, then subtract off its starting
-      // value at the end to obtain `delta`.
-      for (oldi = i, w = 1, k = base; /* no condition */ ; k += base) {
-
-        if (index >= inputLength) {
-          error('invalid-input');
-        }
+  const decode = function(input) {
+  	// Don't use UCS-2.
+  	const output = [];
+  	const inputLength = input.length;
+  	let i = 0;
+  	let n = initialN;
+  	let bias = initialBias;
 
-        digit = basicToDigit(input.charCodeAt(index++));
+  	// Handle the basic code points: let `basic` be the number of input code
+  	// points before the last delimiter, or `0` if there is none, then copy
+  	// the first basic code points to the output.
 
-        if (digit >= base || digit > floor((maxInt - i) / w)) {
-          error('overflow');
-        }
+  	let basic = input.lastIndexOf(delimiter);
+  	if (basic < 0) {
+  		basic = 0;
+  	}
 
-        i += digit * w;
-        t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
+  	for (let j = 0; j < basic; ++j) {
+  		// if it's not a basic code point
+  		if (input.charCodeAt(j) >= 0x80) {
+  			error('not-basic');
+  		}
+  		output.push(input.charCodeAt(j));
+  	}
 
-        if (digit < t) {
-          break;
-        }
+  	// Main decoding loop: start just after the last delimiter if any basic code
+  	// points were copied; start at the beginning otherwise.
 
-        baseMinusT = base - t;
-        if (w > floor(maxInt / baseMinusT)) {
-          error('overflow');
-        }
+  	for (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {
 
-        w *= baseMinusT;
+  		// `index` is the index of the next character to be consumed.
+  		// Decode a generalized variable-length integer into `delta`,
+  		// which gets added to `i`. The overflow checking is easier
+  		// if we increase `i` as we go, then subtract off its starting
+  		// value at the end to obtain `delta`.
+  		const oldi = i;
+  		for (let w = 1, k = base; /* no condition */; k += base) {
 
-      }
+  			if (index >= inputLength) {
+  				error('invalid-input');
+  			}
 
-      out = output.length + 1;
-      bias = adapt(i - oldi, out, oldi == 0);
+  			const digit = basicToDigit(input.charCodeAt(index++));
 
-      // `i` was supposed to wrap around from `out` to `0`,
-      // incrementing `n` each time, so we'll fix that now:
-      if (floor(i / out) > maxInt - n) {
-        error('overflow');
-      }
+  			if (digit >= base) {
+  				error('invalid-input');
+  			}
+  			if (digit > floor((maxInt - i) / w)) {
+  				error('overflow');
+  			}
 
-      n += floor(i / out);
-      i %= out;
+  			i += digit * w;
+  			const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
 
-      // Insert `n` at position `i` of the output
-      output.splice(i++, 0, n);
+  			if (digit < t) {
+  				break;
+  			}
 
-    }
-
-    return ucs2encode(output);
-  }
+  			const baseMinusT = base - t;
+  			if (w > floor(maxInt / baseMinusT)) {
+  				error('overflow');
+  			}
 
-  /**
-   * Converts a string of Unicode symbols (e.g. a domain name label) to a
-   * Punycode string of ASCII-only symbols.
-   * @memberOf punycode
-   * @param {String} input The string of Unicode symbols.
-   * @returns {String} The resulting Punycode string of ASCII-only symbols.
-   */
-  function encode(input) {
-    var n,
-      delta,
-      handledCPCount,
-      basicLength,
-      bias,
-      j,
-      m,
-      q,
-      k,
-      t,
-      currentValue,
-      output = [],
-      /** `inputLength` will hold the number of code points in `input`. */
-      inputLength,
-      /** Cached calculation results */
-      handledCPCountPlusOne,
-      baseMinusT,
-      qMinusT;
-
-    // Convert the input in UCS-2 to Unicode
-    input = ucs2decode(input);
-
-    // Cache the length
-    inputLength = input.length;
-
-    // Initialize the state
-    n = initialN;
-    delta = 0;
-    bias = initialBias;
-
-    // Handle the basic code points
-    for (j = 0; j < inputLength; ++j) {
-      currentValue = input[j];
-      if (currentValue < 0x80) {
-        output.push(stringFromCharCode(currentValue));
-      }
-    }
-
-    handledCPCount = basicLength = output.length;
-
-    // `handledCPCount` is the number of code points that have been handled;
-    // `basicLength` is the number of basic code points.
-
-    // Finish the basic string - if it is not empty - with a delimiter
-    if (basicLength) {
-      output.push(delimiter);
-    }
-
-    // Main encoding loop:
-    while (handledCPCount < inputLength) {
-
-      // All non-basic code points < n have been handled already. Find the next
-      // larger one:
-      for (m = maxInt, j = 0; j < inputLength; ++j) {
-        currentValue = input[j];
-        if (currentValue >= n && currentValue < m) {
-          m = currentValue;
-        }
-      }
+  			w *= baseMinusT;
 
-      // Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,
-      // but guard against overflow
-      handledCPCountPlusOne = handledCPCount + 1;
-      if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
-        error('overflow');
-      }
+  		}
 
-      delta += (m - n) * handledCPCountPlusOne;
-      n = m;
+  		const out = output.length + 1;
+  		bias = adapt(i - oldi, out, oldi == 0);
 
-      for (j = 0; j < inputLength; ++j) {
-        currentValue = input[j];
+  		// `i` was supposed to wrap around from `out` to `0`,
+  		// incrementing `n` each time, so we'll fix that now:
+  		if (floor(i / out) > maxInt - n) {
+  			error('overflow');
+  		}
 
-        if (currentValue < n && ++delta > maxInt) {
-          error('overflow');
-        }
+  		n += floor(i / out);
+  		i %= out;
 
-        if (currentValue == n) {
-          // Represent delta as a generalized variable-length integer
-          for (q = delta, k = base; /* no condition */ ; k += base) {
-            t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
-            if (q < t) {
-              break;
-            }
-            qMinusT = q - t;
-            baseMinusT = base - t;
-            output.push(
-              stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))
-            );
-            q = floor(qMinusT / baseMinusT);
-          }
+  		// Insert `n` at position `i` of the output.
+  		output.splice(i++, 0, n);
 
-          output.push(stringFromCharCode(digitToBasic(q, 0)));
-          bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);
-          delta = 0;
-          ++handledCPCount;
-        }
-      }
+  	}
 
-      ++delta;
-      ++n;
+  	return String.fromCodePoint(...output);
+  };
 
-    }
-    return output.join('');
-  }
+  /**
+   * Converts a string of Unicode symbols (e.g. a domain name label) to a
+   * Punycode string of ASCII-only symbols.
+   * @memberOf punycode
+   * @param {String} input The string of Unicode symbols.
+   * @returns {String} The resulting Punycode string of ASCII-only symbols.
+   */
+  const encode = function(input) {
+  	const output = [];
+
+  	// Convert the input in UCS-2 to an array of Unicode code points.
+  	input = ucs2decode(input);
+
+  	// Cache the length.
+  	const inputLength = input.length;
+
+  	// Initialize the state.
+  	let n = initialN;
+  	let delta = 0;
+  	let bias = initialBias;
+
+  	// Handle the basic code points.
+  	for (const currentValue of input) {
+  		if (currentValue < 0x80) {
+  			output.push(stringFromCharCode(currentValue));
+  		}
+  	}
+
+  	const basicLength = output.length;
+  	let handledCPCount = basicLength;
+
+  	// `handledCPCount` is the number of code points that have been handled;
+  	// `basicLength` is the number of basic code points.
+
+  	// Finish the basic string with a delimiter unless it's empty.
+  	if (basicLength) {
+  		output.push(delimiter);
+  	}
+
+  	// Main encoding loop:
+  	while (handledCPCount < inputLength) {
+
+  		// All non-basic code points < n have been handled already. Find the next
+  		// larger one:
+  		let m = maxInt;
+  		for (const currentValue of input) {
+  			if (currentValue >= n && currentValue < m) {
+  				m = currentValue;
+  			}
+  		}
+
+  		// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,
+  		// but guard against overflow.
+  		const handledCPCountPlusOne = handledCPCount + 1;
+  		if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {
+  			error('overflow');
+  		}
+
+  		delta += (m - n) * handledCPCountPlusOne;
+  		n = m;
+
+  		for (const currentValue of input) {
+  			if (currentValue < n && ++delta > maxInt) {
+  				error('overflow');
+  			}
+  			if (currentValue === n) {
+  				// Represent delta as a generalized variable-length integer.
+  				let q = delta;
+  				for (let k = base; /* no condition */; k += base) {
+  					const t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);
+  					if (q < t) {
+  						break;
+  					}
+  					const qMinusT = q - t;
+  					const baseMinusT = base - t;
+  					output.push(
+  						stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))
+  					);
+  					q = floor(qMinusT / baseMinusT);
+  				}
+
+  				output.push(stringFromCharCode(digitToBasic(q, 0)));
+  				bias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);
+  				delta = 0;
+  				++handledCPCount;
+  			}
+  		}
+
+  		++delta;
+  		++n;
+
+  	}
+  	return output.join('');
+  };
 
   /**
    * Converts a Punycode string representing a domain name or an email address
@@ -52267,13 +52225,13 @@ img.ProseMirror-separator {
    * @returns {String} The Unicode representation of the given Punycode
    * string.
    */
-  function toUnicode(input) {
-    return mapDomain(input, function(string) {
-      return regexPunycode.test(string) ?
-        decode(string.slice(4).toLowerCase()) :
-        string;
-    });
-  }
+  const toUnicode = function(input) {
+  	return mapDomain(input, function(string) {
+  		return regexPunycode.test(string)
+  			? decode(string.slice(4).toLowerCase())
+  			: string;
+  	});
+  };
 
   /**
    * Converts a Unicode string representing a domain name or an email address to
@@ -52286,33 +52244,39 @@ img.ProseMirror-separator {
    * @returns {String} The Punycode representation of the given domain name or
    * email address.
    */
-  function toASCII(input) {
-    return mapDomain(input, function(string) {
-      return regexNonASCII.test(string) ?
-        'xn--' + encode(string) :
-        string;
-    });
-  }
-  var version = '1.4.1';
-  /**
-   * An object of methods to convert from JavaScript's internal character
-   * representation (UCS-2) to Unicode code points, and back.
-   * @see <https://mathiasbynens.be/notes/javascript-encoding>
-   * @memberOf punycode
-   * @type Object
-   */
-
-  var ucs2 = {
-    decode: ucs2decode,
-    encode: ucs2encode
+  const toASCII = function(input) {
+  	return mapDomain(input, function(string) {
+  		return regexNonASCII.test(string)
+  			? 'xn--' + encode(string)
+  			: string;
+  	});
   };
-  var punycode = {
-    version: version,
-    ucs2: ucs2,
-    toASCII: toASCII,
-    toUnicode: toUnicode,
-    encode: encode,
-    decode: decode
+
+  /*--------------------------------------------------------------------------*/
+
+  /** Define the public API */
+  const punycode = {
+  	/**
+  	 * A string representing the current Punycode.js version number.
+  	 * @memberOf punycode
+  	 * @type String
+  	 */
+  	'version': '2.3.1',
+  	/**
+  	 * An object of methods to convert from JavaScript's internal character
+  	 * representation (UCS-2) to Unicode code points, and back.
+  	 * @see <https://mathiasbynens.be/notes/javascript-encoding>
+  	 * @memberOf punycode
+  	 * @type Object
+  	 */
+  	'ucs2': {
+  		'decode': ucs2decode,
+  		'encode': ucs2encode
+  	},
+  	'decode': decode,
+  	'encode': encode,
+  	'toASCII': toASCII,
+  	'toUnicode': toUnicode
   };
 
   // markdown-it default options