@lblod/ember-rdfa-editor 13.1.0 → 13.1.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (94) hide show
  1. package/README.md +165 -95
  2. package/dist/commands/_private/rdfa-commands/remove-backlink.js +1 -1
  3. package/dist/commands/_private/rdfa-commands/select-node-by-rdfa-id.js +1 -1
  4. package/dist/commands/_private/rdfa-commands/select-node-by-subject.js +1 -1
  5. package/dist/commands/_private/rdfa-commands/wrap-inline-resource.js +1 -1
  6. package/dist/commands/_private/rdfa-commands/wrap-literal.js +1 -1
  7. package/dist/commands/_private/rdfa-commands/wrap-resource.js +1 -1
  8. package/dist/commands/rdfa-commands/add-property.js +1 -1
  9. package/dist/commands/rdfa-commands/remove-property.js +1 -1
  10. package/dist/components/_private/attribute-editor/index.js +1 -1
  11. package/dist/components/_private/attribute-editor/index.js.map +1 -1
  12. package/dist/components/_private/common/configurable-rdfa-display.js +1 -1
  13. package/dist/components/_private/common/property-details.js +1 -1
  14. package/dist/components/_private/debug-info/index.js +1 -1
  15. package/dist/components/_private/debug-info/index.js.map +1 -1
  16. package/dist/components/_private/doc-editor/info-pill.js.map +1 -1
  17. package/dist/components/_private/doc-editor/lang-pill.js.map +1 -1
  18. package/dist/components/_private/doc-imported-resource-editor/card.js +1 -1
  19. package/dist/components/_private/doc-imported-resource-editor/card.js.map +1 -1
  20. package/dist/components/_private/doc-imported-resource-editor/form.js.map +1 -1
  21. package/dist/components/_private/external-triple-editor/card.js +1 -1
  22. package/dist/components/_private/external-triple-editor/card.js.map +1 -1
  23. package/dist/components/_private/external-triple-editor/form.js.map +1 -1
  24. package/dist/components/_private/imported-resource-linker/card.js +1 -1
  25. package/dist/components/_private/imported-resource-linker/card.js.map +1 -1
  26. package/dist/components/_private/node-controls/card.js +1 -1
  27. package/dist/components/_private/node-controls/card.js.map +1 -1
  28. package/dist/components/_private/node-controls/remove-node.js.map +1 -1
  29. package/dist/components/_private/node-controls/wrapping-utils.js +1 -1
  30. package/dist/components/_private/node-controls/wrapping-utils.js.map +1 -1
  31. package/dist/components/_private/rdfa-visualiser/rdfa-explorer.js +1 -1
  32. package/dist/components/_private/rdfa-visualiser/rdfa-explorer.js.map +1 -1
  33. package/dist/components/_private/rdfa-visualiser/resource-info.js +1 -1
  34. package/dist/components/_private/rdfa-visualiser/resource-info.js.map +1 -1
  35. package/dist/components/_private/rdfa-visualiser/visualiser-card.js +2 -2
  36. package/dist/components/_private/rdfa-visualiser/visualiser-card.js.map +1 -1
  37. package/dist/components/_private/relationship-editor/card.js +1 -1
  38. package/dist/components/_private/relationship-editor/card.js.map +1 -1
  39. package/dist/components/_private/relationship-editor/content-predicate-form.js.map +1 -1
  40. package/dist/components/_private/relationship-editor/create-button.js.map +1 -1
  41. package/dist/components/_private/relationship-editor/modals/classic.js.map +1 -1
  42. package/dist/components/_private/relationship-editor/modals/dev-mode.js +1 -1
  43. package/dist/components/_private/relationship-editor/modals/dev-mode.js.map +1 -1
  44. package/dist/components/collapsible.js.map +1 -1
  45. package/dist/components/debug-tools.js.map +1 -1
  46. package/dist/components/editor.js +3 -3
  47. package/dist/components/editor.js.map +1 -1
  48. package/dist/components/ember-node/embedded-editor.js +2 -2
  49. package/dist/components/ember-node/embedded-editor.js.map +1 -1
  50. package/dist/components/ember-node/inline-rdfa.js.map +1 -1
  51. package/dist/components/plugins/alignment/alignment-menu.js +2 -2
  52. package/dist/components/plugins/alignment/alignment-menu.js.map +1 -1
  53. package/dist/components/plugins/heading/heading-menu.js +2 -2
  54. package/dist/components/plugins/heading/heading-menu.js.map +1 -1
  55. package/dist/components/plugins/html-editor/menu.js.map +1 -1
  56. package/dist/components/plugins/html-editor/modal.js.map +1 -1
  57. package/dist/components/plugins/image/insert-menu.js.map +1 -1
  58. package/dist/components/plugins/link/link-editor.js +1 -1
  59. package/dist/components/plugins/list/ordered.js +3 -3
  60. package/dist/components/plugins/list/ordered.js.map +1 -1
  61. package/dist/components/plugins/list/unordered.js +1 -1
  62. package/dist/components/plugins/table/color.js.map +1 -1
  63. package/dist/components/plugins/table/table-menu.js.map +1 -1
  64. package/dist/components/plugins/table/table-tooltip.js.map +1 -1
  65. package/dist/components/plugins/table/vertical-align.js +2 -2
  66. package/dist/components/plugins/table/vertical-align.js.map +1 -1
  67. package/dist/components/plugins/text-style/color.js.map +1 -1
  68. package/dist/components/plugins/text-style/highlight.js.map +1 -1
  69. package/dist/components/toolbar/dropdown.js.map +1 -1
  70. package/dist/components/toolbar/mark.js +1 -1
  71. package/dist/components/utils/au-pill-dropdown.js.map +1 -1
  72. package/dist/core/keymap.js +1 -1
  73. package/dist/core/rdfa-types.js +1 -1
  74. package/dist/core/say-controller.js +1 -1
  75. package/dist/core/say-controller.js.map +1 -1
  76. package/dist/core/say-data-factory/data-factory.js.map +1 -1
  77. package/dist/core/say-data-factory/named-node.js.map +1 -1
  78. package/dist/core/say-editor.js.map +1 -1
  79. package/dist/core/say-view.js.map +1 -1
  80. package/dist/{main-CBbqRlCI.js → main-dUbkrxFL.js} +133 -358
  81. package/dist/main-dUbkrxFL.js.map +1 -0
  82. package/dist/nodes/invisible-rdfa.js +1 -1
  83. package/dist/plugins/list/commands/lift-out-of-nested-lists.js +1 -1
  84. package/dist/plugins/list/nodes/on-changed.js +1 -1
  85. package/dist/plugins/list/nodes/on-changed.js.map +1 -1
  86. package/dist/plugins/rdfa-info/index.js +1 -1
  87. package/dist/plugins/rdfa-info/types.js +1 -1
  88. package/dist/plugins/remove-properties-of-deleted-nodes/index.js +1 -1
  89. package/dist/utils/_private/datastore/graphy-dataset.js +1 -1
  90. package/dist/utils/_private/datastore/term-mapping.js.map +1 -1
  91. package/dist/utils/_private/rdfa-parser/rdfa-parser.js.map +1 -1
  92. package/dist/utils/transaction-utils.js.map +1 -1
  93. package/package.json +42 -42
  94. package/dist/main-CBbqRlCI.js.map +0 -1
