Safe Haskell	Safe
Language	Haskell2010

Kleene.Functor.NonEmpty

Contents

Synopsis

Documentation

data K1 c a Source #

Applicative Functor regular expression.

Instances

Functor (K1 c) Source #
Instance details Defined in Kleene.Functor.NonEmpty Methods fmap :: (a -> b) -> K1 c a -> K1 c b # (<$) :: a -> K1 c b -> K1 c a #
Alt (K1 c) Source #
Instance details Defined in Kleene.Functor.NonEmpty Methods (<!>) :: K1 c a -> K1 c a -> K1 c a # some :: Applicative (K1 c) => K1 c a -> K1 c [a] # many :: Applicative (K1 c) => K1 c a -> K1 c [a] #
Apply (K1 c) Source #
Instance details Defined in Kleene.Functor.NonEmpty Methods (<.>) :: K1 c (a -> b) -> K1 c a -> K1 c b # (.>) :: K1 c a -> K1 c b -> K1 c b # (<.) :: K1 c a -> K1 c b -> K1 c a # liftF2 :: (a -> b -> c0) -> K1 c a -> K1 c b -> K1 c c0 #
c ~ Char => Pretty (K1 c a) Source #	Convert to non-matching JavaScript string which can be used as an argument to `new RegExp` `>>>` `putPretty ("foobar" :: K Char String)`^foobar$ `>>>` `putPretty $ many ("foobar" :: K Char String)`^(foobar)*$
Instance details Defined in Kleene.Functor.NonEmpty Methods pretty :: K1 c a -> String Source # prettyS :: K1 c a -> ShowS Source #

Star behaviour

Constructors

Greedy	`many`
NonGreedy	`few`

Instances

Bounded Greediness Source #
Instance details Defined in Kleene.Internal.Functor Methods minBound :: Greediness # maxBound :: Greediness #
Enum Greediness Source #
Instance details Defined in Kleene.Internal.Functor Methods succ :: Greediness -> Greediness # pred :: Greediness -> Greediness # toEnum :: Int -> Greediness # fromEnum :: Greediness -> Int # enumFrom :: Greediness -> [Greediness] # enumFromThen :: Greediness -> Greediness -> [Greediness] # enumFromTo :: Greediness -> Greediness -> [Greediness] # enumFromThenTo :: Greediness -> Greediness -> Greediness -> [Greediness] #
Eq Greediness Source #
Instance details Defined in Kleene.Internal.Functor Methods (==) :: Greediness -> Greediness -> Bool # (/=) :: Greediness -> Greediness -> Bool #
Ord Greediness Source #
Instance details Defined in Kleene.Internal.Functor Methods compare :: Greediness -> Greediness -> Ordering # (<) :: Greediness -> Greediness -> Bool # (<=) :: Greediness -> Greediness -> Bool # (>) :: Greediness -> Greediness -> Bool # (>=) :: Greediness -> Greediness -> Bool # max :: Greediness -> Greediness -> Greediness # min :: Greediness -> Greediness -> Greediness #
Show Greediness Source #
Instance details Defined in Kleene.Internal.Functor Methods showsPrec :: Int -> Greediness -> ShowS # show :: Greediness -> String # showList :: [Greediness] -> ShowS #

Constructors

>>> putPretty anyChar
^[^]$

oneof :: (Ord c, Enum c, Foldable f) => f c -> K1 c c Source #

>>> putPretty $ oneof ("foobar" :: [Char])
^[a-bfor]$

char :: (Ord c, Enum c) => c -> K1 c c Source #

>>> putPretty $ char 'x'
^x$

charRange :: (Enum c, Ord c) => c -> c -> K1 c c Source #

>>> putPretty $ charRange 'a' 'z'
^[a-z]$

>>> putPretty dot
^.$

>>> putPretty everything1
^[^][^]*$

Matches nothing?

Matches whole input?

match :: K1 c a -> [c] -> Maybe a Source #

Match using regex-applicative

toRE :: (Ord c, Enum c, Bounded c) => K1 c a -> RE c Source #

Convert to RE.

>>> putPretty (toRE $ some1 (string "foo") :: RE.RE Char)
^foo(foo)*$

Convert to any Kleene

toRA :: K1 c a -> RE c a Source #

Convert K to RE from regex-applicative.

>>> R.match (toRA (string "xx" .> everything1 <. string "zz" :: K1 Char (NonEmpty Char))) "xxyyzyyzz"
Just ('y' :| "yzyy")