@exodus/bytes 1.0.0-rc.2 → 1.0.0-rc.4

package/fallback/base64.js

@@ -0,0 +1,162 @@
+import { assertUint8 } from '../assert.js'
+import { nativeEncoder, nativeDecoder } from './_utils.js'
+
+// See https://datatracker.ietf.org/doc/html/rfc4648
+
+const BASE64 = [...'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/']
+const BASE64URL = [...'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_']
+const BASE64_HELPERS = {}
+const BASE64URL_HELPERS = {}
+
+export const E_CHAR = 'Invalid character in base64 input'
+export const E_PADDING = 'Invalid base64 padding'
+export const E_LENGTH = 'Invalid base64 length'
+export const E_LAST = 'Invalid last chunk'
+
+// Alternatively, we could have mapped 0-255 bytes to charcodes and just used btoa(ascii),
+// but that approach is _slower_ than our toBase64js function, even on Hermes
+
+// We construct output by concatenating chars, this seems to be fine enough on modern JS engines
+export function toBase64(arr, isURL, padding) {
+  assertUint8(arr)
+  const fullChunks = Math.floor(arr.length / 3)
+  const fullChunksBytes = fullChunks * 3
+  let o = ''
+  let i = 0
+
+  const alphabet = isURL ? BASE64URL : BASE64
+  const helpers = isURL ? BASE64URL_HELPERS : BASE64_HELPERS
+  if (!helpers.pairs) {
+    helpers.pairs = []
+    if (nativeDecoder) {
+      // Lazy to save memory in case if this is not needed
+      helpers.codepairs = new Uint16Array(64 * 64)
+      const u16 = helpers.codepairs
+      const u8 = new Uint8Array(u16.buffer, u16.byteOffset, u16.byteLength) // write as 1-byte to ignore BE/LE difference
+      for (let i = 0; i < 64; i++) {
+        const ic = alphabet[i].charCodeAt(0)
+        for (let j = 0; j < 64; j++) u8[(i << 7) | (j << 1)] = u8[(j << 7) | ((i << 1) + 1)] = ic
+      }
+    } else {
+      const p = helpers.pairs
+      for (let i = 0; i < 64; i++) {
+        for (let j = 0; j < 64; j++) p.push(`${alphabet[i]}${alphabet[j]}`)
+      }
+    }
+  }
+
+  const { pairs, codepairs } = helpers
+
+  // Fast path for complete blocks
+  // This whole loop can be commented out, the algorithm won't change, it's just an optimization of the next loop
+  if (nativeDecoder) {
+    const oa = new Uint16Array(fullChunks * 2)
+    for (let j = 0; i < fullChunksBytes; i += 3) {
+      const a = arr[i]
+      const b = arr[i + 1]
+      const c = arr[i + 2]
+      oa[j++] = codepairs[(a << 4) | (b >> 4)]
+      oa[j++] = codepairs[((b & 0x0f) << 8) | c]
+    }
+
+    o = nativeDecoder.decode(oa)
+  } else {
+    for (; i < fullChunksBytes; i += 3) {
+      const a = arr[i]
+      const b = arr[i + 1]
+      const c = arr[i + 2]
+      o += pairs[(a << 4) | (b >> 4)] + pairs[((b & 0x0f) << 8) | c]
+    }
+  }
+
+  // If we have something left, process it with a full algo
+  let carry = 0
+  let shift = 2 // First byte needs to be shifted by 2 to get 6 bits
+  const length = arr.length
+  for (; i < length; i++) {
+    const x = arr[i]
+    o += alphabet[carry | (x >> shift)] // shift >= 2, so this fits
+    if (shift === 6) {
+      shift = 0
+      o += alphabet[x & 0x3f]
+    }
+
+    carry = (x << (6 - shift)) & 0x3f
+    shift += 2 // Each byte prints 6 bits and leaves 2 bits
+  }
+
+  if (shift !== 2) o += alphabet[carry] // shift 2 means we have no carry left
+  if (padding) o += ['', '==', '='][length - fullChunksBytes]
+
+  return o
+}
+
+// TODO: can this be optimized? This only affects non-Hermes barebone engines though
+const mapSize = nativeEncoder ? 256 : 65_536 // we have to store 64 KiB map or recheck everything if we can't decode to byte array
+
+// Last chunk is rechecked at API
+export function fromBase64(str, isURL) {
+  let inputLength = str.length
+  while (str[inputLength - 1] === '=') inputLength--
+  const paddingLength = str.length - inputLength
+  const tailLength = inputLength % 4
+  const mainLength = inputLength - tailLength // multiples of 4
+  if (tailLength === 1) throw new SyntaxError(E_LENGTH)
+  if (paddingLength > 3 || (paddingLength !== 0 && str.length % 4 !== 0)) {
+    throw new SyntaxError(E_PADDING)
+  }
+
+  const alphabet = isURL ? BASE64URL : BASE64
+  const helpers = isURL ? BASE64URL_HELPERS : BASE64_HELPERS
+
+  if (!helpers.fromMap) {
+    helpers.fromMap = new Int8Array(mapSize).fill(-1) // no regex input validation here, so we map all other bytes to -1 and recheck sign
+    alphabet.forEach((c, i) => (helpers.fromMap[c.charCodeAt(0)] = i))
+  }
+
+  const m = helpers.fromMap
+
+  const arr = new Uint8Array(Math.floor((inputLength * 3) / 4))
+  let at = 0
+  let i = 0
+
+  if (nativeEncoder) {
+    const codes = nativeEncoder.encode(str)
+    if (codes.length !== str.length) throw new SyntaxError(E_CHAR) // non-ascii
+    while (i < mainLength) {
+      const a = (m[codes[i++]] << 18) | (m[codes[i++]] << 12) | (m[codes[i++]] << 6) | m[codes[i++]]
+      if (a < 0) throw new SyntaxError(E_CHAR)
+      arr[at++] = a >> 16
+      arr[at++] = (a >> 8) & 0xff
+      arr[at++] = a & 0xff
+    }
+  } else {
+    while (i < mainLength) {
+      const a =
+        (m[str.charCodeAt(i++)] << 18) |
+        (m[str.charCodeAt(i++)] << 12) |
+        (m[str.charCodeAt(i++)] << 6) |
+        m[str.charCodeAt(i++)]
+      if (a < 0) throw new SyntaxError(E_CHAR)
+      arr[at++] = a >> 16
+      arr[at++] = (a >> 8) & 0xff
+      arr[at++] = a & 0xff
+    }
+  }
+
+  // Can be 0, 2 or 3, verified by padding checks already
+  if (tailLength < 2) return arr // 0
+  const ab = (m[str.charCodeAt(i++)] << 6) | m[str.charCodeAt(i++)]
+  if (ab < 0) throw new SyntaxError(E_CHAR)
+  arr[at++] = ab >> 4
+  if (tailLength < 3) {
+    if (ab & 0xf) throw new SyntaxError(E_LAST)
+    return arr // 2
+  }
+
+  const c = m[str.charCodeAt(i++)]
+  if (c < 0) throw new SyntaxError(E_CHAR)
+  arr[at++] = ((ab << 4) & 0xff) | (c >> 2)
+  if (c & 0x3) throw new SyntaxError(E_LAST)
+  return arr // 3
+}

