orcaq 1.0.33 → 1.1.2

package/.output/server/node_modules/long/umd/package.json

@@ -0,0 +1,3 @@
+{
+  "type": "commonjs"
+}

package/.output/server/node_modules/lru.min/lib/index.js

@@ -0,0 +1,248 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createLRU = void 0;
+const createLRU = (options) => {
+    let { max } = options;
+    if (!(Number.isInteger(max) && max > 0))
+        throw new TypeError('`max` must be a positive integer');
+    let size = 0;
+    let head = 0;
+    let tail = 0;
+    let free = [];
+    const { onEviction } = options;
+    const keyMap = new Map();
+    const keyList = new Array(max).fill(undefined);
+    const valList = new Array(max).fill(undefined);
+    const next = new Array(max).fill(0);
+    const prev = new Array(max).fill(0);
+    const linkTail = (index) => {
+        next[tail] = index;
+        prev[index] = tail;
+        next[index] = 0;
+        tail = index;
+    };
+    const moveToTail = (index) => {
+        if (index === tail)
+            return;
+        const nextIndex = next[index];
+        const prevIndex = prev[index];
+        if (index === head)
+            head = nextIndex;
+        else
+            next[prevIndex] = nextIndex;
+        prev[nextIndex] = prevIndex;
+        linkTail(index);
+    };
+    const _shrink = (newMax) => {
+        let current = tail;
+        const preserve = Math.min(size, newMax);
+        const remove = size - preserve;
+        const newKeyList = new Array(preserve);
+        const newValList = new Array(preserve);
+        for (let i = 0; i < remove; i++) {
+            const key = keyList[head];
+            onEviction === null || onEviction === void 0 ? void 0 : onEviction(key, valList[head]);
+            keyMap.delete(key);
+            head = next[head];
+        }
+        for (let i = preserve - 1; i >= 0; i--) {
+            newKeyList[i] = keyList[current];
+            newValList[i] = valList[current];
+            keyMap.set(keyList[current], i);
+            current = prev[current];
+        }
+        head = 0;
+        tail = preserve - 1;
+        size = preserve;
+        keyList.length = newMax;
+        valList.length = newMax;
+        next.length = newMax;
+        prev.length = newMax;
+        for (let i = 0; i < preserve; i++) {
+            keyList[i] = newKeyList[i];
+            valList[i] = newValList[i];
+            next[i] = i + 1;
+            prev[i] = i - 1;
+        }
+        free = [];
+        for (let i = preserve; i < newMax; i++)
+            free.push(i);
+    };
+    const _grow = (newMax) => {
+        keyList.length = newMax;
+        valList.length = newMax;
+        next.length = newMax;
+        prev.length = newMax;
+        keyList.fill(undefined, max);
+        valList.fill(undefined, max);
+        next.fill(0, max);
+        prev.fill(0, max);
+    };
+    return {
+        /** Adds a key-value pair to the cache. Updates the value if the key already exists. */
+        set(key, value) {
+            if (key === undefined)
+                return;
+            let index = keyMap.get(key);
+            if (index === undefined) {
+                if (size === max) {
+                    index = head;
+                    const evictKey = keyList[index];
+                    onEviction === null || onEviction === void 0 ? void 0 : onEviction(evictKey, valList[index]);
+                    keyMap.delete(evictKey);
+                    head = next[index];
+                    prev[head] = 0;
+                }
+                else {
+                    index = free.length > 0 ? free.pop() : size;
+                    size++;
+                }
+                keyMap.set(key, index);
+                keyList[index] = key;
+                valList[index] = value;
+                if (size === 1)
+                    head = tail = index;
+                else
+                    linkTail(index);
+            }
+            else {
+                onEviction === null || onEviction === void 0 ? void 0 : onEviction(key, valList[index]);
+                valList[index] = value;
+                moveToTail(index);
+            }
+        },
+        /** Retrieves the value for a given key and moves the key to the most recent position. */
+        get(key) {
+            const index = keyMap.get(key);
+            if (index === undefined)
+                return;
+            if (index !== tail)
+                moveToTail(index);
+            return valList[index];
+        },
+        /** Retrieves the value for a given key without changing its position. */
+        peek: (key) => {
+            const index = keyMap.get(key);
+            return index !== undefined ? valList[index] : undefined;
+        },
+        /** Checks if a key exists in the cache. */
+        has: (key) => keyMap.has(key),
+        /** Iterates over all keys in the cache, from most recent to least recent. */
+        *keys() {
+            let current = tail;
+            for (let i = 0; i < size; i++) {
+                yield keyList[current];
+                current = prev[current];
+            }
+        },
+        /** Iterates over all values in the cache, from most recent to least recent. */
+        *values() {
+            let current = tail;
+            for (let i = 0; i < size; i++) {
+                yield valList[current];
+                current = prev[current];
+            }
+        },
+        /** Iterates over `[key, value]` pairs in the cache, from most recent to least recent. */
+        *entries() {
+            let current = tail;
+            for (let i = 0; i < size; i++) {
+                yield [keyList[current], valList[current]];
+                current = prev[current];
+            }
+        },
+        /** Iterates over each value-key pair in the cache, from most recent to least recent. */
+        forEach: (callback) => {
+            let current = tail;
+            for (let i = 0; i < size; i++) {
+                const key = keyList[current];
+                const value = valList[current];
+                callback(value, key);
+                current = prev[current];
+            }
+        },
+        /** Deletes a key-value pair from the cache. */
+        delete(key) {
+            const index = keyMap.get(key);
+            if (index === undefined)
+                return false;
+            onEviction === null || onEviction === void 0 ? void 0 : onEviction(key, valList[index]);
+            keyMap.delete(key);
+            free.push(index);
+            keyList[index] = undefined;
+            valList[index] = undefined;
+            const prevIndex = prev[index];
+            const nextIndex = next[index];
+            if (index === head)
+                head = nextIndex;
+            else
+                next[prevIndex] = nextIndex;
+            if (index === tail)
+                tail = prevIndex;
+            else
+                prev[nextIndex] = prevIndex;
+            size--;
+            return true;
+        },
+        /** Evicts the oldest item or the specified number of the oldest items from the cache. */
+        evict: (number) => {
+            let toPrune = Math.min(number, size);
+            while (toPrune > 0) {
+                const evictHead = head;
+                const key = keyList[evictHead];
+                onEviction === null || onEviction === void 0 ? void 0 : onEviction(key, valList[evictHead]);
+                keyMap.delete(key);
+                keyList[evictHead] = undefined;
+                valList[evictHead] = undefined;
+                head = next[evictHead];
+                prev[head] = 0;
+                size--;
+                free.push(evictHead);
+                toPrune--;
+            }
+            if (size === 0)
+                head = tail = 0;
+        },
+        /** Clears all key-value pairs from the cache. */
+        clear() {
+            if (onEviction) {
+                let current = head;
+                for (let i = 0; i < size; i++) {
+                    onEviction(keyList[current], valList[current]);
+                    current = next[current];
+                }
+            }
+            keyMap.clear();
+            keyList.fill(undefined);
+            valList.fill(undefined);
+            free = [];
+            size = 0;
+            head = tail = 0;
+        },
+        /** Resizes the cache to a new maximum size, evicting items if necessary. */
+        resize: (newMax) => {
+            if (!(Number.isInteger(newMax) && newMax > 0))
+                throw new TypeError('`max` must be a positive integer');
+            if (newMax === max)
+                return;
+            if (newMax < max)
+                _shrink(newMax);
+            else
+                _grow(newMax);
+            max = newMax;
+        },
+        /** Returns the maximum number of items that can be stored in the cache. */
+        get max() {
+            return max;
+        },
+        /** Returns the number of items currently stored in the cache. */
+        get size() {
+            return size;
+        },
+        /** Returns the number of currently available slots in the cache before reaching the maximum size. */
+        get available() {
+            return max - size;
+        },
+    };
+};
+exports.createLRU = createLRU;

