haskell-ranged-sets 0.3.0-1build1 source package in Ubuntu
Changelog
haskell-ranged-sets (0.3.0-1build1) precise; urgency=low * Rebuild for new GHC ABIs. -- Colin Watson <email address hidden> Sun, 13 Nov 2011 14:36:10 +0000
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Precise
- Original maintainer:
- Debian Haskell Group
- Architectures:
- any all
- Section:
- haskell
- Urgency:
- Low Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
haskell-ranged-sets_0.3.0.orig.tar.gz | 14.0 KiB | 14a0913c91f2c1e44aec0c042afb05f518d9fe718ecc34bd3ad6473f9aa6a0aa |
haskell-ranged-sets_0.3.0-1build1.debian.tar.gz | 2.2 KiB | 77300b2438406efbffc9b2ce8be9cdabf812d80faeeb3822e4b829bbec710716 |
haskell-ranged-sets_0.3.0-1build1.dsc | 2.4 KiB | c7d352783a07e9b6f2f46968cf7d3f7c7175dc49c6c16f6159b7d0708cd4f044 |
Available diffs
- diff from 0.3.0-1 to 0.3.0-1build1 (332 bytes)
Binary packages built by this source
- libghc-ranged-sets-dev: Ranged sets library
This package provides a library for the Haskell programming language.
See http://www.haskell. org/ for more information on Haskell.
.
A ranged set is an ordered list of ranges. This allows sets such as all
reals x such that:
.
(0.25 < x <= 0.75 or 1.4 <= x < 2.3 or 4.5 < x)
.
Alternatively you can have all strings s such that:
.
("F" <= s < "G")
- libghc-ranged-sets-doc: Ranged sets library; documentation
This package provides the documentation for a library for the Haskell
programming language.
See http://www.haskell. org/ for more information on Haskell.
.
A ranged set is an ordered list of ranges. This allows sets such as all
reals x such that:
.
(0.25 < x <= 0.75 or 1.4 <= x < 2.3 or 4.5 < x)
.
Alternatively you can have all strings s such that:
.
("F" <= s < "G")
- libghc-ranged-sets-prof: Ranged sets library; profiling libraries
This package provides a library for the Haskell programming language,
compiled for profiling.
See http://www.haskell. org/ for more information on Haskell.
.
A ranged set is an ordered list of ranges. This allows sets such as all
reals x such that:
.
(0.25 < x <= 0.75 or 1.4 <= x < 2.3 or 4.5 < x)
.
Alternatively you can have all strings s such that:
.
("F" <= s < "G")