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!.POSTED!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: Why .ads as well as .adb? Date: Sun, 09 Jun 2019 22:37:48 +0100 Organization: A noiseless patient Spider Message-ID: References: <28facad3-c55f-4ef2-8ef8-004925b7d1f1@googlegroups.com> <87woi0xtwm.fsf@nightsong.com> <4a0438de-1f1d-4469-aae4-908854d378ea@googlegroups.com> <47d02bdc-6b50-43aa-bc5d-bb5b6225f5bd@googlegroups.com> <455333f0-ede4-4833-900a-240a499395ac@googlegroups.com> <875zphvufc.fsf@nightsong.com> <87y32bvbeo.fsf@nightsong.com> <561c766c-4f9c-432c-be9b-822dd9c3c8ba@googlegroups.com> Mime-Version: 1.0 Content-Type: text/plain Injection-Info: reader02.eternal-september.org; posting-host="3e438aecc7ec2617a1943fa0a92891b0"; logging-data="12587"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/i9lBPWuUF7pm4/NkQ08AH3kWt2JSD040=" User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/26.1 (darwin) Cancel-Lock: sha1:wImStsxY8UDzY+tm+7oj1ImxjHY= sha1:3OyjwlSR1ERrM+8tvnx2BzG3BI0= Xref: reader01.eternal-september.org comp.lang.ada:56589 Date: 2019-06-09T22:37:48+01:00 List-Id: John Perry writes: > When I want to know how Ada.Text_IO works, I don't look up the > specification file. I don't even know where to find Ada.Text_IO on my > system. I just went to look for it, and gave up pretty quickly. I > could probably find it if I tried hard enough, but it's far more > convenient to visit [1], which has a hyperlink to Ada.Text_IO, as well > as lots of other things. > > I imagine that [1] was generated by some software tool. But not from an implementation. It's a reference manual, after all, a specification, and it goes into much more detail than your example ... > Similar tools exist for other languages. Take a look at [2] to see > what a nice job they can do -- a LOT nicer than [1]. If I click on > BINARY_SEARCH_TREE, not only do I get the specification for > BINARY_SEARCH_TREE a la [1] ... well, I don't know Eiffel, so I can't really tell, but the first thing I see is description: "Binary search trees; left child item is less than current item, right child item is greater" and I ask myself, does this mean that there can't be equal elements in the tree? > [1] http://www.ada-auth.org/standards/12rm/html/RM-TOC.html This is the most up-to-date: http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-TOC.html > [2] https://www.eiffel.org/files/doc/static/19.05/libraries/base/index.html