-- Hoogle documentation, generated by Haddock -- See Hoogle, http://www.haskell.org/hoogle/ -- | Set of data and type definitions of impossible types. Impossible types are useful when declaring type classes / type families instances that should not be expanded by GHC until a specific type is provided in order to keep the types nice and readable. -- -- Set of data and type definitions of impossible types. Impossible types -- are useful when declaring type classes / type families instances that -- should not be expanded by GHC until a specific type is provided in -- order to keep the types nice and readable. @package impossible @version 1.1.3 module Data.Impossible data Impossible Impossible :: Impossible class ImpCls imp :: HasCallStack => a impossible :: HasCallStack => a impossibleTo :: HasCallStack => String -> a data ImpossibleM1 t1 ImpossibleM1 :: ImpossibleM1 t1 data ImpossibleM2 t1 t2 ImpossibleM2 :: ImpossibleM2 t1 t2 data ImpossibleM3 t1 t2 t3 ImpossibleM3 :: ImpossibleM3 t1 t2 t3 data ImpossibleM4 t1 t2 t3 t4 ImpossibleM4 :: ImpossibleM4 t1 t2 t3 t4 data ImpossibleM5 t1 t2 t3 t4 t5 ImpossibleM5 :: ImpossibleM5 t1 t2 t3 t4 t5 data ImpossibleM6 t1 t2 t3 t4 t5 t6 ImpossibleM6 :: ImpossibleM6 t1 t2 t3 t4 t5 t6 data ImpossibleM7 t1 t2 t3 t4 t5 t6 t7 ImpossibleM7 :: ImpossibleM7 t1 t2 t3 t4 t5 t6 t7 data ImpossibleM8 t1 t2 t3 t4 t5 t6 t7 t8 ImpossibleM8 :: ImpossibleM8 t1 t2 t3 t4 t5 t6 t7 t8 data ImpossibleM9 t1 t2 t3 t4 t5 t6 t7 t8 t9 ImpossibleM9 :: ImpossibleM9 t1 t2 t3 t4 t5 t6 t7 t8 t9 type Imp = Impossible type ImpM = ImpossibleM1 type ImpM1 = ImpossibleM1 type ImpM2 = ImpossibleM2 type ImpM3 = ImpossibleM3 type ImpM4 = ImpossibleM4 type ImpM5 = ImpossibleM5 type ImpM6 = ImpossibleM6 type ImpM7 = ImpossibleM7 type ImpM8 = ImpossibleM8 type ImpM9 = ImpossibleM9 type ImpSymbol = "*I*M*P*O*S*S*I*B*L*E*" instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7) k8 (t8 :: k8). Data.Foldable.Foldable (Data.Impossible.ImpossibleM9 t1 t2 t3 t4 t5 t6 t7 t8) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7) k8 (t8 :: k8). Data.Traversable.Traversable (Data.Impossible.ImpossibleM9 t1 t2 t3 t4 t5 t6 t7 t8) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7) k8 (t8 :: k8). GHC.Base.Functor (Data.Impossible.ImpossibleM9 t1 t2 t3 t4 t5 t6 t7 t8) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7) k8 (t8 :: k8) k9 (t9 :: k9). GHC.Show.Show (Data.Impossible.ImpossibleM9 t1 t2 t3 t4 t5 t6 t7 t8 t9) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7). Data.Foldable.Foldable (Data.Impossible.ImpossibleM8 t1 t2 t3 t4 t5 t6 t7) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7). Data.Traversable.Traversable (Data.Impossible.ImpossibleM8 t1 t2 t3 t4 t5 t6 t7) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7). GHC.Base.Functor (Data.Impossible.ImpossibleM8 t1 t2 t3 t4 t5 t6 t7) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7) k8 (t8 :: k8). GHC.Show.Show (Data.Impossible.ImpossibleM8 t1 t2 t3 t4 t5 t6 t7 t8) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6). Data.Foldable.Foldable (Data.Impossible.ImpossibleM7 t1 t2 t3 t4 t5 t6) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6). Data.Traversable.Traversable (Data.Impossible.ImpossibleM7 t1 t2 t3 t4 t5 t6) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6). GHC.Base.Functor (Data.Impossible.ImpossibleM7 t1 t2 t3 t4 t5 t6) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6) k7 (t7 :: k7). GHC.Show.Show (Data.Impossible.ImpossibleM7 t1 t2 t3 t4 t5 t6 t7) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5). Data.Foldable.Foldable (Data.Impossible.ImpossibleM6 t1 t2 t3 t4 t5) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5). Data.Traversable.Traversable (Data.Impossible.ImpossibleM6 t1 t2 t3 t4 t5) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5). GHC.Base.Functor (Data.Impossible.ImpossibleM6 t1 t2 t3 t4 t5) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5) k6 (t6 :: k6). GHC.Show.Show (Data.Impossible.ImpossibleM6 t1 t2 t3 t4 t5 t6) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4). Data.Foldable.Foldable (Data.Impossible.ImpossibleM5 t1 t2 t3 t4) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4). Data.Traversable.Traversable (Data.Impossible.ImpossibleM5 t1 t2 t3 t4) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4). GHC.Base.Functor (Data.Impossible.ImpossibleM5 t1 t2 t3 t4) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4) k5 (t5 :: k5). GHC.Show.Show (Data.Impossible.ImpossibleM5 t1 t2 t3 t4 t5) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3). Data.Foldable.Foldable (Data.Impossible.ImpossibleM4 t1 t2 t3) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3). Data.Traversable.Traversable (Data.Impossible.ImpossibleM4 t1 t2 t3) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3). GHC.Base.Functor (Data.Impossible.ImpossibleM4 t1 t2 t3) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3) k4 (t4 :: k4). GHC.Show.Show (Data.Impossible.ImpossibleM4 t1 t2 t3 t4) instance forall k1 (t1 :: k1) k2 (t2 :: k2). Data.Foldable.Foldable (Data.Impossible.ImpossibleM3 t1 t2) instance forall k1 (t1 :: k1) k2 (t2 :: k2). Data.Traversable.Traversable (Data.Impossible.ImpossibleM3 t1 t2) instance forall k1 (t1 :: k1) k2 (t2 :: k2). GHC.Base.Functor (Data.Impossible.ImpossibleM3 t1 t2) instance forall k1 (t1 :: k1) k2 (t2 :: k2) k3 (t3 :: k3). GHC.Show.Show (Data.Impossible.ImpossibleM3 t1 t2 t3) instance forall k (t1 :: k). Data.Foldable.Foldable (Data.Impossible.ImpossibleM2 t1) instance forall k (t1 :: k). Data.Traversable.Traversable (Data.Impossible.ImpossibleM2 t1) instance forall k (t1 :: k). GHC.Base.Functor (Data.Impossible.ImpossibleM2 t1) instance forall k1 (t1 :: k1) k2 (t2 :: k2). GHC.Show.Show (Data.Impossible.ImpossibleM2 t1 t2) instance Data.Foldable.Foldable Data.Impossible.ImpossibleM1 instance Data.Traversable.Traversable Data.Impossible.ImpossibleM1 instance GHC.Base.Functor Data.Impossible.ImpossibleM1 instance forall k (t1 :: k). GHC.Show.Show (Data.Impossible.ImpossibleM1 t1) instance GHC.Show.Show Data.Impossible.Impossible instance GHC.Base.Monad Data.Impossible.ImpossibleM1 instance GHC.Base.Applicative Data.Impossible.ImpossibleM1