@qelos/aidev 0.10.0 → 1.0.0

package/ui/.output/server/node_modules/@exodus/bytes/fallback/utf16.js

@@ -0,0 +1,266 @@
+import { decodeUCS2 } from './latin1.js'
+import { assertU8, E_STRING, E_STRICT_UNICODE } from './_utils.js'
+import { nativeDecoder, isLE, encodeCharcodes } from './platform.js'
+
+export const E_STRICT = 'Input is not well-formed utf16'
+const isWellFormedStr = /* @__PURE__ */ (() => String.prototype.isWellFormed)()
+const toWellFormedStr = /* @__PURE__ */ (() => String.prototype.toWellFormed)()
+
+const replacementCodepoint = 0xff_fd
+const replacementCodepointSwapped = 0xfd_ff
+
+const to16 = (a) => new Uint16Array(a.buffer, a.byteOffset, a.byteLength / 2) // Requires checked length and alignment!
+
+export function encodeApi(str, loose, format) {
+  if (typeof str !== 'string') throw new TypeError(E_STRING)
+  if (format !== 'uint16' && format !== 'uint8-le' && format !== 'uint8-be') {
+    throw new TypeError('Unknown format')
+  }
+
+  // On v8 and SpiderMonkey, check via isWellFormed is faster than js
+  // On JSC, check during loop is faster than isWellFormed
+  // If isWellFormed is available, we skip check during decoding and recheck after
+  // If isWellFormed is unavailable, we check in js during decoding
+  if (!loose && isWellFormedStr && !isWellFormedStr.call(str)) throw new TypeError(E_STRICT_UNICODE)
+  const shouldSwap = (isLE && format === 'uint8-be') || (!isLE && format === 'uint8-le')
+  const u16 = encode(str, loose, !loose && isWellFormedStr, shouldSwap)
+
+  // Bytes are already swapped and format is already checked, we need to just cast the view
+  return format === 'uint16' ? u16 : new Uint8Array(u16.buffer, u16.byteOffset, u16.byteLength)
+}
+
+const fatalLE = nativeDecoder ? new TextDecoder('utf-16le', { ignoreBOM: true, fatal: true }) : null
+const looseLE = nativeDecoder ? new TextDecoder('utf-16le', { ignoreBOM: true }) : null
+const fatalBE = nativeDecoder ? new TextDecoder('utf-16be', { ignoreBOM: true, fatal: true }) : null
+const looseBE = nativeDecoder ? new TextDecoder('utf-16be', { ignoreBOM: true }) : null
+
+export function decodeApiDecoders(input, loose, format) {
+  if (format === 'uint16') {
+    if (!(input instanceof Uint16Array)) throw new TypeError('Expected an Uint16Array')
+  } else if (format === 'uint8-le' || format === 'uint8-be') {
+    assertU8(input)
+    if (input.byteLength % 2 !== 0) throw new TypeError('Expected even number of bytes')
+  } else {
+    throw new TypeError('Unknown format')
+  }
+
+  const le = format === 'uint8-le' || (format === 'uint16' && isLE)
+  return (le ? (loose ? looseLE : fatalLE) : loose ? looseBE : fatalBE).decode(input)
+}
+
+export function decodeApiJS(input, loose, format) {
+  let u16
+  switch (format) {
+    case 'uint16':
+      if (!(input instanceof Uint16Array)) throw new TypeError('Expected an Uint16Array')
+      u16 = input
+      break
+    case 'uint8-le':
+      assertU8(input)
+      if (input.byteLength % 2 !== 0) throw new TypeError('Expected even number of bytes')
+      u16 = to16input(input, true)
+      break
+    case 'uint8-be':
+      assertU8(input)
+      if (input.byteLength % 2 !== 0) throw new TypeError('Expected even number of bytes')
+      u16 = to16input(input, false)
+      break
+    default:
+      throw new TypeError('Unknown format')
+  }
+
+  const str = decode(u16, loose, (!loose && isWellFormedStr) || (loose && toWellFormedStr))
+  if (!loose && isWellFormedStr && !isWellFormedStr.call(str)) throw new TypeError(E_STRICT)
+  if (loose && toWellFormedStr) return toWellFormedStr.call(str)
+
+  return str
+}
+
+export function to16input(u8, le) {
+  // Assume even number of bytes
+  if (le === isLE) return to16(u8.byteOffset % 2 === 0 ? u8 : Uint8Array.from(u8))
+  return to16(swap16(Uint8Array.from(u8)))
+}
+
+export const decode = (u16, loose = false, checked = false) => {
+  if (checked || isWellFormed(u16)) return decodeUCS2(u16)
+  if (!loose) throw new TypeError(E_STRICT)
+  return decodeUCS2(toWellFormed(Uint16Array.from(u16))) // cloned for replacement
+}
+
+export function encode(str, loose = false, checked = false, swapped = false) {
+  const arr = new Uint16Array(str.length)
+  if (checked) return swapped ? encodeCheckedSwapped(str, arr) : encodeChecked(str, arr)
+  return swapped ? encodeUncheckedSwapped(str, arr, loose) : encodeUnchecked(str, arr, loose)
+}
+
+/* eslint-disable @exodus/mutable/no-param-reassign-prop-only */
+
+// Assumes checked length % 2 === 0, otherwise does not swap tail
+function swap16(u8) {
+  let i = 0
+  for (const last3 = u8.length - 3; i < last3; i += 4) {
+    const x0 = u8[i]
+    const x1 = u8[i + 1]
+    const x2 = u8[i + 2]
+    const x3 = u8[i + 3]
+    u8[i] = x1
+    u8[i + 1] = x0
+    u8[i + 2] = x3
+    u8[i + 3] = x2
+  }
+
+  for (const last = u8.length - 1; i < last; i += 2) {
+    const x0 = u8[i]
+    const x1 = u8[i + 1]
+    u8[i] = x1
+    u8[i + 1] = x0
+  }
+
+  return u8
+}
+
+// Splitting paths into small functions helps (at least on SpiderMonkey)
+
+const encodeChecked = (str, arr) => encodeCharcodes(str, arr) // Same as encodeLatin1, but with Uint16Array
+
+function encodeCheckedSwapped(str, arr) {
+  // TODO: faster path for Hermes? See encodeCharcodes
+  const length = str.length
+  for (let i = 0; i < length; i++) {
+    const x = str.charCodeAt(i)
+    arr[i] = ((x & 0xff) << 8) | (x >> 8)
+  }
+
+  return arr
+}
+
+// lead: d800 - dbff, trail: dc00 - dfff
+
+function encodeUnchecked(str, arr, loose = false) {
+  // TODO: faster path for Hermes? See encodeCharcodes
+  const length = str.length
+  for (let i = 0; i < length; i++) {
+    const code = str.charCodeAt(i)
+    arr[i] = code
+    if (code >= 0xd8_00 && code < 0xe0_00) {
+      // An unexpected trail or a lead at the very end of input
+      if (code > 0xdb_ff || i + 1 >= length) {
+        if (!loose) throw new TypeError(E_STRICT_UNICODE)
+        arr[i] = replacementCodepoint
+      } else {
+        const next = str.charCodeAt(i + 1) // Process valid pairs immediately
+        if (next < 0xdc_00 || next >= 0xe0_00) {
+          if (!loose) throw new TypeError(E_STRICT_UNICODE)
+          arr[i] = replacementCodepoint
+        } else {
+          i++ // consume next
+          arr[i] = next
+        }
+      }
+    }
+  }
+
+  return arr
+}
+
+function encodeUncheckedSwapped(str, arr, loose = false) {
+  // TODO: faster path for Hermes? See encodeCharcodes
+  const length = str.length
+  for (let i = 0; i < length; i++) {
+    const code = str.charCodeAt(i)
+    arr[i] = ((code & 0xff) << 8) | (code >> 8)
+    if (code >= 0xd8_00 && code < 0xe0_00) {
+      // An unexpected trail or a lead at the very end of input
+      if (code > 0xdb_ff || i + 1 >= length) {
+        if (!loose) throw new TypeError(E_STRICT_UNICODE)
+        arr[i] = replacementCodepointSwapped
+      } else {
+        const next = str.charCodeAt(i + 1) // Process valid pairs immediately
+        if (next < 0xdc_00 || next >= 0xe0_00) {
+          if (!loose) throw new TypeError(E_STRICT_UNICODE)
+          arr[i] = replacementCodepointSwapped
+        } else {
+          i++ // consume next
+          arr[i] = ((next & 0xff) << 8) | (next >> 8)
+        }
+      }
+    }
+  }
+
+  return arr
+}
+
+// Only needed on Hermes, everything else has native impl
+export function toWellFormed(u16) {
+  const length = u16.length
+  for (let i = 0; i < length; i++) {
+    const code = u16[i]
+    if (code >= 0xd8_00 && code < 0xe0_00) {
+      // An unexpected trail or a lead at the very end of input
+      if (code > 0xdb_ff || i + 1 >= length) {
+        u16[i] = replacementCodepoint
+      } else {
+        const next = u16[i + 1] // Process valid pairs immediately
+        if (next < 0xdc_00 || next >= 0xe0_00) {
+          u16[i] = replacementCodepoint
+        } else {
+          i++ // consume next
+        }
+      }
+    }
+  }
+
+  return u16
+}
+
+// Only needed on Hermes, everything else has native impl
+export function isWellFormed(u16) {
+  const length = u16.length
+  let i = 0
+
+  const m = 0x80_00_80_00
+  const l = 0xd8_00
+  const h = 0xe0_00
+
+  // Speedup with u32, by skipping to the first surrogate
+  // Only implemented for aligned input for now, but almost all input is aligned (pooled Buffer or 0 offset)
+  if (length > 32 && u16.byteOffset % 4 === 0) {
+    const u32length = (u16.byteLength / 4) | 0
+    const u32 = new Uint32Array(u16.buffer, u16.byteOffset, u32length)
+    for (const last3 = u32length - 3; ; i += 4) {
+      if (i >= last3) break // loop is fast enough for moving this here to be _very_ useful, likely due to array access checks
+      const a = u32[i]
+      const b = u32[i + 1]
+      const c = u32[i + 2]
+      const d = u32[i + 3]
+      if (a & m || b & m || c & m || d & m) break // bitwise OR does not make this faster on Hermes
+    }
+
+    for (; i < u32length; i++) if (u32[i] & m) break
+    i *= 2
+  }
+
+  // An extra loop gives ~30-40% speedup e.g. on English text without surrogates but with other symbols above 0x80_00
+  for (const last3 = length - 3; ; i += 4) {
+    if (i >= last3) break
+    const a = u16[i]
+    const b = u16[i + 1]
+    const c = u16[i + 2]
+    const d = u16[i + 3]
+    if ((a >= l && a < h) || (b >= l && b < h) || (c >= l && c < h) || (d >= l && d < h)) break
+  }
+
+  for (; i < length; i++) {
+    const code = u16[i]
+    if (code >= l && code < h) {
+      // An unexpected trail or a lead at the very end of input
+      if (code >= 0xdc_00 || i + 1 >= length) return false
+      i++ // consume next
+      const next = u16[i] // Process valid pairs immediately
+      if (next < 0xdc_00 || next >= h) return false
+    }
+  }
+
+  return true
+}

