@paraswap/dex-lib 3.8.26 → 3.8.27-lite-psm-return-amount-pos.0

package/build/executor/compressor/compress_functions/addressSubstitutionFromObject.js

@@ -1,40 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const intTo3Bytes_1 = __importDefault(require("../utils/intTo3Bytes"));
-const ZERO_ADDRESS = '0000000000000000000000000000000000000000';
-const addressSubstitutionFromObject = ({ callData, addressesObject, }) => {
-    const addresses = [];
-    for (let i = 0; i < callData.length; i += 2) {
-        const callDataPart = callData.slice(i, i + 40);
-        const addressObj = addressesObject[`0x${callDataPart}`];
-        if (addressObj?.saved)
-            addresses.push(callDataPart);
-    }
-    addresses
-        .filter(address => {
-        const notZero = address !== ZERO_ADDRESS;
-        const inCalldata = callData.indexOf(address) !== -1;
-        const isSaved = addressesObject[`0x${address}`].saved;
-        return notZero && inCalldata && isSaved;
-    })
-        .forEach(address => {
-        let index = callData.indexOf(address);
-        const bytes3 = (0, intTo3Bytes_1.default)(addressesObject[`0x${address}`].index);
-        while (index !== -1) {
-            if (index % 2 === 0) {
-                callData =
-                    callData.substring(0, index) +
-                        'RR' +
-                        bytes3 +
-                        callData.substring(index + address.length);
-            }
-            index = callData.indexOf(address, index + 1);
-        }
-    });
-    return callData;
-};
-exports.default = addressSubstitutionFromObject;
-//# sourceMappingURL=addressSubstitutionFromObject.js.map

package/build/executor/compressor/compress_functions/addressSubstitutionFromObject.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"addressSubstitutionFromObject.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/addressSubstitutionFromObject.ts"],"names":[],"mappings":";;;;;AAAA,uEAA+C;AAE/C,MAAM,YAAY,GAAG,0CAA0C,CAAC;AAEhE,MAAM,6BAA6B,GAAG,CAAC,EACrC,QAAQ,EACR,eAAe,GAIhB,EAAU,EAAE;IACX,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QAC3C,MAAM,YAAY,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,YAAY,EAAE,CAAC,CAAC;QAExD,IAAI,UAAU,EAAE,KAAK;YAAE,SAAS,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;KACrD;IAED,SAAS;SACN,MAAM,CAAC,OAAO,CAAC,EAAE;QAChB,MAAM,OAAO,GAAG,OAAO,KAAK,YAAY,CAAC;QACzC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACpD,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC;QACtD,OAAO,OAAO,IAAI,UAAU,IAAI,OAAO,CAAC;IAC1C,CAAC,CAAC;SACD,OAAO,CAAC,OAAO,CAAC,EAAE;QACjB,IAAI,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAA,qBAAW,EAAC,eAAe,CAAC,KAAK,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAElE,OAAO,KAAK,KAAK,CAAC,CAAC,EAAE;YACnB,IAAI,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE;gBACnB,QAAQ;oBACN,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC;wBAC5B,IAAI;wBACJ,MAAM;wBACN,QAAQ,CAAC,SAAS,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;aAC9C;YACD,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;SAC9C;IACH,CAAC,CAAC,CAAC;IAEL,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,kBAAe,6BAA6B,CAAC"}

package/build/executor/compressor/compress_functions/byteSubstitution.d.ts

@@ -1,11 +0,0 @@
-declare const byteSubstitution: ({ byte, callData, compressedCallData, addressPrefix, newAddressPrefix, }: {
-    byte: string;
-    callData: string;
-    compressedCallData?: string | undefined;
-    addressPrefix: string;
-    newAddressPrefix: string;
-}) => {
-    bufferOfOccurences: string;
-    compressedCallData: string;
-};
-export default byteSubstitution;

package/build/executor/compressor/compress_functions/byteSubstitution.js

@@ -1,64 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const intToByte_1 = __importDefault(require("../utils/intToByte"));
-const byteSubstitution = ({ byte, callData, compressedCallData, addressPrefix, newAddressPrefix, }) => {
-    let countNoByte = 0; // Count of non-target bytes
-    let countByte = 0; // Count of target bytes
-    let bufferOfOccurences = ''; // Stores occurrences of target bytes
-    if (!compressedCallData)
-        compressedCallData = '';
-    // Looping through call data byte by byte
-    for (let i = 0; i < callData.length; i += 2) {
-        let amountToIncreaseI = 0;
-        const currentByte = callData.slice(i, i + 2);
-        // Handling target byte substitution
-        if (currentByte === byte) {
-            if (countNoByte > 0 || i == 0) {
-                compressedCallData += byte;
-                countNoByte = 0;
-            }
-            // Handle byte count exceeding limit
-            if (++countByte > 254) {
-                let hexValue = (0, intToByte_1.default)(countByte);
-                bufferOfOccurences += hexValue;
-                compressedCallData += byte + hexValue;
-                countByte = 0;
-            }
-            continue;
-        }
-        else {
-            // Handle other bytes and address prefixes
-            if (countByte > 0) {
-                let hexValue = (0, intToByte_1.default)(countByte);
-                if (byte === 'ff' && countByte === 1)
-                    hexValue = '00';
-                bufferOfOccurences += hexValue;
-                compressedCallData += hexValue;
-                countByte = 0;
-            }
-            // Check for address and new address prefixes
-            if (currentByte === addressPrefix || currentByte === newAddressPrefix) {
-                let sliceLength = currentByte === addressPrefix ? 8 : 4;
-                compressedCallData += callData.slice(i, i + sliceLength);
-                amountToIncreaseI = sliceLength - 2;
-                countNoByte = 0;
-            }
-            countNoByte++;
-        }
-        if (!amountToIncreaseI)
-            compressedCallData += callData.slice(i, i + 2);
-        i += amountToIncreaseI;
-    }
-    // Append remaining byte counts after loop
-    if (countByte > 0) {
-        let hexValue = (0, intToByte_1.default)(countByte);
-        bufferOfOccurences += hexValue;
-        compressedCallData += hexValue;
-    }
-    return { bufferOfOccurences, compressedCallData };
-};
-exports.default = byteSubstitution;
-//# sourceMappingURL=byteSubstitution.js.map

