packages feed

papa-base-export 0.3.0 → 0.3.1

raw patch · 29 files changed

+642/−250 lines, 29 filesdep −QuickCheckdep −directorydep −doctestdep ~basesetup-changedPVP ok

version bump matches the API change (PVP)

Dependencies removed: QuickCheck, directory, doctest, filepath, template-haskell

Dependency ranges changed: base

API changes (from Hackage documentation)

+ Papa.Base.Export.Control.Applicative: (*>) :: Applicative f => f a -> f b -> f b
+ Papa.Base.Export.Control.Applicative: (<$) :: Functor f => forall a b. a -> f b -> f a
+ Papa.Base.Export.Control.Applicative: (<$>) :: Functor f => (a -> b) -> f a -> f b
+ Papa.Base.Export.Control.Applicative: (<*) :: Applicative f => f a -> f b -> f a
+ Papa.Base.Export.Control.Applicative: (<**>) :: Applicative f => f a -> f (a -> b) -> f b
+ Papa.Base.Export.Control.Applicative: (<*>) :: Applicative f => f (a -> b) -> f a -> f b
+ Papa.Base.Export.Control.Applicative: (<|>) :: Alternative f => f a -> f a -> f a
+ Papa.Base.Export.Control.Applicative: class Applicative f => Alternative (f :: * -> *)
+ Papa.Base.Export.Control.Applicative: class Functor f => Applicative (f :: * -> *)
+ Papa.Base.Export.Control.Applicative: data Const k a (b :: k) :: forall k. * -> k -> *
+ Papa.Base.Export.Control.Applicative: data WrappedArrow (a :: * -> * -> *) b c :: (* -> * -> *) -> * -> * -> *
+ Papa.Base.Export.Control.Applicative: data WrappedMonad (m :: * -> *) a :: (* -> *) -> * -> *
+ Papa.Base.Export.Control.Applicative: data ZipList a :: * -> *
+ Papa.Base.Export.Control.Applicative: empty :: Alternative f => f a
+ Papa.Base.Export.Control.Applicative: infixl 4 <**>
+ Papa.Base.Export.Control.Applicative: liftA :: Applicative f => (a -> b) -> f a -> f b
+ Papa.Base.Export.Control.Applicative: liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c
+ Papa.Base.Export.Control.Applicative: liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
+ Papa.Base.Export.Control.Applicative: many :: Alternative f => f a -> f [a]
+ Papa.Base.Export.Control.Applicative: optional :: Alternative f => f a -> f (Maybe a)
+ Papa.Base.Export.Control.Applicative: pure :: Applicative f => a -> f a
+ Papa.Base.Export.Control.Applicative: some :: Alternative f => f a -> f [a]
+ Papa.Base.Export.Control.Category: (.) :: Category k cat => cat b c -> cat a b -> cat a c
+ Papa.Base.Export.Control.Category: class Category k (cat :: k -> k -> *)
+ Papa.Base.Export.Control.Category: id :: Category k cat => cat a a
+ Papa.Base.Export.Control.Monad: (<$!>) :: Monad m => (a -> b) -> m a -> m b
+ Papa.Base.Export.Control.Monad: (>>) :: Monad m => m a -> m b -> m b
+ Papa.Base.Export.Control.Monad: (>>=) :: Monad m => m a -> (a -> m b) -> m b
+ Papa.Base.Export.Control.Monad: class Functor (f :: * -> *)
+ Papa.Base.Export.Control.Monad: class Applicative m => Monad (m :: * -> *)
+ Papa.Base.Export.Control.Monad: class (Alternative m, Monad m) => MonadPlus (m :: * -> *)
+ Papa.Base.Export.Control.Monad: filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a]
+ Papa.Base.Export.Control.Monad: fmap :: Functor f => (a -> b) -> f a -> f b
+ Papa.Base.Export.Control.Monad: foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
+ Papa.Base.Export.Control.Monad: foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
+ Papa.Base.Export.Control.Monad: forever :: Applicative f => f a -> f b
+ Papa.Base.Export.Control.Monad: guard :: Alternative f => Bool -> f ()
+ Papa.Base.Export.Control.Monad: infixl 4 <$!>
+ Papa.Base.Export.Control.Monad: mfilter :: MonadPlus m => (a -> Bool) -> m a -> m a
+ Papa.Base.Export.Control.Monad: mplus :: MonadPlus m => m a -> m a -> m a
+ Papa.Base.Export.Control.Monad: msum :: (Foldable t, MonadPlus m) => t (m a) -> m a
+ Papa.Base.Export.Control.Monad: mzero :: MonadPlus m => m a
+ Papa.Base.Export.Control.Monad: replicateM :: Applicative m => Int -> m a -> m [a]
+ Papa.Base.Export.Control.Monad: replicateM_ :: Applicative m => Int -> m a -> m ()
+ Papa.Base.Export.Control.Monad: return :: Monad m => a -> m a
+ Papa.Base.Export.Control.Monad: unless :: Applicative f => Bool -> f () -> f ()
+ Papa.Base.Export.Control.Monad: void :: Functor f => f a -> f ()
+ Papa.Base.Export.Control.Monad: when :: Applicative f => Bool -> f () -> f ()
+ Papa.Base.Export.Data.Bool: (&&) :: Bool -> Bool -> Bool
+ Papa.Base.Export.Data.Bool: (||) :: Bool -> Bool -> Bool
+ Papa.Base.Export.Data.Bool: bool :: a -> a -> Bool -> a
+ Papa.Base.Export.Data.Bool: infixr 2 ||
+ Papa.Base.Export.Data.Bool: infixr 3 &&
+ Papa.Base.Export.Data.Bool: not :: Bool -> Bool
+ Papa.Base.Export.Data.Bool: otherwise :: Bool
+ Papa.Base.Export.Data.Char: ClosePunctuation :: GeneralCategory
+ Papa.Base.Export.Data.Char: ConnectorPunctuation :: GeneralCategory
+ Papa.Base.Export.Data.Char: Control :: GeneralCategory
+ Papa.Base.Export.Data.Char: CurrencySymbol :: GeneralCategory
+ Papa.Base.Export.Data.Char: DashPunctuation :: GeneralCategory
+ Papa.Base.Export.Data.Char: DecimalNumber :: GeneralCategory
+ Papa.Base.Export.Data.Char: EnclosingMark :: GeneralCategory
+ Papa.Base.Export.Data.Char: FinalQuote :: GeneralCategory
+ Papa.Base.Export.Data.Char: Format :: GeneralCategory
+ Papa.Base.Export.Data.Char: InitialQuote :: GeneralCategory
+ Papa.Base.Export.Data.Char: LetterNumber :: GeneralCategory
+ Papa.Base.Export.Data.Char: LineSeparator :: GeneralCategory
+ Papa.Base.Export.Data.Char: LowercaseLetter :: GeneralCategory
+ Papa.Base.Export.Data.Char: MathSymbol :: GeneralCategory
+ Papa.Base.Export.Data.Char: ModifierLetter :: GeneralCategory
+ Papa.Base.Export.Data.Char: ModifierSymbol :: GeneralCategory
+ Papa.Base.Export.Data.Char: NonSpacingMark :: GeneralCategory
+ Papa.Base.Export.Data.Char: NotAssigned :: GeneralCategory
+ Papa.Base.Export.Data.Char: OpenPunctuation :: GeneralCategory
+ Papa.Base.Export.Data.Char: OtherLetter :: GeneralCategory
+ Papa.Base.Export.Data.Char: OtherNumber :: GeneralCategory
+ Papa.Base.Export.Data.Char: OtherPunctuation :: GeneralCategory
+ Papa.Base.Export.Data.Char: OtherSymbol :: GeneralCategory
+ Papa.Base.Export.Data.Char: ParagraphSeparator :: GeneralCategory
+ Papa.Base.Export.Data.Char: PrivateUse :: GeneralCategory
+ Papa.Base.Export.Data.Char: Space :: GeneralCategory
+ Papa.Base.Export.Data.Char: SpacingCombiningMark :: GeneralCategory
+ Papa.Base.Export.Data.Char: Surrogate :: GeneralCategory
+ Papa.Base.Export.Data.Char: TitlecaseLetter :: GeneralCategory
+ Papa.Base.Export.Data.Char: UppercaseLetter :: GeneralCategory
+ Papa.Base.Export.Data.Char: chr :: Int -> Char
+ Papa.Base.Export.Data.Char: data Char :: *
+ Papa.Base.Export.Data.Char: data GeneralCategory :: *
+ Papa.Base.Export.Data.Char: isAlpha :: Char -> Bool
+ Papa.Base.Export.Data.Char: isAlphaNum :: Char -> Bool
+ Papa.Base.Export.Data.Char: isAscii :: Char -> Bool
+ Papa.Base.Export.Data.Char: isAsciiLower :: Char -> Bool
+ Papa.Base.Export.Data.Char: isAsciiUpper :: Char -> Bool
+ Papa.Base.Export.Data.Char: isControl :: Char -> Bool
+ Papa.Base.Export.Data.Char: isDigit :: Char -> Bool
+ Papa.Base.Export.Data.Char: isHexDigit :: Char -> Bool
+ Papa.Base.Export.Data.Char: isLatin1 :: Char -> Bool
+ Papa.Base.Export.Data.Char: isLetter :: Char -> Bool
+ Papa.Base.Export.Data.Char: isLower :: Char -> Bool
+ Papa.Base.Export.Data.Char: isMark :: Char -> Bool
+ Papa.Base.Export.Data.Char: isNumber :: Char -> Bool
+ Papa.Base.Export.Data.Char: isOctDigit :: Char -> Bool
+ Papa.Base.Export.Data.Char: isPrint :: Char -> Bool
+ Papa.Base.Export.Data.Char: isPunctuation :: Char -> Bool
+ Papa.Base.Export.Data.Char: isSeparator :: Char -> Bool
+ Papa.Base.Export.Data.Char: isSpace :: Char -> Bool
+ Papa.Base.Export.Data.Char: isSymbol :: Char -> Bool
+ Papa.Base.Export.Data.Char: isUpper :: Char -> Bool
+ Papa.Base.Export.Data.Char: ord :: Char -> Int
+ Papa.Base.Export.Data.Char: toLower :: Char -> Char
+ Papa.Base.Export.Data.Char: toTitle :: Char -> Char
+ Papa.Base.Export.Data.Char: toUpper :: Char -> Char
+ Papa.Base.Export.Data.Either: Left :: a -> Either a b
+ Papa.Base.Export.Data.Either: Right :: b -> Either a b
+ Papa.Base.Export.Data.Either: data Either a b :: * -> * -> *
+ Papa.Base.Export.Data.Either: either :: (a -> c) -> (b -> c) -> Either a b -> c
+ Papa.Base.Export.Data.Either: isLeft :: Either a b -> Bool
+ Papa.Base.Export.Data.Either: isRight :: Either a b -> Bool
+ Papa.Base.Export.Data.Either: partitionEithers :: [Either a b] -> ([a], [b])
+ Papa.Base.Export.Data.Eq: (/=) :: Eq a => a -> a -> Bool
+ Papa.Base.Export.Data.Eq: (==) :: Eq a => a -> a -> Bool
+ Papa.Base.Export.Data.Eq: class Eq a
+ Papa.Base.Export.Data.Foldable: all :: Foldable t => (a -> Bool) -> t a -> Bool
+ Papa.Base.Export.Data.Foldable: and :: Foldable t => t Bool -> Bool
+ Papa.Base.Export.Data.Foldable: any :: Foldable t => (a -> Bool) -> t a -> Bool
+ Papa.Base.Export.Data.Foldable: asum :: (Foldable t, Alternative f) => t (f a) -> f a
+ Papa.Base.Export.Data.Foldable: class Foldable (t :: * -> *)
+ Papa.Base.Export.Data.Foldable: elem :: (Foldable t, Eq a) => a -> t a -> Bool
+ Papa.Base.Export.Data.Foldable: find :: Foldable t => (a -> Bool) -> t a -> Maybe a
+ Papa.Base.Export.Data.Foldable: fold :: (Foldable t, Monoid m) => t m -> m
+ Papa.Base.Export.Data.Foldable: foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
+ Papa.Base.Export.Data.Foldable: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.Foldable: foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.Foldable: foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
+ Papa.Base.Export.Data.Foldable: foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.Foldable: foldr' :: Foldable t => (a -> b -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.Foldable: foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b
+ Papa.Base.Export.Data.Foldable: for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f ()
+ Papa.Base.Export.Data.Foldable: infix 4 `notElem`
+ Papa.Base.Export.Data.Foldable: notElem :: (Foldable t, Eq a) => a -> t a -> Bool
+ Papa.Base.Export.Data.Foldable: null :: Foldable t => t a -> Bool
+ Papa.Base.Export.Data.Foldable: or :: Foldable t => t Bool -> Bool
+ Papa.Base.Export.Data.Foldable: product :: (Foldable t, Num a) => t a -> a
+ Papa.Base.Export.Data.Foldable: sequenceA_ :: (Foldable t, Applicative f) => t (f a) -> f ()
+ Papa.Base.Export.Data.Foldable: sum :: (Foldable t, Num a) => t a -> a
+ Papa.Base.Export.Data.Foldable: toList :: Foldable t => t a -> [a]
+ Papa.Base.Export.Data.Foldable: traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()
+ Papa.Base.Export.Data.Function: ($) :: (a -> b) -> a -> b
+ Papa.Base.Export.Data.Function: (&) :: a -> (a -> b) -> b
+ Papa.Base.Export.Data.Function: fix :: (a -> a) -> a
+ Papa.Base.Export.Data.Function: infixl 0 `on`
+ Papa.Base.Export.Data.Function: infixl 1 &
+ Papa.Base.Export.Data.Function: infixr 0 $
+ Papa.Base.Export.Data.Function: on :: (b -> b -> c) -> (a -> b) -> a -> a -> c
+ Papa.Base.Export.Data.Functor: ($>) :: Functor f => f a -> b -> f b
+ Papa.Base.Export.Data.Functor: (<$) :: Functor f => a -> f b -> f a
+ Papa.Base.Export.Data.Functor: (<$>) :: Functor f => (a -> b) -> f a -> f b
+ Papa.Base.Export.Data.Functor: class Functor (f :: * -> *)
+ Papa.Base.Export.Data.Functor: fmap :: Functor f => (a -> b) -> f a -> f b
+ Papa.Base.Export.Data.Functor: infixl 4 <$>
+ Papa.Base.Export.Data.Functor: void :: Functor f => f a -> f ()
+ Papa.Base.Export.Data.Int: data Int :: *
+ Papa.Base.Export.Data.Int: data Int16 :: *
+ Papa.Base.Export.Data.Int: data Int32 :: *
+ Papa.Base.Export.Data.Int: data Int64 :: *
+ Papa.Base.Export.Data.Int: data Int8 :: *
+ Papa.Base.Export.Data.List: (\\) :: Eq a => [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: all :: Foldable t => (a -> Bool) -> t a -> Bool
+ Papa.Base.Export.Data.List: and :: Foldable t => t Bool -> Bool
+ Papa.Base.Export.Data.List: any :: Foldable t => (a -> Bool) -> t a -> Bool
+ Papa.Base.Export.Data.List: break :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: cycle :: [a] -> [a]
+ Papa.Base.Export.Data.List: delete :: Eq a => a -> [a] -> [a]
+ Papa.Base.Export.Data.List: deleteBy :: (a -> a -> Bool) -> a -> [a] -> [a]
+ Papa.Base.Export.Data.List: deleteFirstsBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: drop :: Int -> [a] -> [a]
+ Papa.Base.Export.Data.List: dropWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: dropWhileEnd :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: elem :: Foldable t => forall a. Eq a => a -> t a -> Bool
+ Papa.Base.Export.Data.List: find :: Foldable t => (a -> Bool) -> t a -> Maybe a
+ Papa.Base.Export.Data.List: foldl :: Foldable t => forall b a. (b -> a -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.List: foldl' :: Foldable t => forall b a. (b -> a -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.List: foldr :: Foldable t => forall a b. (a -> b -> b) -> b -> t a -> b
+ Papa.Base.Export.Data.List: genericDrop :: Integral i => i -> [a] -> [a]
+ Papa.Base.Export.Data.List: genericLength :: Num i => [a] -> i
+ Papa.Base.Export.Data.List: genericReplicate :: Integral i => i -> a -> [a]
+ Papa.Base.Export.Data.List: genericSplitAt :: Integral i => i -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: genericTake :: Integral i => i -> [a] -> [a]
+ Papa.Base.Export.Data.List: infix 4 `notElem`
+ Papa.Base.Export.Data.List: infix 5 \\
+ Papa.Base.Export.Data.List: insertBy :: (a -> a -> Ordering) -> a -> [a] -> [a]
+ Papa.Base.Export.Data.List: intercalate :: [a] -> [[a]] -> [a]
+ Papa.Base.Export.Data.List: intersect :: Eq a => [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: intersectBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: intersperse :: a -> [a] -> [a]
+ Papa.Base.Export.Data.List: isInfixOf :: Eq a => [a] -> [a] -> Bool
+ Papa.Base.Export.Data.List: isPrefixOf :: Eq a => [a] -> [a] -> Bool
+ Papa.Base.Export.Data.List: isSubsequenceOf :: Eq a => [a] -> [a] -> Bool
+ Papa.Base.Export.Data.List: isSuffixOf :: Eq a => [a] -> [a] -> Bool
+ Papa.Base.Export.Data.List: length :: Foldable t => forall a. t a -> Int
+ Papa.Base.Export.Data.List: lines :: String -> [String]
+ Papa.Base.Export.Data.List: mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ Papa.Base.Export.Data.List: mapAccumR :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ Papa.Base.Export.Data.List: notElem :: (Foldable t, Eq a) => a -> t a -> Bool
+ Papa.Base.Export.Data.List: nub :: Eq a => [a] -> [a]
+ Papa.Base.Export.Data.List: nubBy :: (a -> a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: null :: Foldable t => forall a. t a -> Bool
+ Papa.Base.Export.Data.List: or :: Foldable t => t Bool -> Bool
+ Papa.Base.Export.Data.List: partition :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: permutations :: [a] -> [[a]]
+ Papa.Base.Export.Data.List: product :: Foldable t => forall a. Num a => t a -> a
+ Papa.Base.Export.Data.List: replicate :: Int -> a -> [a]
+ Papa.Base.Export.Data.List: reverse :: [a] -> [a]
+ Papa.Base.Export.Data.List: sort :: Ord a => [a] -> [a]
+ Papa.Base.Export.Data.List: sortBy :: (a -> a -> Ordering) -> [a] -> [a]
+ Papa.Base.Export.Data.List: sortOn :: Ord b => (a -> b) -> [a] -> [a]
+ Papa.Base.Export.Data.List: span :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: splitAt :: Int -> [a] -> ([a], [a])
+ Papa.Base.Export.Data.List: stripPrefix :: Eq a => [a] -> [a] -> Maybe [a]
+ Papa.Base.Export.Data.List: subsequences :: [a] -> [[a]]
+ Papa.Base.Export.Data.List: sum :: Foldable t => forall a. Num a => t a -> a
+ Papa.Base.Export.Data.List: take :: Int -> [a] -> [a]
+ Papa.Base.Export.Data.List: takeWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Data.List: transpose :: [[a]] -> [[a]]
+ Papa.Base.Export.Data.List: union :: Eq a => [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: unionBy :: (a -> a -> Bool) -> [a] -> [a] -> [a]
+ Papa.Base.Export.Data.List: unlines :: [String] -> String
+ Papa.Base.Export.Data.List: unwords :: [String] -> String
+ Papa.Base.Export.Data.List: words :: String -> [String]
+ Papa.Base.Export.Data.List.NonEmpty: (:|) :: a -> [a] -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: data NonEmpty a :: * -> *
+ Papa.Base.Export.Data.List.NonEmpty: group :: (Foldable f, Eq a) => f a -> [NonEmpty a]
+ Papa.Base.Export.Data.List.NonEmpty: group1 :: Eq a => NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: groupAllWith :: Ord b => (a -> b) -> [a] -> [NonEmpty a]
+ Papa.Base.Export.Data.List.NonEmpty: groupAllWith1 :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: groupBy :: Foldable f => (a -> a -> Bool) -> f a -> [NonEmpty a]
+ Papa.Base.Export.Data.List.NonEmpty: groupBy1 :: (a -> a -> Bool) -> NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: groupWith :: (Foldable f, Eq b) => (a -> b) -> f a -> [NonEmpty a]
+ Papa.Base.Export.Data.List.NonEmpty: groupWith1 :: Eq b => (a -> b) -> NonEmpty a -> NonEmpty (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: inits :: Foldable f => f a -> NonEmpty [a]
+ Papa.Base.Export.Data.List.NonEmpty: insert :: (Foldable f, Ord a) => a -> f a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: iterate :: (a -> a) -> a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: nonEmpty :: [a] -> Maybe (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: repeat :: a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: scanl :: Foldable f => (b -> a -> b) -> b -> f a -> NonEmpty b
+ Papa.Base.Export.Data.List.NonEmpty: scanl1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: scanr :: Foldable f => (a -> b -> b) -> b -> f a -> NonEmpty b
+ Papa.Base.Export.Data.List.NonEmpty: scanr1 :: (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Papa.Base.Export.Data.List.NonEmpty: some1 :: Alternative f => f a -> f (NonEmpty a)
+ Papa.Base.Export.Data.List.NonEmpty: tails :: Foldable f => f a -> NonEmpty [a]
+ Papa.Base.Export.Data.List.NonEmpty: unfold :: (a -> (b, Maybe a)) -> a -> NonEmpty b
+ Papa.Base.Export.Data.List.NonEmpty: xor :: NonEmpty Bool -> Bool
+ Papa.Base.Export.Data.Maybe: Just :: a -> Maybe a
+ Papa.Base.Export.Data.Maybe: Nothing :: Maybe a
+ Papa.Base.Export.Data.Maybe: data Maybe a :: * -> *
+ Papa.Base.Export.Data.Maybe: fromMaybe :: a -> Maybe a -> a
+ Papa.Base.Export.Data.Maybe: isJust :: Maybe a -> Bool
+ Papa.Base.Export.Data.Maybe: isNothing :: Maybe a -> Bool
+ Papa.Base.Export.Data.Maybe: maybe :: b -> (a -> b) -> Maybe a -> b
+ Papa.Base.Export.Data.Monoid: class Monoid a
+ Papa.Base.Export.Data.Monoid: data All :: *
+ Papa.Base.Export.Data.Monoid: data Any :: *
+ Papa.Base.Export.Data.Monoid: data Dual a :: * -> *
+ Papa.Base.Export.Data.Monoid: data Endo a :: * -> *
+ Papa.Base.Export.Data.Monoid: data Product a :: * -> *
+ Papa.Base.Export.Data.Monoid: data Sum a :: * -> *
+ Papa.Base.Export.Data.Monoid: mappend :: Monoid a => a -> a -> a
+ Papa.Base.Export.Data.Monoid: mempty :: Monoid a => a
+ Papa.Base.Export.Data.Ord: (<) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Data.Ord: (<=) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Data.Ord: (>) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Data.Ord: (>=) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Data.Ord: Down :: a -> Down a
+ Papa.Base.Export.Data.Ord: class Eq a => Ord a
+ Papa.Base.Export.Data.Ord: compare :: Ord a => a -> a -> Ordering
+ Papa.Base.Export.Data.Ord: comparing :: Ord a => (b -> a) -> b -> b -> Ordering
+ Papa.Base.Export.Data.Ord: max :: Ord a => a -> a -> a
+ Papa.Base.Export.Data.Ord: min :: Ord a => a -> a -> a
+ Papa.Base.Export.Data.Ord: newtype Down a :: * -> *
+ Papa.Base.Export.Data.Ratio: (%) :: Integral a => a -> a -> Ratio a
+ Papa.Base.Export.Data.Ratio: approxRational :: RealFrac a => a -> a -> Rational
+ Papa.Base.Export.Data.Ratio: data Ratio a :: * -> *
+ Papa.Base.Export.Data.Ratio: denominator :: Ratio a -> a
+ Papa.Base.Export.Data.Ratio: infixl 7 %
+ Papa.Base.Export.Data.Ratio: numerator :: Ratio a -> a
+ Papa.Base.Export.Data.Ratio: type Rational = Ratio Integer
+ Papa.Base.Export.Data.Semigroup: (<>) :: Semigroup a => a -> a -> a
+ Papa.Base.Export.Data.Semigroup: Arg :: a -> b -> Arg a b
+ Papa.Base.Export.Data.Semigroup: class Monoid a
+ Papa.Base.Export.Data.Semigroup: class Semigroup a
+ Papa.Base.Export.Data.Semigroup: cycle1 :: Semigroup m => m -> m
+ Papa.Base.Export.Data.Semigroup: data All :: *
+ Papa.Base.Export.Data.Semigroup: data Any :: *
+ Papa.Base.Export.Data.Semigroup: data Arg a b :: * -> * -> *
+ Papa.Base.Export.Data.Semigroup: data Dual a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data Endo a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data First a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data Last a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data Max a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data Min a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data Option a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data Product a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data Sum a :: * -> *
+ Papa.Base.Export.Data.Semigroup: data WrappedMonoid m :: * -> *
+ Papa.Base.Export.Data.Semigroup: diff :: Semigroup m => m -> Endo m
+ Papa.Base.Export.Data.Semigroup: mappend :: Monoid a => a -> a -> a
+ Papa.Base.Export.Data.Semigroup: mempty :: Monoid a => a
+ Papa.Base.Export.Data.Semigroup: mtimesDefault :: (Integral b, Monoid a) => b -> a -> a
+ Papa.Base.Export.Data.Semigroup: option :: b -> (a -> b) -> Option a -> b
+ Papa.Base.Export.Data.Semigroup: sconcat :: Semigroup a => NonEmpty a -> a
+ Papa.Base.Export.Data.Semigroup: stimes :: (Semigroup a, Integral b) => b -> a -> a
+ Papa.Base.Export.Data.Semigroup: stimesIdempotent :: Integral b => b -> a -> a
+ Papa.Base.Export.Data.Semigroup: stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a
+ Papa.Base.Export.Data.Semigroup: stimesMonoid :: (Integral b, Monoid a) => b -> a -> a
+ Papa.Base.Export.Data.Semigroup: type ArgMax a b = Max (Arg a b)
+ Papa.Base.Export.Data.Semigroup: type ArgMin a b = Min (Arg a b)
+ Papa.Base.Export.Data.String: lines :: String -> [String]
+ Papa.Base.Export.Data.String: type String = [Char]
+ Papa.Base.Export.Data.String: unlines :: [String] -> String
+ Papa.Base.Export.Data.String: unwords :: [String] -> String
+ Papa.Base.Export.Data.String: words :: String -> [String]
+ Papa.Base.Export.Data.Traversable: class (Functor t, Foldable t) => Traversable (t :: * -> *)
+ Papa.Base.Export.Data.Traversable: fmapDefault :: Traversable t => (a -> b) -> t a -> t b
+ Papa.Base.Export.Data.Traversable: foldMapDefault :: (Traversable t, Monoid m) => (a -> m) -> t a -> m
+ Papa.Base.Export.Data.Traversable: for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b)
+ Papa.Base.Export.Data.Traversable: mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ Papa.Base.Export.Data.Traversable: sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
+ Papa.Base.Export.Data.Traversable: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b)
+ Papa.Base.Export.Data.Void: absurd :: Void -> a
+ Papa.Base.Export.Data.Void: data Void :: *
+ Papa.Base.Export.Data.Void: vacuous :: Functor f => f Void -> f a
+ Papa.Base.Export.Prelude: ($) :: (a -> b) -> a -> b
+ Papa.Base.Export.Prelude: (&&) :: Bool -> Bool -> Bool
+ Papa.Base.Export.Prelude: (*) :: Num a => a -> a -> a
+ Papa.Base.Export.Prelude: (**) :: Floating a => a -> a -> a
+ Papa.Base.Export.Prelude: (+) :: Num a => a -> a -> a
+ Papa.Base.Export.Prelude: (-) :: Num a => a -> a -> a
+ Papa.Base.Export.Prelude: (/) :: Fractional a => a -> a -> a
+ Papa.Base.Export.Prelude: (/=) :: Eq a => a -> a -> Bool
+ Papa.Base.Export.Prelude: (<$) :: Functor f => a -> f b -> f a
+ Papa.Base.Export.Prelude: (<$>) :: Functor f => (a -> b) -> f a -> f b
+ Papa.Base.Export.Prelude: (<) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Prelude: (<*>) :: Applicative f => f (a -> b) -> f a -> f b
+ Papa.Base.Export.Prelude: (<=) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Prelude: (==) :: Eq a => a -> a -> Bool
+ Papa.Base.Export.Prelude: (>) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Prelude: (>=) :: Ord a => a -> a -> Bool
+ Papa.Base.Export.Prelude: (^) :: (Num a, Integral b) => a -> b -> a
+ Papa.Base.Export.Prelude: (^^) :: (Fractional a, Integral b) => a -> b -> a
+ Papa.Base.Export.Prelude: (||) :: Bool -> Bool -> Bool
+ Papa.Base.Export.Prelude: EQ :: Ordering
+ Papa.Base.Export.Prelude: False :: Bool
+ Papa.Base.Export.Prelude: GT :: Ordering
+ Papa.Base.Export.Prelude: Just :: a -> Maybe a
+ Papa.Base.Export.Prelude: LT :: Ordering
+ Papa.Base.Export.Prelude: Left :: a -> Either a b
+ Papa.Base.Export.Prelude: Nothing :: Maybe a
+ Papa.Base.Export.Prelude: Right :: b -> Either a b
+ Papa.Base.Export.Prelude: True :: Bool
+ Papa.Base.Export.Prelude: abs :: Num a => a -> a
+ Papa.Base.Export.Prelude: acos :: Floating a => a -> a
+ Papa.Base.Export.Prelude: acosh :: Floating a => a -> a
+ Papa.Base.Export.Prelude: all :: Foldable t => (a -> Bool) -> t a -> Bool
+ Papa.Base.Export.Prelude: and :: Foldable t => t Bool -> Bool
+ Papa.Base.Export.Prelude: any :: Foldable t => (a -> Bool) -> t a -> Bool
+ Papa.Base.Export.Prelude: appendFile :: FilePath -> String -> IO ()
+ Papa.Base.Export.Prelude: asin :: Floating a => a -> a
+ Papa.Base.Export.Prelude: asinh :: Floating a => a -> a
+ Papa.Base.Export.Prelude: atan :: Floating a => a -> a
+ Papa.Base.Export.Prelude: atan2 :: RealFloat a => a -> a -> a
+ Papa.Base.Export.Prelude: atanh :: Floating a => a -> a
+ Papa.Base.Export.Prelude: break :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Prelude: ceiling :: RealFrac a => forall b. Integral b => a -> b
+ Papa.Base.Export.Prelude: class Functor f => Applicative (f :: * -> *)
+ Papa.Base.Export.Prelude: class Enum a
+ Papa.Base.Export.Prelude: class Eq a
+ Papa.Base.Export.Prelude: class Fractional a => Floating a
+ Papa.Base.Export.Prelude: class Foldable (t :: * -> *)
+ Papa.Base.Export.Prelude: class Num a => Fractional a
+ Papa.Base.Export.Prelude: class Functor (f :: * -> *)
+ Papa.Base.Export.Prelude: class (Real a, Enum a) => Integral a
+ Papa.Base.Export.Prelude: class Applicative m => Monad (m :: * -> *)
+ Papa.Base.Export.Prelude: class Monoid a
+ Papa.Base.Export.Prelude: class Num a
+ Papa.Base.Export.Prelude: class Eq a => Ord a
+ Papa.Base.Export.Prelude: class (Num a, Ord a) => Real a
+ Papa.Base.Export.Prelude: class (RealFrac a, Floating a) => RealFloat a
+ Papa.Base.Export.Prelude: class Show a
+ Papa.Base.Export.Prelude: class (Functor t, Foldable t) => Traversable (t :: * -> *)
+ Papa.Base.Export.Prelude: compare :: Ord a => a -> a -> Ordering
+ Papa.Base.Export.Prelude: cos :: Floating a => a -> a
+ Papa.Base.Export.Prelude: cosh :: Floating a => a -> a
+ Papa.Base.Export.Prelude: curry :: ((a, b) -> c) -> a -> b -> c
+ Papa.Base.Export.Prelude: cycle :: [a] -> [a]
+ Papa.Base.Export.Prelude: data Bool :: *
+ Papa.Base.Export.Prelude: data Char :: *
+ Papa.Base.Export.Prelude: data Double :: *
+ Papa.Base.Export.Prelude: data Either a b :: * -> * -> *
+ Papa.Base.Export.Prelude: data Float :: *
+ Papa.Base.Export.Prelude: data IO a :: * -> *
+ Papa.Base.Export.Prelude: data Int :: *
+ Papa.Base.Export.Prelude: data Integer :: *
+ Papa.Base.Export.Prelude: data Maybe a :: * -> *
+ Papa.Base.Export.Prelude: data Ordering :: *
+ Papa.Base.Export.Prelude: data Word :: *
+ Papa.Base.Export.Prelude: decodeFloat :: RealFloat a => a -> (Integer, Int)
+ Papa.Base.Export.Prelude: divMod :: Integral a => a -> a -> (a, a)
+ Papa.Base.Export.Prelude: drop :: Int -> [a] -> [a]
+ Papa.Base.Export.Prelude: dropWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Prelude: either :: (a -> c) -> (b -> c) -> Either a b -> c
+ Papa.Base.Export.Prelude: elem :: Foldable t => forall a. Eq a => a -> t a -> Bool
+ Papa.Base.Export.Prelude: encodeFloat :: RealFloat a => Integer -> Int -> a
+ Papa.Base.Export.Prelude: even :: Integral a => a -> Bool
+ Papa.Base.Export.Prelude: exp :: Floating a => a -> a
+ Papa.Base.Export.Prelude: exponent :: RealFloat a => a -> Int
+ Papa.Base.Export.Prelude: filter :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Prelude: floatDigits :: RealFloat a => a -> Int
+ Papa.Base.Export.Prelude: floatRadix :: RealFloat a => a -> Integer
+ Papa.Base.Export.Prelude: floatRange :: RealFloat a => a -> (Int, Int)
+ Papa.Base.Export.Prelude: floor :: RealFrac a => forall b. Integral b => a -> b
+ Papa.Base.Export.Prelude: fmap :: Functor f => (a -> b) -> f a -> f b
+ Papa.Base.Export.Prelude: foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
+ Papa.Base.Export.Prelude: foldl :: Foldable t => (b -> a -> b) -> b -> t a -> b
+ Papa.Base.Export.Prelude: foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b
+ Papa.Base.Export.Prelude: fromInteger :: Num a => Integer -> a
+ Papa.Base.Export.Prelude: fromIntegral :: (Integral a, Num b) => a -> b
+ Papa.Base.Export.Prelude: fromRational :: Fractional a => Rational -> a
+ Papa.Base.Export.Prelude: gcd :: Integral a => a -> a -> a
+ Papa.Base.Export.Prelude: getChar :: IO Char
+ Papa.Base.Export.Prelude: getContents :: IO String
+ Papa.Base.Export.Prelude: getLine :: IO String
+ Papa.Base.Export.Prelude: infix 4 `notElem`
+ Papa.Base.Export.Prelude: infixl 4 <$>
+ Papa.Base.Export.Prelude: infixr 0 $
+ Papa.Base.Export.Prelude: infixr 2 ||
+ Papa.Base.Export.Prelude: infixr 3 &&
+ Papa.Base.Export.Prelude: infixr 8 ^^
+ Papa.Base.Export.Prelude: interact :: (String -> String) -> IO ()
+ Papa.Base.Export.Prelude: ioError :: IOError -> IO a
+ Papa.Base.Export.Prelude: isDenormalized :: RealFloat a => a -> Bool
+ Papa.Base.Export.Prelude: isIEEE :: RealFloat a => a -> Bool
+ Papa.Base.Export.Prelude: isInfinite :: RealFloat a => a -> Bool
+ Papa.Base.Export.Prelude: isNaN :: RealFloat a => a -> Bool
+ Papa.Base.Export.Prelude: isNegativeZero :: RealFloat a => a -> Bool
+ Papa.Base.Export.Prelude: lcm :: Integral a => a -> a -> a
+ Papa.Base.Export.Prelude: lines :: String -> [String]
+ Papa.Base.Export.Prelude: log :: Floating a => a -> a
+ Papa.Base.Export.Prelude: logBase :: Floating a => a -> a -> a
+ Papa.Base.Export.Prelude: max :: Ord a => a -> a -> a
+ Papa.Base.Export.Prelude: maybe :: b -> (a -> b) -> Maybe a -> b
+ Papa.Base.Export.Prelude: mempty :: Monoid a => a
+ Papa.Base.Export.Prelude: min :: Ord a => a -> a -> a
+ Papa.Base.Export.Prelude: mod :: Integral a => a -> a -> a
+ Papa.Base.Export.Prelude: negate :: Num a => a -> a
+ Papa.Base.Export.Prelude: not :: Bool -> Bool
+ Papa.Base.Export.Prelude: notElem :: (Foldable t, Eq a) => a -> t a -> Bool
+ Papa.Base.Export.Prelude: null :: Foldable t => t a -> Bool
+ Papa.Base.Export.Prelude: odd :: Integral a => a -> Bool
+ Papa.Base.Export.Prelude: otherwise :: Bool
+ Papa.Base.Export.Prelude: pi :: Floating a => a
+ Papa.Base.Export.Prelude: product :: (Foldable t, Num a) => t a -> a
+ Papa.Base.Export.Prelude: properFraction :: RealFrac a => forall b. Integral b => a -> (b, a)
+ Papa.Base.Export.Prelude: pure :: Applicative f => forall a. a -> f a
+ Papa.Base.Export.Prelude: putChar :: Char -> IO ()
+ Papa.Base.Export.Prelude: putStr :: String -> IO ()
+ Papa.Base.Export.Prelude: putStrLn :: String -> IO ()
+ Papa.Base.Export.Prelude: quot :: Integral a => a -> a -> a
+ Papa.Base.Export.Prelude: quotRem :: Integral a => a -> a -> (a, a)
+ Papa.Base.Export.Prelude: readFile :: FilePath -> IO String
+ Papa.Base.Export.Prelude: readIO :: Read a => String -> IO a
+ Papa.Base.Export.Prelude: realToFrac :: (Real a, Fractional b) => a -> b
+ Papa.Base.Export.Prelude: recip :: Fractional a => a -> a
+ Papa.Base.Export.Prelude: rem :: Integral a => a -> a -> a
+ Papa.Base.Export.Prelude: replicate :: Int -> a -> [a]
+ Papa.Base.Export.Prelude: round :: RealFrac a => forall b. Integral b => a -> b
+ Papa.Base.Export.Prelude: scaleFloat :: RealFloat a => Int -> a -> a
+ Papa.Base.Export.Prelude: sequenceA :: (Traversable t, Applicative f) => t (f a) -> f (t a)
+ Papa.Base.Export.Prelude: show :: Show a => a -> String
+ Papa.Base.Export.Prelude: showParen :: Bool -> ShowS -> ShowS
+ Papa.Base.Export.Prelude: shows :: Show a => a -> ShowS
+ Papa.Base.Export.Prelude: showsPrec :: Show a => Int -> a -> ShowS
+ Papa.Base.Export.Prelude: significand :: RealFloat a => a -> a
+ Papa.Base.Export.Prelude: signum :: Num a => a -> a
+ Papa.Base.Export.Prelude: sin :: Floating a => a -> a
+ Papa.Base.Export.Prelude: sinh :: Floating a => a -> a
+ Papa.Base.Export.Prelude: span :: (a -> Bool) -> [a] -> ([a], [a])
+ Papa.Base.Export.Prelude: splitAt :: Int -> [a] -> ([a], [a])
+ Papa.Base.Export.Prelude: sqrt :: Floating a => a -> a
+ Papa.Base.Export.Prelude: subtract :: Num a => a -> a -> a
+ Papa.Base.Export.Prelude: sum :: (Foldable t, Num a) => t a -> a
+ Papa.Base.Export.Prelude: take :: Int -> [a] -> [a]
+ Papa.Base.Export.Prelude: takeWhile :: (a -> Bool) -> [a] -> [a]
+ Papa.Base.Export.Prelude: tan :: Floating a => a -> a
+ Papa.Base.Export.Prelude: tanh :: Floating a => a -> a
+ Papa.Base.Export.Prelude: toInteger :: Integral a => a -> Integer
+ Papa.Base.Export.Prelude: toRational :: Real a => a -> Rational
+ Papa.Base.Export.Prelude: traverse :: Traversable t => forall (f :: * -> *) a b. Applicative f => (a -> f b) -> t a -> f (t b)
+ Papa.Base.Export.Prelude: truncate :: RealFrac a => forall b. Integral b => a -> b
+ Papa.Base.Export.Prelude: type FilePath = String
+ Papa.Base.Export.Prelude: type IOError = IOException
+ Papa.Base.Export.Prelude: type Rational = Ratio Integer
+ Papa.Base.Export.Prelude: type ShowS = String -> String
+ Papa.Base.Export.Prelude: uncurry :: (a -> b -> c) -> (a, b) -> c
+ Papa.Base.Export.Prelude: unlines :: [String] -> String
+ Papa.Base.Export.Prelude: until :: (a -> Bool) -> (a -> a) -> a -> a
+ Papa.Base.Export.Prelude: unwords :: [String] -> String
+ Papa.Base.Export.Prelude: unzip3 :: [(a, b, c)] -> ([a], [b], [c])
+ Papa.Base.Export.Prelude: words :: String -> [String]
+ Papa.Base.Export.Prelude: writeFile :: FilePath -> String -> IO ()
+ Papa.Base.Export.Prelude: zip :: [a] -> [b] -> [(a, b)]
+ Papa.Base.Export.Prelude: zip3 :: [a] -> [b] -> [c] -> [(a, b, c)]
+ Papa.Base.Export.Prelude: zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]
+ Papa.Base.Export.Prelude: zipWith3 :: (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]

Files

+ LICENCE view
@@ -0,0 +1,77 @@+CSIRO Open Source Software License Agreement (variation of the BSD / MIT+License)++Copyright (c) 2016, Commonwealth Scientific and Industrial Research Organisation+(CSIRO) ABN 41 687 119 230.++All rights reserved. CSIRO is willing to grant you a license to this+aemo-webservice on the following terms, except where otherwise indicated for+third party material.++Redistribution and use of this software in source and binary forms, with or+without modification, are permitted provided that the following conditions are+met:++* Redistributions of source code must retain the above copyright notice, this+  list of conditions and the following disclaimer.++* 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.++* Neither the name of CSIRO nor the names of its contributors may be used to+  endorse or promote products derived from this software without specific prior+  written permission of CSIRO.++EXCEPT AS EXPRESSLY STATED IN THIS AGREEMENT AND TO THE FULL EXTENT PERMITTED BY+APPLICABLE LAW, THE SOFTWARE IS PROVIDED "AS-IS". CSIRO MAKES NO+REPRESENTATIONS, WARRANTIES OR CONDITIONS OF ANY KIND, EXPRESS OR IMPLIED,+INCLUDING BUT NOT LIMITED TO ANY REPRESENTATIONS, WARRANTIES OR CONDITIONS+REGARDING THE CONTENTS OR ACCURACY OF THE SOFTWARE, OR OF TITLE,+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NON-INFRINGEMENT, THE ABSENCE+OF LATENT OR OTHER DEFECTS, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT+DISCOVERABLE.++TO THE FULL EXTENT PERMITTED BY APPLICABLE LAW, IN NO EVENT SHALL CSIRO BE+LIABLE ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION, IN AN ACTION FOR+BREACH OF CONTRACT, NEGLIGENCE OR OTHERWISE) FOR ANY CLAIM, LOSS, DAMAGES OR+OTHER LIABILITY HOWSOEVER INCURRED.  WITHOUT LIMITING THE SCOPE OF THE PREVIOUS+SENTENCE THE EXCLUSION OF LIABILITY SHALL INCLUDE: LOSS OF PRODUCTION OR+OPERATION TIME, LOSS, DAMAGE OR CORRUPTION OF DATA OR RECORDS; OR LOSS OF+ANTICIPATED SAVINGS, OPPORTUNITY, REVENUE, PROFIT OR GOODWILL, OR OTHER ECONOMIC+LOSS; OR ANY SPECIAL, INCIDENTAL, INDIRECT, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY+DAMAGES, ARISING OUT OF OR IN CONNECTION WITH THIS AGREEMENT, ACCESS OF THE+SOFTWARE OR ANY OTHER DEALINGS WITH THE SOFTWARE, EVEN IF CSIRO HAS BEEN ADVISED+OF THE POSSIBILITY OF SUCH CLAIM, LOSS, DAMAGES OR OTHER LIABILITY.++APPLICABLE LEGISLATION SUCH AS THE AUSTRALIAN CONSUMER LAW MAY APPLY+REPRESENTATIONS, WARRANTIES, OR CONDITIONS, OR IMPOSES OBLIGATIONS OR LIABILITY+ON CSIRO THAT CANNOT BE EXCLUDED, RESTRICTED OR MODIFIED TO THE FULL EXTENT SET+OUT IN THE EXPRESS TERMS OF THIS CLAUSE ABOVE "CONSUMER GUARANTEES".  TO THE+EXTENT THAT SUCH CONSUMER GUARANTEES CONTINUE TO APPLY, THEN TO THE FULL EXTENT+PERMITTED BY THE APPLICABLE LEGISLATION, THE LIABILITY OF CSIRO UNDER THE+RELEVANT CONSUMER GUARANTEE IS LIMITED (WHERE PERMITTED AT CSIRO'S OPTION) TO+ONE OF FOLLOWING REMEDIES OR SUBSTANTIALLY EQUIVALENT REMEDIES:++(a)               THE REPLACEMENT OF THE SOFTWARE, THE SUPPLY OF EQUIVALENT+                  SOFTWARE, OR SUPPLYING RELEVANT SERVICES AGAIN;+(b)               THE REPAIR OF THE SOFTWARE;+(c)               THE PAYMENT OF THE COST OF REPLACING THE+                  SOFTWARE, OF ACQUIRING EQUIVALENT SOFTWARE, HAVING THE+                  RELEVANT SERVICES SUPPLIED AGAIN, OR HAVING THE SOFTWARE+                  REPAIRED.++IN THIS CLAUSE, CSIRO INCLUDES ANY THIRD PARTY AUTHOR OR OWNER OF ANY PART OF+THE SOFTWARE OR MATERIAL DISTRIBUTED WITH IT.  CSIRO MAY ENFORCE ANY RIGHTS ON+BEHALF OF THE RELEVANT THIRD PARTY.++Third Party Components++The following third party components are distributed with the Software.  You+agree to comply with the license terms for these components as part of accessing+the Software.  Other third party software may also be identified in separate+files distributed with the Software.++___________________________________________________________________++___________________________________________________________________
− LICENSE
@@ -1,77 +0,0 @@-CSIRO Open Source Software License Agreement (variation of the BSD / MIT-License)--Copyright (c) 2016, Commonwealth Scientific and Industrial Research Organisation-(CSIRO) ABN 41 687 119 230.--All rights reserved. CSIRO is willing to grant you a license to this-aemo-webservice on the following terms, except where otherwise indicated for-third party material.--Redistribution and use of this software in source and binary forms, with or-without modification, are permitted provided that the following conditions are-met:--* Redistributions of source code must retain the above copyright notice, this-  list of conditions and the following disclaimer.--* 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.--* Neither the name of CSIRO nor the names of its contributors may be used to-  endorse or promote products derived from this software without specific prior-  written permission of CSIRO.--EXCEPT AS EXPRESSLY STATED IN THIS AGREEMENT AND TO THE FULL EXTENT PERMITTED BY-APPLICABLE LAW, THE SOFTWARE IS PROVIDED "AS-IS". CSIRO MAKES NO-REPRESENTATIONS, WARRANTIES OR CONDITIONS OF ANY KIND, EXPRESS OR IMPLIED,-INCLUDING BUT NOT LIMITED TO ANY REPRESENTATIONS, WARRANTIES OR CONDITIONS-REGARDING THE CONTENTS OR ACCURACY OF THE SOFTWARE, OR OF TITLE,-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NON-INFRINGEMENT, THE ABSENCE-OF LATENT OR OTHER DEFECTS, OR THE PRESENCE OR ABSENCE OF ERRORS, WHETHER OR NOT-DISCOVERABLE.--TO THE FULL EXTENT PERMITTED BY APPLICABLE LAW, IN NO EVENT SHALL CSIRO BE-LIABLE ON ANY LEGAL THEORY (INCLUDING, WITHOUT LIMITATION, IN AN ACTION FOR-BREACH OF CONTRACT, NEGLIGENCE OR OTHERWISE) FOR ANY CLAIM, LOSS, DAMAGES OR-OTHER LIABILITY HOWSOEVER INCURRED.  WITHOUT LIMITING THE SCOPE OF THE PREVIOUS-SENTENCE THE EXCLUSION OF LIABILITY SHALL INCLUDE: LOSS OF PRODUCTION OR-OPERATION TIME, LOSS, DAMAGE OR CORRUPTION OF DATA OR RECORDS; OR LOSS OF-ANTICIPATED SAVINGS, OPPORTUNITY, REVENUE, PROFIT OR GOODWILL, OR OTHER ECONOMIC-LOSS; OR ANY SPECIAL, INCIDENTAL, INDIRECT, CONSEQUENTIAL, PUNITIVE OR EXEMPLARY-DAMAGES, ARISING OUT OF OR IN CONNECTION WITH THIS AGREEMENT, ACCESS OF THE-SOFTWARE OR ANY OTHER DEALINGS WITH THE SOFTWARE, EVEN IF CSIRO HAS BEEN ADVISED-OF THE POSSIBILITY OF SUCH CLAIM, LOSS, DAMAGES OR OTHER LIABILITY.--APPLICABLE LEGISLATION SUCH AS THE AUSTRALIAN CONSUMER LAW MAY APPLY-REPRESENTATIONS, WARRANTIES, OR CONDITIONS, OR IMPOSES OBLIGATIONS OR LIABILITY-ON CSIRO THAT CANNOT BE EXCLUDED, RESTRICTED OR MODIFIED TO THE FULL EXTENT SET-OUT IN THE EXPRESS TERMS OF THIS CLAUSE ABOVE "CONSUMER GUARANTEES".  TO THE-EXTENT THAT SUCH CONSUMER GUARANTEES CONTINUE TO APPLY, THEN TO THE FULL EXTENT-PERMITTED BY THE APPLICABLE LEGISLATION, THE LIABILITY OF CSIRO UNDER THE-RELEVANT CONSUMER GUARANTEE IS LIMITED (WHERE PERMITTED AT CSIRO'S OPTION) TO-ONE OF FOLLOWING REMEDIES OR SUBSTANTIALLY EQUIVALENT REMEDIES:--(a)               THE REPLACEMENT OF THE SOFTWARE, THE SUPPLY OF EQUIVALENT-                  SOFTWARE, OR SUPPLYING RELEVANT SERVICES AGAIN;-(b)               THE REPAIR OF THE SOFTWARE;-(c)               THE PAYMENT OF THE COST OF REPLACING THE-                  SOFTWARE, OF ACQUIRING EQUIVALENT SOFTWARE, HAVING THE-                  RELEVANT SERVICES SUPPLIED AGAIN, OR HAVING THE SOFTWARE-                  REPAIRED.--IN THIS CLAUSE, CSIRO INCLUDES ANY THIRD PARTY AUTHOR OR OWNER OF ANY PART OF-THE SOFTWARE OR MATERIAL DISTRIBUTED WITH IT.  CSIRO MAY ENFORCE ANY RIGHTS ON-BEHALF OF THE RELEVANT THIRD PARTY.--Third Party Components--The following third party components are distributed with the Software.  You-agree to comply with the license terms for these components as part of accessing-the Software.  Other third party software may also be identified in separate-files distributed with the Software.--___________________________________________________________________--___________________________________________________________________
+ Setup.hs view
@@ -0,0 +1,2 @@+import Distribution.Simple+main = defaultMain
− Setup.lhs
@@ -1,44 +0,0 @@-#!/usr/bin/env runhaskell-\begin{code}-{-# OPTIONS_GHC -Wall #-}-module Main (main) where--import Data.List ( nub )-import Data.Version ( showVersion )-import Distribution.Package ( PackageName(PackageName), PackageId, InstalledPackageId, packageVersion, packageName )-import Distribution.PackageDescription ( PackageDescription(), TestSuite(..) )-import Distribution.Simple ( defaultMainWithHooks, UserHooks(..), simpleUserHooks )-import Distribution.Simple.Utils ( rewriteFile, createDirectoryIfMissingVerbose )-import Distribution.Simple.BuildPaths ( autogenModulesDir )-import Distribution.Simple.Setup ( BuildFlags(buildVerbosity), fromFlag )-import Distribution.Simple.LocalBuildInfo ( withLibLBI, withTestLBI, LocalBuildInfo(), ComponentLocalBuildInfo(componentPackageDeps) )-import Distribution.Verbosity ( Verbosity )-import System.FilePath ( (</>) )--main :: IO ()-main = defaultMainWithHooks simpleUserHooks-  { buildHook = \pkg lbi hooks flags -> do-     generateBuildModule (fromFlag (buildVerbosity flags)) pkg lbi-     buildHook simpleUserHooks pkg lbi hooks flags-  }--generateBuildModule :: Verbosity -> PackageDescription -> LocalBuildInfo -> IO ()-generateBuildModule verbosity pkg lbi = do-  let dir = autogenModulesDir lbi-  createDirectoryIfMissingVerbose verbosity True dir-  withLibLBI pkg lbi $ \_ libcfg -> do-    withTestLBI pkg lbi $ \suite suitecfg -> do-      rewriteFile (dir </> "Build_" ++ testName suite ++ ".hs") $ unlines-        [ "module Build_" ++ testName suite ++ " where"-        , "deps :: [String]"-        , "deps = " ++ (show $ formatdeps (testDeps libcfg suitecfg))-        ]-  where-    formatdeps = map (formatone . snd)-    formatone p = case packageName p of-      PackageName n -> n ++ "-" ++ showVersion (packageVersion p)--testDeps :: ComponentLocalBuildInfo -> ComponentLocalBuildInfo -> [(InstalledPackageId, PackageId)]-testDeps xs ys = nub $ componentPackageDeps xs ++ componentPackageDeps ys--\end{code}
papa-base-export.cabal view
@@ -1,7 +1,7 @@ name:               papa-base-export-version:            0.3.0+version:            0.3.1 license:            BSD3-license-file:       LICENSE+license-file:       LICENCE author:             Queensland Functional Programming Lab <oᴉ˙ldɟb@llǝʞsɐɥ> maintainer:         Queensland Functional Programming Lab <oᴉ˙ldɟb@llǝʞsɐɥ> copyright:          Copyright (c) 2017, Commonwealth Scientific and Industrial Research Organisation (CSIRO) ABN 41 687 119 230.@@ -14,7 +14,7 @@ homepage:           https://github.com/qfpl/papa bug-reports:        https://github.com/qfpl/papa/issues cabal-version:      >= 1.10-build-type:         Custom+build-type:         Simple extra-source-files: changelog.md  source-repository   head@@ -65,28 +65,3 @@                     Papa.Base.Export.Data.Traversable                     Papa.Base.Export.Data.Void                     Papa.Base.Export.Prelude--test-suite doctests-  type:-                    exitcode-stdio-1.0--  main-is:-                    doctests.hs--  default-language:-                    Haskell2010--  build-depends:-                    base < 5 && >= 3-                    , doctest >= 0.9.7-                    , filepath >= 1.3-                    , directory >= 1.1-                    , QuickCheck >= 2.0-                    , template-haskell >= 2.8--  ghc-options:-                    -Wall-                    -threaded--  hs-source-dirs:-                    test
src/Papa/Base/Export.hs view
@@ -1,29 +1,49 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export(-  module P+    module Papa.Base.Export.Control.Applicative,+    module Papa.Base.Export.Control.Category,+    module Papa.Base.Export.Control.Monad,+    module Papa.Base.Export.Data.Bool,+    module Papa.Base.Export.Data.Char,+    module Papa.Base.Export.Data.Either,+    module Papa.Base.Export.Data.Eq,+    module Papa.Base.Export.Data.Foldable,+    module Papa.Base.Export.Data.Function,+    module Papa.Base.Export.Data.Functor,+    module Papa.Base.Export.Data.Int,+    module Papa.Base.Export.Data.List,+    module Papa.Base.Export.Data.List.NonEmpty,+    module Papa.Base.Export.Data.Maybe,+    module Papa.Base.Export.Data.Monoid,+    module Papa.Base.Export.Data.Ord,+    module Papa.Base.Export.Data.Ratio,+    module Papa.Base.Export.Data.Semigroup,+    module Papa.Base.Export.Data.String,+    module Papa.Base.Export.Data.Traversable,+    module Papa.Base.Export.Data.Void,+    module Papa.Base.Export.Prelude ) where -import Papa.Base.Export.Control.Applicative as P-import Papa.Base.Export.Control.Category as P-import Papa.Base.Export.Control.Monad as P-import Papa.Base.Export.Data.Bool as P-import Papa.Base.Export.Data.Char as P-import Papa.Base.Export.Data.Either as P-import Papa.Base.Export.Data.Eq as P-import Papa.Base.Export.Data.Foldable as P-import Papa.Base.Export.Data.Function as P-import Papa.Base.Export.Data.Functor as P-import Papa.Base.Export.Data.Int as P-import Papa.Base.Export.Data.List as P-import Papa.Base.Export.Data.List.NonEmpty as P-import Papa.Base.Export.Data.Maybe as P-import Papa.Base.Export.Data.Monoid as P-import Papa.Base.Export.Data.Ord as P-import Papa.Base.Export.Data.Ratio as P-import Papa.Base.Export.Data.Semigroup as P-import Papa.Base.Export.Data.String as P-import Papa.Base.Export.Data.Traversable as P-import Papa.Base.Export.Data.Void as P-import Papa.Base.Export.Prelude as P-+import Papa.Base.Export.Control.Applicative+import Papa.Base.Export.Control.Category+import Papa.Base.Export.Control.Monad+import Papa.Base.Export.Data.Bool+import Papa.Base.Export.Data.Char+import Papa.Base.Export.Data.Either+import Papa.Base.Export.Data.Eq+import Papa.Base.Export.Data.Foldable+import Papa.Base.Export.Data.Function+import Papa.Base.Export.Data.Functor+import Papa.Base.Export.Data.Int+import Papa.Base.Export.Data.List+import Papa.Base.Export.Data.List.NonEmpty+import Papa.Base.Export.Data.Maybe+import Papa.Base.Export.Data.Monoid+import Papa.Base.Export.Data.Ord+import Papa.Base.Export.Data.Ratio+import Papa.Base.Export.Data.Semigroup+import Papa.Base.Export.Data.String+import Papa.Base.Export.Data.Traversable+import Papa.Base.Export.Data.Void+import Papa.Base.Export.Prelude
src/Papa/Base/Export/Control/Applicative.hs view
@@ -1,10 +1,22 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Control.Applicative(-  module P+    Applicative(pure, (<*>), (*>), (<*))+  , Alternative(empty, (<|>), some, many)+  , Const(getConst)+  , WrappedMonad(unwrapMonad)+  , WrappedArrow(unwrapArrow)+  , ZipList(getZipList)+  , (<$>)+  , (<$)+  , (<**>)+  , liftA+  , liftA2+  , liftA3+  , optional ) where -import Control.Applicative as P(+import Control.Applicative (     Applicative(pure, (<*>), (*>), (<*))   , Alternative(empty, (<|>), some, many)   , Const(getConst)
src/Papa/Base/Export/Control/Category.hs view
@@ -1,9 +1,9 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Control.Category(-  module P+    Category(id, (.)) ) where -import Control.Category as P(+import Control.Category (     Category(id, (.))   )
src/Papa/Base/Export/Control/Monad.hs view
@@ -1,10 +1,25 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Control.Monad(-  module P+    Functor(fmap)+  , Monad((>>=), return, (>>))+  , MonadPlus(mzero, mplus)+  , forever+  , void+  , msum+  , mfilter+  , filterM+  , foldM+  , foldM_+  , replicateM+  , replicateM_+  , guard+  , when+  , unless+  , (<$!>) ) where -import Control.Monad as P(+import Control.Monad (     Functor(fmap)   , Monad((>>=), return, (>>))   , MonadPlus(mzero, mplus)
src/Papa/Base/Export/Data/Bool.hs view
@@ -1,10 +1,14 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Bool(-  module P+    (&&)+  , (||)+  , not+  , otherwise+  , bool ) where -import Data.Bool as P(+import Data.Bool (     (&&)   , (||)   , not
src/Papa/Base/Export/Data/Char.hs view
@@ -1,10 +1,36 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Char(-  module P+    Char+  , isControl+  , isSpace+  , isLower+  , isUpper+  , isAlpha+  , isAlphaNum+  , isPrint+  , isDigit+  , isOctDigit+  , isHexDigit+  , isLetter+  , isMark+  , isNumber+  , isPunctuation+  , isSymbol+  , isSeparator+  , isAscii+  , isLatin1+  , isAsciiUpper+  , isAsciiLower+  , GeneralCategory(UppercaseLetter, LowercaseLetter, TitlecaseLetter, ModifierLetter, OtherLetter, NonSpacingMark, SpacingCombiningMark, EnclosingMark, DecimalNumber, LetterNumber, OtherNumber, ConnectorPunctuation, DashPunctuation, OpenPunctuation, ClosePunctuation, InitialQuote, FinalQuote, OtherPunctuation, MathSymbol, CurrencySymbol, ModifierSymbol, OtherSymbol, Space, LineSeparator, ParagraphSeparator, Control, Format, Surrogate, PrivateUse, NotAssigned)+  , toUpper+  , toLower+  , toTitle+  , ord+  , chr ) where -import Data.Char as P(+import Data.Char (     Char   , isControl   , isSpace
src/Papa/Base/Export/Data/Either.hs view
@@ -1,10 +1,14 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Either(-  module P+    Either(Left, Right)+  , either+  , isLeft+  , isRight+  , partitionEithers ) where -import Data.Either as P(+import Data.Either (     Either(Left, Right)   , either   , isLeft
src/Papa/Base/Export/Data/Eq.hs view
@@ -1,10 +1,10 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Eq(-  module P+    Eq((==), (/=)) ) where -import Data.Eq as P(+import Data.Eq (     Eq((==), (/=))   ) 
src/Papa/Base/Export/Data/Foldable.hs view
@@ -1,10 +1,22 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Foldable(-  module P+    Foldable(fold, foldMap, foldr, foldr', foldl, foldl', toList, null, elem, sum, product)+  , foldrM+  , foldlM+  , traverse_+  , for_+  , sequenceA_+  , asum+  , and+  , or+  , any+  , all+  , notElem+  , find ) where -import Data.Foldable as P(+import Data.Foldable (     Foldable(fold, foldMap, foldr, foldr', foldl, foldl', toList, null, elem, sum, product)   , foldrM   , foldlM
src/Papa/Base/Export/Data/Function.hs view
@@ -1,10 +1,13 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Function(-  module P+    ($)+  , (&)+  , fix+  , on ) where -import Data.Function as P(+import Data.Function (     ($)   , (&)   , fix
src/Papa/Base/Export/Data/Functor.hs view
@@ -1,10 +1,13 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Functor(-  module P+    Functor(fmap, (<$))+  , ($>)+  , (<$>)+  , void ) where -import Data.Functor as P(+import Data.Functor (     Functor(fmap, (<$))   , ($>)   , (<$>)
src/Papa/Base/Export/Data/Int.hs view
@@ -1,10 +1,14 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Int(-  module P+    Int+  , Int8+  , Int16+  , Int32+  , Int64 ) where -import Data.Int as P(+import Data.Int (     Int   , Int8   , Int16
src/Papa/Base/Export/Data/List.hs view
@@ -1,10 +1,70 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.List(-  module P+    null+  , length+  , reverse+  , intersperse+  , intercalate+  , transpose+  , subsequences+  , permutations+  , foldl+  , foldl'+  , foldr+  , and+  , or+  , any+  , all+  , sum+  , product+  , mapAccumL+  , mapAccumR+  , replicate+  , cycle+  , take+  , drop+  , splitAt+  , takeWhile+  , dropWhile+  , dropWhileEnd+  , span+  , break+  , stripPrefix+  , isPrefixOf+  , isSuffixOf+  , isInfixOf+  , isSubsequenceOf+  , elem+  , notElem+  , find+  , partition+  , lines+  , words+  , unlines+  , unwords+  , nub+  , delete+  , (\\)+  , union+  , intersect+  , sort+  , sortOn+  , nubBy+  , deleteBy+  , deleteFirstsBy+  , unionBy+  , intersectBy+  , sortBy+  , insertBy+  , genericLength+  , genericTake+  , genericDrop+  , genericSplitAt+  , genericReplicate ) where -import Data.List as P(+import Data.List (     null   , length   , reverse
src/Papa/Base/Export/Data/List/NonEmpty.hs view
@@ -1,10 +1,31 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.List.NonEmpty(-  module P+    NonEmpty((:|))+  , scanl+  , scanr+  , scanl1+  , scanr1+  , inits+  , tails+  , iterate+  , repeat+  , unfold+  , insert+  , some1+  , group+  , groupBy+  , groupWith+  , groupAllWith+  , group1+  , groupBy1+  , groupWith1+  , groupAllWith1+  , nonEmpty+  , xor ) where -import Data.List.NonEmpty as P(+import Data.List.NonEmpty (     NonEmpty((:|))   , scanl   , scanr
src/Papa/Base/Export/Data/Maybe.hs view
@@ -1,10 +1,14 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Maybe(-  module P+    Maybe(Nothing, Just)+  , maybe+  , isJust+  , isNothing+  , fromMaybe ) where -import Data.Maybe as P(+import Data.Maybe (     Maybe(Nothing, Just)   , maybe   , isJust
src/Papa/Base/Export/Data/Monoid.hs view
@@ -1,10 +1,16 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Monoid(-  module P  +    Monoid(mempty, mappend)+  , Dual(getDual)+  , Endo(appEndo)+  , All(getAll)+  , Any(getAny)+  , Sum(getSum)+  , Product(getProduct) ) where -import Data.Monoid as P(+import Data.Monoid (     Monoid(mempty, mappend)   , Dual(getDual)   , Endo(appEndo)
src/Papa/Base/Export/Data/Ord.hs view
@@ -1,10 +1,12 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Ord(-  module P+    Ord(compare, (<), (<=), (>), (>=), max, min)+  , Down(Down)+  , comparing ) where -import Data.Ord as P(+import Data.Ord (     Ord(compare, (<), (<=), (>), (>=), max, min)   , Down(Down)   , comparing
src/Papa/Base/Export/Data/Ratio.hs view
@@ -1,10 +1,15 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Ratio(-  module P+    Ratio+  , Rational+  , (%)+  , numerator+  , denominator+  , approxRational ) where -import Data.Ratio as P(+import Data.Ratio (     Ratio   , Rational   , (%)
src/Papa/Base/Export/Data/Semigroup.hs view
@@ -1,10 +1,34 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Semigroup(-  module P+    Semigroup((<>), sconcat, stimes)+  , stimesMonoid+  , stimesIdempotent+  , stimesIdempotentMonoid+  , mtimesDefault+  , Min(getMin)+  , Max(getMax)+  , First(getFirst)+  , Last(getLast)+  , WrappedMonoid(unwrapMonoid)+  , Monoid(mempty, mappend)+  , Dual(getDual)+  , Endo(appEndo)+  , All(getAll)+  , Any(getAny)+  , Sum(getSum)+  , Product(getProduct)+  , Option(getOption)+  , option+  , diff+  , cycle1+  , WrappedMonoid(unwrapMonoid)+  , Arg(Arg)+  , ArgMin+  , ArgMax ) where -import Data.Semigroup as P(+import Data.Semigroup (     Semigroup((<>), sconcat, stimes)   , stimesMonoid   , stimesIdempotent
src/Papa/Base/Export/Data/String.hs view
@@ -1,10 +1,14 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.String(-  module P+    String+  , lines+  , words+  , unlines+  , unwords ) where -import Data.String as P(+import Data.String (     String   , lines   , words
src/Papa/Base/Export/Data/Traversable.hs view
@@ -1,10 +1,14 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Traversable(-  module P+    Traversable(traverse, sequenceA)+  , for+  , mapAccumL+  , fmapDefault+  , foldMapDefault ) where -import Data.Traversable as P(+import Data.Traversable (     Traversable(traverse, sequenceA)   , for   , mapAccumL
src/Papa/Base/Export/Data/Void.hs view
@@ -1,10 +1,12 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Data.Void(-  module P+    Void+  , absurd+  , vacuous ) where -import Data.Void as P(+import Data.Void (     Void   , absurd   , vacuous
src/Papa/Base/Export/Prelude.hs view
@@ -1,11 +1,267 @@ {-# LANGUAGE NoImplicitPrelude #-}  module Papa.Base.Export.Prelude(-  module Prelude+  --  (!!)                       Papa.Prelude.Lens.Data.List+    Monad+  , encodeFloat+--, map                        Papa.Core.Data.Functor+--, scanr                      Papa.Prelude.Semigroups.Data.List+  , ($)+  , Monoid +--, enumFrom+--, mapM                       Papa.Core.Data.Traversable+--, scanr1+--, ($!) +--, enumFromThen+--, mapM_                      Papa.Core.Data.Foldable+--, seq+  , (&&)+  , Num +--, enumFromThenTo+--, mappend                    Papa.Prelude.Semigroups.Data.List+--, sequence                   Papa.Core.Data.Traversable+  , (*)+  , Ord +--, enumFromTo+  , max +  , sequenceA+  , (**)+  , Ordering(+      LT+    , EQ+    , GT+    )+--, error +--, maxBound+--, sequence_                  Papa.Core.Data.Foldable+--, (*>)                       Papa.Prelude.Semigroupoids.Data.Functor.Bind+  , Rational+--, errorWithoutStackTrace+--, maximum                    Papa.Prelude.Semigroups.Data.List+  , show+  , (+) +--, Read +  , even +  , maybe +--, showChar+--, (++)                       Papa.Prelude.Semigroups.Data.List+--, ReadS +  , exp +--, mconcat                    Papa.Core.Data.Monoid+--, showList+  , (-) +  , Real +  , exponent+  , mempty +  , showParen+--, (.)                        Papa.Prelude.Semigroupoids.Data.Semigroupoid+  , RealFloat+--, fail +  , min +--, showString+  , (/) +--, RealFrac+  , filter +--, minBound+  , shows+  , (/=) +--, flip                       Papa.Core.Data.Functor+--, minimum                    Papa.Prelude.Semigroups.Data.List+  , showsPrec+  , (<) +  , Show +  , floatDigits+  , mod +  , significand+  , (<$) +  , ShowS +  , floatRadix+  , negate +  , signum+  , (<$>)+--, String +  , floatRange+  , not +  , sin+--, (<*)                       Papa.Prelude.Semigroupoids.Data.Functor.Bind+  , Traversable+  , floor +  , notElem +  , sinh+  , (<*>)+  , fmap +  , null +--, snd                        Papa.Prelude.Lens.Data.Tuple+  , (<=)+  , Word +  , foldMap +  , odd +  , span+--, (=<<)                      Papa.Prelude.Semigroupoids.Data.Functor.Bind+  , (^)+  , foldl+--, or +  , splitAt+  , (==) +  , (^^) +--, foldl1                     Papa.Prelude.Semigroups.Data.List +  , otherwise+  , sqrt+  , (>) +  , abs +  , foldr +  , pi +  , subtract+  , (>=) +  , acos +--, foldr1                     Papa.Prelude.Semigroups.Data.List+--, pred +--, succ+--, (>>)                       Papa.Prelude.Semigroupoids.Data.Functor.Apply+  , acosh +--, fromEnum+--, print +  , sum+--, (>>=)                      Papa.Prelude.Semigroupoids.Data.Functor.Bind+  , all +  , fromInteger+  , product +--, tail                       Papa.Prelude.Lens.Data.List+  , Applicative+  , and +  , fromIntegral+  , properFraction+  , take+  , Bool(+      False+    , True+    ) +  , any +  , fromRational+  , pure +  , takeWhile+--, Bounded +  , appendFile+--, fst                        Papa.Prelude.Lens.Data.Tuple+  , putChar +  , tan+  , Char +--, asTypeOf+  , gcd +  , putStr +  , tanh+  , Double +  , asin +  , getChar +  , putStrLn+--, toEnum+  , asinh +  , getContents+  , quot +  , toInteger+  , Either(+      Left+    , Right+    ) +  , atan +  , getLine +  , quotRem +  , toRational+  , Enum +  , atan2 +--, head                       Papa.Prelude.Lens.Data.List +--, read +  , traverse+  , Eq +  , atanh +--, id                         Papa.Core.Control.Category+  , readFile+  , truncate+  , break +--, init                       Papa.Prelude.Lens.Data.List+  , readIO +  , uncurry+  , FilePath+  , ceiling +  , interact+--, readList+--, undefined+  , Float +  , compare +  , ioError +--, readLn +  , unlines+  , Floating+--, concat                     Papa.Prelude.Semigroupoids.Data.Functor.Bind+  , isDenormalized+--, readParen+  , until+  , Foldable+--, concatMap                  Papa.Prelude.Semigroupoids.Data.Functor.Bind+  , isIEEE +--, reads +  , unwords+  , Fractional+--, const                      Papa.Core.Control.Applicative+  , isInfinite+--, readsPrec+--, unzip                      Papa.Core.Data.Functor+  , Functor+  , cos +  , isNaN +  , realToFrac+  , unzip3+  , cosh +  , isNegativeZero+  , recip +--, userError+  , IO +  , curry +--, iterate +  , rem +  , words+  , IOError +  , cycle +--, last                       Papa.Prelude.Lens.Data.List+--, repeat +  , writeFile+  , Int +  , decodeFloat+  , lcm +  , replicate+  , zip+  , Integer +--, div +--, length +--, return                     Papa.Core.Control.Applicative+  , zip3+  , Integral+  , divMod+--, lex +--, reverse                    Papa.Core.Data.List+  , zipWith+  , drop +  , lines +  , round +  , zipWith3+  , dropWhile+  , log +  , scaleFloat+  , (||)+  , either +  , logBase +--, scanl                      Papa.Prelude.Semigroups.Data.List+  , Maybe(+      Nothing+    , Just+    ) +  , elem +--, lookup                     Papa.Core.Data.List+--, scanl1 ) where -import Prelude as Prelude(---  (!!)                       Papa.Prelude.Lens.Data.List+import Prelude (+  --  (!!)                       Papa.Prelude.Lens.Data.List     Monad   , encodeFloat --, map                        Papa.Core.Data.Functor
− test/doctests.hs
@@ -1,32 +0,0 @@-module Main where--import Build_doctests (deps)-import Control.Applicative-import Control.Monad-import Data.List-import System.Directory-import System.FilePath-import Test.DocTest--main ::-  IO ()-main =-  getSources >>= \sources -> doctest $-      "-isrc"-    : "-idist/build/autogen"-    : "-optP-include"-    : "-optPdist/build/autogen/cabal_macros.h"-    : "-hide-all-packages"-    : map ("-package="++) deps ++ sources--getSources :: IO [FilePath]-getSources = filter (isSuffixOf ".hs") <$> go "src"-  where-    go dir = do-      (dirs, files) <- getFilesAndDirectories dir-      (files ++) . concat <$> mapM go dirs--getFilesAndDirectories :: FilePath -> IO ([FilePath], [FilePath])-getFilesAndDirectories dir = do-  c <- map (dir </>) . filter (`notElem` ["..", "."]) <$> getDirectoryContents dir-  (,) <$> filterM doesDirectoryExist c <*> filterM doesFileExist c