@hiero-ledger/sdk 2.70.0

package/lib/client/ManagedNetwork.cjs

@@ -0,0 +1,427 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _LedgerId = _interopRequireDefault(require("../LedgerId.cjs"));
+var util = _interopRequireWildcard(require("../util.cjs"));
+function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
+function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && {}.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+// SPDX-License-Identifier: Apache-2.0
+
+/**
+ * @typedef {import("../channel/Channel.js").default} Channel
+ * @typedef {import("../channel/MirrorChannel.js").default} MirrorChannel
+ * @typedef {import("../Node.js").default} Node
+ * @typedef {import("../MirrorNode.js").default} MirrorNode
+ * @typedef {import("../address_book/NodeAddressBook.js").default} NodeAddressBook
+ */
+
+/**
+ * @template {Channel | MirrorChannel} ChannelT
+ * @typedef {import("../ManagedNode.js").default<ChannelT>} ManagedNode
+ */
+
+/**
+ * @template {Channel | MirrorChannel} ChannelT
+ * @template {ManagedNode<ChannelT>} NetworkNodeT
+ * @template {{ toString: () => string }} KeyT
+ */
+class ManagedNetwork {
+  /**
+   * @param {(address: string) => ChannelT} createNetworkChannel
+   */
+  constructor(createNetworkChannel) {
+    /**
+     * Map of node account ID (as a string)
+     * to the node URL.
+     *
+     * @internal
+     * @type {Map<string, NetworkNodeT[]>}
+     */
+    // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment
+    this._network = new Map();
+
+    /**
+     * List of node account IDs.
+     *
+     * @protected
+     * @type {NetworkNodeT[]}
+     */
+    this._nodes = [];
+
+    /**
+     * List of node account IDs.
+     *
+     * @protected
+     * @type {NetworkNodeT[]}
+     */
+    this._healthyNodes = [];
+
+    /** @type {(address: string, cert?: string) => ChannelT} */
+    this._createNetworkChannel = createNetworkChannel;
+
+    /** @type {LedgerId | null} */
+    this._ledgerId = null;
+    this._minBackoff = 8000;
+    this._maxBackoff = 1000 * 60 * 60;
+
+    /** @type {number} */
+    this._maxNodeAttempts = -1;
+    this._nodeMinReadmitPeriod = this._minBackoff;
+    this._nodeMaxReadmitPeriod = this._maxBackoff;
+    this._earliestReadmitTime = Date.now() + this._nodeMinReadmitPeriod;
+  }
+
+  /**
+   * @deprecated
+   * @param {string} networkName
+   * @returns {this}
+   */
+  setNetworkName(networkName) {
+    console.warn("Deprecated: Use `setLedgerId` instead");
+    return this.setLedgerId(networkName);
+  }
+
+  /**
+   * @deprecated
+   * @returns {string | null}
+   */
+  get networkName() {
+    console.warn("Deprecated: Use `ledgerId` instead");
+    return this.ledgerId != null ? this.ledgerId.toString() : null;
+  }
+
+  /**
+   * @param {string|LedgerId} ledgerId
+   * @returns {this}
+   */
+  setLedgerId(ledgerId) {
+    this._ledgerId = typeof ledgerId === "string" ? _LedgerId.default.fromString(ledgerId) : ledgerId;
+    return this;
+  }
+
+  /**
+   * @returns {LedgerId | null}
+   */
+  get ledgerId() {
+    return this._ledgerId != null ? this._ledgerId : null;
+  }
+
+  /**
+   * @abstract
+   * @param {[string, KeyT]} entry
+   * @returns {NetworkNodeT}
+   */
+  // eslint-disable-next-line @typescript-eslint/no-unused-vars
+  _createNodeFromNetworkEntry(entry) {
+    throw new Error("not implemented");
+  }
+
+  /**
+   * @abstract
+   * @param {Map<string, KeyT>} network
+   * @returns {number[]}
+   */
+  // eslint-disable-next-line @typescript-eslint/no-unused-vars
+  _getNodesToRemove(network) {
+    throw new Error("not implemented");
+  }
+  _removeDeadNodes() {
+    if (this._maxNodeAttempts > 0) {
+      for (let i = this._nodes.length - 1; i >= 0; i--) {
+        const node = this._nodes[i];
+        if (node._badGrpcStatusCount < this._maxNodeAttempts) {
+          continue;
+        }
+        this._closeNode(i);
+      }
+    }
+  }
+  _readmitNodes() {
+    const now = Date.now();
+    if (this._earliestReadmitTime <= now) {
+      let nextEarliestReadmitTime = Number.MAX_SAFE_INTEGER;
+      let searchForNextEarliestReadmitTime = true;
+      outer: for (let i = 0; i < this._nodes.length; i++) {
+        for (let j = 0; j < this._healthyNodes.length; j++) {
+          if (searchForNextEarliestReadmitTime && this._nodes[i]._readmitTime > now) {
+            nextEarliestReadmitTime = Math.min(this._nodes[i]._readmitTime, nextEarliestReadmitTime);
+          }
+          if (this._nodes[i] == this._healthyNodes[j]) {
+            continue outer;
+          }
+        }
+        searchForNextEarliestReadmitTime = false;
+        if (this._nodes[i]._readmitTime <= now) {
+          this._healthyNodes.push(this._nodes[i]);
+        }
+      }
+      this._earliestReadmitTime = Math.min(Math.max(nextEarliestReadmitTime, this._nodeMinReadmitPeriod), this._nodeMaxReadmitPeriod);
+    }
+  }
+
+  /**
+   * @param {number} count
+   * @returns {NetworkNodeT[]}
+   */
+  _getNumberOfMostHealthyNodes(count) {
+    this._removeDeadNodes();
+    this._readmitNodes();
+    const nodes = [];
+    // Create a shallow for safe iteration
+    let healthyNodes = this._healthyNodes.slice();
+    count = Math.min(count, healthyNodes.length);
+    for (let i = 0; i < count; i++) {
+      // Select a random index
+      const nodeIndex = Math.floor(Math.random() * healthyNodes.length);
+      const selectedNode = healthyNodes[nodeIndex];
+
+      // Check if the node exists
+      if (!selectedNode) {
+        break; // Break out of the loop if undefined node is selected
+      }
+
+      // Add the selected node in array for execution
+      nodes.push(selectedNode);
+      // Remove all nodes with the same account id as
+      // the selected node account id from the array
+      healthyNodes = healthyNodes.filter(
+      // eslint-disable-next-line ie11/no-loop-func
+      node => node.getKey() !== selectedNode.getKey());
+    }
+    return nodes;
+  }
+
+  /**
+   * @param {number} i
+   */
+  _closeNode(i) {
+    const node = this._nodes[i];
+    node.close();
+    this._removeNodeFromNetwork(node);
+    this._nodes.splice(i, 1);
+  }
+
+  /**
+   * @param {NetworkNodeT} node
+   */
+  _removeNodeFromNetwork(node) {
+    const network = /** @type {NetworkNodeT[]} */
+    this._network.get(node.getKey());
+    for (let j = 0; j < network.length; j++) {
+      if (network[j] === node) {
+        network.splice(j, 1);
+        break;
+      }
+    }
+    if (network.length === 0) {
+      this._network.delete(node.getKey());
+    }
+  }
+
+  /**
+   * @param {Map<string, KeyT>} network
+   * @returns {this}
+   */
+  _setNetwork(network) {
+    /** @type {NetworkNodeT[]} */
+    const newNodes = [];
+    const newNodeKeys = new Set();
+    const newNodeAddresses = new Set();
+
+    /** @type {NetworkNodeT[]} */
+    const newHealthyNodes = [];
+
+    /** @type {Map<string, NetworkNodeT[]>} */
+    // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment
+    const newNetwork = new Map();
+
+    // Remove nodes that are not in the new network
+    for (const i of this._getNodesToRemove(network)) {
+      this._closeNode(i);
+    }
+
+    // Copy all the unclosed nodes
+    for (const node of this._nodes) {
+      newNodes.push(node);
+      newNodeKeys.add(node.getKey());
+      newNodeAddresses.add(node.address.toString());
+    }
+
+    // Add new nodes
+    for (const [key, value] of network) {
+      if (newNodeKeys.has(value.toString()) && newNodeAddresses.has(key)) {
+        continue;
+      }
+      newNodes.push(this._createNodeFromNetworkEntry([key, value]));
+    }
+
+    // Shuffle the nodes so we don't immediately pick the first nodes
+    util.shuffle(newNodes);
+
+    // Copy all the nodes into the healhty nodes list initially
+    // and push the nodes into the network; this maintains the
+    // shuffled state from `newNodes`
+    for (const node of newNodes) {
+      if (!node.isHealthy()) {
+        continue;
+      }
+      newHealthyNodes.push(node);
+      const newNetworkNodes = newNetwork.has(node.getKey()) ? (/** @type {NetworkNodeT[]} */newNetwork.get(node.getKey())) : [];
+      newNetworkNodes.push(node);
+      newNetwork.set(node.getKey(), newNetworkNodes);
+    }
+    this._nodes = newNodes;
+    this._healthyNodes = newHealthyNodes;
+    this._network = newNetwork;
+    return this;
+  }
+
+  /**
+   * @returns {number}
+   */
+  get maxNodeAttempts() {
+    return this._maxNodeAttempts;
+  }
+
+  /**
+   * @param {number} maxNodeAttempts
+   * @returns {this}
+   */
+  setMaxNodeAttempts(maxNodeAttempts) {
+    this._maxNodeAttempts = maxNodeAttempts;
+    return this;
+  }
+
+  /**
+   * @returns {number}
+   */
+  get minBackoff() {
+    return this._minBackoff;
+  }
+
+  /**
+   * @param {number} minBackoff
+   * @returns {this}
+   */
+  setMinBackoff(minBackoff) {
+    this._minBackoff = minBackoff;
+    for (const node of this._nodes) {
+      node.setMinBackoff(minBackoff);
+    }
+    return this;
+  }
+
+  /**
+   * @returns {number}
+   */
+  get maxBackoff() {
+    return this._maxBackoff;
+  }
+
+  /**
+   * @param {number} maxBackoff
+   * @returns {this}
+   */
+  setMaxBackoff(maxBackoff) {
+    this._maxBackoff = maxBackoff;
+    for (const node of this._nodes) {
+      node.setMaxBackoff(maxBackoff);
+    }
+    return this;
+  }
+
+  /**
+   * @returns {number}
+   */
+  get nodeMinReadmitPeriod() {
+    return this._nodeMinReadmitPeriod;
+  }
+
+  /**
+   * @param {number} nodeMinReadmitPeriod
+   * @returns {this}
+   */
+  setNodeMinReadmitPeriod(nodeMinReadmitPeriod) {
+    this._nodeMinReadmitPeriod = nodeMinReadmitPeriod;
+    this._earliestReadmitTime = Date.now() + this._nodeMinReadmitPeriod;
+    return this;
+  }
+
+  /**
+   * @returns {number}
+   */
+  get nodeMaxReadmitPeriod() {
+    return this._nodeMaxReadmitPeriod;
+  }
+
+  /**
+   * @param {number} nodeMaxReadmitPeriod
+   * @returns {this}
+   */
+  setNodeMaxReadmitPeriod(nodeMaxReadmitPeriod) {
+    this._nodeMaxReadmitPeriod = nodeMaxReadmitPeriod;
+    return this;
+  }
+
+  /**
+   * @param {KeyT=} key
+   * @returns {NetworkNodeT}
+   */
+  getNode(key) {
+    this._readmitNodes();
+    if (key != null && key != undefined) {
+      const lockedNodes = this._network.get(key.toString());
+      if (lockedNodes) {
+        const randomNodeAddress = Math.floor(Math.random() * lockedNodes.length);
+        return /** @type {NetworkNodeT[]} */lockedNodes[randomNodeAddress];
+      } else {
+        const nodes = Array.from(this._network.keys());
+        const randomNodeAccountId = nodes[Math.floor(Math.random() * nodes.length)];
+        const randomNode = this._network.get(randomNodeAccountId);
+        // We get the `randomNodeAccountId` from the network mapping,
+        // so it cannot be `undefined`
+        const randomNodeAddress = Math.floor(
+        // @ts-ignore
+        Math.random() * randomNode.length);
+        // @ts-ignore
+        return randomNode[randomNodeAddress];
+      }
+    } else {
+      if (this._healthyNodes.length == 0) {
+        throw new Error("failed to find a healthy working node");
+      }
+      return this._healthyNodes[Math.floor(Math.random() * this._healthyNodes.length)];
+    }
+  }
+
+  /**
+   * @param {NetworkNodeT} node
+   */
+  increaseBackoff(node) {
+    node.increaseBackoff();
+    for (let i = 0; i < this._healthyNodes.length; i++) {
+      if (this._healthyNodes[i] == node) {
+        this._healthyNodes.splice(i, 1);
+      }
+    }
+  }
+
+  /**
+   * @param {NetworkNodeT} node
+   */
+  decreaseBackoff(node) {
+    node.decreaseBackoff();
+  }
+  close() {
+    for (const node of this._nodes) {
+      node.close();
+    }
+    this._network.clear();
+    this._nodes = [];
+  }
+}
+exports.default = ManagedNetwork;