package/fallback/hex.js

@@ -0,0 +1,107 @@
+import { assertUint8 } from '../assert.js'
+import { nativeEncoder } from './_utils.js'
+
+let hexArray
+let dehexArray
+
+export const E_HEX = 'Input is not a hex string'
+
+function toHexPart(arr, start, end) {
+  let o = ''
+  let i = start
+  const last3 = end - 3
+  // Unrolled loop is faster
+  while (i < last3) {
+    const a = arr[i++]
+    const b = arr[i++]
+    const c = arr[i++]
+    const d = arr[i++]
+    o += hexArray[a]
+    o += hexArray[b]
+    o += hexArray[c]
+    o += hexArray[d]
+  }
+
+  while (i < end) o += hexArray[arr[i++]]
+  return o
+}
+
+export function toHex(arr) {
+  assertUint8(arr)
+
+  if (!hexArray) hexArray = Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'))
+  const length = arr.length // this helps Hermes
+
+  if (length > 30_000) {
+    // Limit concatenation to avoid excessive GC
+    // Thresholds checked on Hermes
+    const concat = []
+    for (let i = 0; i < length; ) {
+      const step = i + 500
+      const end = step > length ? length : step
+      concat.push(toHexPart(arr, i, end))
+      i = end
+    }
+
+    const res = concat.join('')
+    concat.length = 0
+    return res
+  }
+
+  return toHexPart(arr, 0, length)
+}
+
+// TODO: can this be optimized? This only affects non-Hermes barebone engines though
+const mapSize = nativeEncoder ? 256 : 65_536 // we have to store 64 KiB map or recheck everything if we can't decode to byte array
+
+export function fromHex(str) {
+  if (typeof str !== 'string') throw new TypeError('Input is not a string')
+  if (str.length % 2 !== 0) throw new SyntaxError(E_HEX)
+
+  // We don't use native Buffer impl, as rechecking input make it slower than pure js
+  // This path is used only on older engines though
+
+  if (!dehexArray) {
+    dehexArray = new Int8Array(mapSize).fill(-1) // no regex input validation here, so we map all other bytes to -1 and recheck sign
+    for (let i = 0; i < 16; i++) {
+      const s = i.toString(16)
+      dehexArray[s.charCodeAt(0)] = dehexArray[s.toUpperCase().charCodeAt(0)] = i
+    }
+  }
+
+  const length = str.length / 2 // this helps Hermes in loops
+  const arr = new Uint8Array(length)
+  let j = 0
+  if (nativeEncoder) {
+    // Native encoder path is beneficial even for small arrays in Hermes
+    const codes = nativeEncoder.encode(str)
+    if (codes.length !== str.length) throw new SyntaxError(E_HEX) // non-ascii
+    const last3 = length - 3 // Unroll nativeEncoder path as this is what modern Hermes takes and a small perf improvement is nice there
+    let i = 0
+    while (i < last3) {
+      const a = (dehexArray[codes[j++]] << 4) | dehexArray[codes[j++]]
+      const b = (dehexArray[codes[j++]] << 4) | dehexArray[codes[j++]]
+      const c = (dehexArray[codes[j++]] << 4) | dehexArray[codes[j++]]
+      const d = (dehexArray[codes[j++]] << 4) | dehexArray[codes[j++]]
+      if (a < 0 || b < 0 || c < 0 || d < 0) throw new SyntaxError(E_HEX)
+      arr[i++] = a
+      arr[i++] = b
+      arr[i++] = c
+      arr[i++] = d
+    }
+
+    while (i < length) {
+      const res = (dehexArray[codes[j++]] << 4) | dehexArray[codes[j++]]
+      if (res < 0) throw new SyntaxError(E_HEX)
+      arr[i++] = res
+    }
+  } else {
+    for (let i = 0; i < length; i++) {
+      const res = (dehexArray[str.charCodeAt(j++)] << 4) | dehexArray[str.charCodeAt(j++)]
+      if (res < 0) throw new SyntaxError(E_HEX)
+      arr[i] = res
+    }
+  }
+
+  return arr
+}

