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=0.6 required=5.0 tests=BAYES_00,TO_NO_BRKTS_FROM_MSSP autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,842accb6a7d76669 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-11-11 21:33:21 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!nntp-relay.ihug.net!ihug.co.nz!out.nntp.be!propagator-SanJose!in.nntp.be!newsranger.com!www.newsranger.com!not-for-mail Newsgroups: comp.lang.ada From: Ted Dennison References: <3BE301D1.4010106@telepath.com> <3BE7DA00.8020807@acm.org> <9sdojl$e6h$1@news.huji.ac.il> <3BEACA5A.9030100@acm.org> <20TG7.18929$xS6.30469@www.newsranger.com> <9sh49o$ohc$1@nh.pace.co.uk> <3BEC9207.5070309@telepath.com> <3BECA6F9.B317CB11@acm.org> Subject: Re: List container strawman 1.1 Message-ID: X-Abuse-Info: When contacting newsranger.com regarding abuse please X-Abuse-Info: forward the entire news article including headers or X-Abuse-Info: else we will not be able to process your request X-Complaints-To: abuse@newsranger.com NNTP-Posting-Date: Mon, 12 Nov 2001 00:33:18 EST Organization: http://www.newsranger.com Date: Mon, 12 Nov 2001 05:33:18 GMT Xref: archiver1.google.com comp.lang.ada:16316 Date: 2001-11-12T05:33:18+00:00 List-Id: In article , Simon Wright says... > >Jeffrey Carter writes: >> I think I used "unacceptable" to refer to the several hours of study >> you said was necessary to learn to instantiate a simple data >> structure. Multiple instantiations are undesirable, but multiple >> instantiations that take hours to learn to use unacceptable. > >I think it only takes hours the first time (and without any help). Right. Back when I had to figure it out, there weren't really any docs. So that really describes the process if you are just looking at the sources to try to figure it out. I haven't looked at what docs there are now. I'm not "newbie" enough with it any more to judge how tough it would be to figure out that way anyway. Since I ended up using similiar mechanisms in OpenToken, I made sure that every version came with a rather extensive user guide with examples for using just about every package. That approach seems to have worked fairly well, but I haven't really got many reports from folks using the more complicated parsing features, so I don't know. --- T.E.D. homepage - http://www.telepath.com/dennison/Ted/TED.html No trees were killed in the sending of this message. However a large number of electrons were terribly inconvenienced.