Btree

Miester Search class indexes multiple tables, builds dictionaries, creates btree indexes, and creates sql queries based on user input. Platforms: PHP

SimpleDBM projects goal is to build a Relational Database Manager in Java. The planned features include support for: Transactions Write Ahead Log Multiple Isolation Levels BTree Indexes Entry Level SQL-92 System Catalogs A distinguishing feature of the project is that the DBMS is being... Platforms: *nix

DB_File is a Perl5 access to Berkeley DB version 1.x. SYNOPSIS use DB_File; [$X =] tie %hash, DB_File, [$filename, $flags, $mode, $DB_HASH] ; [$X =] tie %hash, DB_File, $filename, $flags, $mode, $DB_BTREE ; [$X =] tie @array, DB_File, $filename, $flags, $mode, $DB_RECNO ; $status =... Platforms: *nix

Tree::Binary is a Object Oriented Binary Tree for Perl. SYNOPSIS use Tree::Binary; # a tree representaion of the expression: # ((2 + 2) * (4 + 5)) my $btree = Tree::Binary->new("*") ->setLeft( Tree::Binary->new("+") ->setLeft(Tree::Binary->new("2")) ->setRight(Tree::Binary->new("2"))... Platforms: *nix

CrissCross is a small cross-platform C++ library for threading, console and file I/O, CPU identification (CPUID), and sockets (TCP and UDP). The main goal is to provide the ability to write a program using identical calls on the major platforms (Windows, Linux, FreeBSD, OpenBSD, NetBSD, and Mac... Platforms: *nix

Pogo is a Perl interface for GOODS. SYNOPSIS use Pogo; $pogo = new Pogo sample.cfg; # connect to a database $root = $pogo->root_tie; # get a reference to root hash in the database $root->{key1} = "string"; # store a string into the database $value = $root->{key1}; # $value is "string"... Platforms: *nix

B::Tree is a simplified version of B::Graph for demonstration. SYNOPSIS perl -MO=Tree program | dot -Tps > tree.ps This is a very cut-down version of B::Graph; it generates minimalist tree graphs of the op tree of a Perl program, merely connecting the op nodes and labelling each node with... Platforms: *nix

Tree::Binary::Search is a binary search tree for Perl. SYNOPSIS use Tree::Binary::Search; my $btree = Tree::Binary::Search->new(); $btree->useNumericComparison(); $btree->insert(5 => "Five"); $btree->insert(2 => "Two"); $btree->insert(1 => "One"); $btree->insert(3 => "Three");... Platforms: *nix

Tie::Array::QueueExpire is a Perl module that requires Time::HiRes, TokyoCabinet (database and perl module.) The insertion is ms unique ( 0.001 seconds ). The normal ARRAY function present are push pop shift exits scalar clear unshift (but put data 1 second before the first entry) The... Platforms: *nix