package/.output/server/node_modules/lru.min/package.json

@@ -0,0 +1,87 @@
+{
+  "name": "lru.min",
+  "version": "1.1.4",
+  "description": "🔥 An extremely fast and efficient LRU cache for JavaScript with high compatibility (including Browsers).",
+  "main": "./lib/index.js",
+  "module": "./lib/index.mjs",
+  "types": "./lib/index.d.ts",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/wellwelwel/lru.min.git"
+  },
+  "bugs": {
+    "url": "https://github.com/wellwelwel/lru.min/issues"
+  },
+  "author": "https://github.com/wellwelwel",
+  "funding": {
+    "type": "github",
+    "url": "https://github.com/sponsors/wellwelwel"
+  },
+  "files": [
+    "browser",
+    "lib"
+  ],
+  "engines": {
+    "node": ">=8.0.0",
+    "bun": ">=1.0.0",
+    "deno": ">=1.30.0"
+  },
+  "scripts": {
+    "benchmark:esm": "cd benchmark && npm ci && node index.mjs",
+    "benchmark:cjs": "cd benchmark && npm ci && node index.cjs",
+    "build:browser": "tsx tools/browserfy.ts",
+    "build:esm": "esbuild src/index.ts --outfile=lib/index.mjs --platform=node --target=node12 --format=esm",
+    "build": "rm -rf ./browser ./lib && tsc && npm run build:esm && npm run build:browser",
+    "test:node": "poku",
+    "test:bun": "bun poku",
+    "test:deno": "deno run -A npm:poku",
+    "test:coverage": "mcr --import tsx --config mcr.config.ts npm run test:node",
+    "lint": "npx @biomejs/biome lint && prettier --check .",
+    "lint:fix": "npx @biomejs/biome lint --write && prettier --write .github/workflows/*.yml .",
+    "update": "pu minor && npm i && (npm audit fix || true) && npm run lint:fix",
+    "size": "ls -lh lib/index.mjs | awk '{print $5}'"
+  },
+  "devDependencies": {
+    "@babel/core": "^7.29.0",
+    "@babel/preset-env": "^7.29.0",
+    "@biomejs/biome": "^1.9.4",
+    "@types/babel__core": "^7.20.5",
+    "@types/node": "^24.10.9",
+    "esbuild": "^0.27.2",
+    "monocart-coverage-reports": "^2.12.9",
+    "packages-update": "^2.0.0",
+    "poku": "^3.0.3-canary.13a996a9",
+    "prettier": "^3.8.1",
+    "terser": "^5.46.0",
+    "tsx": "^4.21.0",
+    "typescript": "^5.9.3"
+  },
+  "exports": {
+    ".": {
+      "import": {
+        "types": "./lib/index.d.ts",
+        "default": "./lib/index.mjs"
+      },
+      "require": {
+        "types": "./lib/index.d.ts",
+        "default": "./lib/index.js"
+      }
+    }
+  },
+  "keywords": [
+    "lru",
+    "cache",
+    "caching",
+    "hash",
+    "node",
+    "nodejs",
+    "bun",
+    "deno",
+    "typescript",
+    "browser",
+    "fast",
+    "lru-cache",
+    "quick-lru"
+  ]
+}

