From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: Multiple keys for a map
Date: Tue, 17 Sep 2013 18:52:37 +0200
Date: 2013-09-17T18:52:37+02:00 [thread overview]
Message-ID: <3al7xx87ldc3.67wd6mjqten8.dlg@40tude.net> (raw)
In-Reply-To: 4f66d847-d030-4aa9-8bdf-9bcc5f3a0852@googlegroups.com
On Tue, 17 Sep 2013 07:51:24 -0700 (PDT), Peter Brooks wrote:
> I know that maps in Containers.Hashed_Maps and Containers.Ordered_Map are designed as single-key look-up tables.
[...]
> Any suggestions?
It looks like a relational table of three columns.
Maps can be used to index such a table, or red-black trees, or whatever.
You could also take an existing light-weight RDBMS, e.g. SQLite3 or
Berkeley DB. There exist many Ada bindings to SQLite3.
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
next prev parent reply other threads:[~2013-09-17 16:52 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
2013-09-17 14:51 Multiple keys for a map Peter Brooks
2013-09-17 16:52 ` Dmitry A. Kazakov [this message]
2013-09-17 17:49 ` Peter Brooks
2013-09-18 7:22 ` Dmitry A. Kazakov
2013-09-18 9:34 ` Peter Brooks
2013-09-17 18:57 ` gautier_niouzes
2013-09-17 19:20 ` Peter Brooks
2013-09-18 5:19 ` Shark8
2013-09-18 5:44 ` Peter Brooks
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox