Update to v0.15.0 (#53)

* Update to v0.15.0

* Update package set to release version

* Update bower deps

Author: sigma-andex

bower.json

@@ -23,18 +23,18 @@
     "test"
   ],
   "dependencies": {
-    "purescript-prelude": "^5.0.0",
-    "purescript-tuples": "^6.0.0",
-    "purescript-unsafe-coerce": "^5.0.0",
-    "purescript-partial": "^3.0.0",
-    "purescript-maybe": "^5.0.0",
-    "purescript-lists": "^6.0.0",
-    "purescript-record": "^3.0.0",
-    "purescript-enums": "^5.0.0"
+    "purescript-prelude": "^6.0.0",
+    "purescript-tuples": "^7.0.0",
+    "purescript-unsafe-coerce": "^6.0.0",
+    "purescript-partial": "^4.0.0",
+    "purescript-maybe": "^6.0.0",
+    "purescript-lists": "^7.0.0",
+    "purescript-record": "^4.0.0",
+    "purescript-enums": "^6.0.0"
   },
   "devDependencies": {
-    "purescript-console": "^5.0.0",
-    "purescript-assert": "^5.0.0",
-    "purescript-either": "^5.0.0"
+    "purescript-console": "^6.0.0",
+    "purescript-assert": "^6.0.0",
+    "purescript-either": "^6.0.0"
   }
 }

packages.dhall

@@ -0,0 +1,5 @@
+let upstream =
+      https://github.com/purescript/package-sets/releases/download/psc-0.15.0-20220429/packages.dhall
+        sha256:03c682bff56fc8f9d8c495ffcc6f524cbd3c89fe04778f965265c08757de8c9d
+
+in  upstream

spago.dhall

@@ -0,0 +1,33 @@
+{-
+Welcome to a Spago project!
+You can edit this file as you like.
+
+Need help? See the following resources:
+- Spago documentation: https://github.com/purescript/spago
+- Dhall language tour: https://docs.dhall-lang.org/tutorials/Language-Tour.html
+
+When creating a new Spago project, you can use
+`spago init --no-comments` or `spago init -C`
+to generate this file without the comments in this block.
+-}
+{ name = "variant"
+, dependencies =
+  [ "assert"
+  , "console"
+  , "control"
+  , "effect"
+  , "either"
+  , "enums"
+  , "foldable-traversable"
+  , "lists"
+  , "maybe"
+  , "partial"
+  , "prelude"
+  , "record"
+  , "tuples"
+  , "type-equality"
+  , "unsafe-coerce"
+  ]
+, packages = ./packages.dhall
+, sources = [ "src/**/*.purs", "test/**/*.purs" ]
+}

src/Data/Functor/Variant.purs

@@ -75,9 +75,9 @@ instance functorVariantF ∷ Functor (VariantF r) where
 
 class FoldableVFRL :: RL.RowList (Type -> Type) -> Row (Type -> Type) -> Constraint
 class FoldableVFRL rl row | rl -> row where
-  foldrVFRL :: forall proxy a b. proxy rl -> (a -> b -> b) -> b -> VariantF row a -> b
-  foldlVFRL :: forall proxy a b. proxy rl -> (b -> a -> b) -> b -> VariantF row a -> b
-  foldMapVFRL :: forall proxy a m. Monoid m => proxy rl -> (a -> m) -> VariantF row a -> m
+  foldrVFRL :: forall a b. Proxy rl -> (a -> b -> b) -> b -> VariantF row a -> b
+  foldlVFRL :: forall a b. Proxy rl -> (b -> a -> b) -> b -> VariantF row a -> b
+  foldMapVFRL :: forall a m. Monoid m => Proxy rl -> (a -> m) -> VariantF row a -> m
 
 instance foldableNil :: FoldableVFRL RL.Nil () where
   foldrVFRL _ _ _ = case_
@@ -99,7 +99,7 @@ instance foldableCons ::
 
 class TraversableVFRL :: RL.RowList (Type -> Type) -> Row (Type -> Type) -> Constraint
 class FoldableVFRL rl row <= TraversableVFRL rl row | rl -> row where
-  traverseVFRL :: forall proxy f a b. Applicative f => proxy rl -> (a -> f b) -> VariantF row a -> f (VariantF row b)
+  traverseVFRL :: forall f a b. Applicative f => Proxy rl -> (a -> f b) -> VariantF row a -> f (VariantF row b)
 
 instance traversableNil :: TraversableVFRL RL.Nil () where
   traverseVFRL _ _ = case_
