From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 Path: border1.nntp.dca3.giganews.com!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!goblin2!goblin.stu.neva.ru!feeder.erje.net!eu.feeder.erje.net!newsfeed.datemas.de!rt.uk.eu.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Multiple keys for a map Date: Tue, 17 Sep 2013 18:52:37 +0200 Organization: cbb software GmbH Message-ID: <3al7xx87ldc3.67wd6mjqten8.dlg@40tude.net> References: <4f66d847-d030-4aa9-8bdf-9bcc5f3a0852@googlegroups.com> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: XCN1bGU60KrUQBjZdeal8w.user.speranza.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: 40tude_Dialog/2.0.15.1 X-Notice: Filtered by postfilter v. 0.8.2 X-Original-Bytes: 1387 Xref: number.nntp.dca.giganews.com comp.lang.ada:183371 Date: 2013-09-17T18:52:37+02:00 List-Id: 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