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=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,3cc61b675eac7c7a X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Received: by 10.68.75.170 with SMTP id d10mr7664906pbw.6.1327825568752; Sun, 29 Jan 2012 00:26:08 -0800 (PST) Path: lh20ni236697pbb.0!nntp.google.com!news1.google.com!news.glorb.com!feeder.erje.net!eternal-september.org!feeder.eternal-september.org!mx04.eternal-september.org!.POSTED!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: Ada as glue ? logical approach ? Date: Sun, 29 Jan 2012 08:26:07 +0000 Organization: A noiseless patient Spider Message-ID: References: <9e698480-636a-419f-9b50-400b322de8d4@dp8g2000vbb.googlegroups.com> Mime-Version: 1.0 Injection-Info: mx04.eternal-september.org; posting-host="dFCm8HWntFqmDIilBLqEJQ"; logging-data="30122"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+7VQvgl7nYN9A9+gbH1sFUltpo8X+Z0w8=" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/23.3 (darwin) Cancel-Lock: sha1:vtH7pxpET+InVXApUM49n+S366s= sha1:Hn4EQfmpQ3PCz2s6SlcOpLdt4Zo= Content-Type: text/plain; charset=us-ascii Date: 2012-01-29T08:26:07+00:00 List-Id: Patrick writes: > I have been studying ada for sometime now but I have no experience > coding with it. Get coding then! It won't hurt (much). > Someone could write a full binding for a library but could someone > also not just use the import pragma to "grab onto" the existing C > library APIs? > > This would be a bit like ctypes in Python correct ? Are other list > members writing their own 'as needed' partial bindings? Is this a > logical approach? -Patrick Quite a few of the "full bindings" are in fact partial; there's often a lot of the full API that isn't immediately necessary. For example, in my Ada 2005 Math Extensions[1], I didn't bother with the parts of LAPACK and BLAS that deal with matrices of special forms, for example an "upper Hessenberg", whatever that is (see [2] Table 2.1 for the full set). [1] https://sourceforge.net/projects/gnat-math-extn/ [2] http://www.netlib.org/lapack/lug/node24.html