package/fallback/utf8.js

@@ -0,0 +1,280 @@
+export const E_STRICT = 'Input is not well-formed utf8'
+export const E_STRICT_UNICODE = 'Input is not well-formed Unicode'
+
+const replacementPoint = 0xff_fd
+
+// https://encoding.spec.whatwg.org/#utf-8-decoder
+// We are most likely in loose mode, for non-loose escape & decodeURIComponent solved everything
+export function decode(arr, loose) {
+  const start = 0
+  const end = arr.length
+  let out = ''
+  const tmp = []
+
+  for (let i = start; i < end; i++) {
+    if (tmp.length > 0x2_00) {
+      // far below MAX_ARGUMENTS_LENGTH in npmjs.com/buffer, we use smaller chunks
+      // length can be off by a few as large code points produce two utf-16 char codes, also we overshoot in unrolled loop
+      out += String.fromCharCode.apply(String, tmp)
+      tmp.length = 0
+    }
+
+    const byte = arr[i]
+    if (byte < 0x80) {
+      // Fast path ascii
+      tmp.push(byte)
+      // Unroll the loop a bit for faster ops, overshoot by 20 chars
+      for (let j = 0; j < 5; j++) {
+        if (i + 1 >= end) break
+        const byte1 = arr[i + 1]
+        if (byte1 >= 0x80) break
+        tmp.push(byte1)
+        i++
+        if (i + 1 >= end) break
+        const byte2 = arr[i + 1]
+        if (byte2 >= 0x80) break
+        tmp.push(byte2)
+        i++
+        if (i + 1 >= end) break
+        const byte3 = arr[i + 1]
+        if (byte3 >= 0x80) break
+        tmp.push(byte3)
+        i++
+        if (i + 1 >= end) break
+        const byte4 = arr[i + 1]
+        if (byte4 >= 0x80) break
+        tmp.push(byte4)
+        i++
+      }
+    } else if (byte < 0xc2) {
+      if (!loose) throw new TypeError(E_STRICT)
+      tmp.push(replacementPoint)
+    } else if (byte < 0xe0) {
+      // need 1 more
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        break
+      }
+
+      const byte1 = arr[i + 1]
+      if (byte1 < 0x80 || byte1 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        continue
+      }
+
+      i++
+      tmp.push(((byte & 0x1f) << 6) | (byte1 & 0x3f))
+    } else if (byte < 0xf0) {
+      // need 2 more
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        break
+      }
+
+      const lower = byte === 0xe0 ? 0xa0 : 0x80
+      const upper = byte === 0xed ? 0x9f : 0xbf
+      const byte1 = arr[i + 1]
+      if (byte1 < lower || byte1 > upper) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        continue
+      }
+
+      i++
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        break
+      }
+
+      const byte2 = arr[i + 1]
+      if (byte2 < 0x80 || byte2 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        continue
+      }
+
+      i++
+      tmp.push(((byte & 0xf) << 12) | ((byte1 & 0x3f) << 6) | (byte2 & 0x3f))
+    } else if (byte <= 0xf4) {
+      // need 3 more
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        break
+      }
+
+      const lower = byte === 0xf0 ? 0x90 : 0x80
+      const upper = byte === 0xf4 ? 0x8f : 0xbf
+      const byte1 = arr[i + 1]
+      if (byte1 < lower || byte1 > upper) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        continue
+      }
+
+      i++
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        break
+      }
+
+      const byte2 = arr[i + 1]
+      if (byte2 < 0x80 || byte2 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        continue
+      }
+
+      i++
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        break
+      }
+
+      const byte3 = arr[i + 1]
+      if (byte3 < 0x80 || byte3 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp.push(replacementPoint)
+        continue
+      }
+
+      i++
+      const codePoint =
+        ((byte & 0xf) << 18) | ((byte1 & 0x3f) << 12) | ((byte2 & 0x3f) << 6) | (byte3 & 0x3f)
+      if (codePoint > 0xff_ff) {
+        // split into char codes as String.fromCharCode is faster than String.fromCodePoint
+        const u = codePoint - 0x1_00_00
+        tmp.push(0xd8_00 + ((u >> 10) & 0x3_ff), 0xdc_00 + (u & 0x3_ff))
+      } else {
+        tmp.push(codePoint)
+      }
+      // eslint-disable-next-line sonarjs/no-duplicated-branches
+    } else {
+      if (!loose) throw new TypeError(E_STRICT)
+      tmp.push(replacementPoint)
+    }
+  }
+
+  if (tmp.length > 0) out += String.fromCharCode.apply(String, tmp)
+  return out
+}
+
+export function encode(string, loose) {
+  const length = string.length
+  let lead = null
+  let small = true
+  let bytes = new Uint8Array(length) // assume ascii
+  let p = 0
+
+  for (let i = 0; i < length; i++) {
+    const code = string.charCodeAt(i)
+    if (code < 0x80) {
+      // Fast path for ascii
+      if (lead) {
+        if (!loose) throw new TypeError(E_STRICT_UNICODE)
+        bytes[p++] = 0xef
+        bytes[p++] = 0xbf
+        bytes[p++] = 0xbd
+        lead = null
+      }
+
+      bytes[p++] = code
+      // Unroll the loop a bit for faster ops
+      for (let j = 0; j < 5; j++) {
+        if (i + 1 >= length) break
+        const c1 = string.charCodeAt(i + 1)
+        if (c1 >= 0x80) break
+        bytes[p++] = c1
+        i++
+        if (i + 1 >= length) break
+        const c2 = string.charCodeAt(i + 1)
+        if (c2 >= 0x80) break
+        bytes[p++] = c2
+        i++
+        if (i + 1 >= length) break
+        const c3 = string.charCodeAt(i + 1)
+        if (c3 >= 0x80) break
+        bytes[p++] = c3
+        i++
+        if (i + 1 >= length) break
+        const c4 = string.charCodeAt(i + 1)
+        if (c4 >= 0x80) break
+        bytes[p++] = c4
+        i++
+      }
+
+      continue
+    }
+
+    if (small) {
+      // TODO: use resizable array buffers? will have to return a non-resizeable one
+      const bytesNew = new Uint8Array(length * 3) // maximium can be 3x of the string length in charcodes
+      bytesNew.set(bytes)
+      bytes = bytesNew
+      small = false
+    }
+
+    // surrogate, charcodes = [d800 + a & 3ff, dc00 + b & 3ff]; codePoint = 0x1_00_00 | (a << 10) | b
+    // lead: d800 - dbff
+    // trail: dc00 - dfff
+    if (code >= 0xd8_00 && code < 0xe0_00) {
+      if (lead && code < 0xdc_00) {
+        // a second lead, meaning the previous one was unpaired
+        if (!loose) throw new TypeError(E_STRICT_UNICODE)
+        bytes[p++] = 0xef
+        bytes[p++] = 0xbf
+        bytes[p++] = 0xbd
+        lead = null
+        // code is still processed as a new lead
+      }
+
+      if (!lead) {
+        if (code > 0xdb_ff || i + 1 >= length) {
+          // lead out of range || unpaired
+          if (!loose) throw new TypeError(E_STRICT_UNICODE)
+          bytes[p++] = 0xef
+          bytes[p++] = 0xbf
+          bytes[p++] = 0xbd
+          continue
+        }
+
+        lead = code
+        continue
+      }
+
+      // here, codePoint is always between 0x1_00_00 and 0x11_00_00, we encode as 4 bytes
+      const codePoint = (((lead - 0xd8_00) << 10) | (code - 0xdc_00)) + 0x1_00_00
+      bytes[p++] = (codePoint >> 18) | 0xf0
+      bytes[p++] = ((codePoint >> 12) & 0x3f) | 0x80
+      bytes[p++] = ((codePoint >> 6) & 0x3f) | 0x80
+      bytes[p++] = (codePoint & 0x3f) | 0x80
+      lead = null
+      continue
+    } else if (lead) {
+      if (!loose) throw new TypeError(E_STRICT_UNICODE)
+      bytes[p++] = 0xef
+      bytes[p++] = 0xbf
+      bytes[p++] = 0xbd
+      lead = null
+      // code is still processed
+    }
+
+    // We are left with a non-pair char code above ascii, it gets encoded to 2 or 3 bytes
+    if (code < 0x8_00) {
+      bytes[p++] = (code >> 6) | 0xc0
+      bytes[p++] = (code & 0x3f) | 0x80
+    } else {
+      bytes[p++] = (code >> 12) | 0xe0
+      bytes[p++] = ((code >> 6) & 0x3f) | 0x80
+      bytes[p++] = (code & 0x3f) | 0x80
+    }
+  }
+
+  return bytes.length === p ? bytes : bytes.slice(0, p)
+}

