From 833330c1250961922e3784631176f292a6969d2d Mon Sep 17 00:00:00 2001
From: Carlos Miranda <carlos.m.miranda@gmail.com>
Date: Fri, 14 May 2021 00:18:48 -0300
Subject: [PATCH] Fix commands with arg seq

The way to reserve space for a seq is with newSeqOfCap.
---
 src/redis.nim | 24 ++++++++----------------
 1 file changed, 8 insertions(+), 16 deletions(-)

diff --git a/src/redis.nim b/src/redis.nim
index 08ff951..5816917 100644
--- a/src/redis.nim
+++ b/src/redis.nim
@@ -549,8 +549,7 @@ proc bitCount*(r: Redis | AsyncRedis, key: string, limits: seq[string]): Future[
 
 proc bitPos*(r: Redis | AsyncRedis, key: string, bit: int, limits: seq[string]): Future[RedisInteger] {.multisync.} =
   ## Returns position of the first occurence of bit within limits
-  var parameters: seq[string]
-  newSeq(parameters, len(limits) + 1)
+  var parameters = newSeqOfCap[string](len(limits) + 1)
   parameters.add($bit)
   parameters.add(limits)
 
@@ -699,8 +698,7 @@ proc hVals*(r: Redis | AsyncRedis, key: string): Future[RedisList] {.multisync.}
 proc bLPop*(r: Redis | AsyncRedis, keys: seq[string], timeout: int): Future[RedisList] {.multisync.} =
   ## Remove and get the *first* element in a list, or block until
   ## one is available
-  var args: seq[string]
-  newSeq(args, len(keys) + 1)
+  var args = newSeqOfCap[string](len(keys) + 1)
   for i in items(keys):
     args.add(i)
 
@@ -712,8 +710,7 @@ proc bLPop*(r: Redis | AsyncRedis, keys: seq[string], timeout: int): Future[Redi
 proc bRPop*(r: Redis | AsyncRedis, keys: seq[string], timeout: int): Future[RedisList] {.multisync.} =
   ## Remove and get the *last* element in a list, or block until one
   ## is available.
-  var args: seq[string]
-  newSeq(args, len(keys) + 1)
+  var args = newSeqOfCap[string](len(keys) + 1)
   for i in items(keys):
     args.add(i)
 
@@ -942,9 +939,8 @@ proc zinterstore*(r: Redis | AsyncRedis, destination: string, numkeys: string,
                  aggregate: string = ""): Future[RedisInteger] {.multisync.} =
   ## Intersect multiple sorted sets and store the resulting sorted set in
   ## a new key
-  var args: seq[string]
   let argsLen = 2 + len(keys) + (if len(weights) > 0: len(weights) + 1 else: 0) + (if len(aggregate) > 0: 1 + len(aggregate) else: 0)
-  newSeq(args, argsLen)
+  var args = newSeqofCap[string](argsLen)
 
   args.add(destination)
   args.add(numkeys)
@@ -979,8 +975,7 @@ proc zrangebyscore*(r: Redis | AsyncRedis, key: string, min: string, max: string
                    withScores: bool = false, limit: bool = false,
                    limitOffset: int = 0, limitCount: int = 0): Future[RedisList] {.multisync.} =
   ## Return a range of members in a sorted set, by score
-  var args: seq[string]
-  newSeq(args, 3 + (if withScores: 1 else: 0) + (if limit: 3 else: 0))
+  var args = newSeqOfCap[string](3 + (if withScores: 1 else: 0) + (if limit: 3 else: 0))
   args.add(key)
   args.add(min)
   args.add(max)
@@ -998,8 +993,7 @@ proc zrangebylex*(r: Redis | AsyncRedis, key: string, start: string, stop: strin
                   limit: bool = false, limitOffset: int = 0,
                   limitCount: int = 0): Future[RedisList] {.multisync.} =
   ## Return a range of members in a sorted set, ordered lexicographically
-  var args: seq[string]
-  newSeq(args, 3 + (if limit: 3 else: 0))
+  var args = newSeqOfCap[string](3 + (if limit: 3 else: 0))
   args.add(key)
   args.add(start)
   args.add(stop)
@@ -1052,8 +1046,7 @@ proc zrevrangebyscore*(r: Redis | AsyncRedis, key: string, min: string, max: str
                    limitOffset: int = 0, limitCount: int = 0): Future[RedisList] {.multisync.} =
   ## Return a range of members in a sorted set, by score, with
   ## scores ordered from high to low
-  var args: seq[string]
-  newSeq(args, 3 + (if withScores: 1 else: 0) + (if limit: 3 else: 0))
+  var args = newSeqOfCap[string](3 + (if withScores: 1 else: 0) + (if limit: 3 else: 0))
   args.add(key)
   args.add(min)
   args.add(max)
@@ -1085,8 +1078,7 @@ proc zunionstore*(r: Redis | AsyncRedis, destination: string, numkeys: string,
                  keys: seq[string], weights: seq[string] = @[],
                  aggregate: string = ""): Future[RedisInteger] {.multisync.} =
   ## Add multiple sorted sets and store the resulting sorted set in a new key
-  var args: seq[string]
-  newSeq(args, 2 + len(keys) + (if len(weights) > 0: 1 + len(weights) else: 0) + (if len(aggregate) > 0: 1 + len(aggregate) else: 0))
+  var args = newSeqOfCap[string](2 + len(keys) + (if len(weights) > 0: 1 + len(weights) else: 0) + (if len(aggregate) > 0: 1 + len(aggregate) else: 0))
   args.add(destination)
   args.add(numkeys)