@@ -134,11 +134,11 @@ instance traversableVariantF ::
 -- | maybeAtFoo = inj (Proxy :: Proxy "foo") (Just 42)
 -- | ```
 inj
-  ∷ ∀ proxy sym f a r1 r2
+  ∷ ∀ sym f a r1 r2
   . R.Cons sym f r1 r2
   ⇒ IsSymbol sym
   ⇒ Functor f
-  ⇒ proxy sym
+  ⇒ Proxy sym
   → f a
   → VariantF r2 a
 inj p value = coerceV $ VariantFRep { type: reflectSymbol p, value, map: Mapper map }
@@ -153,11 +153,11 @@ inj p value = coerceV $ VariantFRep { type: reflectSymbol p, value, map: Mapper
 -- |   _ -> 0
 -- | ```
 prj
-  ∷ ∀ proxy sym f a r1 r2 g
+  ∷ ∀ sym f a r1 r2 g
   . R.Cons sym f r1 r2
   ⇒ Alternative g
   ⇒ IsSymbol sym
-  ⇒ proxy sym
+  ⇒ Proxy sym
   → VariantF r2 a
   → g (f a)
 prj p = on p pure (const empty)
@@ -166,10 +166,10 @@ prj p = on p pure (const empty)
 -- | The failure branch receives the provided variant, but with the label
 -- | removed.
 on
-  ∷ ∀ proxy sym f a b r1 r2
+  ∷ ∀ sym f a b r1 r2
   . R.Cons sym f r1 r2
   ⇒ IsSymbol sym
-  ⇒ proxy sym
+  ⇒ Proxy sym
   → (f a → b)
   → (VariantF r1 a → b)
   → VariantF r2 a
@@ -455,11 +455,11 @@ contract v =
   coerceR = unsafeCoerce
 
 type UnvariantF' r a x =
-  ∀ proxy s f o
+  ∀ s f o
   . IsSymbol s
   ⇒ R.Cons s f o r
   ⇒ Functor f
-  ⇒ proxy s
+  ⇒ Proxy s
   → f a
   → x
 
@@ -484,12 +484,12 @@ unvariantF v = case (unsafeCoerce v ∷ VariantFRep UnknownF Unit) of
         o.value
   where
   coerce
-    ∷ ∀ proxy x
+    ∷ ∀ x
     . UnvariantF' r a x
-    → { reflectSymbol ∷ proxy "" → String }
+    → { reflectSymbol ∷ Proxy "" → String }
     → {}
     → { map ∷ Mapper UnknownF }
-    → proxy ""
+    → Proxy ""
     → UnknownF Unit
     → x
   coerce = unsafeCoerce

src/Data/Variant.purs

@@ -50,10 +50,10 @@ foreign import data Variant ∷ Row Type → Type
 -- | intAtFoo = inj (Proxy :: Proxy "foo") 42
 -- | ```
 inj
-  ∷ ∀ proxy sym a r1 r2
+  ∷ ∀ sym a r1 r2
   . R.Cons sym a r1 r2
   ⇒ IsSymbol sym
-  ⇒ proxy sym
+  ⇒ Proxy sym
   → a
   → Variant r2
 inj p value = coerceV $ VariantRep { type: reflectSymbol p, value }
@@ -68,11 +68,11 @@ inj p value = coerceV $ VariantRep { type: reflectSymbol p, value }
 -- |   Nothing -> 0
 -- | ```
 prj
-  ∷ ∀ proxy sym a r1 r2 f
+  ∷ ∀ sym a r1 r2 f
   . R.Cons sym a r1 r2
   ⇒ IsSymbol sym
   ⇒ Alternative f
-  ⇒ proxy sym
+  ⇒ Proxy sym
   → Variant r2
   → f a
 prj p = on p pure (const empty)
@@ -81,10 +81,10 @@ prj p = on p pure (const empty)
 -- | The failure branch receives the provided variant, but with the label
 -- | removed.
 on
-  ∷ ∀ proxy sym a b r1 r2
+  ∷ ∀ sym a b r1 r2
   . R.Cons sym a r1 r2
   ⇒ IsSymbol sym