package/build/executor/compressor/compress_functions/byteSubstitution.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"byteSubstitution.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/byteSubstitution.ts"],"names":[],"mappings":";;;;;AAAA,mEAA2C;AAE3C,MAAM,gBAAgB,GAAG,CAAC,EACxB,IAAI,EACJ,QAAQ,EACR,kBAAkB,EAClB,aAAa,EACb,gBAAgB,GAOjB,EAA8D,EAAE;IAC/D,IAAI,WAAW,GAAG,CAAC,CAAC,CAAC,4BAA4B;IACjD,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC,wBAAwB;IAC3C,IAAI,kBAAkB,GAAG,EAAE,CAAC,CAAC,qCAAqC;IAElE,IAAI,CAAC,kBAAkB;QAAE,kBAAkB,GAAG,EAAE,CAAC;IAEjD,yCAAyC;IACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QAC3C,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAE7C,oCAAoC;QACpC,IAAI,WAAW,KAAK,IAAI,EAAE;YACxB,IAAI,WAAW,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;gBAC7B,kBAAkB,IAAI,IAAI,CAAC;gBAC3B,WAAW,GAAG,CAAC,CAAC;aACjB;YACD,oCAAoC;YACpC,IAAI,EAAE,SAAS,GAAG,GAAG,EAAE;gBACrB,IAAI,QAAQ,GAAG,IAAA,mBAAS,EAAC,SAAS,CAAC,CAAC;gBACpC,kBAAkB,IAAI,QAAQ,CAAC;gBAC/B,kBAAkB,IAAI,IAAI,GAAG,QAAQ,CAAC;gBACtC,SAAS,GAAG,CAAC,CAAC;aACf;YACD,SAAS;SACV;aAAM;YACL,0CAA0C;YAC1C,IAAI,SAAS,GAAG,CAAC,EAAE;gBACjB,IAAI,QAAQ,GAAG,IAAA,mBAAS,EAAC,SAAS,CAAC,CAAC;gBACpC,IAAI,IAAI,KAAK,IAAI,IAAI,SAAS,KAAK,CAAC;oBAAE,QAAQ,GAAG,IAAI,CAAC;gBACtD,kBAAkB,IAAI,QAAQ,CAAC;gBAC/B,kBAAkB,IAAI,QAAQ,CAAC;gBAC/B,SAAS,GAAG,CAAC,CAAC;aACf;YACD,6CAA6C;YAC7C,IAAI,WAAW,KAAK,aAAa,IAAI,WAAW,KAAK,gBAAgB,EAAE;gBACrE,IAAI,WAAW,GAAG,WAAW,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBACxD,kBAAkB,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC;gBACzD,iBAAiB,GAAG,WAAW,GAAG,CAAC,CAAC;gBACpC,WAAW,GAAG,CAAC,CAAC;aACjB;YACD,WAAW,EAAE,CAAC;SACf;QACD,IAAI,CAAC,iBAAiB;YAAE,kBAAkB,IAAI,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACvE,CAAC,IAAI,iBAAiB,CAAC;KACxB;IAED,0CAA0C;IAC1C,IAAI,SAAS,GAAG,CAAC,EAAE;QACjB,IAAI,QAAQ,GAAG,IAAA,mBAAS,EAAC,SAAS,CAAC,CAAC;QACpC,kBAAkB,IAAI,QAAQ,CAAC;QAC/B,kBAAkB,IAAI,QAAQ,CAAC;KAChC;IAED,OAAO,EAAE,kBAAkB,EAAE,kBAAkB,EAAE,CAAC;AACpD,CAAC,CAAC;AAEF,kBAAe,gBAAgB,CAAC"}

package/build/executor/compressor/compress_functions/ffSubstitution.d.ts

@@ -1,7 +0,0 @@
-declare const ffSubstitution: ({ compressedCallData, indexOfMethods, addressPrefix, newAddressPrefix, }: {
-    compressedCallData: string;
-    indexOfMethods: number;
-    addressPrefix: string;
-    newAddressPrefix: string;
-}) => string;
-export default ffSubstitution;

package/build/executor/compressor/compress_functions/ffSubstitution.js

