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

Add CPP to build with latest GHC (9.10) #111

Merged
merged 2 commits into from
May 10, 2024
Merged

Add CPP to build with latest GHC (9.10) #111

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
aa28cb7
CPP for functions that are now in base
vmchale Mar 14, 2024
a8bf10f
prefer MIN_VERSION_base macro
vmchale Mar 21, 2024
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
7 changes: 6 additions & 1 deletion src/Data/List/NonEmpty/Extra.hs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,10 @@ module Data.List.NonEmpty.Extra(
module Data.List.NonEmpty,
(|:), (|>), snoc, (!?),
appendl, appendr,
sortOn, union, unionBy,
#if !(MIN_VERSION_base(4,20,0))
sortOn,
#endif
union, unionBy,
nubOrd, nubOrdBy, nubOrdOn,
maximum1, minimum1, maximumBy1, minimumBy1, maximumOn1, minimumOn1,
foldl1', repeatedly
Expand Down Expand Up @@ -62,11 +65,13 @@ appendl (x :| xs) l = x :| (xs ++ l)
appendr :: [a] -> NonEmpty a -> NonEmpty a
appendr l nel = foldr cons nel l

#if !(MIN_VERSION_base(4,20,0))
-- | Sort by comparing the results of a function applied to each element.
-- The sort is stable, and the function is evaluated only once for
-- each element.
sortOn :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty a
sortOn f = fromList . List.sortOn f . toList
#endif

-- | Return the union of two non-empty lists. Duplicates, and elements of the
-- first list, are removed from the the second list, but if the first list
Expand Down