"summary":"Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a point",
"summary":"Queries a geospatial index for members within a distance from a coordinate, optionally stores the result.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"summary":"Returns members from a geospatial index that are within a distance from a coordinate.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"summary":"Query a sorted set representing a geospatial index to fetch members matching a given maximum distance from a member",
"summary":"Queries a geospatial index for members within a distance from a member, optionally stores the result.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"summary":"A read-only variant for GEORADIUSBYMEMBER",
"summary":"Returns members from a geospatial index that are within a distance from a member.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"complexity":"O(N+log(M)) where N is the number of elements inside the bounding box of the circular area delimited by center and radius and M is the number of items inside the index.",
"summary":"Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle.",
"summary":"Queries a geospatial index for members inside an area of a box or a circle.",
"complexity":"O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape",
"complexity":"O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape",
"summary":"Query a sorted set representing a geospatial index to fetch members inside an area of a box or a circle, and store the result in another key.",
"summary":"Queries a geospatial index for members inside an area of a box or a circle, optionally stores the result.",
"complexity":"O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape",
"complexity":"O(N+log(M)) where N is the number of elements in the grid-aligned bounding box area around the shape provided as the filter and M is the number of items inside the shape",
"summary":"Get a substring of the string stored at a key",
"summary":"Returns a substring of the string stored at a key.",
"complexity":"O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.",
"complexity":"O(N) where N is the length of the returned string. The complexity is ultimately determined by the returned length, but because creating a substring from an existing string is very cheap, it can be considered O(1) for small strings.",