Filewatcher File Search File Search
Catalog
Content Search
» » » » »

libtree-redblack-perl

Perl implementation of Red/Black tree, a balanced tree

Variants:
This is a demonstration package, showing the performance differences between different methods of data storage and accessing. It contains a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, 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(lg(n)) time.

An example perl script is contained in the documentation directory, which would show the different run times using hash table, linear or tree structure.

Homepage:
Package version:0.5-1
Architecture:all
Distribution:Debian
Filename:libtree-redblack-perl_0.5-1_all.deb

/usr/share/doc/libtree-redblack-perl/README

Tree::RedBlack version 0.4
------------------------------------------------------------------------
    This program is free software; you can redistribute it and/or modify
    it under the terms of the Artistic License, a copy of which can be
    found with perl.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
more»

/usr/share/man/man3/Tree::Node.3pm.gz

Node(3pm)        User Contributed Perl Documentation       Node(3pm)



NAME
       Tree::RedBlack::Node - Node class for Perl implementation of
       Red/Black tree

SYNOPSIS
       use Tree::RedBlack; my $t = new Tree::RedBlack; $t->insert(3,
       'dog'); my $node = $t->node(3); $animal = $node->val;

DESCRIPTION
       A Tree::RedBlack::Node object supports the following methods:

       key
more»

/usr/share/man/man3/Tree::RedBlack.3pm.gz

RedBlack(3pm)    User Contributed Perl Documentation   RedBlack(3pm)



NAME
       Tree::RedBlack - Perl implementation of Red/Black tree, a
       type of balanced tree.

SYNOPSIS
         use Tree::RedBlack;

         my $t = new Tree::RedBlack;
         $t->insert(3, 'cat');
         $t->insert(4, 'dog');
         my $v = $t->find(4);
         my $min = $t->min;
         my $max = $t->max;
   
more»

/usr/share/doc/libtree-redblack-perl/changelog.Debian.gz

libtree-redblack-perl (0.5-1) unstable; urgency=low

  * New upstream release
  * drop fix_broken_in
more»

/usr/share/doc/libtree-redblack-perl/changelog.gz

Revision history for Perl extension Tree::RedBlack.

0.01  Wed Oct 14 13:42:34 1998
	- original vers
more»

/usr/share/doc/libtree-redblack-perl/copyright

Upstream source location: http://search.cpan.org/dist/Tree-RedBlack/
Upstream author: Benjamin Holzm
more»

Browse inside libtree-redblack-perl_0.5-1_all.deb

         [DIR]DEBIAN/ (2)  65535+ mirrors
         [DIR]usr/ (1)  65535+ mirrors

Download libtree-redblack-perl_0.5-1_all.deb

Results 1 - 1 of 1
Help - FTP Sites List - Software Dir.
Search over 15 billion files
© 1997-2016 FileWatcher.com