haskell-patience 0.1.1-3 source package in Ubuntu
Changelog
haskell-patience (0.1.1-3) unstable; urgency=low * Enable compat level 9 * Use substvars for Haskell description blurbs -- Joachim Breitner <email address hidden> Fri, 24 May 2013 12:51:39 +0200
Upload details
- Uploaded by:
- Debian Haskell Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Low Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Trusty | release | universe | haskell |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| haskell-patience_0.1.1-3.dsc | 1.6 KiB | c8c49f89b7229c1ffe1f8622b96ba5f43a77745c9f60dd39a1f741f1fcdbd9e8 |
| haskell-patience_0.1.1.orig.tar.gz | 4.5 KiB | 35c7c334d344b3cbdc61cc88c559bedb300ace860a80e3990aeb268f1f10db63 |
| haskell-patience_0.1.1-3.debian.tar.gz | 2.4 KiB | a1e7dafae77e8a4ecbc6cf91cf5e5d323a6bf47e310fe14d83b2a092ef6480a6 |
Available diffs
- diff from 0.1.1-2 to 0.1.1-3 (1.0 KiB)
No changes file available.
Binary packages built by this source
- libghc-patience-dev: No summary available for libghc-patience-dev in ubuntu wily.
No description available for libghc-patience-dev in ubuntu wily.
- libghc-patience-doc: Haskell implementation of the Patience Diff algorithm; documentation
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.
.
This package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.
- libghc-patience-prof: Haskell implementation of the Patience Diff algorithm; profiling libraries
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.
.
This package provides a library for the Haskell programming language, compiled
for profiling. See http://www.haskell. org/ for more information on Haskell.
