From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-0.9 required=3.0 tests=BAYES_00,FROM_ADDR_WS
	autolearn=no autolearn_force=no version=3.4.5-pre1
Date: 19 Jan 93 22:51:27 GMT
From: news.uiowa.edu!news@uunet.uu.net  (Douglas W. Jones,201H MLH,3193350740,3
193382879)
Subject: Re: Wanted: Ada B+tree (in memory) pkg
Message-ID: <1993Jan19.225127.9792@news.uiowa.edu>
List-Id: <comp.lang.ada>

>>From article <1993Jan19.154259.1@sep.vitro.com>,
by kkelley@vitro.com (K. A. Kelley):
> Does anybody out there have available a memory-efficient B+-tree package in
> Ada (for memory, not files)?

I can give you a splay-tree package in Ada, and that's not a bad way to
arrange lexicographic trees.  They're binary instead of n-ary, but for
most purposes, the particular tree organization in memory isn't as
important as the set of operations it supports and the run-time for
those operations.  Splay-trees are very good on both counts.

					Doug Jones
					jones@cs.uiowa.edu