Re: Ada Popularity: Comparison of Ada/Charles with C++ STL (and Perl)

[mheaney@on2.com (Matthew Heaney)]

Martin Krischik <krischik@users.sourceforge.net> wrote in message news:<1777528.JKnUEYTOM6@linux1.krischik.com>...
> 
> Which shows that the "1 instantiation only"  argument of Charles and
> Ada.Containers is misguided. So think I stick with the Booch Components
> even after Ada 2005.

I haven't seen Simon's wordcount code in a while (probably not since
Simon and I met in Vienna), but I suspect we're comparing apples and
oranges here.

Simon probably used the BC set, which stores each element with a
count.  In Charles and AI-302, the container model is a little
different, and you would use a map instead, with the word as the map
key and the frequency count as the map element.

So it would not surprise me if the wordcount problem has slightly
fewer lines of code using the BC set than using the AI-302 map, since
in the former case you're using what is essentially a special purpose
container.

Someone needs to make a feature-by-feature comparison of Simon's BC
solution and the AI-302 solution I just posted.  (I don't have time
right now since I'm too busy incorporating the Madison changes.)  Note
that the example I posted does a lot of extra stuff to illustrate API
features, extra stuff that isn't strictly necessary to solve the
wordcount problem.  If the unnecessary stuff were removed, then the
comparison between BC and AI-302 solutions would be more realistic.


> When we at it: I still have the "indefinite extension" within AdaCL.
> Howabout joining them?

All the containers in AI-302 have variants that support indefinite
keys and indefinite elements.  (All of the containers are now publicly
taggged, too.)

If AI-302 doesn't meet your needs, then you need to let us know. 
Please peruse the a-c*.ad[sb] sources at the tigris website.  (Note
that I'm still incorporating changes from the most recent ARG
meeting.)

-Matt