def hscan(self, name, cursor=<NUM_LIT:0>, match=None, count=None):
with self.pipe as pipe:<EOL><INDENT>f = Future()<EOL>res = pipe.hscan(self.redis_key(name), cursor=cursor,<EOL>match=match, count=count)<EOL>def cb():<EOL><INDENT>data = {}<EOL>m_decode = self.memberparse.decode<EOL>for k, v in res[<NUM_LIT:1>].items():<EOL><INDENT>k = m_decode(k)<EOL>v = self._value_decode(k, v)<EOL>data[k] = v<EOL><DEDENT>f.set((res[<NUM_LIT:0>], data))<EOL><DEDENT>pipe.on_execute(cb)<EOL>return f<EOL><DEDENT>
Incrementally return key/value slices in a hash. Also return a cursor
indicating the scan position.

``match`` allows for filtering the keys by pattern

``count`` allows for hint the minimum number of returns