@gardenfi/swap 0.1.3-beta.16 → 0.1.3-beta.17

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (298) hide show
  1. package/dist/index102.cjs +1 -1
  2. package/dist/index102.js +1 -1
  3. package/dist/index106.cjs +1 -1
  4. package/dist/index106.js +1 -1
  5. package/dist/index107.cjs +1 -1
  6. package/dist/index107.js +6 -6
  7. package/dist/index109.cjs +1 -1
  8. package/dist/index109.js +4 -4
  9. package/dist/index110.cjs +1 -1
  10. package/dist/index110.js +3 -3
  11. package/dist/index116.cjs +1 -1
  12. package/dist/index116.js +1 -1
  13. package/dist/index119.cjs +1 -1
  14. package/dist/index119.js +1 -1
  15. package/dist/index120.cjs +1 -1
  16. package/dist/index120.js +1 -1
  17. package/dist/index123.cjs +1 -1
  18. package/dist/index123.js +2 -2
  19. package/dist/index124.cjs +1 -1
  20. package/dist/index124.js +7 -7
  21. package/dist/index129.cjs +1 -1
  22. package/dist/index129.js +2 -2
  23. package/dist/index130.cjs +1 -1
  24. package/dist/index130.js +1 -1
  25. package/dist/index131.cjs +1 -1
  26. package/dist/index131.js +1 -1
  27. package/dist/index132.cjs +1 -1
  28. package/dist/index132.js +1 -1
  29. package/dist/index133.cjs +1 -1
  30. package/dist/index133.js +2 -2
  31. package/dist/index134.cjs +1 -1
  32. package/dist/index134.js +2 -2
  33. package/dist/index141.cjs +1 -1
  34. package/dist/index141.js +4 -4
  35. package/dist/index142.cjs +1 -1
  36. package/dist/index142.js +1 -1
  37. package/dist/index143.cjs +1 -1
  38. package/dist/index143.js +3 -3
  39. package/dist/index146.cjs +1 -1
  40. package/dist/index146.js +1 -1
  41. package/dist/index148.cjs +1 -1
  42. package/dist/index148.js +1 -1
  43. package/dist/index149.cjs +1 -1
  44. package/dist/index149.js +1 -1
  45. package/dist/index151.cjs +1 -1
  46. package/dist/index151.js +1 -1
  47. package/dist/index152.cjs +1 -1
  48. package/dist/index152.js +1 -1
  49. package/dist/index157.cjs +1 -1
  50. package/dist/index157.js +1 -1
  51. package/dist/index159.cjs +1 -1
  52. package/dist/index159.js +1 -1
  53. package/dist/index161.cjs +1 -1
  54. package/dist/index161.js +1 -1
  55. package/dist/index162.cjs +1 -1
  56. package/dist/index162.js +1 -1
  57. package/dist/index164.cjs +1 -1
  58. package/dist/index164.js +4 -4
  59. package/dist/index165.cjs +1 -1
  60. package/dist/index165.js +3 -3
  61. package/dist/index171.cjs +1 -1
  62. package/dist/index171.js +1 -1
  63. package/dist/index176.cjs +1 -1
  64. package/dist/index176.js +2 -2
  65. package/dist/index179.cjs +1 -1
  66. package/dist/index179.js +1 -1
  67. package/dist/index181.cjs +1 -1
  68. package/dist/index181.js +1 -1
  69. package/dist/index216.cjs +1 -1
  70. package/dist/index216.js +1 -1
  71. package/dist/index217.cjs +1 -1
  72. package/dist/index217.js +1 -1
  73. package/dist/index24.cjs +1 -1
  74. package/dist/index24.js +2 -2
  75. package/dist/index250.cjs +1 -1
  76. package/dist/index250.js +2 -2
  77. package/dist/index251.cjs +1 -1
  78. package/dist/index251.js +1 -1
  79. package/dist/index262.cjs +1 -1
  80. package/dist/index262.js +1 -1
  81. package/dist/index263.cjs +1 -1
  82. package/dist/index263.js +1 -1
  83. package/dist/index265.cjs +1 -1
  84. package/dist/index265.js +1 -1
  85. package/dist/index271.cjs +1 -1
  86. package/dist/index271.js +41 -14
  87. package/dist/index272.cjs +1 -1
  88. package/dist/index272.js +12 -23
  89. package/dist/index273.cjs +1 -1
  90. package/dist/index273.js +24 -12
  91. package/dist/index274.cjs +1 -1
  92. package/dist/index274.js +12 -9
  93. package/dist/index275.cjs +1 -1
  94. package/dist/index275.js +9 -30
  95. package/dist/index276.cjs +1 -1
  96. package/dist/index276.js +31 -2
  97. package/dist/index277.cjs +1 -1
  98. package/dist/index277.js +2 -48
  99. package/dist/index278.cjs +1 -1
  100. package/dist/index278.js +46 -10
  101. package/dist/index279.cjs +1 -1
  102. package/dist/index279.js +10 -173
  103. package/dist/index280.cjs +1 -2
  104. package/dist/index280.js +154 -71
  105. package/dist/index281.cjs +2 -1
  106. package/dist/index281.js +90 -39
  107. package/dist/index282.cjs +1 -1
  108. package/dist/index282.js +40 -4
  109. package/dist/index283.cjs +1 -1
  110. package/dist/index283.js +4 -163
  111. package/dist/index284.cjs +1 -1
  112. package/dist/index284.js +164 -5
  113. package/dist/index285.cjs +1 -1
  114. package/dist/index285.js +5 -41
  115. package/dist/index29.cjs +1 -1
  116. package/dist/index29.js +1 -1
  117. package/dist/index30.cjs +1 -1
  118. package/dist/index30.js +2 -2
  119. package/dist/index306.cjs +1 -1
  120. package/dist/index306.js +10 -43
  121. package/dist/index307.cjs +1 -1
  122. package/dist/index307.js +16 -320
  123. package/dist/index308.cjs +1 -1
  124. package/dist/index308.js +21 -604
  125. package/dist/index309.cjs +1 -1
  126. package/dist/index309.js +14 -110
  127. package/dist/index310.cjs +1 -1
  128. package/dist/index310.js +13 -167
  129. package/dist/index311.cjs +1 -1
  130. package/dist/index311.js +13 -300
  131. package/dist/index312.cjs +1 -1
  132. package/dist/index312.js +9 -93
  133. package/dist/index313.cjs +1 -1
  134. package/dist/index313.js +13 -54
  135. package/dist/index314.cjs +1 -1
  136. package/dist/index314.js +23 -51
  137. package/dist/index315.cjs +1 -1
  138. package/dist/index315.js +30 -43
  139. package/dist/index316.cjs +2 -1
  140. package/dist/index316.js +18 -15
  141. package/dist/index317.cjs +1 -1
  142. package/dist/index317.js +14 -317
  143. package/dist/index318.cjs +1 -1
  144. package/dist/index318.js +11 -59
  145. package/dist/index319.cjs +1 -1
  146. package/dist/index319.js +42 -19
  147. package/dist/index320.cjs +1 -1
  148. package/dist/index320.js +318 -27
  149. package/dist/index321.cjs +1 -1
  150. package/dist/index321.js +605 -3
  151. package/dist/index322.cjs +1 -7
  152. package/dist/index322.js +107 -235
  153. package/dist/index323.cjs +1 -1
  154. package/dist/index323.js +168 -48
  155. package/dist/index324.cjs +1 -1
  156. package/dist/index324.js +292 -203
  157. package/dist/index325.cjs +1 -1
  158. package/dist/index325.js +93 -81
  159. package/dist/index326.cjs +1 -1
  160. package/dist/index326.js +55 -28
  161. package/dist/index327.cjs +1 -1
  162. package/dist/index327.js +47 -70
  163. package/dist/index328.cjs +1 -1
  164. package/dist/index328.js +44 -9
  165. package/dist/index329.cjs +1 -1
  166. package/dist/index329.js +14 -15
  167. package/dist/index330.cjs +1 -1
  168. package/dist/index330.js +316 -21
  169. package/dist/index331.cjs +1 -1
  170. package/dist/index331.js +59 -13
  171. package/dist/index332.cjs +1 -1
  172. package/dist/index332.js +18 -12
  173. package/dist/index333.cjs +1 -1
  174. package/dist/index333.js +28 -13
  175. package/dist/index334.cjs +1 -1
  176. package/dist/index334.js +3 -9
  177. package/dist/index335.cjs +7 -1
  178. package/dist/index335.js +237 -15
  179. package/dist/index336.cjs +1 -1
  180. package/dist/index336.js +48 -26
  181. package/dist/index337.cjs +1 -1
  182. package/dist/index337.js +208 -27
  183. package/dist/index338.cjs +1 -2
  184. package/dist/index338.js +81 -18
  185. package/dist/index339.cjs +1 -1
  186. package/dist/index339.js +28 -13
  187. package/dist/index340.cjs +1 -1
  188. package/dist/index340.js +76 -11
  189. package/dist/index342.cjs +1 -1
  190. package/dist/index342.js +102 -32
  191. package/dist/index343.cjs +1 -1
  192. package/dist/index343.js +31 -113
  193. package/dist/index344.cjs +1 -1
  194. package/dist/index344.js +113 -101
  195. package/dist/index348.cjs +1 -1
  196. package/dist/index348.js +1 -1
  197. package/dist/index349.cjs +1 -1
  198. package/dist/index349.js +1 -1
  199. package/dist/index350.cjs +1 -1
  200. package/dist/index350.js +1 -1
  201. package/dist/index351.cjs +1 -1
  202. package/dist/index351.js +3 -3
  203. package/dist/index352.cjs +1 -2
  204. package/dist/index352.js +4 -193
  205. package/dist/index353.cjs +2 -1
  206. package/dist/index353.js +168 -52
  207. package/dist/index354.cjs +1 -1
  208. package/dist/index354.js +65 -331
  209. package/dist/index355.cjs +1 -1
  210. package/dist/index355.js +332 -149
  211. package/dist/index356.cjs +1 -1
  212. package/dist/index356.js +161 -5
  213. package/dist/index357.cjs +1 -1
  214. package/dist/index357.js +5 -5
  215. package/dist/index358.cjs +1 -1
  216. package/dist/index358.js +1 -1
  217. package/dist/index360.cjs +1 -1
  218. package/dist/index360.js +1 -1
  219. package/dist/index364.cjs +1 -1
  220. package/dist/index364.js +3 -94
  221. package/dist/index365.cjs +1 -1
  222. package/dist/index365.js +137 -25
  223. package/dist/index366.cjs +1 -1
  224. package/dist/index366.js +129 -144
  225. package/dist/index367.cjs +1 -1
  226. package/dist/index367.js +71 -331
  227. package/dist/index368.cjs +1 -1
  228. package/dist/index368.js +28 -3
  229. package/dist/index369.cjs +1 -1
  230. package/dist/index369.js +143 -135
  231. package/dist/index370.cjs +1 -1
  232. package/dist/index370.js +343 -264
  233. package/dist/index371.cjs +1 -1
  234. package/dist/index371.js +73 -170
  235. package/dist/index372.cjs +1 -1
  236. package/dist/index372.js +32 -10
  237. package/dist/index373.cjs +1 -1
  238. package/dist/index373.js +5 -107
  239. package/dist/index374.cjs +1 -1
  240. package/dist/index374.js +275 -5
  241. package/dist/index375.cjs +1 -1
  242. package/dist/index375.js +170 -73
  243. package/dist/index376.cjs +1 -1
  244. package/dist/index376.js +10 -10
  245. package/dist/index377.cjs +1 -1
  246. package/dist/index377.js +105 -29
  247. package/dist/index378.cjs +1 -1
  248. package/dist/index378.js +9 -133
  249. package/dist/index379.cjs +1 -1
  250. package/dist/index379.js +1 -1
  251. package/dist/index381.cjs +1 -1
  252. package/dist/index381.js +1 -1
  253. package/dist/index386.cjs +1 -1
  254. package/dist/index386.js +59 -106
  255. package/dist/index387.cjs +1 -1
  256. package/dist/index387.js +110 -3
  257. package/dist/index388.cjs +1 -1
  258. package/dist/index388.js +3 -63
  259. package/dist/index389.cjs +1 -1
  260. package/dist/index389.js +2 -2
  261. package/dist/index39.cjs +1 -1
  262. package/dist/index39.js +83 -24
  263. package/dist/index40.cjs +1 -1
  264. package/dist/index40.js +11 -15
  265. package/dist/index41.cjs +1 -1
  266. package/dist/index41.js +24 -103
  267. package/dist/index42.cjs +1 -1
  268. package/dist/index42.js +16 -86
  269. package/dist/index43.cjs +1 -1
  270. package/dist/index43.js +105 -11
  271. package/dist/index68.cjs +1 -1
  272. package/dist/index68.js +3 -3
  273. package/dist/index70.cjs +1 -1
  274. package/dist/index70.js +1 -1
  275. package/dist/index71.cjs +1 -1
  276. package/dist/index71.js +12 -19
  277. package/dist/index72.cjs +1 -1
  278. package/dist/index72.js +36 -12
  279. package/dist/index73.cjs +1 -1
  280. package/dist/index73.js +41 -36
  281. package/dist/index74.cjs +1 -1
  282. package/dist/index74.js +39 -38
  283. package/dist/index75.cjs +1 -1
  284. package/dist/index75.js +24 -42
  285. package/dist/index76.cjs +1 -1
  286. package/dist/index76.js +52 -22
  287. package/dist/index77.cjs +1 -1
  288. package/dist/index77.js +25 -52
  289. package/dist/index78.cjs +1 -1
  290. package/dist/index78.js +20 -28
  291. package/dist/index80.cjs +1 -1
  292. package/dist/index80.js +13 -13
  293. package/dist/index84.cjs +1 -1
  294. package/dist/index84.js +1 -1
  295. package/dist/index95.cjs +1 -1
  296. package/dist/index95.js +1 -1
  297. package/dist/src/lib/store/swapStore.d.ts +1 -1
  298. package/package.json +5 -5