package/lib/client/ManagedNetwork.d.ts

@@ -0,0 +1,175 @@
+/**
+ * @typedef {import("../channel/Channel.js").default} Channel
+ * @typedef {import("../channel/MirrorChannel.js").default} MirrorChannel
+ * @typedef {import("../Node.js").default} Node
+ * @typedef {import("../MirrorNode.js").default} MirrorNode
+ * @typedef {import("../address_book/NodeAddressBook.js").default} NodeAddressBook
+ */
+/**
+ * @template {Channel | MirrorChannel} ChannelT
+ * @typedef {import("../ManagedNode.js").default<ChannelT>} ManagedNode
+ */
+/**
+ * @template {Channel | MirrorChannel} ChannelT
+ * @template {ManagedNode<ChannelT>} NetworkNodeT
+ * @template {{ toString: () => string }} KeyT
+ */
+export default class ManagedNetwork<ChannelT extends Channel | MirrorChannel, NetworkNodeT extends ManagedNode<ChannelT>, KeyT extends {
+    toString: () => string;
+}> {
+    /**
+     * @param {(address: string) => ChannelT} createNetworkChannel
+     */
+    constructor(createNetworkChannel: (address: string) => ChannelT);
+    /**
+     * Map of node account ID (as a string)
+     * to the node URL.
+     *
+     * @internal
+     * @type {Map<string, NetworkNodeT[]>}
+     */
+    _network: Map<string, NetworkNodeT[]>;
+    /**
+     * List of node account IDs.
+     *
+     * @protected
+     * @type {NetworkNodeT[]}
+     */
+    protected _nodes: NetworkNodeT[];
+    /**
+     * List of node account IDs.
+     *
+     * @protected
+     * @type {NetworkNodeT[]}
+     */
+    protected _healthyNodes: NetworkNodeT[];
+    /** @type {(address: string, cert?: string) => ChannelT} */
+    _createNetworkChannel: (address: string, cert?: string) => ChannelT;
+    /** @type {LedgerId | null} */
+    _ledgerId: LedgerId | null;
+    _minBackoff: number;
+    _maxBackoff: number;
+    /** @type {number} */
+    _maxNodeAttempts: number;
+    _nodeMinReadmitPeriod: number;
+    _nodeMaxReadmitPeriod: number;
+    _earliestReadmitTime: number;
+    /**
+     * @deprecated
+     * @param {string} networkName
+     * @returns {this}
+     */
+    setNetworkName(networkName: string): this;
+    /**
+     * @deprecated
+     * @returns {string | null}
+     */
+    get networkName(): string | null;
+    /**
+     * @param {string|LedgerId} ledgerId
+     * @returns {this}
+     */
+    setLedgerId(ledgerId: string | LedgerId): this;
+    /**
+     * @returns {LedgerId | null}
+     */
+    get ledgerId(): LedgerId | null;
+    /**
+     * @abstract
+     * @param {[string, KeyT]} entry
+     * @returns {NetworkNodeT}
+     */
+    _createNodeFromNetworkEntry(entry: [string, KeyT]): NetworkNodeT;
+    /**
+     * @abstract
+     * @param {Map<string, KeyT>} network
+     * @returns {number[]}
+     */
+    _getNodesToRemove(network: Map<string, KeyT>): number[];
+    _removeDeadNodes(): void;
+    _readmitNodes(): void;
+    /**
+     * @param {number} count
+     * @returns {NetworkNodeT[]}
+     */
+    _getNumberOfMostHealthyNodes(count: number): NetworkNodeT[];
+    /**
+     * @param {number} i
+     */
+    _closeNode(i: number): void;
+    /**
+     * @param {NetworkNodeT} node
+     */
+    _removeNodeFromNetwork(node: NetworkNodeT): void;
+    /**
+     * @param {Map<string, KeyT>} network
+     * @returns {this}
+     */
+    _setNetwork(network: Map<string, KeyT>): this;
+    /**
+     * @returns {number}
+     */
+    get maxNodeAttempts(): number;
+    /**
+     * @param {number} maxNodeAttempts
+     * @returns {this}
+     */
+    setMaxNodeAttempts(maxNodeAttempts: number): this;
+    /**
+     * @returns {number}
+     */
+    get minBackoff(): number;
+    /**
+     * @param {number} minBackoff
+     * @returns {this}
+     */
+    setMinBackoff(minBackoff: number): this;
+    /**
+     * @returns {number}
+     */
+    get maxBackoff(): number;
+    /**
+     * @param {number} maxBackoff
+     * @returns {this}
+     */
+    setMaxBackoff(maxBackoff: number): this;
+    /**
+     * @returns {number}
+     */
+    get nodeMinReadmitPeriod(): number;
+    /**
+     * @param {number} nodeMinReadmitPeriod
+     * @returns {this}
+     */
+    setNodeMinReadmitPeriod(nodeMinReadmitPeriod: number): this;
+    /**
+     * @returns {number}
+     */
+    get nodeMaxReadmitPeriod(): number;
+    /**
+     * @param {number} nodeMaxReadmitPeriod
+     * @returns {this}
+     */
+    setNodeMaxReadmitPeriod(nodeMaxReadmitPeriod: number): this;
+    /**
+     * @param {KeyT=} key
+     * @returns {NetworkNodeT}
+     */
+    getNode(key?: KeyT | undefined): NetworkNodeT;
+    /**
+     * @param {NetworkNodeT} node
+     */
+    increaseBackoff(node: NetworkNodeT): void;
+    /**
+     * @param {NetworkNodeT} node
+     */
+    decreaseBackoff(node: NetworkNodeT): void;
+    close(): void;
+}
+export type Channel = import("../channel/Channel.js").default;
+export type MirrorChannel = import("../channel/MirrorChannel.js").default;
+export type Node = import("../Node.js").default;
+export type MirrorNode = import("../MirrorNode.js").default;
+export type NodeAddressBook = import("../address_book/NodeAddressBook.js").default;
+export type ManagedNode<ChannelT extends Channel | MirrorChannel> = import("../ManagedNode.js").default<ChannelT>;
+import LedgerId from "../LedgerId.js";

