Update for psc 0.10.

Author: bodil

bower.json

@@ -18,13 +18,13 @@
     "package.json"
   ],
   "dependencies": {
-    "purescript-foldable-traversable": "^1.0.0",
-    "purescript-identity": "^1.1.0",
-    "purescript-arrays": "^1.0.0",
-    "purescript-either": "^1.0.0"
+    "purescript-foldable-traversable": "^2.0.0",
+    "purescript-identity": "^2.0.0",
+    "purescript-arrays": "^3.0.0",
+    "purescript-either": "^2.0.0"
   },
   "devDependencies": {
-    "purescript-assert": "^1.0.0",
-    "purescript-console": "^1.0.0"
+    "purescript-assert": "^2.0.0",
+    "purescript-console": "^2.0.0"
   }
 }

src/Data/Filterable.purs

@@ -17,7 +17,7 @@ import Prelude (const)
 import Control.Category ((<<<), id)
 import Control.Bind ((=<<))
 import Data.Semigroup ((<>))
-import Data.Functor (class Functor, (<$>))
+import Data.Functor (class Functor)
 import Data.Foldable (foldl)
 import Data.Monoid (class Monoid, mempty)
 import Data.Maybe (Maybe(..))

src/Data/Witherable.purs

@@ -14,11 +14,12 @@ import Data.Unit (unit)
 import Control.Category ((<<<), id)
 import Control.Applicative (class Applicative, pure)
 import Data.Monoid (class Monoid, mempty)
-import Data.Identity (Identity(..), runIdentity)
+import Data.Identity (Identity(..))
 import Data.Filterable (class Filterable, partitioned, filtered)
 import Data.Functor (map)
 import Data.Either (Either(..))
 import Data.Maybe (Maybe(..))
+import Data.Newtype (unwrap)
 import Data.Traversable (class Traversable, traverse)
 
 -- | `Witherable` represents data structures which can be _partitioned_ with
@@ -55,12 +56,12 @@ class (Filterable t, Traversable t) <= Witherable t where
 -- | A default implementation of `parititonMap` given a `Witherable`.
 partitionMapByWilt :: forall t a l r. Witherable t =>
   (a -> Either l r) -> t a -> { left :: t l, right :: t r }
-partitionMapByWilt p = runIdentity <<< wilt (Identity <<< p)
+partitionMapByWilt p = unwrap <<< wilt (Identity <<< p)
 
 -- | A default implementation of `filterMap` given a `Witherable`.
 filterMapByWither :: forall t a b. Witherable t =>
   (a -> Maybe b) -> t a -> t b
-filterMapByWither p = runIdentity <<< wither (Identity <<< p)
+filterMapByWither p = unwrap <<< wither (Identity <<< p)
 
 -- | A default implementation of `traverse` given a `Witherable`.
 traverseByWither :: forall t m a b. (Witherable t, Applicative m) =>