edit-distance-linear 0.2.0.1 → 0.2.0.2

raw patch · 3 files changed

+11/−4 lines, 3 files

Files

• ChangeLog.md +4/−0
• README.md +3/−0
• edit-distance-linear.cabal +4/−4

@@ -1,5 +1,9 @@ # Changelog for edit-distance-linear +## v0.2.0.2++* Turn the LLVM flag off by default.+ ## v0.2.0.1  * Made the test executable and the LLVM codegen optional.

@@ -1,6 +1,7 @@ # edit-distance-linear  [![Build Status][travis-badge]][travis]+[![Hackage][hackage-badge]][hackage]  The pure Haskell implementation of the Levenshtein edit distance, with linear space complexity. @@ -16,3 +17,5 @@  [travis]:        <https://travis-ci.org/0xd34df00d/edit-distance-linear> [travis-badge]:  <https://travis-ci.org/0xd34df00d/edit-distance-linear.svg?branch=master>+[hackage]:       <https://hackage.haskell.org/package/edit-distance-linear>+[hackage-badge]: <https://img.shields.io/hackage/v/edit-distance-linear.svg>

@@ -4,11 +4,11 @@ -- -- see: https://github.com/sol/hpack ----- hash: 52175124e00b64f40bb9551356b58a8b08d4d0f2b7ec2366fa339ffc53e59081+-- hash: 0b489ff94cb12c19c0af4a4810be4e49a7093658273ea2a4e46a3b02683c0807  name:           edit-distance-linear-version:        0.2.0.1-synopsis:       Efficient implementation Levenshtein distance in linear memory.+version:        0.2.0.2+synopsis:       Efficient implementation of the Levenshtein edit distance in linear memory. description:    Please see the README on GitHub at <https://github.com/0xd34df00d/edit-distance-linear#readme> category:       Algorithms homepage:       https://github.com/0xd34df00d/edit-distance-linear#readme@@ -30,7 +30,7 @@ flag llvm   description: Use the LLVM code generator (strongly recommended)   manual: True-  default: True+  default: False  flag with-executable   description: Build the test executable (a fast and dirty way of benchmarking, for the package development only)