Install this package:
emerge -a dev-haskell/ranged-sets
If the package is masked, you can unmask it using the autounmask tool or standard emerge options:
autounmask dev-haskell/ranged-sets
Or alternatively:
emerge --autounmask-write -a dev-haskell/ranged-sets
| Version | EAPI | Keywords | Slot |
|---|---|---|---|
| 0.4.0 | 8 | ~amd64 ~x86 | 0/0.4.0 |
<pkgmetadata> <maintainer type="person"> <email>spiderx@spiderx.dp.ua</email> <name>Vladimir Pavljuchenkov</name> </maintainer> <maintainer type="project"> <email>proxy-maint@gentoo.org</email> <name>Proxy Maintainers</name> </maintainer> <longdescription lang="en"> A ranged set is an ordered list of ranges. Ranged sets allow programming with sets of values that are described by a list of ranges. A value is a member of the set if it lies within one of the ranges. The ranges in a set are ordered and non-overlapping, so the standard set operations can be implemented by merge algorithms in O(n) time. </longdescription> <upstream> <remote-id type="hackage">Ranged-sets</remote-id> <remote-id type="github">PaulJohnson/Ranged-sets</remote-id> </upstream> </pkgmetadata>
| Type | File | Size | Versions |
|---|
| Type | File | Size |
|---|---|---|
| DIST | ranged-sets-0.4.0-rev2.cabal | 1373 bytes |
| DIST | ranged-sets-0.4.0.tar.gz | 13826 bytes |