Re: Ada 2005 presentation at Ada-Belgium event now on-line

[martin.dowie@btopenworld.com (Martin Dowie)]

tmoran@acm.org wrote in message news:<QxUlc.23908$_41.1696225@attbi_s02>...
> The "tree structured directories" addressed by Ada.Directories are on
> their way out.  Under Windows, for instance, there's a separate directory
> called the Registry (which I understand will disappear in the next major
> release) and there is a (rarely used) additional directory level called
> file resource forks.  It doesn't appear that Ada.Directories applies to
> either of those.  It's also become rather obvious that objects need to be
> "filed" in multiple ways; a single tree is inadequate.  The next version
> of Windows is supposed to address this issue (searching?  relational
> database?).  Ada.Directories will nicely standardize the multiple
> incompatible directory operations packages of today, but that part of
> Ada05 will become obsolete not long after introduction.  IMHO

For Windows probably "yes" and you always have Claw.Registry to use in
that case but for the bulk of embedded work this package will do
nicely. I'm guessing the same is true for Linux/Un*x/VMS but I don't
even have an Ada95 compiler for these.

Just a thought - I don't know the Windows Registry at all but from
what I've seen it is itself a tree structure. Could an implementation
of Ada.Directories (and I guess Ada.Text_IO) wrap the calls to
Claw.Registry? i.e. use A.D to traverse the Registry and A.T to
read/write actual values?

-- Martin