package/ui/.output/server/node_modules/@exodus/bytes/fallback/utf8.auto.js

@@ -0,0 +1 @@
+export { decodeFast, encode } from './utf8.js'

package/ui/.output/server/node_modules/@exodus/bytes/fallback/utf8.js

@@ -0,0 +1,270 @@
+import { E_STRICT_UNICODE } from './_utils.js'
+import { isHermes } from './platform.js'
+import { asciiPrefix, decodeLatin1, encodeAsciiPrefix } from './latin1.js'
+
+export const E_STRICT = 'Input is not well-formed utf8'
+
+const replacementPoint = 0xff_fd
+const shouldUseEscapePath = isHermes // faster only on Hermes, js path beats it on normal engines
+const { decodeURIComponent, escape } = globalThis
+
+export function decodeFast(arr, loose) {
+  // Fast path for ASCII prefix, this is faster than all alternatives below
+  const prefix = decodeLatin1(arr, 0, asciiPrefix(arr)) // No native decoder to use, so decodeAscii is useless here
+  if (prefix.length === arr.length) return prefix
+
+  // This codepath gives a ~3x perf boost on Hermes
+  if (shouldUseEscapePath && escape && decodeURIComponent) {
+    const o = escape(decodeLatin1(arr, prefix.length, arr.length))
+    try {
+      return prefix + decodeURIComponent(o) // Latin1 to utf8
+    } catch {
+      if (!loose) throw new TypeError(E_STRICT)
+      // Ok, we have to use manual implementation for loose decoder
+    }
+  }
+
+  return prefix + decode(arr, loose, prefix.length)
+}
+
+// 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, start = 0) {
+  start |= 0
+  const end = arr.length
+  let out = ''
+  const chunkSize = 0x2_00 // far below MAX_ARGUMENTS_LENGTH in npmjs.com/buffer, we use smaller chunks
+  const tmpSize = Math.min(end - start, chunkSize + 1) // need 1 extra slot for last codepoint, which can be 2 charcodes
+  const tmp = new Array(tmpSize).fill(0)
+  let ti = 0
+
+  for (let i = start; i < end; i++) {
+    if (ti >= chunkSize) {
+      tmp.length = ti // can be larger by 1 if last codepoint is two charcodes
+      out += String.fromCharCode.apply(String, tmp)
+      if (tmp.length <= chunkSize) tmp.push(0) // restore 1 extra slot for last codepoint
+      ti = 0
+    }
+
+    const byte = arr[i]
+    if (byte < 0x80) {
+      tmp[ti++] = byte
+      // ascii fast path is in decodeFast(), this is called only on non-ascii input
+      // so we don't unroll this anymore
+    } else if (byte < 0xc2) {
+      if (!loose) throw new TypeError(E_STRICT)
+      tmp[ti++] = replacementPoint
+    } else if (byte < 0xe0) {
+      // need 1 more
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = replacementPoint
+        break
+      }
+
+      const byte1 = arr[i + 1]
+      if (byte1 < 0x80 || byte1 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = replacementPoint
+        continue
+      }
+
+      i++
+      tmp[ti++] = ((byte & 0x1f) << 6) | (byte1 & 0x3f)
+    } else if (byte < 0xf0) {
+      // need 2 more
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = 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[ti++] = replacementPoint
+        continue
+      }
+
+      i++
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = replacementPoint
+        break
+      }
+
+      const byte2 = arr[i + 1]
+      if (byte2 < 0x80 || byte2 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = replacementPoint
+        continue
+      }
+
+      i++
+      tmp[ti++] = ((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[ti++] = 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[ti++] = replacementPoint
+        continue
+      }
+
+      i++
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = replacementPoint
+        break
+      }
+
+      const byte2 = arr[i + 1]
+      if (byte2 < 0x80 || byte2 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = replacementPoint
+        continue
+      }
+
+      i++
+      if (i + 1 >= end) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = replacementPoint
+        break
+      }
+
+      const byte3 = arr[i + 1]
+      if (byte3 < 0x80 || byte3 > 0xbf) {
+        if (!loose) throw new TypeError(E_STRICT)
+        tmp[ti++] = 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[ti++] = 0xd8_00 + ((u >> 10) & 0x3_ff)
+        tmp[ti++] = 0xdc_00 + (u & 0x3_ff)
+      } else {
+        tmp[ti++] = codePoint
+      }
+      // eslint-disable-next-line sonarjs/no-duplicated-branches
+    } else {
+      if (!loose) throw new TypeError(E_STRICT)
+      tmp[ti++] = replacementPoint
+    }
+  }
+
+  if (ti === 0) return out
+  tmp.length = ti
+  return out + String.fromCharCode.apply(String, tmp)
+}
+
+export function encode(string, loose) {
+  const length = string.length
+  let small = true
+  let bytes = new Uint8Array(length) // assume ascii
+
+  let i = encodeAsciiPrefix(bytes, string)
+  let p = i
+  for (; i < length; i++) {
+    let code = string.charCodeAt(i)
+    if (code < 0x80) {
+      bytes[p++] = code
+      // Unroll the loop a bit for faster ops
+      while (true) {
+        i++
+        if (i >= length) break
+        code = string.charCodeAt(i)
+        if (code >= 0x80) break
+        bytes[p++] = code
+        i++
+        if (i >= length) break
+        code = string.charCodeAt(i)
+        if (code >= 0x80) break
+        bytes[p++] = code
+        i++
+        if (i >= length) break
+        code = string.charCodeAt(i)
+        if (code >= 0x80) break
+        bytes[p++] = code
+        i++
+        if (i >= length) break
+        code = string.charCodeAt(i)
+        if (code >= 0x80) break
+        bytes[p++] = code
+      }
+
+      if (i >= length) break
+      // now, code is present and >= 0x80
+    }
+
+    if (small) {
+      // TODO: use resizable array buffers? will have to return a non-resizeable one
+      if (p !== i) /* c8 ignore next */ throw new Error('Unreachable') // Here, p === i (only when small is still true)
+      const bytesNew = new Uint8Array(p + (length - i) * 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) {
+      // Can't be a valid trail as we already processed that below
+
+      if (code > 0xdb_ff || i + 1 >= length) {
+        // An unexpected trail or a lead at the very end of input
+        if (!loose) throw new TypeError(E_STRICT_UNICODE)
+        bytes[p++] = 0xef
+        bytes[p++] = 0xbf
+        bytes[p++] = 0xbd
+        continue
+      }
+
+      const next = string.charCodeAt(i + 1) // Process valid pairs immediately
+      if (next >= 0xdc_00 && next < 0xe0_00) {
+        // here, codePoint is always between 0x1_00_00 and 0x11_00_00, we encode as 4 bytes
+        const codePoint = (((code - 0xd8_00) << 10) | (next - 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
+        i++ // consume next
+      } else {
+        // Next is not a trail, leave next unconsumed but process unmatched lead error
+        if (!loose) throw new TypeError(E_STRICT_UNICODE)
+        bytes[p++] = 0xef
+        bytes[p++] = 0xbf
+        bytes[p++] = 0xbd
+      }
+
+      continue
+    }
+
+    // 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/ui/.output/server/node_modules/@exodus/bytes/multi-byte.js

@@ -0,0 +1,19 @@
+import { assertU8 } from './fallback/_utils.js'
+import { multibyteDecoder, multibyteEncoder } from './fallback/multi-byte.js'
+
+export function createMultibyteDecoder(encoding, loose = false) {
+  const jsDecoder = multibyteDecoder(encoding, loose) // asserts
+  let streaming = false
+  return (arr, stream = false) => {
+    assertU8(arr)
+    if (!streaming && arr.byteLength === 0) return ''
+    streaming = stream
+    return jsDecoder(arr, stream)
+  }
+}
+
+export function createMultibyteEncoder(encoding, { mode = 'fatal' } = {}) {
+  // TODO: replacement, truncate (replacement will need varying length)
+  if (mode !== 'fatal') throw new Error('Unsupported mode')
+  return multibyteEncoder(encoding) // asserts
+}

package/ui/.output/server/node_modules/@exodus/bytes/multi-byte.node.js

@@ -0,0 +1,29 @@
+import { assertU8, toBuf } from './fallback/_utils.js'
+import { isDeno } from './fallback/platform.js'
+import { isAsciiSuperset, multibyteDecoder, multibyteEncoder } from './fallback/multi-byte.js'
+import { isAscii } from 'node:buffer'
+
+export function createMultibyteDecoder(encoding, loose = false) {
+  const jsDecoder = multibyteDecoder(encoding, loose) // asserts
+  let streaming = false
+  const asciiSuperset = isAsciiSuperset(encoding)
+  return (arr, stream = false) => {
+    assertU8(arr)
+    if (!streaming) {
+      if (arr.byteLength === 0) return ''
+      if (asciiSuperset && isAscii(arr)) {
+        if (isDeno) return toBuf(arr).toString()
+        return toBuf(arr).latin1Slice(0, arr.byteLength) // .latin1Slice is faster than .asciiSlice
+      }
+    }
+
+    streaming = stream
+    return jsDecoder(arr, stream)
+  }
+}
+
+export function createMultibyteEncoder(encoding, { mode = 'fatal' } = {}) {
+  // TODO: replacement, truncate (replacement will need varying length)
+  if (mode !== 'fatal') throw new Error('Unsupported mode')
+  return multibyteEncoder(encoding) // asserts
+}