Polishing #1632

redis · Mar 2, 2021 · bc9b771 · bc9b771
1 parent 93b5f9a
commit bc9b771
Show file tree

Hide file tree

Showing 6 changed files with 18 additions and 18 deletions.
diff --git a/src/main/java/io/lettuce/core/api/async/RedisStringAsyncCommands.java b/src/main/java/io/lettuce/core/api/async/RedisStringAsyncCommands.java
@@ -83,7 +83,7 @@ public interface RedisStringAsyncCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -103,7 +103,7 @@ public interface RedisStringAsyncCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -125,7 +125,7 @@ public interface RedisStringAsyncCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and

diff --git a/src/main/java/io/lettuce/core/api/sync/RedisStringCommands.java b/src/main/java/io/lettuce/core/api/sync/RedisStringCommands.java
@@ -83,7 +83,7 @@ public interface RedisStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -103,7 +103,7 @@ public interface RedisStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -125,7 +125,7 @@ public interface RedisStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and

diff --git a/src/main/java/io/lettuce/core/cluster/api/async/NodeSelectionStringAsyncCommands.java b/src/main/java/io/lettuce/core/cluster/api/async/NodeSelectionStringAsyncCommands.java
@@ -83,7 +83,7 @@ public interface NodeSelectionStringAsyncCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -103,7 +103,7 @@ public interface NodeSelectionStringAsyncCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -125,7 +125,7 @@ public interface NodeSelectionStringAsyncCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and

diff --git a/src/main/java/io/lettuce/core/cluster/api/sync/NodeSelectionStringCommands.java b/src/main/java/io/lettuce/core/cluster/api/sync/NodeSelectionStringCommands.java
@@ -83,7 +83,7 @@ public interface NodeSelectionStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -103,7 +103,7 @@ public interface NodeSelectionStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -125,7 +125,7 @@ public interface NodeSelectionStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and

diff --git a/src/main/kotlin/io/lettuce/core/api/coroutines/RedisStringCoroutinesCommands.kt b/src/main/kotlin/io/lettuce/core/api/coroutines/RedisStringCoroutinesCommands.kt
@@ -78,7 +78,7 @@ interface RedisStringCoroutinesCommands<K : Any, V : Any> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command `BITPOS key 0` will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -98,7 +98,7 @@ interface RedisStringCoroutinesCommands<K : Any, V : Any> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command `BITPOS key 0` will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -120,7 +120,7 @@ interface RedisStringCoroutinesCommands<K : Any, V : Any> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command `BITPOS key 0` will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and

diff --git a/src/main/templates/io/lettuce/core/api/RedisStringCommands.java b/src/main/templates/io/lettuce/core/api/RedisStringCommands.java
@@ -78,7 +78,7 @@ public interface RedisStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -98,7 +98,7 @@ public interface RedisStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and
@@ -120,7 +120,7 @@ public interface RedisStringCommands<K, V> {
      *         returned.
      *
      *         If we look for clear bits (the bit argument is 0) and the string only contains bit set to 1, the function returns
-     *         the first bit not part of the string on the right. So if the string is tree bytes set to the value 0xff the
+     *         the first bit not part of the string on the right. So if the string is three bytes set to the value 0xff the
      *         command {@code BITPOS key 0} will return 24, since up to bit 23 all the bits are 1.
      *
      *         Basically the function consider the right of the string as padded with zeros if you look for clear bits and