Kleene.Functor.NonEmpty

Documentation

data K1 c a

Applicative Functor regular expression.

Instances

Functor (K1 c)

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)

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)

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)

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)*$

Defined in Kleene.Functor.NonEmpty

Methods

pretty :: K1 c a -> String

prettyS :: K1 c a -> ShowS

data Greediness

Star behaviour

Constructors

Greedy

many

NonGreedy

few

Instances

Bounded Greediness

Defined in Kleene.Internal.Functor

Methods

minBound :: Greediness

maxBound :: Greediness

Enum Greediness

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

Defined in Kleene.Internal.Functor

Methods

(==) :: Greediness -> Greediness -> Bool

(/=) :: Greediness -> Greediness -> Bool

Ord Greediness

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

Defined in Kleene.Internal.Functor

Methods

showsPrec :: Int -> Greediness -> ShowS

show :: Greediness -> String

showList :: [Greediness] -> ShowS

Constructors

some1 :: K1 c a -> K1 c (NonEmpty a)

anyChar :: (Ord c, Enum c, Bounded c) => K1 c c

>>> putPretty anyChar
^[^]$

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

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

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

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

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

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

dot :: K1 Char Char

>>> putPretty dot
^.$

everything1 :: (Ord c, Enum c, Bounded c) => K1 c (NonEmpty c)

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

string :: String -> K1 Char (NonEmpty Char)

Queries

isEmpty :: (Ord c, Enum c, Bounded c) => K1 c a -> Bool

Matches nothing?

isEverything :: (Ord c, Enum c, Bounded c) => K1 c a -> Bool

Matches whole input?

Matching

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

Match using regex-applicative

Conversions

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

Convert to RE.

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

toKleene :: FiniteKleene c k => K1 c a -> k

Convert to any Kleene

toRA :: K1 c a -> RE c a

Convert K to RE from regex-applicative.

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

See also match.

nullableProof :: K c a -> Either (K1 c a) (a, K1 c a)

>>> putPretty $ nullableProof (pure True)
Right 1 , ^[]$

>>> putPretty $ nullableProof (many "xyz" :: K Char [String])
Right [] , ^xyz(xyz)*$

>>> putPretty $ nullableProof (many $ toList <$> optional "x" <|> many "yz" :: K Char [[String]])
Right [] , ^(x|yz(yz)*)(x|yz(yz)*)*$