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,3ccb707f4c91a5f2
X-Google-Attributes: gid103376,public
From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Java vs Ada 95 (Was Re: Once again,
 Ada absent from DoD SBIR solicitation)
Date: 1996/11/01
Message-ID: <E07Dwq.5L@world.std.com>#1/1
X-Deja-AN: 193813772
references: <325BC3B3.41C6@hso.link.com> <32776D5D.5768@gsfc.nasa.gov>
 <JSA.96Oct31145647@alexandria> <EACHUS.96Nov1103759@spectre.mitre.org>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-11-01T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <EACHUS.96Nov1103759@spectre.mitre.org>,
Robert I. Eachus <eachus@spectre.mitre.org> wrote:
>    Yes, an implementation of Unbounded_String which uses reference
>counts and lazy copying would work much better in this case.  It is a
>perfectly legal and reasonable implementation of Unbounded_String, and
>it looks like it would take a day or two to gin up.  The question is
>whether it would be a global win, or just specific to some cases.  My
>guess is that it is a net win in general, but only a few percent. I
>may try it, but not this week.

Note that in Ada, or any language with tasking, the reference count
updates have to do locking in general, which might be rather expensive.

- Bob