SEARCH
NEW RPMS
DIRECTORIES
ABOUT
FAQ
VARIOUS
BLOG

 
 

perl-Tree-Interval rpm build for : OpenSuSE. For other distributions click perl-Tree-Interval.

Name : perl-Tree-Interval
Version : 0.3.2 Vendor : obs://build_opensuse_org/devel:languages:perl
Release : lp156.1.1 Date : 2024-07-03 19:18:10
Group : Development/Libraries/Perl Source RPM : perl-Tree-Interval-0.3.2-lp156.1.1.src.rpm
Size : 0.02 MB
Packager : https://www_suse_com/
Summary : Perl implementation of an interval tree
Description :
This is a perl implementation of an interval tree for non-overlapping
intervals, based on Tree::RedBlack by Benjamin Holzman
< bholzmanAATTearthlink.net>. An interval tree is a binary tree which remains
\"balanced\" i.e. the longest length from root to a node is at most one more
than the shortest such length. It is fairly efficient; no operation takes
more than O(log(N)) time.

A Tree::Interval object supports the following methods:

* _Tree::Interval->new()_

Creates a new Interval tree object.

* _root()_

Returns the root node of the tree. Note that this will either be _undef_
if no nodes have been added to the tree, or a Tree::Interval::Node
object.

* _cmp(coderef)_

Use this method to set a comparator subroutine. The tree defaults to
builtin Perl numerical comparisons. This subroutine should be just like a
comparator subroutine to _sort_, except that it doesn\'t do the $a, $b
trick; the two elements to compare will just be the first two items on
the stack. For example,

sub example_comparator
{
my ($ka, $kb) = AATT_;
return $ka < => $kb;
}

* _insert(low, high, value)_

Adds a new node to the tree. The first two arguments are an interval
which forms the key of the node, the third is its value and may not be
_undef_. Overlapping or duplicate keys are an error. Errors are handled
using _die_. Nothing is returned.

* _min()_

Returns the node with the minimal key.

* _max()_

Returns the node with the maximal key.

* _find(key)_

Searches the tree to find the node whose interval contains the given
_key_. Returns the value of that node, or _undef_ if a node with that key
isn\'t found.

* _values()_

Returns a list of all the node values.

RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-T/15.6/noarch

Content of RPM  Provides Requires

Download
ftp.icm.edu.pl  perl-Tree-Interval-0.3.2-lp156.1.1.noarch.rpm
     

Provides :
perl(Tree::Interval)
perl(Tree::Interval::Node)
perl(Tree::Interval::Test)
perl-Tree-Interval

Requires :
perl(:MODULE_COMPAT_5.26.1)
perl(Test::Unit) >= 0.25
rpmlib(CompressedFileNames) <= 3.0.4-1
rpmlib(FileDigests) <= 4.6.0-1
rpmlib(PayloadFilesHavePrefix) <= 4.0-1
rpmlib(PayloadIsXz) <= 5.2-1


Content of RPM :
/usr/lib/perl5/vendor_perl/5.26.1/Tree
/usr/lib/perl5/vendor_perl/5.26.1/Tree/Interval
/usr/lib/perl5/vendor_perl/5.26.1/Tree/Interval.pm
/usr/lib/perl5/vendor_perl/5.26.1/Tree/Interval/Node.pm
/usr/lib/perl5/vendor_perl/5.26.1/Tree/Interval/Test.pm
/usr/lib/perl5/vendor_perl/5.26.1/x86_64-linux-thread-multi
/usr/share/man/man3/Tree::Interval.3pm.gz

 
ICM