@atomicfinance/bitcoin-dlc-provider 4.2.8 → 4.3.0

package/.yalc/@node-dlc/core/dist/AsyncProcessingQueue.d.ts

@@ -0,0 +1,22 @@
+/// <reference types="node" />
+import { EventEmitter } from 'events';
+/**
+ * Serializes execution of events. This class is constructed with
+ * a delegate function that is executed for each item that is enqueued.
+ */
+export declare class AsyncProcessingQueue<T> extends EventEmitter {
+    private _fn;
+    private _queue;
+    private _flushHandle;
+    constructor(fn: (...args: T[]) => Promise<void>);
+    /**
+     * Adds a new item to the processing queue
+     */
+    enqueue(value: T): void;
+    /**
+     * Gets the number of pending items in the processor queue
+     * @type {number}
+     */
+    get size(): number;
+    private _flush;
+}

package/.yalc/@node-dlc/core/dist/AsyncProcessingQueue.js

@@ -0,0 +1,55 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AsyncProcessingQueue = void 0;
+const events_1 = require("events");
+const Queue_1 = require("./Queue");
+/**
+ * Serializes execution of events. This class is constructed with
+ * a delegate function that is executed for each item that is enqueued.
+ */
+class AsyncProcessingQueue extends events_1.EventEmitter {
+    constructor(fn) {
+        super();
+        this._fn = fn;
+        this._queue = new Queue_1.Queue();
+        this._flush = this._flush.bind(this);
+    }
+    /**
+     * Adds a new item to the processing queue
+     */
+    enqueue(value) {
+        this._queue.enqueue(value);
+        // Postpone flushing until end of event loop to allow multiple operations
+        // to enqueue. This handle will be cleared once flushing has completed.
+        if (!this._flushHandle)
+            this._flushHandle = setImmediate(this._flush);
+    }
+    /**
+     * Gets the number of pending items in the processor queue
+     * @type {number}
+     */
+    get size() {
+        return this._queue.length;
+    }
+    async _flush() {
+        // emit that flushing is starting
+        this.emit('flushing');
+        // process all items on the queue, even items that
+        // are added to the queue while flushing is occuring
+        while (this._queue.length > 0) {
+            try {
+                const value = this._queue.dequeue();
+                await this._fn(value);
+            }
+            catch (ex) {
+                this.emit('error', ex);
+            }
+        }
+        // emit flushing has completed
+        this.emit('flushed');
+        // clear flush handle so that next enqueue will trigger a flush
+        this._flushHandle = undefined;
+    }
+}
+exports.AsyncProcessingQueue = AsyncProcessingQueue;
+//# sourceMappingURL=AsyncProcessingQueue.js.map

package/.yalc/@node-dlc/core/dist/AsyncProcessingQueue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AsyncProcessingQueue.js","sourceRoot":"","sources":["../lib/AsyncProcessingQueue.ts"],"names":[],"mappings":";;;AAAA,mCAAsC;AAEtC,mCAAgC;AAEhC;;;GAGG;AACH,MAAa,oBAAwB,SAAQ,qBAAY;IAOvD,YAAY,EAAmC;QAC7C,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;QACd,IAAI,CAAC,MAAM,GAAG,IAAI,aAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,KAAQ;QACrB,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAE3B,yEAAyE;QACzE,uEAAuE;QACvE,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACxE,CAAC;IAED;;;OAGG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5B,CAAC;IAEO,KAAK,CAAC,MAAM;QAClB,iCAAiC;QACjC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtB,kDAAkD;QAClD,oDAAoD;QACpD,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YAC7B,IAAI;gBACF,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;gBACpC,MAAM,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;aACvB;YAAC,OAAO,EAAE,EAAE;gBACX,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;aACxB;SACF;QAED,8BAA8B;QAC9B,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAErB,+DAA+D;QAC/D,IAAI,CAAC,YAAY,GAAG,SAAS,CAAC;IAChC,CAAC;CACF;AAtDD,oDAsDC"}

