-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Branch on whether a constraint is satisfied
--   
--   This library provides a mechanism that can be used to branch on
--   whether a constraint is satisfied (not limited to typeclass
--   instances).
--   
--   Usage example:
--   
--   <pre>
--   {-# OPTIONS_GHC -fplugin=IfSat.Plugin #-}
--   
--   module MyModule where
--   
--   import Data.Constraint.If ( IfSat(ifSat) )
--   
--   hypot :: forall a. ( Floating a, IfSat (FMA a) ) =&gt; a -&gt; a -&gt; a
--   hypot = ifSat @(FMA a) withFMA withoutFMA
--     where
--       withFMA :: FMA a =&gt; a -&gt; a -&gt; a
--       withFMA x y =
--         let
--           h = sqrt $ fma x x (y * y)
--           h² = h * h
--           x² = x * x
--           u = fma (-y) y (h² - x²) + fma h h (-h²) - fma x x (-x²)
--         in
--           h - u / ( 2 * h )
--       withoutFMA :: a -&gt; a -&gt; a
--       withoutFMA x y = sqrt ( x * x + y * y )
--   </pre>
--   
--   Here we select between two ways of computing the hypotenuse function
--   based on whether we have access to the fused multiply-add operation
--   
--   <pre>
--   fma :: FMA a =&gt; a -&gt; a -&gt; a -&gt; a
--   </pre>
--   
--   which computes <tt> \ x y z -&gt; ( x * y ) + z </tt> in a single
--   instruction, providing stronger guarantees about precision of the
--   result.
--   
--   A call of the form <tt>hypot @MyNumberType</tt> will either use the
--   robust <tt>withFMA</tt> function when an <tt>FMA MyNumberType</tt>
--   instance is available, or will fallback to the simple
--   <tt>withoutFMA</tt> implementation when no such instance can be found.
@package if-instance
@version 0.2.1.1

module M1
showFun :: forall (a :: Type). IfSat (Show (a -> a)) => (a -> a) -> String
test1 :: (Bool -> Bool) -> String

module M2
test2 :: (a -> a) -> String
test3 :: (Bool -> Bool) -> String
test :: String
instance GHC.Show.Show (GHC.Types.Bool -> GHC.Types.Bool)