package/hex.js

@@ -1,78 +1,21 @@
-import { assertTypedArray, assert } from './assert.js'
-import { fromTypedArray } from './array.js'
+import { assertUint8 } from './assert.js'
+import { typedView } from './array.js'
+import * as js from './fallback/hex.js'
 
 const { Buffer } = globalThis // Buffer is optional, only used when native
 const haveNativeBuffer = Buffer && !Buffer.TYPED_ARRAY_SUPPORT
 const { toHex: webHex } = Uint8Array.prototype // Modern engines have this
 
-let hexArray
-let dehexArray
-
 export function toHex(arr) {
-  assertTypedArray(arr)
-  if (!(arr instanceof Uint8Array)) arr = new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength)
+  assertUint8(arr)
+  if (arr.length === 0) return ''
   if (webHex && arr.toHex === webHex) return arr.toHex()
-  if (haveNativeBuffer) {
-    if (arr.constructor === Buffer && Buffer.isBuffer(arr)) return arr.toString('hex')
-    return Buffer.from(arr.buffer, arr.byteOffset, arr.byteLength).toString('hex')
-  }
-
-  if (!hexArray) hexArray = Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'))
-  const length = arr.length // this helps Hermes
-
-  if (length > 30000) {
-    // Limit concatenation to avoid excessive GC
-    // Thresholds checked on Hermes
-    const concat = []
-    for (let i = 0; i < length; ) {
-      const step = i + 500
-      const end = step > length ? length : step
-      let chunk = ''
-      for (; i < end; i++) chunk += hexArray[arr[i]]
-      concat.push(chunk)
-    }
-
-    const res = concat.join('')
-    concat.length = 0
-    return res
-  }
-
-  let out = ''
-  for (let i = 0; i < length; i++) out += hexArray[arr[i]]
-  return out
+  if (!haveNativeBuffer) return js.toHex(arr)
+  if (arr.constructor === Buffer && Buffer.isBuffer(arr)) return arr.toString('hex')
+  return Buffer.from(arr.buffer, arr.byteOffset, arr.byteLength).toString('hex')
 }
 
 // Unlike Buffer.from(), throws on invalid input
