meteor-node-stubs 1.2.17 → 1.2.19

package/node_modules/cipher-base/test/index.js

@@ -0,0 +1,221 @@
+'use strict';
+
+var Buffer = require('safe-buffer').Buffer;
+var CipherBase = require('../');
+
+var test = require('tape');
+var inherits = require('inherits');
+
+test('basic version', function (t) {
+	function Cipher() {
+		CipherBase.call(this);
+	}
+
+	inherits(Cipher, CipherBase);
+
+	Cipher.prototype._update = function (input) {
+		t.ok(Buffer.isBuffer(input));
+		return input;
+	};
+
+	Cipher.prototype._final = function () {
+		// noop
+	};
+
+	var cipher = new Cipher();
+	var utf8 = 'abc123abcd';
+	var update = cipher.update(utf8, 'utf8', 'base64') + cipher['final']('base64');
+	var string = Buffer.from(update, 'base64').toString();
+
+	t.equals(utf8, string);
+
+	t.end();
+});
+
+test('hash mode', function (t) {
+	function Cipher() {
+		CipherBase.call(this, 'finalName');
+		this._cache = [];
+	}
+	inherits(Cipher, CipherBase);
+	Cipher.prototype._update = function (input) {
+		t.ok(Buffer.isBuffer(input));
+		this._cache.push(input);
+	};
+	Cipher.prototype._final = function () {
+		return Buffer.concat(this._cache);
+	};
+	var cipher = new Cipher();
+	var utf8 = 'abc123abcd';
+	var update = cipher.update(utf8, 'utf8').finalName('base64');
+	var string = Buffer.from(update, 'base64').toString();
+
+	t.equals(utf8, string);
+
+	t.end();
+});
+
+test('hash mode as stream', function (t) {
+	function Cipher() {
+		CipherBase.call(this, 'finalName');
+		this._cache = [];
+	}
+	inherits(Cipher, CipherBase);
+	Cipher.prototype._update = function (input) {
+		t.ok(Buffer.isBuffer(input));
+		this._cache.push(input);
+	};
+	Cipher.prototype._final = function () {
+		return Buffer.concat(this._cache);
+	};
+	var cipher = new Cipher();
+	cipher.on('error', function (e) {
+		t.notOk(e);
+	});
+	var utf8 = 'abc123abcd';
+	cipher.end(utf8, 'utf8');
+	var update = cipher.read().toString('base64');
+	var string = Buffer.from(update, 'base64').toString();
+
+	t.equals(utf8, string);
+
+	t.end();
+});
+
+test('encodings', function (t) {
+	function Cipher() {
+		CipherBase.call(this);
+	}
+	inherits(Cipher, CipherBase);
+
+	Cipher.prototype._update = function (input) {
+		return input;
+	};
+
+	Cipher.prototype._final = function () {
+		// noop
+	};
+
+	t.test('mix and match encoding', function (st) {
+		st.plan(2);
+
+		var cipher = new Cipher();
+		cipher.update('foo', 'utf8', 'utf8');
+
+		st['throws'](function () {
+			cipher.update('foo', 'utf8', 'base64');
+		});
+
+		cipher = new Cipher();
+		cipher.update('foo', 'utf8', 'base64');
+
+		st.doesNotThrow(function () {
+			cipher.update('foo', 'utf8');
+			cipher['final']('base64');
+		});
+	});
+
+	t.test('handle long uft8 plaintexts', function (st) {
+		st.plan(1);
+		var txt = 'ふっかつ　あきる　すぶり　はやい　つける　まゆげ　たんさん　みんぞく　ねほりはほり　せまい　たいまつばな　ひはん';
+
+		var cipher = new Cipher();
+		var decipher = new Cipher();
+		var enc = decipher.update(cipher.update(txt, 'utf8', 'base64'), 'base64', 'utf8');
+		enc += decipher.update(cipher['final']('base64'), 'base64', 'utf8');
+		enc += decipher['final']('utf8');
+
+		st.equals(txt, enc);
+	});
+});
+
+test('handle SafeBuffer instances', function (t) {
+	function Cipher() {
+		CipherBase.call(this, 'finalName');
+		this._cache = [];
+	}
+	inherits(Cipher, CipherBase);
+	Cipher.prototype._update = function (input) {
+		t.ok(Buffer.isBuffer(input));
+		this._cache.push(input);
+	};
+	Cipher.prototype._final = function () {
+		return Buffer.concat(this._cache);
+	};
+
+	var cipher = new Cipher();
+	var final = cipher.update(Buffer.from('a0c1', 'hex')).finalName('hex');
+	t.equals(final, 'a0c1');
+
+	t.end();
+});
+
+test('handle Uint8Array view', function (t) {
+	function Cipher() {
+		CipherBase.call(this, 'finalName');
+		this._cache = [];
+	}
+	inherits(Cipher, CipherBase);
+	Cipher.prototype._update = function (input) {
+		t.ok(Buffer.isBuffer(input));
+		this._cache.push(input);
+	};
+	Cipher.prototype._final = function () {
+		return Buffer.concat(this._cache);
+	};
+
+	var buf = new Uint8Array([0, 1, 2, 3, 4, 5]);
+	var uarr = new Uint8Array(buf.buffer, 2, 3);
+
+	var cipher = new Cipher();
+	var final = cipher.update(uarr).finalName('hex');
+	t.equals(final, '020304');
+
+	t.end();
+});
+
+test('handle empty Uint8Array instances', function (t) {
+	function Cipher() {
+		CipherBase.call(this, 'finalName');
+		this._cache = [];
+	}
+	inherits(Cipher, CipherBase);
+	Cipher.prototype._update = function (input) {
+		t.ok(Buffer.isBuffer(input));
+		this._cache.push(input);
+	};
+	Cipher.prototype._final = function () {
+		return Buffer.concat(this._cache);
+	};
+
+	var cipher = new Cipher();
+	var final = cipher.update(new Uint8Array(0)).finalName('hex');
+	t.equals(final, '');
+
+	t.end();
+});
+
+test('handle UInt16Array', function (t) {
+	function Cipher() {
+		CipherBase.call(this, 'finalName');
+		this._cache = [];
+	}
+	inherits(Cipher, CipherBase);
+	Cipher.prototype._update = function (input) {
+		t.ok(Buffer.isBuffer(input));
+		this._cache.push(input);
+	};
+	Cipher.prototype._final = function () {
+		return Buffer.concat(this._cache);
+	};
+
+	if (ArrayBuffer.isView && (Buffer.prototype instanceof Uint8Array || Buffer.TYPED_ARRAY_SUPPORT)) {
+		var cipher = new Cipher();
+		var final = cipher.update(new Uint16Array([1234, 512])).finalName('hex');
+		t.equals(final, 'd2040002');
+	} else {
+		t.skip('ArrayBuffer.isView and/or TypedArray not fully supported');
+	}
+
+	t.end();
+});

