regex-tdfa-1.3.2.5: Pure Haskell Tagged DFA Backend for "Text.Regex" (regex-base)

Safe Haskell | Safe-Inferred
Language | Haskell2010

Text.Regex.TDFA.NewDFA.Uncons

# Documentation

class Uncons a where Source #

Methods

uncons :: a -> Maybe (Char, a) Source #

#### Instances

Instances details

Uncons ByteString Source # |
Instance details Defined in Text.Regex.TDFA.NewDFA.Uncons Methods uncons :: ByteString -> Maybe (Char, ByteString) Source #
Uncons ByteString Source # |
Instance details Defined in Text.Regex.TDFA.NewDFA.Uncons Methods uncons :: ByteString -> Maybe (Char, ByteString) Source #
Uncons Text Source # | Since: 1.3.1
Instance details Defined in Text.Regex.TDFA.NewDFA.Uncons Methods uncons :: Text -> Maybe (Char, Text) Source #
Uncons Text Source # | Since: 1.3.1
Instance details Defined in Text.Regex.TDFA.NewDFA.Uncons Methods uncons :: Text -> Maybe (Char, Text) Source #
Uncons (Seq Char) Source # |
Instance details Defined in Text.Regex.TDFA.NewDFA.Uncons Methods uncons :: Seq Char -> Maybe (Char, Seq Char) Source #
Uncons [Char] Source # |
Instance details Defined in Text.Regex.TDFA.NewDFA.Uncons Methods uncons :: [Char] -> Maybe (Char, [Char]) Source #