Strings Fixed, Bounded, and Counted. Performance Inquiry.

[Freejack <user@nospam.net>]

I'm currently tooling around with the various standard strings packages
And I began wondering if anyone has written a Counted strings package
for Ada.

Fixed strings are great in terms of performance. Bounded strings are
pretty good. However I havent seen anyone do a performance analysis of
Counted strings. I'm thinking in the Forth sense of the type.

i.e. The first element of the String is a number indicating the length of
the string. No null terminators needed. 
A bit more flexible than Fixed strings, a heck of a lot faster than Null 
terminated strings. Not sure how they stack up to Bounded strings.

Has anyone played with these in an Ada context?

I'm gonna write my own experimental package if nobody else has

Freejack