starknet 6.1.2 → 6.1.3

package/dist/index.mjs

@@ -1,13 +1,8 @@
 var __defProp = Object.defineProperty;
-var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
 var __export = (target, all) => {
   for (var name in all)
     __defProp(target, name, { get: all[name], enumerable: true });
 };
-var __publicField = (obj, key, value) => {
-  __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
-  return value;
-};
 
 // src/constants.ts
 var constants_exports = {};
@@ -690,9 +685,10 @@ var UINT_256_LOW_MAX = 340282366920938463463374607431768211455n;
 var UINT_256_HIGH_MAX = 340282366920938463463374607431768211455n;
 var UINT_256_LOW_MIN = 0n;
 var UINT_256_HIGH_MIN = 0n;
-var _CairoUint256 = class {
+var CairoUint256 = class _CairoUint256 {
   low;
   high;
+  static abiSelector = "core::integer::u256";
   constructor(...arr) {
     if (typeof arr[0] === "object" && arr.length === 1 && "low" in arr[0] && "high" in arr[0]) {
       const props = _CairoUint256.validateProps(arr[0].low, arr[0].high);
@@ -785,8 +781,6 @@ var _CairoUint256 = class {
     return [CairoFelt(this.low), CairoFelt(this.high)];
   }
 };
-var CairoUint256 = _CairoUint256;
-__publicField(CairoUint256, "abiSelector", "core::integer::u256");
 
 // src/utils/calldata/cairo.ts
 var isLen = (name) => /_len$/.test(name);
@@ -1924,14 +1918,14 @@ function validateFields(abiMethod, args, structs, enums) {
 }
 
 // src/utils/calldata/index.ts
-var CallData = class {
+var CallData = class _CallData {
   abi;
   parser;
   structs;
   enums;
   constructor(abi) {
-    this.structs = CallData.getAbiStruct(abi);
-    this.enums = CallData.getAbiEnum(abi);
+    this.structs = _CallData.getAbiStruct(abi);
+    this.enums = _CallData.getAbiEnum(abi);
     this.parser = createAbiParser(abi);
     this.abi = this.parser.getLegacyFormat();
   }
@@ -2147,7 +2141,7 @@ var CallData = class {
    * @returns Calldata
    */
   static toCalldata(rawCalldata = []) {
-    return CallData.compile(rawCalldata);
+    return _CallData.compile(rawCalldata);
   }
   /**
    * Helper: Convert raw to HexCalldata
@@ -2155,7 +2149,7 @@ var CallData = class {
    * @returns HexCalldata
    */
   static toHex(raw = []) {
-    const calldata = CallData.compile(raw);
+    const calldata = _CallData.compile(raw);
     return calldata.map((it) => toHex(it));
   }
   /**
@@ -3913,9 +3907,9 @@ function getStarknetIdContract(chainId) {
 }
 
 // src/provider/extensions/starknetId.ts
-var StarknetId = class {
+var StarknetId = class _StarknetId {
   async getStarkName(address, StarknetIdContract2) {
-    return StarknetId.getStarkName(
+    return _StarknetId.getStarkName(
       // After Mixin, this is ProviderInterface
       this,
       address,
@@ -3923,7 +3917,7 @@ var StarknetId = class {
     );
   }
   async getAddressFromStarkName(name, StarknetIdContract2) {
-    return StarknetId.getAddressFromStarkName(
+    return _StarknetId.getAddressFromStarkName(
       // After Mixin, this is ProviderInterface
       this,
       name,
@@ -4009,7 +4003,7 @@ __export(merkle_exports, {
   MerkleTree: () => MerkleTree,
   proofMerklePath: () => proofMerklePath
 });
-var MerkleTree = class {
+var MerkleTree = class _MerkleTree {
   leaves;
   branches = [];
   root;
@@ -4034,9 +4028,9 @@ var MerkleTree = class {
     const newLeaves = [];
     for (let i = 0; i < leaves.length; i += 2) {
       if (i + 1 === leaves.length) {
-        newLeaves.push(MerkleTree.hash(leaves[i], "0x0", this.hashMethod));
+        newLeaves.push(_MerkleTree.hash(leaves[i], "0x0", this.hashMethod));
       } else {
-        newLeaves.push(MerkleTree.hash(leaves[i], leaves[i + 1], this.hashMethod));
+        newLeaves.push(_MerkleTree.hash(leaves[i], leaves[i + 1], this.hashMethod));
       }
     }
     return this.build(newLeaves);
@@ -4070,7 +4064,7 @@ var MerkleTree = class {
     const currentBranchLevelIndex = this.leaves.length === branch.length ? -1 : this.branches.findIndex((b) => b.length === branch.length);
     const nextBranch = this.branches[currentBranchLevelIndex + 1] ?? [this.root];
     return this.getProof(
-      MerkleTree.hash(isLeft ? leaf : neededBranch, isLeft ? neededBranch : leaf, this.hashMethod),
+      _MerkleTree.hash(isLeft ? leaf : neededBranch, isLeft ? neededBranch : leaf, this.hashMethod),
       nextBranch,
       newHashPath
     );