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!gegeweb.org!news.ecp.fr!news.jacob-sparre.dk!loke.jacob-sparre.dk!pnx.dk!.POSTED!not-for-mail From: Jacob Sparre Andersen Newsgroups: comp.lang.ada Subject: Re: Everything You Know Is Wrong Date: Mon, 29 Feb 2016 13:27:36 +0100 Organization: JSA Research & Innovation Message-ID: <87povfpupz.fsf@adaheads.sparre-andersen.dk> References: NNTP-Posting-Host: 109.59.86.56.mobile.3.dk Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: loke.gir.dk 1456748856 5013 109.59.86.56 (29 Feb 2016 12:27:36 GMT) X-Complaints-To: news@jacob-sparre.dk NNTP-Posting-Date: Mon, 29 Feb 2016 12:27:36 +0000 (UTC) User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/23.4 (gnu/linux) Cancel-Lock: sha1:FmzJNNUsjiQkMTKjOKDegFpCNfM= Xref: news.eternal-september.org comp.lang.ada:29623 Date: 2016-02-29T13:27:36+01:00 List-Id: Jeffrey R. Carter wrote: > People will no doubt still want a hierarchical naming system for data > stored in that memory, but presumably S/W will map variables onto > these "files". So instead of the current "open, loop over > read/modify/write, close" paradigm, we might have something like > > type R is record ... > > type L is array (Positive range <>) of R; > > F: mapped L with File_Name => "name"; > > All_Records : for I in F'range loop -- or "of F" > > where the bounds of F will be determined from "name". A mechanism will > be needed for collections of heterogenous data as well. F would be > equivalent to a Direct_IO file with in-out mode. > > I would think that the Ada 2X project should be thinking about these > things, and wonder what others here think about them. I think it looks somewhat similar to some of my experiments on simplified persistence in Ada: http://www.jacob-sparre.dk/persistence/ae2010-slides.pdf http://www.jacob-sparre.dk/programming/persistent_containers-2015-paper.pdf Considering the difficulties of implementing persistence in a simple way with a library, I think it is worthwhile experimenting with something like this - and considering it for the next major revision of Ada. Greetings, Jacob -- "Get rid of the mess with the species" Ken Haste Andersen