package/.output/server/node_modules/mysql2/index.js

@@ -0,0 +1,77 @@
+'use strict';
+
+const SqlString = require('sql-escaper');
+
+const ConnectionConfig = require('./lib/connection_config.js');
+const parserCache = require('./lib/parsers/parser_cache.js');
+
+const Connection = require('./lib/connection.js');
+
+exports.createConnection = require('./lib/create_connection.js');
+exports.connect = exports.createConnection;
+exports.Connection = Connection;
+exports.ConnectionConfig = ConnectionConfig;
+
+const Pool = require('./lib/pool.js');
+const PoolCluster = require('./lib/pool_cluster.js');
+const createPool = require('./lib/create_pool.js');
+const createPoolCluster = require('./lib/create_pool_cluster.js');
+
+exports.createPool = createPool;
+
+exports.createPoolCluster = createPoolCluster;
+
+exports.createQuery = Connection.createQuery;
+
+exports.Pool = Pool;
+
+exports.PoolCluster = PoolCluster;
+
+exports.createServer = function (handler) {
+  const Server = require('./lib/server.js');
+  const s = new Server();
+  if (handler) {
+    s.on('connection', handler);
+  }
+  return s;
+};
+
+exports.PoolConnection = require('./lib/pool_connection.js');
+exports.authPlugins = require('./lib/auth_plugins');
+exports.escape = SqlString.escape;
+exports.escapeId = SqlString.escapeId;
+exports.format = SqlString.format;
+exports.raw = SqlString.raw;
+
+exports.__defineGetter__(
+  'createConnectionPromise',
+  () => require('./promise.js').createConnection
+);
+
+exports.__defineGetter__(
+  'createPoolPromise',
+  () => require('./promise.js').createPool
+);
+
+exports.__defineGetter__(
+  'createPoolClusterPromise',
+  () => require('./promise.js').createPoolCluster
+);
+
+exports.__defineGetter__('Types', () => require('./lib/constants/types.js'));
+
+exports.__defineGetter__('Charsets', () =>
+  require('./lib/constants/charsets.js')
+);
+
+exports.__defineGetter__('CharsetToEncoding', () =>
+  require('./lib/constants/charset_encodings.js')
+);
+
+exports.setMaxParserCache = function (max) {
+  parserCache.setMaxCache(max);
+};
+
+exports.clearParserCache = function () {
+  parserCache.clearCache();
+};

package/.output/server/node_modules/mysql2/lib/auth_41.js

