# The patience package

This library implements the "patience diff" algorithm, as well as the patience algorithm for the longest increasing subsequence problem.

Patience diff computes the difference between two lists, for example the lines of two versions of a source file. It provides a good balance of performance, nice output for humans, and implementation simplicity. For more information, see http://alfedenzo.livejournal.com/170301.html and http://bramcohen.livejournal.com/73318.html.

- No changelog available

## Properties

Versions | 0.1, 0.1.1 |
---|---|

Dependencies | base (>=3 && <5), containers (>=0.3) |

License | BSD3 |

Author | Keegan McAllister <mcallister.keegan@gmail.com> |

Maintainer | Keegan McAllister <mcallister.keegan@gmail.com> |

Category | Algorithms, Text |

Upload date | Thu Feb 24 20:46:51 UTC 2011 |

Uploaded by | KeeganMcAllister |

Distributions | Debian:0.1.1, NixOS:0.1.1 |

Downloads | 548 total (77 in last 30 days) |

## Modules

*Data**Algorithm*

[Index]

## Downloads

- patience-0.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)

#### Maintainers' corner

For package maintainers and hackage trustees