diff options
author | Hécate <hecate+gitlab@glitchbra.in> | 2020-04-02 08:04:24 +0200 |
---|---|---|
committer | Hécate <hecate+gitlab@glitchbra.in> | 2021-01-13 19:21:40 +0100 |
commit | 9fa3428967c777ea8801a13e427b20ff4c4d0d59 (patch) | |
tree | 4fc5f1387737edbae21cae52a19c85142146b625 /libraries/base/Data | |
parent | 0dba78410887ffc3d219639081e284ef7b67560a (diff) | |
download | haskell-9fa3428967c777ea8801a13e427b20ff4c4d0d59.tar.gz |
Remove references to ApplicativeDo in the base haddocks
Diffstat (limited to 'libraries/base/Data')
-rw-r--r-- | libraries/base/Data/Foldable.hs | 2 | ||||
-rw-r--r-- | libraries/base/Data/Functor.hs | 21 | ||||
-rw-r--r-- | libraries/base/Data/Void.hs | 11 |
3 files changed, 2 insertions, 32 deletions
diff --git a/libraries/base/Data/Foldable.hs b/libraries/base/Data/Foldable.hs index 9460cee2eb..a103d19d4a 100644 --- a/libraries/base/Data/Foldable.hs +++ b/libraries/base/Data/Foldable.hs @@ -602,7 +602,7 @@ class Foldable t where -- | The least element of a non-empty structure. -- -- This function is non-total and will raise a runtime exception if the - -- structure happens to be empty A structure that supports random access + -- structure happens to be empty. A structure that supports random access -- and maintains its elements in order should provide a specialised -- implementation to return the minimum in faster than linear time. -- diff --git a/libraries/base/Data/Functor.hs b/libraries/base/Data/Functor.hs index 9689a0e798..f79b5442e5 100644 --- a/libraries/base/Data/Functor.hs +++ b/libraries/base/Data/Functor.hs @@ -125,16 +125,6 @@ infixl 1 <&> -- | Flipped version of '<$'. -- --- Using @ApplicativeDo@: \'@as '$>' b@\' can be understood as the --- @do@ expression --- --- @ --- do as --- pure b --- @ --- --- with an inferred @Functor@ constraint. --- -- @since 4.7.0.0 -- -- ==== __Examples__ @@ -172,17 +162,6 @@ infixl 1 <&> -- | @'void' value@ discards or ignores the result of evaluation, such -- as the return value of an 'System.IO.IO' action. -- --- --- Using @ApplicativeDo@: \'@'void' as@\' can be understood as the --- @do@ expression --- --- @ --- do as --- pure () --- @ --- --- with an inferred @Functor@ constraint. --- -- ==== __Examples__ -- -- Replace the contents of a @'Data.Maybe.Maybe' 'Data.Int.Int'@ with unit: diff --git a/libraries/base/Data/Void.hs b/libraries/base/Data/Void.hs index 380720d6ee..299b4c78bf 100644 --- a/libraries/base/Data/Void.hs +++ b/libraries/base/Data/Void.hs @@ -80,16 +80,7 @@ absurd a = case a of {} -- | If 'Void' is uninhabited then any 'Functor' that holds only -- values of type 'Void' is holding no values. --- --- Using @ApplicativeDo@: \'@'vacuous' theVoid@\' can be understood as the --- @do@ expression --- --- @ --- do void <- theVoid --- pure (absurd void) --- @ --- --- with an inferred @Functor@ constraint. +-- It is implemented in terms of @fmap absurd@. -- -- @since 4.8.0.0 vacuous :: Functor f => f Void -> f a |