dev-haskell/ranged-sets (nest)

Search

Package Information

Description:
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.
Homepage:
https://github.com/PaulJohnson/Ranged-sets
License:
BSD

Versions

Version EAPI Keywords Slot
0.4.0 8 ~amd64 ~x86 0/0.4.0

Metadata

Description

Maintainers

Upstream

Raw Metadata XML
<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>

Lint Warnings

Manifest

Type File Size Versions
Unmatched Entries
Type File Size
DIST ranged-sets-0.4.0-rev2.cabal 1373 bytes
DIST ranged-sets-0.4.0.tar.gz 13826 bytes