From 7f6bf0f68afbd151b0ea4b2fbf491355e5916e03 Mon Sep 17 00:00:00 2001
From: dltmd202 <dltmd202@gmail.com>
Date: Wed, 13 Nov 2024 08:04:11 +0900
Subject: [PATCH] Deprecate the STRALGO command and implement the LCS in its
 place

---
 .../NodeSelectionStringAsyncCommands.java     | 32 +++++++++----------
 .../api/sync/NodeSelectionStringCommands.java | 32 +++++++++----------
 2 files changed, 32 insertions(+), 32 deletions(-)

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
index 952d6b098..a76516a3f 100644
--- a/src/main/java/io/lettuce/core/cluster/api/async/NodeSelectionStringAsyncCommands.java
+++ b/src/main/java/io/lettuce/core/cluster/api/async/NodeSelectionStringAsyncCommands.java
@@ -420,22 +420,22 @@ public interface NodeSelectionStringAsyncCommands<K, V> {
      */
     AsyncExecutions<StringMatchResult> stralgoLcs(StrAlgoArgs strAlgoArgs);
 
-//    /**
-//     * The LCS command implements the longest common subsequence algorithm.
-//     *
-//     * <ul>
-//     * <li>Without modifiers the string representing the longest common substring is returned.</li>
-//     * <li>When {@link LcsArgs#justLen() LEN} is given the command returns the length of the longest common substring.</li>
-//     * <li>When {@link LcsArgs#withIdx() IDX} is given the command returns an array with the LCS length and all the ranges in
-//     * both the strings, start and end offset for each string, where there are matches. When {@link LcsArgs#withMatchLen()
-//     * WITHMATCHLEN} is given each array representing a match will also have the length of the match.</li>
-//     * </ul>
-//     *
-//     * @param lcsArgs command arguments.
-//     * @return StringMatchResult.
-//     * @since 6.6
-//     */
-//    AsyncExecutions<StringMatchResult> lcs(LcsArgs lcsArgs);
+    /**
+     * The LCS command implements the longest common subsequence algorithm.
+     *
+     * <ul>
+     * <li>Without modifiers the string representing the longest common substring is returned.</li>
+     * <li>When {@link LcsArgs#justLen() LEN} is given the command returns the length of the longest common substring.</li>
+     * <li>When {@link LcsArgs#withIdx() IDX} is given the command returns an array with the LCS length and all the ranges in
+     * both the strings, start and end offset for each string, where there are matches. When {@link LcsArgs#withMatchLen()
+     * WITHMATCHLEN} is given each array representing a match will also have the length of the match.</li>
+     * </ul>
+     *
+     * @param lcsArgs command arguments.
+     * @return StringMatchResult.
+     * @since 6.6
+     */
+    AsyncExecutions<StringMatchResult> lcs(LcsArgs lcsArgs);
 
     /**
      * Get the length of the value stored in a key.
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
index 85b2e7b80..dacd52cb5 100644
--- a/src/main/java/io/lettuce/core/cluster/api/sync/NodeSelectionStringCommands.java
+++ b/src/main/java/io/lettuce/core/cluster/api/sync/NodeSelectionStringCommands.java
@@ -420,22 +420,22 @@ public interface NodeSelectionStringCommands<K, V> {
      */
     Executions<StringMatchResult> stralgoLcs(StrAlgoArgs strAlgoArgs);
 
-//    /**
-//     * The LCS command implements the longest common subsequence algorithm.
-//     *
-//     * <ul>
-//     * <li>Without modifiers the string representing the longest common substring is returned.</li>
-//     * <li>When {@link LcsArgs#justLen() LEN} is given the command returns the length of the longest common substring.</li>
-//     * <li>When {@link LcsArgs#withIdx() IDX} is given the command returns an array with the LCS length and all the ranges in
-//     * both the strings, start and end offset for each string, where there are matches. When {@link LcsArgs#withMatchLen()
-//     * WITHMATCHLEN} is given each array representing a match will also have the length of the match.</li>
-//     * </ul>
-//     *
-//     * @param lcsArgs command arguments.
-//     * @return StringMatchResult.
-//     * @since 6.6
-//     */
-//    Executions<StringMatchResult> lcs(LcsArgs lcsArgs);
+    /**
+     * The LCS command implements the longest common subsequence algorithm.
+     *
+     * <ul>
+     * <li>Without modifiers the string representing the longest common substring is returned.</li>
+     * <li>When {@link LcsArgs#justLen() LEN} is given the command returns the length of the longest common substring.</li>
+     * <li>When {@link LcsArgs#withIdx() IDX} is given the command returns an array with the LCS length and all the ranges in
+     * both the strings, start and end offset for each string, where there are matches. When {@link LcsArgs#withMatchLen()
+     * WITHMATCHLEN} is given each array representing a match will also have the length of the match.</li>
+     * </ul>
+     *
+     * @param lcsArgs command arguments.
+     * @return StringMatchResult.
+     * @since 6.6
+     */
+    Executions<StringMatchResult> lcs(LcsArgs lcsArgs);
 
     /**
      * Get the length of the value stored in a key.