#if defined(__GLASGOW_HASKELL__) && __GLASGOW_HASKELL__ >= 702
#endif
module Linear.Instances () where
import Control.Applicative
import Control.Monad.Fix
import Control.Monad.Zip
import Data.Complex
import Data.Foldable
import Data.Functor.Bind
import Data.HashMap.Lazy as HashMap
import Data.Hashable
import Data.Semigroup
import Data.Semigroup.Foldable
import Data.Semigroup.Traversable
import Data.Traversable
instance (Hashable k, Eq k) => Apply (HashMap k) where
(<.>) = HashMap.intersectionWith id
instance (Hashable k, Eq k) => Bind (HashMap k) where
m >>- f = HashMap.fromList $ do
(k, a) <- HashMap.toList m
case HashMap.lookup k (f a) of
Just b -> [(k,b)]
Nothing -> []
instance Functor Complex where
fmap f (a :+ b) = f a :+ f b
instance Apply Complex where
(a :+ b) <.> (c :+ d) = a c :+ b d
instance Applicative Complex where
pure a = a :+ a
(a :+ b) <*> (c :+ d) = a c :+ b d
instance Bind Complex where
(a :+ b) >>- f = a' :+ b' where
a' :+ _ = f a
_ :+ b' = f b
instance Monad Complex where
return a = a :+ a
(a :+ b) >>= f = a' :+ b' where
a' :+ _ = f a
_ :+ b' = f b
instance MonadZip Complex where
mzipWith = liftA2
instance MonadFix Complex where
mfix f = (let a :+ _ = f a in a) :+ (let _ :+ a = f a in a)
instance Foldable Complex where
foldMap f (a :+ b) = f a `mappend` f b
instance Traversable Complex where
traverse f (a :+ b) = (:+) <$> f a <*> f b
instance Foldable1 Complex where
foldMap1 f (a :+ b) = f a <> f b
instance Traversable1 Complex where
traverse1 f (a :+ b) = (:+) <$> f a <.> f b