bloomfilter 2.0.1.2 → 2.0.1.3
raw patch · 3 files changed
+5/−2 lines, 3 filesPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
API changes (from Hackage documentation)
- Data.BloomFilter.Hash: instance Data.BloomFilter.Hash.Hashable Data.ByteString.Internal.ByteString
+ Data.BloomFilter.Hash: instance Data.BloomFilter.Hash.Hashable Data.ByteString.Internal.Type.ByteString
- Data.BloomFilter: unfold :: forall a b. (a -> [Hash]) -> Int -> (b -> Maybe (a, b)) -> b -> Bloom a
+ Data.BloomFilter: unfold :: (a -> [Hash]) -> Int -> (b -> Maybe (a, b)) -> b -> Bloom a
Files
- CHANGELOG.md +3/−0
- Data/BloomFilter/Easy.hs +1/−1
- bloomfilter.cabal +1/−1
CHANGELOG.md view
@@ -1,3 +1,6 @@+#### 2.0.1.3+* Really fix Data.BloomFilter.Easy on 32 bit.+ #### 2.0.1.2 * Fix Data.BloomFilter.Easy on 32 bit to not incorrectly fail with "capacity too large to represent".
Data/BloomFilter/Easy.hs view
@@ -79,7 +79,7 @@ maxbits = 0xffffffff -- On 32 bit, maxbits is larger than maxBound :: Int, so wraps around -- to a negative number; avoid using it in that case.- maxbitstoolarge n = if maxbits > 0 then n > maxbits else True+ maxbitstoolarge n = if maxbits > 0 then n > maxbits else False -- | Behaves as 'safeSuggestSizing', but calls 'error' if given -- invalid or out-of-range inputs.
bloomfilter.cabal view
@@ -1,6 +1,6 @@ cabal-version: 3.0 name: bloomfilter-version: 2.0.1.2+version: 2.0.1.3 license: BSD-3-Clause license-file: LICENSE author: Bryan O'Sullivan <bos@serpentine.com>