    -- | Monoidal wrappers for applicative functors. Useful to define tree
    -- folds.

    -- These are the same as in the 'reducers' package. We do not use
    -- 'reducers' to avoid its dependencies.

    {- License for the 'reducers' package
    Copyright 2008-2011 Edward Kmett

    All rights reserved.

    Redistribution and use in source and binary forms, with or without
    modification, are permitted provided that the following conditions
    are met:

    1. Redistributions of source code must retain the above copyright
       notice, this list of conditions and the following disclaimer.

    2. Redistributions in binary form must reproduce the above copyright
       notice, this list of conditions and the following disclaimer in the
       documentation and/or other materials provided with the distribution.

    3. Neither the name of the author nor the names of his contributors
       may be used to endorse or promote products derived from this software
       without specific prior written permission.

    THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR
    IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
    WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
    DISCLAIMED.  IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
    ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
    DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
    OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
    HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
    STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
    ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
    POSSIBILITY OF SUCH DAMAGE.
    -}

    {-# LANGUAGE GeneralizedNewtypeDeriving #-}

    module Test.Tasty.Runners.Reducers where

    import Control.Applicative
    import Prelude  -- Silence AMP import warnings
    import qualified Data.Semigroup as Sem

    -- | Monoid generated by '*>'.
    --
    -- @since 0.8
    newtype Traversal f = Traversal { forall (f :: * -> *). Traversal f -> f ()
    getTraversal :: f () }

    -- | @since 0.12.0.1
    instance Applicative f => Sem.Semigroup (Traversal f) where
      Traversal f ()
    f1 <> :: Traversal f -> Traversal f -> Traversal f
    <> Traversal f ()
    f2 = f () -> Traversal f
    forall (f :: * -> *). f () -> Traversal f
    Traversal (f () -> Traversal f) -> f () -> Traversal f
    forall a b. (a -> b) -> a -> b
    $ f ()
    f1 f () -> f () -> f ()
    forall a b. f a -> f b -> f b
    forall (f :: * -> *) a b. Applicative f => f a -> f b -> f b
    *> f ()
    f2
    instance Applicative f => Monoid (Traversal f) where
      mempty :: Traversal f
    mempty = f () -> Traversal f
    forall (f :: * -> *). f () -> Traversal f
    Traversal (f () -> Traversal f) -> f () -> Traversal f
    forall a b. (a -> b) -> a -> b
    $ () -> f ()
    forall a. a -> f a
    forall (f :: * -> *) a. Applicative f => a -> f a
    pure ()
    #if !MIN_VERSION_base(4,11,0)
      mappend = (Sem.<>)
    #endif

    -- | Monoid generated by @'liftA2' ('<>')@
    --
    -- Starting from GHC 8.6, a similar type is available from "Data.Monoid".
    -- This type is nevertheless kept for compatibility.
    --
    -- @since 0.8
    newtype Ap f a = Ap { forall (f :: * -> *) a. Ap f a -> f a
    getApp :: f a }
      deriving ((forall a b. (a -> b) -> Ap f a -> Ap f b)
    -> (forall a b. a -> Ap f b -> Ap f a) -> Functor (Ap f)
    forall a b. a -> Ap f b -> Ap f a
    forall a b. (a -> b) -> Ap f a -> Ap f b
    forall (f :: * -> *) a b. Functor f => a -> Ap f b -> Ap f a
    forall (f :: * -> *) a b. Functor f => (a -> b) -> Ap f a -> Ap f b
    forall (f :: * -> *).
    (forall a b. (a -> b) -> f a -> f b)
    -> (forall a b. a -> f b -> f a) -> Functor f
    $cfmap :: forall (f :: * -> *) a b. Functor f => (a -> b) -> Ap f a -> Ap f b
    fmap :: forall a b. (a -> b) -> Ap f a -> Ap f b
    $c<$ :: forall (f :: * -> *) a b. Functor f => a -> Ap f b -> Ap f a
    <$ :: forall a b. a -> Ap f b -> Ap f a
    Functor, Functor (Ap f)
    Functor (Ap f) =>
    (forall a. a -> Ap f a)
    -> (forall a b. Ap f (a -> b) -> Ap f a -> Ap f b)
    -> (forall a b c. (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c)
    -> (forall a b. Ap f a -> Ap f b -> Ap f b)
    -> (forall a b. Ap f a -> Ap f b -> Ap f a)
    -> Applicative (Ap f)
    forall a. a -> Ap f a
    forall a b. Ap f a -> Ap f b -> Ap f a
    forall a b. Ap f a -> Ap f b -> Ap f b
    forall a b. Ap f (a -> b) -> Ap f a -> Ap f b
    forall a b c. (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c
    forall (f :: * -> *).
    Functor f =>
    (forall a. a -> f a)
    -> (forall a b. f (a -> b) -> f a -> f b)
    -> (forall a b c. (a -> b -> c) -> f a -> f b -> f c)
    -> (forall a b. f a -> f b -> f b)
    -> (forall a b. f a -> f b -> f a)
    -> Applicative f
    forall (f :: * -> *). Applicative f => Functor (Ap f)
    forall (f :: * -> *) a. Applicative f => a -> Ap f a
    forall (f :: * -> *) a b.
    Applicative f =>
    Ap f a -> Ap f b -> Ap f a
    forall (f :: * -> *) a b.
    Applicative f =>
    Ap f a -> Ap f b -> Ap f b
    forall (f :: * -> *) a b.
    Applicative f =>
    Ap f (a -> b) -> Ap f a -> Ap f b
    forall (f :: * -> *) a b c.
    Applicative f =>
    (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c
    $cpure :: forall (f :: * -> *) a. Applicative f => a -> Ap f a
    pure :: forall a. a -> Ap f a
    $c<*> :: forall (f :: * -> *) a b.
    Applicative f =>
    Ap f (a -> b) -> Ap f a -> Ap f b
    <*> :: forall a b. Ap f (a -> b) -> Ap f a -> Ap f b
    $cliftA2 :: forall (f :: * -> *) a b c.
    Applicative f =>
    (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c
    liftA2 :: forall a b c. (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c
    $c*> :: forall (f :: * -> *) a b.
    Applicative f =>
    Ap f a -> Ap f b -> Ap f b
    *> :: forall a b. Ap f a -> Ap f b -> Ap f b
    $c<* :: forall (f :: * -> *) a b.
    Applicative f =>
    Ap f a -> Ap f b -> Ap f a
    <* :: forall a b. Ap f a -> Ap f b -> Ap f a
    Applicative, Applicative (Ap f)
    Applicative (Ap f) =>
    (forall a b. Ap f a -> (a -> Ap f b) -> Ap f b)
    -> (forall a b. Ap f a -> Ap f b -> Ap f b)
    -> (forall a. a -> Ap f a)
    -> Monad (Ap f)
    forall a. a -> Ap f a
    forall a b. Ap f a -> Ap f b -> Ap f b
    forall a b. Ap f a -> (a -> Ap f b) -> Ap f b
    forall (f :: * -> *). Monad f => Applicative (Ap f)
    forall (f :: * -> *) a. Monad f => a -> Ap f a
    forall (f :: * -> *) a b. Monad f => Ap f a -> Ap f b -> Ap f b
    forall (f :: * -> *) a b.
    Monad f =>
    Ap f a -> (a -> Ap f b) -> Ap f b
    forall (m :: * -> *).
    Applicative m =>
    (forall a b. m a -> (a -> m b) -> m b)
    -> (forall a b. m a -> m b -> m b)
    -> (forall a. a -> m a)
    -> Monad m
    $c>>= :: forall (f :: * -> *) a b.
    Monad f =>
    Ap f a -> (a -> Ap f b) -> Ap f b
    >>= :: forall a b. Ap f a -> (a -> Ap f b) -> Ap f b
    $c>> :: forall (f :: * -> *) a b. Monad f => Ap f a -> Ap f b -> Ap f b
    >> :: forall a b. Ap f a -> Ap f b -> Ap f b
    $creturn :: forall (f :: * -> *) a. Monad f => a -> Ap f a
    return :: forall a. a -> Ap f a
    Monad)

    -- | @since 0.12.0.1
    instance (Applicative f, Monoid a) => Sem.Semigroup (Ap f a) where
      <> :: Ap f a -> Ap f a -> Ap f a
    (<>) = (a -> a -> a) -> Ap f a -> Ap f a -> Ap f a
    forall a b c. (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c
    forall (f :: * -> *) a b c.
    Applicative f =>
    (a -> b -> c) -> f a -> f b -> f c
    liftA2 a -> a -> a
    forall a. Monoid a => a -> a -> a
    mappend
    instance (Applicative f, Monoid a) => Monoid (Ap f a) where
      mempty :: Ap f a
    mempty = a -> Ap f a
    forall a. a -> Ap f a
    forall (f :: * -> *) a. Applicative f => a -> f a
    pure a
    forall a. Monoid a => a
    mempty
    #if !MIN_VERSION_base(4,11,0)
      mappend = (Sem.<>)
    #endif