Much slower than iter(), but much more memory efficient if
            k/v's retrieved are one-offs

            @match: matches member names in the sorted set
            @count: the user specified the amount of work that should be done
                at every call in order to retrieve elements from the collection

            -> iterator of |(member, score)| pairs

def iterscan(self, match="*", count=1000):
        """ Much slower than iter(), but much more memory efficient if
            k/v's retrieved are one-offs

            @match: matches member names in the sorted set
            @count: the user specified the amount of work that should be done
                at every call in order to retrieve elements from the collection

            -> iterator of |(member, score)| pairs
        """
        if self.serialized:
            return map(
                lambda x: (self._loads(x[0]), self.cast(x[1])),
                self._client.zscan_iter(
                    self.key_prefix, match=match, count=count))
        else:
            return map(
                lambda x: (self._decode(x[0]), self.cast(x[1])),
                self._client.zscan_iter(
                    self.key_prefix, match=match, count=count))