Merge pull request #71 from purescript/compiler/0.12

Updates for PureScript 0.12

LICENSE

@@ -1,20 +1,26 @@
-The MIT License (MIT)
+Copyright 2018 PureScript
 
-Copyright (c) 2014 PureScript
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
 
-Permission is hereby granted, free of charge, to any person obtaining a copy of
-this software and associated documentation files (the "Software"), to deal in
-the Software without restriction, including without limitation the rights to
-use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
-the Software, and to permit persons to whom the Software is furnished to do so,
-subject to the following conditions:
+1. Redistributions of source code must retain the above copyright notice, this
+list of conditions and the following disclaimer.
 
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
+2. Redistributions in binary form must reproduce the above copyright notice,
+this list of conditions and the following disclaimer in the documentation and/or
+other materials provided with the distribution.
 
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
-FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
-COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
-IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
-CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+3. Neither the name of the copyright holder nor the names of its contributors
+may be used to endorse or promote products derived from this software without
+specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

bower.json

@@ -1,8 +1,7 @@
 {
   "name": "purescript-datetime",
   "homepage": "https://github.com/purescript/purescript-datetime",
-  "description": "PureScript library for date and time values",
-  "license": "MIT",
+  "license": "BSD-3-Clause",
   "repository": {
     "type": "git",
     "url": "git://github.com/purescript/purescript-datetime.git"
@@ -16,17 +15,27 @@
     "package.json"
   ],
   "dependencies": {
-    "purescript-enums": "^3.1.0",
-    "purescript-functions": "^3.0.0",
-    "purescript-generics": "^4.0.0",
-    "purescript-integers": "^3.0.0",
-    "purescript-foldable-traversable": "^3.0.0",
-    "purescript-maps": "^3.0.0",
-    "purescript-math": "^2.0.0"
+    "purescript-bifunctors": "^4.0.0",
+    "purescript-control": "^4.0.0",
+    "purescript-either": "^4.0.0",
+    "purescript-enums": "^4.0.0",
+    "purescript-foldable-traversable": "^4.0.0",
+    "purescript-functions": "^4.0.0",
+    "purescript-gen": "^2.0.0",
+    "purescript-integers": "^4.0.0",
+    "purescript-lists": "^5.0.0",
+    "purescript-math": "^2.1.1",
+    "purescript-maybe": "^4.0.0",
+    "purescript-newtype": "^3.0.0",
+    "purescript-ordered-collections": "^1.0.0",
+    "purescript-partial": "^2.0.0",
+    "purescript-prelude": "^4.0.0",
+    "purescript-tuples": "^5.0.0"
   },
   "devDependencies": {
-    "purescript-assert": "^3.0.0",
-    "purescript-console": "^3.0.0",
-    "purescript-strings": "^3.0.0"
+    "purescript-assert": "^4.0.0",
+    "purescript-console": "^4.0.0",
+    "purescript-strings": "^4.0.0",
+    "purescript-proxy": "^3.0.0"
   }
 }

package.json

@@ -3,12 +3,12 @@
   "scripts": {
     "clean": "rimraf output && rimraf .pulp-cache",
     "build": "eslint src && pulp build -- --censor-lib --strict",
-    "test": "pulp test"
+    "test": "pulp test --check-main-type Effect.Effect"
   },
   "devDependencies": {
-    "eslint": "^3.17.1",
-    "pulp": "^11.0.x",
-    "purescript-psa": "^0.5.x",
-    "rimraf": "^2.6.1"
+    "eslint": "^4.19.1",
+    "pulp": "^12.2.0",
+    "purescript-psa": "^0.6.0",
+    "rimraf": "^2.6.2"
   }
 }

src/Data/Date.purs

@@ -17,10 +17,8 @@ import Prelude
 import Data.Date.Component (Day, Month(..), Weekday(..), Year)
 import Data.Enum (toEnum, fromEnum)
 import Data.Function.Uncurried (Fn3, runFn3, Fn4, runFn4, Fn6, runFn6)
-import Data.Generic (class Generic)
 import Data.Maybe (Maybe(..), fromJust)