@@ -1,54 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const intToByte_1 = __importDefault(require("../utils/intToByte"));
-const ffByte = 'ff';
-const zeroByte = '00';
-const ffSubstitution = ({ compressedCallData, indexOfMethods, addressPrefix, newAddressPrefix, }) => {
-    let ffCount = 0;
-    let maxI;
-    const startFFSearch = indexOfMethods > -1 ? 2 : 10;
-    for (let i = startFFSearch; i < compressedCallData.length; i += 2) {
-        const byte = compressedCallData.substring(i, i + 2);
-        maxI = i;
-        if (byte === ffByte) {
-            if (++ffCount > 254) {
-                // in case more than 255 bytes of ff
-                compressedCallData =
-                    compressedCallData.substring(0, i + (1 - ffCount) * 2) +
-                        (0, intToByte_1.default)(ffCount) +
-                        compressedCallData.substring(i);
-                i -= ffCount * 2;
-                i += 2;
-                ffCount = 0;
-            }
-            continue;
-        }
-        if (ffCount > 0) {
-            if (ffCount === 1)
-                compressedCallData =
-                    compressedCallData.substring(0, i) +
-                        zeroByte +
-                        compressedCallData.substring(i);
-            else {
-                compressedCallData =
-                    compressedCallData.substring(0, i + (1 - ffCount) * 2) +
-                        (0, intToByte_1.default)(ffCount) +
-                        compressedCallData.substring(i);
-                i -= ffCount * 2;
-            }
-            i += 2;
-            ffCount = 0;
-        }
-        if (byte === addressPrefix)
-            i += 6;
-        if (byte === newAddressPrefix)
-            i += 2;
-    }
-    // console.log({ maxI: max, length: compressedCallData.length, compressedCallData });
-    return compressedCallData;
-};
-exports.default = ffSubstitution;
-//# sourceMappingURL=ffSubstitution.js.map

package/build/executor/compressor/compress_functions/ffSubstitution.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"ffSubstitution.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/ffSubstitution.ts"],"names":[],"mappings":";;;;;AAAA,mEAA2C;AAE3C,MAAM,MAAM,GAAG,IAAI,CAAC;AACpB,MAAM,QAAQ,GAAG,IAAI,CAAC;AAEtB,MAAM,cAAc,GAAG,CAAC,EACtB,kBAAkB,EAClB,cAAc,EACd,aAAa,EACb,gBAAgB,GAMjB,EAAU,EAAE;IACX,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,IAAY,CAAC;IACjB,MAAM,aAAa,GAAG,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACjE,MAAM,IAAI,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpD,IAAI,GAAG,CAAC,CAAC;QACT,IAAI,IAAI,KAAK,MAAM,EAAE;YACnB,IAAI,EAAE,OAAO,GAAG,GAAG,EAAE;gBACnB,oCAAoC;gBACpC,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;wBACtD,IAAA,mBAAS,EAAC,OAAO,CAAC;wBAClB,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClC,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;gBACjB,CAAC,IAAI,CAAC,CAAC;gBACP,OAAO,GAAG,CAAC,CAAC;aACb;YACD,SAAS;SACV;QACD,IAAI,OAAO,GAAG,CAAC,EAAE;YACf,IAAI,OAAO,KAAK,CAAC;gBACf,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC;wBAClC,QAAQ;wBACR,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;iBAC/B;gBACH,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;wBACtD,IAAA,mBAAS,EAAC,OAAO,CAAC;wBAClB,kBAAkB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;gBAClC,CAAC,IAAI,OAAO,GAAG,CAAC,CAAC;aAClB;YACD,CAAC,IAAI,CAAC,CAAC;YACP,OAAO,GAAG,CAAC,CAAC;SACb;QACD,IAAI,IAAI,KAAK,aAAa;YAAE,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,gBAAgB;YAAE,CAAC,IAAI,CAAC,CAAC;KACvC;IACD,qFAAqF;IACrF,OAAO,kBAAkB,CAAC;AAC5B,CAAC,CAAC;AAEF,kBAAe,cAAc,CAAC"}

package/build/executor/compressor/compress_functions/findLongestAndSubstitute.d.ts

@@ -1,8 +0,0 @@
-declare const findLongestAndSubstitute: ({ compressedCallData, markers, }: {
-    compressedCallData: string;
-    markers?: string[] | undefined;
-}) => {
-    newCompressedData: string;
-    nbOfDuplicatedStrings: number;
-};
-export default findLongestAndSubstitute;

package/build/executor/compressor/compress_functions/findLongestAndSubstitute.js

@@ -1,67 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const findLongestDuplicatedString_1 = __importDefault(require("../utils/findLongestDuplicatedString"));
-const findLongestAndSubstitute = ({ compressedCallData, markers, }) => {
-    if (!markers)
-        markers = [];
-    for (let i = 0; i < markers.length; i++) {
-        if (!markers[i] || markers[i] === '')
-            return {
-                newCompressedData: compressedCallData,
-                nbOfDuplicatedStrings: i,
-            };
-        const marker = markers[i];
-        let longestDuplicatedStringInCompressedData = (0, findLongestDuplicatedString_1.default)(compressedCallData);
-        // Checking if the length of the longest duplicated string is significant
-        // TODO: better check conditions to enter this (nb of occurences as well as length)
-        if (longestDuplicatedStringInCompressedData.length >= 8) {
-            // Creating regular expressions to find the longest duplicated string
-            const index = compressedCallData.indexOf(longestDuplicatedStringInCompressedData);
-            // If a match is found, surrounder the longest duplicated string with the marker in the compressed data
-            // and substitute the other occurences
-            if (index > -1) {
-                compressedCallData =
-                    compressedCallData.substring(0, index) +
-                        marker +
-                        compressedCallData.substring(index, index + longestDuplicatedStringInCompressedData.length) +
-                        marker +
-                        compressedCallData.substring(index + longestDuplicatedStringInCompressedData.length);
-                let otherIndex = compressedCallData.indexOf(longestDuplicatedStringInCompressedData, index + 4 + longestDuplicatedStringInCompressedData.length);
-                while (otherIndex !== -1) {
-                    if (otherIndex % 2 === 0) {
-                        compressedCallData =
-                            compressedCallData.substring(0, otherIndex) +
-                                marker +
-                                compressedCallData.substring(otherIndex + longestDuplicatedStringInCompressedData.length);
-                        otherIndex = compressedCallData.indexOf(longestDuplicatedStringInCompressedData, otherIndex + 2);
-                    }
-                    else {
-                        otherIndex = compressedCallData.indexOf(longestDuplicatedStringInCompressedData, otherIndex + 1);
-                    }
-                }
-            }
-            else
-                return {
-                    newCompressedData: compressedCallData,
-                    nbOfDuplicatedStrings: i,
-                };
-        }
-        else {
-            // If the longest duplicated string is not significant, return the current state of compressed data and count of duplicated strings
-            return {
-                newCompressedData: compressedCallData,
-                nbOfDuplicatedStrings: i,
-            };
-        }
-    }
-    // After processing for all markers, return the final compressed data and the total number of duplicated strings found
-    return {
-        newCompressedData: compressedCallData,
-        nbOfDuplicatedStrings: markers.length,
-    };
-};
-exports.default = findLongestAndSubstitute;
-//# sourceMappingURL=findLongestAndSubstitute.js.map

