Hoogle Search
Within LTS Haskell 24.32 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
anyMatches :: Matches a -> Boolregex Text.RE.TDFA.Text tests whether the RE matched the source text at all
anyMatches :: Matches a -> Boolregex Text.RE.TDFA.Text.Lazy tests whether the RE matched the source text at all
-
regex-applicative Text.Regex.Applicative Match and return any single symbol
anyTill :: MonadParsec e s m => m a -> m (Tokens s, a)replace-megaparsec Replace.Megaparsec Specialized manyTill_
Parser combinator to consume input until the sep pattern matches, equivalent to manyTill_ anySingle sep. On success, returns the prefix before the pattern match and the parsed match. sep may be a zero-width parser, it may succeed without consuming any input. This combinator will produce a parser which acts like takeWhileP but is predicated beyond more than just the next one token. anyTill is also like takeWhileP in that it will be “fast” when applied to an input stream type s for which there are specialization re-write rules.anyTillByteString :: (MonadParsec e s m, s ~ ByteString) => m a -> m (Tokens s, a)replace-megaparsec Replace.Megaparsec.Internal.ByteString No documentation available.
anyTillText :: (MonadParsec e s m, s ~ Text) => m a -> m (Tokens s, a)replace-megaparsec Replace.Megaparsec.Internal.Text No documentation available.
-
sbv Data.SBV.RegExp Match any character, i.e., strings of length 1
>>> prove $ \(s :: SString) -> s `match` anyChar .<=> length s .== 1 Q.E.D.
-
scalpel-core Text.HTML.Scalpel.Core A selector which will match any node (including tags and bare text).
-
web-routes Web.Routes.PathInfo match on any string
-
xmonad XMonad No documentation available.