relude 1.2.1.0 → 1.2.2.0
raw patch · 3 files changed
+19/−8 lines, 3 filesdep ~basedep ~containersdep ~doctest
Dependency ranges changed: base, containers, doctest, ghc-prim, hedgehog
Files
- CHANGELOG.md +5/−0
- relude.cabal +13/−7
- src/Relude/Nub.hs +1/−1
CHANGELOG.md view
@@ -3,6 +3,11 @@ `relude` uses [PVP Versioning][1]. The changelog is available [on GitHub][2]. +## 1.2.2.0 – Oct 13, 2024++- Support GHC-9.10 & GHC-9.8.+- Allow hashable-1.5+ ## 1.2.1.0 – Oct 4, 2023 - [#439](https://github.com/kowainik/relude/issues/439):
relude.cabal view
@@ -1,6 +1,6 @@ cabal-version: 3.0 name: relude-version: 1.2.1.0+version: 1.2.2.0 synopsis: Safe, performant, user-friendly and lightweight Haskell Standard Library description: @__relude__@ is an alternative prelude library. If you find the default@@ -98,7 +98,9 @@ GHC == 9.0.2 GHC == 9.2.8 GHC == 9.4.7- GHC == 9.6.3+ GHC == 9.6.6+ GHC == 9.8.2+ GHC == 9.10.1 source-repository head@@ -126,9 +128,13 @@ if impl(ghc >= 9.2) ghc-options: -Wredundant-bang-patterns -Woperator-whitespace+ if impl(ghc >= 9.4 && < 9.10)+ ghc-options: -Wforall-identifier if impl(ghc >= 9.4) ghc-options: -Wredundant-strictness-flags- -Wforall-identifier+ if impl(ghc >= 9.8)+ ghc-options: -Wterm-variable-capture+ -Winconsistent-flags default-language: Haskell2010@@ -229,12 +235,12 @@ , Data.ByteString.Short - build-depends: base >= 4.11 && < 4.19+ build-depends: base >= 4.11 && < 4.21 , bytestring >= 0.10 && < 0.13 , containers >= 0.5.10 && < 0.8 , deepseq >= 1.4 && < 1.6- , ghc-prim >= 0.5.0.0 && < 0.11- , hashable >= 1.2 && < 1.5+ , ghc-prim >= 0.5.0.0 && < 0.12+ , hashable >= 1.2 && < 1.6 , mtl >= 2.2 && < 2.4 , stm >= 2.4 && < 2.6 , text >= 1.2 && < 2.2@@ -256,7 +262,7 @@ , bytestring , containers , text- , hedgehog >= 1.0 && < 1.4+ , hedgehog >= 1.0 && < 1.5 ghc-options: -threaded
src/Relude/Nub.hs view
@@ -69,7 +69,7 @@ -- $setup -- >>> import Prelude (div, fromEnum) -{- | Removes duplicate elements from a list, keeping only the first occurance of+{- | Removes duplicate elements from a list, keeping only the first occurrence of the element. Like 'Prelude.nub' but runs in \( O(n \log n) \) time and requires 'Ord'.