@layerzerolabs/ton-sdk-tools 3.0.111 → 3.0.112-aptos.0

package/CHANGELOG.md

@@ -1,11 +1,5 @@
 # @layerzerolabs/ton-sdk-tools
 
-## 3.0.111
-
-### Patch Changes
-
-- e0c412c: Publish new ton packages at July 11 2025
-
 ## 3.0.110
 
 ### Patch Changes

package/dist/index.cjs

@@ -201,11 +201,6 @@ function addLibToBlockchain(blockchain, newLib) {
   libsDict.set(BigInt(`0x${newLib.hash().toString("hex")}`), newLib);
   blockchain.libs = core.beginCell().storeDictDirect(libsDict).endCell();
 }
-function getEncodedMessageFromEncodedPacket(encodedPacket) {
-  const packetSlice = encodedPacket.beginParse();
-  const messageSlice = packetSlice.skip(8).skip(64).skip(32).skip(256).skip(32).skip(256).skip(256);
-  return core.beginCell().storeSlice(messageSlice).endCell();
-}
 
 // src/sdk-tools.ts
 var file_signature_header = `////// Generated by sdk/sdk-generator.ts`;
@@ -7015,215 +7010,6 @@ async function getLzDict(obj, fieldName, wrapper) {
   return new LzDict(dictCell);
 }
 