package/build/executor/compressor/compress_functions/findLongestAndSubstitute.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"findLongestAndSubstitute.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/findLongestAndSubstitute.ts"],"names":[],"mappings":";;;;;AAAA,uGAA+E;AAE/E,MAAM,wBAAwB,GAAG,CAAC,EAChC,kBAAkB,EAClB,OAAO,GAIR,EAAgE,EAAE;IACjE,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE;YAClC,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;QAEJ,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAE1B,IAAI,uCAAuC,GACzC,IAAA,qCAA2B,EAAC,kBAAkB,CAAC,CAAC;QAElD,yEAAyE;QACzE,mFAAmF;QACnF,IAAI,uCAAuC,CAAC,MAAM,IAAI,CAAC,EAAE;YACvD,qEAAqE;YACrE,MAAM,KAAK,GAAG,kBAAkB,CAAC,OAAO,CACtC,uCAAuC,CACxC,CAAC;YAEF,uGAAuG;YACvG,sCAAsC;YACtC,IAAI,KAAK,GAAG,CAAC,CAAC,EAAE;gBACd,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC;wBACtC,MAAM;wBACN,kBAAkB,CAAC,SAAS,CAC1B,KAAK,EACL,KAAK,GAAG,uCAAuC,CAAC,MAAM,CACvD;wBACD,MAAM;wBACN,kBAAkB,CAAC,SAAS,CAC1B,KAAK,GAAG,uCAAuC,CAAC,MAAM,CACvD,CAAC;gBAEJ,IAAI,UAAU,GAAG,kBAAkB,CAAC,OAAO,CACzC,uCAAuC,EACvC,KAAK,GAAG,CAAC,GAAG,uCAAuC,CAAC,MAAM,CAC3D,CAAC;gBACF,OAAO,UAAU,KAAK,CAAC,CAAC,EAAE;oBACxB,IAAI,UAAU,GAAG,CAAC,KAAK,CAAC,EAAE;wBACxB,kBAAkB;4BAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC;gCAC3C,MAAM;gCACN,kBAAkB,CAAC,SAAS,CAC1B,UAAU,GAAG,uCAAuC,CAAC,MAAM,CAC5D,CAAC;wBACJ,UAAU,GAAG,kBAAkB,CAAC,OAAO,CACrC,uCAAuC,EACvC,UAAU,GAAG,CAAC,CACf,CAAC;qBACH;yBAAM;wBACL,UAAU,GAAG,kBAAkB,CAAC,OAAO,CACrC,uCAAuC,EACvC,UAAU,GAAG,CAAC,CACf,CAAC;qBACH;iBACF;aACF;;gBACC,OAAO;oBACL,iBAAiB,EAAE,kBAAkB;oBACrC,qBAAqB,EAAE,CAAC;iBACzB,CAAC;SACL;aAAM;YACL,mIAAmI;YACnI,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;SACH;KACF;IAED,sHAAsH;IACtH,OAAO;QACL,iBAAiB,EAAE,kBAAkB;QACrC,qBAAqB,EAAE,OAAO,CAAC,MAAM;KACtC,CAAC;AACJ,CAAC,CAAC;AAEF,kBAAe,wBAAwB,CAAC"}

package/build/executor/compressor/compress_functions/findLongestAndSubstitute_old.d.ts

@@ -1,8 +0,0 @@
-declare const findLongestAndSubstitute: ({ compressedCallData, markers, }: {
-    compressedCallData: string;
-    markers?: string[] | undefined;
-}) => {
-    newCompressedData: string;
-    nbOfDuplicatedStrings: number;
-};
-export default findLongestAndSubstitute;

package/build/executor/compressor/compress_functions/findLongestAndSubstitute_old.js

