Re: Ternary Search Trees
- From: Dodgy <Dodgy@xxxxxxxxxxxxxxxxxxxxx>
- Date: Thu, 24 Aug 2006 10:45:39 +0100
On 23 Aug 2006 16:14:56 -0700, "Waverly" <mr.waverlye@xxxxxxxxxxx>
waffled on about something:
Has anyone developed code for a ternary search tree?
I've been looking at this article on Dr. Dobbj Journal
Subject: Ternary Search Trees
http://www.ddj.com/184410528
and thought to conert it it but I thought since PASCAL type are
different than C style strings there may be a better way to implement
the code.
Any thoughts on this,
I knew I shouldn't have looked... I forgot how much C++ hurts my eyes!
I did a quick google, and found this...
http://rmarshsj.f2s.com/rob/2001/06/18/maps-generic-associative-containers/
Which according to the entry in Delphipages
"Currently the Maps Library contains TListMap (doubly linked list),
TArrayMap, THATMap (hashed array tree), THashMap (hash table with
chaining), TTreeMap (pseudo-random binary tree), TTreapMap (treap),
TSplayMap (self-adjusting splay tree), TAVLMap (height balanced binary
tree), and TTSTMap (ternary search tree)."
The author does say that the library only supports up to D5, but as
it's just a collection of .pas files, and not a full blown component,
I don't think you'd have many problems using it with a later version.
Any good?
Dodgy.
--
MUSHROOMS ARE THE OPIATE OF THE MOOSES
.
- Follow-Ups:
- Re: Ternary Search Trees
- From: Waverly
- Re: Ternary Search Trees
- References:
- Ternary Search Trees
- From: Waverly
- Ternary Search Trees
- Prev by Date: Ternary Search Trees
- Next by Date: Delphi weird behavior
- Previous by thread: Ternary Search Trees
- Next by thread: Re: Ternary Search Trees
- Index(es):
Relevant Pages
|
