Merge pull request #5 from zrho/master

Wander, some Folds and ALens; corrected.

Author: paf31

bower.json

@@ -21,6 +21,7 @@
     "purescript-const": "~0.5.0",
     "purescript-identity": "~0.4.0",
     "purescript-profunctor": "~0.3.0",
-    "purescript-lists": "~0.7.0"
+    "purescript-lists": "~0.7.0",
+    "purescript-unsafe-coerce": "~0.1.0"
   }
 }

docs/Data/Lens.md

@@ -10,5 +10,6 @@ This module re-exports types and functions from other modules:
 - [`module Data.Lens.Setter`](Lens/Setter.md)
 - [`module Data.Lens.Getter`](Lens/Getter.md)
 - [`module Data.Lens.Fold`](Lens/Fold.md)
+- [`module Data.Lens.Common`](Lens/Common.md)
 
 

docs/Data/Lens/Common.md

@@ -0,0 +1,67 @@
+## Module Data.Lens.Common
+
+This module defines common lenses and prisms.
+
+#### `_Nothing`
+
+``` purescript
+_Nothing :: forall a b. Prism (Maybe a) (Maybe b) Unit Unit
+```
+
+#### `_Just`
+
+``` purescript
+_Just :: forall a b. Prism (Maybe a) (Maybe b) a b
+```
+
+Prism for the `Just` constructor of `Maybe`.
+
+#### `_Left`
+
+``` purescript
+_Left :: forall a b c. Prism (Either a c) (Either b c) a b
+```
+
+Prism for the `Left` constructor of `Either`.
+
+#### `_Right`
+
+``` purescript
+_Right :: forall a b c. Prism (Either c a) (Either c b) a b
+```
+
+Prism for the `Right` constructor of `Either`.
+
+#### `_1`
+
+``` purescript
+_1 :: forall a b c. Lens (Tuple a c) (Tuple b c) a b
+```
+
+Lens for the first component of a `Tuple`.
+
+#### `_2`
+
+``` purescript
+_2 :: forall a b c. Lens (Tuple c a) (Tuple c b) a b
+```
+
+Lens for the second component of a `Tuple`.
+
+#### `united`
+
+``` purescript
+united :: forall a. LensP a Unit
+```
+
+There is a `Unit` in everything.
+
+#### `devoid`
+
+``` purescript
+devoid :: forall a. LensP Void a
+```
+
+There is everything in `Void`.
+
+

docs/Data/Lens/Fold.md

@@ -52,6 +52,127 @@ foldlOf :: forall s t a b r. Fold (Dual (Endo r)) s t a b -> (r -> a -> r) -> r
 
 Left fold over a `Fold`.
 
+#### `allOf`
+
+``` purescript
+allOf :: forall s t a b r. (BooleanAlgebra r) => Fold (Conj r) s t a b -> (a -> r) -> s -> r
+```
+
+Whether all foci of a `Fold` satisfy a predicate.
+
+#### `anyOf`
+
+``` purescript
+anyOf :: forall s t a b r. (BooleanAlgebra r) => Fold (Disj r) s t a b -> (a -> r) -> s -> r
+```
+
+Whether any focus of a `Fold` satisfies a predicate.
+
+#### `andOf`
+
+``` purescript
+andOf :: forall s t a b. (BooleanAlgebra a) => Fold (Conj a) s t a b -> s -> a
+```
+
+The conjunction of all foci of a `Fold`.
+
+#### `orOf`
+
+``` purescript
+orOf :: forall s t a b. (BooleanAlgebra a) => Fold (Disj a) s t a b -> s -> a
+```
+
+The disjunction of all foci of a `Fold`.
+
+#### `elemOf`
+
+``` purescript
+elemOf :: forall s t a b. (Eq a) => Fold (Disj Boolean) s t a b -> a -> s -> Boolean
+```
+
+Whether a `Fold` contains a given element.
+
+#### `notElemOf`
+
+``` purescript
+notElemOf :: forall s t a b. (Eq a) => Fold (Conj Boolean) s t a b -> a -> s -> Boolean
+```
+
+Whether a `Fold` not contains a given element.
+
+#### `sumOf`
+
+``` purescript
+sumOf :: forall s t a b. (Semiring a) => Fold (Additive a) s t a b -> s -> a
+```
+
+The sum of all foci of a `Fold`.
+
+#### `productOf`
+
+``` purescript
+productOf :: forall s t a b. (Semiring a) => Fold (Multiplicative a) s t a b -> s -> a
+```
+
+The product of all foci of a `Fold`.
+
+#### `lengthOf`
+
+``` purescript
+lengthOf :: forall s t a b. Fold (Additive Int) s t a b -> s -> Int
+```
+
+The number of foci of a `Fold`.
+
+#### `firstOf`
+
+``` purescript
+firstOf :: forall s t a b. Fold (First a) s t a b -> s -> Maybe a
+```
+
+The first focus of a `Fold`, if there is any. Synonym for `preview`.
+
+#### `lastOf`
+
+``` purescript
+lastOf :: forall s t a b. Fold (Last a) s t a b -> s -> Maybe a
+```
+
+The last focus of a `Fold`, if there is any.
+
+#### `maximumOf`
+
+``` purescript
+maximumOf :: forall s t a b. (Ord a) => Fold (Endo (Maybe a)) s t a b -> s -> Maybe a
+```
+
+The maximum of all foci of a `Fold`, if there is any.
+
+#### `minimumOf`
+
+``` purescript
+minimumOf :: forall s t a b. (Ord a) => Fold (Endo (Maybe a)) s t a b -> s -> Maybe a
+```
+
+The minimum of all foci of a `Fold`, if there is any.
+
+#### `findOf`
+
+``` purescript
+findOf :: forall s t a b. Fold (Endo (Maybe a)) s t a b -> (a -> Boolean) -> s -> Maybe a
+```
+
+Find the first focus of a `Fold` that satisfies a predicate, if there is any.
+
+#### `sequenceOf_`
+
+``` purescript
+sequenceOf_ :: forall f s t a b. (Applicative f) => Fold (Endo (f Unit)) s t (f a) b -> s -> f Unit
+```
+
+Sequence the foci of a `Fold`, pulling out an `Applicative`, and ignore
+the result. If you need the result, see `sequenceOf` for `Traversal`s.
+
 #### `toListOf`
 
 ``` purescript
@@ -86,4 +207,20 @@ hasn't :: forall s t a b r. (BooleanAlgebra r) => Fold (Conj r) s t a b -> s ->
 
 Determines whether a `Fold` does not have a focus.
 
+#### `filtered`
+
+``` purescript
+filtered :: forall p a. (Choice p) => (a -> Boolean) -> OpticP p a a
+```
+
+Filters on a predicate.
+
+#### `replicated`
+
+``` purescript
+replicated :: forall r a b t f. (Applicative f, Contravariant f) => Int -> Optic (Star f) a b a t
+```
+
+Replicates the elements of a fold.
+
 

docs/Data/Lens/Internal/Shop.md

@@ -0,0 +1,20 @@
+## Module Data.Lens.Internal.Shop
+
+This module defines the `Shop` profunctor
+
+#### `Shop`
+
+``` purescript
+data Shop a b s t
+  = Shop (s -> a) (s -> b -> t)
+```
+
+The `Shop` profunctor characterizes a `Lens`.
+
+##### Instances
+``` purescript
+instance profunctorShop :: Profunctor (Shop a b)
+instance strongShop :: Strong (Shop a b)
+```
+
+

docs/Data/Lens/Internal/Void.md

@@ -0,0 +1,23 @@
+## Module Data.Lens.Internal.Void
+
+This module defines the empty `Void` type.
+
+#### `Void`
+
+``` purescript
+data Void
+```
+
+#### `absurd`
+
+``` purescript
+absurd :: forall a. Void -> a
+```
+
+#### `coerce`
+
+``` purescript
+coerce :: forall f a b. (Contravariant f, Functor f) => f a -> f b
+```
+
+

docs/Data/Lens/Internal/Wander.md

@@ -6,9 +6,11 @@ This module defines the `Wander` type class, which is used to define `Traversal`
 
 ``` purescript
 class (Strong p, Choice p) <= Wander p where
