harperdb 3.1.1 → 3.1.4

package/node_modules/cfb/package.json

@@ -1,31 +1,31 @@
 {
   "_args": [
     [
-      "cfb@1.2.1",
+      "cfb@1.2.0",
       "/home/ubuntu/buildAgent/work/20f715f46c2b009e"
     ]
   ],
-  "_from": "cfb@1.2.1",
-  "_id": "cfb@1.2.1",
+  "_from": "cfb@1.2.0",
+  "_id": "cfb@1.2.0",
   "_inBundle": false,
-  "_integrity": "sha512-wT2ScPAFGSVy7CY+aauMezZBnNrfnaLSrxHUHdea+Td/86vrk6ZquggV+ssBR88zNs0OnBkL2+lf9q0K+zVGzQ==",
+  "_integrity": "sha512-sXMvHsKCICVR3Naq+J556K+ExBo9n50iKl6LGarlnvuA2035uMlGA/qVrc0wQtow5P1vJEw9UyrKLCbtIKz+TQ==",
   "_location": "/cfb",
   "_phantomChildren": {},
   "_requested": {
     "type": "version",
     "registry": true,
-    "raw": "cfb@1.2.1",
+    "raw": "cfb@1.2.0",
     "name": "cfb",
     "escapedName": "cfb",
-    "rawSpec": "1.2.1",
+    "rawSpec": "1.2.0",
     "saveSpec": null,
-    "fetchSpec": "1.2.1"
+    "fetchSpec": "1.2.0"
   },
   "_requiredBy": [
     "/xlsx"
   ],
-  "_resolved": "https://registry.npmjs.org/cfb/-/cfb-1.2.1.tgz",
-  "_spec": "1.2.1",
+  "_resolved": "https://registry.npmjs.org/cfb/-/cfb-1.2.0.tgz",
+  "_spec": "1.2.0",
   "_where": "/home/ubuntu/buildAgent/work/20f715f46c2b009e",
   "author": {
     "name": "sheetjs"
@@ -44,9 +44,9 @@
     }
   },
   "dependencies": {
-    "adler-32": "~1.3.0",
+    "adler-32": "~1.2.0",
     "crc-32": "~1.2.0",
-    "printj": "~1.3.0"
+    "printj": "~1.1.2"
   },
   "description": "Compound File Binary File Format extractor",
   "devDependencies": {
@@ -89,5 +89,5 @@
     "test": "make test"
   },
   "types": "types",
-  "version": "1.2.1"
+  "version": "1.2.0"
 }

package/node_modules/cfb/xlscfb.flow.js

