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: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!mx02.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: GNAT GPL is not shareware Date: Mon, 12 Jan 2015 16:22:00 +0100 Organization: cbb software GmbH Message-ID: <1383u2ymnsw8f.ar3a4tz8vq1e.dlg@40tude.net> References: <87bnmetex4.fsf@ludovic-brenta.org> <1otenmcbgnvlt$.dn9361nl2jm8$.dlg@40tude.net> <8ryfky4awox2$.q2gfw4pvsgau.dlg@40tude.net> Reply-To: mailbox@dmitry-kazakov.de NNTP-Posting-Host: YGNMlxhiQ90vAyH0QA4qPw.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 Xref: news.eternal-september.org comp.lang.ada:24551 Date: 2015-01-12T16:22:00+01:00 List-Id: On Mon, 12 Jan 2015 15:52:35 +0100, G.B. wrote: > On 12.01.15 14:21, Dmitry A. Kazakov wrote: >> On Mon, 12 Jan 2015 12:40:50 +0100, G.B. wrote: >> >>> On 10.01.15 08:18, Dmitry A. Kazakov wrote: >>>> Just because RDBMS uses RA for dealing with persistency problems. >>> >>> Persistence typically is just one of the goals when using a DB. >> >> Other goals, like money extortion, you mean? > > A DB is good for independent information retrieval, > in particular when it is part of a PL: All reentrant containers are. > Clients then need not buy or order special information > retrieval programs given all these non-standard databases. > A clear advantage, IMO. Advantage over what? > Tiny example: > .ali files of GNAT and the ./info files of AdaMagic may > (theoretically) share a schema of Ada library data, > data available on request, leaving hardly any performance hit. Which has nothing to do with RA. >> And it would be a lie to say that SQL were any >> declarative. > > SQL is not *any* declarative? Do you mean "not *all* declarative"? As declarative as C. >> Nobody would seriously consider this >> for universal purpose programming, except for pointy-haired academics. > > So what? No need to have relational models replace everything! In order to become mainstream you have to. > That's a straw man. When RA is just made available as part > of a general purpose PL's definition, that's a good start. No. A programming language should be capable of designing a decent container library. There is nothing in RA beyond being a specialized class of containers. Built-in containers is a mistake. Modern languages have no built-in containers except for record and array types. > In fact, with either built-in relation support or Ada.Containers, > a typical algorithm like > "Find all friends of distance <= 2." > > might look almost the same no matter whether, say, pairs would > be stored in a container table or in a relational table. Which would be horrific O(n) in RA. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de