@valkey/valkey-glide 1.3.5-rc9 → 2.0.0-rc7

package/build-ts/Batch.js

@@ -4,8 +4,7 @@
  */
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.Transaction = exports.ClusterTransaction = exports.ClusterBatch = exports.Batch = exports.BaseBatch = void 0;
-const BaseClient_1 = require("./BaseClient");
-const Commands_1 = require("./Commands");
+const _1 = require(".");
 /**
  * Base class encompassing shared commands for both standalone and cluster mode implementations in a Batch.
  * Batches allow the execution of a group of commands in a single step.
@@ -20,6 +19,16 @@ const Commands_1 = require("./Commands");
  * If `false`, the batch will be executed as a non-atomic pipeline.
  */
 class BaseBatch {
+    isAtomic;
+    /**
+     * @internal
+     */
+    commands = [];
+    /**
+     * Array of command indexes indicating commands that need to be converted into a `Set` within the batch.
+     * @internal
+     */
+    setCommandsIndexes = [];
     /**
      * @param isAtomic - Determines whether the batch is atomic or non-atomic. If `true`, the
      *     batch will be executed as an atomic `transaction`. If `false`, the batch will be
@@ -27,15 +36,6 @@ class BaseBatch {
      */
     constructor(isAtomic) {
         this.isAtomic = isAtomic;
-        /**
-         * @internal
-         */
-        this.commands = [];
-        /**
-         * Array of command indexes indicating commands that need to be converted into a `Set` within the batch.
-         * @internal
-         */
-        this.setCommandsIndexes = [];
     }
     /**
      * Adds a command to the batch and returns the batch instance.
@@ -59,7 +59,7 @@ class BaseBatch {
      * Command Response - If `key` exists, returns the value of `key`. Otherwise, return `null`.
      */
     get(key) {
-        return this.addAndReturn((0, Commands_1.createGet)(key));
+        return this.addAndReturn((0, _1.createGet)(key));
     }
     /**
      * Get the value of `key` and optionally set its expiration. `GETEX` is similar to {@link get}.
@@ -75,7 +75,7 @@ class BaseBatch {
      * Command Response - If `key` exists, returns the value of `key` as a `string`. Otherwise, return `null`.
      */
     getex(key, options) {
-        return this.addAndReturn((0, Commands_1.createGetEx)(key, options));
+        return this.addAndReturn((0, _1.createGetEx)(key, options));
     }
     /**
      * Gets a string value associated with the given `key`and deletes the key.
@@ -87,7 +87,7 @@ class BaseBatch {
      * Command Response - If `key` exists, returns the `value` of `key`. Otherwise, return `null`.
      */
     getdel(key) {
-        return this.addAndReturn((0, Commands_1.createGetDel)(key));
+        return this.addAndReturn((0, _1.createGetDel)(key));
     }
     /**
      * Returns the substring of the string value stored at `key`, determined by the byte offsets
@@ -105,7 +105,7 @@ class BaseBatch {
      * Command Response - substring extracted from the value stored at `key`.
      */
     getrange(key, start, end) {
-        return this.addAndReturn((0, Commands_1.createGetRange)(key, start, end));
+        return this.addAndReturn((0, _1.createGetRange)(key, start, end));
     }
     /** Set the given key with the given value. Return value is dependent on the passed options.
      * @see {@link https://valkey.io/commands/set/|valkey.io} for details.
@@ -119,7 +119,7 @@ class BaseBatch {
      * If `returnOldValue` is set, return the old value as a string.
      */
     set(key, value, options) {
-        return this.addAndReturn((0, Commands_1.createSet)(key, value, options));
+        return this.addAndReturn((0, _1.createSet)(key, value, options));
     }
     /**
      * Pings the server.
@@ -133,7 +133,7 @@ class BaseBatch {
      * Command Response - `"PONG"` if `message` is not provided, otherwise return a copy of `message`.
      */
     ping(message) {
-        return this.addAndReturn((0, Commands_1.createPing)(message));
+        return this.addAndReturn((0, _1.createPing)(message));
     }
     /**
      * Gets information and statistics about the server.
@@ -148,7 +148,7 @@ class BaseBatch {
      * Command Response - A string containing the information for the sections requested.
      */
     info(sections) {
-        return this.addAndReturn((0, Commands_1.createInfo)(sections));
+        return this.addAndReturn((0, _1.createInfo)(sections));
     }
     /**
      * Removes the specified keys. A key is ignored if it does not exist.
@@ -160,7 +160,7 @@ class BaseBatch {
      * Command Response - The number of keys that were removed.
      */
     del(keys) {
-        return this.addAndReturn((0, Commands_1.createDel)(keys));
+        return this.addAndReturn((0, _1.createDel)(keys));
     }
     /**
      * Serialize the value stored at `key` in a Valkey-specific format and return it to the user.
@@ -173,7 +173,7 @@ class BaseBatch {
      * Command Response - The serialized value of the data stored at `key`. If `key` does not exist, `null` will be returned.
      */
     dump(key) {
-        return this.addAndReturn((0, Commands_1.createDump)(key));
+        return this.addAndReturn((0, _1.createDump)(key));
     }
     /**
      * Create a `key` associated with a `value` that is obtained by deserializing the provided
@@ -190,7 +190,7 @@ class BaseBatch {
      * Command Response - Return "OK" if the `key` was successfully restored with a `value`.
      */
     restore(key, ttl, value, options) {
-        return this.addAndReturn((0, Commands_1.createRestore)(key, ttl, value, options));
+        return this.addAndReturn((0, _1.createRestore)(key, ttl, value, options));
     }
     /**
      * Gets the name of the connection on which the batch is being executed.
@@ -200,7 +200,7 @@ class BaseBatch {
      * Command Response - The name of the client connection as a string if a name is set, or null if no name is assigned.
      */
     clientGetName() {
-        return this.addAndReturn((0, Commands_1.createClientGetName)());
+        return this.addAndReturn((0, _1.createClientGetName)());
     }
     /**
      * Rewrites the configuration file with the current configuration.
@@ -210,7 +210,7 @@ class BaseBatch {
      * Command Response - "OK" when the configuration was rewritten properly. Otherwise, the command fails with an error.
      */
     configRewrite() {
-        return this.addAndReturn((0, Commands_1.createConfigRewrite)());
+        return this.addAndReturn((0, _1.createConfigRewrite)());
     }
     /**
      * Resets the statistics reported by Valkey using the `INFO` and `LATENCY HISTOGRAM` commands.
@@ -220,7 +220,7 @@ class BaseBatch {
      * Command Response - always "OK".
      */
     configResetStat() {
-        return this.addAndReturn((0, Commands_1.createConfigResetStat)());
+        return this.addAndReturn((0, _1.createConfigResetStat)());
     }
     /** Retrieve the values of multiple keys.
      * @see {@link https://valkey.io/commands/mget/|valkey.io} for details.
@@ -231,7 +231,7 @@ class BaseBatch {
      * its corresponding value in the list will be null.
      */
     mget(keys) {
-        return this.addAndReturn((0, Commands_1.createMGet)(keys));
+        return this.addAndReturn((0, _1.createMGet)(keys));
     }
     /** Set multiple keys to multiple values in a single atomic operation.
      * @see {@link https://valkey.io/commands/mset/|valkey.io} for details.
@@ -241,7 +241,7 @@ class BaseBatch {
      * Command Response - always "OK".
      */
     mset(keysAndValues) {
-        return this.addAndReturn((0, Commands_1.createMSet)((0, BaseClient_1.convertGlideRecord)(keysAndValues)));
+        return this.addAndReturn((0, _1.createMSet)((0, _1.convertGlideRecord)(keysAndValues)));
     }
     /**
      * Sets multiple keys to values if the key does not exist. The operation is atomic, and if one or
@@ -253,7 +253,7 @@ class BaseBatch {
      * Command Response - `true` if all keys were set. `false` if no key was set.
      */
     msetnx(keysAndValues) {
-        return this.addAndReturn((0, Commands_1.createMSetNX)((0, BaseClient_1.convertGlideRecord)(keysAndValues)));
+        return this.addAndReturn((0, _1.createMSetNX)((0, _1.convertGlideRecord)(keysAndValues)));
     }
     /** Increments the number stored at `key` by one. If `key` does not exist, it is set to 0 before performing the operation.
      * @see {@link https://valkey.io/commands/incr/|valkey.io} for details.
@@ -263,7 +263,7 @@ class BaseBatch {
      * Command Response - the value of `key` after the increment.
      */
     incr(key) {
-        return this.addAndReturn((0, Commands_1.createIncr)(key));
+        return this.addAndReturn((0, _1.createIncr)(key));
     }
     /** Increments the number stored at `key` by `amount`. If `key` does not exist, it is set to 0 before performing the operation.
      * @see {@link https://valkey.io/commands/incrby/|valkey.io} for details.
@@ -274,7 +274,7 @@ class BaseBatch {
      * Command Response - the value of `key` after the increment.
      */
     incrBy(key, amount) {
-        return this.addAndReturn((0, Commands_1.createIncrBy)(key, amount));
+        return this.addAndReturn((0, _1.createIncrBy)(key, amount));
     }
     /** Increment the string representing a floating point number stored at `key` by `amount`.
      * By using a negative amount value, the result is that the value stored at `key` is decremented.
@@ -288,7 +288,7 @@ class BaseBatch {
      *
      */
     incrByFloat(key, amount) {
-        return this.addAndReturn((0, Commands_1.createIncrByFloat)(key, amount));
+        return this.addAndReturn((0, _1.createIncrByFloat)(key, amount));
     }
     /**
      * Returns the current connection ID.
@@ -298,7 +298,7 @@ class BaseBatch {
      * Command Response - The ID of the connection.
      */
     clientId() {
-        return this.addAndReturn((0, Commands_1.createClientId)());
+        return this.addAndReturn((0, _1.createClientId)());
     }
     /** Decrements the number stored at `key` by one. If `key` does not exist, it is set to 0 before performing the operation.
      * @see {@link https://valkey.io/commands/decr/|valkey.io} for details.
@@ -308,7 +308,7 @@ class BaseBatch {
      * Command Response - the value of `key` after the decrement.
      */
     decr(key) {
-        return this.addAndReturn((0, Commands_1.createDecr)(key));
+        return this.addAndReturn((0, _1.createDecr)(key));
     }
     /** Decrements the number stored at `key` by `amount`. If `key` does not exist, it is set to 0 before performing the operation.
      * @see {@link https://valkey.io/commands/decrby/|valkey.io} for details.
@@ -319,7 +319,7 @@ class BaseBatch {
      * Command Response - the value of `key` after the decrement.
      */
     decrBy(key, amount) {
-        return this.addAndReturn((0, Commands_1.createDecrBy)(key, amount));
+        return this.addAndReturn((0, _1.createDecrBy)(key, amount));
     }
     /**
      * Perform a bitwise operation between multiple keys (containing string values) and store the result in the
@@ -334,7 +334,7 @@ class BaseBatch {
      * Command Response - The size of the string stored in `destination`.
      */
     bitop(operation, destination, keys) {
-        return this.addAndReturn((0, Commands_1.createBitOp)(operation, destination, keys));
+        return this.addAndReturn((0, _1.createBitOp)(operation, destination, keys));
     }
     /**
      * Returns the bit value at `offset` in the string value stored at `key`. `offset` must be greater than or equal
@@ -349,7 +349,7 @@ class BaseBatch {
      * `offset` exceeds the length of the string.
      */
     getbit(key, offset) {
-        return this.addAndReturn((0, Commands_1.createGetBit)(key, offset));
+        return this.addAndReturn((0, _1.createGetBit)(key, offset));
     }
     /**
      * Sets or clears the bit at `offset` in the string value stored at `key`. The `offset` is a zero-based index, with
@@ -366,7 +366,7 @@ class BaseBatch {
      * Command Response - The bit value that was previously stored at `offset`.
      */
     setbit(key, offset, value) {
-        return this.addAndReturn((0, Commands_1.createSetBit)(key, offset, value));
+        return this.addAndReturn((0, _1.createSetBit)(key, offset, value));
     }
     /**
      * Returns the position of the first bit matching the given `bit` value. The optional starting offset
@@ -384,7 +384,7 @@ class BaseBatch {
      *      If `start` was provided, the search begins at the offset indicated by `start`.
      */
     bitpos(key, bit, options) {
-        return this.addAndReturn((0, Commands_1.createBitPos)(key, bit, options));
+        return this.addAndReturn((0, _1.createBitPos)(key, bit, options));
     }
     /**
      * Reads or modifies the array of bits representing the string that is held at `key` based on the specified
@@ -411,7 +411,7 @@ class BaseBatch {
      *   does not contribute a value to the array response.
      */
     bitfield(key, subcommands) {
-        return this.addAndReturn((0, Commands_1.createBitField)(key, subcommands));
+        return this.addAndReturn((0, _1.createBitField)(key, subcommands));
     }
     /**
      * Reads the array of bits representing the string that is held at `key` based on the specified `subcommands`.
@@ -426,7 +426,7 @@ class BaseBatch {
      *
      */
     bitfieldReadOnly(key, subcommands) {
-        return this.addAndReturn((0, Commands_1.createBitField)(key, subcommands, true));
+        return this.addAndReturn((0, _1.createBitField)(key, subcommands, true));
     }
     /**
      * Reads the configuration parameters of the running server.
@@ -440,7 +440,7 @@ class BaseBatch {
      *
      */
     configGet(parameters) {
-        return this.addAndReturn((0, Commands_1.createConfigGet)(parameters));
+        return this.addAndReturn((0, _1.createConfigGet)(parameters));
     }
     /**
      * Sets configuration parameters to the specified values.
@@ -453,7 +453,7 @@ class BaseBatch {
      * Command Response - "OK" when the configuration was set properly. Otherwise, the command fails with an error.
      */
     configSet(parameters) {
-        return this.addAndReturn((0, Commands_1.createConfigSet)(parameters));
+        return this.addAndReturn((0, _1.createConfigSet)(parameters));
     }
     /** Retrieve the value associated with `field` in the hash stored at `key`.
      * @see {@link https://valkey.io/commands/hget/|valkey.io} for details.
@@ -464,7 +464,7 @@ class BaseBatch {
      * Command Response - the value associated with `field`, or null when `field` is not present in the hash or `key` does not exist.
      */
     hget(key, field) {
-        return this.addAndReturn((0, Commands_1.createHGet)(key, field));
+        return this.addAndReturn((0, _1.createHGet)(key, field));
     }
     /** Sets the specified fields to their respective values in the hash stored at `key`.
      * @see {@link https://valkey.io/commands/hset/|valkey.io} for details.
@@ -476,7 +476,7 @@ class BaseBatch {
      * Command Response - The number of fields that were added.
      */
     hset(key, fieldsAndValues) {
-        return this.addAndReturn((0, Commands_1.createHSet)(key, (0, Commands_1.convertFieldsAndValuesToHashDataType)(fieldsAndValues)));
+        return this.addAndReturn((0, _1.createHSet)(key, (0, _1.convertFieldsAndValuesToHashDataType)(fieldsAndValues)));
     }
     /**
      * Returns all field names in the hash stored at `key`.
@@ -488,7 +488,7 @@ class BaseBatch {
      * Command Response - A list of field names for the hash, or an empty list when the key does not exist.
      */
     hkeys(key) {
-        return this.addAndReturn((0, Commands_1.createHKeys)(key));
+        return this.addAndReturn((0, _1.createHKeys)(key));
     }
     /** Sets `field` in the hash stored at `key` to `value`, only if `field` does not yet exist.
      * If `key` does not exist, a new key holding a hash is created.
@@ -502,7 +502,7 @@ class BaseBatch {
      * Command Response - `true` if the field was set, `false` if the field already existed and was not set.
      */
     hsetnx(key, field, value) {
-        return this.addAndReturn((0, Commands_1.createHSetNX)(key, field, value));
+        return this.addAndReturn((0, _1.createHSetNX)(key, field, value));
     }
     /** Removes the specified fields from the hash stored at `key`.
      * Specified fields that do not exist within this hash are ignored.
@@ -515,7 +515,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty hash and it returns 0.
      */
     hdel(key, fields) {
-        return this.addAndReturn((0, Commands_1.createHDel)(key, fields));
+        return this.addAndReturn((0, _1.createHDel)(key, fields));
     }
     /** Returns the values associated with the specified fields in the hash stored at `key`.
      * @see {@link https://valkey.io/commands/hmget/|valkey.io} for details.
@@ -528,7 +528,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty hash and it returns a list of null values.
      */
     hmget(key, fields) {
-        return this.addAndReturn((0, Commands_1.createHMGet)(key, fields));
+        return this.addAndReturn((0, _1.createHMGet)(key, fields));
     }
     /** Returns if `field` is an existing field in the hash stored at `key`.
      * @see {@link https://valkey.io/commands/hexists/|valkey.io} for details.
@@ -540,7 +540,7 @@ class BaseBatch {
      * the command response will be `false`.
      */
     hexists(key, field) {
-        return this.addAndReturn((0, Commands_1.createHExists)(key, field));
+        return this.addAndReturn((0, _1.createHExists)(key, field));
     }
     /**
      * Returns all fields and values of the hash stored at `key`.
@@ -553,7 +553,7 @@ class BaseBatch {
      * If `key` does not exist, it returns an empty list.
      */
     hgetall(key) {
-        return this.addAndReturn((0, Commands_1.createHGetAll)(key));
+        return this.addAndReturn((0, _1.createHGetAll)(key));
     }
     /** Increments the number stored at `field` in the hash stored at `key` by `increment`.
      * By using a negative increment value, the value stored at `field` in the hash stored at `key` is decremented.
@@ -567,7 +567,7 @@ class BaseBatch {
      * Command Response - the value of `field` in the hash stored at `key` after the increment.
      */
     hincrBy(key, field, amount) {
-        return this.addAndReturn((0, Commands_1.createHIncrBy)(key, field, amount));
+        return this.addAndReturn((0, _1.createHIncrBy)(key, field, amount));
     }
     /** Increment the string representing a floating point number stored at `field` in the hash stored at `key` by `increment`.
      * By using a negative increment value, the value stored at `field` in the hash stored at `key` is decremented.
@@ -581,7 +581,7 @@ class BaseBatch {
      * Command Response - the value of `field` in the hash stored at `key` after the increment.
      */
     hincrByFloat(key, field, amount) {
-        return this.addAndReturn((0, Commands_1.createHIncrByFloat)(key, field, amount));
+        return this.addAndReturn((0, _1.createHIncrByFloat)(key, field, amount));
     }
     /** Returns the number of fields contained in the hash stored at `key`.
      * @see {@link https://valkey.io/commands/hlen/|valkey.io} for details.
@@ -591,7 +591,7 @@ class BaseBatch {
      * Command Response - The number of fields in the hash, or 0 when the key does not exist.
      */
     hlen(key) {
-        return this.addAndReturn((0, Commands_1.createHLen)(key));
+        return this.addAndReturn((0, _1.createHLen)(key));
     }
     /** Returns all values in the hash stored at key.
      * @see {@link https://valkey.io/commands/hvals/|valkey.io} for details.
@@ -601,7 +601,7 @@ class BaseBatch {
      * Command Response - a list of values in the hash, or an empty list when the key does not exist.
      */
     hvals(key) {
-        return this.addAndReturn((0, Commands_1.createHVals)(key));
+        return this.addAndReturn((0, _1.createHVals)(key));
     }
     /**
      * Returns the string length of the value associated with `field` in the hash stored at `key`.
@@ -614,7 +614,7 @@ class BaseBatch {
      * Command Response - The string length or `0` if `field` or `key` does not exist.
      */
     hstrlen(key, field) {
-        return this.addAndReturn((0, Commands_1.createHStrlen)(key, field));
+        return this.addAndReturn((0, _1.createHStrlen)(key, field));
     }
     /**
      * Returns a random field name from the hash value stored at `key`.
@@ -628,7 +628,7 @@ class BaseBatch {
      *     the key does not exist.
      */
     hrandfield(key) {
-        return this.addAndReturn((0, Commands_1.createHRandField)(key));
+        return this.addAndReturn((0, _1.createHRandField)(key));
     }
     /**
      * Iterates incrementally over a hash.
@@ -647,7 +647,7 @@ class BaseBatch {
      * If `options.noValues` is set to `true`, the second element will only contain the fields without the values.
      */
     hscan(key, cursor, options) {
-        return this.addAndReturn((0, Commands_1.createHScan)(key, cursor, options));
+        return this.addAndReturn((0, _1.createHScan)(key, cursor, options));
     }
     /**
      * Retrieves up to `count` random field names from the hash value stored at `key`.
@@ -664,7 +664,7 @@ class BaseBatch {
      *     or an `empty array` when the key does not exist.
      */
     hrandfieldCount(key, count) {
-        return this.addAndReturn((0, Commands_1.createHRandField)(key, count));
+        return this.addAndReturn((0, _1.createHRandField)(key, count));
     }
     /**
      * Retrieves up to `count` random field names along with their values from the hash
@@ -683,7 +683,7 @@ class BaseBatch {
      *     If the hash does not exist or is empty, the response will be an empty `array`.
      */
     hrandfieldWithValues(key, count) {
-        return this.addAndReturn((0, Commands_1.createHRandField)(key, count, true));
+        return this.addAndReturn((0, _1.createHRandField)(key, count, true));
     }
     /** Inserts all the specified values at the head of the list stored at `key`.
      * `elements` are inserted one after the other to the head of the list, from the leftmost element to the rightmost element.
@@ -696,7 +696,7 @@ class BaseBatch {
      * Command Response - the length of the list after the push operations.
      */
     lpush(key, elements) {
-        return this.addAndReturn((0, Commands_1.createLPush)(key, elements));
+        return this.addAndReturn((0, _1.createLPush)(key, elements));
     }
     /**
      * Inserts specified values at the head of the `list`, only if `key` already
@@ -710,7 +710,7 @@ class BaseBatch {
      * Command Response - The length of the list after the push operation.
      */
     lpushx(key, elements) {
-        return this.addAndReturn((0, Commands_1.createLPushX)(key, elements));
+        return this.addAndReturn((0, _1.createLPushX)(key, elements));
     }
     /** Removes and returns the first elements of the list stored at `key`.
      * The command pops a single element from the beginning of the list.
@@ -722,7 +722,7 @@ class BaseBatch {
      * If `key` does not exist null will be returned.
      */
     lpop(key) {
-        return this.addAndReturn((0, Commands_1.createLPop)(key));
+        return this.addAndReturn((0, _1.createLPop)(key));
     }
     /** Removes and returns up to `count` elements of the list stored at `key`, depending on the list's length.
      * @see {@link https://valkey.io/commands/lpop/|valkey.io} for details.
@@ -734,7 +734,7 @@ class BaseBatch {
      * If `key` does not exist null will be returned.
      */
     lpopCount(key, count) {
-        return this.addAndReturn((0, Commands_1.createLPop)(key, count));
+        return this.addAndReturn((0, _1.createLPop)(key, count));
     }
     /** Returns the specified elements of the list stored at `key`.
      * The offsets `start` and `end` are zero-based indexes, with 0 being the first element of the list, 1 being the next element and so on.
@@ -752,7 +752,7 @@ class BaseBatch {
      * If `key` does not exist an empty list will be returned.
      */
     lrange(key, start, end) {
-        return this.addAndReturn((0, Commands_1.createLRange)(key, start, end));
+        return this.addAndReturn((0, _1.createLRange)(key, start, end));
     }
     /** Returns the length of the list stored at `key`.
      * @see {@link https://valkey.io/commands/llen/|valkey.io} for details.
@@ -763,7 +763,7 @@ class BaseBatch {
      * If `key` does not exist, it is interpreted as an empty list and 0 is returned.
      */
     llen(key) {
-        return this.addAndReturn((0, Commands_1.createLLen)(key));
+        return this.addAndReturn((0, _1.createLLen)(key));
     }
     /**
      * Atomically pops and removes the left/right-most element to the list stored at `source`
@@ -781,7 +781,7 @@ class BaseBatch {
      * Command Response - The popped element, or `null` if `source` does not exist.
      */
     lmove(source, destination, whereFrom, whereTo) {
-        return this.addAndReturn((0, Commands_1.createLMove)(source, destination, whereFrom, whereTo));
+        return this.addAndReturn((0, _1.createLMove)(source, destination, whereFrom, whereTo));
     }
     /**
      *
@@ -804,7 +804,7 @@ class BaseBatch {
      * Command Response - The popped element, or `null` if `source` does not exist or if the operation timed-out.
      */
     blmove(source, destination, whereFrom, whereTo, timeout) {
-        return this.addAndReturn((0, Commands_1.createBLMove)(source, destination, whereFrom, whereTo, timeout));
+        return this.addAndReturn((0, _1.createBLMove)(source, destination, whereFrom, whereTo, timeout));
     }
     /**
      * Sets the list element at `index` to `element`.
@@ -821,7 +821,7 @@ class BaseBatch {
      * Command Response - Always "OK".
      */
     lset(key, index, element) {
-        return this.addAndReturn((0, Commands_1.createLSet)(key, index, element));
+        return this.addAndReturn((0, _1.createLSet)(key, index, element));
     }
     /** Trim an existing list so that it will contain only the specified range of elements specified.
      * The offsets `start` and `end` are zero-based indexes, with 0 being the first element of the list, 1 being the next element and so on.
@@ -834,27 +834,27 @@ class BaseBatch {
      * @param end - The end of the range.
      *
      * Command Response - always "OK".
-     * If `start` exceeds the end of the list, or if `start` is greater than `end`, the result will be an empty list (which causes key to be removed).
+     * If `start` exceeds the end of the list, or if `start` is greater than `end`, the list is emptied and the key is removed.
      * If `end` exceeds the actual end of the list, it will be treated like the last element of the list.
      * If `key` does not exist the command will be ignored.
      */
     ltrim(key, start, end) {
-        return this.addAndReturn((0, Commands_1.createLTrim)(key, start, end));
+        return this.addAndReturn((0, _1.createLTrim)(key, start, end));
     }
     /** Removes the first `count` occurrences of elements equal to `element` from the list stored at `key`.
-     * If `count` is positive : Removes elements equal to `element` moving from head to tail.
-     * If `count` is negative : Removes elements equal to `element` moving from tail to head.
-     * If `count` is 0 or `count` is greater than the occurrences of elements equal to `element`: Removes all elements equal to `element`.
      *
      * @param key - The key of the list.
      * @param count - The count of the occurrences of elements equal to `element` to remove.
+     * If `count` is positive : Removes elements equal to `element` moving from head to tail.
+     * If `count` is negative : Removes elements equal to `element` moving from tail to head.
+     * If `count` is 0 or `count` is greater than the occurrences of elements equal to `element`: Removes all elements equal to `element`.
      * @param element - The element to remove from the list.
      *
      * Command Response - the number of the removed elements.
      * If `key` does not exist, 0 is returned.
      */
     lrem(key, count, element) {
-        return this.addAndReturn((0, Commands_1.createLRem)(key, count, element));
+        return this.addAndReturn((0, _1.createLRem)(key, count, element));
     }
     /** Inserts all the specified values at the tail of the list stored at `key`.
      * `elements` are inserted one after the other to the tail of the list, from the leftmost element to the rightmost element.
@@ -867,7 +867,7 @@ class BaseBatch {
      * Command Response - the length of the list after the push operations.
      */
     rpush(key, elements) {
-        return this.addAndReturn((0, Commands_1.createRPush)(key, elements));
+        return this.addAndReturn((0, _1.createRPush)(key, elements));
     }
     /**
      * Inserts specified values at the tail of the `list`, only if `key` already
@@ -881,7 +881,7 @@ class BaseBatch {
      * Command Response - The length of the list after the push operation.
      */
     rpushx(key, elements) {
-        return this.addAndReturn((0, Commands_1.createRPushX)(key, elements));
+        return this.addAndReturn((0, _1.createRPushX)(key, elements));
     }
     /** Removes and returns the last elements of the list stored at `key`.
      * The command pops a single element from the end of the list.
@@ -893,7 +893,7 @@ class BaseBatch {
      * If `key` does not exist null will be returned.
      */
     rpop(key) {
-        return this.addAndReturn((0, Commands_1.createRPop)(key));
+        return this.addAndReturn((0, _1.createRPop)(key));
     }
     /** Removes and returns up to `count` elements from the list stored at `key`, depending on the list's length.
      * @see {@link https://valkey.io/commands/rpop/|valkey.io} for details.
@@ -905,7 +905,7 @@ class BaseBatch {
      * If `key` does not exist null will be returned.
      */
     rpopCount(key, count) {
-        return this.addAndReturn((0, Commands_1.createRPop)(key, count));
+        return this.addAndReturn((0, _1.createRPop)(key, count));
     }
     /** Adds the specified members to the set stored at `key`. Specified members that are already a member of this set are ignored.
      * If `key` does not exist, a new set is created before adding `members`.
@@ -917,7 +917,7 @@ class BaseBatch {
      * Command Response - the number of members that were added to the set, not including all the members already present in the set.
      */
     sadd(key, members) {
-        return this.addAndReturn((0, Commands_1.createSAdd)(key, members));
+        return this.addAndReturn((0, _1.createSAdd)(key, members));
     }
     /** Removes the specified members from the set stored at `key`. Specified members that are not a member of this set are ignored.
      * @see {@link https://valkey.io/commands/srem/|valkey.io} for details.
@@ -929,7 +929,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty set and this command returns 0.
      */
     srem(key, members) {
-        return this.addAndReturn((0, Commands_1.createSRem)(key, members));
+        return this.addAndReturn((0, _1.createSRem)(key, members));
     }
     /**
      * Iterates incrementally over a set.
@@ -944,7 +944,7 @@ class BaseBatch {
      * The `cursor` will be `"0"` on the last iteration of the set. The second element is always an array of the subset of the set held in `key`.
      */
     sscan(key, cursor, options) {
-        return this.addAndReturn((0, Commands_1.createSScan)(key, cursor, options));
+        return this.addAndReturn((0, _1.createSScan)(key, cursor, options));
     }
     /** Returns all the members of the set value stored at `key`.
      * @see {@link https://valkey.io/commands/smembers/|valkey.io} for details.
@@ -955,7 +955,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty set and this command returns empty list.
      */
     smembers(key) {
-        return this.addAndReturn((0, Commands_1.createSMembers)(key), true);
+        return this.addAndReturn((0, _1.createSMembers)(key), true);
     }
     /** Moves `member` from the set at `source` to the set at `destination`, removing it from the source set.
      * Creates a new destination set if needed. The operation is atomic.
@@ -968,7 +968,7 @@ class BaseBatch {
      * Command Response - `true` on success, or `false` if the `source` set does not exist or the element is not a member of the source set.
      */
     smove(source, destination, member) {
-        return this.addAndReturn((0, Commands_1.createSMove)(source, destination, member));
+        return this.addAndReturn((0, _1.createSMove)(source, destination, member));
     }
     /** Returns the set cardinality (number of elements) of the set stored at `key`.
      * @see {@link https://valkey.io/commands/scard/|valkey.io} for details.
@@ -978,7 +978,7 @@ class BaseBatch {
      * Command Response - the cardinality (number of elements) of the set, or 0 if key does not exist.
      */
     scard(key) {
-        return this.addAndReturn((0, Commands_1.createSCard)(key));
+        return this.addAndReturn((0, _1.createSCard)(key));
     }
     /** Gets the intersection of all the given sets.
      * When in cluster mode, all `keys` must map to the same hash slot.
@@ -990,7 +990,7 @@ class BaseBatch {
      * If one or more sets do not exist, an empty set will be returned.
      */
     sinter(keys) {
-        return this.addAndReturn((0, Commands_1.createSInter)(keys), true);
+        return this.addAndReturn((0, _1.createSInter)(keys), true);
     }
     /**
      * Gets the cardinality of the intersection of all the given sets.
@@ -1005,7 +1005,7 @@ class BaseBatch {
      * Command Response - The cardinality of the intersection result. If one or more sets do not exist, `0` is returned.
      */
     sintercard(keys, options) {
-        return this.addAndReturn((0, Commands_1.createSInterCard)(keys, options?.limit));
+        return this.addAndReturn((0, _1.createSInterCard)(keys, options?.limit));
     }
     /**
      * Stores the members of the intersection of all given sets specified by `keys` into a new set at `destination`.
@@ -1018,7 +1018,7 @@ class BaseBatch {
      * Command Response - The number of elements in the resulting set.
      */
     sinterstore(destination, keys) {
-        return this.addAndReturn((0, Commands_1.createSInterStore)(destination, keys));
+        return this.addAndReturn((0, _1.createSInterStore)(destination, keys));
     }
     /**
      * Computes the difference between the first set and all the successive sets in `keys`.
@@ -1031,7 +1031,7 @@ class BaseBatch {
      * If a key in `keys` does not exist, it is treated as an empty set.
      */
     sdiff(keys) {
-        return this.addAndReturn((0, Commands_1.createSDiff)(keys), true);
+        return this.addAndReturn((0, _1.createSDiff)(keys), true);
     }
     /**
      * Stores the difference between the first set and all the successive sets in `keys` into a new set at `destination`.
@@ -1044,7 +1044,7 @@ class BaseBatch {
      * Command Response - The number of elements in the resulting set.
      */
     sdiffstore(destination, keys) {
-        return this.addAndReturn((0, Commands_1.createSDiffStore)(destination, keys));
+        return this.addAndReturn((0, _1.createSDiffStore)(destination, keys));
     }
     /**
      * Gets the union of all the given sets.
@@ -1057,7 +1057,7 @@ class BaseBatch {
      * If none of the sets exist, an empty `Set` will be returned.
      */
     sunion(keys) {
-        return this.addAndReturn((0, Commands_1.createSUnion)(keys), true);
+        return this.addAndReturn((0, _1.createSUnion)(keys), true);
     }
     /**
      * Stores the members of the union of all given sets specified by `keys` into a new set
@@ -1071,7 +1071,7 @@ class BaseBatch {
      * Command Response - The number of elements in the resulting set.
      */
     sunionstore(destination, keys) {
-        return this.addAndReturn((0, Commands_1.createSUnionStore)(destination, keys));
+        return this.addAndReturn((0, _1.createSUnionStore)(destination, keys));
     }
     /** Returns if `member` is a member of the set stored at `key`.
      * @see {@link https://valkey.io/commands/sismember/|valkey.io} for details.
@@ -1083,7 +1083,7 @@ class BaseBatch {
      * If `key` doesn't exist, it is treated as an empty set and the command returns `false`.
      */
     sismember(key, member) {
-        return this.addAndReturn((0, Commands_1.createSIsMember)(key, member));
+        return this.addAndReturn((0, _1.createSIsMember)(key, member));
     }
     /**
      * Checks whether each member is contained in the members of the set stored at `key`.
@@ -1097,7 +1097,7 @@ class BaseBatch {
      * Command Response - An `array` of `boolean` values, each indicating if the respective member exists in the set.
      */
     smismember(key, members) {
-        return this.addAndReturn((0, Commands_1.createSMIsMember)(key, members));
+        return this.addAndReturn((0, _1.createSMIsMember)(key, members));
     }
     /** Removes and returns one random member from the set value store at `key`.
      * @see {@link https://valkey.io/commands/spop/|valkey.io} for details.
@@ -1109,7 +1109,7 @@ class BaseBatch {
      * If `key` does not exist, null will be returned.
      */
     spop(key) {
-        return this.addAndReturn((0, Commands_1.createSPop)(key));
+        return this.addAndReturn((0, _1.createSPop)(key));
     }
     /** Removes and returns up to `count` random members from the set value store at `key`, depending on the set's length.
      * @see {@link https://valkey.io/commands/spop/|valkey.io} for details.
@@ -1121,7 +1121,7 @@ class BaseBatch {
      * If `key` does not exist, empty list will be returned.
      */
     spopCount(key, count) {
-        return this.addAndReturn((0, Commands_1.createSPop)(key, count), true);
+        return this.addAndReturn((0, _1.createSPop)(key, count), true);
     }
     /** Returns a random element from the set value stored at `key`.
      *
@@ -1131,7 +1131,7 @@ class BaseBatch {
      * Command Response - A random element from the set, or null if `key` does not exist.
      */
     srandmember(key) {
-        return this.addAndReturn((0, Commands_1.createSRandMember)(key));
+        return this.addAndReturn((0, _1.createSRandMember)(key));
     }
     /** Returns one or more random elements from the set value stored at `key`.
      *
@@ -1144,7 +1144,7 @@ class BaseBatch {
      * Command Response - A list of members from the set. If the set does not exist or is empty, an empty list will be returned.
      */
     srandmemberCount(key, count) {
-        return this.addAndReturn((0, Commands_1.createSRandMember)(key, count));
+        return this.addAndReturn((0, _1.createSRandMember)(key, count));
     }
     /**
      * Returns the number of keys in `keys` that exist in the database.
@@ -1157,7 +1157,7 @@ class BaseBatch {
      *     it will be counted multiple times.
      */
     exists(keys) {
-        return this.addAndReturn((0, Commands_1.createExists)(keys));
+        return this.addAndReturn((0, _1.createExists)(keys));
     }
     /**
      * Removes the specified keys. A key is ignored if it does not exist.
@@ -1171,7 +1171,7 @@ class BaseBatch {
      * Command Response - The number of keys that were unlinked.
      */
     unlink(keys) {
-        return this.addAndReturn((0, Commands_1.createUnlink)(keys));
+        return this.addAndReturn((0, _1.createUnlink)(keys));
     }
     /**
      * Sets a timeout on `key` in seconds. After the timeout has expired, the key will automatically be deleted.
@@ -1190,7 +1190,7 @@ class BaseBatch {
      *     or operation skipped due to the provided arguments.
      */
     expire(key, seconds, options) {
-        return this.addAndReturn((0, Commands_1.createExpire)(key, seconds, options?.expireOption));
+        return this.addAndReturn((0, _1.createExpire)(key, seconds, options?.expireOption));
     }
     /**
      * Sets a timeout on `key`. It takes an absolute Unix timestamp (seconds since January 1, 1970) instead of specifying the number of seconds.
@@ -1209,7 +1209,7 @@ class BaseBatch {
      *     or operation skipped due to the provided arguments.
      */
     expireAt(key, unixSeconds, options) {
-        return this.addAndReturn((0, Commands_1.createExpireAt)(key, unixSeconds, options?.expireOption));
+        return this.addAndReturn((0, _1.createExpireAt)(key, unixSeconds, options?.expireOption));
     }
     /**
      * Returns the absolute Unix timestamp (since January 1, 1970) at which the given `key` will expire, in seconds.
@@ -1223,7 +1223,7 @@ class BaseBatch {
      * Command Response - The expiration Unix timestamp in seconds, `-2` if `key` does not exist or `-1` if `key` exists but has no associated expire.
      */
     expireTime(key) {
-        return this.addAndReturn((0, Commands_1.createExpireTime)(key));
+        return this.addAndReturn((0, _1.createExpireTime)(key));
     }
     /**
      * Sets a timeout on `key` in milliseconds. After the timeout has expired, the key will automatically be deleted.
@@ -1242,7 +1242,7 @@ class BaseBatch {
      *     or operation skipped due to the provided arguments.
      */
     pexpire(key, milliseconds, options) {
-        return this.addAndReturn((0, Commands_1.createPExpire)(key, milliseconds, options?.expireOption));
+        return this.addAndReturn((0, _1.createPExpire)(key, milliseconds, options?.expireOption));
     }
     /**
      * Sets a timeout on `key`. It takes an absolute Unix timestamp (milliseconds since January 1, 1970) instead of specifying the number of milliseconds.
@@ -1261,7 +1261,7 @@ class BaseBatch {
      *     or operation skipped due to the provided arguments.
      */
     pexpireAt(key, unixMilliseconds, options) {
-        return this.addAndReturn((0, Commands_1.createPExpireAt)(key, unixMilliseconds, options?.expireOption));
+        return this.addAndReturn((0, _1.createPExpireAt)(key, unixMilliseconds, options?.expireOption));
     }
     /**
      * Returns the absolute Unix timestamp (since January 1, 1970) at which the given `key` will expire, in milliseconds.
@@ -1274,7 +1274,7 @@ class BaseBatch {
      * Command Response - The expiration Unix timestamp in seconds, `-2` if `key` does not exist or `-1` if `key` exists but has no associated expire.
      */
     pexpireTime(key) {
-        return this.addAndReturn((0, Commands_1.createPExpireTime)(key));
+        return this.addAndReturn((0, _1.createPExpireTime)(key));
     }
     /**
      * Returns the remaining time to live of `key` that has a timeout.
@@ -1286,7 +1286,7 @@ class BaseBatch {
      * Command Response - TTL in seconds, `-2` if `key` does not exist or `-1` if `key` exists but has no associated expire.
      */
     ttl(key) {
-        return this.addAndReturn((0, Commands_1.createTTL)(key));
+        return this.addAndReturn((0, _1.createTTL)(key));
     }
     /**
      * Adds members with their scores to the sorted set stored at `key`.
@@ -1302,7 +1302,7 @@ class BaseBatch {
      * If {@link ZAddOptions.changed} is set to `true`, returns the number of elements updated in the sorted set.
      */
     zadd(key, membersAndScores, options) {
-        return this.addAndReturn((0, Commands_1.createZAdd)(key, membersAndScores, options));
+        return this.addAndReturn((0, _1.createZAdd)(key, membersAndScores, options));
     }
     /**
      * Increments the score of member in the sorted set stored at `key` by `increment`.
@@ -1320,7 +1320,7 @@ class BaseBatch {
      * If there was a conflict with the options, the operation aborts and `null` is returned.
      */
     zaddIncr(key, member, increment, options) {
-        return this.addAndReturn((0, Commands_1.createZAdd)(key, [{ element: member, score: increment }], options, true));
+        return this.addAndReturn((0, _1.createZAdd)(key, [{ element: member, score: increment }], options, true));
     }
     /**
      * Removes the specified members from the sorted set stored at `key`.
@@ -1335,7 +1335,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty sorted set, and this command returns 0.
      */
     zrem(key, members) {
-        return this.addAndReturn((0, Commands_1.createZRem)(key, members));
+        return this.addAndReturn((0, _1.createZRem)(key, members));
     }
     /**
      * Returns the cardinality (number of elements) of the sorted set stored at `key`.
@@ -1348,7 +1348,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty sorted set, and this command returns `0`.
      */
     zcard(key) {
-        return this.addAndReturn((0, Commands_1.createZCard)(key));
+        return this.addAndReturn((0, _1.createZCard)(key));
     }
     /**
      * Returns the cardinality of the intersection of the sorted sets specified by `keys`.
@@ -1363,7 +1363,7 @@ class BaseBatch {
      * Command Response - The cardinality of the intersection of the given sorted sets.
      */
     zintercard(keys, options) {
-        return this.addAndReturn((0, Commands_1.createZInterCard)(keys, options?.limit));
+        return this.addAndReturn((0, _1.createZInterCard)(keys, options?.limit));
     }
     /**
      * Returns the difference between the first sorted set and all the successive sorted sets.
@@ -1378,7 +1378,7 @@ class BaseBatch {
      * If the first key does not exist, it is treated as an empty sorted set, and the command returns an empty `array`.
      */
     zdiff(keys) {
-        return this.addAndReturn((0, Commands_1.createZDiff)(keys));
+        return this.addAndReturn((0, _1.createZDiff)(keys));
     }
     /**
      * Returns the difference between the first sorted set and all the successive sorted sets, with the associated
@@ -1394,7 +1394,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<number>`, see {@link GlideRecord}.
      */
     zdiffWithScores(keys) {
-        return this.addAndReturn((0, Commands_1.createZDiffWithScores)(keys));
+        return this.addAndReturn((0, _1.createZDiffWithScores)(keys));
     }
     /**
      * Calculates the difference between the first sorted set and all the successive sorted sets in `keys` and stores
@@ -1410,7 +1410,7 @@ class BaseBatch {
      * Command Response - The number of members in the resulting sorted set stored at `destination`.
      */
     zdiffstore(destination, keys) {
-        return this.addAndReturn((0, Commands_1.createZDiffStore)(destination, keys));
+        return this.addAndReturn((0, _1.createZDiffStore)(destination, keys));
     }
     /**
      * Returns the score of `member` in the sorted set stored at `key`.
@@ -1425,7 +1425,7 @@ class BaseBatch {
      * If `key` does not exist, null is returned.
      */
     zscore(key, member) {
-        return this.addAndReturn((0, Commands_1.createZScore)(key, member));
+        return this.addAndReturn((0, _1.createZScore)(key, member));
     }
     /**
      * Computes the union of sorted sets given by the specified `keys` and stores the result in `destination`.
@@ -1444,7 +1444,7 @@ class BaseBatch {
      * Command Response - The number of elements in the resulting sorted set stored at `destination`.
      */
     zunionstore(destination, keys, options) {
-        return this.addAndReturn((0, Commands_1.createZUnionStore)(destination, keys, options?.aggregationType));
+        return this.addAndReturn((0, _1.createZUnionStore)(destination, keys, options?.aggregationType));
     }
     /**
      * Returns the scores associated with the specified `members` in the sorted set stored at `key`.
@@ -1459,7 +1459,7 @@ class BaseBatch {
      * If a member does not exist in the sorted set, the corresponding value in the list will be `null`.
      */
     zmscore(key, members) {
-        return this.addAndReturn((0, Commands_1.createZMScore)(key, members));
+        return this.addAndReturn((0, _1.createZMScore)(key, members));
     }
     /**
      * Returns the number of members in the sorted set stored at `key` with scores between `minScore` and `maxScore`.
@@ -1475,7 +1475,7 @@ class BaseBatch {
      * If `minScore` is greater than `maxScore`, `0` is returned.
      */
     zcount(key, minScore, maxScore) {
-        return this.addAndReturn((0, Commands_1.createZCount)(key, minScore, maxScore));
+        return this.addAndReturn((0, _1.createZCount)(key, minScore, maxScore));
     }
     /**
      * Returns the specified range of elements in the sorted set stored at `key`.
@@ -1496,7 +1496,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty sorted set, and the command returns an empty array.
      */
     zrange(key, rangeQuery, reverse = false) {
-        return this.addAndReturn((0, Commands_1.createZRange)(key, rangeQuery, reverse));
+        return this.addAndReturn((0, _1.createZRange)(key, rangeQuery, reverse));
     }
     /**
      * Returns the specified range of elements with their scores in the sorted set stored at `key`.
@@ -1515,7 +1515,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<number>`, see {@link GlideRecord}.
      */
     zrangeWithScores(key, rangeQuery, reverse = false) {
-        return this.addAndReturn((0, Commands_1.createZRangeWithScores)(key, rangeQuery, reverse));
+        return this.addAndReturn((0, _1.createZRangeWithScores)(key, rangeQuery, reverse));
     }
     /**
      * Stores a specified range of elements from the sorted set at `source`, into a new
@@ -1536,7 +1536,7 @@ class BaseBatch {
      * Command Response - The number of elements in the resulting sorted set.
      */
     zrangeStore(destination, source, rangeQuery, reverse = false) {
-        return this.addAndReturn((0, Commands_1.createZRangeStore)(destination, source, rangeQuery, reverse));
+        return this.addAndReturn((0, _1.createZRangeStore)(destination, source, rangeQuery, reverse));
     }
     /**
      * Computes the intersection of sorted sets given by the specified `keys` and stores the result in `destination`.
@@ -1557,7 +1557,7 @@ class BaseBatch {
      * Command Response - The number of elements in the resulting sorted set stored at `destination`.
      */
     zinterstore(destination, keys, options) {
-        return this.addAndReturn((0, Commands_1.createZInterstore)(destination, keys, options?.aggregationType));
+        return this.addAndReturn((0, _1.createZInterstore)(destination, keys, options?.aggregationType));
     }
     /**
      * Computes the intersection of sorted sets given by the specified `keys` and returns a list of intersecting elements.
@@ -1573,7 +1573,7 @@ class BaseBatch {
      * Command Response - The resulting array of intersecting elements.
      */
     zinter(keys) {
-        return this.addAndReturn((0, Commands_1.createZInter)(keys));
+        return this.addAndReturn((0, _1.createZInter)(keys));
     }
     /**
      * Computes the intersection of sorted sets given by the specified `keys` and returns a list of intersecting elements with scores.
@@ -1596,7 +1596,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<number>`, see {@link GlideRecord}.
      */
     zinterWithScores(keys, options) {
-        return this.addAndReturn((0, Commands_1.createZInter)(keys, options?.aggregationType, true));
+        return this.addAndReturn((0, _1.createZInter)(keys, options?.aggregationType, true));
     }
     /**
      * Computes the union of sorted sets given by the specified `keys` and returns a list of union elements.
@@ -1612,7 +1612,7 @@ class BaseBatch {
      * Command Response - The resulting array with a union of sorted set elements.
      */
     zunion(keys) {
-        return this.addAndReturn((0, Commands_1.createZUnion)(keys));
+        return this.addAndReturn((0, _1.createZUnion)(keys));
     }
     /**
      * Computes the intersection of sorted sets given by the specified `keys` and returns a list of union elements with scores.
@@ -1633,7 +1633,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<number>`, see {@link GlideRecord}.
      */
     zunionWithScores(keys, options) {
-        return this.addAndReturn((0, Commands_1.createZUnion)(keys, options?.aggregationType, true));
+        return this.addAndReturn((0, _1.createZUnion)(keys, options?.aggregationType, true));
     }
     /**
      * Returns a random member from the sorted set stored at `key`.
@@ -1646,7 +1646,7 @@ class BaseBatch {
      *     If the sorted set does not exist or is empty, the response will be `null`.
      */
     zrandmember(key) {
-        return this.addAndReturn((0, Commands_1.createZRandMember)(key));
+        return this.addAndReturn((0, _1.createZRandMember)(key));
     }
     /**
      * Returns random members from the sorted set stored at `key`.
@@ -1662,7 +1662,7 @@ class BaseBatch {
      *     If the sorted set does not exist or is empty, the response will be an empty `array`.
      */
     zrandmemberWithCount(key, count) {
-        return this.addAndReturn((0, Commands_1.createZRandMember)(key, count));
+        return this.addAndReturn((0, _1.createZRandMember)(key, count));
     }
     /**
      * Returns random members with scores from the sorted set stored at `key`.
@@ -1678,7 +1678,7 @@ class BaseBatch {
      *     If the sorted set does not exist or is empty, the response will be an empty `array`.
      */
     zrandmemberWithCountWithScores(key, count) {
-        return this.addAndReturn((0, Commands_1.createZRandMember)(key, count, true));
+        return this.addAndReturn((0, _1.createZRandMember)(key, count, true));
     }
     /**
      * Returns the string representation of the type of the value stored at `key`.
@@ -1690,7 +1690,7 @@ class BaseBatch {
      * Command Response - If the key exists, the type of the stored value is returned. Otherwise, a "none" string is returned.
      */
     type(key) {
-        return this.addAndReturn((0, Commands_1.createType)(key));
+        return this.addAndReturn((0, _1.createType)(key));
     }
     /**
      * Returns the length of the string value stored at `key`.
@@ -1703,7 +1703,7 @@ class BaseBatch {
      * If `key` does not exist, it is treated as an empty string, and the command returns `0`.
      */
     strlen(key) {
-        return this.addAndReturn((0, Commands_1.createStrlen)(key));
+        return this.addAndReturn((0, _1.createStrlen)(key));
     }
     /**
      * Removes and returns the members with the lowest scores from the sorted set stored at `key`.
@@ -1721,7 +1721,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<number>`, see {@link GlideRecord}.
      */
     zpopmin(key, count) {
-        return this.addAndReturn((0, Commands_1.createZPopMin)(key, count));
+        return this.addAndReturn((0, _1.createZPopMin)(key, count));
     }
     /**
      * Blocks the connection until it removes and returns a member with the lowest score from the
@@ -1739,7 +1739,7 @@ class BaseBatch {
      *     If no member could be popped and the `timeout` expired, returns `null`.
      */
     bzpopmin(keys, timeout) {
-        return this.addAndReturn((0, Commands_1.createBZPopMin)(keys, timeout));
+        return this.addAndReturn((0, _1.createBZPopMin)(keys, timeout));
     }
     /**
      * Removes and returns the members with the highest scores from the sorted set stored at `key`.
@@ -1757,7 +1757,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<number>`, see {@link GlideRecord}.
      */
     zpopmax(key, count) {
-        return this.addAndReturn((0, Commands_1.createZPopMax)(key, count));
+        return this.addAndReturn((0, _1.createZPopMax)(key, count));
     }
     /**
      * Blocks the connection until it removes and returns a member with the highest score from the
@@ -1775,7 +1775,7 @@ class BaseBatch {
      *     If no member could be popped and the `timeout` expired, returns `null`.
      */
     bzpopmax(keys, timeout) {
-        return this.addAndReturn((0, Commands_1.createBZPopMax)(keys, timeout));
+        return this.addAndReturn((0, _1.createBZPopMax)(keys, timeout));
     }
     /**
      * Echoes the provided `message` back
@@ -1787,7 +1787,7 @@ class BaseBatch {
      * Command Response - The provided `message`.
      */
     echo(message) {
-        return this.addAndReturn((0, Commands_1.createEcho)(message));
+        return this.addAndReturn((0, _1.createEcho)(message));
     }
     /**
      * Returns the remaining time to live of `key` that has a timeout, in milliseconds.
@@ -1799,7 +1799,7 @@ class BaseBatch {
      * Command Response - TTL in milliseconds, `-2` if `key` does not exist, `-1` if `key` exists but has no associated expire.
      */
     pttl(key) {
-        return this.addAndReturn((0, Commands_1.createPTTL)(key));
+        return this.addAndReturn((0, _1.createPTTL)(key));
     }
     /**
      * Removes all elements in the sorted set stored at `key` with rank between `start` and `end`.
@@ -1818,7 +1818,7 @@ class BaseBatch {
      * If `key` does not exist 0 will be returned.
      */
     zremRangeByRank(key, start, end) {
-        return this.addAndReturn((0, Commands_1.createZRemRangeByRank)(key, start, end));
+        return this.addAndReturn((0, _1.createZRemRangeByRank)(key, start, end));
     }
     /**
      * Removes all elements in the sorted set stored at `key` with lexicographical order between `minLex` and `maxLex`.
@@ -1834,7 +1834,7 @@ class BaseBatch {
      * If `minLex` is greater than `maxLex`, 0 is returned.
      */
     zremRangeByLex(key, minLex, maxLex) {
-        return this.addAndReturn((0, Commands_1.createZRemRangeByLex)(key, minLex, maxLex));
+        return this.addAndReturn((0, _1.createZRemRangeByLex)(key, minLex, maxLex));
     }
     /**
      * Removes all elements in the sorted set stored at `key` with a score between `minScore` and `maxScore`.
@@ -1850,7 +1850,7 @@ class BaseBatch {
      * If `minScore` is greater than `maxScore`, 0 is returned.
      */
     zremRangeByScore(key, minScore, maxScore) {
-        return this.addAndReturn((0, Commands_1.createZRemRangeByScore)(key, minScore, maxScore));
+        return this.addAndReturn((0, _1.createZRemRangeByScore)(key, minScore, maxScore));
     }
     /**
      * Returns the number of members in the sorted set stored at 'key' with scores between 'minLex' and 'maxLex'.
@@ -1866,7 +1866,7 @@ class BaseBatch {
      * If maxLex is less than minLex, '0' is returned.
      */
     zlexcount(key, minLex, maxLex) {
-        return this.addAndReturn((0, Commands_1.createZLexCount)(key, minLex, maxLex));
+        return this.addAndReturn((0, _1.createZLexCount)(key, minLex, maxLex));
     }
     /**
      * Returns the rank of `member` in the sorted set stored at `key`, with scores ordered from low to high.
@@ -1881,7 +1881,7 @@ class BaseBatch {
      * If `key` doesn't exist, or if `member` is not present in the set, null will be returned.
      */
     zrank(key, member) {
-        return this.addAndReturn((0, Commands_1.createZRank)(key, member));
+        return this.addAndReturn((0, _1.createZRank)(key, member));
     }
     /**
      * Returns the rank of `member` in the sorted set stored at `key` with its score, where scores are ordered from the lowest to highest.
@@ -1896,7 +1896,7 @@ class BaseBatch {
      * If `key` doesn't exist, or if `member` is not present in the set, null will be returned.
      */
     zrankWithScore(key, member) {
-        return this.addAndReturn((0, Commands_1.createZRank)(key, member, true));
+        return this.addAndReturn((0, _1.createZRank)(key, member, true));
     }
     /**
      * Returns the rank of `member` in the sorted set stored at `key`, where
@@ -1912,7 +1912,7 @@ class BaseBatch {
      *     If `key` doesn't exist, or if `member` is not present in the set, `null` will be returned.
      */
     zrevrank(key, member) {
-        return this.addAndReturn((0, Commands_1.createZRevRank)(key, member));
+        return this.addAndReturn((0, _1.createZRevRank)(key, member));
     }
     /**
      * Returns the rank of `member` in the sorted set stored at `key` with its
@@ -1929,7 +1929,7 @@ class BaseBatch {
      *     If `key` doesn't exist, or if `member` is not present in the set, `null` will be returned.
      */
     zrevrankWithScore(key, member) {
-        return this.addAndReturn((0, Commands_1.createZRevRankWithScore)(key, member));
+        return this.addAndReturn((0, _1.createZRevRankWithScore)(key, member));
     }
     /**
      * Removes the existing timeout on `key`, turning the key from volatile (a key with an expire set) to
@@ -1942,7 +1942,7 @@ class BaseBatch {
      * Command Response - `false` if `key` does not exist or does not have an associated timeout, `true` if the timeout has been removed.
      */
     persist(key) {
-        return this.addAndReturn((0, Commands_1.createPersist)(key));
+        return this.addAndReturn((0, _1.createPersist)(key));
     }
     /** Executes a single command, without checking inputs. Every part of the command, including subcommands,
      *  should be added as a separate value in args.
@@ -1952,7 +1952,7 @@ class BaseBatch {
      * Command Response - A response from Valkey with an `Object`.
      */
     customCommand(args) {
-        return this.addAndReturn((0, Commands_1.createCustomCommand)(args));
+        return this.addAndReturn((0, _1.createCustomCommand)(args));
     }
     /** Returns the element at index `index` in the list stored at `key`.
      * The index is zero-based, so 0 means the first element, 1 the second element and so on.
@@ -1966,7 +1966,7 @@ class BaseBatch {
      * If `index` is out of range or if `key` does not exist, null is returned.
      */
     lindex(key, index) {
-        return this.addAndReturn((0, Commands_1.createLIndex)(key, index));
+        return this.addAndReturn((0, _1.createLIndex)(key, index));
     }
     /**
      * Inserts `element` in the list at `key` either before or after the `pivot`.
@@ -1984,7 +1984,7 @@ class BaseBatch {
      * If the `pivot` wasn't found, returns `0`.
      */
     linsert(key, position, pivot, element) {
-        return this.addAndReturn((0, Commands_1.createLInsert)(key, position, pivot, element));
+        return this.addAndReturn((0, _1.createLInsert)(key, position, pivot, element));
     }
     /**
      * Adds an entry to the specified stream stored at `key`. If the `key` doesn't exist, the stream is created.
@@ -1998,7 +1998,7 @@ class BaseBatch {
      * Command Response - The id of the added entry, or `null` if `options.makeStream` is set to `false` and no stream with the matching `key` exists.
      */
     xadd(key, values, options) {
-        return this.addAndReturn((0, Commands_1.createXAdd)(key, values, options));
+        return this.addAndReturn((0, _1.createXAdd)(key, values, options));
     }
     /**
      * Removes the specified entries by id from a stream, and returns the number of entries deleted.
@@ -2012,7 +2012,7 @@ class BaseBatch {
      *      `ids`, if the specified `ids` don't exist in the stream.
      */
     xdel(key, ids) {
-        return this.addAndReturn((0, Commands_1.createXDel)(key, ids));
+        return this.addAndReturn((0, _1.createXDel)(key, ids));
     }
     /**
      * Trims the stream stored at `key` by evicting older entries.
@@ -2024,7 +2024,7 @@ class BaseBatch {
      * Command Response - The number of entries deleted from the stream. If `key` doesn't exist, 0 is returned.
      */
     xtrim(key, options) {
-        return this.addAndReturn((0, Commands_1.createXTrim)(key, options));
+        return this.addAndReturn((0, _1.createXTrim)(key, options));
     }
     /**
      * Returns information about the stream stored at `key`.
@@ -2039,7 +2039,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<StreamEntries | GlideRecord<StreamEntries | GlideRecord<StreamEntries>[]>[]>`, see {@link GlideRecord}.
      */
     xinfoStream(key, fullOptions) {
-        return this.addAndReturn((0, Commands_1.createXInfoStream)(key, fullOptions ?? false));
+        return this.addAndReturn((0, _1.createXInfoStream)(key, fullOptions ?? false));
     }
     /**
      * Returns the list of all consumer groups and their attributes for the stream stored at `key`.
@@ -2053,7 +2053,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<GlideString | number | null>[]`, see {@link GlideRecord}.
      */
     xinfoGroups(key) {
-        return this.addAndReturn((0, Commands_1.createXInfoGroups)(key));
+        return this.addAndReturn((0, _1.createXInfoGroups)(key));
     }
     /**
      * Returns the server time.
@@ -2065,7 +2065,7 @@ class BaseBatch {
      * - The amount of microseconds already elapsed in the current second.
      */
     time() {
-        return this.addAndReturn((0, Commands_1.createTime)());
+        return this.addAndReturn((0, _1.createTime)());
     }
     /**
      * Returns stream entries matching a given range of entry IDs.
@@ -2088,7 +2088,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<[GlideString, GlideString][]> | null`, see {@link GlideRecord}.
      */
     xrange(key, start, end, count) {
-        return this.addAndReturn((0, Commands_1.createXRange)(key, start, end, count));
+        return this.addAndReturn((0, _1.createXRange)(key, start, end, count));
     }
     /**
      * Returns stream entries matching a given range of entry IDs in reverse order. Equivalent to {@link xrange} but returns the
@@ -2112,7 +2112,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<[GlideString, GlideString][]> | null`, see {@link GlideRecord}.
      */
     xrevrange(key, end, start, count) {
-        return this.addAndReturn((0, Commands_1.createXRevRange)(key, end, start, count));
+        return this.addAndReturn((0, _1.createXRevRange)(key, end, start, count));
     }
     /**
      * Reads entries from the given streams.
@@ -2131,7 +2131,7 @@ class BaseBatch {
                 return { key: e[0], value: e[1] };
             });
         }
-        return this.addAndReturn((0, Commands_1.createXRead)(keys_and_ids, options));
+        return this.addAndReturn((0, _1.createXRead)(keys_and_ids, options));
     }
     /**
      * Reads entries from the given streams owned by a consumer group.
@@ -2154,7 +2154,7 @@ class BaseBatch {
                 return { key: e[0], value: e[1] };
             });
         }
-        return this.addAndReturn((0, Commands_1.createXReadGroup)(group, consumer, keys_and_ids, options));
+        return this.addAndReturn((0, _1.createXReadGroup)(group, consumer, keys_and_ids, options));
     }
     /**
      * Returns the number of entries in the stream stored at `key`.
@@ -2166,7 +2166,7 @@ class BaseBatch {
      * Command Response - The number of entries in the stream. If `key` does not exist, returns `0`.
      */
     xlen(key) {
-        return this.addAndReturn((0, Commands_1.createXLen)(key));
+        return this.addAndReturn((0, _1.createXLen)(key));
     }
     /**
      * Returns stream message summary information for pending messages matching a given range of IDs.
@@ -2180,7 +2180,7 @@ class BaseBatch {
      *     See example of {@link BaseClient.xpending|xpending} for more details.
      */
     xpending(key, group) {
-        return this.addAndReturn((0, Commands_1.createXPending)(key, group));
+        return this.addAndReturn((0, _1.createXPending)(key, group));
     }
     /**
      * Returns stream message summary information for pending messages matching a given range of IDs.
@@ -2195,7 +2195,7 @@ class BaseBatch {
      * See example of {@link BaseClient.xpendingWithOptions|xpendingWithOptions} for more details.
      */
     xpendingWithOptions(key, group, options) {
-        return this.addAndReturn((0, Commands_1.createXPending)(key, group, options));
+        return this.addAndReturn((0, _1.createXPending)(key, group, options));
     }
     /**
      * Returns the list of all consumers and their attributes for the given consumer group of the
@@ -2208,7 +2208,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<GlideString | number>[]`, see {@link GlideRecord}.
      */
     xinfoConsumers(key, group) {
-        return this.addAndReturn((0, Commands_1.createXInfoConsumers)(key, group));
+        return this.addAndReturn((0, _1.createXInfoConsumers)(key, group));
     }
     /**
      * Changes the ownership of a pending message.
@@ -2226,7 +2226,7 @@ class BaseBatch {
      *     The response comes in format `GlideRecord<[GlideString, GlideString][]>`, see {@link GlideRecord}.
      */
     xclaim(key, group, consumer, minIdleTime, ids, options) {
-        return this.addAndReturn((0, Commands_1.createXClaim)(key, group, consumer, minIdleTime, ids, options));
+        return this.addAndReturn((0, _1.createXClaim)(key, group, consumer, minIdleTime, ids, options));
     }
     /**
      * Changes the ownership of a pending message. This function returns an `array` with
@@ -2244,7 +2244,7 @@ class BaseBatch {
      * Command Response - An `array` of message ids claimed by the consumer.
      */
     xclaimJustId(key, group, consumer, minIdleTime, ids, options) {
-        return this.addAndReturn((0, Commands_1.createXClaim)(key, group, consumer, minIdleTime, ids, options, true));
+        return this.addAndReturn((0, _1.createXClaim)(key, group, consumer, minIdleTime, ids, options, true));
     }
     /**
      * Transfers ownership of pending stream entries that match the specified criteria.
@@ -2273,7 +2273,7 @@ class BaseBatch {
      *     The response comes in format `[GlideString, GlideRecord<[GlideString, GlideString][]>, GlideString[]?]`, see {@link GlideRecord}.
      */
     xautoclaim(key, group, consumer, minIdleTime, start, options) {
-        return this.addAndReturn((0, Commands_1.createXAutoClaim)(key, group, consumer, minIdleTime, start, options?.count));
+        return this.addAndReturn((0, _1.createXAutoClaim)(key, group, consumer, minIdleTime, start, options?.count));
     }
     /**
      * Transfers ownership of pending stream entries that match the specified criteria.
@@ -2300,7 +2300,7 @@ class BaseBatch {
      *     These IDs are deleted from the Pending Entries List.
      */
     xautoclaimJustId(key, group, consumer, minIdleTime, start, options) {
-        return this.addAndReturn((0, Commands_1.createXAutoClaim)(key, group, consumer, minIdleTime, start, options?.count, true));
+        return this.addAndReturn((0, _1.createXAutoClaim)(key, group, consumer, minIdleTime, start, options?.count, true));
     }
     /**
      * Creates a new consumer group uniquely identified by `groupname` for the stream
@@ -2317,7 +2317,7 @@ class BaseBatch {
      * Command Response - `"OK"`.
      */
     xgroupCreate(key, groupName, id, options) {
-        return this.addAndReturn((0, Commands_1.createXGroupCreate)(key, groupName, id, options));
+        return this.addAndReturn((0, _1.createXGroupCreate)(key, groupName, id, options));
     }
     /**
      * Destroys the consumer group `groupname` for the stream stored at `key`.
@@ -2330,7 +2330,7 @@ class BaseBatch {
      * Command Response - `true` if the consumer group is destroyed. Otherwise, `false`.
      */
     xgroupDestroy(key, groupName) {
-        return this.addAndReturn((0, Commands_1.createXGroupDestroy)(key, groupName));
+        return this.addAndReturn((0, _1.createXGroupDestroy)(key, groupName));
     }
     /**
      * Creates a consumer named `consumerName` in the consumer group `groupName` for the stream stored at `key`.
@@ -2344,7 +2344,7 @@ class BaseBatch {
      * Command Response - `true` if the consumer is created. Otherwise, returns `false`.
      */
     xgroupCreateConsumer(key, groupName, consumerName) {
-        return this.addAndReturn((0, Commands_1.createXGroupCreateConsumer)(key, groupName, consumerName));
+        return this.addAndReturn((0, _1.createXGroupCreateConsumer)(key, groupName, consumerName));
     }
     /**
      * Deletes a consumer named `consumerName` in the consumer group `groupName` for the stream stored at `key`.
@@ -2358,7 +2358,7 @@ class BaseBatch {
      * Command Response - The number of pending messages the `consumer` had before it was deleted.
      */
     xgroupDelConsumer(key, groupName, consumerName) {
-        return this.addAndReturn((0, Commands_1.createXGroupDelConsumer)(key, groupName, consumerName));
+        return this.addAndReturn((0, _1.createXGroupDelConsumer)(key, groupName, consumerName));
     }
     /**
      * Returns the number of messages that were successfully acknowledged by the consumer group member of a stream.
@@ -2373,7 +2373,7 @@ class BaseBatch {
      * Command Response - The number of messages that were successfully acknowledged.
      */
     xack(key, group, ids) {
-        return this.addAndReturn((0, Commands_1.createXAck)(key, group, ids));
+        return this.addAndReturn((0, _1.createXAck)(key, group, ids));
     }
     /**
      * Sets the last delivered ID for a consumer group.
@@ -2390,7 +2390,7 @@ class BaseBatch {
      * Command Response - `"OK"`.
      */
     xgroupSetId(key, groupName, id, options) {
-        return this.addAndReturn((0, Commands_1.createXGroupSetid)(key, groupName, id, options?.entriesRead));
+        return this.addAndReturn((0, _1.createXGroupSetid)(key, groupName, id, options?.entriesRead));
     }
     /**
      * Renames `key` to `newkey`.
@@ -2404,7 +2404,7 @@ class BaseBatch {
      * Command Response - If the `key` was successfully renamed, return "OK". If `key` does not exist, an error is thrown.
      */
     rename(key, newKey) {
-        return this.addAndReturn((0, Commands_1.createRename)(key, newKey));
+        return this.addAndReturn((0, _1.createRename)(key, newKey));
     }
     /**
      * Renames `key` to `newkey` if `newkey` does not yet exist.
@@ -2418,7 +2418,7 @@ class BaseBatch {
      *     If `key` does not exist, an error is thrown.
      */
     renamenx(key, newKey) {
-        return this.addAndReturn((0, Commands_1.createRenameNX)(key, newKey));
+        return this.addAndReturn((0, _1.createRenameNX)(key, newKey));
     }
     /** Blocking list pop primitive.
      * Pop an element from the tail of the first list that is non-empty,
@@ -2435,7 +2435,7 @@ class BaseBatch {
      * formatted as [key, value]. If no element could be popped and the timeout expired, returns `null`.
      */
     brpop(keys, timeout) {
-        return this.addAndReturn((0, Commands_1.createBRPop)(keys, timeout));
+        return this.addAndReturn((0, _1.createBRPop)(keys, timeout));
     }
     /** Blocking list pop primitive.
      * Pop an element from the head of the first list that is non-empty,
@@ -2452,7 +2452,7 @@ class BaseBatch {
      * formatted as [key, value]. If no element could be popped and the timeout expired, returns `null`.
      */
     blpop(keys, timeout) {
-        return this.addAndReturn((0, Commands_1.createBLPop)(keys, timeout));
+        return this.addAndReturn((0, _1.createBLPop)(keys, timeout));
     }
     /** Adds all elements to the HyperLogLog data structure stored at the specified `key`.
      * Creates a new structure if the `key` does not exist.
@@ -2463,10 +2463,10 @@ class BaseBatch {
      * @param key - The key of the HyperLogLog data structure to add elements into.
      * @param elements - An array of members to add to the HyperLogLog stored at `key`.
      * Command Response - If the HyperLogLog is newly created, or if the HyperLogLog approximated cardinality is
-     *     altered, then returns `1`. Otherwise, returns `0`.
+     *     altered, then returns `true`. Otherwise, returns `false`.
      */
     pfadd(key, elements) {
-        return this.addAndReturn((0, Commands_1.createPfAdd)(key, elements));
+        return this.addAndReturn((0, _1.createPfAdd)(key, elements));
     }
     /** Estimates the cardinality of the data stored in a HyperLogLog structure for a single key or
      * calculates the combined cardinality of multiple keys by merging their HyperLogLogs temporarily.
@@ -2478,7 +2478,7 @@ class BaseBatch {
      *     The cardinality of a key that does not exist is `0`.
      */
     pfcount(keys) {
-        return this.addAndReturn((0, Commands_1.createPfCount)(keys));
+        return this.addAndReturn((0, _1.createPfCount)(keys));
     }
     /**
      * Merges multiple HyperLogLog values into a unique value. If the destination variable exists, it is
@@ -2491,7 +2491,7 @@ class BaseBatch {
      * Command Response - A simple "OK" response.
      */
     pfmerge(destination, sourceKeys) {
-        return this.addAndReturn((0, Commands_1.createPfMerge)(destination, sourceKeys));
+        return this.addAndReturn((0, _1.createPfMerge)(destination, sourceKeys));
     }
     /**
      * Returns the internal encoding for the Valkey object stored at `key`.
@@ -2504,7 +2504,7 @@ class BaseBatch {
      *     Otherwise, returns None.
      */
     objectEncoding(key) {
-        return this.addAndReturn((0, Commands_1.createObjectEncoding)(key));
+        return this.addAndReturn((0, _1.createObjectEncoding)(key));
     }
     /**
      * Returns the logarithmic access frequency counter of a Valkey object stored at `key`.
@@ -2517,7 +2517,7 @@ class BaseBatch {
      *     the object stored at `key` as a `number`. Otherwise, returns `null`.
      */
     objectFreq(key) {
-        return this.addAndReturn((0, Commands_1.createObjectFreq)(key));
+        return this.addAndReturn((0, _1.createObjectFreq)(key));
     }
     /**
      * Returns the time in seconds since the last access to the value stored at `key`.
@@ -2529,7 +2529,7 @@ class BaseBatch {
      * Command Response - If `key` exists, returns the idle time in seconds. Otherwise, returns `null`.
      */
     objectIdletime(key) {
-        return this.addAndReturn((0, Commands_1.createObjectIdletime)(key));
+        return this.addAndReturn((0, _1.createObjectIdletime)(key));
     }
     /**
      * Returns the reference count of the object stored at `key`.
@@ -2542,7 +2542,7 @@ class BaseBatch {
      *     Otherwise, returns `null`.
      */
     objectRefcount(key) {
-        return this.addAndReturn((0, Commands_1.createObjectRefcount)(key));
+        return this.addAndReturn((0, _1.createObjectRefcount)(key));
     }
     /**
      * Displays a piece of generative computer art and the server version.
@@ -2554,7 +2554,7 @@ class BaseBatch {
      * Command Response - A piece of generative computer art along with the current server version.
      */
     lolwut(options) {
-        return this.addAndReturn((0, Commands_1.createLolwut)(options));
+        return this.addAndReturn((0, _1.createLolwut)(options));
     }
     /**
      * Blocks the current client until all the previous write commands are successfully transferred and
@@ -2570,7 +2570,7 @@ class BaseBatch {
      *     current connection.
      */
     wait(numreplicas, timeout) {
-        return this.addAndReturn((0, Commands_1.createWait)(numreplicas, timeout));
+        return this.addAndReturn((0, _1.createWait)(numreplicas, timeout));
     }
     /**
      * Invokes a previously loaded function.
@@ -2586,7 +2586,7 @@ class BaseBatch {
      * Command Response - The invoked function's return value.
      */
     fcall(func, keys, args) {
-        return this.addAndReturn((0, Commands_1.createFCall)(func, keys, args));
+        return this.addAndReturn((0, _1.createFCall)(func, keys, args));
     }
     /**
      * Invokes a previously loaded read-only function.
@@ -2602,7 +2602,7 @@ class BaseBatch {
      * Command Response - The invoked function's return value.
      */
     fcallReadonly(func, keys, args) {
-        return this.addAndReturn((0, Commands_1.createFCallReadOnly)(func, keys, args));
+        return this.addAndReturn((0, _1.createFCallReadOnly)(func, keys, args));
     }
     /**
      * Deletes a library and all its functions.
@@ -2615,7 +2615,7 @@ class BaseBatch {
      * Command Response - `"OK"`.
      */
     functionDelete(libraryCode) {
-        return this.addAndReturn((0, Commands_1.createFunctionDelete)(libraryCode));
+        return this.addAndReturn((0, _1.createFunctionDelete)(libraryCode));
     }
     /**
      * Loads a library to Valkey.
@@ -2630,7 +2630,7 @@ class BaseBatch {
      * Command Response - The library name that was loaded.
      */
     functionLoad(libraryCode, replace) {
-        return this.addAndReturn((0, Commands_1.createFunctionLoad)(libraryCode, replace));
+        return this.addAndReturn((0, _1.createFunctionLoad)(libraryCode, replace));
     }
     /**
      * Deletes all function libraries.
@@ -2642,7 +2642,7 @@ class BaseBatch {
      * Command Response - `"OK"`.
      */
     functionFlush(mode) {
-        return this.addAndReturn((0, Commands_1.createFunctionFlush)(mode));
+        return this.addAndReturn((0, _1.createFunctionFlush)(mode));
     }
     /**
      * Returns information about the functions and libraries.
@@ -2655,7 +2655,7 @@ class BaseBatch {
      * Command Response - Info about all or selected libraries and their functions in {@link FunctionListResponse} format.
      */
     functionList(options) {
-        return this.addAndReturn((0, Commands_1.createFunctionList)(options));
+        return this.addAndReturn((0, _1.createFunctionList)(options));
     }
     /**
      * Returns information about the function that's currently running and information about the
@@ -2670,7 +2670,7 @@ class BaseBatch {
      * - `"engines"` with information about available engines and their stats.
      */
     functionStats() {
-        return this.addAndReturn((0, Commands_1.createFunctionStats)());
+        return this.addAndReturn((0, _1.createFunctionStats)());
     }
     /**
      * Returns the serialized payload of all loaded libraries.
@@ -2682,7 +2682,7 @@ class BaseBatch {
      * Command Response - The serialized payload of all loaded libraries.
      */
     functionDump() {
-        return this.addAndReturn((0, Commands_1.createFunctionDump)());
+        return this.addAndReturn((0, _1.createFunctionDump)());
     }
     /**
      * Restores libraries from the serialized payload returned by {@link functionDump}.
@@ -2696,7 +2696,7 @@ class BaseBatch {
      * Command Response - `"OK"`.
      */
     functionRestore(payload, policy) {
-        return this.addAndReturn((0, Commands_1.createFunctionRestore)(payload, policy));
+        return this.addAndReturn((0, _1.createFunctionRestore)(payload, policy));
     }
     /**
      * Deletes all the keys of all the existing databases. This command never fails.
@@ -2708,7 +2708,7 @@ class BaseBatch {
      * Command Response - `"OK"`.
      */
     flushall(mode) {
-        return this.addAndReturn((0, Commands_1.createFlushAll)(mode));
+        return this.addAndReturn((0, _1.createFlushAll)(mode));
     }
     /**
      * Deletes all the keys of the currently selected database. This command never fails.
@@ -2720,7 +2720,7 @@ class BaseBatch {
      * Command Response - `"OK"`.
      */
     flushdb(mode) {
-        return this.addAndReturn((0, Commands_1.createFlushDB)(mode));
+        return this.addAndReturn((0, _1.createFlushDB)(mode));
     }
     /**
      * Returns the index of the first occurrence of `element` inside the list specified by `key`. If no
@@ -2738,7 +2738,7 @@ class BaseBatch {
      * option is specified, then the function returns an `array` of indices of matching elements within the list.
      */
     lpos(key, element, options) {
-        return this.addAndReturn((0, Commands_1.createLPos)(key, element, options));
+        return this.addAndReturn((0, _1.createLPos)(key, element, options));
     }
     /**
      * Returns the number of keys in the currently selected database.
@@ -2748,7 +2748,7 @@ class BaseBatch {
      * Command Response - The number of keys in the currently selected database.
      */
     dbsize() {
-        return this.addAndReturn((0, Commands_1.createDBSize)());
+        return this.addAndReturn((0, _1.createDBSize)());
     }
     /**
      * Counts the number of set bits (population counting) in the string stored at `key`. The `options` argument can
@@ -2764,7 +2764,7 @@ class BaseBatch {
      *     Otherwise, if `key` is missing, returns `0` as it is treated as an empty string.
      */
     bitcount(key, options) {
-        return this.addAndReturn((0, Commands_1.createBitCount)(key, options));
+        return this.addAndReturn((0, _1.createBitCount)(key, options));
     }
     /**
      * Adds geospatial members with their positions to the specified sorted set stored at `key`.
@@ -2782,7 +2782,7 @@ class BaseBatch {
      *    `true` in the options, returns the number of elements updated in the sorted set.
      */
     geoadd(key, membersToGeospatialData, options) {
-        return this.addAndReturn((0, Commands_1.createGeoAdd)(key, membersToGeospatialData, options));
+        return this.addAndReturn((0, _1.createGeoAdd)(key, membersToGeospatialData, options));
     }
     /**
      * Returns the members of a sorted set populated with geospatial information using {@link geoadd},
@@ -2816,7 +2816,7 @@ class BaseBatch {
      * - The coordinates as a two item `array` of floating point `number`s.
      */
     geosearch(key, searchFrom, searchBy, resultOptions) {
-        return this.addAndReturn((0, Commands_1.createGeoSearch)(key, searchFrom, searchBy, resultOptions));
+        return this.addAndReturn((0, _1.createGeoSearch)(key, searchFrom, searchBy, resultOptions));
     }
     /**
      * Searches for members in a sorted set stored at `source` representing geospatial data
@@ -2842,7 +2842,7 @@ class BaseBatch {
      * Command Response - The number of elements in the resulting sorted set stored at `destination`.
      */
     geosearchstore(destination, source, searchFrom, searchBy, resultOptions) {
-        return this.addAndReturn((0, Commands_1.createGeoSearchStore)(destination, source, searchFrom, searchBy, resultOptions));
+        return this.addAndReturn((0, _1.createGeoSearchStore)(destination, source, searchFrom, searchBy, resultOptions));
     }
     /**
      * Returns the positions (longitude, latitude) of all the specified `members` of the
@@ -2858,7 +2858,7 @@ class BaseBatch {
      *     If a member does not exist, its position will be `null`.
      */
     geopos(key, members) {
-        return this.addAndReturn((0, Commands_1.createGeoPos)(key, members));
+        return this.addAndReturn((0, _1.createGeoPos)(key, members));
     }
     /**
      * Pops member-score pairs from the first non-empty sorted set, with the given `keys`
@@ -2877,7 +2877,7 @@ class BaseBatch {
      *     If no member could be popped, returns `null`.
      */
     zmpop(keys, modifier, count) {
-        return this.addAndReturn((0, Commands_1.createZMPop)(keys, modifier, count));
+        return this.addAndReturn((0, _1.createZMPop)(keys, modifier, count));
     }
     /**
      * Pops a member-score pair from the first non-empty sorted set, with the given `keys` being
@@ -2899,7 +2899,7 @@ class BaseBatch {
      *     If no member could be popped, returns `null`.
      */
     bzmpop(keys, modifier, timeout, count) {
-        return this.addAndReturn((0, Commands_1.createBZMPop)(keys, modifier, timeout, count));
+        return this.addAndReturn((0, _1.createBZMPop)(keys, modifier, timeout, count));
     }
     /**
      * Increments the score of `member` in the sorted set stored at `key` by `increment`.
@@ -2915,7 +2915,7 @@ class BaseBatch {
      * Command Response - The new score of `member`.
      */
     zincrby(key, increment, member) {
-        return this.addAndReturn((0, Commands_1.createZIncrBy)(key, increment, member));
+        return this.addAndReturn((0, _1.createZIncrBy)(key, increment, member));
     }
     /**
      * Iterates incrementally over a sorted set.
@@ -2935,7 +2935,7 @@ class BaseBatch {
      *      If `options.noScores` is to `true`, the second element will only contain the members without scores.
      */
     zscan(key, cursor, options) {
-        return this.addAndReturn((0, Commands_1.createZScan)(key, cursor, options));
+        return this.addAndReturn((0, _1.createZScan)(key, cursor, options));
     }
     /**
      * Returns the distance between `member1` and `member2` saved in the geospatial index stored at `key`.
@@ -2953,7 +2953,7 @@ class BaseBatch {
      *     or if the key does not exist.
      */
     geodist(key, member1, member2, options) {
-        return this.addAndReturn((0, Commands_1.createGeoDist)(key, member1, member2, options?.unit));
+        return this.addAndReturn((0, _1.createGeoDist)(key, member1, member2, options?.unit));
     }
     /**
      * Returns the `GeoHash` strings representing the positions of all the specified `members` in the sorted set stored at `key`.
@@ -2967,7 +2967,7 @@ class BaseBatch {
      *   If a member does not exist in the sorted set, a `null` value is returned for that member.
      */
     geohash(key, members) {
-        return this.addAndReturn((0, Commands_1.createGeoHash)(key, members));
+        return this.addAndReturn((0, _1.createGeoHash)(key, members));
     }
     /**
      * Returns `UNIX TIME` of the last DB save timestamp or startup timestamp if no save
@@ -2978,7 +2978,7 @@ class BaseBatch {
      * Command Response - `UNIX TIME` of the last DB save executed with success.
      */
     lastsave() {
-        return this.addAndReturn((0, Commands_1.createLastSave)());
+        return this.addAndReturn((0, _1.createLastSave)());
     }
     /**
      * Returns all the longest common subsequences combined between strings stored at `key1` and `key2`.
@@ -2993,7 +2993,7 @@ class BaseBatch {
      *     An empty `String` is returned if the keys do not exist or have no common subsequences.
      */
     lcs(key1, key2) {
-        return this.addAndReturn((0, Commands_1.createLCS)(key1, key2));
+        return this.addAndReturn((0, _1.createLCS)(key1, key2));
     }
     /**
      * Returns the total length of all the longest common subsequences between strings stored at `key1` and `key2`.
@@ -3007,7 +3007,7 @@ class BaseBatch {
      * Command Response - The total length of all the longest common subsequences between the 2 strings.
      */
     lcsLen(key1, key2) {
-        return this.addAndReturn((0, Commands_1.createLCS)(key1, key2, { len: true }));
+        return this.addAndReturn((0, _1.createLCS)(key1, key2, { len: true }));
     }
     /**
      * Returns the indices and lengths of the longest common subsequences between strings stored at
@@ -3034,7 +3034,7 @@ class BaseBatch {
      *     See example of {@link BaseClient.lcsIdx|lcsIdx} for more details.
      */
     lcsIdx(key1, key2, options) {
-        return this.addAndReturn((0, Commands_1.createLCS)(key1, key2, { idx: options ?? {} }));
+        return this.addAndReturn((0, _1.createLCS)(key1, key2, { idx: options ?? {} }));
     }
     /**
      * Updates the last access time of the specified keys.
@@ -3046,7 +3046,7 @@ class BaseBatch {
      * Command Response - The number of keys that were updated. A key is ignored if it doesn't exist.
      */
     touch(keys) {
-        return this.addAndReturn((0, Commands_1.createTouch)(keys));
+        return this.addAndReturn((0, _1.createTouch)(keys));
     }
     /**
      * Returns a random existing key name from the currently selected database.
@@ -3056,7 +3056,7 @@ class BaseBatch {
      * Command Response - A random existing key name from the currently selected database.
      */
     randomKey() {
-        return this.addAndReturn((0, Commands_1.createRandomKey)());
+        return this.addAndReturn((0, _1.createRandomKey)());
     }
     /**
      * Overwrites part of the string stored at `key`, starting at the specified byte `offset`,
@@ -3072,7 +3072,7 @@ class BaseBatch {
      * Command Response - The length of the string stored at `key` after it was modified.
      */
     setrange(key, offset, value) {
-        return this.addAndReturn((0, Commands_1.createSetRange)(key, offset, value));
+        return this.addAndReturn((0, _1.createSetRange)(key, offset, value));
     }
     /**
      * Appends a `value` to a `key`. If `key` does not exist it is created and set as an empty string,
@@ -3086,7 +3086,7 @@ class BaseBatch {
      * Command Response - The length of the string after appending the value.
      */
     append(key, value) {
-        return this.addAndReturn((0, Commands_1.createAppend)(key, value));
+        return this.addAndReturn((0, _1.createAppend)(key, value));
     }
     /**
      * Pops one or more elements from the first non-empty list from the provided `keys`.
@@ -3102,7 +3102,7 @@ class BaseBatch {
      *     If no member could be popped, returns `null`.
      */
     lmpop(keys, direction, count) {
-        return this.addAndReturn((0, Commands_1.createLMPop)(keys, direction, count));
+        return this.addAndReturn((0, _1.createLMPop)(keys, direction, count));
     }
     /**
      * Blocks the connection until it pops one or more elements from the first non-empty list from the
@@ -3121,7 +3121,7 @@ class BaseBatch {
      *     If no member could be popped and the timeout expired, returns `null`.
      */
     blmpop(keys, direction, timeout, count) {
-        return this.addAndReturn((0, Commands_1.createBLMPop)(keys, direction, timeout, count));
+        return this.addAndReturn((0, _1.createBLMPop)(keys, direction, timeout, count));
     }
     /**
      * Lists the currently active channels.
@@ -3135,7 +3135,7 @@ class BaseBatch {
      *          If no pattern is specified, all active channels are returned.
      */
     pubsubChannels(pattern) {
-        return this.addAndReturn((0, Commands_1.createPubSubChannels)(pattern));
+        return this.addAndReturn((0, _1.createPubSubChannels)(pattern));
     }
     /**
      * Returns the number of unique patterns that are subscribed to by clients.
@@ -3149,7 +3149,7 @@ class BaseBatch {
      * Command Response - The number of unique patterns.
      */
     pubsubNumPat() {
-        return this.addAndReturn((0, Commands_1.createPubSubNumPat)());
+        return this.addAndReturn((0, _1.createPubSubNumPat)());
     }
     /**
      * Returns the number of subscribers (exclusive of clients subscribed to patterns) for the specified channels.
@@ -3161,7 +3161,7 @@ class BaseBatch {
      * Command Response - A list of the channel names and their numbers of subscribers.
      */
     pubsubNumSub(channels) {
-        return this.addAndReturn((0, Commands_1.createPubSubNumSub)(channels));
+        return this.addAndReturn((0, _1.createPubSubNumSub)(channels));
     }
     /**
      * Sorts the elements in the list, set, or sorted set at `key` and returns the result.
@@ -3182,7 +3182,7 @@ class BaseBatch {
      * Command Response - An `Array` of sorted elements.
      */
     sort(key, options) {
-        return this.addAndReturn((0, Commands_1.createSort)(key, options));
+        return this.addAndReturn((0, _1.createSort)(key, options));
     }
     /**
      * Sorts the elements in the list, set, or sorted set at `key` and returns the result.
@@ -3203,7 +3203,7 @@ class BaseBatch {
      * Command Response - An `Array` of sorted elements
      */
     sortReadOnly(key, options) {
-        return this.addAndReturn((0, Commands_1.createSortReadOnly)(key, options));
+        return this.addAndReturn((0, _1.createSortReadOnly)(key, options));
     }
     /**
      * Sorts the elements in the list, set, or sorted set at `key` and stores the result in
@@ -3226,7 +3226,7 @@ class BaseBatch {
      * Command Response - The number of elements in the sorted key stored at `destination`.
      */
     sortStore(key, destination, options) {
-        return this.addAndReturn((0, Commands_1.createSort)(key, options, destination));
+        return this.addAndReturn((0, _1.createSort)(key, options, destination));
     }
 }
 exports.BaseBatch = BaseBatch;
