mmsyn2 0.1.3.0 → 0.1.4.0

raw patch · 4 files changed

+15/−30 lines, 4 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• CaseBi.hs +9/−28
• ChangeLog.md +4/−0
• README.md +1/−1
• mmsyn2.cabal +1/−1

@@ -1,4 +1,4 @@-{-# LANGUAGE BangPatterns #-}+--{-# LANGUAGE BangPatterns #-}  module CaseBi ( -- * Function that can be used instead of @@ -19,10 +19,10 @@   filterP ) where -import qualified Data.Vector as V (Vector,unsafeHead,unsafeLast,unsafeTake,unsafeDrop,length,(!),fromList,map)+import qualified Data.Vector as V (Vector,unsafeHead,unsafeLast,unsafeSlice,length,(!),fromList,map) import qualified Data.List as L (groupBy,nubBy) --import Prelude--- (Bool,Eq,Ord,map,(>=),(<=),(>),(<),(==),(&&),(.),(++),(-),($),filter,otherwise,fst,snd,div,not,null,dropWhile,concatMap,take,seq,undefined)+-- (Bool,Eq,Ord,map,(>=),(<=),(>),(<),(==),(&&),(.),(++),(-),($),filter,otherwise,fst,snd,quot,not,null,dropWhile,concatMap,take,seq,undefined)  -- | The function that can be used instead of the 'case ... of' function --@@ -54,31 +54,12 @@   -- ^ the function gives a resulting b as if there is only the first one   -> a -- ^ an element for which the corresponding resulting b must be found   -> b -- ^ the result-getBFst' def vec l | (l < vElem0 vec) || (l > vElemL vec) = def-                   | (vIL vec >= 3) = if l <= fst (vec V.! (vIL vec `div` 2))-  then getBFst' def v1 l -  else getBFst' def v2 l-                   | (vIL vec == 2) = if l == vElem0 vec-  then snd . V.unsafeHead $ vec-  else if l == vElem1 vec-         then snd $ vec V.! 1-         else if l == vElemL vec-                then snd . V.unsafeLast $ vec-                else def-                   | (vIL vec == 1) = if l == vElem0 vec-  then snd . V.unsafeHead $ vec-  else if l == vElemL vec-         then snd . V.unsafeLast $ vec-         else def-                   | (vIL vec == 0) = snd . V.unsafeHead $ vec-                   | otherwise = def-            where vElem0 = fst . V.unsafeHead-                  vElem1 v = fst $ v V.! 1-                  vElemL = fst . V.unsafeLast-                  vIL v = V.length v - 1-                  v1  = V.unsafeTake (V.length vec `div` 2) vec-                  v2 = V.unsafeDrop (V.length vec `div` 2) vec-+getBFst' def vec l | if (l < (fst (V.unsafeHead vec))) then True else (l > (fst (V.unsafeLast vec))) = def+                   | (V.length vec >= 2) = if l <= fst (vec V.! (V.length vec `quot` 2))+  then getBFst' def (V.unsafeSlice 0 (V.length vec `quot` 2) vec) l +  else getBFst' def (V.unsafeSlice (V.length vec `quot` 2) (V.length vec - (V.length vec `quot` 2)) vec) l +                   | otherwise = snd (V.unsafeHead vec)+                    -- | The function that uses special kind of bisection to effectively transform the Vector a to Vector b with  instead of simply use  -- -- > case var of

@@ -9,3 +9,7 @@ * First release revised B. Some performance changes and changing the imported functions.  Moreover, fixed constraints in cabal file. Make more exact the vector usage. +## 0.1.4.0 -- 2019-09-28++* First version revised C. Some performance improvements and changing the imported functions.+

@@ -1,4 +1,4 @@ ## Welcome to mmsyn2 home page! -mmsyn2 is the library that can be used for optimization of multiple (Ord a) => a -> b transformations.+mmsyn2 is the library that can be used for multiple (Ord a) => a -> b transformations. 

@@ -2,7 +2,7 @@ -- see http://haskell.org/cabal/users-guide/  name:                mmsyn2-version:             0.1.3.0+version:             0.1.4.0 synopsis:            The library that can be used for multiple (Ord a) => a -> b transformations description:         The library that can be used for optimization or another representation of multiple (Ord a) => a -> b transformations homepage:            https://oleksandrzhabenko.github.io/mmsyn2