Skip to content
This repository has been archived by the owner on Oct 4, 2020. It is now read-only.

Commit

Permalink
Merge pull request #22 from purescript/unused-imports
Browse files Browse the repository at this point in the history
Remove unused imports
  • Loading branch information
garyb committed Nov 1, 2015
2 parents 028fe10 + dda17c1 commit 1b40960
Show file tree
Hide file tree
Showing 6 changed files with 16 additions and 11 deletions.
5 changes: 3 additions & 2 deletions src/Data/Monoid/Additive.purs
Original file line number Diff line number Diff line change
Expand Up @@ -4,8 +4,9 @@ import Prelude

import Control.Comonad (Comonad)
import Control.Extend (Extend)
import Data.Functor.Invariant (Invariant, imap)
import Data.Monoid

import Data.Functor.Invariant (Invariant)
import Data.Monoid (Monoid)

-- | Monoid and semigroup for semirings under addition.
-- |
Expand Down
3 changes: 2 additions & 1 deletion src/Data/Monoid/Conj.purs
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,8 @@ import Prelude

import Control.Comonad (Comonad)
import Control.Extend (Extend)
import Data.Monoid

import Data.Monoid (Monoid)

-- | Monoid under conjuntion.
-- |
Expand Down
3 changes: 2 additions & 1 deletion src/Data/Monoid/Disj.purs
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,8 @@ import Prelude

import Control.Comonad (Comonad)
import Control.Extend (Extend)
import Data.Monoid

import Data.Monoid (Monoid)

-- | Monoid under disjuntion.
-- |
Expand Down
7 changes: 4 additions & 3 deletions src/Data/Monoid/Dual.purs
Original file line number Diff line number Diff line change
Expand Up @@ -4,8 +4,9 @@ import Prelude

import Control.Comonad (Comonad)
import Control.Extend (Extend)
import Data.Functor.Invariant (Invariant, imap)
import Data.Monoid

import Data.Functor.Invariant (Invariant)
import Data.Monoid (Monoid, mempty)

-- | The dual of a monoid.
-- |
Expand All @@ -20,7 +21,7 @@ runDual (Dual x) = x

instance eqDual :: (Eq a) => Eq (Dual a) where
eq (Dual x) (Dual y) = x == y

instance ordDual :: (Ord a) => Ord (Dual a) where
compare (Dual x) (Dual y) = compare x y

Expand Down
4 changes: 2 additions & 2 deletions src/Data/Monoid/Endo.purs
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,8 @@ module Data.Monoid.Endo where

import Prelude

import Data.Functor.Invariant (Invariant, imap)
import Data.Monoid
import Data.Functor.Invariant (Invariant)
import Data.Monoid (Monoid)

-- | Monoid of endomorphisms under composition.
-- |
Expand Down
5 changes: 3 additions & 2 deletions src/Data/Monoid/Multiplicative.purs
Original file line number Diff line number Diff line change
Expand Up @@ -4,8 +4,9 @@ import Prelude

import Control.Comonad (Comonad)
import Control.Extend (Extend)
import Data.Functor.Invariant (Invariant, imap)
import Data.Monoid

import Data.Functor.Invariant (Invariant)
import Data.Monoid (Monoid)

-- | Monoid and semigroup for semirings under multiplication.
-- |
Expand Down

0 comments on commit 1b40960

Please sign in to comment.