Revert "Fix formatting"

This reverts commit 5b0804d.
valkey-io · Jul 7, 2024 · c58ae4c · c58ae4c
1 parent 241ddaa
commit c58ae4c
Show file tree

Hide file tree

Showing 3 changed files with 25 additions and 26 deletions.
diff --git a/java/client/src/main/java/glide/api/commands/SortedSetBaseCommands.java b/java/client/src/main/java/glide/api/commands/SortedSetBaseCommands.java
@@ -260,8 +260,7 @@ CompletableFuture<Double> zaddIncr(
      * increment</code> as its score (as if its previous score was <code>0.0</code>).<br>
      * If <code>key</code> does not exist, a new sorted set with the specified member as its sole
      * member is created.<br>
-     * <code>zaddIncr</code> with empty option acts as {@link #zincrby(GlideString, double,
-     * GlideString)}.
+     * <code>zaddIncr</code> with empty option acts as {@link #zincrby(GlideString, double, GlideString)}.
      *
      * @see <a href="https://redis.io/commands/zadd/">redis.io</a> for more details.
      * @param key The key of the sorted set.
@@ -1357,7 +1356,7 @@ CompletableFuture<Long> zrangestore(
      *
      * @apiNote When in cluster mode, all <code>keys</code> must map to the same hash slot.
      * @since Redis 6.2 and above.
-     * @see <a href="https://valkey.io/commands/zdiff/">valkey.io</a> for more details.
+     * @see <a href="https://valkey.io/commands/zdiff/"> valkey.io</a> for more details.
      * @param keys The keys of the sorted sets.
      * @return A <code>Map</code> of elements and their scores representing the difference between the
      *     sorted sets.<br>
@@ -1445,11 +1444,11 @@ CompletableFuture<Long> zrangestore(
      * @see <a href="https://redis.io/commands/zcount/">redis.io</a> for more details.
      * @param key The key of the sorted set.
      * @param minScore The minimum score to count from. Can be an implementation of {@link
-     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link
-     *     ScoreBoundaryBinary} representing a specific score and inclusivity.
+     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link ScoreBoundaryBinary}
+     *     representing a specific score and inclusivity.
      * @param maxScore The maximum score to count up to. Can be an implementation of {@link
-     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link
-     *     ScoreBoundaryBinary} representing a specific score and inclusivity.
+     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link ScoreBoundaryBinary}
+     *     representing a specific score and inclusivity.
      * @return The number of members in the specified score range.<br>
      *     If <code>key</code> does not exist, it is treated as an empty sorted set, and the command
      *     returns <code>0</code>.<br>
@@ -1554,11 +1553,11 @@ CompletableFuture<Long> zcount(
      * @see <a href="https://redis.io/commands/zremrangebylex/">redis.io</a> for more details.
      * @param key The key of the sorted set.
      * @param minLex The minimum bound of the lexicographical range. Can be an implementation of
-     *     {@link InfLexBoundBinary} representing positive/negative infinity, or {@link
-     *     LexBoundaryBinary} representing a specific lex and inclusivity.
+     *     {@link InfLexBoundBinary} representing positive/negative infinity, or {@link LexBoundaryBinary}
+     *     representing a specific lex and inclusivity.
      * @param maxLex The maximum bound of the lexicographical range. Can be an implementation of
-     *     {@link InfLexBoundBinary} representing positive/negative infinity, or {@link
-     *     LexBoundaryBinary} representing a specific lex and inclusivity.
+     *     {@link InfLexBoundBinary} representing positive/negative infinity, or {@link LexBoundaryBinary}
+     *     representing a specific lex and inclusivity.
      * @return The number of members removed from the sorted set.<br>
      *     If <code>key</code> does not exist, it is treated as an empty sorted set, and the command
      *     returns <code>0</code>.<br>
@@ -1609,11 +1608,11 @@ CompletableFuture<Long> zremrangebylex(
      * @see <a href="https://redis.io/commands/zremrangebyscore/">redis.io</a> for more details.
      * @param key The key of the sorted set.
      * @param minScore The minimum score to remove from. Can be an implementation of {@link
-     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link
-     *     ScoreBoundaryBinary} representing a specific score and inclusivity.
+     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link ScoreBoundaryBinary}
+     *     representing a specific score and inclusivity.
      * @param maxScore The maximum score to remove to. Can be an implementation of {@link
-     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link
-     *     ScoreBoundaryBinary} representing a specific score and inclusivity.
+     *     InfScoreBoundBinary} representing positive/negative infinity, or {@link ScoreBoundaryBinary}
+     *     representing a specific score and inclusivity.
      * @return The number of members removed.<br>
      *     If <code>key</code> does not exist, it is treated as an empty sorted set, and the command
      *     returns <code>0</code>.<br>
@@ -1663,12 +1662,12 @@ CompletableFuture<Long> zremrangebyscore(
      *
      * @see <a href="https://redis.io/commands/zlexcount/">redis.io</a> for more details.
      * @param key The key of the sorted set.
-     * @param minLex The minimum lex to count from. Can be an implementation of {@link
-     *     InfLexBoundBinary} representing positive/negative infinity, or {@link LexBoundaryBinary}
-     *     representing a specific lex and inclusivity.
-     * @param maxLex The maximum lex to count up to. Can be an implementation of {@link
-     *     InfLexBoundBinary} representing positive/negative infinity, or {@link LexBoundaryBinary}
-     *     representing a specific lex and inclusivity.
+     * @param minLex The minimum lex to count from. Can be an implementation of {@link InfLexBoundBinary}
+     *     representing positive/negative infinity, or {@link LexBoundaryBinary} representing a specific lex
+     *     and inclusivity.
+     * @param maxLex The maximum lex to count up to. Can be an implementation of {@link InfLexBoundBinary}
+     *     representing positive/negative infinity, or {@link LexBoundaryBinary} representing a specific lex
+     *     and inclusivity.
      * @return The number of members in the specified lex range.<br>
      *     If <code>key</code> does not exist, it is treated as an empty sorted set, and the command
      *     returns <code>0</code>.<br>

diff --git a/java/client/src/main/java/glide/api/models/commands/ZAddOptions.java b/java/client/src/main/java/glide/api/models/commands/ZAddOptions.java
@@ -1,6 +1,8 @@
 /** Copyright Valkey GLIDE Project Contributors - SPDX Identifier: Apache-2.0 */
 package glide.api.models.commands;
 
+import static glide.api.models.GlideString.gs;
+
 import glide.api.commands.SortedSetBaseCommands;
 import glide.api.models.GlideString;
 import java.util.ArrayList;
@@ -92,7 +94,5 @@ public String[] toArgs() {
      *
      * @return GlideString[]
      */
-    public GlideString[] toArgsBinary() {
-        return new ArgsBuilder().add(toArgs()).toArray();
-    }
+    public GlideString[] toArgsBinary() { return new ArgsBuilder().add(toArgs()).toArray(); }
 }
diff --git a/java/client/src/main/java/glide/utils/ArrayTransformUtils.java b/java/client/src/main/java/glide/utils/ArrayTransformUtils.java
@@ -56,8 +56,8 @@ public static String[] convertMapToValueKeyStringArray(Map<String, ?> args) {
     }
 
     /**
-     * Converts a map of GlideString keys and values of any type into an array of GlideStrings with
-     * alternating values and keys.
+     * Converts a map of GlideString keys and values of any type into an array of GlideStrings with alternating
+     * values and keys.
      *
      * @param args Map of GlideString keys to values of any type to convert.
      * @return Array of GlideStrings [gs(value1.toString()), key1, gs(value2.toString()), key2, ...].