packages feed

hashtables 1.2.0.2 → 1.2.1.0

raw patch · 4 files changed

+12/−14 lines, 4 filesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

API changes (from Hackage documentation)

- Data.HashTable.ST.Basic: instance HashTable HashTable
- Data.HashTable.ST.Basic: instance Monoid Slot
- Data.HashTable.ST.Basic: instance Show (HashTable s k v)
- Data.HashTable.ST.Basic: instance Show Slot
- Data.HashTable.ST.Cuckoo: instance HashTable HashTable
- Data.HashTable.ST.Cuckoo: instance Show (HashTable s k v)
- Data.HashTable.ST.Linear: instance HashTable HashTable
- Data.HashTable.ST.Linear: instance Show (HashTable s k v)
+ Data.HashTable.ST.Basic: instance Data.HashTable.Class.HashTable Data.HashTable.ST.Basic.HashTable
+ Data.HashTable.ST.Basic: instance GHC.Base.Monoid Data.HashTable.ST.Basic.Slot
+ Data.HashTable.ST.Basic: instance GHC.Show.Show (Data.HashTable.ST.Basic.HashTable s k v)
+ Data.HashTable.ST.Basic: instance GHC.Show.Show Data.HashTable.ST.Basic.Slot
+ Data.HashTable.ST.Cuckoo: instance Data.HashTable.Class.HashTable Data.HashTable.ST.Cuckoo.HashTable
+ Data.HashTable.ST.Cuckoo: instance GHC.Show.Show (Data.HashTable.ST.Cuckoo.HashTable s k v)
+ Data.HashTable.ST.Linear: instance Data.HashTable.Class.HashTable Data.HashTable.ST.Linear.HashTable
+ Data.HashTable.ST.Linear: instance GHC.Show.Show (Data.HashTable.ST.Linear.HashTable s k v)
- Data.HashTable.Class: toList :: HashTable h => h s k v -> ST s [(k, v)]
+ Data.HashTable.Class: toList :: (HashTable h) => h s k v -> ST s [(k, v)]
- Data.HashTable.IO: computeOverhead :: HashTable h => IOHashTable h k v -> IO Double
+ Data.HashTable.IO: computeOverhead :: (HashTable h) => IOHashTable h k v -> IO Double
- Data.HashTable.IO: foldM :: HashTable h => (a -> (k, v) -> IO a) -> a -> IOHashTable h k v -> IO a
+ Data.HashTable.IO: foldM :: (HashTable h) => (a -> (k, v) -> IO a) -> a -> IOHashTable h k v -> IO a
- Data.HashTable.IO: mapM_ :: HashTable h => ((k, v) -> IO a) -> IOHashTable h k v -> IO ()
+ Data.HashTable.IO: mapM_ :: (HashTable h) => ((k, v) -> IO a) -> IOHashTable h k v -> IO ()

Files

changelog.md view
@@ -1,5 +1,11 @@ # Hashtables changelog +## 1.2.1.0++  - Fixed an FFI import typo bug+    (https://github.com/gregorycollins/hashtables/pull/27), thanks to Thijs+    Alkemade for the fix.+ ## 1.2.0.2    - Fixed serious bug (https://github.com/gregorycollins/hashtables/issues/24)
hashtables.cabal view
@@ -1,5 +1,5 @@ Name:                hashtables-Version:             1.2.0.2+Version:             1.2.1.0 Synopsis:            Mutable hash tables in the ST monad Homepage:            http://github.com/gregorycollins/hashtables License:             BSD3@@ -90,16 +90,6 @@     * @portable@, default /OFF/. If this flag is enabled, we use only pure       Haskell code and try not to use unportable GHC extensions. Turning this       flag on forces @unsafe-tricks@ and @sse42@ /OFF/.-  .-  This package has been tested with GHC 7.0.3, on:-  .-    * a MacBook Pro running Snow Leopard with an Intel Core i5 processor,-      running GHC 7.0.3 in 64-bit mode.-  .-    * an Arch Linux desktop with an AMD Phenom II X4 940 quad-core processor.-  .-    * a MacBook Pro running Snow Leopard with an Intel Core 2 Duo processor,-      running GHC 6.12.3 in 32-bit mode.   .   Please send bug reports to   <https://github.com/gregorycollins/hashtables/issues>.
src/Data/HashTable/Internal/CacheLine.hs view
@@ -56,7 +56,7 @@ foreign import ccall unsafe "line_search_2"   c_lineSearch_2 :: Ptr a -> CInt -> CUShort -> CUShort -> IO CInt -foreign import ccall unsafe "line_search_2"+foreign import ccall unsafe "line_search_3"   c_lineSearch_3 :: Ptr a -> CInt -> CUShort -> CUShort -> CUShort -> IO CInt  foreign import ccall unsafe "forward_search_2"
test/suite/Data/HashTable/Test/Common.hs view
@@ -25,8 +25,10 @@ import           Test.Framework.Providers.HUnit import           Test.Framework.Providers.QuickCheck2 import           Test.HUnit                           (assertFailure)-import           Test.QuickCheck-import           Test.QuickCheck.Monadic+import           Test.QuickCheck                      (arbitrary, choose,+                                                       sample')+import           Test.QuickCheck.Monadic              (PropertyM, assert,+                                                       forAllM, monadicIO, run) ------------------------------------------------------------------------------ import qualified Data.HashTable.Class                 as C import           Data.HashTable.Internal.Utils        (unsafeIOToST)