@relative-ci/core 5.3.0-beta.1 → 5.3.0-rc.1

package/lib/cjs/__/@actions/http-client/__/undici/lib/core/tree.js

@@ -0,0 +1,166 @@
+'use strict';
+
+var constants = require('./constants.js');
+
+var tree_1;
+var hasRequiredTree;
+
+function requireTree () {
+	if (hasRequiredTree) return tree_1;
+	hasRequiredTree = 1;
+
+	const {
+	  wellknownHeaderNames,
+	  headerNameLowerCasedRecord
+	} = constants.__require();
+
+	class TstNode {
+	  /** @type {any} */
+	  value = null
+	  /** @type {null | TstNode} */
+	  left = null
+	  /** @type {null | TstNode} */
+	  middle = null
+	  /** @type {null | TstNode} */
+	  right = null
+	  /** @type {number} */
+	  code
+	  /**
+	   * @param {string} key
+	   * @param {any} value
+	   * @param {number} index
+	   */
+	  constructor (key, value, index) {
+	    if (index === undefined || index >= key.length) {
+	      throw new TypeError('Unreachable')
+	    }
+	    const code = this.code = key.charCodeAt(index);
+	    // check code is ascii string
+	    if (code > 0x7F) {
+	      throw new TypeError('key must be ascii string')
+	    }
+	    if (key.length !== ++index) {
+	      this.middle = new TstNode(key, value, index);
+	    } else {
+	      this.value = value;
+	    }
+	  }
+
+	  /**
+	   * @param {string} key
+	   * @param {any} value
+	   */
+	  add (key, value) {
+	    const length = key.length;
+	    if (length === 0) {
+	      throw new TypeError('Unreachable')
+	    }
+	    let index = 0;
+	    let node = this;
+	    while (true) {
+	      const code = key.charCodeAt(index);
+	      // check code is ascii string
+	      if (code > 0x7F) {
+	        throw new TypeError('key must be ascii string')
+	      }
+	      if (node.code === code) {
+	        if (length === ++index) {
+	          node.value = value;
+	          break
+	        } else if (node.middle !== null) {
+	          node = node.middle;
+	        } else {
+	          node.middle = new TstNode(key, value, index);
+	          break
+	        }
+	      } else if (node.code < code) {
+	        if (node.left !== null) {
+	          node = node.left;
+	        } else {
+	          node.left = new TstNode(key, value, index);
+	          break
+	        }
+	      } else if (node.right !== null) {
+	        node = node.right;
+	      } else {
+	        node.right = new TstNode(key, value, index);
+	        break
+	      }
+	    }
+	  }
+
+	  /**
+	   * @param {Uint8Array} key
+	   * @return {TstNode | null}
+	   */
+	  search (key) {
+	    const keylength = key.length;
+	    let index = 0;
+	    let node = this;
+	    while (node !== null && index < keylength) {
+	      let code = key[index];
+	      // A-Z
+	      // First check if it is bigger than 0x5a.
+	      // Lowercase letters have higher char codes than uppercase ones.
+	      // Also we assume that headers will mostly contain lowercase characters.
+	      if (code <= 0x5a && code >= 0x41) {
+	        // Lowercase for uppercase.
+	        code |= 32;
+	      }
+	      while (node !== null) {
+	        if (code === node.code) {
+	          if (keylength === ++index) {
+	            // Returns Node since it is the last key.
+	            return node
+	          }
+	          node = node.middle;
+	          break
+	        }
+	        node = node.code < code ? node.left : node.right;
+	      }
+	    }
+	    return null
+	  }
+	}
+
+	class TernarySearchTree {
+	  /** @type {TstNode | null} */
+	  node = null
+
+	  /**
+	   * @param {string} key
+	   * @param {any} value
+	   * */
+	  insert (key, value) {
+	    if (this.node === null) {
+	      this.node = new TstNode(key, value, 0);
+	    } else {
+	      this.node.add(key, value);
+	    }
+	  }
+
+	  /**
+	   * @param {Uint8Array} key
+	   * @return {any}
+	   */
+	  lookup (key) {
+	    return this.node?.search(key)?.value ?? null
+	  }
+	}
+
+	const tree = new TernarySearchTree();
+
+	for (let i = 0; i < wellknownHeaderNames.length; ++i) {
+	  const key = headerNameLowerCasedRecord[wellknownHeaderNames[i]];
+	  tree.insert(key, key);
+	}
+
+	tree_1 = {
+	  TernarySearchTree,
+	  tree
+	};
+	return tree_1;
+}
+
+exports.__require = requireTree;
+//# sourceMappingURL=tree.js.map

