Fix warnings generated by purescript-0.8.0

Author: telser

src/Data/List.purs

@@ -22,7 +22,7 @@ module Data.List
   , null
   , length
 
-  , (:)
+  , (:), cons
   , snoc
   , insert
   , insertBy
@@ -71,7 +71,7 @@ module Data.List
   , unionBy
   , delete
   , deleteBy
-  , (\\)
+  , (\\), difference
   , intersect
   , intersectBy
 
@@ -88,20 +88,20 @@ module Data.List
   , fromList
   ) where
 
-import Prelude
+import Prelude (class Monad, class Bind, class Applicative, class Apply, class Functor, class Semigroup, class Ord, class Eq, class Show, Ordering(EQ, GT, LT), append, flip, (<*>), (<$>), (<>), pure, (<<<), ($), compare, (==), (&&), show, (++), (>>=), return, not, eq, (-), otherwise, (/=), id, bind, (+), one, (<), (<=), negate, (>))
 
-import Control.Alt (Alt, (<|>))
-import Control.Alternative (Alternative)
-import Control.Lazy (Lazy, defer)
-import Control.MonadPlus (MonadPlus)
-import Control.Plus (Plus)
+import Control.Alt (class Alt, (<|>))
+import Control.Alternative (class Alternative)
+import Control.Lazy (class Lazy, defer)
+import Control.MonadPlus (class MonadPlus)
+import Control.Plus (class Plus)
 
-import Data.Foldable (Foldable, foldl, foldr, any)
+import Data.Foldable (class Foldable, foldl, foldr, any)
 import Data.Maybe (Maybe(..))
-import Data.Monoid (Monoid, mempty)
-import Data.Traversable (Traversable, traverse, sequence)
+import Data.Monoid (class Monoid, mempty)
+import Data.Traversable (class Traversable, traverse, sequence)
 import Data.Tuple (Tuple(..))
-import Data.Unfoldable (Unfoldable, unfoldr)
+import Data.Unfoldable (class Unfoldable, unfoldr)
 
 -- | A strict linked list.
 -- |
@@ -132,11 +132,8 @@ fromFoldable = foldr Cons Nil
 singleton :: forall a. a -> List a
 singleton a = Cons a Nil
 
-infix 8 ..
-
 -- | An infix synonym for `range`.
-(..) :: Int -> Int -> List Int
-(..) = range
+infix 8 range as ..
 
 -- | Create a list containing a range of integers, including both endpoints.
 range :: Int -> Int -> List Int
@@ -196,14 +193,13 @@ length = foldl (\acc _ -> acc + 1) 0
 -- Extending arrays ------------------------------------------------------------
 --------------------------------------------------------------------------------
 
-infixr 6 :
-
 -- | An infix alias for `Cons`; attaches an element to the front of
 -- | a list.
 -- |
 -- | Running time: `O(1)`
-(:) :: forall a. a -> List a -> List a
-(:) = Cons
+cons :: forall a. a -> List a -> List a
+cons = Cons
+infixr 6 cons as :
 
 -- | Append an element to the end of an array, creating a new array.
 -- |
@@ -285,11 +281,8 @@ index Nil _ = Nothing
 index (Cons a _) 0 = Just a
 index (Cons _ as) i = index as (i - 1)
 
-infixl 8 !!
-
 -- | An infix synonym for `index`.
-(!!) :: forall a. List a -> Int -> Maybe a
-(!!) = index
+infixl 8 index as !!
 
 -- | Find the index of the first element equal to the specified element.
 elemIndex :: forall a. (Eq a) => a -> List a -> Maybe Int
@@ -614,13 +607,13 @@ deleteBy _ _ Nil = Nil
 deleteBy (==) x (Cons y ys) | x == y = ys
 deleteBy (==) x (Cons y ys) = Cons y (deleteBy (==) x ys)
 
-infix 5 \\
+infix 5 difference as \\
 
 -- | Delete the first occurrence of each element in the second list from the first list.
 -- |
 -- | Running time: `O(n^2)`
-(\\) :: forall a. (Eq a) => List a -> List a -> List a
-(\\) = foldl (flip delete)
+difference :: forall a. (Eq a) => List a -> List a -> List a
+difference = foldl (flip delete)
 
 -- | Calculate the intersection of two lists.
 -- |

src/Data/List/Lazy.purs

@@ -78,7 +78,7 @@ module Data.List.Lazy
   , unionBy
   , delete
   , deleteBy
-  , (\\)
+  , (\\), difference
   , intersect
   , intersectBy
 
@@ -94,21 +94,21 @@ module Data.List.Lazy
   , fromList
   ) where
 
