{-# LANGUAGE CPP #-}
{-# LANGUAGE DeriveFoldable #-}
{-# LANGUAGE DeriveTraversable #-}
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE RoleAnnotations #-}
{-# LANGUAGE TemplateHaskell #-}
module Refined.Unsafe.Type
( Refined(Refined)
, Refined1(Refined1)
) where
import Control.DeepSeq (NFData)
import Data.Hashable (Hashable)
import qualified Language.Haskell.TH.Syntax as TH
newtype Refined (p :: k) x
= Refined x
deriving newtype
( Refined p x -> Refined p x -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall k (p :: k) x. Eq x => Refined p x -> Refined p x -> Bool
/= :: Refined p x -> Refined p x -> Bool
$c/= :: forall k (p :: k) x. Eq x => Refined p x -> Refined p x -> Bool
== :: Refined p x -> Refined p x -> Bool
$c== :: forall k (p :: k) x. Eq x => Refined p x -> Refined p x -> Bool
Eq
, Refined p x -> Refined p x -> Bool
Refined p x -> Refined p x -> Ordering
Refined p x -> Refined p x -> Refined p x
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {k} {p :: k} {x}. Ord x => Eq (Refined p x)
forall k (p :: k) x. Ord x => Refined p x -> Refined p x -> Bool
forall k (p :: k) x.
Ord x =>
Refined p x -> Refined p x -> Ordering
forall k (p :: k) x.
Ord x =>
Refined p x -> Refined p x -> Refined p x
min :: Refined p x -> Refined p x -> Refined p x
$cmin :: forall k (p :: k) x.
Ord x =>
Refined p x -> Refined p x -> Refined p x
max :: Refined p x -> Refined p x -> Refined p x
$cmax :: forall k (p :: k) x.
Ord x =>
Refined p x -> Refined p x -> Refined p x
>= :: Refined p x -> Refined p x -> Bool
$c>= :: forall k (p :: k) x. Ord x => Refined p x -> Refined p x -> Bool
> :: Refined p x -> Refined p x -> Bool
$c> :: forall k (p :: k) x. Ord x => Refined p x -> Refined p x -> Bool
<= :: Refined p x -> Refined p x -> Bool
$c<= :: forall k (p :: k) x. Ord x => Refined p x -> Refined p x -> Bool
< :: Refined p x -> Refined p x -> Bool
$c< :: forall k (p :: k) x. Ord x => Refined p x -> Refined p x -> Bool
compare :: Refined p x -> Refined p x -> Ordering
$ccompare :: forall k (p :: k) x.
Ord x =>
Refined p x -> Refined p x -> Ordering
Ord
, Int -> Refined p x -> Int
Refined p x -> Int
forall a. Eq a -> (Int -> a -> Int) -> (a -> Int) -> Hashable a
forall {k} {p :: k} {x}. Hashable x => Eq (Refined p x)
forall k (p :: k) x. Hashable x => Int -> Refined p x -> Int
forall k (p :: k) x. Hashable x => Refined p x -> Int
hash :: Refined p x -> Int
$chash :: forall k (p :: k) x. Hashable x => Refined p x -> Int
hashWithSalt :: Int -> Refined p x -> Int
$chashWithSalt :: forall k (p :: k) x. Hashable x => Int -> Refined p x -> Int
Hashable
, Refined p x -> ()
forall a. (a -> ()) -> NFData a
forall k (p :: k) x. NFData x => Refined p x -> ()
rnf :: Refined p x -> ()
$crnf :: forall k (p :: k) x. NFData x => Refined p x -> ()
NFData
)
deriving stock
( Int -> Refined p x -> ShowS
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k) x. Show x => Int -> Refined p x -> ShowS
forall k (p :: k) x. Show x => [Refined p x] -> ShowS
forall k (p :: k) x. Show x => Refined p x -> String
showList :: [Refined p x] -> ShowS
$cshowList :: forall k (p :: k) x. Show x => [Refined p x] -> ShowS
show :: Refined p x -> String
$cshow :: forall k (p :: k) x. Show x => Refined p x -> String
showsPrec :: Int -> Refined p x -> ShowS
$cshowsPrec :: forall k (p :: k) x. Show x => Int -> Refined p x -> ShowS
Show
)
deriving stock
( forall a. Refined p a -> Bool
forall k (p :: k) a. Eq a => a -> Refined p a -> Bool
forall k (p :: k) a. Num a => Refined p a -> a
forall k (p :: k) a. Ord a => Refined p a -> a
forall k (p :: k) m. Monoid m => Refined p m -> m
forall k (p :: k) a. Refined p a -> Bool
forall k (p :: k) a. Refined p a -> Int
forall k (p :: k) a. Refined p a -> [a]
forall k (p :: k) a. (a -> a -> a) -> Refined p a -> a
forall k (p :: k) m a. Monoid m => (a -> m) -> Refined p a -> m
forall k (p :: k) b a. (b -> a -> b) -> b -> Refined p a -> b
forall k (p :: k) a b. (a -> b -> b) -> b -> Refined p a -> b
forall m a. Monoid m => (a -> m) -> Refined p a -> m
forall a b. (a -> b -> b) -> b -> Refined p a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => Refined p a -> a
$cproduct :: forall k (p :: k) a. Num a => Refined p a -> a
sum :: forall a. Num a => Refined p a -> a
$csum :: forall k (p :: k) a. Num a => Refined p a -> a
minimum :: forall a. Ord a => Refined p a -> a
$cminimum :: forall k (p :: k) a. Ord a => Refined p a -> a
maximum :: forall a. Ord a => Refined p a -> a
$cmaximum :: forall k (p :: k) a. Ord a => Refined p a -> a
elem :: forall a. Eq a => a -> Refined p a -> Bool
$celem :: forall k (p :: k) a. Eq a => a -> Refined p a -> Bool
length :: forall a. Refined p a -> Int
$clength :: forall k (p :: k) a. Refined p a -> Int
null :: forall a. Refined p a -> Bool
$cnull :: forall k (p :: k) a. Refined p a -> Bool
toList :: forall a. Refined p a -> [a]
$ctoList :: forall k (p :: k) a. Refined p a -> [a]
foldl1 :: forall a. (a -> a -> a) -> Refined p a -> a
$cfoldl1 :: forall k (p :: k) a. (a -> a -> a) -> Refined p a -> a
foldr1 :: forall a. (a -> a -> a) -> Refined p a -> a
$cfoldr1 :: forall k (p :: k) a. (a -> a -> a) -> Refined p a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> Refined p a -> b
$cfoldl' :: forall k (p :: k) b a. (b -> a -> b) -> b -> Refined p a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Refined p a -> b
$cfoldl :: forall k (p :: k) b a. (b -> a -> b) -> b -> Refined p a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Refined p a -> b
$cfoldr' :: forall k (p :: k) a b. (a -> b -> b) -> b -> Refined p a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Refined p a -> b
$cfoldr :: forall k (p :: k) a b. (a -> b -> b) -> b -> Refined p a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> Refined p a -> m
$cfoldMap' :: forall k (p :: k) m a. Monoid m => (a -> m) -> Refined p a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Refined p a -> m
$cfoldMap :: forall k (p :: k) m a. Monoid m => (a -> m) -> Refined p a -> m
fold :: forall m. Monoid m => Refined p m -> m
$cfold :: forall k (p :: k) m. Monoid m => Refined p m -> m
Foldable
)
type role Refined nominal nominal
instance (TH.Lift x) => TH.Lift (Refined p x) where
lift :: forall (m :: * -> *). Quote m => Refined p x -> m Exp
lift (Refined x
a) = [|Refined a|]
#if MIN_VERSION_template_haskell(2,16,0)
liftTyped :: forall (m :: * -> *).
Quote m =>
Refined p x -> Code m (Refined p x)
liftTyped (Refined x
a) = [||Refined a||]
#endif
newtype Refined1 (p :: k) f x
= Refined1 (f x)
deriving newtype
( Refined1 p f x -> Refined1 p f x -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
forall k (p :: k) k (f :: k -> *) (x :: k).
Eq (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
/= :: Refined1 p f x -> Refined1 p f x -> Bool
$c/= :: forall k (p :: k) k (f :: k -> *) (x :: k).
Eq (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
== :: Refined1 p f x -> Refined1 p f x -> Bool
$c== :: forall k (p :: k) k (f :: k -> *) (x :: k).
Eq (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
Eq
, Refined1 p f x -> Refined1 p f x -> Bool
Refined1 p f x -> Refined1 p f x -> Ordering
Refined1 p f x -> Refined1 p f x -> Refined1 p f x
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {k} {p :: k} {k} {f :: k -> *} {x :: k}.
Ord (f x) =>
Eq (Refined1 p f x)
forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Ordering
forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Refined1 p f x
min :: Refined1 p f x -> Refined1 p f x -> Refined1 p f x
$cmin :: forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Refined1 p f x
max :: Refined1 p f x -> Refined1 p f x -> Refined1 p f x
$cmax :: forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Refined1 p f x
>= :: Refined1 p f x -> Refined1 p f x -> Bool
$c>= :: forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
> :: Refined1 p f x -> Refined1 p f x -> Bool
$c> :: forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
<= :: Refined1 p f x -> Refined1 p f x -> Bool
$c<= :: forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
< :: Refined1 p f x -> Refined1 p f x -> Bool
$c< :: forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Bool
compare :: Refined1 p f x -> Refined1 p f x -> Ordering
$ccompare :: forall k (p :: k) k (f :: k -> *) (x :: k).
Ord (f x) =>
Refined1 p f x -> Refined1 p f x -> Ordering
Ord
, Int -> Refined1 p f x -> Int
Refined1 p f x -> Int
forall a. Eq a -> (Int -> a -> Int) -> (a -> Int) -> Hashable a
forall {k} {p :: k} {k} {f :: k -> *} {x :: k}.
Hashable (f x) =>
Eq (Refined1 p f x)
forall k (p :: k) k (f :: k -> *) (x :: k).
Hashable (f x) =>
Int -> Refined1 p f x -> Int
forall k (p :: k) k (f :: k -> *) (x :: k).
Hashable (f x) =>
Refined1 p f x -> Int
hash :: Refined1 p f x -> Int
$chash :: forall k (p :: k) k (f :: k -> *) (x :: k).
Hashable (f x) =>
Refined1 p f x -> Int
hashWithSalt :: Int -> Refined1 p f x -> Int
$chashWithSalt :: forall k (p :: k) k (f :: k -> *) (x :: k).
Hashable (f x) =>
Int -> Refined1 p f x -> Int
Hashable
, Refined1 p f x -> ()
forall a. (a -> ()) -> NFData a
forall k (p :: k) k (f :: k -> *) (x :: k).
NFData (f x) =>
Refined1 p f x -> ()
rnf :: Refined1 p f x -> ()
$crnf :: forall k (p :: k) k (f :: k -> *) (x :: k).
NFData (f x) =>
Refined1 p f x -> ()
NFData
, forall k (p :: k) (f :: * -> *) a b.
Functor f =>
a -> Refined1 p f b -> Refined1 p f a
forall k (p :: k) (f :: * -> *) a b.
Functor f =>
(a -> b) -> Refined1 p f a -> Refined1 p f b
forall a b. a -> Refined1 p f b -> Refined1 p f a
forall a b. (a -> b) -> Refined1 p f a -> Refined1 p f b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> Refined1 p f b -> Refined1 p f a
$c<$ :: forall k (p :: k) (f :: * -> *) a b.
Functor f =>
a -> Refined1 p f b -> Refined1 p f a
fmap :: forall a b. (a -> b) -> Refined1 p f a -> Refined1 p f b
$cfmap :: forall k (p :: k) (f :: * -> *) a b.
Functor f =>
(a -> b) -> Refined1 p f a -> Refined1 p f b
Functor
, forall a. Eq a => a -> Refined1 p f a -> Bool
forall a. Num a => Refined1 p f a -> a
forall a. Ord a => Refined1 p f a -> a
forall m. Monoid m => Refined1 p f m -> m
forall a. Refined1 p f a -> Bool
forall a. Refined1 p f a -> Int
forall a. Refined1 p f a -> [a]
forall a. (a -> a -> a) -> Refined1 p f a -> a
forall k (p :: k) (f :: * -> *) a.
(Foldable f, Eq a) =>
a -> Refined1 p f a -> Bool
forall k (p :: k) (f :: * -> *) a.
(Foldable f, Num a) =>
Refined1 p f a -> a
forall k (p :: k) (f :: * -> *) a.
(Foldable f, Ord a) =>
Refined1 p f a -> a
forall k (p :: k) (f :: * -> *) m.
(Foldable f, Monoid m) =>
Refined1 p f m -> m
forall k (p :: k) (f :: * -> *) a.
Foldable f =>
Refined1 p f a -> Bool
forall k (p :: k) (f :: * -> *) a.
Foldable f =>
Refined1 p f a -> Int
forall k (p :: k) (f :: * -> *) a.
Foldable f =>
Refined1 p f a -> [a]
forall k (p :: k) (f :: * -> *) a.
Foldable f =>
(a -> a -> a) -> Refined1 p f a -> a
forall k (p :: k) (f :: * -> *) m a.
(Foldable f, Monoid m) =>
(a -> m) -> Refined1 p f a -> m
forall k (p :: k) (f :: * -> *) b a.
Foldable f =>
(b -> a -> b) -> b -> Refined1 p f a -> b
forall k (p :: k) (f :: * -> *) a b.
Foldable f =>
(a -> b -> b) -> b -> Refined1 p f a -> b
forall m a. Monoid m => (a -> m) -> Refined1 p f a -> m
forall b a. (b -> a -> b) -> b -> Refined1 p f a -> b
forall a b. (a -> b -> b) -> b -> Refined1 p f a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => Refined1 p f a -> a
$cproduct :: forall k (p :: k) (f :: * -> *) a.
(Foldable f, Num a) =>
Refined1 p f a -> a
sum :: forall a. Num a => Refined1 p f a -> a
$csum :: forall k (p :: k) (f :: * -> *) a.
(Foldable f, Num a) =>
Refined1 p f a -> a
minimum :: forall a. Ord a => Refined1 p f a -> a
$cminimum :: forall k (p :: k) (f :: * -> *) a.
(Foldable f, Ord a) =>
Refined1 p f a -> a
maximum :: forall a. Ord a => Refined1 p f a -> a
$cmaximum :: forall k (p :: k) (f :: * -> *) a.
(Foldable f, Ord a) =>
Refined1 p f a -> a
elem :: forall a. Eq a => a -> Refined1 p f a -> Bool
$celem :: forall k (p :: k) (f :: * -> *) a.
(Foldable f, Eq a) =>
a -> Refined1 p f a -> Bool
length :: forall a. Refined1 p f a -> Int
$clength :: forall k (p :: k) (f :: * -> *) a.
Foldable f =>
Refined1 p f a -> Int
null :: forall a. Refined1 p f a -> Bool
$cnull :: forall k (p :: k) (f :: * -> *) a.
Foldable f =>
Refined1 p f a -> Bool
toList :: forall a. Refined1 p f a -> [a]
$ctoList :: forall k (p :: k) (f :: * -> *) a.
Foldable f =>
Refined1 p f a -> [a]
foldl1 :: forall a. (a -> a -> a) -> Refined1 p f a -> a
$cfoldl1 :: forall k (p :: k) (f :: * -> *) a.
Foldable f =>
(a -> a -> a) -> Refined1 p f a -> a
foldr1 :: forall a. (a -> a -> a) -> Refined1 p f a -> a
$cfoldr1 :: forall k (p :: k) (f :: * -> *) a.
Foldable f =>
(a -> a -> a) -> Refined1 p f a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> Refined1 p f a -> b
$cfoldl' :: forall k (p :: k) (f :: * -> *) b a.
Foldable f =>
(b -> a -> b) -> b -> Refined1 p f a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Refined1 p f a -> b
$cfoldl :: forall k (p :: k) (f :: * -> *) b a.
Foldable f =>
(b -> a -> b) -> b -> Refined1 p f a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Refined1 p f a -> b
$cfoldr' :: forall k (p :: k) (f :: * -> *) a b.
Foldable f =>
(a -> b -> b) -> b -> Refined1 p f a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Refined1 p f a -> b
$cfoldr :: forall k (p :: k) (f :: * -> *) a b.
Foldable f =>
(a -> b -> b) -> b -> Refined1 p f a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> Refined1 p f a -> m
$cfoldMap' :: forall k (p :: k) (f :: * -> *) m a.
(Foldable f, Monoid m) =>
(a -> m) -> Refined1 p f a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Refined1 p f a -> m
$cfoldMap :: forall k (p :: k) (f :: * -> *) m a.
(Foldable f, Monoid m) =>
(a -> m) -> Refined1 p f a -> m
fold :: forall m. Monoid m => Refined1 p f m -> m
$cfold :: forall k (p :: k) (f :: * -> *) m.
(Foldable f, Monoid m) =>
Refined1 p f m -> m
Foldable
)
deriving stock
( Int -> Refined1 p f x -> ShowS
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
forall k (p :: k) k (f :: k -> *) (x :: k).
Show (f x) =>
Int -> Refined1 p f x -> ShowS
forall k (p :: k) k (f :: k -> *) (x :: k).
Show (f x) =>
[Refined1 p f x] -> ShowS
forall k (p :: k) k (f :: k -> *) (x :: k).
Show (f x) =>
Refined1 p f x -> String
showList :: [Refined1 p f x] -> ShowS
$cshowList :: forall k (p :: k) k (f :: k -> *) (x :: k).
Show (f x) =>
[Refined1 p f x] -> ShowS
show :: Refined1 p f x -> String
$cshow :: forall k (p :: k) k (f :: k -> *) (x :: k).
Show (f x) =>
Refined1 p f x -> String
showsPrec :: Int -> Refined1 p f x -> ShowS
$cshowsPrec :: forall k (p :: k) k (f :: k -> *) (x :: k).
Show (f x) =>
Int -> Refined1 p f x -> ShowS
Show
, forall {k} {p :: k} {f :: * -> *}.
Traversable f =>
Functor (Refined1 p f)
forall {k} {p :: k} {f :: * -> *}.
Traversable f =>
Foldable (Refined1 p f)
forall k (p :: k) (f :: * -> *) (m :: * -> *) a.
(Traversable f, Monad m) =>
Refined1 p f (m a) -> m (Refined1 p f a)
forall k (p :: k) (f :: * -> *) (f :: * -> *) a.
(Traversable f, Applicative f) =>
Refined1 p f (f a) -> f (Refined1 p f a)
forall k (p :: k) (f :: * -> *) (m :: * -> *) a b.
(Traversable f, Monad m) =>
(a -> m b) -> Refined1 p f a -> m (Refined1 p f b)
forall k (p :: k) (f :: * -> *) (f :: * -> *) a b.
(Traversable f, Applicative f) =>
(a -> f b) -> Refined1 p f a -> f (Refined1 p f b)
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Refined1 p f a -> f (Refined1 p f b)
sequence :: forall (m :: * -> *) a.
Monad m =>
Refined1 p f (m a) -> m (Refined1 p f a)
$csequence :: forall k (p :: k) (f :: * -> *) (m :: * -> *) a.
(Traversable f, Monad m) =>
Refined1 p f (m a) -> m (Refined1 p f a)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Refined1 p f a -> m (Refined1 p f b)
$cmapM :: forall k (p :: k) (f :: * -> *) (m :: * -> *) a b.
(Traversable f, Monad m) =>
(a -> m b) -> Refined1 p f a -> m (Refined1 p f b)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
Refined1 p f (f a) -> f (Refined1 p f a)
$csequenceA :: forall k (p :: k) (f :: * -> *) (f :: * -> *) a.
(Traversable f, Applicative f) =>
Refined1 p f (f a) -> f (Refined1 p f a)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Refined1 p f a -> f (Refined1 p f b)
$ctraverse :: forall k (p :: k) (f :: * -> *) (f :: * -> *) a b.
(Traversable f, Applicative f) =>
(a -> f b) -> Refined1 p f a -> f (Refined1 p f b)
Traversable
)
type role Refined1 nominal nominal nominal
instance TH.Lift (f a) => TH.Lift (Refined1 p f a) where
lift :: forall (m :: * -> *). Quote m => Refined1 p f a -> m Exp
lift (Refined1 f a
fa) = [|Refined1 fa|]
#if MIN_VERSION_template_haskell(2,16,0)
liftTyped :: forall (m :: * -> *).
Quote m =>
Refined1 p f a -> Code m (Refined1 p f a)
liftTyped (Refined1 f a
fa) = [||Refined1 fa||]
#endif