# Buildsheet autogenerated by ravenadm tool -- Do not edit.

NAMEBASE=		perl-Algorithm-RectanglesContainingDot
VERSION=		0.02
KEYWORDS=		perl
VARIANTS=		536 538
SDESC[536]=		Find rectangles containing a given dot (5.36)
SDESC[538]=		Find rectangles containing a given dot (5.38)
HOMEPAGE=		none
CONTACT=		Perl_Automaton[perl@ironwolf.systems]

DOWNLOAD_GROUPS=	main
SITES[main]=		CPAN/ID:S/SA/SALVA
DISTFILE[1]=		Algorithm-RectanglesContainingDot-0.02.tar.gz:main
DF_INDEX=		1
SPKGS[536]=		single
SPKGS[538]=		single

OPTIONS_AVAILABLE=	PERL_536 PERL_538
OPTIONS_STANDARD=	none
VOPTS[536]=		PERL_536=ON PERL_538=OFF
VOPTS[538]=		PERL_536=OFF PERL_538=ON

DISTNAME=		Algorithm-RectanglesContainingDot-0.02

GENERATED=		yes

SINGLE_JOB=		yes

[PERL_536].USES_ON=			perl:536,configure

[PERL_538].USES_ON=			perl:538,configure

[FILE:260:descriptions/desc.single]
Given a set of rectangles and a set of dots, the algorithm implemented in
this modules finds for every dot, which rectangles contain it. The
algorithm complexity is O(R * log(R) * log(R) + D * log(R)) being R the
number of rectangles and D the number of dots.


[FILE:124:distinfo]
45efb9f29147fea9d84ed9200e738d74c9fdeb3c3d04f82c0a1deadd45a23990         4115 Algorithm-RectanglesContainingDot-0.02.tar.gz