@@ -0,0 +1,95 @@
+'use strict';
+
+/*
+4.1 authentication: (http://bazaar.launchpad.net/~mysql/mysql-server/5.5/view/head:/sql/password.c)
+
+  SERVER:  public_seed=create_random_string()
+           send(public_seed)
+
+  CLIENT:  recv(public_seed)
+           hash_stage1=sha1("password")
+           hash_stage2=sha1(hash_stage1)
+           reply=xor(hash_stage1, sha1(public_seed,hash_stage2)
+
+           // this three steps are done in scramble()
+
+           send(reply)
+
+
+  SERVER:  recv(reply)
+           hash_stage1=xor(reply, sha1(public_seed,hash_stage2))
+           candidate_hash2=sha1(hash_stage1)
+           check(candidate_hash2==hash_stage2)
+
+server stores sha1(sha1(password)) ( hash_stag2)
+*/
+
+const crypto = require('crypto');
+
+function sha1(msg, msg1, msg2) {
+  const hash = crypto.createHash('sha1');
+  hash.update(msg);
+  if (msg1) {
+    hash.update(msg1);
+  }
+
+  if (msg2) {
+    hash.update(msg2);
+  }
+
+  return hash.digest();
+}
+
+function xor(a, b) {
+  const result = Buffer.allocUnsafe(a.length);
+  for (let i = 0; i < a.length; i++) {
+    result[i] = a[i] ^ b[i];
+  }
+  return result;
+}
+
+exports.xor = xor;
+
+function token(password, scramble1, scramble2) {
+  if (!password) {
+    return Buffer.alloc(0);
+  }
+  const stage1 = sha1(password);
+  return exports.calculateTokenFromPasswordSha(stage1, scramble1, scramble2);
+}
+
+exports.calculateTokenFromPasswordSha = function (
+  passwordSha,
+  scramble1,
+  scramble2
+) {
+  // we use AUTH 41 here, and we need only the bytes we just need.
+  const authPluginData1 = scramble1.slice(0, 8);
+  const authPluginData2 = scramble2.slice(0, 12);
+  const stage2 = sha1(passwordSha);
+  const stage3 = sha1(authPluginData1, authPluginData2, stage2);
+  return xor(stage3, passwordSha);
+};
+
+exports.calculateToken = token;
+
+exports.verifyToken = function (publicSeed1, publicSeed2, token, doubleSha) {
+  const hashStage1 = xor(token, sha1(publicSeed1, publicSeed2, doubleSha));
+  const candidateHash2 = sha1(hashStage1);
+  return candidateHash2.compare(doubleSha) === 0;
+};
+
+exports.doubleSha1 = function (password) {
+  return sha1(sha1(password));
+};
+
+function xorRotating(a, seed) {
+  const result = Buffer.allocUnsafe(a.length);
+  const seedLen = seed.length;
+
+  for (let i = 0; i < a.length; i++) {
+    result[i] = a[i] ^ seed[i % seedLen];
+  }
+  return result;
+}
+exports.xorRotating = xorRotating;

package/.output/server/node_modules/mysql2/lib/auth_plugins/caching_sha2_password.js

