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

From: Georg Bauhaus (sb463ba_at_l1-hrz.uni-duisburg.de)
Date: 09/24/04 

Date: Fri, 24 Sep 2004 09:50:53 +0000 (UTC)

Kevin Cline <kevin.cline@gmail.com> wrote:
: Are you really claiming that you can think of:
:
: procedure Insert (Word : in String) is
:
: procedure Increment_Count
: (K : in String;
: N : in out Natural) is
:
: pragma Warnings (Off, K);
: begin
: N := N + 1;
: end Increment_Count;
:
: C : Wordcount_Maps.Cursor;
: B : Boolean;
:
: begin -- Insert
: Insert (M, Word, 0, C, B);
: Update_Element (C, Increment_Count'Access);
: end Insert;
:
: As quickly as I can think of:
: ++concordance[word]
: or
: ++$count{$word} ?

Isn't the comparison at different levels? AI 302 is to be minimal, I think,
in that every convenient operation can be built from thingies present in
Ada.Containers.

 
: Multiply this 1000 times for a medium to large program and I think Ada
: really suffer from unnecessary verbosity.

Are you saying that Ada programmers automatically don't make reusable
procudures and instead will repeat a procedure with the effect of ++ all
over the place?

-- Georg

Relevant Pages

  • Re: Katie Hopkins
    ... significance of those coloured bits of string yet, have you, eh? ... What with you claiming to know all about it, ... For whatever reason. ... You're the one who's always having the sly digs, ...
    (uk.media.tv.misc)
  • Re: Katie Hopkins
    ... significance of those coloured bits of string yet, have you, eh? ... What with you claiming to know all about it, ... For whatever reason. ... You're the one who's always having the sly digs, ...
    (uk.media.tv.misc)
  • Re: Katie Hopkins
    ... significance of those coloured bits of string yet, have you, eh? ... What with you claiming to know all about it, ... For whatever reason. ... Jeff ...
    (uk.media.tv.misc)
  • Re: Uncomputable numbers are all in your head
    ... have read on the posts people claiming that a denumerable infinite ... The correct theorem is that the set of infinite binary strings is ... that an infinite string is a natural number. ...
    (sci.logic)
  • Re: Ant setting property by regexp substitution on an existing property
    ... kevin cline wrote: ... makefile. ... method project.setProperty(String name, String value). ... ruby), groovy, beanshell, javascript(rhino from Mozilla) ...
    (comp.lang.java.programmer)