module Bricks.Internal.Prelude
( (<&>)
, module Control.Applicative
, module Control.Arrow
, module Control.Monad
, module Data.Bool
, module Data.Char
, module Data.Either
, module Data.Eq
, module Data.Foldable
, module Data.Function
, module Data.Functor
, module Data.Maybe
, module Data.Monoid
, module Data.Ord
, module Data.Semigroup
, module Data.String
, module Data.Traversable
, module Data.Tuple
, module GHC.Stack
, module Numeric.Natural
, module Prelude
, module Text.Show
) where
import Control.Applicative (Applicative, pure, (*>), (<*), (<*>), (<|>))
import Control.Arrow ((>>>))
import Control.Monad (Monad, (<=<), (=<<), (>=>), (>>=))
import Data.Bool (Bool (False, True), not, (&&), (||))
import Data.Char (Char)
import Data.Either (Either (..), either)
import Data.Eq (Eq ((/=), (==)))
import Data.Foldable (asum, fold, foldMap, foldl, foldl1, foldr, foldr1,
for_, traverse_)
import Data.Function (const, flip, id, ($), (&), (.))
import Data.Functor (Functor, fmap, void, ($>), (<$), (<$>))
import Data.Maybe (Maybe (Just, Nothing), catMaybes, isJust, isNothing,
maybe)
import Data.Monoid (Monoid (mappend, mempty))
import Data.Ord (Ord (..))
import Data.Semigroup (Semigroup ((<>)))
import Data.String (String)
import Data.Traversable (traverse)
import Data.Tuple (fst, snd)
import GHC.Stack (HasCallStack)
import Numeric.Natural (Natural)
import Prelude (undefined)
import Text.Show (Show (show, showList, showsPrec), shows)
(<&>) :: Functor f => f a -> (a -> b) -> f b
(<&>) = flip fmap
infixl 1 <&>