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.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,399666c22a39304c X-Google-Attributes: gid103376,public From: dweller@dfw.net (David Weller) Subject: Re: Translate this into Ada ... Date: 1996/08/21 Message-ID: <4vf26s$h4m@dfw.dfw.net>#1/1 X-Deja-AN: 175579965 references: <3219E6E2.2F5@eurocontrol.fr> organization: DFWNet -- Public Internet Access newsgroups: comp.lang.ada Date: 1996-08-21T00:00:00+00:00 List-Id: In article <3219E6E2.2F5@eurocontrol.fr>, Richard Irvine wrote: >How using generics, abstract types (e.g. AbstractList and >AbstractIterator), >abstract subprograms or any other Ada features can this decision be >expressed? > >I have struggled with this for quite some time without finding a >satisfactory >solution. Any suggestions gratefully received. Take a look at the sources for the Ada 95 Booch Conponents at http://www.ocsystems.com/booch. I know the existing material there is out of date, and there will be an update in about a month (promise!), but it can give you an idea on how to approach the problem. Your approach seems similar to the approach used for the C++ STL, which is OK, but the Booch Components will give you a different feel for the implementation of iterators. -- Visit the Ada 95 Booch Components Homepage: www.ocsystems.com/booch This is not your father's Ada -- lglwww.epfl.ch/Ada