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


-- | A more progressive alternative to the "base" package
--   
--   This package is intended for those who are tired of keeping long lists
--   of dependencies to the same essential libraries in each package as
--   well as the endless imports of the same APIs all over again. It also
--   supports the modern tendencies in the language.
--   
--   To solve those problems this package does the following:
--   
--   <ul>
--   <li>Reexport the original APIs under the "Rebase" namespace.</li>
--   <li>Export all the possible non-conflicting symbols from the
--   "Rebase.Prelude" module.</li>
--   <li>Give priority to the modern practices in the conflicting
--   cases.</li>
--   </ul>
--   
--   The policy behind the package is only to reexport the non-ambiguous
--   and non-controversial APIs, which the community has obviously settled
--   on. The package is intended to rapidly evolve with the contribution
--   from the community, with the missing features being added with
--   pull-requests.
@package rebase
@version 1

module Rebase.Control.Monad.Trans.Writer.Lazy

module Rebase.Control.Monad.Trans.State.Lazy

module Rebase.Data.Text.Lazy.Builder


-- | Unifies some modules, which are separated in the original API for
--   unknown reasons.
module Rebase.Data.Text.Lazy

module Rebase.Data.Text.Encoding.Error

module Rebase.Data.ByteString.Short

module Rebase.Data.ByteString.Lazy.Char8

module Rebase.Data.ByteString.Lazy

module Rebase.Data.ByteString.Char8

module Rebase.Data.Vector.Mutable


-- | This module simply provides a more meaningful name to
--   <a>Data.List.NonEmpty</a>.
module Rebase.Data.List1

-- | A more meaningful name for the non-empty list. Follows the convention
--   behind such names as <tt>foldr1</tt>.
type List1 = NonEmpty

module Rebase.Data.Time

module Rebase.Data.Void.Unsafe

module Rebase.Data.Void

module Rebase.Data.DList

module Rebase.Data.UUID

module Rebase.Data.Scientific


-- | Unifies some modules, which are separated in the original API for
--   unknown reasons.
module Rebase.Data.Text

module Rebase.Data.ByteString

module Rebase.Data.Vector

module Rebase.Data.HashMap.Strict

module Rebase.Data.HashSet

module Rebase.Data.Set

module Rebase.Data.Sequence

module Rebase.Data.Map.Strict

module Rebase.Data.IntSet

module Rebase.Data.IntMap.Strict

module Rebase.Data.Hashable

module Rebase.Control.Monad.Fail

module Rebase.Data.Either.Validation

module Rebase.Data.Either.Combinators

module Rebase.Control.Monad.Trans.Either

module Rebase.Control.Monad.Writer.Class

module Rebase.Control.Monad.State.Class

module Rebase.Control.Monad.Reader.Class

module Rebase.Control.Monad.Error.Class

module Rebase.Control.Monad.Cont.Class

module Rebase.Control.Monad.Trans.Writer.Strict

module Rebase.Control.Monad.Trans.State.Strict

module Rebase.Control.Monad.Trans.Reader

module Rebase.Control.Monad.Trans.Maybe

module Rebase.Control.Monad.Trans.Except

module Rebase.Control.Monad.Trans.Cont

module Rebase.Control.Monad.Trans.Class

module Rebase.Control.Monad.IO.Class

module Rebase.Control.DeepSeq

module Rebase.Data.Semigroup.Traversable

module Rebase.Data.Semigroup.Foldable

module Rebase.Data.Semigroup.Bitraversable

module Rebase.Data.Semigroup.Bifoldable

module Rebase.Data.Functor.Plus

module Rebase.Data.Functor.Extend

module Rebase.Data.Functor.Bind

module Rebase.Data.Functor.Apply

module Rebase.Data.Functor.Alt

module Rebase.Data.Bifunctor.Apply

module Rebase.Data.Semigroupoid

module Rebase.Data.List.NonEmpty

module Rebase.Data.Semigroup
sappend :: Semigroup a => a -> a -> a

module Rebase.Contravariant.Extras

module Rebase.Data.Functor.Contravariant.Divisible

module Rebase.Data.Functor.Contravariant

module Rebase.Data.Profunctor.Unsafe

module Rebase.Data.Profunctor

module Rebase.Data.List

-- | If you're not a fan of a magic or special cases, you probably have
--   already been looking for this alias.
type List = []

module Rebase.Data.Bifunctor

-- | A more meaningful and conflict-free alias for <a>first</a>.
mapLeft :: Bifunctor p => (a -> b) -> p a c -> p b c

-- | A more meaningful and conflict-free alias for <a>second</a>.
mapRight :: Bifunctor p => (b -> c) -> p a b -> p a c

module Rebase.Data.Functor.Identity


-- | This module reexports the non-conflicting definitions from the modules
--   exported by this package, providing a much more featureful alternative
--   to the standard Prelude.
--   
--   For details check out the source.
module Rebase.Prelude