ordered-binary 1.3.0 → 1.4.0

package/.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/ordered-binary.iml" filepath="$PROJECT_DIR$/.idea/ordered-binary.iml" />
+    </modules>
+  </component>
+</project>

package/.idea/ordered-binary.iml

@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="WEB_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$">
+      <excludeFolder url="file://$MODULE_DIR$/temp" />
+      <excludeFolder url="file://$MODULE_DIR$/.tmp" />
+      <excludeFolder url="file://$MODULE_DIR$/tmp" />
+      <excludeFolder url="file://$MODULE_DIR$/.idea" />
+      <excludeFolder url="file://$MODULE_DIR$/dist" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

package/LICENSE

@@ -1,21 +1,21 @@
-MIT License
-
-Copyright (c) 2018 Kris Zyp
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-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 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.
+MIT License
+
+Copyright (c) 2018 Kris Zyp
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+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 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.

package/README.md

@@ -1,39 +1,39 @@
-[![npm version](https://img.shields.io/npm/dw/ordered-binary)](https://www.npmjs.org/package/ordered-binary)
-[![npm version](https://img.shields.io/npm/v/ordered-binary.svg?style=flat-square)](https://www.npmjs.org/package/ordered-binary)
-[![license](https://img.shields.io/badge/license-MIT-brightgreen)](LICENSE)
-<a href="https://dev.doctorevidence.com/"><img src="./assets/powers-dre.png" width="203" /></a>
-
-The ordered-binary package provides a representation of JavaScript primitives, serialized into binary format (NodeJS Buffers or Uint8Arrays), such that the binary values are naturally ordered such that it matches the natural ordering or values. For example, since -2.0321 > -2.04, then `toBufferKey(-2.0321)` will be greater than `toBufferKey(-2.04)` as a binary representation, in left-to-right evaluation. This is particular useful for storing keys as binaries with something like LMDB or LevelDB, to avoid any custom sorting.
-
-The ordered-binary package supports strings, numbers, booleans, symbols, null, as well as an array of primitives. Here is an example of ordering of primitive values:
-```
-Buffer.from([0]) // buffers are left unchanged, and this is the minimum value
-Symbol.for('even symbols')
--10 // negative supported
--1.1 // decimals supported
-400
-3E10
-'Hello'
-['Hello', 'World']
-'World'
-'hello'
-['hello', 1, 'world']
-['hello', 'world']
-Buffer.from([0xff])
-```
-
-
-The main module exports these functions:
-
-`writeKey(key: string | number | boolean | null | Array, target: Buffer, position: integer, inSequence?: boolean)` - Writes the provide key to the target buffer
-
-`readKey(buffer, start, end, inSequence)` - Reads the key from the buffer, given the provided start and end, as a primitive value
-
-`toBufferKey(jsPrimitive)` - This accepts a string, number, or boolean as the argument, and returns a `Buffer`.
-
-`fromBufferKey(bufferKey, multiple)` - This accepts a Buffer and returns a JavaScript primitive value. This can also parse buffers that hold multiple values delimited by a byte `30`, by setting the second argument to true (in which case it will return an array).
-
-And these constants:
-
-`MINIMUM_KEY` - The minimum key supported (`null`, which is represented as single zero byte)
-`MAXIMUM_KEY` - A maximum key larger than any supported primitive (single 0xff byte)
+[![npm version](https://img.shields.io/npm/dw/ordered-binary)](https://www.npmjs.org/package/ordered-binary)
+[![npm version](https://img.shields.io/npm/v/ordered-binary.svg?style=flat-square)](https://www.npmjs.org/package/ordered-binary)
+[![license](https://img.shields.io/badge/license-MIT-brightgreen)](LICENSE)
+<a href="https://dev.doctorevidence.com/"><img src="./assets/powers-dre.png" width="203" /></a>
+
+The ordered-binary package provides a representation of JavaScript primitives, serialized into binary format (NodeJS Buffers or Uint8Arrays), such that the binary values are naturally ordered such that it matches the natural ordering or values. For example, since -2.0321 > -2.04, then `toBufferKey(-2.0321)` will be greater than `toBufferKey(-2.04)` as a binary representation, in left-to-right evaluation. This is particular useful for storing keys as binaries with something like LMDB or LevelDB, to avoid any custom sorting.
+
+The ordered-binary package supports strings, numbers, booleans, symbols, null, as well as an array of primitives. Here is an example of ordering of primitive values:
+```
+Buffer.from([0]) // buffers are left unchanged, and this is the minimum value
+Symbol.for('even symbols')
+-10 // negative supported
+-1.1 // decimals supported
+400
+3E10
+'Hello'
+['Hello', 'World']
+'World'
+'hello'
+['hello', 1, 'world']
+['hello', 'world']
+Buffer.from([0xff])
+```
+
+
+The main module exports these functions:
+
+`writeKey(key: string | number | boolean | null | Array, target: Buffer, position: integer, inSequence?: boolean)` - Writes the provide key to the target buffer
+
+`readKey(buffer, start, end, inSequence)` - Reads the key from the buffer, given the provided start and end, as a primitive value
+
+`toBufferKey(jsPrimitive)` - This accepts a string, number, or boolean as the argument, and returns a `Buffer`.
+
+`fromBufferKey(bufferKey, multiple)` - This accepts a Buffer and returns a JavaScript primitive value. This can also parse buffers that hold multiple values delimited by a byte `30`, by setting the second argument to true (in which case it will return an array).
+
+And these constants:
+
+`MINIMUM_KEY` - The minimum key supported (`null`, which is represented as single zero byte)
+`MAXIMUM_KEY` - A maximum key larger than any supported primitive (single 0xff byte)

package/dist/index.cjs

@@ -43,7 +43,10 @@ function writeKey(key, target, position, inSequence) {
 			let i, c2;
 			for (i = 0; i < strLength; i++) {
 				c1 = key.charCodeAt(i);
-				if (c1 < 0x80) {
+				if (c1 <= 4) {
+					target[position++] = 4;
+					target[position++] = c1;
+				} else if (c1 < 0x80) {
 					target[position++] = c1;
 				} else if (c1 < 0x800) {
 					target[position++] = c1 >> 6 | 0xc0;
@@ -254,10 +257,14 @@ function makeStringBuilder() {
 		let v = fromCharCode((i & 0xf) + 97) + fromCharCode((i >> 4) + 97);
 		stringBuildCode += `
 		let ${v} = source[position++]
-		if (!${v})
-		return fromCharCode(${previous})
-		else if (${v} >= 0x80)
-		${v} = finishUtf8(${v}, source)
+		if (${v} > 4) {
+			if (${v} >= 0x80) ${v} = finishUtf8(${v}, source)
+		} else {
+			if (${v} === 4)
+				${v} = source[position++]
+			else
+				return fromCharCode(${previous})
+		}
 		`;
 		previous.push(v);
 		if (i == 1000000) // this just exists to prevent rollup from doing dead code elimination on finishUtf8

package/index.d.ts

@@ -1,23 +1,23 @@
-type Key = Key[] | string | symbol | number | boolean | Uint8Array;
-/** Writes a key (a primitive value) to the target buffer, starting at the given position */
-export function writeKey(key: Key, target: Uint8Array, position: number, inSequence?: boolean): number;
-/** Reads a key from the provided buffer, from the given range */
-export function readKey(buffer: Uint8Array, start: number, end?: number, inSequence?: boolean): Key;
-/** Converts key to a Buffer. This is generally much slower than using writeKey since it involves a full buffer allocation, and should be avoided for performance sensitive code. */
-export function toBufferKey(key: Key): Buffer;
-/** Converts Buffer to Key */
-export function fromBufferKey(source: Buffer): Key;
-/** Compares two keys, returning -1 if `a` comes before `b` in the ordered binary representation of the keys, or 1 if `a` comes after `b`, or 0 if they are equivalent */
-export function compareKeys(a: Key, b: Key): number;
-/** The minimum key, with the "first" binary representation (one byte of zero) */
-export const MINIMUM_KEY: null
-/** A maximum key, with a binary representation after all other JS primitives (one byte of 0xff) */
-export const MAXIMUM_KEY: Uint8Array
-/** Enables null termination, ensuring that writing keys to buffers will end with a padding of zeros at the end to complete the following 32-bit word */
-export function enableNullTermination(): void;
-/** An object that holds the functions for encapsulation as a single encoder */
-export const encoder: {
-	writeKey: typeof writeKey,
-	readKey: typeof readKey,
-	enableNullTermination: typeof enableNullTermination,
+type Key = Key[] | string | symbol | number | boolean | Uint8Array;
+/** Writes a key (a primitive value) to the target buffer, starting at the given position */
+export function writeKey(key: Key, target: Uint8Array, position: number, inSequence?: boolean): number;
+/** Reads a key from the provided buffer, from the given range */
+export function readKey(buffer: Uint8Array, start: number, end?: number, inSequence?: boolean): Key;
+/** Converts key to a Buffer. This is generally much slower than using writeKey since it involves a full buffer allocation, and should be avoided for performance sensitive code. */
+export function toBufferKey(key: Key): Buffer;
+/** Converts Buffer to Key */
+export function fromBufferKey(source: Buffer): Key;
+/** Compares two keys, returning -1 if `a` comes before `b` in the ordered binary representation of the keys, or 1 if `a` comes after `b`, or 0 if they are equivalent */
+export function compareKeys(a: Key, b: Key): number;
+/** The minimum key, with the "first" binary representation (one byte of zero) */
+export const MINIMUM_KEY: null
+/** A maximum key, with a binary representation after all other JS primitives (one byte of 0xff) */
+export const MAXIMUM_KEY: Uint8Array
+/** Enables null termination, ensuring that writing keys to buffers will end with a padding of zeros at the end to complete the following 32-bit word */
+export function enableNullTermination(): void;
+/** An object that holds the functions for encapsulation as a single encoder */
+export const encoder: {
+	writeKey: typeof writeKey,
+	readKey: typeof readKey,
+	enableNullTermination: typeof enableNullTermination,
 }

package/index.js

@@ -39,7 +39,10 @@ export function writeKey(key, target, position, inSequence) {
 			let i, c2
 			for (i = 0; i < strLength; i++) {
 				c1 = key.charCodeAt(i)
-				if (c1 < 0x80) {
+				if (c1 <= 4) {
+					target[position++] = 4
+					target[position++] = c1
+				} else if (c1 < 0x80) {
 					target[position++] = c1
 				} else if (c1 < 0x800) {
 					target[position++] = c1 >> 6 | 0xc0
@@ -250,10 +253,14 @@ function makeStringBuilder() {
 		let v = fromCharCode((i & 0xf) + 97) + fromCharCode((i >> 4) + 97)
 		stringBuildCode += `
 		let ${v} = source[position++]
-		if (!${v})
-		return fromCharCode(${previous})
-		else if (${v} >= 0x80)
-		${v} = finishUtf8(${v}, source)
+		if (${v} > 4) {
+			if (${v} >= 0x80) ${v} = finishUtf8(${v}, source)
+		} else {
+			if (${v} === 4)
+				${v} = source[position++]
+			else
+				return fromCharCode(${previous})
+		}
 		`
 		previous.push(v)
 		if (i == 1000000) // this just exists to prevent rollup from doing dead code elimination on finishUtf8

package/package.json

@@ -1,37 +1,37 @@
-{
-  "name": "ordered-binary",
-  "author": "Kris Zyp",
-  "version": "1.3.0",
-  "description": "Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order",
-  "license": "MIT",
-  "repository": {
-    "type": "git",
-    "url": "http://github.com/kriszyp/ordered-binary"
-  },
-  "scripts": {
-    "build": "rollup -c",
-    "prepare": "rollup -c",
-    "test": "mocha tests -u tdd"
-  },
-  "type": "module",
-  "main": "dist/index.cjs",
-  "module": "index.js",
-  "exports": {
-    ".": {
-      "require": "./dist/index.cjs",
-      "import": "./index.js"
-    },
-    "./index.js": {
-      "require": "./dist/index.cjs",
-      "import": "./index.js"
-    }
-  },
-  "typings": "./index.d.ts",
-  "optionalDependencies": {},
-  "devDependencies": {
-    "@types/node": "latest",
-    "chai": "^4",
-    "mocha": "^9.2.0",
-    "rollup": "^2.61.1"
-  }
-}
+{
+  "name": "ordered-binary",
+  "author": "Kris Zyp",
+  "version": "1.4.0",
+  "description": "Conversion of JavaScript primitives to and from Buffer with binary order matching natural primitive order",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "http://github.com/kriszyp/ordered-binary"
+  },
+  "scripts": {
+    "build": "rollup -c",
+    "prepare": "rollup -c",
+    "test": "mocha tests -u tdd"
+  },
+  "type": "module",
+  "main": "dist/index.cjs",
+  "module": "index.js",
+  "exports": {
+    ".": {
+      "require": "./dist/index.cjs",
+      "import": "./index.js"
+    },
+    "./index.js": {
+      "require": "./dist/index.cjs",
+      "import": "./index.js"
+    }
+  },
+  "typings": "./index.d.ts",
+  "optionalDependencies": {},
+  "devDependencies": {
+    "@types/node": "latest",
+    "chai": "^4",
+    "mocha": "^9.2.0",
+    "rollup": "^2.61.1"
+  }
+}

package/rollup.config.js

@@ -1,11 +1,11 @@
-export default [
-    {
-        input: "index.js",
-        output: [
-            {
-                file: "dist/index.cjs",
-                format: "cjs"
-            }
-        ]
-    }
-];
+export default [
+    {
+        input: "index.js",
+        output: [
+            {
+                file: "dist/index.cjs",
+                format: "cjs"
+            }
+        ]
+    }
+];

package/tests/test.js

@@ -44,6 +44,8 @@ suite('key buffers', () => {
     assert.strictEqual(fromBufferKey(toBufferKey('4')), '4')
     assert.strictEqual(fromBufferKey(toBufferKey('hello')), 'hello')
     assert.strictEqual(fromBufferKey(toBufferKey('')), '')
+    assert.strictEqual(fromBufferKey(toBufferKey('\x00')), '\x00')
+    assert.strictEqual(fromBufferKey(toBufferKey('\x03test\x01\x00')), '\x03test\x01\x00')
   })
   test('string comparison', () => {
     assertBufferComparison(toBufferKey('4'), toBufferKey('5'))
@@ -64,8 +66,8 @@ suite('key buffers', () => {
       ['hello', 5.25])
     assert.deepEqual(fromBufferKey(toBufferKey([true, 1503579323825])),
       [true, 1503579323825])
-    assert.deepEqual(fromBufferKey(toBufferKey([-0.2525, 'second'])),
-      [-0.2525, 'second'])
+    assert.deepEqual(fromBufferKey(toBufferKey([-0.2525, 'sec\x00nd'])),
+      [-0.2525, 'sec\x00nd'])
     assert.deepEqual(fromBufferKey(toBufferKey([-0.2525, '2nd', '3rd'])),
       [-0.2525, '2nd', '3rd'])
   })

package/uuid.js

@@ -1,110 +0,0 @@
-
-
-export function uuid3(uuid, target, position) {
-	let int32 = target.int32
-	if (!int32)
-		int32 = target.int32 = new Int32Array(target.buffer, target.byteOffset, target.byteLength >> 2)
-	let c
-	let intPosition = position >> 2
-	int32[intPosition] =
-		(((c = uuid.charCodeAt(0)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(1)) > 90 ? (c - 87) : (c - 48)) |
-		(((c = uuid.charCodeAt(2)) > 90 ? (c - 87) : (c - 48)) << 12) |
-		(((c = uuid.charCodeAt(3)) > 90 ? (c - 87) : (c - 48)) << 8) |
-		(((c = uuid.charCodeAt(4)) > 90 ? (c - 87) : (c - 48)) << 20) |
-		(((c = uuid.charCodeAt(5)) > 90 ? (c - 87) : (c - 48)) << 16) |
-		(((c = uuid.charCodeAt(6)) > 90 ? (c - 87) : (c - 48)) << 28) |
-		(((c = uuid.charCodeAt(7)) > 90 ? (c - 87) : (c - 48)) << 24)
-	int32[intPosition + 1] =
-		(((c = uuid.charCodeAt(9)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(10)) > 90 ? (c - 87) : (c - 48)) |
-		(((c = uuid.charCodeAt(11)) > 90 ? (c - 87) : (c - 48)) << 12) |
-		(((c = uuid.charCodeAt(12)) > 90 ? (c - 87) : (c - 48)) << 8) |
-		(((c = uuid.charCodeAt(14)) > 90 ? (c - 87) : (c - 48)) << 20) |
-		(((c = uuid.charCodeAt(15)) > 90 ? (c - 87) : (c - 48)) << 16) |
-		(((c = uuid.charCodeAt(16)) > 90 ? (c - 87) : (c - 48)) << 28) |
-		(((c = uuid.charCodeAt(17)) > 90 ? (c - 87) : (c - 48)) << 24)
-	int32[intPosition + 2] =
-		(((c = uuid.charCodeAt(19)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(20)) > 90 ? (c - 87) : (c - 48)) |
-		(((c = uuid.charCodeAt(21)) > 90 ? (c - 87) : (c - 48)) << 12) |
-		(((c = uuid.charCodeAt(22)) > 90 ? (c - 87) : (c - 48)) << 8) |
-		(((c = uuid.charCodeAt(24)) > 90 ? (c - 87) : (c - 48)) << 20) |
-		(((c = uuid.charCodeAt(25)) > 90 ? (c - 87) : (c - 48)) << 16) |
-		(((c = uuid.charCodeAt(26)) > 90 ? (c - 87) : (c - 48)) << 28) |
-		(((c = uuid.charCodeAt(27)) > 90 ? (c - 87) : (c - 48)) << 24)
-	int32[intPosition + 3] =
-		(((c = uuid.charCodeAt(28)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(29)) > 90 ? (c - 87) : (c - 48)) |
-		(((c = uuid.charCodeAt(30)) > 90 ? (c - 87) : (c - 48)) << 12) |
-		(((c = uuid.charCodeAt(31)) > 90 ? (c - 87) : (c - 48)) << 8) |
-		(((c = uuid.charCodeAt(32)) > 90 ? (c - 87) : (c - 48)) << 20) |
-		(((c = uuid.charCodeAt(33)) > 90 ? (c - 87) : (c - 48)) << 16) |
-		(((c = uuid.charCodeAt(34)) > 90 ? (c - 87) : (c - 48)) << 28) |
-		(((c = uuid.charCodeAt(35)) > 90 ? (c - 87) : (c - 48)) << 24)
-
-		return position + 16
-}
-
-export function uuid2(uuid, target, position) {
-	let c
-	target[0] =
-		(((c = uuid.charCodeAt(0)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(1)) > 90 ? (c - 87) : (c - 48))
-	target[1] =
-		(((c = uuid.charCodeAt(2)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(3)) > 90 ? (c - 87) : (c - 48))
-	target[2] =
-		(((c = uuid.charCodeAt(4)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(5)) > 90 ? (c - 87) : (c - 48))
-	target[3] =
-		(((c = uuid.charCodeAt(6)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(7)) > 90 ? (c - 87) : (c - 48))
-	target[4] =
-		(((c = uuid.charCodeAt(9)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(10)) > 90 ? (c - 87) : (c - 48))
-	target[5] =
-		(((c = uuid.charCodeAt(11)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(12)) > 90 ? (c - 87) : (c - 48))
-	target[6] =
-		(((c = uuid.charCodeAt(14)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(15)) > 90 ? (c - 87) : (c - 48))
-	target[7] =
-		(((c = uuid.charCodeAt(16)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(17)) > 90 ? (c - 87) : (c - 48))
-	target[8] =
-		(((c = uuid.charCodeAt(19)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(20)) > 90 ? (c - 87) : (c - 48))
-	target[9] =
-		(((c = uuid.charCodeAt(21)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(22)) > 90 ? (c - 87) : (c - 48))
-	target[10] =
-		(((c = uuid.charCodeAt(24)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(25)) > 90 ? (c - 87) : (c - 48))
-	target[11] =
-		(((c = uuid.charCodeAt(26)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(27)) > 90 ? (c - 87) : (c - 48))
-	target[12] =
-		(((c = uuid.charCodeAt(28)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(29)) > 90 ? (c - 87) : (c - 48))
-	target[13] =
-		(((c = uuid.charCodeAt(30)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(31)) > 90 ? (c - 87) : (c - 48))
-	target[14] =
-		(((c = uuid.charCodeAt(32)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(33)) > 90 ? (c - 87) : (c - 48))
-	target[15] =
-		(((c = uuid.charCodeAt(34)) > 90 ? (c - 87) : (c - 48)) << 4) |
-		((c = uuid.charCodeAt(35)) > 90 ? (c - 87) : (c - 48))
-
-
-	return position + 16
-}
-export function uuidReadKey(buffer, start) {
-	let c
-	String.fromCharCode(
-		(c = buffer[0]) < 160 ? ((c >> 4) + 48) : ((c >> 4) + 87),
-		(c = c & 0xf) < 10 ? (c + 48) : (c + 87),
-		...
-		45)
-}