@apibara/starknet 2.1.0-beta.34 → 2.1.0-beta.36

package/dist/parser.cjs

@@ -108,12 +108,45 @@ function parseTuple(...parsers) {
     return { out, offset };
   };
 }
+const parseByteArrayStruct = parseStruct({
+  data: {
+    index: 0,
+    parser: parseArray(parseBytes31)
+  },
+  pendingWord: { index: 1, parser: parseFelt252 },
+  pendingWordLen: { index: 2, parser: parseU32 }
+});
+function parseByteArray(data, offset) {
+  const { out, offset: offsetOut } = parseByteArrayStruct(data, offset);
+  const dataBytes = out.data.map((bytes2) => bytes2.slice(2).padStart(62, "0")).join("");
+  let pending = out.pendingWord.toString(16);
+  const pendingWordLength = Number(out.pendingWordLen);
+  if (pending.length < pendingWordLength * 2) {
+    pending = pending.padStart(pendingWordLength * 2, "0");
+  }
+  const pendingBytes = pending.slice(pending.length - 2 * pendingWordLength);
+  const bytes = removeLeadingZeros(dataBytes + pendingBytes);
+  return { out: `0x${bytes}`, offset: offsetOut };
+}
+function removeLeadingZeros(bytes) {
+  for (let i = 0; i < bytes.length; i++) {
+    if (bytes[i] !== "0") {
+      let j = i;
+      if (i % 2 !== 0) {
+        j -= 1;
+      }
+      return bytes.slice(j);
+    }
+  }
+  return "00";
+}
 
 exports.ParseError = ParseError;
 exports.parseArray = parseArray;
 exports.parseAsBigInt = parseAsBigInt;
 exports.parseAsHex = parseAsHex;
 exports.parseBool = parseBool;
+exports.parseByteArray = parseByteArray;
 exports.parseBytes31 = parseBytes31;
 exports.parseClassHash = parseClassHash;
 exports.parseContractAddress = parseContractAddress;

