HSCAN key cursor [MATCH pattern] [COUNT count]
Available since 2.8.0.
Time complexity: O(1) for every call. O(N) for a complete iteration, including enough command calls for the cursor to return back to 0. N is the number of elements inside the collection..
See SCAN for HSCAN documentation.
© 2009–2017 Salvatore SanfilippoLicensed under the Creative Commons Attribution-ShareAlike License 4.0.