package/lib/cjs/__/@actions/http-client/__/undici/lib/core/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sources":["../../../../../../../../../../../node_modules/@actions/http-client/node_modules/undici/lib/core/tree.js"],"sourcesContent":["'use strict'\n\nconst {\n  wellknownHeaderNames,\n  headerNameLowerCasedRecord\n} = require('./constants')\n\nclass TstNode {\n  /** @type {any} */\n  value = null\n  /** @type {null | TstNode} */\n  left = null\n  /** @type {null | TstNode} */\n  middle = null\n  /** @type {null | TstNode} */\n  right = null\n  /** @type {number} */\n  code\n  /**\n   * @param {string} key\n   * @param {any} value\n   * @param {number} index\n   */\n  constructor (key, value, index) {\n    if (index === undefined || index >= key.length) {\n      throw new TypeError('Unreachable')\n    }\n    const code = this.code = key.charCodeAt(index)\n    // check code is ascii string\n    if (code > 0x7F) {\n      throw new TypeError('key must be ascii string')\n    }\n    if (key.length !== ++index) {\n      this.middle = new TstNode(key, value, index)\n    } else {\n      this.value = value\n    }\n  }\n\n  /**\n   * @param {string} key\n   * @param {any} value\n   */\n  add (key, value) {\n    const length = key.length\n    if (length === 0) {\n      throw new TypeError('Unreachable')\n    }\n    let index = 0\n    let node = this\n    while (true) {\n      const code = key.charCodeAt(index)\n      // check code is ascii string\n      if (code > 0x7F) {\n        throw new TypeError('key must be ascii string')\n      }\n      if (node.code === code) {\n        if (length === ++index) {\n          node.value = value\n          break\n        } else if (node.middle !== null) {\n          node = node.middle\n        } else {\n          node.middle = new TstNode(key, value, index)\n          break\n        }\n      } else if (node.code < code) {\n        if (node.left !== null) {\n          node = node.left\n        } else {\n          node.left = new TstNode(key, value, index)\n          break\n        }\n      } else if (node.right !== null) {\n        node = node.right\n      } else {\n        node.right = new TstNode(key, value, index)\n        break\n      }\n    }\n  }\n\n  /**\n   * @param {Uint8Array} key\n   * @return {TstNode | null}\n   */\n  search (key) {\n    const keylength = key.length\n    let index = 0\n    let node = this\n    while (node !== null && index < keylength) {\n      let code = key[index]\n      // A-Z\n      // First check if it is bigger than 0x5a.\n      // Lowercase letters have higher char codes than uppercase ones.\n      // Also we assume that headers will mostly contain lowercase characters.\n      if (code <= 0x5a && code >= 0x41) {\n        // Lowercase for uppercase.\n        code |= 32\n      }\n      while (node !== null) {\n        if (code === node.code) {\n          if (keylength === ++index) {\n            // Returns Node since it is the last key.\n            return node\n          }\n          node = node.middle\n          break\n        }\n        node = node.code < code ? node.left : node.right\n      }\n    }\n    return null\n  }\n}\n\nclass TernarySearchTree {\n  /** @type {TstNode | null} */\n  node = null\n\n  /**\n   * @param {string} key\n   * @param {any} value\n   * */\n  insert (key, value) {\n    if (this.node === null) {\n      this.node = new TstNode(key, value, 0)\n    } else {\n      this.node.add(key, value)\n    }\n  }\n\n  /**\n   * @param {Uint8Array} key\n   * @return {any}\n   */\n  lookup (key) {\n    return this.node?.search(key)?.value ?? null\n  }\n}\n\nconst tree = new TernarySearchTree()\n\nfor (let i = 0; i < wellknownHeaderNames.length; ++i) {\n  const key = headerNameLowerCasedRecord[wellknownHeaderNames[i]]\n  tree.insert(key, key)\n}\n\nmodule.exports = {\n  TernarySearchTree,\n  tree\n}\n"],"names":["require$$0"],"mappings":";;;;;;;;;;;CAEA,MAAM;AACN,GAAE,oBAAoB;GACpB;AACF,EAAC,GAAGA,mBAAA;;AAEJ,CAAA,MAAM,OAAO,CAAC;AACd;AACA,GAAE,KAAK,GAAG;AACV;AACA,GAAE,IAAI,GAAG;AACT;AACA,GAAE,MAAM,GAAG;AACX;AACA,GAAE,KAAK,GAAG;AACV;GACE;AACF;AACA;AACA;AACA;AACA;GACE,WAAW,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE;KAC9B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,IAAI,GAAG,CAAC,MAAM,EAAE;AACpD,OAAM,MAAM,IAAI,SAAS,CAAC,aAAa;AACvC,KAAA;KACI,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK;AACjD;AACA,KAAI,IAAI,IAAI,GAAG,IAAI,EAAE;AACrB,OAAM,MAAM,IAAI,SAAS,CAAC,0BAA0B;AACpD,KAAA;AACA,KAAI,IAAI,GAAG,CAAC,MAAM,KAAK,EAAE,KAAK,EAAE;OAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK;AACjD,KAAA,CAAK,MAAM;OACL,IAAI,CAAC,KAAK,GAAG;AACnB,KAAA;AACA,GAAA;;AAEA;AACA;AACA;AACA;AACA,GAAE,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE;AACnB,KAAI,MAAM,MAAM,GAAG,GAAG,CAAC;AACvB,KAAI,IAAI,MAAM,KAAK,CAAC,EAAE;AACtB,OAAM,MAAM,IAAI,SAAS,CAAC,aAAa;AACvC,KAAA;KACI,IAAI,KAAK,GAAG;KACZ,IAAI,IAAI,GAAG;KACX,OAAO,IAAI,EAAE;AACjB,OAAM,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK;AACvC;AACA,OAAM,IAAI,IAAI,GAAG,IAAI,EAAE;AACvB,SAAQ,MAAM,IAAI,SAAS,CAAC,0BAA0B;AACtD,OAAA;AACA,OAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;AAC9B,SAAQ,IAAI,MAAM,KAAK,EAAE,KAAK,EAAE;WACtB,IAAI,CAAC,KAAK,GAAG;WACb;AACV,SAAA,CAAS,MAAM,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE;WAC/B,IAAI,GAAG,IAAI,CAAC;AACtB,SAAA,CAAS,MAAM;WACL,IAAI,CAAC,MAAM,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK;WAC3C;AACV,SAAA;AACA,OAAA,CAAO,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,IAAI,EAAE;AACnC,SAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;WACtB,IAAI,GAAG,IAAI,CAAC;AACtB,SAAA,CAAS,MAAM;WACL,IAAI,CAAC,IAAI,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK;WACzC;AACV,SAAA;AACA,OAAA,CAAO,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;SAC9B,IAAI,GAAG,IAAI,CAAC;AACpB,OAAA,CAAO,MAAM;SACL,IAAI,CAAC,KAAK,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,KAAK;SAC1C;AACR,OAAA;AACA,KAAA;AACA,GAAA;;AAEA;AACA;AACA;AACA;AACA,GAAE,MAAM,CAAC,CAAC,GAAG,EAAE;AACf,KAAI,MAAM,SAAS,GAAG,GAAG,CAAC;KACtB,IAAI,KAAK,GAAG;KACZ,IAAI,IAAI,GAAG;KACX,OAAO,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,SAAS,EAAE;AAC/C,OAAM,IAAI,IAAI,GAAG,GAAG,CAAC,KAAK;AAC1B;AACA;AACA;AACA;OACM,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE;AACxC;AACA,SAAQ,IAAI,IAAI;AAChB,OAAA;AACA,OAAM,OAAO,IAAI,KAAK,IAAI,EAAE;AAC5B,SAAQ,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;AAChC,WAAU,IAAI,SAAS,KAAK,EAAE,KAAK,EAAE;AACrC;AACA,aAAY,OAAO;AACnB,WAAA;WACU,IAAI,GAAG,IAAI,CAAC;WACZ;AACV,SAAA;AACA,SAAQ,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACnD,OAAA;AACA,KAAA;AACA,KAAI,OAAO;AACX,GAAA;AACA;;AAEA,CAAA,MAAM,iBAAiB,CAAC;AACxB;AACA,GAAE,IAAI,GAAG;;AAET;AACA;AACA;AACA;AACA,GAAE,MAAM,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE;AACtB,KAAI,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE;OACtB,IAAI,CAAC,IAAI,GAAG,IAAI,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC;AAC3C,KAAA,CAAK,MAAM;OACL,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK;AAC9B,KAAA;AACA,GAAA;;AAEA;AACA;AACA;AACA;AACA,GAAE,MAAM,CAAC,CAAC,GAAG,EAAE;KACX,OAAO,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI;AAC5C,GAAA;AACA;;CAEA,MAAM,IAAI,GAAG,IAAI,iBAAiB;;AAElC,CAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,oBAAoB,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;GACpD,MAAM,GAAG,GAAG,0BAA0B,CAAC,oBAAoB,CAAC,CAAC,CAAC;AAChE,GAAE,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG;AACtB,CAAA;;AAEA,CAAA,MAAc,GAAG;AACjB,GAAE,iBAAiB;GACjB;AACF;;;;;;","x_google_ignoreList":[0]}