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

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

parents a08686a5 e55568ed
{
"PUBLISH": {
"summary": "Post a message to a channel",
"summary": "Posts a message to a channel.",
"complexity": "O(N+M) where N is the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).",
"group": "pubsub",
"since": "2.0.0",
......
{
"CHANNELS": {
"summary": "List active channels",
"summary": "Returns the active channels.",
"complexity": "O(N) where N is the number of active channels, and assuming constant time pattern matching (relatively short channels and patterns)",
"group": "pubsub",
"since": "2.8.0",
......
{
"HELP": {
"summary": "Show helpful text about the different subcommands",
"summary": "Returns helpful text about the different subcommands.",
"complexity": "O(1)",
"group": "pubsub",
"since": "6.2.0",
......
{
"NUMPAT": {
"summary": "Get the count of unique patterns pattern subscriptions",
"summary": "Returns a count of unique pattern subscriptions.",
"complexity": "O(1)",
"group": "pubsub",
"since": "2.8.0",
......
{
"NUMSUB": {
"summary": "Get the count of subscribers for channels",
"summary": "Returns a count of subscribers to channels.",
"complexity": "O(N) for the NUMSUB subcommand, where N is the number of requested channels",
"group": "pubsub",
"since": "2.8.0",
......
{
"SHARDCHANNELS": {
"summary": "List active shard channels",
"summary": "Returns the active shard channels.",
"complexity": "O(N) where N is the number of active shard channels, and assuming constant time pattern matching (relatively short shard channels).",
"group": "pubsub",
"since": "7.0.0",
......
{
"SHARDNUMSUB": {
"summary": "Get the count of subscribers for shard channels",
"summary": "Returns the count of subscribers of shard channels.",
"complexity": "O(N) for the SHARDNUMSUB subcommand, where N is the number of requested shard channels",
"group": "pubsub",
"since": "7.0.0",
......
{
"PUBSUB": {
"summary": "A container for Pub/Sub commands",
"summary": "A container for Pub/Sub commands.",
"complexity": "Depends on subcommand.",
"group": "pubsub",
"since": "2.8.0",
......
{
"PUNSUBSCRIBE": {
"summary": "Stop listening for messages posted to channels matching the given patterns",
"summary": "Stops listening to messages published to channels that match one or more patterns.",
"complexity": "O(N+M) where N is the number of patterns the client is already subscribed and M is the number of total patterns subscribed in the system (by any client).",
"group": "pubsub",
"since": "2.0.0",
......
{
"QUIT": {
"summary": "Close the connection",
"summary": "Closes the connection.",
"complexity": "O(1)",
"group": "connection",
"since": "1.0.0",
......
{
"RANDOMKEY": {
"summary": "Return a random key from the keyspace",
"summary": "Returns a random key name from the database.",
"complexity": "O(1)",
"group": "generic",
"since": "1.0.0",
......
{
"READONLY": {
"summary": "Enables read queries for a connection to a cluster replica node",
"summary": "Enables read-only queries for a connection to a Redis Cluster replica node.",
"complexity": "O(1)",
"group": "cluster",
"since": "3.0.0",
......
{
"READWRITE": {
"summary": "Disables read queries for a connection to a cluster replica node",
"summary": "Enables read-write queries for a connection to a Reids Cluster replica node.",
"complexity": "O(1)",
"group": "cluster",
"since": "3.0.0",
......
{
"RENAME": {
"summary": "Rename a key",
"summary": "Renames a key and overwrites the destination.",
"complexity": "O(1)",
"group": "generic",
"since": "1.0.0",
......
{
"RENAMENX": {
"summary": "Rename a key, only if the new key does not exist",
"summary": "Renames a key only when the target key name doesn't exist.",
"complexity": "O(1)",
"group": "generic",
"since": "1.0.0",
......
{
"REPLCONF": {
"summary": "An internal command for configuring the replication stream",
"summary": "An internal command for configuring the replication stream.",
"complexity": "O(1)",
"group": "server",
"since": "3.0.0",
......
{
"REPLICAOF": {
"summary": "Make the server a replica of another instance, or promote it as master.",
"summary": "Configures a server as replica of another, or promotes it to a master.",
"complexity": "O(1)",
"group": "server",
"since": "5.0.0",
......
{
"RESET": {
"summary": "Reset the connection",
"summary": "Resets the connection.",
"complexity": "O(1)",
"group": "connection",
"since": "6.2.0",
......
{
"RESTORE-ASKING": {
"summary": "An internal command for migrating keys in a cluster",
"summary": "An internal command for migrating keys in a cluster.",
"complexity": "O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).",
"group": "server",
"since": "3.0.0",
......
{
"RESTORE": {
"summary": "Create a key using the provided serialized value, previously obtained using DUMP.",
"summary": "Creates a key from the serialized representation of a value.",
"complexity": "O(1) to create the new key and additional O(N*M) to reconstruct the serialized value, where N is the number of Redis objects composing the value and M their average size. For small string values the time complexity is thus O(1)+O(1*M) where M is small, so simply O(1). However for sorted set values the complexity is O(N*M*log(N)) because inserting values into sorted sets is O(log(N)).",
"group": "generic",
"since": "2.6.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