package/.yalc/@node-dlc/core/dist/Base32.d.ts

@@ -0,0 +1 @@
+export { Base32 } from '@node-dlc/common';

package/.yalc/@node-dlc/core/dist/Base32.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Base32 = void 0;
+// Re-export Base32 from common package to maintain backward compatibility
+var common_1 = require("@node-dlc/common");
+Object.defineProperty(exports, "Base32", { enumerable: true, get: function () { return common_1.Base32; } });
+//# sourceMappingURL=Base32.js.map

package/.yalc/@node-dlc/core/dist/Base32.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Base32.js","sourceRoot":"","sources":["../lib/Base32.ts"],"names":[],"mappings":";;;AAAA,0EAA0E;AAC1E,2CAA0C;AAAjC,gGAAA,MAAM,OAAA"}

package/.yalc/@node-dlc/core/dist/BigIntUtils.d.ts

@@ -0,0 +1 @@
+export { bigintToBuffer, calcBytes } from '@node-dlc/common';

package/.yalc/@node-dlc/core/dist/BigIntUtils.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.calcBytes = exports.bigintToBuffer = void 0;
+// Re-export BigIntUtils functions from common package to maintain backward compatibility
+var common_1 = require("@node-dlc/common");
+Object.defineProperty(exports, "bigintToBuffer", { enumerable: true, get: function () { return common_1.bigintToBuffer; } });
+Object.defineProperty(exports, "calcBytes", { enumerable: true, get: function () { return common_1.calcBytes; } });
+//# sourceMappingURL=BigIntUtils.js.map

package/.yalc/@node-dlc/core/dist/BigIntUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BigIntUtils.js","sourceRoot":"","sources":["../lib/BigIntUtils.ts"],"names":[],"mappings":";;;AAAA,yFAAyF;AACzF,2CAA6D;AAApD,wGAAA,cAAc,OAAA;AAAE,mGAAA,SAAS,OAAA"}

package/.yalc/@node-dlc/core/dist/BitField.d.ts

@@ -0,0 +1 @@
+export { BitField } from '@node-dlc/common';

package/.yalc/@node-dlc/core/dist/BitField.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BitField = void 0;
+// Re-export BitField from common package to maintain backward compatibility
+var common_1 = require("@node-dlc/common");
+Object.defineProperty(exports, "BitField", { enumerable: true, get: function () { return common_1.BitField; } });
+//# sourceMappingURL=BitField.js.map

package/.yalc/@node-dlc/core/dist/BitField.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BitField.js","sourceRoot":"","sources":["../lib/BitField.ts"],"names":[],"mappings":";;;AAAA,4EAA4E;AAC5E,2CAA4C;AAAnC,kGAAA,QAAQ,OAAA"}

package/.yalc/@node-dlc/core/dist/ChannelId.d.ts

@@ -0,0 +1 @@
+export { ChannelId } from '@node-dlc/common';

package/.yalc/@node-dlc/core/dist/ChannelId.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ChannelId = void 0;
+// Re-export ChannelId from common package to maintain backward compatibility
+var common_1 = require("@node-dlc/common");
+Object.defineProperty(exports, "ChannelId", { enumerable: true, get: function () { return common_1.ChannelId; } });
+//# sourceMappingURL=ChannelId.js.map

package/.yalc/@node-dlc/core/dist/ChannelId.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ChannelId.js","sourceRoot":"","sources":["../lib/ChannelId.ts"],"names":[],"mappings":";;;AAAA,6EAA6E;AAC7E,2CAA6C;AAApC,mGAAA,SAAS,OAAA"}

package/.yalc/@node-dlc/core/dist/LinkedList.d.ts