package/lib/client/ManagedNetwork.js

@@ -0,0 +1,2 @@
+import e from"../LedgerId.js";import{shuffle as t}from"../util.js";class o{constructor(e){this._network=new Map,this._nodes=[],this._healthyNodes=[],this._createNetworkChannel=e,this._ledgerId=null,this._minBackoff=8e3,this._maxBackoff=36e5,this._maxNodeAttempts=-1,this._nodeMinReadmitPeriod=this._minBackoff,this._nodeMaxReadmitPeriod=this._maxBackoff,this._earliestReadmitTime=Date.now()+this._nodeMinReadmitPeriod}setNetworkName(e){return console.warn("Deprecated: Use `setLedgerId` instead"),this.setLedgerId(e)}get networkName(){return console.warn("Deprecated: Use `ledgerId` instead"),null!=this.ledgerId?this.ledgerId.toString():null}setLedgerId(t){return this._ledgerId="string"==typeof t?e.fromString(t):t,this}get ledgerId(){return null!=this._ledgerId?this._ledgerId:null}_createNodeFromNetworkEntry(e){throw new Error("not implemented")}_getNodesToRemove(e){throw new Error("not implemented")}_removeDeadNodes(){if(this._maxNodeAttempts>0)for(let e=this._nodes.length-1;e>=0;e--){this._nodes[e]._badGrpcStatusCount<this._maxNodeAttempts||this._closeNode(e)}}_readmitNodes(){const e=Date.now();if(this._earliestReadmitTime<=e){let t=Number.MAX_SAFE_INTEGER,o=!0;e:for(let s=0;s<this._nodes.length;s++){for(let i=0;i<this._healthyNodes.length;i++)if(o&&this._nodes[s]._readmitTime>e&&(t=Math.min(this._nodes[s]._readmitTime,t)),this._nodes[s]==this._healthyNodes[i])continue e;o=!1,this._nodes[s]._readmitTime<=e&&this._healthyNodes.push(this._nodes[s])}this._earliestReadmitTime=Math.min(Math.max(t,this._nodeMinReadmitPeriod),this._nodeMaxReadmitPeriod)}}_getNumberOfMostHealthyNodes(e){this._removeDeadNodes(),this._readmitNodes();const t=[];let o=this._healthyNodes.slice();e=Math.min(e,o.length);for(let s=0;s<e;s++){const e=o[Math.floor(Math.random()*o.length)];if(!e)break;t.push(e),o=o.filter((t=>t.getKey()!==e.getKey()))}return t}_closeNode(e){const t=this._nodes[e];t.close(),this._removeNodeFromNetwork(t),this._nodes.splice(e,1)}_removeNodeFromNetwork(e){const t=this._network.get(e.getKey());for(let o=0;o<t.length;o++)if(t[o]===e){t.splice(o,1);break}0===t.length&&this._network.delete(e.getKey())}_setNetwork(e){const o=[],s=new Set,i=new Set,r=[],n=new Map;for(const t of this._getNodesToRemove(e))this._closeNode(t);for(const e of this._nodes)o.push(e),s.add(e.getKey()),i.add(e.address.toString());for(const[t,r]of e)s.has(r.toString())&&i.has(t)||o.push(this._createNodeFromNetworkEntry([t,r]));t(o);for(const e of o){if(!e.isHealthy())continue;r.push(e);const t=n.has(e.getKey())?n.get(e.getKey()):[];t.push(e),n.set(e.getKey(),t)}return this._nodes=o,this._healthyNodes=r,this._network=n,this}get maxNodeAttempts(){return this._maxNodeAttempts}setMaxNodeAttempts(e){return this._maxNodeAttempts=e,this}get minBackoff(){return this._minBackoff}setMinBackoff(e){this._minBackoff=e;for(const t of this._nodes)t.setMinBackoff(e);return this}get maxBackoff(){return this._maxBackoff}setMaxBackoff(e){this._maxBackoff=e;for(const t of this._nodes)t.setMaxBackoff(e);return this}get nodeMinReadmitPeriod(){return this._nodeMinReadmitPeriod}setNodeMinReadmitPeriod(e){return this._nodeMinReadmitPeriod=e,this._earliestReadmitTime=Date.now()+this._nodeMinReadmitPeriod,this}get nodeMaxReadmitPeriod(){return this._nodeMaxReadmitPeriod}setNodeMaxReadmitPeriod(e){return this._nodeMaxReadmitPeriod=e,this}getNode(e){if(this._readmitNodes(),null!=e&&null!=e){const t=this._network.get(e.toString());if(t){return t[Math.floor(Math.random()*t.length)]}{const e=Array.from(this._network.keys()),t=e[Math.floor(Math.random()*e.length)],o=this._network.get(t);return o[Math.floor(Math.random()*o.length)]}}if(0==this._healthyNodes.length)throw new Error("failed to find a healthy working node");return this._healthyNodes[Math.floor(Math.random()*this._healthyNodes.length)]}increaseBackoff(e){e.increaseBackoff();for(let t=0;t<this._healthyNodes.length;t++)this._healthyNodes[t]==e&&this._healthyNodes.splice(t,1)}decreaseBackoff(e){e.decreaseBackoff()}close(){for(const e of this._nodes)e.close();this._network.clear(),this._nodes=[]}}export{o as default};
+//# sourceMappingURL=ManagedNetwork.js.map

