Merge pull request #61 from purescript/ps-0.11

Update for PureScript 0.11

Author: garyb

.eslintrc.json

@@ -0,0 +1,28 @@
+{
+  "parserOptions": {
+    "ecmaVersion": 5
+  },
+  "extends": "eslint:recommended",
+  "env": {
+    "commonjs": true
+  },
+  "rules": {
+    "strict": [2, "global"],
+    "block-scoped-var": 2,
+    "consistent-return": 2,
+    "eqeqeq": [2, "smart"],
+    "guard-for-in": 2,
+    "no-caller": 2,
+    "no-extend-native": 2,
+    "no-loop-func": 2,
+    "no-new": 2,
+    "no-param-reassign": 2,
+    "no-return-assign": 2,
+    "no-unused-expressions": 2,
+    "no-use-before-define": 2,
+    "radix": [2, "always"],
+    "indent": [2, 2],
+    "quotes": [2, "double"],
+    "semi": [2, "always"]
+  }
+}

.gitignore

@@ -1,7 +1,6 @@
 /.*
 !/.gitignore
-!/.jscsrc
-!/.jshintrc
+!/.eslintrc.json
 !/.travis.yml
 /bower_components/
 /node_modules/

.jscsrc

@@ -1,7 +1,7 @@
 language: node_js
 dist: trusty
 sudo: required
-node_js: 6
+node_js: stable
 env:
   - PATH=$HOME/purescript:$PATH
 install:

.jshintrc

@@ -17,13 +17,13 @@
     "package.json"
   ],
   "dependencies": {
-    "purescript-bifunctors": "^2.0.0",
-    "purescript-maybe": "^2.0.0"
+    "purescript-bifunctors": "^3.0.0",
+    "purescript-maybe": "^3.0.0"
   },
   "devDependencies": {
-    "purescript-assert": "^2.0.0",
-    "purescript-console": "^2.0.0",
-    "purescript-integers": "^2.0.0",
+    "purescript-assert": "^3.0.0",
+    "purescript-console": "^3.0.0",
+    "purescript-integers": "^3.0.0",
     "purescript-math": "^2.0.0"
   }
 }

.travis.yml

@@ -2,14 +2,13 @@
   "private": true,
   "scripts": {
     "clean": "rimraf output && rimraf .pulp-cache",
-    "build": "jshint src && jscs src && psa \"src/**/*.purs\" \"bower_components/purescript-*/**/*.purs\" --censor-lib --strict",
-    "test": "psc \"src/**/*.purs\" \"bower_components/purescript-*/**/*.purs\" \"test/**/*.purs\" && psc-bundle \"output/**/*.js\" --module Test.Main --main Test.Main | node"
+    "build": "eslint src && pulp build -- --censor-lib --strict",
+    "test": "pulp test"
   },
   "devDependencies": {
-    "jscs": "^2.8.0",
-    "jshint": "^2.9.1",
-    "pulp": "^8.2.0",
-    "purescript-psa": "^0.3.8",
-    "rimraf": "^2.5.0"
+    "eslint": "^3.17.1",
+    "pulp": "^10.0.4",
+    "purescript-psa": "^0.5.0-rc.1",
+    "rimraf": "^2.6.1"
   }
 }

bower.json

@@ -102,7 +102,8 @@ bifoldlDefault f g z p =
 -- | use in combination with `bifoldrDefault`.
 bifoldMapDefaultR
   :: forall p m a b
-   . (Bifoldable p, Monoid m)
+   . Bifoldable p
+  => Monoid m
   => (a -> m)
   -> (b -> m)
   -> p a b
@@ -115,7 +116,8 @@ bifoldMapDefaultR f g = bifoldr (append <<< f) (append <<< g) mempty
 -- | use in combination with `bifoldlDefault`.
 bifoldMapDefaultL
   :: forall p m a b
-   . (Bifoldable p, Monoid m)
+   . Bifoldable p
+  => Monoid m
   => (a -> m)
   -> (b -> m)
   -> p a b
@@ -124,14 +126,15 @@ bifoldMapDefaultL f g = bifoldl (\m a -> m <> f a) (\m b -> m <> g b) mempty
 
 
 -- | Fold a data structure, accumulating values in a monoidal type.
