Spelling (#21)

some spelling fix

Signed-off-by: Josh Soref <[email protected]>

Author: jsoref

src/main/java/io/valkey/CommandObjects.java

@@ -4376,7 +4376,7 @@ public final CommandObject<Object> tFunctionCallAsync(String library, String fun
   // RedisGears commands
 
   /**
-   * Get the instance for JsonObjectMapper if not null, otherwise a new instance reference with
+   * Get the instance for JsonObjectMapper if not null; otherwise, a new instance reference with
    * default implementation will be created and returned.
    * <p>This process of checking whether or not
    * the instance reference exists follows <a

src/main/java/io/valkey/DefaultJedisSocketFactory.java

@@ -67,7 +67,7 @@ private Socket connectToFirstSuccessfulHost(HostAndPort hostAndPort) throws Exce
 
         socket.setReuseAddress(true);
         socket.setKeepAlive(true); // Will monitor the TCP connection is valid
-        socket.setTcpNoDelay(true); // Socket buffer Whetherclosed, to ensure timely delivery of data
+        socket.setTcpNoDelay(true); // Socket buffer option, to ensure timely delivery of data
         socket.setSoLinger(true, 0); // Control calls close () method, the underlying socket is closed immediately
 
         // Passing 'host' directly will avoid another call to InetAddress.getByName() inside the InetSocketAddress constructor.

src/main/java/io/valkey/Jedis.java

@@ -627,11 +627,11 @@ public long exists(final byte[]... keys) {
   }
 
   /**
-   * Test if the specified key exists. The command returns true if the key exists, otherwise false is
+   * Test if the specified key exists. The command returns true if the key exists; otherwise, false is
    * returned. Note that even keys set with an empty string as value will return true. Time
    * complexity: O(1)
    * @param key
-   * @return {@code true} if the key exists, otherwise {@code false}
+   * @return {@code true} if the key exists; otherwise, {@code false}
    */
   @Override
   public boolean exists(final byte[] key) {
@@ -1230,7 +1230,7 @@ public byte[] substr(final byte[] key, final int start, final int end) {
    * @param field
    * @param value
    * @return If the field already exists, and the HSET just produced an update of the value, 0 is
-   *         returned, otherwise if a new field is created 1 is returned.
+   *         returned; otherwise, if a new field is created 1 is returned.
    */
   @Override
   public long hset(final byte[] key, final byte[] field, final byte[] value) {
@@ -1266,7 +1266,7 @@ public byte[] hget(final byte[] key, final byte[] field) {
    * @param key
    * @param field
    * @param value
-   * @return If the field already exists, 0 is returned, otherwise if a new field is created 1 is
+   * @return If the field already exists, 0 is returned; otherwise, if a new field is created 1 is
    *         returned.
    */
   @Override
@@ -1363,12 +1363,12 @@ public boolean hexists(final byte[] key, final byte[] field) {
   }
 
   /**
-   * Remove the specified field from an hash stored at key.
+   * Remove the specified field from a hash stored at key.
    * <p>
    * <b>Time complexity:</b> O(1)
    * @param key
    * @param fields
-   * @return If the field was present in the hash it is deleted and 1 is returned, otherwise 0 is
+   * @return If the field was present in the hash it is deleted and 1 is returned; otherwise, 0 is
    *         returned and no operation is performed.
    */
   @Override
@@ -1643,8 +1643,8 @@ public String lset(final byte[] key, final long index, final byte[] value) {
    * go from head to tail that is the normal behaviour. So for example LREM with count -2 and hello
    * as value to remove against the list (a,b,c,hello,x,hello,hello) will leave the list
    * (a,b,c,hello,x). The number of removed elements is returned as an integer, see below for more
-   * information about the returned value. Note that non existing keys are considered like empty
-   * lists by LREM, so LREM against non existing keys will always return 0.
+   * information about the returned value. Note that nonexistent keys are considered like empty
+   * lists by LREM, so LREM against nonexistent keys will always return 0.
    * <p>
    * Time complexity: O(N) (with N being the length of the list)
    * @param key
@@ -1861,7 +1861,7 @@ public Set<byte[]> spop(final byte[] key, final long count) {
    * for accessing clients.
    * <p>
    * If the source set does not exist or does not contain the specified element no operation is
-   * performed and zero is returned, otherwise the element is removed from the source set and added
+   * performed and zero is returned; otherwise, the element is removed from the source set and added
    * to the destination set. On success one is returned, even if the element was already present in
    * the destination set.
    * <p>
@@ -1892,7 +1892,7 @@ public long scard(final byte[] key) {
   }
 
   /**
-   * Return true if member is a member of the set stored at key, otherwise false is returned.
+   * Return true if member is a member of the set stored at key; otherwise, false is returned.
    * <p>
    * Time complexity O(1)
    * @param key
@@ -2137,7 +2137,7 @@ public List<byte[]> zrange(final byte[] key, final long start, final long stop)
 
   /**
    * Remove the specified member from the sorted set value stored at key. If member was not a member
-   * of the set no operation is performed. If key does not not hold a set value an error is
+   * of the set no operation is performed. If key does not hold a set value an error is
    * returned.
    * <p>
    * Time complexity O(log(N)) with N being the number of elements in the sorted set
@@ -3518,15 +3518,15 @@ public String shutdownAbort() {
   /**
    * Provide information and statistics about the server.
    * <p>
-   * The info command returns different information and statistics about the server in an format
+   * The info command returns different information and statistics about the server in a format
    * that's simple to parse by computers and easy to read by humans.
    * <p>
    * <b>Format of the returned String:</b>
    * <p>
    * All the fields are in the form field:value
    *
    * <pre>
-   * edis_version:0.07
+   * redis_version:0.07
    * connected_clients:1
    * connected_slaves:0
    * used_memory:3187
@@ -5089,11 +5089,11 @@ public long exists(final String... keys) {
   }
 
   /**
-   * Test if the specified key exists. The command returns true if the key exists, otherwise false is
+   * Test if the specified key exists. The command returns true if the key exists; otherwise, false is
    * returned. Note that even keys set with an empty string as value will return true. Time
    * complexity: O(1)
    * @param key
-   * @return {@code true} if the key exists, otherwise {@code false}
+   * @return {@code true} if the key exists; otherwise, {@code false}
    */
   @Override
   public boolean exists(final String key) {
@@ -5527,7 +5527,7 @@ public long msetnx(final String... keysvalues) {
   }
 
   /**
-   * IDECRBY work just like {@link Jedis#decr(String) INCR} but instead to decrement by 1 the
+   * DECRBY works just like {@link Jedis#decr(String) INCR} but instead to decrement by 1 the
    * decrement is integer.
    * <p>
    * INCR commands are limited to 64-bit signed integers.
@@ -5691,7 +5691,7 @@ public String substr(final String key, final int start, final int end) {
    * @param field
    * @param value
    * @return If the field already exists, and the HSET just produced an update of the value, 0 is
-   *         returned, otherwise if a new field is created 1 is returned.
+   *         returned; otherwise, if a new field is created 1 is returned.
    */
   @Override
   public long hset(final String key, final String field, final String value) {
@@ -5727,7 +5727,7 @@ public String hget(final String key, final String field) {
    * @param key
    * @param field
    * @param value
-   * @return If the field already exists, 0 is returned, otherwise if a new field is created 1 is
+   * @return If the field already exists, 0 is returned; otherwise, if a new field is created 1 is
    *         returned.
    */
   @Override
@@ -6108,8 +6108,8 @@ public String lset(final String key, final long index, final String value) {
    * go from head to tail that is the normal behaviour. So for example LREM with count -2 and hello
    * as value to remove against the list (a,b,c,hello,x,hello,hello) will leave the list
    * (a,b,c,hello,x). The number of removed elements is returned as an integer, see below for more
-   * information about the returned value. Note that non existing keys are considered like empty
-   * lists by LREM, so LREM against non existing keys will always return 0.
+   * information about the returned value. Note that nonexistent keys are considered like empty
+   * lists by LREM, so LREM against nonexistent keys will always return 0.
    * <p>
    * Time complexity: O(N) (with N being the length of the list)
    * @param key
@@ -6281,7 +6281,7 @@ public Set<String> spop(final String key, final long count) {
    * for accessing clients.
    * <p>
    * If the source set does not exist or does not contain the specified element no operation is
-   * performed and zero is returned, otherwise the element is removed from the source set and added
+   * performed and zero is returned; otherwise, the element is removed from the source set and added
    * to the destination set. On success one is returned, even if the element was already present in
    * the destination set.
    * <p>
@@ -6313,7 +6313,7 @@ public long scard(final String key) {
   }
 
   /**
-   * Return true if member is a member of the set stored at key, otherwise false is returned.
+   * Return true if member is a member of the set stored at key; otherwise, false is returned.
    * <p>
    * Time complexity O(1)
    * @param key

src/main/java/io/valkey/JedisClusterInfoCache.java

@@ -88,7 +88,7 @@ public JedisClusterInfoCache(final JedisClientConfig clientConfig,
   /**
    * Check whether the number and order of slots in the cluster topology are equal to CLUSTER_HASHSLOTS
    * @param slotsInfo the cluster topology
-   * @return if slots is ok, return true, elese return false.
+   * @return if slots is ok, return true, else return false.
    */
   private boolean checkClusterSlotSequence(List<Object> slotsInfo) {
     List<Integer> slots = new ArrayList<>();

src/main/java/io/valkey/JedisSentinelPool.java

@@ -245,7 +245,7 @@ private HostAndPort initSentinels(Set<HostAndPort> sentinels, final String maste
         sentinelAvailable = true;
 
         if (masterAddr == null || masterAddr.size() != 2) {
-          LOG.warn("Can not get master addr, master name: {}. Sentinel: {}", masterName, sentinel);
+          LOG.warn("Cannot get master addr, master name: {}. Sentinel: {}", masterName, sentinel);
           continue;
         }
 
@@ -368,7 +368,7 @@ public void run() {
           // code for active refresh
           List<String> masterAddr = j.sentinelGetMasterAddrByName(masterName);
           if (masterAddr == null || masterAddr.size() != 2) {
-            LOG.warn("Can not get master addr, master name: {}. Sentinel: {}.", masterName,
+            LOG.warn("Cannot get master addr, master name: {}. Sentinel: {}.", masterName,
                 hostPort);
           } else {
             initMaster(toHostAndPort(masterAddr));

src/main/java/io/valkey/MultiClusterClientConfig.java

@@ -21,7 +21,7 @@
  * With this Config users can seamlessly failover to Disaster Recovery (DR), Backup, and Active-Active cluster(s)
  * by using simple configuration which is passed through from Resilience4j - https://resilience4j.readme.io/docs
  * <p>
- * Configuration options related to automatic failback (e.g. HALF_OPENED state) are not supported and therefore
+ * Configuration options related to automatic fallback (e.g. HALF_OPENED state) are not supported and therefore
  * not passed through to Jedis users.
  * <p>
  */

src/main/java/io/valkey/bloom/commands/TDigestSketchCommands.java

@@ -107,8 +107,8 @@ public interface TDigestSketchCommands {
    * {@code TDIGEST.TRIMMED_MEAN key low_cut_quantile high_cut_quantile}
    *
    * @param key The name of the sketch (a t-digest data structure)
-   * @param lowCutQuantile Exclude observation values lower than this quantile
-   * @param highCutQuantile Exclude observation values higher than this quantile
+   * @param lowCutQuantile Exclude observation values below this quantile
+   * @param highCutQuantile Exclude observation values above this quantile
    * @return estimation of the mean value
    */
   double tdigestTrimmedMean(String key, double lowCutQuantile, double highCutQuantile);

src/main/java/io/valkey/commands/ClientCommands.java

@@ -9,7 +9,7 @@
 
 /**
  * The interface contain all the commands about client.
- * The params is String encoded in uft-8
+ * The params is String encoded in utf-8
  */
 public interface ClientCommands {
 

src/main/java/io/valkey/commands/ClusterCommands.java

@@ -117,7 +117,7 @@ public interface ClusterCommands {
    * attributes and their values for an individual link.
    *
    * @return the information of all such peer links as an array
-   * @see <a href="https://valkey.io/commands/cluster-links">CLUSTET LINKS</a>
+   * @see <a href="https://valkey.io/commands/cluster-links">CLUSTER LINKS</a>
    */
   List<Map<String, Object>> clusterLinks();
 

src/main/java/io/valkey/commands/KeyCommands.java

@@ -74,7 +74,7 @@ public interface KeyCommands {
    * Time complexity: O(1) to access the key and additional O(N*M) to serialize it where N is
    * the number of Redis objects composing the value and M their average size.
    * @param key
-   * @param ttl If ttl is 0 the key is created without any expire, otherwise the specified expire
+   * @param ttl If ttl is 0 the key is created without any expire; otherwise, the specified expire
    *           time (in milliseconds) is set.
    * @param serializedValue
    * @return OK
@@ -89,7 +89,7 @@ public interface KeyCommands {
    * Time complexity: O(1) to access the key and additional O(N*M) to serialize it where N is
    * the number of Redis objects composing the value and M their average size.
    * @param key
-   * @param ttl If ttl is 0 the key is created without any expire, otherwise the specified expire
+   * @param ttl If ttl is 0 the key is created without any expire; otherwise, the specified expire
    *           time (in milliseconds) is set.
    * @param serializedValue
    * @param params {@link RestoreParams}