Longest common substring: Difference between revisions

Content added Content deleted
(Ada version)
m (→‎{{header|Haskell}}: Applied Ormolu)
Line 968:
Or, fusing subStrings as ''tail . inits <=< tails''
 
<lang haskell>import DataControl.OrdMonad (comparing(<=<))
import Control.Monad ((<=<))
import Data.List (inits, intersect, maximumBy, tails)
import Data.Ord (comparing)
 
----------------- LONGEST COMMON SUBSTRING ---------------
 
longestCommon :: Eq a => [a] -> [a] -> [a]
longestCommon a b =
let pair [x, y] = (x, y)▼
in maximumBy (comparing length) $
(uncurry intersect . pair) $ [tail . inits <=< tails] <*> [a, b]
 
pair :: [atail . inits <=< tails] -<*> ([a, a)b]
▲pair [x, y] = (x, y)
 
--------------------------- TEST -------------------------
main :: IO ()
main =
main = putStrLn $ longestCommon "testing123testing" "thisisatest"</lang>▼
putStrLn $
▲main = putStrLn $ longestCommon "testing123testing" "thisisatest"</lang>
{{Out}}
<pre>test</pre>
Retrieved from "https://rosettacode.org/wiki/Longest_common_substring"