![]() |
File Search | Catalog | Content Search |
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")
Homepage: | http://hackage.haskell.org/package/Ranged-sets |
Package version: | 0.3.0-3 |
Architecture: | i386 |
Distribution: | Debian |
Filename: | libghc-ranged-sets-prof_0.3.0-3_i386.deb |
haskell-ranged-sets (0.3.0-3) experimental; urgency=low [ Giovanni Mascellani ] * Team upload. * Fix Homepage: link [ Joachim Breitner ] * Depend on haskell-devscripts 0.8.13 to ensure this packages is built against experimental * Bump standards version, no change -- Joachim Breitner <nomeata@debian.org> Sun, 14 Oct 2012 12:01:52 +0200 haskell-ranged-sets (0.3.0-2) unstable; more»
Version 0.0.2 ------------- Fixed the infinite loop with infinite sets, at least as far as possible. Added lots more QuickCheck properties. Added subset predicates. Added infix operators. Version 0.0.3 ------------- Removed support for infinite sets. They sometimes still work, but generally are more trouble than they are worth. There is no simple set of rules for client applications to guaran more»
This package was debianized by Clint Adams <clint@debian.org> on Tue, 14 Jun 2011 14:46:07 -0000 It was downloaded from http://hackage.haskell.org/package/Ranged-sets Upstream Author: Paul Johnson <paul@cogito.org.uk> Copyright: 2005, 2006, 2007, 2008 Paul Johnson License: Redistribution and use in source and binary forms, with or without modification, are permitted provided that more»
[DIR] | DEBIAN/ (2) 65535+ mirrors | ||
[DIR] | usr/ (2) 65535+ mirrors |