rhythmic-sequences 0.1.0.0 → 0.1.1.0

raw patch · 3 files changed

+9/−5 lines, 3 files

Files

• CHANGELOG.md +5/−1
• rhythmic-sequences.cabal +1/−1
• src/Rhythmicity/MarkerSeqs.hs +3/−3

@@ -1,6 +1,10 @@ # Revision history for rhythmic-sequence -## 0.1.0.0 -- 2023-01-17+## 0.1.0.0 -- 2023-02-27  * First version. Released on an unsuspecting world.++## 0.1.1.0 -- 2023-02-27++* First version revised A. Fixed issue with being not compiled by the GHC-9.2 and higher. 

@@ -2,7 +2,7 @@ name:               rhythmic-sequences  -- The package version.-version:            0.1.0.0+version:            0.1.1.0  -- A short (one-line) description of the package. synopsis:

@@ -25,6 +25,7 @@ import Data.Maybe (mapMaybe, catMaybes) import Rhythmicity.BasicF import Text.Read+import GHC.Enum (fromEnum)  -- | The similar function is since @base-4.16.0.0@ in the 'Numeric' module. Is not used  -- further, is provided here mostly for testing purposes.@@ -193,11 +194,10 @@ -- | Function to create bitwise representation of the intermediate date for the algorithm. -- Should be very optimized to run fast. toNum :: [Int8] -> Integer-toNum xs = foldl' setBit 0 . map (\(I8# k) -> I# k) $ xs+toNum xs = foldl' setBit 0 . map fromEnum $ xs  -- | The alternative implementation of the 'toNum' (on the Linux x86_64 for some CPU is  -- slower than the former one). toNum2 :: [Int8] -> Integer-toNum2 xs = (sum . map (shiftL 1 . (\(I8# k) -> I# k)) $ xs)::Integer-+toNum2 xs = (sum . map (shiftL 1 . fromEnum) $ xs)::Integer