-// src/ton-bit-array.ts
-var TonBitArray = class _TonBitArray {
-  /**
-   * Creates a new TonBitArray with the specified size.
-   * All bits are initially set to false.
-   * 
-   * @param size The number of bits in the array
-   */
-  constructor(size) {
-    this.size = size;
-    this.bits = new Array(size).fill(false);
-  }
-  /**
-   * Creates a TonBitArray from a single TON Cell.
-   * Reads all bits from the cell sequentially and creates a bit array representation.
-   * 
-   * @param cell The TON Cell to extract bits from
-   * @returns A new TonBitArray containing the bits from the cell
-   */
-  static fromSingleCell(cell) {
-    const slice = cell.beginParse();
-    const bitCount = cell.bits.length;
-    const bitArray = new _TonBitArray(bitCount);
-    for (let i = 0; i < bitCount; i++) {
-      if (slice.loadBit()) {
-        bitArray.set(i);
-      }
-    }
-    return bitArray;
-  }
-  /**
-   * Creates a TonBitArray from a root TON Cell and all its references using depth-first traversal.
-   * Performs a depth-first search through the cell and all its references to collect bits.
-   * The resulting bit array contains bits from the root cell followed by bits from all referenced cells.
-   * 
-   * @param input The root TON Cell to traverse
-   * @returns A new TonBitArray containing bits from the root cell and all its references
-   */
-  static fromRootCellWithDFS(input) {
-    function dfs(cell) {
-      const currentBitArray = _TonBitArray.fromSingleCell(cell);
-      const refBitArrays = cell.refs.map((ref) => dfs(ref));
-      return _TonBitArray.concatMultiple([currentBitArray, ...refBitArrays]);
-    }
-    return dfs(input);
-  }
-  /**
-   * Creates a TonBitArray using a custom iteration algorithm on a TON Cell.
-   * This method provides flexibility for implementing different traversal strategies
-   * (e.g., breadth-first search, filtered traversal, or custom processing logic).
-   * 
-   * @param input The TON Cell to process
-   * @param iterationFn Custom iteration function that processes the cell and returns an array of TonBitArray objects
-   * @returns A new TonBitArray created by concatenating all bit arrays returned by the iteration function
-   */
-  static fromCellWithCustomIteration(input, iterationFn) {
-    const bitArrays = iterationFn(input);
-    return _TonBitArray.concatMultiple(bitArrays);
-  }
-  /**
-   * Sets a bit at the specified index to true.
-   * Does nothing if the index is out of bounds.
-   * 
-   * @param index The zero-based index of the bit to set
-   */
-  set(index) {
-    if (index >= 0 && index < this.size) {
-      this.bits[index] = true;
-    }
-  }
-  /**
-   * Gets the value of a bit at the specified index.
-   * Returns false if the index is out of bounds.
-   * 
-   * @param index The zero-based index of the bit to get
-   * @returns The boolean value of the bit at the specified index, or false if out of bounds
-   */
-  get(index) {
-    if (index >= 0 && index < this.size) {
-      return this.bits[index];
-    }
-    return false;
-  }
-  /**
-   * Compares this TonBitArray with another TonBitArray for equality.
-   * Two bit arrays are considered equal if they have the same size and all bits at corresponding positions are equal.
-   * 
-   * @param other The TonBitArray to compare with this one
-   * @returns True if both bit arrays are equal, false otherwise
-   */
-  equals(other) {
-    if (this.size !== other.size) {
-      return false;
-    }
-    for (let i = 0; i < this.size; i++) {
-      if (this.bits[i] !== other.bits[i]) {
-        return false;
-      }
-    }
-    return true;
-  }
-  /**
-   * Extracts a section of the bit array and returns a new TonBitArray.
-   * Similar to JavaScript's Array.slice() method, this creates a shallow copy of a portion of the bit array.
-   * 
-   * @param start The zero-based index at which to start extraction (inclusive). 
-   *              If negative, it's treated as (size + start). If omitted, defaults to 0.
-   * @param end The zero-based index at which to end extraction (exclusive).
-   *            If negative, it's treated as (size + end). If omitted, extracts to the end of the array.
-   * @returns A new TonBitArray containing the extracted bits
-   * 
-   * @example
-   * const array = new TonBitArray(8)
-   * array.set(1); array.set(3); array.set(5)
-   * const sliced = array.slice(1, 6) // Gets bits from index 1 to 5 (inclusive)
-   */
-  slice(start, end) {
-    const actualStart = start ?? 0;
-    const actualEnd = end ?? this.size;
-    const normalizedStart = actualStart < 0 ? Math.max(0, this.size + actualStart) : Math.min(actualStart, this.size);
-    const normalizedEnd = actualEnd < 0 ? Math.max(0, this.size + actualEnd) : Math.min(actualEnd, this.size);
-    const validStart = Math.min(normalizedStart, normalizedEnd);
-    const validEnd = Math.max(normalizedStart, normalizedEnd);
-    const sliceSize = validEnd - validStart;
-    const result = new _TonBitArray(sliceSize);
-    for (let i = 0; i < sliceSize; i++) {
-      if (this.bits[validStart + i]) {
-        result.set(i);
-      }
-    }
-    return result;
-  }
-  /**
-   * Concatenates this TonBitArray with another TonBitArray.
-   * Creates a new TonBitArray containing all bits from this array followed by all bits from the other array.
-   * 
-   * @param other The TonBitArray to concatenate with this one
-   * @returns A new TonBitArray containing the concatenated bits
-   */
-  concat(other) {
-    const result = new _TonBitArray(this.size + other.size);
-    for (let i = 0; i < this.size; i++) {
-      if (this.get(i)) result.set(i);
-    }
-    for (let i = 0; i < other.size; i++) {
-      if (other.get(i)) result.set(this.size + i);
-    }
-    return result;
-  }
-  /**
-   * Concatenates multiple TonBitArray objects into a single TonBitArray.
-   * Creates a new TonBitArray containing all bits from the input arrays in order.
-   * 
-   * @param arrays An array of TonBitArray objects to concatenate
-   * @returns A new TonBitArray containing all bits from the input arrays
-   */
-  static concatMultiple(arrays) {
-    const totalSize = arrays.reduce((sum, arr) => sum + arr.size, 0);
-    const result = new _TonBitArray(totalSize);
-    let offset = 0;
-    for (const arr of arrays) {
-      for (let i = 0; i < arr.size; i++) {
-        if (arr.get(i)) result.set(offset + i);
-      }
-      offset += arr.size;
-    }
-    return result;
-  }
-  /**
-   * Converts the bit array to a padded representation suitable for byte conversion.
-   * Pads the bit array to the nearest byte boundary (multiple of 8 bits) by adding false bits.
-   * 
-   * @returns A tuple containing the padded boolean array and its size
-   */
-  toPadded() {
-    const selfBitCount = this.size;
-    let arrayBits;
-    let arraySize;
-    const rem = selfBitCount % 8;
-    if (rem > 0) {
-      const paddingSize = 8 - rem;
-      const paddingArray = new _TonBitArray(paddingSize);
-      arrayBits = this.concat(paddingArray).bits;
-      arraySize = selfBitCount + paddingSize;
-    } else {
-      arrayBits = this.bits;
-      arraySize = selfBitCount;
-    }
-    return [arrayBits, arraySize];
-  }
-  /**
-   * Converts the bit array to a Node.js Buffer.
-   * The bit array is first padded to byte boundaries, then converted to a buffer
-   * where each byte represents 8 bits in big-endian format.
-   * 
-   * @returns A Buffer containing the binary representation of the bit array
-   */
-  toBuffer() {
-    const [arrayBits, arraySize] = this.toPadded();
-    const buffer = Buffer.alloc(arraySize / 8);
-    for (let i = 0; i < arraySize; i++) {
-      if (arrayBits[i]) {
-        buffer[Math.floor(i / 8)] |= 1 << 7 - i % 8;
-      }
-    }
-    return buffer;
-  }
-};
-
 exports.BASE_CHAIN_ID = BASE_CHAIN_ID;
 exports.BaseWrapper = BaseWrapper;
 exports.ClasslibWrapper = ClasslibWrapper;
@@ -7244,7 +7030,6 @@ exports.Order = Order;
 exports.PUBLIC_KEY_BYTE_LENGTH = PUBLIC_KEY_BYTE_LENGTH;
 exports.SEED_SIZE = SEED_SIZE;
 exports.SIGNATURE_BYTE_LENGTH = SIGNATURE_BYTE_LENGTH;
-exports.TonBitArray = TonBitArray;
 exports.Txiterator = Txiterator;
 exports._getTypeWidth = _getTypeWidth;
 exports.addLibToBlockchain = addLibToBlockchain;
@@ -7308,7 +7093,6 @@ exports.getBocStringFromMessage = getBocStringFromMessage;
 exports.getCellName = getCellName;
 exports.getCellNameNumber = getCellNameNumber;
 exports.getClosestByteAlignedBits = getClosestByteAlignedBits;
-exports.getEncodedMessageFromEncodedPacket = getEncodedMessageFromEncodedPacket;
 exports.getLzDict = getLzDict;
 exports.getMessageFromBocString = getMessageFromBocString;
 exports.getMsgPrices = getMsgPrices;