homepage: ''
changelog-type: ''
hash: 7496dd520d0354ba824a385a03bfd0b4d40065d66a944dc90c722cb24a8fd1dd
test-bench-deps:
  base: '>=4.14 && <5'
  tasty-hedgehog: '>=1.0 && <2.0'
  tasty-discover: '>=2 && <5'
  text: ==1.*
  registry-hedgehog: '>=0.7 && <1'
  matrix: '>=0.3 && <1'
  hedgehog: '>=1.0 && <2'
  protolude: ==0.3.*
  containers: '>=0.2 && <1'
  edits: -any
  tasty: ==1.*
  primitive: '>=0.6 && <1'
  vector: '>=0.10 && <2'
maintainer: etorreborre@yahoo.com
synopsis: show the differences between 2 pieces of Text using the Levenshtein distance
changelog: ''
basic-deps:
  base: '>=4.14 && <5'
  text: ==1.*
  matrix: '>=0.3 && <1'
  protolude: ==0.3.*
  containers: '>=0.2 && <1'
  primitive: '>=0.6 && <1'
  vector: '>=0.10 && <2'
all-versions:
- 0.1.0.0
- 0.1.0.1
author: ''
latest: 0.1.0.1
description-type: haddock
description: This library computes the minimum number of edit operations 'insert',
  'delete', 'substitute' which are necessary to transform a piece of text into another.
  It then displays the parts which are different in brackets.
license-name: MIT

Update from Hackage at 2022-09-24T12:33:28Z
Update from Hackage at 2022-09-24T12:33:28Z