@@ -0,0 +1,30 @@
+import { LinkedListNode } from './LinkedListNode';
+/**
+ * Implementation of a doubly linked-list that maintains both head and tail.
+ * Tail maintenance allows for O(1) insertions at tail
+ */
+export declare class LinkedList<T> {
+    length: number;
+    head: LinkedListNode<T>;
+    tail: LinkedListNode<T>;
+    /**
+     * Adds a node to the end of a linked List
+     * @param T value
+     * @returns {LinkedListNode}
+     */
+    add(value: T): LinkedListNode<T>;
+    /**
+     * Finds the node at a specific position
+     */
+    valueAt(index: number): T;
+    /**
+     * Finds the node for the index or throws an out of range exception
+     */
+    nodeAt(index: number): LinkedListNode<T>;
+    /**
+     * Removes the node at the index and returns its value.
+     * Head or tail removal is an O(1) operation. For removal of other indexes
+     * is at worst O(N).
+     */
+    remove(index: number): T;
+}

package/.yalc/@node-dlc/core/dist/LinkedList.js

@@ -0,0 +1,104 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LinkedList = void 0;
+const LinkedListNode_1 = require("./LinkedListNode");
+/**
+ * Implementation of a doubly linked-list that maintains both head and tail.
+ * Tail maintenance allows for O(1) insertions at tail
+ */
+class LinkedList {
+    constructor() {
+        this.length = 0;
+        this.head = null;
+        this.tail = null;
+    }
+    /**
+     * Adds a node to the end of a linked List
+     * @param T value
+     * @returns {LinkedListNode}
+     */
+    add(value) {
+        const node = new LinkedListNode_1.LinkedListNode(value);
+        // when empty list
+        if (!this.head) {
+            this.head = node;
+            this.tail = node;
+            this.length++;
+            return node;
+        }
+        // non-empty, append to tail
+        node.prev = this.tail;
+        this.tail.next = node;
+        this.tail = node;
+        this.length++;
+        return node;
+    }
+    /**
+     * Finds the node at a specific position
+     */
+    valueAt(index) {
+        const node = this.nodeAt(index);
+        if (node)
+            return node.value;
+    }
+    /**
+     * Finds the node for the index or throws an out of range exception
+     */
+    nodeAt(index) {
+        // error when index out of range
+        if (index < 0 || index > this.length) {
+            throw new RangeError('Index out of range');
+        }
+        // seek until index is found
+        let currentNode = this.head;
+        let count = 0;
+        while (count < index) {
+            currentNode = currentNode.next;
+            count++;
+        }
+        return currentNode;
+    }
+    /**
+     * Removes the node at the index and returns its value.
+     * Head or tail removal is an O(1) operation. For removal of other indexes
+     * is at worst O(N).
+     */
+    remove(index) {
+        // error when index out of range
+        if (index < 0 || index > this.length) {
+            throw new RangeError('Index out of range');
+        }
+        let removeNode;
+        let prevNode = null;
+        let nextNode = null;
+        // first node simply removes the node at the tip
+        if (index === 0) {
+            removeNode = this.head;
+            nextNode = this.head.next;
+            // adjust head
+            this.head = nextNode;
+        }
+        // last node, update the tail and mark next as null
+        if (index === this.length - 1) {
+            removeNode = this.tail;
+            prevNode = this.tail.prev;
+            // adjust tail
+            this.tail = prevNode;
+        }
+        // middle node
+        if (!removeNode) {
+            removeNode = this.nodeAt(index);
+            prevNode = removeNode.prev;
+            nextNode = removeNode.next;
+        }
+        // splice out the node afer null checking
+        if (prevNode)
+            prevNode.next = nextNode;
+        if (nextNode)
+            nextNode.prev = prevNode;
+        this.length--;
+        return removeNode.value;
+    }
+}
+exports.LinkedList = LinkedList;
+//# sourceMappingURL=LinkedList.js.map