@@ -0,0 +1,115 @@
+'use strict';
+
+// https://mysqlserverteam.com/mysql-8-0-4-new-default-authentication-plugin-caching_sha2_password/
+
+const PLUGIN_NAME = 'caching_sha2_password';
+const crypto = require('crypto');
+const { xor, xorRotating } = require('../auth_41');
+
+const REQUEST_SERVER_KEY_PACKET = Buffer.from([2]);
+const FAST_AUTH_SUCCESS_PACKET = Buffer.from([3]);
+const PERFORM_FULL_AUTHENTICATION_PACKET = Buffer.from([4]);
+
+const STATE_INITIAL = 0;
+const STATE_TOKEN_SENT = 1;
+const STATE_WAIT_SERVER_KEY = 2;
+const STATE_FINAL = -1;
+
+function sha256(msg) {
+  const hash = crypto.createHash('sha256');
+  hash.update(msg);
+  return hash.digest();
+}
+
+function calculateToken(password, scramble) {
+  if (!password) {
+    return Buffer.alloc(0);
+  }
+  const stage1 = sha256(Buffer.from(password));
+  const stage2 = sha256(stage1);
+  const stage3 = sha256(Buffer.concat([stage2, scramble]));
+  return xor(stage1, stage3);
+}
+
+function encrypt(password, scramble, key) {
+  const stage1 = xorRotating(Buffer.from(`${password}\0`, 'utf8'), scramble);
+  return crypto.publicEncrypt(
+    {
+      key,
+      oaepHash: 'sha1',
+      padding: crypto.constants.RSA_PKCS1_OAEP_PADDING,
+    },
+    stage1
+  );
+}
+
+const pluginFactory =
+  (pluginOptions = {}) =>
+  ({ connection }) => {
+    let state = 0;
+    let scramble = null;
+
+    const password = connection.config.password;
+
+    const authWithKey = (serverKey) => {
+      const _password = encrypt(password, scramble, serverKey);
+      state = STATE_FINAL;
+      return _password;
+    };
+
+    return (data) => {
+      switch (state) {
+        case STATE_INITIAL:
+          scramble = data.slice(0, 20);
+          state = STATE_TOKEN_SENT;
+          return calculateToken(password, scramble);
+
+        case STATE_TOKEN_SENT:
+          if (FAST_AUTH_SUCCESS_PACKET.equals(data)) {
+            state = STATE_FINAL;
+            return null;
+          }
+
+          if (PERFORM_FULL_AUTHENTICATION_PACKET.equals(data)) {
+            const isSecureConnection =
+              typeof pluginOptions.overrideIsSecure === 'undefined'
+                ? connection.config.ssl || connection.config.socketPath
+                : pluginOptions.overrideIsSecure;
+            if (isSecureConnection) {
+              state = STATE_FINAL;
+              return Buffer.from(`${password}\0`, 'utf8');
+            }
+
+            // if client provides key we can save one extra roundrip on first connection
+            if (pluginOptions.serverPublicKey) {
+              return authWithKey(pluginOptions.serverPublicKey);
+            }
+
+            state = STATE_WAIT_SERVER_KEY;
+            return REQUEST_SERVER_KEY_PACKET;
+          }
+          throw new Error(
+            `Invalid AuthMoreData packet received by ${PLUGIN_NAME} plugin in STATE_TOKEN_SENT state.`
+          );
+        case STATE_WAIT_SERVER_KEY:
+          if (pluginOptions.onServerPublicKey) {
+            pluginOptions.onServerPublicKey(data);
+          }
+          return authWithKey(data);
+        case STATE_FINAL:
+          throw new Error(
+            `Unexpected data in AuthMoreData packet received by ${PLUGIN_NAME} plugin in STATE_FINAL state.`
+          );
+      }
+
+      throw new Error(
+        `Unexpected data in AuthMoreData packet received by ${PLUGIN_NAME} plugin in state ${state}`
+      );
+    };
+  };
+
+// Export the plugin factory as default
+module.exports = pluginFactory;
+
+// Export calculateToken for reuse in initial handshake optimization
+module.exports.calculateToken = calculateToken;

package/.output/server/node_modules/mysql2/lib/auth_plugins/index.js

@@ -0,0 +1,8 @@
+'use strict';
+
+module.exports = {
+  caching_sha2_password: require('./caching_sha2_password'),
+  mysql_clear_password: require('./mysql_clear_password'),
+  mysql_native_password: require('./mysql_native_password'),
+  sha256_password: require('./sha256_password'),
+};

package/.output/server/node_modules/mysql2/lib/auth_plugins/mysql_clear_password.js

@@ -0,0 +1,17 @@
+'use strict';
+
+function bufferFromStr(str) {
+  return Buffer.from(`${str}\0`);
+}
+
+const create_mysql_clear_password_plugin = (pluginOptions) =>
+  function mysql_clear_password_plugin({ connection, command }) {
+    const password =
+      command.password || pluginOptions.password || connection.config.password;
+
+    return function (/* pluginData */) {
+      return bufferFromStr(password);
+    };
+  };
+
+module.exports = create_mysql_clear_password_plugin;

package/.output/server/node_modules/mysql2/lib/auth_plugins/mysql_native_password.js

@@ -0,0 +1,34 @@
+'use strict';
+
+//const PLUGIN_NAME = 'mysql_native_password';
+const auth41 = require('../auth_41.js');
+
+module.exports =
+  (pluginOptions) =>
+  ({ connection, command }) => {
+    const password =
+      command.password || pluginOptions.password || connection.config.password;
+    const passwordSha1 =
+      command.passwordSha1 ||
+      pluginOptions.passwordSha1 ||
+      connection.config.passwordSha1;
+    return (data) => {
+      const authPluginData1 = data.slice(0, 8);
+      const authPluginData2 = data.slice(8, 20);
+      let authToken;
+      if (passwordSha1) {
+        authToken = auth41.calculateTokenFromPasswordSha(
+          passwordSha1,
+          authPluginData1,
+          authPluginData2
+        );
+      } else {
+        authToken = auth41.calculateToken(
+          password,
+          authPluginData1,
+          authPluginData2
+        );
+      }
+      return authToken;
+    };
+  };