Hi,
the zipmap data structure is described in the comments of:
HVALS is still O(N)
Contrary to a normal hash, zipmap'd HSET is O(N), with a rather high
constant factor when the zipmap must be reallocated and copied.
The higher hash-zipmap-max-entries, the more expensive reallocation/copy
operations will be.
Since only one byte is used to store the size, complexity of zipmap'd
HLEN is also O(N) when N > 253 (while it is constant time for normal hash).
I don't not why. Personally, I would have put at least 2 bytes, to make sure
HLEN is kept constant time for the default size value (512).
Regards,
Didier.