@@ -1,61 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const findLongestDuplicatedString_1 = __importDefault(require("../utils/findLongestDuplicatedString"));
-const findLongestAndSubstitute = ({ compressedCallData, markers, }) => {
-    if (!markers)
-        markers = [];
-    for (let i = 0; i < markers.length; i++) {
-        if (!markers[i] || markers[i] === '')
-            return {
-                newCompressedData: compressedCallData,
-                nbOfDuplicatedStrings: i,
-            };
-        const marker = markers[i];
-        let longestDuplicatedStringInCompressedData = (0, findLongestDuplicatedString_1.default)(compressedCallData);
-        // Checking if the length of the longest duplicated string is significant
-        // TODO: better check conditions to enter this (nb of occurences as well as length)
-        if (longestDuplicatedStringInCompressedData.length >= 8) {
-            // Creating regular expressions to find the longest duplicated string
-            const regexLongest = new RegExp('((^[a-zA-Z0-9]{2})*)' + longestDuplicatedStringInCompressedData);
-            const match = regexLongest.exec(compressedCallData);
-            // If a match is found, surrounder the longest duplicated string with the marker in the compressed data
-            // and substitute the other occurences
-            if (match) {
-                const indexOfLongest = match.index + match[1].length;
-                const regexLongestGlobal = new RegExp('((^[a-zA-Z0-9]{2})*)' + longestDuplicatedStringInCompressedData, 'g');
-                compressedCallData =
-                    compressedCallData.substring(0, indexOfLongest) +
-                        marker +
-                        compressedCallData.substring(indexOfLongest, indexOfLongest + longestDuplicatedStringInCompressedData.length) +
-                        marker +
-                        compressedCallData
-                            .substring(indexOfLongest + longestDuplicatedStringInCompressedData.length)
-                            .replace(regexLongestGlobal, function (m, p1) {
-                            return p1 + marker;
-                        });
-            }
-            else
-                return {
-                    newCompressedData: compressedCallData,
-                    nbOfDuplicatedStrings: i,
-                };
-        }
-        else {
-            // If the longest duplicated string is not significant, return the current state of compressed data and count of duplicated strings
-            return {
-                newCompressedData: compressedCallData,
-                nbOfDuplicatedStrings: i,
-            };
-        }
-    }
-    // After processing for all markers, return the final compressed data and the total number of duplicated strings found
-    return {
-        newCompressedData: compressedCallData,
-        nbOfDuplicatedStrings: markers.length,
-    };
-};
-exports.default = findLongestAndSubstitute;
-//# sourceMappingURL=findLongestAndSubstitute_old.js.map

package/build/executor/compressor/compress_functions/findLongestAndSubstitute_old.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"findLongestAndSubstitute_old.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/findLongestAndSubstitute_old.ts"],"names":[],"mappings":";;;;;AAAA,uGAA+E;AAE/E,MAAM,wBAAwB,GAAG,CAAC,EAChC,kBAAkB,EAClB,OAAO,GAIR,EAAgE,EAAE;IACjE,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,EAAE,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE;YAClC,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;QAEJ,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QAE1B,IAAI,uCAAuC,GACzC,IAAA,qCAA2B,EAAC,kBAAkB,CAAC,CAAC;QAElD,yEAAyE;QACzE,mFAAmF;QACnF,IAAI,uCAAuC,CAAC,MAAM,IAAI,CAAC,EAAE;YACvD,qEAAqE;YACrE,MAAM,YAAY,GAAG,IAAI,MAAM,CAC7B,sBAAsB,GAAG,uCAAuC,CACjE,CAAC;YACF,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;YAEpD,uGAAuG;YACvG,sCAAsC;YACtC,IAAI,KAAK,EAAE;gBACT,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACrD,MAAM,kBAAkB,GAAG,IAAI,MAAM,CACnC,sBAAsB,GAAG,uCAAuC,EAChE,GAAG,CACJ,CAAC;gBACF,kBAAkB;oBAChB,kBAAkB,CAAC,SAAS,CAAC,CAAC,EAAE,cAAc,CAAC;wBAC/C,MAAM;wBACN,kBAAkB,CAAC,SAAS,CAC1B,cAAc,EACd,cAAc,GAAG,uCAAuC,CAAC,MAAM,CAChE;wBACD,MAAM;wBACN,kBAAkB;6BACf,SAAS,CACR,cAAc,GAAG,uCAAuC,CAAC,MAAM,CAChE;6BACA,OAAO,CAAC,kBAAkB,EAAE,UAAU,CAAC,EAAE,EAAE;4BAC1C,OAAO,EAAE,GAAG,MAAM,CAAC;wBACrB,CAAC,CAAC,CAAC;aACR;;gBACC,OAAO;oBACL,iBAAiB,EAAE,kBAAkB;oBACrC,qBAAqB,EAAE,CAAC;iBACzB,CAAC;SACL;aAAM;YACL,mIAAmI;YACnI,OAAO;gBACL,iBAAiB,EAAE,kBAAkB;gBACrC,qBAAqB,EAAE,CAAC;aACzB,CAAC;SACH;KACF;IAED,sHAAsH;IACtH,OAAO;QACL,iBAAiB,EAAE,kBAAkB;QACrC,qBAAqB,EAAE,OAAO,CAAC,MAAM;KACtC,CAAC;AACJ,CAAC,CAAC;AAEF,kBAAe,wBAAwB,CAAC"}

package/build/executor/compressor/compress_functions/reverseAddressSubstitution.d.ts

@@ -1,6 +0,0 @@
-declare const reverseAddressSubstitution: ({ callData, addresses, isSavedAddresses, }: {
-    callData: string;
-    addresses: string[];
-    isSavedAddresses: boolean;
-}) => string;
-export default reverseAddressSubstitution;

package/build/executor/compressor/compress_functions/reverseAddressSubstitution.js