-import Prelude
+import Prelude (class Monad, class Bind, class Applicative, class Apply, class Functor, class Semigroup, class Ord, class Eq, class Show, Ordering(EQ, GT, LT), append, flip, ap, (<*>), (<$>), pure, (<>), (<<<), ($), compare, (==), (++), show, otherwise, not, eq, (-), id, (>>=), (+), negate, (>))
 
-import Control.Alt (Alt)
-import Control.Alternative (Alternative)
-import Control.MonadPlus (MonadPlus)
-import Control.Plus (Plus)
-import qualified Control.Lazy as Z
+import Control.Alt (class Alt)
+import Control.Alternative (class Alternative)
+import Control.MonadPlus (class MonadPlus)
+import Control.Plus (class Plus)
+import Control.Lazy as Z
 
-import Data.Foldable (Foldable, foldMap, foldl, foldr, any)
+import Data.Foldable (class Foldable, foldMap, foldl, foldr, any)
 import Data.Lazy (Lazy(), defer, force)
 import Data.Maybe (Maybe(..), isNothing)
-import Data.Monoid (Monoid, mempty)
-import Data.Traversable (Traversable, traverse, sequence)
+import Data.Monoid (class Monoid, mempty)
+import Data.Traversable (class Traversable, traverse, sequence)
 import Data.Tuple (Tuple(..))
-import Data.Unfoldable (Unfoldable, unfoldr)
+import Data.Unfoldable (class Unfoldable, unfoldr)
 
 
 -- | A lazy linked list.
@@ -159,8 +159,7 @@ singleton :: forall a. a -> List a
 singleton a = cons a nil
 
 -- | An infix synonym for `range`.
-(..) :: Int -> Int -> List Int
-(..) = range
+infix 8 range as ..
 
 -- | Create a list containing a range of integers, including both endpoints.
 range :: Int -> Int -> List Int
@@ -211,14 +210,11 @@ length xs = go (step xs)
 cons :: forall a. a -> List a -> List a
 cons x xs = List $ defer \_ -> Cons x xs
 
-infixr 6 :
-
 -- | An infix alias for `cons`; attaches an element to the front of
 -- | a list.
 -- |
 -- | Running time: `O(1)`
-(:) :: forall a. a -> List a -> List a
-(:) = cons
+infixr 6 cons as :
 
 -- | Insert an element into a sorted list.
 -- |
@@ -299,11 +295,8 @@ index xs = go (step xs)
   go (Cons a _) 0 = Just a
   go (Cons _ as) i = go (step as) (i - 1)
 
-infixl 8 !!
-
 -- | An infix synonym for `index`.
-(!!) :: forall a. List a -> Int -> Maybe a
-(!!) = index
+infixl 8 index as !!
 
 -- | Insert an element into a list at the specified index, returning a new
 -- | list or `Nothing` if the index is out-of-bounds.
@@ -574,13 +567,12 @@ deleteBy eq x xs = List (go <$> runList xs)
   go (Cons y ys) | eq x y = step ys
                  | otherwise = Cons y (deleteBy eq x ys)
 
-infix 5 \\
-
 -- | Delete the first occurrence of each element in the second list from the first list.
 -- |
 -- | Running time: `O(n^2)`
-(\\) :: forall a. (Eq a) => List a -> List a -> List a
-(\\) = foldl (flip delete)
+difference :: forall a. (Eq a) => List a -> List a -> List a
+difference = foldl (flip delete)
+infix 5 difference as \\
 
 -- | Calculate the intersection of two lists.
 -- |

src/Data/List/Unsafe.purs

@@ -10,7 +10,6 @@ module Data.List.Unsafe
   , init
   ) where
 
-import Prelude
 import Data.List (List(..))
 
 -- | Get the first element of a non-empty list.

src/Data/List/ZipList.purs

@@ -6,16 +6,16 @@ module Data.List.ZipList
   , runZipList
   ) where
 
-import Prelude
+import Prelude (class Applicative, class Apply, class Functor, class Semigroup, class Ord, class Eq, class Show, append, (<<<), ($), map, (<$>), (++), compare, eq, show)
 
-import Control.Alt (Alt)
-import Control.Alternative (Alternative)
-import Control.Plus (Plus)
+import Control.Alt (class Alt)
+import Control.Alternative (class Alternative)
+import Control.Plus (class Plus)
 
-import Data.Foldable (Foldable, foldMap, foldl, foldr)
+import Data.Foldable (class Foldable, foldMap, foldl, foldr)
 import Data.List.Lazy (List(), repeat, zipWith)
-import Data.Monoid (Monoid, mempty)
-import Data.Traversable (Traversable, traverse, sequence)
+import Data.Monoid (class Monoid, mempty)
+import Data.Traversable (class Traversable, traverse, sequence)
 
 -- | `ZipList` is a newtype around `List` which provides a zippy
 -- | `Applicative` instance.