Hierarchy (view full)

Constructors

Methods

  • Parameters

    • value: any

    Returns BigInt

  • binarySearch

    Parameters

    • array: Buffer[]

      Array of items.

    • element: Buffer

      Item to find.

    • compareFunction: ((a: unknown, b: unknown) => number)
        • (a, b): number
        • Parameters

          • a: unknown
          • b: unknown

          Returns number

    Returns number

    • Index number

    Returns the first index of which given item is found in array using binary search.

    const index = tree.binarySearch(array, element, Buffer.compare)
    
  • bufferToHex

    Parameters

    • value: Buffer
    • OptionalwithPrefix: boolean

    Returns string

    Returns a hex string with 0x prefix for given buffer.

    const hexStr = tree.bufferToHex(Buffer.from('A'))
    
  • bufferify

    Parameters

    • value: any

    Returns Buffer

    Returns a buffer type for the given value.

    const buf = tree.bufferify('0x1234')
    
  • bufferifyFn

    Parameters

    • f: any

    Returns any

    Returns a function that will bufferify the return value.

    const fn = tree.bufferifyFn((value) => sha256(value))
    
  • linearSearch

    Parameters

    • array: Buffer[]

      Array of items.

    • element: Buffer

      Item to find.

    • eqChecker: ((a: unknown, b: unknown) => boolean)
        • (a, b): boolean
        • Parameters

          • a: unknown
          • b: unknown

          Returns boolean

    Returns number

    • Index number

    Returns the first index of which given item is found in array using linear search.

    const index = tree.linearSearch(array, element, (a, b) => a === b)
    
  • print

    Returns void

    Prints out a visual representation of the merkle tree.

    tree.print()
    
  • Parameters

    • value: any

    Returns BigInt

  • binarySearch

    Parameters

    • array: Buffer[]

      Array of items.

    • element: Buffer

      Item to find.

    • compareFunction: ((a: unknown, b: unknown) => number)
        • (a, b): number
        • Parameters

          • a: unknown
          • b: unknown

          Returns number

    Returns number

    • Index number

    Returns the first index of which given item is found in array using binary search.

    const index = MerkleTree.binarySearch(array, element, Buffer.compare)
    
  • bufferToHex

    Parameters

    • value: Buffer
    • OptionalwithPrefix: boolean

    Returns string

    Returns a hex string with 0x prefix for given buffer.

    const hexStr = MerkleTree.bufferToHex(Buffer.from('A'))
    
  • bufferify

    Parameters

    • value: any

    Returns Buffer

    Returns a buffer type for the given value.

    const buf = MerkleTree.bufferify('0x1234')
    
  • Parameters

    • hexStr: string
    • length: number

    Returns string

  • isHexString

    Parameters

    • v: string

    Returns boolean

    Returns true if value is a hex string.

    console.log(MerkleTree.isHexString('0x1234'))
    
  • linearSearch

    Parameters

    • array: Buffer[]

      Array of items.

    • element: Buffer

      Item to find.

    • eqChecker: ((a: unknown, b: unknown) => boolean)
        • (a, b): boolean
        • Parameters

          • a: unknown
          • b: unknown

          Returns boolean

    Returns number

    • Index number

    Returns the first index of which given item is found in array using linear search.

    const index = MerkleTree.linearSearch(array, element, (a, b) => a === b)
    
  • print

    Parameters

    • tree: any

      Merkle tree instance.

    Returns void

    Prints out a visual representation of the given merkle tree.

    MerkleTree.print(tree)