package/.yalc/@node-dlc/core/dist/LinkedList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedList.js","sourceRoot":"","sources":["../lib/LinkedList.ts"],"names":[],"mappings":";;;AAAA,qDAAkD;AAElD;;;GAGG;AACH,MAAa,UAAU;IAAvB;QACS,WAAM,GAAG,CAAC,CAAC;QACX,SAAI,GAAsB,IAAI,CAAC;QAC/B,SAAI,GAAsB,IAAI,CAAC;IAqGxC,CAAC;IAnGC;;;;OAIG;IACI,GAAG,CAAC,KAAQ;QACjB,MAAM,IAAI,GAAG,IAAI,+BAAc,CAAC,KAAK,CAAC,CAAC;QAEvC,kBAAkB;QAClB,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACd,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,MAAM,EAAE,CAAC;YACd,OAAO,IAAI,CAAC;SACb;QAED,4BAA4B;QAC5B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,KAAa;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC,KAAK,CAAC;IAC9B,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,KAAa;QACzB,gCAAgC;QAChC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE;YACpC,MAAM,IAAI,UAAU,CAAC,oBAAoB,CAAC,CAAC;SAC5C;QAED,4BAA4B;QAC5B,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,KAAK,GAAG,KAAK,EAAE;YACpB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;YAC/B,KAAK,EAAE,CAAC;SACT;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,KAAa;QACzB,gCAAgC;QAChC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE;YACpC,MAAM,IAAI,UAAU,CAAC,oBAAoB,CAAC,CAAC;SAC5C;QAED,IAAI,UAAU,CAAC;QACf,IAAI,QAAQ,GAAG,IAAI,CAAC;QACpB,IAAI,QAAQ,GAAG,IAAI,CAAC;QAEpB,gDAAgD;QAChD,IAAI,KAAK,KAAK,CAAC,EAAE;YACf,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAE1B,cAAc;YACd,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;SACtB;QAED,mDAAmD;QACnD,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YAC7B,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC;YACvB,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAE1B,cAAc;YACd,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;SACtB;QAED,cAAc;QACd,IAAI,CAAC,UAAU,EAAE;YACf,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAChC,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC;YAC3B,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC;SAC5B;QAED,yCAAyC;QACzC,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC;QACvC,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC;QACvC,IAAI,CAAC,MAAM,EAAE,CAAC;QAEd,OAAO,UAAU,CAAC,KAAK,CAAC;IAC1B,CAAC;CACF;AAxGD,gCAwGC"}

package/.yalc/@node-dlc/core/dist/LinkedListNode.d.ts

@@ -0,0 +1,9 @@
+export declare class LinkedListNode<T> {
+    value: T;
+    prev: LinkedListNode<T>;
+    next: LinkedListNode<T>;
+    /**
+     * Creates a linked list node with the specified data
+     */
+    constructor(value: T);
+}

package/.yalc/@node-dlc/core/dist/LinkedListNode.js

@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LinkedListNode = void 0;
+class LinkedListNode {
+    /**
+     * Creates a linked list node with the specified data
+     */
+    constructor(value) {
+        this.value = value;
+        this.prev = null;
+        this.next = null;
+    }
+}
+exports.LinkedListNode = LinkedListNode;
+//# sourceMappingURL=LinkedListNode.js.map

package/.yalc/@node-dlc/core/dist/LinkedListNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedListNode.js","sourceRoot":"","sources":["../lib/LinkedListNode.ts"],"names":[],"mappings":";;;AAAA,MAAa,cAAc;IAKzB;;OAEG;IACH,YAAY,KAAQ;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAbD,wCAaC"}

package/.yalc/@node-dlc/core/dist/Queue.d.ts

@@ -0,0 +1,22 @@
+/**
+ * FIFO queue implemented with O(1) enqueue and dequeue operations
+ */
+export declare class Queue<T> {
+    private _list;
+    /**
+     * Peak the tip value
+     */
+    peak(): T;
+    /**
+     * Returns the length of the queue
+     */
+    get length(): number;
+    /**
+     * Enqueue a value
+     */
+    enqueue(value: T): void;
+    /**
+     * Dequeue top most value
+     */
+    dequeue(): T;
+}