@@ -1,37 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const reverseAddressSubstitution = function ({ callData, addresses, isSavedAddresses, }) {
-    let markerLength = isSavedAddresses ? 5 : 3; // 'RR' + 3 bytes or 'TT' + 1 byte
-    let marker = isSavedAddresses ? 'RR' : 'TT';
-    let index = 0;
-    while (index < callData.length) {
-        let foundIndex = callData.indexOf(marker, index);
-        if (foundIndex === -1) {
-            break; // Marker not found, stop processing
-        }
-        else if (foundIndex % 2 !== 0) {
-            index++;
-            continue;
-        }
-        let addressIndex;
-        if (isSavedAddresses) {
-            // Extract 3 bytes after 'RR', convert to int
-            addressIndex = parseInt(callData.substring(foundIndex + 2, foundIndex + 5), 16);
-        }
-        else {
-            // Extract 1 byte after 'TT', convert to int
-            addressIndex = parseInt(callData.substring(foundIndex + 2, foundIndex + 3), 16);
-        }
-        if (addressIndex < addresses.length) {
-            // Replace marker and index bytes with the corresponding address
-            callData =
-                callData.substring(0, foundIndex) +
-                    addresses[addressIndex] +
-                    callData.substring(foundIndex + markerLength);
-        }
-        index = foundIndex + 1; // Update index to continue searching
-    }
-    return callData;
-};
-exports.default = reverseAddressSubstitution;
-//# sourceMappingURL=reverseAddressSubstitution.js.map

package/build/executor/compressor/compress_functions/reverseAddressSubstitution.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"reverseAddressSubstitution.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/reverseAddressSubstitution.ts"],"names":[],"mappings":";;AAAA,MAAM,0BAA0B,GAAG,UAAU,EAC3C,QAAQ,EACR,SAAS,EACT,gBAAgB,GAKjB;IACC,IAAI,YAAY,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,kCAAkC;IAC/E,IAAI,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAE5C,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE;QAC9B,IAAI,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACjD,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE;YACrB,MAAM,CAAC,oCAAoC;SAC5C;aAAM,IAAI,UAAU,GAAG,CAAC,KAAK,CAAC,EAAE;YAC/B,KAAK,EAAE,CAAC;YACR,SAAS;SACV;QAED,IAAI,YAAoB,CAAC;QACzB,IAAI,gBAAgB,EAAE;YACpB,6CAA6C;YAC7C,YAAY,GAAG,QAAQ,CACrB,QAAQ,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,EAClD,EAAE,CACH,CAAC;SACH;aAAM;YACL,4CAA4C;YAC5C,YAAY,GAAG,QAAQ,CACrB,QAAQ,CAAC,SAAS,CAAC,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,CAAC,CAAC,EAClD,EAAE,CACH,CAAC;SACH;QAED,IAAI,YAAY,GAAG,SAAS,CAAC,MAAM,EAAE;YACnC,gEAAgE;YAChE,QAAQ;gBACN,QAAQ,CAAC,SAAS,CAAC,CAAC,EAAE,UAAU,CAAC;oBACjC,SAAS,CAAC,YAAY,CAAC;oBACvB,QAAQ,CAAC,SAAS,CAAC,UAAU,GAAG,YAAY,CAAC,CAAC;SACjD;QACD,KAAK,GAAG,UAAU,GAAG,CAAC,CAAC,CAAC,qCAAqC;KAC9D;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC,CAAC;AAEF,kBAAe,0BAA0B,CAAC"}

package/build/executor/compressor/compress_functions/searchUnusedBytes.d.ts

@@ -1,9 +0,0 @@
-declare const searchUnusedBytes: ({ newAddresses, compressedCallData, }: {
-    newAddresses: string[];
-    compressedCallData: string;
-}) => {
-    addressPrefix: string;
-    newAddressPrefix: string;
-    duplicatedStringMarkers: string[];
-};
-export default searchUnusedBytes;

package/build/executor/compressor/compress_functions/searchUnusedBytes.js

@@ -1,33 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const intToByte_1 = __importDefault(require("../utils/intToByte"));
-const searchUnusedBytes = ({ newAddresses, compressedCallData, }) => {
-    let addressPrefix = '';
-    let newAddressPrefix = '';
-    let duplicatedStringMarkers = [];
-    for (let i = 1; i < 256; i++) {
-        if (addressPrefix.length &&
-            (newAddressPrefix.length || !newAddresses.length) &&
-            duplicatedStringMarkers.length === 6)
-            break;
-        let byte = (0, intToByte_1.default)(i);
-        if (!compressedCallData.includes(byte)) {
-            if (!addressPrefix.length)
-                addressPrefix = byte;
-            else if (!newAddressPrefix.length && newAddresses.length)
-                newAddressPrefix = byte;
-            else if (duplicatedStringMarkers.length < 6)
-                duplicatedStringMarkers.push(byte);
-        }
-    }
-    return {
-        addressPrefix,
-        newAddressPrefix,
-        duplicatedStringMarkers,
-    };
-};
-exports.default = searchUnusedBytes;
-//# sourceMappingURL=searchUnusedBytes.js.map

