Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
formatParseM :: MonadFail m => Format t -> String -> m ttime-compat Data.Time.Format.ISO8601.Compat Parse a value in the format
formatReadP :: Format t -> ReadP ttime-compat Data.Time.Format.ISO8601.Compat Read a value in the format
formatReadPExtension :: (FormatExtension -> Format t) -> ReadP ttime-compat Data.Time.Format.ISO8601.Compat Read a value in either extended or basic format
formatShow :: Format t -> t -> Stringtime-compat Data.Time.Format.ISO8601.Compat Show a value in the format, or error if unrepresentable
formatShowM :: Format t -> t -> Maybe Stringtime-compat Data.Time.Format.ISO8601.Compat Show a value in the format, if representable
for1Of_ :: Functor f => Getting (TraversedF r f) s a -> s -> (a -> f r) -> f ()diagrams-lib Diagrams.Prelude See forOf_ and traverse1Of_.
>>> for1Of_ both1 ("abc", "bcd") (\ks -> Map.fromList [ (k, ()) | k <- ks ]) fromList [('b',()),('c',())]for1Of_ :: Apply f => Fold1 s a -> s -> (a -> f r) -> f ()
forMOf :: LensLike (WrappedMonad m) s t a b -> s -> (a -> m b) -> m tdiagrams-lib Diagrams.Prelude forMOf is a flipped version of mapMOf, consistent with the definition of forM.
>>> forMOf both (1,3) $ \x -> [x, x + 1] [(1,3),(1,4),(2,3),(2,4)]
forM ≡ forMOf traverse forMOf l ≡ flip (mapMOf l) iforMOf l s ≡ forM l s . Indexed
forMOf :: Monad m => Iso s t a b -> s -> (a -> m b) -> m t forMOf :: Monad m => Lens s t a b -> s -> (a -> m b) -> m t forMOf :: Monad m => Traversal s t a b -> s -> (a -> m b) -> m t
forMOf_ :: Monad m => Getting (Sequenced r m) s a -> s -> (a -> m r) -> m ()diagrams-lib Diagrams.Prelude forMOf_ is mapMOf_ with two of its arguments flipped.
>>> forMOf_ both ("hello","world") putStrLn hello worldforM_ ≡ forMOf_ folded
forMOf_ :: Monad m => Getter s a -> s -> (a -> m r) -> m () forMOf_ :: Monad m => Fold s a -> s -> (a -> m r) -> m () forMOf_ :: Monad m => Lens' s a -> s -> (a -> m r) -> m () forMOf_ :: Monad m => Iso' s a -> s -> (a -> m r) -> m () forMOf_ :: Monad m => Traversal' s a -> s -> (a -> m r) -> m () forMOf_ :: Monad m => Prism' s a -> s -> (a -> m r) -> m ()
forOf :: LensLike f s t a b -> s -> (a -> f b) -> f tdiagrams-lib Diagrams.Prelude A version of traverseOf with the arguments flipped, such that:
>>> forOf each (1,2,3) print 1 2 3 ((),(),())
This function is only provided for consistency, flip is strictly more general.forOf ≡ flip forOf ≡ flip . traverseOf
for ≡ forOf traverse ifor l s ≡ for l s . Indexed
forOf :: Functor f => Iso s t a b -> s -> (a -> f b) -> f t forOf :: Functor f => Lens s t a b -> s -> (a -> f b) -> f t forOf :: Applicative f => Traversal s t a b -> s -> (a -> f b) -> f t
forOf_ :: Functor f => Getting (Traversed r f) s a -> s -> (a -> f r) -> f ()diagrams-lib Diagrams.Prelude Traverse over all of the targets of a Fold (or Getter), computing an Applicative (or Functor)-based answer, but unlike forOf do not construct a new structure. forOf_ generalizes for_ to work over any Fold. When passed a Getter, forOf_ can work over any Functor, but when passed a Fold, forOf_ requires an Applicative.
for_ ≡ forOf_ folded
>>> forOf_ both ("hello","world") putStrLn hello worldThe rather specific signature of forOf_ allows it to be used as if the signature was any of:iforOf_ l s ≡ forOf_ l s . Indexed
forOf_ :: Functor f => Getter s a -> s -> (a -> f r) -> f () forOf_ :: Applicative f => Fold s a -> s -> (a -> f r) -> f () forOf_ :: Functor f => Lens' s a -> s -> (a -> f r) -> f () forOf_ :: Functor f => Iso' s a -> s -> (a -> f r) -> f () forOf_ :: Applicative f => Traversal' s a -> s -> (a -> f r) -> f () forOf_ :: Applicative f => Prism' s a -> s -> (a -> f r) -> f ()