@@ -3282,7 +3282,7 @@ class Batch extends BaseBatch {
      * Command Response - A simple `"OK"` response.
      */
     select(index) {
-        return this.addAndReturn((0, Commands_1.createSelect)(index));
+        return this.addAndReturn((0, _1.createSelect)(index));
     }
     /**
      * Copies the value stored at the `source` to the `destination` key. If `destinationDB` is specified,
@@ -3303,7 +3303,7 @@ class Batch extends BaseBatch {
      * Command Response - `true` if `source` was copied, `false` if the `source` was not copied.
      */
     copy(source, destination, options) {
-        return this.addAndReturn((0, Commands_1.createCopy)(source, destination, options));
+        return this.addAndReturn((0, _1.createCopy)(source, destination, options));
     }
     /**
      * Move `key` from the currently selected database to the database specified by `dbIndex`.
@@ -3317,7 +3317,7 @@ class Batch extends BaseBatch {
      *     database or does not exist in the source database.
      */
     move(key, dbIndex) {
-        return this.addAndReturn((0, Commands_1.createMove)(key, dbIndex));
+        return this.addAndReturn((0, _1.createMove)(key, dbIndex));
     }
     /** Publish a message on pubsub channel.
      *
@@ -3330,7 +3330,7 @@ class Batch extends BaseBatch {
      * Note that this value does not include subscriptions that configured on replicas.
      */
     publish(message, channel) {
-        return this.addAndReturn((0, Commands_1.createPublish)(message, channel));
+        return this.addAndReturn((0, _1.createPublish)(message, channel));
     }
 }
 exports.Batch = Batch;