-  wander :: forall t a b. (Traversable t) => p a b -> p (t a) (t b)
+  wander :: forall f s t a b. (forall f. (Applicative f) => (a -> f b) -> s -> f t) -> p a b -> p s t
 ```
 
+Class for profunctors that support polymorphic traversals.
+
 ##### Instances
 ``` purescript
 instance wanderFunction :: Wander Function

docs/Data/Lens/Lens.md

@@ -16,4 +16,16 @@ lens :: forall s t a b. (s -> a) -> (s -> b -> t) -> Lens s t a b
 
 Create a `Lens` from a getter/setter pair.
 
+#### `withLens`
+
+``` purescript
+withLens :: forall s t a b r. ALens s t a b -> ((s -> a) -> (s -> b -> t) -> r) -> r
+```
+
+#### `cloneLens`
+
+``` purescript
+cloneLens :: forall s t a b. ALens s t a b -> Lens s t a b
+```
+
 

docs/Data/Lens/Traversal.md

@@ -2,20 +2,38 @@
 
 This module defines functions for working with traversals.
 
-#### `traverse`
+#### `traversed`
 
 ``` purescript
-traverse :: forall t a b. (Traversable t) => Traversal (t a) (t b) a b
+traversed :: forall t a b. (Traversable t) => Traversal (t a) (t b) a b
 ```
 
 Create a `Traversal` which traverses the elements of a `Traversable` functor.
 
 #### `traverseOf`
 
 ``` purescript
-traverseOf :: forall f s t a b. (Applicative f) => Traversal s t a b -> (a -> f b) -> s -> f t
+traverseOf :: forall f s t a b. (Applicative f) => Optic (Star f) s t a b -> (a -> f b) -> s -> f t
 ```
 
 Turn a pure profunctor `Traversal` into a `lens`-like `Traversal`.
 
+#### `sequenceOf`
+
+``` purescript
+sequenceOf :: forall f s t a. (Applicative f) => Optic (Star f) s t (f a) a -> s -> f t
+```
+
+Sequence the foci of a `Traversal`, pulling out an `Applicative` effect.
+If you do not need the result, see `sequenceOf_` for `Fold`s.
+
+#### `failover`
+
+``` purescript
+failover :: forall f s t a b. (Alternative f) => Optic (Star (Tuple (Disj Boolean))) s t a b -> (a -> b) -> s -> f t
+```
+
+Tries to map over a `Traversal`; returns `empty`, if the traversal did
+not have any new focus.
+
 

docs/Data/Lens/Types.md

@@ -56,6 +56,18 @@ A lens.
 type LensP s a = Lens s s a a
 ```
 
+#### `ALens`
+
+``` purescript
+type ALens s t a b = Optic (Shop a b) s t a b
+```
+
+#### `ALensP`
+
+``` purescript
+type ALensP s a = ALens s s a a
+```
+
 #### `Prism`
 
 ``` purescript