-  ⇒ proxy sym
+  ⇒ Proxy sym
   → (a → b)
   → (Variant r1 → b)
   → Variant r2
@@ -337,10 +337,10 @@ contract v =
   coerceR = unsafeCoerce
 
 type Unvariant' r x =
-  ∀ proxy s t o
+  ∀ s t o
   . IsSymbol s
   ⇒ R.Cons s t o r
-  ⇒ proxy s
+  ⇒ Proxy s
   → t
   → x
 
@@ -360,11 +360,11 @@ unvariant v = case (unsafeCoerce v ∷ VariantRep Unit) of
       coerce f { reflectSymbol: const o.type } {} Proxy o.value
   where
   coerce
-    ∷ ∀ proxy x
+    ∷ ∀ x
     . Unvariant' r x
-    → { reflectSymbol ∷ proxy "" → String }
+    → { reflectSymbol ∷ Proxy "" → String }
     → {}
-    → proxy ""
+    → Proxy ""
     → Unit
     → x
   coerce = unsafeCoerce
@@ -375,7 +375,7 @@ revariant (Unvariant f) = f inj
 
 class VariantEqs :: RL.RowList Type -> Constraint
 class VariantEqs rl where
-  variantEqs ∷ forall proxy. proxy rl → L.List (VariantCase → VariantCase → Boolean)
+  variantEqs ∷ Proxy rl → L.List (VariantCase → VariantCase → Boolean)
 
 instance eqVariantNil ∷ VariantEqs RL.Nil where
   variantEqs _ = L.Nil
@@ -399,7 +399,7 @@ instance eqVariant ∷ (RL.RowToList r rl, VariantTags rl, VariantEqs rl) ⇒ Eq
 
 class VariantBounded :: RL.RowList Type -> Constraint
 class VariantBounded rl where
-  variantBounded ∷ forall proxy. proxy rl → L.List (BoundedDict VariantCase)
+  variantBounded ∷ Proxy rl → L.List (BoundedDict VariantCase)
 
 instance boundedVariantNil ∷ VariantBounded RL.Nil where
   variantBounded _ = L.Nil
@@ -435,7 +435,7 @@ instance boundedVariant ∷ (RL.RowToList r rl, VariantTags rl, VariantEqs rl, V
 
 class VariantBoundedEnums :: RL.RowList Type -> Constraint
 class VariantBounded rl ⇐ VariantBoundedEnums rl where
-  variantBoundedEnums ∷ forall proxy. proxy rl → L.List (BoundedEnumDict VariantCase)
+  variantBoundedEnums ∷ Proxy rl → L.List (BoundedEnumDict VariantCase)
 
 instance enumVariantNil ∷ VariantBoundedEnums RL.Nil where
   variantBoundedEnums _ = L.Nil
@@ -507,7 +507,7 @@ instance boundedEnumVariant ∷ (RL.RowToList r rl, VariantTags rl, VariantEqs r
 
 class VariantOrds :: RL.RowList Type -> Constraint
 class VariantOrds rl where
-  variantOrds ∷ forall proxy. proxy rl → L.List (VariantCase → VariantCase → Ordering)
+  variantOrds ∷ Proxy rl → L.List (VariantCase → VariantCase → Ordering)
 
 instance ordVariantNil ∷ VariantOrds RL.Nil where
   variantOrds _ = L.Nil
@@ -531,7 +531,7 @@ instance ordVariant ∷ (RL.RowToList r rl, VariantTags rl, VariantEqs rl, Varia
 
 class VariantShows :: RL.RowList Type -> Constraint
 class VariantShows rl where
-  variantShows ∷ forall proxy. proxy rl → L.List (VariantCase → String)
+  variantShows ∷ Proxy rl → L.List (VariantCase → String)
 
 instance showVariantNil ∷ VariantShows RL.Nil where
   variantShows _ = L.Nil

src/Data/Variant/Internal.purs

@@ -138,7 +138,7 @@ foreign import data VariantFCase ∷ Type → Type
 
 class VariantTags :: forall k. RL.RowList k -> Constraint
 class VariantTags rl where
-  variantTags ∷ forall proxy. proxy rl → L.List String
+  variantTags ∷ Proxy rl → L.List String
 
 instance variantTagsNil ∷ VariantTags RL.Nil where
   variantTags _ = L.Nil