Docs

Author: paf31

docs/Control.Alt.md

@@ -9,7 +9,7 @@ This module defines the `Alt` type class.
 
 ``` purescript
 class (Functor f) <= Alt f where
-  (<|>) :: forall a. f a -> f a -> f a
+  alt :: forall a. f a -> f a -> f a
 ```
 
 The `Alt` type class identifies an associative operation on a type
@@ -25,5 +25,13 @@ types of kind `* -> *`, like `Array` or `List`, rather than concrete types
 For example, the `Array` (`[]`) type is an instance of `Alt`, where
 `(<|>)` is defined to be concatenation.
 
+#### `(<|>)`
+
+``` purescript
+(<|>) :: forall f a. (Alt f) => f a -> f a -> f a
+```
+
+An infix version of `alt`.
+
 
 

docs/Control.Alternative.md

@@ -21,28 +21,5 @@ laws:
 - Distributivity: `(f <|> g) <*> x == (f <*> x) <|> (g <*> x)`
 - Annihilation: `empty <*> f = empty`
 
-#### `some`
-
-``` purescript
-some :: forall f a. (Alternative f, Lazy (f [a])) => f a -> f [a]
-```
-
-Attempt a computation multiple times, requiring at least one success.
-
-The `Lazy` constraint is used to generate the result lazily, to ensure
-termination.
-
-#### `many`
-
-``` purescript
-many :: forall f a. (Alternative f, Lazy (f [a])) => f a -> f [a]
-```
-
-Attempt a computation multiple times, returning as many successful results
-as possible (possibly zero).
-
-The `Lazy` constraint is used to generate the result lazily, to ensure
-termination.
-
 
 

docs/Control.Extend.md

@@ -9,7 +9,7 @@ This module defines the `Extend` type class and associated helper functions.
 
 ``` purescript
 class (Functor w) <= Extend w where
-  (<<=) :: forall b a. (w a -> b) -> w a -> w b
+  extend :: forall b a. (w a -> b) -> w a -> w b
 ```
 
 The `Extend` class defines the extension operator `(<<=)`
@@ -30,6 +30,14 @@ instance extendArr :: (Semigroup w) => Extend (Prim.Function w)
 ```
 
 
+#### `(<<=)`
+
+``` purescript
+(<<=) :: forall w a b. (Extend w) => (w a -> b) -> w a -> w b
+```
+
+An infix version of `extend`
+
 #### `(=>>)`
 
 ``` purescript
@@ -54,14 +62,6 @@ Forwards co-Kleisli composition.
 
 Backwards co-Kleisli composition.
 
-#### `extend`
-
-``` purescript
-extend :: forall b a w. (Extend w) => (w a -> b) -> w a -> w b
-```
-
-An alias for `(<<=)`.
-
 #### `duplicate`
 
 ``` purescript

docs/Control.Monad.md

@@ -5,22 +5,6 @@
 
 This module defines helper functions for working with `Monad` instances.
 
-#### `replicateM`
-
-``` purescript
-replicateM :: forall m a. (Monad m) => Int -> m a -> m [a]
-```
-
-Perform a monadic action `n` times collecting all of the results.
-
-#### `foldM`
-
-``` purescript
-foldM :: forall m a b. (Monad m) => (a -> b -> m a) -> a -> [b] -> m a
-```
-
-Perform a fold using a monadic step function.
-
 #### `when`
 
 ``` purescript
@@ -37,20 +21,5 @@ unless :: forall m. (Monad m) => Boolean -> m Unit -> m Unit
 
 Perform a monadic action unless a condition is true.
 
-#### `filterM`
-
-``` purescript
-filterM :: forall a m. (Monad m) => (a -> m Boolean) -> [a] -> m [a]
-```
-
-Filter where the predicate returns a monadic `Boolean`.
-
-For example:
-
-```purescript
-powerSet :: forall a. [a] -> [[a]]
-powerSet = filterM (const [true, false])
-```
-