-import Data.Time.Duration (class Duration, toDuration, Milliseconds)
-
+import Data.Time.Duration (class Duration, Milliseconds, toDuration)
 import Partial.Unsafe (unsafePartial)
 
 -- | A date value in the Gregorian calendar.
@@ -45,7 +43,6 @@ exactDate y m d =
 
 derive instance eqDate :: Eq Date
 derive instance ordDate :: Ord Date
-derive instance genericDate :: Generic Date
 
 instance boundedDate :: Bounded Date where
   bottom = Date bottom bottom bottom
@@ -78,29 +75,30 @@ diff :: forall d. Duration d => Date -> Date -> d
 diff (Date y1 m1 d1) (Date y2 m2 d2) =
   toDuration $ runFn6 calcDiff y1 (fromEnum m1) d1 y2 (fromEnum m2) d2
 
--- | Is this year a leap year according to the proleptic Gregorian calendar?
+-- | Checks whether a year is a leap year according to the proleptic Gregorian
+-- | calendar.
 isLeapYear :: Year -> Boolean
 isLeapYear y = (mod y' 4 == 0) && ((mod y' 400 == 0) || not (mod y' 100 == 0))
   where
   y' = fromEnum y
 
--- | Get the final day of a month and year, accounting for leap years
+-- | Get the final day of a month and year, accounting for leap years.
 lastDayOfMonth :: Year -> Month -> Day
 lastDayOfMonth y m = case m of
-  January   -> unsafeDay 31
+  January -> unsafeDay 31
   February
     | isLeapYear y -> unsafeDay 29
-    | otherwise    -> unsafeDay 28
-  March     -> unsafeDay 31
-  April     -> unsafeDay 30
-  May       -> unsafeDay 31
-  June      -> unsafeDay 30
-  July      -> unsafeDay 31
-  August    -> unsafeDay 31
+    | otherwise -> unsafeDay 28
+  March -> unsafeDay 31
+  April -> unsafeDay 30
+  May -> unsafeDay 31
+  June -> unsafeDay 30
+  July -> unsafeDay 31
+  August -> unsafeDay 31
   September -> unsafeDay 30
-  October   -> unsafeDay 31
-  November  -> unsafeDay 30
-  December  -> unsafeDay 31
+  October -> unsafeDay 31
+  November -> unsafeDay 30
+  December -> unsafeDay 31
   where
     unsafeDay = unsafePartial fromJust <<< toEnum
 

src/Data/Date/Component.purs

@@ -8,7 +8,6 @@ module Data.Date.Component
 import Prelude
 
 import Data.Enum (class Enum, class BoundedEnum, toEnum, fromEnum, Cardinality(..))
-import Data.Generic (class Generic)
 import Data.Maybe (Maybe(..))
 
 -- | A year component for a date.
@@ -20,7 +19,6 @@ newtype Year = Year Int
 
 derive newtype instance eqYear :: Eq Year
 derive newtype instance ordYear :: Ord Year
-derive instance genericYear :: Generic Year
 
 -- Note: these seemingly arbitrary bounds come from relying on JS for date
 -- manipulations, as it only supports date ±100,000,000 days of the Unix epoch.
@@ -61,7 +59,6 @@ data Month
 
 derive instance eqMonth :: Eq Month
 derive instance ordMonth :: Ord Month
-derive instance genericMonth :: Generic Month
 
 instance boundedMonth :: Bounded Month where
   bottom = January
@@ -124,7 +121,6 @@ newtype Day = Day Int
 
 derive newtype instance eqDay :: Eq Day
 derive newtype instance ordDay :: Ord Day
-derive instance genericDay :: Generic Day
 
 instance boundedDay :: Bounded Day where
   bottom = Day 1
@@ -156,7 +152,6 @@ data Weekday
 
 derive instance eqWeekday :: Eq Weekday
 derive instance ordWeekday :: Ord Weekday
-derive instance genericWeekday :: Generic Weekday
 
 instance boundedWeekday :: Bounded Weekday where
   bottom = Monday

src/Data/DateTime.purs

@@ -17,7 +17,6 @@ import Prelude
 import Data.Date (Date, Day, Month(..), Weekday(..), Year, canonicalDate, day, exactDate, month, weekday, year)
 import Data.Enum (toEnum, fromEnum)
 import Data.Function.Uncurried (Fn2, runFn2)
-import Data.Generic (class Generic)
 import Data.Time (Hour, Millisecond, Minute, Second, Time(..), hour, setHour, millisecond, setMillisecond, minute, setMinute, second, setSecond)
 import Data.Time.Duration (class Duration, fromDuration, toDuration, Milliseconds)
 import Data.Maybe (Maybe(..))
@@ -27,7 +26,6 @@ data DateTime = DateTime Date Time
 
 derive instance eqDateTime :: Eq DateTime
 derive instance ordDateTime :: Ord DateTime
-derive instance genericDateTime :: Generic DateTime
 
 instance boundedDateTime :: Bounded DateTime where
   bottom = DateTime bottom bottom

src/Data/DateTime/Instant.purs

@@ -12,7 +12,6 @@ import Prelude
 import Data.DateTime (Millisecond, Second, Minute, Hour, Day, Year, DateTime(..), Date, Time(..), canonicalDate, millisecond, second, minute, hour, day, month, year)
 import Data.Enum (fromEnum, toEnum)
 import Data.Function.Uncurried (Fn7, runFn7)
-import Data.Generic (class Generic)
 import Data.Maybe (Maybe(..), fromJust)
 import Data.Time.Duration (Milliseconds(..))
 
@@ -27,7 +26,6 @@ newtype Instant = Instant Milliseconds
 
 derive newtype instance eqDateTime :: Eq Instant
 derive newtype instance ordDateTime :: Ord Instant
-derive instance genericDateTime :: Generic Instant
 
 instance boundedInstant :: Bounded Instant where
   bottom = Instant (Milliseconds (-8639977881600000.0))

src/Data/Interval.purs

@@ -1,7 +1,7 @@
 module Data.Interval
   ( Interval(..)
   , RecurringInterval(..)
-  , module DurationExports
+  , module Exports
   ) where
 
 import Prelude
@@ -11,7 +11,7 @@ import Data.Bifoldable (class Bifoldable, bifoldl, bifoldr, bifoldrDefault, bifo
 import Data.Bifunctor (class Bifunctor, bimap)
 import Data.Bitraversable (class Bitraversable, bitraverse, bisequenceDefault)
 import Data.Foldable (class Foldable, foldl, foldr, foldrDefault, foldMapDefaultL)
-import Data.Interval.Duration as DurationExports
+import Data.Interval.Duration (Duration(..), DurationComponent(..), day, hour, millisecond, minute, month, second, week, year) as Exports
 import Data.Maybe (Maybe)
 import Data.Traversable (class Traversable, traverse, sequenceDefault)
 
@@ -70,7 +70,7 @@ instance showInterval :: (Show d, Show a) => Show (Interval d a) where
   show (DurationOnly d) = "(DurationOnly " <> show d <> ")"
 
 instance functorInterval :: Functor (Interval d) where
-  map = bimap id
+  map = bimap identity
 
 instance bifunctorInterval :: Bifunctor Interval where
   bimap _ f (StartEnd x y) = StartEnd (f x) (f y)

src/Data/Interval/Duration.purs

@@ -14,7 +14,6 @@ module Data.Interval.Duration
 import Prelude
 
 import Data.Map as Map
-import Data.Monoid (class Monoid, mempty)
 import Data.Newtype (class Newtype)
 
 newtype Duration = Duration (Map.Map DurationComponent Number)

src/Data/Interval/Duration/Iso.purs

@@ -64,7 +64,7 @@ mkIsoDuration d = case fromList (checkValidIsoDuration d) of
 checkValidIsoDuration :: Duration -> List Error
 checkValidIsoDuration (Duration asMap) = check {asList, asMap}
   where
-  asList = reverse (Map.toAscUnfoldable asMap)
+  asList = reverse (Map.toUnfoldable asMap)
   check = fold
     [ checkWeekUsage
     , checkEmptiness