Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

travis: Test ghc 8.0.1 (and avoid some compiler warnings on 8.0.1) #120

Merged
merged 3 commits into from
Jun 18, 2016
Merged

travis: Test ghc 8.0.1 (and avoid some compiler warnings on 8.0.1) #120

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
0b376f7
binary-search-tree: rm example redundant constraints
petertseng Apr 7, 2016
c96994a
custom-set: rm example redundant constraints
petertseng Apr 7, 2016
034b624
travis: Test ghc 8.0.1
petertseng Jun 18, 2016
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions .travis.yml
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -13,6 +13,7 @@ addons:
- ghc-7.6.3
- ghc-7.8.4
- ghc-7.10.3
- ghc-8.0.1
- cabal-install-1.22
env:
global:
Expand All @@ -21,6 +22,7 @@ env:
- GHCVER=7.6.3
- GHCVER=7.8.4
- GHCVER=7.10.3
- GHCVER=8.0.1
cache:
directories:
- '$HOME/.ghc'
Expand Down
2 changes: 1 addition & 1 deletion exercises/binary-search-tree/example.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -38,7 +38,7 @@ bstRight (Node _ _ r) = Just r
empty :: BST a
empty = Tip

singleton :: Ord a => a -> BST a
singleton :: a -> BST a
singleton x = Node empty x empty

insert :: Ord a => a -> BST a -> BST a
Expand Down
6 changes: 3 additions & 3 deletions exercises/custom-set/example.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,7 +27,7 @@ data CustomSet a
= Tip
| Bin {-# UNPACK #-} !Int !a !(CustomSet a) !(CustomSet a)

instance (Ord a, Eq a) => Eq (CustomSet a) where
instance (Ord a) => Eq (CustomSet a) where
a == b = size a == size b && a `isSubsetOf` b

instance Show a => Show (CustomSet a) where
Expand All @@ -47,13 +47,13 @@ size :: CustomSet a -> Int
size Tip = 0
size (Bin s _a _l _r) = s

singleton :: Ord a => a -> CustomSet a
singleton :: a -> CustomSet a
singleton x = Bin 1 x Tip Tip

toList :: CustomSet a -> [a]
toList = F.toList

empty :: Ord a => CustomSet a
empty :: CustomSet a
empty = Tip

fromList :: Ord a => [a] -> CustomSet a
Expand Down