[Pkg-haskell-commits] [SCM] Optimized edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms annotated tag, debian/0.2.1-1, created. debian/0.2.1-1

[Joey Hess]

The annotated tag, debian/0.2.1-1 has been created
        at  cbf82ce7fb41424849c1c087bfc6582ef005efba (tag)
   tagging  f45e5b72e82c99bf0333e5c869f83cb9cd35ae47 (commit)
 tagged by  Joey Hess
        on  Fri Apr 6 15:11:11 2012 -0400

- Shortlog ------------------------------------------------------------
tagging version debian/0.2.1-1
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.12 (GNU/Linux)

iQIVAwUAT38/z8kQ2SIlEuPHAQhmpA/+OJqe4j/8Plzs2+i7Q5NtWDBxuECb9TpX
d4QsJiQV+3Uv97eP8Nu3vjsk07RNDpTq0XkowOVWhYqn2UyFzH4m4p7Wo8/YSprm
J82Z+hoENDCE3U4wKJ5HctwhuBLF9ZRQprEIld50+XjYLFAsJ0kLl2evkkRkKw9C
sq2pYL5vcNlrprWAuD/iCuwQTR8MIjHAzf3P6S6do6XyL8NA8l40ycKLEm2hcUOB
AFJy2Fq3tkSXiWYoKwIUMxhdDbQbPX9O5lFhIMdcET8Wg8djASR8Df6fB1WkCceK
U01XkEkY1MNc9Nnc7TrZRpbhCV/PBvADYUK6hApdGa9GGWoFLkpVyBo4TqHrYOPJ
RlH/s8BltFGAD5YCt81lD80SpHlGfxFv7yeIOulN13zFnzi11aa3oIEVJNeH+7d7
p8lFXjctfnlEA8B5vLSlVRbDQWw2dMLdy90xlsx5orySNrDk48csoip9Hg9FPFUE
LEGLwvxRkDQaVbowjqEUUKmtr7JwTU4wx3hPXm102XJmP7VZpnxQjPfvqsgjlhl6
iFUhIrWjvT9lNOhdW/XLo1zgg3mLLJLDHgb4ZhQJ5q6wqLxubZuzftaQCOHaxS76
QnX7dAlkclf/qZAvmrvIP2YJipI7//6gDbXIyPkW/iKXU0Nxm8S4ocNYVtuucWJa
4G1QGDGZnsQ=
=bKEy
-----END PGP SIGNATURE-----

Joey Hess (2):
      remove several files that are not distributed in the cabal tarball
      debianization

Mark Wotton (1):
      add test-framework-quickcheck dependency

Max Bolingbroke (42):
      Initial commit of edit-distance package
      Fix and test Levenehstein distance, -Wall clean, bump up number of tests
      Add .gitignore
      Check whitespace errors on commit
      Add initial benchmark suite
      Update gitattributes to try and get whitespace working
      Implement bit-vector edit distance
      Also ignore .plot files
      Add STUArray cost implementation
      Set up benchmark for testing STUArray implementations
      Tune STUArray and SquareSTUArray algorithms, use the appropraite one as the default implementation
      Make tests repeatable and report an exit code
      Update benchmark for STUArray implementation comparisons
      Tweak strictness annotations
      Tweak STUArray further for DL distance
      Break Framework.hs into two files
      More refined selection of algorithm based on string length, benchmark improvements, initial attempt at bit array algorithm with cutoff (failure)
      Optimize STUArray implementations by using new loopM_ instead of forM_ over a list
      Add README
      Tweak documentation and Cabal file for upload
      Support split-base
      Ignore .DS_Store
      Add synopsis
      Add Lighthouse as project homepage
      Fix spelling error in edit-distance.cabal, thanks to Gabor Greif
      Add release script
      Update homepage
      Create README by importing from the GitHub wiki
      Remove old README file
      Use my new test-framework package to do the tests
      Add TODOs
      Bump version number
      Merge branch 'master' of git at github.com:batterseapower/edit-distance
      Add upper bounds to base dependency to avoid Cabal's wrath
      Sensible GHCi defaults
      Better QuickCheck bound, less dangerous GHC options
      Implement functional costs for all elements of the cost structure
      Bump version in Cabal file
      Fix release script: cabal-upload is broken
      Export Costs constructors
      Document EditCosts structure
      Bump version

Max Cantor (6):
      changed subCost to substitutionCost :: !(Either !Int (Char -> Char -> Int))
      using new Either'ified substitionCosts
      changed ot either-ified subst costs
      fixed defaultEditCosts compile bug
      custom eq class instance for Edit Costs
      fixed syntax error

U-LaGrange\Max Bolingbroke (1):
      Don't depend on anything if not buildable - allows edit-distance to build on Windows

-----------------------------------------------------------------------

-- 
Optimized edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms