list-shuffle 1.0.0 → 1.0.0.1

raw patch · 4 files changed

+15/−10 lines, 4 filesdep ~basedep ~hedgehogdep ~randomPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base, hedgehog, random, tasty-bench

API changes (from Hackage documentation)

Files

• CHANGELOG.md +5/−1
• LICENSE +1/−1
• list-shuffle.cabal +6/−6
• src/List/Shuffle.hs +3/−2

@@ -1,3 +1,7 @@-## [1.0.0] - 2023-20-25+## [1.0.0.1] - May 15, 2024++- Fix `missing-local-signatures` warning on GHC 9.8+++## [1.0.0] - October 25, 2023  - Initial release.

@@ -1,4 +1,4 @@-Copyright 2023 Mitchell Rosen, Travis Staton+Copyright 2023-2024 Mitchell Dalvi Rosen, Travis Staton  Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 

@@ -1,19 +1,19 @@ cabal-version: 2.4 -author: Mitchell Rosen+author: Mitchell Dalvi Rosen bug-reports: https://github.com/awkward-squad/list-shuffle/issues category: Data-copyright: Copyright (C) 2023 Mitchell Rosen, Travis Staton+copyright: Copyright (C) 2024 Mitchell Dalvi Rosen, Travis Staton description: List shuffling and sampling with optimal asymptotic time and space complexity using the imperative Fisher–Yates algorithm. homepage: https://github.com/awkward-squad/list-shuffle license: BSD-3-Clause license-file: LICENSE-maintainer: Mitchell Rosen <mitchellwrosen@gmail.com>, Travis Staton <hello@travisstaton.com>+maintainer: Mitchell Dalvi Rosen <mitchellwrosen@gmail.com>, Travis Staton <hello@travisstaton.com> name: list-shuffle stability: stable synopsis: List shuffling and sampling-tested-with: GHC == 9.4.7, GHC == 9.6.3, GHC == 9.8.1-version: 1.0.0+tested-with: GHC == 9.6.5, GHC == 9.8.2, GHC == 9.10.1+version: 1.0.0.1  extra-doc-files:   CHANGELOG.md@@ -57,7 +57,7 @@ library   import: component   build-depends:-    base ^>= 4.14 || ^>= 4.15 || ^>= 4.16 || ^>= 4.17 || ^>= 4.18 || ^>= 4.19,+    base ^>= 4.14 || ^>= 4.15 || ^>= 4.16 || ^>= 4.17 || ^>= 4.18 || ^>= 4.19 || ^>= 4.20,     primitive ^>= 0.8 || ^>= 0.9,     random ^>= 1.2.1,   hs-source-dirs: src

@@ -165,10 +165,11 @@ {-# INLINE swapArrayElems #-}  -- Construct a mutable array from a list.-listToMutableArray :: [a] -> ST s (Array.MutableArray s a)+listToMutableArray :: forall a s. [a] -> ST s (Array.MutableArray s a) listToMutableArray list = do   array <- Array.newArray (length list) undefined-  let writeElems !i = \case+  let writeElems :: Int -> [a] -> ST s ()+      writeElems !i = \case         [] -> pure ()         x : xs -> do           Array.writeArray array i x