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


-- | Initial project template from stack
--   
--   Please see README.md
@package overload
@version 0.1.0.0


-- | This library provides a mechanism for overloading an indentifier with
--   mutliple definitions. The number of overloads is finite and have to be
--   defined at once.
--   
--   The advantage of this library over the regular typeclass approach is
--   that it behaves very well with type inference.
--   
--   <pre>
--   {-# LANGUAGE TemplateHaskell, TypeFamilies, FlexibleInstances #-}
--   module Overload.Example where
--   
--   import Data.Maybe
--   import Overload
--   
--   f1 :: Bool
--   f1 = True
--   
--   f2 :: Int -&gt; Int
--   f2 x = x + 1
--   
--   f3 :: Num a = Maybe a
--   f3 = Just 0
--   
--   <a>overload</a> "f" ['f1, 'f2, 'f3]
--   
--   test :: IO ()
--   test = do
--       print (f 1)
--       print (f &amp;&amp; True)
--       print (fromMaybe 10 f)
--   </pre>
--   
--   Notice that we didn't have to annotate anything. For the function case
--   it was enough to use <tt>f</tt> as a function. Since there's only one
--   overload that's a function, the argument and the return value are
--   inferred as <a>Int</a>s.
module Overload

-- | Generates a new function with the given name that can behave like
--   multiple functions.
overload :: String -> [Name] -> Q [Dec]
instance Data.Traversable.Traversable Overload.TypeTree
instance Data.Foldable.Foldable Overload.TypeTree
instance GHC.Base.Functor Overload.TypeTree
instance GHC.Show.Show name => GHC.Show.Show (Overload.TypeTree name)
instance GHC.Classes.Ord name => GHC.Classes.Ord (Overload.TypeTree name)
instance GHC.Classes.Eq name => GHC.Classes.Eq (Overload.TypeTree name)