package/.yalc/@node-dlc/core/dist/Queue.js

@@ -0,0 +1,38 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Queue = void 0;
+const LinkedList_1 = require("./LinkedList");
+/**
+ * FIFO queue implemented with O(1) enqueue and dequeue operations
+ */
+class Queue {
+    constructor() {
+        this._list = new LinkedList_1.LinkedList();
+    }
+    /**
+     * Peak the tip value
+     */
+    peak() {
+        return this._list.head && this._list.head.value;
+    }
+    /**
+     * Returns the length of the queue
+     */
+    get length() {
+        return this._list.length;
+    }
+    /**
+     * Enqueue a value
+     */
+    enqueue(value) {
+        this._list.add(value);
+    }
+    /**
+     * Dequeue top most value
+     */
+    dequeue() {
+        return this._list.remove(0);
+    }
+}
+exports.Queue = Queue;
+//# sourceMappingURL=Queue.js.map

package/.yalc/@node-dlc/core/dist/Queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../lib/Queue.ts"],"names":[],"mappings":";;;AAAA,6CAA0C;AAE1C;;GAEG;AACH,MAAa,KAAK;IAAlB;QACU,UAAK,GAAkB,IAAI,uBAAU,EAAK,CAAC;IA6BrD,CAAC;IA3BC;;OAEG;IACI,IAAI;QACT,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IAClD,CAAC;IAED;;OAEG;IACH,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;OAEG;IACI,OAAO,CAAC,KAAQ;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED;;OAEG;IACI,OAAO;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC;CACF;AA9BD,sBA8BC"}

package/.yalc/@node-dlc/core/dist/ShortChannelId.d.ts

@@ -0,0 +1 @@
+export { ShortChannelId } from '@node-dlc/common';

package/.yalc/@node-dlc/core/dist/ShortChannelId.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ShortChannelId = void 0;
+// Re-export ShortChannelId from common package to maintain backward compatibility
+var common_1 = require("@node-dlc/common");
+Object.defineProperty(exports, "ShortChannelId", { enumerable: true, get: function () { return common_1.ShortChannelId; } });
+//# sourceMappingURL=ShortChannelId.js.map

package/.yalc/@node-dlc/core/dist/ShortChannelId.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShortChannelId.js","sourceRoot":"","sources":["../lib/ShortChannelId.ts"],"names":[],"mappings":";;;AAAA,kFAAkF;AAClF,2CAAkD;AAAzC,wGAAA,cAAc,OAAA"}

package/.yalc/@node-dlc/core/dist/ShortChannelIdUtils.d.ts

@@ -0,0 +1 @@
+export { shortChannelIdFromBuffer, shortChannelIdFromNumber, shortChannelIdFromString, shortChannelIdToBuffer, shortChannelIdToNumber, shortChannelIdToString, } from '@node-dlc/common';

package/.yalc/@node-dlc/core/dist/ShortChannelIdUtils.js

@@ -0,0 +1,12 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.shortChannelIdToString = exports.shortChannelIdToNumber = exports.shortChannelIdToBuffer = exports.shortChannelIdFromString = exports.shortChannelIdFromNumber = exports.shortChannelIdFromBuffer = void 0;
+// Re-export ShortChannelId utilities from common package to maintain backward compatibility
+var common_1 = require("@node-dlc/common");
+Object.defineProperty(exports, "shortChannelIdFromBuffer", { enumerable: true, get: function () { return common_1.shortChannelIdFromBuffer; } });
+Object.defineProperty(exports, "shortChannelIdFromNumber", { enumerable: true, get: function () { return common_1.shortChannelIdFromNumber; } });
+Object.defineProperty(exports, "shortChannelIdFromString", { enumerable: true, get: function () { return common_1.shortChannelIdFromString; } });
+Object.defineProperty(exports, "shortChannelIdToBuffer", { enumerable: true, get: function () { return common_1.shortChannelIdToBuffer; } });
+Object.defineProperty(exports, "shortChannelIdToNumber", { enumerable: true, get: function () { return common_1.shortChannelIdToNumber; } });
+Object.defineProperty(exports, "shortChannelIdToString", { enumerable: true, get: function () { return common_1.shortChannelIdToString; } });
+//# sourceMappingURL=ShortChannelIdUtils.js.map