@@ -3389,7 +3389,7 @@ class ClusterBatch extends BaseBatch {
      * Command Response - `true` if `source` was copied, `false` if the `source` was not copied.
      */
     copy(source, destination, options) {
-        return this.addAndReturn((0, Commands_1.createCopy)(source, destination, options));
+        return this.addAndReturn((0, _1.createCopy)(source, destination, options));
     }
     /** Publish a message on pubsub channel.
      * This command aggregates PUBLISH and SPUBLISH commands functionalities.
@@ -3405,7 +3405,7 @@ class ClusterBatch extends BaseBatch {
      * Command Response -  Number of subscriptions in primary node that received the message.
      */
     publish(message, channel, sharded = false) {
-        return this.addAndReturn((0, Commands_1.createPublish)(message, channel, sharded));
+        return this.addAndReturn((0, _1.createPublish)(message, channel, sharded));
     }
     /**
      * Lists the currently active shard channels.
@@ -3420,7 +3420,7 @@ class ClusterBatch extends BaseBatch {
      *          If no pattern is specified, all active shard channels are returned.
      */
     pubsubShardChannels(pattern) {
-        return this.addAndReturn((0, Commands_1.createPubsubShardChannels)(pattern));
+        return this.addAndReturn((0, _1.createPubsubShardChannels)(pattern));
     }
     /**
      * Returns the number of subscribers (exclusive of clients subscribed to patterns) for the specified shard channels.
@@ -3433,7 +3433,7 @@ class ClusterBatch extends BaseBatch {
      * Command Response - A list of the shard channel names and their numbers of subscribers.
      */
     pubsubShardNumSub(channels) {
-        return this.addAndReturn((0, Commands_1.createPubSubShardNumSub)(channels));
+        return this.addAndReturn((0, _1.createPubSubShardNumSub)(channels));
     }
 }
 exports.ClusterBatch = ClusterBatch;