@@ -383,15 +383,15 @@ function requireBuffer$1() {
383
383
  hasRequiredBuffer$1 = 1;
384
384
  (function (exports) {
385
385
 
386
- const base64 = requireBase64Js();
387
- const ieee754 = requireIeee754();
388
- const customInspectSymbol = typeof Symbol === 'function' && typeof Symbol['for'] === 'function' // eslint-disable-line dot-notation
386
+ var base64 = requireBase64Js();
387
+ var ieee754 = requireIeee754();
388
+ var customInspectSymbol = typeof Symbol === 'function' && typeof Symbol['for'] === 'function' // eslint-disable-line dot-notation
389
389
  ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation
390
390
  : null;
391
391
  exports.Buffer = Buffer;
392
392
  exports.SlowBuffer = SlowBuffer;
393
393
  exports.INSPECT_MAX_BYTES = 50;
394
- const K_MAX_LENGTH = 0x7fffffff;
394
+ var K_MAX_LENGTH = 0x7fffffff;
395
395
  exports.kMaxLength = K_MAX_LENGTH;
396
396
 
397
397
  /**
@@ -415,8 +415,8 @@ function requireBuffer$1() {
415
415
  function typedArraySupport() {
416
416
  // Can typed array instances can be augmented?
417
417
  try {
418
- const arr = new Uint8Array(1);
419
- const proto = {
418
+ var arr = new Uint8Array(1);
419
+ var proto = {
420
420
  foo: function () {
421
421
  return 42;
422
422
  }
@@ -447,7 +447,7 @@ function requireBuffer$1() {
447
447
  throw new RangeError('The value "' + length + '" is invalid for option "size"');
448
448
  }
449
449
  // Return an augmented `Uint8Array` instance
450
- const buf = new Uint8Array(length);
450
+ var buf = new Uint8Array(length);
451
451
  Object.setPrototypeOf(buf, Buffer.prototype);
452
452
  return buf;
453
453
  }
@@ -493,11 +493,11 @@ function requireBuffer$1() {
493
493
  if (typeof value === 'number') {
494
494
  throw new TypeError('The "value" argument must not be of type number. Received type number');
495
495
  }
496
- const valueOf = value.valueOf && value.valueOf();
496
+ var valueOf = value.valueOf && value.valueOf();
497
497
  if (valueOf != null && valueOf !== value) {
498
498
  return Buffer.from(valueOf, encodingOrOffset, length);
499
499
  }
500
- const b = fromObject(value);
500
+ var b = fromObject(value);
501
501
  if (b) return b;
502
502
  if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null && typeof value[Symbol.toPrimitive] === 'function') {
503
503
  return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length);
@@ -573,9 +573,9 @@ function requireBuffer$1() {
573
573
  if (!Buffer.isEncoding(encoding)) {
574
574
  throw new TypeError('Unknown encoding: ' + encoding);
575
575
  }
576
- const length = byteLength(string, encoding) | 0;
577
- let buf = createBuffer(length);
578
- const actual = buf.write(string, encoding);
576
+ var length = byteLength(string, encoding) | 0;
577
+ var buf = createBuffer(length);
578
+ var actual = buf.write(string, encoding);
579
579
  if (actual !== length) {
580
580
  // Writing a hex string, for example, that contains invalid characters will
581
581
  // cause everything after the first invalid character to be ignored. (e.g.
@@ -585,16 +585,16 @@ function requireBuffer$1() {
585
585
  return buf;
586
586
  }
587
587
  function fromArrayLike(array) {
588
- const length = array.length < 0 ? 0 : checked(array.length) | 0;
589
- const buf = createBuffer(length);
590
- for (let i = 0; i < length; i += 1) {
588
+ var length = array.length < 0 ? 0 : checked(array.length) | 0;
589
+ var buf = createBuffer(length);
590
+ for (var i = 0; i < length; i += 1) {
591
591
  buf[i] = array[i] & 255;
592
592
  }
593
593
  return buf;
594
594
  }
595
595
  function fromArrayView(arrayView) {
596
596
  if (isInstance(arrayView, Uint8Array)) {
597
- const copy = new Uint8Array(arrayView);
597
+ var copy = new Uint8Array(arrayView);
598
598
  return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength);
599
599
  }
600
600
  return fromArrayLike(arrayView);
@@ -606,7 +606,7 @@ function requireBuffer$1() {
606
606
  if (array.byteLength < byteOffset + (length || 0)) {
607
607
  throw new RangeError('"length" is outside of buffer bounds');
608
608
  }
609
- let buf;
609
+ var buf;
610
610
  if (byteOffset === undefined && length === undefined) {
611
611
  buf = new Uint8Array(array);
612
612
  } else if (length === undefined) {
@@ -621,8 +621,8 @@ function requireBuffer$1() {
621
621
  }
622
622
  function fromObject(obj) {
623
623
  if (Buffer.isBuffer(obj)) {
624
- const len = checked(obj.length) | 0;
625
- const buf = createBuffer(len);
624
+ var len = checked(obj.length) | 0;
625
+ var buf = createBuffer(len);
626
626
  if (buf.length === 0) {
627
627
  return buf;
628
628
  }
@@ -664,9 +664,9 @@ function requireBuffer$1() {
664
664
  throw new TypeError('The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array');
665
665
  }
666
666
  if (a === b) return 0;
667
- let x = a.length;
668
- let y = b.length;
669
- for (let i = 0, len = Math.min(x, y); i < len; ++i) {
667
+ var x = a.length;
668
+ var y = b.length;
669
+ for (var i = 0, len = Math.min(x, y); i < len; ++i) {
670
670
  if (a[i] !== b[i]) {
671
671
  x = a[i];
672
672
  y = b[i];
@@ -702,21 +702,20 @@ function requireBuffer$1() {
702
702
  if (list.length === 0) {
703
703
  return Buffer.alloc(0);
704
704
  }
705
- let i;
705
+ var i;
706
706
  if (length === undefined) {
707
707
  length = 0;
708
708
  for (i = 0; i < list.length; ++i) {
709
709
  length += list[i].length;
710
710
  }
711
711
  }
712
- const buffer = Buffer.allocUnsafe(length);
713
- let pos = 0;
712
+ var buffer = Buffer.allocUnsafe(length);
713
+ var pos = 0;
714
714
  for (i = 0; i < list.length; ++i) {
715
- let buf = list[i];
715
+ var buf = list[i];
716
716
  if (isInstance(buf, Uint8Array)) {
717
717
  if (pos + buf.length > buffer.length) {
718
- if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf);
719
- buf.copy(buffer, pos);
718
+ Buffer.from(buf).copy(buffer, pos);
720
719
  } else {
721
720
  Uint8Array.prototype.set.call(buffer, buf, pos);
722
721
  }
@@ -739,12 +738,12 @@ function requireBuffer$1() {
739
738
  if (typeof string !== 'string') {
740
739
  throw new TypeError('The "string" argument must be one of type string, Buffer, or ArrayBuffer. ' + 'Received type ' + typeof string);
741
740
  }
742
- const len = string.length;
743
- const mustMatch = arguments.length > 2 && arguments[2] === true;
741
+ var len = string.length;
742
+ var mustMatch = arguments.length > 2 && arguments[2] === true;
744
743
  if (!mustMatch && len === 0) return 0;
745
744
 
746
745
  // Use a for loop to avoid recursion
747
- let loweredCase = false;
746
+ var loweredCase = false;
748
747
  for (;;) {
749
748
  switch (encoding) {
750
749
  case 'ascii':
@@ -774,7 +773,7 @@ function requireBuffer$1() {
774
773
  }
775
774
  Buffer.byteLength = byteLength;
776
775
  function slowToString(encoding, start, end) {
777
- let loweredCase = false;
776
+ var loweredCase = false;
778
777
 
779
778
  // No need to verify that "this.length <= MAX_UINT32" since it's a read-only
780
779
  // property of a typed array.
@@ -840,37 +839,37 @@ function requireBuffer$1() {
840
839
  // See: https://github.com/feross/buffer/issues/154
841
840
  Buffer.prototype._isBuffer = true;
842
841
  function swap(b, n, m) {
843
- const i = b[n];
842
+ var i = b[n];
844
843
  b[n] = b[m];
845
844
  b[m] = i;
846
845
  }
847
846
  Buffer.prototype.swap16 = function swap16() {
848
- const len = this.length;
847
+ var len = this.length;
849
848
  if (len % 2 !== 0) {
850
849
  throw new RangeError('Buffer size must be a multiple of 16-bits');
851
850
  }
852
- for (let i = 0; i < len; i += 2) {
851
+ for (var i = 0; i < len; i += 2) {
853
852
  swap(this, i, i + 1);
854
853
  }
855
854
  return this;
856
855
  };
857
856
  Buffer.prototype.swap32 = function swap32() {
858
- const len = this.length;
857
+ var len = this.length;
859
858
  if (len % 4 !== 0) {
860
859
  throw new RangeError('Buffer size must be a multiple of 32-bits');
861
860
  }
862
- for (let i = 0; i < len; i += 4) {
861
+ for (var i = 0; i < len; i += 4) {
863
862
  swap(this, i, i + 3);
864
863
  swap(this, i + 1, i + 2);
865
864
  }
866
865
  return this;
867
866
  };
868
867
  Buffer.prototype.swap64 = function swap64() {
869
- const len = this.length;
868
+ var len = this.length;
870
869
  if (len % 8 !== 0) {
871
870
  throw new RangeError('Buffer size must be a multiple of 64-bits');
872
871
  }
873
- for (let i = 0; i < len; i += 8) {
872
+ for (var i = 0; i < len; i += 8) {
874
873
  swap(this, i, i + 7);
875
874
  swap(this, i + 1, i + 6);
876
875
  swap(this, i + 2, i + 5);
@@ -879,7 +878,7 @@ function requireBuffer$1() {
879
878
  return this;
880
879
  };
881
880
  Buffer.prototype.toString = function toString() {
882
- const length = this.length;
881
+ var length = this.length;
883
882
  if (length === 0) return '';
884
883
  if (arguments.length === 0) return utf8Slice(this, 0, length);
885
884
  return slowToString.apply(this, arguments);
@@ -891,8 +890,8 @@ function requireBuffer$1() {
891
890
  return Buffer.compare(this, b) === 0;
892
891
  };
893
892
  Buffer.prototype.inspect = function inspect() {
894
- let str = '';
895
- const max = exports.INSPECT_MAX_BYTES;
893
+ var str = '';
894
+ var max = exports.INSPECT_MAX_BYTES;
896
895
  str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim();
897
896
  if (this.length > max) str += ' ... ';
898
897
  return '<Buffer ' + str + '>';
@@ -936,12 +935,12 @@ function requireBuffer$1() {
936
935
  thisStart >>>= 0;
937
936
  thisEnd >>>= 0;
938
937
  if (this === target) return 0;
939
- let x = thisEnd - thisStart;
940
- let y = end - start;
941
- const len = Math.min(x, y);
942
- const thisCopy = this.slice(thisStart, thisEnd);
943
- const targetCopy = target.slice(start, end);
944
- for (let i = 0; i < len; ++i) {
938
+ var x = thisEnd - thisStart;
939
+ var y = end - start;
940
+ var len = Math.min(x, y);
941
+ var thisCopy = this.slice(thisStart, thisEnd);
942
+ var targetCopy = target.slice(start, end);
943
+ for (var i = 0; i < len; ++i) {
945
944
  if (thisCopy[i] !== targetCopy[i]) {
946
945
  x = thisCopy[i];
947
946
  y = targetCopy[i];
@@ -1015,9 +1014,9 @@ function requireBuffer$1() {
1015
1014
  throw new TypeError('val must be string, number or Buffer');
1016
1015
  }
1017
1016
  function arrayIndexOf(arr, val, byteOffset, encoding, dir) {
1018
- let indexSize = 1;
1019
- let arrLength = arr.length;
1020
- let valLength = val.length;
1017
+ var indexSize = 1;
1018
+ var arrLength = arr.length;
1019
+ var valLength = val.length;
1021
1020
  if (encoding !== undefined) {
1022
1021
  encoding = String(encoding).toLowerCase();
1023
1022
  if (encoding === 'ucs2' || encoding === 'ucs-2' || encoding === 'utf16le' || encoding === 'utf-16le') {
@@ -1037,9 +1036,9 @@ function requireBuffer$1() {
1037
1036
  return buf.readUInt16BE(i * indexSize);
1038
1037
  }
1039
1038
  }
1040
- let i;
1039
+ var i;
1041
1040
  if (dir) {
1042
- let foundIndex = -1;
1041
+ var foundIndex = -1;
1043
1042
  for (i = byteOffset; i < arrLength; i++) {
1044
1043
  if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {
1045
1044
  if (foundIndex === -1) foundIndex = i;
@@ -1052,8 +1051,8 @@ function requireBuffer$1() {
1052
1051
  } else {
1053
1052
  if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength;
1054
1053
  for (i = byteOffset; i >= 0; i--) {
1055
- let found = true;
1056
- for (let j = 0; j < valLength; j++) {
1054
+ var found = true;
1055
+ for (var j = 0; j < valLength; j++) {
1057
1056
  if (read(arr, i + j) !== read(val, j)) {
1058
1057
  found = false;
1059
1058
  break;
@@ -1075,7 +1074,7 @@ function requireBuffer$1() {
1075
1074
  };
1076
1075
  function hexWrite(buf, string, offset, length) {
1077
1076
  offset = Number(offset) || 0;
1078
- const remaining = buf.length - offset;
1077
+ var remaining = buf.length - offset;
1079
1078
  if (!length) {
1080
1079
  length = remaining;
1081
1080
  } else {
@@ -1084,13 +1083,12 @@ function requireBuffer$1() {
1084
1083
  length = remaining;
1085
1084
  }
1086
1085
  }
1087
- const strLen = string.length;
1086
+ var strLen = string.length;
1088
1087
  if (length > strLen / 2) {
1089
1088
  length = strLen / 2;
1090
1089
  }
1091
- let i;
1092
- for (i = 0; i < length; ++i) {
1093
- const parsed = parseInt(string.substr(i * 2, 2), 16);
1090
+ for (var i = 0; i < length; ++i) {
1091
+ var parsed = parseInt(string.substr(i * 2, 2), 16);
1094
1092
  if (numberIsNaN(parsed)) return i;
1095
1093
  buf[offset + i] = parsed;
1096
1094
  }
@@ -1132,13 +1130,13 @@ function requireBuffer$1() {
1132
1130
  } else {
1133
1131
  throw new Error('Buffer.write(string, encoding, offset[, length]) is no longer supported');
1134
1132
  }
1135
- const remaining = this.length - offset;
1133
+ var remaining = this.length - offset;
1136
1134
  if (length === undefined || length > remaining) length = remaining;
1137
1135
  if (string.length > 0 && (length < 0 || offset < 0) || offset > this.length) {
1138
1136
  throw new RangeError('Attempt to write outside buffer bounds');
1139
1137
  }
1140
1138
  if (!encoding) encoding = 'utf8';
1141
- let loweredCase = false;
1139
+ var loweredCase = false;
1142
1140
  for (;;) {
1143
1141
  switch (encoding) {
1144
1142
  case 'hex':
@@ -1180,14 +1178,14 @@ function requireBuffer$1() {
1180
1178
  }
1181
1179
  function utf8Slice(buf, start, end) {
1182
1180
  end = Math.min(buf.length, end);
1183
- const res = [];
1184
- let i = start;
1181
+ var res = [];
1182
+ var i = start;
1185
1183
  while (i < end) {
1186
- const firstByte = buf[i];
1187
- let codePoint = null;
1188
- let bytesPerSequence = firstByte > 0xEF ? 4 : firstByte > 0xDF ? 3 : firstByte > 0xBF ? 2 : 1;
1184
+ var firstByte = buf[i];
1185
+ var codePoint = null;
1186
+ var bytesPerSequence = firstByte > 0xEF ? 4 : firstByte > 0xDF ? 3 : firstByte > 0xBF ? 2 : 1;
1189
1187
  if (i + bytesPerSequence <= end) {
1190
- let secondByte, thirdByte, fourthByte, tempCodePoint;
1188
+ var secondByte, thirdByte, fourthByte, tempCodePoint;
1191
1189
  switch (bytesPerSequence) {
1192
1190
  case 1:
1193
1191
  if (firstByte < 0x80) {
@@ -1245,58 +1243,58 @@ function requireBuffer$1() {
1245
1243
  // Based on http://stackoverflow.com/a/22747272/680742, the browser with
1246
1244
  // the lowest limit is Chrome, with 0x10000 args.
1247
1245
  // We go 1 magnitude less, for safety
1248
- const MAX_ARGUMENTS_LENGTH = 0x1000;
1246
+ var MAX_ARGUMENTS_LENGTH = 0x1000;
1249
1247
  function decodeCodePointsArray(codePoints) {
1250
- const len = codePoints.length;
1248
+ var len = codePoints.length;
1251
1249
  if (len <= MAX_ARGUMENTS_LENGTH) {
1252
1250
  return String.fromCharCode.apply(String, codePoints); // avoid extra slice()
1253
1251
  }
1254
1252
 
1255
1253
  // Decode in chunks to avoid "call stack size exceeded".
1256
- let res = '';
1257
- let i = 0;
1254
+ var res = '';
1255
+ var i = 0;
1258
1256
  while (i < len) {
1259
1257
  res += String.fromCharCode.apply(String, codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH));
1260
1258
  }
1261
1259
  return res;
1262
1260
  }
1263
1261
  function asciiSlice(buf, start, end) {
1264
- let ret = '';
1262
+ var ret = '';
1265
1263
  end = Math.min(buf.length, end);
1266
- for (let i = start; i < end; ++i) {
1264
+ for (var i = start; i < end; ++i) {
1267
1265
  ret += String.fromCharCode(buf[i] & 0x7F);
1268
1266
  }
1269
1267
  return ret;
1270
1268
  }
1271
1269
  function latin1Slice(buf, start, end) {
1272
- let ret = '';
1270
+ var ret = '';
1273
1271
  end = Math.min(buf.length, end);
1274
- for (let i = start; i < end; ++i) {
1272
+ for (var i = start; i < end; ++i) {
1275
1273
  ret += String.fromCharCode(buf[i]);
1276
1274
  }
1277
1275
  return ret;
1278
1276
  }
1279
1277
  function hexSlice(buf, start, end) {
1280
- const len = buf.length;
1278
+ var len = buf.length;
1281
1279
  if (!start || start < 0) start = 0;
1282
1280
  if (!end || end < 0 || end > len) end = len;
1283
- let out = '';
1284
- for (let i = start; i < end; ++i) {
1281
+ var out = '';
1282
+ for (var i = start; i < end; ++i) {
1285
1283
  out += hexSliceLookupTable[buf[i]];
1286
1284
  }
1287
1285
  return out;
1288
1286
  }
1289
1287
  function utf16leSlice(buf, start, end) {
1290
- const bytes = buf.slice(start, end);
1291
- let res = '';
1288
+ var bytes = buf.slice(start, end);
1289
+ var res = '';
1292
1290
  // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)
1293
- for (let i = 0; i < bytes.length - 1; i += 2) {
1291
+ for (var i = 0; i < bytes.length - 1; i += 2) {
1294
1292
  res += String.fromCharCode(bytes[i] + bytes[i + 1] * 256);
1295
1293
  }
1296
1294
  return res;
1297
1295
  }
1298
1296
  Buffer.prototype.slice = function slice(start, end) {
1299
- const len = this.length;
1297
+ var len = this.length;
1300
1298
  start = ~~start;
1301
1299
  end = end === undefined ? len : ~~end;
1302
1300
  if (start < 0) {
@@ -1312,7 +1310,7 @@ function requireBuffer$1() {
1312
1310
  end = len;
1313
1311
  }
1314
1312
  if (end < start) end = start;
1315
- const newBuf = this.subarray(start, end);
1313
+ var newBuf = this.subarray(start, end);
1316
1314
  // Return an augmented `Uint8Array` instance
1317
1315
  Object.setPrototypeOf(newBuf, Buffer.prototype);
1318
1316
  return newBuf;
@@ -1329,9 +1327,9 @@ function requireBuffer$1() {
1329
1327
  offset = offset >>> 0;
1330
1328
  byteLength = byteLength >>> 0;
1331
1329
  if (!noAssert) checkOffset(offset, byteLength, this.length);
1332
- let val = this[offset];
1333
- let mul = 1;
1334
- let i = 0;
1330
+ var val = this[offset];
1331
+ var mul = 1;
1332
+ var i = 0;
1335
1333
  while (++i < byteLength && (mul *= 0x100)) {
1336
1334
  val += this[offset + i] * mul;
1337
1335
  }
@@ -1343,8 +1341,8 @@ function requireBuffer$1() {
1343
1341
  if (!noAssert) {
1344
1342
  checkOffset(offset, byteLength, this.length);
1345
1343
  }
1346
- let val = this[offset + --byteLength];
1347
- let mul = 1;
1344
+ var val = this[offset + --byteLength];
1345
+ var mul = 1;
1348
1346
  while (byteLength > 0 && (mul *= 0x100)) {
1349
1347
  val += this[offset + --byteLength] * mul;
1350
1348
  }
@@ -1375,37 +1373,13 @@ function requireBuffer$1() {
1375
1373
  if (!noAssert) checkOffset(offset, 4, this.length);
1376
1374
  return this[offset] * 0x1000000 + (this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3]);
1377
1375
  };
1378
- Buffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE(offset) {
1379
- offset = offset >>> 0;
1380
- validateNumber(offset, 'offset');
1381
- const first = this[offset];
1382
- const last = this[offset + 7];
1383
- if (first === undefined || last === undefined) {
1384
- boundsError(offset, this.length - 8);
1385
- }
1386
- const lo = first + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 24;
1387
- const hi = this[++offset] + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + last * 2 ** 24;
1388
- return BigInt(lo) + (BigInt(hi) << BigInt(32));
1389
- });
1390
- Buffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE(offset) {
1391
- offset = offset >>> 0;
1392
- validateNumber(offset, 'offset');
1393
- const first = this[offset];
1394
- const last = this[offset + 7];
1395
- if (first === undefined || last === undefined) {
1396
- boundsError(offset, this.length - 8);
1397
- }
1398
- const hi = first * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + this[++offset];
1399
- const lo = this[++offset] * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + last;
1400
- return (BigInt(hi) << BigInt(32)) + BigInt(lo);
1401
- });
1402
1376
  Buffer.prototype.readIntLE = function readIntLE(offset, byteLength, noAssert) {
1403
1377
  offset = offset >>> 0;
1404
1378
  byteLength = byteLength >>> 0;
1405
1379
  if (!noAssert) checkOffset(offset, byteLength, this.length);
1406
- let val = this[offset];
1407
- let mul = 1;
1408
- let i = 0;
1380
+ var val = this[offset];
1381
+ var mul = 1;
1382
+ var i = 0;
1409
1383
  while (++i < byteLength && (mul *= 0x100)) {
1410
1384
  val += this[offset + i] * mul;
1411
1385
  }
@@ -1417,9 +1391,9 @@ function requireBuffer$1() {
1417
1391
  offset = offset >>> 0;
1418
1392
  byteLength = byteLength >>> 0;
1419
1393
  if (!noAssert) checkOffset(offset, byteLength, this.length);
1420
- let i = byteLength;
1421
- let mul = 1;
1422
- let val = this[offset + --i];
1394
+ var i = byteLength;
1395
+ var mul = 1;
1396
+ var val = this[offset + --i];
1423
1397
  while (i > 0 && (mul *= 0x100)) {
1424
1398
  val += this[offset + --i] * mul;
1425
1399
  }
@@ -1436,13 +1410,13 @@ function requireBuffer$1() {
1436
1410
  Buffer.prototype.readInt16LE = function readInt16LE(offset, noAssert) {
1437
1411
  offset = offset >>> 0;
1438
1412
  if (!noAssert) checkOffset(offset, 2, this.length);
1439
- const val = this[offset] | this[offset + 1] << 8;
1413
+ var val = this[offset] | this[offset + 1] << 8;
1440
1414
  return val & 0x8000 ? val | 0xFFFF0000 : val;
1441
1415
  };
1442
1416
  Buffer.prototype.readInt16BE = function readInt16BE(offset, noAssert) {
1443
1417
  offset = offset >>> 0;
1444
1418
  if (!noAssert) checkOffset(offset, 2, this.length);
1445
- const val = this[offset + 1] | this[offset] << 8;
1419
+ var val = this[offset + 1] | this[offset] << 8;
1446
1420
  return val & 0x8000 ? val | 0xFFFF0000 : val;
1447
1421
  };
1448
1422
  Buffer.prototype.readInt32LE = function readInt32LE(offset, noAssert) {
@@ -1455,31 +1429,6 @@ function requireBuffer$1() {
1455
1429
  if (!noAssert) checkOffset(offset, 4, this.length);
1456
1430
  return this[offset] << 24 | this[offset + 1] << 16 | this[offset + 2] << 8 | this[offset + 3];
1457
1431
  };
1458
- Buffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE(offset) {
1459
- offset = offset >>> 0;
1460
- validateNumber(offset, 'offset');
1461
- const first = this[offset];
1462
- const last = this[offset + 7];
1463
- if (first === undefined || last === undefined) {
1464
- boundsError(offset, this.length - 8);
1465
- }
1466
- const val = this[offset + 4] + this[offset + 5] * 2 ** 8 + this[offset + 6] * 2 ** 16 + (last << 24); // Overflow
1467
-
1468
- return (BigInt(val) << BigInt(32)) + BigInt(first + this[++offset] * 2 ** 8 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 24);
1469
- });
1470
- Buffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE(offset) {
1471
- offset = offset >>> 0;
1472
- validateNumber(offset, 'offset');
1473
- const first = this[offset];
1474
- const last = this[offset + 7];
1475
- if (first === undefined || last === undefined) {
1476
- boundsError(offset, this.length - 8);
1477
- }
1478
- const val = (first << 24) +
1479
- // Overflow
1480
- this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + this[++offset];
1481
- return (BigInt(val) << BigInt(32)) + BigInt(this[++offset] * 2 ** 24 + this[++offset] * 2 ** 16 + this[++offset] * 2 ** 8 + last);
1482
- });
1483
1432
  Buffer.prototype.readFloatLE = function readFloatLE(offset, noAssert) {
1484
1433
  offset = offset >>> 0;
1485
1434
  if (!noAssert) checkOffset(offset, 4, this.length);
@@ -1510,11 +1459,11 @@ function requireBuffer$1() {
1510
1459
  offset = offset >>> 0;
1511
1460
  byteLength = byteLength >>> 0;
1512
1461
  if (!noAssert) {
1513
- const maxBytes = Math.pow(2, 8 * byteLength) - 1;
1462
+ var maxBytes = Math.pow(2, 8 * byteLength) - 1;
1514
1463
  checkInt(this, value, offset, byteLength, maxBytes, 0);
1515
1464
  }
1516
- let mul = 1;
1517
- let i = 0;
1465
+ var mul = 1;
1466
+ var i = 0;
1518
1467
  this[offset] = value & 0xFF;
1519
1468
  while (++i < byteLength && (mul *= 0x100)) {
1520
1469
  this[offset + i] = value / mul & 0xFF;
@@ -1526,11 +1475,11 @@ function requireBuffer$1() {
1526
1475
  offset = offset >>> 0;
1527
1476
  byteLength = byteLength >>> 0;
1528
1477
  if (!noAssert) {
1529
- const maxBytes = Math.pow(2, 8 * byteLength) - 1;
1478
+ var maxBytes = Math.pow(2, 8 * byteLength) - 1;
1530
1479
  checkInt(this, value, offset, byteLength, maxBytes, 0);
1531
1480
  }
1532
- let i = byteLength - 1;
1533
- let mul = 1;
1481
+ var i = byteLength - 1;
1482
+ var mul = 1;
1534
1483
  this[offset + i] = value & 0xFF;
1535
1484
  while (--i >= 0 && (mul *= 0x100)) {
1536
1485
  this[offset + i] = value / mul & 0xFF;
@@ -1580,62 +1529,16 @@ function requireBuffer$1() {
1580
1529
  this[offset + 3] = value & 0xff;
1581
1530
  return offset + 4;
1582
1531
  };
1583
- function wrtBigUInt64LE(buf, value, offset, min, max) {
1584
- checkIntBI(value, min, max, buf, offset, 7);
1585
- let lo = Number(value & BigInt(0xffffffff));
1586
- buf[offset++] = lo;
1587
- lo = lo >> 8;
1588
- buf[offset++] = lo;
1589
- lo = lo >> 8;
1590
- buf[offset++] = lo;
1591
- lo = lo >> 8;
1592
- buf[offset++] = lo;
1593
- let hi = Number(value >> BigInt(32) & BigInt(0xffffffff));
1594
- buf[offset++] = hi;
1595
- hi = hi >> 8;
1596
- buf[offset++] = hi;
1597
- hi = hi >> 8;
1598
- buf[offset++] = hi;
1599
- hi = hi >> 8;
1600
- buf[offset++] = hi;
1601
- return offset;
1602
- }
1603
- function wrtBigUInt64BE(buf, value, offset, min, max) {
1604
- checkIntBI(value, min, max, buf, offset, 7);
1605
- let lo = Number(value & BigInt(0xffffffff));
1606
- buf[offset + 7] = lo;
1607
- lo = lo >> 8;
1608
- buf[offset + 6] = lo;
1609
- lo = lo >> 8;
1610
- buf[offset + 5] = lo;
1611
- lo = lo >> 8;
1612
- buf[offset + 4] = lo;
1613
- let hi = Number(value >> BigInt(32) & BigInt(0xffffffff));
1614
- buf[offset + 3] = hi;
1615
- hi = hi >> 8;
1616
- buf[offset + 2] = hi;
1617
- hi = hi >> 8;
1618
- buf[offset + 1] = hi;
1619
- hi = hi >> 8;
1620
- buf[offset] = hi;
1621
- return offset + 8;
1622
- }
1623
- Buffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE(value, offset = 0) {
1624
- return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'));
1625
- });
1626
- Buffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE(value, offset = 0) {
1627
- return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'));
1628
- });
1629
1532
  Buffer.prototype.writeIntLE = function writeIntLE(value, offset, byteLength, noAssert) {
1630
1533
  value = +value;
1631
1534
  offset = offset >>> 0;
1632
1535
  if (!noAssert) {
1633
- const limit = Math.pow(2, 8 * byteLength - 1);
1536
+ var limit = Math.pow(2, 8 * byteLength - 1);
1634
1537
  checkInt(this, value, offset, byteLength, limit - 1, -limit);
1635
1538
  }
1636
- let i = 0;
1637
- let mul = 1;
1638
- let sub = 0;
1539
+ var i = 0;
1540
+ var mul = 1;
1541
+ var sub = 0;
1639
1542
  this[offset] = value & 0xFF;
1640
1543
  while (++i < byteLength && (mul *= 0x100)) {
1641
1544
  if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {
@@ -1649,12 +1552,12 @@ function requireBuffer$1() {
1649
1552
  value = +value;
1650
1553
  offset = offset >>> 0;
1651
1554
  if (!noAssert) {
1652
- const limit = Math.pow(2, 8 * byteLength - 1);
1555
+ var limit = Math.pow(2, 8 * byteLength - 1);
1653
1556
  checkInt(this, value, offset, byteLength, limit - 1, -limit);
1654
1557
  }
1655
- let i = byteLength - 1;
1656
- let mul = 1;
1657
- let sub = 0;
1558
+ var i = byteLength - 1;
1559
+ var mul = 1;
1560
+ var sub = 0;
1658
1561
  this[offset + i] = value & 0xFF;
1659
1562
  while (--i >= 0 && (mul *= 0x100)) {
1660
1563
  if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {
@@ -1709,12 +1612,6 @@ function requireBuffer$1() {
1709
1612
  this[offset + 3] = value & 0xff;
1710
1613
  return offset + 4;
1711
1614
  };
1712
- Buffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE(value, offset = 0) {
1713
- return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'));
1714
- });
1715
- Buffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE(value, offset = 0) {
1716
- return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'));
1717
- });
1718
1615
  function checkIEEE754(buf, value, offset, ext, max, min) {
1719
1616
  if (offset + ext > buf.length) throw new RangeError('Index out of range');
1720
1617
  if (offset < 0) throw new RangeError('Index out of range');
@@ -1775,7 +1672,7 @@ function requireBuffer$1() {
1775
1672
  if (target.length - targetStart < end - start) {
1776
1673
  end = target.length - targetStart + start;
1777
1674
  }
1778
- const len = end - start;
1675
+ var len = end - start;
1779
1676
  if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {
1780
1677
  // Use built-in when available, missing from IE11
1781
1678
  this.copyWithin(targetStart, start, end);
@@ -1807,7 +1704,7 @@ function requireBuffer$1() {
1807
1704
  throw new TypeError('Unknown encoding: ' + encoding);
1808
1705
  }
1809
1706
  if (val.length === 1) {
1810
- const code = val.charCodeAt(0);
1707
+ var code = val.charCodeAt(0);
1811
1708
  if (encoding === 'utf8' && code < 128 || encoding === 'latin1') {
1812
1709
  // Fast path: If `val` fits into a single byte, use that numeric value.
1813
1710
  val = code;
@@ -1829,14 +1726,14 @@ function requireBuffer$1() {
1829
1726
  start = start >>> 0;
1830
1727
  end = end === undefined ? this.length : end >>> 0;
1831
1728
  if (!val) val = 0;
1832
- let i;
1729
+ var i;
1833
1730
  if (typeof val === 'number') {
1834
1731
  for (i = start; i < end; ++i) {
1835
1732
  this[i] = val;
1836
1733
  }
1837
1734
  } else {
1838
- const bytes = Buffer.isBuffer(val) ? val : Buffer.from(val, encoding);
1839
- const len = bytes.length;
1735
+ var bytes = Buffer.isBuffer(val) ? val : Buffer.from(val, encoding);
1736
+ var len = bytes.length;
1840
1737
  if (len === 0) {
1841
1738
  throw new TypeError('The value "' + val + '" is invalid for argument "value"');
1842
1739
  }
@@ -1847,123 +1744,10 @@ function requireBuffer$1() {
1847
1744
  return this;
1848
1745
  };
1849
1746
 
1850
- // CUSTOM ERRORS
1851
- // =============
1852
-
1853
- // Simplified versions from Node, changed for Buffer-only usage
1854
- const errors = {};
1855
- function E(sym, getMessage, Base) {
1856
- errors[sym] = class NodeError extends Base {
1857
- constructor() {
1858
- super();
1859
- Object.defineProperty(this, 'message', {
1860
- value: getMessage.apply(this, arguments),
1861
- writable: true,
1862
- configurable: true
1863
- });
1864
-
1865
- // Add the error code to the name to include it in the stack trace.
1866
- this.name = `${this.name} [${sym}]`;
1867
- // Access the stack to generate the error message including the error code
1868
- // from the name.
1869
- this.stack; // eslint-disable-line no-unused-expressions
1870
- // Reset the name to the actual name.
1871
- delete this.name;
1872
- }
1873
- get code() {
1874
- return sym;
1875
- }
1876
- set code(value) {
1877
- Object.defineProperty(this, 'code', {
1878
- configurable: true,
1879
- enumerable: true,
1880
- value,
1881
- writable: true
1882
- });
1883
- }
1884
- toString() {
1885
- return `${this.name} [${sym}]: ${this.message}`;
1886
- }
1887
- };
1888
- }
1889
- E('ERR_BUFFER_OUT_OF_BOUNDS', function (name) {
1890
- if (name) {
1891
- return `${name} is outside of buffer bounds`;
1892
- }
1893
- return 'Attempt to access memory outside buffer bounds';
1894
- }, RangeError);
1895
- E('ERR_INVALID_ARG_TYPE', function (name, actual) {
1896
- return `The "${name}" argument must be of type number. Received type ${typeof actual}`;
1897
- }, TypeError);
1898
- E('ERR_OUT_OF_RANGE', function (str, range, input) {
1899
- let msg = `The value of "${str}" is out of range.`;
1900
- let received = input;
1901
- if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {
1902
- received = addNumericalSeparator(String(input));
1903
- } else if (typeof input === 'bigint') {
1904
- received = String(input);
1905
- if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {
1906
- received = addNumericalSeparator(received);
1907
- }
1908
- received += 'n';
1909
- }
1910
- msg += ` It must be ${range}. Received ${received}`;
1911
- return msg;
1912
- }, RangeError);
1913
- function addNumericalSeparator(val) {
1914
- let res = '';
1915
- let i = val.length;
1916
- const start = val[0] === '-' ? 1 : 0;
1917
- for (; i >= start + 4; i -= 3) {
1918
- res = `_${val.slice(i - 3, i)}${res}`;
1919
- }
1920
- return `${val.slice(0, i)}${res}`;
1921
- }
1922
-
1923
- // CHECK FUNCTIONS
1924
- // ===============
1925
-
1926
- function checkBounds(buf, offset, byteLength) {
1927
- validateNumber(offset, 'offset');
1928
- if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {
1929
- boundsError(offset, buf.length - (byteLength + 1));
1930
- }
1931
- }
1932
- function checkIntBI(value, min, max, buf, offset, byteLength) {
1933
- if (value > max || value < min) {
1934
- const n = typeof min === 'bigint' ? 'n' : '';
1935
- let range;
1936
- {
1937
- if (min === 0 || min === BigInt(0)) {
1938
- range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`;
1939
- } else {
1940
- range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` + `${(byteLength + 1) * 8 - 1}${n}`;
1941
- }
1942
- }
1943
- throw new errors.ERR_OUT_OF_RANGE('value', range, value);
1944
- }
1945
- checkBounds(buf, offset, byteLength);
1946
- }
1947
- function validateNumber(value, name) {
1948
- if (typeof value !== 'number') {
1949
- throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value);
1950
- }
1951
- }
1952
- function boundsError(value, length, type) {
1953
- if (Math.floor(value) !== value) {
1954
- validateNumber(value, type);
1955
- throw new errors.ERR_OUT_OF_RANGE('offset', 'an integer', value);
1956
- }
1957
- if (length < 0) {
1958
- throw new errors.ERR_BUFFER_OUT_OF_BOUNDS();
1959
- }
1960
- throw new errors.ERR_OUT_OF_RANGE('offset', `>= ${0} and <= ${length}`, value);
1961
- }
1962
-
1963
1747
  // HELPER FUNCTIONS
1964
1748
  // ================
1965
1749
 
1966
- const INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;
1750
+ var INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g;
1967
1751
  function base64clean(str) {
1968
1752
  // Node takes equal signs as end of the Base64 encoding
1969
1753
  str = str.split('=')[0];
@@ -1979,11 +1763,11 @@ function requireBuffer$1() {
1979
1763
  }
1980
1764
  function utf8ToBytes(string, units) {
1981
1765
  units = units || Infinity;
1982
- let codePoint;
1983
- const length = string.length;
1984
- let leadSurrogate = null;
1985
- const bytes = [];
1986
- for (let i = 0; i < length; ++i) {
1766
+ var codePoint;
1767
+ var length = string.length;
1768
+ var leadSurrogate = null;
1769
+ var bytes = [];
1770
+ for (var i = 0; i < length; ++i) {
1987
1771
  codePoint = string.charCodeAt(i);
1988
1772
 
1989
1773
  // is surrogate component
@@ -2041,17 +1825,17 @@ function requireBuffer$1() {
2041
1825
  return bytes;
2042
1826
  }
2043
1827
  function asciiToBytes(str) {
2044
- const byteArray = [];
2045
- for (let i = 0; i < str.length; ++i) {
1828
+ var byteArray = [];
1829
+ for (var i = 0; i < str.length; ++i) {
2046
1830
  // Node's code seems to be doing this and not & 0x7F..
2047
1831
  byteArray.push(str.charCodeAt(i) & 0xFF);
2048
1832
  }
2049
1833
  return byteArray;
2050
1834
  }
2051
1835
  function utf16leToBytes(str, units) {
2052
- let c, hi, lo;
2053
- const byteArray = [];
2054
- for (let i = 0; i < str.length; ++i) {
1836
+ var c, hi, lo;
1837
+ var byteArray = [];
1838
+ for (var i = 0; i < str.length; ++i) {
2055
1839
  if ((units -= 2) < 0) break;
2056
1840
  c = str.charCodeAt(i);
2057
1841
  hi = c >> 8;
@@ -2065,8 +1849,7 @@ function requireBuffer$1() {
2065
1849
  return base64.toByteArray(base64clean(str));
2066
1850
  }
2067
1851
  function blitBuffer(src, dst, offset, length) {
2068
- let i;
2069
- for (i = 0; i < length; ++i) {
1852
+ for (var i = 0; i < length; ++i) {
2070
1853
  if (i + offset >= dst.length || i >= src.length) break;
2071
1854
  dst[i + offset] = src[i];
2072
1855
  }
@@ -2086,25 +1869,17 @@ function requireBuffer$1() {
2086
1869
 
2087
1870
  // Create lookup table for `toString('hex')`
2088
1871
  // See: https://github.com/feross/buffer/issues/219
2089
- const hexSliceLookupTable = function () {
2090
- const alphabet = '0123456789abcdef';
2091
- const table = new Array(256);
2092
- for (let i = 0; i < 16; ++i) {
2093
- const i16 = i * 16;
2094
- for (let j = 0; j < 16; ++j) {
1872
+ var hexSliceLookupTable = function () {
1873
+ var alphabet = '0123456789abcdef';
1874
+ var table = new Array(256);
1875
+ for (var i = 0; i < 16; ++i) {
1876
+ var i16 = i * 16;
1877
+ for (var j = 0; j < 16; ++j) {
2095
1878
  table[i16 + j] = alphabet[i] + alphabet[j];
2096
1879
  }
2097
1880
  }
2098
1881
  return table;
2099
1882
  }();
2100
-
2101
- // Return not function with Error if BigInt not supported
2102
- function defineBigIntMethod(fn) {
2103
- return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn;
2104
- }
2105
- function BufferBigIntNotDefined() {
2106
- throw new Error('BigInt not supported');
2107
- }
2108
1883
  })(buffer$1);
2109
1884
  return buffer$1;
2110
1885
  }
@@ -32969,4 +32744,4 @@ var mainExports = requireMain();
32969
32744
  var dataset = /*@__PURE__*/getDefaultExportFromCjs(mainExports);
32970
32745
 
32971
32746
  export { dataset as d };
32972
- //# sourceMappingURL=main-CBbqRlCI.js.map
32747
+ //# sourceMappingURL=main-dUbkrxFL.js.map