isInfixOf package:rio

isInfixOf :: ByteString -> ByteString -> Bool
rio RIO.ByteString
Check whether one string is a substring of another. isInfixOf p s is equivalent to not (null (findSubstrings p s)).
isInfixOf :: Eq a => [a] -> [a] -> Bool
rio RIO.List
The isInfixOf function takes two lists and returns True iff the first list is contained, wholly and intact, anywhere within the second. 
>>> isInfixOf "Haskell" "I really like Haskell."
True

>>> isInfixOf "Ial" "I really like Haskell."
False
isInfixOf :: Text -> Text -> Bool
rio RIO.Text
O(n+m) The isInfixOf function takes two Texts and returns True iff the first is contained, wholly and intact, anywhere within the second. In (unlikely) bad cases, this function's time complexity degrades towards O(n*m).
isInfixOf :: Text -> Text -> Bool
rio RIO.Text.Lazy
O(n+m) The isInfixOf function takes two Texts and returns True iff the first is contained, wholly and intact, anywhere within the second. This function is strict in its first argument, and lazy in its second. In (unlikely) bad cases, this function's time complexity degrades towards O(n*m).