3 This subdirectory provides implementation for the commands which are implemented
4 as a [Redis modules](https://redis.io/topics/modules-intro).
8 ## SETIE key value oldvalue [expiration EX seconds|PX milliseconds]
10 Time complexity: O(1) + O(1)
12 Checks a String 'key' for 'oldvalue' equality and set key for 'value' with
20 redis> setie mykey "Hello again" "Hello"
23 redis> set mykey "Hello"
27 redis> setie mykey "Hello again" "Hello"
31 redis> setie mykey "Hello 2" "Hello"
35 redis> setie mykey "Hello 2" "Hello again" ex 100
43 ## SETNE key value oldvalue [expiration EX seconds|PX milliseconds]
45 Time complexity: O(1) + O(1)
47 Checks a String 'key' for 'oldvalue' not equality and set key for 'value' with optional expired.
54 redis> setne mykey "Hello again" "Hello"
58 redis> setne mykey "Hello 2" "Hello again"
60 redis> setne mykey "Hello 2" "Hello"
64 redis> setne mykey "Hello 3" "Hello" ex 100
74 Time complexity: O(1) + O(1)
76 Checks a String 'key' for 'oldvalue' equality and delete the key.
82 redis> set mykey "Hello"
86 redis> delie mykey "Hello again"
90 redis> delie mykey "Hello"
98 Time complexity: O(1) + O(1)
100 Checks a String 'key' for 'oldvalue' not equality and delete the key.
106 redis> set mykey "Hello"
110 redis> delne mykey "Hello"
114 redis> delne mykey "Hello again"
120 ## MSETPUB key value [key value...] channel message
122 Time complexity: O(N) where N is the number of keys to set + 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)
124 Set the given keys to their respective values and post a message to the given channel
126 ## MSETMPUB number_of_key_value_pairs number_of_channel_message_pairs key value [ key value ... ] channel message [ channel message ... ]
128 Time complexity: O(N) where N is the number of keys to set + O(N_1+M) [ + O(N_2+M) + ... ] where N_i are the number of clients subscribed to the corresponding receiving channel and M is the total number of subscribed patterns (by any client)
130 Set the given keys to their respective values and post messages to their respective channels
132 ## SETXXPUB key value channel message [channel message...]
134 Time complexity: O(1) + O(1) + O(N_1+M) [ + O(N_2+M) + ... ] where N_i are the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).
136 Set key to hold string value if key already exists and post given messages to the corresponding channels if key value was set successfully
138 ## SETNXPUB key value channel message [channel message...]
140 Time complexity: O(1) + O(1) + O(N_1+M) [ + O(N_2+M) + ... ] where N_i are the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).
142 Set key to hold string value if key does not exist and post given messages to the corresponding channels if key value was set successfully
144 ## SETIEPUB key value oldvalue channel message [channel message...]
146 Time complexity: O(1) + O(1) + O(1) + O(N_1+M) [ + O(N_2+M) + ... ] where N_i are the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).
148 If the string corresponding to 'key' is equal to 'oldvalue' then set key for 'value' and post given messages to the corresponding channels if key value was set successfully
150 ## SETNEPUB key value oldvalue channel message [channel message...]
152 Time complexity: O(1) + O(1) + O(1) + O(N_1+M) [ + O(N_2+M) + ... ] where N_i are the number of clients subscribed to the receiving channel and M is the total number of subscribed patterns (by any client).
154 If the string corresponding to 'key' is not equal to 'oldvalue' then set key for 'value' and post given messages to the corresponding channels if key value was set successfully
156 ## DELPUB key [key...] channel message
158 Time complexity: O(N) where N is the number of keys that will be removed + 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)
160 Removes the specified keys and post a message to the given channel if delete key successfully(return >0)
162 ## DELIEPUB key oldvalue channel message [channel message...]
164 Time complexity: O(1) + O(1) + O(1) + O(N_1+M) [ + O(N_2+M) + ...] where N_i are the number of clients subscribed to the corrensponding receiving channel and M is the total number of subscribed patterns (by any client)
166 If the string corresponding to 'key' is equal to 'oldvalue' then delete the key. If deletion was succesful (delete return value was 1) then post given messages to the corresponding channels.
168 ## DELNEPUB key oldvalue channel message [channel message...]
170 Time complexity: O(1) + O(1) + O(1) + O(N_1+M) [ + O(N_2+M) + ...] where N_i are the number of clients subscribed to the corrensponding receiving channel and M is the total number of subscribed patterns (by any client)
172 If the string corresponding to 'key' is not equal to 'oldvalue' then delete the key. If deletion was succesful (delete return value was 1) then post given messages to the corresponding channels.
176 Time complexity: O(N) with N being the number of keys in the instance + O(N) where N is the number of keys to retrieve
178 Returns all key-value pairs matching pattern.
186 redis> set mykey1 "myvalue1"
188 redis> set mykey2 "myvalue2"
190 redis> set mykey3 "myvalue3"
192 redis> set mykey4 "myvalue4"
207 Time complexity: O(N) with N being the number of keys in the instance + O(N) where N is the number of keys that will be removed
209 Remove all key-value pairs matching pattern.