-bifold :: forall t m. (Bifoldable t, Monoid m) => t m m -> m
+bifold :: forall t m. Bifoldable t => Monoid m => t m m -> m
 bifold = bifoldMap id id
 
 -- | Traverse a data structure, accumulating effects using an `Applicative` functor,
 -- | ignoring the final result.
 bitraverse_
   :: forall t f a b c d
-   . (Bifoldable t, Applicative f)
+   . Bifoldable t
+  => Applicative f
   => (a -> f c)
   -> (b -> f d)
   -> t a b
@@ -141,7 +144,8 @@ bitraverse_ f g = bifoldr (applySecond <<< f) (applySecond <<< g) (pure unit)
 -- | A version of `bitraverse_` with the data structure as the first argument.
 bifor_
   :: forall t f a b c d
-   . (Bifoldable t, Applicative f)
+   . Bifoldable t
+  => Applicative f
   => t a b
   -> (a -> f c)
   -> (b -> f d)
@@ -152,15 +156,17 @@ bifor_ t f g = bitraverse_ f g t
 -- | ignoring the final result.
 bisequence_
   :: forall t f a b
-   . (Bifoldable t, Applicative f)
+   . Bifoldable t
+  => Applicative f
   => t (f a) (f b)
   -> f Unit
 bisequence_ = bitraverse_ id id
 
 -- | Test whether a predicate holds at any position in a data structure.
 biany
   :: forall t a b c
-   . (Bifoldable t, BooleanAlgebra c)
+   . Bifoldable t
+  => BooleanAlgebra c
   => (a -> c)
   -> (b -> c)
   -> t a b
@@ -170,7 +176,8 @@ biany p q = unwrap <<< bifoldMap (Disj <<< p) (Disj <<< q)
 -- | Test whether a predicate holds at all positions in a data structure.
 biall
   :: forall t a b c
-   . (Bifoldable t, BooleanAlgebra c)
+   . Bifoldable t
+  => BooleanAlgebra c
   => (a -> c)
   -> (b -> c)
   -> t a b

package.json

@@ -58,15 +58,17 @@ instance bitraversableWrap :: Bitraversable p => Bitraversable (Wrap p) where
 
 ltraverse
   :: forall t b c a f
-   . (Bitraversable t, Applicative f)
+   . Bitraversable t
+  => Applicative f
   => (a -> f c)
   -> t a b
   -> f (t c b)
 ltraverse f = bitraverse f pure
 
 rtraverse
   :: forall t b c a f
-   . (Bitraversable t, Applicative f)
+   . Bitraversable t
+  => Applicative f
   => (b -> f c)
   -> t a b
   -> f (t a c)
@@ -75,7 +77,8 @@ rtraverse = bitraverse pure
 -- | A default implementation of `bitraverse` using `bisequence` and `bimap`.
 bitraverseDefault
   :: forall t f a b c d
-   . (Bitraversable t, Applicative f)
+   . Bitraversable t
+  => Applicative f
   => (a -> f c)
   -> (b -> f d)
   -> t a b
@@ -85,15 +88,17 @@ bitraverseDefault f g t = bisequence (bimap f g t)
 -- | A default implementation of `bisequence` using `bitraverse`.
 bisequenceDefault
   :: forall t f a b
-   . (Bitraversable t, Applicative f)
+   . Bitraversable t
+  => Applicative f
   => t (f a) (f b)
   -> f (t a b)
 bisequenceDefault = bitraverse id id
 
 -- | Traverse a data structure, accumulating effects and results using an `Applicative` functor.
 bifor
   :: forall t f a b c d
-   . (Bitraversable t, Applicative f)
+   . Bitraversable t
+  => Applicative f
   => t a b
   -> (a -> f c)
   -> (b -> f d)
@@ -102,15 +107,17 @@ bifor t f g = bitraverse f g t
 
 lfor
   :: forall t b c a f
-   . (Bitraversable t, Applicative f)
+   . Bitraversable t
+  => Applicative f
   => t a b
   -> (a -> f c)
   -> f (t c b)
 lfor t f = bitraverse f pure t
 
 rfor
   :: forall t b c a f
-   . (Bitraversable t, Applicative f)
+   . Bitraversable t
+  => Applicative f
   => t a b
   -> (b -> f c)
   -> f (t a c)