{-# OPTIONS -fno-warn-orphans #-}

module Data.Function.Traversable
    (
    ) where

import Data.Function.Foldable ()
import Data.Searchable

instance Finite a => Traversable ((->) a) where
    sequenceA :: forall (f :: * -> *) a. Applicative f => (a -> f a) -> f (a -> a)
sequenceA = (a -> f a) -> f (a -> a)
forall a b (f :: * -> *).
(Finite a, Applicative f) =>
(a -> f b) -> f (a -> b)
forall b (f :: * -> *). Applicative f => (a -> f b) -> f (a -> b)
assemble