package/dist/index377.js CHANGED
@@ -1,34 +1,110 @@
1
- import { bcs as r } from "./index367.js";
2
- import { Address as s } from "./index370.js";
3
- function n(e) {
4
- switch (e) {
5
- case "u8":
6
- return r.u8();
7
- case "u16":
8
- return r.u16();
9
- case "u32":
10
- return r.u32();
11
- case "u64":
12
- return r.u64();
13
- case "u128":
14
- return r.u128();
15
- case "u256":
16
- return r.u256();
17
- case "bool":
18
- return r.bool();
19
- case "string":
20
- return r.string();
21
- case "id":
22
- case "address":
23
- return s;
1
+ import { bcs as r } from "./index336.js";
2
+ import { normalizeSuiAddress as n } from "./index120.js";
3
+ import { MOVE_STDLIB_ADDRESS as s, SUI_FRAMEWORK_ADDRESS as a } from "./index376.js";
4
+ const d = "object", i = "ID", f = "ascii", T = "String", _ = "string", l = "String", U = "option", m = "Option";
5
+ function M(e) {
6
+ const t = typeof e.body == "object" && "datatype" in e.body ? e.body.datatype : null;
7
+ return !!t && n(t.package) === n("0x2") && t.module === "tx_context" && t.type === "TxContext";
8
+ }
9
+ function u(e) {
10
+ if (typeof e == "string")
11
+ switch (e) {
12
+ case "address":
13
+ return r.Address;
14
+ case "bool":
15
+ return r.Bool;
16
+ case "u8":
17
+ return r.U8;
18
+ case "u16":
19
+ return r.U16;
20
+ case "u32":
21
+ return r.U32;
22
+ case "u64":
23
+ return r.U64;
24
+ case "u128":
25
+ return r.U128;
26
+ case "u256":
27
+ return r.U256;
28
+ default:
29
+ throw new Error(`Unknown type signature ${e}`);
30
+ }
31
+ if ("vector" in e) {
32
+ if (e.vector === "u8")
33
+ return r.byteVector().transform({
34
+ input: (o) => typeof o == "string" ? new TextEncoder().encode(o) : o,
35
+ output: (o) => o
36
+ });
37
+ const t = u(e.vector);
38
+ return t ? r.vector(t) : null;
24
39
  }
25
- const t = e.match(/^(vector|option)<(.+)>$/);
26
- if (t) {
27
- const [c, u] = t.slice(1);
28
- return c === "vector" ? r.vector(n(u)) : r.option(n(u));
40
+ if ("datatype" in e) {
41
+ const t = n(e.datatype.package);
42
+ if (t === n(s)) {
43
+ if (e.datatype.module === f && e.datatype.type === T)
44
+ return r.String;
45
+ if (e.datatype.module === _ && e.datatype.type === l)
46
+ return r.String;
47
+ if (e.datatype.module === U && e.datatype.type === m) {
48
+ const o = u(e.datatype.typeParameters[0]);
49
+ return o ? r.vector(o) : null;
50
+ }
51
+ }
52
+ if (t === n(a) && e.datatype.module === d && e.datatype.type === i)
53
+ return r.Address;
29
54
  }
30
- throw new Error(`Invalid Pure type name: ${e}`);
55
+ return null;
56
+ }
57
+ function D(e) {
58
+ return typeof e == "object" && "Reference" in e ? {
59
+ ref: "&",
60
+ body: c(e.Reference)
61
+ } : typeof e == "object" && "MutableReference" in e ? {
62
+ ref: "&mut",
63
+ body: c(e.MutableReference)
64
+ } : {
65
+ ref: null,
66
+ body: c(e)
67
+ };
68
+ }
69
+ function c(e) {
70
+ if (typeof e == "string")
71
+ switch (e) {
72
+ case "Address":
73
+ return "address";
74
+ case "Bool":
75
+ return "bool";
76
+ case "U8":
77
+ return "u8";
78
+ case "U16":
79
+ return "u16";
80
+ case "U32":
81
+ return "u32";
82
+ case "U64":
83
+ return "u64";
84
+ case "U128":
85
+ return "u128";
86
+ case "U256":
87
+ return "u256";
88
+ default:
89
+ throw new Error(`Unexpected type ${e}`);
90
+ }
91
+ if ("Vector" in e)
92
+ return { vector: c(e.Vector) };
93
+ if ("Struct" in e)
94
+ return {
95
+ datatype: {
96
+ package: e.Struct.address,
97
+ module: e.Struct.module,
98
+ type: e.Struct.name,
99
+ typeParameters: e.Struct.typeArguments.map(c)
100
+ }
101
+ };
102
+ if ("TypeParameter" in e)
103
+ return { typeParameter: e.TypeParameter };
104
+ throw new Error(`Unexpected type ${JSON.stringify(e)}`);
31
105
  }
32
106
  export {
33
- n as pureBcsSchemaFromTypeName
107
+ u as getPureBcsSchema,
108
+ M as isTxContext,
109
+ D as normalizedTypeToMoveTypeSignature
34
110
  };
package/dist/index378.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const d=require("./index280.cjs"),E=require("./index350.cjs"),m=require("./index279.cjs"),f=require("./index388.cjs"),A=require("./index295.cjs"),l=require("./index288.cjs");function q(r,e={}){const{prepare:i=!0}=e,n=Array.isArray(r)||typeof r=="string"?A.parseAbiItem(r):r;return{...n,...i?{hash:s(n)}:{}}}function g(r,e,i){const{args:n=[],prepare:o=!0}=i??{},w=m.validate(e,{strict:!1}),a=r.filter(t=>w?t.type==="function"||t.type==="error"?I(t)===m.slice(e,0,4):t.type==="event"?s(t)===e:!1:"name"in t&&t.name===e);if(a.length===0)throw new b({name:e});if(a.length===1)return{...a[0],...o?{hash:s(a[0])}:{}};let u;for(const t of a){if(!("inputs"in t))continue;if(!n||n.length===0){if(!t.inputs||t.inputs.length===0)return{...t,...o?{hash:s(t)}:{}};continue}if(!t.inputs||t.inputs.length===0||t.inputs.length!==n.length)continue;if(n.every((c,v)=>{const y="inputs"in t&&t.inputs[v];return y?f.isArgOfType(c,y):!1})){if(u&&"inputs"in u&&u.inputs){const c=f.getAmbiguousTypes(t.inputs,u.inputs,n);if(c)throw new $({abiItem:t,type:c[0]},{abiItem:u,type:c[1]})}u=t}}const h=(()=>{if(u)return u;const[t,...p]=a;return{...t,overloads:p}})();if(!h)throw new b({name:e});return{...h,...o?{hash:s(h)}:{}}}function I(...r){const e=(()=>{if(Array.isArray(r[0])){const[i,n]=r;return g(i,n)}return r[0]})();return m.slice(s(e),0,4)}function S(...r){const e=(()=>{if(Array.isArray(r[0])){const[n,o]=r;return g(n,o)}return r[0]})(),i=typeof e=="string"?e:l.formatAbiItem(e);return f.normalizeSignature(i)}function s(...r){const e=(()=>{if(Array.isArray(r[0])){const[i,n]=r;return g(i,n)}return r[0]})();return typeof e!="string"&&"hash"in e&&e.hash?e.hash:E.keccak256(m.fromString(S(e)))}class $ extends d.BaseError{constructor(e,i){super("Found ambiguous types in overloaded ABI Items.",{metaMessages:[`\`${e.type}\` in \`${f.normalizeSignature(l.formatAbiItem(e.abiItem))}\`, and`,`\`${i.type}\` in \`${f.normalizeSignature(l.formatAbiItem(i.abiItem))}\``,"","These types encode differently and cannot be distinguished at runtime.","Remove one of the ambiguous items in the ABI."]}),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.AmbiguityError"})}}class b extends d.BaseError{constructor({name:e,data:i,type:n="item"}){const o=e?` with name "${e}"`:i?` with data "${i}"`:"";super(`ABI ${n}${o} not found.`),Object.defineProperty(this,"name",{enumerable:!0,configurable:!0,writable:!0,value:"AbiItem.NotFoundError"})}}exports.AmbiguityError=$;exports.NotFoundError=b;exports.from=q;exports.fromAbi=g;exports.getSelector=I;exports.getSignature=S;exports.getSignatureHash=s;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index118.cjs"),o=require("./index388.cjs"),t=require("./index336.cjs");function u(i,r,s){const a=t.bcs.Address.serialize(i).toBytes(),n=t.bcs.TypeTag.serialize(r).toBytes(),d=t.bcs.u64().serialize(s.length).toBytes(),e=o.blake2b.create({dkLen:32});return e.update(new Uint8Array([240])),e.update(a),e.update(d),e.update(s),e.update(n),`0x${c.toHex(e.digest().slice(0,32))}`}exports.deriveDynamicFieldID=u;
package/dist/index378.js CHANGED
@@ -1,136 +1,12 @@
1
- import { BaseError as d } from "./index280.js";
2
- import { keccak256 as v } from "./index350.js";
3
- import { validate as $, slice as A, fromString as S } from "./index279.js";
4
- import { isArgOfType as E, normalizeSignature as m, getAmbiguousTypes as B } from "./index388.js";
5
- import { parseAbiItem as y } from "./index295.js";
6
- import { formatAbiItem as p } from "./index288.js";
7
- function H(r, t = {}) {
8
- const { prepare: i = !0 } = t, n = Array.isArray(r) ? y(r) : typeof r == "string" ? y(r) : r;
9
- return {
10
- ...n,
11
- ...i ? { hash: f(n) } : {}
12
- };
13
- }
14
- function h(r, t, i) {
15
- const { args: n = [], prepare: u = !0 } = i ?? {}, w = $(t, { strict: !1 }), s = r.filter((e) => w ? e.type === "function" || e.type === "error" ? T(e) === A(t, 0, 4) : e.type === "event" ? f(e) === t : !1 : "name" in e && e.name === t);
16
- if (s.length === 0)
17
- throw new b({ name: t });
18
- if (s.length === 1)
19
- return {
20
- ...s[0],
21
- ...u ? { hash: f(s[0]) } : {}
22
- };
23
- let o;
24
- for (const e of s) {
25
- if (!("inputs" in e))
26
- continue;
27
- if (!n || n.length === 0) {
28
- if (!e.inputs || e.inputs.length === 0)
29
- return {
30
- ...e,
31
- ...u ? { hash: f(e) } : {}
32
- };
33
- continue;
34
- }
35
- if (!e.inputs || e.inputs.length === 0 || e.inputs.length !== n.length)
36
- continue;
37
- if (n.every((a, I) => {
38
- const l = "inputs" in e && e.inputs[I];
39
- return l ? E(a, l) : !1;
40
- })) {
41
- if (o && "inputs" in o && o.inputs) {
42
- const a = B(e.inputs, o.inputs, n);
43
- if (a)
44
- throw new O({
45
- abiItem: e,
46
- type: a[0]
47
- }, {
48
- abiItem: o,
49
- type: a[1]
50
- });
51
- }
52
- o = e;
53
- }
54
- }
55
- const c = (() => {
56
- if (o)
57
- return o;
58
- const [e, ...g] = s;
59
- return { ...e, overloads: g };
60
- })();
61
- if (!c)
62
- throw new b({ name: t });
63
- return {
64
- ...c,
65
- ...u ? { hash: f(c) } : {}
66
- };
67
- }
68
- function T(...r) {
69
- const t = (() => {
70
- if (Array.isArray(r[0])) {
71
- const [i, n] = r;
72
- return h(i, n);
73
- }
74
- return r[0];
75
- })();
76
- return A(f(t), 0, 4);
77
- }
78
- function F(...r) {
79
- const t = (() => {
80
- if (Array.isArray(r[0])) {
81
- const [n, u] = r;
82
- return h(n, u);
83
- }
84
- return r[0];
85
- })(), i = typeof t == "string" ? t : p(t);
86
- return m(i);
87
- }
88
- function f(...r) {
89
- const t = (() => {
90
- if (Array.isArray(r[0])) {
91
- const [i, n] = r;
92
- return h(i, n);
93
- }
94
- return r[0];
95
- })();
96
- return typeof t != "string" && "hash" in t && t.hash ? t.hash : v(S(F(t)));
97
- }
98
- class O extends d {
99
- constructor(t, i) {
100
- super("Found ambiguous types in overloaded ABI Items.", {
101
- metaMessages: [
102
- // TODO: abitype to add support for signature-formatted ABI items.
103
- `\`${t.type}\` in \`${m(p(t.abiItem))}\`, and`,
104
- `\`${i.type}\` in \`${m(p(i.abiItem))}\``,
105
- "",
106
- "These types encode differently and cannot be distinguished at runtime.",
107
- "Remove one of the ambiguous items in the ABI."
108
- ]
109
- }), Object.defineProperty(this, "name", {
110
- enumerable: !0,
111
- configurable: !0,
112
- writable: !0,
113
- value: "AbiItem.AmbiguityError"
114
- });
115
- }
116
- }
117
- class b extends d {
118
- constructor({ name: t, data: i, type: n = "item" }) {
119
- const u = t ? ` with name "${t}"` : i ? ` with data "${i}"` : "";
120
- super(`ABI ${n}${u} not found.`), Object.defineProperty(this, "name", {
121
- enumerable: !0,
122
- configurable: !0,
123
- writable: !0,
124
- value: "AbiItem.NotFoundError"
125
- });
126
- }
1
+ import { toHex as n } from "./index118.js";
2
+ import { blake2b as c } from "./index388.js";
3
+ import { bcs as t } from "./index336.js";
4
+ function m(r, a, s) {
5
+ const i = t.Address.serialize(r).toBytes(), o = t.TypeTag.serialize(a).toBytes(), d = t.u64().serialize(s.length).toBytes(), e = c.create({
6
+ dkLen: 32
7
+ });
8
+ return e.update(new Uint8Array([240])), e.update(i), e.update(d), e.update(s), e.update(o), `0x${n(e.digest().slice(0, 32))}`;
127
9
  }
128
10
  export {
129
- O as AmbiguityError,
130
- b as NotFoundError,
131
- H as from,
132
- h as fromAbi,
133
- T as getSelector,
134
- F as getSignature,
135
- f as getSignatureHash
11
+ m as deriveDynamicFieldID
136
12
  };
package/dist/index379.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index343.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const f=require("./index344.cjs");function p(o,t,s,i){if(typeof o.setBigUint64=="function")return o.setBigUint64(t,s,i);const n=BigInt(32),r=BigInt(4294967295),e=Number(s>>n&r),h=Number(s&r),u=i?4:0,l=i?0:4;o.setUint32(t+u,e,i),o.setUint32(t+l,h,i)}function g(o,t,s){return o&t^~o&s}function b(o,t,s){return o&t^o&s^t&s}class d extends f.Hash{constructor(t,s,i,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=t,this.outputLen=s,this.padOffset=i,this.isLE=n,this.buffer=new Uint8Array(t),this.view=f.createView(this.buffer)}update(t){f.aexists(this),t=f.toBytes(t),f.abytes(t);const{view:s,buffer:i,blockLen:n}=this,r=t.length;for(let e=0;e<r;){const h=Math.min(n-this.pos,r-e);if(h===n){const u=f.createView(t);for(;n<=r-e;e+=n)this.process(u,e);continue}i.set(t.subarray(e,e+h),this.pos),this.pos+=h,e+=h,this.pos===n&&(this.process(s,0),this.pos=0)}return this.length+=t.length,this.roundClean(),this}digestInto(t){f.aexists(this),f.aoutput(t,this),this.finished=!0;const{buffer:s,view:i,blockLen:n,isLE:r}=this;let{pos:e}=this;s[e++]=128,f.clean(this.buffer.subarray(e)),this.padOffset>n-e&&(this.process(i,0),e=0);for(let c=e;c<n;c++)s[c]=0;p(i,n-8,BigInt(this.length*8),r),this.process(i,0);const h=f.createView(t),u=this.outputLen;if(u%4)throw new Error("_sha2: outputLen should be aligned to 32bit");const l=u/4,a=this.get();if(l>a.length)throw new Error("_sha2: outputLen bigger than state");for(let c=0;c<l;c++)h.setUint32(4*c,a[c],r)}digest(){const{buffer:t,outputLen:s}=this;this.digestInto(t);const i=t.slice(0,s);return this.destroy(),i}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:s,buffer:i,length:n,finished:r,destroyed:e,pos:h}=this;return t.destroyed=e,t.finished=r,t.length=n,t.pos=h,n%s&&t.buffer.set(i),t}clone(){return this._cloneInto()}}const w=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]);exports.Chi=g;exports.HashMD=d;exports.Maj=b;exports.SHA256_IV=w;exports.setBigUint64=p;
package/dist/index379.js CHANGED
@@ -1,4 +1,4 @@
1
- import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index343.js";
1
+ import { Hash as g, createView as l, aexists as b, toBytes as a, abytes as d, aoutput as x, clean as w } from "./index344.js";
2
2
  function y(o, t, s, n) {
3
3
  if (typeof o.setBigUint64 == "function")
4
4
  return o.setBigUint64(t, s, n);
package/dist/index381.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index343.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("./index344.cjs");class r extends i.Hash{constructor(t,h){super(),this.finished=!1,this.destroyed=!1,i.ahash(t);const n=i.toBytes(h);if(this.iHash=t.create(),typeof this.iHash.update!="function")throw new Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const a=this.blockLen,e=new Uint8Array(a);e.set(n.length>a?t.create().update(n).digest():n);for(let s=0;s<e.length;s++)e[s]^=54;this.iHash.update(e),this.oHash=t.create();for(let s=0;s<e.length;s++)e[s]^=106;this.oHash.update(e),i.clean(e)}update(t){return i.aexists(this),this.iHash.update(t),this}digestInto(t){i.aexists(this),i.abytes(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:h,iHash:n,finished:a,destroyed:e,blockLen:s,outputLen:d}=this;return t=t,t.finished=a,t.destroyed=e,t.blockLen=s,t.outputLen=d,t.oHash=h._cloneInto(t.oHash),t.iHash=n._cloneInto(t.iHash),t}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const c=(o,t,h)=>new r(o,t).update(h).digest();c.create=(o,t)=>new r(o,t);exports.HMAC=r;exports.hmac=c;
package/dist/index381.js CHANGED
@@ -1,4 +1,4 @@
1
- import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index343.js";
1
+ import { Hash as d, ahash as u, toBytes as H, clean as l, aexists as a, abytes as p } from "./index344.js";
2
2
  class r extends d {
3
3
  constructor(t, i) {
4
4
  super(), this.finished = !1, this.destroyed = !1, u(t);
package/dist/index386.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function x(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function p(e,r){return Array.isArray(r)?r.length===0?!0:e?r.every(t=>typeof t=="string"):r.every(t=>Number.isSafeInteger(t)):!1}function w(e,r){if(typeof r!="string")throw new Error(`${e}: string expected`);return!0}function b(e){if(!Number.isSafeInteger(e))throw new Error(`invalid integer: ${e}`)}function h(e){if(!Array.isArray(e))throw new Error("array expected")}function A(e,r){if(!p(!0,r))throw new Error(`${e}: array of strings expected`)}function m(e,r){if(!p(!1,r))throw new Error(`${e}: array of numbers expected`)}function E(...e){const r=n=>n,t=(n,a)=>o=>n(a(o)),c=e.map(n=>n.encode).reduceRight(t,r),i=e.map(n=>n.decode).reduce(t,r);return{encode:c,decode:i}}function $(e){const r=typeof e=="string"?e.split(""):e,t=r.length;A("alphabet",r);const c=new Map(r.map((i,n)=>[i,n]));return{encode:i=>(h(i),i.map(n=>{if(!Number.isSafeInteger(n)||n<0||n>=t)throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);return r[n]})),decode:i=>(h(i),i.map(n=>{w("alphabet.decode",n);const a=c.get(n);if(a===void 0)throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);return a}))}}function S(e=""){return w("join",e),{encode:r=>(A("join.decode",r),r.join(e)),decode:r=>(w("join.decode",r),r.split(e))}}function g(e,r,t){if(r<2)throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);if(t<2)throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);if(h(e),!e.length)return[];let c=0;const i=[],n=Array.from(e,o=>{if(b(o),o<0||o>=r)throw new Error(`invalid integer: ${o}`);return o}),a=n.length;for(;;){let o=0,d=!0;for(let s=c;s<a;s++){const y=n[s],l=r*o,u=l+y;if(!Number.isSafeInteger(u)||l/r!==o||u-y!==l)throw new Error("convertRadix: carry overflow");const v=u/t;o=u%t;const f=Math.floor(v);if(n[s]=f,!Number.isSafeInteger(f)||f*t+o!==u)throw new Error("convertRadix: carry overflow");if(d)f?d=!1:c=s;else continue}if(i.push(o),d)break}for(let o=0;o<e.length-1&&e[o]===0;o++)i.push(0);return i.reverse()}function j(e){b(e);const r=2**8;return{encode:t=>{if(!x(t))throw new Error("radix.encode input should be Uint8Array");return g(Array.from(t),r,e)},decode:t=>(m("radix.decode",t),Uint8Array.from(g(t,e,r)))}}const R=e=>E(j(58),$(e),S("")),N=R("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");exports.base58=N;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const c=require("./index354.cjs"),a=require("./index281.cjs");function d(r){let i=!0,t="",e=0,n="",o=!1;for(let s=0;s<r.length;s++){const u=r[s];if(["(",")",","].includes(u)&&(i=!0),u==="("&&e++,u===")"&&e--,!!i){if(e===0){if(u===" "&&["event","function","error",""].includes(n))n="";else if(n+=u,u===")"){o=!0;break}continue}if(u===" "){r[s-1]!==","&&t!==","&&t!==",("&&(t="",i=!1);continue}n+=u,t+=u}}if(!o)throw new a.BaseError("Unable to normalize signature.");return n}function l(r,i){const t=typeof r,e=i.type;switch(e){case"address":return c.validate(r,{strict:!1});case"bool":return t==="boolean";case"function":return t==="string";case"string":return t==="string";default:return e==="tuple"&&"components"in i?Object.values(i.components).every((n,o)=>l(Object.values(r)[o],n)):/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e)?t==="number"||t==="bigint":/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e)?t==="string"||r instanceof Uint8Array:/[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e)?Array.isArray(r)&&r.every(n=>l(n,{...i,type:e.replace(/(\[[0-9]{0,}\])$/,"")})):!1}}function f(r,i,t){for(const e in r){const n=r[e],o=i[e];if(n.type==="tuple"&&o.type==="tuple"&&"components"in n&&"components"in o)return f(n.components,o.components,t[e]);const s=[n.type,o.type];if(s.includes("address")&&s.includes("bytes20")?!0:s.includes("address")&&s.includes("string")?c.validate(t[e],{strict:!1}):s.includes("address")&&s.includes("bytes")?c.validate(t[e],{strict:!1}):!1)return s}}exports.getAmbiguousTypes=f;exports.isArgOfType=l;exports.normalizeSignature=d;
package/dist/index386.js CHANGED
@@ -1,112 +1,65 @@
1
- /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
2
- function x(e) {
3
- return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
4
- }
5
- function g(e, r) {
6
- return Array.isArray(r) ? r.length === 0 ? !0 : e ? r.every((t) => typeof t == "string") : r.every((t) => Number.isSafeInteger(t)) : !1;
7
- }
8
- function w(e, r) {
9
- if (typeof r != "string")
10
- throw new Error(`${e}: string expected`);
11
- return !0;
12
- }
13
- function b(e) {
14
- if (!Number.isSafeInteger(e))
15
- throw new Error(`invalid integer: ${e}`);
16
- }
17
- function h(e) {
18
- if (!Array.isArray(e))
19
- throw new Error("array expected");
20
- }
21
- function A(e, r) {
22
- if (!g(!0, r))
23
- throw new Error(`${e}: array of strings expected`);
24
- }
25
- function E(e, r) {
26
- if (!g(!1, r))
27
- throw new Error(`${e}: array of numbers expected`);
28
- }
29
- // @__NO_SIDE_EFFECTS__
30
- function m(...e) {
31
- const r = (n) => n, t = (n, a) => (o) => n(a(o)), c = e.map((n) => n.encode).reduceRight(t, r), i = e.map((n) => n.decode).reduce(t, r);
32
- return { encode: c, decode: i };
33
- }
34
- // @__NO_SIDE_EFFECTS__
35
- function $(e) {
36
- const r = typeof e == "string" ? e.split("") : e, t = r.length;
37
- A("alphabet", r);
38
- const c = new Map(r.map((i, n) => [i, n]));
39
- return {
40
- encode: (i) => (h(i), i.map((n) => {
41
- if (!Number.isSafeInteger(n) || n < 0 || n >= t)
42
- throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);
43
- return r[n];
44
- })),
45
- decode: (i) => (h(i), i.map((n) => {
46
- w("alphabet.decode", n);
47
- const a = c.get(n);
48
- if (a === void 0)
49
- throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);
50
- return a;
51
- }))
52
- };
53
- }
54
- // @__NO_SIDE_EFFECTS__
55
- function R(e = "") {
56
- return w("join", e), {
57
- encode: (r) => (A("join.decode", r), r.join(e)),
58
- decode: (r) => (w("join.decode", r), r.split(e))
59
- };
60
- }
61
- function p(e, r, t) {
62
- if (r < 2)
63
- throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);
64
- if (t < 2)
65
- throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);
66
- if (h(e), !e.length)
67
- return [];
68
- let c = 0;
69
- const i = [], n = Array.from(e, (o) => {
70
- if (b(o), o < 0 || o >= r)
71
- throw new Error(`invalid integer: ${o}`);
72
- return o;
73
- }), a = n.length;
74
- for (; ; ) {
75
- let o = 0, d = !0;
76
- for (let s = c; s < a; s++) {
77
- const y = n[s], l = r * o, f = l + y;
78
- if (!Number.isSafeInteger(f) || l / r !== o || f - y !== l)
79
- throw new Error("convertRadix: carry overflow");
80
- const v = f / t;
81
- o = f % t;
82
- const u = Math.floor(v);
83
- if (n[s] = u, !Number.isSafeInteger(u) || u * t + o !== f)
84
- throw new Error("convertRadix: carry overflow");
85
- if (d)
86
- u ? d = !1 : c = s;
87
- else continue;
1
+ import { validate as c } from "./index354.js";
2
+ import { BaseError as f } from "./index281.js";
3
+ function y(r) {
4
+ let i = !0, t = "", e = 0, n = "", o = !1;
5
+ for (let s = 0; s < r.length; s++) {
6
+ const u = r[s];
7
+ if (["(", ")", ","].includes(u) && (i = !0), u === "(" && e++, u === ")" && e--, !!i) {
8
+ if (e === 0) {
9
+ if (u === " " && ["event", "function", "error", ""].includes(n))
10
+ n = "";
11
+ else if (n += u, u === ")") {
12
+ o = !0;
13
+ break;
14
+ }
15
+ continue;
16
+ }
17
+ if (u === " ") {
18
+ r[s - 1] !== "," && t !== "," && t !== ",(" && (t = "", i = !1);
19
+ continue;
20
+ }
21
+ n += u, t += u;
88
22
  }
89
- if (i.push(o), d)
90
- break;
91
23
  }
92
- for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
93
- i.push(0);
94
- return i.reverse();
24
+ if (!o)
25
+ throw new f("Unable to normalize signature.");
26
+ return n;
95
27
  }
96
- // @__NO_SIDE_EFFECTS__
97
- function j(e) {
98
- b(e);
99
- const r = 2 ** 8;
100
- return {
101
- encode: (t) => {
102
- if (!x(t))
103
- throw new Error("radix.encode input should be Uint8Array");
104
- return p(Array.from(t), r, e);
105
- },
106
- decode: (t) => (E("radix.decode", t), Uint8Array.from(p(t, e, r)))
107
- };
28
+ function l(r, i) {
29
+ const t = typeof r, e = i.type;
30
+ switch (e) {
31
+ case "address":
32
+ return c(r, { strict: !1 });
33
+ case "bool":
34
+ return t === "boolean";
35
+ case "function":
36
+ return t === "string";
37
+ case "string":
38
+ return t === "string";
39
+ default:
40
+ return e === "tuple" && "components" in i ? Object.values(i.components).every((n, o) => l(Object.values(r)[o], n)) : /^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(e) ? t === "number" || t === "bigint" : /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(e) ? t === "string" || r instanceof Uint8Array : /[a-z]+[1-9]{0,3}(\[[0-9]{0,}\])+$/.test(e) ? Array.isArray(r) && r.every((n) => l(n, {
41
+ ...i,
42
+ // Pop off `[]` or `[M]` from end of type
43
+ type: e.replace(/(\[[0-9]{0,}\])$/, "")
44
+ })) : !1;
45
+ }
46
+ }
47
+ function a(r, i, t) {
48
+ for (const e in r) {
49
+ const n = r[e], o = i[e];
50
+ if (n.type === "tuple" && o.type === "tuple" && "components" in n && "components" in o)
51
+ return a(n.components, o.components, t[e]);
52
+ const s = [n.type, o.type];
53
+ if (s.includes("address") && s.includes("bytes20") ? !0 : s.includes("address") && s.includes("string") ? c(t[e], {
54
+ strict: !1
55
+ }) : s.includes("address") && s.includes("bytes") ? c(t[e], {
56
+ strict: !1
57
+ }) : !1)
58
+ return s;
59
+ }
108
60
  }
109
- const N = /* @__NO_SIDE_EFFECTS__ */ (e) => /* @__PURE__ */ m(/* @__PURE__ */ j(58), /* @__PURE__ */ $(e), /* @__PURE__ */ R("")), S = /* @__PURE__ */ N("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
110
61
  export {
111
- S as base58
62
+ a as getAmbiguousTypes,
63
+ l as isArgOfType,
64
+ y as normalizeSignature
112
65
  };
package/dist/index387.cjs CHANGED
@@ -1 +1 @@
1
- "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./index389.cjs"),b=e.blake2b;exports.blake2b=b;
1
+ "use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});/*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */function x(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&e.constructor.name==="Uint8Array"}function p(e,r){return Array.isArray(r)?r.length===0?!0:e?r.every(t=>typeof t=="string"):r.every(t=>Number.isSafeInteger(t)):!1}function w(e,r){if(typeof r!="string")throw new Error(`${e}: string expected`);return!0}function b(e){if(!Number.isSafeInteger(e))throw new Error(`invalid integer: ${e}`)}function h(e){if(!Array.isArray(e))throw new Error("array expected")}function A(e,r){if(!p(!0,r))throw new Error(`${e}: array of strings expected`)}function m(e,r){if(!p(!1,r))throw new Error(`${e}: array of numbers expected`)}function E(...e){const r=n=>n,t=(n,a)=>o=>n(a(o)),c=e.map(n=>n.encode).reduceRight(t,r),i=e.map(n=>n.decode).reduce(t,r);return{encode:c,decode:i}}function $(e){const r=typeof e=="string"?e.split(""):e,t=r.length;A("alphabet",r);const c=new Map(r.map((i,n)=>[i,n]));return{encode:i=>(h(i),i.map(n=>{if(!Number.isSafeInteger(n)||n<0||n>=t)throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);return r[n]})),decode:i=>(h(i),i.map(n=>{w("alphabet.decode",n);const a=c.get(n);if(a===void 0)throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);return a}))}}function S(e=""){return w("join",e),{encode:r=>(A("join.decode",r),r.join(e)),decode:r=>(w("join.decode",r),r.split(e))}}function g(e,r,t){if(r<2)throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);if(t<2)throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);if(h(e),!e.length)return[];let c=0;const i=[],n=Array.from(e,o=>{if(b(o),o<0||o>=r)throw new Error(`invalid integer: ${o}`);return o}),a=n.length;for(;;){let o=0,d=!0;for(let s=c;s<a;s++){const y=n[s],l=r*o,u=l+y;if(!Number.isSafeInteger(u)||l/r!==o||u-y!==l)throw new Error("convertRadix: carry overflow");const v=u/t;o=u%t;const f=Math.floor(v);if(n[s]=f,!Number.isSafeInteger(f)||f*t+o!==u)throw new Error("convertRadix: carry overflow");if(d)f?d=!1:c=s;else continue}if(i.push(o),d)break}for(let o=0;o<e.length-1&&e[o]===0;o++)i.push(0);return i.reverse()}function j(e){b(e);const r=2**8;return{encode:t=>{if(!x(t))throw new Error("radix.encode input should be Uint8Array");return g(Array.from(t),r,e)},decode:t=>(m("radix.decode",t),Uint8Array.from(g(t,e,r)))}}const R=e=>E(j(58),$(e),S("")),N=R("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");exports.base58=N;
package/dist/index387.js CHANGED
@@ -1,5 +1,112 @@
1
- import { blake2b as b } from "./index389.js";
2
- const e = b;
1
+ /*! scure-base - MIT License (c) 2022 Paul Miller (paulmillr.com) */
2
+ function x(e) {
3
+ return e instanceof Uint8Array || ArrayBuffer.isView(e) && e.constructor.name === "Uint8Array";
4
+ }
5
+ function g(e, r) {
6
+ return Array.isArray(r) ? r.length === 0 ? !0 : e ? r.every((t) => typeof t == "string") : r.every((t) => Number.isSafeInteger(t)) : !1;
7
+ }
8
+ function w(e, r) {
9
+ if (typeof r != "string")
10
+ throw new Error(`${e}: string expected`);
11
+ return !0;
12
+ }
13
+ function b(e) {
14
+ if (!Number.isSafeInteger(e))
15
+ throw new Error(`invalid integer: ${e}`);
16
+ }
17
+ function h(e) {
18
+ if (!Array.isArray(e))
19
+ throw new Error("array expected");
20
+ }
21
+ function A(e, r) {
22
+ if (!g(!0, r))
23
+ throw new Error(`${e}: array of strings expected`);
24
+ }
25
+ function E(e, r) {
26
+ if (!g(!1, r))
27
+ throw new Error(`${e}: array of numbers expected`);
28
+ }
29
+ // @__NO_SIDE_EFFECTS__
30
+ function m(...e) {
31
+ const r = (n) => n, t = (n, a) => (o) => n(a(o)), c = e.map((n) => n.encode).reduceRight(t, r), i = e.map((n) => n.decode).reduce(t, r);
32
+ return { encode: c, decode: i };
33
+ }
34
+ // @__NO_SIDE_EFFECTS__
35
+ function $(e) {
36
+ const r = typeof e == "string" ? e.split("") : e, t = r.length;
37
+ A("alphabet", r);
38
+ const c = new Map(r.map((i, n) => [i, n]));
39
+ return {
40
+ encode: (i) => (h(i), i.map((n) => {
41
+ if (!Number.isSafeInteger(n) || n < 0 || n >= t)
42
+ throw new Error(`alphabet.encode: digit index outside alphabet "${n}". Allowed: ${e}`);
43
+ return r[n];
44
+ })),
45
+ decode: (i) => (h(i), i.map((n) => {
46
+ w("alphabet.decode", n);
47
+ const a = c.get(n);
48
+ if (a === void 0)
49
+ throw new Error(`Unknown letter: "${n}". Allowed: ${e}`);
50
+ return a;
51
+ }))
52
+ };
53
+ }
54
+ // @__NO_SIDE_EFFECTS__
55
+ function R(e = "") {
56
+ return w("join", e), {
57
+ encode: (r) => (A("join.decode", r), r.join(e)),
58
+ decode: (r) => (w("join.decode", r), r.split(e))
59
+ };
60
+ }
61
+ function p(e, r, t) {
62
+ if (r < 2)
63
+ throw new Error(`convertRadix: invalid from=${r}, base cannot be less than 2`);
64
+ if (t < 2)
65
+ throw new Error(`convertRadix: invalid to=${t}, base cannot be less than 2`);
66
+ if (h(e), !e.length)
67
+ return [];
68
+ let c = 0;
69
+ const i = [], n = Array.from(e, (o) => {
70
+ if (b(o), o < 0 || o >= r)
71
+ throw new Error(`invalid integer: ${o}`);
72
+ return o;
73
+ }), a = n.length;
74
+ for (; ; ) {
75
+ let o = 0, d = !0;
76
+ for (let s = c; s < a; s++) {
77
+ const y = n[s], l = r * o, f = l + y;
78
+ if (!Number.isSafeInteger(f) || l / r !== o || f - y !== l)
79
+ throw new Error("convertRadix: carry overflow");
80
+ const v = f / t;
81
+ o = f % t;
82
+ const u = Math.floor(v);
83
+ if (n[s] = u, !Number.isSafeInteger(u) || u * t + o !== f)
84
+ throw new Error("convertRadix: carry overflow");
85
+ if (d)
86
+ u ? d = !1 : c = s;
87
+ else continue;
88
+ }
89
+ if (i.push(o), d)
90
+ break;
91
+ }
92
+ for (let o = 0; o < e.length - 1 && e[o] === 0; o++)
93
+ i.push(0);
94
+ return i.reverse();
95
+ }
96
+ // @__NO_SIDE_EFFECTS__
97
+ function j(e) {
98
+ b(e);
99
+ const r = 2 ** 8;
100
+ return {
101
+ encode: (t) => {
102
+ if (!x(t))
103
+ throw new Error("radix.encode input should be Uint8Array");
104
+ return p(Array.from(t), r, e);
105
+ },
106
+ decode: (t) => (E("radix.decode", t), Uint8Array.from(p(t, e, r)))
107
+ };
108
+ }
109
+ const N = /* @__NO_SIDE_EFFECTS__ */ (e) => /* @__PURE__ */ m(/* @__PURE__ */ j(58), /* @__PURE__ */ $(e), /* @__PURE__ */ R("")), S = /* @__PURE__ */ N("123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz");
3
110
  export {
4
- e as blake2b
111
+ S as base58
5
112
  };