@hyperweb/telescope 2.1.0 → 2.2.1

package/src/helpers/varint.ts

@@ -1,483 +0,0 @@
-export const varint = `
-// Copyright 2008 Google Inc.  All rights reserved.
-//
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are
-// met:
-//
-// * Redistributions of source code must retain the above copyright
-// notice, this list of conditions and the following disclaimer.
-// * Redistributions in binary form must reproduce the above
-// copyright notice, this list of conditions and the following disclaimer
-// in the documentation and/or other materials provided with the
-// distribution.
-// * Neither the name of Google Inc. nor the names of its
-// contributors may be used to endorse or promote products derived from
-// this software without specific prior written permission.
-//
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
-// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
-// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
-// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
-// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
-// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
-// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
-// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
-// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-//
-// Code generated by the Protocol Buffer compiler is owned by the owner
-// of the input file used when generating it.  This code is not
-// standalone and requires a support library to be linked with it.  This
-// support library is itself covered by the above license.
-
-/* eslint-disable prefer-const,@typescript-eslint/restrict-plus-operands */
-
-/**
- * Read a 64 bit varint as two JS numbers.
- *
- * Returns tuple:
- * [0]: low bits
- * [1]: high bits
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/buffer_decoder.js#L175
- */
-export function varint64read(this: ReaderLike): [number, number] {
-  let lowBits = 0;
-  let highBits = 0;
-
-  for (let shift = 0; shift < 28; shift += 7) {
-    let b = this.buf[this.pos++];
-    lowBits |= (b & 0x7f) << shift;
-    if ((b & 0x80) == 0) {
-      this.assertBounds();
-      return [lowBits, highBits];
-    }
-  }
-
-  let middleByte = this.buf[this.pos++];
-
-  // last four bits of the first 32 bit number
-  lowBits |= (middleByte & 0x0f) << 28;
-
-  // 3 upper bits are part of the next 32 bit number
-  highBits = (middleByte & 0x70) >> 4;
-
-  if ((middleByte & 0x80) == 0) {
-    this.assertBounds();
-    return [lowBits, highBits];
-  }
-
-  for (let shift = 3; shift <= 31; shift += 7) {
-    let b = this.buf[this.pos++];
-    highBits |= (b & 0x7f) << shift;
-    if ((b & 0x80) == 0) {
-      this.assertBounds();
-      return [lowBits, highBits];
-    }
-  }
-
-  throw new Error("invalid varint");
-}
-
-/**
- * Write a 64 bit varint, given as two JS numbers, to the given bytes array.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/writer.js#L344
- */
-export function varint64write(lo: number, hi: number, bytes: number[]): void {
-  for (let i = 0; i < 28; i = i + 7) {
-    const shift = lo >>> i;
-    const hasNext = !(shift >>> 7 == 0 && hi == 0);
-    const byte = (hasNext ? shift | 0x80 : shift) & 0xff;
-    bytes.push(byte);
-    if (!hasNext) {
-      return;
-    }
-  }
-
-  const splitBits = ((lo >>> 28) & 0x0f) | ((hi & 0x07) << 4);
-  const hasMoreBits = !(hi >> 3 == 0);
-  bytes.push((hasMoreBits ? splitBits | 0x80 : splitBits) & 0xff);
-
-  if (!hasMoreBits) {
-    return;
-  }
-
-  for (let i = 3; i < 31; i = i + 7) {
-    const shift = hi >>> i;
-    const hasNext = !(shift >>> 7 == 0);
-    const byte = (hasNext ? shift | 0x80 : shift) & 0xff;
-    bytes.push(byte);
-    if (!hasNext) {
-      return;
-    }
-  }
-
-  bytes.push((hi >>> 31) & 0x01);
-}
-
-// constants for binary math
-const TWO_PWR_32_DBL = 0x100000000;
-
-/**
- * Parse decimal string of 64 bit integer value as two JS numbers.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
- */
-export function int64FromString(dec: string): { lo: number; hi: number } {
-  // Check for minus sign.
-  const minus = dec[0] === "-";
-  if (minus) {
-    dec = dec.slice(1);
-  }
-
-  // Work 6 decimal digits at a time, acting like we're converting base 1e6
-  // digits to binary. This is safe to do with floating point math because
-  // Number.isSafeInteger(ALL_32_BITS * 1e6) == true.
-  const base = 1e6;
-  let lowBits = 0;
-  let highBits = 0;
-
-  function add1e6digit(begin: number, end?: number) {
-    // Note: Number('') is 0.
-    const digit1e6 = Number(dec.slice(begin, end));
-    highBits *= base;
-    lowBits = lowBits * base + digit1e6;
-    // Carry bits from lowBits to
-    if (lowBits >= TWO_PWR_32_DBL) {
-      highBits = highBits + ((lowBits / TWO_PWR_32_DBL) | 0);
-      lowBits = lowBits % TWO_PWR_32_DBL;
-    }
-  }
-
-  add1e6digit(-24, -18);
-  add1e6digit(-18, -12);
-  add1e6digit(-12, -6);
-  add1e6digit(-6);
-  return minus ? negate(lowBits, highBits) : newBits(lowBits, highBits);
-}
-
-/**
- * Losslessly converts a 64-bit signed integer in 32:32 split representation
- * into a decimal string.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
- */
-export function int64ToString(lo: number, hi: number): string {
-  let bits = newBits(lo, hi);
-  // If we're treating the input as a signed value and the high bit is set, do
-  // a manual two's complement conversion before the decimal conversion.
-  const negative = bits.hi & 0x80000000;
-  if (negative) {
-    bits = negate(bits.lo, bits.hi);
-  }
-  const result = uInt64ToString(bits.lo, bits.hi);
-  return negative ? "-" + result : result;
-}
-
-/**
- * Losslessly converts a 64-bit unsigned integer in 32:32 split representation
- * into a decimal string.
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf-javascript/blob/a428c58273abad07c66071d9753bc4d1289de426/experimental/runtime/int64.js#L10
- */
-export function uInt64ToString(lo: number, hi: number): string {
-  ({ lo, hi } = toUnsigned(lo, hi));
-  // Skip the expensive conversion if the number is small enough to use the
-  // built-in conversions.
-  // Number.MAX_SAFE_INTEGER = 0x001FFFFF FFFFFFFF, thus any number with
-  // highBits <= 0x1FFFFF can be safely expressed with a double and retain
-  // integer precision.
-  // Proven by: Number.isSafeInteger(0x1FFFFF * 2**32 + 0xFFFFFFFF) == true.
-  if (hi <= 0x1fffff) {
-    return String(TWO_PWR_32_DBL * hi + lo);
-  }
-
-  // What this code is doing is essentially converting the input number from
-  // base-2 to base-1e7, which allows us to represent the 64-bit range with
-  // only 3 (very large) digits. Those digits are then trivial to convert to
-  // a base-10 string.
-
-  // The magic numbers used here are -
-  // 2^24 = 16777216 = (1,6777216) in base-1e7.
-  // 2^48 = 281474976710656 = (2,8147497,6710656) in base-1e7.
-
-  // Split 32:32 representation into 16:24:24 representation so our
-  // intermediate digits don't overflow.
-  const low = lo & 0xffffff;
-  const mid = ((lo >>> 24) | (hi << 8)) & 0xffffff;
-  const high = (hi >> 16) & 0xffff;
-
-  // Assemble our three base-1e7 digits, ignoring carries. The maximum
-  // value in a digit at this step is representable as a 48-bit integer, which
-  // can be stored in a 64-bit floating point number.
-  let digitA = low + mid * 6777216 + high * 6710656;
-  let digitB = mid + high * 8147497;
-  let digitC = high * 2;
-
-  // Apply carries from A to B and from B to C.
-  const base = 10000000;
-  if (digitA >= base) {
-    digitB += Math.floor(digitA / base);
-    digitA %= base;
-  }
-
-  if (digitB >= base) {
-    digitC += Math.floor(digitB / base);
-    digitB %= base;
-  }
-
-  // If digitC is 0, then we should have returned in the trivial code path
-  // at the top for non-safe integers. Given this, we can assume both digitB
-  // and digitA need leading zeros.
-  return (
-    digitC.toString() +
-    decimalFrom1e7WithLeadingZeros(digitB) +
-    decimalFrom1e7WithLeadingZeros(digitA)
-  );
-}
-
-function toUnsigned(lo: number, hi: number): { lo: number; hi: number } {
-  return { lo: lo >>> 0, hi: hi >>> 0 };
-}
-
-function newBits(lo: number, hi: number): { lo: number; hi: number } {
-  return { lo: lo | 0, hi: hi | 0 };
-}
-
-/**
- * Returns two's compliment negation of input.
- * @see https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/Bitwise_Operators#Signed_32-bit_integers
- */
-function negate(lowBits: number, highBits: number) {
-  highBits = ~highBits;
-  if (lowBits) {
-    lowBits = ~lowBits + 1;
-  } else {
-    // If lowBits is 0, then bitwise-not is 0xFFFFFFFF,
-    // adding 1 to that, results in 0x100000000, which leaves
-    // the low bits 0x0 and simply adds one to the high bits.
-    highBits += 1;
-  }
-  return newBits(lowBits, highBits);
-}
-
-/**
- * Returns decimal representation of digit1e7 with leading zeros.
- */
-const decimalFrom1e7WithLeadingZeros = (digit1e7: number) => {
-  const partial = String(digit1e7);
-  return "0000000".slice(partial.length) + partial;
-};
-
-/**
- * Write a 32 bit varint, signed or unsigned. Same as \`varint64write(0, value, bytes)\`
- *
- * Copyright 2008 Google Inc.  All rights reserved.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/1b18833f4f2a2f681f4e4a25cdf3b0a43115ec26/js/binary/encoder.js#L144
- */
-export function varint32write(value: number, bytes: number[]): void {
-  if (value >= 0) {
-    // write value as varint 32
-    while (value > 0x7f) {
-      bytes.push((value & 0x7f) | 0x80);
-      value = value >>> 7;
-    }
-    bytes.push(value);
-  } else {
-    for (let i = 0; i < 9; i++) {
-      bytes.push((value & 127) | 128);
-      value = value >> 7;
-    }
-    bytes.push(1);
-  }
-}
-
-/**
- * Read an unsigned 32 bit varint.
- *
- * See https://github.com/protocolbuffers/protobuf/blob/8a71927d74a4ce34efe2d8769fda198f52d20d12/js/experimental/runtime/kernel/buffer_decoder.js#L220
- */
-export function varint32read(this: ReaderLike): number {
-  let b = this.buf[this.pos++];
-  let result = b & 0x7f;
-  if ((b & 0x80) == 0) {
-    this.assertBounds();
-    return result;
-  }
-
-  b = this.buf[this.pos++];
-  result |= (b & 0x7f) << 7;
-  if ((b & 0x80) == 0) {
-    this.assertBounds();
-    return result;
-  }
-
-  b = this.buf[this.pos++];
-  result |= (b & 0x7f) << 14;
-  if ((b & 0x80) == 0) {
-    this.assertBounds();
-    return result;
-  }
-
-  b = this.buf[this.pos++];
-  result |= (b & 0x7f) << 21;
-  if ((b & 0x80) == 0) {
-    this.assertBounds();
-    return result;
-  }
-
-  // Extract only last 4 bits
-  b = this.buf[this.pos++];
-  result |= (b & 0x0f) << 28;
-
-  for (let readBytes = 5; (b & 0x80) !== 0 && readBytes < 10; readBytes++)
-    b = this.buf[this.pos++];
-
-  if ((b & 0x80) != 0) throw new Error("invalid varint");
-
-  this.assertBounds();
-
-  // Result can have 32 bits, convert it to unsigned
-  return result >>> 0;
-}
-
-type ReaderLike = {
-  buf: Uint8Array;
-  pos: number;
-  len: number;
-  assertBounds(): void;
-};
-
-/**
- * encode zig zag
- */
-export function zzEncode(lo: number, hi: number) {
-  let mask = hi >> 31;
-  hi = (((hi << 1) | (lo >>> 31)) ^ mask) >>> 0;
-  lo = ((lo << 1) ^ mask) >>> 0;
-  return [lo, hi];
-}
-
-/**
- * decode zig zag
- */
-export function zzDecode(lo: number, hi: number) {
-  let mask = -(lo & 1);
-  lo = (((lo >>> 1) | (hi << 31)) ^ mask) >>> 0;
-  hi = ((hi >>> 1) ^ mask) >>> 0;
-  return [lo, hi];
-}
-
-/**
- * unsigned int32 without moving pos.
- */
-export function readUInt32(buf: Uint8Array, pos: number) {
-  return (
-    (buf[pos] | (buf[pos + 1] << 8) | (buf[pos + 2] << 16)) +
-    buf[pos + 3] * 0x1000000
-  );
-}
-
-/**
- * signed int32 without moving pos.
- */
-export function readInt32(buf: Uint8Array, pos: number) {
-  return (
-    (buf[pos] | (buf[pos + 1] << 8) | (buf[pos + 2] << 16)) +
-    (buf[pos + 3] << 24)
-  );
-}
-
-/**
- * writing varint32 to pos
- */
-export function writeVarint32(
-  val: number,
-  buf: Uint8Array | number[],
-  pos: number
-) {
-  while (val > 127) {
-    buf[pos++] = (val & 127) | 128;
-    val >>>= 7;
-  }
-  buf[pos] = val;
-}
-
-/**
- * writing varint64 to pos
- */
-export function writeVarint64(
-  val: { lo: number; hi: number },
-  buf: Uint8Array | number[],
-  pos: number
-) {
-  while (val.hi) {
-    buf[pos++] = (val.lo & 127) | 128;
-    val.lo = ((val.lo >>> 7) | (val.hi << 25)) >>> 0;
-    val.hi >>>= 7;
-  }
-  while (val.lo > 127) {
-    buf[pos++] = (val.lo & 127) | 128;
-    val.lo = val.lo >>> 7;
-  }
-  buf[pos++] = val.lo;
-}
-
-export function int64Length(lo: number, hi: number) {
-  let part0 = lo,
-    part1 = ((lo >>> 28) | (hi << 4)) >>> 0,
-    part2 = hi >>> 24;
-  return part2 === 0
-    ? part1 === 0
-      ? part0 < 16384
-        ? part0 < 128
-          ? 1
-          : 2
-        : part0 < 2097152
-        ? 3
-        : 4
-      : part1 < 16384
-      ? part1 < 128
-        ? 5
-        : 6
-      : part1 < 2097152
-      ? 7
-      : 8
-    : part2 < 128
-    ? 9
-    : 10;
-}
-
-export function writeFixed32(
-  val: number,
-  buf: Uint8Array | number[],
-  pos: number
-) {
-  buf[pos] = val & 255;
-  buf[pos + 1] = (val >>> 8) & 255;
-  buf[pos + 2] = (val >>> 16) & 255;
-  buf[pos + 3] = val >>> 24;
-}
-
-export function writeByte(
-  val: number,
-  buf: Uint8Array | number[],
-  pos: number
-) {
-  buf[pos] = val & 255;
-}
-`;

