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=-1.9 required=5.0 tests=BAYES_00 autolearn=unavailable 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: Ada package registry? Date: Fri, 5 Feb 2016 14:27:35 +0100 Organization: Aioe.org NNTP Server Message-ID: References: <02241ec4-0f95-4f63-9abc-092f167eb59e@googlegroups.com> <56af17b7$0$301$14726298@news.sunsite.dk> <56b06eb8$0$301$14726298@news.sunsite.dk> <1454483747.2785.135.camel@obry.net> NNTP-Posting-Host: bqgfK7NL3xTHnr0WRaLl4g.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 7bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:38.0) Gecko/20100101 Thunderbird/38.5.1 X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:29358 Date: 2016-02-05T14:27:35+01:00 List-Id: On 05/02/2016 13:54, G.B. wrote: > Using a relational DBMS with competitive Ada could like this: > > with Ada.ODBC; > > and since SQL knows cursors, the Ada type system could provide > for a corresponding standard Cursor type, etc. No, it cannot. Cursor in ODBC is invisible, which is a source of countless errors because operations implicitly create, remove, change the cursor. But other types, environment, connection, statement are Ada controlled types in the ODBC bindings. See: http://www.dmitry-kazakov.de/ada/components.htm#ODBC_Bindings > Also, SQL-invoked routines should be dead easy to write in Ada > using just the language and library of Ada. You mean RA, stored procedures or statement execution? In all cases you need bind parameters, fetch results. That requires conversions Ada type <-> ODBC type <-> DB type. A native RA implementation would make things easier, though not easy because Ada lack important features to implement RA. Furthermore Ada lacks constructs to express transactions. So no, it is not dead easy. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de