packages feed

rio 0.1.3.0 → 0.1.4.0

raw patch · 7 files changed

+212/−2 lines, 7 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- RIO: type Lens s t a b = forall (f :: * -> *). Functor f => (a -> f b) -> s -> f t
+ RIO: Const :: a -> Const a
+ RIO: Identity :: a -> Identity a
+ RIO: [getConst] :: Const a -> a
+ RIO: [runIdentity] :: Identity a -> a
+ RIO: class HasStateRef s env | env -> s
+ RIO: class HasWriteRef w env | env -> w
+ RIO: data SomeRef a
+ RIO: modifySomeRef :: MonadIO m => SomeRef a -> (a -> a) -> m ()
+ RIO: newSomeRef :: MonadIO m => a -> m (SomeRef a)
+ RIO: newUnboxedSomeRef :: (MonadIO m, Unbox a) => a -> m (SomeRef a)
+ RIO: newtype Identity a
+ RIO: readSomeRef :: MonadIO m => SomeRef a -> m a
+ RIO: runReader :: () => Reader r a -> r -> a
+ RIO: stateRefL :: HasStateRef s env => Lens' env (SomeRef s)
+ RIO: type Reader r = ReaderT r Identity
+ RIO: type Lens s t a b = forall (f :: * -> *). Functor f => a -> f b -> s -> f t
+ RIO: writeRefL :: HasWriteRef w env => Lens' env (SomeRef w)
+ RIO: writeSomeRef :: MonadIO m => SomeRef a -> a -> m ()
+ RIO.ByteString: all :: Word8 -> Bool -> ByteString -> Bool
+ RIO.ByteString: any :: Word8 -> Bool -> ByteString -> Bool
+ RIO.ByteString: append :: ByteString -> ByteString -> ByteString
+ RIO.ByteString: break :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString: breakEnd :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString: breakSubstring :: ByteString -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString: concat :: [ByteString] -> ByteString
+ RIO.ByteString: concatMap :: Word8 -> ByteString -> ByteString -> ByteString
+ RIO.ByteString: cons :: Word8 -> ByteString -> ByteString
+ RIO.ByteString: copy :: ByteString -> ByteString
+ RIO.ByteString: count :: Word8 -> ByteString -> Int
+ RIO.ByteString: data ByteString
+ RIO.ByteString: drop :: Int -> ByteString -> ByteString
+ RIO.ByteString: dropWhile :: Word8 -> Bool -> ByteString -> ByteString
+ RIO.ByteString: elem :: Word8 -> ByteString -> Bool
+ RIO.ByteString: elemIndex :: Word8 -> ByteString -> Maybe Int
+ RIO.ByteString: elemIndexEnd :: Word8 -> ByteString -> Maybe Int
+ RIO.ByteString: elemIndices :: Word8 -> ByteString -> [Int]
+ RIO.ByteString: empty :: ByteString
+ RIO.ByteString: filter :: Word8 -> Bool -> ByteString -> ByteString
+ RIO.ByteString: find :: Word8 -> Bool -> ByteString -> Maybe Word8
+ RIO.ByteString: findIndex :: Word8 -> Bool -> ByteString -> Maybe Int
+ RIO.ByteString: findIndices :: Word8 -> Bool -> ByteString -> [Int]
+ RIO.ByteString: foldl :: () => a -> Word8 -> a -> a -> ByteString -> a
+ RIO.ByteString: foldl' :: () => a -> Word8 -> a -> a -> ByteString -> a
+ RIO.ByteString: foldr :: () => Word8 -> a -> a -> a -> ByteString -> a
+ RIO.ByteString: foldr' :: () => Word8 -> a -> a -> a -> ByteString -> a
+ RIO.ByteString: group :: ByteString -> [ByteString]
+ RIO.ByteString: groupBy :: Word8 -> Word8 -> Bool -> ByteString -> [ByteString]
+ RIO.ByteString: index :: ByteString -> Int -> Word8
+ RIO.ByteString: infixl 5 `snoc`
+ RIO.ByteString: infixr 5 `cons`
+ RIO.ByteString: inits :: ByteString -> [ByteString]
+ RIO.ByteString: intercalate :: ByteString -> [ByteString] -> ByteString
+ RIO.ByteString: intersperse :: Word8 -> ByteString -> ByteString
+ RIO.ByteString: isInfixOf :: ByteString -> ByteString -> Bool
+ RIO.ByteString: isPrefixOf :: ByteString -> ByteString -> Bool
+ RIO.ByteString: isSuffixOf :: ByteString -> ByteString -> Bool
+ RIO.ByteString: length :: ByteString -> Int
+ RIO.ByteString: map :: Word8 -> Word8 -> ByteString -> ByteString
+ RIO.ByteString: mapAccumL :: () => acc -> Word8 -> (acc, Word8) -> acc -> ByteString -> (acc, ByteString)
+ RIO.ByteString: mapAccumR :: () => acc -> Word8 -> (acc, Word8) -> acc -> ByteString -> (acc, ByteString)
+ RIO.ByteString: notElem :: Word8 -> ByteString -> Bool
+ RIO.ByteString: null :: ByteString -> Bool
+ RIO.ByteString: pack :: [Word8] -> ByteString
+ RIO.ByteString: partition :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString: replicate :: Int -> Word8 -> ByteString
+ RIO.ByteString: reverse :: ByteString -> ByteString
+ RIO.ByteString: scanl :: Word8 -> Word8 -> Word8 -> Word8 -> ByteString -> ByteString
+ RIO.ByteString: scanl1 :: Word8 -> Word8 -> Word8 -> ByteString -> ByteString
+ RIO.ByteString: scanr :: Word8 -> Word8 -> Word8 -> Word8 -> ByteString -> ByteString
+ RIO.ByteString: scanr1 :: Word8 -> Word8 -> Word8 -> ByteString -> ByteString
+ RIO.ByteString: singleton :: Word8 -> ByteString
+ RIO.ByteString: snoc :: ByteString -> Word8 -> ByteString
+ RIO.ByteString: sort :: ByteString -> ByteString
+ RIO.ByteString: span :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString: spanEnd :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString: split :: Word8 -> ByteString -> [ByteString]
+ RIO.ByteString: splitAt :: Int -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString: splitWith :: Word8 -> Bool -> ByteString -> [ByteString]
+ RIO.ByteString: stripPrefix :: ByteString -> ByteString -> Maybe ByteString
+ RIO.ByteString: stripSuffix :: ByteString -> ByteString -> Maybe ByteString
+ RIO.ByteString: tails :: ByteString -> [ByteString]
+ RIO.ByteString: take :: Int -> ByteString -> ByteString
+ RIO.ByteString: takeWhile :: Word8 -> Bool -> ByteString -> ByteString
+ RIO.ByteString: transpose :: [ByteString] -> [ByteString]
+ RIO.ByteString: uncons :: ByteString -> Maybe (Word8, ByteString)
+ RIO.ByteString: unfoldr :: () => a -> Maybe (Word8, a) -> a -> ByteString
+ RIO.ByteString: unfoldrN :: () => Int -> a -> Maybe (Word8, a) -> a -> (ByteString, Maybe a)
+ RIO.ByteString: unpack :: ByteString -> [Word8]
+ RIO.ByteString: unsnoc :: ByteString -> Maybe (ByteString, Word8)
+ RIO.ByteString: unzip :: [(Word8, Word8)] -> (ByteString, ByteString)
+ RIO.ByteString: zip :: ByteString -> ByteString -> [(Word8, Word8)]
+ RIO.ByteString: zipWith :: () => Word8 -> Word8 -> a -> ByteString -> ByteString -> [a]
+ RIO.FilePath: (-<.>) :: FilePath -> String -> FilePath
+ RIO.FilePath: (<.>) :: FilePath -> String -> FilePath
+ RIO.FilePath: (</>) :: FilePath -> FilePath -> FilePath
+ RIO.FilePath: addExtension :: FilePath -> String -> FilePath
+ RIO.FilePath: addTrailingPathSeparator :: FilePath -> FilePath
+ RIO.FilePath: combine :: FilePath -> FilePath -> FilePath
+ RIO.FilePath: dropDrive :: FilePath -> FilePath
+ RIO.FilePath: dropExtension :: FilePath -> FilePath
+ RIO.FilePath: dropExtensions :: FilePath -> FilePath
+ RIO.FilePath: dropFileName :: FilePath -> FilePath
+ RIO.FilePath: dropTrailingPathSeparator :: FilePath -> FilePath
+ RIO.FilePath: equalFilePath :: FilePath -> FilePath -> Bool
+ RIO.FilePath: extSeparator :: Char
+ RIO.FilePath: hasDrive :: FilePath -> Bool
+ RIO.FilePath: hasExtension :: FilePath -> Bool
+ RIO.FilePath: hasTrailingPathSeparator :: FilePath -> Bool
+ RIO.FilePath: infixr 5 </>
+ RIO.FilePath: infixr 7 -<.>
+ RIO.FilePath: isAbsolute :: FilePath -> Bool
+ RIO.FilePath: isDrive :: FilePath -> Bool
+ RIO.FilePath: isExtSeparator :: Char -> Bool
+ RIO.FilePath: isExtensionOf :: String -> FilePath -> Bool
+ RIO.FilePath: isPathSeparator :: Char -> Bool
+ RIO.FilePath: isRelative :: FilePath -> Bool
+ RIO.FilePath: isSearchPathSeparator :: Char -> Bool
+ RIO.FilePath: isValid :: FilePath -> Bool
+ RIO.FilePath: joinDrive :: FilePath -> FilePath -> FilePath
+ RIO.FilePath: joinPath :: [FilePath] -> FilePath
+ RIO.FilePath: makeRelative :: FilePath -> FilePath -> FilePath
+ RIO.FilePath: makeValid :: FilePath -> FilePath
+ RIO.FilePath: normalise :: FilePath -> FilePath
+ RIO.FilePath: pathSeparator :: Char
+ RIO.FilePath: pathSeparators :: [Char]
+ RIO.FilePath: replaceBaseName :: FilePath -> String -> FilePath
+ RIO.FilePath: replaceDirectory :: FilePath -> String -> FilePath
+ RIO.FilePath: replaceExtension :: FilePath -> String -> FilePath
+ RIO.FilePath: replaceExtensions :: FilePath -> String -> FilePath
+ RIO.FilePath: replaceFileName :: FilePath -> String -> FilePath
+ RIO.FilePath: searchPathSeparator :: Char
+ RIO.FilePath: splitDirectories :: FilePath -> [FilePath]
+ RIO.FilePath: splitDrive :: FilePath -> (FilePath, FilePath)
+ RIO.FilePath: splitExtension :: FilePath -> (String, String)
+ RIO.FilePath: splitExtensions :: FilePath -> (FilePath, String)
+ RIO.FilePath: splitFileName :: FilePath -> (String, String)
+ RIO.FilePath: splitPath :: FilePath -> [FilePath]
+ RIO.FilePath: splitSearchPath :: String -> [FilePath]
+ RIO.FilePath: stripExtension :: String -> FilePath -> Maybe FilePath
+ RIO.FilePath: takeBaseName :: FilePath -> String
+ RIO.FilePath: takeDirectory :: FilePath -> FilePath
+ RIO.FilePath: takeDrive :: FilePath -> FilePath
+ RIO.FilePath: takeExtension :: FilePath -> String
+ RIO.FilePath: takeExtensions :: FilePath -> String
+ RIO.FilePath: takeFileName :: FilePath -> FilePath
+ RIO.FilePath: type FilePath = String
+ RIO.State: class Monad m => MonadState s (m :: * -> *) | m -> s
+ RIO.State: get :: MonadState s m => m s
+ RIO.State: put :: MonadState s m => s -> m ()
+ RIO.State: state :: MonadState s m => s -> (a, s) -> m a
+ RIO.Time: LocalTime :: Day -> TimeOfDay -> LocalTime
+ RIO.Time: ModJulianDate :: Rational -> UniversalTime
+ RIO.Time: ModifiedJulianDay :: Integer -> Day
+ RIO.Time: TimeLocale :: [(String, String)] -> [(String, String)] -> (String, String) -> String -> String -> String -> String -> [TimeZone] -> TimeLocale
+ RIO.Time: TimeOfDay :: Int -> Int -> Pico -> TimeOfDay
+ RIO.Time: TimeZone :: Int -> Bool -> String -> TimeZone
+ RIO.Time: UTCTime :: Day -> DiffTime -> UTCTime
+ RIO.Time: ZonedTime :: LocalTime -> TimeZone -> ZonedTime
+ RIO.Time: [amPm] :: TimeLocale -> (String, String)
+ RIO.Time: [dateFmt] :: TimeLocale -> String
+ RIO.Time: [dateTimeFmt] :: TimeLocale -> String
+ RIO.Time: [getModJulianDate] :: UniversalTime -> Rational
+ RIO.Time: [knownTimeZones] :: TimeLocale -> [TimeZone]
+ RIO.Time: [localDay] :: LocalTime -> Day
+ RIO.Time: [localTimeOfDay] :: LocalTime -> TimeOfDay
+ RIO.Time: [months] :: TimeLocale -> [(String, String)]
+ RIO.Time: [time12Fmt] :: TimeLocale -> String
+ RIO.Time: [timeFmt] :: TimeLocale -> String
+ RIO.Time: [timeZoneMinutes] :: TimeZone -> Int
+ RIO.Time: [timeZoneName] :: TimeZone -> String
+ RIO.Time: [timeZoneSummerOnly] :: TimeZone -> Bool
+ RIO.Time: [toModifiedJulianDay] :: Day -> Integer
+ RIO.Time: [todHour] :: TimeOfDay -> Int
+ RIO.Time: [todMin] :: TimeOfDay -> Int
+ RIO.Time: [todSec] :: TimeOfDay -> Pico
+ RIO.Time: [utctDayTime] :: UTCTime -> DiffTime
+ RIO.Time: [utctDay] :: UTCTime -> Day
+ RIO.Time: [wDays] :: TimeLocale -> [(String, String)]
+ RIO.Time: [zonedTimeToLocalTime] :: ZonedTime -> LocalTime
+ RIO.Time: [zonedTimeZone] :: ZonedTime -> TimeZone
+ RIO.Time: addDays :: Integer -> Day -> Day
+ RIO.Time: addGregorianMonthsClip :: Integer -> Day -> Day
+ RIO.Time: addGregorianMonthsRollOver :: Integer -> Day -> Day
+ RIO.Time: addGregorianYearsClip :: Integer -> Day -> Day
+ RIO.Time: addGregorianYearsRollOver :: Integer -> Day -> Day
+ RIO.Time: addUTCTime :: NominalDiffTime -> UTCTime -> UTCTime
+ RIO.Time: buildTime :: ParseTime t => TimeLocale -> [(Char, String)] -> Maybe t
+ RIO.Time: class FormatTime t
+ RIO.Time: class ParseTime t
+ RIO.Time: data DiffTime
+ RIO.Time: data LocalTime
+ RIO.Time: data NominalDiffTime
+ RIO.Time: data TimeLocale
+ RIO.Time: data TimeOfDay
+ RIO.Time: data TimeZone
+ RIO.Time: data UTCTime
+ RIO.Time: data ZonedTime
+ RIO.Time: dayFractionToTimeOfDay :: Rational -> TimeOfDay
+ RIO.Time: defaultTimeLocale :: TimeLocale
+ RIO.Time: diffDays :: Day -> Day -> Integer
+ RIO.Time: diffTimeToPicoseconds :: DiffTime -> Integer
+ RIO.Time: diffUTCTime :: UTCTime -> UTCTime -> NominalDiffTime
+ RIO.Time: formatCharacter :: FormatTime t => Char -> Maybe TimeLocale -> Maybe NumericPadOption -> Maybe Int -> t -> String
+ RIO.Time: formatTime :: FormatTime t => TimeLocale -> String -> t -> String
+ RIO.Time: fromGregorian :: Integer -> Int -> Int -> Day
+ RIO.Time: fromGregorianValid :: Integer -> Int -> Int -> Maybe Day
+ RIO.Time: getTime_resolution :: DiffTime
+ RIO.Time: gregorianMonthLength :: Integer -> Int -> Int
+ RIO.Time: hoursToTimeZone :: Int -> TimeZone
+ RIO.Time: isLeapYear :: Integer -> Bool
+ RIO.Time: iso8601DateFormat :: Maybe String -> String
+ RIO.Time: localTimeToUT1 :: Rational -> LocalTime -> UniversalTime
+ RIO.Time: localTimeToUTC :: TimeZone -> LocalTime -> UTCTime
+ RIO.Time: localToUTCTimeOfDay :: TimeZone -> TimeOfDay -> (Integer, TimeOfDay)
+ RIO.Time: makeTimeOfDayValid :: Int -> Int -> Pico -> Maybe TimeOfDay
+ RIO.Time: midday :: TimeOfDay
+ RIO.Time: midnight :: TimeOfDay
+ RIO.Time: minutesToTimeZone :: Int -> TimeZone
+ RIO.Time: newtype Day
+ RIO.Time: newtype UniversalTime
+ RIO.Time: nominalDay :: NominalDiffTime
+ RIO.Time: parseTime :: ParseTime t => TimeLocale -> String -> String -> Maybe t
+ RIO.Time: parseTimeM :: (Monad m, ParseTime t) => Bool -> TimeLocale -> String -> String -> m t
+ RIO.Time: parseTimeOrError :: ParseTime t => Bool -> TimeLocale -> String -> String -> t
+ RIO.Time: picosecondsToDiffTime :: Integer -> DiffTime
+ RIO.Time: readPTime :: ParseTime t => Bool -> TimeLocale -> String -> ReadP t
+ RIO.Time: readSTime :: ParseTime t => Bool -> TimeLocale -> String -> ReadS t
+ RIO.Time: readTime :: ParseTime t => TimeLocale -> String -> String -> t
+ RIO.Time: readsTime :: ParseTime t => TimeLocale -> String -> ReadS t
+ RIO.Time: rfc822DateFormat :: String
+ RIO.Time: secondsToDiffTime :: Integer -> DiffTime
+ RIO.Time: showGregorian :: Day -> String
+ RIO.Time: timeOfDayToDayFraction :: TimeOfDay -> Rational
+ RIO.Time: timeOfDayToTime :: TimeOfDay -> DiffTime
+ RIO.Time: timeToTimeOfDay :: DiffTime -> TimeOfDay
+ RIO.Time: timeZoneOffsetString :: TimeZone -> String
+ RIO.Time: timeZoneOffsetString' :: Maybe Char -> TimeZone -> String
+ RIO.Time: toGregorian :: Day -> (Integer, Int, Int)
+ RIO.Time: type NumericPadOption = Maybe Char
+ RIO.Time: ut1ToLocalTime :: Rational -> UniversalTime -> LocalTime
+ RIO.Time: utc :: TimeZone
+ RIO.Time: utcToLocalTime :: TimeZone -> UTCTime -> LocalTime
+ RIO.Time: utcToLocalTimeOfDay :: TimeZone -> TimeOfDay -> (Integer, TimeOfDay)
+ RIO.Time: utcToZonedTime :: TimeZone -> UTCTime -> ZonedTime
+ RIO.Time: zonedTimeToUTC :: ZonedTime -> UTCTime
+ RIO.Writer: class (Monoid w, Monad m) => MonadWriter w (m :: * -> *) | m -> w
+ RIO.Writer: listen :: MonadWriter w m => m a -> m (a, w)
+ RIO.Writer: pass :: MonadWriter w m => m (a, w -> w) -> m a
+ RIO.Writer: tell :: MonadWriter w m => w -> m ()
+ RIO.Writer: writer :: MonadWriter w m => (a, w) -> m a
- RIO: ($!!) :: NFData a => (a -> b) -> a -> b
+ RIO: ($!!) :: NFData a => a -> b -> a -> b
- RIO: ($!) :: () => (a -> b) -> a -> b
+ RIO: ($!) :: () => a -> b -> a -> b
- RIO: ($) :: () => (a -> b) -> a -> b
+ RIO: ($) :: () => a -> b -> a -> b
- RIO: (&&&) :: Arrow a => forall b c c'. () => a b c -> a b c' -> a b (c, c')
+ RIO: (&&&) :: Arrow a => a b c -> a b c' -> a b (c, c')
- RIO: (&) :: () => a -> (a -> b) -> b
+ RIO: (&) :: () => a -> a -> b -> b
- RIO: (***) :: Arrow a => forall b c b' c'. () => a b c -> a b' c' -> a (b, b') (c, c')
+ RIO: (***) :: Arrow a => a b c -> a b' c' -> a (b, b') (c, c')
- RIO: (.) :: () => (b -> c) -> (a -> b) -> a -> c
+ RIO: (.) :: () => b -> c -> a -> b -> a -> c
- RIO: (<$!>) :: Monad m => (a -> b) -> m a -> m b
+ RIO: (<$!>) :: Monad m => a -> b -> m a -> m b
- RIO: (<$>) :: Functor f => (a -> b) -> f a -> f b
+ RIO: (<$>) :: Functor f => a -> b -> f a -> f b
- RIO: (<*>) :: Applicative f => f (a -> b) -> f a -> f b
+ RIO: (<*>) :: Applicative f => f a -> b -> f a -> f b
- RIO: (<=<) :: Monad m => (b -> m c) -> (a -> m b) -> a -> m c
+ RIO: (<=<) :: Monad m => b -> m c -> a -> m b -> a -> m c
- RIO: (<|>) :: Alternative f => forall a. () => f a -> f a -> f a
+ RIO: (<|>) :: Alternative f => f a -> f a -> f a
- RIO: (=<<) :: Monad m => (a -> m b) -> m a -> m b
+ RIO: (=<<) :: Monad m => a -> m b -> m a -> m b
- RIO: (>=>) :: Monad m => (a -> m b) -> (b -> m c) -> a -> m c
+ RIO: (>=>) :: Monad m => a -> m b -> b -> m c -> a -> m c
- RIO: (>>=) :: Monad m => m a -> (a -> m b) -> m b
+ RIO: (>>=) :: Monad m => m a -> a -> m b -> m b
- RIO: ReaderT :: (r -> m a) -> ReaderT k r
+ RIO: ReaderT :: r -> m a -> ReaderT r
- RIO: [runReaderT] :: ReaderT k r -> r -> m a
+ RIO: [runReaderT] :: ReaderT r -> r -> m a
- RIO: all :: Foldable t => (a -> Bool) -> t a -> Bool
+ RIO: all :: Foldable t => a -> Bool -> t a -> Bool
- RIO: any :: Foldable t => (a -> Bool) -> t a -> Bool
+ RIO: any :: Foldable t => a -> Bool -> t a -> Bool
- RIO: asks :: MonadReader r m => (r -> a) -> m a
+ RIO: asks :: MonadReader r m => r -> a -> m a
- RIO: break :: () => (a -> Bool) -> [a] -> ([a], [a])
+ RIO: break :: () => a -> Bool -> [a] -> ([a], [a])
- RIO: class Typeable * a => Data a
+ RIO: class Typeable a => Data a
- RIO: class MonadTrans (t :: (* -> *) -> * -> *)
+ RIO: class MonadTrans (t :: * -> * -> * -> *)
- RIO: class Monoid a
+ RIO: class Semigroup a => Monoid a
- RIO: comparing :: Ord a => (b -> a) -> b -> b -> Ordering
+ RIO: comparing :: Ord a => b -> a -> b -> b -> Ordering
- RIO: concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
+ RIO: concatMap :: Foldable t => a -> [b] -> t a -> [b]
- RIO: curry :: () => ((a, b) -> c) -> a -> b -> c
+ RIO: curry :: () => (a, b) -> c -> a -> b -> c
- RIO: data Bool :: *
+ RIO: data Bool
- RIO: data Builder :: *
+ RIO: data Builder
- RIO: data ByteString :: *
+ RIO: data ByteString
- RIO: data CallStack :: *
+ RIO: data CallStack
- RIO: data Char :: *
+ RIO: data Char
- RIO: data Double :: *
+ RIO: data Double
- RIO: data Either a b :: * -> * -> *
+ RIO: data Either a b
- RIO: data ExitCode :: *
+ RIO: data ExitCode
- RIO: data Float :: *
+ RIO: data Float
- RIO: data HashMap k v :: * -> * -> *
+ RIO: data HashMap k v
- RIO: data HashSet a :: * -> *
+ RIO: data HashSet a
- RIO: data IO a :: * -> *
+ RIO: data IO a
- RIO: data Int :: *
+ RIO: data Int
- RIO: data Int16 :: *
+ RIO: data Int16
- RIO: data Int32 :: *
+ RIO: data Int32
- RIO: data Int64 :: *
+ RIO: data Int64
- RIO: data Int8 :: *
+ RIO: data Int8
- RIO: data IntMap a :: * -> *
+ RIO: data IntMap a
- RIO: data IntSet :: *
+ RIO: data IntSet
- RIO: data Integer :: *
+ RIO: data Integer
- RIO: data Map k a :: * -> * -> *
+ RIO: data Map k a
- RIO: data Maybe a :: * -> *
+ RIO: data Maybe a
- RIO: data Ordering :: *
+ RIO: data Ordering
- RIO: data Set a :: * -> *
+ RIO: data Set a
- RIO: data ShortByteString :: *
+ RIO: data ShortByteString
- RIO: data Text :: *
+ RIO: data Text
- RIO: data ThreadId :: *
+ RIO: data ThreadId
- RIO: data UnicodeException :: *
+ RIO: data UnicodeException
- RIO: data Vector a :: * -> *
+ RIO: data Vector a
- RIO: data Void :: *
+ RIO: data Void
- RIO: data Word :: *
+ RIO: data Word
- RIO: data Word16 :: *
+ RIO: data Word16
- RIO: data Word32 :: *
+ RIO: data Word32
- RIO: data Word64 :: *
+ RIO: data Word64
- RIO: data Word8 :: *
+ RIO: data Word8
- RIO: dataCast1 :: (Data a, Typeable (* -> *) t) => (forall d. Data d => c t d) -> Maybe c a
+ RIO: dataCast1 :: (Data a, Typeable t) => forall d. Data d => c t d -> Maybe c a
- RIO: dataCast2 :: (Data a, Typeable (* -> * -> *) t) => (forall d e. (Data d, Data e) => c t d e) -> Maybe c a
+ RIO: dataCast2 :: (Data a, Typeable t) => forall d e. (Data d, Data e) => c t d e -> Maybe c a
- RIO: dropWhile :: () => (a -> Bool) -> [a] -> [a]
+ RIO: dropWhile :: () => a -> Bool -> [a] -> [a]
- RIO: either :: () => (a -> c) -> (b -> c) -> Either a b -> c
+ RIO: either :: () => a -> c -> b -> c -> Either a b -> c
- RIO: elem :: Foldable t => forall a. Eq a => a -> t a -> Bool
+ RIO: elem :: (Foldable t, Eq a) => a -> t a -> Bool
- RIO: filter :: () => (a -> Bool) -> [a] -> [a]
+ RIO: filter :: () => a -> Bool -> [a] -> [a]
- RIO: filterM :: Applicative m => (a -> m Bool) -> [a] -> m [a]
+ RIO: filterM :: Applicative m => a -> m Bool -> [a] -> m [a]
- RIO: first :: Arrow a => forall b c d. () => a b c -> a (b, d) (c, d)
+ RIO: first :: Arrow a => a b c -> a (b, d) (c, d)
- RIO: fix :: () => (a -> a) -> a
+ RIO: fix :: () => a -> a -> a
- RIO: flip :: () => (a -> b -> c) -> b -> a -> c
+ RIO: flip :: () => a -> b -> c -> b -> a -> c
- RIO: fmap :: Functor f => (a -> b) -> f a -> f b
+ RIO: fmap :: Functor f => a -> b -> f a -> f b
- RIO: fold :: Foldable t => forall m. Monoid m => t m -> m
+ RIO: fold :: (Foldable t, Monoid m) => t m -> m
- RIO: foldM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b
+ RIO: foldM :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m b
- RIO: foldM_ :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m ()
+ RIO: foldM_ :: (Foldable t, Monad m) => b -> a -> m b -> b -> t a -> m ()
- RIO: foldMap :: Foldable t => forall m a. Monoid m => (a -> m) -> t a -> m
+ RIO: foldMap :: (Foldable t, Monoid m) => a -> m -> t a -> m
- RIO: foldl' :: Foldable t => forall b a. () => (b -> a -> b) -> b -> t a -> b
+ RIO: foldl' :: Foldable t => b -> a -> b -> b -> t a -> b
- RIO: foldr :: Foldable t => forall a b. () => (a -> b -> b) -> b -> t a -> b
+ RIO: foldr :: Foldable t => a -> b -> b -> b -> t a -> b
- RIO: for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f t b
+ RIO: for :: (Traversable t, Applicative f) => t a -> a -> f b -> f t b
- RIO: forM :: (Traversable t, Monad m) => t a -> (a -> m b) -> m t b
+ RIO: forM :: (Traversable t, Monad m) => t a -> a -> m b -> m t b
- RIO: forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m ()
+ RIO: forM_ :: (Foldable t, Monad m) => t a -> a -> m b -> m ()
- RIO: for_ :: (Foldable t, Applicative f) => t a -> (a -> f b) -> f ()
+ RIO: for_ :: (Foldable t, Applicative f) => t a -> a -> f b -> f ()
- RIO: gfoldl :: Data a => (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. () => g -> c g) -> a -> c a
+ RIO: gfoldl :: Data a => forall d b. Data d => c d -> b -> d -> c b -> forall g. () => g -> c g -> a -> c a
- RIO: gmapM :: (Data a, Monad m) => (forall d. Data d => d -> m d) -> a -> m a
+ RIO: gmapM :: (Data a, Monad m) => forall d. Data d => d -> m d -> a -> m a
- RIO: gmapMo :: (Data a, MonadPlus m) => (forall d. Data d => d -> m d) -> a -> m a
+ RIO: gmapMo :: (Data a, MonadPlus m) => forall d. Data d => d -> m d -> a -> m a
- RIO: gmapMp :: (Data a, MonadPlus m) => (forall d. Data d => d -> m d) -> a -> m a
+ RIO: gmapMp :: (Data a, MonadPlus m) => forall d. Data d => d -> m d -> a -> m a
- RIO: gmapQ :: Data a => (forall d. Data d => d -> u) -> a -> [u]
+ RIO: gmapQ :: Data a => forall d. Data d => d -> u -> a -> [u]
- RIO: gmapQi :: Data a => Int -> (forall d. Data d => d -> u) -> a -> u
+ RIO: gmapQi :: Data a => Int -> forall d. Data d => d -> u -> a -> u
- RIO: gmapQl :: Data a => (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r
+ RIO: gmapQl :: Data a => r -> r' -> r -> r -> forall d. Data d => d -> r' -> a -> r
- RIO: gmapQr :: Data a => (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r
+ RIO: gmapQr :: Data a => r' -> r -> r -> r -> forall d. Data d => d -> r' -> a -> r
- RIO: gmapT :: Data a => (forall b. Data b => b -> b) -> a -> a
+ RIO: gmapT :: Data a => forall b. Data b => b -> b -> a -> a
- RIO: gunfold :: Data a => (forall b r. Data b => c (b -> r) -> c r) -> (forall r. () => r -> c r) -> Constr -> c a
+ RIO: gunfold :: Data a => forall b r. Data b => c b -> r -> c r -> forall r. () => r -> c r -> Constr -> c a
- RIO: length :: Foldable t => forall a. () => t a -> Int
+ RIO: length :: Foldable t => t a -> Int
- RIO: lens :: () => (s -> a) -> (s -> b -> t) -> Lens s t a b
+ RIO: lens :: () => s -> a -> s -> b -> t -> Lens s t a b
- RIO: liftA :: Applicative f => (a -> b) -> f a -> f b
+ RIO: liftA :: Applicative f => a -> b -> f a -> f b
- RIO: liftA2 :: Applicative f => (a -> b -> c) -> f a -> f b -> f c
+ RIO: liftA2 :: Applicative f => a -> b -> c -> f a -> f b -> f c
- RIO: liftA3 :: Applicative f => (a -> b -> c -> d) -> f a -> f b -> f c -> f d
+ RIO: liftA3 :: Applicative f => a -> b -> c -> d -> f a -> f b -> f c -> f d
- RIO: liftM :: Monad m => (a1 -> r) -> m a1 -> m r
+ RIO: liftM :: Monad m => a1 -> r -> m a1 -> m r
- RIO: liftM2 :: Monad m => (a1 -> a2 -> r) -> m a1 -> m a2 -> m r
+ RIO: liftM2 :: Monad m => a1 -> a2 -> r -> m a1 -> m a2 -> m r
- RIO: local :: MonadReader r m => forall a. () => (r -> r) -> m a -> m a
+ RIO: local :: MonadReader r m => r -> r -> m a -> m a
- RIO: many :: Alternative f => forall a. () => f a -> f [a]
+ RIO: many :: Alternative f => f a -> f [a]
- RIO: map :: () => (a -> b) -> [a] -> [b]
+ RIO: map :: () => a -> b -> [a] -> [b]
- RIO: mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m t b
+ RIO: mapM :: (Traversable t, Monad m) => a -> m b -> t a -> m t b
- RIO: mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()
+ RIO: mapM_ :: (Foldable t, Monad m) => a -> m b -> t a -> m ()
- RIO: mapMaybe :: () => (a -> Maybe b) -> [a] -> [b]
+ RIO: mapMaybe :: () => a -> Maybe b -> [a] -> [b]
- RIO: maybe :: () => b -> (a -> b) -> Maybe a -> b
+ RIO: maybe :: () => b -> a -> b -> Maybe a -> b
- RIO: newtype ReaderT k r (m :: k -> *) (a :: k) :: forall k. () => * -> (k -> *) -> k -> *
+ RIO: newtype Const a (b :: k) :: forall k. () => * -> k -> *
- RIO: null :: Foldable t => forall a. () => t a -> Bool
+ RIO: null :: Foldable t => t a -> Bool
- RIO: on :: () => (b -> b -> c) -> (a -> b) -> a -> a -> c
+ RIO: on :: () => b -> b -> c -> a -> b -> a -> a -> c
- RIO: over :: () => ASetter s t a b -> (a -> b) -> s -> t
+ RIO: over :: () => ASetter s t a b -> a -> b -> s -> t
- RIO: primitive :: PrimMonad m => (State# PrimState m -> (# TupleRep [] RuntimeRep, LiftedRep, State# PrimState m, a #)) -> m a
+ RIO: primitive :: PrimMonad m => State# PrimState m -> (# State# PrimState m, a #) -> m a
- RIO: product :: Foldable t => forall a. Num a => t a -> a
+ RIO: product :: (Foldable t, Num a) => t a -> a
- RIO: second :: Arrow a => forall b c d. () => a b c -> a (d, b) (d, c)
+ RIO: second :: Arrow a => a b c -> a (d, b) (d, c)
- RIO: sets :: () => ((a -> b) -> s -> t) -> ASetter s t a b
+ RIO: sets :: () => a -> b -> s -> t -> ASetter s t a b
- RIO: some :: Alternative f => forall a. () => f a -> f [a]
+ RIO: some :: Alternative f => f a -> f [a]
- RIO: span :: () => (a -> Bool) -> [a] -> ([a], [a])
+ RIO: span :: () => a -> Bool -> [a] -> ([a], [a])
- RIO: sum :: Foldable t => forall a. Num a => t a -> a
+ RIO: sum :: (Foldable t, Num a) => t a -> a
- RIO: takeWhile :: () => (a -> Bool) -> [a] -> [a]
+ RIO: takeWhile :: () => a -> Bool -> [a] -> [a]
- RIO: to :: () => (s -> a) -> SimpleGetter s a
+ RIO: to :: () => s -> a -> SimpleGetter s a
- RIO: toList :: Foldable t => forall a. () => t a -> [a]
+ RIO: toList :: Foldable t => t a -> [a]
- RIO: traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f t b
+ RIO: traverse :: (Traversable t, Applicative f) => a -> f b -> t a -> f t b
- RIO: traverse_ :: (Foldable t, Applicative f) => (a -> f b) -> t a -> f ()
+ RIO: traverse_ :: (Foldable t, Applicative f) => a -> f b -> t a -> f ()
- RIO: type ASetter s t a b = (a -> Identity b) -> s -> Identity t
+ RIO: type ASetter s t a b = a -> Identity b -> s -> Identity t
- RIO: uncurry :: () => (a -> b -> c) -> (a, b) -> c
+ RIO: uncurry :: () => a -> b -> c -> (a, b) -> c
- RIO: zipWithM :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m [c]
+ RIO: zipWithM :: Applicative m => a -> b -> m c -> [a] -> [b] -> m [c]
- RIO: zipWithM_ :: Applicative m => (a -> b -> m c) -> [a] -> [b] -> m ()
+ RIO: zipWithM_ :: Applicative m => a -> b -> m c -> [a] -> [b] -> m ()
- RIO.ByteString.Lazy: all :: (Word8 -> Bool) -> ByteString -> Bool
+ RIO.ByteString.Lazy: all :: Word8 -> Bool -> ByteString -> Bool
- RIO.ByteString.Lazy: any :: (Word8 -> Bool) -> ByteString -> Bool
+ RIO.ByteString.Lazy: any :: Word8 -> Bool -> ByteString -> Bool
- RIO.ByteString.Lazy: break :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString.Lazy: break :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
- RIO.ByteString.Lazy: concatMap :: (Word8 -> ByteString) -> ByteString -> ByteString
+ RIO.ByteString.Lazy: concatMap :: Word8 -> ByteString -> ByteString -> ByteString
- RIO.ByteString.Lazy: data ByteString :: *
+ RIO.ByteString.Lazy: data ByteString
- RIO.ByteString.Lazy: dropWhile :: (Word8 -> Bool) -> ByteString -> ByteString
+ RIO.ByteString.Lazy: dropWhile :: Word8 -> Bool -> ByteString -> ByteString
- RIO.ByteString.Lazy: filter :: (Word8 -> Bool) -> ByteString -> ByteString
+ RIO.ByteString.Lazy: filter :: Word8 -> Bool -> ByteString -> ByteString
- RIO.ByteString.Lazy: find :: (Word8 -> Bool) -> ByteString -> Maybe Word8
+ RIO.ByteString.Lazy: find :: Word8 -> Bool -> ByteString -> Maybe Word8
- RIO.ByteString.Lazy: findIndex :: (Word8 -> Bool) -> ByteString -> Maybe Int64
+ RIO.ByteString.Lazy: findIndex :: Word8 -> Bool -> ByteString -> Maybe Int64
- RIO.ByteString.Lazy: findIndices :: (Word8 -> Bool) -> ByteString -> [Int64]
+ RIO.ByteString.Lazy: findIndices :: Word8 -> Bool -> ByteString -> [Int64]
- RIO.ByteString.Lazy: foldl :: () => (a -> Word8 -> a) -> a -> ByteString -> a
+ RIO.ByteString.Lazy: foldl :: () => a -> Word8 -> a -> a -> ByteString -> a
- RIO.ByteString.Lazy: foldl' :: () => (a -> Word8 -> a) -> a -> ByteString -> a
+ RIO.ByteString.Lazy: foldl' :: () => a -> Word8 -> a -> a -> ByteString -> a
- RIO.ByteString.Lazy: foldlChunks :: () => (a -> ByteString -> a) -> a -> ByteString -> a
+ RIO.ByteString.Lazy: foldlChunks :: () => a -> ByteString -> a -> a -> ByteString -> a
- RIO.ByteString.Lazy: foldr :: () => (Word8 -> a -> a) -> a -> ByteString -> a
+ RIO.ByteString.Lazy: foldr :: () => Word8 -> a -> a -> a -> ByteString -> a
- RIO.ByteString.Lazy: foldrChunks :: () => (ByteString -> a -> a) -> a -> ByteString -> a
+ RIO.ByteString.Lazy: foldrChunks :: () => ByteString -> a -> a -> a -> ByteString -> a
- RIO.ByteString.Lazy: groupBy :: (Word8 -> Word8 -> Bool) -> ByteString -> [ByteString]
+ RIO.ByteString.Lazy: groupBy :: Word8 -> Word8 -> Bool -> ByteString -> [ByteString]
- RIO.ByteString.Lazy: iterate :: (Word8 -> Word8) -> Word8 -> ByteString
+ RIO.ByteString.Lazy: iterate :: Word8 -> Word8 -> Word8 -> ByteString
- RIO.ByteString.Lazy: map :: (Word8 -> Word8) -> ByteString -> ByteString
+ RIO.ByteString.Lazy: map :: Word8 -> Word8 -> ByteString -> ByteString
- RIO.ByteString.Lazy: mapAccumL :: () => (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)
+ RIO.ByteString.Lazy: mapAccumL :: () => acc -> Word8 -> (acc, Word8) -> acc -> ByteString -> (acc, ByteString)
- RIO.ByteString.Lazy: mapAccumR :: () => (acc -> Word8 -> (acc, Word8)) -> acc -> ByteString -> (acc, ByteString)
+ RIO.ByteString.Lazy: mapAccumR :: () => acc -> Word8 -> (acc, Word8) -> acc -> ByteString -> (acc, ByteString)
- RIO.ByteString.Lazy: partition :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString.Lazy: partition :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
- RIO.ByteString.Lazy: scanl :: (Word8 -> Word8 -> Word8) -> Word8 -> ByteString -> ByteString
+ RIO.ByteString.Lazy: scanl :: Word8 -> Word8 -> Word8 -> Word8 -> ByteString -> ByteString
- RIO.ByteString.Lazy: span :: (Word8 -> Bool) -> ByteString -> (ByteString, ByteString)
+ RIO.ByteString.Lazy: span :: Word8 -> Bool -> ByteString -> (ByteString, ByteString)
- RIO.ByteString.Lazy: splitWith :: (Word8 -> Bool) -> ByteString -> [ByteString]
+ RIO.ByteString.Lazy: splitWith :: Word8 -> Bool -> ByteString -> [ByteString]
- RIO.ByteString.Lazy: takeWhile :: (Word8 -> Bool) -> ByteString -> ByteString
+ RIO.ByteString.Lazy: takeWhile :: Word8 -> Bool -> ByteString -> ByteString
- RIO.ByteString.Lazy: unfoldr :: () => (a -> Maybe (Word8, a)) -> a -> ByteString
+ RIO.ByteString.Lazy: unfoldr :: () => a -> Maybe (Word8, a) -> a -> ByteString
- RIO.ByteString.Lazy: zipWith :: () => (Word8 -> Word8 -> a) -> ByteString -> ByteString -> [a]
+ RIO.ByteString.Lazy: zipWith :: () => Word8 -> Word8 -> a -> ByteString -> ByteString -> [a]
- RIO.ByteString.Lazy.Partial: foldl1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8
+ RIO.ByteString.Lazy.Partial: foldl1 :: Word8 -> Word8 -> Word8 -> ByteString -> Word8
- RIO.ByteString.Lazy.Partial: foldl1' :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8
+ RIO.ByteString.Lazy.Partial: foldl1' :: Word8 -> Word8 -> Word8 -> ByteString -> Word8
- RIO.ByteString.Lazy.Partial: foldr1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8
+ RIO.ByteString.Lazy.Partial: foldr1 :: Word8 -> Word8 -> Word8 -> ByteString -> Word8
- RIO.ByteString.Partial: foldl1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8
+ RIO.ByteString.Partial: foldl1 :: Word8 -> Word8 -> Word8 -> ByteString -> Word8
- RIO.ByteString.Partial: foldl1' :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8
+ RIO.ByteString.Partial: foldl1' :: Word8 -> Word8 -> Word8 -> ByteString -> Word8
- RIO.ByteString.Partial: foldr1 :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8
+ RIO.ByteString.Partial: foldr1 :: Word8 -> Word8 -> Word8 -> ByteString -> Word8
- RIO.ByteString.Partial: foldr1' :: (Word8 -> Word8 -> Word8) -> ByteString -> Word8
+ RIO.ByteString.Partial: foldr1' :: Word8 -> Word8 -> Word8 -> ByteString -> Word8
- RIO.Char: data Char :: *
+ RIO.Char: data Char
- RIO.Char: data GeneralCategory :: *
+ RIO.Char: data GeneralCategory
- RIO.HashMap: adjust :: (Eq k, Hashable k) => (v -> v) -> k -> HashMap k v -> HashMap k v
+ RIO.HashMap: adjust :: (Eq k, Hashable k) => v -> v -> k -> HashMap k v -> HashMap k v
- RIO.HashMap: alter :: (Eq k, Hashable k) => (Maybe v -> Maybe v) -> k -> HashMap k v -> HashMap k v
+ RIO.HashMap: alter :: (Eq k, Hashable k) => Maybe v -> Maybe v -> k -> HashMap k v -> HashMap k v
- RIO.HashMap: data HashMap k v :: * -> * -> *
+ RIO.HashMap: data HashMap k v
- RIO.HashMap: differenceWith :: (Eq k, Hashable k) => (v -> w -> Maybe v) -> HashMap k v -> HashMap k w -> HashMap k v
+ RIO.HashMap: differenceWith :: (Eq k, Hashable k) => v -> w -> Maybe v -> HashMap k v -> HashMap k w -> HashMap k v
- RIO.HashMap: filter :: () => (v -> Bool) -> HashMap k v -> HashMap k v
+ RIO.HashMap: filter :: () => v -> Bool -> HashMap k v -> HashMap k v
- RIO.HashMap: filterWithKey :: () => (k -> v -> Bool) -> HashMap k v -> HashMap k v
+ RIO.HashMap: filterWithKey :: () => k -> v -> Bool -> HashMap k v -> HashMap k v
- RIO.HashMap: foldl' :: () => (a -> v -> a) -> a -> HashMap k v -> a
+ RIO.HashMap: foldl' :: () => a -> v -> a -> a -> HashMap k v -> a
- RIO.HashMap: foldlWithKey' :: () => (a -> k -> v -> a) -> a -> HashMap k v -> a
+ RIO.HashMap: foldlWithKey' :: () => a -> k -> v -> a -> a -> HashMap k v -> a
- RIO.HashMap: foldr :: () => (v -> a -> a) -> a -> HashMap k v -> a
+ RIO.HashMap: foldr :: () => v -> a -> a -> a -> HashMap k v -> a
- RIO.HashMap: foldrWithKey :: () => (k -> v -> a -> a) -> a -> HashMap k v -> a
+ RIO.HashMap: foldrWithKey :: () => k -> v -> a -> a -> a -> HashMap k v -> a
- RIO.HashMap: fromListWith :: (Eq k, Hashable k) => (v -> v -> v) -> [(k, v)] -> HashMap k v
+ RIO.HashMap: fromListWith :: (Eq k, Hashable k) => v -> v -> v -> [(k, v)] -> HashMap k v
- RIO.HashMap: insertWith :: (Eq k, Hashable k) => (v -> v -> v) -> k -> v -> HashMap k v -> HashMap k v
+ RIO.HashMap: insertWith :: (Eq k, Hashable k) => v -> v -> v -> k -> v -> HashMap k v -> HashMap k v
- RIO.HashMap: intersectionWith :: (Eq k, Hashable k) => (v1 -> v2 -> v3) -> HashMap k v1 -> HashMap k v2 -> HashMap k v3
+ RIO.HashMap: intersectionWith :: (Eq k, Hashable k) => v1 -> v2 -> v3 -> HashMap k v1 -> HashMap k v2 -> HashMap k v3
- RIO.HashMap: intersectionWithKey :: (Eq k, Hashable k) => (k -> v1 -> v2 -> v3) -> HashMap k v1 -> HashMap k v2 -> HashMap k v3
+ RIO.HashMap: intersectionWithKey :: (Eq k, Hashable k) => k -> v1 -> v2 -> v3 -> HashMap k v1 -> HashMap k v2 -> HashMap k v3
- RIO.HashMap: map :: () => (v1 -> v2) -> HashMap k v1 -> HashMap k v2
+ RIO.HashMap: map :: () => v1 -> v2 -> HashMap k v1 -> HashMap k v2
- RIO.HashMap: mapMaybe :: () => (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2
+ RIO.HashMap: mapMaybe :: () => v1 -> Maybe v2 -> HashMap k v1 -> HashMap k v2
- RIO.HashMap: mapMaybeWithKey :: () => (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2
+ RIO.HashMap: mapMaybeWithKey :: () => k -> v1 -> Maybe v2 -> HashMap k v1 -> HashMap k v2
- RIO.HashMap: mapWithKey :: () => (k -> v1 -> v2) -> HashMap k v1 -> HashMap k v2
+ RIO.HashMap: mapWithKey :: () => k -> v1 -> v2 -> HashMap k v1 -> HashMap k v2
- RIO.HashMap: traverseWithKey :: Applicative f => (k -> v1 -> f v2) -> HashMap k v1 -> f HashMap k v2
+ RIO.HashMap: traverseWithKey :: Applicative f => k -> v1 -> f v2 -> HashMap k v1 -> f HashMap k v2
- RIO.HashMap: unionWith :: (Eq k, Hashable k) => (v -> v -> v) -> HashMap k v -> HashMap k v -> HashMap k v
+ RIO.HashMap: unionWith :: (Eq k, Hashable k) => v -> v -> v -> HashMap k v -> HashMap k v -> HashMap k v
- RIO.HashMap: unionWithKey :: (Eq k, Hashable k) => (k -> v -> v -> v) -> HashMap k v -> HashMap k v -> HashMap k v
+ RIO.HashMap: unionWithKey :: (Eq k, Hashable k) => k -> v -> v -> v -> HashMap k v -> HashMap k v -> HashMap k v
- RIO.HashMap: update :: (Eq k, Hashable k) => (a -> Maybe a) -> k -> HashMap k a -> HashMap k a
+ RIO.HashMap: update :: (Eq k, Hashable k) => a -> Maybe a -> k -> HashMap k a -> HashMap k a
- RIO.HashSet: data HashSet a :: * -> *
+ RIO.HashSet: data HashSet a
- RIO.HashSet: filter :: () => (a -> Bool) -> HashSet a -> HashSet a
+ RIO.HashSet: filter :: () => a -> Bool -> HashSet a -> HashSet a
- RIO.HashSet: foldl' :: () => (a -> b -> a) -> a -> HashSet b -> a
+ RIO.HashSet: foldl' :: () => a -> b -> a -> a -> HashSet b -> a
- RIO.HashSet: foldr :: () => (b -> a -> a) -> a -> HashSet b -> a
+ RIO.HashSet: foldr :: () => b -> a -> a -> a -> HashSet b -> a
- RIO.HashSet: map :: (Hashable b, Eq b) => (a -> b) -> HashSet a -> HashSet b
+ RIO.HashSet: map :: (Hashable b, Eq b) => a -> b -> HashSet a -> HashSet b
- RIO.List: all :: Foldable t => (a -> Bool) -> t a -> Bool
+ RIO.List: all :: Foldable t => a -> Bool -> t a -> Bool
- RIO.List: any :: Foldable t => (a -> Bool) -> t a -> Bool
+ RIO.List: any :: Foldable t => a -> Bool -> t a -> Bool
- RIO.List: break :: () => (a -> Bool) -> [a] -> ([a], [a])
+ RIO.List: break :: () => a -> Bool -> [a] -> ([a], [a])
- RIO.List: concatMap :: Foldable t => (a -> [b]) -> t a -> [b]
+ RIO.List: concatMap :: Foldable t => a -> [b] -> t a -> [b]
- RIO.List: deleteBy :: () => (a -> a -> Bool) -> a -> [a] -> [a]
+ RIO.List: deleteBy :: () => a -> a -> Bool -> a -> [a] -> [a]
- RIO.List: deleteFirstsBy :: () => (a -> a -> Bool) -> [a] -> [a] -> [a]
+ RIO.List: deleteFirstsBy :: () => a -> a -> Bool -> [a] -> [a] -> [a]
- RIO.List: dropWhile :: () => (a -> Bool) -> [a] -> [a]
+ RIO.List: dropWhile :: () => a -> Bool -> [a] -> [a]
- RIO.List: dropWhileEnd :: () => (a -> Bool) -> [a] -> [a]
+ RIO.List: dropWhileEnd :: () => a -> Bool -> [a] -> [a]
- RIO.List: elem :: Foldable t => forall a. Eq a => a -> t a -> Bool
+ RIO.List: elem :: (Foldable t, Eq a) => a -> t a -> Bool
- RIO.List: filter :: () => (a -> Bool) -> [a] -> [a]
+ RIO.List: filter :: () => a -> Bool -> [a] -> [a]
- RIO.List: find :: Foldable t => (a -> Bool) -> t a -> Maybe a
+ RIO.List: find :: Foldable t => a -> Bool -> t a -> Maybe a
- RIO.List: findIndex :: () => (a -> Bool) -> [a] -> Maybe Int
+ RIO.List: findIndex :: () => a -> Bool -> [a] -> Maybe Int
- RIO.List: findIndices :: () => (a -> Bool) -> [a] -> [Int]
+ RIO.List: findIndices :: () => a -> Bool -> [a] -> [Int]
- RIO.List: foldl :: Foldable t => forall b a. () => (b -> a -> b) -> b -> t a -> b
+ RIO.List: foldl :: Foldable t => b -> a -> b -> b -> t a -> b
- RIO.List: foldl' :: Foldable t => forall b a. () => (b -> a -> b) -> b -> t a -> b
+ RIO.List: foldl' :: Foldable t => b -> a -> b -> b -> t a -> b
- RIO.List: foldr :: Foldable t => forall a b. () => (a -> b -> b) -> b -> t a -> b
+ RIO.List: foldr :: Foldable t => a -> b -> b -> b -> t a -> b
- RIO.List: groupBy :: () => (a -> a -> Bool) -> [a] -> [[a]]
+ RIO.List: groupBy :: () => a -> a -> Bool -> [a] -> [[a]]
- RIO.List: insertBy :: () => (a -> a -> Ordering) -> a -> [a] -> [a]
+ RIO.List: insertBy :: () => a -> a -> Ordering -> a -> [a] -> [a]
- RIO.List: intersectBy :: () => (a -> a -> Bool) -> [a] -> [a] -> [a]
+ RIO.List: intersectBy :: () => a -> a -> Bool -> [a] -> [a] -> [a]
- RIO.List: iterate :: () => (a -> a) -> a -> [a]
+ RIO.List: iterate :: () => a -> a -> a -> [a]
- RIO.List: length :: Foldable t => forall a. () => t a -> Int
+ RIO.List: length :: Foldable t => t a -> Int
- RIO.List: map :: () => (a -> b) -> [a] -> [b]
+ RIO.List: map :: () => a -> b -> [a] -> [b]
- RIO.List: mapAccumL :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ RIO.List: mapAccumL :: Traversable t => a -> b -> (a, c) -> a -> t b -> (a, t c)
- RIO.List: mapAccumR :: Traversable t => (a -> b -> (a, c)) -> a -> t b -> (a, t c)
+ RIO.List: mapAccumR :: Traversable t => a -> b -> (a, c) -> a -> t b -> (a, t c)
- RIO.List: nubBy :: () => (a -> a -> Bool) -> [a] -> [a]
+ RIO.List: nubBy :: () => a -> a -> Bool -> [a] -> [a]
- RIO.List: null :: Foldable t => forall a. () => t a -> Bool
+ RIO.List: null :: Foldable t => t a -> Bool
- RIO.List: partition :: () => (a -> Bool) -> [a] -> ([a], [a])
+ RIO.List: partition :: () => a -> Bool -> [a] -> ([a], [a])
- RIO.List: product :: Foldable t => forall a. Num a => t a -> a
+ RIO.List: product :: (Foldable t, Num a) => t a -> a
- RIO.List: scanl :: () => (b -> a -> b) -> b -> [a] -> [b]
+ RIO.List: scanl :: () => b -> a -> b -> b -> [a] -> [b]
- RIO.List: scanl' :: () => (b -> a -> b) -> b -> [a] -> [b]
+ RIO.List: scanl' :: () => b -> a -> b -> b -> [a] -> [b]
- RIO.List: scanl1 :: () => (a -> a -> a) -> [a] -> [a]
+ RIO.List: scanl1 :: () => a -> a -> a -> [a] -> [a]
- RIO.List: scanr :: () => (a -> b -> b) -> b -> [a] -> [b]
+ RIO.List: scanr :: () => a -> b -> b -> b -> [a] -> [b]
- RIO.List: scanr1 :: () => (a -> a -> a) -> [a] -> [a]
+ RIO.List: scanr1 :: () => a -> a -> a -> [a] -> [a]
- RIO.List: sortBy :: () => (a -> a -> Ordering) -> [a] -> [a]
+ RIO.List: sortBy :: () => a -> a -> Ordering -> [a] -> [a]
- RIO.List: sortOn :: Ord b => (a -> b) -> [a] -> [a]
+ RIO.List: sortOn :: Ord b => a -> b -> [a] -> [a]
- RIO.List: span :: () => (a -> Bool) -> [a] -> ([a], [a])
+ RIO.List: span :: () => a -> Bool -> [a] -> ([a], [a])
- RIO.List: sum :: Foldable t => forall a. Num a => t a -> a
+ RIO.List: sum :: (Foldable t, Num a) => t a -> a
- RIO.List: takeWhile :: () => (a -> Bool) -> [a] -> [a]
+ RIO.List: takeWhile :: () => a -> Bool -> [a] -> [a]
- RIO.List: unfoldr :: () => (b -> Maybe (a, b)) -> b -> [a]
+ RIO.List: unfoldr :: () => b -> Maybe (a, b) -> b -> [a]
- RIO.List: unionBy :: () => (a -> a -> Bool) -> [a] -> [a] -> [a]
+ RIO.List: unionBy :: () => a -> a -> Bool -> [a] -> [a] -> [a]
- RIO.List: zipWith :: () => (a -> b -> c) -> [a] -> [b] -> [c]
+ RIO.List: zipWith :: () => a -> b -> c -> [a] -> [b] -> [c]
- RIO.List: zipWith3 :: () => (a -> b -> c -> d) -> [a] -> [b] -> [c] -> [d]
+ RIO.List: zipWith3 :: () => a -> b -> c -> d -> [a] -> [b] -> [c] -> [d]
- RIO.List: zipWith4 :: () => (a -> b -> c -> d -> e) -> [a] -> [b] -> [c] -> [d] -> [e]
+ RIO.List: zipWith4 :: () => a -> b -> c -> d -> e -> [a] -> [b] -> [c] -> [d] -> [e]
- RIO.List: zipWith5 :: () => (a -> b -> c -> d -> e -> f) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]
+ RIO.List: zipWith5 :: () => a -> b -> c -> d -> e -> f -> [a] -> [b] -> [c] -> [d] -> [e] -> [f]
- RIO.List: zipWith6 :: () => (a -> b -> c -> d -> e -> f -> g) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g]
+ RIO.List: zipWith6 :: () => a -> b -> c -> d -> e -> f -> g -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g]
- RIO.List: zipWith7 :: () => (a -> b -> c -> d -> e -> f -> g -> h) -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h]
+ RIO.List: zipWith7 :: () => a -> b -> c -> d -> e -> f -> g -> h -> [a] -> [b] -> [c] -> [d] -> [e] -> [f] -> [g] -> [h]
- RIO.List.Partial: foldl1 :: Foldable t => forall a. () => (a -> a -> a) -> t a -> a
+ RIO.List.Partial: foldl1 :: Foldable t => a -> a -> a -> t a -> a
- RIO.List.Partial: foldl1' :: () => (a -> a -> a) -> [a] -> a
+ RIO.List.Partial: foldl1' :: () => a -> a -> a -> [a] -> a
- RIO.List.Partial: foldr1 :: Foldable t => forall a. () => (a -> a -> a) -> t a -> a
+ RIO.List.Partial: foldr1 :: Foldable t => a -> a -> a -> t a -> a
- RIO.List.Partial: maximum :: Foldable t => forall a. Ord a => t a -> a
+ RIO.List.Partial: maximum :: (Foldable t, Ord a) => t a -> a
- RIO.List.Partial: maximumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
+ RIO.List.Partial: maximumBy :: Foldable t => a -> a -> Ordering -> t a -> a
- RIO.List.Partial: minimum :: Foldable t => forall a. Ord a => t a -> a
+ RIO.List.Partial: minimum :: (Foldable t, Ord a) => t a -> a
- RIO.List.Partial: minimumBy :: Foldable t => (a -> a -> Ordering) -> t a -> a
+ RIO.List.Partial: minimumBy :: Foldable t => a -> a -> Ordering -> t a -> a
- RIO.List.Partial: scanl1 :: () => (a -> a -> a) -> [a] -> [a]
+ RIO.List.Partial: scanl1 :: () => a -> a -> a -> [a] -> [a]
- RIO.List.Partial: scanr1 :: () => (a -> a -> a) -> [a] -> [a]
+ RIO.List.Partial: scanr1 :: () => a -> a -> a -> [a] -> [a]
- RIO.Map: adjust :: Ord k => (a -> a) -> k -> Map k a -> Map k a
+ RIO.Map: adjust :: Ord k => a -> a -> k -> Map k a -> Map k a
- RIO.Map: adjustWithKey :: Ord k => (k -> a -> a) -> k -> Map k a -> Map k a
+ RIO.Map: adjustWithKey :: Ord k => k -> a -> a -> k -> Map k a -> Map k a
- RIO.Map: alter :: Ord k => (Maybe a -> Maybe a) -> k -> Map k a -> Map k a
+ RIO.Map: alter :: Ord k => Maybe a -> Maybe a -> k -> Map k a -> Map k a
- RIO.Map: alterF :: (Functor f, Ord k) => (Maybe a -> f Maybe a) -> k -> Map k a -> f Map k a
+ RIO.Map: alterF :: (Functor f, Ord k) => Maybe a -> f Maybe a -> k -> Map k a -> f Map k a
- RIO.Map: data Map k a :: * -> * -> *
+ RIO.Map: data Map k a
- RIO.Map: differenceWith :: Ord k => (a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a
+ RIO.Map: differenceWith :: Ord k => a -> b -> Maybe a -> Map k a -> Map k b -> Map k a
- RIO.Map: differenceWithKey :: Ord k => (k -> a -> b -> Maybe a) -> Map k a -> Map k b -> Map k a
+ RIO.Map: differenceWithKey :: Ord k => k -> a -> b -> Maybe a -> Map k a -> Map k b -> Map k a
- RIO.Map: dropWhileAntitone :: () => (k -> Bool) -> Map k a -> Map k a
+ RIO.Map: dropWhileAntitone :: () => k -> Bool -> Map k a -> Map k a
- RIO.Map: filter :: () => (a -> Bool) -> Map k a -> Map k a
+ RIO.Map: filter :: () => a -> Bool -> Map k a -> Map k a
- RIO.Map: filterWithKey :: () => (k -> a -> Bool) -> Map k a -> Map k a
+ RIO.Map: filterWithKey :: () => k -> a -> Bool -> Map k a -> Map k a
- RIO.Map: foldMapWithKey :: Monoid m => (k -> a -> m) -> Map k a -> m
+ RIO.Map: foldMapWithKey :: Monoid m => k -> a -> m -> Map k a -> m
- RIO.Map: foldl :: () => (a -> b -> a) -> a -> Map k b -> a
+ RIO.Map: foldl :: () => a -> b -> a -> a -> Map k b -> a
- RIO.Map: foldl' :: () => (a -> b -> a) -> a -> Map k b -> a
+ RIO.Map: foldl' :: () => a -> b -> a -> a -> Map k b -> a
- RIO.Map: foldlWithKey :: () => (a -> k -> b -> a) -> a -> Map k b -> a
+ RIO.Map: foldlWithKey :: () => a -> k -> b -> a -> a -> Map k b -> a
- RIO.Map: foldlWithKey' :: () => (a -> k -> b -> a) -> a -> Map k b -> a
+ RIO.Map: foldlWithKey' :: () => a -> k -> b -> a -> a -> Map k b -> a
- RIO.Map: foldr :: () => (a -> b -> b) -> b -> Map k a -> b
+ RIO.Map: foldr :: () => a -> b -> b -> b -> Map k a -> b
- RIO.Map: foldr' :: () => (a -> b -> b) -> b -> Map k a -> b
+ RIO.Map: foldr' :: () => a -> b -> b -> b -> Map k a -> b
- RIO.Map: foldrWithKey :: () => (k -> a -> b -> b) -> b -> Map k a -> b
+ RIO.Map: foldrWithKey :: () => k -> a -> b -> b -> b -> Map k a -> b
- RIO.Map: foldrWithKey' :: () => (k -> a -> b -> b) -> b -> Map k a -> b
+ RIO.Map: foldrWithKey' :: () => k -> a -> b -> b -> b -> Map k a -> b
- RIO.Map: fromListWith :: Ord k => (a -> a -> a) -> [(k, a)] -> Map k a
+ RIO.Map: fromListWith :: Ord k => a -> a -> a -> [(k, a)] -> Map k a
- RIO.Map: fromListWithKey :: Ord k => (k -> a -> a -> a) -> [(k, a)] -> Map k a
+ RIO.Map: fromListWithKey :: Ord k => k -> a -> a -> a -> [(k, a)] -> Map k a
- RIO.Map: fromSet :: () => (k -> a) -> Set k -> Map k a
+ RIO.Map: fromSet :: () => k -> a -> Set k -> Map k a
- RIO.Map: insertLookupWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> (Maybe a, Map k a)
+ RIO.Map: insertLookupWithKey :: Ord k => k -> a -> a -> a -> k -> a -> Map k a -> (Maybe a, Map k a)
- RIO.Map: insertWith :: Ord k => (a -> a -> a) -> k -> a -> Map k a -> Map k a
+ RIO.Map: insertWith :: Ord k => a -> a -> a -> k -> a -> Map k a -> Map k a
- RIO.Map: insertWithKey :: Ord k => (k -> a -> a -> a) -> k -> a -> Map k a -> Map k a
+ RIO.Map: insertWithKey :: Ord k => k -> a -> a -> a -> k -> a -> Map k a -> Map k a
- RIO.Map: intersectionWith :: Ord k => (a -> b -> c) -> Map k a -> Map k b -> Map k c
+ RIO.Map: intersectionWith :: Ord k => a -> b -> c -> Map k a -> Map k b -> Map k c
- RIO.Map: intersectionWithKey :: Ord k => (k -> a -> b -> c) -> Map k a -> Map k b -> Map k c
+ RIO.Map: intersectionWithKey :: Ord k => k -> a -> b -> c -> Map k a -> Map k b -> Map k c
- RIO.Map: isProperSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool
+ RIO.Map: isProperSubmapOfBy :: Ord k => a -> b -> Bool -> Map k a -> Map k b -> Bool
- RIO.Map: isSubmapOfBy :: Ord k => (a -> b -> Bool) -> Map k a -> Map k b -> Bool
+ RIO.Map: isSubmapOfBy :: Ord k => a -> b -> Bool -> Map k a -> Map k b -> Bool
- RIO.Map: map :: () => (a -> b) -> Map k a -> Map k b
+ RIO.Map: map :: () => a -> b -> Map k a -> Map k b
- RIO.Map: mapAccum :: () => (a -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)
+ RIO.Map: mapAccum :: () => a -> b -> (a, c) -> a -> Map k b -> (a, Map k c)
- RIO.Map: mapAccumRWithKey :: () => (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)
+ RIO.Map: mapAccumRWithKey :: () => a -> k -> b -> (a, c) -> a -> Map k b -> (a, Map k c)
- RIO.Map: mapAccumWithKey :: () => (a -> k -> b -> (a, c)) -> a -> Map k b -> (a, Map k c)
+ RIO.Map: mapAccumWithKey :: () => a -> k -> b -> (a, c) -> a -> Map k b -> (a, Map k c)
- RIO.Map: mapEither :: () => (a -> Either b c) -> Map k a -> (Map k b, Map k c)
+ RIO.Map: mapEither :: () => a -> Either b c -> Map k a -> (Map k b, Map k c)
- RIO.Map: mapEitherWithKey :: () => (k -> a -> Either b c) -> Map k a -> (Map k b, Map k c)
+ RIO.Map: mapEitherWithKey :: () => k -> a -> Either b c -> Map k a -> (Map k b, Map k c)
- RIO.Map: mapKeys :: Ord k2 => (k1 -> k2) -> Map k1 a -> Map k2 a
+ RIO.Map: mapKeys :: Ord k2 => k1 -> k2 -> Map k1 a -> Map k2 a
- RIO.Map: mapKeysWith :: Ord k2 => (a -> a -> a) -> (k1 -> k2) -> Map k1 a -> Map k2 a
+ RIO.Map: mapKeysWith :: Ord k2 => a -> a -> a -> k1 -> k2 -> Map k1 a -> Map k2 a
- RIO.Map: mapMaybe :: () => (a -> Maybe b) -> Map k a -> Map k b
+ RIO.Map: mapMaybe :: () => a -> Maybe b -> Map k a -> Map k b
- RIO.Map: mapMaybeWithKey :: () => (k -> a -> Maybe b) -> Map k a -> Map k b
+ RIO.Map: mapMaybeWithKey :: () => k -> a -> Maybe b -> Map k a -> Map k b
- RIO.Map: mapWithKey :: () => (k -> a -> b) -> Map k a -> Map k b
+ RIO.Map: mapWithKey :: () => k -> a -> b -> Map k a -> Map k b
- RIO.Map: mergeWithKey :: Ord k => (k -> a -> b -> Maybe c) -> (Map k a -> Map k c) -> (Map k b -> Map k c) -> Map k a -> Map k b -> Map k c
+ RIO.Map: mergeWithKey :: Ord k => k -> a -> b -> Maybe c -> Map k a -> Map k c -> Map k b -> Map k c -> Map k a -> Map k b -> Map k c
- RIO.Map: partition :: () => (a -> Bool) -> Map k a -> (Map k a, Map k a)
+ RIO.Map: partition :: () => a -> Bool -> Map k a -> (Map k a, Map k a)
- RIO.Map: partitionWithKey :: () => (k -> a -> Bool) -> Map k a -> (Map k a, Map k a)
+ RIO.Map: partitionWithKey :: () => k -> a -> Bool -> Map k a -> (Map k a, Map k a)
- RIO.Map: showTreeWith :: () => (k -> a -> String) -> Bool -> Bool -> Map k a -> String
+ RIO.Map: showTreeWith :: () => k -> a -> String -> Bool -> Bool -> Map k a -> String
- RIO.Map: spanAntitone :: () => (k -> Bool) -> Map k a -> (Map k a, Map k a)
+ RIO.Map: spanAntitone :: () => k -> Bool -> Map k a -> (Map k a, Map k a)
- RIO.Map: takeWhileAntitone :: () => (k -> Bool) -> Map k a -> Map k a
+ RIO.Map: takeWhileAntitone :: () => k -> Bool -> Map k a -> Map k a
- RIO.Map: traverseMaybeWithKey :: Applicative f => (k -> a -> f Maybe b) -> Map k a -> f Map k b
+ RIO.Map: traverseMaybeWithKey :: Applicative f => k -> a -> f Maybe b -> Map k a -> f Map k b
- RIO.Map: traverseWithKey :: Applicative t => (k -> a -> t b) -> Map k a -> t Map k b
+ RIO.Map: traverseWithKey :: Applicative t => k -> a -> t b -> Map k a -> t Map k b
- RIO.Map: unionWith :: Ord k => (a -> a -> a) -> Map k a -> Map k a -> Map k a
+ RIO.Map: unionWith :: Ord k => a -> a -> a -> Map k a -> Map k a -> Map k a
- RIO.Map: unionWithKey :: Ord k => (k -> a -> a -> a) -> Map k a -> Map k a -> Map k a
+ RIO.Map: unionWithKey :: Ord k => k -> a -> a -> a -> Map k a -> Map k a -> Map k a
- RIO.Map: unionsWith :: Ord k => (a -> a -> a) -> [Map k a] -> Map k a
+ RIO.Map: unionsWith :: Ord k => a -> a -> a -> [Map k a] -> Map k a
- RIO.Map: update :: Ord k => (a -> Maybe a) -> k -> Map k a -> Map k a
+ RIO.Map: update :: Ord k => a -> Maybe a -> k -> Map k a -> Map k a
- RIO.Map: updateLookupWithKey :: Ord k => (k -> a -> Maybe a) -> k -> Map k a -> (Maybe a, Map k a)
+ RIO.Map: updateLookupWithKey :: Ord k => k -> a -> Maybe a -> k -> Map k a -> (Maybe a, Map k a)
- RIO.Map: updateMax :: () => (a -> Maybe a) -> Map k a -> Map k a
+ RIO.Map: updateMax :: () => a -> Maybe a -> Map k a -> Map k a
- RIO.Map: updateMaxWithKey :: () => (k -> a -> Maybe a) -> Map k a -> Map k a
+ RIO.Map: updateMaxWithKey :: () => k -> a -> Maybe a -> Map k a -> Map k a
- RIO.Map: updateMin :: () => (a -> Maybe a) -> Map k a -> Map k a
+ RIO.Map: updateMin :: () => a -> Maybe a -> Map k a -> Map k a
- RIO.Map: updateMinWithKey :: () => (k -> a -> Maybe a) -> Map k a -> Map k a
+ RIO.Map: updateMinWithKey :: () => k -> a -> Maybe a -> Map k a -> Map k a
- RIO.Map: updateWithKey :: Ord k => (k -> a -> Maybe a) -> k -> Map k a -> Map k a
+ RIO.Map: updateWithKey :: Ord k => k -> a -> Maybe a -> k -> Map k a -> Map k a
- RIO.Map.Partial: updateAt :: () => (k -> a -> Maybe a) -> Int -> Map k a -> Map k a
+ RIO.Map.Partial: updateAt :: () => k -> a -> Maybe a -> Int -> Map k a -> Map k a
- RIO.Map.Unchecked: fromAscListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> Map k a
+ RIO.Map.Unchecked: fromAscListWith :: Eq k => a -> a -> a -> [(k, a)] -> Map k a
- RIO.Map.Unchecked: fromAscListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> Map k a
+ RIO.Map.Unchecked: fromAscListWithKey :: Eq k => k -> a -> a -> a -> [(k, a)] -> Map k a
- RIO.Map.Unchecked: fromDescListWith :: Eq k => (a -> a -> a) -> [(k, a)] -> Map k a
+ RIO.Map.Unchecked: fromDescListWith :: Eq k => a -> a -> a -> [(k, a)] -> Map k a
- RIO.Map.Unchecked: fromDescListWithKey :: Eq k => (k -> a -> a -> a) -> [(k, a)] -> Map k a
+ RIO.Map.Unchecked: fromDescListWithKey :: Eq k => k -> a -> a -> a -> [(k, a)] -> Map k a
- RIO.Map.Unchecked: mapKeysMonotonic :: () => (k1 -> k2) -> Map k1 a -> Map k2 a
+ RIO.Map.Unchecked: mapKeysMonotonic :: () => k1 -> k2 -> Map k1 a -> Map k2 a
- RIO.Process: data ByteStringOutputException :: *
+ RIO.Process: data ByteStringOutputException
- RIO.Process: data ExitCodeException :: *
+ RIO.Process: data ExitCodeException
- RIO.Process: data Process stdin stdout stderr :: * -> * -> * -> *
+ RIO.Process: data Process stdin stdout stderr
- RIO.Process: data ProcessConfig stdin stdout stderr :: * -> * -> * -> *
+ RIO.Process: data ProcessConfig stdin stdout stderr
- RIO.Process: data StreamSpec (streamType :: StreamType) a :: StreamType -> * -> *
+ RIO.Process: data StreamSpec (streamType :: StreamType) a
- RIO.Process: data StreamType :: *
+ RIO.Process: data StreamType
- RIO.Process: mkStreamSpec :: () => StdStream -> (ProcessConfig () () () -> Maybe Handle -> IO (a, IO ())) -> StreamSpec streamType a
+ RIO.Process: mkStreamSpec :: () => StdStream -> ProcessConfig () () () -> Maybe Handle -> IO (a, IO ()) -> StreamSpec streamType a
- RIO.Seq: adjust :: () => (a -> a) -> Int -> Seq a -> Seq a
+ RIO.Seq: adjust :: () => a -> a -> Int -> Seq a -> Seq a
- RIO.Seq: adjust' :: () => (a -> a) -> Int -> Seq a -> Seq a
+ RIO.Seq: adjust' :: () => a -> a -> Int -> Seq a -> Seq a
- RIO.Seq: breakl :: () => (a -> Bool) -> Seq a -> (Seq a, Seq a)
+ RIO.Seq: breakl :: () => a -> Bool -> Seq a -> (Seq a, Seq a)
- RIO.Seq: breakr :: () => (a -> Bool) -> Seq a -> (Seq a, Seq a)
+ RIO.Seq: breakr :: () => a -> Bool -> Seq a -> (Seq a, Seq a)
- RIO.Seq: data Seq a :: * -> *
+ RIO.Seq: data Seq a
- RIO.Seq: data ViewL a :: * -> *
+ RIO.Seq: data ViewL a
- RIO.Seq: data ViewR a :: * -> *
+ RIO.Seq: data ViewR a
- RIO.Seq: dropWhileL :: () => (a -> Bool) -> Seq a -> Seq a
+ RIO.Seq: dropWhileL :: () => a -> Bool -> Seq a -> Seq a
- RIO.Seq: dropWhileR :: () => (a -> Bool) -> Seq a -> Seq a
+ RIO.Seq: dropWhileR :: () => a -> Bool -> Seq a -> Seq a
- RIO.Seq: filter :: () => (a -> Bool) -> Seq a -> Seq a
+ RIO.Seq: filter :: () => a -> Bool -> Seq a -> Seq a
- RIO.Seq: findIndexL :: () => (a -> Bool) -> Seq a -> Maybe Int
+ RIO.Seq: findIndexL :: () => a -> Bool -> Seq a -> Maybe Int
- RIO.Seq: findIndexR :: () => (a -> Bool) -> Seq a -> Maybe Int
+ RIO.Seq: findIndexR :: () => a -> Bool -> Seq a -> Maybe Int
- RIO.Seq: findIndicesL :: () => (a -> Bool) -> Seq a -> [Int]
+ RIO.Seq: findIndicesL :: () => a -> Bool -> Seq a -> [Int]
- RIO.Seq: findIndicesR :: () => (a -> Bool) -> Seq a -> [Int]
+ RIO.Seq: findIndicesR :: () => a -> Bool -> Seq a -> [Int]
- RIO.Seq: foldMapWithIndex :: Monoid m => (Int -> a -> m) -> Seq a -> m
+ RIO.Seq: foldMapWithIndex :: Monoid m => Int -> a -> m -> Seq a -> m
- RIO.Seq: foldlWithIndex :: () => (b -> Int -> a -> b) -> b -> Seq a -> b
+ RIO.Seq: foldlWithIndex :: () => b -> Int -> a -> b -> b -> Seq a -> b
- RIO.Seq: foldrWithIndex :: () => (Int -> a -> b -> b) -> b -> Seq a -> b
+ RIO.Seq: foldrWithIndex :: () => Int -> a -> b -> b -> b -> Seq a -> b
- RIO.Seq: fromFunction :: () => Int -> (Int -> a) -> Seq a
+ RIO.Seq: fromFunction :: () => Int -> Int -> a -> Seq a
- RIO.Seq: iterateN :: () => Int -> (a -> a) -> a -> Seq a
+ RIO.Seq: iterateN :: () => Int -> a -> a -> a -> Seq a
- RIO.Seq: mapWithIndex :: () => (Int -> a -> b) -> Seq a -> Seq b
+ RIO.Seq: mapWithIndex :: () => Int -> a -> b -> Seq a -> Seq b
- RIO.Seq: partition :: () => (a -> Bool) -> Seq a -> (Seq a, Seq a)
+ RIO.Seq: partition :: () => a -> Bool -> Seq a -> (Seq a, Seq a)
- RIO.Seq: replicateM :: Monad m => Int -> m a -> m Seq a
+ RIO.Seq: replicateM :: Applicative m => Int -> m a -> m Seq a
- RIO.Seq: scanl :: () => (a -> b -> a) -> a -> Seq b -> Seq a
+ RIO.Seq: scanl :: () => a -> b -> a -> a -> Seq b -> Seq a
- RIO.Seq: scanl1 :: () => (a -> a -> a) -> Seq a -> Seq a
+ RIO.Seq: scanl1 :: () => a -> a -> a -> Seq a -> Seq a
- RIO.Seq: scanr :: () => (a -> b -> b) -> b -> Seq a -> Seq b
+ RIO.Seq: scanr :: () => a -> b -> b -> b -> Seq a -> Seq b
- RIO.Seq: scanr1 :: () => (a -> a -> a) -> Seq a -> Seq a
+ RIO.Seq: scanr1 :: () => a -> a -> a -> Seq a -> Seq a
- RIO.Seq: sortBy :: () => (a -> a -> Ordering) -> Seq a -> Seq a
+ RIO.Seq: sortBy :: () => a -> a -> Ordering -> Seq a -> Seq a
- RIO.Seq: spanl :: () => (a -> Bool) -> Seq a -> (Seq a, Seq a)
+ RIO.Seq: spanl :: () => a -> Bool -> Seq a -> (Seq a, Seq a)
- RIO.Seq: spanr :: () => (a -> Bool) -> Seq a -> (Seq a, Seq a)
+ RIO.Seq: spanr :: () => a -> Bool -> Seq a -> (Seq a, Seq a)
- RIO.Seq: takeWhileL :: () => (a -> Bool) -> Seq a -> Seq a
+ RIO.Seq: takeWhileL :: () => a -> Bool -> Seq a -> Seq a
- RIO.Seq: takeWhileR :: () => (a -> Bool) -> Seq a -> Seq a
+ RIO.Seq: takeWhileR :: () => a -> Bool -> Seq a -> Seq a
- RIO.Seq: traverseWithIndex :: Applicative f => (Int -> a -> f b) -> Seq a -> f Seq b
+ RIO.Seq: traverseWithIndex :: Applicative f => Int -> a -> f b -> Seq a -> f Seq b
- RIO.Seq: unfoldl :: () => (b -> Maybe (b, a)) -> b -> Seq a
+ RIO.Seq: unfoldl :: () => b -> Maybe (b, a) -> b -> Seq a
- RIO.Seq: unfoldr :: () => (b -> Maybe (a, b)) -> b -> Seq a
+ RIO.Seq: unfoldr :: () => b -> Maybe (a, b) -> b -> Seq a
- RIO.Seq: unstableSortBy :: () => (a -> a -> Ordering) -> Seq a -> Seq a
+ RIO.Seq: unstableSortBy :: () => a -> a -> Ordering -> Seq a -> Seq a
- RIO.Seq: zipWith :: () => (a -> b -> c) -> Seq a -> Seq b -> Seq c
+ RIO.Seq: zipWith :: () => a -> b -> c -> Seq a -> Seq b -> Seq c
- RIO.Seq: zipWith3 :: () => (a -> b -> c -> d) -> Seq a -> Seq b -> Seq c -> Seq d
+ RIO.Seq: zipWith3 :: () => a -> b -> c -> d -> Seq a -> Seq b -> Seq c -> Seq d
- RIO.Seq: zipWith4 :: () => (a -> b -> c -> d -> e) -> Seq a -> Seq b -> Seq c -> Seq d -> Seq e
+ RIO.Seq: zipWith4 :: () => a -> b -> c -> d -> e -> Seq a -> Seq b -> Seq c -> Seq d -> Seq e
- RIO.Set: data Set a :: * -> *
+ RIO.Set: data Set a
- RIO.Set: dropWhileAntitone :: () => (a -> Bool) -> Set a -> Set a
+ RIO.Set: dropWhileAntitone :: () => a -> Bool -> Set a -> Set a
- RIO.Set: filter :: () => (a -> Bool) -> Set a -> Set a
+ RIO.Set: filter :: () => a -> Bool -> Set a -> Set a
- RIO.Set: foldl :: () => (a -> b -> a) -> a -> Set b -> a
+ RIO.Set: foldl :: () => a -> b -> a -> a -> Set b -> a
- RIO.Set: foldl' :: () => (a -> b -> a) -> a -> Set b -> a
+ RIO.Set: foldl' :: () => a -> b -> a -> a -> Set b -> a
- RIO.Set: foldr :: () => (a -> b -> b) -> b -> Set a -> b
+ RIO.Set: foldr :: () => a -> b -> b -> b -> Set a -> b
- RIO.Set: foldr' :: () => (a -> b -> b) -> b -> Set a -> b
+ RIO.Set: foldr' :: () => a -> b -> b -> b -> Set a -> b
- RIO.Set: map :: Ord b => (a -> b) -> Set a -> Set b
+ RIO.Set: map :: Ord b => a -> b -> Set a -> Set b
- RIO.Set: partition :: () => (a -> Bool) -> Set a -> (Set a, Set a)
+ RIO.Set: partition :: () => a -> Bool -> Set a -> (Set a, Set a)
- RIO.Set: spanAntitone :: () => (a -> Bool) -> Set a -> (Set a, Set a)
+ RIO.Set: spanAntitone :: () => a -> Bool -> Set a -> (Set a, Set a)
- RIO.Set: takeWhileAntitone :: () => (a -> Bool) -> Set a -> Set a
+ RIO.Set: takeWhileAntitone :: () => a -> Bool -> Set a -> Set a
- RIO.Set.Unchecked: mapMonotonic :: () => (a -> b) -> Set a -> Set b
+ RIO.Set.Unchecked: mapMonotonic :: () => a -> b -> Set a -> Set b
- RIO.Text: all :: (Char -> Bool) -> Text -> Bool
+ RIO.Text: all :: Char -> Bool -> Text -> Bool
- RIO.Text: any :: (Char -> Bool) -> Text -> Bool
+ RIO.Text: any :: Char -> Bool -> Text -> Bool
- RIO.Text: break :: (Char -> Bool) -> Text -> (Text, Text)
+ RIO.Text: break :: Char -> Bool -> Text -> (Text, Text)
- RIO.Text: concatMap :: (Char -> Text) -> Text -> Text
+ RIO.Text: concatMap :: Char -> Text -> Text -> Text
- RIO.Text: data Text :: *
+ RIO.Text: data Text
- RIO.Text: dropAround :: (Char -> Bool) -> Text -> Text
+ RIO.Text: dropAround :: Char -> Bool -> Text -> Text
- RIO.Text: dropWhile :: (Char -> Bool) -> Text -> Text
+ RIO.Text: dropWhile :: Char -> Bool -> Text -> Text
- RIO.Text: dropWhileEnd :: (Char -> Bool) -> Text -> Text
+ RIO.Text: dropWhileEnd :: Char -> Bool -> Text -> Text
- RIO.Text: filter :: (Char -> Bool) -> Text -> Text
+ RIO.Text: filter :: Char -> Bool -> Text -> Text
- RIO.Text: find :: (Char -> Bool) -> Text -> Maybe Char
+ RIO.Text: find :: Char -> Bool -> Text -> Maybe Char
- RIO.Text: findIndex :: (Char -> Bool) -> Text -> Maybe Int
+ RIO.Text: findIndex :: Char -> Bool -> Text -> Maybe Int
- RIO.Text: foldl :: () => (a -> Char -> a) -> a -> Text -> a
+ RIO.Text: foldl :: () => a -> Char -> a -> a -> Text -> a
- RIO.Text: foldl' :: () => (a -> Char -> a) -> a -> Text -> a
+ RIO.Text: foldl' :: () => a -> Char -> a -> a -> Text -> a
- RIO.Text: foldr :: () => (Char -> a -> a) -> a -> Text -> a
+ RIO.Text: foldr :: () => Char -> a -> a -> a -> Text -> a
- RIO.Text: groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
+ RIO.Text: groupBy :: Char -> Char -> Bool -> Text -> [Text]
- RIO.Text: map :: (Char -> Char) -> Text -> Text
+ RIO.Text: map :: Char -> Char -> Text -> Text
- RIO.Text: mapAccumL :: () => (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)
+ RIO.Text: mapAccumL :: () => a -> Char -> (a, Char) -> a -> Text -> (a, Text)
- RIO.Text: mapAccumR :: () => (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)
+ RIO.Text: mapAccumR :: () => a -> Char -> (a, Char) -> a -> Text -> (a, Text)
- RIO.Text: partition :: (Char -> Bool) -> Text -> (Text, Text)
+ RIO.Text: partition :: Char -> Bool -> Text -> (Text, Text)
- RIO.Text: scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
+ RIO.Text: scanl :: Char -> Char -> Char -> Char -> Text -> Text
- RIO.Text: scanl1 :: (Char -> Char -> Char) -> Text -> Text
+ RIO.Text: scanl1 :: Char -> Char -> Char -> Text -> Text
- RIO.Text: scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
+ RIO.Text: scanr :: Char -> Char -> Char -> Char -> Text -> Text
- RIO.Text: scanr1 :: (Char -> Char -> Char) -> Text -> Text
+ RIO.Text: scanr1 :: Char -> Char -> Char -> Text -> Text
- RIO.Text: span :: (Char -> Bool) -> Text -> (Text, Text)
+ RIO.Text: span :: Char -> Bool -> Text -> (Text, Text)
- RIO.Text: split :: (Char -> Bool) -> Text -> [Text]
+ RIO.Text: split :: Char -> Bool -> Text -> [Text]
- RIO.Text: takeWhile :: (Char -> Bool) -> Text -> Text
+ RIO.Text: takeWhile :: Char -> Bool -> Text -> Text
- RIO.Text: takeWhileEnd :: (Char -> Bool) -> Text -> Text
+ RIO.Text: takeWhileEnd :: Char -> Bool -> Text -> Text
- RIO.Text: unfoldr :: () => (a -> Maybe (Char, a)) -> a -> Text
+ RIO.Text: unfoldr :: () => a -> Maybe (Char, a) -> a -> Text
- RIO.Text: unfoldrN :: () => Int -> (a -> Maybe (Char, a)) -> a -> Text
+ RIO.Text: unfoldrN :: () => Int -> a -> Maybe (Char, a) -> a -> Text
- RIO.Text: zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
+ RIO.Text: zipWith :: Char -> Char -> Char -> Text -> Text -> Text
- RIO.Text.Lazy: all :: (Char -> Bool) -> Text -> Bool
+ RIO.Text.Lazy: all :: Char -> Bool -> Text -> Bool
- RIO.Text.Lazy: any :: (Char -> Bool) -> Text -> Bool
+ RIO.Text.Lazy: any :: Char -> Bool -> Text -> Bool
- RIO.Text.Lazy: break :: (Char -> Bool) -> Text -> (Text, Text)
+ RIO.Text.Lazy: break :: Char -> Bool -> Text -> (Text, Text)
- RIO.Text.Lazy: concatMap :: (Char -> Text) -> Text -> Text
+ RIO.Text.Lazy: concatMap :: Char -> Text -> Text -> Text
- RIO.Text.Lazy: data Text :: *
+ RIO.Text.Lazy: data Text
- RIO.Text.Lazy: dropAround :: (Char -> Bool) -> Text -> Text
+ RIO.Text.Lazy: dropAround :: Char -> Bool -> Text -> Text
- RIO.Text.Lazy: dropWhile :: (Char -> Bool) -> Text -> Text
+ RIO.Text.Lazy: dropWhile :: Char -> Bool -> Text -> Text
- RIO.Text.Lazy: dropWhileEnd :: (Char -> Bool) -> Text -> Text
+ RIO.Text.Lazy: dropWhileEnd :: Char -> Bool -> Text -> Text
- RIO.Text.Lazy: filter :: (Char -> Bool) -> Text -> Text
+ RIO.Text.Lazy: filter :: Char -> Bool -> Text -> Text
- RIO.Text.Lazy: find :: (Char -> Bool) -> Text -> Maybe Char
+ RIO.Text.Lazy: find :: Char -> Bool -> Text -> Maybe Char
- RIO.Text.Lazy: foldl :: () => (a -> Char -> a) -> a -> Text -> a
+ RIO.Text.Lazy: foldl :: () => a -> Char -> a -> a -> Text -> a
- RIO.Text.Lazy: foldl' :: () => (a -> Char -> a) -> a -> Text -> a
+ RIO.Text.Lazy: foldl' :: () => a -> Char -> a -> a -> Text -> a
- RIO.Text.Lazy: foldlChunks :: () => (a -> Text -> a) -> a -> Text -> a
+ RIO.Text.Lazy: foldlChunks :: () => a -> Text -> a -> a -> Text -> a
- RIO.Text.Lazy: foldr :: () => (Char -> a -> a) -> a -> Text -> a
+ RIO.Text.Lazy: foldr :: () => Char -> a -> a -> a -> Text -> a
- RIO.Text.Lazy: foldrChunks :: () => (Text -> a -> a) -> a -> Text -> a
+ RIO.Text.Lazy: foldrChunks :: () => Text -> a -> a -> a -> Text -> a
- RIO.Text.Lazy: groupBy :: (Char -> Char -> Bool) -> Text -> [Text]
+ RIO.Text.Lazy: groupBy :: Char -> Char -> Bool -> Text -> [Text]
- RIO.Text.Lazy: iterate :: (Char -> Char) -> Char -> Text
+ RIO.Text.Lazy: iterate :: Char -> Char -> Char -> Text
- RIO.Text.Lazy: map :: (Char -> Char) -> Text -> Text
+ RIO.Text.Lazy: map :: Char -> Char -> Text -> Text
- RIO.Text.Lazy: mapAccumL :: () => (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)
+ RIO.Text.Lazy: mapAccumL :: () => a -> Char -> (a, Char) -> a -> Text -> (a, Text)
- RIO.Text.Lazy: mapAccumR :: () => (a -> Char -> (a, Char)) -> a -> Text -> (a, Text)
+ RIO.Text.Lazy: mapAccumR :: () => a -> Char -> (a, Char) -> a -> Text -> (a, Text)
- RIO.Text.Lazy: partition :: (Char -> Bool) -> Text -> (Text, Text)
+ RIO.Text.Lazy: partition :: Char -> Bool -> Text -> (Text, Text)
- RIO.Text.Lazy: scanl :: (Char -> Char -> Char) -> Char -> Text -> Text
+ RIO.Text.Lazy: scanl :: Char -> Char -> Char -> Char -> Text -> Text
- RIO.Text.Lazy: scanl1 :: (Char -> Char -> Char) -> Text -> Text
+ RIO.Text.Lazy: scanl1 :: Char -> Char -> Char -> Text -> Text
- RIO.Text.Lazy: scanr :: (Char -> Char -> Char) -> Char -> Text -> Text
+ RIO.Text.Lazy: scanr :: Char -> Char -> Char -> Char -> Text -> Text
- RIO.Text.Lazy: scanr1 :: (Char -> Char -> Char) -> Text -> Text
+ RIO.Text.Lazy: scanr1 :: Char -> Char -> Char -> Text -> Text
- RIO.Text.Lazy: span :: (Char -> Bool) -> Text -> (Text, Text)
+ RIO.Text.Lazy: span :: Char -> Bool -> Text -> (Text, Text)
- RIO.Text.Lazy: split :: (Char -> Bool) -> Text -> [Text]
+ RIO.Text.Lazy: split :: Char -> Bool -> Text -> [Text]
- RIO.Text.Lazy: takeWhile :: (Char -> Bool) -> Text -> Text
+ RIO.Text.Lazy: takeWhile :: Char -> Bool -> Text -> Text
- RIO.Text.Lazy: takeWhileEnd :: (Char -> Bool) -> Text -> Text
+ RIO.Text.Lazy: takeWhileEnd :: Char -> Bool -> Text -> Text
- RIO.Text.Lazy: unfoldr :: () => (a -> Maybe (Char, a)) -> a -> Text
+ RIO.Text.Lazy: unfoldr :: () => a -> Maybe (Char, a) -> a -> Text
- RIO.Text.Lazy: unfoldrN :: () => Int64 -> (a -> Maybe (Char, a)) -> a -> Text
+ RIO.Text.Lazy: unfoldrN :: () => Int64 -> a -> Maybe (Char, a) -> a -> Text
- RIO.Text.Lazy: zipWith :: (Char -> Char -> Char) -> Text -> Text -> Text
+ RIO.Text.Lazy: zipWith :: Char -> Char -> Char -> Text -> Text -> Text
- RIO.Text.Lazy.Partial: foldl1 :: (Char -> Char -> Char) -> Text -> Char
+ RIO.Text.Lazy.Partial: foldl1 :: Char -> Char -> Char -> Text -> Char
- RIO.Text.Lazy.Partial: foldl1' :: (Char -> Char -> Char) -> Text -> Char
+ RIO.Text.Lazy.Partial: foldl1' :: Char -> Char -> Char -> Text -> Char
- RIO.Text.Lazy.Partial: foldr1 :: (Char -> Char -> Char) -> Text -> Char
+ RIO.Text.Lazy.Partial: foldr1 :: Char -> Char -> Char -> Text -> Char
- RIO.Text.Partial: foldl1 :: (Char -> Char -> Char) -> Text -> Char
+ RIO.Text.Partial: foldl1 :: Char -> Char -> Char -> Text -> Char
- RIO.Text.Partial: foldl1' :: (Char -> Char -> Char) -> Text -> Char
+ RIO.Text.Partial: foldl1' :: Char -> Char -> Char -> Text -> Char
- RIO.Text.Partial: foldr1 :: (Char -> Char -> Char) -> Text -> Char
+ RIO.Text.Partial: foldr1 :: Char -> Char -> Char -> Text -> Char
- RIO.Vector: all :: Vector v a => (a -> Bool) -> v a -> Bool
+ RIO.Vector: all :: Vector v a => a -> Bool -> v a -> Bool
- RIO.Vector: any :: Vector v a => (a -> Bool) -> v a -> Bool
+ RIO.Vector: any :: Vector v a => a -> Bool -> v a -> Bool
- RIO.Vector: break :: Vector v a => (a -> Bool) -> v a -> (v a, v a)
+ RIO.Vector: break :: Vector v a => a -> Bool -> v a -> (v a, v a)
- RIO.Vector: cmpBy :: (Vector v a, Vector v b) => (a -> b -> Ordering) -> v a -> v b -> Ordering
+ RIO.Vector: cmpBy :: (Vector v a, Vector v b) => a -> b -> Ordering -> v a -> v b -> Ordering
- RIO.Vector: concatMap :: (Vector v a, Vector v b) => (a -> v b) -> v a -> v b
+ RIO.Vector: concatMap :: (Vector v a, Vector v b) => a -> v b -> v a -> v b
- RIO.Vector: constructN :: Vector v a => Int -> (v a -> a) -> v a
+ RIO.Vector: constructN :: Vector v a => Int -> v a -> a -> v a
- RIO.Vector: constructrN :: Vector v a => Int -> (v a -> a) -> v a
+ RIO.Vector: constructrN :: Vector v a => Int -> v a -> a -> v a
- RIO.Vector: create :: Vector v a => (forall s. () => ST s Mutable v s a) -> v a
+ RIO.Vector: create :: Vector v a => forall s. () => ST s Mutable v s a -> v a
- RIO.Vector: createT :: (Traversable f, Vector v a) => (forall s. () => ST s f Mutable v s a) -> f v a
+ RIO.Vector: createT :: (Traversable f, Vector v a) => forall s. () => ST s f Mutable v s a -> f v a
- RIO.Vector: dataCast :: (Vector v a, Data a, Typeable (* -> *) v, Typeable (* -> *) t) => (forall d. Data d => c t d) -> Maybe c v a
+ RIO.Vector: dataCast :: (Vector v a, Data a, Typeable v, Typeable t) => forall d. Data d => c t d -> Maybe c v a
- RIO.Vector: dropWhile :: Vector v a => (a -> Bool) -> v a -> v a
+ RIO.Vector: dropWhile :: Vector v a => a -> Bool -> v a -> v a
- RIO.Vector: eqBy :: (Vector v a, Vector v b) => (a -> b -> Bool) -> v a -> v b -> Bool
+ RIO.Vector: eqBy :: (Vector v a, Vector v b) => a -> b -> Bool -> v a -> v b -> Bool
- RIO.Vector: filter :: Vector v a => (a -> Bool) -> v a -> v a
+ RIO.Vector: filter :: Vector v a => a -> Bool -> v a -> v a
- RIO.Vector: filterM :: (Monad m, Vector v a) => (a -> m Bool) -> v a -> m v a
+ RIO.Vector: filterM :: (Monad m, Vector v a) => a -> m Bool -> v a -> m v a
- RIO.Vector: find :: Vector v a => (a -> Bool) -> v a -> Maybe a
+ RIO.Vector: find :: Vector v a => a -> Bool -> v a -> Maybe a
- RIO.Vector: findIndex :: Vector v a => (a -> Bool) -> v a -> Maybe Int
+ RIO.Vector: findIndex :: Vector v a => a -> Bool -> v a -> Maybe Int
- RIO.Vector: findIndices :: (Vector v a, Vector v Int) => (a -> Bool) -> v a -> v Int
+ RIO.Vector: findIndices :: (Vector v a, Vector v Int) => a -> Bool -> v a -> v Int
- RIO.Vector: foldM :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m a
+ RIO.Vector: foldM :: (Monad m, Vector v b) => a -> b -> m a -> a -> v b -> m a
- RIO.Vector: foldM' :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m a
+ RIO.Vector: foldM' :: (Monad m, Vector v b) => a -> b -> m a -> a -> v b -> m a
- RIO.Vector: foldM'_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m ()
+ RIO.Vector: foldM'_ :: (Monad m, Vector v b) => a -> b -> m a -> a -> v b -> m ()
- RIO.Vector: foldM_ :: (Monad m, Vector v b) => (a -> b -> m a) -> a -> v b -> m ()
+ RIO.Vector: foldM_ :: (Monad m, Vector v b) => a -> b -> m a -> a -> v b -> m ()
- RIO.Vector: foldl :: Vector v b => (a -> b -> a) -> a -> v b -> a
+ RIO.Vector: foldl :: Vector v b => a -> b -> a -> a -> v b -> a
- RIO.Vector: foldl' :: Vector v b => (a -> b -> a) -> a -> v b -> a
+ RIO.Vector: foldl' :: Vector v b => a -> b -> a -> a -> v b -> a
- RIO.Vector: foldr :: Vector v a => (a -> b -> b) -> b -> v a -> b
+ RIO.Vector: foldr :: Vector v a => a -> b -> b -> b -> v a -> b
- RIO.Vector: foldr' :: Vector v a => (a -> b -> b) -> b -> v a -> b
+ RIO.Vector: foldr' :: Vector v a => a -> b -> b -> b -> v a -> b
- RIO.Vector: forM :: (Monad m, Vector v a, Vector v b) => v a -> (a -> m b) -> m v b
+ RIO.Vector: forM :: (Monad m, Vector v a, Vector v b) => v a -> a -> m b -> m v b
- RIO.Vector: forM_ :: (Monad m, Vector v a) => v a -> (a -> m b) -> m ()
+ RIO.Vector: forM_ :: (Monad m, Vector v a) => v a -> a -> m b -> m ()
- RIO.Vector: generate :: Vector v a => Int -> (Int -> a) -> v a
+ RIO.Vector: generate :: Vector v a => Int -> Int -> a -> v a
- RIO.Vector: generateM :: (Monad m, Vector v a) => Int -> (Int -> m a) -> m v a
+ RIO.Vector: generateM :: (Monad m, Vector v a) => Int -> Int -> m a -> m v a
- RIO.Vector: gfoldl :: (Vector v a, Data a) => (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. () => g -> c g) -> v a -> c v a
+ RIO.Vector: gfoldl :: (Vector v a, Data a) => forall d b. Data d => c d -> b -> d -> c b -> forall g. () => g -> c g -> v a -> c v a
- RIO.Vector: ifilter :: Vector v a => (Int -> a -> Bool) -> v a -> v a
+ RIO.Vector: ifilter :: Vector v a => Int -> a -> Bool -> v a -> v a
- RIO.Vector: ifoldM :: (Monad m, Vector v b) => (a -> Int -> b -> m a) -> a -> v b -> m a
+ RIO.Vector: ifoldM :: (Monad m, Vector v b) => a -> Int -> b -> m a -> a -> v b -> m a
- RIO.Vector: ifoldM' :: (Monad m, Vector v b) => (a -> Int -> b -> m a) -> a -> v b -> m a
+ RIO.Vector: ifoldM' :: (Monad m, Vector v b) => a -> Int -> b -> m a -> a -> v b -> m a
- RIO.Vector: ifoldM'_ :: (Monad m, Vector v b) => (a -> Int -> b -> m a) -> a -> v b -> m ()
+ RIO.Vector: ifoldM'_ :: (Monad m, Vector v b) => a -> Int -> b -> m a -> a -> v b -> m ()
- RIO.Vector: ifoldM_ :: (Monad m, Vector v b) => (a -> Int -> b -> m a) -> a -> v b -> m ()
+ RIO.Vector: ifoldM_ :: (Monad m, Vector v b) => a -> Int -> b -> m a -> a -> v b -> m ()
- RIO.Vector: ifoldl :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a
+ RIO.Vector: ifoldl :: Vector v b => a -> Int -> b -> a -> a -> v b -> a
- RIO.Vector: ifoldl' :: Vector v b => (a -> Int -> b -> a) -> a -> v b -> a
+ RIO.Vector: ifoldl' :: Vector v b => a -> Int -> b -> a -> a -> v b -> a
- RIO.Vector: ifoldr :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b
+ RIO.Vector: ifoldr :: Vector v a => Int -> a -> b -> b -> b -> v a -> b
- RIO.Vector: ifoldr' :: Vector v a => (Int -> a -> b -> b) -> b -> v a -> b
+ RIO.Vector: ifoldr' :: Vector v a => Int -> a -> b -> b -> b -> v a -> b
- RIO.Vector: imap :: (Vector v a, Vector v b) => (Int -> a -> b) -> v a -> v b
+ RIO.Vector: imap :: (Vector v a, Vector v b) => Int -> a -> b -> v a -> v b
- RIO.Vector: imapM :: (Monad m, Vector v a, Vector v b) => (Int -> a -> m b) -> v a -> m v b
+ RIO.Vector: imapM :: (Monad m, Vector v a, Vector v b) => Int -> a -> m b -> v a -> m v b
- RIO.Vector: imapM_ :: (Monad m, Vector v a) => (Int -> a -> m b) -> v a -> m ()
+ RIO.Vector: imapM_ :: (Monad m, Vector v a) => Int -> a -> m b -> v a -> m ()
- RIO.Vector: imapMaybe :: (Vector v a, Vector v b) => (Int -> a -> Maybe b) -> v a -> v b
+ RIO.Vector: imapMaybe :: (Vector v a, Vector v b) => Int -> a -> Maybe b -> v a -> v b
- RIO.Vector: iscanl :: (Vector v a, Vector v b) => (Int -> a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: iscanl :: (Vector v a, Vector v b) => Int -> a -> b -> a -> a -> v b -> v a
- RIO.Vector: iscanl' :: (Vector v a, Vector v b) => (Int -> a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: iscanl' :: (Vector v a, Vector v b) => Int -> a -> b -> a -> a -> v b -> v a
- RIO.Vector: iscanr :: (Vector v a, Vector v b) => (Int -> a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: iscanr :: (Vector v a, Vector v b) => Int -> a -> b -> b -> b -> v a -> v b
- RIO.Vector: iscanr' :: (Vector v a, Vector v b) => (Int -> a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: iscanr' :: (Vector v a, Vector v b) => Int -> a -> b -> b -> b -> v a -> v b
- RIO.Vector: iterateN :: Vector v a => Int -> (a -> a) -> a -> v a
+ RIO.Vector: iterateN :: Vector v a => Int -> a -> a -> a -> v a
- RIO.Vector: iterateNM :: (Monad m, Vector v a) => Int -> (a -> m a) -> a -> m v a
+ RIO.Vector: iterateNM :: (Monad m, Vector v a) => Int -> a -> m a -> a -> m v a
- RIO.Vector: izipWith :: (Vector v a, Vector v b, Vector v c) => (Int -> a -> b -> c) -> v a -> v b -> v c
+ RIO.Vector: izipWith :: (Vector v a, Vector v b, Vector v c) => Int -> a -> b -> c -> v a -> v b -> v c
- RIO.Vector: izipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (Int -> a -> b -> c -> d) -> v a -> v b -> v c -> v d
+ RIO.Vector: izipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => Int -> a -> b -> c -> d -> v a -> v b -> v c -> v d
- RIO.Vector: izipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (Int -> a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e
+ RIO.Vector: izipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => Int -> a -> b -> c -> d -> e -> v a -> v b -> v c -> v d -> v e
- RIO.Vector: izipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (Int -> a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f
+ RIO.Vector: izipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => Int -> a -> b -> c -> d -> e -> f -> v a -> v b -> v c -> v d -> v e -> v f
- RIO.Vector: izipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g
+ RIO.Vector: izipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => Int -> a -> b -> c -> d -> e -> f -> g -> v a -> v b -> v c -> v d -> v e -> v f -> v g
- RIO.Vector: izipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => (Int -> a -> b -> m c) -> v a -> v b -> m v c
+ RIO.Vector: izipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => Int -> a -> b -> m c -> v a -> v b -> m v c
- RIO.Vector: izipWithM_ :: (Monad m, Vector v a, Vector v b) => (Int -> a -> b -> m c) -> v a -> v b -> m ()
+ RIO.Vector: izipWithM_ :: (Monad m, Vector v a, Vector v b) => Int -> a -> b -> m c -> v a -> v b -> m ()
- RIO.Vector: liftReadsPrec :: Vector v a => (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS v a
+ RIO.Vector: liftReadsPrec :: Vector v a => Int -> ReadS a -> ReadS [a] -> Int -> ReadS v a
- RIO.Vector: liftShowsPrec :: Vector v a => (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> v a -> ShowS
+ RIO.Vector: liftShowsPrec :: Vector v a => Int -> a -> ShowS -> [a] -> ShowS -> Int -> v a -> ShowS
- RIO.Vector: map :: (Vector v a, Vector v b) => (a -> b) -> v a -> v b
+ RIO.Vector: map :: (Vector v a, Vector v b) => a -> b -> v a -> v b
- RIO.Vector: mapM :: (Monad m, Vector v a, Vector v b) => (a -> m b) -> v a -> m v b
+ RIO.Vector: mapM :: (Monad m, Vector v a, Vector v b) => a -> m b -> v a -> m v b
- RIO.Vector: mapM_ :: (Monad m, Vector v a) => (a -> m b) -> v a -> m ()
+ RIO.Vector: mapM_ :: (Monad m, Vector v a) => a -> m b -> v a -> m ()
- RIO.Vector: mapMaybe :: (Vector v a, Vector v b) => (a -> Maybe b) -> v a -> v b
+ RIO.Vector: mapMaybe :: (Vector v a, Vector v b) => a -> Maybe b -> v a -> v b
- RIO.Vector: modify :: Vector v a => (forall s. () => Mutable v s a -> ST s ()) -> v a -> v a
+ RIO.Vector: modify :: Vector v a => forall s. () => Mutable v s a -> ST s () -> v a -> v a
- RIO.Vector: partition :: Vector v a => (a -> Bool) -> v a -> (v a, v a)
+ RIO.Vector: partition :: Vector v a => a -> Bool -> v a -> (v a, v a)
- RIO.Vector: postscanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: postscanl :: (Vector v a, Vector v b) => a -> b -> a -> a -> v b -> v a
- RIO.Vector: postscanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: postscanl' :: (Vector v a, Vector v b) => a -> b -> a -> a -> v b -> v a
- RIO.Vector: postscanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: postscanr :: (Vector v a, Vector v b) => a -> b -> b -> b -> v a -> v b
- RIO.Vector: postscanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: postscanr' :: (Vector v a, Vector v b) => a -> b -> b -> b -> v a -> v b
- RIO.Vector: prescanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: prescanl :: (Vector v a, Vector v b) => a -> b -> a -> a -> v b -> v a
- RIO.Vector: prescanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: prescanl' :: (Vector v a, Vector v b) => a -> b -> a -> a -> v b -> v a
- RIO.Vector: prescanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: prescanr :: (Vector v a, Vector v b) => a -> b -> b -> b -> v a -> v b
- RIO.Vector: prescanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: prescanr' :: (Vector v a, Vector v b) => a -> b -> b -> b -> v a -> v b
- RIO.Vector: scanl :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: scanl :: (Vector v a, Vector v b) => a -> b -> a -> a -> v b -> v a
- RIO.Vector: scanl' :: (Vector v a, Vector v b) => (a -> b -> a) -> a -> v b -> v a
+ RIO.Vector: scanl' :: (Vector v a, Vector v b) => a -> b -> a -> a -> v b -> v a
- RIO.Vector: scanr :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: scanr :: (Vector v a, Vector v b) => a -> b -> b -> b -> v a -> v b
- RIO.Vector: scanr' :: (Vector v a, Vector v b) => (a -> b -> b) -> b -> v a -> v b
+ RIO.Vector: scanr' :: (Vector v a, Vector v b) => a -> b -> b -> b -> v a -> v b
- RIO.Vector: span :: Vector v a => (a -> Bool) -> v a -> (v a, v a)
+ RIO.Vector: span :: Vector v a => a -> Bool -> v a -> (v a, v a)
- RIO.Vector: takeWhile :: Vector v a => (a -> Bool) -> v a -> v a
+ RIO.Vector: takeWhile :: Vector v a => a -> Bool -> v a -> v a
- RIO.Vector: unfoldr :: Vector v a => (b -> Maybe (a, b)) -> b -> v a
+ RIO.Vector: unfoldr :: Vector v a => b -> Maybe (a, b) -> b -> v a
- RIO.Vector: unfoldrM :: (Monad m, Vector v a) => (b -> m Maybe (a, b)) -> b -> m v a
+ RIO.Vector: unfoldrM :: (Monad m, Vector v a) => b -> m Maybe (a, b) -> b -> m v a
- RIO.Vector: unfoldrN :: Vector v a => Int -> (b -> Maybe (a, b)) -> b -> v a
+ RIO.Vector: unfoldrN :: Vector v a => Int -> b -> Maybe (a, b) -> b -> v a
- RIO.Vector: unfoldrNM :: (Monad m, Vector v a) => Int -> (b -> m Maybe (a, b)) -> b -> m v a
+ RIO.Vector: unfoldrNM :: (Monad m, Vector v a) => Int -> b -> m Maybe (a, b) -> b -> m v a
- RIO.Vector: unstablePartition :: Vector v a => (a -> Bool) -> v a -> (v a, v a)
+ RIO.Vector: unstablePartition :: Vector v a => a -> Bool -> v a -> (v a, v a)
- RIO.Vector: zipWith :: (Vector v a, Vector v b, Vector v c) => (a -> b -> c) -> v a -> v b -> v c
+ RIO.Vector: zipWith :: (Vector v a, Vector v b, Vector v c) => a -> b -> c -> v a -> v b -> v c
- RIO.Vector: zipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => (a -> b -> c -> d) -> v a -> v b -> v c -> v d
+ RIO.Vector: zipWith3 :: (Vector v a, Vector v b, Vector v c, Vector v d) => a -> b -> c -> d -> v a -> v b -> v c -> v d
- RIO.Vector: zipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => (a -> b -> c -> d -> e) -> v a -> v b -> v c -> v d -> v e
+ RIO.Vector: zipWith4 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e) => a -> b -> c -> d -> e -> v a -> v b -> v c -> v d -> v e
- RIO.Vector: zipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => (a -> b -> c -> d -> e -> f) -> v a -> v b -> v c -> v d -> v e -> v f
+ RIO.Vector: zipWith5 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f) => a -> b -> c -> d -> e -> f -> v a -> v b -> v c -> v d -> v e -> v f
- RIO.Vector: zipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => (a -> b -> c -> d -> e -> f -> g) -> v a -> v b -> v c -> v d -> v e -> v f -> v g
+ RIO.Vector: zipWith6 :: (Vector v a, Vector v b, Vector v c, Vector v d, Vector v e, Vector v f, Vector v g) => a -> b -> c -> d -> e -> f -> g -> v a -> v b -> v c -> v d -> v e -> v f -> v g
- RIO.Vector: zipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => (a -> b -> m c) -> v a -> v b -> m v c
+ RIO.Vector: zipWithM :: (Monad m, Vector v a, Vector v b, Vector v c) => a -> b -> m c -> v a -> v b -> m v c
- RIO.Vector: zipWithM_ :: (Monad m, Vector v a, Vector v b) => (a -> b -> m c) -> v a -> v b -> m ()
+ RIO.Vector: zipWithM_ :: (Monad m, Vector v a, Vector v b) => a -> b -> m c -> v a -> v b -> m ()
- RIO.Vector.Boxed: all :: () => (a -> Bool) -> Vector a -> Bool
+ RIO.Vector.Boxed: all :: () => a -> Bool -> Vector a -> Bool
- RIO.Vector.Boxed: any :: () => (a -> Bool) -> Vector a -> Bool
+ RIO.Vector.Boxed: any :: () => a -> Bool -> Vector a -> Bool
- RIO.Vector.Boxed: break :: () => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Boxed: break :: () => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Boxed: concatMap :: () => (a -> Vector b) -> Vector a -> Vector b
+ RIO.Vector.Boxed: concatMap :: () => a -> Vector b -> Vector a -> Vector b
- RIO.Vector.Boxed: constructN :: () => Int -> (Vector a -> a) -> Vector a
+ RIO.Vector.Boxed: constructN :: () => Int -> Vector a -> a -> Vector a
- RIO.Vector.Boxed: constructrN :: () => Int -> (Vector a -> a) -> Vector a
+ RIO.Vector.Boxed: constructrN :: () => Int -> Vector a -> a -> Vector a
- RIO.Vector.Boxed: create :: () => (forall s. () => ST s MVector s a) -> Vector a
+ RIO.Vector.Boxed: create :: () => forall s. () => ST s MVector s a -> Vector a
- RIO.Vector.Boxed: createT :: Traversable f => (forall s. () => ST s f MVector s a) -> f Vector a
+ RIO.Vector.Boxed: createT :: Traversable f => forall s. () => ST s f MVector s a -> f Vector a
- RIO.Vector.Boxed: data MVector s a :: * -> * -> *
+ RIO.Vector.Boxed: data MVector s a
- RIO.Vector.Boxed: data Vector a :: * -> *
+ RIO.Vector.Boxed: data Vector a
- RIO.Vector.Boxed: dropWhile :: () => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Boxed: dropWhile :: () => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Boxed: filter :: () => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Boxed: filter :: () => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Boxed: filterM :: Monad m => (a -> m Bool) -> Vector a -> m Vector a
+ RIO.Vector.Boxed: filterM :: Monad m => a -> m Bool -> Vector a -> m Vector a
- RIO.Vector.Boxed: find :: () => (a -> Bool) -> Vector a -> Maybe a
+ RIO.Vector.Boxed: find :: () => a -> Bool -> Vector a -> Maybe a
- RIO.Vector.Boxed: findIndex :: () => (a -> Bool) -> Vector a -> Maybe Int
+ RIO.Vector.Boxed: findIndex :: () => a -> Bool -> Vector a -> Maybe Int
- RIO.Vector.Boxed: findIndices :: () => (a -> Bool) -> Vector a -> Vector Int
+ RIO.Vector.Boxed: findIndices :: () => a -> Bool -> Vector a -> Vector Int
- RIO.Vector.Boxed: foldM :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Boxed: foldM :: Monad m => a -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Boxed: foldM' :: Monad m => (a -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Boxed: foldM' :: Monad m => a -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Boxed: foldM'_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Boxed: foldM'_ :: Monad m => a -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Boxed: foldM_ :: Monad m => (a -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Boxed: foldM_ :: Monad m => a -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Boxed: foldl :: () => (a -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Boxed: foldl :: () => a -> b -> a -> a -> Vector b -> a
- RIO.Vector.Boxed: foldl' :: () => (a -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Boxed: foldl' :: () => a -> b -> a -> a -> Vector b -> a
- RIO.Vector.Boxed: foldr :: () => (a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Boxed: foldr :: () => a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Boxed: foldr' :: () => (a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Boxed: foldr' :: () => a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Boxed: forM :: Monad m => Vector a -> (a -> m b) -> m Vector b
+ RIO.Vector.Boxed: forM :: Monad m => Vector a -> a -> m b -> m Vector b
- RIO.Vector.Boxed: forM_ :: Monad m => Vector a -> (a -> m b) -> m ()
+ RIO.Vector.Boxed: forM_ :: Monad m => Vector a -> a -> m b -> m ()
- RIO.Vector.Boxed: generate :: () => Int -> (Int -> a) -> Vector a
+ RIO.Vector.Boxed: generate :: () => Int -> Int -> a -> Vector a
- RIO.Vector.Boxed: generateM :: Monad m => Int -> (Int -> m a) -> m Vector a
+ RIO.Vector.Boxed: generateM :: Monad m => Int -> Int -> m a -> m Vector a
- RIO.Vector.Boxed: ifilter :: () => (Int -> a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Boxed: ifilter :: () => Int -> a -> Bool -> Vector a -> Vector a
- RIO.Vector.Boxed: ifoldM :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Boxed: ifoldM :: Monad m => a -> Int -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Boxed: ifoldM' :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Boxed: ifoldM' :: Monad m => a -> Int -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Boxed: ifoldM'_ :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Boxed: ifoldM'_ :: Monad m => a -> Int -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Boxed: ifoldM_ :: Monad m => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Boxed: ifoldM_ :: Monad m => a -> Int -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Boxed: ifoldl :: () => (a -> Int -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Boxed: ifoldl :: () => a -> Int -> b -> a -> a -> Vector b -> a
- RIO.Vector.Boxed: ifoldl' :: () => (a -> Int -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Boxed: ifoldl' :: () => a -> Int -> b -> a -> a -> Vector b -> a
- RIO.Vector.Boxed: ifoldr :: () => (Int -> a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Boxed: ifoldr :: () => Int -> a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Boxed: ifoldr' :: () => (Int -> a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Boxed: ifoldr' :: () => Int -> a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Boxed: imap :: () => (Int -> a -> b) -> Vector a -> Vector b
+ RIO.Vector.Boxed: imap :: () => Int -> a -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: imapM :: Monad m => (Int -> a -> m b) -> Vector a -> m Vector b
+ RIO.Vector.Boxed: imapM :: Monad m => Int -> a -> m b -> Vector a -> m Vector b
- RIO.Vector.Boxed: imapM_ :: Monad m => (Int -> a -> m b) -> Vector a -> m ()
+ RIO.Vector.Boxed: imapM_ :: Monad m => Int -> a -> m b -> Vector a -> m ()
- RIO.Vector.Boxed: imapMaybe :: () => (Int -> a -> Maybe b) -> Vector a -> Vector b
+ RIO.Vector.Boxed: imapMaybe :: () => Int -> a -> Maybe b -> Vector a -> Vector b
- RIO.Vector.Boxed: iscanl :: () => (Int -> a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: iscanl :: () => Int -> a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: iscanl' :: () => (Int -> a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: iscanl' :: () => Int -> a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: iscanr :: () => (Int -> a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: iscanr :: () => Int -> a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: iscanr' :: () => (Int -> a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: iscanr' :: () => Int -> a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: iterateN :: () => Int -> (a -> a) -> a -> Vector a
+ RIO.Vector.Boxed: iterateN :: () => Int -> a -> a -> a -> Vector a
- RIO.Vector.Boxed: iterateNM :: Monad m => Int -> (a -> m a) -> a -> m Vector a
+ RIO.Vector.Boxed: iterateNM :: Monad m => Int -> a -> m a -> a -> m Vector a
- RIO.Vector.Boxed: izipWith :: () => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
+ RIO.Vector.Boxed: izipWith :: () => Int -> a -> b -> c -> Vector a -> Vector b -> Vector c
- RIO.Vector.Boxed: izipWith3 :: () => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
+ RIO.Vector.Boxed: izipWith3 :: () => Int -> a -> b -> c -> d -> Vector a -> Vector b -> Vector c -> Vector d
- RIO.Vector.Boxed: izipWith4 :: () => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
+ RIO.Vector.Boxed: izipWith4 :: () => Int -> a -> b -> c -> d -> e -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
- RIO.Vector.Boxed: izipWith5 :: () => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
+ RIO.Vector.Boxed: izipWith5 :: () => Int -> a -> b -> c -> d -> e -> f -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
- RIO.Vector.Boxed: izipWith6 :: () => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
+ RIO.Vector.Boxed: izipWith6 :: () => Int -> a -> b -> c -> d -> e -> f -> g -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
- RIO.Vector.Boxed: izipWithM :: Monad m => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m Vector c
+ RIO.Vector.Boxed: izipWithM :: Monad m => Int -> a -> b -> m c -> Vector a -> Vector b -> m Vector c
- RIO.Vector.Boxed: izipWithM_ :: Monad m => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m ()
+ RIO.Vector.Boxed: izipWithM_ :: Monad m => Int -> a -> b -> m c -> Vector a -> Vector b -> m ()
- RIO.Vector.Boxed: map :: () => (a -> b) -> Vector a -> Vector b
+ RIO.Vector.Boxed: map :: () => a -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: mapM :: Monad m => (a -> m b) -> Vector a -> m Vector b
+ RIO.Vector.Boxed: mapM :: Monad m => a -> m b -> Vector a -> m Vector b
- RIO.Vector.Boxed: mapM_ :: Monad m => (a -> m b) -> Vector a -> m ()
+ RIO.Vector.Boxed: mapM_ :: Monad m => a -> m b -> Vector a -> m ()
- RIO.Vector.Boxed: mapMaybe :: () => (a -> Maybe b) -> Vector a -> Vector b
+ RIO.Vector.Boxed: mapMaybe :: () => a -> Maybe b -> Vector a -> Vector b
- RIO.Vector.Boxed: modify :: () => (forall s. () => MVector s a -> ST s ()) -> Vector a -> Vector a
+ RIO.Vector.Boxed: modify :: () => forall s. () => MVector s a -> ST s () -> Vector a -> Vector a
- RIO.Vector.Boxed: partition :: () => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Boxed: partition :: () => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Boxed: postscanl :: () => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: postscanl :: () => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: postscanl' :: () => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: postscanl' :: () => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: postscanr :: () => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: postscanr :: () => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: postscanr' :: () => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: postscanr' :: () => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: prescanl :: () => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: prescanl :: () => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: prescanl' :: () => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: prescanl' :: () => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: prescanr :: () => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: prescanr :: () => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: prescanr' :: () => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: prescanr' :: () => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: scanl :: () => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: scanl :: () => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: scanl' :: () => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Boxed: scanl' :: () => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Boxed: scanr :: () => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: scanr :: () => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: scanr' :: () => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Boxed: scanr' :: () => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Boxed: span :: () => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Boxed: span :: () => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Boxed: takeWhile :: () => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Boxed: takeWhile :: () => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Boxed: unfoldr :: () => (b -> Maybe (a, b)) -> b -> Vector a
+ RIO.Vector.Boxed: unfoldr :: () => b -> Maybe (a, b) -> b -> Vector a
- RIO.Vector.Boxed: unfoldrM :: Monad m => (b -> m Maybe (a, b)) -> b -> m Vector a
+ RIO.Vector.Boxed: unfoldrM :: Monad m => b -> m Maybe (a, b) -> b -> m Vector a
- RIO.Vector.Boxed: unfoldrN :: () => Int -> (b -> Maybe (a, b)) -> b -> Vector a
+ RIO.Vector.Boxed: unfoldrN :: () => Int -> b -> Maybe (a, b) -> b -> Vector a
- RIO.Vector.Boxed: unfoldrNM :: Monad m => Int -> (b -> m Maybe (a, b)) -> b -> m Vector a
+ RIO.Vector.Boxed: unfoldrNM :: Monad m => Int -> b -> m Maybe (a, b) -> b -> m Vector a
- RIO.Vector.Boxed: unstablePartition :: () => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Boxed: unstablePartition :: () => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Boxed: zipWith :: () => (a -> b -> c) -> Vector a -> Vector b -> Vector c
+ RIO.Vector.Boxed: zipWith :: () => a -> b -> c -> Vector a -> Vector b -> Vector c
- RIO.Vector.Boxed: zipWith3 :: () => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
+ RIO.Vector.Boxed: zipWith3 :: () => a -> b -> c -> d -> Vector a -> Vector b -> Vector c -> Vector d
- RIO.Vector.Boxed: zipWith4 :: () => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
+ RIO.Vector.Boxed: zipWith4 :: () => a -> b -> c -> d -> e -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
- RIO.Vector.Boxed: zipWith5 :: () => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
+ RIO.Vector.Boxed: zipWith5 :: () => a -> b -> c -> d -> e -> f -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
- RIO.Vector.Boxed: zipWith6 :: () => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
+ RIO.Vector.Boxed: zipWith6 :: () => a -> b -> c -> d -> e -> f -> g -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
- RIO.Vector.Boxed: zipWithM :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m Vector c
+ RIO.Vector.Boxed: zipWithM :: Monad m => a -> b -> m c -> Vector a -> Vector b -> m Vector c
- RIO.Vector.Boxed: zipWithM_ :: Monad m => (a -> b -> m c) -> Vector a -> Vector b -> m ()
+ RIO.Vector.Boxed: zipWithM_ :: Monad m => a -> b -> m c -> Vector a -> Vector b -> m ()
- RIO.Vector.Boxed.Partial: accum :: () => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
+ RIO.Vector.Boxed.Partial: accum :: () => a -> b -> a -> Vector a -> [(Int, b)] -> Vector a
- RIO.Vector.Boxed.Partial: accumulate :: () => (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
+ RIO.Vector.Boxed.Partial: accumulate :: () => a -> b -> a -> Vector a -> Vector (Int, b) -> Vector a
- RIO.Vector.Boxed.Partial: accumulate_ :: () => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
+ RIO.Vector.Boxed.Partial: accumulate_ :: () => a -> b -> a -> Vector a -> Vector Int -> Vector b -> Vector a
- RIO.Vector.Boxed.Partial: fold1M :: Monad m => (a -> a -> m a) -> Vector a -> m a
+ RIO.Vector.Boxed.Partial: fold1M :: Monad m => a -> a -> m a -> Vector a -> m a
- RIO.Vector.Boxed.Partial: fold1M' :: Monad m => (a -> a -> m a) -> Vector a -> m a
+ RIO.Vector.Boxed.Partial: fold1M' :: Monad m => a -> a -> m a -> Vector a -> m a
- RIO.Vector.Boxed.Partial: fold1M'_ :: Monad m => (a -> a -> m a) -> Vector a -> m ()
+ RIO.Vector.Boxed.Partial: fold1M'_ :: Monad m => a -> a -> m a -> Vector a -> m ()
- RIO.Vector.Boxed.Partial: fold1M_ :: Monad m => (a -> a -> m a) -> Vector a -> m ()
+ RIO.Vector.Boxed.Partial: fold1M_ :: Monad m => a -> a -> m a -> Vector a -> m ()
- RIO.Vector.Boxed.Partial: foldl1 :: () => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Boxed.Partial: foldl1 :: () => a -> a -> a -> Vector a -> a
- RIO.Vector.Boxed.Partial: foldl1' :: () => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Boxed.Partial: foldl1' :: () => a -> a -> a -> Vector a -> a
- RIO.Vector.Boxed.Partial: foldr1 :: () => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Boxed.Partial: foldr1 :: () => a -> a -> a -> Vector a -> a
- RIO.Vector.Boxed.Partial: foldr1' :: () => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Boxed.Partial: foldr1' :: () => a -> a -> a -> Vector a -> a
- RIO.Vector.Boxed.Partial: maxIndexBy :: () => (a -> a -> Ordering) -> Vector a -> Int
+ RIO.Vector.Boxed.Partial: maxIndexBy :: () => a -> a -> Ordering -> Vector a -> Int
- RIO.Vector.Boxed.Partial: maximumBy :: () => (a -> a -> Ordering) -> Vector a -> a
+ RIO.Vector.Boxed.Partial: maximumBy :: () => a -> a -> Ordering -> Vector a -> a
- RIO.Vector.Boxed.Partial: minIndexBy :: () => (a -> a -> Ordering) -> Vector a -> Int
+ RIO.Vector.Boxed.Partial: minIndexBy :: () => a -> a -> Ordering -> Vector a -> Int
- RIO.Vector.Boxed.Partial: minimumBy :: () => (a -> a -> Ordering) -> Vector a -> a
+ RIO.Vector.Boxed.Partial: minimumBy :: () => a -> a -> Ordering -> Vector a -> a
- RIO.Vector.Boxed.Partial: scanl1 :: () => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Boxed.Partial: scanl1 :: () => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Boxed.Partial: scanl1' :: () => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Boxed.Partial: scanl1' :: () => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Boxed.Partial: scanr1 :: () => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Boxed.Partial: scanr1 :: () => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Boxed.Partial: scanr1' :: () => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Boxed.Partial: scanr1' :: () => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Boxed.Unsafe: unsafeAccum :: () => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
+ RIO.Vector.Boxed.Unsafe: unsafeAccum :: () => a -> b -> a -> Vector a -> [(Int, b)] -> Vector a
- RIO.Vector.Boxed.Unsafe: unsafeAccumulate :: () => (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
+ RIO.Vector.Boxed.Unsafe: unsafeAccumulate :: () => a -> b -> a -> Vector a -> Vector (Int, b) -> Vector a
- RIO.Vector.Boxed.Unsafe: unsafeAccumulate_ :: () => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
+ RIO.Vector.Boxed.Unsafe: unsafeAccumulate_ :: () => a -> b -> a -> Vector a -> Vector Int -> Vector b -> Vector a
- RIO.Vector.Partial: accum :: Vector v a => (a -> b -> a) -> v a -> [(Int, b)] -> v a
+ RIO.Vector.Partial: accum :: Vector v a => a -> b -> a -> v a -> [(Int, b)] -> v a
- RIO.Vector.Partial: accumulate :: (Vector v a, Vector v (Int, b)) => (a -> b -> a) -> v a -> v (Int, b) -> v a
+ RIO.Vector.Partial: accumulate :: (Vector v a, Vector v (Int, b)) => a -> b -> a -> v a -> v (Int, b) -> v a
- RIO.Vector.Partial: accumulate_ :: (Vector v a, Vector v Int, Vector v b) => (a -> b -> a) -> v a -> v Int -> v b -> v a
+ RIO.Vector.Partial: accumulate_ :: (Vector v a, Vector v Int, Vector v b) => a -> b -> a -> v a -> v Int -> v b -> v a
- RIO.Vector.Partial: fold1M :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m a
+ RIO.Vector.Partial: fold1M :: (Monad m, Vector v a) => a -> a -> m a -> v a -> m a
- RIO.Vector.Partial: fold1M' :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m a
+ RIO.Vector.Partial: fold1M' :: (Monad m, Vector v a) => a -> a -> m a -> v a -> m a
- RIO.Vector.Partial: fold1M'_ :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m ()
+ RIO.Vector.Partial: fold1M'_ :: (Monad m, Vector v a) => a -> a -> m a -> v a -> m ()
- RIO.Vector.Partial: fold1M_ :: (Monad m, Vector v a) => (a -> a -> m a) -> v a -> m ()
+ RIO.Vector.Partial: fold1M_ :: (Monad m, Vector v a) => a -> a -> m a -> v a -> m ()
- RIO.Vector.Partial: foldl1 :: Vector v a => (a -> a -> a) -> v a -> a
+ RIO.Vector.Partial: foldl1 :: Vector v a => a -> a -> a -> v a -> a
- RIO.Vector.Partial: foldl1' :: Vector v a => (a -> a -> a) -> v a -> a
+ RIO.Vector.Partial: foldl1' :: Vector v a => a -> a -> a -> v a -> a
- RIO.Vector.Partial: foldr1 :: Vector v a => (a -> a -> a) -> v a -> a
+ RIO.Vector.Partial: foldr1 :: Vector v a => a -> a -> a -> v a -> a
- RIO.Vector.Partial: foldr1' :: Vector v a => (a -> a -> a) -> v a -> a
+ RIO.Vector.Partial: foldr1' :: Vector v a => a -> a -> a -> v a -> a
- RIO.Vector.Partial: maxIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int
+ RIO.Vector.Partial: maxIndexBy :: Vector v a => a -> a -> Ordering -> v a -> Int
- RIO.Vector.Partial: maximumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a
+ RIO.Vector.Partial: maximumBy :: Vector v a => a -> a -> Ordering -> v a -> a
- RIO.Vector.Partial: minIndexBy :: Vector v a => (a -> a -> Ordering) -> v a -> Int
+ RIO.Vector.Partial: minIndexBy :: Vector v a => a -> a -> Ordering -> v a -> Int
- RIO.Vector.Partial: minimumBy :: Vector v a => (a -> a -> Ordering) -> v a -> a
+ RIO.Vector.Partial: minimumBy :: Vector v a => a -> a -> Ordering -> v a -> a
- RIO.Vector.Partial: scanl1 :: Vector v a => (a -> a -> a) -> v a -> v a
+ RIO.Vector.Partial: scanl1 :: Vector v a => a -> a -> a -> v a -> v a
- RIO.Vector.Partial: scanl1' :: Vector v a => (a -> a -> a) -> v a -> v a
+ RIO.Vector.Partial: scanl1' :: Vector v a => a -> a -> a -> v a -> v a
- RIO.Vector.Partial: scanr1 :: Vector v a => (a -> a -> a) -> v a -> v a
+ RIO.Vector.Partial: scanr1 :: Vector v a => a -> a -> a -> v a -> v a
- RIO.Vector.Partial: scanr1' :: Vector v a => (a -> a -> a) -> v a -> v a
+ RIO.Vector.Partial: scanr1' :: Vector v a => a -> a -> a -> v a -> v a
- RIO.Vector.Storable: all :: Storable a => (a -> Bool) -> Vector a -> Bool
+ RIO.Vector.Storable: all :: Storable a => a -> Bool -> Vector a -> Bool
- RIO.Vector.Storable: any :: Storable a => (a -> Bool) -> Vector a -> Bool
+ RIO.Vector.Storable: any :: Storable a => a -> Bool -> Vector a -> Bool
- RIO.Vector.Storable: break :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Storable: break :: Storable a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Storable: concatMap :: (Storable a, Storable b) => (a -> Vector b) -> Vector a -> Vector b
+ RIO.Vector.Storable: concatMap :: (Storable a, Storable b) => a -> Vector b -> Vector a -> Vector b
- RIO.Vector.Storable: constructN :: Storable a => Int -> (Vector a -> a) -> Vector a
+ RIO.Vector.Storable: constructN :: Storable a => Int -> Vector a -> a -> Vector a
- RIO.Vector.Storable: constructrN :: Storable a => Int -> (Vector a -> a) -> Vector a
+ RIO.Vector.Storable: constructrN :: Storable a => Int -> Vector a -> a -> Vector a
- RIO.Vector.Storable: create :: Storable a => (forall s. () => ST s MVector s a) -> Vector a
+ RIO.Vector.Storable: create :: Storable a => forall s. () => ST s MVector s a -> Vector a
- RIO.Vector.Storable: createT :: (Traversable f, Storable a) => (forall s. () => ST s f MVector s a) -> f Vector a
+ RIO.Vector.Storable: createT :: (Traversable f, Storable a) => forall s. () => ST s f MVector s a -> f Vector a
- RIO.Vector.Storable: data MVector s a :: * -> * -> *
+ RIO.Vector.Storable: data MVector s a
- RIO.Vector.Storable: data Vector a :: * -> *
+ RIO.Vector.Storable: data Vector a
- RIO.Vector.Storable: dropWhile :: Storable a => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Storable: dropWhile :: Storable a => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Storable: filter :: Storable a => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Storable: filter :: Storable a => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Storable: filterM :: (Monad m, Storable a) => (a -> m Bool) -> Vector a -> m Vector a
+ RIO.Vector.Storable: filterM :: (Monad m, Storable a) => a -> m Bool -> Vector a -> m Vector a
- RIO.Vector.Storable: find :: Storable a => (a -> Bool) -> Vector a -> Maybe a
+ RIO.Vector.Storable: find :: Storable a => a -> Bool -> Vector a -> Maybe a
- RIO.Vector.Storable: findIndex :: Storable a => (a -> Bool) -> Vector a -> Maybe Int
+ RIO.Vector.Storable: findIndex :: Storable a => a -> Bool -> Vector a -> Maybe Int
- RIO.Vector.Storable: findIndices :: Storable a => (a -> Bool) -> Vector a -> Vector Int
+ RIO.Vector.Storable: findIndices :: Storable a => a -> Bool -> Vector a -> Vector Int
- RIO.Vector.Storable: foldM :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Storable: foldM :: (Monad m, Storable b) => a -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Storable: foldM' :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Storable: foldM' :: (Monad m, Storable b) => a -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Storable: foldM'_ :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Storable: foldM'_ :: (Monad m, Storable b) => a -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Storable: foldM_ :: (Monad m, Storable b) => (a -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Storable: foldM_ :: (Monad m, Storable b) => a -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Storable: foldl :: Storable b => (a -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Storable: foldl :: Storable b => a -> b -> a -> a -> Vector b -> a
- RIO.Vector.Storable: foldl' :: Storable b => (a -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Storable: foldl' :: Storable b => a -> b -> a -> a -> Vector b -> a
- RIO.Vector.Storable: foldr :: Storable a => (a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Storable: foldr :: Storable a => a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Storable: foldr' :: Storable a => (a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Storable: foldr' :: Storable a => a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Storable: forM :: (Monad m, Storable a, Storable b) => Vector a -> (a -> m b) -> m Vector b
+ RIO.Vector.Storable: forM :: (Monad m, Storable a, Storable b) => Vector a -> a -> m b -> m Vector b
- RIO.Vector.Storable: forM_ :: (Monad m, Storable a) => Vector a -> (a -> m b) -> m ()
+ RIO.Vector.Storable: forM_ :: (Monad m, Storable a) => Vector a -> a -> m b -> m ()
- RIO.Vector.Storable: generate :: Storable a => Int -> (Int -> a) -> Vector a
+ RIO.Vector.Storable: generate :: Storable a => Int -> Int -> a -> Vector a
- RIO.Vector.Storable: generateM :: (Monad m, Storable a) => Int -> (Int -> m a) -> m Vector a
+ RIO.Vector.Storable: generateM :: (Monad m, Storable a) => Int -> Int -> m a -> m Vector a
- RIO.Vector.Storable: ifilter :: Storable a => (Int -> a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Storable: ifilter :: Storable a => Int -> a -> Bool -> Vector a -> Vector a
- RIO.Vector.Storable: ifoldl :: Storable b => (a -> Int -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Storable: ifoldl :: Storable b => a -> Int -> b -> a -> a -> Vector b -> a
- RIO.Vector.Storable: ifoldl' :: Storable b => (a -> Int -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Storable: ifoldl' :: Storable b => a -> Int -> b -> a -> a -> Vector b -> a
- RIO.Vector.Storable: ifoldr :: Storable a => (Int -> a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Storable: ifoldr :: Storable a => Int -> a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Storable: ifoldr' :: Storable a => (Int -> a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Storable: ifoldr' :: Storable a => Int -> a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Storable: imap :: (Storable a, Storable b) => (Int -> a -> b) -> Vector a -> Vector b
+ RIO.Vector.Storable: imap :: (Storable a, Storable b) => Int -> a -> b -> Vector a -> Vector b
- RIO.Vector.Storable: imapMaybe :: (Storable a, Storable b) => (Int -> a -> Maybe b) -> Vector a -> Vector b
+ RIO.Vector.Storable: imapMaybe :: (Storable a, Storable b) => Int -> a -> Maybe b -> Vector a -> Vector b
- RIO.Vector.Storable: iterateN :: Storable a => Int -> (a -> a) -> a -> Vector a
+ RIO.Vector.Storable: iterateN :: Storable a => Int -> a -> a -> a -> Vector a
- RIO.Vector.Storable: iterateNM :: (Monad m, Storable a) => Int -> (a -> m a) -> a -> m Vector a
+ RIO.Vector.Storable: iterateNM :: (Monad m, Storable a) => Int -> a -> m a -> a -> m Vector a
- RIO.Vector.Storable: izipWith :: (Storable a, Storable b, Storable c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
+ RIO.Vector.Storable: izipWith :: (Storable a, Storable b, Storable c) => Int -> a -> b -> c -> Vector a -> Vector b -> Vector c
- RIO.Vector.Storable: izipWith3 :: (Storable a, Storable b, Storable c, Storable d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
+ RIO.Vector.Storable: izipWith3 :: (Storable a, Storable b, Storable c, Storable d) => Int -> a -> b -> c -> d -> Vector a -> Vector b -> Vector c -> Vector d
- RIO.Vector.Storable: izipWith4 :: (Storable a, Storable b, Storable c, Storable d, Storable e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
+ RIO.Vector.Storable: izipWith4 :: (Storable a, Storable b, Storable c, Storable d, Storable e) => Int -> a -> b -> c -> d -> e -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
- RIO.Vector.Storable: izipWith5 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
+ RIO.Vector.Storable: izipWith5 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f) => Int -> a -> b -> c -> d -> e -> f -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
- RIO.Vector.Storable: izipWith6 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f, Storable g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
+ RIO.Vector.Storable: izipWith6 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f, Storable g) => Int -> a -> b -> c -> d -> e -> f -> g -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
- RIO.Vector.Storable: map :: (Storable a, Storable b) => (a -> b) -> Vector a -> Vector b
+ RIO.Vector.Storable: map :: (Storable a, Storable b) => a -> b -> Vector a -> Vector b
- RIO.Vector.Storable: mapM :: (Monad m, Storable a, Storable b) => (a -> m b) -> Vector a -> m Vector b
+ RIO.Vector.Storable: mapM :: (Monad m, Storable a, Storable b) => a -> m b -> Vector a -> m Vector b
- RIO.Vector.Storable: mapM_ :: (Monad m, Storable a) => (a -> m b) -> Vector a -> m ()
+ RIO.Vector.Storable: mapM_ :: (Monad m, Storable a) => a -> m b -> Vector a -> m ()
- RIO.Vector.Storable: mapMaybe :: (Storable a, Storable b) => (a -> Maybe b) -> Vector a -> Vector b
+ RIO.Vector.Storable: mapMaybe :: (Storable a, Storable b) => a -> Maybe b -> Vector a -> Vector b
- RIO.Vector.Storable: modify :: Storable a => (forall s. () => MVector s a -> ST s ()) -> Vector a -> Vector a
+ RIO.Vector.Storable: modify :: Storable a => forall s. () => MVector s a -> ST s () -> Vector a -> Vector a
- RIO.Vector.Storable: partition :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Storable: partition :: Storable a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Storable: postscanl :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Storable: postscanl :: (Storable a, Storable b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Storable: postscanl' :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Storable: postscanl' :: (Storable a, Storable b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Storable: postscanr :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Storable: postscanr :: (Storable a, Storable b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Storable: postscanr' :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Storable: postscanr' :: (Storable a, Storable b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Storable: prescanl :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Storable: prescanl :: (Storable a, Storable b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Storable: prescanl' :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Storable: prescanl' :: (Storable a, Storable b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Storable: prescanr :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Storable: prescanr :: (Storable a, Storable b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Storable: prescanr' :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Storable: prescanr' :: (Storable a, Storable b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Storable: scanl :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Storable: scanl :: (Storable a, Storable b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Storable: scanl' :: (Storable a, Storable b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Storable: scanl' :: (Storable a, Storable b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Storable: scanr :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Storable: scanr :: (Storable a, Storable b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Storable: scanr' :: (Storable a, Storable b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Storable: scanr' :: (Storable a, Storable b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Storable: span :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Storable: span :: Storable a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Storable: takeWhile :: Storable a => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Storable: takeWhile :: Storable a => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Storable: unfoldr :: Storable a => (b -> Maybe (a, b)) -> b -> Vector a
+ RIO.Vector.Storable: unfoldr :: Storable a => b -> Maybe (a, b) -> b -> Vector a
- RIO.Vector.Storable: unfoldrM :: (Monad m, Storable a) => (b -> m Maybe (a, b)) -> b -> m Vector a
+ RIO.Vector.Storable: unfoldrM :: (Monad m, Storable a) => b -> m Maybe (a, b) -> b -> m Vector a
- RIO.Vector.Storable: unfoldrN :: Storable a => Int -> (b -> Maybe (a, b)) -> b -> Vector a
+ RIO.Vector.Storable: unfoldrN :: Storable a => Int -> b -> Maybe (a, b) -> b -> Vector a
- RIO.Vector.Storable: unfoldrNM :: (Monad m, Storable a) => Int -> (b -> m Maybe (a, b)) -> b -> m Vector a
+ RIO.Vector.Storable: unfoldrNM :: (Monad m, Storable a) => Int -> b -> m Maybe (a, b) -> b -> m Vector a
- RIO.Vector.Storable: unstablePartition :: Storable a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Storable: unstablePartition :: Storable a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Storable: zipWith :: (Storable a, Storable b, Storable c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c
+ RIO.Vector.Storable: zipWith :: (Storable a, Storable b, Storable c) => a -> b -> c -> Vector a -> Vector b -> Vector c
- RIO.Vector.Storable: zipWith3 :: (Storable a, Storable b, Storable c, Storable d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
+ RIO.Vector.Storable: zipWith3 :: (Storable a, Storable b, Storable c, Storable d) => a -> b -> c -> d -> Vector a -> Vector b -> Vector c -> Vector d
- RIO.Vector.Storable: zipWith4 :: (Storable a, Storable b, Storable c, Storable d, Storable e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
+ RIO.Vector.Storable: zipWith4 :: (Storable a, Storable b, Storable c, Storable d, Storable e) => a -> b -> c -> d -> e -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
- RIO.Vector.Storable: zipWith5 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
+ RIO.Vector.Storable: zipWith5 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f) => a -> b -> c -> d -> e -> f -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
- RIO.Vector.Storable: zipWith6 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f, Storable g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
+ RIO.Vector.Storable: zipWith6 :: (Storable a, Storable b, Storable c, Storable d, Storable e, Storable f, Storable g) => a -> b -> c -> d -> e -> f -> g -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
- RIO.Vector.Storable: zipWithM :: (Monad m, Storable a, Storable b, Storable c) => (a -> b -> m c) -> Vector a -> Vector b -> m Vector c
+ RIO.Vector.Storable: zipWithM :: (Monad m, Storable a, Storable b, Storable c) => a -> b -> m c -> Vector a -> Vector b -> m Vector c
- RIO.Vector.Storable: zipWithM_ :: (Monad m, Storable a, Storable b) => (a -> b -> m c) -> Vector a -> Vector b -> m ()
+ RIO.Vector.Storable: zipWithM_ :: (Monad m, Storable a, Storable b) => a -> b -> m c -> Vector a -> Vector b -> m ()
- RIO.Vector.Storable.Partial: accum :: Storable a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
+ RIO.Vector.Storable.Partial: accum :: Storable a => a -> b -> a -> Vector a -> [(Int, b)] -> Vector a
- RIO.Vector.Storable.Partial: accumulate_ :: (Storable a, Storable b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
+ RIO.Vector.Storable.Partial: accumulate_ :: (Storable a, Storable b) => a -> b -> a -> Vector a -> Vector Int -> Vector b -> Vector a
- RIO.Vector.Storable.Partial: fold1M :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m a
+ RIO.Vector.Storable.Partial: fold1M :: (Monad m, Storable a) => a -> a -> m a -> Vector a -> m a
- RIO.Vector.Storable.Partial: fold1M' :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m a
+ RIO.Vector.Storable.Partial: fold1M' :: (Monad m, Storable a) => a -> a -> m a -> Vector a -> m a
- RIO.Vector.Storable.Partial: fold1M'_ :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m ()
+ RIO.Vector.Storable.Partial: fold1M'_ :: (Monad m, Storable a) => a -> a -> m a -> Vector a -> m ()
- RIO.Vector.Storable.Partial: fold1M_ :: (Monad m, Storable a) => (a -> a -> m a) -> Vector a -> m ()
+ RIO.Vector.Storable.Partial: fold1M_ :: (Monad m, Storable a) => a -> a -> m a -> Vector a -> m ()
- RIO.Vector.Storable.Partial: foldl1 :: Storable a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Storable.Partial: foldl1 :: Storable a => a -> a -> a -> Vector a -> a
- RIO.Vector.Storable.Partial: foldl1' :: Storable a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Storable.Partial: foldl1' :: Storable a => a -> a -> a -> Vector a -> a
- RIO.Vector.Storable.Partial: foldr1 :: Storable a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Storable.Partial: foldr1 :: Storable a => a -> a -> a -> Vector a -> a
- RIO.Vector.Storable.Partial: foldr1' :: Storable a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Storable.Partial: foldr1' :: Storable a => a -> a -> a -> Vector a -> a
- RIO.Vector.Storable.Partial: maxIndexBy :: Storable a => (a -> a -> Ordering) -> Vector a -> Int
+ RIO.Vector.Storable.Partial: maxIndexBy :: Storable a => a -> a -> Ordering -> Vector a -> Int
- RIO.Vector.Storable.Partial: maximumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a
+ RIO.Vector.Storable.Partial: maximumBy :: Storable a => a -> a -> Ordering -> Vector a -> a
- RIO.Vector.Storable.Partial: minIndexBy :: Storable a => (a -> a -> Ordering) -> Vector a -> Int
+ RIO.Vector.Storable.Partial: minIndexBy :: Storable a => a -> a -> Ordering -> Vector a -> Int
- RIO.Vector.Storable.Partial: minimumBy :: Storable a => (a -> a -> Ordering) -> Vector a -> a
+ RIO.Vector.Storable.Partial: minimumBy :: Storable a => a -> a -> Ordering -> Vector a -> a
- RIO.Vector.Storable.Partial: scanl1 :: Storable a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Storable.Partial: scanl1 :: Storable a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Storable.Partial: scanl1' :: Storable a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Storable.Partial: scanl1' :: Storable a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Storable.Partial: scanr1 :: Storable a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Storable.Partial: scanr1 :: Storable a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Storable.Partial: scanr1' :: Storable a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Storable.Partial: scanr1' :: Storable a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Storable.Unsafe: unsafeAccum :: Storable a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
+ RIO.Vector.Storable.Unsafe: unsafeAccum :: Storable a => a -> b -> a -> Vector a -> [(Int, b)] -> Vector a
- RIO.Vector.Storable.Unsafe: unsafeAccumulate_ :: (Storable a, Storable b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
+ RIO.Vector.Storable.Unsafe: unsafeAccumulate_ :: (Storable a, Storable b) => a -> b -> a -> Vector a -> Vector Int -> Vector b -> Vector a
- RIO.Vector.Unboxed: all :: Unbox a => (a -> Bool) -> Vector a -> Bool
+ RIO.Vector.Unboxed: all :: Unbox a => a -> Bool -> Vector a -> Bool
- RIO.Vector.Unboxed: any :: Unbox a => (a -> Bool) -> Vector a -> Bool
+ RIO.Vector.Unboxed: any :: Unbox a => a -> Bool -> Vector a -> Bool
- RIO.Vector.Unboxed: break :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Unboxed: break :: Unbox a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Unboxed: concatMap :: (Unbox a, Unbox b) => (a -> Vector b) -> Vector a -> Vector b
+ RIO.Vector.Unboxed: concatMap :: (Unbox a, Unbox b) => a -> Vector b -> Vector a -> Vector b
- RIO.Vector.Unboxed: constructN :: Unbox a => Int -> (Vector a -> a) -> Vector a
+ RIO.Vector.Unboxed: constructN :: Unbox a => Int -> Vector a -> a -> Vector a
- RIO.Vector.Unboxed: constructrN :: Unbox a => Int -> (Vector a -> a) -> Vector a
+ RIO.Vector.Unboxed: constructrN :: Unbox a => Int -> Vector a -> a -> Vector a
- RIO.Vector.Unboxed: create :: Unbox a => (forall s. () => ST s MVector s a) -> Vector a
+ RIO.Vector.Unboxed: create :: Unbox a => forall s. () => ST s MVector s a -> Vector a
- RIO.Vector.Unboxed: createT :: (Traversable f, Unbox a) => (forall s. () => ST s f MVector s a) -> f Vector a
+ RIO.Vector.Unboxed: createT :: (Traversable f, Unbox a) => forall s. () => ST s f MVector s a -> f Vector a
- RIO.Vector.Unboxed: dropWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Unboxed: dropWhile :: Unbox a => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Unboxed: filter :: Unbox a => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Unboxed: filter :: Unbox a => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Unboxed: filterM :: (Monad m, Unbox a) => (a -> m Bool) -> Vector a -> m Vector a
+ RIO.Vector.Unboxed: filterM :: (Monad m, Unbox a) => a -> m Bool -> Vector a -> m Vector a
- RIO.Vector.Unboxed: find :: Unbox a => (a -> Bool) -> Vector a -> Maybe a
+ RIO.Vector.Unboxed: find :: Unbox a => a -> Bool -> Vector a -> Maybe a
- RIO.Vector.Unboxed: findIndex :: Unbox a => (a -> Bool) -> Vector a -> Maybe Int
+ RIO.Vector.Unboxed: findIndex :: Unbox a => a -> Bool -> Vector a -> Maybe Int
- RIO.Vector.Unboxed: findIndices :: Unbox a => (a -> Bool) -> Vector a -> Vector Int
+ RIO.Vector.Unboxed: findIndices :: Unbox a => a -> Bool -> Vector a -> Vector Int
- RIO.Vector.Unboxed: foldM :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Unboxed: foldM :: (Monad m, Unbox b) => a -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Unboxed: foldM' :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Unboxed: foldM' :: (Monad m, Unbox b) => a -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Unboxed: foldM'_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Unboxed: foldM'_ :: (Monad m, Unbox b) => a -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Unboxed: foldM_ :: (Monad m, Unbox b) => (a -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Unboxed: foldM_ :: (Monad m, Unbox b) => a -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Unboxed: foldl :: Unbox b => (a -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Unboxed: foldl :: Unbox b => a -> b -> a -> a -> Vector b -> a
- RIO.Vector.Unboxed: foldl' :: Unbox b => (a -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Unboxed: foldl' :: Unbox b => a -> b -> a -> a -> Vector b -> a
- RIO.Vector.Unboxed: foldr :: Unbox a => (a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Unboxed: foldr :: Unbox a => a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Unboxed: foldr' :: Unbox a => (a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Unboxed: foldr' :: Unbox a => a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Unboxed: forM :: (Monad m, Unbox a, Unbox b) => Vector a -> (a -> m b) -> m Vector b
+ RIO.Vector.Unboxed: forM :: (Monad m, Unbox a, Unbox b) => Vector a -> a -> m b -> m Vector b
- RIO.Vector.Unboxed: forM_ :: (Monad m, Unbox a) => Vector a -> (a -> m b) -> m ()
+ RIO.Vector.Unboxed: forM_ :: (Monad m, Unbox a) => Vector a -> a -> m b -> m ()
- RIO.Vector.Unboxed: generate :: Unbox a => Int -> (Int -> a) -> Vector a
+ RIO.Vector.Unboxed: generate :: Unbox a => Int -> Int -> a -> Vector a
- RIO.Vector.Unboxed: generateM :: (Monad m, Unbox a) => Int -> (Int -> m a) -> m Vector a
+ RIO.Vector.Unboxed: generateM :: (Monad m, Unbox a) => Int -> Int -> m a -> m Vector a
- RIO.Vector.Unboxed: ifilter :: Unbox a => (Int -> a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Unboxed: ifilter :: Unbox a => Int -> a -> Bool -> Vector a -> Vector a
- RIO.Vector.Unboxed: ifoldM :: (Monad m, Unbox b) => (a -> Int -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Unboxed: ifoldM :: (Monad m, Unbox b) => a -> Int -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Unboxed: ifoldM' :: (Monad m, Unbox b) => (a -> Int -> b -> m a) -> a -> Vector b -> m a
+ RIO.Vector.Unboxed: ifoldM' :: (Monad m, Unbox b) => a -> Int -> b -> m a -> a -> Vector b -> m a
- RIO.Vector.Unboxed: ifoldM'_ :: (Monad m, Unbox b) => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Unboxed: ifoldM'_ :: (Monad m, Unbox b) => a -> Int -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Unboxed: ifoldM_ :: (Monad m, Unbox b) => (a -> Int -> b -> m a) -> a -> Vector b -> m ()
+ RIO.Vector.Unboxed: ifoldM_ :: (Monad m, Unbox b) => a -> Int -> b -> m a -> a -> Vector b -> m ()
- RIO.Vector.Unboxed: ifoldl :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Unboxed: ifoldl :: Unbox b => a -> Int -> b -> a -> a -> Vector b -> a
- RIO.Vector.Unboxed: ifoldl' :: Unbox b => (a -> Int -> b -> a) -> a -> Vector b -> a
+ RIO.Vector.Unboxed: ifoldl' :: Unbox b => a -> Int -> b -> a -> a -> Vector b -> a
- RIO.Vector.Unboxed: ifoldr :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Unboxed: ifoldr :: Unbox a => Int -> a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Unboxed: ifoldr' :: Unbox a => (Int -> a -> b -> b) -> b -> Vector a -> b
+ RIO.Vector.Unboxed: ifoldr' :: Unbox a => Int -> a -> b -> b -> b -> Vector a -> b
- RIO.Vector.Unboxed: imap :: (Unbox a, Unbox b) => (Int -> a -> b) -> Vector a -> Vector b
+ RIO.Vector.Unboxed: imap :: (Unbox a, Unbox b) => Int -> a -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: imapM :: (Monad m, Unbox a, Unbox b) => (Int -> a -> m b) -> Vector a -> m Vector b
+ RIO.Vector.Unboxed: imapM :: (Monad m, Unbox a, Unbox b) => Int -> a -> m b -> Vector a -> m Vector b
- RIO.Vector.Unboxed: imapM_ :: (Monad m, Unbox a) => (Int -> a -> m b) -> Vector a -> m ()
+ RIO.Vector.Unboxed: imapM_ :: (Monad m, Unbox a) => Int -> a -> m b -> Vector a -> m ()
- RIO.Vector.Unboxed: imapMaybe :: (Unbox a, Unbox b) => (Int -> a -> Maybe b) -> Vector a -> Vector b
+ RIO.Vector.Unboxed: imapMaybe :: (Unbox a, Unbox b) => Int -> a -> Maybe b -> Vector a -> Vector b
- RIO.Vector.Unboxed: iterateN :: Unbox a => Int -> (a -> a) -> a -> Vector a
+ RIO.Vector.Unboxed: iterateN :: Unbox a => Int -> a -> a -> a -> Vector a
- RIO.Vector.Unboxed: iterateNM :: (Monad m, Unbox a) => Int -> (a -> m a) -> a -> m Vector a
+ RIO.Vector.Unboxed: iterateNM :: (Monad m, Unbox a) => Int -> a -> m a -> a -> m Vector a
- RIO.Vector.Unboxed: izipWith :: (Unbox a, Unbox b, Unbox c) => (Int -> a -> b -> c) -> Vector a -> Vector b -> Vector c
+ RIO.Vector.Unboxed: izipWith :: (Unbox a, Unbox b, Unbox c) => Int -> a -> b -> c -> Vector a -> Vector b -> Vector c
- RIO.Vector.Unboxed: izipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => (Int -> a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
+ RIO.Vector.Unboxed: izipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => Int -> a -> b -> c -> d -> Vector a -> Vector b -> Vector c -> Vector d
- RIO.Vector.Unboxed: izipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => (Int -> a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
+ RIO.Vector.Unboxed: izipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => Int -> a -> b -> c -> d -> e -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
- RIO.Vector.Unboxed: izipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => (Int -> a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
+ RIO.Vector.Unboxed: izipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => Int -> a -> b -> c -> d -> e -> f -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
- RIO.Vector.Unboxed: izipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => (Int -> a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
+ RIO.Vector.Unboxed: izipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => Int -> a -> b -> c -> d -> e -> f -> g -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
- RIO.Vector.Unboxed: izipWithM :: (Monad m, Unbox a, Unbox b, Unbox c) => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m Vector c
+ RIO.Vector.Unboxed: izipWithM :: (Monad m, Unbox a, Unbox b, Unbox c) => Int -> a -> b -> m c -> Vector a -> Vector b -> m Vector c
- RIO.Vector.Unboxed: izipWithM_ :: (Monad m, Unbox a, Unbox b) => (Int -> a -> b -> m c) -> Vector a -> Vector b -> m ()
+ RIO.Vector.Unboxed: izipWithM_ :: (Monad m, Unbox a, Unbox b) => Int -> a -> b -> m c -> Vector a -> Vector b -> m ()
- RIO.Vector.Unboxed: map :: (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b
+ RIO.Vector.Unboxed: map :: (Unbox a, Unbox b) => a -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: mapM :: (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector a -> m Vector b
+ RIO.Vector.Unboxed: mapM :: (Monad m, Unbox a, Unbox b) => a -> m b -> Vector a -> m Vector b
- RIO.Vector.Unboxed: mapM_ :: (Monad m, Unbox a) => (a -> m b) -> Vector a -> m ()
+ RIO.Vector.Unboxed: mapM_ :: (Monad m, Unbox a) => a -> m b -> Vector a -> m ()
- RIO.Vector.Unboxed: mapMaybe :: (Unbox a, Unbox b) => (a -> Maybe b) -> Vector a -> Vector b
+ RIO.Vector.Unboxed: mapMaybe :: (Unbox a, Unbox b) => a -> Maybe b -> Vector a -> Vector b
- RIO.Vector.Unboxed: modify :: Unbox a => (forall s. () => MVector s a -> ST s ()) -> Vector a -> Vector a
+ RIO.Vector.Unboxed: modify :: Unbox a => forall s. () => MVector s a -> ST s () -> Vector a -> Vector a
- RIO.Vector.Unboxed: partition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Unboxed: partition :: Unbox a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Unboxed: postscanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Unboxed: postscanl :: (Unbox a, Unbox b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Unboxed: postscanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Unboxed: postscanl' :: (Unbox a, Unbox b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Unboxed: postscanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Unboxed: postscanr :: (Unbox a, Unbox b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: postscanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Unboxed: postscanr' :: (Unbox a, Unbox b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: prescanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Unboxed: prescanl :: (Unbox a, Unbox b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Unboxed: prescanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Unboxed: prescanl' :: (Unbox a, Unbox b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Unboxed: prescanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Unboxed: prescanr :: (Unbox a, Unbox b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: prescanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Unboxed: prescanr' :: (Unbox a, Unbox b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: scanl :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Unboxed: scanl :: (Unbox a, Unbox b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Unboxed: scanl' :: (Unbox a, Unbox b) => (a -> b -> a) -> a -> Vector b -> Vector a
+ RIO.Vector.Unboxed: scanl' :: (Unbox a, Unbox b) => a -> b -> a -> a -> Vector b -> Vector a
- RIO.Vector.Unboxed: scanr :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Unboxed: scanr :: (Unbox a, Unbox b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: scanr' :: (Unbox a, Unbox b) => (a -> b -> b) -> b -> Vector a -> Vector b
+ RIO.Vector.Unboxed: scanr' :: (Unbox a, Unbox b) => a -> b -> b -> b -> Vector a -> Vector b
- RIO.Vector.Unboxed: span :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Unboxed: span :: Unbox a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Unboxed: takeWhile :: Unbox a => (a -> Bool) -> Vector a -> Vector a
+ RIO.Vector.Unboxed: takeWhile :: Unbox a => a -> Bool -> Vector a -> Vector a
- RIO.Vector.Unboxed: unfoldr :: Unbox a => (b -> Maybe (a, b)) -> b -> Vector a
+ RIO.Vector.Unboxed: unfoldr :: Unbox a => b -> Maybe (a, b) -> b -> Vector a
- RIO.Vector.Unboxed: unfoldrM :: (Monad m, Unbox a) => (b -> m Maybe (a, b)) -> b -> m Vector a
+ RIO.Vector.Unboxed: unfoldrM :: (Monad m, Unbox a) => b -> m Maybe (a, b) -> b -> m Vector a
- RIO.Vector.Unboxed: unfoldrN :: Unbox a => Int -> (b -> Maybe (a, b)) -> b -> Vector a
+ RIO.Vector.Unboxed: unfoldrN :: Unbox a => Int -> b -> Maybe (a, b) -> b -> Vector a
- RIO.Vector.Unboxed: unfoldrNM :: (Monad m, Unbox a) => Int -> (b -> m Maybe (a, b)) -> b -> m Vector a
+ RIO.Vector.Unboxed: unfoldrNM :: (Monad m, Unbox a) => Int -> b -> m Maybe (a, b) -> b -> m Vector a
- RIO.Vector.Unboxed: unstablePartition :: Unbox a => (a -> Bool) -> Vector a -> (Vector a, Vector a)
+ RIO.Vector.Unboxed: unstablePartition :: Unbox a => a -> Bool -> Vector a -> (Vector a, Vector a)
- RIO.Vector.Unboxed: zipWith :: (Unbox a, Unbox b, Unbox c) => (a -> b -> c) -> Vector a -> Vector b -> Vector c
+ RIO.Vector.Unboxed: zipWith :: (Unbox a, Unbox b, Unbox c) => a -> b -> c -> Vector a -> Vector b -> Vector c
- RIO.Vector.Unboxed: zipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => (a -> b -> c -> d) -> Vector a -> Vector b -> Vector c -> Vector d
+ RIO.Vector.Unboxed: zipWith3 :: (Unbox a, Unbox b, Unbox c, Unbox d) => a -> b -> c -> d -> Vector a -> Vector b -> Vector c -> Vector d
- RIO.Vector.Unboxed: zipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => (a -> b -> c -> d -> e) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
+ RIO.Vector.Unboxed: zipWith4 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e) => a -> b -> c -> d -> e -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e
- RIO.Vector.Unboxed: zipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => (a -> b -> c -> d -> e -> f) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
+ RIO.Vector.Unboxed: zipWith5 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f) => a -> b -> c -> d -> e -> f -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f
- RIO.Vector.Unboxed: zipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => (a -> b -> c -> d -> e -> f -> g) -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
+ RIO.Vector.Unboxed: zipWith6 :: (Unbox a, Unbox b, Unbox c, Unbox d, Unbox e, Unbox f, Unbox g) => a -> b -> c -> d -> e -> f -> g -> Vector a -> Vector b -> Vector c -> Vector d -> Vector e -> Vector f -> Vector g
- RIO.Vector.Unboxed: zipWithM :: (Monad m, Unbox a, Unbox b, Unbox c) => (a -> b -> m c) -> Vector a -> Vector b -> m Vector c
+ RIO.Vector.Unboxed: zipWithM :: (Monad m, Unbox a, Unbox b, Unbox c) => a -> b -> m c -> Vector a -> Vector b -> m Vector c
- RIO.Vector.Unboxed: zipWithM_ :: (Monad m, Unbox a, Unbox b) => (a -> b -> m c) -> Vector a -> Vector b -> m ()
+ RIO.Vector.Unboxed: zipWithM_ :: (Monad m, Unbox a, Unbox b) => a -> b -> m c -> Vector a -> Vector b -> m ()
- RIO.Vector.Unboxed.Partial: accum :: Unbox a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
+ RIO.Vector.Unboxed.Partial: accum :: Unbox a => a -> b -> a -> Vector a -> [(Int, b)] -> Vector a
- RIO.Vector.Unboxed.Partial: accumulate :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
+ RIO.Vector.Unboxed.Partial: accumulate :: (Unbox a, Unbox b) => a -> b -> a -> Vector a -> Vector (Int, b) -> Vector a
- RIO.Vector.Unboxed.Partial: accumulate_ :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
+ RIO.Vector.Unboxed.Partial: accumulate_ :: (Unbox a, Unbox b) => a -> b -> a -> Vector a -> Vector Int -> Vector b -> Vector a
- RIO.Vector.Unboxed.Partial: fold1M :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a
+ RIO.Vector.Unboxed.Partial: fold1M :: (Monad m, Unbox a) => a -> a -> m a -> Vector a -> m a
- RIO.Vector.Unboxed.Partial: fold1M' :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m a
+ RIO.Vector.Unboxed.Partial: fold1M' :: (Monad m, Unbox a) => a -> a -> m a -> Vector a -> m a
- RIO.Vector.Unboxed.Partial: fold1M'_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m ()
+ RIO.Vector.Unboxed.Partial: fold1M'_ :: (Monad m, Unbox a) => a -> a -> m a -> Vector a -> m ()
- RIO.Vector.Unboxed.Partial: fold1M_ :: (Monad m, Unbox a) => (a -> a -> m a) -> Vector a -> m ()
+ RIO.Vector.Unboxed.Partial: fold1M_ :: (Monad m, Unbox a) => a -> a -> m a -> Vector a -> m ()
- RIO.Vector.Unboxed.Partial: foldl1 :: Unbox a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Unboxed.Partial: foldl1 :: Unbox a => a -> a -> a -> Vector a -> a
- RIO.Vector.Unboxed.Partial: foldl1' :: Unbox a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Unboxed.Partial: foldl1' :: Unbox a => a -> a -> a -> Vector a -> a
- RIO.Vector.Unboxed.Partial: foldr1 :: Unbox a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Unboxed.Partial: foldr1 :: Unbox a => a -> a -> a -> Vector a -> a
- RIO.Vector.Unboxed.Partial: foldr1' :: Unbox a => (a -> a -> a) -> Vector a -> a
+ RIO.Vector.Unboxed.Partial: foldr1' :: Unbox a => a -> a -> a -> Vector a -> a
- RIO.Vector.Unboxed.Partial: maxIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int
+ RIO.Vector.Unboxed.Partial: maxIndexBy :: Unbox a => a -> a -> Ordering -> Vector a -> Int
- RIO.Vector.Unboxed.Partial: maximumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a
+ RIO.Vector.Unboxed.Partial: maximumBy :: Unbox a => a -> a -> Ordering -> Vector a -> a
- RIO.Vector.Unboxed.Partial: minIndexBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> Int
+ RIO.Vector.Unboxed.Partial: minIndexBy :: Unbox a => a -> a -> Ordering -> Vector a -> Int
- RIO.Vector.Unboxed.Partial: minimumBy :: Unbox a => (a -> a -> Ordering) -> Vector a -> a
+ RIO.Vector.Unboxed.Partial: minimumBy :: Unbox a => a -> a -> Ordering -> Vector a -> a
- RIO.Vector.Unboxed.Partial: scanl1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Unboxed.Partial: scanl1 :: Unbox a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Unboxed.Partial: scanl1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Unboxed.Partial: scanl1' :: Unbox a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Unboxed.Partial: scanr1 :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Unboxed.Partial: scanr1 :: Unbox a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Unboxed.Partial: scanr1' :: Unbox a => (a -> a -> a) -> Vector a -> Vector a
+ RIO.Vector.Unboxed.Partial: scanr1' :: Unbox a => a -> a -> a -> Vector a -> Vector a
- RIO.Vector.Unboxed.Unsafe: unsafeAccum :: Unbox a => (a -> b -> a) -> Vector a -> [(Int, b)] -> Vector a
+ RIO.Vector.Unboxed.Unsafe: unsafeAccum :: Unbox a => a -> b -> a -> Vector a -> [(Int, b)] -> Vector a
- RIO.Vector.Unboxed.Unsafe: unsafeAccumulate :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector (Int, b) -> Vector a
+ RIO.Vector.Unboxed.Unsafe: unsafeAccumulate :: (Unbox a, Unbox b) => a -> b -> a -> Vector a -> Vector (Int, b) -> Vector a
- RIO.Vector.Unboxed.Unsafe: unsafeAccumulate_ :: (Unbox a, Unbox b) => (a -> b -> a) -> Vector a -> Vector Int -> Vector b -> Vector a
+ RIO.Vector.Unboxed.Unsafe: unsafeAccumulate_ :: (Unbox a, Unbox b) => a -> b -> a -> Vector a -> Vector Int -> Vector b -> Vector a
- RIO.Vector.Unsafe: unsafeAccum :: Vector v a => (a -> b -> a) -> v a -> [(Int, b)] -> v a
+ RIO.Vector.Unsafe: unsafeAccum :: Vector v a => a -> b -> a -> v a -> [(Int, b)] -> v a
- RIO.Vector.Unsafe: unsafeAccumulate :: (Vector v a, Vector v (Int, b)) => (a -> b -> a) -> v a -> v (Int, b) -> v a
+ RIO.Vector.Unsafe: unsafeAccumulate :: (Vector v a, Vector v (Int, b)) => a -> b -> a -> v a -> v (Int, b) -> v a
- RIO.Vector.Unsafe: unsafeAccumulate_ :: (Vector v a, Vector v Int, Vector v b) => (a -> b -> a) -> v a -> v Int -> v b -> v a
+ RIO.Vector.Unsafe: unsafeAccumulate_ :: (Vector v a, Vector v Int, Vector v b) => a -> b -> a -> v a -> v Int -> v b -> v a

Files

ChangeLog.md view
@@ -1,5 +1,11 @@ # Changelog for rio +## 0.1.4.0++* Add `Const` and `Identity`+* Add `Reader` and `runReader`+* Add instances for `MonadWriter` and `MonadState` to `RIO` via mutable reference [#103](https://github.com/commercialhaskell/rio/issues/103)+ ## 0.1.3.0  * Add `newLogFunc` function to create `LogFunc` records outside of a callback scope
rio.cabal view
@@ -2,10 +2,10 @@ -- -- see: https://github.com/sol/hpack ----- hash: 09edf1a8b8f03bf2d61519411bfb56b861ab82c696bf58407444fcb13d0c4e04+-- hash: 11d51864811c17133c8f1aecfbec3086de7f37c755fad2fb3e2c54ed8b85f817  name:           rio-version:        0.1.3.0+version:        0.1.4.0 synopsis:       A standard library for Haskell description:    See README and Haddocks at <https://www.stackage.org/package/rio> category:       Control@@ -50,6 +50,7 @@       RIO.Set       RIO.Set.Partial       RIO.Set.Unchecked+      RIO.State       RIO.Text       RIO.Text.Lazy       RIO.Text.Lazy.Partial@@ -67,6 +68,7 @@       RIO.Vector.Unboxed.Partial       RIO.Vector.Unboxed.Unsafe       RIO.Vector.Unsafe+      RIO.Writer   other-modules:       RIO.Prelude.Display       RIO.Prelude.Extra@@ -117,6 +119,7 @@       RIO.LoggerSpec       RIO.Prelude.ExtraSpec       RIO.Prelude.IOSpec+      RIO.Prelude.RIOSpec       RIO.Prelude.SimpleSpec       RIO.PreludeSpec       RIO.TextSpec
src/RIO/Prelude/RIO.hs view
@@ -1,12 +1,31 @@+{-# LANGUAGE MultiParamTypeClasses #-}+{-# LANGUAGE FlexibleInstances #-} {-# LANGUAGE GeneralizedNewtypeDeriving #-} {-# LANGUAGE TypeFamilies #-}+{-# LANGUAGE FunctionalDependencies #-}+{-# LANGUAGE UndecidableInstances #-} module RIO.Prelude.RIO   ( RIO (..)   , runRIO   , liftRIO+  -- * SomeRef for Writer/State interfaces+  , SomeRef+  , HasStateRef (..)+  , HasWriteRef (..)+  , newSomeRef+  , newUnboxedSomeRef+  , readSomeRef+  , writeSomeRef+  , modifySomeRef   ) where +import GHC.Exts (RealWorld)++import RIO.Prelude.Lens+import RIO.Prelude.URef import RIO.Prelude.Reexports+import Control.Monad.State (MonadState(..))+import Control.Monad.Writer (MonadWriter(..))  -- | The Reader+IO monad. This is different from a 'ReaderT' because: --@@ -35,3 +54,105 @@ instance PrimMonad (RIO env) where     type PrimState (RIO env) = PrimState IO     primitive = RIO . ReaderT . const . primitive++-- | Abstraction over how to read from and write to a mutable reference+--+-- @since 0.1.4.0+data SomeRef a+  = SomeRef !(IO a) !(a -> IO ())++-- | Read from a SomeRef+--+-- @since 0.1.4.0+readSomeRef :: MonadIO m => SomeRef a -> m a+readSomeRef (SomeRef x _) = liftIO x++-- | Write to a SomeRef+--+-- @since 0.1.4.0+writeSomeRef :: MonadIO m => SomeRef a -> a -> m ()+writeSomeRef (SomeRef _ x) = liftIO . x++-- | Modify a SomeRef+-- This function is subject to change due to the lack of atomic operations+--+-- @since 0.1.4.0+modifySomeRef :: MonadIO m => SomeRef a -> (a -> a) -> m ()+modifySomeRef (SomeRef read write) f =+  liftIO $ (f <$> read) >>= write++ioRefToSomeRef :: IORef a -> SomeRef a+ioRefToSomeRef ref = do+  SomeRef (readIORef ref)+          (\val -> modifyIORef' ref (\_ -> val))++uRefToSomeRef :: Unbox a => URef RealWorld a -> SomeRef a+uRefToSomeRef ref = do+  SomeRef (readURef ref) (writeURef ref)++-- | Environment values with stateful capabilities to SomeRef+--+-- @since 0.1.4.0+class HasStateRef s env | env -> s where+  stateRefL :: Lens' env (SomeRef s)++-- | Identity state reference where the SomeRef is the env+--+-- @since 0.1.4.0+instance HasStateRef a (SomeRef a) where+  stateRefL = lens id (\_ x -> x)++-- | Environment values with writing capabilities to SomeRef+--+-- @since 0.1.4.0+class HasWriteRef w env | env -> w where+  writeRefL :: Lens' env (SomeRef w)++-- | Identity write reference where the SomeRef is the env+--+-- @since 0.1.4.0+instance HasWriteRef a (SomeRef a) where+  writeRefL = lens id (\_ x -> x)++instance HasStateRef s env => MonadState s (RIO env) where+  get = do+    ref <- view stateRefL+    liftIO $ readSomeRef ref+  put st = do+    ref <- view stateRefL+    liftIO $ writeSomeRef ref st++instance (Monoid w, HasWriteRef w env) => MonadWriter w (RIO env) where+  tell value = do+    ref <- view writeRefL+    liftIO $ modifySomeRef ref (`mappend` value)++  listen action = do+    w1 <- view writeRefL >>= liftIO . readSomeRef+    a <- action+    w2 <- do+      refEnv <- view writeRefL+      v <- liftIO $ readSomeRef refEnv+      _ <- liftIO $ writeSomeRef refEnv w1+      return v+    return (a, w2)++  pass action = do+    (a, transF) <- action+    ref <- view writeRefL+    liftIO $ modifySomeRef ref transF+    return a++-- | create a new boxed SomeRef+--+-- @since 0.1.4.0+newSomeRef :: MonadIO m => a -> m (SomeRef a)+newSomeRef a = do+  ioRefToSomeRef <$> newIORef a++-- | create a new unboxed SomeRef+--+-- @since 0.1.4.0+newUnboxedSomeRef :: (MonadIO m, Unbox a) => a -> m (SomeRef a)+newUnboxedSomeRef a =+  uRefToSomeRef <$> (liftIO $ newURef a)
src/RIO/Prelude/Reexports.hs view
@@ -49,10 +49,12 @@   , Control.Monad.Catch.MonadThrow(..)   , Control.Monad.Reader.MonadReader   , Control.Monad.Reader.MonadTrans(..)+  , Control.Monad.Reader.Reader   , Control.Monad.Reader.ReaderT(..)   , Control.Monad.Reader.ask   , Control.Monad.Reader.asks   , Control.Monad.Reader.local+  , Control.Monad.Reader.runReader   , Data.Bool.Bool(..)   , Data.Bool.bool   , Data.Bool.not@@ -112,6 +114,8 @@   , Data.Functor.void   , (Data.Functor.$>)   , (Data.Functor.<$>)+  , Data.Functor.Const.Const(..)+  , Data.Functor.Identity.Identity(..)   , Data.Hashable.Hashable   , Data.HashMap.Strict.HashMap   , Data.HashSet.HashSet@@ -230,6 +234,8 @@ import           Control.Monad.Catch      (MonadThrow) import           Control.Monad.Primitive  (PrimMonad (..)) import           Control.Monad.Reader     (MonadReader, ReaderT (..), ask, asks)+import           Control.Monad.State      (MonadState(..))+import           Control.Monad.Writer     (MonadWriter (..)) import           Data.Bool                (otherwise) import           Data.ByteString          (ByteString) import           Data.ByteString.Builder  (Builder)@@ -273,6 +279,8 @@ import qualified Data.Foldable import qualified Data.Function import qualified Data.Functor+import qualified Data.Functor.Const+import qualified Data.Functor.Identity import qualified Data.Hashable import qualified Data.HashMap.Strict import qualified Data.HashSet
+ src/RIO/State.hs view
@@ -0,0 +1,9 @@+-- | Provides reexports of 'MonadState' and related helpers.+--+-- @since 0.1.4.0+module RIO.State+  (+    Control.Monad.State.MonadState (..)+  ) where++import qualified Control.Monad.State
+ src/RIO/Writer.hs view
@@ -0,0 +1,9 @@+-- | Provides reexports of 'MonadWriter' and related helpers.+--+-- @since 0.1.4.0+module RIO.Writer+  (+    Control.Monad.Writer.MonadWriter (..)+  ) where++import qualified Control.Monad.Writer
+ test/RIO/Prelude/RIOSpec.hs view
@@ -0,0 +1,54 @@+{-# LANGUAGE OverloadedStrings #-}+{-# LANGUAGE NoImplicitPrelude #-}+{-# LANGUAGE ViewPatterns #-}+module RIO.Prelude.RIOSpec (spec) where++import RIO+import RIO.State+import RIO.Writer+import Test.Hspec+import Test.Hspec.QuickCheck++spec = do+  describe "RIO writer instance" $ do+    it "tell works" $ do+     ref <- newSomeRef (mempty :: Text)+     runRIO ref $ do+       tell "hello\n"+       tell "world\n"+     contents <- readSomeRef ref+     contents `shouldBe` "hello\nworld\n"++    it "listen works" $ do+      ref <- newSomeRef (mempty :: Text)+      ((), str) <- runRIO ref $ listen $ do+        tell "hello\n"+        tell "world\n"+      contents <- readSomeRef ref+      contents `shouldBe` ""+      str `shouldBe` "hello\nworld\n"++    it "pass works" $ do+      ref <- newSomeRef (mempty :: Text)+      result <- runRIO ref $ pass $ do+        tell "hello\n"+        tell "world\n"+        return ((), \a -> a <> "!")+      contents <- readSomeRef ref+      contents `shouldBe` "hello\nworld\n!"++  describe "RIO state instance" $ do+    it "get works" $ do+      ref <- newSomeRef (mempty :: Text)+      result <- runRIO ref $ do+        put "hello world"+        x <- get+        return x+      result `shouldBe` "hello world"++    it "state works" $ do+      ref <- newSomeRef (mempty :: Text)+      newRef <- newSomeRef ("Hello World!" :: Text)+      result <- runRIO ref $ state (\ref -> ((), "Hello World!"))+      contents <- readSomeRef ref+      contents `shouldBe` "Hello World!"