package/dist/parser.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"parser.cjs","sources":["../src/parser.ts"],"sourcesContent":["/*\n * Calldata combinatorial parsers.\n *\n * Based on the Ekubo's event parser.\n *\n * MIT License\n *\n * Copyright (c) 2023 Ekubo, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nimport type { FieldElement } from \"./common\";\n\nexport type Parser<TOut> = (\n  data: readonly FieldElement[],\n  offset: number,\n) => { out: TOut; offset: number };\n\nexport class ParseError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"ParseError\";\n  }\n}\n\n// Primitive types.\n\nfunction assertInBounds(data: readonly FieldElement[], offset: number) {\n  if (offset >= data.length) {\n    throw new ParseError(\n      `Offset out of bounds. Data length ${data.length}, offset ${offset}`,\n    );\n  }\n}\n\nexport function parseBool(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]) > 0n, offset: offset + 1 };\n}\n\nexport function parseAsBigInt(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]), offset: offset + 1 };\n}\n\nexport const parseU8 = parseAsBigInt;\nexport const parseU16 = parseAsBigInt;\nexport const parseU32 = parseAsBigInt;\nexport const parseU64 = parseAsBigInt;\nexport const parseU128 = parseAsBigInt;\nexport const parseUsize = parseAsBigInt;\n\nexport function parseU256(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset + 1);\n  return {\n    out: BigInt(data[offset]) + (BigInt(data[offset + 1]) << 128n),\n    offset: offset + 2,\n  };\n}\n\nexport function parseAsHex(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: data[offset],\n    offset: offset + 1,\n  };\n}\n\nexport const parseContractAddress = parseAsHex;\nexport const parseEthAddress = parseAsHex;\nexport const parseStorageAddress = parseAsHex;\nexport const parseClassHash = parseAsHex;\nexport const parseBytes31 = parseAsHex;\n\nexport function parseFelt252(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: BigInt(data[offset]),\n    offset: offset + 1,\n  };\n}\n\nexport function parseEmpty(_data: readonly FieldElement[], offset: number) {\n  return { out: null, offset };\n}\n\n// Higher-level types.\n\nexport function parseArray<T>(type: Parser<T>): Parser<T[]> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const length = BigInt(data[offset]);\n\n    offset++;\n\n    const out: T[] = [];\n    for (let i = 0; i < length; i++) {\n      const { out: item, offset: newOffset } = type(data, offset);\n      out.push(item);\n      offset = newOffset;\n    }\n\n    return { out, offset };\n  };\n}\n\nexport const parseSpan = parseArray;\n\nexport function parseOption<T>(type: Parser<T>) {\n  return (data: readonly FieldElement[], offset: number) => {\n    const hasValue = BigInt(data[offset]) === 1n;\n    if (hasValue) {\n      return type(data, offset + 1);\n    }\n    return { out: null, offset: offset + 1 };\n  };\n}\n\nexport function parseStruct<T extends Record<string, unknown>>(\n  parsers: { [K in keyof T]: { index: number; parser: Parser<T[K]> } },\n): Parser<{ [K in keyof T]: T[K] }> {\n  const sortedParsers = Object.entries(parsers).sort(\n    (a, b) => a[1].index - b[1].index,\n  );\n  const parser = (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out: Record<string, unknown> = {};\n    for (const [key, { parser }] of sortedParsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out[key] = value;\n      offset = newOffset;\n    }\n    return { out, offset };\n  };\n  return parser as Parser<{ [K in keyof T]: T[K] }>;\n}\n\nexport function parseTuple<T extends Parser<unknown>[]>(\n  ...parsers: T\n): Parser<UnwrapParsers<T>> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out = [];\n    for (const parser of parsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out.push(value);\n      offset = newOffset;\n    }\n    return { out, offset } as { out: UnwrapParsers<T>; offset: number };\n  };\n}\n\ntype UnwrapParsers<TP> = {\n  [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;\n};\n"],"names":["parser"],"mappings":";;AAkCO,MAAM,mBAAmB,KAAM,CAAA;AAAA,EACpC,YAAY,OAAiB,EAAA;AAC3B,IAAA,KAAA,CAAM,OAAO,CAAA,CAAA;AACb,IAAA,IAAA,CAAK,IAAO,GAAA,YAAA,CAAA;AAAA,GACd;AACF,CAAA;AAIA,SAAS,cAAA,CAAe,MAA+B,MAAgB,EAAA;AACrE,EAAI,IAAA,MAAA,IAAU,KAAK,MAAQ,EAAA;AACzB,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAqC,kCAAA,EAAA,IAAA,CAAK,MAAM,CAAA,SAAA,EAAY,MAAM,CAAA,CAAA;AAAA,KACpE,CAAA;AAAA,GACF;AACF,CAAA;AAEgB,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAI,GAAA,EAAA,EAAI,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AAC9D,CAAA;AAEgB,SAAA,aAAA,CAAc,MAA+B,MAAgB,EAAA;AAC3E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,KAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAA,EAAG,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AACzD,CAAA;AAEO,MAAM,OAAU,GAAA,cAAA;AAChB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,SAAY,GAAA,cAAA;AAClB,MAAM,UAAa,GAAA,cAAA;AAEV,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAe,cAAA,CAAA,IAAA,EAAM,SAAS,CAAC,CAAA,CAAA;AAC/B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAK,IAAA,MAAA,CAAO,IAAK,CAAA,MAAA,GAAS,CAAC,CAAC,CAAK,IAAA,IAAA,CAAA;AAAA,IACzD,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,MAA+B,MAAgB,EAAA;AACxE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,KAAK,MAAM,CAAA;AAAA,IAChB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEO,MAAM,oBAAuB,GAAA,WAAA;AAC7B,MAAM,eAAkB,GAAA,WAAA;AACxB,MAAM,mBAAsB,GAAA,WAAA;AAC5B,MAAM,cAAiB,GAAA,WAAA;AACvB,MAAM,YAAe,GAAA,WAAA;AAEZ,SAAA,YAAA,CAAa,MAA+B,MAAgB,EAAA;AAC1E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA;AAAA,IACxB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,OAAgC,MAAgB,EAAA;AACzE,EAAO,OAAA,EAAE,GAAK,EAAA,IAAA,EAAM,MAAO,EAAA,CAAA;AAC7B,CAAA;AAIO,SAAS,WAAc,IAA8B,EAAA;AAC1D,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAS,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA,CAAA;AAElC,IAAA,MAAA,EAAA,CAAA;AAEA,IAAA,MAAM,MAAW,EAAC,CAAA;AAClB,IAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,MAAA,EAAQ,CAAK,EAAA,EAAA;AAC/B,MAAM,MAAA,EAAE,KAAK,IAAM,EAAA,MAAA,EAAQ,WAAc,GAAA,IAAA,CAAK,MAAM,MAAM,CAAA,CAAA;AAC1D,MAAA,GAAA,CAAI,KAAK,IAAI,CAAA,CAAA;AACb,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AAEA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF,CAAA;AAEO,MAAM,SAAY,GAAA,WAAA;AAElB,SAAS,YAAe,IAAiB,EAAA;AAC9C,EAAO,OAAA,CAAC,MAA+B,MAAmB,KAAA;AACxD,IAAA,MAAM,QAAW,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAM,KAAA,EAAA,CAAA;AAC1C,IAAA,IAAI,QAAU,EAAA;AACZ,MAAO,OAAA,IAAA,CAAK,IAAM,EAAA,MAAA,GAAS,CAAC,CAAA,CAAA;AAAA,KAC9B;AACA,IAAA,OAAO,EAAE,GAAA,EAAK,IAAM,EAAA,MAAA,EAAQ,SAAS,CAAE,EAAA,CAAA;AAAA,GACzC,CAAA;AACF,CAAA;AAEO,SAAS,YACd,OACkC,EAAA;AAClC,EAAA,MAAM,aAAgB,GAAA,MAAA,CAAO,OAAQ,CAAA,OAAO,CAAE,CAAA,IAAA;AAAA,IAC5C,CAAC,GAAG,CAAM,KAAA,CAAA,CAAE,CAAC,CAAE,CAAA,KAAA,GAAQ,CAAE,CAAA,CAAC,CAAE,CAAA,KAAA;AAAA,GAC9B,CAAA;AACA,EAAM,MAAA,MAAA,GAAS,CAAC,IAAA,EAA+B,cAA2B,KAAA;AACxE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAA+B,EAAC,CAAA;AACtC,IAAA,KAAA,MAAW,CAAC,GAAK,EAAA,EAAE,QAAAA,OAAO,EAAC,KAAK,aAAe,EAAA;AAC7C,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAcA,GAAAA,OAAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,GAAG,CAAI,GAAA,KAAA,CAAA;AACX,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACA,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;AAEO,SAAS,cACX,OACuB,EAAA;AAC1B,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAM,EAAC,CAAA;AACb,IAAA,KAAA,MAAW,UAAU,OAAS,EAAA;AAC5B,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAc,GAAA,MAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA,CAAA;AACd,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF;;;;;;;;;;;;;;;;;;;;;;;;;;"}
+{"version":3,"file":"parser.cjs","sources":["../src/parser.ts"],"sourcesContent":["/*\n * Calldata combinatorial parsers.\n *\n * Based on the Ekubo's event parser.\n *\n * MIT License\n *\n * Copyright (c) 2023 Ekubo, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nimport type { FieldElement } from \"./common\";\n\nexport type Parser<TOut> = (\n  data: readonly FieldElement[],\n  offset: number,\n) => { out: TOut; offset: number };\n\nexport class ParseError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"ParseError\";\n  }\n}\n\n// Primitive types.\n\nfunction assertInBounds(data: readonly FieldElement[], offset: number) {\n  if (offset >= data.length) {\n    throw new ParseError(\n      `Offset out of bounds. Data length ${data.length}, offset ${offset}`,\n    );\n  }\n}\n\nexport function parseBool(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]) > 0n, offset: offset + 1 };\n}\n\nexport function parseAsBigInt(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]), offset: offset + 1 };\n}\n\nexport const parseU8 = parseAsBigInt;\nexport const parseU16 = parseAsBigInt;\nexport const parseU32 = parseAsBigInt;\nexport const parseU64 = parseAsBigInt;\nexport const parseU128 = parseAsBigInt;\nexport const parseUsize = parseAsBigInt;\n\nexport function parseU256(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset + 1);\n  return {\n    out: BigInt(data[offset]) + (BigInt(data[offset + 1]) << 128n),\n    offset: offset + 2,\n  };\n}\n\nexport function parseAsHex(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: data[offset],\n    offset: offset + 1,\n  };\n}\n\nexport const parseContractAddress = parseAsHex;\nexport const parseEthAddress = parseAsHex;\nexport const parseStorageAddress = parseAsHex;\nexport const parseClassHash = parseAsHex;\nexport const parseBytes31 = parseAsHex;\n\nexport function parseFelt252(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: BigInt(data[offset]),\n    offset: offset + 1,\n  };\n}\n\nexport function parseEmpty(_data: readonly FieldElement[], offset: number) {\n  return { out: null, offset };\n}\n\n// Higher-level types.\n\nexport function parseArray<T>(type: Parser<T>): Parser<T[]> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const length = BigInt(data[offset]);\n\n    offset++;\n\n    const out: T[] = [];\n    for (let i = 0; i < length; i++) {\n      const { out: item, offset: newOffset } = type(data, offset);\n      out.push(item);\n      offset = newOffset;\n    }\n\n    return { out, offset };\n  };\n}\n\nexport const parseSpan = parseArray;\n\nexport function parseOption<T>(type: Parser<T>) {\n  return (data: readonly FieldElement[], offset: number) => {\n    const hasValue = BigInt(data[offset]) === 1n;\n    if (hasValue) {\n      return type(data, offset + 1);\n    }\n    return { out: null, offset: offset + 1 };\n  };\n}\n\nexport function parseStruct<T extends Record<string, unknown>>(\n  parsers: {\n    [K in keyof T]: { index: number; parser: Parser<T[K]> };\n  },\n): Parser<{ [K in keyof T]: T[K] }> {\n  const sortedParsers = Object.entries(parsers).sort(\n    (a, b) => a[1].index - b[1].index,\n  );\n  const parser = (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out: Record<string, unknown> = {};\n    for (const [key, { parser }] of sortedParsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out[key] = value;\n      offset = newOffset;\n    }\n    return { out, offset };\n  };\n  return parser as Parser<{ [K in keyof T]: T[K] }>;\n}\n\nexport function parseTuple<T extends Parser<unknown>[]>(\n  ...parsers: T\n): Parser<UnwrapParsers<T>> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out = [];\n    for (const parser of parsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out.push(value);\n      offset = newOffset;\n    }\n    return { out, offset } as { out: UnwrapParsers<T>; offset: number };\n  };\n}\n\ntype UnwrapParsers<TP> = {\n  [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;\n};\n\nconst parseByteArrayStruct = parseStruct({\n  data: {\n    index: 0,\n    parser: parseArray(parseBytes31),\n  },\n  pendingWord: { index: 1, parser: parseFelt252 },\n  pendingWordLen: { index: 2, parser: parseU32 },\n});\n\nexport function parseByteArray(data: readonly FieldElement[], offset: number) {\n  // A ByteArray is a struct with the following abi:\n  //\n  // {\n  //   name: \"core::byte_array::ByteArray\",\n  //   type: \"struct\",\n  //   members: [\n  //     {\n  //       name: \"data\",\n  //       type: \"core::array::Array::<core::bytes_31::bytes31>\",\n  //     },\n  //     {\n  //       name: \"pending_word\",\n  //       type: \"core::felt252\",\n  //     },\n  //     {\n  //       name: \"pending_word_len\",\n  //       type: \"core::integer::u32\",\n  //     },\n  //   ],\n  // },\n  //\n  // We first parse it using a parser for that struct, then convert it to the output `0x${string}` type.\n  const { out, offset: offsetOut } = parseByteArrayStruct(data, offset);\n\n  // Remove 0x prefix from data elements and pad them to 31 bytes.\n  const dataBytes = out.data\n    .map((bytes) => bytes.slice(2).padStart(62, \"0\"))\n    .join(\"\");\n\n  let pending = out.pendingWord.toString(16);\n  const pendingWordLength = Number(out.pendingWordLen);\n  if (pending.length < pendingWordLength * 2) {\n    pending = pending.padStart(pendingWordLength * 2, \"0\");\n  }\n\n  const pendingBytes = pending.slice(pending.length - 2 * pendingWordLength);\n  const bytes = removeLeadingZeros(dataBytes + pendingBytes);\n\n  return { out: `0x${bytes}`, offset: offsetOut };\n}\n\nfunction removeLeadingZeros(bytes: string): string {\n  for (let i = 0; i < bytes.length; i++) {\n    if (bytes[i] !== \"0\") {\n      let j = i;\n      if (i % 2 !== 0) {\n        j -= 1;\n      }\n      return bytes.slice(j);\n    }\n  }\n  // The bytes are all 0, so return something reasonable.\n  return \"00\";\n}\n"],"names":["parser","bytes"],"mappings":";;AAkCO,MAAM,mBAAmB,KAAM,CAAA;AAAA,EACpC,YAAY,OAAiB,EAAA;AAC3B,IAAA,KAAA,CAAM,OAAO,CAAA,CAAA;AACb,IAAA,IAAA,CAAK,IAAO,GAAA,YAAA,CAAA;AAAA,GACd;AACF,CAAA;AAIA,SAAS,cAAA,CAAe,MAA+B,MAAgB,EAAA;AACrE,EAAI,IAAA,MAAA,IAAU,KAAK,MAAQ,EAAA;AACzB,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAqC,kCAAA,EAAA,IAAA,CAAK,MAAM,CAAA,SAAA,EAAY,MAAM,CAAA,CAAA;AAAA,KACpE,CAAA;AAAA,GACF;AACF,CAAA;AAEgB,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAI,GAAA,EAAA,EAAI,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AAC9D,CAAA;AAEgB,SAAA,aAAA,CAAc,MAA+B,MAAgB,EAAA;AAC3E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,KAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAA,EAAG,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AACzD,CAAA;AAEO,MAAM,OAAU,GAAA,cAAA;AAChB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,SAAY,GAAA,cAAA;AAClB,MAAM,UAAa,GAAA,cAAA;AAEV,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAe,cAAA,CAAA,IAAA,EAAM,SAAS,CAAC,CAAA,CAAA;AAC/B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAK,IAAA,MAAA,CAAO,IAAK,CAAA,MAAA,GAAS,CAAC,CAAC,CAAK,IAAA,IAAA,CAAA;AAAA,IACzD,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,MAA+B,MAAgB,EAAA;AACxE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,KAAK,MAAM,CAAA;AAAA,IAChB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEO,MAAM,oBAAuB,GAAA,WAAA;AAC7B,MAAM,eAAkB,GAAA,WAAA;AACxB,MAAM,mBAAsB,GAAA,WAAA;AAC5B,MAAM,cAAiB,GAAA,WAAA;AACvB,MAAM,YAAe,GAAA,WAAA;AAEZ,SAAA,YAAA,CAAa,MAA+B,MAAgB,EAAA;AAC1E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA;AAAA,IACxB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,OAAgC,MAAgB,EAAA;AACzE,EAAO,OAAA,EAAE,GAAK,EAAA,IAAA,EAAM,MAAO,EAAA,CAAA;AAC7B,CAAA;AAIO,SAAS,WAAc,IAA8B,EAAA;AAC1D,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAS,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA,CAAA;AAElC,IAAA,MAAA,EAAA,CAAA;AAEA,IAAA,MAAM,MAAW,EAAC,CAAA;AAClB,IAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,MAAA,EAAQ,CAAK,EAAA,EAAA;AAC/B,MAAM,MAAA,EAAE,KAAK,IAAM,EAAA,MAAA,EAAQ,WAAc,GAAA,IAAA,CAAK,MAAM,MAAM,CAAA,CAAA;AAC1D,MAAA,GAAA,CAAI,KAAK,IAAI,CAAA,CAAA;AACb,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AAEA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF,CAAA;AAEO,MAAM,SAAY,GAAA,WAAA;AAElB,SAAS,YAAe,IAAiB,EAAA;AAC9C,EAAO,OAAA,CAAC,MAA+B,MAAmB,KAAA;AACxD,IAAA,MAAM,QAAW,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAM,KAAA,EAAA,CAAA;AAC1C,IAAA,IAAI,QAAU,EAAA;AACZ,MAAO,OAAA,IAAA,CAAK,IAAM,EAAA,MAAA,GAAS,CAAC,CAAA,CAAA;AAAA,KAC9B;AACA,IAAA,OAAO,EAAE,GAAA,EAAK,IAAM,EAAA,MAAA,EAAQ,SAAS,CAAE,EAAA,CAAA;AAAA,GACzC,CAAA;AACF,CAAA;AAEO,SAAS,YACd,OAGkC,EAAA;AAClC,EAAA,MAAM,aAAgB,GAAA,MAAA,CAAO,OAAQ,CAAA,OAAO,CAAE,CAAA,IAAA;AAAA,IAC5C,CAAC,GAAG,CAAM,KAAA,CAAA,CAAE,CAAC,CAAE,CAAA,KAAA,GAAQ,CAAE,CAAA,CAAC,CAAE,CAAA,KAAA;AAAA,GAC9B,CAAA;AACA,EAAM,MAAA,MAAA,GAAS,CAAC,IAAA,EAA+B,cAA2B,KAAA;AACxE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAA+B,EAAC,CAAA;AACtC,IAAA,KAAA,MAAW,CAAC,GAAK,EAAA,EAAE,QAAAA,OAAO,EAAC,KAAK,aAAe,EAAA;AAC7C,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAcA,GAAAA,OAAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,GAAG,CAAI,GAAA,KAAA,CAAA;AACX,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACA,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;AAEO,SAAS,cACX,OACuB,EAAA;AAC1B,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAM,EAAC,CAAA;AACb,IAAA,KAAA,MAAW,UAAU,OAAS,EAAA;AAC5B,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAc,GAAA,MAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA,CAAA;AACd,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF,CAAA;AAMA,MAAM,uBAAuB,WAAY,CAAA;AAAA,EACvC,IAAM,EAAA;AAAA,IACJ,KAAO,EAAA,CAAA;AAAA,IACP,MAAA,EAAQ,WAAW,YAAY,CAAA;AAAA,GACjC;AAAA,EACA,WAAa,EAAA,EAAE,KAAO,EAAA,CAAA,EAAG,QAAQ,YAAa,EAAA;AAAA,EAC9C,cAAgB,EAAA,EAAE,KAAO,EAAA,CAAA,EAAG,QAAQ,QAAS,EAAA;AAC/C,CAAC,CAAA,CAAA;AAEe,SAAA,cAAA,CAAe,MAA+B,MAAgB,EAAA;AAuB5E,EAAA,MAAM,EAAE,GAAK,EAAA,MAAA,EAAQ,WAAc,GAAA,oBAAA,CAAqB,MAAM,MAAM,CAAA,CAAA;AAGpE,EAAA,MAAM,YAAY,GAAI,CAAA,IAAA,CACnB,GAAI,CAAA,CAACC,WAAUA,MAAM,CAAA,KAAA,CAAM,CAAC,CAAA,CAAE,SAAS,EAAI,EAAA,GAAG,CAAC,CAAA,CAC/C,KAAK,EAAE,CAAA,CAAA;AAEV,EAAA,IAAI,OAAU,GAAA,GAAA,CAAI,WAAY,CAAA,QAAA,CAAS,EAAE,CAAA,CAAA;AACzC,EAAM,MAAA,iBAAA,GAAoB,MAAO,CAAA,GAAA,CAAI,cAAc,CAAA,CAAA;AACnD,EAAI,IAAA,OAAA,CAAQ,MAAS,GAAA,iBAAA,GAAoB,CAAG,EAAA;AAC1C,IAAA,OAAA,GAAU,OAAQ,CAAA,QAAA,CAAS,iBAAoB,GAAA,CAAA,EAAG,GAAG,CAAA,CAAA;AAAA,GACvD;AAEA,EAAA,MAAM,eAAe,OAAQ,CAAA,KAAA,CAAM,OAAQ,CAAA,MAAA,GAAS,IAAI,iBAAiB,CAAA,CAAA;AACzE,EAAM,MAAA,KAAA,GAAQ,kBAAmB,CAAA,SAAA,GAAY,YAAY,CAAA,CAAA;AAEzD,EAAA,OAAO,EAAE,GAAK,EAAA,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,EAAI,QAAQ,SAAU,EAAA,CAAA;AAChD,CAAA;AAEA,SAAS,mBAAmB,KAAuB,EAAA;AACjD,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,KAAA,CAAM,QAAQ,CAAK,EAAA,EAAA;AACrC,IAAI,IAAA,KAAA,CAAM,CAAC,CAAA,KAAM,GAAK,EAAA;AACpB,MAAA,IAAI,CAAI,GAAA,CAAA,CAAA;AACR,MAAI,IAAA,CAAA,GAAI,MAAM,CAAG,EAAA;AACf,QAAK,CAAA,IAAA,CAAA,CAAA;AAAA,OACP;AACA,MAAO,OAAA,KAAA,CAAM,MAAM,CAAC,CAAA,CAAA;AAAA,KACtB;AAAA,GACF;AAEA,EAAO,OAAA,IAAA,CAAA;AACT;;;;;;;;;;;;;;;;;;;;;;;;;;;"}

