From: Jeffrey Carter <spam.jrcarter.not@spam.not.acm.org>
Subject: Re: B-Tree v Skip-List Insertion Benchmark
Date: Thu, 18 Sep 2014 10:39:13 -0700
Date: 2014-09-18T10:39:13-07:00 [thread overview]
Message-ID: <lvf5c1$iau$1@dont-email.me> (raw)
In-Reply-To: <1x1p8c1ys7ely$.d0rvczpoa0kb$.dlg@40tude.net>
One comment on Generic_B_Tree: O(log N)-searchable structures are commonly used
as maps, sets, and priority queues. The interface of Generic_B_Tree seems skewed
towards use as a map; for the other uses the client must supply a dummy Value
parameter. It might be better to have a more general B-tree pkg, and, if
desired, build a more specific map interface on top of that.
PragmARC.Skip_List_Unbounded takes the opposite approach, providing a general
interface and presuming that the client knows how to use it to implement a map.
Ada.Containers provides the specific interfaces (Ordered_Maps and such) but does
not provide the underlying data structure.
--
Jeff Carter
"From this day on, the official language of San Marcos will be Swedish."
Bananas
28
prev parent reply other threads:[~2014-09-18 17:39 UTC|newest]
Thread overview: 7+ messages / expand[flat|nested] mbox.gz Atom feed top
2014-09-18 1:15 B-Tree v Skip-List Insertion Benchmark Jeffrey Carter
2014-09-18 7:41 ` Dmitry A. Kazakov
2014-09-18 16:53 ` Jeffrey Carter
2014-09-18 17:54 ` Dmitry A. Kazakov
2014-09-18 19:33 ` Jeffrey Carter
2014-09-18 20:31 ` Dmitry A. Kazakov
2014-09-18 17:39 ` Jeffrey Carter [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox