code: def hashlookupjoin(left, right, key=None, lkey=None, rkey=None, missing=None,
                     lprefix=None, rprefix=None):
      
  
      lkey, rkey = keys_from_args(left, right, key, lkey, rkey)
      return HashLookupJoinView(left, right, lkey, rkey, missing=missing,
                                lprefix=lprefix, rprefix=rprefix)
docs: Alternative implementation of :func:`petl.transform.joins.lookupjoin`,
      where the join is executed by constructing an in-memory lookup for the
      right hand table, then iterating over rows from the left hand table.
  
      May be faster and/or more resource efficient where the right table is small
      and the left table is large.
  
      Left and right tables with different key fields can be handled via the
      `lkey` and `rkey` arguments.