Commit ad94bc31 authored by Vitaly Arbuzov's avatar Vitaly Arbuzov
Browse files

Merge branch 'unstable' into dict-split-by-slot

parents a08686a5 e55568ed
{ {
"GEOHASH": { "GEOHASH": {
"summary": "Returns members of a geospatial index as standard geohash strings", "summary": "Returns members from a geospatial index as geohash strings.",
"complexity": "O(log(N)) for each member requested, where N is the number of elements in the sorted set.", "complexity": "O(log(N)) for each member requested, where N is the number of elements in the sorted set.",
"group": "geo", "group": "geo",
"since": "3.2.0", "since": "3.2.0",
......
{ {
"GEOPOS": { "GEOPOS": {
"summary": "Returns longitude and latitude of members of a geospatial index", "summary": "Returns the longitude and latitude of members from a geospatial index.",
"complexity": "O(N) where N is the number of members requested.", "complexity": "O(N) where N is the number of members requested.",
"group": "geo", "group": "geo",
"since": "3.2.0", "since": "3.2.0",
......
{ {
"GEORADIUS": { "GEORADIUS": {
"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.",
"group": "geo", "group": "geo",
"since": "3.2.0", "since": "3.2.0",
......
{ {
"GEORADIUS_RO": { "GEORADIUS_RO": {
"summary": "A read-only variant for GEORADIUS", "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.",
"group": "geo", "group": "geo",
"since": "3.2.10", "since": "3.2.10",
......
{ {
"GEORADIUSBYMEMBER": { "GEORADIUSBYMEMBER": {
"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.",
"group": "geo", "group": "geo",
"since": "3.2.0", "since": "3.2.0",
......
{ {
"GEORADIUSBYMEMBER_RO": { "GEORADIUSBYMEMBER_RO": {
"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.",
"group": "geo", "group": "geo",
"since": "3.2.10", "since": "3.2.10",
......
{ {
"GEOSEARCH": { "GEOSEARCH": {
"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",
"group": "geo", "group": "geo",
"since": "6.2.0", "since": "6.2.0",
......
{ {
"GEOSEARCHSTORE": { "GEOSEARCHSTORE": {
"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",
"group": "geo", "group": "geo",
"since": "6.2.0", "since": "6.2.0",
......
{ {
"GET": { "GET": {
"summary": "Get the value of a key", "summary": "Returns the string value of a key.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "string", "group": "string",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"GETBIT": { "GETBIT": {
"summary": "Returns the bit value at offset in the string value stored at key", "summary": "Returns a bit value by offset.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "bitmap", "group": "bitmap",
"since": "2.2.0", "since": "2.2.0",
......
{ {
"GETDEL": { "GETDEL": {
"summary": "Get the value of a key and delete the key", "summary": "Returns the string value of a key after deleting the key.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "string", "group": "string",
"since": "6.2.0", "since": "6.2.0",
......
{ {
"GETEX": { "GETEX": {
"summary": "Get the value of a key and optionally set its expiration", "summary": "Returns the string value of a key after setting its expiration time.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "string", "group": "string",
"since": "6.2.0", "since": "6.2.0",
......
{ {
"GETRANGE": { "GETRANGE": {
"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.",
"group": "string", "group": "string",
"since": "2.4.0", "since": "2.4.0",
......
{ {
"GETSET": { "GETSET": {
"summary": "Set the string value of a key and return its old value", "summary": "Returns the previous string value of a key after setting it to a new value.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "string", "group": "string",
"since": "1.0.0", "since": "1.0.0",
......
{ {
"HDEL": { "HDEL": {
"summary": "Delete one or more hash fields", "summary": "Deletes one or more fields and their values from a hash. Deletes the hash if no fields remain.",
"complexity": "O(N) where N is the number of fields to be removed.", "complexity": "O(N) where N is the number of fields to be removed.",
"group": "hash", "group": "hash",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"HELLO": { "HELLO": {
"summary": "Handshake with Redis", "summary": "Handshakes with the Redis server.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "connection", "group": "connection",
"since": "6.0.0", "since": "6.0.0",
......
{ {
"HEXISTS": { "HEXISTS": {
"summary": "Determine if a hash field exists", "summary": "Determines whether a field exists in a hash.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "hash", "group": "hash",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"HGET": { "HGET": {
"summary": "Get the value of a hash field", "summary": "Returns the value of a field in a hash.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "hash", "group": "hash",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"HGETALL": { "HGETALL": {
"summary": "Get all the fields and values in a hash", "summary": "Returns all fields and values in a hash.",
"complexity": "O(N) where N is the size of the hash.", "complexity": "O(N) where N is the size of the hash.",
"group": "hash", "group": "hash",
"since": "2.0.0", "since": "2.0.0",
......
{ {
"HINCRBY": { "HINCRBY": {
"summary": "Increment the integer value of a hash field by the given number", "summary": "Increments the integer value of a field in a hash by a number. Uses 0 as initial value if the field doesn't exist.",
"complexity": "O(1)", "complexity": "O(1)",
"group": "hash", "group": "hash",
"since": "2.0.0", "since": "2.0.0",
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment