stringsearch 0.3.5 → 0.3.6

raw patch · 4 files changed

+6/−4 lines, 4 files

Files

• CHANGES +2/−0
• Data/ByteString/Lazy/Search.hs +1/−1
• Data/ByteString/Search.hs +1/−1
• stringsearch.cabal +2/−2

@@ -1,3 +1,5 @@+0.3.6:+- fix typos in haddocks 0.3.5: - set up public repo at bitbucket 0.3.4:

@@ -96,7 +96,7 @@ -- -- In general, searching in a strict 'S.ByteString' is slightly faster -- than searching in a lazy 'L.ByteString', but for long targets the--- smaller memory footprint of lazy 'L.ByteStrings' can make searching+-- smaller memory footprint of lazy 'L.ByteString's can make searching -- those (sometimes much) faster. On the other hand, there are cases -- where searching in a strict target is much faster, even for long targets. --

@@ -80,7 +80,7 @@ -- -- In general, searching in a strict 'S.ByteString' is slightly faster -- than searching in a lazy 'L.ByteString', but for long targets, the--- smaller memory footprint of lazy 'L.ByteStrings' can make searching+-- smaller memory footprint of lazy 'L.ByteString's can make searching -- those (sometimes much) faster. On the other hand, there are cases -- where searching in a strict target is much faster, even for long targets. 

@@ -7,7 +7,7 @@ -- The package version. See the Haskell package versioning policy -- (http://www.haskell.org/haskellwiki/Package_versioning_policy) for -- standards guiding when and how versions should be incremented.-Version:             0.3.5+Version:             0.3.6  Homepage:            https://bitbucket.org/dafis/stringsearch Bug-reports:         https://bitbucket.org/dafis/stringsearch/issues@@ -109,4 +109,4 @@  source-repository head   type:     mercurial-  location: http://bitbucket.org/dafis/stringsearch+  location: https://bitbucket.org/dafis/stringsearch