package/dist/parser.d.cts

@@ -65,5 +65,9 @@ declare function parseTuple<T extends Parser<unknown>[]>(...parsers: T): Parser<
 type UnwrapParsers<TP> = {
     [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;
 };
+declare function parseByteArray(data: readonly FieldElement[], offset: number): {
+    out: string;
+    offset: number;
+};
 
-export { ParseError, type Parser, parseArray, parseAsBigInt, parseAsHex, parseBool, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };
+export { ParseError, type Parser, parseArray, parseAsBigInt, parseAsHex, parseBool, parseByteArray, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };

package/dist/parser.d.mts

@@ -65,5 +65,9 @@ declare function parseTuple<T extends Parser<unknown>[]>(...parsers: T): Parser<
 type UnwrapParsers<TP> = {
     [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;
 };
+declare function parseByteArray(data: readonly FieldElement[], offset: number): {
+    out: string;
+    offset: number;
+};
 
-export { ParseError, type Parser, parseArray, parseAsBigInt, parseAsHex, parseBool, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };
+export { ParseError, type Parser, parseArray, parseAsBigInt, parseAsHex, parseBool, parseByteArray, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };

package/dist/parser.d.ts

@@ -65,5 +65,9 @@ declare function parseTuple<T extends Parser<unknown>[]>(...parsers: T): Parser<
 type UnwrapParsers<TP> = {
     [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;
 };
+declare function parseByteArray(data: readonly FieldElement[], offset: number): {
+    out: string;
+    offset: number;
+};
 
-export { ParseError, type Parser, parseArray, parseAsBigInt, parseAsHex, parseBool, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };
+export { ParseError, type Parser, parseArray, parseAsBigInt, parseAsHex, parseBool, parseByteArray, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };

package/dist/parser.mjs

@@ -106,6 +106,38 @@ function parseTuple(...parsers) {
     return { out, offset };
   };
 }
+const parseByteArrayStruct = parseStruct({
+  data: {
+    index: 0,
+    parser: parseArray(parseBytes31)
+  },
+  pendingWord: { index: 1, parser: parseFelt252 },
+  pendingWordLen: { index: 2, parser: parseU32 }
+});
+function parseByteArray(data, offset) {
+  const { out, offset: offsetOut } = parseByteArrayStruct(data, offset);
+  const dataBytes = out.data.map((bytes2) => bytes2.slice(2).padStart(62, "0")).join("");
+  let pending = out.pendingWord.toString(16);
+  const pendingWordLength = Number(out.pendingWordLen);
+  if (pending.length < pendingWordLength * 2) {
+    pending = pending.padStart(pendingWordLength * 2, "0");
+  }
+  const pendingBytes = pending.slice(pending.length - 2 * pendingWordLength);
+  const bytes = removeLeadingZeros(dataBytes + pendingBytes);
+  return { out: `0x${bytes}`, offset: offsetOut };
+}
+function removeLeadingZeros(bytes) {
+  for (let i = 0; i < bytes.length; i++) {
+    if (bytes[i] !== "0") {
+      let j = i;
+      if (i % 2 !== 0) {
+        j -= 1;
+      }
+      return bytes.slice(j);
+    }
+  }
+  return "00";
+}
 
-export { ParseError, parseArray, parseAsBigInt, parseAsHex, parseBool, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };
+export { ParseError, parseArray, parseAsBigInt, parseAsHex, parseBool, parseByteArray, parseBytes31, parseClassHash, parseContractAddress, parseEmpty, parseEthAddress, parseFelt252, parseOption, parseSpan, parseStorageAddress, parseStruct, parseTuple, parseU128, parseU16, parseU256, parseU32, parseU64, parseU8, parseUsize };
 //# sourceMappingURL=parser.mjs.map

package/dist/parser.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"parser.mjs","sources":["../src/parser.ts"],"sourcesContent":["/*\n * Calldata combinatorial parsers.\n *\n * Based on the Ekubo's event parser.\n *\n * MIT License\n *\n * Copyright (c) 2023 Ekubo, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nimport type { FieldElement } from \"./common\";\n\nexport type Parser<TOut> = (\n  data: readonly FieldElement[],\n  offset: number,\n) => { out: TOut; offset: number };\n\nexport class ParseError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"ParseError\";\n  }\n}\n\n// Primitive types.\n\nfunction assertInBounds(data: readonly FieldElement[], offset: number) {\n  if (offset >= data.length) {\n    throw new ParseError(\n      `Offset out of bounds. Data length ${data.length}, offset ${offset}`,\n    );\n  }\n}\n\nexport function parseBool(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]) > 0n, offset: offset + 1 };\n}\n\nexport function parseAsBigInt(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]), offset: offset + 1 };\n}\n\nexport const parseU8 = parseAsBigInt;\nexport const parseU16 = parseAsBigInt;\nexport const parseU32 = parseAsBigInt;\nexport const parseU64 = parseAsBigInt;\nexport const parseU128 = parseAsBigInt;\nexport const parseUsize = parseAsBigInt;\n\nexport function parseU256(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset + 1);\n  return {\n    out: BigInt(data[offset]) + (BigInt(data[offset + 1]) << 128n),\n    offset: offset + 2,\n  };\n}\n\nexport function parseAsHex(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: data[offset],\n    offset: offset + 1,\n  };\n}\n\nexport const parseContractAddress = parseAsHex;\nexport const parseEthAddress = parseAsHex;\nexport const parseStorageAddress = parseAsHex;\nexport const parseClassHash = parseAsHex;\nexport const parseBytes31 = parseAsHex;\n\nexport function parseFelt252(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: BigInt(data[offset]),\n    offset: offset + 1,\n  };\n}\n\nexport function parseEmpty(_data: readonly FieldElement[], offset: number) {\n  return { out: null, offset };\n}\n\n// Higher-level types.\n\nexport function parseArray<T>(type: Parser<T>): Parser<T[]> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const length = BigInt(data[offset]);\n\n    offset++;\n\n    const out: T[] = [];\n    for (let i = 0; i < length; i++) {\n      const { out: item, offset: newOffset } = type(data, offset);\n      out.push(item);\n      offset = newOffset;\n    }\n\n    return { out, offset };\n  };\n}\n\nexport const parseSpan = parseArray;\n\nexport function parseOption<T>(type: Parser<T>) {\n  return (data: readonly FieldElement[], offset: number) => {\n    const hasValue = BigInt(data[offset]) === 1n;\n    if (hasValue) {\n      return type(data, offset + 1);\n    }\n    return { out: null, offset: offset + 1 };\n  };\n}\n\nexport function parseStruct<T extends Record<string, unknown>>(\n  parsers: { [K in keyof T]: { index: number; parser: Parser<T[K]> } },\n): Parser<{ [K in keyof T]: T[K] }> {\n  const sortedParsers = Object.entries(parsers).sort(\n    (a, b) => a[1].index - b[1].index,\n  );\n  const parser = (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out: Record<string, unknown> = {};\n    for (const [key, { parser }] of sortedParsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out[key] = value;\n      offset = newOffset;\n    }\n    return { out, offset };\n  };\n  return parser as Parser<{ [K in keyof T]: T[K] }>;\n}\n\nexport function parseTuple<T extends Parser<unknown>[]>(\n  ...parsers: T\n): Parser<UnwrapParsers<T>> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out = [];\n    for (const parser of parsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out.push(value);\n      offset = newOffset;\n    }\n    return { out, offset } as { out: UnwrapParsers<T>; offset: number };\n  };\n}\n\ntype UnwrapParsers<TP> = {\n  [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;\n};\n"],"names":["parser"],"mappings":"AAkCO,MAAM,mBAAmB,KAAM,CAAA;AAAA,EACpC,YAAY,OAAiB,EAAA;AAC3B,IAAA,KAAA,CAAM,OAAO,CAAA,CAAA;AACb,IAAA,IAAA,CAAK,IAAO,GAAA,YAAA,CAAA;AAAA,GACd;AACF,CAAA;AAIA,SAAS,cAAA,CAAe,MAA+B,MAAgB,EAAA;AACrE,EAAI,IAAA,MAAA,IAAU,KAAK,MAAQ,EAAA;AACzB,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAqC,kCAAA,EAAA,IAAA,CAAK,MAAM,CAAA,SAAA,EAAY,MAAM,CAAA,CAAA;AAAA,KACpE,CAAA;AAAA,GACF;AACF,CAAA;AAEgB,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAI,GAAA,EAAA,EAAI,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AAC9D,CAAA;AAEgB,SAAA,aAAA,CAAc,MAA+B,MAAgB,EAAA;AAC3E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,KAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAA,EAAG,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AACzD,CAAA;AAEO,MAAM,OAAU,GAAA,cAAA;AAChB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,SAAY,GAAA,cAAA;AAClB,MAAM,UAAa,GAAA,cAAA;AAEV,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAe,cAAA,CAAA,IAAA,EAAM,SAAS,CAAC,CAAA,CAAA;AAC/B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAK,IAAA,MAAA,CAAO,IAAK,CAAA,MAAA,GAAS,CAAC,CAAC,CAAK,IAAA,IAAA,CAAA;AAAA,IACzD,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,MAA+B,MAAgB,EAAA;AACxE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,KAAK,MAAM,CAAA;AAAA,IAChB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEO,MAAM,oBAAuB,GAAA,WAAA;AAC7B,MAAM,eAAkB,GAAA,WAAA;AACxB,MAAM,mBAAsB,GAAA,WAAA;AAC5B,MAAM,cAAiB,GAAA,WAAA;AACvB,MAAM,YAAe,GAAA,WAAA;AAEZ,SAAA,YAAA,CAAa,MAA+B,MAAgB,EAAA;AAC1E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA;AAAA,IACxB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,OAAgC,MAAgB,EAAA;AACzE,EAAO,OAAA,EAAE,GAAK,EAAA,IAAA,EAAM,MAAO,EAAA,CAAA;AAC7B,CAAA;AAIO,SAAS,WAAc,IAA8B,EAAA;AAC1D,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAS,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA,CAAA;AAElC,IAAA,MAAA,EAAA,CAAA;AAEA,IAAA,MAAM,MAAW,EAAC,CAAA;AAClB,IAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,MAAA,EAAQ,CAAK,EAAA,EAAA;AAC/B,MAAM,MAAA,EAAE,KAAK,IAAM,EAAA,MAAA,EAAQ,WAAc,GAAA,IAAA,CAAK,MAAM,MAAM,CAAA,CAAA;AAC1D,MAAA,GAAA,CAAI,KAAK,IAAI,CAAA,CAAA;AACb,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AAEA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF,CAAA;AAEO,MAAM,SAAY,GAAA,WAAA;AAElB,SAAS,YAAe,IAAiB,EAAA;AAC9C,EAAO,OAAA,CAAC,MAA+B,MAAmB,KAAA;AACxD,IAAA,MAAM,QAAW,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAM,KAAA,EAAA,CAAA;AAC1C,IAAA,IAAI,QAAU,EAAA;AACZ,MAAO,OAAA,IAAA,CAAK,IAAM,EAAA,MAAA,GAAS,CAAC,CAAA,CAAA;AAAA,KAC9B;AACA,IAAA,OAAO,EAAE,GAAA,EAAK,IAAM,EAAA,MAAA,EAAQ,SAAS,CAAE,EAAA,CAAA;AAAA,GACzC,CAAA;AACF,CAAA;AAEO,SAAS,YACd,OACkC,EAAA;AAClC,EAAA,MAAM,aAAgB,GAAA,MAAA,CAAO,OAAQ,CAAA,OAAO,CAAE,CAAA,IAAA;AAAA,IAC5C,CAAC,GAAG,CAAM,KAAA,CAAA,CAAE,CAAC,CAAE,CAAA,KAAA,GAAQ,CAAE,CAAA,CAAC,CAAE,CAAA,KAAA;AAAA,GAC9B,CAAA;AACA,EAAM,MAAA,MAAA,GAAS,CAAC,IAAA,EAA+B,cAA2B,KAAA;AACxE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAA+B,EAAC,CAAA;AACtC,IAAA,KAAA,MAAW,CAAC,GAAK,EAAA,EAAE,QAAAA,OAAO,EAAC,KAAK,aAAe,EAAA;AAC7C,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAcA,GAAAA,OAAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,GAAG,CAAI,GAAA,KAAA,CAAA;AACX,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACA,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;AAEO,SAAS,cACX,OACuB,EAAA;AAC1B,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAM,EAAC,CAAA;AACb,IAAA,KAAA,MAAW,UAAU,OAAS,EAAA;AAC5B,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAc,GAAA,MAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA,CAAA;AACd,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF;;;;"}
+{"version":3,"file":"parser.mjs","sources":["../src/parser.ts"],"sourcesContent":["/*\n * Calldata combinatorial parsers.\n *\n * Based on the Ekubo's event parser.\n *\n * MIT License\n *\n * Copyright (c) 2023 Ekubo, Inc.\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nimport type { FieldElement } from \"./common\";\n\nexport type Parser<TOut> = (\n  data: readonly FieldElement[],\n  offset: number,\n) => { out: TOut; offset: number };\n\nexport class ParseError extends Error {\n  constructor(message: string) {\n    super(message);\n    this.name = \"ParseError\";\n  }\n}\n\n// Primitive types.\n\nfunction assertInBounds(data: readonly FieldElement[], offset: number) {\n  if (offset >= data.length) {\n    throw new ParseError(\n      `Offset out of bounds. Data length ${data.length}, offset ${offset}`,\n    );\n  }\n}\n\nexport function parseBool(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]) > 0n, offset: offset + 1 };\n}\n\nexport function parseAsBigInt(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return { out: BigInt(data[offset]), offset: offset + 1 };\n}\n\nexport const parseU8 = parseAsBigInt;\nexport const parseU16 = parseAsBigInt;\nexport const parseU32 = parseAsBigInt;\nexport const parseU64 = parseAsBigInt;\nexport const parseU128 = parseAsBigInt;\nexport const parseUsize = parseAsBigInt;\n\nexport function parseU256(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset + 1);\n  return {\n    out: BigInt(data[offset]) + (BigInt(data[offset + 1]) << 128n),\n    offset: offset + 2,\n  };\n}\n\nexport function parseAsHex(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: data[offset],\n    offset: offset + 1,\n  };\n}\n\nexport const parseContractAddress = parseAsHex;\nexport const parseEthAddress = parseAsHex;\nexport const parseStorageAddress = parseAsHex;\nexport const parseClassHash = parseAsHex;\nexport const parseBytes31 = parseAsHex;\n\nexport function parseFelt252(data: readonly FieldElement[], offset: number) {\n  assertInBounds(data, offset);\n  return {\n    out: BigInt(data[offset]),\n    offset: offset + 1,\n  };\n}\n\nexport function parseEmpty(_data: readonly FieldElement[], offset: number) {\n  return { out: null, offset };\n}\n\n// Higher-level types.\n\nexport function parseArray<T>(type: Parser<T>): Parser<T[]> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const length = BigInt(data[offset]);\n\n    offset++;\n\n    const out: T[] = [];\n    for (let i = 0; i < length; i++) {\n      const { out: item, offset: newOffset } = type(data, offset);\n      out.push(item);\n      offset = newOffset;\n    }\n\n    return { out, offset };\n  };\n}\n\nexport const parseSpan = parseArray;\n\nexport function parseOption<T>(type: Parser<T>) {\n  return (data: readonly FieldElement[], offset: number) => {\n    const hasValue = BigInt(data[offset]) === 1n;\n    if (hasValue) {\n      return type(data, offset + 1);\n    }\n    return { out: null, offset: offset + 1 };\n  };\n}\n\nexport function parseStruct<T extends Record<string, unknown>>(\n  parsers: {\n    [K in keyof T]: { index: number; parser: Parser<T[K]> };\n  },\n): Parser<{ [K in keyof T]: T[K] }> {\n  const sortedParsers = Object.entries(parsers).sort(\n    (a, b) => a[1].index - b[1].index,\n  );\n  const parser = (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out: Record<string, unknown> = {};\n    for (const [key, { parser }] of sortedParsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out[key] = value;\n      offset = newOffset;\n    }\n    return { out, offset };\n  };\n  return parser as Parser<{ [K in keyof T]: T[K] }>;\n}\n\nexport function parseTuple<T extends Parser<unknown>[]>(\n  ...parsers: T\n): Parser<UnwrapParsers<T>> {\n  return (data: readonly FieldElement[], startingOffset: number) => {\n    let offset = startingOffset;\n    const out = [];\n    for (const parser of parsers) {\n      const { out: value, offset: newOffset } = parser(data, offset);\n      out.push(value);\n      offset = newOffset;\n    }\n    return { out, offset } as { out: UnwrapParsers<T>; offset: number };\n  };\n}\n\ntype UnwrapParsers<TP> = {\n  [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;\n};\n\nconst parseByteArrayStruct = parseStruct({\n  data: {\n    index: 0,\n    parser: parseArray(parseBytes31),\n  },\n  pendingWord: { index: 1, parser: parseFelt252 },\n  pendingWordLen: { index: 2, parser: parseU32 },\n});\n\nexport function parseByteArray(data: readonly FieldElement[], offset: number) {\n  // A ByteArray is a struct with the following abi:\n  //\n  // {\n  //   name: \"core::byte_array::ByteArray\",\n  //   type: \"struct\",\n  //   members: [\n  //     {\n  //       name: \"data\",\n  //       type: \"core::array::Array::<core::bytes_31::bytes31>\",\n  //     },\n  //     {\n  //       name: \"pending_word\",\n  //       type: \"core::felt252\",\n  //     },\n  //     {\n  //       name: \"pending_word_len\",\n  //       type: \"core::integer::u32\",\n  //     },\n  //   ],\n  // },\n  //\n  // We first parse it using a parser for that struct, then convert it to the output `0x${string}` type.\n  const { out, offset: offsetOut } = parseByteArrayStruct(data, offset);\n\n  // Remove 0x prefix from data elements and pad them to 31 bytes.\n  const dataBytes = out.data\n    .map((bytes) => bytes.slice(2).padStart(62, \"0\"))\n    .join(\"\");\n\n  let pending = out.pendingWord.toString(16);\n  const pendingWordLength = Number(out.pendingWordLen);\n  if (pending.length < pendingWordLength * 2) {\n    pending = pending.padStart(pendingWordLength * 2, \"0\");\n  }\n\n  const pendingBytes = pending.slice(pending.length - 2 * pendingWordLength);\n  const bytes = removeLeadingZeros(dataBytes + pendingBytes);\n\n  return { out: `0x${bytes}`, offset: offsetOut };\n}\n\nfunction removeLeadingZeros(bytes: string): string {\n  for (let i = 0; i < bytes.length; i++) {\n    if (bytes[i] !== \"0\") {\n      let j = i;\n      if (i % 2 !== 0) {\n        j -= 1;\n      }\n      return bytes.slice(j);\n    }\n  }\n  // The bytes are all 0, so return something reasonable.\n  return \"00\";\n}\n"],"names":["parser","bytes"],"mappings":"AAkCO,MAAM,mBAAmB,KAAM,CAAA;AAAA,EACpC,YAAY,OAAiB,EAAA;AAC3B,IAAA,KAAA,CAAM,OAAO,CAAA,CAAA;AACb,IAAA,IAAA,CAAK,IAAO,GAAA,YAAA,CAAA;AAAA,GACd;AACF,CAAA;AAIA,SAAS,cAAA,CAAe,MAA+B,MAAgB,EAAA;AACrE,EAAI,IAAA,MAAA,IAAU,KAAK,MAAQ,EAAA;AACzB,IAAA,MAAM,IAAI,UAAA;AAAA,MACR,CAAqC,kCAAA,EAAA,IAAA,CAAK,MAAM,CAAA,SAAA,EAAY,MAAM,CAAA,CAAA;AAAA,KACpE,CAAA;AAAA,GACF;AACF,CAAA;AAEgB,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAI,GAAA,EAAA,EAAI,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AAC9D,CAAA;AAEgB,SAAA,aAAA,CAAc,MAA+B,MAAgB,EAAA;AAC3E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA,EAAE,KAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAA,EAAG,MAAQ,EAAA,MAAA,GAAS,CAAE,EAAA,CAAA;AACzD,CAAA;AAEO,MAAM,OAAU,GAAA,cAAA;AAChB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,QAAW,GAAA,cAAA;AACjB,MAAM,SAAY,GAAA,cAAA;AAClB,MAAM,UAAa,GAAA,cAAA;AAEV,SAAA,SAAA,CAAU,MAA+B,MAAgB,EAAA;AACvE,EAAe,cAAA,CAAA,IAAA,EAAM,SAAS,CAAC,CAAA,CAAA;AAC/B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,MAAO,CAAA,IAAA,CAAK,MAAM,CAAC,CAAK,IAAA,MAAA,CAAO,IAAK,CAAA,MAAA,GAAS,CAAC,CAAC,CAAK,IAAA,IAAA,CAAA;AAAA,IACzD,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,MAA+B,MAAgB,EAAA;AACxE,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAA,EAAK,KAAK,MAAM,CAAA;AAAA,IAChB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEO,MAAM,oBAAuB,GAAA,WAAA;AAC7B,MAAM,eAAkB,GAAA,WAAA;AACxB,MAAM,mBAAsB,GAAA,WAAA;AAC5B,MAAM,cAAiB,GAAA,WAAA;AACvB,MAAM,YAAe,GAAA,WAAA;AAEZ,SAAA,YAAA,CAAa,MAA+B,MAAgB,EAAA;AAC1E,EAAA,cAAA,CAAe,MAAM,MAAM,CAAA,CAAA;AAC3B,EAAO,OAAA;AAAA,IACL,GAAK,EAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA;AAAA,IACxB,QAAQ,MAAS,GAAA,CAAA;AAAA,GACnB,CAAA;AACF,CAAA;AAEgB,SAAA,UAAA,CAAW,OAAgC,MAAgB,EAAA;AACzE,EAAO,OAAA,EAAE,GAAK,EAAA,IAAA,EAAM,MAAO,EAAA,CAAA;AAC7B,CAAA;AAIO,SAAS,WAAc,IAA8B,EAAA;AAC1D,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAS,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAA,CAAA;AAElC,IAAA,MAAA,EAAA,CAAA;AAEA,IAAA,MAAM,MAAW,EAAC,CAAA;AAClB,IAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,MAAA,EAAQ,CAAK,EAAA,EAAA;AAC/B,MAAM,MAAA,EAAE,KAAK,IAAM,EAAA,MAAA,EAAQ,WAAc,GAAA,IAAA,CAAK,MAAM,MAAM,CAAA,CAAA;AAC1D,MAAA,GAAA,CAAI,KAAK,IAAI,CAAA,CAAA;AACb,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AAEA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF,CAAA;AAEO,MAAM,SAAY,GAAA,WAAA;AAElB,SAAS,YAAe,IAAiB,EAAA;AAC9C,EAAO,OAAA,CAAC,MAA+B,MAAmB,KAAA;AACxD,IAAA,MAAM,QAAW,GAAA,MAAA,CAAO,IAAK,CAAA,MAAM,CAAC,CAAM,KAAA,EAAA,CAAA;AAC1C,IAAA,IAAI,QAAU,EAAA;AACZ,MAAO,OAAA,IAAA,CAAK,IAAM,EAAA,MAAA,GAAS,CAAC,CAAA,CAAA;AAAA,KAC9B;AACA,IAAA,OAAO,EAAE,GAAA,EAAK,IAAM,EAAA,MAAA,EAAQ,SAAS,CAAE,EAAA,CAAA;AAAA,GACzC,CAAA;AACF,CAAA;AAEO,SAAS,YACd,OAGkC,EAAA;AAClC,EAAA,MAAM,aAAgB,GAAA,MAAA,CAAO,OAAQ,CAAA,OAAO,CAAE,CAAA,IAAA;AAAA,IAC5C,CAAC,GAAG,CAAM,KAAA,CAAA,CAAE,CAAC,CAAE,CAAA,KAAA,GAAQ,CAAE,CAAA,CAAC,CAAE,CAAA,KAAA;AAAA,GAC9B,CAAA;AACA,EAAM,MAAA,MAAA,GAAS,CAAC,IAAA,EAA+B,cAA2B,KAAA;AACxE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAA+B,EAAC,CAAA;AACtC,IAAA,KAAA,MAAW,CAAC,GAAK,EAAA,EAAE,QAAAA,OAAO,EAAC,KAAK,aAAe,EAAA;AAC7C,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAcA,GAAAA,OAAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,GAAG,CAAI,GAAA,KAAA,CAAA;AACX,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACA,EAAO,OAAA,MAAA,CAAA;AACT,CAAA;AAEO,SAAS,cACX,OACuB,EAAA;AAC1B,EAAO,OAAA,CAAC,MAA+B,cAA2B,KAAA;AAChE,IAAA,IAAI,MAAS,GAAA,cAAA,CAAA;AACb,IAAA,MAAM,MAAM,EAAC,CAAA;AACb,IAAA,KAAA,MAAW,UAAU,OAAS,EAAA;AAC5B,MAAM,MAAA,EAAE,KAAK,KAAO,EAAA,MAAA,EAAQ,WAAc,GAAA,MAAA,CAAO,MAAM,MAAM,CAAA,CAAA;AAC7D,MAAA,GAAA,CAAI,KAAK,KAAK,CAAA,CAAA;AACd,MAAS,MAAA,GAAA,SAAA,CAAA;AAAA,KACX;AACA,IAAO,OAAA,EAAE,KAAK,MAAO,EAAA,CAAA;AAAA,GACvB,CAAA;AACF,CAAA;AAMA,MAAM,uBAAuB,WAAY,CAAA;AAAA,EACvC,IAAM,EAAA;AAAA,IACJ,KAAO,EAAA,CAAA;AAAA,IACP,MAAA,EAAQ,WAAW,YAAY,CAAA;AAAA,GACjC;AAAA,EACA,WAAa,EAAA,EAAE,KAAO,EAAA,CAAA,EAAG,QAAQ,YAAa,EAAA;AAAA,EAC9C,cAAgB,EAAA,EAAE,KAAO,EAAA,CAAA,EAAG,QAAQ,QAAS,EAAA;AAC/C,CAAC,CAAA,CAAA;AAEe,SAAA,cAAA,CAAe,MAA+B,MAAgB,EAAA;AAuB5E,EAAA,MAAM,EAAE,GAAK,EAAA,MAAA,EAAQ,WAAc,GAAA,oBAAA,CAAqB,MAAM,MAAM,CAAA,CAAA;AAGpE,EAAA,MAAM,YAAY,GAAI,CAAA,IAAA,CACnB,GAAI,CAAA,CAACC,WAAUA,MAAM,CAAA,KAAA,CAAM,CAAC,CAAA,CAAE,SAAS,EAAI,EAAA,GAAG,CAAC,CAAA,CAC/C,KAAK,EAAE,CAAA,CAAA;AAEV,EAAA,IAAI,OAAU,GAAA,GAAA,CAAI,WAAY,CAAA,QAAA,CAAS,EAAE,CAAA,CAAA;AACzC,EAAM,MAAA,iBAAA,GAAoB,MAAO,CAAA,GAAA,CAAI,cAAc,CAAA,CAAA;AACnD,EAAI,IAAA,OAAA,CAAQ,MAAS,GAAA,iBAAA,GAAoB,CAAG,EAAA;AAC1C,IAAA,OAAA,GAAU,OAAQ,CAAA,QAAA,CAAS,iBAAoB,GAAA,CAAA,EAAG,GAAG,CAAA,CAAA;AAAA,GACvD;AAEA,EAAA,MAAM,eAAe,OAAQ,CAAA,KAAA,CAAM,OAAQ,CAAA,MAAA,GAAS,IAAI,iBAAiB,CAAA,CAAA;AACzE,EAAM,MAAA,KAAA,GAAQ,kBAAmB,CAAA,SAAA,GAAY,YAAY,CAAA,CAAA;AAEzD,EAAA,OAAO,EAAE,GAAK,EAAA,CAAA,EAAA,EAAK,KAAK,CAAA,CAAA,EAAI,QAAQ,SAAU,EAAA,CAAA;AAChD,CAAA;AAEA,SAAS,mBAAmB,KAAuB,EAAA;AACjD,EAAA,KAAA,IAAS,CAAI,GAAA,CAAA,EAAG,CAAI,GAAA,KAAA,CAAM,QAAQ,CAAK,EAAA,EAAA;AACrC,IAAI,IAAA,KAAA,CAAM,CAAC,CAAA,KAAM,GAAK,EAAA;AACpB,MAAA,IAAI,CAAI,GAAA,CAAA,CAAA;AACR,MAAI,IAAA,CAAA,GAAI,MAAM,CAAG,EAAA;AACf,QAAK,CAAA,IAAA,CAAA,CAAA;AAAA,OACP;AACA,MAAO,OAAA,KAAA,CAAM,MAAM,CAAC,CAAA,CAAA;AAAA,KACtB;AAAA,GACF;AAEA,EAAO,OAAA,IAAA,CAAA;AACT;;;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@apibara/starknet",
-  "version": "2.1.0-beta.34",
+  "version": "2.1.0-beta.36",
   "type": "module",
   "files": [
     "dist",
@@ -42,10 +42,9 @@
     "vitest": "^1.6.0"
   },
   "dependencies": {
-    "@apibara/protocol": "2.1.0-beta.34",
+    "@apibara/protocol": "2.1.0-beta.36",
     "@scure/starknet": "^1.1.0",
     "abi-wan-kanabi": "^2.2.4",
-    "effect": "^3.2.6",
     "long": "^5.2.1",
     "nice-grpc-common": "^2.0.2",
     "protobufjs": "^7.1.2"

package/src/abi.ts

@@ -3,6 +3,7 @@ import { keccak } from "@scure/starknet";
 import type { FieldElement } from "./common";
 import {
   parseBool,
+  parseBytes31,
   parseContractAddress,
   parseFelt252,
   parseU8,
@@ -43,6 +44,7 @@ export const PrimitiveTypeParsers = {
   "core::integer::u64": parseU64,
   "core::integer::u128": parseU128,
   "core::integer::u256": parseU256,
+  "core::bytes_31::bytes31": parseBytes31,
   "core::starknet::contract_address::ContractAddress": parseContractAddress,
 };
 
@@ -77,3 +79,7 @@ export function getOptionType(type: string) {
 export function isEmptyType(type: string) {
   return type === "()";
 }
+
+export function isByteArray(type: string) {
+  return type === "core::byte_array::ByteArray";
+}

package/src/event.ts

@@ -10,6 +10,7 @@ import {
   getOptionType,
   getSpanType,
   isArrayType,
+  isByteArray,
   isEmptyType,
   isOptionType,
   isPrimitiveType,
@@ -30,6 +31,7 @@ import {
   ParseError,
   type Parser,
   parseArray,
+  parseByteArray,
   parseEmpty,
   parseOption,
   parseSpan,
@@ -298,6 +300,10 @@ function compileTypeParser(abi: Abi, type: string): Parser<unknown> {
     return parseEmpty;
   }
 
+  if (isByteArray(type)) {
+    return parseByteArray;
+  }
+
   // Not a well-known type. Look it up in the ABI.
   const typeAbi = abi.find((item) => item.name === type);
   if (!typeAbi) {

package/src/parser.ts

@@ -133,7 +133,9 @@ export function parseOption<T>(type: Parser<T>) {
 }
 
 export function parseStruct<T extends Record<string, unknown>>(
-  parsers: { [K in keyof T]: { index: number; parser: Parser<T[K]> } },
+  parsers: {
+    [K in keyof T]: { index: number; parser: Parser<T[K]> };
+  },
 ): Parser<{ [K in keyof T]: T[K] }> {
   const sortedParsers = Object.entries(parsers).sort(
     (a, b) => a[1].index - b[1].index,
@@ -169,3 +171,68 @@ export function parseTuple<T extends Parser<unknown>[]>(
 type UnwrapParsers<TP> = {
   [Index in keyof TP]: TP[Index] extends Parser<infer U> ? U : never;
 };
+
+const parseByteArrayStruct = parseStruct({
+  data: {
+    index: 0,
+    parser: parseArray(parseBytes31),
+  },
+  pendingWord: { index: 1, parser: parseFelt252 },
+  pendingWordLen: { index: 2, parser: parseU32 },
+});
+
+export function parseByteArray(data: readonly FieldElement[], offset: number) {
+  // A ByteArray is a struct with the following abi:
+  //
+  // {
+  //   name: "core::byte_array::ByteArray",
+  //   type: "struct",
+  //   members: [
+  //     {
+  //       name: "data",
+  //       type: "core::array::Array::<core::bytes_31::bytes31>",
+  //     },
+  //     {
+  //       name: "pending_word",
+  //       type: "core::felt252",
+  //     },
+  //     {
+  //       name: "pending_word_len",
+  //       type: "core::integer::u32",
+  //     },
+  //   ],
+  // },
+  //
+  // We first parse it using a parser for that struct, then convert it to the output `0x${string}` type.
+  const { out, offset: offsetOut } = parseByteArrayStruct(data, offset);
+
+  // Remove 0x prefix from data elements and pad them to 31 bytes.
+  const dataBytes = out.data
+    .map((bytes) => bytes.slice(2).padStart(62, "0"))
+    .join("");
+
+  let pending = out.pendingWord.toString(16);
+  const pendingWordLength = Number(out.pendingWordLen);
+  if (pending.length < pendingWordLength * 2) {
+    pending = pending.padStart(pendingWordLength * 2, "0");
+  }
+
+  const pendingBytes = pending.slice(pending.length - 2 * pendingWordLength);
+  const bytes = removeLeadingZeros(dataBytes + pendingBytes);
+
+  return { out: `0x${bytes}`, offset: offsetOut };
+}
+
+function removeLeadingZeros(bytes: string): string {
+  for (let i = 0; i < bytes.length; i++) {
+    if (bytes[i] !== "0") {
+      let j = i;
+      if (i % 2 !== 0) {
+        j -= 1;
+      }
+      return bytes.slice(j);
+    }
+  }
+  // The bytes are all 0, so return something reasonable.
+  return "00";
+}