predicate-typed-0.7.3.0: src/Predicate/Data/String.hs
{-# OPTIONS -Wall #-}
{-# OPTIONS -Wno-compat #-}
{-# OPTIONS -Wincomplete-record-updates #-}
{-# OPTIONS -Wincomplete-uni-patterns #-}
{-# OPTIONS -Wredundant-constraints #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE AllowAmbiguousTypes #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE TypeApplications #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE GADTs #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE ViewPatterns #-}
{-# LANGUAGE NoOverloadedLists #-}
{-# LANGUAGE NoStarIsType #-}
{- |
promoted String functions
-}
module Predicate.Data.String (
TrimBoth
, TrimL
, TrimR
, StripR
, StripL
, IsPrefix
, IsInfix
, IsSuffix
, IsPrefixI
, IsInfixI
, IsSuffixI
, ToString
, FromString
, FromString'
) where
import Predicate.Core
import Predicate.Util
import qualified GHC.TypeLits as GL
import Control.Lens hiding (iall)
import Data.List
import qualified Data.Text.Lens as DTL
import Data.Proxy
import Data.Kind (Type)
import Data.String
import Data.Char
import Data.Function
import qualified Data.ByteString.Char8 as BS8
import qualified Data.ByteString.Lazy.Char8 as BL8
import qualified Data.Text as T
import qualified Data.Text.Lazy as TL
-- $setup
-- >>> :set -XDataKinds
-- >>> :set -XTypeApplications
-- >>> :set -XTypeOperators
-- >>> :set -XOverloadedStrings
-- >>> :set -XNoOverloadedLists
-- >>> import qualified Data.Text as T
-- >>> import Predicate.Prelude
-- >>> import qualified Data.Sequence as Seq
-- | similar to 'T.strip' 'T.stripStart' 'T.stripEnd'
--
-- >>> pz @(TrimBoth (Snd Id)) (20," abc " :: String)
-- PresentT "abc"
--
-- >>> pz @(TrimBoth (Snd Id)) (20,T.pack " abc ")
-- PresentT "abc"
--
-- >>> pz @(TrimL (Snd Id)) (20," abc ")
-- PresentT "abc "
--
-- >>> pz @(TrimR (Snd Id)) (20," abc ")
-- PresentT " abc"
--
-- >>> pz @(TrimR " abc ") ()
-- PresentT " abc"
--
-- >>> pz @(TrimR "") ()
-- PresentT ""
--
-- >>> pz @(TrimBoth " ") ()
-- PresentT ""
--
-- >>> pz @(TrimBoth "") ()
-- PresentT ""
--
data TrimImpl (left :: Bool) (right :: Bool) p
instance (FailUnlessT (OrT l r)
('GL.Text "TrimImpl: left and right cannot both be False")
, GetBool l
, GetBool r
, DTL.IsText (PP p x)
, P p x
) => P (TrimImpl l r p) x where
type PP (TrimImpl l r p) x = PP p x
eval _ opts x = do
let msg0 = "Trim" ++ (if l && r then "Both" else if l then "L" else "R")
l = getBool @l
r = getBool @r
pp <- eval (Proxy @p) opts x
pure $ case getValueLR opts msg0 pp [] of
Left e -> e
Right (view DTL.unpacked -> p) ->
let fl = if l then dropWhile isSpace else id
fr = if r then dropWhileEnd isSpace else id
b = (fl . fr) p
in mkNode opts (PresentT (b ^. DTL.packed)) (msg0 <> litL opts b <> litVerbose opts " | " p) [hh pp]
-- | similar to 'T.stripStart'
--
-- >>> pz @(TrimL (Snd Id)) (20," abc ")
-- PresentT "abc "
--
data TrimL p
type TrimLT p = TrimImpl 'True 'False p
instance P (TrimLT p) x => P (TrimL p) x where
type PP (TrimL p) x = PP (TrimLT p) x
eval _ = eval (Proxy @(TrimLT p))
-- | similar to 'T.stripEnd'
--
-- >>> pz @(TrimR (Snd Id)) (20," abc ")
-- PresentT " abc"
--
-- >>> pz @(TrimR " abc ") ()
-- PresentT " abc"
--
-- >>> pz @(TrimR "") ()
-- PresentT ""
--
data TrimR p
type TrimRT p = TrimImpl 'False 'True p
instance P (TrimRT p) x => P (TrimR p) x where
type PP (TrimR p) x = PP (TrimRT p) x
eval _ = eval (Proxy @(TrimRT p))
-- | similar to 'T.strip'
--
-- >>> pz @(TrimBoth (Snd Id)) (20," abc " :: String)
-- PresentT "abc"
--
-- >>> pz @(TrimBoth (Snd Id)) (20,T.pack " abc ")
-- PresentT "abc"
--
-- >>> pz @(TrimBoth " ") ()
-- PresentT ""
--
-- >>> pz @(TrimBoth "") ()
-- PresentT ""
--
data TrimBoth p
type TrimBothT p = TrimImpl 'True 'True p
instance P (TrimBothT p) x => P (TrimBoth p) x where
type PP (TrimBoth p) x = PP (TrimBothT p) x
eval _ = eval (Proxy @(TrimBothT p))
data StripImpl(left :: Bool) p q
instance (GetBool l
, PP p x ~ String
, P p x
, DTL.IsText (PP q x)
, P q x
) => P (StripImpl l p q) x where
type PP (StripImpl l p q) x = Maybe (PP q x)
eval _ opts x = do
let msg0 = "Strip" ++ if l then "L" else "R"
l = getBool @l
lr <- runPQ msg0 (Proxy @p) (Proxy @q) opts x []
pure $ case lr of
Left e -> e
Right (p,view DTL.unpacked -> q,pp,qq) ->
let b = if l then
let (before,after) = splitAt (length p) q
in if before == p then Just after else Nothing
else
let (before,after) = splitAt (length q - length p) q
in if after == p then Just before else Nothing
in mkNode opts (PresentT (fmap (view DTL.packed) b)) (msg0 <> showL opts b <> litVerbose opts " | p=" p <> litVerbose opts " | q=" q) [hh pp, hh qq]
-- | similar to 'T.stripLeft'
--
-- >>> pz @(StripL "xyz" Id) ("xyzHello" :: String)
-- PresentT (Just "Hello")
--
-- >>> pz @(StripL "xyz" Id) (T.pack "xyzHello")
-- PresentT (Just "Hello")
--
-- >>> pz @(StripL "xyz" Id) "xywHello"
-- PresentT Nothing
--
data StripL p q
type StripLT p q = StripImpl 'True p q
instance P (StripLT p q) x => P (StripL p q) x where
type PP (StripL p q) x = PP (StripLT p q) x
eval _ = eval (Proxy @(StripLT p q))
-- | similar to 'T.stripRight'
--
-- >>> pz @(StripR "xyz" Id) "Hello xyz"
-- PresentT (Just "Hello ")
--
-- >>> pz @(StripR "xyz" Id) "xyzHelloxyw"
-- PresentT Nothing
--
-- >>> pz @(StripR "xyz" Id) ""
-- PresentT Nothing
--
-- >>> pz @(StripR "xyz" "xyz") ()
-- PresentT (Just "")
--
data StripR p q
type StripRT p q = StripImpl 'False p q
instance P (StripRT p q) x => P (StripR p q) x where
type PP (StripR p q) x = PP (StripRT p q) x
eval _ = eval (Proxy @(StripRT p q))
-- | similar to 'isInfixOf' 'isPrefixOf' 'isSuffixOf' for strings only.
--
-- The \'I\' suffixed versions work are case insensitive.
--
-- >>> pz @(IsInfixI "abc" "axAbCd") ()
-- TrueT
--
-- >>> pz @(IsPrefixI "abc" "aBcbCd") ()
-- TrueT
--
-- >>> pz @(IsPrefix "abc" "aBcbCd") ()
-- FalseT
--
-- >>> pz @(IsSuffix "bCd" "aBcbCd") ()
-- TrueT
--
data IsFixImpl (cmp :: Ordering) (ignore :: Bool) p q
instance (GetBool ignore
, P p x
, P q x
, PP p x ~ String
, PP q x ~ String
, GetOrdering cmp
) => P (IsFixImpl cmp ignore p q) x where
type PP (IsFixImpl cmp ignore p q) x = Bool
eval _ opts x = do
let cmp = getOrdering @cmp
ignore = getBool @ignore
lwr = if ignore then map toLower else id
(ff,msg0) = case cmp of
LT -> (isPrefixOf, "IsPrefix")
EQ -> (isInfixOf, "IsInfix")
GT -> (isSuffixOf, "IsSuffix")
pp <- eval (Proxy @p) opts x
case getValueLR opts msg0 pp [] of
Left e -> pure e
Right s0 -> do
let msg1 = msg0 <> (if ignore then "I" else "") <> "(" <> s0 <> ")"
qq <- eval (Proxy @q) opts x
pure $ case getValueLR opts (msg1 <> " q failed") qq [hh pp] of
Left e -> e
Right s1 -> mkNodeB opts (on ff lwr s0 s1) (msg1 <> " " <> litL opts s1) [hh pp, hh qq]
-- | similar to 'isPrefixOf' for strings
--
-- >>> pl @(IsPrefix "xy" Id) "xyzabw"
-- True (IsPrefix(xy) xyzabw)
-- TrueT
--
-- >>> pl @(IsPrefix "ab" Id) "xyzbaw"
-- False (IsPrefix(ab) xyzbaw)
-- FalseT
--
data IsPrefix p q
type IsPrefixT p q = IsFixImpl 'LT 'False p q
instance P (IsPrefixT p q) x => P (IsPrefix p q) x where
type PP (IsPrefix p q) x = PP (IsPrefixT p q) x
eval _ = evalBool (Proxy @(IsPrefixT p q))
-- | similar to 'isInfixOf' for strings
--
-- >>> pl @(IsInfix "ab" Id) "xyzabw"
-- True (IsInfix(ab) xyzabw)
-- TrueT
--
-- >>> pl @(IsInfix "aB" Id) "xyzAbw"
-- False (IsInfix(aB) xyzAbw)
-- FalseT
--
-- >>> pl @(IsInfix "ab" Id) "xyzbaw"
-- False (IsInfix(ab) xyzbaw)
-- FalseT
--
-- >>> pl @(IsInfix (Fst Id) (Snd Id)) ("ab","xyzabw")
-- True (IsInfix(ab) xyzabw)
-- TrueT
--
data IsInfix p q
type IsInfixT p q = IsFixImpl 'EQ 'False p q
instance P (IsInfixT p q) x => P (IsInfix p q) x where
type PP (IsInfix p q) x = PP (IsInfixT p q) x
eval _ = evalBool (Proxy @(IsInfixT p q))
-- | similar to 'isSuffixOf' for strings
--
-- >>> pl @(IsSuffix "bw" Id) "xyzabw"
-- True (IsSuffix(bw) xyzabw)
-- TrueT
--
-- >>> pl @(IsSuffix "bw" Id) "xyzbaw"
-- False (IsSuffix(bw) xyzbaw)
-- FalseT
--
data IsSuffix p q
type IsSuffixT p q = IsFixImpl 'GT 'False p q
instance P (IsSuffixT p q) x => P (IsSuffix p q) x where
type PP (IsSuffix p q) x = PP (IsSuffixT p q) x
eval _ = evalBool (Proxy @(IsSuffixT p q))
-- | similar to case insensitive 'isPrefixOf' for strings
--
data IsPrefixI p q
type IsPrefixIT p q = IsFixImpl 'LT 'True p q
instance P (IsPrefixIT p q) x => P (IsPrefixI p q) x where
type PP (IsPrefixI p q) x = PP (IsPrefixIT p q) x
eval _ = evalBool (Proxy @(IsPrefixIT p q))
-- | similar to case insensitive 'isInfixOf' for strings
--
-- >>> pl @(IsInfixI "aB" Id) "xyzAbw"
-- True (IsInfixI(aB) xyzAbw)
-- TrueT
--
data IsInfixI p q
type IsInfixIT p q = IsFixImpl 'EQ 'True p q
instance P (IsInfixIT p q) x => P (IsInfixI p q) x where
type PP (IsInfixI p q) x = PP (IsInfixIT p q) x
eval _ = evalBool (Proxy @(IsInfixIT p q))
-- | similar to case insensitive 'isSuffixOf' for strings
--
data IsSuffixI p q
type IsSuffixIT p q = IsFixImpl 'GT 'True p q
instance P (IsSuffixIT p q) x => P (IsSuffixI p q) x where
type PP (IsSuffixI p q) x = PP (IsSuffixIT p q) x
eval _ = evalBool (Proxy @(IsSuffixIT p q))
-- | very simple conversion to a string
data ToString p
instance ( ToStringC (PP p x)
, P p x
) => P (ToString p) x where
type PP (ToString p) x = String
eval _ opts x = do
let msg0 = "ToString"
pp <- eval (Proxy @p) opts x
pure $ case getValueLR opts msg0 pp [] of
Left e -> e
Right p ->
let d = toStringC p
in mkNode opts (PresentT d) msg0 [hh pp]
class ToStringC a where
toStringC :: a -> String
instance ToStringC String where
toStringC = id
instance ToStringC T.Text where
toStringC = T.unpack
instance ToStringC TL.Text where
toStringC = TL.unpack
instance ToStringC BL8.ByteString where
toStringC = BL8.unpack
instance ToStringC BS8.ByteString where
toStringC = BS8.unpack
-- | 'fromString' function where you need to provide the type \'t\' of the result
data FromString' t s
instance (P s a
, PP s a ~ String
, Show (PP t a)
, IsString (PP t a)
) => P (FromString' t s) a where
type PP (FromString' t s) a = PP t a
eval _ opts a = do
let msg0 = "FromString"
ss <- eval (Proxy @s) opts a
pure $ case getValueLR opts msg0 ss [] of
Left e -> e
Right s ->
let b = fromString @(PP t a) s
in mkNode opts (PresentT b) (msg0 <> " " <> showL opts b) [hh ss]
-- | 'fromString' function where you need to provide the type \'t\' of the result
--
-- >>> pz @(FromString (Identity _) Id) "abc"
-- PresentT (Identity "abc")
--
-- >>> pz @(FromString (Seq.Seq Char) Id) "abc"
-- PresentT (fromList "abc")
--
data FromString (t :: Type) p
type FromStringPT (t :: Type) p = FromString' (Hole t) p
instance P (FromStringPT t p) x => P (FromString t p) x where
type PP (FromString t p) x = PP (FromStringPT t p) x
eval _ = eval (Proxy @(FromStringPT t p))