base-prelude-1.6.1.1/0000755000000000000000000000000007346545000012417 5ustar0000000000000000base-prelude-1.6.1.1/CHANGELOG.md0000644000000000000000000000244007346545000014230 0ustar0000000000000000# 1.6 * Restrict to min GHC 8.6 * Add Contravariant * Add OverloadedLabels and Records * Add STM.orElse # 1.5 * Exclude Data.Semigroup.Option * Restrict to min GHC 8.4 * Add focused preludes for data types and operators # 1.4 * Restrict to min GHC 8.0 and give preference to MonadFail * Add IsList, Generic1 and export all of System.IO # 1.3 * Give preference to Semigroup definitions over Monoid # 1.2 * Replace the `Foreign` export with `Foreign.Storable`, `Foreign.Ptr`, `Foreign.ForeignPtr`, `Foreign.StablePtr`. It's more conservative and way less likely to cause name collisions. # 1.1 * Export `Foreign` # 1.0.1 * Relaxed the "base" dependency # 1 No changes. # 0.2 * Reexported `Data.Bifunctor`. * `first` and `second` are now (conditionally) exported from `Data.Bifunctor`, not `Control.Arrow`; note that if your version of base is lower than 4.8, `first` and `second` won't be available at all. # 0.1.21 * Reexported `printf` and `hPrintf` from `Text.Printf`. # 0.1.20 * Reexported `Numeric`. # 0.1.19 * Avoided the clash between `(&)` and `sortOn` defined in the package and versions of these functions imported from base. # 0.1.18 * Added implementations of `(&)` and `sortOn` (normally not available in older versions of base). # 0.1.17 * Reexported `Control.Monad.Fix`. base-prelude-1.6.1.1/LICENSE0000644000000000000000000000204207346545000013422 0ustar0000000000000000Copyright (c) 2014, Nikita Volkov Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. base-prelude-1.6.1.1/base-prelude.cabal0000644000000000000000000000325307346545000015756 0ustar0000000000000000cabal-version: 3.0 name: base-prelude version: 1.6.1.1 synopsis: Featureful preludes formed solely from the "base" package description: A library which aims to reexport all the non-conflicting and most general definitions from the \"base\" package. This includes APIs for applicatives, arrows, monoids, foldables, traversables, exceptions, generics, ST, MVars and STM. This package will never have any dependencies other than \"base\". Besides a rich prelude it provides limited ones like "BasePrelude.DataTypes", which only exports the data-types defined across the \"base\" package, and "BasePrelude.Operators", which only exports the common operators. /Versioning policy/ The versioning policy of this package deviates from PVP in the sense that its exports in part are transitively determined by the version of \"base\". Therefore it's recommended for the users of \"base-prelude\" to specify the bounds of \"base\" as well. category: Prelude homepage: https://github.com/nikita-volkov/base-prelude bug-reports: https://github.com/nikita-volkov/base-prelude/issues author: Nikita Volkov maintainer: Nikita Volkov copyright: (c) 2014, Nikita Volkov license: MIT license-file: LICENSE extra-source-files: CHANGELOG.md source-repository head type: git location: git://github.com/nikita-volkov/base-prelude.git library hs-source-dirs: library default-language: Haskell2010 exposed-modules: BasePrelude BasePrelude.DataTypes BasePrelude.Operators build-depends: base >=4.12 && <5 base-prelude-1.6.1.1/library/0000755000000000000000000000000007346545000014063 5ustar0000000000000000base-prelude-1.6.1.1/library/BasePrelude.hs0000644000000000000000000000674207346545000016623 0ustar0000000000000000{-# OPTIONS_GHC -Wno-dodgy-imports -Wno-unused-imports #-} -- | -- Reexports of most of the definitions from the \"base\" package, -- which it is a common practice to import unqualified. -- -- For details check out the source. module BasePrelude ( module Exports, ) where import Control.Applicative as Exports import Control.Arrow as Exports hiding (first, second) import Control.Category as Exports import Control.Concurrent as Exports import Control.Exception as Exports import Control.Monad as Exports hiding (fail, forM, forM_, mapM, mapM_, msum, sequence, sequence_) import Control.Monad.Fail as Exports import Control.Monad.Fix as Exports hiding (fix) import Control.Monad.IO.Class as Exports import Control.Monad.ST as Exports import Data.Bifunctor as Exports import Data.Bits as Exports import Data.Bool as Exports import Data.Char as Exports import Data.Coerce as Exports import Data.Complex as Exports import Data.Data as Exports import Data.Dynamic as Exports import Data.Either as Exports import Data.Fixed as Exports import Data.Foldable as Exports hiding (toList) import Data.Function as Exports hiding (id, (.)) import Data.Functor as Exports hiding (unzip) import Data.Functor.Classes as Exports import Data.Functor.Compose as Exports import Data.Functor.Contravariant as Exports import Data.Functor.Identity as Exports import Data.IORef as Exports import Data.Int as Exports import Data.Ix as Exports import Data.List as Exports hiding (all, and, any, concat, concatMap, elem, find, foldl, foldl', foldl1, foldr, foldr1, mapAccumL, mapAccumR, maximum, maximumBy, minimum, minimumBy, notElem, or, product, sum) import Data.List.NonEmpty as Exports (NonEmpty (..)) import Data.Maybe as Exports import Data.Monoid as Exports hiding (First (..), Last (..), (<>)) import Data.Ord as Exports import Data.Proxy as Exports import Data.Ratio as Exports import Data.STRef as Exports import Data.Semigroup as Exports hiding (Option) import Data.String as Exports import Data.Traversable as Exports import Data.Tuple as Exports import Data.Unique as Exports import Data.Version as Exports import Data.Void as Exports import Data.Word as Exports import Debug.Trace as Exports import Foreign.ForeignPtr as Exports import Foreign.Ptr as Exports import Foreign.StablePtr as Exports import Foreign.Storable as Exports import GHC.Conc as Exports hiding (orElse, threadWaitRead, threadWaitReadSTM, threadWaitWrite, threadWaitWriteSTM, withMVar) import GHC.Exts as Exports (IsList (..), groupWith, inline, lazy, sortWith) import GHC.Generics as Exports (Generic, Generic1) import GHC.IO.Exception as Exports import GHC.OverloadedLabels as Exports import GHC.Records as Exports import Numeric as Exports import Numeric.Natural as Exports import System.Environment as Exports import System.Exit as Exports import System.IO as Exports import System.IO.Error as Exports import System.IO.Unsafe as Exports import System.Mem as Exports import System.Mem.StableName as Exports import System.Timeout as Exports import Text.ParserCombinators.ReadP as Exports (ReadP, ReadS, readP_to_S, readS_to_P) import Text.ParserCombinators.ReadPrec as Exports (ReadPrec, readP_to_Prec, readPrec_to_P, readPrec_to_S, readS_to_Prec) import Text.Printf as Exports (hPrintf, printf) import Text.Read as Exports (Read (..), readEither, readMaybe) import Unsafe.Coerce as Exports import Prelude as Exports hiding (all, and, any, concat, concatMap, elem, fail, foldl, foldl1, foldr, foldr1, id, mapM, mapM_, maximum, minimum, notElem, or, product, sequence, sequence_, sum, (.)) base-prelude-1.6.1.1/library/BasePrelude/0000755000000000000000000000000007346545000016256 5ustar0000000000000000base-prelude-1.6.1.1/library/BasePrelude/DataTypes.hs0000644000000000000000000000237207346545000020514 0ustar0000000000000000-- | -- A module that reexports only the data types -- defined across various modules of the \"base\" package. -- -- By data types we mean that it is the ones we use -- to define data structures. -- It is not abstraction integration wrappers, -- like 'Data.Semigroup.First'. -- It is not resource types like 'System.IO.Handle'. module BasePrelude.DataTypes ( -- * From "Prelude" Prelude.Bool (..), Prelude.Char, Prelude.Double, Prelude.Either (..), Prelude.Float, Prelude.Integer, Prelude.Maybe (..), Prelude.String, -- * From "Data.Int" Data.Int.Int, Data.Int.Int8, Data.Int.Int16, Data.Int.Int32, Data.Int.Int64, -- * From "Data.Word" Data.Word.Word, Data.Word.Word8, Data.Word.Word16, Data.Word.Word32, Data.Word.Word64, -- * From "Data.Complex" Data.Complex.Complex (..), -- * From "Data.Ratio" Data.Ratio.Rational, -- * From "Numeric.Natural" Numeric.Natural.Natural, -- * From "Data.List.NonEmpty" Data.List.NonEmpty.NonEmpty (..), ) where import qualified Data.Complex import qualified Data.Int import qualified Data.List.NonEmpty import qualified Data.Ratio import qualified Data.Word import qualified Numeric.Natural import qualified Prelude base-prelude-1.6.1.1/library/BasePrelude/Operators.hs0000644000000000000000000000337707346545000020602 0ustar0000000000000000-- | -- A collection of common operators provided across -- various modules of the \"base\" package. module BasePrelude.Operators ( -- * From "Control.Applicative" (Control.Applicative.*>), (Control.Applicative.<*), (Control.Applicative.<*>), (Control.Applicative.<**>), (Control.Applicative.<|>), -- * From "Control.Monad" (Control.Monad.<=<), (Control.Monad.=<<), (Control.Monad.>=>), (Control.Monad.>>), (Control.Monad.>>=), -- * From "Data.Bits" (Data.Bits..&.), (Data.Bits..|.), -- * From "Data.Bool" (Data.Bool.&&), (Data.Bool.||), (Data.Eq./=), (Data.Eq.==), -- * From "Data.Function" (Data.Function.$), (Data.Function.&), (Data.Function..), -- * From "Data.Functor" (Data.Functor.$>), (Data.Functor.<$), (Data.Functor.<$>), (Data.Functor.<&>), -- * From "Data.Functor.Contravariant" (Data.Functor.Contravariant.>$), (Data.Functor.Contravariant.>$<), (Data.Functor.Contravariant.>$$<), (Data.Functor.Contravariant.$<), -- * From "Data.Ord" (Data.Ord.<), (Data.Ord.<=), (Data.Ord.>), (Data.Ord.>=), -- * From "Data.Ratio" (Data.Ratio.%), -- * From "Data.Semigroup" (Data.Semigroup.<>), -- * From "Prelude" (Prelude.$!), (Prelude.*), (Prelude.+), (Prelude.-), (Prelude./), (Prelude.^), (Prelude.^^), ) where import qualified Control.Applicative import qualified Control.Monad import qualified Data.Bits import qualified Data.Bool import qualified Data.Eq import qualified Data.Function import qualified Data.Functor import qualified Data.Functor.Contravariant import qualified Data.Ord import qualified Data.Ratio import qualified Data.Semigroup import qualified Prelude