package/build/executor/compressor/compress_functions/searchUnusedBytes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"searchUnusedBytes.js","sourceRoot":"","sources":["../../../../src/executor/compressor/compress_functions/searchUnusedBytes.ts"],"names":[],"mappings":";;;;;AAAA,mEAA2C;AAE3C,MAAM,iBAAiB,GAAG,CAAC,EACzB,YAAY,EACZ,kBAAkB,GAInB,EAIC,EAAE;IACF,IAAI,aAAa,GAAG,EAAE,CAAC;IACvB,IAAI,gBAAgB,GAAG,EAAE,CAAC;IAC1B,IAAI,uBAAuB,GAAa,EAAE,CAAC;IAE3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;QAC5B,IACE,aAAa,CAAC,MAAM;YACpB,CAAC,gBAAgB,CAAC,MAAM,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;YACjD,uBAAuB,CAAC,MAAM,KAAK,CAAC;YAEpC,MAAM;QAER,IAAI,IAAI,GAAG,IAAA,mBAAS,EAAC,CAAC,CAAC,CAAC;QACxB,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE;YACtC,IAAI,CAAC,aAAa,CAAC,MAAM;gBAAE,aAAa,GAAG,IAAI,CAAC;iBAC3C,IAAI,CAAC,gBAAgB,CAAC,MAAM,IAAI,YAAY,CAAC,MAAM;gBACtD,gBAAgB,GAAG,IAAI,CAAC;iBACrB,IAAI,uBAAuB,CAAC,MAAM,GAAG,CAAC;gBACzC,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACtC;KACF;IAED,OAAO;QACL,aAAa;QACb,gBAAgB;QAChB,uBAAuB;KACxB,CAAC;AACJ,CAAC,CAAC;AAEF,kBAAe,iBAAiB,CAAC"}

package/build/executor/compressor/fetchSaved.js

@@ -1,17 +0,0 @@
-"use strict";
-// import fetchSavedAddresses from './utils/fetchSavedAddresses';
-// import fetchSavedMethods from './utils/fetchSavedMethods';
-// import contractAddressByNetwork from './../data/contractAddressByNetwork';
-// import fs from 'fs';
-// const fetchSaved = async (): Promise<void> => {
-//   setInterval(async () => {
-//     for (const network in contractAddressByNetwork) {
-//       const savedAddresses = await fetchSavedAddresses(network);
-//       const savedMethods = await fetchSavedMethods(network);
-//       fs.writeFileSync(`./lib/data/${network}/savedAddresses.js`, `module.exports = ${JSON.stringify(savedAddresses)}`);
-//       fs.writeFileSync(`./lib/data/${network}/savedMethods.js`, `module.exports = ${JSON.stringify(savedMethods)}`);
-//     }
-//   }, 1000 * 300);
-// };
-// fetchSaved();
-//# sourceMappingURL=fetchSaved.js.map

package/build/executor/compressor/fetchSaved.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fetchSaved.js","sourceRoot":"","sources":["../../../src/executor/compressor/fetchSaved.ts"],"names":[],"mappings":";AAAA,iEAAiE;AACjE,6DAA6D;AAC7D,6EAA6E;AAC7E,uBAAuB;AAEvB,kDAAkD;AAClD,8BAA8B;AAC9B,wDAAwD;AACxD,mEAAmE;AACnE,+DAA+D;AAE/D,2HAA2H;AAC3H,uHAAuH;AACvH,QAAQ;AACR,oBAAoB;AACpB,KAAK;AAEL,gBAAgB"}

package/build/executor/compressor/utils/computeCostL2.d.ts

@@ -1,2 +0,0 @@
-declare function computeCost(data: string): number;
-export default computeCost;

package/build/executor/compressor/utils/computeCostL2.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-// Function to compute cost based on zero and non-zero byte counts in data as priced by L2 (OP)
-function computeCost(data) {
-    let countZero = 0;
-    for (let i = data.startsWith('0x') ? 2 : 0; i < data.length; i += 2) {
-        if (data.substring(i, i + 2) == '00')
-            countZero++;
-    }
-    const cost = countZero * 4 + (data.length / 2 - countZero) * 16;
-    return cost;
-}
-exports.default = computeCost;
-//# sourceMappingURL=computeCostL2.js.map

package/build/executor/compressor/utils/computeCostL2.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"computeCostL2.js","sourceRoot":"","sources":["../../../../src/executor/compressor/utils/computeCostL2.ts"],"names":[],"mappings":";;AAAA,+FAA+F;AAC/F,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACnE,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI;YAAE,SAAS,EAAE,CAAC;KACnD;IACD,MAAM,IAAI,GAAG,SAAS,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;IAChE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,kBAAe,WAAW,CAAC"}

package/build/executor/compressor/utils/findLongestDuplicatedString.d.ts

@@ -1,2 +0,0 @@
-declare const findLongestDuplicatedString: (string: string) => string;
-export default findLongestDuplicatedString;

package/build/executor/compressor/utils/findLongestDuplicatedString.js

@@ -1,30 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const computeCostL2_1 = __importDefault(require("./computeCostL2"));
-const findLongestDuplicatedString = (string) => {
-    let maxLetters = '';
-    let maxCost = 0;
-    const allSames = [];
-    for (let i = 0; i < string.length; i += 2) {
-        let j = 0;
-        let searchedString = string.substring(i, i + 2);
-        while (string.substring(i + j * 2 + 2).indexOf(searchedString) > -1) {
-            let cost = (0, computeCostL2_1.default)(searchedString);
-            if (cost > maxCost) {
-                maxLetters = searchedString;
-                maxCost = cost;
-            }
-            j++;
-            searchedString = string.substring(i, i + j * 2 + 2);
-        }
-        if (searchedString.length > 6) {
-            allSames.push(searchedString.substring(0, searchedString.length - 2));
-        }
-    }
-    return maxLetters;
-};
-exports.default = findLongestDuplicatedString;
-//# sourceMappingURL=findLongestDuplicatedString.js.map

