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: dewar@merv.cs.nyu.edu (Robert Dewar)
Subject: Re: Java vs Ada 95 (Was Re: Once again,
 Ada absent from DoD SBIR solicitation)
Date: 1996/11/02
Message-ID: <dewar.846953187@merv>#1/1
X-Deja-AN: 194082161
references: <325BC3B3.41C6@hso.link.com>
 <Dz2B9H.9HD.0.-s@inmet.camb.inmet.com>
 	<ROGOFF.96Oct10095045@sccm.Stanford.EDU> <325D7F9B.2A8B@gte.net>
 	<JSA.96Oct11152501@alexandria> <325FF8D0.6660@io.com>
 	<dewar.845162841@merv> <JSA.96Oct14172050@alexandria>
 	<dewar.845340573@merv> <EACHUS.96Oct15141831@spectre.mitre.org>
 	<554c5d$4ag@nntpa.cb.lucent.com> <32776D5D.5768@gsfc.nasa.gov>
 	<JSA.96Oct31145647@alexandria> <EACHUS.96Nov1103759@spectre.mitre.org>
organization: New York University
newsgroups: comp.lang.ada
Date: 1996-11-02T00:00:00+00:00
List-Id: <comp.lang.ada>


Robert Eachus said

"    Yes, an implementation of Unbounded_String which uses reference
counts and lazy copying would work much better in this case."

Be careful about casually suggesting reference counts. They are potentially
VERY expensive in a tasking context where taking a lock for incrementing
a reference count requires a system call.