summaryrefslogtreecommitdiffstats
path: root/iredis/data/commands/stralgo.md
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2021-07-17 07:34:44 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2021-07-17 07:34:44 +0000
commit02a04a2335701bfc8d6a1087338f58e9f37ceb52 (patch)
tree92c2c729cfdaaa3942a251357ff100e28a8b8624 /iredis/data/commands/stralgo.md
parentAdding upstream version 1.9.1. (diff)
downloadiredis-02a04a2335701bfc8d6a1087338f58e9f37ceb52.tar.xz
iredis-02a04a2335701bfc8d6a1087338f58e9f37ceb52.zip
Adding upstream version 1.9.4.upstream/1.9.4
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'iredis/data/commands/stralgo.md')
-rw-r--r--iredis/data/commands/stralgo.md12
1 files changed, 6 insertions, 6 deletions
diff --git a/iredis/data/commands/stralgo.md b/iredis/data/commands/stralgo.md
index ccd72fe..f3a31dd 100644
--- a/iredis/data/commands/stralgo.md
+++ b/iredis/data/commands/stralgo.md
@@ -11,7 +11,7 @@ argument must be "LCS", since this is the only implemented one.
## LCS algorithm
```
-STRALGO LCS [KEYS ...] [STRINGS ...] [LEN] [IDX] [MINMATCHLEN <len>] [WITHMATCHLEN]
+STRALGO LCS STRINGS <string_a> <string_b> | KEYS <key_a> <key_b> [LEN] [IDX] [MINMATCHLEN <len>] [WITHMATCHLEN]
```
The LCS subcommand implements the longest common subsequence algorithm. Note
@@ -113,9 +113,9 @@ For the LCS algorithm:
- Without modifiers the string representing the longest common substring is
returned.
-- When LEN is given the command returns the length of the longest common
+- When `LEN` is given the command returns the length of the longest common
substring.
-- When 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 WITHMATCHLEN is given each array representing a match will
- also have the length of the match (see examples).
+- When `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 `WITHMATCHLEN` is given each array representing a
+ match will also have the length of the match (see examples).