Merge pull request #34 from jacereda/master

Updates for 0.11

Author: joneshf

bower.json

@@ -23,12 +23,12 @@
     "tests"
   ],
   "dependencies": {
-    "purescript-const": "^2.0.0",
-    "purescript-distributive": "^2.0.0",
-    "purescript-profunctor": "^2.0.0"
+    "purescript-const": "^3.0.0",
+    "purescript-distributive": "^3.0.0",
+    "purescript-profunctor": "^3.0.0"
   },
   "devDependencies": {
-    "purescript-psci-support": "^2.0.0",
-    "purescript-console": "^2.0.0"
+    "purescript-psci-support": "^3.0.0",
+    "purescript-console": "^3.0.0"
   }
 }

package.json

@@ -23,9 +23,9 @@
     "test": "pulp test"
   },
   "devDependencies": {
-    "pulp": "^10.0.0",
-    "purescript": "^0.10.2",
-    "purescript-psa": "^0.4.0",
-    "rimraf": "^2.5.4"
+    "pulp": "^11.0.0",
+    "purescript": "^0.11.1",
+    "purescript-psa": "^0.5.0",
+    "rimraf": "^2.6.1"
   }
 }

src/Optic/Getter.purs

@@ -16,7 +16,7 @@ module Optic.Getter
 
   infixl 8 weiv as ^.
 
-  to :: forall a s f p. (Contravariant f, Functor f, Profunctor p) => (s -> a) -> p a (f a) -> p s (f s)
+  to :: forall a s f p. Contravariant f => Functor f => Profunctor p => (s -> a) -> p a (f a) -> p s (f s)
   to s2a = dimap s2a coerce
 
   view :: forall s a. Getting a s a -> s -> a

src/Optic/Laws/Lens.purs

@@ -8,7 +8,7 @@ module Optic.Laws.Lens where
   import Prelude (class Eq, (&&), (==))
 
   -- | A valid `Lens` satisfies all three of the following laws.
-  validLens :: forall s a. (Eq a, Eq s) => Lens' s a -> s -> a -> a -> a -> Boolean
+  validLens :: forall s a. Eq a => Eq s => Lens' s a -> s -> a -> a -> a -> Boolean
   validLens l s x y z = getSet l s && setGet l s x && setSet l s y z
 
   -- | If you get a value out, and then set it immediately back,

src/Optic/Prism.purs

@@ -26,7 +26,7 @@ module Optic.Prism
                  , const, not, pure, unit
                  )
 
-  clonePrism :: forall f p s t a b. (Applicative f, Choice p) => APrism  s t a b -> p a (f b) -> p s (f t)
+  clonePrism :: forall f p s t a b. Applicative f => Choice p => APrism  s t a b -> p a (f b) -> p s (f t)
   clonePrism stab = withPrism stab prism
 
   is :: forall s t a b. APrism s t a b -> s -> Boolean
@@ -48,7 +48,7 @@ module Optic.Prism
   only :: forall a. Eq a => a -> Prism' a Unit
   only x = nearly x ((==) x)
 
-  prism :: forall f p s t a b. (Applicative f, Choice p) => (b -> t) -> (s -> Either t a) -> p a (f b) -> p s (f t)
+  prism :: forall f p s t a b. Applicative f => Choice p => (b -> t) -> (s -> Either t a) -> p a (f b) -> p s (f t)
   prism b2t s2Eta pafb = dimap s2Eta (either pure ((<$>) b2t)) (right pafb)
 
   prism' :: forall s a b. (b -> s) -> (s -> Maybe a) -> Prism s s a b

src/Optic/Setter.purs

@@ -61,7 +61,7 @@ module Optic.Setter
   set' :: forall s a. ASetter' s a -> a -> s -> s
   set' sa a = unwrap <<< sa (Identity <<< const a)
 
-  sets :: forall p q f s t a b. (Profunctor p, Profunctor q, Settable f) => (p a b -> q s t) -> Optical p q f s t a b
+  sets :: forall p q f s t a b. Profunctor p => Profunctor q => Settable f => (p a b -> q s t) -> Optical p q f s t a b
   sets pab2qst = untaintedDot >>> pab2qst >>> taintedDot
 
   add :: forall s t a. Semiring a => ASetter s t a a -> a -> s -> t

src/Optic/Types.purs

@@ -20,18 +20,18 @@ module Optic.Types where
 
   type Getting r s a = (a -> Const r a) -> s -> Const r s
 
-  type Getter s a = forall f. (Contravariant f, Functor f) => (a -> f a) -> s -> f s
+  type Getter s a = forall f. Contravariant f => Functor f => (a -> f a) -> s -> f s
 
-  type Lens s t a b = forall f. (Functor f) => (a -> f b) -> s -> f t
+  type Lens s t a b = forall f. Functor f => (a -> f b) -> s -> f t
   type Lens' s a = Lens s s a a
 
   type Optical p q f s t a b = p a (f b) -> q s (f t)
   type Optical' p q f s a = Optical p q f s s a a
 
-  type Prism s t a b = forall f p. (Applicative f, Choice p) => p a (f b) -> p s (f t)
+  type Prism s t a b = forall f p. Applicative f => Choice p => p a (f b) -> p s (f t)
   type Prism' s a = Prism s s a a
 
-  type Setter s t a b = forall f. (Settable f) => (a -> f b) -> s -> f t
+  type Setter s t a b = forall f. Settable f => (a -> f b) -> s -> f t
   type Setter' s a = Setter s s a a
 
   type Setting p s t a b = p a (Identity b) -> s -> Identity t

test/Main.purs

@@ -5,7 +5,7 @@ module Test.Main where
 
   import Optic.Core
 
-  import Prelude (class Show, Unit, (#), ($), (+), (<>), bind, const, show)
+  import Prelude (class Show, Unit, (#), ($), (+), (<>), const, show, discard)
 
   newtype Foo bar baz = Foo
     { foo :: { bar :: bar }