package/build/executor/compressor/utils/findLongestDuplicatedString.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"findLongestDuplicatedString.js","sourceRoot":"","sources":["../../../../src/executor/compressor/utils/findLongestDuplicatedString.ts"],"names":[],"mappings":";;;;;AAAA,oEAA0C;AAE1C,MAAM,2BAA2B,GAAG,CAAC,MAAc,EAAU,EAAE;IAC7D,IAAI,UAAU,GAAG,EAAE,CAAC;IACpB,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE;QACzC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAEhD,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE;YACnE,IAAI,IAAI,GAAG,IAAA,uBAAW,EAAC,cAAc,CAAC,CAAC;YACvC,IAAI,IAAI,GAAG,OAAO,EAAE;gBAClB,UAAU,GAAG,cAAc,CAAC;gBAC5B,OAAO,GAAG,IAAI,CAAC;aAChB;YACD,CAAC,EAAE,CAAC;YACJ,cAAc,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;SACrD;QAED,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE;YAC7B,QAAQ,CAAC,IAAI,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,EAAE,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;SACvE;KACF;IAED,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AAEF,kBAAe,2BAA2B,CAAC"}

package/build/executor/compressor/utils/getAllIndexes.d.ts

@@ -1,2 +0,0 @@
-declare function getAllIndexes<T>(arr: T[], val: T): number[];
-export default getAllIndexes;

package/build/executor/compressor/utils/getAllIndexes.js

@@ -1,12 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-function getAllIndexes(arr, val) {
-    let indexes = [];
-    let i = -1;
-    while ((i = arr.indexOf(val, i + 1)) != -1) {
-        indexes.push(i);
-    }
-    return indexes;
-}
-exports.default = getAllIndexes; // Function to get all indexes of a specific value in an array
-//# sourceMappingURL=getAllIndexes.js.map

package/build/executor/compressor/utils/getAllIndexes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getAllIndexes.js","sourceRoot":"","sources":["../../../../src/executor/compressor/utils/getAllIndexes.ts"],"names":[],"mappings":";;AAAA,SAAS,aAAa,CAAI,GAAQ,EAAE,GAAM;IACxC,IAAI,OAAO,GAAa,EAAE,CAAC;IAC3B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAEX,OAAO,CAAC,CAAC,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE;QAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;KACjB;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,kBAAe,aAAa,CAAC,CAAC,8DAA8D"}

package/build/executor/compressor/utils/getByteForAddress.d.ts

@@ -1,2 +0,0 @@
-declare const getByteForAddress: (addresses: string[], address: string) => string | null;
-export default getByteForAddress;

package/build/executor/compressor/utils/getByteForAddress.js

@@ -1,14 +0,0 @@
-"use strict";
-var __importDefault = (this && this.__importDefault) || function (mod) {
-    return (mod && mod.__esModule) ? mod : { "default": mod };
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-const intTo3Bytes_1 = __importDefault(require("./intTo3Bytes"));
-const getByteForAddress = (addresses, address) => {
-    const index = addresses.indexOf(address.toLowerCase());
-    if (index < 0)
-        return null;
-    return (0, intTo3Bytes_1.default)(index);
-};
-exports.default = getByteForAddress;
-//# sourceMappingURL=getByteForAddress.js.map

package/build/executor/compressor/utils/getByteForAddress.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getByteForAddress.js","sourceRoot":"","sources":["../../../../src/executor/compressor/utils/getByteForAddress.ts"],"names":[],"mappings":";;;;;AAAA,gEAAwC;AAExC,MAAM,iBAAiB,GAAG,CACxB,SAAmB,EACnB,OAAe,EACA,EAAE;IACjB,MAAM,KAAK,GAAG,SAAS,CAAC,OAAO,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC;IACvD,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE3B,OAAO,IAAA,qBAAW,EAAC,KAAK,CAAC,CAAC;AAC5B,CAAC,CAAC;AAEF,kBAAe,iBAAiB,CAAC"}

package/build/executor/compressor/utils/intTo2Bytes.d.ts

@@ -1,2 +0,0 @@
-declare const intTo2Bytes: (int: number) => string;
-export default intTo2Bytes;

package/build/executor/compressor/utils/intTo2Bytes.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-const intTo2Bytes = (int) => {
-    let hex = int.toString(16);
-    if (hex.length < 2)
-        hex = '000' + hex;
-    else if (hex.length < 3)
-        hex = '00' + hex;
-    else if (hex.length < 4)
-        hex = '0' + hex;
-    return hex;
-};
-exports.default = intTo2Bytes;
-//# sourceMappingURL=intTo2Bytes.js.map

package/build/executor/compressor/utils/intTo2Bytes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"intTo2Bytes.js","sourceRoot":"","sources":["../../../../src/executor/compressor/utils/intTo2Bytes.ts"],"names":[],"mappings":";;AAAA,MAAM,WAAW,GAAG,CAAC,GAAW,EAAU,EAAE;IAC1C,IAAI,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;IAC3B,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;SACjC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,GAAG,IAAI,GAAG,GAAG,CAAC;SACrC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC;QAAE,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAEzC,OAAO,GAAG,CAAC;AACb,CAAC,CAAC;AAEF,kBAAe,WAAW,CAAC"}

package/build/executor/compressor/utils/intTo3Bytes.d.ts

@@ -1,2 +0,0 @@
-declare const intTo3Bytes: (int: number) => string;
-export default intTo3Bytes;