intro 0.3.1.0 → 0.3.2.0
raw patch · 2 files changed
+12/−13 lines, 2 filesdep −semigroupsdep ~containersPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies removed: semigroups
Dependency ranges changed: containers
API changes (from Hackage documentation)
- Intro: newtype Alt k (f :: k -> *) (a :: k) :: forall k. () => (k -> *) -> k -> *
+ Intro: (<&>) :: Functor f => f a -> a -> b -> f b
+ Intro: iterate' :: () => a -> a -> a -> [a]
+ Intro: newtype Alt (f :: k -> *) (a :: k) :: forall k. () => k -> * -> k -> *
- Intro: ($!) :: () => (a -> b) -> a -> b
+ Intro: ($!) :: () => a -> b -> a -> b
- Intro: ($) :: () => (a -> b) -> a -> b
+ Intro: ($) :: () => a -> b -> a -> b
- Intro: (&) :: () => a -> (a -> b) -> b
+ Intro: (&) :: () => a -> a -> b -> b
- Intro: (.) :: Category k cat => cat b c -> cat a b -> cat a c
+ Intro: (.) :: Category cat => cat b c -> cat a b -> cat a c
- Intro: (<$!>) :: Monad m => (a -> b) -> m a -> m b
+ Intro: (<$!>) :: Monad m => a -> b -> m a -> m b
- Intro: (<$>) :: Functor f => (a -> b) -> f a -> f b
+ Intro: (<$>) :: Functor f => a -> b -> f a -> f b
- Intro: (<**>) :: Applicative f => f a -> f (a -> b) -> f b
+ Intro: (<**>) :: Applicative f => f a -> f a -> b -> f b
- Intro: (<*>) :: Applicative f => f (a -> b) -> f a -> f b
+ Intro: (<*>) :: Applicative f => f a -> b -> f a -> f b
- Intro: (<<<) :: Category k cat => cat b c -> cat a b -> cat a c
+ Intro: (<<<) :: Category cat => cat b c -> cat a b -> cat a c
- Intro: (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
+ Intro: (<=<) :: Monad m => b -> m c -> a -> m b -> a -> m c
- Intro: (=<<) :: Monad m => (a -> m b) -> m a -> m b
+ Intro: (=<<) :: Monad m => a -> m b -> m a -> m b
- Intro: (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
+ Intro: (>=>) :: Monad m => a -> m b -> b -> m c -> a -> m c
- Intro: (>>=) :: Monad m => m a -> (a -> m b) -> m b
+ Intro: (>>=) :: Monad m => m a -> a -> m b -> m b
- Intro: (>>>) :: Category k cat => cat a b -> cat b c -> cat a c
+ Intro: (>>>) :: Category cat => cat a b -> cat b c -> cat a c
- Intro: Alt :: f a -> Alt k
+ Intro: Alt :: f a -> Alt
- Intro: Const :: a -> Const k a
+ Intro: Const :: a -> Const a
- Intro: Endo :: (a -> a) -> Endo a
+ Intro: Endo :: a -> a -> Endo a
- Intro: Proxy :: Proxy k
+ Intro: Proxy :: Proxy
- Intro: ReaderT :: (r -> m a) -> ReaderT k r
+ Intro: ReaderT :: r -> m a -> ReaderT r
- Intro: StateT :: (s -> m (a, s)) -> StateT s a
+ Intro: StateT :: s -> m (a, s) -> StateT s a
- Intro: [getAlt] :: Alt k -> f a
+ Intro: [getAlt] :: Alt -> f a
- Intro: [getConst] :: Const k a -> a
+ Intro: [getConst] :: Const a -> a
- Intro: [runReaderT] :: ReaderT k r -> r -> m a
+ Intro: [runReaderT] :: ReaderT r -> r -> m a
- Intro: all :: Foldable t => (a -> Bool) -> t a -> Bool
+ Intro: all :: Foldable t => a -> Bool -> t a -> Bool
- Intro: allM :: Monad m => (a -> m Bool) -> [a] -> m Bool
+ Intro: allM :: Monad m => a -> m Bool -> [a] -> m Bool
- Intro: any :: Foldable t => (a -> Bool) -> t a -> Bool
+ Intro: any :: Foldable t => a -> Bool -> t a -> Bool
- Intro: anyM :: Monad m => (a -> m Bool) -> [a] -> m Bool
+ Intro: anyM :: Monad m => a -> m Bool -> [a] -> m Bool
- Intro: asks :: MonadReader r m => (r -> a) -> m a
+ Intro: asks :: MonadReader r m => r -> a -> m a
- Intro: bifoldMap :: (Bifoldable p, Monoid m) => (a -> m) -> (b -> m) -> p a b -> m
+ Intro: bifoldMap :: (Bifoldable p, Monoid m) => a -> m -> b -> m -> p a b -> m
- Intro: bifoldl' :: Bifoldable t => (a -> b -> a) -> (a -> c -> a) -> a -> t b c -> a
+ Intro: bifoldl' :: Bifoldable t => a -> b -> a -> a -> c -> a -> a -> t b c -> a
- Intro: bifoldr :: Bifoldable p => (a -> c -> c) -> (b -> c -> c) -> c -> p a b -> c
+ Intro: bifoldr :: Bifoldable p => a -> c -> c -> b -> c -> c -> c -> p a b -> c
- Intro: bifoldr' :: Bifoldable t => (a -> c -> c) -> (b -> c -> c) -> c -> t a b -> c
+ Intro: bifoldr' :: Bifoldable t => a -> c -> c -> b -> c -> c -> c -> t a b -> c
- Intro: bifor :: (Bitraversable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f t c d
+ Intro: bifor :: (Bitraversable t, Applicative f) => t a b -> a -> f c -> b -> f d -> f t c d
- Intro: bifor_ :: (Bifoldable t, Applicative f) => t a b -> (a -> f c) -> (b -> f d) -> f ()
+ Intro: bifor_ :: (Bifoldable t, Applicative f) => t a b -> a -> f c -> b -> f d -> f ()
- Intro: bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d
+ Intro: bimap :: Bifunctor p => a -> b -> c -> d -> p a c -> p b d
- Intro: bitraverse :: (Bitraversable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f t c d
+ Intro: bitraverse :: (Bitraversable t, Applicative f) => a -> f c -> b -> f d -> t a b -> f t c d
- Intro: bitraverse_ :: (Bifoldable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f ()
+ Intro: bitraverse_ :: (Bifoldable t, Applicative f) => a -> f c -> b -> f d -> t a b -> f ()
- Intro: break :: () => (a -> Bool) -> [a] -> ([a], [a])
+ Intro: break :: () => a -> Bool -> [a] -> ([a], [a])
- Intro: catchError :: MonadError e m => m a -> (e -> m a) -> m a
+ Intro: catchError :: MonadError e m => m a -> e -> m a -> m a
- Intro: class Category k (cat :: k -> k -> *)
+ Intro: class Category (cat :: k -> k -> *)
- Intro: class Generic1 k (f :: k -> *)
+ Intro: class Generic1 (f :: k -> *)
- Intro: class MonadTrans (t :: (* -> *) -> * -> *)
+ Intro: class MonadTrans (t :: * -> * -> * -> *)
- Intro: class Monoid a
+ Intro: class Semigroup a => Monoid a
- Intro: class Typeable k (a :: k)
+ Intro: class Typeable (a :: k)
- Intro: comparing :: Ord a => (b -> a) -> b -> b -> Ordering
+ Intro: comparing :: Ord a => b -> a -> b -> b -> Ordering
- Intro: concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
+ Intro: concatMap :: Foldable t => a -> [b] -> t a -> [b]
- Intro: concatMapM :: Monad m => (a -> m [b]) -> [a] -> m [b]
+ Intro: concatMapM :: Monad m => a -> m [b] -> [a] -> m [b]
- Intro: curry :: () => ((a, b) -> c) -> a -> b -> c
+ Intro: curry :: () => (a, b) -> c -> a -> b -> c
- Intro: data Bool :: *
+ Intro: data Bool
- Intro: data ByteString :: *
+ Intro: data ByteString
- Intro: data Char :: *
+ Intro: data Char
- Intro: data Constraint :: *
+ Intro: data Constraint
- Intro: data DList a :: * -> *
+ Intro: data DList a
- Intro: data Double :: *
+ Intro: data Double
- Intro: data Either a b :: * -> * -> *
+ Intro: data Either a b
- Intro: data Float :: *
+ Intro: data Float
- Intro: data HashMap k v :: * -> * -> *
+ Intro: data HashMap k v
- Intro: data HashSet a :: * -> *
+ Intro: data HashSet a
- Intro: data IO a :: * -> *
+ Intro: data IO a
- Intro: data Int :: *
+ Intro: data Int
- Intro: data Int16 :: *
+ Intro: data Int16
- Intro: data Int32 :: *
+ Intro: data Int32
- Intro: data Int64 :: *
+ Intro: data Int64
- Intro: data Int8 :: *
+ Intro: data Int8
- Intro: data IntMap a :: * -> *
+ Intro: data IntMap a
- Intro: data IntSet :: *
+ Intro: data IntSet
- Intro: data Integer :: *
+ Intro: data Integer
- Intro: data Map k a :: * -> * -> *
+ Intro: data Map k a
- Intro: data Maybe a :: * -> *
+ Intro: data Maybe a
- Intro: data Natural :: *
+ Intro: data Natural
- Intro: data NonEmpty a :: * -> *
+ Intro: data NonEmpty a
- Intro: data Ordering :: *
+ Intro: data Ordering
- Intro: data RWST r w s (m :: * -> *) a :: * -> * -> * -> (* -> *) -> * -> *
+ Intro: data RWST r w s (m :: * -> *) a
- Intro: data Ratio a :: * -> *
+ Intro: data Ratio a
- Intro: data Seq a :: * -> *
+ Intro: data Seq a
- Intro: data Set a :: * -> *
+ Intro: data Set a
- Intro: data ShortByteString :: *
+ Intro: data ShortByteString
- Intro: data Text :: *
+ Intro: data Text
- Intro: data Void :: *
+ Intro: data Void
- Intro: data Word :: *
+ Intro: data Word
- Intro: data Word16 :: *
+ Intro: data Word16
- Intro: data Word32 :: *
+ Intro: data Word32
- Intro: data Word64 :: *
+ Intro: data Word64
- Intro: data Word8 :: *
+ Intro: data Word8
- Intro: data WriterT w (m :: * -> *) a :: * -> (* -> *) -> * -> *
+ Intro: data WriterT w (m :: * -> *) a
- Intro: data Proxy k (t :: k) :: forall k. () => k -> *
+ Intro: data Proxy (t :: k) :: forall k. () => k -> *
- Intro: dropWhile :: () => (a -> Bool) -> [a] -> [a]
+ Intro: dropWhile :: () => a -> Bool -> [a] -> [a]
- Intro: dropWhileEnd :: () => (a -> Bool) -> [a] -> [a]
+ Intro: dropWhileEnd :: () => a -> Bool -> [a] -> [a]
- Intro: either :: () => (a -> c) -> (b -> c) -> Either a b -> c
+ Intro: either :: () => a -> c -> b -> c -> Either a b -> c
- Intro: filter :: () => (a -> Bool) -> [a] -> [a]
+ Intro: filter :: () => a -> Bool -> [a] -> [a]
- Intro: find :: Foldable t => (a -> Bool) -> t a -> Maybe a
+ Intro: find :: Foldable t => a -> Bool -> t a -> Maybe a
- Intro: first :: Bifunctor p => (a -> b) -> p a c -> p b c
+ Intro: first :: Bifunctor p => a -> b -> p a c -> p b c
- Intro: fix :: () => (a -> a) -> a
+ Intro: fix :: () => a -> a -> a
- Intro: flip :: () => (a -> b -> c) -> b -> a -> c
+ Intro: flip :: () => a -> b -> c -> b -> a -> c
- Intro: foldMap :: (Foldable t, Monoid m) => (a -> m) -> t a -> m
+ Intro: foldMap :: (Foldable t, Monoid m) => a -> m -> t a -> m
- Intro: foldl' :: Foldable t => (b -> a -> b) -> b -> t a -> b
+ Intro: foldl' :: Foldable t => b -> a -> b -> b -> t a -> b
- Intro: foldl1Def :: Foldable t => a -> (a -> a -> a) -> t a -> a
+ Intro: foldl1Def :: Foldable t => a -> a -> a -> a -> t a -> a
- Intro: foldl1May :: Foldable t => (a -> a -> a) -> t a -> Maybe a
+ Intro: foldl1May :: Foldable t => a -> a -> a -> t a -> Maybe a
- Intro: foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
+ Intro: foldlM :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m b
- Intro: foldr :: Foldable t => (a -> b -> b) -> b -> t a -> b
+ Intro: foldr :: Foldable t => a -> b -> b -> b -> t a -> b
- Intro: foldr' :: Foldable t => (a -> b -> b) -> b -> t a -> b
+ Intro: foldr' :: Foldable t => a -> b -> b -> b -> t a -> b
- Intro: foldr1Def :: Foldable t => a -> (a -> a -> a) -> t a -> a
+ Intro: foldr1Def :: Foldable t => a -> a -> a -> a -> t a -> a
- Intro: foldr1May :: Foldable t => (a -> a -> a) -> t a -> Maybe a
+ Intro: foldr1May :: Foldable t => a -> a -> a -> t a -> Maybe a
- Intro: foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b
+ Intro: foldrM :: (Foldable t, Monad m) => a -> b -> m b -> b -> t a -> m b
- Intro: for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f t b
+ Intro: for :: (Traversable t, Applicative f) => t a -> a -> f b -> f t b
- Intro: for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f ()
+ Intro: for_ :: (Foldable t, Applicative f) => t a -> a -> f b -> f ()
- Intro: gets :: MonadState s m => (s -> a) -> m a
+ Intro: gets :: MonadState s m => s -> a -> m a
- Intro: groupBy :: () => (a -> a -> Bool) -> [a] -> [[a]]
+ Intro: groupBy :: () => a -> a -> Bool -> [a] -> [[a]]
- Intro: groupOn :: Eq b => (a -> b) -> [a] -> [[a]]
+ Intro: groupOn :: Eq b => a -> b -> [a] -> [[a]]
- Intro: groupSortBy :: () => (a -> a -> Ordering) -> [a] -> [[a]]
+ Intro: groupSortBy :: () => a -> a -> Ordering -> [a] -> [[a]]
- Intro: groupSortOn :: Ord b => (a -> b) -> [a] -> [[a]]
+ Intro: groupSortOn :: Ord b => a -> b -> [a] -> [[a]]
- Intro: id :: Category k cat => cat a a
+ Intro: id :: Category cat => cat a a
- Intro: infixl 1 &
+ Intro: infixl 1 <&>
- Intro: iterate :: () => (a -> a) -> a -> [a]
+ Intro: iterate :: () => a -> a -> a -> [a]
- Intro: length :: Foldable t => forall a. () => t a -> Int
+ Intro: length :: Foldable t => t a -> Int
- Intro: liftA2 :: Applicative f => forall a b c. () => (a -> b -> c) -> f a -> f b -> f c
+ Intro: liftA2 :: Applicative f => a -> b -> c -> f a -> f b -> f c
- Intro: liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
+ Intro: liftA3 :: Applicative f => a -> b -> c -> d -> f a -> f b -> f c -> f d
- Intro: local :: MonadReader r m => (r -> r) -> m a -> m a
+ Intro: local :: MonadReader r m => r -> r -> m a -> m a
- Intro: mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ Intro: mapAccumL :: Traversable t => a -> b -> (a, c) -> a -> t b -> (a, t c)
- Intro: mapAccumR :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ Intro: mapAccumR :: Traversable t => a -> b -> (a, c) -> a -> t b -> (a, t c)
- Intro: mapExcept :: () => (Either e a -> Either e' b) -> Except e a -> Except e' b
+ Intro: mapExcept :: () => Either e a -> Either e' b -> Except e a -> Except e' b
- Intro: mapExceptT :: () => (m Either e a -> n Either e' b) -> ExceptT e m a -> ExceptT e' n b
+ Intro: mapExceptT :: () => m Either e a -> n Either e' b -> ExceptT e m a -> ExceptT e' n b
- Intro: mapMaybe :: () => (a -> Maybe b) -> [a] -> [b]
+ Intro: mapMaybe :: () => a -> Maybe b -> [a] -> [b]
- Intro: mapMaybeT :: () => (m Maybe a -> n Maybe b) -> MaybeT m a -> MaybeT n b
+ Intro: mapMaybeT :: () => m Maybe a -> n Maybe b -> MaybeT m a -> MaybeT n b
- Intro: mapRWS :: (Monoid w, Monoid w') => ((a, s, w) -> (b, s, w')) -> RWS r w s a -> RWS r w' s b
+ Intro: mapRWS :: (Monoid w, Monoid w') => (a, s, w) -> (b, s, w') -> RWS r w s a -> RWS r w' s b
- Intro: mapRWST :: (Monad n, Monoid w, Monoid w') => (m (a, s, w) -> n (b, s, w')) -> RWST r w s m a -> RWST r w' s n b
+ Intro: mapRWST :: (Monad n, Monoid w, Monoid w') => m (a, s, w) -> n (b, s, w') -> RWST r w s m a -> RWST r w' s n b
- Intro: mapReader :: () => (a -> b) -> Reader r a -> Reader r b
+ Intro: mapReader :: () => a -> b -> Reader r a -> Reader r b
- Intro: mapReaderT :: () => (m a -> n b) -> ReaderT k2 r m a -> ReaderT k1 r n b
+ Intro: mapReaderT :: () => m a -> n b -> ReaderT r m a -> ReaderT r n b
- Intro: mapState :: () => ((a, s) -> (b, s)) -> State s a -> State s b
+ Intro: mapState :: () => (a, s) -> (b, s) -> State s a -> State s b
- Intro: mapStateT :: () => (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b
+ Intro: mapStateT :: () => m (a, s) -> n (b, s) -> StateT s m a -> StateT s n b
- Intro: mapWriter :: (Monoid w, Monoid w') => ((a, w) -> (b, w')) -> Writer w a -> Writer w' b
+ Intro: mapWriter :: (Monoid w, Monoid w') => (a, w) -> (b, w') -> Writer w a -> Writer w' b
- Intro: mapWriterT :: (Monad n, Monoid w, Monoid w') => (m (a, w) -> n (b, w')) -> WriterT w m a -> WriterT w' n b
+ Intro: mapWriterT :: (Monad n, Monoid w, Monoid w') => m (a, w) -> n (b, w') -> WriterT w m a -> WriterT w' n b
- Intro: maximumByDef :: Foldable t => a -> (a -> a -> Ordering) -> t a -> a
+ Intro: maximumByDef :: Foldable t => a -> a -> a -> Ordering -> t a -> a
- Intro: maximumByMay :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
+ Intro: maximumByMay :: Foldable t => a -> a -> Ordering -> t a -> Maybe a
- Intro: maybe :: () => b -> (a -> b) -> Maybe a -> b
+ Intro: maybe :: () => b -> a -> b -> Maybe a -> b
- Intro: mfix :: MonadFix m => (a -> m a) -> m a
+ Intro: mfix :: MonadFix m => a -> m a -> m a
- Intro: minimumByDef :: Foldable t => a -> (a -> a -> Ordering) -> t a -> a
+ Intro: minimumByDef :: Foldable t => a -> a -> a -> Ordering -> t a -> a
- Intro: minimumByMay :: Foldable t => (a -> a -> Ordering) -> t a -> Maybe a
+ Intro: minimumByMay :: Foldable t => a -> a -> Ordering -> t a -> Maybe a
- Intro: modify :: MonadState s m => (s -> s) -> m ()
+ Intro: modify :: MonadState s m => s -> s -> m ()
- Intro: modify' :: MonadState s m => (s -> s) -> m ()
+ Intro: modify' :: MonadState s m => s -> s -> m ()
- Intro: newtype ReaderT k r (m :: k -> *) (a :: k) :: forall k. () => * -> (k -> *) -> k -> *
+ Intro: newtype ReaderT r (m :: k -> *) (a :: k) :: forall k. () => * -> k -> * -> k -> *
- Intro: newtype All :: *
+ Intro: newtype All
- Intro: newtype Any :: *
+ Intro: newtype Any
- Intro: newtype Down a :: * -> *
+ Intro: newtype Down a
- Intro: newtype Dual a :: * -> *
+ Intro: newtype Dual a
- Intro: newtype Endo a :: * -> *
+ Intro: newtype Endo a
- Intro: newtype ExceptT e (m :: * -> *) a :: * -> (* -> *) -> * -> *
+ Intro: newtype ExceptT e (m :: * -> *) a
- Intro: newtype First a :: * -> *
+ Intro: newtype First a
- Intro: newtype Identity a :: * -> *
+ Intro: newtype Identity a
- Intro: newtype Last a :: * -> *
+ Intro: newtype Last a
- Intro: newtype Max a :: * -> *
+ Intro: newtype Max a
- Intro: newtype MaybeT (m :: * -> *) a :: (* -> *) -> * -> *
+ Intro: newtype MaybeT (m :: * -> *) a
- Intro: newtype Min a :: * -> *
+ Intro: newtype Min a
- Intro: newtype Option a :: * -> *
+ Intro: newtype Option a
- Intro: newtype StateT s (m :: * -> *) a :: * -> (* -> *) -> * -> *
+ Intro: newtype StateT s (m :: * -> *) a
- Intro: newtype ZipList a :: * -> *
+ Intro: newtype ZipList a
- Intro: nubOrdBy :: () => (a -> a -> Ordering) -> [a] -> [a]
+ Intro: nubOrdBy :: () => a -> a -> Ordering -> [a] -> [a]
- Intro: nubOrdOn :: Ord b => (a -> b) -> [a] -> [a]
+ Intro: nubOrdOn :: Ord b => a -> b -> [a] -> [a]
- Intro: null :: Foldable t => forall a. () => t a -> Bool
+ Intro: null :: Foldable t => t a -> Bool
- Intro: on :: () => (b -> b -> c) -> (a -> b) -> a -> a -> c
+ Intro: on :: () => b -> b -> c -> a -> b -> a -> a -> c
- Intro: reader :: MonadReader r m => (r -> a) -> m a
+ Intro: reader :: MonadReader r m => r -> a -> m a
- Intro: rws :: Monoid w => (r -> s -> (a, s, w)) -> RWS r w s a
+ Intro: rws :: Monoid w => r -> s -> (a, s, w) -> RWS r w s a
- Intro: rwsT :: (Functor m, Monoid w) => (r -> s -> m (a, s, w)) -> RWST r w s m a
+ Intro: rwsT :: (Functor m, Monoid w) => r -> s -> m (a, s, w) -> RWST r w s m a
- Intro: scanl :: () => (b -> a -> b) -> b -> [a] -> [b]
+ Intro: scanl :: () => b -> a -> b -> b -> [a] -> [b]
- Intro: scanl1 :: () => (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Intro: scanl1 :: () => a -> a -> a -> NonEmpty a -> NonEmpty a
- Intro: scanr :: () => (a -> b -> b) -> b -> [a] -> [b]
+ Intro: scanr :: () => a -> b -> b -> b -> [a] -> [b]
- Intro: scanr1 :: () => (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Intro: scanr1 :: () => a -> a -> a -> NonEmpty a -> NonEmpty a
- Intro: second :: Bifunctor p => (b -> c) -> p a b -> p a c
+ Intro: second :: Bifunctor p => b -> c -> p a b -> p a c
- Intro: sortBy :: () => (a -> a -> Ordering) -> [a] -> [a]
+ Intro: sortBy :: () => a -> a -> Ordering -> [a] -> [a]
- Intro: sortOn :: Ord b => (a -> b) -> [a] -> [a]
+ Intro: sortOn :: Ord b => a -> b -> [a] -> [a]
- Intro: span :: () => (a -> Bool) -> [a] -> ([a], [a])
+ Intro: span :: () => a -> Bool -> [a] -> ([a], [a])
- Intro: spanEnd :: () => (a -> Bool) -> [a] -> ([a], [a])
+ Intro: spanEnd :: () => a -> Bool -> [a] -> ([a], [a])
- Intro: split :: () => (a -> Bool) -> [a] -> [[a]]
+ Intro: split :: () => a -> Bool -> [a] -> [[a]]
- Intro: state :: MonadState s m => (s -> (a, s)) -> m a
+ Intro: state :: MonadState s m => s -> (a, s) -> m a
- Intro: takeWhile :: () => (a -> Bool) -> [a] -> [a]
+ Intro: takeWhile :: () => a -> Bool -> [a] -> [a]
- Intro: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f t b
+ Intro: traverse :: (Traversable t, Applicative f) => a -> f b -> t a -> f t b
- Intro: traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()
+ Intro: traverse_ :: (Foldable t, Applicative f) => a -> f b -> t a -> f ()
- Intro: type Reader r = ReaderT * r Identity
+ Intro: type Reader r = ReaderT r Identity
- Intro: uncurry :: () => (a -> b -> c) -> (a, b) -> c
+ Intro: uncurry :: () => a -> b -> c -> (a, b) -> c
- Intro: unfoldr :: () => (b -> Maybe (a, b)) -> b -> [a]
+ Intro: unfoldr :: () => b -> Maybe (a, b) -> b -> [a]
- Intro: until :: () => (a -> Bool) -> (a -> a) -> a -> a
+ Intro: until :: () => a -> Bool -> a -> a -> a -> a
- Intro: withExcept :: () => (e -> e') -> Except e a -> Except e' a
+ Intro: withExcept :: () => e -> e' -> Except e a -> Except e' a
- Intro: withExceptT :: Functor m => (e -> e') -> ExceptT e m a -> ExceptT e' m a
+ Intro: withExceptT :: Functor m => e -> e' -> ExceptT e m a -> ExceptT e' m a
- Intro: withReader :: () => (r' -> r) -> Reader r a -> Reader r' a
+ Intro: withReader :: () => r' -> r -> Reader r a -> Reader r' a
- Intro: withReaderT :: () => (r' -> r) -> ReaderT k r m a -> ReaderT k r' m a
+ Intro: withReaderT :: () => r' -> r -> ReaderT r m a -> ReaderT r' m a
- Intro: withState :: () => (s -> s) -> State s a -> State s a
+ Intro: withState :: () => s -> s -> State s a -> State s a
- Intro: withStateT :: () => (s -> s) -> StateT s m a -> StateT s m a
+ Intro: withStateT :: () => s -> s -> StateT s m a -> StateT s m a
- Intro: zipWith :: () => (a -> b -> c) -> [a] -> [b] -> [c]
+ Intro: zipWith :: () => a -> b -> c -> [a] -> [b] -> [c]
- Intro: zipWith3 :: () => (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
+ Intro: zipWith3 :: () => a -> b -> c -> d -> [a] -> [b] -> [c] -> [d]
Files
- intro.cabal +6/−13
- src/Intro.hs +6/−0
intro.cabal view
@@ -1,11 +1,11 @@--- This file has been generated from package.yaml by hpack version 0.20.0.+-- This file has been generated from package.yaml by hpack version 0.28.2. -- -- see: https://github.com/sol/hpack ----- hash: 9fc8509089a8a65cf15057f855ce10d18a4da68eb2188fa16a129c05c22ee742+-- hash: bf4710de9bcc3cde9d216eb32ac0b74414062c4cb6312f60f8c064a35f32ae1e name: intro-version: 0.3.1.0+version: 0.3.2.0 synopsis: "Fixed Prelude" - Mostly total and safe, provides Text and Monad transformers description: Intro is a modern Prelude which provides safe alternatives for most of the partial functions and follows other@@ -27,10 +27,9 @@ copyright: 2016-2017 Daniel Mendler license: MIT license-file: LICENSE-tested-with: GHC == 7.10.3, GHC == 8.0.1, GHC == 8.2.1+tested-with: GHC == 8.0.1, GHC == 8.2.1, GHC == 8.4.3, GHC == 8.6.1 build-type: Simple cabal-version: >= 1.10- extra-source-files: README.md @@ -46,7 +45,7 @@ base >=4.8 && <5.0 , binary >=0.7 && <0.9 , bytestring >=0.9 && <0.11- , containers >=0.5 && <0.6+ , containers >=0.5 && <0.7 , deepseq >=1.4 && <1.5 , dlist >=0.7 && <0.9 , extra >=1.5.1 && <1.7@@ -57,9 +56,6 @@ , transformers >=0.4 && <0.6 , unordered-containers >=0.2 && <0.3 , writer-cps-mtl >=0.1.1.2 && <0.2- if impl(ghc < 8.0)- build-depends:- semigroups >=0.9 && <1 if impl(ghc < 8.1) build-depends: bifunctors >=5.2 && <5.5@@ -82,7 +78,7 @@ , base >=4.8 && <5.0 , binary >=0.7 && <0.9 , bytestring >=0.9 && <0.11- , containers >=0.5 && <0.6+ , containers >=0.5 && <0.7 , deepseq >=1.4 && <1.5 , dlist >=0.7 && <0.9 , extra >=1.5.1 && <1.7@@ -95,9 +91,6 @@ , transformers >=0.4 && <0.6 , unordered-containers >=0.2 && <0.3 , writer-cps-mtl >=0.1.1.2 && <0.2- if impl(ghc < 8.0)- build-depends:- semigroups >=0.9 && <1 if impl(ghc < 8.1) build-depends: bifunctors >=5.2 && <5.5
src/Intro.hs view
@@ -156,6 +156,9 @@ , Data.List.isPrefixOf , Data.List.isSuffixOf , Data.List.iterate+#if MIN_VERSION_base(4,11,0)+ , Data.List.iterate'+#endif , Data.List.lookup , Data.List.Extra.nubOrd , Data.List.Extra.nubOrdBy@@ -432,6 +435,9 @@ ) , (Data.Functor.$>) , (Data.Functor.<$>)+#if MIN_VERSION_base(4,11,0)+ , (Data.Functor.<&>)+#endif , map , Data.Functor.void , Control.Applicative.Const(Const, getConst) -- Data.Functor.Const