package/node_modules/des.js/lib/des/cipher.js

@@ -11,6 +11,7 @@ function Cipher(options) {
 
   this.buffer = new Array(this.blockSize);
   this.bufferOff = 0;
+  this.padding = options.padding !== false
 }
 module.exports = Cipher;
 

package/node_modules/des.js/lib/des/des.js

@@ -74,6 +74,10 @@ DES.prototype._update = function _update(inp, inOff, out, outOff) {
 };
 
 DES.prototype._pad = function _pad(buffer, off) {
+  if (this.padding === false) {
+    return false;
+  }
+
   var value = buffer.length - off;
   for (var i = off; i < buffer.length; i++)
     buffer[i] = value;
@@ -82,6 +86,10 @@ DES.prototype._pad = function _pad(buffer, off) {
 };
 
 DES.prototype._unpad = function _unpad(buffer) {
+  if (this.padding === false) {
+    return buffer;
+  }
+
   var pad = buffer[buffer.length - 1];
   for (var i = buffer.length - pad; i < buffer.length; i++)
     assert.equal(buffer[i], pad);

package/node_modules/des.js/package.json

@@ -1,10 +1,10 @@
 {
   "name": "des.js",
-  "version": "1.0.1",
+  "version": "1.1.0",
   "description": "DES implementation",
   "main": "lib/des.js",
   "scripts": {
-    "test": "mocha --reporter=spec test/*-test.js && jscs lib/*.js lib/**/*.js test/*.js && jshint lib/*.js lib/**/*.js"
+    "test": "NODE_OPTIONS=--openssl-legacy-provider mocha --reporter=spec test/*-test.js"
   },
   "repository": {
     "type": "git",
@@ -23,9 +23,8 @@
   },
   "homepage": "https://github.com/indutny/des.js#readme",
   "devDependencies": {
-    "jscs": "^3.0.7",
     "jshint": "^2.8.0",
-    "mocha": "^6.2.2"
+    "mocha": "^10.2.0"
   },
   "dependencies": {
     "inherits": "^2.0.1",

package/node_modules/des.js/test/cbc-test.js

@@ -44,16 +44,16 @@ describe('DES-CBC', function() {
 
     vectors.forEach(function(vec, i) {
       it('should encrypt vector ' + i, function() {
-        var key = new Buffer(vec.key, 'hex');
-        var iv = new Buffer(vec.iv, 'hex');
-        var input = new Buffer(vec.input, 'hex');
+        var key = Buffer.from(vec.key, 'hex');
+        var iv = Buffer.from(vec.iv, 'hex');
+        var input = Buffer.from(vec.input, 'hex');
 
         var enc = CBC.create({
           type: 'encrypt',
           key: key,
           iv: iv
         });
-        var out = new Buffer(enc.update(input).concat(enc.final()));
+        var out = Buffer.from(enc.update(input).concat(enc.final()));
 
         var cipher = crypto.createCipheriv('des-cbc', key, iv);
         var expected = Buffer.concat([ cipher.update(input), cipher.final() ]);
@@ -65,7 +65,7 @@ describe('DES-CBC', function() {
           key: key,
           iv: iv
         });
-        assert.deepEqual(new Buffer(dec.update(out).concat(dec.final())),
+        assert.deepEqual(Buffer.from(dec.update(out).concat(dec.final())),
                          input);
       });
     });

package/node_modules/des.js/test/des-test.js

@@ -84,8 +84,8 @@ describe('DES', function() {
 
     vectors.forEach(function(vec, i) {
       it('should encrypt vector ' + i, function() {
-        var key = new Buffer(vec.key, 'hex');
-        var input = new Buffer(vec.input, 'hex');
+        var key = Buffer.from(vec.key, 'hex');
+        var input = Buffer.from(vec.input, 'hex');
 
         var enc = des.DES.create({
           type: 'encrypt',
@@ -95,23 +95,23 @@ describe('DES', function() {
           type: 'decrypt',
           key: key
         });
-        var out = new Buffer(enc.update(input).concat(enc.final()));
+        var out = Buffer.from(enc.update(input).concat(enc.final()));
 
-        var cipher = crypto.createCipheriv('des-ecb', key, new Buffer(0));
+        var cipher = crypto.createCipheriv('des-ecb', key, Buffer.alloc(0));
         var expected = Buffer.concat([ cipher.update(input), cipher.final() ]);
 
         assert.deepEqual(out, expected);
 
-        assert.deepEqual(new Buffer(dec.update(out).concat(dec.final())),
+        assert.deepEqual(Buffer.from(dec.update(out).concat(dec.final())),
                          input);
       });
     });
 
     it('should buffer during encryption/decryption', function() {
-      var key = new Buffer('0102030405060708', 'hex');
-      var chunk = new Buffer('01020304050607', 'hex');
+      var key = Buffer.from('0102030405060708', 'hex');
+      var chunk = Buffer.from('01020304050607', 'hex');
       var count = 257;
-      var expected = new Buffer(
+      var expected = Buffer.from(
           new Array(count + 1).join('01020304050607'), 'hex');
 
       var enc = des.DES.create({
@@ -132,7 +132,7 @@ describe('DES', function() {
         out = out.concat(dec.update(cipher.slice(i * 7, (i + 1) * 7)));
       out = out.concat(dec.final(cipher.slice(i * 7)));
 
-      out = new Buffer(out);
+      out = Buffer.from(out);
       assert.deepEqual(out, expected);
     });
   });

package/node_modules/des.js/test/ede-test.js

@@ -42,18 +42,18 @@ describe('DES-EDE-CBC', function() {
       }
     ];
 
-    vectors.forEach(function(vec, i) {
+     vectors.forEach(function(vec, i) {
       it('should encrypt vector ' + i, function() {
-        var key = new Buffer(vec.key, 'hex');
-        var iv = new Buffer(vec.iv, 'hex');
-        var input = new Buffer(vec.input, 'hex');
+        var key = Buffer.from(vec.key, 'hex');
+        var iv = Buffer.from(vec.iv, 'hex');
+        var input = Buffer.from(vec.input, 'hex');
 
         var enc = CBC.create({
           type: 'encrypt',
           key: key,
           iv: iv
         });
-        var out = new Buffer(enc.update(input).concat(enc.final()));
+        var out = Buffer.from(enc.update(input).concat(enc.final()));
 
         var cipher = crypto.createCipheriv('des-ede3-cbc', key, iv);
         var expected = Buffer.concat([ cipher.update(input), cipher.final() ]);
@@ -65,9 +65,42 @@ describe('DES-EDE-CBC', function() {
           key: key,
           iv: iv
         });
-        assert.deepEqual(new Buffer(dec.update(out).concat(dec.final())),
+        assert.deepEqual(Buffer.from(dec.update(out).concat(dec.final())),
                          input);
       });
     });
+    vectors.forEach(function(vec, i) {
+      it('should decrypt without unpadding vector ' + i, function() {
+        var key = Buffer.from(vec.key, 'hex');
+        var iv = Buffer.from(vec.iv, 'hex');
+        var input = Buffer.from(vec.input, 'hex');
+
+        var enc = CBC.create({
+          type: 'encrypt',
+          key: key,
+          iv: iv,
+        });
+
+        var out = Buffer.from(enc.update(input).concat(enc.final()));
+
+        var cipher = crypto.createCipheriv('des-ede3-cbc', key, iv);
+        var expected = Buffer.concat([ cipher.update(input), cipher.final() ]);
+
+        assert.deepEqual(out, expected);
+
+        var dec = CBC.create({
+          type: 'decrypt',
+          key: key,
+          iv: iv,
+          padding: false
+        });
+
+        var decipher = crypto.createDecipheriv('des-ede3-cbc', key, iv);
+        decipher.setAutoPadding(false);
+        expected = Buffer.concat([ decipher.update(out), decipher.final() ]);
+        assert.deepEqual(Buffer.from(dec.update(out).concat(dec.final())),
+                         Buffer.from(expected));
+      });
+    });
   });
 });

package/node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js

@@ -452,16 +452,16 @@
         var w = this.words[i];
         var word = (((w << off) | carry) & 0xffffff).toString(16);
         carry = (w >>> (24 - off)) & 0xffffff;
-        if (carry !== 0 || i !== this.length - 1) {
-          out = zeros[6 - word.length] + word + out;
-        } else {
-          out = word + out;
-        }
         off += 2;
         if (off >= 26) {
           off -= 26;
           i--;
         }
+        if (carry !== 0 || i !== this.length - 1) {
+          out = zeros[6 - word.length] + word + out;
+        } else {
+          out = word + out;
+        }
       }
       if (carry !== 0) {
         out = carry.toString(16) + out;
@@ -1921,6 +1921,7 @@
       this.words[i] = carry;
       this.length++;
     }
+    this.length = num === 0 ? 1 : this.length;
 
     return this;
   };

package/node_modules/diffie-hellman/node_modules/bn.js/package.json

@@ -1,6 +1,6 @@
 {
   "name": "bn.js",
-  "version": "4.12.0",
+  "version": "4.12.2",
   "description": "Big number implementation in pure javascript",
   "main": "lib/bn.js",
   "scripts": {

package/node_modules/diffie-hellman/node_modules/bn.js/util/genCombMulTo.js

@@ -0,0 +1,65 @@
+'use strict';
+
+// NOTE: This could be potentionally used to generate loop-less multiplications
+function genCombMulTo (alen, blen) {
+  var len = alen + blen - 1;
+  var src = [
+    'var a = self.words;',
+    'var b = num.words;',
+    'var o = out.words;',
+    'var c = 0;',
+    'var lo;',
+    'var mid;',
+    'var hi;'
+  ];
+  for (var i = 0; i < alen; i++) {
+    src.push('var a' + i + ' = a[' + i + '] | 0;');
+    src.push('var al' + i + ' = a' + i + ' & 0x1fff;');
+    src.push('var ah' + i + ' = a' + i + ' >>> 13;');
+  }
+  for (i = 0; i < blen; i++) {
+    src.push('var b' + i + ' = b[' + i + '] | 0;');
+    src.push('var bl' + i + ' = b' + i + ' & 0x1fff;');
+    src.push('var bh' + i + ' = b' + i + ' >>> 13;');
+  }
+  src.push('');
+  src.push('out.negative = self.negative ^ num.negative;');
+  src.push('out.length = ' + len + ';');
+
+  for (var k = 0; k < len; k++) {
+    var minJ = Math.max(0, k - alen + 1);
+    var maxJ = Math.min(k, blen - 1);
+
+    src.push('\/* k = ' + k + ' *\/');
+    src.push('var w' + k + ' = c;');
+    src.push('c = 0;');
+    for (var j = minJ; j <= maxJ; j++) {
+      i = k - j;
+
+      src.push('lo = Math.imul(al' + i + ', bl' + j + ');');
+      src.push('mid = Math.imul(al' + i + ', bh' + j + ');');
+      src.push('mid = (mid + Math.imul(ah' + i + ', bl' + j + ')) | 0;');
+      src.push('hi = Math.imul(ah' + i + ', bh' + j + ');');
+
+      src.push('w' + k + ' = (w' + k + ' + lo) | 0;');
+      src.push('w' + k + ' = (w' + k + ' + ((mid & 0x1fff) << 13)) | 0;');
+      src.push('c = (c + hi) | 0;');
+      src.push('c = (c + (mid >>> 13)) | 0;');
+      src.push('c = (c + (w' + k + ' >>> 26)) | 0;');
+      src.push('w' + k + ' &= 0x3ffffff;');
+    }
+  }
+  // Store in separate step for better memory access
+  for (k = 0; k < len; k++) {
+    src.push('o[' + k + '] = w' + k + ';');
+  }
+  src.push('if (c !== 0) {',
+           '  o[' + k + '] = c;',
+           '  out.length++;',
+           '}',
+           'return out;');
+
+  return src.join('\n');
+}
+
+console.log(genCombMulTo(10, 10));

package/node_modules/diffie-hellman/node_modules/bn.js/util/genCombMulTo10.js

@@ -0,0 +1,65 @@
+'use strict';
+
+function genCombMulTo (alen, blen) {
+  var len = alen + blen - 1;
+  var src = [
+    'var a = self.words;',
+    'var b = num.words;',
+    'var o = out.words;',
+    'var c = 0;',
+    'var lo;',
+    'var mid;',
+    'var hi;'
+  ];
+  for (var i = 0; i < alen; i++) {
+    src.push('var a' + i + ' = a[' + i + '] | 0;');
+    src.push('var al' + i + ' = a' + i + ' & 0x1fff;');
+    src.push('var ah' + i + ' = a' + i + ' >>> 13;');
+  }
+  for (i = 0; i < blen; i++) {
+    src.push('var b' + i + ' = b[' + i + '] | 0;');
+    src.push('var bl' + i + ' = b' + i + ' & 0x1fff;');
+    src.push('var bh' + i + ' = b' + i + ' >>> 13;');
+  }
+  src.push('');
+  src.push('out.negative = self.negative ^ num.negative;');
+  src.push('out.length = ' + len + ';');
+
+  for (var k = 0; k < len; k++) {
+    var minJ = Math.max(0, k - alen + 1);
+    var maxJ = Math.min(k, blen - 1);
+
+    src.push('\/* k = ' + k + ' *\/');
+    src.push('lo = Math.imul(al' + (k - minJ) + ', bl' + minJ + ');');
+    src.push('mid = Math.imul(al' + (k - minJ) + ', bh' + minJ + ');');
+    src.push(
+        'mid = (mid + Math.imul(ah' + (k - minJ) + ', bl' + minJ + ')) | 0;');
+    src.push('hi = Math.imul(ah' + (k - minJ) + ', bh' + minJ + ');');
+
+    for (var j = minJ + 1; j <= maxJ; j++) {
+      i = k - j;
+
+      src.push('lo = (lo + Math.imul(al' + i + ', bl' + j + ')) | 0;');
+      src.push('mid = (mid + Math.imul(al' + i + ', bh' + j + ')) | 0;');
+      src.push('mid = (mid + Math.imul(ah' + i + ', bl' + j + ')) | 0;');
+      src.push('hi = (hi + Math.imul(ah' + i + ', bh' + j + ')) | 0;');
+    }
+
+    src.push('var w' + k + ' = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;');
+    src.push('c = (((hi + (mid >>> 13)) | 0) + (w' + k + ' >>> 26)) | 0;');
+    src.push('w' + k + ' &= 0x3ffffff;');
+  }
+  // Store in separate step for better memory access
+  for (k = 0; k < len; k++) {
+    src.push('o[' + k + '] = w' + k + ';');
+  }
+  src.push('if (c !== 0) {',
+           '  o[' + k + '] = c;',
+           '  out.length++;',
+           '}',
+           'return out;');
+
+  return src.join('\n');
+}
+
+console.log(genCombMulTo(10, 10));

package/node_modules/dunder-proto/.github/FUNDING.yml

@@ -0,0 +1,12 @@
+# These are supported funding model platforms
+
+github: [ljharb]
+patreon: # Replace with a single Patreon username
+open_collective: # Replace with a single Open Collective username
+ko_fi: # Replace with a single Ko-fi username
+tidelift: npm/dunder-proto
+community_bridge: # Replace with a single Community Bridge project-name e.g., cloud-foundry
+liberapay: # Replace with a single Liberapay username
+issuehunt: # Replace with a single IssueHunt username
+otechie: # Replace with a single Otechie username
+custom: # Replace with up to 4 custom sponsorship URLs e.g., ['link1', 'link2']

package/node_modules/dunder-proto/.nycrc

@@ -0,0 +1,13 @@
+{
+	"all": true,
+	"check-coverage": false,
+	"reporter": ["text-summary", "text", "html", "json"],
+	"lines": 86,
+	"statements": 85.93,
+	"functions": 82.43,
+	"branches": 76.06,
+	"exclude": [
+		"coverage",
+		"test"
+	]
+}

package/node_modules/dunder-proto/CHANGELOG.md

@@ -0,0 +1,24 @@
+# Changelog
+
+All notable changes to this project will be documented in this file.
+
+The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/)
+and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
+
+## [v1.0.1](https://github.com/es-shims/dunder-proto/compare/v1.0.0...v1.0.1) - 2024-12-16
+
+### Commits
+
+- [Fix] do not crash when `--disable-proto=throw` [`6c367d9`](https://github.com/es-shims/dunder-proto/commit/6c367d919bc1604778689a297bbdbfea65752847)
+- [Tests] ensure noproto tests only use the current version of dunder-proto [`b02365b`](https://github.com/es-shims/dunder-proto/commit/b02365b9cf889c4a2cac7be0c3cfc90a789af36c)
+- [Dev Deps] update `@arethetypeswrong/cli`, `@types/tape` [`e3c5c3b`](https://github.com/es-shims/dunder-proto/commit/e3c5c3bd81cf8cef7dff2eca19e558f0e307f666)
+- [Deps] update `call-bind-apply-helpers` [`19f1da0`](https://github.com/es-shims/dunder-proto/commit/19f1da028b8dd0d05c85bfd8f7eed2819b686450)
+
+## v1.0.0 - 2024-12-06
+
+### Commits
+
+- Initial implementation, tests, readme, types [`a5b74b0`](https://github.com/es-shims/dunder-proto/commit/a5b74b0082f5270cb0905cd9a2e533cee7498373)
+- Initial commit [`73fb5a3`](https://github.com/es-shims/dunder-proto/commit/73fb5a353b51ac2ab00c9fdeb0114daffd4c07a8)
+- npm init [`80152dc`](https://github.com/es-shims/dunder-proto/commit/80152dc98155da4eb046d9f67a87ed96e8280a1d)
+- Only apps should have lockfiles [`03e6660`](https://github.com/es-shims/dunder-proto/commit/03e6660a1d70dc401f3e217a031475ec537243dd)

package/node_modules/{@meteorjs/crypto-browserify/node_modules/hash-base → dunder-proto}/LICENSE

@@ -1,6 +1,6 @@
-The MIT License (MIT)
+MIT License
 
-Copyright (c) 2016 Kirill Fomichev
+Copyright (c) 2024 ECMAScript Shims
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -9,13 +9,13 @@ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 copies of the Software, and to permit persons to whom the Software is
 furnished to do so, subject to the following conditions:
 
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
 
 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-THE SOFTWARE.
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.