package/src/helpers/vue-query-hooks.ts

@@ -1,224 +0,0 @@
-import { TelescopeOptions } from "@cosmology/types";
-
-export const getVueQueryHelperHooks = (options: TelescopeOptions) => {
-  return `
-
-
-import { getRpcClient } from './extern${options.restoreImportExtension ?? ""}'
-import {
-  isRpc,
-  Rpc,
-} from './helpers${options.restoreImportExtension ?? ""}'
-import {
-  ITxArgs,
-  EndpointOrRpc,
-} from './helper-func-types${options.restoreImportExtension ?? ""}'
-import { ISigningClient, isISigningClient } from "@interchainjs/cosmos/types/signing-client${options.restoreImportExtension ?? ""}";
-import {
-  StdFee,
-
-} from './types${options.restoreImportExtension ?? ""}'
-import {
-    useQuery,
-    useQueryClient,
-    UseQueryOptions,
-    useMutation,
-    UseMutationOptions,
-    QueryKey,
-} from '@tanstack/vue-query';
-
-import { HttpEndpoint } from "@interchainjs/types";
-import { Rpc as ProtobufRpcClient } from "./helpers${options.restoreImportExtension ?? ""}";
-
-import {Ref} from 'vue'
-
-export const DEFAULT_RPC_CLIENT_QUERY_KEY = 'rpcClient';
-export const DEFAULT_RPC_ENDPOINT_QUERY_KEY = 'rpcEndPoint';
-export const DEFAULT_SIGNING_CLIENT_QUERY_KEY = 'signingClient';
-
-export interface CacheResolver {
-    rpcEndpoint?: string | HttpEndpoint;
-    clientQueryKey?: string;
-}
-
-export function isCacheResolver(resolver: unknown): resolver is CacheResolver {
-  return (
-    resolver !== null &&
-    resolver !== undefined &&
-    (resolver as CacheResolver).rpcEndpoint !== undefined &&
-    (resolver as CacheResolver).clientQueryKey !== undefined
-  );
-}
-
-export interface VueQueryParams<TResponse, TData = TResponse> {
-  options?: UseQueryOptions<TResponse, Error, TData>;
-}
-
-export interface UseRpcClientQuery<TData> extends VueQueryParams<ProtobufRpcClient, TData> {
-  clientResolver?: CacheResolver;
-}
-
-export interface UseRpcEndpointQuery<TData> extends VueQueryParams<string | HttpEndpoint, TData> {
-    getter: () => Promise<string | HttpEndpoint>;
-    rpcEndPointKey?: string;
-    extraKey?: string
-}
-
-export function useRpcEndpoint<TData = string | HttpEndpoint>({
-  getter,
-  options,
-  rpcEndPointKey,
-  extraKey,
-}: UseRpcEndpointQuery<TData>) {
-  const key = rpcEndPointKey || DEFAULT_RPC_ENDPOINT_QUERY_KEY;
-  return useQuery<string | HttpEndpoint, Error, TData>(
-    {
-      queryKey: [key, extraKey],
-      queryFn: async () => {
-        return await getter();
-      }, ...options
-    }
-  );
-};
-
-export function useRpcClient<TData = ProtobufRpcClient>({
-  options,
-  clientResolver,
-}: UseRpcClientQuery<TData>) {
-  const queryClient = useQueryClient();
-
-  const key = clientResolver?.clientQueryKey || DEFAULT_RPC_CLIENT_QUERY_KEY;
-  return useQuery<ProtobufRpcClient, Error, TData>({
-    queryKey: [key, clientResolver?.rpcEndpoint],
-    queryFn: async () => {
-      if (!clientResolver?.rpcEndpoint) {
-        throw new Error('rpcEndpoint is required');
-      }
-
-      const client = await getRpcClient(clientResolver.rpcEndpoint);
-      if (!client) {
-        throw new Error('Failed to connect to rpc client');
-      }
-
-      queryClient.setQueryData([key], client);
-
-      return client;
-    },
-    ...options
-  }
-  );
-}
-
-export interface UseQueryBuilderOptions<TReq, TRes> {
-  builderQueryFn: (client: EndpointOrRpc, request: TReq) => Promise<TRes>;
-  queryKeyPrefix: string;
-}
-
-export function buildUseVueQuery<TReq, TRes>(
-  opts: UseQueryBuilderOptions<TReq, TRes>
-) {
-  return function useBuiltQuery<TData = TRes>({
-    request,
-    options,
-    clientResolver,
-    customizedQueryKey,
-  }: UseQueryParams<TReq, TRes, TData>) {
-    const queryClient = useQueryClient();
-    let rpcResolver: EndpointOrRpc | undefined;
-    if (isRpc(clientResolver)) {
-      rpcResolver = clientResolver;
-
-    } else if (isCacheResolver(clientResolver)) {
-      const key = clientResolver.clientQueryKey || DEFAULT_RPC_CLIENT_QUERY_KEY;
-      const queryKey = clientResolver.rpcEndpoint
-        ? [key, clientResolver.rpcEndpoint]
-        : [key];
-      rpcResolver = queryClient.getQueryData<Rpc>(queryKey);
-
-      if (!rpcResolver && clientResolver.rpcEndpoint) {
-        rpcResolver = clientResolver.rpcEndpoint;
-      }
-    } else {
-      rpcResolver = clientResolver;
-
-    }
-
-    return useQuery<TRes, Error, TData>({
-      queryKey: customizedQueryKey || [opts.queryKeyPrefix, request],
-      queryFn: () => opts.builderQueryFn(rpcResolver!, request.value),
-      ...options
-    }
-    );
-  };
-}
-
-export interface UseQueryParams<TReq, TRes, TData = TRes>
-  extends VueQueryParams<TRes, TData> {
-  request: Ref<TReq>;
-  clientResolver?: CacheResolver | EndpointOrRpc;
-  customizedQueryKey?: QueryKey;
-}
-
-export interface VueMutationParams<
-  TData,
-  TError,
-  TVariables,
-  TContext = unknown
-> {
-  options?: UseMutationOptions<TData, TError, TVariables, TContext>;
-  clientResolver?: CacheResolver | ISigningClient;
-}
-
-export interface UseMutationBuilderOptions<TMsg> {
-  builderMutationFn: (
-    client: ISigningClient,
-    signerAddress: string,
-    message: TMsg | TMsg[],
-    fee: StdFee | 'auto',
-    memo: string
-  ) => Promise<any>;
-}
-
-export function buildUseVueMutation<TMsg, TError>(
-  opts: UseMutationBuilderOptions<TMsg>
-) {
-  return function useBuiltMutation({
-    options,
-    clientResolver,
-  }: VueMutationParams<any, TError, ITxArgs<TMsg>>) {
-    const queryClient = useQueryClient();
-
-    let signingClientResolver: ISigningClient | undefined;
-
-    if (isISigningClient(clientResolver)) {
-      signingClientResolver = clientResolver;
-    } else if (isCacheResolver(clientResolver)) {
-      const key =
-        clientResolver.clientQueryKey || DEFAULT_SIGNING_CLIENT_QUERY_KEY;
-      const queryKey = clientResolver.rpcEndpoint
-        ? [key, clientResolver.rpcEndpoint]
-        : [key];
-      signingClientResolver = queryClient.getQueryData<ISigningClient>(
-        queryKey
-      );
-    } else {
-      clientResolver = clientResolver;
-    }
-
-    return useMutation<any, TError, ITxArgs<TMsg>>(
-      {
-        mutationFn: (reqData: ITxArgs<TMsg>) =>
-          opts.builderMutationFn(
-            signingClientResolver!,
-            reqData.signerAddress,
-            reqData.message,
-            reqData.fee,
-            reqData.memo
-          ),
-        ...options
-      }
-    );
-  };
-}
-`;
-};