package/lib/client/ManagedNetwork.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ManagedNetwork.js","sources":["../../src/client/ManagedNetwork.js"],"sourcesContent":["// SPDX-License-Identifier: Apache-2.0\n\nimport LedgerId from \"../LedgerId.js\";\nimport * as util from \"../util.js\";\n\n/**\n * @typedef {import(\"../channel/Channel.js\").default} Channel\n * @typedef {import(\"../channel/MirrorChannel.js\").default} MirrorChannel\n * @typedef {import(\"../Node.js\").default} Node\n * @typedef {import(\"../MirrorNode.js\").default} MirrorNode\n * @typedef {import(\"../address_book/NodeAddressBook.js\").default} NodeAddressBook\n */\n\n/**\n * @template {Channel | MirrorChannel} ChannelT\n * @typedef {import(\"../ManagedNode.js\").default<ChannelT>} ManagedNode\n */\n\n/**\n * @template {Channel | MirrorChannel} ChannelT\n * @template {ManagedNode<ChannelT>} NetworkNodeT\n * @template {{ toString: () => string }} KeyT\n */\nexport default class ManagedNetwork {\n    /**\n     * @param {(address: string) => ChannelT} createNetworkChannel\n     */\n    constructor(createNetworkChannel) {\n        /**\n         * Map of node account ID (as a string)\n         * to the node URL.\n         *\n         * @internal\n         * @type {Map<string, NetworkNodeT[]>}\n         */\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n        this._network = new Map();\n\n        /**\n         * List of node account IDs.\n         *\n         * @protected\n         * @type {NetworkNodeT[]}\n         */\n        this._nodes = [];\n\n        /**\n         * List of node account IDs.\n         *\n         * @protected\n         * @type {NetworkNodeT[]}\n         */\n        this._healthyNodes = [];\n\n        /** @type {(address: string, cert?: string) => ChannelT} */\n        this._createNetworkChannel = createNetworkChannel;\n\n        /** @type {LedgerId | null} */\n        this._ledgerId = null;\n\n        this._minBackoff = 8000;\n        this._maxBackoff = 1000 * 60 * 60;\n\n        /** @type {number} */\n        this._maxNodeAttempts = -1;\n\n        this._nodeMinReadmitPeriod = this._minBackoff;\n        this._nodeMaxReadmitPeriod = this._maxBackoff;\n\n        this._earliestReadmitTime = Date.now() + this._nodeMinReadmitPeriod;\n    }\n\n    /**\n     * @deprecated\n     * @param {string} networkName\n     * @returns {this}\n     */\n    setNetworkName(networkName) {\n        console.warn(\"Deprecated: Use `setLedgerId` instead\");\n        return this.setLedgerId(networkName);\n    }\n\n    /**\n     * @deprecated\n     * @returns {string | null}\n     */\n    get networkName() {\n        console.warn(\"Deprecated: Use `ledgerId` instead\");\n        return this.ledgerId != null ? this.ledgerId.toString() : null;\n    }\n\n    /**\n     * @param {string|LedgerId} ledgerId\n     * @returns {this}\n     */\n    setLedgerId(ledgerId) {\n        this._ledgerId =\n            typeof ledgerId === \"string\"\n                ? LedgerId.fromString(ledgerId)\n                : ledgerId;\n        return this;\n    }\n\n    /**\n     * @returns {LedgerId | null}\n     */\n    get ledgerId() {\n        return this._ledgerId != null ? this._ledgerId : null;\n    }\n\n    /**\n     * @abstract\n     * @param {[string, KeyT]} entry\n     * @returns {NetworkNodeT}\n     */\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    _createNodeFromNetworkEntry(entry) {\n        throw new Error(\"not implemented\");\n    }\n\n    /**\n     * @abstract\n     * @param {Map<string, KeyT>} network\n     * @returns {number[]}\n     */\n    // eslint-disable-next-line @typescript-eslint/no-unused-vars\n    _getNodesToRemove(network) {\n        throw new Error(\"not implemented\");\n    }\n\n    _removeDeadNodes() {\n        if (this._maxNodeAttempts > 0) {\n            for (let i = this._nodes.length - 1; i >= 0; i--) {\n                const node = this._nodes[i];\n\n                if (node._badGrpcStatusCount < this._maxNodeAttempts) {\n                    continue;\n                }\n\n                this._closeNode(i);\n            }\n        }\n    }\n\n    _readmitNodes() {\n        const now = Date.now();\n\n        if (this._earliestReadmitTime <= now) {\n            let nextEarliestReadmitTime = Number.MAX_SAFE_INTEGER;\n            let searchForNextEarliestReadmitTime = true;\n\n            outer: for (let i = 0; i < this._nodes.length; i++) {\n                for (let j = 0; j < this._healthyNodes.length; j++) {\n                    if (\n                        searchForNextEarliestReadmitTime &&\n                        this._nodes[i]._readmitTime > now\n                    ) {\n                        nextEarliestReadmitTime = Math.min(\n                            this._nodes[i]._readmitTime,\n                            nextEarliestReadmitTime,\n                        );\n                    }\n\n                    if (this._nodes[i] == this._healthyNodes[j]) {\n                        continue outer;\n                    }\n                }\n\n                searchForNextEarliestReadmitTime = false;\n\n                if (this._nodes[i]._readmitTime <= now) {\n                    this._healthyNodes.push(this._nodes[i]);\n                }\n            }\n\n            this._earliestReadmitTime = Math.min(\n                Math.max(nextEarliestReadmitTime, this._nodeMinReadmitPeriod),\n                this._nodeMaxReadmitPeriod,\n            );\n        }\n    }\n\n    /**\n     * @param {number} count\n     * @returns {NetworkNodeT[]}\n     */\n    _getNumberOfMostHealthyNodes(count) {\n        this._removeDeadNodes();\n        this._readmitNodes();\n\n        const nodes = [];\n        // Create a shallow for safe iteration\n        let healthyNodes = this._healthyNodes.slice();\n        count = Math.min(count, healthyNodes.length);\n\n        for (let i = 0; i < count; i++) {\n            // Select a random index\n            const nodeIndex = Math.floor(Math.random() * healthyNodes.length);\n            const selectedNode = healthyNodes[nodeIndex];\n\n            // Check if the node exists\n            if (!selectedNode) {\n                break; // Break out of the loop if undefined node is selected\n            }\n\n            // Add the selected node in array for execution\n            nodes.push(selectedNode);\n            // Remove all nodes with the same account id as\n            // the selected node account id from the array\n            healthyNodes = healthyNodes.filter(\n                // eslint-disable-next-line ie11/no-loop-func\n                (node) => node.getKey() !== selectedNode.getKey(),\n            );\n        }\n\n        return nodes;\n    }\n\n    /**\n     * @param {number} i\n     */\n    _closeNode(i) {\n        const node = this._nodes[i];\n\n        node.close();\n        this._removeNodeFromNetwork(node);\n        this._nodes.splice(i, 1);\n    }\n\n    /**\n     * @param {NetworkNodeT} node\n     */\n    _removeNodeFromNetwork(node) {\n        const network = /** @type {NetworkNodeT[]} */ (\n            this._network.get(node.getKey())\n        );\n\n        for (let j = 0; j < network.length; j++) {\n            if (network[j] === node) {\n                network.splice(j, 1);\n                break;\n            }\n        }\n\n        if (network.length === 0) {\n            this._network.delete(node.getKey());\n        }\n    }\n\n    /**\n     * @param {Map<string, KeyT>} network\n     * @returns {this}\n     */\n    _setNetwork(network) {\n        /** @type {NetworkNodeT[]} */\n        const newNodes = [];\n        const newNodeKeys = new Set();\n        const newNodeAddresses = new Set();\n\n        /** @type {NetworkNodeT[]} */\n        const newHealthyNodes = [];\n\n        /** @type {Map<string, NetworkNodeT[]>} */\n        // eslint-disable-next-line @typescript-eslint/no-unsafe-assignment\n        const newNetwork = new Map();\n\n        // Remove nodes that are not in the new network\n        for (const i of this._getNodesToRemove(network)) {\n            this._closeNode(i);\n        }\n\n        // Copy all the unclosed nodes\n        for (const node of this._nodes) {\n            newNodes.push(node);\n            newNodeKeys.add(node.getKey());\n            newNodeAddresses.add(node.address.toString());\n        }\n\n        // Add new nodes\n        for (const [key, value] of network) {\n            if (\n                newNodeKeys.has(value.toString()) &&\n                newNodeAddresses.has(key)\n            ) {\n                continue;\n            }\n            newNodes.push(this._createNodeFromNetworkEntry([key, value]));\n        }\n\n        // Shuffle the nodes so we don't immediately pick the first nodes\n        util.shuffle(newNodes);\n\n        // Copy all the nodes into the healhty nodes list initially\n        // and push the nodes into the network; this maintains the\n        // shuffled state from `newNodes`\n        for (const node of newNodes) {\n            if (!node.isHealthy()) {\n                continue;\n            }\n\n            newHealthyNodes.push(node);\n\n            const newNetworkNodes = newNetwork.has(node.getKey())\n                ? /** @type {NetworkNodeT[]} */ (newNetwork.get(node.getKey()))\n                : [];\n            newNetworkNodes.push(node);\n            newNetwork.set(node.getKey(), newNetworkNodes);\n        }\n\n        this._nodes = newNodes;\n        this._healthyNodes = newHealthyNodes;\n        this._network = newNetwork;\n\n        return this;\n    }\n\n    /**\n     * @returns {number}\n     */\n    get maxNodeAttempts() {\n        return this._maxNodeAttempts;\n    }\n\n    /**\n     * @param {number} maxNodeAttempts\n     * @returns {this}\n     */\n    setMaxNodeAttempts(maxNodeAttempts) {\n        this._maxNodeAttempts = maxNodeAttempts;\n        return this;\n    }\n\n    /**\n     * @returns {number}\n     */\n    get minBackoff() {\n        return this._minBackoff;\n    }\n\n    /**\n     * @param {number} minBackoff\n     * @returns {this}\n     */\n    setMinBackoff(minBackoff) {\n        this._minBackoff = minBackoff;\n        for (const node of this._nodes) {\n            node.setMinBackoff(minBackoff);\n        }\n        return this;\n    }\n\n    /**\n     * @returns {number}\n     */\n    get maxBackoff() {\n        return this._maxBackoff;\n    }\n\n    /**\n     * @param {number} maxBackoff\n     * @returns {this}\n     */\n    setMaxBackoff(maxBackoff) {\n        this._maxBackoff = maxBackoff;\n        for (const node of this._nodes) {\n            node.setMaxBackoff(maxBackoff);\n        }\n        return this;\n    }\n\n    /**\n     * @returns {number}\n     */\n    get nodeMinReadmitPeriod() {\n        return this._nodeMinReadmitPeriod;\n    }\n\n    /**\n     * @param {number} nodeMinReadmitPeriod\n     * @returns {this}\n     */\n    setNodeMinReadmitPeriod(nodeMinReadmitPeriod) {\n        this._nodeMinReadmitPeriod = nodeMinReadmitPeriod;\n        this._earliestReadmitTime = Date.now() + this._nodeMinReadmitPeriod;\n        return this;\n    }\n\n    /**\n     * @returns {number}\n     */\n    get nodeMaxReadmitPeriod() {\n        return this._nodeMaxReadmitPeriod;\n    }\n\n    /**\n     * @param {number} nodeMaxReadmitPeriod\n     * @returns {this}\n     */\n    setNodeMaxReadmitPeriod(nodeMaxReadmitPeriod) {\n        this._nodeMaxReadmitPeriod = nodeMaxReadmitPeriod;\n        return this;\n    }\n\n    /**\n     * @param {KeyT=} key\n     * @returns {NetworkNodeT}\n     */\n    getNode(key) {\n        this._readmitNodes();\n        if (key != null && key != undefined) {\n            const lockedNodes = this._network.get(key.toString());\n            if (lockedNodes) {\n                const randomNodeAddress = Math.floor(\n                    Math.random() * lockedNodes.length,\n                );\n                return /** @type {NetworkNodeT[]} */ (lockedNodes)[\n                    randomNodeAddress\n                ];\n            } else {\n                const nodes = Array.from(this._network.keys());\n                const randomNodeAccountId =\n                    nodes[Math.floor(Math.random() * nodes.length)];\n\n                const randomNode = this._network.get(randomNodeAccountId);\n                // We get the `randomNodeAccountId` from the network mapping,\n                // so it cannot be `undefined`\n                const randomNodeAddress = Math.floor(\n                    // @ts-ignore\n                    Math.random() * randomNode.length,\n                );\n                // @ts-ignore\n                return randomNode[randomNodeAddress];\n            }\n        } else {\n            if (this._healthyNodes.length == 0) {\n                throw new Error(\"failed to find a healthy working node\");\n            }\n\n            return this._healthyNodes[\n                Math.floor(Math.random() * this._healthyNodes.length)\n            ];\n        }\n    }\n\n    /**\n     * @param {NetworkNodeT} node\n     */\n    increaseBackoff(node) {\n        node.increaseBackoff();\n\n        for (let i = 0; i < this._healthyNodes.length; i++) {\n            if (this._healthyNodes[i] == node) {\n                this._healthyNodes.splice(i, 1);\n            }\n        }\n    }\n\n    /**\n     * @param {NetworkNodeT} node\n     */\n    decreaseBackoff(node) {\n        node.decreaseBackoff();\n    }\n\n    close() {\n        for (const node of this._nodes) {\n            node.close();\n        }\n\n        this._network.clear();\n        this._nodes = [];\n    }\n}\n"],"names":["ManagedNetwork","constructor","createNetworkChannel","this","_network","Map","_nodes","_healthyNodes","_createNetworkChannel","_ledgerId","_minBackoff","_maxBackoff","_maxNodeAttempts","_nodeMinReadmitPeriod","_nodeMaxReadmitPeriod","_earliestReadmitTime","Date","now","setNetworkName","networkName","console","warn","setLedgerId","ledgerId","toString","LedgerId","fromString","_createNodeFromNetworkEntry","entry","Error","_getNodesToRemove","network","_removeDeadNodes","i","length","_badGrpcStatusCount","_closeNode","_readmitNodes","nextEarliestReadmitTime","Number","MAX_SAFE_INTEGER","searchForNextEarliestReadmitTime","outer","j","_readmitTime","Math","min","push","max","_getNumberOfMostHealthyNodes","count","nodes","healthyNodes","slice","selectedNode","floor","random","filter","node","getKey","close","_removeNodeFromNetwork","splice","get","delete","_setNetwork","newNodes","newNodeKeys","Set","newNodeAddresses","newHealthyNodes","newNetwork","add","address","key","value","has","util.shuffle","isHealthy","newNetworkNodes","set","maxNodeAttempts","setMaxNodeAttempts","minBackoff","setMinBackoff","maxBackoff","setMaxBackoff","nodeMinReadmitPeriod","setNodeMinReadmitPeriod","nodeMaxReadmitPeriod","setNodeMaxReadmitPeriod","getNode","undefined","lockedNodes","Array","from","keys","randomNodeAccountId","randomNode","increaseBackoff","decreaseBackoff","clear"],"mappings":"mEAuBe,MAAMA,EAIjB,WAAAC,CAAYC,GASRC,KAAKC,SAAW,IAAIC,IAQpBF,KAAKG,OAAS,GAQdH,KAAKI,cAAgB,GAGrBJ,KAAKK,sBAAwBN,EAG7BC,KAAKM,UAAY,KAEjBN,KAAKO,YAAc,IACnBP,KAAKQ,YAAc,KAGnBR,KAAKS,kBAAqB,EAE1BT,KAAKU,sBAAwBV,KAAKO,YAClCP,KAAKW,sBAAwBX,KAAKQ,YAElCR,KAAKY,qBAAuBC,KAAKC,MAAQd,KAAKU,qBACtD,CAOI,cAAAK,CAAeC,GAEX,OADAC,QAAQC,KAAK,yCACNlB,KAAKmB,YAAYH,EAChC,CAMI,eAAIA,GAEA,OADAC,QAAQC,KAAK,sCACW,MAAjBlB,KAAKoB,SAAmBpB,KAAKoB,SAASC,WAAa,IAClE,CAMI,WAAAF,CAAYC,GAKR,OAJApB,KAAKM,UACmB,iBAAbc,EACDE,EAASC,WAAWH,GACpBA,EACHpB,IACf,CAKI,YAAIoB,GACA,OAAyB,MAAlBpB,KAAKM,UAAoBN,KAAKM,UAAY,IACzD,CAQI,2BAAAkB,CAA4BC,GACxB,MAAM,IAAIC,MAAM,kBACxB,CAQI,iBAAAC,CAAkBC,GACd,MAAM,IAAIF,MAAM,kBACxB,CAEI,gBAAAG,GACI,GAAI7B,KAAKS,iBAAmB,EACxB,IAAK,IAAIqB,EAAI9B,KAAKG,OAAO4B,OAAS,EAAGD,GAAK,EAAGA,IAAK,CACjC9B,KAAKG,OAAO2B,GAEhBE,oBAAsBhC,KAAKS,kBAIpCT,KAAKiC,WAAWH,EAChC,CAEA,CAEI,aAAAI,GACI,MAAMpB,EAAMD,KAAKC,MAEjB,GAAId,KAAKY,sBAAwBE,EAAK,CAClC,IAAIqB,EAA0BC,OAAOC,iBACjCC,GAAmC,EAEvCC,EAAO,IAAK,IAAIT,EAAI,EAAGA,EAAI9B,KAAKG,OAAO4B,OAAQD,IAAK,CAChD,IAAK,IAAIU,EAAI,EAAGA,EAAIxC,KAAKI,cAAc2B,OAAQS,IAW3C,GATIF,GACAtC,KAAKG,OAAO2B,GAAGW,aAAe3B,IAE9BqB,EAA0BO,KAAKC,IAC3B3C,KAAKG,OAAO2B,GAAGW,aACfN,IAIJnC,KAAKG,OAAO2B,IAAM9B,KAAKI,cAAcoC,GACrC,SAASD,EAIjBD,GAAmC,EAE/BtC,KAAKG,OAAO2B,GAAGW,cAAgB3B,GAC/Bd,KAAKI,cAAcwC,KAAK5C,KAAKG,OAAO2B,GAExD,CAEY9B,KAAKY,qBAAuB8B,KAAKC,IAC7BD,KAAKG,IAAIV,EAAyBnC,KAAKU,uBACvCV,KAAKW,sBAErB,CACA,CAMI,4BAAAmC,CAA6BC,GACzB/C,KAAK6B,mBACL7B,KAAKkC,gBAEL,MAAMc,EAAQ,GAEd,IAAIC,EAAejD,KAAKI,cAAc8C,QACtCH,EAAQL,KAAKC,IAAII,EAAOE,EAAalB,QAErC,IAAK,IAAID,EAAI,EAAGA,EAAIiB,EAAOjB,IAAK,CAE5B,MACMqB,EAAeF,EADHP,KAAKU,MAAMV,KAAKW,SAAWJ,EAAalB,SAI1D,IAAKoB,EACD,MAIJH,EAAMJ,KAAKO,GAGXF,EAAeA,EAAaK,QAEvBC,GAASA,EAAKC,WAAaL,EAAaK,UAEzD,CAEQ,OAAOR,CACf,CAKI,UAAAf,CAAWH,GACP,MAAMyB,EAAOvD,KAAKG,OAAO2B,GAEzByB,EAAKE,QACLzD,KAAK0D,uBAAuBH,GAC5BvD,KAAKG,OAAOwD,OAAO7B,EAAG,EAC9B,CAKI,sBAAA4B,CAAuBH,GACnB,MAAM3B,EACF5B,KAAKC,SAAS2D,IAAIL,EAAKC,UAG3B,IAAK,IAAIhB,EAAI,EAAGA,EAAIZ,EAAQG,OAAQS,IAChC,GAAIZ,EAAQY,KAAOe,EAAM,CACrB3B,EAAQ+B,OAAOnB,EAAG,GAClB,KAChB,CAG+B,IAAnBZ,EAAQG,QACR/B,KAAKC,SAAS4D,OAAON,EAAKC,SAEtC,CAMI,WAAAM,CAAYlC,GAER,MAAMmC,EAAW,GACXC,EAAc,IAAIC,IAClBC,EAAmB,IAAID,IAGvBE,EAAkB,GAIlBC,EAAa,IAAIlE,IAGvB,IAAK,MAAM4B,KAAK9B,KAAK2B,kBAAkBC,GACnC5B,KAAKiC,WAAWH,GAIpB,IAAK,MAAMyB,KAAQvD,KAAKG,OACpB4D,EAASnB,KAAKW,GACdS,EAAYK,IAAId,EAAKC,UACrBU,EAAiBG,IAAId,EAAKe,QAAQjD,YAItC,IAAK,MAAOkD,EAAKC,KAAU5C,EAEnBoC,EAAYS,IAAID,EAAMnD,aACtB6C,EAAiBO,IAAIF,IAIzBR,EAASnB,KAAK5C,KAAKwB,4BAA4B,CAAC+C,EAAKC,KAIzDE,EAAaX,GAKb,IAAK,MAAMR,KAAQQ,EAAU,CACzB,IAAKR,EAAKoB,YACN,SAGJR,EAAgBvB,KAAKW,GAErB,MAAMqB,EAAkBR,EAAWK,IAAIlB,EAAKC,UACPY,EAAWR,IAAIL,EAAKC,UACnD,GACNoB,EAAgBhC,KAAKW,GACrBa,EAAWS,IAAItB,EAAKC,SAAUoB,EAC1C,CAMQ,OAJA5E,KAAKG,OAAS4D,EACd/D,KAAKI,cAAgB+D,EACrBnE,KAAKC,SAAWmE,EAETpE,IACf,CAKI,mBAAI8E,GACA,OAAO9E,KAAKS,gBACpB,CAMI,kBAAAsE,CAAmBD,GAEf,OADA9E,KAAKS,iBAAmBqE,EACjB9E,IACf,CAKI,cAAIgF,GACA,OAAOhF,KAAKO,WACpB,CAMI,aAAA0E,CAAcD,GACVhF,KAAKO,YAAcyE,EACnB,IAAK,MAAMzB,KAAQvD,KAAKG,OACpBoD,EAAK0B,cAAcD,GAEvB,OAAOhF,IACf,CAKI,cAAIkF,GACA,OAAOlF,KAAKQ,WACpB,CAMI,aAAA2E,CAAcD,GACVlF,KAAKQ,YAAc0E,EACnB,IAAK,MAAM3B,KAAQvD,KAAKG,OACpBoD,EAAK4B,cAAcD,GAEvB,OAAOlF,IACf,CAKI,wBAAIoF,GACA,OAAOpF,KAAKU,qBACpB,CAMI,uBAAA2E,CAAwBD,GAGpB,OAFApF,KAAKU,sBAAwB0E,EAC7BpF,KAAKY,qBAAuBC,KAAKC,MAAQd,KAAKU,sBACvCV,IACf,CAKI,wBAAIsF,GACA,OAAOtF,KAAKW,qBACpB,CAMI,uBAAA4E,CAAwBD,GAEpB,OADAtF,KAAKW,sBAAwB2E,EACtBtF,IACf,CAMI,OAAAwF,CAAQjB,GAEJ,GADAvE,KAAKkC,gBACM,MAAPqC,GAAsBkB,MAAPlB,EAAkB,CACjC,MAAMmB,EAAc1F,KAAKC,SAAS2D,IAAIW,EAAIlD,YAC1C,GAAIqE,EAAa,CAIb,OAAqC,EAHXhD,KAAKU,MAC3BV,KAAKW,SAAWqC,EAAY3D,QAKhD,CAAmB,CACH,MAAMiB,EAAQ2C,MAAMC,KAAK5F,KAAKC,SAAS4F,QACjCC,EACF9C,EAAMN,KAAKU,MAAMV,KAAKW,SAAWL,EAAMjB,SAErCgE,EAAa/F,KAAKC,SAAS2D,IAAIkC,GAQrC,OAAOC,EALmBrD,KAAKU,MAE3BV,KAAKW,SAAW0C,EAAWhE,QAI/C,CACA,CACY,GAAiC,GAA7B/B,KAAKI,cAAc2B,OACnB,MAAM,IAAIL,MAAM,yCAGpB,OAAO1B,KAAKI,cACRsC,KAAKU,MAAMV,KAAKW,SAAWrD,KAAKI,cAAc2B,QAG9D,CAKI,eAAAiE,CAAgBzC,GACZA,EAAKyC,kBAEL,IAAK,IAAIlE,EAAI,EAAGA,EAAI9B,KAAKI,cAAc2B,OAAQD,IACvC9B,KAAKI,cAAc0B,IAAMyB,GACzBvD,KAAKI,cAAcuD,OAAO7B,EAAG,EAG7C,CAKI,eAAAmE,CAAgB1C,GACZA,EAAK0C,iBACb,CAEI,KAAAxC,GACI,IAAK,MAAMF,KAAQvD,KAAKG,OACpBoD,EAAKE,QAGTzD,KAAKC,SAASiG,QACdlG,KAAKG,OAAS,EACtB"}