| Name : perl-Tree-Node
| |
| Version : 0.08
| Vendor : obs://build_opensuse_org/devel:languages:perl
|
| Release : lp156.6.1
| Date : 2024-07-03 19:18:08
|
| Group : Development/Libraries/Perl
| Source RPM : perl-Tree-Node-0.08-lp156.6.1.src.rpm
|
| Size : 0.05 MB
| |
| Packager : https://www_suse_com/
| |
| Summary : Memory-efficient tree nodes in Perl
|
Description :
This module implements a memory-efficient node type (for trees, skip lists
and similar data structures) for Perl.
You may ask \"Why bother implementing an ordered structure such as a tree
when Perl has hashes built-in?\" Since Perl is optimized for speed over
memory usage, hashes (and lists) use a lot of memory.
Using L< Devel::Size> for a reference, a list with four elements
(corresponding to a key, value, and two child node pointers) will use at
least 120 bytes. A hash with four key/value pairs will use at least 228
bytes. But an equivalent L< Tree::Node> object will use at least 68 bytes.
(However, see the L< /KNOWN ISSUES> section below for caveats regarding
memory usage.)
So the purpose of this package is to provide a simple low-level Node class
which can be used as a base class to implement various kinds of tree
structures. Each node has a key/value pair and a variable number of
\"children\" pointers.
How nodes are organized or the algorithm used to organize them is for you
to implement.
|
RPM found in directory: /packages/linux-pbone/ftp5.gwdg.de/pub/opensuse/repositories/devel:/languages:/perl:/CPAN-T/15.6/x86_64 |