@@ -143,7 +143,7 @@ CRC32.str = crc32_str;
 /* [MS-CFB] v20171201 */
 var CFB = (function _CFB(){
 var exports/*:CFBModule*/ = /*::(*/{}/*:: :any)*/;
-exports.version = '1.2.1';
+exports.version = '1.2.0';
 /* [MS-CFB] 2.6.4 */
 function namecmp(l/*:string*/, r/*:string*/)/*:number*/ {
 	var L = l.split("/"), R = r.split("/");
@@ -555,11 +555,7 @@ function read_file(filename/*:string*/, options/*:CFBReadOpts*/) {
 }
 
 function read(blob/*:RawBytes|string*/, options/*:CFBReadOpts*/) {
-	var type = options && options.type;
-	if(!type) {
-		if(has_buf && Buffer.isBuffer(blob)) type = "buffer";
-	}
-	switch(type || "base64") {
+	switch(options && options.type || "base64") {
 		case "file": /*:: if(typeof blob !== 'string') throw "Must pass a filename when type='file'"; */return read_file(blob, options);
 		case "base64": /*:: if(typeof blob !== 'string') throw "Must pass a base64-encoded binary string when type='file'"; */return parse(s2a(Base64.decode(blob)), options);
 		case "binary": /*:: if(typeof blob !== 'string') throw "Must pass a binary string when type='file'"; */return parse(s2a(blob), options);
@@ -608,28 +604,22 @@ function rebuild_cfb(cfb/*:CFBContainer*/, f/*:?boolean*/)/*:void*/ {
 	if(!gc && !f) return;
 
 	var now = new Date(1987, 1, 19), j = 0;
-	// Track which names exist
-	var fullPaths = Object.create ? Object.create(null) : {};
 	var data/*:Array<[string, CFBEntry]>*/ = [];
 	for(i = 0; i < cfb.FullPaths.length; ++i) {
-		fullPaths[cfb.FullPaths[i]] = true;
 		if(cfb.FileIndex[i].type === 0) continue;
 		data.push([cfb.FullPaths[i], cfb.FileIndex[i]]);
 	}
 	for(i = 0; i < data.length; ++i) {
 		var dad = dirname(data[i][0]);
-		s = fullPaths[dad];
-		if(!s) {
-			data.push([dad, ({
-				name: filename(dad).replace("/",""),
-				type: 1,
-				clsid: HEADER_CLSID,
-				ct: now, mt: now,
-				content: null
-			}/*:any*/)]);
-			// Add name to set
-			fullPaths[dad] = true;
-		}
+		s = false;
+		for(j = 0; j < data.length; ++j) if(data[j][0] === dad) s = true;
+		if(!s) data.push([dad, ({
+			name: filename(dad).replace("/",""),
+			type: 1,
+			clsid: HEADER_CLSID,
+			ct: now, mt: now,
+			content: null
+		}/*:any*/)]);
 	}
 
 	data.sort(function(x,y) { return namecmp(x[0], y[0]); });
@@ -788,36 +778,19 @@ function _write(cfb/*:CFBContainer*/, options/*:CFBWriteOpts*/)/*:RawBytes|strin
 		/*:: if(!file.content) throw new Error("unreachable"); */
 		if(file.size >= 0x1000) {
 			o.l = (file.start+1) << 9;
-			if (has_buf && Buffer.isBuffer(file.content)) {
-				file.content.copy(o, o.l, 0, file.size);
-				// o is a 0-filled Buffer so just set next offset
-				o.l += (file.size + 511) & -512;
-			} else {
-				for(j = 0; j < file.size; ++j) o.write_shift(1, file.content[j]);
-				for(; j & 0x1FF; ++j) o.write_shift(1, 0);
-			}
+			for(j = 0; j < file.size; ++j) o.write_shift(1, file.content[j]);
+			for(; j & 0x1FF; ++j) o.write_shift(1, 0);
 		}
 	}
 	for(i = 1; i < cfb.FileIndex.length; ++i) {
 		file = cfb.FileIndex[i];
 		/*:: if(!file.content) throw new Error("unreachable"); */
 		if(file.size > 0 && file.size < 0x1000) {
-			if (has_buf && Buffer.isBuffer(file.content)) {
-				file.content.copy(o, o.l, 0, file.size);
-				// o is a 0-filled Buffer so just set next offset
-				o.l += (file.size + 63) & -64;
-			} else {
-				for(j = 0; j < file.size; ++j) o.write_shift(1, file.content[j]);
-				for(; j & 0x3F; ++j) o.write_shift(1, 0);
-			}
+			for(j = 0; j < file.size; ++j) o.write_shift(1, file.content[j]);
+			for(; j & 0x3F; ++j) o.write_shift(1, 0);
 		}
 	}
-	if (has_buf) {
-		o.l = o.length;
-	} else {
-		// When using Buffer, already 0-filled
-		while(o.l < o.length) o.write_shift(1, 0);
-	}
+	while(o.l < o.length) o.write_shift(1, 0);
 	return o;
 }
 /* [MS-CFB] 2.6.4 (Unicode 3.0.1 case conversion) */
@@ -957,38 +930,6 @@ function read_bits_n(buf, bl, n) {
 	return v & f;
 }
 
-/* helpers for unaligned bit writes */
-function write_bits_3(buf, bl, v) { var w = bl & 7, h = bl >>> 3;
-	if(w <= 5) buf[h] |= (v & 7) << w;
-	else {
-		buf[h] |= (v << w) & 0xFF;
-		buf[h+1] = (v&7) >> (8-w);
-	}
-	return bl + 3;
-}
-
-function write_bits_1(buf, bl, v) {
-	var w = bl & 7, h = bl >>> 3;
-	v = (v&1) << w;
-	buf[h] |= v;
-	return bl + 1;
-}
-function write_bits_8(buf, bl, v) {
-	var w = bl & 7, h = bl >>> 3;
-	v <<= w;
-	buf[h] |=  v & 0xFF; v >>>= 8;
-	buf[h+1] = v;
-	return bl + 8;
-}
-function write_bits_16(buf, bl, v) {
-	var w = bl & 7, h = bl >>> 3;
-	v <<= w;
-	buf[h] |=  v & 0xFF; v >>>= 8;
-	buf[h+1] = v & 0xFF;
-	buf[h+2] = v >>> 8;
-	return bl + 16;
-}
-
 /* until ArrayBuffer#realloc is a thing, fake a realloc */
 function realloc(b, sz/*:number*/) {
 	var L = b.length, M = 2*L > sz ? 2*L : sz + 5, i = 0;
@@ -1002,7 +943,7 @@ function realloc(b, sz/*:number*/) {
 	} else if(use_typed_arrays) {
 		var a = new Uint8Array(M);
 		if(a.set) a.set(b);
-		else for(; i < L; ++i) a[i] = b[i];
+		else for(; i < b.length; ++i) a[i] = b[i];
 		return a;
 	}
 	b.length = M;
@@ -1014,7 +955,30 @@ function zero_fill_array(n) {
 	var o = new Array(n);
 	for(var i = 0; i < n; ++i) o[i] = 0;
 	return o;
-}
+}var _deflate = (function() {
+var _deflateRaw = (function() {
+	return function deflateRaw(data, out) {
+		var boff = 0;
+		while(boff < data.length) {
+			var L = Math.min(0xFFFF, data.length - boff);
+			var h = boff + L == data.length;
+			/* TODO: this is only type 0 stored */
+			out.write_shift(1, +h);
+			out.write_shift(2, L);
+			out.write_shift(2, (~L) & 0xFFFF);
+			while(L-- > 0) out[out.l++] = data[boff++];
+		}
+		return out.l;
+	};
+})();
+
+return function(data) {
+	var buf = new_buf(50+Math.floor(data.length*1.1));
+	var off = _deflateRaw(data, buf);
+	return buf.slice(0, off);
+};
+})();
+/* modified inflate function also moves original read head */
 
 /* build tree (used for literals and lengths) */
 function build_tree(clens, cmap, MAX/*:number*/)/*:number*/ {
@@ -1054,7 +1018,6 @@ function build_tree(clens, cmap, MAX/*:number*/)/*:number*/ {
 	return maxlen;
 }
 
-/* Fixed Huffman */
 var fix_lmap = use_typed_arrays ? new Uint16Array(512) : zero_fill_array(512);
 var fix_dmap = use_typed_arrays ? new Uint16Array(32)  : zero_fill_array(32);
 if(!use_typed_arrays) {
@@ -1074,124 +1037,8 @@ if(!use_typed_arrays) {
 	for(; i<=279; i++) clens.push(7);
 	for(; i<=287; i++) clens.push(8);
 	build_tree(clens, fix_lmap, 288);
-})();var _deflateRaw = (function() {
-	var DST_LN_RE = use_typed_arrays ? new Uint8Array(0x8000) : [];
-	for(var j = 0, k = 0; j < DST_LN.length; ++j) {
-		for(; k < DST_LN[j+1]; ++k) DST_LN_RE[k] = j;
-	}
-	for(;k < 32768; ++k) DST_LN_RE[k] = 29;
-
-	var LEN_LN_RE = use_typed_arrays ? new Uint8Array(0x102) : [];
-	for(j = 0, k = 0; j < LEN_LN.length; ++j) {
-		for(; k < LEN_LN[j+1]; ++k) LEN_LN_RE[k] = j;
-	}
-
-	function write_stored(data, out) {
-		var boff = 0;
-		while(boff < data.length) {
-			var L = Math.min(0xFFFF, data.length - boff);
-			var h = boff + L == data.length;
-			out.write_shift(1, +h);
-			out.write_shift(2, L);
-			out.write_shift(2, (~L) & 0xFFFF);
-			while(L-- > 0) out[out.l++] = data[boff++];
-		}
-		return out.l;
-	}
-
-	/* Fixed Huffman */
-	function write_huff_fixed(data, out) {
-		var bl = 0;
-		var boff = 0;
-		var addrs = use_typed_arrays ? new Uint16Array(0x8000) : [];
-		while(boff < data.length) {
-			var L = /* data.length - boff; */ Math.min(0xFFFF, data.length - boff);
-
-			/* write a stored block for short data */
-			if(L < 10) {
-				bl = write_bits_3(out, bl, +!!(boff + L == data.length)); // jshint ignore:line
-				if(bl & 7) bl += 8 - (bl & 7);
-				out.l = (bl / 8) | 0;
-				out.write_shift(2, L);
-				out.write_shift(2, (~L) & 0xFFFF);
-				while(L-- > 0) out[out.l++] = data[boff++];
-				bl = out.l * 8;
-				continue;
-			}
-
-			bl = write_bits_3(out, bl, +!!(boff + L == data.length) + 2); // jshint ignore:line
-			var hash = 0;
-			while(L-- > 0) {
-				var d = data[boff];
-				hash = ((hash << 5) ^ d) & 0x7FFF;
-
-				var match = -1, mlen = 0;
-
-				if((match = addrs[hash])) {
-					match |= boff & ~0x7FFF;
-					if(match > boff) match -= 0x8000;
-					if(match < boff) while(data[match + mlen] == data[boff + mlen] && mlen < 250) ++mlen;
-				}
-
-				if(mlen > 2) {
-					/* Copy Token  */
-					d = LEN_LN_RE[mlen];
-					if(d <= 22) bl = write_bits_8(out, bl, bitswap8[d+1]>>1) - 1;
-					else {
-						write_bits_8(out, bl, 3);
-						bl += 5;
-						write_bits_8(out, bl, bitswap8[d-23]>>5);
-						bl += 3;
-					}
-					var len_eb = (d < 8) ? 0 : ((d - 4)>>2);
-					if(len_eb > 0) {
-						write_bits_16(out, bl, mlen - LEN_LN[d]);
-						bl += len_eb;
-					}
-
-					d = DST_LN_RE[boff - match];
-					bl = write_bits_8(out, bl, bitswap8[d]>>3);
-					bl -= 3;
-
-					var dst_eb = d < 4 ? 0 : (d-2)>>1;
-					if(dst_eb > 0) {
-						write_bits_16(out, bl, boff - match - DST_LN[d]);
-						bl += dst_eb;
-					}
-					for(var q = 0; q < mlen; ++q) {
-						addrs[hash] = boff & 0x7FFF;
-						hash = ((hash << 5) ^ data[boff]) & 0x7FFF;
-						++boff;
-					}
-					L-= mlen - 1;
-				} else {
-					/* Literal Token */
-					if(d <= 143) d = d + 48;
-					else bl = write_bits_1(out, bl, 1);
-					bl = write_bits_8(out, bl, bitswap8[d]);
-					addrs[hash] = boff & 0x7FFF;
-					++boff;
-				}
-			}
-
-			bl = write_bits_8(out, bl, 0) - 1;
-		}
-		out.l = ((bl + 7)/8)|0;
-		return out.l;
-	}
-	return function _deflateRaw(data, out) {
-		if(data.length < 8) return write_stored(data, out);
-		return write_huff_fixed(data, out);
-	};
 })();
 
-function _deflate(data) {
-	var buf = new_buf(50+Math.floor(data.length*1.1));
-	var off = _deflateRaw(data, buf);
-	return buf.slice(0, off);
-}
-/* modified inflate function also moves original read head */
-
 var dyn_lmap = use_typed_arrays ? new Uint16Array(32768) : zero_fill_array(32768);
 var dyn_dmap = use_typed_arrays ? new Uint16Array(32768) : zero_fill_array(32768);
 var dyn_cmap = use_typed_arrays ? new Uint16Array(128)   : zero_fill_array(128);
@@ -1310,8 +1157,8 @@ function inflate(data, usz/*:number*/) {
 			boff = dyn(data, boff);
 			max_len_1 = dyn_len_1; max_len_2 = dyn_len_2;
 		}
+		if(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }
 		for(;;) { // while(true) is apparently out of vogue in modern JS circles
-			if(!usz && (OL < woff + 32767)) { outbuf = realloc(outbuf, woff + 32767); OL = outbuf.length; }
 			/* ingest code and move read head */
 			var bits = read_bits_n(data, boff, max_len_1);
 			var code = (header>>>1) == 1 ? fix_lmap[bits] : dyn_lmap[bits];
@@ -1342,7 +1189,7 @@ function inflate(data, usz/*:number*/) {
 				}
 
 				/* in the common case, manual byte copy is faster than TA set / Buffer copy */
-				if(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt + 100); OL = outbuf.length; }
+				if(!usz && OL < tgt) { outbuf = realloc(outbuf, tgt); OL = outbuf.length; }
 				while(woff < tgt) { outbuf[woff] = outbuf[woff - dst]; ++woff; }
 			}
 		}
@@ -1441,7 +1288,7 @@ function parse_local_file(blob/*:CFBlob*/, csz/*:number*/, usz/*:number*/, o/*:C
 	var data = blob.slice(blob.l, blob.l + _csz);
 	switch(meth) {
 		case 8: data = _inflateRawSync(blob, _usz); break;
-		case 0: break; // TODO: scan for magic number
+		case 0: break;
 		default: throw new Error("Unsupported ZIP Compression method " + meth);
 	}
 
@@ -1508,10 +1355,7 @@ function write_zip(cfb/*:CFBContainer*/, options/*:CFBWriteOpts*/)/*:RawBytes*/
 		start_cd += namebuf.length;
 		out.push(namebuf);
 
-		/* TODO: extra fields? */
-
 		/* TODO: encryption header ? */
-
 		start_cd += outbuf.length;
 		out.push(outbuf);
 
@@ -1770,8 +1614,7 @@ function write_mad(cfb/*:CFBContainer*/, options/*:CFBWriteOpts*/)/*:string*/ {
 	}
 	out.push(boundary + '--\r\n');
 	return out.join("\r\n");
-}
-function cfb_new(opts/*:?any*/)/*:CFBContainer*/ {
+}function cfb_new(opts/*:?any*/)/*:CFBContainer*/ {
 	var o/*:CFBContainer*/ = ({}/*:any*/);
 	init_cfb(o, opts);
 	return o;

package/node_modules/clone/README.md

@@ -5,8 +5,6 @@
 offers foolproof _deep cloning_ of objects, arrays, numbers, strings, maps,
 sets, promises, etc. in JavaScript.
 
-**XSS vulnerability detected**
-
 
 ## Installation
 
@@ -100,12 +98,6 @@ So, `b.myself` points to `b`, not `a`. Neat!
 
 ## Changelog
 
-### v2.1.2
-
-#### 2018-03-21
-
-  - Use `Buffer.allocUnsafe()` on Node >= 4.5.0 (contributed by @ChALkeR)
-
 ### v2.1.1
 
 #### 2017-03-09
@@ -127,15 +119,7 @@ So, `b.myself` points to `b`, not `a`. Neat!
 
   - Add support for cloning ES6 Maps, Sets, Promises, and Symbols
 
-### v1.0.3
-
-#### 2017-11-08
-
-  - Close XSS vulnerability in the NPM package, which included the file
-    `test-apart-ctx.html`. This vulnerability was disclosed by Juho Nurminen of
-    2NS - Second Nature Security.
-
-### v1.0.2 (deprecated)
+### v1.0.2
 
 #### 2015-03-25
 
@@ -143,14 +127,14 @@ So, `b.myself` points to `b`, not `a`. Neat!
   - Refactor utilities
   - Refactor test suite
 
-### v1.0.1 (deprecated)
+### v1.0.1
 
 #### 2015-03-04
 
   - Fix nodeunit version
   - Directly call getRegExpFlags
 
-### v1.0.0 (deprecated)
+### v1.0.0
 
 #### 2015-02-10
 

package/node_modules/clone/clone.js

@@ -104,13 +104,7 @@ function clone(parent, circular, depth, prototype, includeNonEnumerable) {
     } else if (clone.__isDate(parent)) {
       child = new Date(parent.getTime());
     } else if (useBuffer && Buffer.isBuffer(parent)) {
-      if (Buffer.allocUnsafe) {
-        // Node.js >= 4.5.0
-        child = Buffer.allocUnsafe(parent.length);
-      } else {
-        // Older Node.js versions
-        child = new Buffer(parent.length);
-      }
+      child = new Buffer(parent.length);
       parent.copy(child);
       return child;
     } else if (_instanceof(parent, Error)) {

package/node_modules/clone/package.json

@@ -1,31 +1,32 @@
 {
   "_args": [
     [
-      "clone@2.1.2",
+      "clone@2.1.1",
       "/home/ubuntu/buildAgent/work/20f715f46c2b009e"
     ]
   ],
-  "_from": "clone@2.1.2",
-  "_id": "clone@2.1.2",
+  "_from": "clone@2.1.1",
+  "_id": "clone@2.1.1",
   "_inBundle": false,
-  "_integrity": "sha1-G39Ln1kfHo+DZwQBYANFoCiHQ18=",
+  "_integrity": "sha1-0hfR6WERjjrJpLi7oyhVU79kfNs=",
   "_location": "/clone",
   "_phantomChildren": {},
   "_requested": {
     "type": "version",
     "registry": true,
-    "raw": "clone@2.1.2",
+    "raw": "clone@2.1.1",
     "name": "clone",
     "escapedName": "clone",
-    "rawSpec": "2.1.2",
+    "rawSpec": "2.1.1",
     "saveSpec": null,
-    "fetchSpec": "2.1.2"
+    "fetchSpec": "2.1.1"
   },
   "_requiredBy": [
-    "/"
+    "/",
+    "/socketcluster-client"
   ],
-  "_resolved": "https://registry.npmjs.org/clone/-/clone-2.1.2.tgz",
-  "_spec": "2.1.2",
+  "_resolved": "https://registry.npmjs.org/clone/-/clone-2.1.1.tgz",
+  "_spec": "2.1.1",
   "_where": "/home/ubuntu/buildAgent/work/20f715f46c2b009e",
   "author": {
     "name": "Paul Vorbach",
@@ -157,5 +158,5 @@
     "function",
     "date"
   ],
-  "version": "2.1.2"
+  "version": "2.1.1"
 }

package/node_modules/cookie/HISTORY.md

@@ -1,3 +1,9 @@
+0.4.2 / 2022-02-02
+==================
+
+  * pref: read value only when assigning in parse
+  * pref: remove unnecessary regexp in parse
+
 0.4.1 / 2020-04-21
 ==================
 

package/node_modules/cookie/README.md

@@ -3,7 +3,7 @@
 [![NPM Version][npm-version-image]][npm-url]
 [![NPM Downloads][npm-downloads-image]][npm-url]
 [![Node.js Version][node-version-image]][node-version-url]
-[![Build Status][travis-image]][travis-url]
+[![Build Status][github-actions-ci-image]][github-actions-ci-url]
 [![Test Coverage][coveralls-image]][coveralls-url]
 
 Basic HTTP cookie parser and serializer for HTTP servers.
@@ -198,32 +198,61 @@ $ npm test
 ```
 $ npm run bench
 
-> cookie@0.3.1 bench cookie
+> cookie@0.4.1 bench
 > node benchmark/index.js
 
-  http_parser@2.8.0
-  node@6.14.2
-  v8@5.1.281.111
-  uv@1.16.1
+  node@16.13.1
+  v8@9.4.146.24-node.14
+  uv@1.42.0
   zlib@1.2.11
-  ares@1.10.1-DEV
-  icu@58.2
-  modules@48
-  napi@3
-  openssl@1.0.2o
+  brotli@1.0.9
+  ares@1.18.1
+  modules@93
+  nghttp2@1.45.1
+  napi@8
+  llhttp@6.0.4
+  openssl@1.1.1l+quic
+  cldr@39.0
+  icu@69.1
+  tz@2021a
+  unicode@13.0
+  ngtcp2@0.1.0-DEV
+  nghttp3@0.1.0-DEV
+
+> node benchmark/parse-top.js
+
+  cookie.parse - top sites
+
+  15 tests completed.
+
+  parse accounts.google.com x   504,358 ops/sec ±6.55% (171 runs sampled)
+  parse apple.com           x 1,369,991 ops/sec ±0.84% (189 runs sampled)
+  parse cloudflare.com      x   360,669 ops/sec ±3.75% (182 runs sampled)
+  parse docs.google.com     x   521,496 ops/sec ±4.90% (180 runs sampled)
+  parse drive.google.com    x   553,514 ops/sec ±0.59% (189 runs sampled)
+  parse en.wikipedia.org    x   286,052 ops/sec ±0.62% (188 runs sampled)
+  parse linkedin.com        x   178,817 ops/sec ±0.61% (192 runs sampled)
+  parse maps.google.com     x   284,585 ops/sec ±0.68% (188 runs sampled)
+  parse microsoft.com       x   161,230 ops/sec ±0.56% (192 runs sampled)
+  parse play.google.com     x   352,144 ops/sec ±1.01% (181 runs sampled)
+  parse plus.google.com     x   275,204 ops/sec ±7.78% (156 runs sampled)
+  parse support.google.com  x   339,493 ops/sec ±1.02% (191 runs sampled)
+  parse www.google.com      x   286,110 ops/sec ±0.90% (191 runs sampled)
+  parse youtu.be            x   548,557 ops/sec ±0.60% (184 runs sampled)
+  parse youtube.com         x   545,293 ops/sec ±0.65% (191 runs sampled)
 
 > node benchmark/parse.js
 
-  cookie.parse
+  cookie.parse - generic
 
   6 tests completed.
 
-  simple      x 1,200,691 ops/sec ±1.12% (189 runs sampled)
-  decode      x 1,012,994 ops/sec ±0.97% (186 runs sampled)
-  unquote     x 1,074,174 ops/sec ±2.43% (186 runs sampled)
-  duplicates  x   438,424 ops/sec ±2.17% (184 runs sampled)
-  10 cookies  x   147,154 ops/sec ±1.01% (186 runs sampled)
-  100 cookies x    14,274 ops/sec ±1.07% (187 runs sampled)
+  simple      x 1,266,646 ops/sec ±0.65% (191 runs sampled)
+  decode      x   838,413 ops/sec ±0.60% (191 runs sampled)
+  unquote     x   877,820 ops/sec ±0.72% (189 runs sampled)
+  duplicates  x   516,680 ops/sec ±0.61% (191 runs sampled)
+  10 cookies  x   156,874 ops/sec ±0.52% (189 runs sampled)
+  100 cookies x    14,663 ops/sec ±0.53% (191 runs sampled)
 ```
 
 ## References
@@ -248,10 +277,10 @@ $ npm run bench
 
 [coveralls-image]: https://badgen.net/coveralls/c/github/jshttp/cookie/master
 [coveralls-url]: https://coveralls.io/r/jshttp/cookie?branch=master
+[github-actions-ci-image]: https://img.shields.io/github/workflow/status/jshttp/cookie/ci/master?label=ci
+[github-actions-ci-url]: https://github.com/jshttp/cookie/actions/workflows/ci.yml
 [node-version-image]: https://badgen.net/npm/node/cookie
 [node-version-url]: https://nodejs.org/en/download
 [npm-downloads-image]: https://badgen.net/npm/dm/cookie
 [npm-url]: https://npmjs.org/package/cookie
 [npm-version-image]: https://badgen.net/npm/v/cookie
-[travis-image]: https://badgen.net/travis/jshttp/cookie/master
-[travis-url]: https://travis-ci.org/jshttp/cookie