From d71fd6264d58795c50b9350d7c39677b671e0896 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sat, 17 Jul 2021 09:34:48 +0200 Subject: Merging upstream version 1.9.4. Signed-off-by: Daniel Baumann --- iredis/data/commands/stralgo.md | 12 ++++++------ 1 file changed, 6 insertions(+), 6 deletions(-) (limited to 'iredis/data/commands/stralgo.md') 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 ] [WITHMATCHLEN] +STRALGO LCS STRINGS | KEYS [LEN] [IDX] [MINMATCHLEN ] [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). -- cgit v1.2.3