package/.yalc/@node-dlc/core/dist/ShortChannelIdUtils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ShortChannelIdUtils.js","sourceRoot":"","sources":["../lib/ShortChannelIdUtils.ts"],"names":[],"mappings":";;;AAAA,4FAA4F;AAC5F,2CAO0B;AANxB,kHAAA,wBAAwB,OAAA;AACxB,kHAAA,wBAAwB,OAAA;AACxB,kHAAA,wBAAwB,OAAA;AACxB,gHAAA,sBAAsB,OAAA;AACtB,gHAAA,sBAAsB,OAAA;AACtB,gHAAA,sBAAsB,OAAA"}

package/.yalc/@node-dlc/core/dist/dlc/CETCalculator.d.ts

@@ -0,0 +1,50 @@
+import BigNumber from 'bignumber.js';
+import { HyperbolaPayoutCurve } from './HyperbolaPayoutCurve';
+import { PolynomialPayoutCurve } from './PolynomialPayoutCurve';
+export declare function zipWithIndex<T>(arr: T[]): [T, number][];
+export declare function dropUntil<T>(data: T[], check: (_: T) => boolean): T[];
+export declare function decompose(num: bigint, base: number, numDigits: number): number[];
+export declare function separatePrefix(start: bigint, end: bigint, base: number, numDigits: number): {
+    prefixDigits: number[];
+    startDigits: number[];
+    endDigits: number[];
+};
+export declare function frontGroupings(digits: number[], base: number): number[][];
+export declare function backGroupings(digits: number[], base: number): number[][];
+export declare function middleGroupings(firstDigitStart: number, firstDigitEnd: number): number[][];
+export declare function groupByIgnoringDigits(start: bigint, end: bigint, base: number, numDigits: number): number[][];
+export interface RoundingInterval {
+    beginInterval: bigint;
+    roundingMod: bigint;
+}
+export type CETPayout = {
+    indexFrom: bigint;
+    indexTo: bigint;
+    payout: bigint;
+};
+/**
+ * Performs optimized evaluation and rounding for strictly monotonic hyperbolas on intervals (from, to)
+ * e.g. hyperbolas with the form b = c = 0
+ *
+ * The next start of a payout range is determined by finding the outcome at the next mid-rounding payout.
+ * Uses an inverse function of the hyperbola to find the outcome.
+ *
+ * Optimizes rounding from O(to - from) to O(totalCollateral / rounding)
+ *
+ *
+ * Evaluates and rounds a payout_function equivalent to:
+ *
+ *   payout_function_v0
+ *    num_pieces: 1
+ *    endpoint_0: from
+ *    endpoint_payout_0: fromPayout
+ *    extra_precision_0: 0
+ *    payout_curve_piece: HyperbolaPayoutCurve
+ *    endpoint_1: to
+ *    endpoint_payout_1: toPayout
+ */
+export declare function splitIntoRanges(from: bigint, to: bigint, fromPayout: bigint, // endpoint_payout
+toPayout: bigint, // endpoint_payout
+totalCollateral: bigint, curve: HyperbolaPayoutCurve | PolynomialPayoutCurve, roundingIntervals: RoundingInterval[]): CETPayout[];
+export declare const mergePayouts: (payouts: CETPayout[]) => CETPayout[];
+export declare function roundPayout(payout: BigNumber, rounding: bigint): bigint;