var searchIndex = {};
searchIndex["redis"] = {"doc":"redis-rs is a rust implementation of a Redis client library.  It exposes\na general purpose interface to Redis and also provides specific helpers for\ncommonly used functionality.","items":[[3,"Parser","redis","The internal redis response parser.",null,null],[3,"Client","","The client type.",null,null],[3,"Script","","Represents a lua script.",null,null],[3,"ScriptInvocation","","Represents a prepared script call.",null,null],[3,"Connection","","Represents a stateful redis TCP connection.",null,null],[3,"ConnectionInfo","","Holds the connection information that redis should use for connecting.",null,null],[12,"addr","","A boxed connection address for where to connect to.",0,null],[12,"db","","The database number to use.  This is usually `0`.",0,null],[12,"passwd","","Optionally a password that should be used for connection.",0,null],[3,"PubSub","","Represents a pubsub connection.",null,null],[3,"Msg","","Represents a pubsub message.",null,null],[3,"Cmd","","Represents redis commands.",null,null],[3,"Pipeline","","Represents a redis command pipeline.",null,null],[3,"Iter","","Represents a redis iterator.",null,null],[4,"ConnectionAddr","","Defines the connection address.",null,null],[13,"Tcp","","Format for this is `(host, port)`.",1,null],[5,"parse_redis_value","","Parses bytes into a redis value.",null,null],[5,"transaction","","This function simplifies transaction management slightly.  What it\ndoes is automatically watching keys and then going into a transaction\nloop util it succeeds.  Once it goes through the results are\nreturned.",null,null],[5,"parse_redis_url","","This function takes a redis URL string and parses it into a URL\nas used by rust-url.  This is necessary as the default parser does\nnot understand how redis URLs function.",null,{"inputs":[{"name":"str"}],"output":{"name":"result"}}],[5,"cmd","","Shortcut function to creating a command with a single argument.",null,{"inputs":[{"name":"str"}],"output":{"name":"cmd"}}],[5,"pipe","","Shortcut for creating a new pipeline.",null,{"inputs":[],"output":{"name":"pipeline"}}],[5,"pack_command","","Packs a bunch of commands into a request.  This is generally a quite\nuseless function as this functionality is nicely wrapped through the\n`Cmd` object, but in some cases it can be useful.  The return value\nof this can then be send to the low level `ConnectionLike` methods.",null,null],[11,"new","","Creates a new parser that parses the data behind the reader.  More\nthan one value can be behind the reader in which case the parser can\nbe invoked multiple times.  In other words: the stream does not have\nto be terminated.",2,{"inputs":[{"name":"t"}],"output":{"name":"parser"}}],[11,"parse_value","","parses a single value out of the stream.  If there are multiple\nvalues you can call this multiple times.  If the reader is not yet\nready this will block.",2,null],[11,"clone","","",3,null],[11,"fmt","","",3,null],[11,"open","","Connects to a redis server and returns a client.  This does not\nactually open a connection yet but it does perform some basic\nchecks on the URL that might make the operation fail.",3,{"inputs":[{"name":"t"}],"output":{"name":"redisresult"}}],[11,"get_connection","","Instructs the client to actually connect to redis and returns a\nconnection object.  The connection object can be used to send\ncommands to the server.  This can fail with a variety of errors\n(like unreachable host) so it's important that you handle those\nerrors.",3,null],[11,"get_pubsub","","Returns a PubSub connection.  A pubsub connection can be used to\nlisten to messages coming in through the redis publish/subscribe\nsystem.",3,null],[11,"req_packed_command","","",3,null],[11,"req_packed_commands","","",3,null],[11,"get_db","","",3,null],[11,"fmt","","",1,null],[11,"clone","","",1,null],[11,"fmt","","",0,null],[11,"clone","","",0,null],[11,"into_connection_info","","",0,null],[11,"send_packed_command","","Sends an already encoded (packed) command into the TCP socket and\ndoes not read a response.  This is useful for commands like\n`MONITOR` which yield multiple items.  This needs to be used with\ncare because it changes the state of the connection.",4,null],[11,"recv_response","","Fetches a single response from the connection.  This is useful\nif used in combination with `send_packed_command`.",4,null],[11,"set_write_timeout","","Sets the write timeout for the connection.",4,null],[11,"set_read_timeout","","Sets the read timeout for the connection.",4,null],[11,"req_packed_command","","",4,null],[11,"req_packed_commands","","",4,null],[11,"get_db","","",4,null],[11,"subscribe","","Subscribes to a new channel.",5,null],[11,"psubscribe","","Subscribes to a new channel with a pattern.",5,null],[11,"unsubscribe","","Unsubscribes from a channel.",5,null],[11,"punsubscribe","","Unsubscribes from a channel with a pattern.",5,null],[11,"get_message","","Fetches the next message from the pubsub connection.  Blocks until\na message becomes available.  This currently does not provide a\nwait not to block :(",5,null],[11,"set_read_timeout","","Sets the read timeout for the connection.",5,null],[11,"get_channel","","Returns the channel this message came on.",6,null],[11,"get_channel_name","","Convenience method to get a string version of the channel.  Unless\nyour channel contains non utf-8 bytes you can always use this\nmethod.  If the channel is not a valid string (which really should\nnot happen) then the return value is `"?"`.",6,null],[11,"get_payload","","Returns the message's payload in a specific format.",6,null],[11,"get_payload_bytes","","Returns the bytes that are the message's payload.  This can be used\nas an alternative to the `get_payload` function if you are interested\nin the raw bytes in it.",6,null],[11,"from_pattern","","Returns true if the message was constructed from a pattern\nsubscription.",6,null],[11,"get_pattern","","If the message was constructed from a message pattern this can be\nused to find out which one.  It's recommended to match against\nan `Option<String>` so that you do not need to use `from_pattern`\nto figure out if a pattern was set.",6,null],[11,"new","","Creates a new script object.",7,{"inputs":[{"name":"str"}],"output":{"name":"script"}}],[11,"get_hash","","Returns the script's SHA1 hash in hexadecimal format.",7,null],[11,"key","","Creates a script invocation object with a key filled in.",7,null],[11,"arg","","Creates a script invocation object with an argument filled in.",7,null],[11,"prepare_invoke","","Returns an empty script invocation object.  This is primarily useful\nfor programmatically adding arguments and keys because the type will\nnot change.  Normally you can use `arg` and `key` directly.",7,null],[11,"invoke","","Invokes the script directly without arguments.",7,null],[11,"arg","","Adds a regular argument to the invocation.  This ends up as `ARGV[i]`\nin the script.",8,null],[11,"key","","Adds a key argument to the invocation.  This ends up as `KEYS[i]`\nin the script.",8,null],[11,"invoke","","Invokes the script and returns the result.",8,null],[11,"clone","","",9,null],[11,"next","","",10,null],[11,"new","","Creates a new empty command.",9,{"inputs":[],"output":{"name":"cmd"}}],[11,"arg","","Appends an argument to the command.  The argument passed must\nbe a type that implements `ToRedisArgs`.  Most primitive types as\nwell as vectors of primitive types implement it.",9,null],[11,"cursor_arg","","Works similar to `arg` but adds a cursor argument.  This is always\nan integer and also flips the command implementation to support a\ndifferent mode for the iterators where the iterator will ask for\nanother batch of items when the local data is exhausted.",9,null],[11,"get_packed_command","","Returns the packed command as a byte vector.",9,null],[11,"in_scan_mode","","Returns true if the command is in scan mode.",9,null],[11,"query","","Sends the command as query to the connection and converts the\nresult to the target redis value.  This is the general way how\nyou can retrieve data.",9,null],[11,"iter","","Similar to `query()` but returns an iterator over the items of the\nbulk result or iterator.  In normal mode this is not in any way more\nefficient than just querying into a `Vec<T>` as it's internally\nimplemented as buffering into a vector.  This however is useful when\n`cursor_arg` was used in which case the iterator will query for more\nitems until the server side cursor is exhausted.",9,null],[11,"execute","","This is a shortcut to `query()` that does not return a value and\nwill fail the task if the query fails because of an error.  This is\nmainly useful in examples and for simple commands like setting\nkeys.",9,null],[11,"new","","Creates an empty pipeline.  For consistency with the `cmd`\napi a `pipe` function is provided as alias.",11,{"inputs":[],"output":{"name":"pipeline"}}],[11,"cmd","","Starts a new command.  Functions such as `arg` then become\navailable to add more arguments to that command.",11,null],[11,"add_command","","Adds a command to the pipeline.",11,null],[11,"arg","","Adds an argument to the last started command.  This works similar\nto the `arg` method of the `Cmd` object.",11,null],[11,"ignore","","Instructs the pipeline to ignore the return value of this command.\nIt will still be ensured that it is not an error, but any successful\nresult is just thrown away.  This makes result processing through\ntuples much easier because you do not need to handle all the items\nyou do not care about.",11,null],[11,"atomic","","This enables atomic mode.  In atomic mode the whole pipeline is\nenclosed in `MULTI`/`EXEC`.  From the user's point of view nothing\nchanges however.  This is easier than using `MULTI`/`EXEC` yourself\nas the format does not change.",11,null],[11,"query","","Executes the pipeline and fetches the return values.  Since most\npipelines return different types it's recommended to use tuple\nmatching to process the results:",11,null],[11,"execute","","This is a shortcut to `query()` that does not return a value and\nwill fail the task if the query of the pipeline fails.",11,null],[11,"perform","","",11,null],[8,"ConnectionLike","","Implements the "stateless" part of the connection interface that is used by the\ndifferent objects in redis-rs.  Primarily it obviously applies to `Connection`\nobject but also some other objects implement the interface (for instance\nwhole clients or certain redis results).",null,null],[10,"req_packed_command","","Sends an already encoded (packed) command into the TCP socket and\nreads the single response from it.",12,null],[10,"req_packed_commands","","Sends multiple already encoded (packed) command into the TCP socket\nand reads `count` responses from it.  This is used to implement\npipelining.",12,null],[10,"get_db","","Returns the database this connection is bound to.  Note that this\ninformation might be unreliable because it's initially cached and\nalso might be incorrect if the connection like object is not\nactually connected.",12,null],[8,"IntoConnectionInfo","","Converts an object into a connection info struct.  This allows the\nconstructor of the client to accept connection information in a\nrange of different formats.",null,null],[10,"into_connection_info","","",13,null],[8,"Commands","","Implements common redis commands for connection like objects.  This\nallows you to send commands straight to a connection or client.  It\nis also implemented for redis results of clients which makes for\nvery convenient access in some basic cases.",null,null],[11,"get","","Get the value of a key.  If key is a vec this becomes an `MGET`.",14,null],[11,"keys","","Gets all keys matching pattern",14,null],[11,"set","","Set the string value of a key.",14,null],[11,"set_multiple","","Sets multiple keys to their values.",14,null],[11,"set_ex","","Set the value and expiration of a key.",14,null],[11,"set_nx","","Set the value of a key, only if the key does not exist",14,null],[11,"mset_nx","","Sets multiple keys to their values failing if at least one already exists.",14,null],[11,"getset","","Set the string value of a key and return its old value.",14,null],[11,"del","","Delete one or more keys.",14,null],[11,"exists","","Determine if a key exists.",14,null],[11,"expire","","Set a key's time to live in seconds.",14,null],[11,"expire_at","","Set the expiration for a key as a UNIX timestamp.",14,null],[11,"pexpire","","Set a key's time to live in milliseconds.",14,null],[11,"pexpire_at","","Set the expiration for a key as a UNIX timestamp in milliseconds.",14,null],[11,"persist","","Remove the expiration from a key.",14,null],[11,"rename","","Rename a key.",14,null],[11,"rename_nx","","Rename a key, only if the new key does not exist.",14,null],[11,"append","","Append a value to a key.",14,null],[11,"incr","","Increment the numeric value of a key by the given amount.  This\nissues a `INCRBY` or `INCRBYFLOAT` depending on the type.",14,null],[11,"setbit","","Sets or clears the bit at offset in the string value stored at key.",14,null],[11,"getbit","","Returns the bit value at offset in the string value stored at key.",14,null],[11,"bitcount","","Count set bits in a string.",14,null],[11,"bitcount_range","","Count set bits in a string in a range.",14,null],[11,"bit_and","","Perform a bitwise AND between multiple keys (containing string values)\nand store the result in the destination key.",14,null],[11,"bit_or","","Perform a bitwise OR between multiple keys (containing string values)\nand store the result in the destination key.",14,null],[11,"bit_xor","","Perform a bitwise XOR between multiple keys (containing string values)\nand store the result in the destination key.",14,null],[11,"bit_not","","Perform a bitwise NOT of the key (containing string values)\nand store the result in the destination key.",14,null],[11,"strlen","","Get the length of the value stored in a key.",14,null],[11,"hget","","Gets a single (or multiple) fields from a hash.",14,null],[11,"hdel","","Deletes a single (or multiple) fields from a hash.",14,null],[11,"hset","","Sets a single field in a hash.",14,null],[11,"hset_nx","","Sets a single field in a hash if it does not exist.",14,null],[11,"hset_multiple","","Sets a multiple fields in a hash.",14,null],[11,"hincr","","Increments a value.",14,null],[11,"hexists","","Checks if a field in a hash exists.",14,null],[11,"hkeys","","Gets all the keys in a hash.",14,null],[11,"hvals","","Gets all the values in a hash.",14,null],[11,"hgetall","","Gets all the fields and values in a hash.",14,null],[11,"hlen","","Gets the length of a hash.",14,null],[11,"blpop","","Remove and get the first element in a list, or block until one is available.",14,null],[11,"brpop","","Remove and get the last element in a list, or block until one is available.",14,null],[11,"brpoplpush","","Pop a value from a list, push it to another list and return it;\nor block until one is available.",14,null],[11,"lindex","","Get an element from a list by its index.",14,null],[11,"linsert_before","","Insert an element before another element in a list.",14,null],[11,"linsert_after","","Insert an element after another element in a list.",14,null],[11,"llen","","Returns the length of the list stored at key.",14,null],[11,"lpop","","Removes and returns the first element of the list stored at key.",14,null],[11,"lpush","","Insert all the specified values at the head of the list stored at key.",14,null],[11,"lpush_exists","","Inserts a value at the head of the list stored at key, only if key\nalready exists and holds a list.",14,null],[11,"lrange","","Returns the specified elements of the list stored at key.",14,null],[11,"lrem","","Removes the first count occurrences of elements equal to value\nfrom the list stored at key.",14,null],[11,"ltrim","","Trim an existing list so that it will contain only the specified\nrange of elements specified.",14,null],[11,"rpop","","Removes and returns the last element of the list stored at key.",14,null],[11,"rpoplpush","","Pop a value from a list, push it to another list and return it.",14,null],[11,"rpush","","Insert all the specified values at the tail of the list stored at key.",14,null],[11,"rpush_exists","","Inserts value at the tail of the list stored at key, only if key\nalready exists and holds a list.",14,null],[11,"sadd","","Add one or more members to a set.",14,null],[11,"scard","","Get the number of members in a set.",14,null],[11,"sdiff","","Subtract multiple sets.",14,null],[11,"sdiffstore","","Subtract multiple sets and store the resulting set in a key.",14,null],[11,"sinter","","Intersect multiple sets.",14,null],[11,"sdinterstore","","Intersect multiple sets and store the resulting set in a key.",14,null],[11,"sismember","","Determine if a given value is a member of a set.",14,null],[11,"smembers","","Get all the members in a set.",14,null],[11,"smove","","Move a member from one set to another.",14,null],[11,"spop","","Remove and return a random member from a set.",14,null],[11,"srandmember","","Get one random member from a set.",14,null],[11,"srandmember_multiple","","Get multiple random members from a set.",14,null],[11,"srem","","Remove one or more members from a set.",14,null],[11,"sunion","","Add multiple sets.",14,null],[11,"sunionstore","","Add multiple sets and store the resulting set in a key.",14,null],[11,"zadd","","Add one member to a sorted set, or update its score if it already exists.",14,null],[11,"zadd_multiple","","Add multiple members to a sorted set, or update its score if it already exists.",14,null],[11,"zcard","","Get the number of members in a sorted set.",14,null],[11,"zcount","","Count the members in a sorted set with scores within the given values.",14,null],[11,"zincr","","Increments the member in a sorted set at key by delta.\nIf the member does not exist, it is added with delta as its score.",14,null],[11,"zinterstore","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",14,null],[11,"zinterstore_min","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",14,null],[11,"zinterstore_max","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",14,null],[11,"zlexcount","","Count the number of members in a sorted set between a given lexicographical range.",14,null],[11,"zrange","","Return a range of members in a sorted set, by index",14,null],[11,"zrange_withscores","","Return a range of members in a sorted set, by index with scores.",14,null],[11,"zrangebylex","","Return a range of members in a sorted set, by lexicographical range.",14,null],[11,"zrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",14,null],[11,"zrevrangebylex","","Return a range of members in a sorted set, by lexicographical range.",14,null],[11,"zrevrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",14,null],[11,"zrangebyscore","","Return a range of members in a sorted set, by score.",14,null],[11,"zrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",14,null],[11,"zrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",14,null],[11,"zrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",14,null],[11,"zrank","","Determine the index of a member in a sorted set.",14,null],[11,"zrem","","Remove one or more members from a sorted set.",14,null],[11,"zrembylex","","Remove all members in a sorted set between the given lexicographical range.",14,null],[11,"zrembyrank","","Remove all members in a sorted set within the given indexes.",14,null],[11,"zrembyscore","","Remove all members in a sorted set within the given scores.",14,null],[11,"zrevrange","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",14,null],[11,"zrevrange_withscores","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",14,null],[11,"zrevrangebyscore","","Return a range of members in a sorted set, by score.",14,null],[11,"zrevrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",14,null],[11,"zrevrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",14,null],[11,"zrevrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",14,null],[11,"zrevrank","","Determine the index of a member in a sorted set, with scores ordered from high to low.",14,null],[11,"zscore","","Get the score associated with the given member in a sorted set.",14,null],[11,"zunionstore","","Unions multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",14,null],[11,"zunionstore_min","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",14,null],[11,"zunionstore_max","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",14,null],[11,"pfadd","","Adds the specified elements to the specified HyperLogLog.",14,null],[11,"pfcount","","Return the approximated cardinality of the set(s) observed by the\nHyperLogLog at key(s).",14,null],[11,"pfmerge","","Merge N different HyperLogLogs into a single one.",14,null],[11,"scan","","Incrementally iterate the keys space.",14,null],[11,"scan_match","","Incrementally iterate the keys space for keys matching a pattern.",14,null],[11,"hscan","","Incrementally iterate hash fields and associated values.",14,null],[11,"hscan_match","","Incrementally iterate hash fields and associated values for\nfield names matching a pattern.",14,null],[11,"sscan","","Incrementally iterate set elements.",14,null],[11,"sscan_match","","Incrementally iterate set elements for elements matching a pattern.",14,null],[11,"zscan","","Incrementally iterate sorted set elements.",14,null],[11,"zscan_match","","Incrementally iterate sorted set elements for elements matching a pattern.",14,null],[8,"PipelineCommands","","Implements common redis commands for pipelines.  Unlike the regular\ncommands trait, this returns the pipeline rather than a result\ndirectly.  Other than that it works the same however.",null,null],[11,"get","","Get the value of a key.  If key is a vec this becomes an `MGET`.",15,null],[11,"keys","","Gets all keys matching pattern",15,null],[11,"set","","Set the string value of a key.",15,null],[11,"set_multiple","","Sets multiple keys to their values.",15,null],[11,"set_ex","","Set the value and expiration of a key.",15,null],[11,"set_nx","","Set the value of a key, only if the key does not exist",15,null],[11,"mset_nx","","Sets multiple keys to their values failing if at least one already exists.",15,null],[11,"getset","","Set the string value of a key and return its old value.",15,null],[11,"del","","Delete one or more keys.",15,null],[11,"exists","","Determine if a key exists.",15,null],[11,"expire","","Set a key's time to live in seconds.",15,null],[11,"expire_at","","Set the expiration for a key as a UNIX timestamp.",15,null],[11,"pexpire","","Set a key's time to live in milliseconds.",15,null],[11,"pexpire_at","","Set the expiration for a key as a UNIX timestamp in milliseconds.",15,null],[11,"persist","","Remove the expiration from a key.",15,null],[11,"rename","","Rename a key.",15,null],[11,"rename_nx","","Rename a key, only if the new key does not exist.",15,null],[11,"append","","Append a value to a key.",15,null],[11,"incr","","Increment the numeric value of a key by the given amount.  This\nissues a `INCRBY` or `INCRBYFLOAT` depending on the type.",15,null],[11,"setbit","","Sets or clears the bit at offset in the string value stored at key.",15,null],[11,"getbit","","Returns the bit value at offset in the string value stored at key.",15,null],[11,"bitcount","","Count set bits in a string.",15,null],[11,"bitcount_range","","Count set bits in a string in a range.",15,null],[11,"bit_and","","Perform a bitwise AND between multiple keys (containing string values)\nand store the result in the destination key.",15,null],[11,"bit_or","","Perform a bitwise OR between multiple keys (containing string values)\nand store the result in the destination key.",15,null],[11,"bit_xor","","Perform a bitwise XOR between multiple keys (containing string values)\nand store the result in the destination key.",15,null],[11,"bit_not","","Perform a bitwise NOT of the key (containing string values)\nand store the result in the destination key.",15,null],[11,"strlen","","Get the length of the value stored in a key.",15,null],[11,"hget","","Gets a single (or multiple) fields from a hash.",15,null],[11,"hdel","","Deletes a single (or multiple) fields from a hash.",15,null],[11,"hset","","Sets a single field in a hash.",15,null],[11,"hset_nx","","Sets a single field in a hash if it does not exist.",15,null],[11,"hset_multiple","","Sets a multiple fields in a hash.",15,null],[11,"hincr","","Increments a value.",15,null],[11,"hexists","","Checks if a field in a hash exists.",15,null],[11,"hkeys","","Gets all the keys in a hash.",15,null],[11,"hvals","","Gets all the values in a hash.",15,null],[11,"hgetall","","Gets all the fields and values in a hash.",15,null],[11,"hlen","","Gets the length of a hash.",15,null],[11,"blpop","","Remove and get the first element in a list, or block until one is available.",15,null],[11,"brpop","","Remove and get the last element in a list, or block until one is available.",15,null],[11,"brpoplpush","","Pop a value from a list, push it to another list and return it;\nor block until one is available.",15,null],[11,"lindex","","Get an element from a list by its index.",15,null],[11,"linsert_before","","Insert an element before another element in a list.",15,null],[11,"linsert_after","","Insert an element after another element in a list.",15,null],[11,"llen","","Returns the length of the list stored at key.",15,null],[11,"lpop","","Removes and returns the first element of the list stored at key.",15,null],[11,"lpush","","Insert all the specified values at the head of the list stored at key.",15,null],[11,"lpush_exists","","Inserts a value at the head of the list stored at key, only if key\nalready exists and holds a list.",15,null],[11,"lrange","","Returns the specified elements of the list stored at key.",15,null],[11,"lrem","","Removes the first count occurrences of elements equal to value\nfrom the list stored at key.",15,null],[11,"ltrim","","Trim an existing list so that it will contain only the specified\nrange of elements specified.",15,null],[11,"rpop","","Removes and returns the last element of the list stored at key.",15,null],[11,"rpoplpush","","Pop a value from a list, push it to another list and return it.",15,null],[11,"rpush","","Insert all the specified values at the tail of the list stored at key.",15,null],[11,"rpush_exists","","Inserts value at the tail of the list stored at key, only if key\nalready exists and holds a list.",15,null],[11,"sadd","","Add one or more members to a set.",15,null],[11,"scard","","Get the number of members in a set.",15,null],[11,"sdiff","","Subtract multiple sets.",15,null],[11,"sdiffstore","","Subtract multiple sets and store the resulting set in a key.",15,null],[11,"sinter","","Intersect multiple sets.",15,null],[11,"sdinterstore","","Intersect multiple sets and store the resulting set in a key.",15,null],[11,"sismember","","Determine if a given value is a member of a set.",15,null],[11,"smembers","","Get all the members in a set.",15,null],[11,"smove","","Move a member from one set to another.",15,null],[11,"spop","","Remove and return a random member from a set.",15,null],[11,"srandmember","","Get one random member from a set.",15,null],[11,"srandmember_multiple","","Get multiple random members from a set.",15,null],[11,"srem","","Remove one or more members from a set.",15,null],[11,"sunion","","Add multiple sets.",15,null],[11,"sunionstore","","Add multiple sets and store the resulting set in a key.",15,null],[11,"zadd","","Add one member to a sorted set, or update its score if it already exists.",15,null],[11,"zadd_multiple","","Add multiple members to a sorted set, or update its score if it already exists.",15,null],[11,"zcard","","Get the number of members in a sorted set.",15,null],[11,"zcount","","Count the members in a sorted set with scores within the given values.",15,null],[11,"zincr","","Increments the member in a sorted set at key by delta.\nIf the member does not exist, it is added with delta as its score.",15,null],[11,"zinterstore","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",15,null],[11,"zinterstore_min","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",15,null],[11,"zinterstore_max","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",15,null],[11,"zlexcount","","Count the number of members in a sorted set between a given lexicographical range.",15,null],[11,"zrange","","Return a range of members in a sorted set, by index",15,null],[11,"zrange_withscores","","Return a range of members in a sorted set, by index with scores.",15,null],[11,"zrangebylex","","Return a range of members in a sorted set, by lexicographical range.",15,null],[11,"zrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",15,null],[11,"zrevrangebylex","","Return a range of members in a sorted set, by lexicographical range.",15,null],[11,"zrevrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",15,null],[11,"zrangebyscore","","Return a range of members in a sorted set, by score.",15,null],[11,"zrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",15,null],[11,"zrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",15,null],[11,"zrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",15,null],[11,"zrank","","Determine the index of a member in a sorted set.",15,null],[11,"zrem","","Remove one or more members from a sorted set.",15,null],[11,"zrembylex","","Remove all members in a sorted set between the given lexicographical range.",15,null],[11,"zrembyrank","","Remove all members in a sorted set within the given indexes.",15,null],[11,"zrembyscore","","Remove all members in a sorted set within the given scores.",15,null],[11,"zrevrange","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",15,null],[11,"zrevrange_withscores","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",15,null],[11,"zrevrangebyscore","","Return a range of members in a sorted set, by score.",15,null],[11,"zrevrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",15,null],[11,"zrevrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",15,null],[11,"zrevrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",15,null],[11,"zrevrank","","Determine the index of a member in a sorted set, with scores ordered from high to low.",15,null],[11,"zscore","","Get the score associated with the given member in a sorted set.",15,null],[11,"zunionstore","","Unions multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",15,null],[11,"zunionstore_min","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",15,null],[11,"zunionstore_max","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",15,null],[11,"pfadd","","Adds the specified elements to the specified HyperLogLog.",15,null],[11,"pfcount","","Return the approximated cardinality of the set(s) observed by the\nHyperLogLog at key(s).",15,null],[11,"pfmerge","","Merge N different HyperLogLogs into a single one.",15,null],[11,"get","","Get the value of a key.  If key is a vec this becomes an `MGET`.",14,null],[11,"keys","","Gets all keys matching pattern",14,null],[11,"set","","Set the string value of a key.",14,null],[11,"set_multiple","","Sets multiple keys to their values.",14,null],[11,"set_ex","","Set the value and expiration of a key.",14,null],[11,"set_nx","","Set the value of a key, only if the key does not exist",14,null],[11,"mset_nx","","Sets multiple keys to their values failing if at least one already exists.",14,null],[11,"getset","","Set the string value of a key and return its old value.",14,null],[11,"del","","Delete one or more keys.",14,null],[11,"exists","","Determine if a key exists.",14,null],[11,"expire","","Set a key's time to live in seconds.",14,null],[11,"expire_at","","Set the expiration for a key as a UNIX timestamp.",14,null],[11,"pexpire","","Set a key's time to live in milliseconds.",14,null],[11,"pexpire_at","","Set the expiration for a key as a UNIX timestamp in milliseconds.",14,null],[11,"persist","","Remove the expiration from a key.",14,null],[11,"rename","","Rename a key.",14,null],[11,"rename_nx","","Rename a key, only if the new key does not exist.",14,null],[11,"append","","Append a value to a key.",14,null],[11,"incr","","Increment the numeric value of a key by the given amount.  This\nissues a `INCRBY` or `INCRBYFLOAT` depending on the type.",14,null],[11,"setbit","","Sets or clears the bit at offset in the string value stored at key.",14,null],[11,"getbit","","Returns the bit value at offset in the string value stored at key.",14,null],[11,"bitcount","","Count set bits in a string.",14,null],[11,"bitcount_range","","Count set bits in a string in a range.",14,null],[11,"bit_and","","Perform a bitwise AND between multiple keys (containing string values)\nand store the result in the destination key.",14,null],[11,"bit_or","","Perform a bitwise OR between multiple keys (containing string values)\nand store the result in the destination key.",14,null],[11,"bit_xor","","Perform a bitwise XOR between multiple keys (containing string values)\nand store the result in the destination key.",14,null],[11,"bit_not","","Perform a bitwise NOT of the key (containing string values)\nand store the result in the destination key.",14,null],[11,"strlen","","Get the length of the value stored in a key.",14,null],[11,"hget","","Gets a single (or multiple) fields from a hash.",14,null],[11,"hdel","","Deletes a single (or multiple) fields from a hash.",14,null],[11,"hset","","Sets a single field in a hash.",14,null],[11,"hset_nx","","Sets a single field in a hash if it does not exist.",14,null],[11,"hset_multiple","","Sets a multiple fields in a hash.",14,null],[11,"hincr","","Increments a value.",14,null],[11,"hexists","","Checks if a field in a hash exists.",14,null],[11,"hkeys","","Gets all the keys in a hash.",14,null],[11,"hvals","","Gets all the values in a hash.",14,null],[11,"hgetall","","Gets all the fields and values in a hash.",14,null],[11,"hlen","","Gets the length of a hash.",14,null],[11,"blpop","","Remove and get the first element in a list, or block until one is available.",14,null],[11,"brpop","","Remove and get the last element in a list, or block until one is available.",14,null],[11,"brpoplpush","","Pop a value from a list, push it to another list and return it;\nor block until one is available.",14,null],[11,"lindex","","Get an element from a list by its index.",14,null],[11,"linsert_before","","Insert an element before another element in a list.",14,null],[11,"linsert_after","","Insert an element after another element in a list.",14,null],[11,"llen","","Returns the length of the list stored at key.",14,null],[11,"lpop","","Removes and returns the first element of the list stored at key.",14,null],[11,"lpush","","Insert all the specified values at the head of the list stored at key.",14,null],[11,"lpush_exists","","Inserts a value at the head of the list stored at key, only if key\nalready exists and holds a list.",14,null],[11,"lrange","","Returns the specified elements of the list stored at key.",14,null],[11,"lrem","","Removes the first count occurrences of elements equal to value\nfrom the list stored at key.",14,null],[11,"ltrim","","Trim an existing list so that it will contain only the specified\nrange of elements specified.",14,null],[11,"rpop","","Removes and returns the last element of the list stored at key.",14,null],[11,"rpoplpush","","Pop a value from a list, push it to another list and return it.",14,null],[11,"rpush","","Insert all the specified values at the tail of the list stored at key.",14,null],[11,"rpush_exists","","Inserts value at the tail of the list stored at key, only if key\nalready exists and holds a list.",14,null],[11,"sadd","","Add one or more members to a set.",14,null],[11,"scard","","Get the number of members in a set.",14,null],[11,"sdiff","","Subtract multiple sets.",14,null],[11,"sdiffstore","","Subtract multiple sets and store the resulting set in a key.",14,null],[11,"sinter","","Intersect multiple sets.",14,null],[11,"sdinterstore","","Intersect multiple sets and store the resulting set in a key.",14,null],[11,"sismember","","Determine if a given value is a member of a set.",14,null],[11,"smembers","","Get all the members in a set.",14,null],[11,"smove","","Move a member from one set to another.",14,null],[11,"spop","","Remove and return a random member from a set.",14,null],[11,"srandmember","","Get one random member from a set.",14,null],[11,"srandmember_multiple","","Get multiple random members from a set.",14,null],[11,"srem","","Remove one or more members from a set.",14,null],[11,"sunion","","Add multiple sets.",14,null],[11,"sunionstore","","Add multiple sets and store the resulting set in a key.",14,null],[11,"zadd","","Add one member to a sorted set, or update its score if it already exists.",14,null],[11,"zadd_multiple","","Add multiple members to a sorted set, or update its score if it already exists.",14,null],[11,"zcard","","Get the number of members in a sorted set.",14,null],[11,"zcount","","Count the members in a sorted set with scores within the given values.",14,null],[11,"zincr","","Increments the member in a sorted set at key by delta.\nIf the member does not exist, it is added with delta as its score.",14,null],[11,"zinterstore","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",14,null],[11,"zinterstore_min","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",14,null],[11,"zinterstore_max","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",14,null],[11,"zlexcount","","Count the number of members in a sorted set between a given lexicographical range.",14,null],[11,"zrange","","Return a range of members in a sorted set, by index",14,null],[11,"zrange_withscores","","Return a range of members in a sorted set, by index with scores.",14,null],[11,"zrangebylex","","Return a range of members in a sorted set, by lexicographical range.",14,null],[11,"zrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",14,null],[11,"zrevrangebylex","","Return a range of members in a sorted set, by lexicographical range.",14,null],[11,"zrevrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",14,null],[11,"zrangebyscore","","Return a range of members in a sorted set, by score.",14,null],[11,"zrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",14,null],[11,"zrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",14,null],[11,"zrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",14,null],[11,"zrank","","Determine the index of a member in a sorted set.",14,null],[11,"zrem","","Remove one or more members from a sorted set.",14,null],[11,"zrembylex","","Remove all members in a sorted set between the given lexicographical range.",14,null],[11,"zrembyrank","","Remove all members in a sorted set within the given indexes.",14,null],[11,"zrembyscore","","Remove all members in a sorted set within the given scores.",14,null],[11,"zrevrange","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",14,null],[11,"zrevrange_withscores","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",14,null],[11,"zrevrangebyscore","","Return a range of members in a sorted set, by score.",14,null],[11,"zrevrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",14,null],[11,"zrevrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",14,null],[11,"zrevrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",14,null],[11,"zrevrank","","Determine the index of a member in a sorted set, with scores ordered from high to low.",14,null],[11,"zscore","","Get the score associated with the given member in a sorted set.",14,null],[11,"zunionstore","","Unions multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",14,null],[11,"zunionstore_min","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",14,null],[11,"zunionstore_max","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",14,null],[11,"pfadd","","Adds the specified elements to the specified HyperLogLog.",14,null],[11,"pfcount","","Return the approximated cardinality of the set(s) observed by the\nHyperLogLog at key(s).",14,null],[11,"pfmerge","","Merge N different HyperLogLogs into a single one.",14,null],[11,"scan","","Incrementally iterate the keys space.",14,null],[11,"scan_match","","Incrementally iterate the keys space for keys matching a pattern.",14,null],[11,"hscan","","Incrementally iterate hash fields and associated values.",14,null],[11,"hscan_match","","Incrementally iterate hash fields and associated values for\nfield names matching a pattern.",14,null],[11,"sscan","","Incrementally iterate set elements.",14,null],[11,"sscan_match","","Incrementally iterate set elements for elements matching a pattern.",14,null],[11,"zscan","","Incrementally iterate sorted set elements.",14,null],[11,"zscan_match","","Incrementally iterate sorted set elements for elements matching a pattern.",14,null],[11,"get","","Get the value of a key.  If key is a vec this becomes an `MGET`.",15,null],[11,"keys","","Gets all keys matching pattern",15,null],[11,"set","","Set the string value of a key.",15,null],[11,"set_multiple","","Sets multiple keys to their values.",15,null],[11,"set_ex","","Set the value and expiration of a key.",15,null],[11,"set_nx","","Set the value of a key, only if the key does not exist",15,null],[11,"mset_nx","","Sets multiple keys to their values failing if at least one already exists.",15,null],[11,"getset","","Set the string value of a key and return its old value.",15,null],[11,"del","","Delete one or more keys.",15,null],[11,"exists","","Determine if a key exists.",15,null],[11,"expire","","Set a key's time to live in seconds.",15,null],[11,"expire_at","","Set the expiration for a key as a UNIX timestamp.",15,null],[11,"pexpire","","Set a key's time to live in milliseconds.",15,null],[11,"pexpire_at","","Set the expiration for a key as a UNIX timestamp in milliseconds.",15,null],[11,"persist","","Remove the expiration from a key.",15,null],[11,"rename","","Rename a key.",15,null],[11,"rename_nx","","Rename a key, only if the new key does not exist.",15,null],[11,"append","","Append a value to a key.",15,null],[11,"incr","","Increment the numeric value of a key by the given amount.  This\nissues a `INCRBY` or `INCRBYFLOAT` depending on the type.",15,null],[11,"setbit","","Sets or clears the bit at offset in the string value stored at key.",15,null],[11,"getbit","","Returns the bit value at offset in the string value stored at key.",15,null],[11,"bitcount","","Count set bits in a string.",15,null],[11,"bitcount_range","","Count set bits in a string in a range.",15,null],[11,"bit_and","","Perform a bitwise AND between multiple keys (containing string values)\nand store the result in the destination key.",15,null],[11,"bit_or","","Perform a bitwise OR between multiple keys (containing string values)\nand store the result in the destination key.",15,null],[11,"bit_xor","","Perform a bitwise XOR between multiple keys (containing string values)\nand store the result in the destination key.",15,null],[11,"bit_not","","Perform a bitwise NOT of the key (containing string values)\nand store the result in the destination key.",15,null],[11,"strlen","","Get the length of the value stored in a key.",15,null],[11,"hget","","Gets a single (or multiple) fields from a hash.",15,null],[11,"hdel","","Deletes a single (or multiple) fields from a hash.",15,null],[11,"hset","","Sets a single field in a hash.",15,null],[11,"hset_nx","","Sets a single field in a hash if it does not exist.",15,null],[11,"hset_multiple","","Sets a multiple fields in a hash.",15,null],[11,"hincr","","Increments a value.",15,null],[11,"hexists","","Checks if a field in a hash exists.",15,null],[11,"hkeys","","Gets all the keys in a hash.",15,null],[11,"hvals","","Gets all the values in a hash.",15,null],[11,"hgetall","","Gets all the fields and values in a hash.",15,null],[11,"hlen","","Gets the length of a hash.",15,null],[11,"blpop","","Remove and get the first element in a list, or block until one is available.",15,null],[11,"brpop","","Remove and get the last element in a list, or block until one is available.",15,null],[11,"brpoplpush","","Pop a value from a list, push it to another list and return it;\nor block until one is available.",15,null],[11,"lindex","","Get an element from a list by its index.",15,null],[11,"linsert_before","","Insert an element before another element in a list.",15,null],[11,"linsert_after","","Insert an element after another element in a list.",15,null],[11,"llen","","Returns the length of the list stored at key.",15,null],[11,"lpop","","Removes and returns the first element of the list stored at key.",15,null],[11,"lpush","","Insert all the specified values at the head of the list stored at key.",15,null],[11,"lpush_exists","","Inserts a value at the head of the list stored at key, only if key\nalready exists and holds a list.",15,null],[11,"lrange","","Returns the specified elements of the list stored at key.",15,null],[11,"lrem","","Removes the first count occurrences of elements equal to value\nfrom the list stored at key.",15,null],[11,"ltrim","","Trim an existing list so that it will contain only the specified\nrange of elements specified.",15,null],[11,"rpop","","Removes and returns the last element of the list stored at key.",15,null],[11,"rpoplpush","","Pop a value from a list, push it to another list and return it.",15,null],[11,"rpush","","Insert all the specified values at the tail of the list stored at key.",15,null],[11,"rpush_exists","","Inserts value at the tail of the list stored at key, only if key\nalready exists and holds a list.",15,null],[11,"sadd","","Add one or more members to a set.",15,null],[11,"scard","","Get the number of members in a set.",15,null],[11,"sdiff","","Subtract multiple sets.",15,null],[11,"sdiffstore","","Subtract multiple sets and store the resulting set in a key.",15,null],[11,"sinter","","Intersect multiple sets.",15,null],[11,"sdinterstore","","Intersect multiple sets and store the resulting set in a key.",15,null],[11,"sismember","","Determine if a given value is a member of a set.",15,null],[11,"smembers","","Get all the members in a set.",15,null],[11,"smove","","Move a member from one set to another.",15,null],[11,"spop","","Remove and return a random member from a set.",15,null],[11,"srandmember","","Get one random member from a set.",15,null],[11,"srandmember_multiple","","Get multiple random members from a set.",15,null],[11,"srem","","Remove one or more members from a set.",15,null],[11,"sunion","","Add multiple sets.",15,null],[11,"sunionstore","","Add multiple sets and store the resulting set in a key.",15,null],[11,"zadd","","Add one member to a sorted set, or update its score if it already exists.",15,null],[11,"zadd_multiple","","Add multiple members to a sorted set, or update its score if it already exists.",15,null],[11,"zcard","","Get the number of members in a sorted set.",15,null],[11,"zcount","","Count the members in a sorted set with scores within the given values.",15,null],[11,"zincr","","Increments the member in a sorted set at key by delta.\nIf the member does not exist, it is added with delta as its score.",15,null],[11,"zinterstore","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",15,null],[11,"zinterstore_min","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",15,null],[11,"zinterstore_max","","Intersect multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",15,null],[11,"zlexcount","","Count the number of members in a sorted set between a given lexicographical range.",15,null],[11,"zrange","","Return a range of members in a sorted set, by index",15,null],[11,"zrange_withscores","","Return a range of members in a sorted set, by index with scores.",15,null],[11,"zrangebylex","","Return a range of members in a sorted set, by lexicographical range.",15,null],[11,"zrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",15,null],[11,"zrevrangebylex","","Return a range of members in a sorted set, by lexicographical range.",15,null],[11,"zrevrangebylex_limit","","Return a range of members in a sorted set, by lexicographical\nrange with offset and limit.",15,null],[11,"zrangebyscore","","Return a range of members in a sorted set, by score.",15,null],[11,"zrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",15,null],[11,"zrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",15,null],[11,"zrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",15,null],[11,"zrank","","Determine the index of a member in a sorted set.",15,null],[11,"zrem","","Remove one or more members from a sorted set.",15,null],[11,"zrembylex","","Remove all members in a sorted set between the given lexicographical range.",15,null],[11,"zrembyrank","","Remove all members in a sorted set within the given indexes.",15,null],[11,"zrembyscore","","Remove all members in a sorted set within the given scores.",15,null],[11,"zrevrange","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",15,null],[11,"zrevrange_withscores","","Return a range of members in a sorted set, by index, with scores\nordered from high to low.",15,null],[11,"zrevrangebyscore","","Return a range of members in a sorted set, by score.",15,null],[11,"zrevrangebyscore_withscores","","Return a range of members in a sorted set, by score with scores.",15,null],[11,"zrevrangebyscore_limit","","Return a range of members in a sorted set, by score with limit.",15,null],[11,"zrevrangebyscore_limit_withscores","","Return a range of members in a sorted set, by score with limit with scores.",15,null],[11,"zrevrank","","Determine the index of a member in a sorted set, with scores ordered from high to low.",15,null],[11,"zscore","","Get the score associated with the given member in a sorted set.",15,null],[11,"zunionstore","","Unions multiple sorted sets and store the resulting sorted set in\na new key using SUM as aggregation function.",15,null],[11,"zunionstore_min","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MIN as aggregation function.",15,null],[11,"zunionstore_max","","Unions multiple sorted sets and store the resulting sorted set in\na new key using MAX as aggregation function.",15,null],[11,"pfadd","","Adds the specified elements to the specified HyperLogLog.",15,null],[11,"pfcount","","Return the approximated cardinality of the set(s) observed by the\nHyperLogLog at key(s).",15,null],[11,"pfmerge","","Merge N different HyperLogLogs into a single one.",15,null]],"paths":[[3,"ConnectionInfo"],[4,"ConnectionAddr"],[3,"Parser"],[3,"Client"],[3,"Connection"],[3,"PubSub"],[3,"Msg"],[3,"Script"],[3,"ScriptInvocation"],[3,"Cmd"],[3,"Iter"],[3,"Pipeline"],[8,"ConnectionLike"],[8,"IntoConnectionInfo"],[8,"Commands"],[8,"PipelineCommands"]]};
initSearch(searchIndex);