Struct deadpool_redis::Connection[][src]

pub struct Connection { /* fields omitted */ }
Expand description

Wrapper around redis::aio::Connection.

This structure implements redis::aio::ConnectionLike and can therefore be used just like a regular redis::aio::Connection.

Implementations

Takes this Connection from its Pool permanently.

This reduces the size of the Pool.

Trait Implementations

Performs the conversion.

Performs the conversion.

Sends an already encoded (packed) command into the TCP socket and reads the single response from it. Read more

Sends multiple already encoded (packed) command into the TCP socket and reads count responses from it. This is used to implement pipelining. Read more

Returns the database this connection is bound to. Note that this information might be unreliable because it’s initially cached and also might be incorrect if the connection like object is not actually connected. Read more

The resulting type after dereferencing.

Dereferences the value.

Mutably dereferences the value.

Performs the conversion.

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Get the value of a key. If key is a vec this becomes an MGET.

Gets all keys matching pattern

Set the string value of a key.

Sets multiple keys to their values.

Set the value and expiration of a key.

Set the value and expiration in milliseconds of a key.

Set the value of a key, only if the key does not exist

Sets multiple keys to their values failing if at least one already exists.

Set the string value of a key and return its old value.

Get a range of bytes/substring from the value of a key. Negative values provide an offset from the end of the value.

Overwrite the part of the value stored in key at the specified offset.

Delete one or more keys.

Determine if a key exists.

Set a key’s time to live in seconds.

Set the expiration for a key as a UNIX timestamp.

Set a key’s time to live in milliseconds.

Set the expiration for a key as a UNIX timestamp in milliseconds.

Remove the expiration from a key.

Get the expiration time of a key.

Get the expiration time of a key in milliseconds.

Rename a key.

Rename a key, only if the new key does not exist.

Unlink one or more keys.

Append a value to a key.

Increment the numeric value of a key by the given amount. This issues a INCRBY or INCRBYFLOAT depending on the type. Read more

Decrement the numeric value of a key by the given amount.

Sets or clears the bit at offset in the string value stored at key.

Returns the bit value at offset in the string value stored at key.

Count set bits in a string.

Count set bits in a string in a range.

Perform a bitwise AND between multiple keys (containing string values) and store the result in the destination key. Read more

Perform a bitwise OR between multiple keys (containing string values) and store the result in the destination key. Read more

Perform a bitwise XOR between multiple keys (containing string values) and store the result in the destination key. Read more

Perform a bitwise NOT of the key (containing string values) and store the result in the destination key. Read more

Get the length of the value stored in a key.

Gets a single (or multiple) fields from a hash.

Deletes a single (or multiple) fields from a hash.

Sets a single field in a hash.

Sets a single field in a hash if it does not exist.

Sets a multiple fields in a hash.

Increments a value.

Checks if a field in a hash exists.

Gets all the keys in a hash.

Gets all the values in a hash.

Gets all the fields and values in a hash.

Gets the length of a hash.

Remove and get the first element in a list, or block until one is available.

Remove and get the last element in a list, or block until one is available.

Pop a value from a list, push it to another list and return it; or block until one is available. Read more

Get an element from a list by its index.

Insert an element before another element in a list.

Insert an element after another element in a list.

Returns the length of the list stored at key.

Removes and returns the up to count first elements of the list stored at key. Read more

Returns the index of the first matching value of the list stored at key.

Insert all the specified values at the head of the list stored at key.

Inserts a value at the head of the list stored at key, only if key already exists and holds a list. Read more

Returns the specified elements of the list stored at key.

Removes the first count occurrences of elements equal to value from the list stored at key. Read more

Trim an existing list so that it will contain only the specified range of elements specified. Read more

Sets the list element at index to value

Removes and returns the up to count last elements of the list stored at key Read more

Pop a value from a list, push it to another list and return it.

Insert all the specified values at the tail of the list stored at key.

Inserts value at the tail of the list stored at key, only if key already exists and holds a list. Read more

Add one or more members to a set.

Get the number of members in a set.

Subtract multiple sets.

Subtract multiple sets and store the resulting set in a key.

Intersect multiple sets.

Intersect multiple sets and store the resulting set in a key.

Determine if a given value is a member of a set.

Get all the members in a set.

Move a member from one set to another.

Remove and return a random member from a set.

Get one random member from a set.

Get multiple random members from a set.

Remove one or more members from a set.

Add multiple sets.

Add multiple sets and store the resulting set in a key.

Add one member to a sorted set, or update its score if it already exists.

Add multiple members to a sorted set, or update its score if it already exists.

Get the number of members in a sorted set.

Count the members in a sorted set with scores within the given values.

Increments the member in a sorted set at key by delta. If the member does not exist, it is added with delta as its score. Read more

Intersect multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more

Intersect multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more

Intersect multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more

Count the number of members in a sorted set between a given lexicographical range.

Removes and returns up to count members with the highest scores in a sorted set

Removes and returns up to count members with the lowest scores in a sorted set

Return up to count random members in a sorted set (or 1 if count == None)

Return up to count random members in a sorted set with scores

Return a range of members in a sorted set, by index

Return a range of members in a sorted set, by index with scores.

Return a range of members in a sorted set, by lexicographical range.

Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more

Return a range of members in a sorted set, by lexicographical range.

Return a range of members in a sorted set, by lexicographical range with offset and limit. Read more

Return a range of members in a sorted set, by score.

Return a range of members in a sorted set, by score with scores.

Return a range of members in a sorted set, by score with limit.

Return a range of members in a sorted set, by score with limit with scores.

Determine the index of a member in a sorted set.

Remove one or more members from a sorted set.

Remove all members in a sorted set between the given lexicographical range.

Remove all members in a sorted set within the given indexes.

Remove all members in a sorted set within the given scores.

Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more

Return a range of members in a sorted set, by index, with scores ordered from high to low. Read more

Return a range of members in a sorted set, by score.

Return a range of members in a sorted set, by score with scores.

Return a range of members in a sorted set, by score with limit.

Return a range of members in a sorted set, by score with limit with scores.

Determine the index of a member in a sorted set, with scores ordered from high to low.

Get the score associated with the given member in a sorted set.

Get the scores associated with multiple members in a sorted set.

Unions multiple sorted sets and store the resulting sorted set in a new key using SUM as aggregation function. Read more

Unions multiple sorted sets and store the resulting sorted set in a new key using MIN as aggregation function. Read more

Unions multiple sorted sets and store the resulting sorted set in a new key using MAX as aggregation function. Read more

Adds the specified elements to the specified HyperLogLog.

Return the approximated cardinality of the set(s) observed by the HyperLogLog at key(s). Read more

Merge N different HyperLogLogs into a single one.

Posts a message to the given channel.

This is the reverse version of xrange_all. The same rules apply for start and end here. Read more

Incrementally iterate the keys space.

Incrementally iterate set elements for elements matching a pattern.

Incrementally iterate hash fields and associated values.

Incrementally iterate hash fields and associated values for field names matching a pattern. Read more

Incrementally iterate set elements.

Incrementally iterate set elements for elements matching a pattern.

Incrementally iterate sorted set elements.

Incrementally iterate sorted set elements for elements matching a pattern.

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Performs the conversion.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.