Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!rutgers!uwvax!husc6!ut-sally!turpin
From: turpin@ut-sally.UUCP
Newsgroups: comp.sys.ibm.pc,comp.sources.wanted
Subject: Request for B-tree procedures in Pascal (or C)
Message-ID: <7444@ut-sally.UUCP>
Date: Wed, 11-Mar-87 19:39:39 EST
Article-I.D.: ut-sally.7444
Posted: Wed Mar 11 19:39:39 1987
Date-Received: Fri, 13-Mar-87 01:33:57 EST
Distribution: na
Organization: U. Texas CS Dept., Austin, Texas
Lines: 15
Keywords: B-tree, Pascal
Xref: utgpu comp.sys.ibm.pc:2267 comp.sources.wanted:728

I am looking for a B-tree processor written in fairly standard
Pascal. (Possible port to non-pc's in the future. This is why
TurboToolbox is unacceptable.) Desired features are:

  o  Multiple indices.
  o  Variable length keys.

A C package is a less desired but possible alternative.

The package does not necessarily need to be public-domain. (We
are willing to pay some money for it.)

Thanks ahead of time for your help.

Russell (turpin@sally.ARPA)