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,XPRIO
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,e6c9800e35ccfeee,start
X-Google-Attributes: gid103376,public
From: Jakob Heinemann <jakob.heinemann@ericsson.com>
Subject: GNAT: Performance of String functions
Date: 1997/07/18
Message-ID: <33CF3908.3DF62EEE@ericsson.com>#1/1
X-Deja-AN: 257574631
X-Priority: 3 (Normal)
Organization: Ericsson Saab Avionics AB
Newsgroups: comp.lang.ada
Date: 1997-07-18T00:00:00+00:00
List-Id: <comp.lang.ada>


Hello Gnaters.

I wonder if there exist some data concerning speed issuses 
on different types of string handling. To be specific what
type och string mechanism is considered fastest and how big
is the difference between strings, bounded strings an unbounded
strings? Speed measurement in comparing two strings, passing
as a parameter, passing as a parameter to procedure in another
package. 

I'm running GNAT 3.09 on a Sun Sparc Ultra 1 with Solaris 2.5.
I'm using unbounded strings and I'm comparing a lot. In fact
I have an equvalent program running the same algoritm in VAX
Pascal, and on the VAX the program runs about ten times faster.
Can I expect a dramatic speed improvement if I use another
string concept or is GNAT just slow?

Hope someone can help me with this question

/Jakob

PS: Please maka a CC: to me.

mailto:Jakob.Heinemann@ericsson.com
ESB
Linkoping, Sweden