diff --git a/LICENSE b/LICENSE new file mode 100644 --- /dev/null +++ b/LICENSE @@ -0,0 +1,202 @@ + + Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS + + APPENDIX: How to apply the Apache License to your work. + + To apply the Apache License to your work, attach the following + boilerplate notice, with the fields enclosed by brackets "[]" + replaced with your own identifying information. (Don't include + the brackets!) The text should be enclosed in the appropriate + comment syntax for the file format. We also recommend that a + file or class name and description of purpose be included on the + same "printed page" as the copyright notice for easier + identification within third-party archives. + + Copyright [yyyy] [name of copyright owner] + + Licensed under the Apache License, Version 2.0 (the "License"); + you may not use this file except in compliance with the License. + You may obtain a copy of the License at + + http://www.apache.org/licenses/LICENSE-2.0 + + Unless required by applicable law or agreed to in writing, software + distributed under the License is distributed on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + See the License for the specific language governing permissions and + limitations under the License. diff --git a/Setup.hs b/Setup.hs new file mode 100644 --- /dev/null +++ b/Setup.hs @@ -0,0 +1,2 @@ +import Distribution.Simple +main = defaultMain diff --git a/prologue.cabal b/prologue.cabal new file mode 100644 --- /dev/null +++ b/prologue.cabal @@ -0,0 +1,66 @@ +name: prologue +version: 1.0 +synopsis: Replacement for the Haskell's Prelude, exposing more commonly used functions and patching old GHC ones to behave in the newest GHC's way. +-- description: +license: Apache-2.0 +license-file: LICENSE +author: Wojciech Danilo +maintainer: Wojciech Danilo +stability: experimental +homepage: https://github.com/wdanilo/prologue +bug-reports: https://github.com/wdanilo/prologue/issues +copyright: Copyright (C) 2014 Wojciech Danilo +build-type: Simple +-- extra-source-files: +cabal-version: >=1.10 + + +Library + hs-source-dirs: src + ghc-options: -Wall -O2 + default-language: Haskell2010 + + default-extensions: ConstraintKinds + DataKinds + DefaultSignatures + DeriveDataTypeable + DeriveFoldable + DeriveFunctor + DeriveGeneric + DeriveTraversable + DoAndIfThenElse + EmptyDataDecls + FlexibleContexts + FlexibleInstances + GeneralizedNewtypeDeriving + InstanceSigs + LambdaCase + MultiParamTypeClasses + NoImplicitPrelude + OverloadedStrings + StandaloneDeriving + TemplateHaskell + TupleSections + TypeOperators + ViewPatterns + + exposed-modules: Prologue + Data.Text.Class + Data.String.Class + Data.Default.Instances.Missing + Data.Binary.Instances.Missing + + build-depends: base >=4.6 && <4.9 + , binary + , cond + , convert + , data-default + , data-repr + , errors + , lens + , mtl + , pretty-show + , transformers + , transformers-base + , text + , string-qq diff --git a/src/Data/Binary/Instances/Missing.hs b/src/Data/Binary/Instances/Missing.hs new file mode 100644 --- /dev/null +++ b/src/Data/Binary/Instances/Missing.hs @@ -0,0 +1,22 @@ +--------------------------------------------------------------------------- +-- Copyright (C) Flowbox, Inc - All Rights Reserved +-- Flowbox Team , 2014 +-- Proprietary and confidential +-- Unauthorized copying of this file, via any medium is strictly prohibited +--------------------------------------------------------------------------- +{-# LANGUAGE StandaloneDeriving #-} + +module Data.Binary.Instances.Missing where + +import Control.Applicative ((<$>)) +import Data.Binary (Binary (..)) +import Data.Text.Lazy (Text) +import qualified Data.Text.Lazy as Text +import Prelude +import Data.Version +import GHC.Generics(Generic) + + + +deriving instance Generic Version +instance Binary Version diff --git a/src/Data/Default/Instances/Missing.hs b/src/Data/Default/Instances/Missing.hs new file mode 100644 --- /dev/null +++ b/src/Data/Default/Instances/Missing.hs @@ -0,0 +1,17 @@ +--------------------------------------------------------------------------- +-- Copyright (C) Flowbox, Inc - All Rights Reserved +-- Flowbox Team , 2014 +-- Proprietary and confidential +-- Unauthorized copying of this file, via any medium is strictly prohibited +--------------------------------------------------------------------------- +{-# OPTIONS_GHC -fno-warn-orphans #-} +{-# LANGUAGE OverloadedStrings #-} + +module Data.Default.Instances.Missing where + +import Data.Text.Lazy (Text) +import Data.Default + + + +instance Default Text where def = "" diff --git a/src/Data/String/Class.hs b/src/Data/String/Class.hs new file mode 100644 --- /dev/null +++ b/src/Data/String/Class.hs @@ -0,0 +1,42 @@ + +{-# LANGUAGE UndecidableInstances #-} + +{-# LANGUAGE CPP #-} +#if __GLASGOW_HASKELL__ < 710 +{-# LANGUAGE OverlappingInstances #-} +#endif + +module Data.String.Class ( + module Data.String.Class, + module X +) where + +import Prelude +import Data.String as X (IsString (fromString)) +import qualified Data.Text.Lazy as LText +import qualified Data.Text as Text + + +-- === Types === + +class ToString a where + toString :: a -> String + + default toString :: Show a => a -> String + toString = show + + +-- === Instances === + +instance ToString String where + toString = id + +instance ToString LText.Text where + toString = LText.unpack + +instance ToString Text.Text where + toString = Text.unpack + +instance {-# OVERLAPPABLE #-} Show a => ToString a where + toString = show + diff --git a/src/Data/Text/Class.hs b/src/Data/Text/Class.hs new file mode 100644 --- /dev/null +++ b/src/Data/Text/Class.hs @@ -0,0 +1,42 @@ + +module Data.Text.Class where + +import Prelude +import Data.Text.Lazy (Text, pack, unpack) + + +------------------------------------------------------------------------ +-- Type classes +------------------------------------------------------------------------ + +class ToText a where + toText :: a -> Text + +class FromText a where + fromText :: Text -> a + +class (ToText a, FromText a) => IsText a + + +------------------------------------------------------------------------ +-- Instances +------------------------------------------------------------------------ + +instance ToText Text where + toText = id + +instance FromText Text where + fromText = id + +instance IsText Text + +--- + +instance ToText String where + toText = pack + +instance FromText String where + fromText = unpack + +instance IsText String + diff --git a/src/Prologue.hs b/src/Prologue.hs new file mode 100644 --- /dev/null +++ b/src/Prologue.hs @@ -0,0 +1,198 @@ + +{-# OPTIONS_GHC -fno-warn-orphans #-} +{-# LANGUAGE FlexibleContexts #-} +{-# LANGUAGE LambdaCase #-} +{-# LANGUAGE MultiParamTypeClasses #-} +{-# LANGUAGE NoMonomorphismRestriction #-} +{-# LANGUAGE RankNTypes #-} + +module Prologue ( + module Prologue, + module X +) where + +import qualified Data.Traversable as Traversable + +import Data.Binary.Instances.Missing () +import Data.Default.Instances.Missing () +import Data.Foldable (forM_) +import Data.List (intersperse) +import qualified Prelude +import Text.Show.Pretty as X (ppShow) + +import Prelude as X hiding (mapM, mapM_, print, putStr, putStrLn, (++), (.)) +import Data.Function as X (on) +import Data.Maybe as X (mapMaybe) +import Data.Default as X +import Control.Lens as X +import Data.String.Class as X (IsString (fromString), ToString (toString)) +import Control.Applicative as X +import Control.Conditional as X (if', ifM, unless, unlessM, when, whenM, notM, xorM) +import Control.Monad as X (MonadPlus, mplus, mzero, void) +import Control.Monad.IO.Class as X (MonadIO, liftIO) +import Control.Monad.Trans as X (MonadTrans, lift) +import Data.Foldable as X (Foldable, traverse_) +import Data.Monoid as X (Monoid, mappend, mconcat, mempty, (<>)) +import Data.Repr as X (Repr, repr) +import Control.Lens.Wrapped as X (Wrapped, _Wrapped, _Unwrapped, _Wrapping, _Unwrapping, _Wrapped', _Unwrapped', _Wrapping', _Unwrapping', op, ala, alaf) +import Data.Text.Class as X (FromText (fromText), IsText, ToText (toText)) +import Data.Text.Lazy as X (Text) +import Data.Typeable as X (Typeable) +import GHC.Exts as X (IsList, Item, fromList, fromListN, toList) +import GHC.Generics as X (Generic) +import GHC.Exts as X (Constraint) +import Control.Monad.Fix as X (MonadFix) +import Control.Monad as X ((<=<), (>=>)) +import Control.Monad.Base as X +import Data.Traversable as X (mapM) +import Data.Foldable as X (mapM_) +import Control.Error.Util as X (isLeft, isRight) +import Data.String.QQ as X (s) +import GHC.TypeLits as X (Nat, Symbol, SomeNat, SomeSymbol, KnownNat, natVal) +import Data.Typeable as X (Proxy(Proxy), typeOf, typeRep) + + +(++) :: Monoid a => a -> a -> a +(++) = mappend + +-- IO + +print :: (MonadIO m, Show s) => s -> m () +print = liftIO . Prelude.print + +printLn :: MonadIO m => m () +printLn = putStrLn "" + +putStr :: MonadIO m => String -> m () +putStr = liftIO . Prelude.putStr + +putStrLn :: MonadIO m => String -> m () +putStrLn = liftIO . Prelude.putStrLn + +pprint :: (MonadIO m, Show s) => s -> m () +pprint = putStrLn . ppShow + +-- + +fmap2 = fmap.fmap +fmap3 = fmap.fmap2 +fmap4 = fmap.fmap3 +fmap5 = fmap.fmap4 +fmap6 = fmap.fmap5 +fmap7 = fmap.fmap6 +fmap8 = fmap.fmap7 +fmap9 = fmap.fmap8 + + +dot1 = (.) +dot2 = dot1 . dot1 +dot3 = dot1 . dot2 +dot4 = dot1 . dot3 +dot5 = dot1 . dot4 +dot6 = dot1 . dot5 +dot7 = dot1 . dot6 +dot8 = dot1 . dot7 +dot9 = dot1 . dot8 + +infixr 9 . +(.) :: (Functor f) => (a -> b) -> f a -> f b +(.) = fmap +(.:) = dot2 +(.:.) = dot3 +(.::) = dot4 +(.::.) = dot5 +(.:::) = dot6 +(.:::.) = dot7 +(.::::) = dot8 +(.::::.) = dot9 + + + + +fromJustM :: Monad m => Maybe a -> m a +fromJustM Nothing = fail "Prelude.fromJustM: Nothing" +fromJustM (Just x) = return x + + +whenLeft :: (Monad m) => Either a b -> (a -> m ()) -> m () +whenLeft e f = case e of + Left v -> f v + Right _ -> return () + + +whenLeft' :: (Monad m) => Either a b -> m () -> m () +whenLeft' e f = whenLeft e (const f) + + +whenRight :: (Monad m) => Either a b -> (b -> m ()) -> m () +whenRight e f = case e of + Left _ -> return () + Right v -> f v + + +whenRight' :: (Monad m) => Either a b -> m () -> m () +whenRight' e f = whenRight e $ const f + + +($>) :: (Functor f) => a -> f b -> f b +($>) = fmap . flip const + + +withJust :: Monad m => Maybe a -> (a -> m ()) -> m () +withJust = forM_ + + +lift2 :: (Monad (t1 m), Monad m, MonadTrans t, MonadTrans t1) + => m a -> t (t1 m) a +lift2 = lift . lift + + +lift3 :: (Monad (t1 (t2 m)), Monad (t2 m), Monad m, MonadTrans t, MonadTrans t1, MonadTrans t2) + => m a -> t (t1 (t2 m)) a +lift3 = lift . lift2 + + +switch :: Monad m => m Bool -> a -> a -> m a +switch cond fail ok = do + c <- cond + return $ if c then ok else fail + +mjoin :: Monoid a => a -> [a] -> a +mjoin delim l = mconcat (intersperse delim l) + + +show' :: (Show a, IsString s) => a -> s +show' = fromString . Prelude.show + +foldlDef :: (a -> a -> a) -> a -> [a] -> a +foldlDef f d = \case + [] -> d + (x:xs) -> foldl f x xs + + +mapOver :: (Lens' a b) -> (b -> (b, out)) -> (a -> (a, out)) +mapOver lens f s = (s & lens .~ a, out) where + (a, out) = f $ s ^. lens + +mapOverM :: Monad m => (Lens' a b) -> (b -> m (b, out)) -> (a -> m (a, out)) +mapOverM lens f a = do + (b, out) <- f $ a ^. lens + return $ (a & lens .~ b, out) + + +ifElseId :: Bool -> (a -> a) -> (a -> a) +ifElseId cond a = if cond then a else id + + + + +wrapped = _Wrapped' +unwrapped = _Unwrapped' +wrapping = _Wrapping' +unwrapping = _Unwrapping' + +polyWrapped = _Wrapped +polyUnwrapped = _Unwrapped +polyWrapping = _Wrapping +polyUnwrapping = _Unwrapping +