1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
Source: haskell-patience
Maintainer: Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
Uploaders: John Millikin <jmillikin@gmail.com>
Priority: optional
Section: haskell
Rules-Requires-Root: no
Build-Depends:
cdbs,
debhelper (>= 10),
ghc (>= 8),
ghc-prof,
haskell-devscripts (>= 0.15),
Build-Depends-Indep: ghc-doc
Standards-Version: 4.5.0
Homepage: https://github.com/chessai/patience
Vcs-Browser: https://salsa.debian.org/haskell-team/DHG_packages/tree/master/p/haskell-patience
Vcs-Git: https://salsa.debian.org/haskell-team/DHG_packages.git [p/haskell-patience]
Package: libghc-patience-dev
Architecture: any
Depends: ${haskell:Depends}, ${misc:Depends}, ${shlibs:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Haskell implementation of the Patience Diff algorithm${haskell:ShortBlurb}
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.
.
${haskell:Blurb}
Package: libghc-patience-prof
Architecture: any
Depends: ${haskell:Depends}, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Provides: ${haskell:Provides}
Description: Haskell implementation of the Patience Diff algorithm${haskell:ShortBlurb}
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.
.
${haskell:Blurb}
Package: libghc-patience-doc
Architecture: all
Section: doc
Depends: ${haskell:Depends}, ${misc:Depends}
Recommends: ${haskell:Recommends}
Suggests: ${haskell:Suggests}
Description: Haskell implementation of the Patience Diff algorithm${haskell:ShortBlurb}
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.
.
${haskell:Blurb}
|
