haskell-patience 0.2.1.1-2build1 source package in Ubuntu

Changelog

haskell-patience (0.2.1.1-2build1) eoan; urgency=medium

  * Rebuild against new GHC abi.

 -- Gianfranco Costamagna <email address hidden>  Sat, 03 Aug 2019 13:04:18 +0200

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Eoan
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
haskell
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Focal release universe haskell

Downloads

File Size SHA-256 Checksum
haskell-patience_0.2.1.1.orig.tar.gz 6.5 KiB 1ae8f5eb1400c7cdaa9d20ff775d2d5d95090f466fb5f313d8d4aa35f384a691
haskell-patience_0.2.1.1-2build1.debian.tar.xz 3.0 KiB 3d549421a41e8cefb152395161f9fe514df266d36c95875afe6d0e2948721b57
haskell-patience_0.2.1.1-2build1.dsc 2.3 KiB 1bce288c323e958f3314118da6bb1d89431f705e353884cfc74f8d546be8dede

View changes file

Binary packages built by this source

libghc-patience-dev: No summary available for libghc-patience-dev in ubuntu groovy.

No description available for libghc-patience-dev in ubuntu groovy.

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.