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: Unbounded strings (Was: Java vs Ada 95 (Was Re: Once again,
 Ada absent from DoD SBIR solicitation))
Date: 1996/11/27
Message-ID: <dewar.849074720@merv>#1/1
X-Deja-AN: 201016923
references: <325BC3B3.41C6@hso.link.com> <dewar.848202876@merv>
 <E11C57.EF2@world.std.com> <dewar.848352010@merv> <E14DCH.5EK@world.std.com>
 <dewar.848758301@merv> <3299FD97.6A0B@watson.ibm.com>
organization: New York University
newsgroups: comp.lang.ada
Date: 1996-11-27T00:00:00+00:00
List-Id: <comp.lang.ada>


Norman says

"What I would find friendliest is a run-time system with two versions of
Ada.Strings.Unbounded.  The version that uses reference counts but no
locks would only be linked in when I said
"


But the locks don't cost anything significant if no tasking is active,
at least this is true in the GNAT runtime (see the implementation of
System.Tasking_Soft_Links.