-let fromHex
-if (Uint8Array.fromHex) {
-  fromHex = (str, format = 'uint8') => fromTypedArray(Uint8Array.fromHex(str), format)
-} else {
-  fromHex = (str, format = 'uint8') => {
-    if (typeof str !== 'string') throw new TypeError('Input is not a string')
-    assert(str.length % 2 === 0, 'Input is not a hex string')
-
-    // We don't use native Buffer impl, as rechecking input make it slower than pure js
-    // This path is used only on older engines though
-
-    if (!dehexArray) {
-      dehexArray = new Array(103) // f is 102
-      for (let i = 0; i < 16; i++) {
-        const s = i.toString(16)
-        dehexArray[s.charCodeAt(0)] = dehexArray[s.toUpperCase().charCodeAt(0)] = i
-      }
-    }
-
-    const arr = new Uint8Array(str.length / 2)
-    let j = 0
-    const length = arr.length // this helps Hermes
-    for (let i = 0; i < length; i++) {
-      const a = dehexArray[str.charCodeAt(j++)] * 16 + dehexArray[str.charCodeAt(j++)]
-      if (!a && Number.isNaN(a)) throw new Error('Input is not a hex string')
-      arr[i] = a
-    }
-
-    return fromTypedArray(arr, format)
-  }
-}
-
-export { fromHex }
+export const fromHex = Uint8Array.fromHex
+  ? (str, format = 'uint8') => typedView(Uint8Array.fromHex(str), format)
+  : (str, format = 'uint8') => typedView(js.fromHex(str), format)

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@exodus/bytes",
-  "version": "1.0.0-rc.2",
+  "version": "1.0.0-rc.4",
   "description": "Various operations on Uint8Array data",
   "scripts": {
     "lint": "eslint .",
@@ -39,17 +39,25 @@
   },
   "type": "module",
   "files": [
+    "/fallback/_utils.js",
+    "/fallback/base32.js",
+    "/fallback/base64.js",
+    "/fallback/hex.js",
+    "/fallback/utf8.js",
+    "/array.js",
     "/assert.js",
+    "/base32.js",
     "/base64.js",
-    "/array.js",
-    "/hex.js"
+    "/hex.js",
+    "/utf8.js"
   ],
   "exports": {
-    "./base64.js": "./base64.js",
     "./array.js": "./array.js",
-    "./hex.js": "./hex.js"
+    "./base32.js": "./base32.js",
+    "./base64.js": "./base64.js",
+    "./hex.js": "./hex.js",
+    "./utf8.js": "./utf8.js"
   },
-  "dependencies": {},
   "devDependencies": {
     "@exodus/eslint-config": "^5.24.0",
     "@exodus/prettier": "^1.0.0",
@@ -62,7 +70,10 @@
     "buffer": "^6.0.3",
     "electron": "36.5.0",
     "eslint": "^8.44.0",
-    "jsvu": "^3.0.0"
+    "fast-base64-decode": "^2.0.0",
+    "hi-base32": "^0.5.1",
+    "jsvu": "^3.0.0",
+    "text-encoding": "^0.7.0"
   },
   "prettier": "@exodus/prettier",
   "packageManager": "pnpm@10.12.1+sha256.889bac470ec93ccc3764488a19d6ba8f9c648ad5e50a9a6e4be3768a5de387a3"